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 int CORENUM = 1;
86 public String structfile;
88 public String outputdir = "/scratch/";
89 public boolean INLINEATOMIC=false;
90 public int inlineatomicdepth;
91 public HashSet selfloops;
92 public HashSet excprefetch;
93 public Vector classpath;
94 public SymbolTable classes;
95 public SymbolTable tasks;
96 public Set parsetrees;
97 public Hashtable treemethodmap;
98 public Hashtable flatmethodmap;
99 private HashSet arraytypes;
100 public Hashtable arraytonumber;
101 private int numclasses=0;
102 private int numtasks=0;
103 private int arraycount=0;
104 public boolean OPTIMIZE=false;
105 public boolean DCOPTS=false;
106 public boolean DELAYCOMP=false;
109 private Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> optionaltaskdescriptors;
110 private Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> analysisresults;
112 private Hashtable tagmap;
113 private int numtags=0;
115 public void addArrayType(TypeDescriptor td) {
116 if (!arraytypes.contains(td)) {
118 arraytonumber.put(td,new Integer(arraycount++));
122 public Iterator getArrayIterator() {
123 return arraytypes.iterator();
126 public int getTagId(TagDescriptor tag) {
127 if (tagmap.containsKey(tag)) {
128 return ((Integer) tagmap.get(tag)).intValue();
130 tagmap.put(tag, new Integer(numtags));
135 public int getArrayNumber(TypeDescriptor td) {
136 if (arraytonumber.containsKey(td))
137 return ((Integer)arraytonumber.get(td)).intValue();
141 public int numArrays() {
142 return arraytypes.size();
145 public static TypeDescriptor getTypeDescriptor(int t) {
146 TypeDescriptor td=new TypeDescriptor(t);
150 public static TypeDescriptor getTypeDescriptor(NameDescriptor n) {
151 TypeDescriptor td=new TypeDescriptor(n);
155 public void addClass(ClassDescriptor tdn) {
156 if (classes.contains(tdn.getSymbol()))
157 throw new Error("Class "+tdn.getSymbol()+" defined twice");
162 public int numClasses() {
166 public BlockNode getMethodBody(MethodDescriptor md) {
167 return (BlockNode)treemethodmap.get(md);
170 public BlockNode getMethodBody(TaskDescriptor td) {
171 return (BlockNode)treemethodmap.get(td);
174 public SymbolTable getClassSymbolTable() {
178 public SymbolTable getTaskSymbolTable() {
182 /** Returns Flat IR representation of MethodDescriptor md. */
184 public FlatMethod getMethodFlat(MethodDescriptor md) {
185 return (FlatMethod)flatmethodmap.get(md);
188 /** Returns Flat IR representation of TaskDescriptor td. */
190 public FlatMethod getMethodFlat(TaskDescriptor td) {
191 return (FlatMethod)flatmethodmap.get(td);
194 // The descriptor is either a method or task desc
195 // and should call one of the above methods
196 public FlatMethod getMethodFlat(Descriptor d) {
198 if( d instanceof MethodDescriptor ) {
199 fm = getMethodFlat( (MethodDescriptor) d);
201 assert d instanceof TaskDescriptor;
202 fm = getMethodFlat( (TaskDescriptor) d);
207 public void addTreeCode(MethodDescriptor md, BlockNode bn) {
208 treemethodmap.put(md,bn);
211 public void addTreeCode(TaskDescriptor td, BlockNode bn) {
212 treemethodmap.put(td,bn);
215 public void addFlatCode(MethodDescriptor md, FlatMethod bn) {
216 flatmethodmap.put(md,bn);
219 public void addFlatCode(TaskDescriptor td, FlatMethod bn) {
220 flatmethodmap.put(td,bn);
223 public void addTask(TaskDescriptor td) {
224 if (tasks.contains(td.getSymbol()))
225 throw new Error("Task "+td.getSymbol()+" defined twice");