src/varNodeList.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 ** varNodeList.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 varNodeListBASESIZE;@*/
  36 # define varNodeListBASESIZE SMALLBASESIZE
  37
  38 varNodeList varNodeList_new (void)
  39 {
  40   varNodeList s = (varNodeList) dmalloc (sizeof (*s));
  41
  42   s->nelements = 0;
  43   s->nspace = varNodeListBASESIZE;
  44   s->elements = (varNode *)
  45     dmalloc (sizeof (*s->elements) * varNodeListBASESIZE);
  46
  47   return (s);
  48 }
  49
  50 static void
  51 varNodeList_grow (varNodeList s)
  52 {
  53   int i;
  54   varNode *newelements;
  55
  56   s->nspace += varNodeListBASESIZE;
  57   newelements = (varNode *) dmalloc (sizeof (*newelements)
  58                                      * (s->nelements + s->nspace));
  59
  60   for (i = 0; i < s->nelements; i++)
  61     {
  62       newelements[i] = s->elements[i];
  63     }
  64
  65   sfree (s->elements);
  66   s->elements = newelements;
  67 }
  68
  69 varNodeList
  70 varNodeList_add (varNodeList s, varNode el)
  71 {
  72   if (s->nspace <= 0)
  73     varNodeList_grow (s);
  74
  75   s->nspace--;
  76   s->elements[s->nelements] = el;
  77   s->nelements++;
  78   return s;
  79 }
  80
  81 cstring
  82 varNodeList_unparse (varNodeList s)
  83 {
  84   int i;
  85   cstring st = cstring_undefined;
  86   bool first = TRUE;
  87
  88   for (i = 0; i < s->nelements; i++)
  89     {
  90       cstring type = cstring_undefined;
  91       varNode current = s->elements[i];
  92
  93       if (current->isObj)
  94         {
  95           type = cstring_makeLiteral ("obj ");
  96         }
  97
  98       if (current->type != NULL)
  99         {
 100           type = message (": %q%q", type, lclTypeSpecNode_unparse (current->type));
 101         }
 102
 103       if (first)
 104         {
 105           st = type;
 106           first = FALSE;
 107         }
 108       else
 109         {
 110           st = message ("%q, %q", st, type);
 111         }
 112     }
 113
 114   return st;
 115 }
 116
 117 # ifdef DEADCODE
 118 void
 119 varNodeList_free (varNodeList s)
 120 {
 121   int i;
 122   for (i = 0; i < s->nelements; i++)
 123     {
 124       varNode_free (s->elements[i]);
 125     }
 126
 127   sfree (s->elements);
 128   sfree (s);
 129 }
 130 # endif /* DEADCODE */
 131
 132 varNodeList
 133 varNodeList_copy (varNodeList s)
 134 {
 135   varNodeList ret = varNodeList_new ();
 136
 137   varNodeList_elements (s, el)
 138     {
 139       ret = varNodeList_add (ret, varNode_copy (el));
 140     } end_varNodeList_elements;
 141
 142   return ret;
 143 }