src/typeNameNodeList.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 ** typeNameNodeList.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 typeNameNodeListBASESIZE;@*/
  36 # define typeNameNodeListBASESIZE SMALLBASESIZE
  37
  38 typeNameNodeList typeNameNodeList_new (void)
  39 {
  40   typeNameNodeList s = (typeNameNodeList) dmalloc (sizeof (*s));
  41
  42   s->nelements = 0;
  43   s->nspace = typeNameNodeListBASESIZE;
  44   s->elements = (typeNameNode *)
  45     dmalloc (sizeof (*s->elements) * typeNameNodeListBASESIZE);
  46
  47   return (s);
  48 }
  49
  50 static void
  51 typeNameNodeList_grow (typeNameNodeList s)
  52 {
  53   int i;
  54   typeNameNode *newelements;
  55
  56   s->nspace += typeNameNodeListBASESIZE;
  57
  58   newelements = (typeNameNode *) dmalloc (sizeof (*newelements)
  59                                           * (s->nelements + s->nspace));
  60
  61   for (i = 0; i < s->nelements; i++)
  62     {
  63       newelements[i] =  s->elements[i];
  64     }
  65
  66   sfree (s->elements);
  67   s->elements = newelements;
  68 }
  69
  70 typeNameNodeList
  71 typeNameNodeList_add (typeNameNodeList s, typeNameNode el)
  72 {
  73   if (s->nspace <= 0)
  74     typeNameNodeList_grow (s);
  75
  76   s->nspace--;
  77   s->elements[s->nelements] = el;
  78   s->nelements++;
  79
  80   return s;
  81 }
  82
  83 # ifdef DEADCODE
  84 /*@only@*/ cstring
  85 typeNameNodeList_unparse (typeNameNodeList s)
  86 {
  87   cstring st = cstring_undefined;
  88   bool first = TRUE;
  89
  90   typeNameNodeList_elements (s, current)
  91   {
  92     if (first)
  93       {
  94         st = typeNameNode_unparse (current);
  95         first = FALSE;
  96       }
  97     else
  98       {
  99         st = message ("%q, %q", st, typeNameNode_unparse (current));
 100       }
 101   } end_typeNameNodeList_elements;
 102   return (st);
 103 }
 104 # endif /* DEADCODE */
 105
 106 void
 107 typeNameNodeList_free (typeNameNodeList s)
 108 {
 109   int i;
 110   for (i = 0; i < s->nelements; i++)
 111     {
 112       typeNameNode_free (s->elements[i]);
 113     }
 114
 115   sfree (s->elements);
 116   sfree (s);
 117 }