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
25 ** mtLoseReferenceList.c
27 ** based on list_template.c
29 ** where T has T_equal (or change this) and T_unparse
32 # include "splintMacros.nf"
36 mtLoseReferenceList_new ()
38 return mtLoseReferenceList_undefined;
41 static /*@notnull@*/ mtLoseReferenceList
42 mtLoseReferenceList_newEmpty (void)
44 mtLoseReferenceList s = (mtLoseReferenceList) dmalloc (sizeof (*s));
47 s->nspace = mtLoseReferenceListBASESIZE;
48 s->elements = (mtLoseReference *) dmalloc (sizeof (*s->elements) * mtLoseReferenceListBASESIZE);
54 mtLoseReferenceList_grow (/*@notnull@*/ mtLoseReferenceList s)
57 mtLoseReference *newelements;
59 s->nspace += mtLoseReferenceListBASESIZE;
61 newelements = (mtLoseReference *) dmalloc (sizeof (*newelements) * (s->nelements + s->nspace));
63 if (newelements == (mtLoseReference *) 0)
65 llfatalerror (cstring_makeLiteral ("mtLoseReferenceList_grow: out of memory!"));
68 for (i = 0; i < s->nelements; i++)
70 newelements[i] = s->elements[i];
74 s->elements = newelements;
77 mtLoseReferenceList mtLoseReferenceList_single (/*@keep@*/ mtLoseReference el)
79 mtLoseReferenceList s = mtLoseReferenceList_new ();
80 s = mtLoseReferenceList_add (s, el);
84 mtLoseReferenceList mtLoseReferenceList_add (mtLoseReferenceList s, /*@keep@*/ mtLoseReference el)
86 if (!mtLoseReferenceList_isDefined (s))
88 s = mtLoseReferenceList_newEmpty ();
93 mtLoseReferenceList_grow (s);
97 /*@i32@*/ s->elements[s->nelements] = el;
103 mtLoseReferenceList mtLoseReferenceList_prepend (mtLoseReferenceList s, /*@keep@*/ mtLoseReference el)
107 if (!mtLoseReferenceList_isDefined (s))
109 /*@i32@*/ return mtLoseReferenceList_single (el);
114 mtLoseReferenceList_grow (s);
119 for (i = s->nelements; i > 0; i--)
121 s->elements[i] = s->elements [i - 1];
124 /*@i32@*/ s->elements[0] = el;
131 mtLoseReferenceList_unparse (mtLoseReferenceList s)
133 return mtLoseReferenceList_unparseSep (s, cstring_makeLiteralTemp (" "));
137 mtLoseReferenceList_unparseSep (mtLoseReferenceList s, cstring sep)
139 cstring st = cstring_undefined;
141 if (mtLoseReferenceList_isDefined (s))
145 for (i = 0; i < s->nelements; i++)
149 st = mtLoseReference_unparse (s->elements[i]);
152 st = message ("%q%s%q", st, sep, mtLoseReference_unparse (s->elements[i]));
160 mtLoseReferenceList_free (mtLoseReferenceList s)
162 if (mtLoseReferenceList_isDefined (s))
166 for (i = 0; i < s->nelements; i++) {
167 mtLoseReference_free (s->elements[i]);