1 package Analysis.TaskStateAnalysis;
7 import java.io.FileWriter;
8 import java.io.FileOutputStream;
10 public class TaskAnalysis {
14 Hashtable extern_flags;
15 Queue<FlagState> toprocess;
16 TagAnalysis taganalysis;
17 Hashtable cdtorootnodes;
24 * @param state a flattened State object
27 public TaskAnalysis(State state, TagAnalysis taganalysis) {
29 this.typeutil=new TypeUtil(state);
30 this.taganalysis=taganalysis;
33 /** Builds a table of flags for each class in the Bristlecone
34 * program. It creates two hashtables: one which holds the
35 * ClassDescriptors and arrays of * FlagDescriptors as key-value
36 * pairs; the other holds the ClassDescriptor and the * number of
37 * external flags for that specific class.
40 private void getFlagsfromClasses() {
41 flags=new Hashtable();
42 extern_flags = new Hashtable();
44 /** Iterate through the classes used in the program to build
47 for(Iterator it_classes=state.getClassSymbolTable().getDescriptorsIterator();it_classes.hasNext();) {
49 ClassDescriptor cd = (ClassDescriptor)it_classes.next();
50 Vector vFlags=new Vector();
51 FlagDescriptor flag[];
55 /* Adding the flags of the super class */
56 if (cd.getSuper()!=null) {
57 ClassDescriptor superdesc=cd.getSuperDesc();
59 for(Iterator it_cflags=superdesc.getFlags();it_cflags.hasNext();) {
60 FlagDescriptor fd = (FlagDescriptor)it_cflags.next();
65 for(Iterator it_cflags=cd.getFlags();it_cflags.hasNext();) {
66 FlagDescriptor fd = (FlagDescriptor)it_cflags.next();
70 if (vFlags.size()!=0) {
71 flag=new FlagDescriptor[vFlags.size()];
73 for(int i=0;i < vFlags.size() ; i++) {
74 if (((FlagDescriptor)vFlags.get(i)).getExternal()) {
75 flag[ctr]=(FlagDescriptor)vFlags.get(i);
76 vFlags.remove(flag[ctr]);
80 for(int i=0;i < vFlags.size() ; i++) {
81 flag[i+ctr]=(FlagDescriptor)vFlags.get(i);
83 extern_flags.put(cd,new Integer(ctr));
89 /** Method which starts up the analysis
92 public void taskAnalysis() throws java.io.IOException {
93 flagstates=new Hashtable();
94 Hashtable<FlagState,FlagState> sourcenodes;
95 cdtorootnodes=new Hashtable();
97 getFlagsfromClasses();
100 toprocess=new LinkedList<FlagState>();
102 for(Iterator it_classes=(Iterator)flags.keys();it_classes.hasNext();) {
103 ClassDescriptor cd=(ClassDescriptor)it_classes.next();
104 externs=((Integer)extern_flags.get(cd)).intValue();
105 FlagDescriptor[] fd=(FlagDescriptor[])flags.get(cd);
106 flagstates.put(cd,new Hashtable<FlagState,FlagState>());
107 cdtorootnodes.put(cd,new Vector());
111 ClassDescriptor startupobject=typeutil.getClass(TypeUtil.StartupClass);
113 sourcenodes=(Hashtable<FlagState,FlagState>)flagstates.get(startupobject);
114 FlagState fsstartup=new FlagState(startupobject);
117 FlagDescriptor[] fd=(FlagDescriptor[])flags.get(startupobject);
119 fsstartup=fsstartup.setFlag(fd[0],true);
120 fsstartup.setAsSourceNode();
121 ((Vector)cdtorootnodes.get(startupobject)).add(fsstartup);
123 sourcenodes.put(fsstartup,fsstartup);
124 toprocess.add(fsstartup);
126 /** Looping through the flagstates in the toprocess queue to
127 * perform the state analysis */
128 while (!toprocess.isEmpty()) {
129 FlagState trigger=toprocess.poll();
130 createPossibleRuntimeStates(trigger);
132 analyseTasks(trigger);
135 /** Creating DOT files */
136 Enumeration e=flagstates.keys();
138 while (e.hasMoreElements()) {
139 ClassDescriptor cdtemp=(ClassDescriptor)e.nextElement();
140 createDOTfile(cdtemp);
145 /** Analyses the set of tasks based on the given flagstate, checking
146 * to see which tasks are triggered and what new flagstates are created
147 * from the base flagstate.
148 * @param fs A FlagState object which is used to analyse the task
152 private void analyseTasks(FlagState fs) {
153 ClassDescriptor cd=fs.getClassDescriptor();
154 Hashtable<FlagState,FlagState> sourcenodes=(Hashtable<FlagState,FlagState>)flagstates.get(cd);
156 for(Iterator it_tasks=state.getTaskSymbolTable().getDescriptorsIterator();it_tasks.hasNext();) {
157 TaskDescriptor td = (TaskDescriptor)it_tasks.next();
158 String taskname=td.getSymbol();
160 /** counter to keep track of the number of parameters (of the
161 * task being analyzed) that are satisfied by the flagstate.
164 TempDescriptor temp=null;
165 FlatMethod fm = state.getMethodFlat(td);
167 for(int i=0; i < td.numParameters(); i++) {
168 FlagExpressionNode fen=td.getFlag(td.getParameter(i));
169 TagExpressionList tel=td.getTag(td.getParameter(i));
171 /** Checking to see if the parameter is of the same
172 * type/class as the flagstate's and also if the
173 * flagstate fs triggers the given task*/
175 if (typeutil.isSuperorType(td.getParamType(i).getClassDesc(),cd)
176 && isTaskTrigger_flag(fen,fs)
177 && isTaskTrigger_tag(tel,fs)) {
178 temp=fm.getParameter(i);
183 if (trigger_ctr==0) //Look at next task
187 throw new Error("Illegal Operation: A single flagstate cannot satisfy more than one parameter of a task.");
190 Set newstates=taganalysis.getFlagStates(td);
191 for(Iterator fsit=newstates.iterator();fsit.hasNext();) {
192 FlagState fsnew=(FlagState) fsit.next();
193 fsnew.setAsSourceNode();
194 fsnew.addAllocatingTask(td);
195 ((Vector)cdtorootnodes.get(fsnew.getClassDescriptor())).add(fsnew);
197 if (! ((Hashtable<FlagState,FlagState>)flagstates.get(fsnew.getClassDescriptor())).containsKey(fsnew)) {
198 ((Hashtable<FlagState,FlagState>)flagstates.get(fsnew.getClassDescriptor())).put(fsnew, fsnew);
199 toprocess.add(fsnew);
203 Stack nodestack=new Stack();
204 HashSet discovered=new HashSet();
207 //Iterating through the nodes
209 while(!nodestack.isEmpty()) {
210 FlatNode fn1 = (FlatNode) nodestack.pop();
212 if (fn1.kind()==FKind.FlatReturnNode) {
214 FEdge newedge=new FEdge(fs, taskname, td);
217 } else if (fn1.kind()==FKind.FlatFlagActionNode) {
218 FlatFlagActionNode ffan=(FlatFlagActionNode)fn1;
219 if (ffan.getTaskType() == FlatFlagActionNode.PRE) {
220 if (ffan.getTempFlagPairs().hasNext()||ffan.getTempTagPairs().hasNext())
221 throw new Error("PRE FlagActions not supported");
223 } else if (ffan.getTaskType() == FlatFlagActionNode.TASKEXIT) {
224 Vector<FlagState> fsv_taskexit=evalTaskExitNode(ffan,cd,fs,temp);
225 for(Enumeration en=fsv_taskexit.elements();en.hasMoreElements();){
226 FlagState fs_taskexit=(FlagState)en.nextElement();
227 if (!sourcenodes.containsKey(fs_taskexit)) {
228 toprocess.add(fs_taskexit);
230 //seen this node already
231 fs_taskexit=canonicalizeFlagState(sourcenodes,fs_taskexit);
232 FEdge newedge=new FEdge(fs_taskexit,taskname, td);
238 /* Queue other nodes past this one */
239 for(int i=0;i<fn1.numNext();i++) {
240 FlatNode fnext=fn1.getNext(i);
241 if (!discovered.contains(fnext)) {
242 discovered.add(fnext);
243 nodestack.push(fnext);
251 /** Determines whether the given flagstate satisfies a
252 * single parameter in the given task.
253 * @param fen FlagExpressionNode
254 * @see FlagExpressionNode
255 * @param fs FlagState
257 * @return <CODE>true</CODE> if fs satisfies the boolean expression
258 denoted by fen else <CODE>false</CODE>.
262 private boolean isTaskTrigger_flag(FlagExpressionNode fen,FlagState fs) {
265 else if (fen instanceof FlagNode)
266 return fs.get(((FlagNode)fen).getFlag());
268 switch (((FlagOpNode)fen).getOp().getOp()) {
269 case Operation.LOGIC_AND:
270 return ((isTaskTrigger_flag(((FlagOpNode)fen).getLeft(),fs)) && (isTaskTrigger_flag(((FlagOpNode)fen).getRight(),fs)));
271 case Operation.LOGIC_OR:
272 return ((isTaskTrigger_flag(((FlagOpNode)fen).getLeft(),fs)) || (isTaskTrigger_flag(((FlagOpNode)fen).getRight(),fs)));
273 case Operation.LOGIC_NOT:
274 return !(isTaskTrigger_flag(((FlagOpNode)fen).getLeft(),fs));
280 private boolean isTaskTrigger_tag(TagExpressionList tel, FlagState fs){
283 for (int i=0;i<tel.numTags() ; i++){
284 switch (fs.getTagCount(tel.getType(i))){
285 case FlagState.ONETAG:
286 case FlagState.MULTITAGS:
288 case FlagState.NOTAGS:
296 /*private int tagTypeCount(TagExpressionList tel, String tagtype){
298 for(int i=0;i<tel.numTags() ; i++){
299 if (tel.getType(i).equals(tagtype))
305 private Vector<FlagState> evalTaskExitNode(FlatFlagActionNode ffan,ClassDescriptor cd,FlagState fs, TempDescriptor temp){
307 Vector<FlagState> processed=new Vector<FlagState>();
309 //Process the flag changes
311 for(Iterator it_tfp=ffan.getTempFlagPairs();it_tfp.hasNext();) {
312 TempFlagPair tfp=(TempFlagPair)it_tfp.next();
313 if (temp==tfp.getTemp())
314 fstemp=fstemp.setFlag(tfp.getFlag(),ffan.getFlagChange(tfp));
317 //Process the tag changes
319 processed.add(fstemp);
321 //Process clears first
322 for(Iterator it_ttp=ffan.getTempTagPairs();it_ttp.hasNext();) {
323 TempTagPair ttp=(TempTagPair)it_ttp.next();
325 if (temp==ttp.getTemp()) {
326 Vector<FlagState> oldprocess=processed;
327 processed=new Vector<FlagState>();
329 for (Enumeration en=oldprocess.elements();en.hasMoreElements();){
330 FlagState fsworking=(FlagState)en.nextElement();
331 if (!ffan.getTagChange(ttp)){
332 processed.addAll(Arrays.asList(fsworking.clearTag(ttp.getTag())));
333 } else processed.add(fsworking);
338 for(Iterator it_ttp=ffan.getTempTagPairs();it_ttp.hasNext();) {
339 TempTagPair ttp=(TempTagPair)it_ttp.next();
341 if (temp==ttp.getTemp()) {
342 Vector<FlagState> oldprocess=processed;
343 processed=new Vector<FlagState>();
345 for (Enumeration en=oldprocess.elements();en.hasMoreElements();){
346 FlagState fsworking=(FlagState)en.nextElement();
347 if (ffan.getTagChange(ttp)){
348 processed.addAll(Arrays.asList(fsworking.setTag(ttp.getTag())));
349 } else processed.add(fsworking);
357 private FlagState canonicalizeFlagState(Hashtable sourcenodes, FlagState fs){
358 if (sourcenodes.containsKey(fs))
359 return (FlagState)sourcenodes.get(fs);
361 sourcenodes.put(fs,fs);
366 /** Creates a DOT file using the flagstates for a given class
367 * @param cd ClassDescriptor of the class
368 * @throws java.io.IOException
369 * @see ClassDescriptor
372 public void createDOTfile(ClassDescriptor cd) throws java.io.IOException {
373 File dotfile_flagstates= new File("graph"+cd.getSymbol()+".dot");
374 FileOutputStream dotstream=new FileOutputStream(dotfile_flagstates,true);
375 FlagState.DOTVisitor.visit(dotstream,((Hashtable)flagstates.get(cd)).values());
378 /** Returns the flag states for the class descriptor. */
379 public Set<FlagState> getFlagStates(ClassDescriptor cd) {
380 if (flagstates.containsKey(cd))
381 return ((Hashtable<FlagState, FlagState>)flagstates.get(cd)).keySet();
387 private void createPossibleRuntimeStates(FlagState fs) {
388 ClassDescriptor cd = fs.getClassDescriptor();
389 Hashtable<FlagState,FlagState> sourcenodes=(Hashtable<FlagState,FlagState>)flagstates.get(cd);
390 FlagDescriptor[] fd=(FlagDescriptor[])flags.get(cd);
391 int externs=((Integer)extern_flags.get(cd)).intValue();
396 int noOfIterations=(1<<externs) - 1;
397 boolean BoolValTable[]=new boolean[externs];
400 for(int i=0; i < externs ; i++) {
401 BoolValTable[i]=fs.get(fd[i]);
404 for(int k=0; k<noOfIterations; k++) {
405 for(int j=0; j < externs ;j++) {
406 if ((k% (1<<j)) == 0)
407 BoolValTable[j]=(!BoolValTable[j]);
412 for(int i=0; i < externs;i++) {
413 fstemp=fstemp.setFlag(fd[i],BoolValTable[i]);
415 if (!sourcenodes.containsKey(fstemp))
416 toprocess.add(fstemp);
418 fstemp=canonicalizeFlagState(sourcenodes,fstemp);
419 fs.addEdge(new FEdge(fstemp,"Runtime", null));
423 public Vector getRootNodes(ClassDescriptor cd){
424 return (Vector)cdtorootnodes.get(cd);