src/quantifierNodeList.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 ** quantifierNodeList.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 quantifierNodeListBASESIZE;@*/
  36 # define quantifierNodeListBASESIZE SMALLBASESIZE
  37
  38 /*@only@*/ quantifierNodeList
  39 quantifierNodeList_new (void)
  40 {
  41   quantifierNodeList s = (quantifierNodeList) dmalloc (sizeof (*s));
  42
  43   s->nelements = 0;
  44   s->nspace = quantifierNodeListBASESIZE;
  45   s->elements = (quantifierNode *)
  46     dmalloc (sizeof (*s->elements) * quantifierNodeListBASESIZE);
  47
  48   return (s);
  49 }
  50
  51 static void
  52 quantifierNodeList_grow (quantifierNodeList s)
  53 {
  54   int i;
  55   quantifierNode *newelements;
  56
  57   s->nspace += quantifierNodeListBASESIZE;
  58
  59   newelements = (quantifierNode *) 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 quantifierNodeList
  72 quantifierNodeList_add (quantifierNodeList s, quantifierNode el)
  73 {
  74   if (s->nspace <= 0)
  75     quantifierNodeList_grow (s);
  76
  77   s->nspace--;
  78   s->elements[s->nelements] = el;
  79   s->nelements++;
  80
  81   return s;
  82 }
  83
  84 /*@only@*/ quantifierNodeList
  85 quantifierNodeList_copy (quantifierNodeList s)
  86 {
  87   quantifierNodeList r = quantifierNodeList_new ();
  88
  89   quantifierNodeList_elements (s, x)
  90     {
  91       r = quantifierNodeList_add (r, quantifierNode_copy (x));
  92     } end_quantifierNodeList_elements;
  93
  94   return r;
  95 }
  96
  97 /*@only@*/ cstring
  98 quantifierNodeList_unparse (quantifierNodeList s)
  99 {
 100   cstring st = cstring_undefined;
 101
 102   quantifierNodeList_elements (s, current)
 103   {
 104     st = message ("%q%s %q",
 105                   st, ltoken_getRawString (current->quant),
 106                   varNodeList_unparse (current->vars));
 107   } end_quantifierNodeList_elements;
 108
 109   return st;
 110 }
 111
 112 # ifdef DEADCODE
 113 void
 114 quantifierNodeList_free (quantifierNodeList s)
 115 {
 116   int i;
 117   for (i = 0; i < s->nelements; i++)
 118     {
 119       quantifierNode_free (s->elements[i]);
 120     }
 121
 122   sfree (s->elements);
 123   sfree (s);
 124 }
 125 # endif /* DEADCODE */
 126