src/stDeclNodeList.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 ** structDeclNodeList.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 /*@only@*/ stDeclNodeList
  36 stDeclNodeList_new (void)
  37 {
  38   stDeclNodeList s = (stDeclNodeList) dmalloc (sizeof (*s));
  39
  40   s->nelements = 0;
  41   s->nspace = stDeclNodeListBASESIZE;
  42   s->elements = (stDeclNode *)
  43     dmalloc (sizeof (*s->elements) * stDeclNodeListBASESIZE);
  44
  45   return (s);
  46 }
  47
  48 static void
  49 stDeclNodeList_grow (stDeclNodeList s)
  50 {
  51   int i;
  52   stDeclNode *newelements;
  53
  54   s->nspace += stDeclNodeListBASESIZE;
  55
  56   newelements = (stDeclNode *) 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
  68 stDeclNodeList
  69 stDeclNodeList_add (stDeclNodeList s, /*@only@*/ stDeclNode el)
  70 {
  71   if (s->nspace <= 0)
  72     stDeclNodeList_grow (s);
  73
  74   s->nspace--;
  75   s->elements[s->nelements] = el;
  76   s->nelements++;
  77
  78   return s;
  79 }
  80
  81 /*@only@*/ stDeclNodeList
  82 stDeclNodeList_copy (stDeclNodeList s)
  83 {
  84   stDeclNodeList r = stDeclNodeList_new ();
  85
  86   stDeclNodeList_elements (s, x)
  87     {
  88       r = stDeclNodeList_add (r, stDeclNode_copy (x));
  89     } end_stDeclNodeList_elements;
  90
  91   return r;
  92 }
  93
  94 /*@only@*/ cstring
  95 stDeclNodeList_unparse (stDeclNodeList s)
  96 {
  97   bool first = TRUE;
  98   cstring st = cstring_undefined;
  99
 100   stDeclNodeList_elements (s, current)
 101   {
 102     if (first)
 103       {
 104         st = message ("%q %q;", lclTypeSpecNode_unparse (current->lcltypespec),
 105                       declaratorNodeList_unparse (current->declarators));
 106         first = FALSE;
 107       }
 108     else
 109       {
 110         st = message ("%q %q %q;", st, lclTypeSpecNode_unparse (current->lcltypespec),
 111                       declaratorNodeList_unparse (current->declarators));
 112       }
 113   } end_stDeclNodeList_elements;
 114
 115   return st;
 116 }
 117
 118 void
 119 stDeclNodeList_free (stDeclNodeList s)
 120 {
 121   int i;
 122   for (i = 0; i < s->nelements; i++)
 123     {
 124       stDeclNode_free (s->elements[i]);
 125     }
 126
 127   sfree (s->elements);
 128   sfree (s);
 129 }