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 static double TRUEPROB=0.8;
76 public static boolean PRINTFLAT=false;
77 public static boolean PRINTSCHEDULING=false;
78 public static boolean PRINTSCHEDULESIM=false;
79 public static boolean PRINTCRITICALPATH=false;
80 public static boolean ABORTREADERS=false;
81 public int CORENUM = 1;
82 public String structfile;
84 public String outputdir = "/scratch/";
86 public HashSet selfloops;
87 public HashSet excprefetch;
88 public Vector classpath;
89 public SymbolTable classes;
90 public SymbolTable tasks;
91 public Set parsetrees;
92 public Hashtable treemethodmap;
93 public Hashtable flatmethodmap;
94 private HashSet arraytypes;
95 public Hashtable arraytonumber;
96 private int numclasses=0;
97 private int numtasks=0;
98 private int arraycount=0;
102 private Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> optionaltaskdescriptors;
103 private Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> analysisresults;
105 private Hashtable tagmap;
106 private int numtags=0;
108 public void addArrayType(TypeDescriptor td) {
109 if (!arraytypes.contains(td)) {
111 arraytonumber.put(td,new Integer(arraycount++));
115 public Iterator getArrayIterator() {
116 return arraytypes.iterator();
119 public int getTagId(TagDescriptor tag) {
120 if (tagmap.containsKey(tag)) {
121 return ((Integer) tagmap.get(tag)).intValue();
123 tagmap.put(tag, new Integer(numtags));
128 public int getArrayNumber(TypeDescriptor td) {
129 if (arraytonumber.containsKey(td))
130 return ((Integer)arraytonumber.get(td)).intValue();
134 public int numArrays() {
135 return arraytypes.size();
138 public static TypeDescriptor getTypeDescriptor(int t) {
139 TypeDescriptor td=new TypeDescriptor(t);
143 public static TypeDescriptor getTypeDescriptor(NameDescriptor n) {
144 TypeDescriptor td=new TypeDescriptor(n);
148 public void addClass(ClassDescriptor tdn) {
149 if (classes.contains(tdn.getSymbol()))
150 throw new Error("Class "+tdn.getSymbol()+" defined twice");
155 public int numClasses() {
159 public BlockNode getMethodBody(MethodDescriptor md) {
160 return (BlockNode)treemethodmap.get(md);
163 public BlockNode getMethodBody(TaskDescriptor td) {
164 return (BlockNode)treemethodmap.get(td);
167 public SymbolTable getClassSymbolTable() {
171 public SymbolTable getTaskSymbolTable() {
175 /** Returns Flat IR representation of MethodDescriptor md. */
177 public FlatMethod getMethodFlat(MethodDescriptor md) {
178 return (FlatMethod)flatmethodmap.get(md);
181 /** Returns Flat IR representation of TaskDescriptor td. */
183 public FlatMethod getMethodFlat(TaskDescriptor td) {
184 return (FlatMethod)flatmethodmap.get(td);
187 public void addTreeCode(MethodDescriptor md, BlockNode bn) {
188 treemethodmap.put(md,bn);
191 public void addTreeCode(TaskDescriptor td, BlockNode bn) {
192 treemethodmap.put(td,bn);
195 public void addFlatCode(MethodDescriptor md, FlatMethod bn) {
196 flatmethodmap.put(md,bn);
199 public void addFlatCode(TaskDescriptor td, FlatMethod bn) {
200 flatmethodmap.put(td,bn);
203 public void addTask(TaskDescriptor td) {
204 if (tasks.contains(td.getSymbol()))
205 throw new Error("Task "+td.getSymbol()+" defined twice");