}
craux.startblock();
craux.outputline("int maybe=0;");
+ if (Compiler.GENERATEINSTRUMENT)
+ craux.outputline("updatecount++;");
+
final SymbolTable st = un.getRule().getSymbolTable();
CodeWriter cr = new StandardCodeWriter(outputaux) {
public SymbolTable getSymbolTable() { return st; }
craux.outputline(methodcall);
craux.startblock();
craux.outputline("int maybe=0;");
+ if (Compiler.GENERATEINSTRUMENT)
+ craux.outputline("updatecount++;");
final SymbolTable st2 = un.getRule().getSymbolTable();
CodeWriter cr2 = new StandardCodeWriter(outputaux) {
public SymbolTable getSymbolTable() { return st2; }
craux.outputline(methodcall);
craux.startblock();
craux.outputline("int maybe=0;");
+ if (Compiler.GENERATEINSTRUMENT)
+ craux.outputline("updatecount++;");
final SymbolTable st2 = un.getRule().getSymbolTable();
CodeWriter cr2 = new StandardCodeWriter(outputaux) {
public SymbolTable getSymbolTable() { return st2; }
crhead.outputline("~"+name+"();");
craux.outputline("#include \""+headername+"\"");
craux.outputline("#include \"size.h\"");
-
+ if (Compiler.TIME) {
+ craux.outputline("#include <sys/time.h>");
+ }
+ if (Compiler.ALLOCATECPLUSPLUS) {
+ for(Iterator it=state.stTypes.descriptors();it.hasNext();) {
+ TypeDescriptor td=(TypeDescriptor)it.next();
+ if (td instanceof StructureTypeDescriptor) {
+ if (((StructureTypeDescriptor)td).size()>0) {
+ FieldDescriptor fd=((StructureTypeDescriptor)td).get(0);
+ if (fd.getSymbol().startsWith("_vptr_")) {
+ String vtable="_ZTV";
+ vtable+=td.getSymbol().length();
+ vtable+=td.getSymbol();
+ craux.outputline("extern void * "+vtable+";");
+ }
+ }
+ }
+ }
+ }
craux.outputline(name+"::"+name+"() {");
craux.outputline("// creating hashtables ");
worklist=VarDescriptor.makeNew("worklist");
goodflag=VarDescriptor.makeNew("goodflag");
repairtable=VarDescriptor.makeNew("repairtable");
+
+ if (Compiler.GENERATEINSTRUMENT) {
+ craux.outputline("int updatecount;");
+ craux.outputline("int rebuildcount;");
+ craux.outputline("int abstractcount;");
+ }
+
crhead.outputline("void doanalysis();");
craux.outputline("void "+name +"_state::doanalysis()");
craux.startblock();
+ if (Compiler.TIME) {
+ craux.outputline("struct timeval _begin_time,_end_time;");
+ craux.outputline("gettimeofday(&_begin_time,NULL);");
+ }
+
+ if (Compiler.GENERATEINSTRUMENT) {
+ craux.outputline("updatecount=0;");
+ craux.outputline("rebuildcount=0;");
+ craux.outputline("abstractcount=0;");
+ }
craux.outputline("int highmark;");
craux.outputline("initializestack(&highmark);");
craux.outputline("typeobject *typeobject1=gettypeobject();");
craux.outputline("while (1)");
craux.startblock();
craux.outputline(name+ " * "+newmodel.getSafeSymbol()+"=new "+name+"();");
+ craux.outputline(worklist.getSafeSymbol()+"->reset();");
+ if (Compiler.GENERATEINSTRUMENT)
+ craux.outputline("rebuildcount++;");
}
private void generate_teardown() {
CodeWriter cr = new StandardCodeWriter(outputaux);
cr.endblock();
+ if (Compiler.TIME) {
+ cr.outputline("gettimeofday(&_end_time,NULL);");
+ cr.outputline("printf(\"time=%ld uS\\n\",(_end_time.tv_sec-_begin_time.tv_sec)*1000000+_end_time.tv_usec-_begin_time.tv_usec);");
+ }
+
+ if (Compiler.GENERATEINSTRUMENT) {
+ cr.outputline("printf(\"updatecount=%d\\n\",updatecount);");
+ cr.outputline("printf(\"rebuildcount=%d\\n\",rebuildcount);");
+ cr.outputline("printf(\"abstractcount=%d\\n\",abstractcount);");
+ }
+
}
private void generate_print() {
Iterator iterator_rs = ruleset.iterator();
while (iterator_rs.hasNext()) {
Rule rule = (Rule) iterator_rs.next();
+ if (rule.getnogenerate())
+ continue;
{
final SymbolTable st = rule.getSymbolTable();
CodeWriter cr = new StandardCodeWriter(outputaux) {
public SymbolTable getSymbolTable() { return st; }
};
+ InvariantValue ivalue=new InvariantValue();
+ cr.setInvariantValue(ivalue);
+
cr.outputline("// build " +escape(rule.toString()));
cr.startblock();
cr.outputline("int maybe=0;");
- ListIterator quantifiers = rule.quantifiers();
+
+ Expr ruleexpr=rule.getGuardExpr();
+ HashSet invariantvars=new HashSet();
+ Set invariants=ruleexpr.findInvariants(invariantvars);
+
+ if ((ruleexpr instanceof BooleanLiteralExpr)&&
+ ((BooleanLiteralExpr)ruleexpr).getValue()) {
+ if (rule.getInclusion() instanceof SetInclusion) {
+ invariants.addAll(((SetInclusion)rule.getInclusion()).getExpr().findInvariants(invariantvars));
+ } else if (rule.getInclusion() instanceof RelationInclusion) {
+ invariants.addAll(((RelationInclusion)rule.getInclusion()).getLeftExpr().findInvariants(invariantvars));
+ invariants.addAll(((RelationInclusion)rule.getInclusion()).getRightExpr().findInvariants(invariantvars));
+ }
+ }
+ ListIterator quantifiers = rule.quantifiers();
+ while (quantifiers.hasNext()) {
+ Quantifier quantifier = (Quantifier) quantifiers.next();
+ if (quantifier instanceof ForQuantifier) {
+ ForQuantifier fq=(ForQuantifier)quantifier;
+ invariants.addAll(fq.lower.findInvariants(invariantvars));
+ invariants.addAll(fq.upper.findInvariants(invariantvars));
+ }
+ }
+
+ for(Iterator invit=invariants.iterator();invit.hasNext();) {
+ Expr invexpr=(Expr)invit.next();
+ VarDescriptor tmpvd=VarDescriptor.makeNew("tmpvar");
+ VarDescriptor maybevd=VarDescriptor.makeNew("maybevar");
+ invexpr.generate(cr,tmpvd);
+ cr.outputline("int "+maybevd.getSafeSymbol()+"=maybe;");
+ cr.outputline("maybe=0;");
+ ivalue.assignPair(invexpr,tmpvd,maybevd);
+ }
+
+ quantifiers = rule.quantifiers();
while (quantifiers.hasNext()) {
Quantifier quantifier = (Quantifier) quantifiers.next();
quantifier.generate_open(cr);
}
private void generate_checks() {
-
/* do constraint checks */
- // Vector constraints = state.vConstraints;
-
-
- // for (int i = 0; i < constraints.size(); i++) {
- // Constraint constraint = (Constraint) constraints.elementAt(i);
- for (Iterator i = termination.constraintdependence.computeOrdering().iterator(); i.hasNext();) {
- Constraint constraint = (Constraint) ((GraphNode)i.next()).getOwner();
+ Iterator i;
+ if (Compiler.REPAIR)
+ i=termination.constraintdependence.computeOrdering().iterator();
+ else
+ i=state.vConstraints.iterator();
+ for (; i.hasNext();) {
+ Constraint constraint;
+ if (Compiler.REPAIR)
+ constraint= (Constraint) ((GraphNode)i.next()).getOwner();
+ else
+ constraint=(Constraint)i.next();
{
final SymbolTable st = constraint.getSymbolTable();
cr.outputline("if (maybe)");
cr.startblock();
cr.outputline("printf(\"maybe fail " + escape(constraint.toString()) + ". \\n\");");
- cr.outputline("exit(1);");
+ //cr.outputline("exit(1);");
cr.endblock();
cr.outputline("else if (!" + constraintboolean.getSafeSymbol() + ")");
p.generate(cr,predvalue);
if (k==0)
cr.outputline("int "+costvar.getSafeSymbol()+"=0;");
-
+
if (negate)
cr.outputline("if (maybe||"+predvalue.getSafeSymbol()+")");
else
cr.outputline("if (maybe||!"+predvalue.getSafeSymbol()+")");
cr.outputline(costvar.getSafeSymbol()+"+="+cost.getCost(dpred)+";");
}
-
+
if(!first) {
cr.outputline("if ("+costvar.getSafeSymbol()+"<"+mincost.getSafeSymbol()+")");
cr.startblock();
for(int j=0;j<dnfconst.size();j++) {
GraphNode gn=(GraphNode)dnfconst.get(j);
Conjunction conj=((TermNode)gn.getOwner()).getConjunction();
-
if (removed.contains(gn))
continue;
cr.outputline("case "+j+":");
+ cr.startblock();
for(int k=0;k<conj.size();k++) {
DNFPredicate dpred=conj.get(k);
Predicate p=dpred.getPredicate();
else
cr.outputline("if (maybe||!"+predvalue.getSafeSymbol()+")");
cr.startblock();
+ if (Compiler.GENERATEINSTRUMENT)
+ cr.outputline("abstractcount++;");
if (p instanceof InclusionPredicate)
generateinclusionrepair(conj,dpred, cr);
else if (p instanceof ExprPredicate) {
cr.endblock();
}
/* Update model */
+ cr.endblock();
cr.outputline("break;");
}
cr.outputline("}");
-
+
cr.outputline("if ("+oldmodel.getSafeSymbol()+")");
cr.outputline("delete "+oldmodel.getSafeSymbol()+";");
cr.outputline(oldmodel.getSafeSymbol()+"="+newmodel.getSafeSymbol()+";");
cr.endblock();
cr.outputline("rebuild:");
cr.outputline(";");
-
}
private MultUpdateNode getmultupdatenode(Conjunction conj, DNFPredicate dpred, int repairtype) {
- MultUpdateNode mun=null;
+ Set nodes=getmultupdatenodeset(conj,dpred,repairtype);
+ Iterator it=nodes.iterator();
+ if (it.hasNext())
+ return (MultUpdateNode)it.next();
+ else
+ return null;
+ }
+
+ private Set getmultupdatenodeset(Conjunction conj, DNFPredicate dpred, int repairtype) {
+ HashSet hs=new HashSet();
GraphNode gn=(GraphNode) termination.conjtonodemap.get(conj);
- for(Iterator edgeit=gn.edges();(mun==null)&&edgeit.hasNext();) {
+ for(Iterator edgeit=gn.edges();edgeit.hasNext();) {
GraphNode gn2=((GraphNode.Edge) edgeit.next()).getTarget();
TermNode tn2=(TermNode)gn2.getOwner();
if (tn2.getType()==TermNode.ABSTRACT) {
if (!removed.contains(gn3)) {
TermNode tn3=(TermNode)gn3.getOwner();
if (tn3.getType()==TermNode.UPDATE) {
- mun=tn3.getUpdate();
- break;
+ hs.add(tn3.getUpdate());
}
}
}
}
}
}
- return mun;
+ return hs;
+ }
+
+ private AbstractRepair getabstractrepair(Conjunction conj, DNFPredicate dpred, int repairtype) {
+ HashSet hs=new HashSet();
+ MultUpdateNode mun=null;
+ GraphNode gn=(GraphNode) termination.conjtonodemap.get(conj);
+ for(Iterator edgeit=gn.edges();(mun==null)&&edgeit.hasNext();) {
+ GraphNode gn2=((GraphNode.Edge) edgeit.next()).getTarget();
+ TermNode tn2=(TermNode)gn2.getOwner();
+ if (tn2.getType()==TermNode.ABSTRACT) {
+ AbstractRepair ar=tn2.getAbstract();
+ if (((repairtype==-1)||(ar.getType()==repairtype))&&
+ ar.getPredicate()==dpred) {
+ return ar;
+ }
+ }
+ }
+ return null;
}
+
/** Generates abstract (and concrete) repair for a comparison */
private void generatecomparisonrepair(Conjunction conj, DNFPredicate dpred, CodeWriter cr){
- MultUpdateNode munmodify=getmultupdatenode(conj,dpred,AbstractRepair.MODIFYRELATION);
- MultUpdateNode munremove=getmultupdatenode(conj,dpred,AbstractRepair.REMOVEFROMRELATION);
- MultUpdateNode munadd=getmultupdatenode(conj,dpred,AbstractRepair.ADDTORELATION);
+ Set updates=getmultupdatenodeset(conj,dpred,AbstractRepair.MODIFYRELATION);
+ AbstractRepair ar=getabstractrepair(conj,dpred,AbstractRepair.MODIFYRELATION);
+ MultUpdateNode munmodify=null;
+ MultUpdateNode munadd=null;
+ MultUpdateNode munremove=null;
+ for(Iterator it=updates.iterator();it.hasNext();) {
+ MultUpdateNode mun=(MultUpdateNode)it.next();
+ if (mun.getType()==MultUpdateNode.ADD) {
+ munadd=mun;
+ } else if (mun.getType()==MultUpdateNode.REMOVE) {
+ munremove=mun;
+ } else if (mun.getType()==MultUpdateNode.MODIFY) {
+ munmodify=mun;
+ }
+ }
+
ExprPredicate ep=(ExprPredicate)dpred.getPredicate();
RelationDescriptor rd=(RelationDescriptor)ep.getDescriptor();
boolean usageimage=rd.testUsage(RelationDescriptor.IMAGE);
VarDescriptor leftside=VarDescriptor.makeNew("leftside");
VarDescriptor rightside=VarDescriptor.makeNew("rightside");
VarDescriptor newvalue=VarDescriptor.makeNew("newvalue");
- if (!inverted) {
+ boolean needremoveloop=ar.mayNeedFunctionEnforcement(state)&&ar.needsRemoves(state);
+
+ if (needremoveloop&&((munadd==null)||(munremove==null))) {
+ System.out.println("Warning: need to have individual remove operations for"+dpred.name());
+ needremoveloop=false;
+ }
+ if (needremoveloop)
+ cr.outputline("while (1) {");
+
+ if (!inverted) {
((RelationExpr)expr.getLeftExpr()).getExpr().generate(cr,leftside);
expr.getRightExpr().generate(cr,newvalue);
cr.outputline(rd.getRange().getType().getGenerateType().getSafeSymbol()+" "+rightside.getSafeSymbol()+";");
cr.outputline(rd.getDomain().getType().getGenerateType().getSafeSymbol()+" "+leftside.getSafeSymbol()+";");
cr.outputline(rd.getSafeSymbol()+"_hashinv->get("+rightside.getSafeSymbol()+","+leftside.getSafeSymbol()+");");
}
- if (negated)
- if (opcode==Opcode.GT) {
- opcode=Opcode.LE;
- } else if (opcode==Opcode.GE) {
- opcode=Opcode.LT;
- } else if (opcode==Opcode.LT) {
- opcode=Opcode.GE;
- } else if (opcode==Opcode.LE) {
- opcode=Opcode.GT;
- } else if (opcode==Opcode.EQ) {
- opcode=Opcode.NE;
- } else if (opcode==Opcode.NE) {
- opcode=Opcode.EQ;
- } else {
- throw new Error("Unrecognized Opcode");
- }
+
+ opcode=Opcode.translateOpcode(negated,opcode);
if (opcode==Opcode.GT) {
cr.outputline(newvalue.getSafeSymbol()+"++;");
/* Do abstract repairs */
if (usageimage) {
cr.outputline(rd.getSafeSymbol()+"_hash->remove("+leftside.getSafeSymbol()+","+rightside.getSafeSymbol()+");");
+ }
+ if (usageinvimage) {
+ cr.outputline(rd.getSafeSymbol()+"_hashinv->remove("+rightside.getSafeSymbol()+","+leftside.getSafeSymbol()+");");
+ }
+
+ if (needremoveloop) {
+ if (!inverted) {
+ cr.outputline("if ("+rd.getSafeSymbol()+"_hash->contains("+leftside.getSafeSymbol()+")) {");
+ } else {
+ cr.outputline("if ("+rd.getSafeSymbol()+"_hashinv->contains("+rightside.getSafeSymbol()+")) {");
+ }
+ for(int i=0;i<state.vRules.size();i++) {
+ Rule r=(Rule)state.vRules.get(i);
+ if (r.getInclusion().getTargetDescriptors().contains(rd)) {
+ for(int j=0;j<munremove.numUpdates();j++) {
+ UpdateNode un=munremove.getUpdate(i);
+ if (un.getRule()==r) {
+ /* Update for rule r */
+ String name=(String)updatenames.get(un);
+ cr.outputline(repairtable.getSafeSymbol()+"->addrelation("+rd.getNum()+","+r.getNum()+","+leftside.getSafeSymbol()+","+rightside.getSafeSymbol()+",(int) &"+name+");");
+ }
+ }
+ }
+ }
+ cr.outputline("continue;");
+ cr.outputline("}");
+ }
+
+ if (usageimage) {
if (!inverted) {
cr.outputline(rd.getSafeSymbol()+"_hash->add("+leftside.getSafeSymbol()+","+newvalue.getSafeSymbol()+");");
} else {
}
}
if (usageinvimage) {
- cr.outputline(rd.getSafeSymbol()+"_hashinv->remove("+rightside.getSafeSymbol()+","+leftside.getSafeSymbol()+");");
if (!inverted) {
cr.outputline(rd.getSafeSymbol()+"_hashinv->add("+newvalue.getSafeSymbol()+","+leftside.getSafeSymbol()+");");
} else {
}
}
/* Do concrete repairs */
- if (munmodify!=null) {
+ if (munmodify!=null&&(!ar.mayNeedFunctionEnforcement(state))||(munadd==null)||(ar.needsRemoves(state)&&(munremove==null))) {
for(int i=0;i<state.vRules.size();i++) {
Rule r=(Rule)state.vRules.get(i);
if (r.getInclusion().getTargetDescriptors().contains(rd)) {
}
}
}
-
} else {
/* Start with scheduling removal */
- for(int i=0;i<state.vRules.size();i++) {
- Rule r=(Rule)state.vRules.get(i);
- if (r.getInclusion().getTargetDescriptors().contains(rd)) {
- for(int j=0;j<munremove.numUpdates();j++) {
- UpdateNode un=munremove.getUpdate(i);
- if (un.getRule()==r) {
- /* Update for rule r */
- String name=(String)updatenames.get(un);
- cr.outputline(repairtable.getSafeSymbol()+"->addrelation("+rd.getNum()+","+r.getNum()+","+leftside.getSafeSymbol()+","+rightside.getSafeSymbol()+",(int) &"+name+");");
+ if (ar.needsRemoves(state))
+ for(int i=0;i<state.vRules.size();i++) {
+ Rule r=(Rule)state.vRules.get(i);
+ if (r.getInclusion().getTargetDescriptors().contains(rd)) {
+ for(int j=0;j<munremove.numUpdates();j++) {
+ UpdateNode un=munremove.getUpdate(i);
+ if (un.getRule()==r) {
+ /* Update for rule r */
+ String name=(String)updatenames.get(un);
+ cr.outputline(repairtable.getSafeSymbol()+"->addrelation("+rd.getNum()+","+r.getNum()+","+leftside.getSafeSymbol()+","+rightside.getSafeSymbol()+",(int) &"+name+");");
+ }
}
}
}
- }
/* Now do addition */
UpdateNode un=munadd.getUpdate(0);
String name=(String)updatenames.get(un);
cr.outputline(name+"(this,"+newmodel.getSafeSymbol()+","+repairtable.getSafeSymbol()+","+newvalue.getSafeSymbol()+","+rightside.getSafeSymbol()+");");
}
}
+ if (needremoveloop) {
+ cr.outputline("break;");
+ cr.outputline("}");
+ }
}
public void generatesizerepair(Conjunction conj, DNFPredicate dpred, CodeWriter cr) {
VarDescriptor rightvar=VarDescriptor.makeNew("rightvar");
if (d instanceof RelationDescriptor) {
if (ep.inverted()) {
- rightvar=((ImageSetExpr)((SizeofExpr)((OpExpr)expr).left).setexpr).getVar();
+ ((ImageSetExpr)((SizeofExpr)expr.left).setexpr).generate_leftside(cr,rightvar);
cr.outputline("int "+leftvar.getSafeSymbol()+";");
cr.outputline(d.getSafeSymbol()+"_hashinv->get((int)"+rightvar.getSafeSymbol()+","+leftvar.getSafeSymbol()+");");
} else {
- leftvar=((ImageSetExpr)((SizeofExpr)((OpExpr)expr).left).setexpr).getVar();
+ ((ImageSetExpr)((SizeofExpr)expr.left).setexpr).generate_leftside(cr,leftvar);
cr.outputline("int "+rightvar.getSafeSymbol()+"=0;");
cr.outputline(d.getSafeSymbol()+"_hash->get((int)"+leftvar.getSafeSymbol()+","+rightvar.getSafeSymbol()+");");
}
}
cr.endblock();
}
+
+// In some cases the analysis has determined that generating removes
+// is unnecessary
+ if (generateadd&&munadd==null)
+ generateadd=false;
+
if (generateadd) {
cr.outputline("for(;"+change.getSafeSymbol()+">0;"+change.getSafeSymbol()+"--)");
cr.startblock();
VarDescriptor newobject=VarDescriptor.makeNew("newobject");
if (d instanceof RelationDescriptor) {
- VarDescriptor otherside=((ImageSetExpr)((SizeofExpr)((OpExpr)ep.expr).left).setexpr).vd;
+ VarDescriptor otherside=VarDescriptor.makeNew("otherside");
+ ((ImageSetExpr)((SizeofExpr)expr.left).setexpr).generate_leftside(cr,otherside);
+
RelationDescriptor rd=(RelationDescriptor)d;
if (termination.sources.relsetSource(rd,!ep.inverted())) {
/* Set Source */
public void generate_dispatch(CodeWriter cr, SetDescriptor sd, String setvar) {
-
- cr.outputline("// SET DISPATCH ");
+ cr.outputline("// SET DISPATCH ");
if (Compiler.REPAIR) {
cr.outputline("if ("+oldmodel.getSafeSymbol()+"&&");
cr.outputline("!"+oldmodel.getSafeSymbol() +"->"+sd.getJustSafeSymbol()+"_hash->contains("+setvar+"))");
cr.startblock(); {
/* Adding new item */
- /* Perform safety checks */
+ /* See if there is an outstanding update in the repairtable */
cr.outputline("if ("+repairtable.getSafeSymbol()+"&&");
cr.outputline(repairtable.getSafeSymbol()+"->containsset("+sd.getNum()+","+currentrule.getNum()+","+setvar+"))");
cr.startblock(); {
}
cr.endblock();
/* Build standard compensation actions */
- if (need_compensation(currentrule)) {
- UpdateNode un=find_compensation(currentrule);
- String name=(String)updatenames.get(un);
- usedupdates.add(un); /* Mark as used */
+ Vector ruleset=new Vector();
+ ruleset.add(currentrule);
+ if (state.implicitruleinv.containsKey(currentrule))
+ ruleset.addAll((Set)state.implicitruleinv.get(currentrule));
+ for(int i=0;i<ruleset.size();i++) {
+ Rule itrule=(Rule)ruleset.get(i);
- String methodcall=name+"(this,"+oldmodel.getSafeSymbol()+","+
- repairtable.getSafeSymbol();
- for(int i=0;i<currentrule.numQuantifiers();i++) {
- Quantifier q=currentrule.getQuantifier(i);
- if (q instanceof SetQuantifier) {
- SetQuantifier sq=(SetQuantifier) q;
- methodcall+=","+sq.getVar().getSafeSymbol();
- } else if (q instanceof RelationQuantifier) {
- RelationQuantifier rq=(RelationQuantifier) q;
- methodcall+=","+rq.x.getSafeSymbol();
- methodcall+=","+rq.y.getSafeSymbol();
- } else if (q instanceof ForQuantifier) {
- ForQuantifier fq=(ForQuantifier) q;
- methodcall+=","+fq.getVar().getSafeSymbol();
+ if (need_compensation(itrule)) {
+ UpdateNode un=find_compensation(itrule);
+ String name=(String)updatenames.get(un);
+ usedupdates.add(un); /* Mark as used */
+
+ String methodcall=name+"(this,"+oldmodel.getSafeSymbol()+","+
+ repairtable.getSafeSymbol();
+ for(int j=0;j<currentrule.numQuantifiers();j++) {
+ Quantifier q=currentrule.getQuantifier(j);
+ if (q instanceof SetQuantifier) {
+ SetQuantifier sq=(SetQuantifier) q;
+ methodcall+=","+sq.getVar().getSafeSymbol();
+ } else if (q instanceof RelationQuantifier) {
+ RelationQuantifier rq=(RelationQuantifier) q;
+ methodcall+=","+rq.x.getSafeSymbol();
+ methodcall+=","+rq.y.getSafeSymbol();
+ } else if (q instanceof ForQuantifier) {
+ ForQuantifier fq=(ForQuantifier) q;
+ methodcall+=","+fq.getVar().getSafeSymbol();
+ }
}
+ methodcall+=");";
+ if (currentrule!=itrule) {
+ SetDescriptor sdrule=((SetInclusion)itrule.getInclusion()).getSet();
+ cr.outputline("if ("+oldmodel.getSafeSymbol()+"&&");
+ cr.outputline("!"+oldmodel.getSafeSymbol() +"->"+sdrule.getJustSafeSymbol()+"_hash->contains("+setvar+"))");
+ cr.startblock();
+ }
+ cr.outputline(methodcall);
+ cr.outputline("delete "+newmodel.getSafeSymbol()+";");
+ cr.outputline("goto rebuild;");
+ cr.endblock();
}
- methodcall+=");";
- cr.outputline(methodcall);
- cr.outputline("delete "+newmodel.getSafeSymbol()+";");
- cr.outputline("goto rebuild;");
+ if (currentrule==itrule)
+ cr.endblock();
}
}
- cr.endblock();
}
String addeditem = (VarDescriptor.makeNew("addeditem")).getSafeSymbol();
cr.endblock();
return;
}
+ /* Add item to worklist if new */
cr.outputline("if ("+addeditem+")");
cr.startblock();
for(int i = 0; i < dispatchrules.size(); i++) {