]> andersk Git - splint.git/blame - src/traitRefNodeList.c
Fixed all /*@i...@*/ tags (except 1).
[splint.git] / src / traitRefNodeList.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** traitRefNodeList.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@*/ traitRefNodeList
36traitRefNodeList_new ()
37{
38 traitRefNodeList s = (traitRefNodeList) dmalloc (sizeof (*s));
39
40 s->nelements = 0;
41 s->nspace = traitRefNodeListBASESIZE;
42 s->elements = (traitRefNode *)
43 dmalloc (sizeof (*s->elements) * traitRefNodeListBASESIZE);
44
45 return (s);
46}
47
48static void
49traitRefNodeList_grow (traitRefNodeList s)
50{
51 int i;
52 traitRefNode *newelements;
53
54 s->nspace += traitRefNodeListBASESIZE;
55 newelements = (traitRefNode *) 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
67traitRefNodeList
68traitRefNodeList_add (traitRefNodeList s, /*@only@*/ traitRefNode el)
69{
70 if (s->nspace <= 0)
71 traitRefNodeList_grow (s);
72
73 s->nspace--;
74 s->elements[s->nelements] = el;
75 s->nelements++;
76
77 return s;
78}
79
80/*@only@*/ cstring
81traitRefNodeList_unparse (traitRefNodeList s)
82{
83 cstring st = cstring_undefined;
84
85 traitRefNodeList_elements (s, current)
86 {
87 st = message ("%quses (%q)", st, printLeaves2 (current->traitid));
88
89 if (current->rename != 0)
90 {
91 st = message ("%q (%q)", st, renamingNode_unparse (current->rename));
92 }
93
94 st = message ("%q\n", st);
95 } end_traitRefNodeList_elements;
96
97 return (st);
98}
99
100void
101traitRefNodeList_free (traitRefNodeList s)
102{
103 int i;
104 for (i = 0; i < s->nelements; i++)
105 {
106 traitRefNode_free (s->elements[i]);
107 }
108
109 sfree (s->elements);
110 sfree (s);
111}
This page took 0.077339 seconds and 5 git commands to generate.