KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > soot > javaToJimple > ClassLiteralChecker


1 /* Soot - a J*va Optimization Framework
2  * Copyright (C) 2004 Jennifer Lhotak
3  *
4  * This library is free software; you can redistribute it and/or
5  * modify it under the terms of the GNU Lesser General Public
6  * License as published by the Free Software Foundation; either
7  * version 2.1 of the License, or (at your option) any later version.
8  *
9  * This library is distributed in the hope that it will be useful,
10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12  * Lesser General Public License for more details.
13  *
14  * You should have received a copy of the GNU Lesser General Public
15  * License along with this library; if not, write to the
16  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17  * Boston, MA 02111-1307, USA.
18  */
19
20 package soot.javaToJimple;
21 import java.util.*;
22
23 public class ClassLiteralChecker extends polyglot.visit.NodeVisitor {
24
25     private ArrayList list;
26
27     public ArrayList getList() {
28         return list;
29     }
30
31     public ClassLiteralChecker(){
32         list = new ArrayList();
33     }
34
35     public polyglot.ast.Node override(polyglot.ast.Node parent, polyglot.ast.Node n){
36         if (n instanceof polyglot.ast.ClassDecl){
37             return n;
38         }
39         if ((n instanceof polyglot.ast.New) && (((polyglot.ast.New)n).anonType() != null)){
40             return n;
41         }
42         return null;
43     }
44     
45     public polyglot.visit.NodeVisitor enter(polyglot.ast.Node parent, polyglot.ast.Node n) {
46     
47         if (n instanceof polyglot.ast.ClassLit) {
48             polyglot.ast.ClassLit lit = (polyglot.ast.ClassLit)n;
49             // only find ones where type is not primitive
50 if (!lit.typeNode().type().isPrimitive()){
51                 list.add(n);
52             }
53         }
54         return enter(n);
55     }
56 }
57
Popular Tags