src/letDeclNodeList.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 ** letDeclNodeList.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 letDeclNodeListBASESIZE;@*/
  36 # define letDeclNodeListBASESIZE SMALLBASESIZE
  37
  38 /*@only@*/ letDeclNodeList
  39 letDeclNodeList_new (void)
  40 {
  41   letDeclNodeList s = (letDeclNodeList) dmalloc (sizeof (*s));
  42
  43   s->nelements = 0;
  44   s->nspace = letDeclNodeListBASESIZE;
  45   s->elements = (letDeclNode *)
  46     dmalloc (sizeof (*s->elements) * letDeclNodeListBASESIZE);
  47
  48   return (s);
  49 }
  50
  51 static void
  52 letDeclNodeList_grow (letDeclNodeList s)
  53 {
  54   int i;
  55   letDeclNode *newelements;
  56
  57   s->nspace += letDeclNodeListBASESIZE;
  58
  59   newelements = (letDeclNode *) dmalloc (sizeof (*newelements)
  60                                          * (s->nelements + s->nspace));
  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 letDeclNodeList
  72 letDeclNodeList_add (letDeclNodeList s, letDeclNode el)
  73 {
  74   llassert (letDeclNodeListBASESIZE > 0);
  75
  76   if (s->nspace <= 0)
  77     letDeclNodeList_grow (s);
  78
  79   s->nspace--;
  80   s->elements[s->nelements] = el;
  81   s->nelements++;
  82
  83   return s;
  84 }
  85
  86 # ifdef DEADCODE
  87 /*@only@*/ cstring
  88 letDeclNodeList_unparse (letDeclNodeList s)
  89 {
  90   cstring st = cstring_undefined;
  91
  92   letDeclNodeList_elements (s, current)
  93   {
  94     st = message ("%qlet %s", st, ltoken_getRawString (current->varid));
  95
  96     if (current->sortspec != NULL)
  97       {
  98         st = message ("%q: %q", st, lclTypeSpecNode_unparse (current->sortspec));
  99       }
 100     else
 101       {
 102         st = message ("%q ", st);
 103       }
 104     st = message ("%q = %q\n", st, termNode_unparse (current->term));
 105   } end_letDeclNodeList_elements;
 106
 107   return st;
 108 }
 109 # endif /* DEADCODE */
 110
 111 void
 112 letDeclNodeList_free (letDeclNodeList s)
 113 {
 114   int i;
 115   for (i = 0; i < s->nelements; i++)
 116     {
 117       letDeclNode_free (s->elements[i]);
 118     }
 119
 120   sfree (s->elements);
 121   sfree (s);
 122 }