]>
Commit | Line | Data |
---|---|---|
65f973be | 1 | /* |
11db3170 | 2 | ** Splint - annotation-assisted static program checker |
c59f5181 | 3 | ** Copyright (C) 1994-2003 University of Virginia, |
65f973be | 4 | ** Massachusetts Institute of Technology |
5 | ** | |
6 | ** This program is free software; you can redistribute it and/or modify it | |
7 | ** under the terms of the GNU General Public License as published by the | |
8 | ** Free Software Foundation; either version 2 of the License, or (at your | |
9 | ** option) any later version. | |
10 | ** | |
11 | ** This program is distributed in the hope that it will be useful, but | |
12 | ** WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
14 | ** General Public License for more details. | |
15 | ** | |
16 | ** The GNU General Public License is available from http://www.gnu.org/ or | |
17 | ** the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, | |
18 | ** MA 02111-1307, USA. | |
19 | ** | |
155af98d | 20 | ** For information on splint: info@splint.org |
21 | ** To report a bug: splint-bug@splint.org | |
11db3170 | 22 | ** For more information: http://www.splint.org |
65f973be | 23 | */ |
24 | ||
616915dd | 25 | /* |
26 | * | |
27 | ** constraintResolve.c | |
28 | */ | |
29 | ||
b7b694d6 | 30 | /* #define DEBUGPRINT 1 */ |
616915dd | 31 | |
32 | # include <ctype.h> /* for isdigit */ | |
1b8ae690 | 33 | # include "splintMacros.nf" |
616915dd | 34 | # include "basic.h" |
35 | # include "cgrammar.h" | |
36 | # include "cgrammar_tokens.h" | |
37 | ||
38 | # include "exprChecks.h" | |
616915dd | 39 | # include "exprNodeSList.h" |
616915dd | 40 | |
393e573f | 41 | /*@access constraint, exprNode @*/ /*!!! NO! Don't do this so recklessly - design your code more carefully so you don't need to! */ |
42 | ||
ae133592 | 43 | static constraint inequalitySubstitute (/*@returned@*/ constraint p_c, constraintList p_p); |
28bf4b0b | 44 | static bool rangeCheck (arithType p_ar1, /*@observer@*/ constraintExpr p_expr1, arithType p_ar2, /*@observer@*/ constraintExpr p_expr2); |
616915dd | 45 | |
ae133592 | 46 | static constraint inequalitySubstituteUnsound (/*@returned@*/ constraint p_c, constraintList p_p); |
47 | static constraint inequalitySubstituteStrong (/*@returned@*/ constraint p_c, constraintList p_p); | |
dc7f6a51 | 48 | |
28bf4b0b | 49 | static constraint constraint_searchandreplace (/*@returned@*/ constraint p_c, constraintExpr p_old, constraintExpr p_newExpr); |
bb25bea6 | 50 | |
28bf4b0b | 51 | static constraint constraint_addOr (/*@returned@*/ constraint p_orig, /*@observer@*/ constraint p_orConstr); |
52 | ||
35b9a1d9 | 53 | static bool resolveOr (/*@temp@*/constraint p_c, /*@observer@*/ /*@temp@*/ constraintList p_list); |
28bf4b0b | 54 | |
55 | static /*@only@*/ constraintList reflectChangesEnsuresFree1 (/*@only@*/ constraintList p_pre2, constraintList p_post1); | |
616915dd | 56 | |
35b9a1d9 | 57 | |
58 | /*@only@*/ constraintList constraintList_mergeEnsuresFreeFirst (constraintList list1, constraintList list2) | |
bb25bea6 | 59 | { |
35b9a1d9 | 60 | constraintList ret; |
61 | ||
62 | ret = constraintList_mergeEnsures (list1, list2); | |
63 | ||
64 | constraintList_free(list1); | |
bb25bea6 | 65 | return ret; |
66 | } | |
616915dd | 67 | |
35b9a1d9 | 68 | /*@only@*/ constraintList constraintList_mergeEnsures (constraintList list1, constraintList list2) |
616915dd | 69 | { |
70 | constraintList ret; | |
71 | constraintList temp; | |
470b7798 | 72 | |
35b9a1d9 | 73 | llassert(constraintList_isDefined(list1) ); |
74 | llassert(constraintList_isDefined(list2) ); | |
90bc41f7 | 75 | |
35b9a1d9 | 76 | DPRINTF(( message ("constraintList_mergeEnsures: list1 %s list2 %s", |
77 | constraintList_print(list1), constraintList_print(list2) | |
78 | ))); | |
616915dd | 79 | |
90bc41f7 | 80 | ret = constraintList_fixConflicts (list1, list2); |
bb25bea6 | 81 | ret = reflectChangesEnsuresFree1 (ret, list2); |
d46ce6a4 | 82 | temp = constraintList_subsumeEnsures (ret, list2); |
35b9a1d9 | 83 | constraintList_free(ret); |
9a48d98c | 84 | ret = temp; |
35b9a1d9 | 85 | |
d46ce6a4 | 86 | temp = constraintList_subsumeEnsures (list2, ret); |
35b9a1d9 | 87 | |
616915dd | 88 | temp = constraintList_addList (temp, ret); |
35b9a1d9 | 89 | constraintList_free(ret); |
4ab867d6 | 90 | |
35b9a1d9 | 91 | DPRINTF(( message ("constraintList_mergeEnsures: returning %s ", |
92 | constraintList_print(temp) ) | |
93 | )); | |
94 | ||
95 | ||
616915dd | 96 | return temp; |
616915dd | 97 | } |
98 | ||
35b9a1d9 | 99 | |
100 | /*@only@*/ constraintList constraintList_mergeRequiresFreeFirst (/*@only@*/ constraintList list1, constraintList list2) | |
bb25bea6 | 101 | { |
35b9a1d9 | 102 | constraintList ret; |
103 | ||
104 | ret = constraintList_mergeRequires(list1, list2); | |
105 | ||
106 | constraintList_free(list1); | |
107 | ||
bb25bea6 | 108 | return ret; |
109 | } | |
110 | ||
35b9a1d9 | 111 | /*@only@*/ constraintList constraintList_mergeRequires (constraintList list1, constraintList list2) |
470b7798 | 112 | { |
113 | constraintList ret; | |
114 | constraintList temp; | |
115 | ||
35b9a1d9 | 116 | DPRINTF((message ("constraintList_mergeRequires: merging %s and %s ", constraintList_print (list1), constraintList_print(list2) ) ) ); |
470b7798 | 117 | |
35b9a1d9 | 118 | if (context_getFlag (FLG_REDUNDANTCONSTRAINTS) ) |
4a689c7f | 119 | { |
35b9a1d9 | 120 | ret = constraintList_copy(list1); |
121 | ret = constraintList_addList(ret, list2); | |
4a689c7f | 122 | return ret; |
123 | } | |
35b9a1d9 | 124 | |
470b7798 | 125 | /* get constraints in list1 not satified by list2 */ |
35b9a1d9 | 126 | temp = constraintList_reflectChanges(list1, list2); |
127 | DPRINTF((message ("constraintList_mergeRequires: temp = %s", constraintList_print(temp) ) ) ); | |
128 | ||
129 | /*get constraints in list2 not satified by temp*/ | |
130 | ret = constraintList_reflectChanges(list2, temp); | |
131 | ||
132 | DPRINTF((message ("constraintList_mergeRequires: ret = %s", constraintList_print(ret) ) ) ); | |
470b7798 | 133 | |
4ab867d6 | 134 | ret = constraintList_addListFree (ret, temp); |
470b7798 | 135 | |
35b9a1d9 | 136 | DPRINTF((message ("constraintList_mergeRequires: returning %s", constraintList_print(ret) ) ) ); |
137 | ||
470b7798 | 138 | return ret; |
139 | } | |
616915dd | 140 | |
28bf4b0b | 141 | /* old name mergeResolve renamed for czech naming convention */ |
142 | void exprNode_mergeResolve (exprNode parent, exprNode child1, exprNode child2) | |
616915dd | 143 | { |
d46ce6a4 | 144 | constraintList temp, temp2; |
616915dd | 145 | |
35b9a1d9 | 146 | DPRINTF((message ("magically merging constraint into parent:%s for", exprNode_unparse (parent) )) ); |
616915dd | 147 | |
35b9a1d9 | 148 | DPRINTF((message (" children: %s and %s", exprNode_unparse (child1), exprNode_unparse(child2) ) ) ); |
616915dd | 149 | |
35b9a1d9 | 150 | |
151 | if (exprNode_isUndefined(parent) ) | |
a64ebe74 | 152 | { |
35b9a1d9 | 153 | llassert (exprNode_isDefined(parent) ); |
a64ebe74 | 154 | return; |
155 | } | |
156 | ||
157 | ||
35b9a1d9 | 158 | if (exprNode_isError (child1) || exprNode_isError(child2) ) |
d46ce6a4 | 159 | { |
35b9a1d9 | 160 | if (exprNode_isError (child1) && !exprNode_isError(child2) ) |
616915dd | 161 | { |
35b9a1d9 | 162 | constraintList_free(parent->requiresConstraints); |
163 | ||
616915dd | 164 | parent->requiresConstraints = constraintList_copy (child2->requiresConstraints); |
35b9a1d9 | 165 | constraintList_free(parent->ensuresConstraints); |
d46ce6a4 | 166 | |
616915dd | 167 | parent->ensuresConstraints = constraintList_copy (child2->ensuresConstraints); |
35b9a1d9 | 168 | DPRINTF((message ("Copied child constraints: pre: %s and post: %s", |
169 | constraintList_print( child2->requiresConstraints), | |
170 | constraintList_print (child2->ensuresConstraints) | |
171 | ) | |
172 | )); | |
616915dd | 173 | return; |
174 | } | |
175 | else | |
176 | { | |
35b9a1d9 | 177 | llassert(exprNode_isError(child2) ); |
616915dd | 178 | return; |
179 | } | |
180 | } | |
181 | ||
35b9a1d9 | 182 | llassert(!exprNode_isError (child1) && ! exprNode_isError(child2) ); |
616915dd | 183 | |
35b9a1d9 | 184 | DPRINTF((message ("Child constraints are %s %s and %s %s", |
185 | constraintList_print (child1->requiresConstraints), | |
186 | constraintList_print (child1->ensuresConstraints), | |
187 | constraintList_print (child2->requiresConstraints), | |
188 | constraintList_print (child2->ensuresConstraints) | |
189 | ) ) ); | |
190 | ||
191 | ||
192 | constraintList_free(parent->requiresConstraints); | |
193 | ||
194 | parent->requiresConstraints = constraintList_copy (child1->requiresConstraints); | |
195 | ||
196 | if ( context_getFlag (FLG_ORCONSTRAINT) ) | |
197 | temp = constraintList_reflectChangesOr (child2->requiresConstraints, child1->ensuresConstraints); | |
198 | else | |
199 | temp = constraintList_reflectChanges(child2->requiresConstraints, child1->ensuresConstraints); | |
200 | ||
201 | temp2 = constraintList_mergeRequires (parent->requiresConstraints, temp); | |
202 | constraintList_free(parent->requiresConstraints); | |
203 | constraintList_free(temp); | |
204 | ||
205 | parent->requiresConstraints = temp2; | |
206 | ||
207 | DPRINTF((message ("Parent requires constraints are %s ", | |
208 | constraintList_print (parent->requiresConstraints) | |
209 | ) ) ); | |
210 | ||
211 | constraintList_free(parent->ensuresConstraints); | |
212 | ||
213 | parent->ensuresConstraints = constraintList_mergeEnsures(child1->ensuresConstraints, | |
214 | child2->ensuresConstraints); | |
215 | ||
216 | ||
217 | DPRINTF((message ("Parent constraints are %s and %s ", | |
218 | constraintList_print (parent->requiresConstraints), | |
219 | constraintList_print (parent->ensuresConstraints) | |
220 | ) ) ); | |
616915dd | 221 | |
222 | } | |
616915dd | 223 | |
35b9a1d9 | 224 | /*@only@*/ constraintList constraintList_subsumeEnsures (constraintList list1, constraintList list2) |
616915dd | 225 | { |
35b9a1d9 | 226 | constraintList ret; |
227 | ret = constraintList_makeNew(); | |
616915dd | 228 | constraintList_elements (list1, el) |
229 | { | |
35b9a1d9 | 230 | |
231 | DPRINTF ((message ("Examining %s", constraint_print (el) ) ) ); | |
232 | if (!constraintList_resolve (el, list2) ) | |
616915dd | 233 | { |
35b9a1d9 | 234 | constraint temp; |
235 | temp = constraint_copy(el); | |
d46ce6a4 | 236 | ret = constraintList_add (ret, temp); |
616915dd | 237 | } |
238 | else | |
239 | { | |
35b9a1d9 | 240 | DPRINTF ((message ("Subsuming %s", constraint_print (el) ) ) ); |
616915dd | 241 | } |
242 | } end_constraintList_elements; | |
243 | ||
244 | return ret; | |
245 | } | |
246 | ||
35b9a1d9 | 247 | |
248 | ||
249 | /*used to be reflectChangesFreePre renamed for Czech naming conventino*/ | |
bb25bea6 | 250 | /* tries to resolve constraints in list pre2 using post1 */ |
35b9a1d9 | 251 | /*@only@*/ constraintList constraintList_reflectChangesFreePre (/*@only@*/ constraintList pre2, /*@observer@*/ constraintList post1) |
bb25bea6 | 252 | { |
35b9a1d9 | 253 | constraintList ret; |
254 | ||
255 | ret = constraintList_reflectChanges(pre2, post1); | |
256 | ||
bb25bea6 | 257 | constraintList_free (pre2); |
35b9a1d9 | 258 | |
bb25bea6 | 259 | return ret; |
260 | } | |
261 | ||
90bc41f7 | 262 | /* tries to resolve constraints in list pre2 using post1 */ |
35b9a1d9 | 263 | |
264 | static /*@only@*/ constraintList reflectChangesNoOr (/*@observer@*/ /*@temp@*/ constraintList pre2, /*@observer@*/ /*@temp@*/ constraintList post1) | |
616915dd | 265 | { |
9a48d98c | 266 | |
35b9a1d9 | 267 | constraintList ret; |
268 | constraint temp; | |
269 | constraint temp2; | |
270 | ||
271 | llassert (! context_getFlag (FLG_ORCONSTRAINT) ); | |
272 | ||
273 | ret = constraintList_makeNew(); | |
274 | DPRINTF((message ("reflectChanges: lists %s and %s", constraintList_print(pre2), constraintList_print(post1) ))); | |
616915dd | 275 | |
276 | constraintList_elements (pre2, el) | |
277 | { | |
35b9a1d9 | 278 | if (!constraintList_resolve (el, post1) ) |
616915dd | 279 | { |
35b9a1d9 | 280 | temp = constraint_substitute (el, post1); |
281 | if (!constraintList_resolve (temp, post1) ) | |
616915dd | 282 | { |
b7b694d6 | 283 | /* try inequality substitution |
284 | the inequality substitution may cause us to lose information | |
285 | so we don't want to store the result but we do it anyway | |
286 | */ | |
35b9a1d9 | 287 | temp2 = constraint_copy (temp); |
920a3797 | 288 | temp2 = inequalitySubstitute (temp2, post1); |
35b9a1d9 | 289 | if (!constraintList_resolve (temp2, post1) ) |
920a3797 | 290 | { |
291 | temp2 = inequalitySubstituteUnsound (temp2, post1); | |
35b9a1d9 | 292 | if (!constraintList_resolve (temp2, post1) ) |
293 | ret = constraintList_add (ret, temp2); | |
920a3797 | 294 | else |
35b9a1d9 | 295 | constraint_free(temp2); |
920a3797 | 296 | } |
297 | else | |
298 | { | |
35b9a1d9 | 299 | constraint_free(temp2); |
920a3797 | 300 | } |
616915dd | 301 | } |
35b9a1d9 | 302 | constraint_free(temp); |
616915dd | 303 | } |
304 | } end_constraintList_elements; | |
305 | ||
35b9a1d9 | 306 | DPRINTF((message ("reflectChanges: returning %s", constraintList_print(ret) ) ) ); |
307 | return ret; | |
616915dd | 308 | } |
309 | ||
dc7f6a51 | 310 | /* tries to resolve constraints in list pre2 using post1 */ |
35b9a1d9 | 311 | /*@only@*/ constraintList constraintList_reflectChanges(/*@observer@*/ constraintList pre2, /*@observer@*/ constraintList post1) |
dc7f6a51 | 312 | { |
35b9a1d9 | 313 | constraintList temp; |
314 | ||
315 | if ( context_getFlag (FLG_ORCONSTRAINT) ) | |
316 | ||
317 | temp = constraintList_reflectChangesOr (pre2, post1); | |
dc7f6a51 | 318 | else |
35b9a1d9 | 319 | temp = reflectChangesNoOr(pre2, post1); |
320 | ||
321 | return temp; | |
dc7f6a51 | 322 | } |
616915dd | 323 | |
35b9a1d9 | 324 | static constraint constraint_addOr (/*@returned@*/ constraint orig, /*@observer@*/ constraint orConstr) |
90bc41f7 | 325 | { |
35b9a1d9 | 326 | constraint c; |
a64ebe74 | 327 | |
35b9a1d9 | 328 | llassert(constraint_isDefined(orig) ); |
329 | ||
330 | c = orig; | |
331 | ||
332 | DPRINTF((message("constraint_addor: oring %s onto %s", constraint_printOr(orConstr), constraint_printOr(orig) ) )); | |
90bc41f7 | 333 | |
334 | while (c->or != NULL) | |
335 | { | |
336 | c = c->or; | |
337 | } | |
a779b61e | 338 | |
35b9a1d9 | 339 | c->or = constraint_copy(orConstr); |
340 | ||
341 | DPRINTF((message("constraint_addor: returning %s",constraint_printOr(orig) ) )); | |
90bc41f7 | 342 | |
343 | return orig; | |
344 | } | |
345 | ||
35b9a1d9 | 346 | |
347 | static bool resolveOr ( /*@temp@*/ constraint c, /*@observer@*/ /*@temp@*/ constraintList list) | |
90bc41f7 | 348 | { |
35b9a1d9 | 349 | constraint temp; |
350 | ||
351 | int numberOr; | |
352 | ||
353 | numberOr = 0; | |
354 | ||
355 | llassert(constraint_isDefined(c) ); | |
a64ebe74 | 356 | |
35b9a1d9 | 357 | DPRINTF(( message("resolveOr: constraint %s and list %s", constraint_printOr(c), constraintList_print(list) ) )); |
a64ebe74 | 358 | |
35b9a1d9 | 359 | temp = c; |
360 | ||
90bc41f7 | 361 | do |
362 | { | |
35b9a1d9 | 363 | if (constraintList_resolve (temp, list) ) |
364 | return TRUE; | |
90bc41f7 | 365 | temp = temp->or; |
a779b61e | 366 | numberOr++; |
367 | llassert(numberOr <= 10); | |
90bc41f7 | 368 | } |
35b9a1d9 | 369 | while (constraint_isDefined(temp)); |
90bc41f7 | 370 | |
371 | return FALSE; | |
372 | } | |
373 | ||
35b9a1d9 | 374 | /*This is a "helper" function for doResolveOr */ |
90bc41f7 | 375 | |
bb25bea6 | 376 | static /*@only@*/ constraint doResolve (/*@only@*/ constraint c, constraintList post1, bool * resolved) |
90bc41f7 | 377 | { |
35b9a1d9 | 378 | constraint temp; |
a779b61e | 379 | |
35b9a1d9 | 380 | llassert(constraint_isDefined (c ) ); |
381 | ||
382 | DPRINTF((message("doResolve:: call on constraint c = : %q and constraintList %q", | |
383 | constraint_printOr(c), constraintList_print(post1) | |
384 | ) | |
385 | )); | |
90bc41f7 | 386 | |
35b9a1d9 | 387 | if (!resolveOr (c, post1) ) |
388 | { | |
389 | ||
390 | temp = constraint_substitute (c, post1); | |
391 | ||
392 | DPRINTF((message("doResolve:: after substitute temp is %q", | |
393 | constraint_printOr(temp) | |
394 | ) | |
395 | )); | |
d9daf826 | 396 | |
35b9a1d9 | 397 | if (!resolveOr (temp, post1) ) |
90bc41f7 | 398 | { |
b7b694d6 | 399 | /* try inequality substitution */ |
35b9a1d9 | 400 | constraint temp2; |
bb25bea6 | 401 | |
35b9a1d9 | 402 | /* the inequality substitution may cause us to lose information |
403 | so we don't want to store the result but we do anyway | |
b7b694d6 | 404 | */ |
35b9a1d9 | 405 | temp2 = constraint_copy (c); |
b7b694d6 | 406 | temp2 = inequalitySubstitute (temp2, post1); |
407 | ||
35b9a1d9 | 408 | if (!resolveOr (temp2, post1) ) |
b7b694d6 | 409 | { |
35b9a1d9 | 410 | constraint temp3; |
411 | temp3 = constraint_copy(temp2); | |
412 | ||
b7b694d6 | 413 | temp3 = inequalitySubstituteStrong (temp3, post1); |
35b9a1d9 | 414 | if (!resolveOr (temp3, post1) ) |
bb25bea6 | 415 | { |
b7b694d6 | 416 | temp2 = inequalitySubstituteUnsound (temp2, post1); |
35b9a1d9 | 417 | if (!resolveOr (temp2, post1) ) |
dc7f6a51 | 418 | { |
35b9a1d9 | 419 | if (!constraint_same (temp, temp2) ) |
d9daf826 | 420 | { |
421 | /* drl added 8/28/2002*/ | |
422 | /*make sure that the information from | |
423 | a post condition like i = i + 1 is transfered | |
424 | */ | |
425 | constraint tempSub; | |
426 | tempSub = constraint_substitute (temp2, post1); | |
427 | ||
35b9a1d9 | 428 | DPRINTF(( |
429 | message("doResolve: adding %s ", | |
430 | constraint_printOr(tempSub) | |
431 | ) | |
432 | )); | |
433 | ||
434 | DPRINTF(( | |
435 | message("doResolve: not adding %s ", | |
436 | constraint_printOr(temp2) | |
437 | ) | |
438 | )); | |
439 | ||
d9daf826 | 440 | temp = constraint_addOr (temp, tempSub); |
35b9a1d9 | 441 | constraint_free(tempSub); |
442 | ||
d9daf826 | 443 | } |
35b9a1d9 | 444 | if (!constraint_same (temp, temp3) && !constraint_same (temp3, temp2) ) |
d9daf826 | 445 | { |
35b9a1d9 | 446 | /* drl added 8/28/2002*/ |
447 | /*make sure that the information from | |
448 | a post condition like i = i + 1 is transfered | |
d9daf826 | 449 | */ |
450 | constraint tempSub; | |
451 | ||
452 | tempSub = constraint_substitute (temp3, post1); | |
453 | ||
35b9a1d9 | 454 | DPRINTF(( |
455 | message("doResolve: adding %s ", | |
456 | constraint_printOr(tempSub) | |
457 | ) | |
458 | )); | |
459 | ||
460 | ||
461 | DPRINTF(( | |
462 | message("doResolve: not adding %s ", | |
463 | constraint_printOr(temp3) | |
464 | ) | |
465 | )); | |
d9daf826 | 466 | |
467 | temp = constraint_addOr (temp, tempSub); | |
35b9a1d9 | 468 | |
d9daf826 | 469 | constraint_free(tempSub); |
470 | } | |
b7b694d6 | 471 | *resolved = FALSE; |
472 | ||
35b9a1d9 | 473 | constraint_free(temp2); |
474 | constraint_free(temp3); | |
475 | constraint_free(c); | |
b7b694d6 | 476 | |
477 | return temp; | |
bb25bea6 | 478 | } |
35b9a1d9 | 479 | constraint_free(temp2); |
480 | constraint_free(temp3); | |
bb25bea6 | 481 | } |
dc7f6a51 | 482 | else |
483 | { | |
35b9a1d9 | 484 | constraint_free(temp2); |
485 | constraint_free(temp3); | |
b7b694d6 | 486 | } |
90bc41f7 | 487 | } |
b7b694d6 | 488 | else |
489 | { | |
35b9a1d9 | 490 | constraint_free(temp2); |
b7b694d6 | 491 | } |
492 | ||
90bc41f7 | 493 | } |
35b9a1d9 | 494 | constraint_free(temp); |
b7b694d6 | 495 | } |
35b9a1d9 | 496 | constraint_free(c); |
497 | ||
8fd556fb | 498 | *resolved = TRUE; |
b7b694d6 | 499 | return NULL; |
90bc41f7 | 500 | } |
501 | ||
35b9a1d9 | 502 | static /*@only@*/ constraint doResolveOr (/*@observer@*/ /*@temp@*/ constraint c, constraintList post1, /*@out@*/bool * resolved) |
90bc41f7 | 503 | { |
504 | constraint ret; | |
505 | constraint next; | |
506 | constraint curr; | |
a779b61e | 507 | |
35b9a1d9 | 508 | DPRINTF(( message("doResolveOr: constraint %s and list %s", constraint_printOr(c), constraintList_print(post1) ) )); |
509 | ||
ae133592 | 510 | *resolved = FALSE; |
9a48d98c | 511 | |
35b9a1d9 | 512 | llassert(constraint_isDefined(c) ); |
513 | ||
514 | ret = constraint_copy(c); | |
a779b61e | 515 | |
35b9a1d9 | 516 | llassert(constraint_isDefined(ret) ); |
a64ebe74 | 517 | |
35b9a1d9 | 518 | if (constraintList_isEmpty(post1) ) |
a779b61e | 519 | { |
520 | return ret; | |
521 | } | |
522 | ||
90bc41f7 | 523 | next = ret->or; |
524 | ret->or = NULL; | |
525 | ||
526 | ret = doResolve (ret, post1, resolved); | |
35b9a1d9 | 527 | |
bb25bea6 | 528 | if (*resolved) |
529 | { | |
2934b455 | 530 | if (next != NULL) |
35b9a1d9 | 531 | constraint_free(next); |
532 | ||
533 | /*we don't need to free ret when resolved is false because ret is null*/ | |
534 | llassert(ret == NULL); | |
920a3797 | 535 | |
a779b61e | 536 | return NULL; |
bb25bea6 | 537 | } |
a779b61e | 538 | |
84c9ffbf | 539 | while (next != NULL) |
90bc41f7 | 540 | { |
541 | curr = next; | |
542 | next = curr->or; | |
543 | curr->or = NULL; | |
35b9a1d9 | 544 | |
90bc41f7 | 545 | curr = doResolve (curr, post1, resolved); |
a779b61e | 546 | |
8fd556fb | 547 | if (*resolved) |
bb25bea6 | 548 | { |
4ab867d6 | 549 | /* curr is null so we don't try to free it*/ |
35b9a1d9 | 550 | llassert(curr == NULL); |
4ab867d6 | 551 | |
2934b455 | 552 | if (next != NULL) |
35b9a1d9 | 553 | constraint_free(next); |
920a3797 | 554 | |
35b9a1d9 | 555 | constraint_free(ret); |
920a3797 | 556 | return NULL; |
bb25bea6 | 557 | } |
90bc41f7 | 558 | ret = constraint_addOr (ret, curr); |
4ab867d6 | 559 | constraint_free(curr); |
90bc41f7 | 560 | } |
90bc41f7 | 561 | return ret; |
562 | } | |
563 | ||
90bc41f7 | 564 | /* tries to resolve constraints in list pr2 using post1 */ |
35b9a1d9 | 565 | /*@only@*/ constraintList constraintList_reflectChangesOr (constraintList pre2, constraintList post1) |
90bc41f7 | 566 | { |
567 | bool resolved; | |
568 | constraintList ret; | |
569 | constraint temp; | |
c3e695ff | 570 | ret = constraintList_makeNew(); |
35b9a1d9 | 571 | DPRINTF((message ("constraintList_reflectChangesOr: lists %s and %s", constraintList_print(pre2), constraintList_print(post1) ))); |
90bc41f7 | 572 | |
573 | constraintList_elements (pre2, el) | |
574 | { | |
575 | temp = doResolveOr (el, post1, &resolved); | |
35b9a1d9 | 576 | |
90bc41f7 | 577 | if (!resolved) |
578 | { | |
579 | ret = constraintList_add(ret, temp); | |
580 | } | |
920a3797 | 581 | else |
582 | { | |
35b9a1d9 | 583 | /* we don't need to free temp when |
584 | resolved is false because temp is null */ | |
585 | llassert(temp == NULL); | |
920a3797 | 586 | } |
35b9a1d9 | 587 | |
90bc41f7 | 588 | } end_constraintList_elements; |
35b9a1d9 | 589 | |
590 | DPRINTF((message ("constraintList_reflectChangesOr: returning %s", constraintList_print(ret) ) ) ); | |
591 | return ret; | |
90bc41f7 | 592 | } |
a779b61e | 593 | |
35b9a1d9 | 594 | static /*@only@*/ constraintList reflectChangesEnsures (/*@observer@*/ constraintList pre2, constraintList post1) |
616915dd | 595 | { |
35b9a1d9 | 596 | constraintList ret; |
597 | constraint temp; | |
598 | ret = constraintList_makeNew(); | |
616915dd | 599 | constraintList_elements (pre2, el) |
600 | { | |
35b9a1d9 | 601 | if (!constraintList_resolve (el, post1) ) |
616915dd | 602 | { |
35b9a1d9 | 603 | temp = constraint_substitute (el, post1); |
616915dd | 604 | llassert (temp != NULL); |
35b9a1d9 | 605 | |
606 | if (!constraintList_resolve (temp, post1) ) | |
607 | ret = constraintList_add (ret, temp); | |
920a3797 | 608 | else |
35b9a1d9 | 609 | constraint_free(temp); |
616915dd | 610 | } |
611 | else | |
612 | { | |
35b9a1d9 | 613 | DPRINTF ((message ("Resolved away %s ", constraint_print(el) ) ) ); |
616915dd | 614 | } |
615 | } end_constraintList_elements; | |
35b9a1d9 | 616 | |
617 | return ret; | |
616915dd | 618 | } |
619 | ||
620 | ||
35b9a1d9 | 621 | static /*@only@*/ constraintList reflectChangesEnsuresFree1 (/*@only@*/ constraintList pre2, constraintList post1) |
bb25bea6 | 622 | { |
35b9a1d9 | 623 | constraintList ret; |
624 | ||
625 | ret = reflectChangesEnsures (pre2, post1); | |
626 | ||
bb25bea6 | 627 | constraintList_free(pre2); |
35b9a1d9 | 628 | |
bb25bea6 | 629 | return ret; |
630 | } | |
631 | ||
632 | ||
633 | static bool constraint_conflict (constraint c1, constraint c2) | |
616915dd | 634 | { |
a64ebe74 | 635 | |
35b9a1d9 | 636 | llassert(constraint_isDefined(c1) ); |
637 | llassert(constraint_isDefined(c2) ); | |
638 | ||
ae133592 | 639 | if (constraintExpr_similar (c1->lexpr, c2->lexpr)) |
616915dd | 640 | { |
35b9a1d9 | 641 | if (c1->ar == EQ) |
642 | if (c1->ar == c2->ar) | |
643 | { | |
ae133592 | 644 | DPRINTF (("%s conflicts with %s", constraint_unparse (c1), constraint_unparse (c2))); |
35b9a1d9 | 645 | return TRUE; |
646 | } | |
616915dd | 647 | } |
35b9a1d9 | 648 | |
ae133592 | 649 | /* This is a slight kludge to prevent circular constraints like |
35b9a1d9 | 650 | strlen(str) == maxRead(s) + strlen(str); |
b7b694d6 | 651 | */ |
35b9a1d9 | 652 | |
b941db6b | 653 | /*this code is functional but it may be worth cleaning up at some point. */ |
a779b61e | 654 | |
35b9a1d9 | 655 | if (c1->ar == EQ) |
656 | if (c1->ar == c2->ar) | |
657 | { | |
658 | if (constraintExpr_search (c1->lexpr, c2->expr) ) | |
659 | if (constraintExpr_isTerm(c1->lexpr) ) | |
a779b61e | 660 | { |
35b9a1d9 | 661 | constraintTerm term; |
a779b61e | 662 | |
35b9a1d9 | 663 | term = constraintExpr_getTerm(c1->lexpr); |
664 | ||
665 | if (constraintTerm_isExprNode(term) ) | |
a779b61e | 666 | { |
35b9a1d9 | 667 | DPRINTF ((message ("%s conflicts with %s ", constraint_print (c1), constraint_print(c2) ) ) ); |
a779b61e | 668 | return TRUE; |
669 | } | |
670 | } | |
35b9a1d9 | 671 | } |
616915dd | 672 | |
35b9a1d9 | 673 | if (constraint_tooDeep(c1) || constraint_tooDeep(c2) ) |
674 | { | |
675 | DPRINTF ((message ("%s conflicts with %s (constraint is too deep", constraint_print (c1), constraint_print(c2) ) ) ); | |
676 | return TRUE; | |
677 | } | |
9a48d98c | 678 | |
35b9a1d9 | 679 | DPRINTF ((message ("%s doesn't conflict with %s ", constraint_print (c1), constraint_print(c2) ) ) ); |
680 | ||
616915dd | 681 | return FALSE; |
35b9a1d9 | 682 | |
616915dd | 683 | } |
684 | ||
35b9a1d9 | 685 | static void constraint_fixConflict (/*@temp@*/ constraint good, /*@temp@*/ /*@observer@*/ constraint conflicting) /*@modifies good@*/ |
616915dd | 686 | { |
35b9a1d9 | 687 | llassert(constraint_isDefined(conflicting) ); |
a64ebe74 | 688 | |
ae133592 | 689 | if (conflicting->ar == EQ) |
616915dd | 690 | { |
ae133592 | 691 | llassert (constraint_isDefined(good)); |
692 | DPRINTF (("Replacing here!")); | |
616915dd | 693 | good->expr = constraintExpr_searchandreplace (good->expr, conflicting->lexpr, conflicting->expr); |
d46ce6a4 | 694 | good = constraint_simplify (good); |
616915dd | 695 | } |
35b9a1d9 | 696 | |
697 | ||
616915dd | 698 | } |
699 | ||
bb25bea6 | 700 | static bool conflict (constraint c, constraintList list) |
616915dd | 701 | { |
35b9a1d9 | 702 | |
90bc41f7 | 703 | constraintList_elements (list, el) |
616915dd | 704 | { |
35b9a1d9 | 705 | if ( constraint_conflict(el, c) ) |
616915dd | 706 | { |
707 | constraint_fixConflict (el, c); | |
708 | return TRUE; | |
709 | } | |
710 | } end_constraintList_elements; | |
35b9a1d9 | 711 | |
712 | return FALSE; | |
713 | ||
616915dd | 714 | } |
715 | ||
b7b694d6 | 716 | /* |
35b9a1d9 | 717 | check if constraint in list1 conflicts with constraints in List2. If so we |
718 | remove form list1 and change list2. | |
b7b694d6 | 719 | */ |
720 | ||
84c9ffbf | 721 | constraintList constraintList_fixConflicts (constraintList list1, constraintList list2) |
616915dd | 722 | { |
35b9a1d9 | 723 | constraintList ret; |
724 | ret = constraintList_makeNew(); | |
725 | llassert(constraintList_isDefined(list1) ); | |
616915dd | 726 | constraintList_elements (list1, el) |
727 | { | |
35b9a1d9 | 728 | if (! conflict (el, list2) ) |
616915dd | 729 | { |
35b9a1d9 | 730 | constraint temp; |
731 | temp = constraint_copy(el); | |
d46ce6a4 | 732 | ret = constraintList_add (ret, temp); |
616915dd | 733 | } |
734 | } end_constraintList_elements; | |
35b9a1d9 | 735 | |
736 | return ret; | |
616915dd | 737 | } |
738 | ||
ae133592 | 739 | /*returns true if constraint post satisfies cosntriant pre */ |
740 | ||
741 | static bool constraintResolve_satisfies (constraint pre, constraint post) | |
616915dd | 742 | { |
ae133592 | 743 | llassert (constraint_isDefined(pre)); |
744 | llassert (constraint_isDefined(post)); | |
a64ebe74 | 745 | |
ae133592 | 746 | if (constraint_isAlwaysTrue (pre)) |
35b9a1d9 | 747 | return TRUE; |
616915dd | 748 | |
35b9a1d9 | 749 | if (!constraintExpr_similar (pre->lexpr, post->lexpr) ) |
616915dd | 750 | { |
35b9a1d9 | 751 | return FALSE; |
616915dd | 752 | } |
ae133592 | 753 | |
35b9a1d9 | 754 | if (constraintExpr_isUndefined(post->expr)) |
616915dd | 755 | { |
35b9a1d9 | 756 | llassert(FALSE); |
616915dd | 757 | return FALSE; |
758 | } | |
ae133592 | 759 | |
616915dd | 760 | return rangeCheck (pre->ar, pre->expr, post->ar, post->expr); |
761 | } | |
762 | ||
35b9a1d9 | 763 | |
ae133592 | 764 | bool constraintList_resolve (/*@temp@*/ /*@observer@*/ constraint c, |
765 | /*@temp@*/ /*@observer@*/ constraintList p) | |
bb25bea6 | 766 | { |
ae133592 | 767 | DPRINTF (("[resolve] Trying to resolve constraint: %s using %s", |
768 | constraint_unparse (c), | |
769 | constraintList_unparse (p))); | |
770 | ||
bb25bea6 | 771 | constraintList_elements (p, el) |
772 | { | |
ae133592 | 773 | if (constraintResolve_satisfies (c, el)) |
bb25bea6 | 774 | { |
ae133592 | 775 | DPRINTF (("constraintList_resolve: %s satifies %s", |
776 | constraint_unparse (el), constraint_unparse (c))); | |
bb25bea6 | 777 | return TRUE; |
778 | } | |
ae133592 | 779 | |
780 | DPRINTF (("constraintList_resolve: %s does not satify %s\n ", | |
781 | constraint_unparse (el), constraint_unparse (c))); | |
35b9a1d9 | 782 | } |
783 | end_constraintList_elements; | |
ae133592 | 784 | |
785 | DPRINTF (("No constraints satify: %s", constraint_unparse (c))); | |
bb25bea6 | 786 | return FALSE; |
787 | } | |
788 | ||
789 | static bool arithType_canResolve (arithType ar1, arithType ar2) | |
616915dd | 790 | { |
791 | switch (ar1) | |
792 | { | |
793 | case GTE: | |
794 | case GT: | |
ae133592 | 795 | if ((ar2 == GT) || (ar2 == GTE) || (ar2 == EQ)) |
616915dd | 796 | { |
797 | return TRUE; | |
798 | } | |
799 | break; | |
800 | ||
801 | case EQ: | |
802 | if (ar2 == EQ) | |
803 | return TRUE; | |
804 | break; | |
805 | ||
806 | case LT: | |
807 | case LTE: | |
ae133592 | 808 | if ((ar2 == LT) || (ar2 == LTE) || (ar2 == EQ)) |
616915dd | 809 | return TRUE; |
84c9ffbf | 810 | break; |
616915dd | 811 | default: |
812 | return FALSE; | |
813 | } | |
814 | return FALSE; | |
815 | } | |
816 | ||
35b9a1d9 | 817 | /*checks for the case expr2 == sizeof buf1 and buf1 is a fixed array*/ |
ae133592 | 818 | static bool sizeofBufComp(constraintExpr buf1, constraintExpr expr2) |
e5f31c00 | 819 | { |
820 | constraintTerm ct; | |
821 | exprNode e, t; | |
822 | sRef s1, s2; | |
a64ebe74 | 823 | |
35b9a1d9 | 824 | llassert(constraintExpr_isDefined(buf1) && constraintExpr_isDefined(expr2) ); |
a64ebe74 | 825 | |
e5f31c00 | 826 | /*@access constraintExpr@*/ |
827 | ||
35b9a1d9 | 828 | if ((expr2->kind != term) && (buf1->kind != term) ) |
829 | return FALSE; | |
830 | ||
e5f31c00 | 831 | |
832 | ct = constraintExprData_termGetTerm(expr2->data); | |
833 | ||
35b9a1d9 | 834 | if (!constraintTerm_isExprNode(ct) ) |
835 | return FALSE; | |
836 | ||
837 | e = constraintTerm_getExprNode(ct); | |
838 | ||
ae133592 | 839 | llassert (exprNode_isDefined(e)); |
35b9a1d9 | 840 | |
ae133592 | 841 | if (! (exprNode_isDefined(e))) |
35b9a1d9 | 842 | return FALSE; |
a64ebe74 | 843 | |
e5f31c00 | 844 | if (e->kind != XPR_SIZEOF) |
35b9a1d9 | 845 | return FALSE; |
e5f31c00 | 846 | |
847 | t = exprData_getSingle (e->edata); | |
9a48d98c | 848 | s1 = exprNode_getSref (t); |
35b9a1d9 | 849 | |
850 | s2 = constraintTerm_getsRef(constraintExprData_termGetTerm(buf1->data) ); | |
e5f31c00 | 851 | |
b941db6b | 852 | /*drl this may be the wronge thing to test for but this |
853 | seems to work correctly*/ | |
35b9a1d9 | 854 | if (sRef_similarRelaxed(s1, s2) || sRef_sameName (s1, s2) ) |
e5f31c00 | 855 | { |
b941db6b | 856 | /* origly checked that ctype_isFixedArray(sRef_getType(s2)) but |
857 | removed that test */ | |
e5f31c00 | 858 | return TRUE; |
859 | } | |
860 | return FALSE; | |
861 | } | |
862 | ||
863 | /* look for the special case of | |
864 | maxSet(buf) >= sizeof(buf) - 1 | |
865 | */ | |
866 | ||
b941db6b | 867 | /*drl eventually it would be good to check that |
868 | buf is of type char.*/ | |
332e22fa | 869 | |
e5f31c00 | 870 | static bool sizeOfMaxSet( /*@observer@*/ /*@temp@*/ constraint c) |
871 | { | |
872 | constraintExpr l, r, buf1, buf2, con; | |
873 | ||
35b9a1d9 | 874 | DPRINTF(( message("sizeOfMaxSet: checking %s ", constraint_print(c) ) |
875 | )); | |
876 | ||
877 | llassert (constraint_isDefined(c) ); | |
878 | ||
e5f31c00 | 879 | l = c->lexpr; |
880 | r = c->expr; | |
881 | ||
35b9a1d9 | 882 | if (!((c->ar == EQ) || (c->ar == GTE) || (c->ar == LTE) ) ) |
883 | return FALSE; | |
e5f31c00 | 884 | |
35b9a1d9 | 885 | llassert (constraintExpr_isDefined(l) ); |
886 | llassert (constraintExpr_isDefined(r) ); | |
a64ebe74 | 887 | |
35b9a1d9 | 888 | /*check if the constraintExpr is MaxSet(buf) */ |
e5f31c00 | 889 | if (l->kind == unaryExpr) |
890 | { | |
891 | if (constraintExprData_unaryExprGetOp(l->data) == MAXSET) | |
892 | { | |
893 | buf1 = constraintExprData_unaryExprGetExpr(l->data); | |
894 | } | |
895 | else | |
35b9a1d9 | 896 | return FALSE; |
e5f31c00 | 897 | } |
898 | else | |
35b9a1d9 | 899 | return FALSE; |
900 | ||
e5f31c00 | 901 | |
902 | if (r->kind != binaryexpr) | |
35b9a1d9 | 903 | return FALSE; |
e5f31c00 | 904 | |
35b9a1d9 | 905 | buf2 = constraintExprData_binaryExprGetExpr1(r->data); |
906 | con = constraintExprData_binaryExprGetExpr2(r->data); | |
e5f31c00 | 907 | |
35b9a1d9 | 908 | if (constraintExprData_binaryExprGetOp(r->data) == BINARYOP_MINUS) |
e5f31c00 | 909 | { |
35b9a1d9 | 910 | if (constraintExpr_canGetValue(con) ) |
e5f31c00 | 911 | { |
35b9a1d9 | 912 | long i; |
913 | ||
914 | i = constraintExpr_getValue(con); | |
e5f31c00 | 915 | if (i != 1) |
916 | { | |
917 | return FALSE; | |
918 | } | |
919 | } | |
920 | else | |
35b9a1d9 | 921 | return FALSE; |
e5f31c00 | 922 | } |
923 | ||
35b9a1d9 | 924 | if (constraintExprData_binaryExprGetOp(r->data) == BINARYOP_PLUS) |
e5f31c00 | 925 | { |
35b9a1d9 | 926 | if (constraintExpr_canGetValue(con) ) |
e5f31c00 | 927 | { |
35b9a1d9 | 928 | long i; |
e5f31c00 | 929 | |
35b9a1d9 | 930 | i = constraintExpr_getValue(con); |
e5f31c00 | 931 | if (i != -1) |
932 | { | |
933 | return FALSE; | |
934 | } | |
935 | } | |
936 | else | |
35b9a1d9 | 937 | return FALSE; |
e5f31c00 | 938 | } |
35b9a1d9 | 939 | |
940 | if (sizeofBufComp(buf1, buf2)) | |
941 | { | |
942 | return TRUE; | |
943 | } | |
944 | else | |
945 | { | |
946 | return FALSE; | |
947 | } | |
e5f31c00 | 948 | } |
949 | /*@noaccess constraintExpr@*/ | |
950 | ||
90bc41f7 | 951 | /* We look for constraint which are tautologies */ |
952 | ||
28bf4b0b | 953 | bool constraint_isAlwaysTrue (/*@observer@*/ /*@temp@*/ constraint c) |
616915dd | 954 | { |
955 | constraintExpr l, r; | |
15b3d2b2 | 956 | bool rHasConstant; |
957 | int rConstant; | |
a64ebe74 | 958 | |
35b9a1d9 | 959 | |
960 | llassert (constraint_isDefined(c) ); | |
9280addf | 961 | |
616915dd | 962 | l = c->lexpr; |
963 | r = c->expr; | |
90bc41f7 | 964 | |
35b9a1d9 | 965 | DPRINTF(( message("constraint_IsAlwaysTrue:examining %s", constraint_print(c) ) )); |
e5f31c00 | 966 | |
35b9a1d9 | 967 | if (sizeOfMaxSet(c) ) |
e5f31c00 | 968 | return TRUE; |
969 | ||
35b9a1d9 | 970 | if (constraintExpr_canGetValue(l) && constraintExpr_canGetValue(r) ) |
616915dd | 971 | { |
972 | int cmp; | |
973 | cmp = constraintExpr_compare (l, r); | |
974 | switch (c->ar) | |
975 | { | |
976 | case EQ: | |
977 | return (cmp == 0); | |
978 | case GT: | |
979 | return (cmp > 0); | |
980 | case GTE: | |
981 | return (cmp >= 0); | |
982 | case LTE: | |
983 | return (cmp <= 0); | |
984 | case LT: | |
985 | return (cmp < 0); | |
986 | ||
987 | default: | |
9280addf | 988 | BADEXIT; |
84c9ffbf | 989 | /*@notreached@*/ |
9280addf | 990 | break; |
991 | } | |
992 | } | |
993 | ||
ae133592 | 994 | if (constraintExpr_similar (l,r)) |
9280addf | 995 | { |
996 | switch (c->ar) | |
997 | { | |
ae133592 | 998 | case CASTEQ: |
9280addf | 999 | case EQ: |
1000 | case GTE: | |
1001 | case LTE: | |
1002 | return TRUE; | |
1003 | ||
1004 | case GT: | |
1005 | case LT: | |
1006 | break; | |
1007 | default: | |
1008 | BADEXIT; | |
84c9ffbf | 1009 | /*@notreached@*/ |
616915dd | 1010 | break; |
1011 | } | |
1012 | } | |
9280addf | 1013 | |
1014 | l = constraintExpr_copy (c->lexpr); | |
1015 | r = constraintExpr_copy (c->expr); | |
1016 | ||
9280addf | 1017 | r = constraintExpr_propagateConstants (r, &rHasConstant, &rConstant); |
1018 | ||
35b9a1d9 | 1019 | if (constraintExpr_similar (l,r) && (rHasConstant ) ) |
9280addf | 1020 | { |
ae133592 | 1021 | DPRINTF(( message("constraint_IsAlwaysTrue: after removing constants %s and %s are similar", constraintExpr_unparse(l), constraintExpr_unparse(r) ) )); |
1022 | DPRINTF(( message("constraint_IsAlwaysTrue: rconstant is %d", rConstant ) )); | |
bb25bea6 | 1023 | |
1024 | constraintExpr_free(l); | |
1025 | constraintExpr_free(r); | |
1026 | ||
90bc41f7 | 1027 | switch (c->ar) |
9280addf | 1028 | { |
90bc41f7 | 1029 | case EQ: |
1030 | return (rConstant == 0); | |
1031 | case LT: | |
1032 | return (rConstant > 0); | |
1033 | case LTE: | |
1034 | return (rConstant >= 0); | |
1035 | case GTE: | |
1036 | return (rConstant <= 0); | |
1037 | case GT: | |
1038 | return (rConstant < 0); | |
1039 | ||
1040 | default: | |
1041 | BADEXIT; | |
84c9ffbf | 1042 | /*@notreached@*/ |
90bc41f7 | 1043 | break; |
9280addf | 1044 | } |
9280addf | 1045 | } |
90bc41f7 | 1046 | else |
1047 | { | |
bb25bea6 | 1048 | constraintExpr_free(l); |
1049 | constraintExpr_free(r); | |
35b9a1d9 | 1050 | DPRINTF(( message("Constraint %s is not always true", constraint_print(c) ) )); |
90bc41f7 | 1051 | return FALSE; |
1052 | } | |
9280addf | 1053 | |
1054 | BADEXIT; | |
616915dd | 1055 | } |
1056 | ||
bb25bea6 | 1057 | static bool rangeCheck (arithType ar1, /*@observer@*/ constraintExpr expr1, arithType ar2, /*@observer@*/ constraintExpr expr2) |
616915dd | 1058 | |
1059 | { | |
ae133592 | 1060 | DPRINTF (("Doing range check %s and %s", |
1061 | constraintExpr_unparse (expr1), constraintExpr_unparse (expr2))); | |
616915dd | 1062 | |
ae133592 | 1063 | if (!arithType_canResolve (ar1, ar2)) |
616915dd | 1064 | return FALSE; |
1065 | ||
1066 | switch (ar1) | |
ae133592 | 1067 | { |
1068 | case GTE: | |
1069 | if (constraintExpr_similar (expr1, expr2) ) | |
1070 | return TRUE; | |
1071 | /*@fallthrough@*/ | |
1072 | case GT: | |
1073 | if (! (constraintExpr_canGetValue (expr1) && | |
1074 | constraintExpr_canGetValue (expr2) ) ) | |
1075 | { | |
1076 | constraintExpr e1, e2; | |
1077 | bool p1, p2; | |
1078 | int const1, const2; | |
1079 | ||
1080 | e1 = constraintExpr_copy(expr1); | |
1081 | e2 = constraintExpr_copy(expr2); | |
1082 | ||
1083 | e1 = constraintExpr_propagateConstants (e1, &p1, &const1); | |
1084 | e2 = constraintExpr_propagateConstants (e2, &p2, &const2); | |
1085 | ||
1086 | if (p1 || p2) | |
1087 | { | |
1088 | if (!p1) | |
1089 | const1 = 0; | |
1090 | ||
1091 | if (!p2) | |
1092 | const2 = 0; | |
1093 | ||
1094 | if (const1 <= const2) | |
1095 | if (constraintExpr_similar (e1, e2) ) | |
1096 | { | |
1097 | constraintExpr_free(e1); | |
1098 | constraintExpr_free(e2); | |
1099 | return TRUE; | |
1100 | } | |
1101 | } | |
1102 | DPRINTF(("Can't Get value")); | |
1103 | ||
1104 | constraintExpr_free(e1); | |
1105 | constraintExpr_free(e2); | |
1106 | return FALSE; | |
1107 | } | |
1108 | ||
1109 | if (constraintExpr_compare (expr2, expr1) >= 0) | |
1110 | return TRUE; | |
1111 | ||
1112 | return FALSE; | |
1113 | case EQ: | |
1114 | if (constraintExpr_similar (expr1, expr2) ) | |
1115 | return TRUE; | |
1116 | ||
1117 | return FALSE; | |
1118 | case LTE: | |
1119 | if (constraintExpr_similar (expr1, expr2) ) | |
1120 | return TRUE; | |
1121 | /*@fallthrough@*/ | |
1122 | case LT: | |
1123 | if (! (constraintExpr_canGetValue (expr1) && | |
1124 | constraintExpr_canGetValue (expr2) ) ) | |
1125 | { | |
1126 | constraintExpr e1, e2; | |
1127 | bool p1, p2; | |
1128 | int const1, const2; | |
1129 | ||
1130 | e1 = constraintExpr_copy(expr1); | |
1131 | e2 = constraintExpr_copy(expr2); | |
1132 | ||
1133 | e1 = constraintExpr_propagateConstants (e1, &p1, &const1); | |
1134 | ||
1135 | e2 = constraintExpr_propagateConstants (e2, &p2, &const2); | |
1136 | ||
1137 | if (p1 || p2) | |
1138 | { | |
1139 | if (!p1) | |
1140 | const1 = 0; | |
1141 | ||
1142 | if (!p2) | |
1143 | const2 = 0; | |
1144 | ||
1145 | if (const1 >= const2) | |
1146 | if (constraintExpr_similar (e1, e2) ) | |
1147 | { | |
1148 | constraintExpr_free(e1); | |
1149 | constraintExpr_free(e2); | |
1150 | return TRUE; | |
1151 | } | |
1152 | } | |
1153 | constraintExpr_free(e1); | |
1154 | constraintExpr_free(e2); | |
1155 | ||
1156 | DPRINTF(("Can't Get value")); | |
1157 | return FALSE; | |
1158 | } | |
1159 | ||
1160 | if (constraintExpr_compare (expr2, expr1) <= 0) | |
1161 | return TRUE; | |
1162 | ||
1163 | return FALSE; | |
1164 | ||
1165 | default: | |
35b9a1d9 | 1166 | llcontbug((message("Unhandled case in switch: %q", arithType_print(ar1) ) ) ); |
ae133592 | 1167 | } |
616915dd | 1168 | BADEXIT; |
616915dd | 1169 | } |
1170 | ||
28bf4b0b | 1171 | static constraint constraint_searchandreplace (/*@returned@*/ constraint c, constraintExpr old, constraintExpr newExpr) |
616915dd | 1172 | { |
ae133592 | 1173 | llassert (constraint_isDefined(c)); |
35b9a1d9 | 1174 | |
ae133592 | 1175 | DPRINTF (("Starting replace lexpr [%p]: %s < %s ==> %s > in %s", c, |
1176 | constraintExpr_unparse (c->lexpr), | |
1177 | constraintExpr_unparse (old), constraintExpr_unparse (newExpr), | |
1178 | constraint_unparse (c))); | |
28bf4b0b | 1179 | c->lexpr = constraintExpr_searchandreplace (c->lexpr, old, newExpr); |
ae133592 | 1180 | DPRINTF (("Finished replace lexpr [%p]: %s", c, constraintExpr_unparse (c->lexpr))); |
28bf4b0b | 1181 | c->expr = constraintExpr_searchandreplace (c->expr, old, newExpr); |
616915dd | 1182 | return c; |
1183 | } | |
1184 | ||
84c9ffbf | 1185 | bool constraint_search (constraint c, constraintExpr old) /*@*/ |
616915dd | 1186 | { |
35b9a1d9 | 1187 | bool ret; |
1188 | ret = FALSE; | |
a64ebe74 | 1189 | |
ae133592 | 1190 | llassert (constraint_isDefined (c)); |
a64ebe74 | 1191 | |
616915dd | 1192 | ret = constraintExpr_search (c->lexpr, old); |
1193 | ret = ret || constraintExpr_search (c->expr, old); | |
1194 | return ret; | |
1195 | } | |
1196 | ||
b7b694d6 | 1197 | /* adjust file locs and stuff */ |
bb25bea6 | 1198 | static constraint constraint_adjust (/*@returned@*/ constraint substitute, /*@observer@*/ constraint old) |
616915dd | 1199 | { |
1200 | fileloc loc1, loc2, loc3; | |
1201 | ||
35b9a1d9 | 1202 | DPRINTF ((message("Start adjust on %s and %s", constraint_print(substitute), |
1203 | constraint_print(old)) | |
1204 | )); | |
616915dd | 1205 | |
35b9a1d9 | 1206 | llassert(constraint_isDefined(substitute)); |
1207 | llassert(constraint_isDefined(old)); | |
a64ebe74 | 1208 | |
616915dd | 1209 | loc1 = constraint_getFileloc (old); |
ae133592 | 1210 | loc2 = constraintExpr_loc (substitute->lexpr); |
1211 | loc3 = constraintExpr_loc (substitute->expr); | |
616915dd | 1212 | |
b7b694d6 | 1213 | /* special case of an equality that "contains itself" */ |
35b9a1d9 | 1214 | if (constraintExpr_search (substitute->expr, substitute->lexpr) ) |
616915dd | 1215 | if (fileloc_closer (loc1, loc3, loc2)) |
35b9a1d9 | 1216 | { |
1217 | constraintExpr temp; | |
1218 | DPRINTF ((message("Doing adjust on %s", constraint_print(substitute) ) | |
1219 | )); | |
1220 | temp = substitute->lexpr; | |
1221 | substitute->lexpr = substitute->expr; | |
1222 | substitute->expr = temp; | |
1223 | substitute = constraint_simplify(substitute); | |
1224 | } | |
1225 | ||
bb25bea6 | 1226 | fileloc_free (loc1); |
1227 | fileloc_free (loc2); | |
1228 | fileloc_free (loc3); | |
35b9a1d9 | 1229 | |
616915dd | 1230 | return substitute; |
35b9a1d9 | 1231 | |
616915dd | 1232 | } |
1233 | ||
35b9a1d9 | 1234 | /* If function preforms substitutes based on inequality |
1235 | ||
1236 | It uses the rule x >= y && b < y ===> x >= b + 1 | |
1237 | ||
1238 | Warning this is sound but throws out information | |
1239 | */ | |
dc7f6a51 | 1240 | |
35b9a1d9 | 1241 | constraint inequalitySubstitute (/*@returned@*/ constraint c, constraintList p) |
616915dd | 1242 | { |
35b9a1d9 | 1243 | llassert(constraint_isDefined(c) ); |
1244 | ||
616915dd | 1245 | if (c->ar != GTE) |
35b9a1d9 | 1246 | return c; |
616915dd | 1247 | |
1248 | constraintList_elements (p, el) | |
1249 | { | |
a64ebe74 | 1250 | |
35b9a1d9 | 1251 | llassert(constraint_isDefined(el) ); |
1252 | ||
1253 | if ((el->ar == LT ) ) | |
35b9a1d9 | 1254 | { |
1255 | constraintExpr temp2; | |
1256 | ||
35b9a1d9 | 1257 | if (constraintExpr_same (el->expr, c->expr) ) |
1258 | { | |
1259 | DPRINTF((message ("inequalitySubstitute Replacing %q in %q with %q", | |
1260 | constraintExpr_print (c->expr), | |
1261 | constraint_print (c), | |
1262 | constraintExpr_print (el->expr) ) | |
1263 | )); | |
1264 | temp2 = constraintExpr_copy (el->lexpr); | |
1265 | constraintExpr_free(c->expr); | |
1266 | c->expr = constraintExpr_makeIncConstraintExpr (temp2); | |
1267 | ||
1268 | } | |
1269 | ||
1270 | } | |
1271 | } | |
1272 | end_constraintList_elements; | |
1273 | ||
1274 | c = constraint_simplify(c); | |
616915dd | 1275 | return c; |
1276 | } | |
1277 | ||
35b9a1d9 | 1278 | |
dc7f6a51 | 1279 | /* drl7x 7/26/001 |
1280 | ||
1281 | THis function is like inequalitySubstitute but it adds the rule | |
1282 | added the rules x >= y && y <= b ===> x >= b | |
1283 | x >= y && y < b ===> x >= b + 1 | |
1284 | ||
1285 | This is sound but sonce it throws out additional information it should only one used | |
1286 | if we're oring constraints. | |
1287 | */ | |
1288 | ||
35b9a1d9 | 1289 | static constraint inequalitySubstituteStrong (/*@returned@*/ constraint c, constraintList p) |
dc7f6a51 | 1290 | { |
35b9a1d9 | 1291 | DPRINTF (( message ("inequalitySubstituteStrong examining substituting for %q", constraint_print(c) ) )); |
dc7f6a51 | 1292 | |
35b9a1d9 | 1293 | llassert(constraint_isDefined(c) ); |
1294 | ||
1295 | if (! (constraint_isDefined(c) ) ) | |
1296 | { | |
1297 | return c; | |
1298 | } | |
a64ebe74 | 1299 | |
dc7f6a51 | 1300 | if (c->ar != GTE) |
35b9a1d9 | 1301 | return c; |
dc7f6a51 | 1302 | |
35b9a1d9 | 1303 | DPRINTF (( message ("inequalitySubstituteStrong examining substituting for %q with %q", |
1304 | constraint_print(c), constraintList_print(p) ) )); | |
dc7f6a51 | 1305 | constraintList_elements (p, el) |
1306 | { | |
9a48d98c | 1307 | |
35b9a1d9 | 1308 | DPRINTF (( message ("inequalitySubstituteStrong examining substituting %s on %s", constraint_print(el), constraint_print(c) ) )); |
1309 | ||
1310 | llassert(constraint_isDefined(el) ); | |
1311 | if ((el->ar == LT ) || (el->ar == LTE ) ) | |
35b9a1d9 | 1312 | { |
1313 | constraintExpr temp2; | |
1314 | ||
35b9a1d9 | 1315 | if (constraintExpr_same (el->lexpr, c->expr) ) |
1316 | { | |
1317 | DPRINTF((message ("inequalitySubstitute Replacing %s in %s with %s", | |
1318 | constraintExpr_print (c->expr), | |
1319 | constraint_print (c), | |
1320 | constraintExpr_print (el->expr) ) | |
1321 | )); | |
1322 | temp2 = constraintExpr_copy (el->expr); | |
1323 | constraintExpr_free(c->expr); | |
1324 | if ((el->ar == LTE ) ) | |
1325 | { | |
1326 | c->expr = temp2; | |
1327 | } | |
1328 | else | |
1329 | { | |
1330 | c->expr = constraintExpr_makeIncConstraintExpr (temp2); | |
1331 | } | |
1332 | } | |
1333 | ||
1334 | } | |
1335 | } | |
1336 | end_constraintList_elements; | |
dc7f6a51 | 1337 | |
1338 | c = constraint_simplify(c); | |
1339 | return c; | |
1340 | } | |
1341 | ||
1342 | ||
90bc41f7 | 1343 | /* This function performs substitutions based on the rule: |
1344 | for a constraint of the form expr1 >= expr2; a < b => | |
1345 | a = b -1 for all a in expr1. This will work in most cases. | |
1346 | ||
1347 | Like inequalitySubstitute we're throwing away some information | |
1348 | */ | |
1349 | ||
35b9a1d9 | 1350 | static constraint inequalitySubstituteUnsound (/*@returned@*/ constraint c, constraintList p) |
90bc41f7 | 1351 | { |
35b9a1d9 | 1352 | DPRINTF (( message ("Doing inequalitySubstituteUnsound " ) )); |
1353 | ||
1354 | llassert(constraint_isDefined(c) ); | |
90bc41f7 | 1355 | |
1356 | if (c->ar != GTE) | |
35b9a1d9 | 1357 | return c; |
90bc41f7 | 1358 | |
1359 | constraintList_elements (p, el) | |
1360 | { | |
35b9a1d9 | 1361 | |
1362 | llassert(constraint_isDefined(el) ); | |
1363 | ||
1364 | DPRINTF (( message ("inequalitySubstituteUnsound examining substituting %s on %s", constraint_print(el), constraint_print(c) ) )); | |
1365 | if (( el->ar == LTE) || (el->ar == LT) ) | |
35b9a1d9 | 1366 | { |
1367 | constraintExpr temp2; | |
1368 | ||
1369 | temp2 = constraintExpr_copy (el->expr); | |
1370 | ||
1371 | if (el->ar == LT) | |
1372 | temp2 = constraintExpr_makeDecConstraintExpr (temp2); | |
1373 | ||
1374 | DPRINTF((message ("Replacing %s in %s with %s", | |
1375 | constraintExpr_print (el->lexpr), | |
1376 | constraintExpr_print (c->lexpr), | |
1377 | constraintExpr_print (temp2) ) )); | |
1378 | ||
1379 | c->lexpr = constraintExpr_searchandreplace (c->lexpr, el->lexpr, temp2); | |
1380 | constraintExpr_free(temp2); | |
1381 | } | |
1382 | } | |
1383 | end_constraintList_elements; | |
1384 | ||
1385 | c = constraint_simplify(c); | |
90bc41f7 | 1386 | return c; |
1387 | } | |
1388 | ||
28bf4b0b | 1389 | /*@only@*/ constraint constraint_substitute (/*@observer@*/ /*@temp@*/ constraint c, constraintList p) |
616915dd | 1390 | { |
35b9a1d9 | 1391 | constraint ret; |
1392 | ||
1393 | ret = constraint_copy(c); | |
616915dd | 1394 | constraintList_elements (p, el) |
1395 | { | |
35b9a1d9 | 1396 | llassert(constraint_isDefined(el) ); |
1397 | if ( el->ar == EQ) | |
1398 | if (!constraint_conflict (ret, el) ) | |
1399 | ||
1400 | { | |
1401 | constraint temp; | |
1402 | ||
1403 | temp = constraint_copy(el); | |
1404 | ||
1405 | temp = constraint_adjust(temp, ret); | |
1406 | ||
1407 | llassert(constraint_isDefined(temp) ); | |
1408 | ||
1409 | ||
1410 | DPRINTF((message ("constraint_substitute :: Substituting in %s using %s", | |
1411 | constraint_print (ret), constraint_print (temp) | |
1412 | ) ) ); | |
1413 | ||
1414 | ||
1415 | ret = constraint_searchandreplace (ret, temp->lexpr, temp->expr); | |
1416 | DPRINTF(( message (" constraint_substitute :: The new constraint is %s", constraint_print (ret) ) )); | |
1417 | constraint_free(temp); | |
1418 | } | |
1419 | } | |
1420 | end_constraintList_elements; | |
1421 | ||
1422 | ret = constraint_simplify(ret); | |
1423 | ||
1424 | DPRINTF(( message (" constraint_substitute :: The final new constraint is %s", constraint_print (ret) ) )); | |
1425 | ||
90bc41f7 | 1426 | return ret; |
616915dd | 1427 | } |
1428 | ||
35b9a1d9 | 1429 | |
1430 | /*@only@*/ constraintList constraintList_substituteFreeTarget (/*@only@*/ constraintList target, /*@observer@*/ constraintList subList) | |
bb25bea6 | 1431 | { |
35b9a1d9 | 1432 | constraintList ret; |
1433 | ||
1434 | ret = constraintList_substitute (target, subList); | |
1435 | ||
1436 | constraintList_free(target); | |
1437 | ||
1438 | return ret; | |
bb25bea6 | 1439 | } |
1440 | ||
c3e695ff | 1441 | /* we try to do substitutions on each constraint in target using the constraint in sublist*/ |
1442 | ||
35b9a1d9 | 1443 | /*@only@*/ constraintList constraintList_substitute (constraintList target,/*2observer@*/ constraintList subList) |
c3e695ff | 1444 | { |
35b9a1d9 | 1445 | |
1446 | constraintList ret; | |
1447 | ||
1448 | ret = constraintList_makeNew(); | |
c3e695ff | 1449 | |
1450 | constraintList_elements(target, el) | |
35b9a1d9 | 1451 | { |
1452 | constraint temp; | |
1453 | /* drl possible problem : warning make sure that a side effect is not expected */ | |
1454 | ||
1455 | temp = constraint_substitute(el, subList); | |
1456 | ret = constraintList_add (ret, temp); | |
1457 | } | |
1458 | end_constraintList_elements; | |
84c9ffbf | 1459 | |
bb25bea6 | 1460 | return ret; |
c3e695ff | 1461 | } |
616915dd | 1462 | |
28bf4b0b | 1463 | static constraint constraint_solve (/*@returned@*/ constraint c) |
616915dd | 1464 | { |
35b9a1d9 | 1465 | |
1466 | llassert(constraint_isDefined(c) ); | |
1467 | ||
1468 | DPRINTF((message ("Solving %s\n", constraint_print(c) ) ) ); | |
616915dd | 1469 | c->expr = constraintExpr_solveBinaryExpr (c->lexpr, c->expr); |
35b9a1d9 | 1470 | DPRINTF((message ("Solved and got %s\n", constraint_print(c) ) ) ); |
1471 | ||
616915dd | 1472 | return c; |
1473 | } | |
1474 | ||
1475 | static arithType flipAr (arithType ar) | |
1476 | { | |
1477 | switch (ar) | |
1478 | { | |
35b9a1d9 | 1479 | case LT: |
1480 | return GT; | |
1481 | case LTE: | |
1482 | return GTE; | |
1483 | case EQ: | |
1484 | return EQ; | |
1485 | case GT: | |
1486 | return LT; | |
1487 | case GTE: | |
1488 | return LTE; | |
1489 | default: | |
1490 | llcontbug (message("unexpected value: case not handled")); | |
616915dd | 1491 | } |
1492 | BADEXIT; | |
1493 | } | |
1494 | ||
35b9a1d9 | 1495 | static constraint constraint_swapLeftRight (/*@returned@*/ constraint c) |
616915dd | 1496 | { |
1497 | constraintExpr temp; | |
a64ebe74 | 1498 | |
35b9a1d9 | 1499 | llassert(constraint_isDefined(c) ); |
a64ebe74 | 1500 | |
616915dd | 1501 | c->ar = flipAr (c->ar); |
1502 | temp = c->lexpr; | |
1503 | c->lexpr = c->expr; | |
1504 | c->expr = temp; | |
35b9a1d9 | 1505 | DPRINTF(("Swaped left and right sides of constraint")); |
616915dd | 1506 | return c; |
1507 | } | |
1508 | ||
35b9a1d9 | 1509 | |
1510 | ||
1511 | constraint constraint_simplify ( /*@returned@*/ constraint c) | |
616915dd | 1512 | { |
35b9a1d9 | 1513 | |
1514 | llassert(constraint_isDefined(c) ); | |
1515 | ||
1516 | DPRINTF(( message("constraint_simplify on %q ", constraint_print(c) ) )); | |
a779b61e | 1517 | |
1518 | if (constraint_tooDeep(c)) | |
1519 | { | |
35b9a1d9 | 1520 | DPRINTF(( message("constraint_simplify: constraint to complex aborting %q ", constraint_print(c) ) )); |
a779b61e | 1521 | return c; |
35b9a1d9 | 1522 | |
a779b61e | 1523 | } |
1524 | ||
616915dd | 1525 | c->lexpr = constraintExpr_simplify (c->lexpr); |
1526 | c->expr = constraintExpr_simplify (c->expr); | |
616915dd | 1527 | |
35b9a1d9 | 1528 | if (constraintExpr_isBinaryExpr (c->lexpr) ) |
c3e695ff | 1529 | { |
1530 | c = constraint_solve (c); | |
35b9a1d9 | 1531 | |
c3e695ff | 1532 | c->lexpr = constraintExpr_simplify (c->lexpr); |
1533 | c->expr = constraintExpr_simplify (c->expr); | |
1534 | } | |
1535 | ||
35b9a1d9 | 1536 | if (constraintExpr_isLit(c->lexpr) && (!constraintExpr_isLit(c->expr) ) ) |
616915dd | 1537 | { |
35b9a1d9 | 1538 | c = constraint_swapLeftRight(c); |
1539 | /*I don't think this will be an infinate loop*/ | |
1540 | c = constraint_simplify(c); | |
616915dd | 1541 | } |
a779b61e | 1542 | |
35b9a1d9 | 1543 | DPRINTF(( message("constraint_simplify returning %q ", constraint_print(c) ) )); |
1544 | ||
616915dd | 1545 | return c; |
1546 | } | |
1547 | ||
1548 | ||
35b9a1d9 | 1549 | |
1550 | ||
1551 | /* returns true if fileloc for term1 is closer to file for term2 than term3*/ | |
1552 | ||
1553 | bool fileloc_closer (fileloc loc1, fileloc loc2, fileloc loc3) | |
616915dd | 1554 | { |
35b9a1d9 | 1555 | |
1556 | if (!fileloc_isDefined (loc1) ) | |
c3e695ff | 1557 | return FALSE; |
35b9a1d9 | 1558 | |
1559 | if (!fileloc_isDefined (loc2) ) | |
c3e695ff | 1560 | return FALSE; |
1561 | ||
35b9a1d9 | 1562 | if (!fileloc_isDefined (loc3) ) |
c3e695ff | 1563 | return TRUE; |
35b9a1d9 | 1564 | |
c3e695ff | 1565 | |
9a48d98c | 1566 | |
9a48d98c | 1567 | |
35b9a1d9 | 1568 | if (fileloc_equal (loc2, loc3) ) |
c3e695ff | 1569 | return FALSE; |
35b9a1d9 | 1570 | |
1571 | if (fileloc_equal (loc1, loc2) ) | |
1572 | return TRUE; | |
1573 | ||
1574 | if (fileloc_equal (loc1, loc3) ) | |
1575 | return FALSE; | |
1576 | ||
1577 | if ( fileloc_lessthan (loc1, loc2) ) | |
1578 | { | |
1579 | if (fileloc_lessthan (loc2, loc3) ) | |
1580 | { | |
1581 | llassert (fileloc_lessthan (loc1, loc3) ); | |
1582 | return TRUE; | |
1583 | } | |
1584 | else | |
1585 | { | |
1586 | return FALSE; | |
1587 | } | |
1588 | } | |
1589 | ||
1590 | if ( !fileloc_lessthan (loc1, loc2) ) | |
1591 | { | |
1592 | if (!fileloc_lessthan (loc2, loc3) ) | |
1593 | { | |
1594 | llassert (!fileloc_lessthan (loc1, loc3) ); | |
1595 | return TRUE; | |
1596 | } | |
1597 | else | |
1598 | { | |
1599 | return FALSE; | |
1600 | } | |
1601 | } | |
1602 | ||
1603 | llassert(FALSE); | |
1604 | return FALSE; | |
616915dd | 1605 | } |
1606 | ||
1607 |