1 package Analysis.TaskStateAnalysis;
7 import java.io.FileWriter;
8 import java.io.FileOutputStream;
10 public class TaskTagAnalysis {
12 TagAnalysis taganalysis;
15 HashSet<TagState> toprocess;
16 HashSet<TagState> discovered;
17 Hashtable<TaskDescriptor, TaskQueue> tasktable;
18 Hashtable<TagDescriptor, Set<TagState>> tsresults;
19 Hashtable<ClassDescriptor, Set<FlagState>> fsresults;
26 public TaskTagAnalysis(State state, TagAnalysis taganalysis) {
28 this.typeutil=new TypeUtil(state);
29 this.taganalysis=taganalysis;
30 this.flaginfo=new FlagInfo(state);
31 this.toprocess=new HashSet<TagState>();
32 this.discovered=new HashSet<TagState>();
33 this.tasktable=new Hashtable<TaskDescriptor, TaskQueue>();
34 this.tsresults=new Hashtable<TagDescriptor, Set<TagState>>();
35 this.fsresults=new Hashtable<ClassDescriptor, Set<FlagState>>();
38 for(Iterator taskit=state.getTaskSymbolTable().getDescriptorsIterator();taskit.hasNext();) {
39 TaskDescriptor td=(TaskDescriptor)taskit.next();
40 tasktable.put(td, new TaskQueue(td));
44 private void doAnalysis() {
45 toprocess.add(createInitialState());
46 while(!toprocess.isEmpty()) {
47 TagState ts=toprocess.iterator().next();
49 //Loop through each task
50 for(Iterator taskit=state.getTaskSymbolTable().getDescriptorsIterator();taskit.hasNext();) {
51 TaskDescriptor td=(TaskDescriptor)taskit.next();
52 TaskQueue tq=tasktable.get(td);
53 processTask(td, tq, ts);
58 private void processTask(TaskDescriptor td, TaskQueue tq, TagState ts) {
59 Set<FlagState> flagset=ts.getFS();
60 for(Iterator<FlagState> fsit=flagset.iterator();fsit.hasNext();) {
61 FlagState fs=fsit.next();
62 FlagTagState fts=new FlagTagState(ts, fs);
63 for(int i=0;i<td.numParameters();i++) {
64 if (canEnqueue(td, i, fs)) {
65 TaskQueueIterator tqi=tq.enqueue(i, fts);
66 while(tqi.hasNext()) {
75 private void processBinding(TaskQueueIterator tqi) {
76 TaskBinding tb=new TaskBinding(tqi);
83 private Hashtable<TempDescriptor, Wrapper> computeInitialState(Hashtable<FlatNode, Hashtable<TempDescriptor, Wrapper>> maintable, FlatNode fn) {
84 Hashtable<TempDescriptor, Wrapper> table=new Hashtable<TempDescriptor, Wrapper>();
85 Hashtable<TagWrapper,TagWrapper> tagtable=new Hashtable<TagWrapper, TagWrapper>();
86 for(int i=0;i<fn.numPrev();i++) {
87 FlatNode fnprev=fn.getPrev(i);
88 Hashtable<TempDescriptor, Wrapper> prevtable=maintable.get(fn);
90 //Iterator through the Tags
91 for(Iterator<TempDescriptor> tmpit=prevtable.keySet().iterator();tmpit.hasNext();) {
92 TempDescriptor tmp=tmpit.next();
93 Wrapper prevtag=prevtable.get(tmp);
94 if (prevtag instanceof ObjWrapper)
96 if (table.containsKey(tmp)) {
98 TagWrapper currtag=(TagWrapper) table.get(tmp);
99 tagtable.put((TagWrapper)prevtag, currtag);
100 assert(currtag.initts.equals(((TagWrapper)prevtag).initts));
101 for(Iterator<TagState> tagit=((TagWrapper)prevtag).ts.iterator();tagit.hasNext();) {
102 TagState tag=tagit.next();
103 if (!currtag.ts.contains(tag)) {
108 TagWrapper clonetag=((TagWrapper)prevtag).clone();
109 tagtable.put((TagWrapper)prevtag, clonetag);
110 table.put(tmp, clonetag);
114 //Iterator through the Objects
115 for(Iterator<TempDescriptor> tmpit=prevtable.keySet().iterator();tmpit.hasNext();) {
116 TempDescriptor tmp=tmpit.next();
117 Wrapper obj=prevtable.get(tmp);
118 if (obj instanceof TagWrapper)
120 ObjWrapper prevobj=(ObjWrapper)obj;
121 if (!table.containsKey(tmp)) {
123 ObjWrapper newobj=new ObjWrapper();
124 newobj.initfs=prevobj.initfs;
125 table.put(tmp, newobj);
127 ObjWrapper currobj=(ObjWrapper) table.get(tmp);
128 assert(currobj.initfs.equals(prevobj.initfs));
129 for(Iterator<TagWrapper> tagit=prevobj.tags.iterator();tagit.hasNext();) {
130 TagWrapper tprev=tagit.next();
131 TagWrapper t=tagtable.get(tprev);
134 for(Iterator<FlagState> flagit=prevobj.fs.iterator();flagit.hasNext();) {
135 FlagState fs=flagit.next();
143 private void processFlatFlag(FlatFlagActionNode fn, Hashtable<TempDescriptor, Wrapper> table) {
144 if (fn.getTaskType()==FlatFlagActionNode.PRE) {
145 throw new Error("Unsupported");
146 } else if (fn.getTaskType()==FlatFlagActionNode.TASKEXIT) {
147 evalTaskExitNode(fn, table);
148 } else if (fn.getTaskType()==FlatFlagActionNode.NEWOBJECT) {
149 evalNewNode(fn, table);
153 private void setFlag(ObjWrapper ow, FlagDescriptor fd, boolean value) {
154 HashSet<FlagState> newstate=new HashSet<FlagState>();
155 Hashtable<FlagState, FlagState> flagmap=new Hashtable<FlagState, FlagState>();
156 for(Iterator<FlagState> flagit=ow.fs.iterator();flagit.hasNext();) {
157 FlagState fs=flagit.next();
158 FlagState fsnew=canonical(fs.setFlag(fd, value));
160 flagmap.put(fs, fsnew);
163 for(Iterator<TagWrapper> tagit=ow.tags.iterator();tagit.hasNext();) {
164 TagWrapper tw=tagit.next();
165 HashSet<TagState> newstates=new HashSet<TagState>();
166 for(Iterator<TagState> tgit=tw.ts.iterator();tgit.hasNext();) {
167 TagState ts=tgit.next();
168 for(Iterator<FlagState> flagit=ts.getFS().iterator();flagit.hasNext();) {
169 FlagState fs=flagit.next();
170 if (flagmap.containsKey(fs)) {
171 if (flagmap.get(fs).equals(fs)) {
174 TagState tsarray[]=ts.clearFS(fs);
175 //Can do strong update here because these
176 //must be parameter objects...therefore
177 //all possible aliasing relationships are
179 for(int i=0;i<tsarray.length;i++) {
180 TagState ts2=canonical(tsarray[i]);
181 TagState tsarray2[]=ts2.addnewFS(flagmap.get(fs));
182 for(int j=0;j<tsarray2.length;j++)
183 newstates.add(canonical(tsarray2[j]));
193 private void setTag(ObjWrapper ow, TagWrapper twnew, TagDescriptor tag, boolean value) {
195 if (ow.tags.contains(twnew)) {
196 System.out.println("Tag already bound to object.");
200 if (!ow.tags.contains(twnew)) {
201 System.out.println("Tag not bound to object.");
205 HashSet<FlagState> newfsstates=new HashSet<FlagState>();
206 Hashtable<FlagState, FlagState[]> flagmap=new Hashtable<FlagState, FlagState[]>();
207 //Change the flag states
208 for(Iterator<FlagState> fsit=ow.fs.iterator();fsit.hasNext();) {
209 FlagState fs=fsit.next();
210 FlagState[] fsnew=canonical(fs.setTag(tag, value));
211 flagmap.put(fs, fsnew);
212 newfsstates.addAll(Arrays.asList(fsnew));
214 for(Iterator<TagWrapper> tagit=ow.tags.iterator();tagit.hasNext();) {
215 TagWrapper tw=tagit.next();
216 HashSet<TagState> newstates=new HashSet<TagState>();
217 for(Iterator<TagState> tgit=tw.ts.iterator();tgit.hasNext();) {
218 TagState ts=tgit.next();
219 for(Iterator<FlagState> flagit=ts.getFS().iterator();flagit.hasNext();) {
220 FlagState fs=flagit.next();
221 if (flagmap.containsKey(fs)) {
222 FlagState[] fmap=flagmap.get(fs);
223 for(int i=0;i<fmap.length;i++) {
224 FlagState fsnew=fmap[i];
225 if (fsnew.equals(fs)) {
228 TagState tsarray[]=ts.clearFS(fs);
229 //Can do strong update here because
230 //these must be parameter
231 //objects...therefore all possible
232 //aliasing relationships are explored
233 for(int j=0;j<tsarray.length;j++) {
234 TagState ts2=canonical(tsarray[j]);
235 TagState tsarray2[]=ts2.addnewFS(fsnew);
236 for(int k=0;k<tsarray2.length;k++)
237 newstates.add(canonical(tsarray2[k]));
248 HashSet<TagState> newstates=new HashSet<TagState>();
249 for(Iterator<TagState> tgit=twnew.ts.iterator();tgit.hasNext();) {
250 TagState ts=tgit.next();
251 for(Iterator<FlagState> flagit=newfsstates.iterator();flagit.hasNext();) {
252 FlagState fsnew=flagit.next();
253 //Can do strong update here because these must
254 //be parameter objects...therefore all
255 //possible aliasing relationships are explored
258 tsarray2=ts.addnewFS(fsnew);
260 tsarray2=ts.clearFS(fsnew);
261 for(int j=0;j<tsarray2.length;j++)
262 newstates.add(canonical(tsarray2[j]));
271 ow.tags.remove(twnew);
275 private void evalTaskExitNode(FlatFlagActionNode fn, Hashtable<TempDescriptor, Wrapper> table) {
276 //Process clears first
277 for(Iterator<TempTagPair> it_ttp=fn.getTempTagPairs();it_ttp.hasNext();) {
278 TempTagPair ttp=it_ttp.next();
279 TempDescriptor tmp=ttp.getTemp();
280 TagDescriptor tag=ttp.getTag();
281 TempDescriptor tagtmp=ttp.getTagTemp();
282 TagWrapper tagw=(TagWrapper)table.get(tagtmp);
283 boolean newtagstate=fn.getTagChange(ttp);
284 ObjWrapper ow=(ObjWrapper)table.get(tmp);
286 setTag(ow, tagw, tag, newtagstate);
290 for(Iterator<TempFlagPair> it_tfp=fn.getTempFlagPairs();it_tfp.hasNext();) {
291 TempFlagPair tfp=it_tfp.next();
292 TempDescriptor tmp=tfp.getTemp();
293 FlagDescriptor fd=tfp.getFlag();
294 boolean newflagstate=fn.getFlagChange(tfp);
295 ObjWrapper ow=(ObjWrapper)table.get(tmp);
296 setFlag(ow, fd, newflagstate);
300 for(Iterator it_ttp=fn.getTempTagPairs();it_ttp.hasNext();) {
301 TempTagPair ttp=(TempTagPair)it_ttp.next();
302 TempDescriptor tmp=ttp.getTemp();
303 TagDescriptor tag=ttp.getTag();
304 TempDescriptor tagtmp=ttp.getTagTemp();
305 TagWrapper tagw=(TagWrapper)table.get(tagtmp);
306 boolean newtagstate=fn.getTagChange(ttp);
307 ObjWrapper ow=(ObjWrapper)table.get(tmp);
309 setTag(ow, tagw, tag, newtagstate);
313 private void evalNewNode(FlatFlagActionNode fn, Hashtable<TempDescriptor, Wrapper> table, TaskDescriptor td) {
314 TempDescriptor fntemp=null;
317 Iterator it=fn.getTempFlagPairs();
319 TempFlagPair tfp=(TempFlagPair)it.next();
320 fntemp=tfp.getTemp();
322 it=fn.getTempTagPairs();
325 TempTagPair ttp=(TempTagPair)it.next();
326 fntemp=ttp.getTemp();
329 FlagState fs=canonical(new FlagState(fntemp.getType().getClassDesc()));
330 ObjWrapper ow=new ObjWrapper();
332 table.put(fntemp, ow);
334 for(Iterator<TempFlagPair> it_tfp=fn.getTempFlagPairs();it_tfp.hasNext();) {
335 TempFlagPair tfp=it_tfp.next();
336 TempDescriptor tmp=tfp.getTemp();
337 FlagDescriptor fd=tfp.getFlag();
338 boolean newflagstate=fn.getFlagChange(tfp);
339 assert(ow==table.get(tmp));
340 setFlag(ow, fd, newflagstate);
343 for(Iterator it_ttp=fn.getTempTagPairs();it_ttp.hasNext();) {
344 TempTagPair ttp=(TempTagPair)it_ttp.next();
345 TempDescriptor tmp=ttp.getTemp();
346 TagDescriptor tag=ttp.getTag();
347 TempDescriptor tagtmp=ttp.getTagTemp();
348 TagWrapper tagw=(TagWrapper)table.get(tagtmp);
349 boolean newtagstate=fn.getTagChange(ttp);
350 assert(ow==table.get(tmp));
352 setTag(ow, tagw, tag, newtagstate);
354 throw new Error("Can't clear tag in newly allocated object");
356 for(Iterator<FlagState> fsit=ow.fs.iterator();fsit.hasNext();) {
357 FlagState fs2=fsit.ext();
358 fs2.addAllocatingTask(td);
359 TagState ts2=new TagState(fs2.getClassDesc());
363 if (!discovered.contains(ts2)) {
370 private void processFlatTag(FlatTagDeclaration fn, Hashtable<TempDescriptor, Wrapper> table, TaskDescriptor td) {
371 TempDescriptor tmp=fn.getDst();
372 if (table.containsKey(tmp)) {
373 recordtagchange((TagWrapper)table.get(tmp), td);
375 TagDescriptor tag=fn.getType();
376 TagState ts=canonical(new TagState(tag));
377 TagWrapper tw=new TagWrapper(ts);
382 private void addresult(TagDescriptor td, TagState ts) {
383 if (!tsresults.containsKey(td))
384 tsresults.put(td, new HashSet<TagState>());
385 tsresults.get(td).add(ts);
388 public void recordtagchange(TagWrapper tw, TaskDescriptor td) {
389 assert(tw.initts==null);
390 for(Iterator<TagState> tsit=tw.ts.iterator(); tsit.hasNext();) {
391 TagState ts=tsit.next();
393 addresult(ts.getTag(), ts);
394 if (!discovered.contains(ts)) {
401 private void processFlatCall(FlatCall fc, Hashtable<TempDescriptor, Wrapper> table) {
405 private void processFlatReturnNode(FlatReturnNode fr, Hashtable<TempDescriptor, Wrapper> table, TaskDescriptor td) {
409 private boolean equivalent(Hashtable<TempDescriptor, Wrapper> table1, Hashtable<TempDescriptor, Wrapper> table2) {
410 Hashtable<Wrapper, Wrapper> emap=new Hashtable<Wrapper, Wrapper>();
412 if (table1.keySet().size()!=table2.keySet().size())
415 for(Iterator<TempDescriptor> tmpit=table1.keySet().iterator();tmpit.hasNext();) {
416 TempDescriptor tmp=tmpit.next();
417 if (table2.containsKey(tmp)) {
418 emap.put(table1.get(tmp), table2.get(tmp));
422 for(Iterator<TempDescriptor> tmpit=table1.keySet().iterator();tmpit.hasNext();) {
423 TempDescriptor tmp=tmpit.next();
424 Wrapper w1=table1.get(tmp);
425 Wrapper w2=table2.get(tmp);
426 if (w1 instanceof TagWrapper) {
427 TagWrapper t1=(TagWrapper)w1;
428 TagWrapper t2=(TagWrapper)w2;
429 if (!t1.ts.equals(t2.ts))
433 ObjWrapper t1=(ObjWrapper)w1;
434 ObjWrapper t2=(ObjWrapper)w2;
435 if (!t1.fs.equals(t2.fs))
437 if (t1.tags.size()!=t2.tags.size())
439 for(Iterator<TagWrapper> twit=t1.tags.iterator();twit.hasNext();) {
440 TagWrapper tw1=twit.next();
441 if (!t2.tags.contains(emap.get(tw1)))
449 private void doAnalysis(TaskBinding tb) {
450 TaskDescriptor td=tb.tqi.tq.getTask();
451 FlatMethod fm=state.getMethodFlat(td);
452 Hashtable<FlatNode, Hashtable<TempDescriptor, Wrapper>> wtable=new Hashtable<FlatNode, Hashtable<TempDescriptor, Wrapper>>();
453 wtable.put(fm, buildinittable(tb, fm));
454 HashSet<FlatNode> visited=new HashSet<FlatNode>();
455 HashSet<FlatNode> tovisit=new HashSet<FlatNode>();
456 tovisit.add(fm.getNext(0));
457 while(!tovisit.isEmpty()) {
458 FlatNode fn=tovisit.iterator().next();
461 Hashtable<TempDescriptor, Wrapper> table=computeInitialState(wtable, fn);
463 case FKind.FlatFlagActionNode:
464 processFlatFlag((FlatFlagActionNode)fn, table);
466 case FKind.FlatTagDeclaration:
467 processFlatTag((FlatTagDeclaration)fn, table, td);
470 processFlatCall((FlatCall)fn, table);
472 case FKind.FlatReturnNode:
473 processFlatReturnNode((FlatReturnNode)fn, table, td);
478 if (!equivalent(table, wtable.get(fn))) {
479 wtable.put(fn, table);
480 for(int i=0;i<fn.numNext();i++) {
481 tovisit.add(fn.getNext(i));
484 for(int i=0;i<fn.numNext();i++) {
485 if (!visited.contains(fn.getNext(i)))
486 tovisit.add(fn.getNext(i));
493 private Hashtable<TempDescriptor, Wrapper> buildinittable(TaskBinding tb, FlatMethod fm) {
494 Hashtable<TempDescriptor, Wrapper> table=new Hashtable<TempDescriptor, Wrapper>();
495 Vector<TempDescriptor> tagtmps=tb.tqi.tq.tags;
496 for(int i=0;i<tagtmps.size();i++) {
497 TempDescriptor tmp=tagtmps.get(i);
498 table.put(tmp, tb.getTag(tmp));
500 for(int i=0;i<fm.numParameters();i++) {
501 TempDescriptor tmp=fm.getParameter(i);
502 table.put(tmp, tb.getParameter(i));
509 new flag states created
510 new tag states created
511 flag states bound to tag parameters
514 public boolean canEnqueue(TaskDescriptor td, int paramnum, FlagState fs) {
515 return typeutil.isSuperorType(td.getParamType(paramnum).getClassDesc(),fs.getClassDescriptor())&&
516 isTaskTrigger_flag(td.getFlag(td.getParameter(paramnum)),fs)&&
517 isTaskTrigger_tag(td.getTag(td.getParameter(paramnum)),fs);
520 private static boolean isTaskTrigger_flag(FlagExpressionNode fen, FlagState fs) {
523 else if (fen instanceof FlagNode)
524 return fs.get(((FlagNode)fen).getFlag());
526 switch (((FlagOpNode)fen).getOp().getOp()) {
527 case Operation.LOGIC_AND:
528 return ((isTaskTrigger_flag(((FlagOpNode)fen).getLeft(),fs)) && (isTaskTrigger_flag(((FlagOpNode)fen).getRight(),fs)));
529 case Operation.LOGIC_OR:
530 return ((isTaskTrigger_flag(((FlagOpNode)fen).getLeft(),fs)) || (isTaskTrigger_flag(((FlagOpNode)fen).getRight(),fs)));
531 case Operation.LOGIC_NOT:
532 return !(isTaskTrigger_flag(((FlagOpNode)fen).getLeft(),fs));
539 private static boolean isTaskTrigger_tag(TagExpressionList tel, FlagState fs){
541 for (int i=0;i<tel.numTags() ; i++){
542 switch (fs.getTagCount(tel.getType(i))){
543 case FlagState.ONETAG:
544 case FlagState.MULTITAGS:
546 case FlagState.NOTAGS:
554 TagState createInitialState() {
555 ClassDescriptor startupobject=typeutil.getClass(TypeUtil.StartupClass);
556 FlagDescriptor fd=(FlagDescriptor)startupobject.getFlagTable().get(FlagDescriptor.InitialFlag);
557 FlagState fsstartup=(new FlagState(startupobject)).setFlag(fd,true);
558 fsstartup.setAsSourceNode();
559 fsstartup=canonical(fsstartup);
560 TagState ts=new TagState();
561 TagState[] tsarray=ts.addFS(fsstartup);
562 return canonical(tsarray[0]);
565 FlagState[] canonical(FlagState[] fs) {
566 FlagState[] fsarray=new FlagState[fs.length];
567 for(int i=0;i<fs.length;i++)
568 fsarray[i]=canonical(fs[i]);
572 FlagState canonical(FlagState fs) {
576 TagState canonical(TagState ts) {