src/declaratorNodeList.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 ** declaratorNodeList.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 declaratorNodeList
  36 declaratorNodeList_new (void)
  37 {
  38   declaratorNodeList s = (declaratorNodeList) dmalloc (sizeof (*s));
  39
  40   s->nelements = 0;
  41   s->nspace = declaratorNodeListBASESIZE;
  42   s->elements = (declaratorNode *)
  43     dmalloc (sizeof (*s->elements) * declaratorNodeListBASESIZE);
  44
  45   return (s);
  46 }
  47
  48 static void
  49 declaratorNodeList_grow (declaratorNodeList s)
  50 {
  51   int i;
  52   declaratorNode *newelements;
  53
  54   s->nspace = declaratorNodeListBASESIZE + s->nspace;
  55   newelements = (declaratorNode *) dmalloc (sizeof (*newelements) * (s->nelements + s->nspace));
  56
  57   if (newelements == (declaratorNode *) 0)
  58     {
  59       llfatalerror (cstring_makeLiteral ("declaratorNodeList_grow: out of memory!"));
  60     }
  61
  62   for (i = 0; i < s->nelements; i++)
  63     {
  64       newelements[i] = s->elements[i];
  65     }
  66
  67   sfree (s->elements);
  68   s->elements = newelements;
  69 }
  70
  71 declaratorNodeList
  72 declaratorNodeList_add (declaratorNodeList s, declaratorNode el)
  73 {
  74   if (s->nspace <= 0)
  75     declaratorNodeList_grow (s);
  76
  77   s->nspace--;
  78   s->elements[s->nelements] = el;
  79   s->nelements++;
  80
  81   return s;
  82 }
  83
  84 /*@only@*/ cstring
  85 declaratorNodeList_unparse (declaratorNodeList s)
  86 {
  87   cstring st = cstring_undefined;
  88   bool first = TRUE;
  89
  90   declaratorNodeList_elements (s, current)
  91   {
  92     if (first)
  93       {
  94         st = declaratorNode_unparse (current);
  95         first = FALSE;
  96       }
  97     else
  98       {
  99         st = message ("%q, %q", st, declaratorNode_unparse (current));
 100       }
 101   } end_declaratorNodeList_elements;
 102
 103   return st;
 104 }
 105
 106 declaratorNodeList
 107 declaratorNodeList_copy (declaratorNodeList s)
 108 {
 109   declaratorNodeList ret = declaratorNodeList_new ();
 110
 111   declaratorNodeList_elements (s, el)
 112     {
 113       ret = declaratorNodeList_add (ret, declaratorNode_copy (el));
 114     } end_declaratorNodeList_elements ;
 115
 116   return ret;
 117 }
 118
 119 void
 120 declaratorNodeList_free (declaratorNodeList s)
 121 {
 122   int i;
 123   for (i = 0; i < s->nelements; i++)
 124     {
 125       declaratorNode_free (s->elements[i]);
 126     }
 127
 128   sfree (s->elements);
 129   sfree (s);
 130 }