6 import Analysis.TaskStateAnalysis.*;
12 this.classes=new SymbolTable();
13 this.tasks=new SymbolTable();
14 this.treemethodmap=new Hashtable();
15 this.flatmethodmap=new Hashtable();
16 this.parsetrees=new HashSet();
17 this.arraytypes=new HashSet();
18 this.arraytonumber=new Hashtable();
19 this.tagmap=new Hashtable();
20 this.selfloops=new HashSet();
21 this.excprefetch=new HashSet();
22 this.classpath=new Vector();
26 public void addParseNode(ParseNode parsetree) {
27 parsetrees.add(parsetree);
30 public void storeAnalysisResult(Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> analysisresults) {
31 this.analysisresults=analysisresults;
34 public Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> getAnalysisResult() {
35 return analysisresults;
39 public void storeOptionalTaskDescriptors(Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> optionaltaskdescriptors) {
40 this.optionaltaskdescriptors=optionaltaskdescriptors;
43 public Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> getOptionalTaskDescriptors() {
44 return optionaltaskdescriptors;
48 /** Boolean flag which indicates whether compiler is compiling a task-based
50 public boolean WEBINTERFACE=false;
51 public boolean MINIMIZE=false;
52 public boolean TASK=false;
53 public boolean FASTCHECK=false;
54 public boolean DSM=false;
55 public boolean PREFETCH=false;
56 public boolean TASKSTATE=false;
57 public boolean TAGSTATE=false;
58 public boolean FLATIRGRAPH=false;
59 public boolean FLATIRGRAPHTASKS=false;
60 public boolean FLATIRGRAPHUSERMETHODS=false;
61 public boolean FLATIRGRAPHLIBMETHODS=false;
62 public boolean MULTICORE=false;
63 public boolean OWNERSHIP=false;
64 public int OWNERSHIPALLOCDEPTH=3;
65 public boolean OWNERSHIPWRITEDOTS=false;
66 public boolean OWNERSHIPWRITEALL=false;
67 public String OWNERSHIPALIASFILE=null;
68 public boolean OPTIONAL=false;
69 public boolean ARRAYBOUNDARYCHECK=true;
70 public boolean RAW=false;
71 public boolean SCHEDULING=false;
72 public boolean USEPROFILE=false;
73 public boolean THREAD=false;
74 public boolean CONSCHECK=false;
75 public boolean INSTRUCTIONFAILURE=false;
76 public boolean MLP=false;
77 public boolean MLPDEBUG=false;
78 public static double TRUEPROB=0.8;
79 public static boolean PRINTFLAT=false;
80 public static boolean PRINTSCHEDULING=false;
81 public static boolean PRINTSCHEDULESIM=false;
82 public static boolean PRINTCRITICALPATH=false;
83 public static boolean ABORTREADERS=false;
84 public static boolean SINGLETM=false;
85 public static boolean READSET=false;
86 public int CORENUM = 1;
87 public String structfile;
89 public String outputdir = "/scratch/";
90 public boolean INLINEATOMIC=false;
91 public int inlineatomicdepth;
92 public HashSet selfloops;
93 public HashSet excprefetch;
94 public Vector classpath;
95 public SymbolTable classes;
96 public SymbolTable tasks;
97 public Set parsetrees;
98 public Hashtable treemethodmap;
99 public Hashtable flatmethodmap;
100 private HashSet arraytypes;
101 public Hashtable arraytonumber;
102 private int numclasses=0;
103 private int numtasks=0;
104 private int arraycount=0;
105 public boolean OPTIMIZE=false;
106 public boolean DCOPTS=false;
107 public boolean DELAYCOMP=false;
110 private Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> optionaltaskdescriptors;
111 private Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> analysisresults;
113 private Hashtable tagmap;
114 private int numtags=0;
116 public void addArrayType(TypeDescriptor td) {
117 if (!arraytypes.contains(td)) {
119 arraytonumber.put(td,new Integer(arraycount++));
123 public Iterator getArrayIterator() {
124 return arraytypes.iterator();
127 public int getTagId(TagDescriptor tag) {
128 if (tagmap.containsKey(tag)) {
129 return ((Integer) tagmap.get(tag)).intValue();
131 tagmap.put(tag, new Integer(numtags));
136 public int getArrayNumber(TypeDescriptor td) {
137 if (arraytonumber.containsKey(td))
138 return ((Integer)arraytonumber.get(td)).intValue();
142 public int numArrays() {
143 return arraytypes.size();
146 public static TypeDescriptor getTypeDescriptor(int t) {
147 TypeDescriptor td=new TypeDescriptor(t);
151 public static TypeDescriptor getTypeDescriptor(NameDescriptor n) {
152 TypeDescriptor td=new TypeDescriptor(n);
156 public void addClass(ClassDescriptor tdn) {
157 if (classes.contains(tdn.getSymbol()))
158 throw new Error("Class "+tdn.getSymbol()+" defined twice");
163 public int numClasses() {
167 public BlockNode getMethodBody(MethodDescriptor md) {
168 return (BlockNode)treemethodmap.get(md);
171 public BlockNode getMethodBody(TaskDescriptor td) {
172 return (BlockNode)treemethodmap.get(td);
175 public SymbolTable getClassSymbolTable() {
179 public SymbolTable getTaskSymbolTable() {
183 /** Returns Flat IR representation of MethodDescriptor md. */
185 public FlatMethod getMethodFlat(MethodDescriptor md) {
186 return (FlatMethod)flatmethodmap.get(md);
189 /** Returns Flat IR representation of TaskDescriptor td. */
191 public FlatMethod getMethodFlat(TaskDescriptor td) {
192 return (FlatMethod)flatmethodmap.get(td);
195 // The descriptor is either a method or task desc
196 // and should call one of the above methods
197 public FlatMethod getMethodFlat(Descriptor d) {
199 if( d instanceof MethodDescriptor ) {
200 fm = getMethodFlat( (MethodDescriptor) d);
202 assert d instanceof TaskDescriptor;
203 fm = getMethodFlat( (TaskDescriptor) d);
208 public void addTreeCode(MethodDescriptor md, BlockNode bn) {
209 treemethodmap.put(md,bn);
212 public void addTreeCode(TaskDescriptor td, BlockNode bn) {
213 treemethodmap.put(td,bn);
216 public void addFlatCode(MethodDescriptor md, FlatMethod bn) {
217 flatmethodmap.put(md,bn);
220 public void addFlatCode(TaskDescriptor td, FlatMethod bn) {
221 flatmethodmap.put(td,bn);
224 public void addTask(TaskDescriptor td) {
225 if (tasks.contains(td.getSymbol()))
226 throw new Error("Task "+td.getSymbol()+" defined twice");