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 RAW=false;
65 public boolean SCHEDULING=false;
66 public boolean USEPROFILE=false;
67 public boolean THREAD=false;
68 public boolean CONSCHECK=false;
69 public boolean INSTRUCTIONFAILURE=false;
70 public static double TRUEPROB=0.8;
71 public static boolean PRINTFLAT=false;
72 public static boolean PRINTSCHEDULING=false;
73 public static boolean PRINTSCHEDULESIM=false;
74 public int CORENUM = 1;
75 public String structfile;
78 public HashSet selfloops;
79 public HashSet excprefetch;
80 public SymbolTable classes;
81 public SymbolTable tasks;
82 public Set parsetrees;
83 public Hashtable treemethodmap;
84 public Hashtable flatmethodmap;
85 private HashSet arraytypes;
86 public Hashtable arraytonumber;
87 private int numclasses=0;
88 private int numtasks=0;
89 private int arraycount=0;
93 private Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> optionaltaskdescriptors;
94 private Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> analysisresults;
96 private Hashtable tagmap;
97 private int numtags=0;
99 public void addArrayType(TypeDescriptor td) {
100 if (!arraytypes.contains(td)) {
102 arraytonumber.put(td,new Integer(arraycount++));
106 public Iterator getArrayIterator() {
107 return arraytypes.iterator();
110 public int getTagId(TagDescriptor tag) {
111 if (tagmap.containsKey(tag)) {
112 return ((Integer) tagmap.get(tag)).intValue();
114 tagmap.put(tag, new Integer(numtags));
119 public int getArrayNumber(TypeDescriptor td) {
120 if (arraytonumber.containsKey(td))
121 return ((Integer)arraytonumber.get(td)).intValue();
122 else throw new Error("Could not find array type:" + td.toPrettyString());
125 public int numArrays() {
126 return arraytypes.size();
129 public static TypeDescriptor getTypeDescriptor(int t) {
130 TypeDescriptor td=new TypeDescriptor(t);
134 public static TypeDescriptor getTypeDescriptor(NameDescriptor n) {
135 TypeDescriptor td=new TypeDescriptor(n);
139 public void addClass(ClassDescriptor tdn) {
140 if (classes.contains(tdn.getSymbol()))
141 throw new Error("Class "+tdn.getSymbol()+" defined twice");
146 public int numClasses() {
150 public BlockNode getMethodBody(MethodDescriptor md) {
151 return (BlockNode)treemethodmap.get(md);
154 public BlockNode getMethodBody(TaskDescriptor td) {
155 return (BlockNode)treemethodmap.get(td);
158 public SymbolTable getClassSymbolTable() {
162 public SymbolTable getTaskSymbolTable() {
166 /** Returns Flat IR representation of MethodDescriptor md. */
168 public FlatMethod getMethodFlat(MethodDescriptor md) {
169 return (FlatMethod)flatmethodmap.get(md);
172 /** Returns Flat IR representation of TaskDescriptor td. */
174 public FlatMethod getMethodFlat(TaskDescriptor td) {
175 return (FlatMethod)flatmethodmap.get(td);
178 public void addTreeCode(MethodDescriptor md, BlockNode bn) {
179 treemethodmap.put(md,bn);
182 public void addTreeCode(TaskDescriptor td, BlockNode bn) {
183 treemethodmap.put(td,bn);
186 public void addFlatCode(MethodDescriptor md, FlatMethod bn) {
187 flatmethodmap.put(md,bn);
190 public void addFlatCode(TaskDescriptor td, FlatMethod bn) {
191 flatmethodmap.put(td,bn);
194 public void addTask(TaskDescriptor td) {
195 if (tasks.contains(td.getSymbol()))
196 throw new Error("Task "+td.getSymbol()+" defined twice");