src/replaceNodeList.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 ** replaceNodeList.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@*/ replaceNodeList
  36 replaceNodeList_new ()
  37 {
  38   replaceNodeList s = (replaceNodeList) dmalloc (sizeof (*s));
  39
  40   s->nelements = 0;
  41   s->nspace = replaceNodeListBASESIZE;
  42   s->elements = (replaceNode *)
  43     dmalloc (sizeof (*s->elements) * replaceNodeListBASESIZE);
  44
  45   return (s);
  46 }
  47
  48 static void
  49 replaceNodeList_grow (replaceNodeList s)
  50 {
  51   int i;
  52   replaceNode *newelements;
  53
  54   s->nspace += replaceNodeListBASESIZE;
  55
  56   newelements = (replaceNode *) 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 replaceNodeList
  69   replaceNodeList_add (replaceNodeList s, replaceNode el)
  70 {
  71   if (s->nspace <= 0)
  72     replaceNodeList_grow (s);
  73
  74   s->nspace--;
  75   s->elements[s->nelements] = el;
  76   s->nelements++;
  77
  78   return s;
  79 }
  80
  81 /*@only@*/ cstring
  82 replaceNodeList_unparse (replaceNodeList s)
  83 {
  84   bool first = TRUE;
  85   cstring st = cstring_undefined;
  86
  87   replaceNodeList_elements (s, current)
  88   {
  89     if (first)
  90       {
  91         st = replaceNode_unparse (current);
  92         first = FALSE;
  93       }
  94     else
  95       {
  96         st = message ("%q, %q", st, replaceNode_unparse (current));
  97       }
  98   } end_replaceNodeList_elements;
  99
 100   return st;
 101 }
 102
 103 void
 104 replaceNodeList_free (replaceNodeList s)
 105 {
 106   int i;
 107   for (i = 0; i < s->nelements; i++)
 108     {
 109       replaceNode_free (s->elements[i]);
 110     }
 111
 112   sfree (s->elements);
 113   sfree (s);
 114 }