2 ** Splint - annotation-assisted static program checker
3 ** Copyright (C) 1994-2003 University of Virginia,
4 ** Massachusetts Institute of Technology
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.
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.
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.
20 ** For information on splint: info@splint.org
21 ** To report a bug: splint-bug@splint.org
22 ** For more information: http://www.splint.org
27 ** based on list_template.c
29 ** where T has T_equal (or change this) and T_unparse
32 # include "splintMacros.nf"
35 /*@only@*/ sortSetList
38 sortSetList s
= (sortSetList
) dmalloc (sizeof (*s
));
41 s
->free
= sortSetListBASESIZE
;
42 s
->elements
= (sortSet
*) dmalloc (sizeof (*s
->elements
) * sortSetListBASESIZE
);
49 sortSetList_grow (sortSetList s
)
54 s
->free
+= sortSetListBASESIZE
;
55 newelements
= (sortSet
*) dmalloc (sizeof (*newelements
)
56 * (s
->nelements
+ s
->free
));
58 if (newelements
== (sortSet
*) 0)
60 llfatalerror (cstring_makeLiteral ("sortSetList_grow: out of memory!"));
63 for (i
= 0; i
< s
->nelements
; i
++)
65 newelements
[i
] = s
->elements
[i
];
69 s
->elements
= newelements
;
73 sortSetList_addh (sortSetList s
, sortSet el
)
75 llassert (sortSetListBASESIZE
> 0);
81 s
->elements
[s
->nelements
] = el
;
86 sortSetList_reset (sortSetList s
)
92 sortSetList_advance (sortSetList s
)
97 /*@observer@*/ sortSet
98 sortSetList_head (sortSetList s
)
100 llassert (s
->nelements
> 0);
101 return (s
->elements
[0]);
104 /*@observer@*/ sortSet
105 sortSetList_current (sortSetList s
)
107 if (s
->current
< 0 || s
->current
>= s
->nelements
)
109 llbug (message ("sortSetList_current: current out of range: %d (size: %d)",
110 s
->current
, s
->nelements
));
112 return (s
->elements
[s
->current
]);
116 sortSetList_unparse (sortSetList s
)
119 cstring st
= cstring_makeLiteral ("[ ");
121 for (i
= 0; i
< s
->nelements
; i
++)
124 st
= message ("%q, %q", st
, sortSet_unparse (s
->elements
[i
]));
126 st
= message ("%q%q", st
, sortSet_unparse (s
->elements
[i
]));
129 st
= message ("%q]", st
);
134 sortSetList_free (sortSetList s
)
136 /* note: elements are dependent */