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();
20 public void addParseNode(ParseNode parsetree) {
21 parsetrees.add(parsetree);
24 public void storeAnalysisResult(Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> analysisresults) {
25 this.analysisresults=analysisresults;
28 public Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> getAnalysisResult() {
29 return analysisresults;
33 public void storeOptionalTaskDescriptors(Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> optionaltaskdescriptors){
34 this.optionaltaskdescriptors=optionaltaskdescriptors;
37 public Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> getOptionalTaskDescriptors(){
38 return optionaltaskdescriptors;
41 /** Boolean flag which indicates whether compiler is compiling a task-based
43 public boolean WEBINTERFACE=false;
44 public boolean TASK=false;
45 public boolean DSM=false;
46 public boolean PREFETCH=false;
47 public boolean TASKSTATE=false;
48 public boolean OPTIONAL=false;
49 public boolean THREAD=false;
50 public boolean CONSCHECK=false;
51 public boolean INSTRUCTIONFAILURE=false;
52 public String structfile;
55 public SymbolTable classes;
56 public SymbolTable tasks;
57 public Set parsetrees;
58 public Hashtable treemethodmap;
59 public Hashtable flatmethodmap;
60 private HashSet arraytypes;
61 public Hashtable arraytonumber;
62 private int numclasses=0;
63 private int numtasks=0;
64 private int arraycount=0;
67 private Hashtable<ClassDescriptor, Hashtable<OptionalTaskDescriptor, OptionalTaskDescriptor>> optionaltaskdescriptors;
68 private Hashtable<ClassDescriptor, Hashtable<FlagState, Set<OptionalTaskDescriptor>>> analysisresults;
70 private Hashtable tagmap;
71 private int numtags=0;
73 public void addArrayType(TypeDescriptor td) {
74 if (!arraytypes.contains(td)) {
76 arraytonumber.put(td,new Integer(arraycount++));
80 public Iterator getArrayIterator() {
81 return arraytypes.iterator();
84 public int getTagId(TagDescriptor tag) {
85 if (tagmap.containsKey(tag)) {
86 return ((Integer) tagmap.get(tag)).intValue();
88 tagmap.put(tag, new Integer(numtags));
93 public int getArrayNumber(TypeDescriptor td) {
94 return ((Integer)arraytonumber.get(td)).intValue();
97 public int numArrays() {
98 return arraytypes.size();
101 public static TypeDescriptor getTypeDescriptor(int t) {
102 TypeDescriptor td=new TypeDescriptor(t);
106 public static TypeDescriptor getTypeDescriptor(NameDescriptor n) {
107 TypeDescriptor td=new TypeDescriptor(n);
111 public void addClass(ClassDescriptor tdn) {
112 if (classes.contains(tdn.getSymbol()))
113 throw new Error("Class "+tdn.getSymbol()+" defined twice");
118 public int numClasses() {
122 public BlockNode getMethodBody(MethodDescriptor md) {
123 return (BlockNode)treemethodmap.get(md);
126 public BlockNode getMethodBody(TaskDescriptor td) {
127 return (BlockNode)treemethodmap.get(td);
130 public SymbolTable getClassSymbolTable() {
134 public SymbolTable getTaskSymbolTable() {
138 /** Returns Flat IR representation of MethodDescriptor md. */
140 public FlatMethod getMethodFlat(MethodDescriptor md) {
141 return (FlatMethod)flatmethodmap.get(md);
144 /** Returns Flat IR representation of TaskDescriptor td. */
146 public FlatMethod getMethodFlat(TaskDescriptor td) {
147 return (FlatMethod)flatmethodmap.get(td);
150 public void addTreeCode(MethodDescriptor md, BlockNode bn) {
151 treemethodmap.put(md,bn);
154 public void addTreeCode(TaskDescriptor td, BlockNode bn) {
155 treemethodmap.put(td,bn);
158 public void addFlatCode(MethodDescriptor md, FlatMethod bn) {
159 flatmethodmap.put(md,bn);
162 public void addFlatCode(TaskDescriptor td, FlatMethod bn) {
163 flatmethodmap.put(td,bn);
166 public void addTask(TaskDescriptor td) {
167 if (tasks.contains(td.getSymbol()))
168 throw new Error("Task "+td.getSymbol()+" defined twice");