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@*/ replaceNodeList
36 replaceNodeList_new ()
38 replaceNodeList s
= (replaceNodeList
) dmalloc (sizeof (*s
));
41 s
->nspace
= replaceNodeListBASESIZE
;
42 s
->elements
= (replaceNode
*)
43 dmalloc (sizeof (*s
->elements
) * replaceNodeListBASESIZE
);
49 replaceNodeList_grow (replaceNodeList s
)
52 replaceNode
*newelements
;
54 s
->nspace
+= replaceNodeListBASESIZE
;
56 newelements
= (replaceNode
*) dmalloc (sizeof (*newelements
)
57 * (s
->nelements
+ s
->nspace
));
59 for (i
= 0; i
< s
->nelements
; i
++)
61 newelements
[i
] = s
->elements
[i
];
65 s
->elements
= newelements
;
69 replaceNodeList_add (replaceNodeList s
, replaceNode el
)
72 replaceNodeList_grow (s
);
75 s
->elements
[s
->nelements
] = el
;
82 replaceNodeList_unparse (replaceNodeList s
)
85 cstring st
= cstring_undefined
;
87 replaceNodeList_elements (s
, current
)
91 st
= replaceNode_unparse (current
);
96 st
= message ("%q, %q", st
, replaceNode_unparse (current
));
98 } end_replaceNodeList_elements
;
104 replaceNodeList_free (replaceNodeList s
)
107 for (i
= 0; i
< s
->nelements
; i
++)
109 replaceNode_free (s
->elements
[i
]);