1 package Analysis.TaskStateAnalysis;
2 import Analysis.TaskStateAnalysis.*;
8 import java.io.FileWriter;
10 public class TaskAnalysis {
14 Hashtable extern_flags;
15 Queue<TriggerState> q_main;
20 * @param state a flattened State object
23 public TaskAnalysis(State state)
28 /** This function returns the number of external flags, etc */
30 private void getFlagsfromClasses() {
31 flags=new Hashtable();
32 extern_flags = new Hashtable();
34 for(Iterator it_classes=state.getClassSymbolTable().getDescriptorsIterator();it_classes.hasNext();) {
36 ClassDescriptor cd = (ClassDescriptor)it_classes.next();
37 System.out.println(cd.getSymbol());
38 Vector vFlags=new Vector();
39 FlagDescriptor flag[];
43 /* Adding the flags of the super class */
44 if (cd.getSuper()!=null) {
45 ClassDescriptor superdesc=cd.getSuperDesc();
47 for(Iterator it_cflags=superdesc.getFlags();it_cflags.hasNext();) {
48 FlagDescriptor fd = (FlagDescriptor)it_cflags.next();
49 System.out.println(fd.toString());
54 for(Iterator it_cflags=cd.getFlags();it_cflags.hasNext();) {
55 FlagDescriptor fd = (FlagDescriptor)it_cflags.next();
56 System.out.println(fd.toString());
60 if (vFlags.size()!=0) {
61 flag=new FlagDescriptor[vFlags.size()];
63 for(int i=0;i < vFlags.size() ; i++) {
64 if (((FlagDescriptor)vFlags.get(i)).getExternal()) {
65 flag[ctr]=(FlagDescriptor)vFlags.get(i);
66 vFlags.remove(flag[ctr]);
70 for(int i=0;i < vFlags.size() ; i++) {
71 flag[i+ctr]=(FlagDescriptor)vFlags.get(i);
73 extern_flags.put(cd,new Integer(ctr));
80 public void taskAnalysis() throws java.io.IOException {
81 Adj_List=new Hashtable();
83 getFlagsfromClasses();
86 q_main=new LinkedList<TriggerState>();
88 for(Iterator it_classes=(Iterator)flags.keys();it_classes.hasNext();) {
89 ClassDescriptor cd=(ClassDescriptor)it_classes.next();
91 externs=((Integer)extern_flags.get(cd)).intValue();
93 FlagDescriptor[] fd=(FlagDescriptor[])flags.get(cd);
95 System.out.println("Inside taskAnalysis;\n Class:"+ cd.getSymbol());
96 System.out.println("No of externs " + externs);
97 System.out.println("No of flags: "+fd.length);
99 if (fd.length == externs) {
100 System.out.println("extern called");
101 boolean onlyExterns=true;
104 && (fd[0].getSymbol().compareTo("initialstate")==0)) {
105 FlagState fstemp=new FlagState(fd, cd);
106 Hashtable Adj_List_temp=new Hashtable();
108 fstemp.put(fd[0],new Boolean(true));
109 Vector vtemp=new Vector();
110 vtemp.add(new Edge(fstemp,"Runtime"));
111 Adj_List_temp.put(new FlagState(fd,cd),vtemp);
112 Adj_List.put(cd,Adj_List_temp);
114 Queue<TriggerState> q_temp=analyseTasks(new TriggerState(cd,fstemp));
117 if ( q_temp != null) {
118 q_main.addAll(q_temp);
124 while (q_main.size() > 0) {
125 // ****debug block********
127 System.out.println("/***********contents of main q**********/");
128 for (Iterator it_qm=q_main.iterator();it_qm.hasNext();)
130 TriggerState ts_qm=(TriggerState)it_qm.next();
131 FlagState fs_qm=ts_qm.getState();
133 System.out.println("FS : "+fs_qm.toString((FlagDescriptor [])flags.get(ts_qm.getClassDescriptor())));
135 System.out.println("/*********************************/");
136 // ****debug block********
137 Queue<TriggerState> q_temp=analyseTasks(q_main.poll());
138 if ( q_temp != null) {
139 q_main.addAll(q_temp);
144 Enumeration e=Adj_List.keys();
146 while (e.hasMoreElements()) {
147 System.out.println("creating dot file");
148 ClassDescriptor cdtemp=(ClassDescriptor)e.nextElement();
149 System.out.println((cdtemp.getSymbol()));
150 createDOTfile(cdtemp);
156 public Queue<TriggerState> analyseTasks(TriggerState ts) throws java.io.IOException {
158 Queue<FlagState> qft;
160 Hashtable Adj_List_temp;
161 Queue<TriggerState> q_retval;
163 ClassDescriptor cd=ts.getClassDescriptor();
165 if (Adj_List.containsKey(cd)) {
167 System.out.println("Inside analyseTasks;\n Checking if adj_list contains the class desc:"+ cd.getSymbol());
170 Adj_List_temp=(Hashtable)Adj_List.get(cd);
172 Adj_List_temp=new Hashtable();
173 Adj_List.put(cd,Adj_List_temp);
177 int externs=((Integer)extern_flags.get(cd)).intValue();
178 FlagDescriptor[] fd=(FlagDescriptor[])flags.get(cd);
180 q = new LinkedList<FlagState>();
181 q_retval=new LinkedList<TriggerState>();
182 q.offer(ts.getState());
186 while (q.size() != 0) {
187 System.out.println("inside while loop in analysetasks \n");
189 FlagState fsworking=q.poll();
192 FlagDescriptor[] ftemp=(FlagDescriptor[])flags.get(cd);
193 System.out.println("Processing state: "+cd.getSymbol()+" " + fsworking.toString(ftemp));
197 for(Iterator it_tasks=state.getTaskSymbolTable().getDescriptorsIterator();it_tasks.hasNext();) {
198 TaskDescriptor td = (TaskDescriptor)it_tasks.next();
199 boolean taskistriggered=false;
201 String taskname=getTaskName(td);
207 System.out.println();
208 System.out.println("Method: AnalyseTasks");
209 System.out.println(taskname);
210 System.out.println();
215 for(int i=0; i < td.numParameters(); i++) {
216 FlagExpressionNode fen=td.getFlag(td.getParameter(i));
217 if (isTaskTrigger(fen,fsworking))
218 taskistriggered = true;
221 if (taskistriggered) {
224 System.out.println("inside taskistriggered");
227 if (wasFlagStateProcessed(Adj_List_temp,fsworking)) {
228 if (! (fd.length == externs))
231 Adj_List_temp.put(fsworking,new Vector());
233 FlatMethod fm = state.getMethodFlat(td);
234 FlatNode fn=fm.methodEntryNode();
236 HashSet tovisit= new HashSet();
237 HashSet visited= new HashSet();
240 while(!tovisit.isEmpty()) {
241 FlatNode fn1 = (FlatNode)tovisit.iterator().next();
244 for(int i = 0; i < fn1.numNext(); i++) {
245 FlatNode nn=fn1.getNext(i);
248 if (((FlatFlagActionNode)nn).getFFANType() == FlatFlagActionNode.PRE) {
249 throw new Error("PRE FlagActions not supported");
250 } else if (((FlatFlagActionNode)nn).getFFANType() == FlatFlagActionNode.NEWOBJECT) {
252 System.out.println("NEWObject");
256 TempDescriptor[] tdArray = ((FlatFlagActionNode)nn).readsTemps();
258 //Under the safe assumption that all the temps in FFAN.NewObject node are of the same type(class)
259 ClassDescriptor cd_new=tdArray[0].getType().getClassDesc();
261 System.out.println("Class: "+cd_new.getSymbol());
263 FlagState fstemp=new FlagState((FlagDescriptor[])flags.get(cd_new), cd_new);
265 for(Iterator it_tfp=((FlatFlagActionNode)nn).getTempFlagPairs();it_tfp.hasNext();) {
266 TempFlagPair tfp=(TempFlagPair)it_tfp.next();
267 if (tfp.getFlag()==null) {
268 System.out.println("test1");
269 q_retval.addAll(createPossibleRuntimeStates(new TriggerState(cd_new,new FlagState((FlagDescriptor[])flags.get(cd_new), cd_new))));
270 // ****debug block********
271 System.out.println("/***********contents of q ret**********/");
272 for (Iterator it_qret=q_retval.iterator();it_qret.hasNext();) {
273 TriggerState ts_qret=(TriggerState)it_qret.next();
274 FlagState fs_qret=ts_qret.getState();
276 System.out.println("FS : "+fs_qret.toString((FlagDescriptor [])flags.get(ts_qret.getClassDescriptor())));
278 System.out.println("/*********************************/");
279 // ****debug block********
281 fstemp.put(tfp.getFlag(),new Boolean(((FlatFlagActionNode)nn).getFlagChange(tfp)));
287 System.out.println("test2");
288 System.out.println("Newobj fsworking "+fsworking.toString((FlagDescriptor [])flags.get(cd_new)));
289 System.out.println("Newobj fstemp "+fstemp.toString((FlagDescriptor [])flags.get(cd_new)));
293 q_retval.offer(new TriggerState(cd_new,fstemp));
295 //make this a function containsExterns()
296 int extrns=((Integer)extern_flags.get(cd_new)).intValue();
298 if ((extrns >0) && (extrns!=((FlagDescriptor[])flags.get(cd_new)).length))
299 q_retval.addAll(createPossibleRuntimeStates(new TriggerState(cd_new,fstemp)));
302 // ****debug block********
303 System.out.println("/***********contents of q ret 1**********/");
304 for (Iterator it_qret=q_retval.iterator();it_qret.hasNext();) {
305 TriggerState ts_qret=(TriggerState)it_qret.next();
306 FlagState fs_qret=ts_qret.getState();
308 System.out.println("FS : "+fs_qret.toString((FlagDescriptor [])flags.get(ts_qret.getClassDescriptor())));
310 System.out.println("/*********************************/");
311 // ****debug block********
314 if (((FlatFlagActionNode)nn).getFFANType() == FlatFlagActionNode.TASKEXIT) {
317 System.out.println("TaskExit");
320 FlagState fstemp=new FlagState(fsworking.getStateTable(), null); //WHAT CLASS IS THIS
322 for(Iterator it_tfp=((FlatFlagActionNode)nn).getTempFlagPairs();it_tfp.hasNext();) {
323 TempFlagPair tfp=(TempFlagPair)it_tfp.next();
324 fstemp.put(tfp.getFlag(),new Boolean(((FlatFlagActionNode)nn).getFlagChange(tfp)));
327 System.out.println();
328 System.out.println(fstemp.toString((FlagDescriptor [])flags.get(cd)));
329 System.out.println();
330 System.out.println("taskexit fsworking "+fsworking.toString((FlagDescriptor [])flags.get(cd)));
331 System.out.println("taskexit fstemp "+fstemp.toString((FlagDescriptor [])flags.get(cd)));
334 if (!edgeexists(Adj_List_temp,fsworking,fstemp,taskname)) {
335 ((Vector)Adj_List_temp.get(fsworking)).add(new Edge(fstemp,taskname));
337 if (!wasFlagStateProcessed(Adj_List_temp,fstemp)) {
345 if (!visited.contains(nn) && !tovisit.contains(nn)) {
353 if (q_retval.size()==0)
359 private boolean isTaskTrigger(FlagExpressionNode fen,FlagState fs) {
360 if (fen instanceof FlagNode)
361 return fs.get(((FlagNode)fen).getFlag());
363 switch (((FlagOpNode)fen).getOp().getOp()) {
364 case Operation.LOGIC_AND:
365 return ((isTaskTrigger(((FlagOpNode)fen).getLeft(),fs)) && (isTaskTrigger(((FlagOpNode)fen).getRight(),fs)));
366 case Operation.LOGIC_OR:
367 return ((isTaskTrigger(((FlagOpNode)fen).getLeft(),fs)) || (isTaskTrigger(((FlagOpNode)fen).getRight(),fs)));
368 case Operation.LOGIC_NOT:
369 return !(isTaskTrigger(((FlagOpNode)fen).getLeft(),fs));
375 private boolean wasFlagStateProcessed(Hashtable Adj_List,FlagState fs) {
376 Enumeration e=Adj_List.keys();
378 while(e.hasMoreElements()) {
379 FlagState fsv = (FlagState)(e.nextElement());
387 private boolean existsInQueue(TriggerState ts) {
388 throw new Error("Use hashcode/contains of set method to find...no linear search allowed");
391 private boolean existsInFSQueue(Queue q,FlagState fs) {
392 throw new Error("Use hashcode/contains of set method to find...no linear search allowed");
395 public void printAdjList(ClassDescriptor cd) {
396 Enumeration e=((Hashtable)Adj_List.get(cd)).keys();
397 while(e.hasMoreElements()) {
398 FlagState fsv = (FlagState)(e.nextElement());
399 System.out.println(fsv.toString((FlagDescriptor [])flags.get(cd)));
403 public void createDOTfile(ClassDescriptor cd) throws java.io.IOException {
404 File dotfile= new File("graph"+cd.getSymbol()+".dot");
406 FileWriter dotwriter=new FileWriter(dotfile,true);
408 dotwriter.write("digraph G{ \n");
409 dotwriter.write("center=true;\norientation=landscape;\n");
411 Enumeration e=((Hashtable)Adj_List.get(cd)).keys();
412 while(e.hasMoreElements()) {
413 FlagState fsv = (FlagState)(e.nextElement());
414 System.out.println(fsv.toString());
415 Hashtable test=(Hashtable)Adj_List.get(cd);
416 Vector edges=(Vector)test.get(fsv);
417 for(int i=0;i < edges.size();i++) {
418 dotwriter.write(fsv.toString((FlagDescriptor [])flags.get(cd))+" -> "+((Edge)edges.get(i)).getState().toString((FlagDescriptor [])flags.get(cd))+"[label=\""+((Edge)edges.get(i)).getName()+"\"];\n");
422 dotwriter.write("}\n");
427 private String getTaskName(TaskDescriptor td) {
428 StringTokenizer st = new StringTokenizer(td.toString(),"(");
429 return st.nextToken();
432 private boolean edgeexists(Hashtable Adj_List_local,FlagState v1, FlagState v2,String name) {
433 Vector edges=(Vector)Adj_List_local.get(v1);
436 System.out.println("no edges");
438 for(int i=0;i < edges.size();i++) {
439 FlagState fs=((Edge)edges.get(i)).getState();
440 if (fs.isEqual(v2) && (name.compareTo(((Edge)edges.get(i)).getName())==0))
447 private void processExterns(boolean onlyExterns,ClassDescriptor cd) throws java.io.IOException {
449 Hashtable Adj_List_temp;
450 if (Adj_List.containsKey(cd)) {
451 Adj_List_temp=(Hashtable)Adj_List.get(cd);
453 Adj_List_temp=new Hashtable();
454 Adj_List.put(cd,Adj_List_temp);
459 FlagDescriptor [] fd=(FlagDescriptor [])flags.get(cd);
460 System.out.println("onlyExterns"+fd.length);
461 noOfIterations=1<<fd.length;
462 boolean BoolValTable[]=new boolean[fd.length];
464 for(int i=0; i < fd.length ; i++) {
465 System.out.println(fd[i].getSymbol());
466 BoolValTable[i]=false;
468 Adj_List_temp.put(new FlagState(fd,cd),new Vector());
470 for(int k=1; k<noOfIterations; k++) {
471 for(int j=0; j< fd.length ;j++) {
472 if ((k% (1<<j)) == 0)
473 BoolValTable[j]=(!BoolValTable[j]);
476 FlagState fstemp=new FlagState(fd,cd);
478 for(Enumeration e=fstemp.getStateTable().keys(); e.hasMoreElements() && i < fd.length;i++) {
479 fstemp.put((FlagDescriptor)e.nextElement(),new Boolean(BoolValTable[i]));
481 Adj_List_temp.put(fstemp,new Vector());
484 Enumeration e=Adj_List_temp.keys();
485 while(e.hasMoreElements()) {
486 FlagState fstemp=(FlagState)e.nextElement();
487 Enumeration en=Adj_List_temp.keys();
488 while (en.hasMoreElements()) {
489 FlagState fs=(FlagState)en.nextElement();
493 ((Vector)Adj_List_temp.get(fstemp)).add(new Edge(fs,"Runtime"));
500 private Queue createPossibleRuntimeStates(TriggerState ts) throws java.io.IOException {
501 int noOfIterations, externs;
502 Hashtable Adj_List_temp;
505 System.out.println("Inside CreatePossible runtime states");
507 ClassDescriptor cd = ts.getClassDescriptor();
508 FlagState fs= ts.getState();
509 if (Adj_List.containsKey(cd)) {
510 Adj_List_temp=(Hashtable)Adj_List.get(cd);
512 Adj_List_temp=new Hashtable();
513 Adj_List.put(cd,Adj_List_temp);
516 externs=((Integer)extern_flags.get(cd)).intValue();
518 FlagDescriptor[] fd=(FlagDescriptor[])flags.get(cd);
520 onlyExterns= (fd.length==externs);
522 Queue q_ret=new LinkedList();
525 noOfIterations=1<<fd.length;
526 boolean BoolValTable[]=new boolean[fd.length];
528 for(int i=0; i < fd.length ; i++) {
529 System.out.println(fd[i].getSymbol());
530 BoolValTable[i]=false;
533 if (! wasFlagStateProcessed(Adj_List_temp,fs)) {
534 TriggerState ts_local=new TriggerState(cd,fs);
535 if (!existsInQueue(ts_local)) {
536 q_ret.offer(ts_local);
538 Adj_List_temp.put(fs,new Vector());
541 for(int k=1; k<noOfIterations; k++) {
542 for(int j=0; j< fd.length ;j++) {
544 BoolValTable[j]=(!BoolValTable[j]);
547 FlagState fstemp=new FlagState(fs.getStateTable(),cd);
549 for(Enumeration e=fstemp.getStateTable().keys(); e.hasMoreElements() && i < fd.length;i++) {
550 fstemp.put((FlagDescriptor)e.nextElement(),new Boolean(BoolValTable[i]));
553 if (wasFlagStateProcessed(Adj_List_temp,fstemp)) {
556 TriggerState ts_local=new TriggerState(cd,fstemp);
557 if (!existsInQueue(ts_local)) {
558 q_ret.offer(ts_local);
562 Adj_List_temp.put(fstemp,new Vector());
567 Enumeration e=Adj_List_temp.keys();
568 while(e.hasMoreElements()) {
569 FlagState fstemp=(FlagState)e.nextElement();
570 Enumeration en=Adj_List_temp.keys();
571 while (en.hasMoreElements()) {
572 FlagState fs_local=(FlagState)en.nextElement();
573 if(fstemp == fs_local)
576 ((Vector)Adj_List_temp.get(fstemp)).add(new Edge(fs_local,"Runtime"));
582 System.out.println("inside else part");
583 noOfIterations=1<<externs;
584 boolean BoolValTable[]=new boolean[externs];
585 Hashtable Adj_List_local;
588 Adj_List_local=new Hashtable();
590 for(int i=0; i < externs ; i++) {
591 System.out.println(fd[i].getSymbol());
592 BoolValTable[i]=fs.get(fd[i]);
595 for(int k=1; k<noOfIterations; k++) {
596 for(int j=0; j< fd.length ;j++) {
598 BoolValTable[j]=(!BoolValTable[j]);
601 FlagState fstemp=new FlagState(fs.getStateTable(),cd);
602 FlagDescriptor fdtemp[]=(FlagDescriptor [])flags.get(cd);
604 for(int i=0; i < externs;i++)
606 fstemp.put(fdtemp[i],new Boolean(BoolValTable[i]));
609 q_ret.offer(new TriggerState(cd,fstemp));
617 private Queue createPossibleRuntimeStates(ClassDescriptor cd,FlagState fs) throws java.io.IOException {
618 int noOfIterations, externs;
619 Hashtable Adj_List_temp;
622 System.out.println("Inside CreatePossible runtime states(flagstates)");
624 if (Adj_List.containsKey(cd))
625 Adj_List_temp=(Hashtable)Adj_List.get(cd);
627 Adj_List_temp=new Hashtable();
628 Adj_List.put(cd,Adj_List_temp);
631 externs=((Integer)extern_flags.get(cd)).intValue();
633 FlagDescriptor[] fd=(FlagDescriptor[])flags.get(cd);
635 onlyExterns=fd.length==externs;
639 q_ret=new LinkedList();
642 noOfIterations=1<<fd.length;
643 boolean BoolValTable[]=new boolean[fd.length];
645 for(int i=0; i < fd.length ; i++) {
646 System.out.println(fd[i].getSymbol());
647 BoolValTable[i]=false;
652 System.out.println("inside else part(fs)");
653 noOfIterations=1<<externs;
654 boolean BoolValTable[]=new boolean[externs];
655 Hashtable Adj_List_local;
658 Adj_List_local=new Hashtable();
660 for(int i=0; i < externs ; i++) {
661 System.out.println(fd[i].getSymbol());
662 BoolValTable[i]=fs.get(fd[i]);
665 if (! wasFlagStateProcessed(Adj_List_temp,fs)) {
666 Adj_List_temp.put(fs,new Vector());
668 for(int k=1; k<noOfIterations; k++) {
669 for(int j=0; j< fd.length ;j++) {
671 BoolValTable[j]=(!BoolValTable[j]);
674 FlagState fstemp=new FlagState(fs.getStateTable(),cd);
675 FlagDescriptor fdtemp[]=(FlagDescriptor [])flags.get(cd);
677 for(int i=0; i < externs;i++) {
678 fstemp.put(fdtemp[i],new Boolean(BoolValTable[i]));
682 ((Vector)(Adj_List_temp.get(fs))).add(new Edge(fstemp,"Runtime"));
691 private void processTasksWithPost(ClassDescriptor cd, Hashtable pre) {
694 private ClassDescriptor processFlatNew(FlatNode fn) {
695 if (! (fn.getNext(0).kind() == 13)) {
696 return (((FlatNew)fn).getType().getClassDesc());