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);
346 constraint_free(temp2);
350 constraint_free(temp2);
353 constraint_free(temp);
355 } end_constraintList_elements;
357 DPRINTF((message ("reflectChanges: returning %s", constraintList_print(ret) ) ) );
362 static constraint constraint_addOr (/*@returned@*/ constraint orig, /*@observer@*/ constraint or)
367 DPRINTF((message("constraint_addor: oring %s onto %s", constraint_printOr(or), constraint_printOr(orig) ) ));
369 while (c->or != NULL)
373 c->or = constraint_copy(or);
375 DPRINTF((message("constraint_addor: returning %s",constraint_printOr(orig) ) ));
381 static bool resolveOr (/*@observer@*/ constraint c, /*@observer@*/ constraintList list)
385 DPRINTF(( message("resolveOr: constraint %s and list %s", constraint_printOr(c), constraintList_print(list) ) ));
390 if (resolve (temp, list) )
394 while (constraint_isDefined(temp));
399 /*This is a "helper" function for doResolveOr */
401 static /*@only@*/ constraint doResolve (/*@only@*/ constraint c, constraintList post1, bool * resolved)
405 if (!resolveOr (c, post1) )
408 temp = substitute (c, post1);
410 if (!resolveOr (temp, post1) )
412 // try inequality substitution
415 // the inequality substitution may cause us to lose information
416 //so we don't want to store the result but we do it anyway
417 temp2 = constraint_copy (c);
418 // if (context_getFlag (FLG_ORCONSTRAINT) )
419 temp2 = inequalitySubstitute (temp2, post1);
420 if (!resolveOr (temp2, post1) )
422 temp2 = inequalitySubstituteUnsound (temp2, post1);
423 if (!resolveOr (temp2, post1) )
425 if (!constraint_same (temp, temp2) )
426 temp = constraint_addOr (temp, temp2);
429 constraint_free(temp2);
436 constraint_free(temp2);
438 constraint_free(temp);
450 static /*@only@*/ constraint doResolveOr (constraint c, constraintList post1, /*@out@*/bool * resolved)
457 ret = constraint_copy(c);
461 ret = doResolve (ret, post1, resolved);
466 constraint_free(next);
468 /*we don't need to free ret when resolved is false because ret is null*/
469 llassert(ret == NULL);
480 curr = doResolve (curr, post1, resolved);
483 /* curr is null so we don't try to free it*/
484 llassert(curr == NULL);
487 constraint_free(next);
489 constraint_free(ret);
492 ret = constraint_addOr (ret, curr);
493 constraint_free(curr);
503 /* tries to resolve constraints in list pr2 using post1 */
504 /*@only@*/ constraintList reflectChangesOr (constraintList pre2, constraintList post1)
509 ret = constraintList_makeNew();
510 DPRINTF((message ("reflectChangesOr: lists %s and %s", constraintList_print(pre2), constraintList_print(post1) )));
512 constraintList_elements (pre2, el)
514 temp = doResolveOr (el, post1, &resolved);
518 ret = constraintList_add(ret, temp);
522 /*we don't need to free ret when resolved is false because ret is null*/
523 llassert(temp == NULL);
526 } end_constraintList_elements;
528 DPRINTF((message ("reflectChangesOr: returning %s", constraintList_print(ret) ) ) );
531 static /*@only@*/ constraintList reflectChangesEnsures (/*@observer@*/ constraintList pre2, constraintList post1)
535 ret = constraintList_makeNew();
536 constraintList_elements (pre2, el)
538 if (!resolve (el, post1) )
540 temp = substitute (el, post1);
541 llassert (temp != NULL);
543 if (!resolve (temp, post1) )
544 ret = constraintList_add (ret, temp);
546 constraint_free(temp);
550 DPRINTF ( (message ("Resolved away %s ", constraint_print(el) ) ) );
552 } end_constraintList_elements;
558 static /*@only@*/ constraintList reflectChangesEnsuresFree1 (/*@only@*/ constraintList pre2, constraintList post1)
562 ret = reflectChangesEnsures (pre2, post1);
564 constraintList_free(pre2);
570 static bool constraint_conflict (constraint c1, constraint c2)
573 if (constraintExpr_similar(c1->lexpr, c2->lexpr) )
576 if (c1->ar == c2->ar)
578 DPRINTF ( (message ("%s conflicts with %s ", constraint_print (c1), constraint_print(c2) ) ) );
583 DPRINTF ( (message ("%s doesn't conflict with %s ", constraint_print (c1), constraint_print(c2) ) ) );
589 static void constraint_fixConflict ( constraint good, /*@observer@*/ constraint conflicting) /*@modifies good@*/
591 if (conflicting->ar ==EQ )
593 good->expr = constraintExpr_searchandreplace (good->expr, conflicting->lexpr, conflicting->expr);
594 good = constraint_simplify (good);
600 static bool conflict (constraint c, constraintList list)
603 constraintList_elements (list, el)
605 if ( constraint_conflict(el, c) )
607 constraint_fixConflict (el, c);
610 } end_constraintList_elements;
616 //check if constraint in list1 conflicts with constraints in List2. If so we
617 //remove form list1 and change list2.
618 constraintList constraintList_fixConflicts (constraintList list1, constraintList list2)
621 ret = constraintList_makeNew();
622 llassert(constraintList_isDefined(list1) );
623 constraintList_elements (list1, el)
625 if (! conflict (el, list2) )
628 temp = constraint_copy(el);
629 ret = constraintList_add (ret, temp);
631 } end_constraintList_elements;
636 /*returns true if constraint post satifies cosntriant pre */
637 static bool satifies (constraint pre, constraint post)
639 if (constraint_isAlwaysTrue (pre) )
642 if (!constraintExpr_similar (pre->lexpr, post->lexpr) )
646 if (post->expr == NULL)
652 return rangeCheck (pre->ar, pre->expr, post->ar, post->expr);
656 bool resolve (/*@observer@*/ constraint c, /*@observer@*/ constraintList p)
658 constraintList_elements (p, el)
660 if ( satifies (c, el) )
662 DPRINTF ( (message ("\n%s Satifies %s\n ", constraint_print(el), constraint_print(c) ) ) );
665 DPRINTF ( (message ("\n%s does not satify %s\n ", constraint_print(el), constraint_print(c) ) ) );
667 end_constraintList_elements;
668 DPRINTF ( (message ("no constraints satify %s", constraint_print(c) ) ));
672 static bool arithType_canResolve (arithType ar1, arithType ar2)
678 if ( (ar2 == GT) || (ar2 == GTE) || (ar2 == EQ) )
692 if ( (ar2 == LT) || (ar2 == LTE) || (ar2 == EQ) )
701 /* We look for constraint which are tautologies */
703 bool constraint_isAlwaysTrue (/*@observer@*/ constraint c)
706 bool /*@unused@*/ lHasConstant, rHasConstant;
707 int /*@unused@*/ lConstant, rConstant;
712 DPRINTF(( message("constraint_IsAlwaysTrue:examining %s", constraint_print(c) ) ));
714 if (constraintExpr_canGetValue(l) && constraintExpr_canGetValue(r) )
717 cmp = constraintExpr_compare (l, r);
738 if (constraintExpr_similar (l,r) )
757 l = constraintExpr_copy (c->lexpr);
758 r = constraintExpr_copy (c->expr);
760 // l = constraintExpr_propagateConstants (l, &lHasConstant, &lConstant);
761 r = constraintExpr_propagateConstants (r, &rHasConstant, &rConstant);
763 if (constraintExpr_similar (l,r) && (rHasConstant ) )
765 DPRINTF(( message("constraint_IsAlwaysTrue: after removing constants %s and %s are similar", constraintExpr_unparse(l), constraintExpr_unparse(r) ) ));
766 DPRINTF(( message("constraint_IsAlwaysTrue: rconstant is %d", rConstant ) ));
768 constraintExpr_free(l);
769 constraintExpr_free(r);
774 return (rConstant == 0);
776 return (rConstant > 0);
778 return (rConstant >= 0);
780 return (rConstant <= 0);
782 return (rConstant < 0);
792 constraintExpr_free(l);
793 constraintExpr_free(r);
794 DPRINTF(( message("Constraint %s is not always true", constraint_print(c) ) ));
801 static bool rangeCheck (arithType ar1, /*@observer@*/ constraintExpr expr1, arithType ar2, /*@observer@*/ constraintExpr expr2)
804 DPRINTF ((message ("Doing Range CHECK %s and %s", constraintExpr_unparse(expr1), constraintExpr_unparse(expr2) ) ));
806 if (! arithType_canResolve (ar1, ar2) )
812 if (constraintExpr_similar (expr1, expr2) )
816 if (! (constraintExpr_canGetValue (expr1) &&
817 constraintExpr_canGetValue (expr2) ) )
819 constraintExpr e1, e2;
823 e1 = constraintExpr_copy(expr1);
824 e2 = constraintExpr_copy(expr2);
826 e1 = constraintExpr_propagateConstants (e1, &p1, &const1);
828 e2 = constraintExpr_propagateConstants (e2, &p2, &const2);
831 if (const1 <= const2)
832 if (constraintExpr_similar (e1, e2) )
834 constraintExpr_free(e1);
835 constraintExpr_free(e2);
839 DPRINTF( ("Can't Get value"));
841 constraintExpr_free(e1);
842 constraintExpr_free(e2);
846 if (constraintExpr_compare (expr2, expr1) >= 0)
851 if (constraintExpr_similar (expr1, expr2) )
856 if (constraintExpr_similar (expr1, expr2) )
860 if (! (constraintExpr_canGetValue (expr1) &&
861 constraintExpr_canGetValue (expr2) ) )
863 constraintExpr e1, e2;
867 e1 = constraintExpr_copy(expr1);
868 e2 = constraintExpr_copy(expr2);
870 e1 = constraintExpr_propagateConstants (e1, &p1, &const1);
872 e2 = constraintExpr_propagateConstants (e2, &p2, &const2);
875 if (const1 >= const2)
876 if (constraintExpr_similar (e1, e2) )
878 constraintExpr_free(e1);
879 constraintExpr_free(e2);
882 constraintExpr_free(e1);
883 constraintExpr_free(e2);
885 DPRINTF( ("Can't Get value"));
889 if (constraintExpr_compare (expr2, expr1) <= 0)
895 llcontbug((message("Unhandled case in switch: %q", arithType_print(ar1) ) ) );
901 static constraint constraint_searchandreplace (/*@returned@*/ constraint c, constraintExpr old, constraintExpr new)
903 DPRINTF (("Doing replace for lexpr") );
904 c->lexpr = constraintExpr_searchandreplace (c->lexpr, old, new);
905 DPRINTF (("Doing replace for expr") );
906 c->expr = constraintExpr_searchandreplace (c->expr, old, new);
910 bool constraint_search (constraint c, constraintExpr old) /*@*/
915 ret = constraintExpr_search (c->lexpr, old);
916 ret = ret || constraintExpr_search (c->expr, old);
920 //adjust file locs and stuff
921 static constraint constraint_adjust (/*@returned@*/ constraint substitute, /*@observer@*/ constraint old)
923 fileloc loc1, loc2, loc3;
925 DPRINTF ( (message("Start adjust on %s and %s", constraint_print(substitute),
926 constraint_print(old))
929 loc1 = constraint_getFileloc (old);
931 loc2 = constraintExpr_getFileloc (substitute->lexpr);
933 loc3 = constraintExpr_getFileloc (substitute->expr);
936 // special case of an equality that "contains itself"
937 if (constraintExpr_search (substitute->expr, substitute->lexpr) )
938 if (fileloc_closer (loc1, loc3, loc2))
941 DPRINTF ( (message("Doing adjust on %s", constraint_print(substitute) )
943 temp = substitute->lexpr;
944 substitute->lexpr = substitute->expr;
945 substitute->expr = temp;
946 substitute = constraint_simplify(substitute);
957 /* If function preforms substitutes based on inequality
959 It uses the rule x >= y && b < y ===> x >= b + 1
961 Warning this is sound but throws out information
963 constraint inequalitySubstitute (/*@returned@*/ constraint c, constraintList p)
968 constraintList_elements (p, el)
971 // if (!constraint_conflict (c, el) )
974 constraintExpr temp2;
978 //temp = constraint_copy(el);
980 // temp = constraint_adjust(temp, c);
982 if (constraintExpr_same (el->expr, c->expr) )
984 DPRINTF((message ("inequalitySubstitute Replacing %s in %s with %s",
985 constraintExpr_print (c->expr),
986 constraint_print (c),
987 constraintExpr_print (el->expr) )
989 temp2 = constraintExpr_copy (el->lexpr);
990 constraintExpr_free(c->expr);
991 c->expr = constraintExpr_makeIncConstraintExpr (temp2);
996 end_constraintList_elements;
998 c = constraint_simplify(c);
1002 /* This function performs substitutions based on the rule:
1003 for a constraint of the form expr1 >= expr2; a < b =>
1004 a = b -1 for all a in expr1. This will work in most cases.
1006 Like inequalitySubstitute we're throwing away some information
1009 static constraint inequalitySubstituteUnsound (/*@returned@*/ constraint c, constraintList p)
1011 DPRINTF (( message ("Doing inequalitySubstituteUnsound " ) ));
1016 constraintList_elements (p, el)
1018 DPRINTF (( message ("inequalitySubstituteUnsound examining substituting %s on %s", constraint_print(el), constraint_print(c) ) ));
1019 if ( ( el->ar == LTE) || (el->ar == LT) )
1020 // if (!constraint_conflict (c, el) )
1023 constraintExpr temp2;
1025 //temp = constraint_copy(el);
1027 // temp = constraint_adjust(temp, c);
1028 temp2 = constraintExpr_copy (el->expr);
1031 temp2 = constraintExpr_makeDecConstraintExpr (temp2);
1033 DPRINTF((message ("Replacing %s in %s with %s",
1034 constraintExpr_print (el->lexpr),
1035 constraintExpr_print (c->lexpr),
1036 constraintExpr_print (temp2) ) ));
1038 c->lexpr = constraintExpr_searchandreplace (c->lexpr, el->lexpr, temp2);
1039 constraintExpr_free(temp2);
1042 end_constraintList_elements;
1044 c = constraint_simplify(c);
1048 /*@only@*/ constraint substitute (/*@observer@*/ constraint c, constraintList p)
1052 ret = constraint_copy(c);
1053 constraintList_elements (p, el)
1056 if (!constraint_conflict (ret, el) )
1061 temp = constraint_copy(el);
1063 temp = constraint_adjust(temp, ret);
1065 DPRINTF((message ("Substituting %s in the constraint %s",
1066 constraint_print (temp), constraint_print (ret)
1070 ret = constraint_searchandreplace (ret, temp->lexpr, temp->expr);
1071 DPRINTF(( message ("The new constraint is %s", constraint_print (ret) ) ));
1072 constraint_free(temp);
1075 end_constraintList_elements;
1076 DPRINTF(( message ("The finial new constraint is %s", constraint_print (ret) ) ));
1078 ret = constraint_simplify(ret);
1083 /*@only@*/ constraintList constraintList_substituteFreeTarget (/*@only@*/ constraintList target, /*@observer@*/ constraintList subList)
1087 ret = constraintList_substitute (target, subList);
1089 constraintList_free(target);
1094 /* we try to do substitutions on each constraint in target using the constraint in sublist*/
1096 /*@only@*/ constraintList constraintList_substitute (constraintList target,/*2observer@*/ constraintList subList)
1101 ret = constraintList_makeNew();
1103 constraintList_elements(target, el)
1106 #warning make sure that a side effect is not expected
1108 temp = substitute(el, subList);
1109 ret = constraintList_add (ret, temp);
1111 end_constraintList_elements;
1116 constraint constraint_solve (/*@returned@*/ constraint c)
1118 DPRINTF( (message ("Solving %s\n", constraint_print(c) ) ) );
1119 c->expr = constraintExpr_solveBinaryExpr (c->lexpr, c->expr);
1120 DPRINTF( (message ("Solved and got %s\n", constraint_print(c) ) ) );
1125 static arithType flipAr (arithType ar)
1140 llcontbug (message("unexpected value: case not handled"));
1145 static constraint constraint_swapLeftRight (/*@returned@*/ constraint c)
1147 constraintExpr temp;
1148 c->ar = flipAr (c->ar);
1152 DPRINTF(("Swaped left and right sides of constraint"));
1158 constraint constraint_simplify ( /*@returned@*/ constraint c)
1160 c->lexpr = constraintExpr_simplify (c->lexpr);
1161 c->expr = constraintExpr_simplify (c->expr);
1163 if (constraintExpr_isBinaryExpr (c->lexpr) )
1165 c = constraint_solve (c);
1167 c->lexpr = constraintExpr_simplify (c->lexpr);
1168 c->expr = constraintExpr_simplify (c->expr);
1171 if (constraintExpr_isLit(c->lexpr) && (!constraintExpr_isLit(c->expr) ) )
1173 c = constraint_swapLeftRight(c);
1174 /*I don't think this will be an infinate loop*/
1175 c = constraint_simplify(c);
1183 /* returns true if fileloc for term1 is closer to file for term2 than term3*/
1185 bool fileloc_closer (fileloc loc1, fileloc loc2, fileloc loc3)
1188 if (!fileloc_isDefined (loc1) )
1191 if (!fileloc_isDefined (loc2) )
1194 if (!fileloc_isDefined (loc3) )
1200 if (fileloc_equal (loc2, loc3) )
1203 if (fileloc_equal (loc1, loc2) )
1206 if (fileloc_equal (loc1, loc3) )
1209 if ( fileloc_lessthan (loc1, loc2) )
1211 if (fileloc_lessthan (loc2, loc3) )
1213 llassert (fileloc_lessthan (loc1, loc3) );
1222 if ( !fileloc_lessthan (loc1, loc2) )
1224 if (!fileloc_lessthan (loc2, loc3) )
1226 llassert (!fileloc_lessthan (loc1, loc3) );