8 # include <ctype.h> /* for isdigit */
9 # include "lclintMacros.nf"
11 # include "cgrammar.h"
12 # include "cgrammar_tokens.h"
14 # include "exprChecks.h"
15 # include "aliasChecks.h"
16 # include "exprNodeSList.h"
19 /*@access constraint, exprNode @*/
21 static bool rangeCheck (arithType ar1, /*@observer@*/ constraintExpr expr1, arithType ar2, /*@observer@*/ constraintExpr expr2);
23 static constraint inequalitySubstituteUnsound (/*@returned@*/ constraint c, constraintList p);
25 static constraint constraint_searchandreplace (/*@returned@*/ constraint c, constraintExpr old, constraintExpr new);
28 static constraint constraint_addOr (/*@returned@*/ constraint orig, /*@observer@*/ constraint or);
30 static bool resolveOr (/*@observer@*/ constraint c, /*@observer@*/ constraintList list);
32 static /*@only@*/ constraintList reflectChangesEnsuresFree1 (/*@only@*/ constraintList pre2, constraintList post1);
34 /*********************************************/
39 /*@only@*/ constraintList constraintList_mergeEnsuresFreeFirst (constraintList list1, constraintList list2)
43 ret = constraintList_mergeEnsures (list1, list2);
45 constraintList_free(list1);
49 /*@only@*/ constraintList constraintList_mergeEnsures (constraintList list1, constraintList list2)
54 //ret = constraintList_makeNew();
56 llassert(constraintList_isDefined(list1) );
57 llassert(constraintList_isDefined(list2) );
59 DPRINTF(( message ("constraintList_mergeEnsures: list1 %s list2 %s",
60 constraintList_print(list1), constraintList_print(list2)
63 ret = constraintList_fixConflicts (list1, list2);
64 ret = reflectChangesEnsuresFree1 (ret, list2);
65 temp = constraintList_subsumeEnsures (ret, list2);
66 constraintList_free(ret);
69 temp = constraintList_subsumeEnsures (list2, ret);
71 temp = constraintList_addList (temp, ret);
72 constraintList_free(ret);
74 DPRINTF(( message ("constraintList_mergeEnsures: returning %s ",
75 constraintList_print(temp) )
80 //ret = constraintList_addList (ret, list2);
85 /*@only@*/ constraintList constraintList_mergeRequiresFreeFirst (/*@only@*/ constraintList list1, constraintList list2)
89 ret = constraintList_mergeRequires(list1, list2);
91 constraintList_free(list1);
96 /*@only@*/ constraintList constraintList_mergeRequires (constraintList list1, constraintList list2)
101 DPRINTF((message ("constraintList_mergeRequires: merging %s and %s ", constraintList_print (list1), constraintList_print(list2) ) ) );
103 /* get constraints in list1 not satified by list2 */
104 temp = reflectChanges (list1, list2);
105 DPRINTF((message ("constraintList_mergeRequires: temp = %s", constraintList_print(temp) ) ) );
107 /*get constraints in list2 not satified by temp*/
108 ret = reflectChanges (list2, temp);
110 DPRINTF((message ("constraintList_mergeRequires: ret = %s", constraintList_print(ret) ) ) );
112 ret = constraintList_addListFree (ret, temp);
114 DPRINTF((message ("constraintList_mergeRequires: returning %s", constraintList_print(ret) ) ) );
119 void checkArgumentList (/*@out@*/ exprNode temp, exprNodeList arglist, fileloc sequencePoint)
121 temp->requiresConstraints = constraintList_makeNew();
122 temp->ensuresConstraints = constraintList_makeNew();
123 temp->trueEnsuresConstraints = constraintList_makeNew();
124 temp->falseEnsuresConstraints = constraintList_makeNew();
126 exprNodeList_elements (arglist, el)
128 constraintList temp2;
129 exprNode_exprTraverse (el, FALSE, FALSE, sequencePoint);
130 temp2 = el->requiresConstraints;
131 el->requiresConstraints = exprNode_traversRequiresConstraints(el);
132 constraintList_free(temp2);
134 temp2 = el->ensuresConstraints;
135 el->ensuresConstraints = exprNode_traversEnsuresConstraints(el);
136 constraintList_free(temp2);
138 temp->requiresConstraints = constraintList_addList(temp->requiresConstraints,
139 el->requiresConstraints);
141 temp->ensuresConstraints = constraintList_addList(temp->ensuresConstraints,
142 el->ensuresConstraints);
144 end_exprNodeList_elements;
148 constraintList checkCall (exprNode fcn, exprNodeList arglist)
150 constraintList preconditions;
152 DPRINTF ( (message ("Got call that %s ( %s) ", exprNode_unparse(fcn), exprNodeList_unparse (arglist ) ) ) );
154 temp = exprNode_getUentry (fcn);
156 preconditions = uentry_getFcnPreconditions (temp);
158 if (preconditions != constraintList_undefined)
160 preconditions = constraintList_togglePost (preconditions);
161 preconditions = constraintList_preserveCallInfo(preconditions, fcn);
162 preconditions = constraintList_doSRefFixConstraintParam (preconditions, arglist);
166 if (preconditions == NULL)
167 preconditions = constraintList_makeNew();
169 DPRINTF (( message("Done checkCall\n") ));
170 DPRINTF (( message("Returning list %q ", constraintList_printDetailed(preconditions) ) ));
171 return preconditions;
174 constraintList getPostConditions (exprNode fcn, exprNodeList arglist, exprNode fcnCall)
176 constraintList postconditions;
178 DPRINTF ( (message ("Got call that %s ( %s) ", exprNode_unparse(fcn), exprNodeList_unparse (arglist ) ) ) );
180 temp = exprNode_getUentry (fcn);
182 postconditions = uentry_getFcnPostconditions (temp);
184 if (postconditions != constraintList_undefined)
186 postconditions = constraintList_doFixResult (postconditions, fcnCall);
187 postconditions = constraintList_doSRefFixConstraintParam (postconditions, arglist);
191 postconditions = constraintList_makeNew();
194 return postconditions;
197 void mergeResolve (exprNode parent, exprNode child1, exprNode child2)
199 constraintList temp, temp2;
201 DPRINTF( (message ("magically merging constraint into parent:%s for", exprNode_unparse (parent) )) );
203 DPRINTF( (message (" children: %s and %s", exprNode_unparse (child1), exprNode_unparse(child2) ) ) );
205 if (exprNode_isError (child1) || exprNode_isError(child2) )
207 if (exprNode_isError (child1) && !exprNode_isError(child2) )
209 constraintList_free(parent->requiresConstraints);
211 parent->requiresConstraints = constraintList_copy (child2->requiresConstraints);
212 constraintList_free(parent->ensuresConstraints);
214 parent->ensuresConstraints = constraintList_copy (child2->ensuresConstraints);
215 DPRINTF((message ("Copied child constraints: pre: %s and post: %s",
216 constraintList_print( child2->requiresConstraints),
217 constraintList_print (child2->ensuresConstraints)
224 llassert(exprNode_isError(child2) );
225 //parent->requiresConstraints = constraintList_makeNew();
226 //parent->ensuresConstraints = constraintList_makeNew();
231 llassert(!exprNode_isError (child1) && ! exprNode_isError(child2) );
233 DPRINTF( (message ("Child constraints are %s %s and %s %s",
234 constraintList_print (child1->requiresConstraints),
235 constraintList_print (child1->ensuresConstraints),
236 constraintList_print (child2->requiresConstraints),
237 constraintList_print (child2->ensuresConstraints)
241 constraintList_free(parent->requiresConstraints);
243 parent->requiresConstraints = constraintList_copy (child1->requiresConstraints);
245 if ( context_getFlag (FLG_ORCONSTRAINT) )
246 temp = reflectChangesOr (child2->requiresConstraints, child1->ensuresConstraints);
248 temp = reflectChanges (child2->requiresConstraints, child1->ensuresConstraints);
250 temp2 = constraintList_mergeRequires (parent->requiresConstraints, temp);
251 constraintList_free(parent->requiresConstraints);
252 constraintList_free(temp);
254 parent->requiresConstraints = temp2;
256 DPRINTF( (message ("Parent requires constraints are %s ",
257 constraintList_print (parent->requiresConstraints)
260 constraintList_free(parent->ensuresConstraints);
262 parent->ensuresConstraints = constraintList_mergeEnsures(child1->ensuresConstraints,
263 child2->ensuresConstraints);
266 DPRINTF( (message ("Parent constraints are %s and %s ",
267 constraintList_print (parent->requiresConstraints),
268 constraintList_print (parent->ensuresConstraints)
276 /*@only@*/ constraintList constraintList_subsumeEnsures (constraintList list1, constraintList list2)
279 ret = constraintList_makeNew();
280 constraintList_elements (list1, el)
283 DPRINTF ((message ("Examining %s", constraint_print (el) ) ) );
284 if (!resolve (el, list2) )
287 temp = constraint_copy(el);
288 ret = constraintList_add (ret, temp);
292 DPRINTF ( (message ("Subsuming %s", constraint_print (el) ) ) );
294 } end_constraintList_elements;
301 /* tries to resolve constraints in list pre2 using post1 */
302 /*@only@*/ constraintList reflectChangesFreePre (/*@only@*/ constraintList pre2, /*@observer@*/ constraintList post1)
306 ret = reflectChanges (pre2, post1);
308 constraintList_free (pre2);
314 /* tries to resolve constraints in list pre2 using post1 */
315 /*@only@*/ constraintList reflectChanges (/*@observer@*/ constraintList pre2, /*@observer@*/ constraintList post1)
322 ret = constraintList_makeNew();
323 DPRINTF((message ("reflectChanges: lists %s and %s", constraintList_print(pre2), constraintList_print(post1) )));
325 constraintList_elements (pre2, el)
327 if (!resolve (el, post1) )
329 temp = substitute (el, post1);
330 if (!resolve (temp, post1) )
332 // try inequality substitution
335 // the inequality substitution may cause us to lose information
336 //so we don't want to store the result but we do it anyway
337 temp2 = constraint_copy (temp);
338 // if (context_getFlag (FLG_ORCONSTRAINT) )
339 temp2 = inequalitySubstitute (temp2, post1);
340 if (!resolve (temp2, post1) )
342 temp2 = inequalitySubstituteUnsound (temp2, post1);
343 if (!resolve (temp2, post1) )
344 ret = constraintList_add (ret, temp2);
347 constraint_free(temp);
349 } end_constraintList_elements;
351 DPRINTF((message ("reflectChanges: returning %s", constraintList_print(ret) ) ) );
356 static constraint constraint_addOr (/*@returned@*/ constraint orig, /*@observer@*/ constraint or)
361 DPRINTF((message("constraint_addor: oring %s onto %s", constraint_printOr(or), constraint_printOr(orig) ) ));
363 while (c->or != NULL)
367 c->or = constraint_copy(or);
369 DPRINTF((message("constraint_addor: returning %s",constraint_printOr(orig) ) ));
375 static bool resolveOr (/*@observer@*/ constraint c, /*@observer@*/ constraintList list)
379 DPRINTF(( message("resolveOr: constraint %s and list %s", constraint_printOr(c), constraintList_print(list) ) ));
384 if (resolve (temp, list) )
388 while (constraint_isDefined(temp));
393 /*This is a "helper" function for doResolveOr */
395 static /*@only@*/ constraint doResolve (/*@only@*/ constraint c, constraintList post1, bool * resolved)
399 if (!resolveOr (c, post1) )
402 temp = substitute (c, post1);
404 if (!resolveOr (temp, post1) )
406 // try inequality substitution
409 // the inequality substitution may cause us to lose information
410 //so we don't want to store the result but we do it anyway
411 temp2 = constraint_copy (c);
412 // if (context_getFlag (FLG_ORCONSTRAINT) )
413 temp2 = inequalitySubstitute (temp2, post1);
414 if (!resolveOr (temp2, post1) )
416 temp2 = inequalitySubstituteUnsound (temp2, post1);
417 if (!resolveOr (temp2, post1) )
419 if (!constraint_same (temp, temp2) )
420 temp = constraint_addOr (temp, temp2);
423 constraint_free(temp2);
430 constraint_free(temp2);
432 constraint_free(temp);
444 static /*@only@*/ constraint doResolveOr (constraint c, constraintList post1, /*@out@*/bool * resolved)
451 ret = constraint_copy(c);
455 ret = doResolve (ret, post1, resolved);
460 constraint_free(next);
462 /*we don't need to free ret when resolved is false*/
463 // constraint_free(ret);
473 curr = doResolve (curr, post1, resolved);
476 /* curr is null so we don't try to free it*/
477 //constraint_free(curr);
480 constraint_free(next);
481 constraint_free(ret);
484 ret = constraint_addOr (ret, curr);
485 constraint_free(curr);
495 /* tries to resolve constraints in list pr2 using post1 */
496 /*@only@*/ constraintList reflectChangesOr (constraintList pre2, constraintList post1)
501 ret = constraintList_makeNew();
502 DPRINTF((message ("reflectChangesOr: lists %s and %s", constraintList_print(pre2), constraintList_print(post1) )));
504 constraintList_elements (pre2, el)
506 temp = doResolveOr (el, post1, &resolved);
510 ret = constraintList_add(ret, temp);
512 } end_constraintList_elements;
514 DPRINTF((message ("reflectChangesOr: returning %s", constraintList_print(ret) ) ) );
517 static /*@only@*/ constraintList reflectChangesEnsures (/*@observer@*/ constraintList pre2, constraintList post1)
521 ret = constraintList_makeNew();
522 constraintList_elements (pre2, el)
524 if (!resolve (el, post1) )
526 temp = substitute (el, post1);
527 llassert (temp != NULL);
529 if (!resolve (temp, post1) )
530 ret = constraintList_add (ret, temp);
534 DPRINTF ( (message ("Resolved away %s ", constraint_print(el) ) ) );
536 } end_constraintList_elements;
542 static /*@only@*/ constraintList reflectChangesEnsuresFree1 (/*@only@*/ constraintList pre2, constraintList post1)
546 ret = reflectChangesEnsures (pre2, post1);
548 constraintList_free(pre2);
554 static bool constraint_conflict (constraint c1, constraint c2)
557 if (constraintExpr_similar(c1->lexpr, c2->lexpr) )
560 if (c1->ar == c2->ar)
562 DPRINTF ( (message ("%s conflicts with %s ", constraint_print (c1), constraint_print(c2) ) ) );
567 DPRINTF ( (message ("%s doesn't conflict with %s ", constraint_print (c1), constraint_print(c2) ) ) );
573 static void constraint_fixConflict ( constraint good, /*@observer@*/ constraint conflicting) /*@modifies good@*/
575 if (conflicting->ar ==EQ )
577 good->expr = constraintExpr_searchandreplace (good->expr, conflicting->lexpr, conflicting->expr);
578 good = constraint_simplify (good);
584 static bool conflict (constraint c, constraintList list)
587 constraintList_elements (list, el)
589 if ( constraint_conflict(el, c) )
591 constraint_fixConflict (el, c);
594 } end_constraintList_elements;
600 //check if constraint in list1 conflicts with constraints in List2. If so we
601 //remove form list1 and change list2.
602 constraintList constraintList_fixConflicts (constraintList list1, constraintList list2)
605 ret = constraintList_makeNew();
606 llassert(constraintList_isDefined(list1) );
607 constraintList_elements (list1, el)
609 if (! conflict (el, list2) )
612 temp = constraint_copy(el);
613 ret = constraintList_add (ret, temp);
615 } end_constraintList_elements;
620 /*returns true if constraint post satifies cosntriant pre */
621 static bool satifies (constraint pre, constraint post)
623 if (constraint_isAlwaysTrue (pre) )
626 if (!constraintExpr_similar (pre->lexpr, post->lexpr) )
630 if (post->expr == NULL)
636 return rangeCheck (pre->ar, pre->expr, post->ar, post->expr);
640 bool resolve (/*@observer@*/ constraint c, /*@observer@*/ constraintList p)
642 constraintList_elements (p, el)
644 if ( satifies (c, el) )
646 DPRINTF ( (message ("\n%s Satifies %s\n ", constraint_print(el), constraint_print(c) ) ) );
649 DPRINTF ( (message ("\n%s does not satify %s\n ", constraint_print(el), constraint_print(c) ) ) );
651 end_constraintList_elements;
652 DPRINTF ( (message ("no constraints satify %s", constraint_print(c) ) ));
656 static bool arithType_canResolve (arithType ar1, arithType ar2)
662 if ( (ar2 == GT) || (ar2 == GTE) || (ar2 == EQ) )
676 if ( (ar2 == LT) || (ar2 == LTE) || (ar2 == EQ) )
685 /* We look for constraint which are tautologies */
687 bool constraint_isAlwaysTrue (/*@observer@*/ constraint c)
690 bool /*@unused@*/ lHasConstant, rHasConstant;
691 int /*@unused@*/ lConstant, rConstant;
696 DPRINTF(( message("constraint_IsAlwaysTrue:examining %s", constraint_print(c) ) ));
698 if (constraintExpr_canGetValue(l) && constraintExpr_canGetValue(r) )
701 cmp = constraintExpr_compare (l, r);
722 if (constraintExpr_similar (l,r) )
741 l = constraintExpr_copy (c->lexpr);
742 r = constraintExpr_copy (c->expr);
744 // l = constraintExpr_propagateConstants (l, &lHasConstant, &lConstant);
745 r = constraintExpr_propagateConstants (r, &rHasConstant, &rConstant);
747 if (constraintExpr_similar (l,r) && (rHasConstant ) )
749 DPRINTF(( message("constraint_IsAlwaysTrue: after removing constants %s and %s are similar", constraintExpr_unparse(l), constraintExpr_unparse(r) ) ));
750 DPRINTF(( message("constraint_IsAlwaysTrue: rconstant is %d", rConstant ) ));
752 constraintExpr_free(l);
753 constraintExpr_free(r);
758 return (rConstant == 0);
760 return (rConstant > 0);
762 return (rConstant >= 0);
764 return (rConstant <= 0);
766 return (rConstant < 0);
776 constraintExpr_free(l);
777 constraintExpr_free(r);
778 DPRINTF(( message("Constraint %s is not always true", constraint_print(c) ) ));
785 static bool rangeCheck (arithType ar1, /*@observer@*/ constraintExpr expr1, arithType ar2, /*@observer@*/ constraintExpr expr2)
788 DPRINTF ((message ("Doing Range CHECK %s and %s", constraintExpr_unparse(expr1), constraintExpr_unparse(expr2) ) ));
790 if (! arithType_canResolve (ar1, ar2) )
796 if (constraintExpr_similar (expr1, expr2) )
800 if (! (constraintExpr_canGetValue (expr1) &&
801 constraintExpr_canGetValue (expr2) ) )
803 constraintExpr e1, e2;
807 e1 = constraintExpr_copy(expr1);
808 e2 = constraintExpr_copy(expr2);
810 e1 = constraintExpr_propagateConstants (e1, &p1, &const1);
812 e2 = constraintExpr_propagateConstants (e2, &p2, &const2);
815 if (const1 <= const2)
816 if (constraintExpr_similar (e1, e2) )
818 constraintExpr_free(e1);
819 constraintExpr_free(e2);
823 DPRINTF( ("Can't Get value"));
825 constraintExpr_free(e1);
826 constraintExpr_free(e2);
830 if (constraintExpr_compare (expr2, expr1) >= 0)
835 if (constraintExpr_similar (expr1, expr2) )
840 if (constraintExpr_similar (expr1, expr2) )
844 if (! (constraintExpr_canGetValue (expr1) &&
845 constraintExpr_canGetValue (expr2) ) )
847 constraintExpr e1, e2;
851 e1 = constraintExpr_copy(expr1);
852 e2 = constraintExpr_copy(expr2);
854 e1 = constraintExpr_propagateConstants (e1, &p1, &const1);
856 e2 = constraintExpr_propagateConstants (e2, &p2, &const2);
859 if (const1 >= const2)
860 if (constraintExpr_similar (e1, e2) )
862 constraintExpr_free(e1);
863 constraintExpr_free(e2);
866 constraintExpr_free(e1);
867 constraintExpr_free(e2);
869 DPRINTF( ("Can't Get value"));
873 if (constraintExpr_compare (expr2, expr1) <= 0)
879 llcontbug((message("Unhandled case in switch: %q", arithType_print(ar1) ) ) );
885 static constraint constraint_searchandreplace (/*@returned@*/ constraint c, constraintExpr old, constraintExpr new)
887 DPRINTF (("Doing replace for lexpr") );
888 c->lexpr = constraintExpr_searchandreplace (c->lexpr, old, new);
889 DPRINTF (("Doing replace for expr") );
890 c->expr = constraintExpr_searchandreplace (c->expr, old, new);
894 bool constraint_search (constraint c, constraintExpr old) /*@*/
899 ret = constraintExpr_search (c->lexpr, old);
900 ret = ret || constraintExpr_search (c->expr, old);
904 //adjust file locs and stuff
905 static constraint constraint_adjust (/*@returned@*/ constraint substitute, /*@observer@*/ constraint old)
907 fileloc loc1, loc2, loc3;
909 DPRINTF ( (message("Start adjust on %s and %s", constraint_print(substitute),
910 constraint_print(old))
913 loc1 = constraint_getFileloc (old);
915 loc2 = constraintExpr_getFileloc (substitute->lexpr);
917 loc3 = constraintExpr_getFileloc (substitute->expr);
920 // special case of an equality that "contains itself"
921 if (constraintExpr_search (substitute->expr, substitute->lexpr) )
922 if (fileloc_closer (loc1, loc3, loc2))
925 DPRINTF ( (message("Doing adjust on %s", constraint_print(substitute) )
927 temp = substitute->lexpr;
928 substitute->lexpr = substitute->expr;
929 substitute->expr = temp;
930 substitute = constraint_simplify(substitute);
941 /* If function preforms substitutes based on inequality
943 It uses the rule x >= y && b < y ===> x >= b + 1
945 Warning this is sound but throws out information
947 constraint inequalitySubstitute (/*@returned@*/ constraint c, constraintList p)
952 constraintList_elements (p, el)
955 // if (!constraint_conflict (c, el) )
958 constraintExpr temp2;
962 //temp = constraint_copy(el);
964 // temp = constraint_adjust(temp, c);
966 if (constraintExpr_same (el->expr, c->expr) )
968 DPRINTF((message ("inequalitySubstitute Replacing %s in %s with %s",
969 constraintExpr_print (c->expr),
970 constraint_print (c),
971 constraintExpr_print (el->expr) )
973 temp2 = constraintExpr_copy (el->lexpr);
974 constraintExpr_free(c->expr);
975 c->expr = constraintExpr_makeIncConstraintExpr (temp2);
980 end_constraintList_elements;
982 c = constraint_simplify(c);
986 /* This function performs substitutions based on the rule:
987 for a constraint of the form expr1 >= expr2; a < b =>
988 a = b -1 for all a in expr1. This will work in most cases.
990 Like inequalitySubstitute we're throwing away some information
993 static constraint inequalitySubstituteUnsound (/*@returned@*/ constraint c, constraintList p)
995 DPRINTF (( message ("Doing inequalitySubstituteUnsound " ) ));
1000 constraintList_elements (p, el)
1002 DPRINTF (( message ("inequalitySubstituteUnsound examining substituting %s on %s", constraint_print(el), constraint_print(c) ) ));
1003 if ( ( el->ar == LTE) || (el->ar == LT) )
1004 // if (!constraint_conflict (c, el) )
1007 constraintExpr temp2;
1009 //temp = constraint_copy(el);
1011 // temp = constraint_adjust(temp, c);
1012 temp2 = constraintExpr_copy (el->expr);
1015 temp2 = constraintExpr_makeDecConstraintExpr (temp2);
1017 DPRINTF((message ("Replacing %s in %s with %s",
1018 constraintExpr_print (el->lexpr),
1019 constraintExpr_print (c->lexpr),
1020 constraintExpr_print (temp2) ) ));
1022 c->lexpr = constraintExpr_searchandreplace (c->lexpr, el->lexpr, temp2);
1023 constraintExpr_free(temp2);
1026 end_constraintList_elements;
1028 c = constraint_simplify(c);
1032 /*@only@*/ constraint substitute (/*@observer@*/ constraint c, constraintList p)
1036 ret = constraint_copy(c);
1037 constraintList_elements (p, el)
1040 if (!constraint_conflict (ret, el) )
1045 temp = constraint_copy(el);
1047 temp = constraint_adjust(temp, ret);
1049 DPRINTF((message ("Substituting %s in the constraint %s",
1050 constraint_print (temp), constraint_print (ret)
1054 ret = constraint_searchandreplace (ret, temp->lexpr, temp->expr);
1055 DPRINTF(( message ("The new constraint is %s", constraint_print (ret) ) ));
1056 constraint_free(temp);
1059 end_constraintList_elements;
1060 DPRINTF(( message ("The finial new constraint is %s", constraint_print (ret) ) ));
1062 ret = constraint_simplify(ret);
1067 /*@only@*/ constraintList constraintList_substituteFreeTarget (/*@only@*/ constraintList target, /*@observer@*/ constraintList subList)
1071 ret = constraintList_substitute (target, subList);
1073 constraintList_free(target);
1078 /* we try to do substitutions on each constraint in target using the constraint in sublist*/
1080 /*@only@*/ constraintList constraintList_substitute (constraintList target,/*2observer@*/ constraintList subList)
1085 ret = constraintList_makeNew();
1087 constraintList_elements(target, el)
1090 #warning make sure that a side effect is not expected
1092 temp = substitute(el, subList);
1093 ret = constraintList_add (ret, temp);
1095 end_constraintList_elements;
1100 constraint constraint_solve (/*@returned@*/ constraint c)
1102 DPRINTF( (message ("Solving %s\n", constraint_print(c) ) ) );
1103 c->expr = constraintExpr_solveBinaryExpr (c->lexpr, c->expr);
1104 DPRINTF( (message ("Solved and got %s\n", constraint_print(c) ) ) );
1109 static arithType flipAr (arithType ar)
1124 llcontbug (message("unexpected value: case not handled"));
1129 static constraint constraint_swapLeftRight (/*@returned@*/ constraint c)
1131 constraintExpr temp;
1132 c->ar = flipAr (c->ar);
1136 DPRINTF(("Swaped left and right sides of constraint"));
1142 constraint constraint_simplify ( /*@returned@*/ constraint c)
1144 c->lexpr = constraintExpr_simplify (c->lexpr);
1145 c->expr = constraintExpr_simplify (c->expr);
1147 if (constraintExpr_isBinaryExpr (c->lexpr) )
1149 c = constraint_solve (c);
1151 c->lexpr = constraintExpr_simplify (c->lexpr);
1152 c->expr = constraintExpr_simplify (c->expr);
1155 if (constraintExpr_isLit(c->lexpr) && (!constraintExpr_isLit(c->expr) ) )
1157 c = constraint_swapLeftRight(c);
1158 /*I don't think this will be an infinate loop*/
1159 c = constraint_simplify(c);
1167 /* returns true if fileloc for term1 is closer to file for term2 than term3*/
1169 bool fileloc_closer (fileloc loc1, fileloc loc2, fileloc loc3)
1172 if (!fileloc_isDefined (loc1) )
1175 if (!fileloc_isDefined (loc2) )
1178 if (!fileloc_isDefined (loc3) )
1184 if (fileloc_equal (loc2, loc3) )
1187 if (fileloc_equal (loc1, loc2) )
1190 if (fileloc_equal (loc1, loc3) )
1193 if ( fileloc_lessthan (loc1, loc2) )
1195 if (fileloc_lessthan (loc2, loc3) )
1197 llassert (fileloc_lessthan (loc1, loc3) );
1206 if ( !fileloc_lessthan (loc1, loc2) )
1208 if (!fileloc_lessthan (loc2, loc3) )
1210 llassert (!fileloc_lessthan (loc1, loc3) );