src/declaratorInvNodeList.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 ** declaratorInvNodeList.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
  36 /*@constant int declaratorInvNodeListBASESIZE;@*/
  37 # define declaratorInvNodeListBASESIZE SMALLBASESIZE
  38
  39 declaratorInvNodeList
  40   declaratorInvNodeList_new (void)
  41 {
  42   declaratorInvNodeList s = (declaratorInvNodeList) dmalloc (sizeof (*s));
  43
  44   s->nelements = 0;
  45
  46   s->nspace = declaratorInvNodeListBASESIZE;
  47   s->elements = (declaratorInvNode *)
  48     dmalloc (sizeof (*s->elements) * declaratorInvNodeListBASESIZE);
  49
  50   return (s);
  51 }
  52
  53 static void
  54 declaratorInvNodeList_grow (declaratorInvNodeList s)
  55 {
  56   int i;
  57   declaratorInvNode *newelements;
  58
  59   s->nspace = declaratorInvNodeListBASESIZE + s->nspace;
  60
  61    newelements = (declaratorInvNode *)
  62      dmalloc (sizeof (*newelements) * (s->nelements + s->nspace));
  63
  64   if (newelements == (declaratorInvNode *) 0)
  65     {
  66       llfatalerror (cstring_makeLiteral ("declaratorInvNodeList_grow: out of memory!"));
  67     }
  68
  69   for (i = 0; i < s->nelements; i++)
  70     {
  71       newelements[i] = s->elements[i];
  72     }
  73
  74   sfree (s->elements);
  75   s->elements = newelements;
  76 }
  77
  78 declaratorInvNodeList
  79 declaratorInvNodeList_add (declaratorInvNodeList s, declaratorInvNode el)
  80 {
  81   if (s->nspace <= 0)
  82     {
  83       declaratorInvNodeList_grow (s);
  84     }
  85
  86   s->nspace--;
  87   s->elements[s->nelements] = el;
  88   s->nelements++;
  89
  90   return s;
  91 }
  92
  93 # ifdef DEADCODE
  94 /*@only@*/ cstring
  95 declaratorInvNodeList_unparse (declaratorInvNodeList s)
  96 {
  97   int i;
  98   cstring st = cstring_undefined;
  99
 100   for (i = 0; i < s->nelements; i++)
 101     {
 102       st = message ("%q%q", st, declaratorInvNode_unparse (s->elements[i]));
 103     }
 104
 105   return st;
 106 }
 107 # endif /* DEADCODE */
 108
 109 void
 110 declaratorInvNodeList_free (declaratorInvNodeList s)
 111 {
 112   int i;
 113   for (i = 0; i < s->nelements; i++)
 114     {
 115       declaratorInvNode_free (s->elements[i]);
 116     }
 117
 118   sfree (s->elements);
 119   sfree (s);
 120 }