]>
Commit | Line | Data |
---|---|---|
616915dd | 1 | /* |
11db3170 | 2 | ** Splint - annotation-assisted static program checker |
c59f5181 | 3 | ** Copyright (C) 1994-2003 University of Virginia, |
616915dd | 4 | ** Massachusetts Institute of Technology |
5 | ** | |
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. | |
10 | ** | |
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. | |
15 | ** | |
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. | |
19 | ** | |
155af98d | 20 | ** For information on splint: info@splint.org |
21 | ** To report a bug: splint-bug@splint.org | |
11db3170 | 22 | ** For more information: http://www.splint.org |
616915dd | 23 | */ |
24 | /* | |
25 | ** pairNodeList.c | |
26 | ** | |
27 | ** based on list_template.c | |
28 | ** | |
29 | ** where T has T_equal (or change this) and T_unparse | |
30 | */ | |
31 | ||
1b8ae690 | 32 | # include "splintMacros.nf" |
616915dd | 33 | # include "llbasic.h" |
34 | ||
35 | /*@only@*/ pairNodeList | |
36 | pairNodeList_new () | |
37 | { | |
38 | pairNodeList s = (pairNodeList) dmalloc (sizeof (*s)); | |
39 | ||
40 | s->nelements = 0; | |
41 | s->nspace = pairNodeListBASESIZE; | |
42 | s->elements = (pairNode *) | |
43 | dmalloc (sizeof (*s->elements) * pairNodeListBASESIZE); | |
44 | ||
45 | return (s); | |
46 | } | |
47 | ||
48 | static void | |
49 | pairNodeList_grow (/*@notnull@*/ pairNodeList s) | |
50 | { | |
51 | int i; | |
52 | pairNode *newelements; | |
53 | ||
54 | s->nspace += pairNodeListBASESIZE; | |
55 | newelements = (pairNode *) dmalloc (sizeof (*newelements) | |
56 | * (s->nelements + s->nspace)); | |
57 | ||
58 | for (i = 0; i < s->nelements; i++) | |
59 | { | |
60 | newelements[i] = s->elements[i]; | |
61 | } | |
62 | ||
63 | sfree (s->elements); | |
64 | s->elements = newelements; | |
65 | } | |
66 | ||
67 | void | |
68 | pairNodeList_addh (pairNodeList s, pairNode el) | |
69 | { | |
70 | llassert (pairNodeList_isDefined (s)); | |
71 | llassert (pairNodeListBASESIZE > 0); | |
72 | ||
73 | if (s->nspace <= 0) | |
74 | pairNodeList_grow (s); | |
75 | ||
76 | s->nspace--; | |
77 | s->elements[s->nelements] = el; | |
78 | s->nelements++; | |
79 | } | |
80 | ||
81 | /*@only@*/ cstring | |
82 | pairNodeList_unparse (pairNodeList s) | |
83 | { | |
84 | cstring st = cstring_undefined; | |
85 | ||
86 | if (s != (pairNodeList)0) | |
87 | { | |
88 | pairNodeList_elements (s, current) | |
89 | { | |
90 | if (current != NULL) | |
91 | { | |
92 | st = message ("%q%s %s; ", st, | |
93 | sort_unparseName (current->sort), | |
94 | ltoken_getRawString (current->tok)); | |
95 | } | |
96 | } end_pairNodeList_elements; | |
97 | } | |
98 | ||
99 | return st; | |
100 | } | |
101 | ||
102 | void | |
103 | pairNodeList_free (/*@only@*/ pairNodeList s) | |
104 | { | |
105 | if (pairNodeList_isDefined (s)) | |
106 | { | |
107 | int i; | |
108 | for (i = 0; i < s->nelements; i++) | |
109 | { | |
110 | pairNode_free (s->elements[i]); | |
111 | } | |
112 | ||
113 | sfree (s->elements); | |
114 | sfree (s); | |
115 | } | |
116 | } |