src/fcnNodeList.c

   1 /*
   2 ** Splint - annotation-assisted static program checker
   3 ** Copyright (C) 1994-2003 University of Virginia,
   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 **
  20 ** For information on splint: info@splint.org
  21 ** To report a bug: splint-bug@splint.org
  22 ** For more information: http://www.splint.org
  23 */
  24 /*
  25 ** fcnNodeList.c
  26 **
  27 ** based on list_template.c
  28 **
  29 ** where T has T_equal (or change this) and T_unparse
  30 */
  31
  32 # include "splintMacros.nf"
  33 # include "basic.h"
  34
  35 /*@constant int fcnNodeListBASESIZE;@*/
  36 # define fcnNodeListBASESIZE SMALLBASESIZE
  37
  38 fcnNodeList
  39 fcnNodeList_new (void)
  40 {
  41   return fcnNodeList_undefined;
  42 }
  43
  44 static /*@notnull@*/ /*@only@*/ fcnNodeList
  45 fcnNodeList_newEmpty (void)
  46 {
  47   fcnNodeList s = (fcnNodeList) dmalloc (sizeof (*s));
  48
  49   s->nelements = 0;
  50   s->nspace = fcnNodeListBASESIZE;
  51   s->elements = (fcnNode *) dmalloc (sizeof (*s->elements) * fcnNodeListBASESIZE);
  52
  53   return (s);
  54 }
  55
  56 static void
  57 fcnNodeList_grow (/*@notnull@*/ fcnNodeList s)
  58 {
  59   int i;
  60   fcnNode *newelements;
  61
  62   s->nspace += fcnNodeListBASESIZE;
  63   newelements = (fcnNode *) dmalloc (sizeof (*newelements)
  64                                      * (s->nelements + s->nspace));
  65
  66   if (newelements == (fcnNode *) 0)
  67     {
  68       llfatalerror (cstring_makeLiteral ("fcnNodeList_grow: out of memory!"));
  69     }
  70
  71   for (i = 0; i < s->nelements; i++)
  72     {
  73       newelements[i] = s->elements[i];
  74     }
  75
  76   sfree (s->elements);
  77   s->elements = newelements;
  78 }
  79
  80 fcnNodeList
  81 fcnNodeList_add (fcnNodeList s, fcnNode el)
  82 {
  83   if (fcnNodeList_isUndefined (s))
  84     {
  85       s = fcnNodeList_newEmpty ();
  86     }
  87
  88   if (s->nspace <= 0)
  89     fcnNodeList_grow (s);
  90
  91   s->nspace--;
  92   s->elements[s->nelements] = el;
  93   s->nelements++;
  94
  95   return s;
  96 }
  97
  98 # ifdef DEADCODE
  99 /*@only@*/ cstring
 100 fcnNodeList_unparse (fcnNodeList s)
 101 {
 102   int i;
 103   cstring st = cstring_undefined;
 104
 105   if (fcnNodeList_isDefined (s))
 106     {
 107       for (i = 0; i < s->nelements; i++)
 108         {
 109           st = message ("%q%q\n", st, fcnNode_unparse (s->elements[i]));
 110         }
 111     }
 112
 113   return st;
 114 }
 115 # endif /* DEADCODE */
 116
 117 void
 118 fcnNodeList_free (/*@null@*/ /*@only@*/ fcnNodeList s)
 119 {
 120   if (s != NULL)
 121     {
 122       int i;
 123       for (i = 0; i < s->nelements; i++)
 124         {
 125           fcnNode_free (s->elements[i]);
 126         }
 127
 128       sfree (s->elements);
 129       sfree (s);
 130
 131     }
 132 }