/*
** Splint - annotation-assisted static program checker
-** Copyright (C) 1994-2002 University of Virginia,
+** Copyright (C) 1994-2003 University of Virginia,
** Massachusetts Institute of Technology
**
** This program is free software; you can redistribute it and/or modify it
** the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
** MA 02111-1307, USA.
**
-** For information on splint: splint@cs.virginia.edu
-** To report a bug: splint-bug@cs.virginia.edu
+** For information on splint: info@splint.org
+** To report a bug: splint-bug@splint.org
** For more information: http://www.splint.org
*/
/*
*/
# include "splintMacros.nf"
-# include "llbasic.h"
+# include "basic.h"
# include "llgrammar.h"
# include "checking.h"
# include "lclscan.h"
static /*@only@*/ cstring printBadArgs (sortSetList p_args);
static /*@only@*/ sortSet
- standardOperators (/*@null@*/ nameNode p_n, sortSetList p_argSorts, sort p_qual);
+ standardOperators (/*@null@*/ nameNode p_n, sortSetList p_argSorts, sort p_q);
static bool isStandardOperator (/*@null@*/ nameNode p_n);
static void assignSorts (termNode p_t, sort p_s);
{
/* check that the sort of n is boolean */
theSort = n->predicate->sort;
- if (!sort_compatible (theSort, sort_capBool))
+ if (!sort_compatible (theSort, g_sortCapBool))
{
if (sort_isNoSort (theSort))
{
}
static /*@only@*/ sortSet
-standardOperators (/*@null@*/ nameNode n, sortSetList argSorts, /*@unused@*/ sort qual)
+standardOperators (/*@null@*/ nameNode n, sortSetList argSorts, /*@unused@*/ sort q)
{
sortSet argSet;
sortSet ret = sortSet_new ();
{
if (sn->kind == SRT_OBJ ||
sn->kind == SRT_ARRAY)
- (void) sortSet_insert (ret, sort_bool);
+ (void) sortSet_insert (ret, g_sortBool);
}
if (cstring_equalLit (text, "maxIndex") ||
cstring_equalLit (text, "minIndex"))
{
if (sn->kind == SRT_ARRAY || sn->kind == SRT_PTR)
- (void) sortSet_insert (ret, sort_int);
+ (void) sortSet_insert (ret, g_sortInt);
/* if (lsymbol_fromChars ("maxIndex") */
}
if (sn->kind == SRT_OBJ ||
sn->kind == SRT_ARRAY)
{
- (void) sortSet_insert (ret, sort_bool);
+ (void) sortSet_insert (ret, g_sortBool);
}
break;
case LLT_SIZEOF:
if (sn->kind == SRT_OBJ ||
sn->kind == SRT_ARRAY ||
sn->kind == SRT_VECTOR)
- (void) sortSet_insert (ret, sort_int);
+ (void) sortSet_insert (ret, g_sortInt);
break;
default:
break;
{
argSet = sortSetList_head (argSorts);
- if (sortSet_member (argSet, sort_bool))
+ if (sortSet_member (argSet, g_sortBool))
{
sortSetList_reset (argSorts);
sortSetList_advance (argSorts);
{
if (sort_equal (cl, cl2))
{
- (void) sortSet_insert (ret, sort_bool);
+ (void) sortSet_insert (ret, g_sortBool);
}
} end_sortSet_elements;
} end_sortSet_elements;