1 package Analysis.SSJava;
3 import java.util.HashSet;
4 import java.util.Hashtable;
5 import java.util.Iterator;
7 import java.util.Vector;
9 import IR.AnnotationDescriptor;
10 import IR.ClassDescriptor;
11 import IR.MethodDescriptor;
14 import IR.SymbolTable;
16 import IR.Tree.ArrayAccessNode;
17 import IR.Tree.ArrayInitializerNode;
18 import IR.Tree.AssignmentNode;
19 import IR.Tree.BlockExpressionNode;
20 import IR.Tree.BlockNode;
21 import IR.Tree.BlockStatementNode;
22 import IR.Tree.CastNode;
23 import IR.Tree.CreateObjectNode;
24 import IR.Tree.DeclarationNode;
25 import IR.Tree.ExpressionNode;
26 import IR.Tree.FieldAccessNode;
27 import IR.Tree.IfStatementNode;
28 import IR.Tree.InstanceOfNode;
30 import IR.Tree.LoopNode;
31 import IR.Tree.MethodInvokeNode;
32 import IR.Tree.OpNode;
33 import IR.Tree.ReturnNode;
34 import IR.Tree.SubBlockNode;
35 import IR.Tree.SwitchBlockNode;
36 import IR.Tree.SwitchStatementNode;
37 import IR.Tree.TertiaryNode;
40 public class MethodAnnotationCheck {
43 SSJavaAnalysis ssjava;
46 Set<MethodDescriptor> annotatedMDSet;
47 Hashtable<MethodDescriptor, Set<MethodDescriptor>> caller2calleeSet;
49 public MethodAnnotationCheck(SSJavaAnalysis ssjava, State state, TypeUtil tu) {
53 caller2calleeSet = new Hashtable<MethodDescriptor, Set<MethodDescriptor>>();
54 annotatedMDSet = new HashSet<MethodDescriptor>();
57 public void methodAnnoatationCheck() {
58 SymbolTable classtable = state.getClassSymbolTable();
59 HashSet toanalyze = new HashSet();
60 toanalyze.addAll(classtable.getValueSet());
61 toanalyze.addAll(state.getTaskSymbolTable().getValueSet());
62 while (!toanalyze.isEmpty()) {
63 Object obj = toanalyze.iterator().next();
64 ClassDescriptor cd = (ClassDescriptor) obj;
67 if (!cd.isInterface()) {
68 for (Iterator method_it = cd.getMethods(); method_it.hasNext();) {
69 MethodDescriptor md = (MethodDescriptor) method_it.next();
70 checkTrustworthyMethodAnnotation(md);
71 checkMethodBody(cd, md);
77 for (Iterator iterator = annotatedMDSet.iterator(); iterator.hasNext();) {
78 MethodDescriptor md = (MethodDescriptor) iterator.next();
79 ssjava.addAnnotationRequire(md);
82 Set<Pair> visited = new HashSet<Pair>();
83 Set<MethodDescriptor> tovisit = new HashSet<MethodDescriptor>();
84 tovisit.addAll(annotatedMDSet);
86 while (!tovisit.isEmpty()) {
87 MethodDescriptor callerMD = tovisit.iterator().next();
88 tovisit.remove(callerMD);
90 Set<MethodDescriptor> calleeSet = caller2calleeSet.get(callerMD);
91 if (calleeSet != null) {
92 for (Iterator iterator = calleeSet.iterator(); iterator.hasNext();) {
93 MethodDescriptor calleeMD = (MethodDescriptor) iterator.next();
94 Pair p = new Pair(callerMD, calleeMD);
95 if (!visited.contains(p)) {
98 if (!ssjava.isTrustMethod(calleeMD)) {
99 // if method is annotated as "TRUST", do not need to check for
100 // linear type & flow-down rule
101 tovisit.add(calleeMD);
103 Set<MethodDescriptor> possibleCalleeSet =
104 (Set<MethodDescriptor>) ssjava.getCallGraph().getMethods(calleeMD);
106 for (Iterator iterator2 = possibleCalleeSet.iterator(); iterator2.hasNext();) {
107 MethodDescriptor possibleCallee = (MethodDescriptor) iterator2.next();
109 if (!possibleCallee.isAbstract()) {
110 ssjava.addAnnotationRequire(possibleCallee);
111 tovisit.add(possibleCallee);
123 private void checkTrustworthyMethodAnnotation(MethodDescriptor md) {
124 // method annotation parsing
125 Vector<AnnotationDescriptor> methodAnnotations = md.getModifiers().getAnnotations();
126 if (methodAnnotations != null) {
127 for (int i = 0; i < methodAnnotations.size(); i++) {
128 AnnotationDescriptor an = methodAnnotations.elementAt(i);
129 if (an.getMarker().equals(ssjava.TRUST)) {
130 ssjava.addTrustMethod(md);
136 public void methodAnnoataionInheritanceCheck() {
137 // check If a method is annotated, any method that overrides it should
140 Set<MethodDescriptor> tovisit = new HashSet<MethodDescriptor>();
141 tovisit.addAll(ssjava.getAnnotationRequireSet());
143 while (!tovisit.isEmpty()) {
144 MethodDescriptor md = tovisit.iterator().next();
147 ClassDescriptor cd = md.getClassDesc();
149 Set subClassSet = tu.getSubClasses(cd);
150 if (subClassSet != null) {
151 for (Iterator iterator2 = subClassSet.iterator(); iterator2.hasNext();) {
152 ClassDescriptor subCD = (ClassDescriptor) iterator2.next();
153 Set possiblematches = subCD.getMethodTable().getSet(md.getSymbol());
154 for (Iterator methodit = possiblematches.iterator(); methodit.hasNext();) {
155 MethodDescriptor matchmd = (MethodDescriptor) methodit.next();
156 if (md.matches(matchmd)) {
157 if (matchmd.getClassDesc().equals(subCD)) {
158 ssjava.addAnnotationRequire(matchmd);
165 // need to check super classess if the current method is inherited from
166 // them, all of ancestor method should be annotated.
168 ClassDescriptor curClassDesc;
169 ClassDescriptor parentClassDesc = cd;
171 while (!parentClassDesc.getSymbol().equals("Object")) {
172 curClassDesc = parentClassDesc;
173 parentClassDesc = tu.getSuper(curClassDesc);
174 Set possiblematches = parentClassDesc.getMethodTable().getSet(md.getSymbol());
175 for (Iterator methodit = possiblematches.iterator(); methodit.hasNext();) {
176 MethodDescriptor matchmd = (MethodDescriptor) methodit.next();
177 if (md.matches(matchmd)) {
178 ssjava.addAnnotationRequire(matchmd);
183 Set<ClassDescriptor> superIFSet = tu.getSuperIFs(cd);
184 for (Iterator iterator = superIFSet.iterator(); iterator.hasNext();) {
185 ClassDescriptor parentInterface = (ClassDescriptor) iterator.next();
186 Set possiblematches = parentInterface.getMethodTable().getSet(md.getSymbol());
187 for (Iterator methodit = possiblematches.iterator(); methodit.hasNext();) {
188 MethodDescriptor matchmd = (MethodDescriptor) methodit.next();
189 if (md.matches(matchmd)) {
190 ssjava.addAnnotationRequire(matchmd);
199 private void checkMethodBody(ClassDescriptor cd, MethodDescriptor md) {
200 BlockNode bn = state.getMethodBody(md);
201 checkBlockNode(md, md.getParameterTable(), bn, false);
204 private void checkBlockNode(MethodDescriptor md, SymbolTable nametable, BlockNode bn, boolean flag) {
205 bn.getVarTable().setParent(nametable);
206 String label = bn.getLabel();
207 boolean isSSJavaLoop = flag;
208 if (label != null && label.equals(ssjava.SSJAVA)) {
210 throw new Error("Only outermost loop can be the self-stabilizing loop.");
212 annotatedMDSet.add(md);
217 for (int i = 0; i < bn.size(); i++) {
218 BlockStatementNode bsn = bn.get(i);
219 checkBlockStatementNode(md, bn.getVarTable(), bsn, isSSJavaLoop);
224 private void checkBlockStatementNode(MethodDescriptor md, SymbolTable nametable,
225 BlockStatementNode bsn, boolean flag) {
227 switch (bsn.kind()) {
228 case Kind.SubBlockNode:
229 checkSubBlockNode(md, nametable, (SubBlockNode) bsn, flag);
232 case Kind.BlockExpressionNode:
233 checkBlockExpressionNode(md, nametable, (BlockExpressionNode) bsn, flag);
236 case Kind.DeclarationNode:
237 checkDeclarationNode(md, nametable, (DeclarationNode) bsn, flag);
240 case Kind.IfStatementNode:
241 checkIfStatementNode(md, nametable, (IfStatementNode) bsn, flag);
245 checkLoopNode(md, nametable, (LoopNode) bsn, flag);
248 case Kind.ReturnNode:
249 checkReturnNode(md, nametable, (ReturnNode) bsn, flag);
252 case Kind.SwitchStatementNode:
253 checkSwitchStatementNode(md, nametable, (SwitchStatementNode) bsn, flag);
259 private void checkSwitchStatementNode(MethodDescriptor md, SymbolTable nametable,
260 SwitchStatementNode ssn, boolean flag) {
262 checkExpressionNode(md, nametable, ssn.getCondition(), flag);
264 BlockNode sbn = ssn.getSwitchBody();
265 for (int i = 0; i < sbn.size(); i++) {
266 checkBlockNode(md, nametable, ((SwitchBlockNode) sbn.get(i)).getSwitchBlockStatement(), flag);
271 private void checkDeclarationNode(MethodDescriptor md, SymbolTable nametable, DeclarationNode dn,
273 if (dn.getExpression() != null) {
274 checkExpressionNode(md, nametable, dn.getExpression(), flag);
278 private void checkReturnNode(MethodDescriptor md, SymbolTable nametable, ReturnNode rn,
280 if (rn.getReturnExpression() != null) {
281 if (md.getReturnType() != null) {
282 checkExpressionNode(md, nametable, rn.getReturnExpression(), flag);
287 private void checkLoopNode(MethodDescriptor md, SymbolTable nametable, LoopNode ln, boolean flag) {
288 if (ln.getType() == LoopNode.WHILELOOP || ln.getType() == LoopNode.DOWHILELOOP) {
289 checkExpressionNode(md, nametable, ln.getCondition(), flag);
290 checkBlockNode(md, nametable, ln.getBody(), flag);
293 /* Link in the initializer naming environment */
294 BlockNode bn = ln.getInitializer();
295 bn.getVarTable().setParent(nametable);
296 for (int i = 0; i < bn.size(); i++) {
297 BlockStatementNode bsn = bn.get(i);
298 checkBlockStatementNode(md, bn.getVarTable(), bsn, flag);
300 // check the condition
301 checkExpressionNode(md, bn.getVarTable(), ln.getCondition(), flag);
302 checkBlockNode(md, bn.getVarTable(), ln.getBody(), flag);
303 checkBlockNode(md, bn.getVarTable(), ln.getUpdate(), flag);
307 private void checkIfStatementNode(MethodDescriptor md, SymbolTable nametable,
308 IfStatementNode isn, boolean flag) {
309 checkExpressionNode(md, nametable, isn.getCondition(), flag);
310 checkBlockNode(md, nametable, isn.getTrueBlock(), flag);
311 if (isn.getFalseBlock() != null) {
312 checkBlockNode(md, nametable, isn.getFalseBlock(), flag);
316 private void checkSubBlockNode(MethodDescriptor md, SymbolTable nametable, SubBlockNode sbn,
318 checkBlockNode(md, nametable.getParent(), sbn.getBlockNode(), flag);
321 private void checkBlockExpressionNode(MethodDescriptor md, SymbolTable nametable,
322 BlockExpressionNode ben, boolean flag) {
323 checkExpressionNode(md, nametable, ben.getExpression(), flag);
326 private void checkExpressionNode(MethodDescriptor md, SymbolTable nametable, ExpressionNode en,
329 case Kind.AssignmentNode:
330 checkAssignmentNode(md, nametable, (AssignmentNode) en, flag);
334 checkCastNode(md, nametable, (CastNode) en, flag);
337 case Kind.CreateObjectNode:
338 checkCreateObjectNode(md, nametable, (CreateObjectNode) en, flag);
341 case Kind.FieldAccessNode:
342 checkFieldAccessNode(md, nametable, (FieldAccessNode) en, flag);
345 case Kind.ArrayAccessNode:
346 checkArrayAccessNode(md, nametable, (ArrayAccessNode) en, flag);
349 // case Kind.LiteralNode:
350 // checkLiteralNode(md, nametable, (LiteralNode) en, flag);
353 case Kind.MethodInvokeNode:
354 checkMethodInvokeNode(md, nametable, (MethodInvokeNode) en, flag);
357 // case Kind.NameNode:
358 // checkNameNode(md, nametable, (NameNode) en, flag);
362 checkOpNode(md, nametable, (OpNode) en, flag);
365 // case Kind.OffsetNode:
366 // checkOffsetNode(md, nametable, (OffsetNode) en, flag);
369 case Kind.TertiaryNode:
370 checkTertiaryNode(md, nametable, (TertiaryNode) en, flag);
373 case Kind.InstanceOfNode:
374 checkInstanceOfNode(md, nametable, (InstanceOfNode) en, flag);
377 case Kind.ArrayInitializerNode:
378 checkArrayInitializerNode(md, nametable, (ArrayInitializerNode) en, flag);
381 // case Kind.ClassTypeNode:
382 // checkClassTypeNode(md, nametable, (ClassTypeNode) en, flag);
387 private void checkArrayInitializerNode(MethodDescriptor md, SymbolTable nametable,
388 ArrayInitializerNode ain, boolean flag) {
390 for (int i = 0; i < ain.numVarInitializers(); ++i) {
391 checkExpressionNode(md, nametable, ain.getVarInitializer(i), flag);
396 private void checkInstanceOfNode(MethodDescriptor md, SymbolTable nametable, InstanceOfNode tn,
398 checkExpressionNode(md, nametable, tn.getExpr(), flag);
401 private void checkTertiaryNode(MethodDescriptor md, SymbolTable nametable, TertiaryNode tn,
403 checkExpressionNode(md, nametable, tn.getCond(), flag);
404 checkExpressionNode(md, nametable, tn.getTrueExpr(), flag);
405 checkExpressionNode(md, nametable, tn.getFalseExpr(), flag);
408 private void checkOpNode(MethodDescriptor md, SymbolTable nametable, OpNode on, boolean flag) {
410 checkExpressionNode(md, nametable, on.getLeft(), flag);
411 if (on.getRight() != null) {
412 checkExpressionNode(md, nametable, on.getRight(), flag);
417 private void checkMethodInvokeNode(MethodDescriptor md, SymbolTable nametable,
418 MethodInvokeNode min, boolean flag) {
419 for (int i = 0; i < min.numArgs(); i++) {
420 ExpressionNode en = min.getArg(i);
421 checkExpressionNode(md, nametable, en, flag);
424 if (min.getExpression() != null) {
425 checkExpressionNode(md, nametable, min.getExpression(), flag);
429 annotatedMDSet.add(min.getMethod());
432 Set<MethodDescriptor> mdSet = caller2calleeSet.get(md);
434 mdSet = new HashSet<MethodDescriptor>();
435 caller2calleeSet.put(md, mdSet);
437 mdSet.add(min.getMethod());
441 private void checkArrayAccessNode(MethodDescriptor md, SymbolTable nametable,
442 ArrayAccessNode aan, boolean flag) {
444 ExpressionNode left = aan.getExpression();
445 checkExpressionNode(md, nametable, left, flag);
446 checkExpressionNode(md, nametable, aan.getIndex(), flag);
450 private void checkFieldAccessNode(MethodDescriptor md, SymbolTable nametable,
451 FieldAccessNode fan, boolean flag) {
452 ExpressionNode left = fan.getExpression();
453 checkExpressionNode(md, nametable, left, flag);
456 private void checkCreateObjectNode(MethodDescriptor md, SymbolTable nametable,
457 CreateObjectNode con, boolean flag) {
459 for (int i = 0; i < con.numArgs(); i++) {
460 ExpressionNode en = con.getArg(i);
461 checkExpressionNode(md, nametable, en, flag);
466 private void checkCastNode(MethodDescriptor md, SymbolTable nametable, CastNode cn, boolean flag) {
467 ExpressionNode en = cn.getExpression();
468 checkExpressionNode(md, nametable, en, flag);
471 private void checkAssignmentNode(MethodDescriptor md, SymbolTable nametable, AssignmentNode an,
473 boolean postinc = true;
475 if (an.getOperation().getBaseOp() == null
476 || (an.getOperation().getBaseOp().getOp() != Operation.POSTINC && an.getOperation()
477 .getBaseOp().getOp() != Operation.POSTDEC))
481 checkExpressionNode(md, nametable, an.getSrc(), flag);
484 checkExpressionNode(md, nametable, an.getDest(), flag);