* TODO: I replace with the lower id node, sometimes though we replace with much more
* difficult looking ASTNodes.
*/
+ //cerr << "eQUIV";
#if 0
ASTNodeMap::iterator it = equivs.begin();
while (it!=equivs.end())
// If the bit-blaster discovers new constants, should the term simplifier be re-run.
simplify_during_BB_flag=false;
+ set("bb-equiv","0");
+
} //End of constructor for UserDefinedFlags
}; //End of struct UserDefinedFlags
// leaves just one instance of the constraint, so it we replace it with true/false
// the constraint is lost. This is subsumed by constant bit propagation, so I suspect
// it's not a big loss.
- if (!_bm->UserFlags.isSet("bb-equiv","0"))
+ if (!_bm->UserFlags.isSet("bb-equiv",""))
AlwaysTrueHashSet.insert(key.GetNodeNum());
}
fromTo.insert(make_pair(n, r));
}
- if (form.GetSTPMgr()->UserFlags.isSet("bb-equiv","0"))
+ if (form.GetSTPMgr()->UserFlags.isSet("bb-equiv",""))
{
HASHMAP <intptr_t ,ASTNode> nodeToFn;
typename map<ASTNode, BBNode>::iterator it;
}
typedef HASHMAP<vector<BBNode>, ASTNode,BBVecHasher <BBNode>, BBVecEquals<BBNode> > M;
- if (form.GetSTPMgr()->UserFlags.isSet("bb-equiv", "0"))
+ if (form.GetSTPMgr()->UserFlags.isSet("bb-equiv",""))
{
M lookup;
typename std::map<ASTNode, vector<BBNode> >::iterator it;