]> andersk Git - splint.git/blame - src/lslOpList.c
Fixed all /*@i...@*/ tags (except 1).
[splint.git] / src / lslOpList.c
CommitLineData
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** lslOpList.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@*/ lslOpList
36lslOpList_new ()
37{
38 lslOpList s = (lslOpList) dmalloc (sizeof (*s));
39
40 s->nelements = 0;
41 s->nspace = lslOpListBASESIZE;
42 s->elements = (lslOp *)
43 dmalloc (sizeof (*s->elements) * lslOpListBASESIZE);
44
45 return (s);
46}
47
48static void
49lslOpList_grow (lslOpList s)
50{
51 int i;
52 lslOp *newelements;
53
54 s->nspace += lslOpListBASESIZE;
55
56 newelements = (lslOp *) dmalloc (sizeof (*newelements)
57 * (s->nelements + s->nspace));
58
59 if (newelements == (lslOp *) 0)
60 {
61 llfatalerror (cstring_makeLiteral ("lslOpList_grow: out of memory!"));
62 }
63
64 for (i = 0; i < s->nelements; i++)
65 {
66 newelements[i] = s->elements[i];
67 }
68
69 sfree (s->elements);
70 s->elements = newelements;
71}
72
73void
74lslOpList_add (lslOpList s, lslOp el)
75{
76 llassert (lslOpListBASESIZE != 0);
77
78 if (s->nspace <= 0)
79 {
80 lslOpList_grow (s);
81 }
82
83 s->nspace--;
84 s->elements[s->nelements] = el;
85 s->nelements++;
86}
87
88/*@only@*/ cstring
89lslOpList_unparse (lslOpList s)
90{
91 int i;
92 cstring st = cstring_undefined;
93
94 for (i = 0; i < s->nelements; i++)
95 {
96 st = message ("%q%q\n", st, lslOp_unparse (s->elements[i]));
97 }
98
99 return st;
100}
101
102void
103lslOpList_free (lslOpList s)
104{
105 sfree (s->elements);
106 sfree (s);
107}
This page took 0.162354 seconds and 5 git commands to generate.