}
constraint_free(c);
- /*drl bee: pbr*/ *resolved = TRUE;
+ *resolved = TRUE;
return NULL;
}
- /*drl bee: pbr*/ *resolved = FALSE;
+ *resolved = FALSE;
llassert(constraint_isDefined(c) );
curr = doResolve (curr, post1, resolved);
- /*drl bee: pbr*/ if (*resolved)
+ if (*resolved)
{
/* curr is null so we don't try to free it*/
llassert(curr == NULL);
strlen(str) == maxRead(s) + strlen(str);
*/
- /*@i324234*/ /* clean this up */
+ /*@i324234*/ /*this code is functional but it may be worth cleaning up at some point. */
if (c1->ar == EQ)
if (c1->ar == c2->ar)
*/
/*@i223@*/ /*need to add some type checking */
+
static bool sizeOfMaxSet( /*@observer@*/ /*@temp@*/ constraint c)
{
constraintExpr l, r, buf1, buf2, con;