6 import Analysis.TaskStateAnalysis.*;
10 this.classes=new SymbolTable();
11 this.tasks=new SymbolTable();
12 this.treemethodmap=new Hashtable();
13 this.flatmethodmap=new Hashtable();
14 this.parsetrees=new HashSet();
15 this.arraytypes=new HashSet();
16 this.arraytonumber=new Hashtable();
17 this.tagmap=new Hashtable();
18 this.selfloops=new HashSet();
19 this.excprefetch=new HashSet();
22 public void addParseNode(ParseNode parsetree) {
23 parsetrees.add(parsetree);
26 public void storeAnalysisResult(Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> analysisresults) {
27 this.analysisresults=analysisresults;
30 public Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> getAnalysisResult() {
31 return analysisresults;
35 public void storeOptionalTaskDescriptors(Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> optionaltaskdescriptors) {
36 this.optionaltaskdescriptors=optionaltaskdescriptors;
39 public Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> getOptionalTaskDescriptors() {
40 return optionaltaskdescriptors;
44 /** Boolean flag which indicates whether compiler is compiling a task-based
46 public boolean WEBINTERFACE=false;
47 public boolean TASK=false;
48 public boolean FASTCHECK=false;
49 public boolean DSM=false;
50 public boolean PREFETCH=false;
51 public boolean TASKSTATE=false;
52 public boolean TAGSTATE=false;
53 public boolean FLATIRGRAPH=false;
54 public boolean FLATIRGRAPHTASKS=false;
55 public boolean FLATIRGRAPHUSERMETHODS=false;
56 public boolean FLATIRGRAPHLIBMETHODS=false;
57 public boolean MULTICORE=false;
58 public boolean OWNERSHIP=false;
59 public int OWNERSHIPALLOCDEPTH=3;
60 public boolean OWNERSHIPWRITEDOTS=false;
61 public boolean OWNERSHIPWRITEALL=false;
62 public String OWNERSHIPALIASFILE=null;
63 public boolean OPTIONAL=false;
64 public boolean ARRAYBOUNDARYCHECK=true;
65 public boolean RAW=false;
66 public boolean SCHEDULING=false;
67 public boolean USEPROFILE=false;
68 public boolean THREAD=false;
69 public boolean CONSCHECK=false;
70 public boolean INSTRUCTIONFAILURE=false;
71 public static double TRUEPROB=0.8;
72 public static boolean PRINTFLAT=false;
73 public static boolean PRINTSCHEDULING=false;
74 public static boolean PRINTSCHEDULESIM=false;
75 public int CORENUM = 1;
76 public String structfile;
79 public HashSet selfloops;
80 public HashSet excprefetch;
81 public SymbolTable classes;
82 public SymbolTable tasks;
83 public Set parsetrees;
84 public Hashtable treemethodmap;
85 public Hashtable flatmethodmap;
86 private HashSet arraytypes;
87 public Hashtable arraytonumber;
88 private int numclasses=0;
89 private int numtasks=0;
90 private int arraycount=0;
94 private Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> optionaltaskdescriptors;
95 private Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> analysisresults;
97 private Hashtable tagmap;
98 private int numtags=0;
100 public void addArrayType(TypeDescriptor td) {
101 if (!arraytypes.contains(td)) {
103 arraytonumber.put(td,new Integer(arraycount++));
107 public Iterator getArrayIterator() {
108 return arraytypes.iterator();
111 public int getTagId(TagDescriptor tag) {
112 if (tagmap.containsKey(tag)) {
113 return ((Integer) tagmap.get(tag)).intValue();
115 tagmap.put(tag, new Integer(numtags));
120 public int getArrayNumber(TypeDescriptor td) {
121 if (arraytonumber.containsKey(td))
122 return ((Integer)arraytonumber.get(td)).intValue();
123 else throw new Error("Could not find array type:" + td.toPrettyString());
126 public int numArrays() {
127 return arraytypes.size();
130 public static TypeDescriptor getTypeDescriptor(int t) {
131 TypeDescriptor td=new TypeDescriptor(t);
135 public static TypeDescriptor getTypeDescriptor(NameDescriptor n) {
136 TypeDescriptor td=new TypeDescriptor(n);
140 public void addClass(ClassDescriptor tdn) {
141 if (classes.contains(tdn.getSymbol()))
142 throw new Error("Class "+tdn.getSymbol()+" defined twice");
147 public int numClasses() {
151 public BlockNode getMethodBody(MethodDescriptor md) {
152 return (BlockNode)treemethodmap.get(md);
155 public BlockNode getMethodBody(TaskDescriptor td) {
156 return (BlockNode)treemethodmap.get(td);
159 public SymbolTable getClassSymbolTable() {
163 public SymbolTable getTaskSymbolTable() {
167 /** Returns Flat IR representation of MethodDescriptor md. */
169 public FlatMethod getMethodFlat(MethodDescriptor md) {
170 return (FlatMethod)flatmethodmap.get(md);
173 /** Returns Flat IR representation of TaskDescriptor td. */
175 public FlatMethod getMethodFlat(TaskDescriptor td) {
176 return (FlatMethod)flatmethodmap.get(td);
179 public void addTreeCode(MethodDescriptor md, BlockNode bn) {
180 treemethodmap.put(md,bn);
183 public void addTreeCode(TaskDescriptor td, BlockNode bn) {
184 treemethodmap.put(td,bn);
187 public void addFlatCode(MethodDescriptor md, FlatMethod bn) {
188 flatmethodmap.put(md,bn);
191 public void addFlatCode(TaskDescriptor td, FlatMethod bn) {
192 flatmethodmap.put(td,bn);
195 public void addTask(TaskDescriptor td) {
196 if (tasks.contains(td.getSymbol()))
197 throw new Error("Task "+td.getSymbol()+" defined twice");