12 public UpdateNode(Rule r) {
14 bindings=new Vector();
15 binding=new Hashtable();
19 public Rule getRule() {
23 public String toString() {
25 for(int i=0;i<bindings.size();i++)
26 st+=bindings.get(i).toString()+"\n";
27 st+="---------------------\n";
28 for(int i=0;i<updates.size();i++)
29 st+=updates.get(i).toString()+"\n";
33 public void addBindings(Vector v) {
34 for (int i=0;i<v.size();i++) {
35 addBinding((Binding)v.get(i));
39 public boolean checkupdates() {
40 if (!checkconflicts()) /* Do we have conflicting concrete updates */
42 if (computeordering()) /* Ordering exists */
47 private boolean computeordering() {
48 /* Build dependency graph between updates */
49 HashSet graph=new HashSet();
50 Hashtable mapping=new Hashtable();
51 for(int i=0;i<updates.size();i++) {
52 Updates u=(Updates)updates.get(i);
53 GraphNode gn=new GraphNode(String.valueOf(i),u);
57 for(int i=0;i<updates.size();i++) {
58 Updates u1=(Updates)updates.get(i);
61 for(int j=0;j<updates.size();j++) {
62 Updates u2=(Updates)updates.get(j);
65 Descriptor d=u1.getDescriptor();
66 if (u2.getRightExpr().usesDescriptor(d)) {
67 /* Add edge for dependency */
68 GraphNode gn1=(GraphNode) mapping.get(u1);
69 GraphNode gn2=(GraphNode) mapping.get(u2);
70 GraphNode.Edge e=new GraphNode.Edge("dependency",gn2);
76 if (!GraphNode.DFS.depthFirstSearch(graph)) /* DFS & check for acyclicity */
79 TreeSet topologicalsort = new TreeSet(new Comparator() {
80 public boolean equals(Object obj) { return false; }
81 public int compare(Object o1, Object o2) {
82 GraphNode g1 = (GraphNode) o1;
83 GraphNode g2 = (GraphNode) o2;
84 return g2.getFinishingTime() - g1.getFinishingTime();
87 topologicalsort.addAll(graph);
88 Vector sortedvector=new Vector();
89 for(Iterator sort=topologicalsort.iterator();sort.hasNext();) {
90 GraphNode gn=(GraphNode)sort.next();
91 sortedvector.add(gn.getOwner());
93 updates=sortedvector; //replace updates with the sorted array
97 private boolean checkconflicts() {
98 Set toremove=new HashSet();
99 for(int i=0;i<updates.size();i++) {
100 Updates u1=(Updates)updates.get(i);
101 for(int j=0;j<updates.size();j++) {
102 Updates u2=(Updates)updates.get(j);
105 if (u1.isAbstract()||u2.isAbstract())
106 continue; /* Abstract updates are already accounted for by graph */
107 if (u1.getDescriptor()!=u2.getDescriptor())
108 continue; /* No interference - different descriptors */
110 if ((u1.getOpcode()==Opcode.GT||u1.getOpcode()==Opcode.GE)&&
111 (u2.getOpcode()==Opcode.GT||u2.getOpcode()==Opcode.GE))
112 continue; /* Can be satisfied simultaneously */
114 if ((u1.getOpcode()==Opcode.LT||u1.getOpcode()==Opcode.LE)&&
115 (u2.getOpcode()==Opcode.LT||u2.getOpcode()==Opcode.LE))
117 if ((u1.getOpcode()==u2.getOpcode())&&
118 u1.isExpr()&&u2.isExpr()&&
119 u1.getRightExpr().equals(null, u2.getRightExpr())) {
120 /*We'll remove the second occurence*/
128 /* Handle = or != NULL */
129 if ((((u1.getOpcode()==Opcode.EQ)&&(u2.getOpcode()==Opcode.NE))||
130 ((u1.getOpcode()==Opcode.NE)&&(u2.getOpcode()==Opcode.EQ)))&&
131 (((u1.isExpr()&&u1.getRightExpr().isNull())&&(!u2.isExpr()||u2.getRightExpr().isNonNull()))
132 ||((!u1.isExpr()||u1.getRightExpr().isNonNull())&&(u2.isExpr()&&u2.getRightExpr().isNull())))) {
133 if (u1.getOpcode()==Opcode.NE)
140 /* Handle = and != to different constants */
141 if ((((u1.getOpcode()==Opcode.EQ)&&(u2.getOpcode()==Opcode.NE))||
142 ((u1.getOpcode()==Opcode.NE)&&(u2.getOpcode()==Opcode.EQ)))&&
143 (u1.isExpr()&&u1.getRightExpr() instanceof LiteralExpr)&&
144 (u2.isExpr()&&u2.getRightExpr() instanceof LiteralExpr)&&
145 !u1.getRightExpr().equals(u2.getRightExpr())) {
146 if (u1.getOpcode()==Opcode.NE)
153 /* Compatible operations < & <= */
154 if (((u1.getOpcode()==Opcode.LT)||(u1.getOpcode()==Opcode.LE))&&
155 ((u2.getOpcode()==Opcode.LT)||(u2.getOpcode()==Opcode.LE)))
158 /* Compatible operations > & >= */
159 if (((u1.getOpcode()==Opcode.GT)||(u1.getOpcode()==Opcode.GE))&&
160 ((u2.getOpcode()==Opcode.GT)||(u2.getOpcode()==Opcode.GE)))
165 /* Equality & Comparisons */
168 return false; /* They interfere */
171 updates.removeAll(toremove);
175 public void addBinding(Binding b) {
177 binding.put(b.getVar(),b);
180 public Binding getBinding(VarDescriptor vd) {
181 if (binding.containsKey(vd))
182 return (Binding)binding.get(vd);
187 public void addUpdate(Updates u) {
191 public int numUpdates() {
192 return updates.size();
194 public Updates getUpdate(int i) {
195 return (Updates)updates.get(i);
198 private MultUpdateNode getMultUpdateNode(boolean negate, Descriptor d, RepairGenerator rg) {
199 Termination termination=rg.termination;
200 MultUpdateNode mun=null;
203 gn=(GraphNode)termination.abstractremove.get(d);
205 gn=(GraphNode)termination.abstractadd.get(d);
206 TermNode tn=(TermNode)gn.getOwner();
207 for(Iterator edgeit=gn.edges();edgeit.hasNext();) {
208 GraphNode gn2=((GraphNode.Edge) edgeit.next()).getTarget();
209 if (!rg.removed.contains(gn2)) {
210 TermNode tn2=(TermNode)gn2.getOwner();
211 if (tn2.getType()==TermNode.UPDATE) {
218 throw new Error("Can't find update node!");
222 public void generate_abstract(CodeWriter cr, Updates u, RepairGenerator rg) {
223 State state=rg.state;
224 Expr abstractexpr=u.getLeftExpr();
225 boolean negated=u.negate;
229 boolean istuple=false;
230 if (abstractexpr instanceof TupleOfExpr) {
231 TupleOfExpr toe=(TupleOfExpr) abstractexpr;
236 } else if (abstractexpr instanceof ElementOfExpr) {
237 ElementOfExpr eoe=(ElementOfExpr) abstractexpr;
242 throw new Error("Unsupported Expr");
244 MultUpdateNode mun=getMultUpdateNode(negated,d,rg);
245 VarDescriptor leftvar=VarDescriptor.makeNew("leftvar");
246 VarDescriptor rightvar=VarDescriptor.makeNew("rightvar");
247 left.generate(cr, leftvar);
249 right.generate(cr,rightvar);
253 RelationDescriptor rd=(RelationDescriptor)d;
254 boolean usageimage=rd.testUsage(RelationDescriptor.IMAGE);
255 boolean usageinvimage=rd.testUsage(RelationDescriptor.INVIMAGE);
257 cr.outputline(rg.stmodel+"->"+rd.getJustSafeSymbol() + "_hash->remove((int)" + leftvar.getSafeSymbol() + ", (int)" + rightvar.getSafeSymbol() + ");");
259 cr.outputline(rg.stmodel+"->"+rd.getJustSafeSymbol() + "_hashinv->remove((int)" + rightvar.getSafeSymbol() + ", (int)" + leftvar.getSafeSymbol() + ");");
261 for(int i=0;i<state.vRules.size();i++) {
262 Rule r=(Rule)state.vRules.get(i);
263 if (r.getInclusion().getTargetDescriptors().contains(rd)) {
264 for(int j=0;j<mun.numUpdates();j++) {
265 UpdateNode un=mun.getUpdate(i);
266 if (un.getRule()==r) {
267 /* Update for rule rule r */
268 String name=(String)rg.updatenames.get(un);
269 cr.outputline(rg.strepairtable+"->addrelation("+rd.getNum()+","+r.getNum()+","+leftvar.getSafeSymbol()+","+rightvar.getSafeSymbol()+",(int) &"+name+");");
275 SetDescriptor sd=(SetDescriptor) d;
276 cr.outputline(rg.stmodel+"->"+sd.getJustSafeSymbol() + "_hash->remove((int)" + leftvar.getSafeSymbol() + ", (int)" + leftvar.getSafeSymbol() + ");");
278 for(int i=0;i<state.vRules.size();i++) {
279 Rule r=(Rule)state.vRules.get(i);
280 if (r.getInclusion().getTargetDescriptors().contains(sd)) {
281 for(int j=0;j<mun.numUpdates();j++) {
282 UpdateNode un=mun.getUpdate(j);
283 if (un.getRule()==r) {
284 /* Update for rule rule r */
285 String name=(String)rg.updatenames.get(un);
286 cr.outputline(rg.strepairtable+"->addset("+sd.getNum()+","+r.getNum()+","+leftvar.getSafeSymbol()+",(int) &"+name+");");
293 /* Generate update */
295 RelationDescriptor rd=(RelationDescriptor) d;
296 boolean usageimage=rd.testUsage(RelationDescriptor.IMAGE);
297 boolean usageinvimage=rd.testUsage(RelationDescriptor.INVIMAGE);
299 cr.outputline(rg.stmodel+"->"+rd.getJustSafeSymbol() + "_hash->add((int)" + leftvar.getSafeSymbol() + ", (int)" + rightvar.getSafeSymbol() + ");");
301 cr.outputline(rg.stmodel+"->"+rd.getJustSafeSymbol() + "_hashinv->add((int)" + rightvar.getSafeSymbol() + ", (int)" + leftvar.getSafeSymbol() + ");");
303 UpdateNode un=mun.getUpdate(0);
304 String name=(String)rg.updatenames.get(un);
305 cr.outputline(name+"(this,"+rg.stmodel+","+rg.strepairtable+","+leftvar.getSafeSymbol()+","+rightvar.getSafeSymbol()+");");
307 SetDescriptor sd=(SetDescriptor)d;
308 cr.outputline(rg.stmodel+"->"+sd.getJustSafeSymbol() + "_hash->add((int)" + leftvar.getSafeSymbol() + ", (int)" + leftvar.getSafeSymbol() + ");");
310 UpdateNode un=mun.getUpdate(0);
311 /* Update for rule rule r */
312 String name=(String)rg.updatenames.get(un);
313 cr.outputline(name+"(this,"+rg.stmodel+","+rg.strepairtable+","+leftvar.getSafeSymbol()+");");
319 public void generate(CodeWriter cr, boolean removal, boolean modify, String slot0, String slot1, String slot2, RepairGenerator rg) {
320 if (!removal&&!modify)
321 generate_bindings(cr, slot0,slot1);
322 for(int i=0;i<updates.size();i++) {
323 Updates u=(Updates)updates.get(i);
324 VarDescriptor right=VarDescriptor.makeNew("right");
325 if (u.getType()==Updates.ABSTRACT) {
326 generate_abstract(cr, u, rg);
330 switch(u.getType()) {
332 u.getRightExpr().generate(cr,right);
334 case Updates.POSITION:
335 if (u.getRightPos()==0)
336 cr.outputline("int "+right.getSafeSymbol()+"="+slot0+";");
337 else if (u.getRightPos()==1)
338 cr.outputline("int "+right.getSafeSymbol()+"="+slot1+";");
339 else if (u.getRightPos()==2)
340 cr.outputline("int "+right.getSafeSymbol()+"="+slot2+";");
341 else throw new Error("Error w/ Position");
346 VarDescriptor left=VarDescriptor.makeNew("left");
347 u.getLeftExpr().generate(cr,left);
348 Opcode op=u.getOpcode();
349 cr.outputline("if (!("+left.getSafeSymbol()+op+right.getSafeSymbol()+"))");
353 cr.outputline(right.getSafeSymbol()+"++;");
354 else if (op==Opcode.GE)
356 else if (op==Opcode.EQ)
358 else if (op==Opcode.NE)
359 cr.outputline(right.getSafeSymbol()+"++;");
360 else if (op==Opcode.LT)
361 cr.outputline(right.getSafeSymbol()+"--;");
362 else if (op==Opcode.LE)
364 else throw new Error();
366 VarDescriptor vd=((VarExpr)u.getLeftExpr()).getVar();
367 cr.outputline(vd.getSafeSymbol()+"="+right.getSafeSymbol()+";");
368 } else if (u.isField()) {
370 Expr subexpr=((DotExpr)u.getLeftExpr()).getExpr();
371 Expr intindex=((DotExpr)u.getLeftExpr()).getIndex();
372 VarDescriptor subvd=VarDescriptor.makeNew("subexpr");
373 VarDescriptor indexvd=VarDescriptor.makeNew("index");
374 subexpr.generate(cr,subvd);
376 intindex.generate(cr,indexvd);
377 FieldDescriptor fd=(FieldDescriptor)u.getDescriptor();
378 StructureTypeDescriptor std=(StructureTypeDescriptor)subexpr.getType();
379 if (fd instanceof ArrayDescriptor) {
380 fd = ((ArrayDescriptor) fd).getField();
383 Expr offsetbits = std.getOffsetExpr(fd);
384 if (intindex != null) {
385 Expr basesize = fd.getBaseSizeExpr();
386 offsetbits = new OpExpr(Opcode.ADD, offsetbits, new OpExpr(Opcode.MULT, basesize, intindex));
388 Expr offsetbytes = new OpExpr(Opcode.SHR, offsetbits,new IntegerLiteralExpr(3));
389 Expr byteaddress=new OpExpr(Opcode.ADD, offsetbytes, subexpr);
390 VarDescriptor addr=VarDescriptor.makeNew("byteaddress");
391 byteaddress.generate(cr,addr);
393 if (fd.getType() instanceof ReservedTypeDescriptor && !fd.getPtr()) {
394 ReservedTypeDescriptor rtd=(ReservedTypeDescriptor)fd.getType();
395 if (rtd==ReservedTypeDescriptor.INT) {
396 cr.outputline("*((int *) "+addr.getSafeSymbol()+")="+right.getSafeSymbol()+";");
397 } else if (rtd==ReservedTypeDescriptor.SHORT) {
398 cr.outputline("*((short *) "+addr.getSafeSymbol()+")="+right.getSafeSymbol()+";");
399 } else if (rtd==ReservedTypeDescriptor.BYTE) {
400 cr.outputline("*((char *) "+addr.getSafeSymbol()+")="+right.getSafeSymbol()+";");
401 } else if (rtd==ReservedTypeDescriptor.BIT) {
402 Expr tmp = new OpExpr(Opcode.SHL, offsetbytes, new IntegerLiteralExpr(3));
403 Expr offset=new OpExpr(Opcode.SUB, offsetbits, tmp);
404 Expr mask=new OpExpr(Opcode.SHR, new IntegerLiteralExpr(1), offset);
405 VarDescriptor maskvar=VarDescriptor.makeNew("mask");
406 mask.generate(cr,maskvar);
407 cr.outputline("*((char *) "+addr.getSafeSymbol()+")|="+maskvar.getSafeSymbol()+";");
408 cr.outputline("if (!"+right.getSafeSymbol()+")");
409 cr.outputline("*((char *) "+addr.getSafeSymbol()+")^="+maskvar.getSafeSymbol()+";");
410 } else throw new Error();
413 cr.outputline("*((int *) "+addr.getSafeSymbol()+")="+right.getSafeSymbol()+";");
420 private void generate_bindings(CodeWriter cr, String slot0, String slot1) {
421 for(int i=0;i<bindings.size();i++) {
422 Binding b=(Binding)bindings.get(i);
424 throw new Error("Search not implemented for bindings");
425 VarDescriptor vd=b.getVar();
426 switch(b.getPosition()) {
428 cr.outputline(vd.getType().getGenerateType().getSafeSymbol()+" "+vd.getSafeSymbol()+"="+slot0+";");
431 cr.outputline(vd.getType().getGenerateType().getSafeSymbol()+" "+vd.getSafeSymbol()+"="+slot1+";");
434 throw new Error("Slot >1 doesn't exist.");