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 TASK=false;
52 public boolean FASTCHECK=false;
53 public boolean DSM=false;
54 public boolean PREFETCH=false;
55 public boolean TASKSTATE=false;
56 public boolean TAGSTATE=false;
57 public boolean FLATIRGRAPH=false;
58 public boolean FLATIRGRAPHTASKS=false;
59 public boolean FLATIRGRAPHUSERMETHODS=false;
60 public boolean FLATIRGRAPHLIBMETHODS=false;
61 public boolean MULTICORE=false;
62 public boolean OWNERSHIP=false;
63 public int OWNERSHIPALLOCDEPTH=3;
64 public boolean OWNERSHIPWRITEDOTS=false;
65 public boolean OWNERSHIPWRITEALL=false;
66 public String OWNERSHIPALIASFILE=null;
67 public boolean OPTIONAL=false;
68 public boolean ARRAYBOUNDARYCHECK=true;
69 public boolean RAW=false;
70 public boolean SCHEDULING=false;
71 public boolean USEPROFILE=false;
72 public boolean THREAD=false;
73 public boolean CONSCHECK=false;
74 public boolean INSTRUCTIONFAILURE=false;
75 public boolean MLP=false;
76 public static double TRUEPROB=0.8;
77 public static boolean PRINTFLAT=false;
78 public static boolean PRINTSCHEDULING=false;
79 public static boolean PRINTSCHEDULESIM=false;
80 public static boolean PRINTCRITICALPATH=false;
81 public static boolean ABORTREADERS=false;
82 public static boolean SINGLETM=false;
83 public int CORENUM = 1;
84 public String structfile;
86 public String outputdir = "/scratch/";
88 public HashSet selfloops;
89 public HashSet excprefetch;
90 public Vector classpath;
91 public SymbolTable classes;
92 public SymbolTable tasks;
93 public Set parsetrees;
94 public Hashtable treemethodmap;
95 public Hashtable flatmethodmap;
96 private HashSet arraytypes;
97 public Hashtable arraytonumber;
98 private int numclasses=0;
99 private int numtasks=0;
100 private int arraycount=0;
101 public boolean OPTIMIZE=false;
104 private Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> optionaltaskdescriptors;
105 private Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> analysisresults;
107 private Hashtable tagmap;
108 private int numtags=0;
110 public void addArrayType(TypeDescriptor td) {
111 if (!arraytypes.contains(td)) {
113 arraytonumber.put(td,new Integer(arraycount++));
117 public Iterator getArrayIterator() {
118 return arraytypes.iterator();
121 public int getTagId(TagDescriptor tag) {
122 if (tagmap.containsKey(tag)) {
123 return ((Integer) tagmap.get(tag)).intValue();
125 tagmap.put(tag, new Integer(numtags));
130 public int getArrayNumber(TypeDescriptor td) {
131 if (arraytonumber.containsKey(td))
132 return ((Integer)arraytonumber.get(td)).intValue();
136 public int numArrays() {
137 return arraytypes.size();
140 public static TypeDescriptor getTypeDescriptor(int t) {
141 TypeDescriptor td=new TypeDescriptor(t);
145 public static TypeDescriptor getTypeDescriptor(NameDescriptor n) {
146 TypeDescriptor td=new TypeDescriptor(n);
150 public void addClass(ClassDescriptor tdn) {
151 if (classes.contains(tdn.getSymbol()))
152 throw new Error("Class "+tdn.getSymbol()+" defined twice");
157 public int numClasses() {
161 public BlockNode getMethodBody(MethodDescriptor md) {
162 return (BlockNode)treemethodmap.get(md);
165 public BlockNode getMethodBody(TaskDescriptor td) {
166 return (BlockNode)treemethodmap.get(td);
169 public SymbolTable getClassSymbolTable() {
173 public SymbolTable getTaskSymbolTable() {
177 /** Returns Flat IR representation of MethodDescriptor md. */
179 public FlatMethod getMethodFlat(MethodDescriptor md) {
180 return (FlatMethod)flatmethodmap.get(md);
183 /** Returns Flat IR representation of TaskDescriptor td. */
185 public FlatMethod getMethodFlat(TaskDescriptor td) {
186 return (FlatMethod)flatmethodmap.get(td);
189 public void addTreeCode(MethodDescriptor md, BlockNode bn) {
190 treemethodmap.put(md,bn);
193 public void addTreeCode(TaskDescriptor td, BlockNode bn) {
194 treemethodmap.put(td,bn);
197 public void addFlatCode(MethodDescriptor md, FlatMethod bn) {
198 flatmethodmap.put(md,bn);
201 public void addFlatCode(TaskDescriptor td, FlatMethod bn) {
202 flatmethodmap.put(td,bn);
205 public void addTask(TaskDescriptor td) {
206 if (tasks.contains(td.getSymbol()))
207 throw new Error("Task "+td.getSymbol()+" defined twice");