]> andersk Git - splint.git/blame - src/letDeclNodeList.c
Fixed all /*@i...@*/ tags (except 1).
[splint.git] / src / letDeclNodeList.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** letDeclNodeList.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@*/ letDeclNodeList
36letDeclNodeList_new ()
37{
38 letDeclNodeList s = (letDeclNodeList) dmalloc (sizeof (*s));
39
40 s->nelements = 0;
41 s->nspace = letDeclNodeListBASESIZE;
42 s->elements = (letDeclNode *)
43 dmalloc (sizeof (*s->elements) * letDeclNodeListBASESIZE);
44
45 return (s);
46}
47
48static void
49letDeclNodeList_grow (letDeclNodeList s)
50{
51 int i;
52 letDeclNode *newelements;
53
54 s->nspace += letDeclNodeListBASESIZE;
55
56 newelements = (letDeclNode *) dmalloc (sizeof (*newelements)
57 * (s->nelements + s->nspace));
58
59 for (i = 0; i < s->nelements; i++)
60 {
61 newelements[i] = s->elements[i];
62 }
63
64 sfree (s->elements);
65 s->elements = newelements;
66}
67
68letDeclNodeList
69letDeclNodeList_add (letDeclNodeList s, letDeclNode el)
70{
71 llassert (letDeclNodeListBASESIZE > 0);
72
73 if (s->nspace <= 0)
74 letDeclNodeList_grow (s);
75
76 s->nspace--;
77 s->elements[s->nelements] = el;
78 s->nelements++;
79
80 return s;
81}
82
83/*@only@*/ cstring
84letDeclNodeList_unparse (letDeclNodeList s)
85{
86 cstring st = cstring_undefined;
87
88 letDeclNodeList_elements (s, current)
89 {
90 st = message ("%qlet %s", st, ltoken_getRawString (current->varid));
91
92 if (current->sortspec != NULL)
93 {
94 st = message ("%q: %q", st, lclTypeSpecNode_unparse (current->sortspec));
95 }
96 else
97 {
98 st = message ("%q ", st);
99 }
100 st = message ("%q = %q\n", st, termNode_unparse (current->term));
101 } end_letDeclNodeList_elements;
102
103 return st;
104}
105
106void
107letDeclNodeList_free (letDeclNodeList s)
108{
109 int i;
110 for (i = 0; i < s->nelements; i++)
111 {
112 letDeclNode_free (s->elements[i]);
113 }
114
115 sfree (s->elements);
116 sfree (s);
117}
This page took 0.085907 seconds and 5 git commands to generate.