]>
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 | ** interfaceNodeList.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" |
b73d1009 | 33 | # include "basic.h" |
616915dd | 34 | |
35 | /*@only@*/ interfaceNodeList | |
36 | interfaceNodeList_new () | |
37 | { | |
38 | interfaceNodeList s = (interfaceNodeList) dmalloc (sizeof (*s)); | |
39 | ||
40 | s->nelements = 0; | |
41 | s->nspacelow = interfaceNodeListGROWLOW; | |
42 | s->nspacehigh = interfaceNodeListGROWHI; | |
43 | s->elementsroot = (interfaceNode *) dmalloc (sizeof (*s->elements) | |
44 | * interfaceNodeListBASESIZE); | |
45 | s->elements = s->elementsroot + interfaceNodeListGROWLOW; | |
46 | ||
47 | return (s); | |
48 | } | |
49 | ||
50 | static void | |
51 | interfaceNodeList_grow (interfaceNodeList s) | |
52 | { | |
53 | int i; | |
54 | interfaceNode *newelements; | |
55 | ||
56 | newelements = (interfaceNode *) dmalloc | |
57 | (sizeof (*newelements) * (s->nelements + interfaceNodeListBASESIZE)); | |
58 | ||
59 | for (i = 0; i < s->nelements; i++) | |
60 | { | |
61 | newelements[i + interfaceNodeListGROWLOW] = s->elements[i]; | |
62 | } | |
63 | ||
64 | s->nspacelow = interfaceNodeListGROWLOW; | |
65 | s->nspacehigh = interfaceNodeListGROWHI; | |
66 | ||
67 | sfree (s->elementsroot); | |
68 | s->elementsroot = newelements; | |
69 | ||
70 | s->elements = newelements + s->nspacelow; | |
71 | } | |
72 | ||
73 | interfaceNodeList | |
74 | interfaceNodeList_addh (interfaceNodeList s, interfaceNode el) | |
75 | { | |
76 | llassert (interfaceNodeListGROWHI > 0); | |
77 | ||
78 | if (s->nspacehigh <= 0) | |
79 | interfaceNodeList_grow (s); | |
80 | ||
81 | s->nspacehigh--; | |
82 | s->elements[s->nelements] = el; | |
83 | s->nelements++; | |
84 | ||
85 | return s; | |
86 | } | |
87 | ||
88 | void | |
89 | interfaceNodeList_addl (interfaceNodeList s, /*@keep@*/ interfaceNode el) | |
90 | { | |
91 | llassert (interfaceNodeListGROWLOW > 0); | |
92 | ||
93 | if (s->nspacelow <= 0) | |
94 | interfaceNodeList_grow (s); | |
95 | ||
96 | s->nspacelow--; | |
97 | s->elements--; | |
98 | s->elements[0] = el; | |
99 | s->nelements++; | |
100 | } | |
101 | ||
102 | void | |
103 | interfaceNodeList_free (interfaceNodeList s) | |
104 | { | |
105 | int i; | |
106 | ||
107 | for (i = 0; i < s->nelements; i++) | |
108 | { | |
109 | interfaceNode_free (s->elements[i]); | |
110 | } | |
111 | ||
112 | sfree (s->elementsroot); | |
113 | sfree (s); | |
114 | } |