src/storeRefNodeList.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 ** storeRefNodeList.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@*/ storeRefNodeList
  36 storeRefNodeList_new (void)
  37 {
  38   storeRefNodeList s = (storeRefNodeList) dmalloc (sizeof (*s));
  39
  40   s->nelements = 0;
  41   s->nspace = storeRefNodeListBASESIZE;
  42   s->elements = (storeRefNode *)
  43     dmalloc (sizeof (*s->elements) * storeRefNodeListBASESIZE);
  44
  45   return (s);
  46 }
  47
  48 static void
  49 storeRefNodeList_grow (storeRefNodeList s)
  50 {
  51   int i;
  52   storeRefNode *newelements;
  53
  54   s->nspace += storeRefNodeListBASESIZE;
  55
  56   newelements = (storeRefNode *) 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 storeRefNodeList
  69 storeRefNodeList_add (storeRefNodeList s, storeRefNode el)
  70 {
  71   if (s->nspace <= 0)
  72     storeRefNodeList_grow (s);
  73
  74   s->nspace--;
  75   s->elements[s->nelements] = el;
  76   s->nelements++;
  77
  78   return s;
  79 }
  80
  81 /*@only@*/ storeRefNodeList
  82 storeRefNodeList_copy (storeRefNodeList s)
  83 {
  84   storeRefNodeList r = storeRefNodeList_new ();
  85
  86   storeRefNodeList_elements (s, x)
  87     {
  88       r = storeRefNodeList_add (r, storeRefNode_copy (x));
  89     } end_storeRefNodeList_elements;
  90
  91   return r;
  92 }
  93
  94 /*@only@*/ cstring
  95 storeRefNodeList_unparse (storeRefNodeList s)
  96 {
  97   bool first = TRUE;
  98   cstring st = cstring_undefined;
  99
 100   storeRefNodeList_elements (s, current)
 101   {
 102     if (first)
 103       {
 104         first = FALSE;
 105       }
 106     else
 107       {
 108         st = message ("%q, ", st);
 109       }
 110
 111     switch (current->kind)
 112       {
 113       case SRN_OBJ:
 114         st = message ("%qobj", st);
 115         /*@switchbreak@*/ break;
 116       case SRN_TERM:
 117         st = message ("%q%q", st, termNode_unparse (current->content.term));
 118         /*@switchbreak@*/ break;
 119       case SRN_TYPE:
 120         st = message ("%q%q", st, lclTypeSpecNode_unparse (current->content.type));
 121         /*@switchbreak@*/ break;
 122       case SRN_SPECIAL:
 123         st = message ("%q%q", st, sRef_unparse (current->content.ref));
 124         /*@switchbreak@*/ break;
 125       }
 126   } end_storeRefNodeList_elements;
 127
 128   return st;
 129 }
 130
 131 void
 132 storeRefNodeList_free (storeRefNodeList s)
 133 {
 134   int i;
 135   for (i = 0; i < s->nelements; i++)
 136     {
 137       storeRefNode_free (s->elements[i]);
 138     }
 139
 140   sfree (s->elements);
 141   sfree (s);
 142 }