src/traitRefNodeList.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 ** traitRefNodeList.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 traitRefNodeListBASESIZE;@*/
  36 # define traitRefNodeListBASESIZE SMALLBASESIZE
  37
  38 /*@only@*/ traitRefNodeList
  39 traitRefNodeList_new (void)
  40 {
  41   traitRefNodeList s = (traitRefNodeList) dmalloc (sizeof (*s));
  42
  43   s->nelements = 0;
  44   s->nspace = traitRefNodeListBASESIZE;
  45   s->elements = (traitRefNode *)
  46     dmalloc (sizeof (*s->elements) * traitRefNodeListBASESIZE);
  47
  48   return (s);
  49 }
  50
  51 static void
  52 traitRefNodeList_grow (traitRefNodeList s)
  53 {
  54   int i;
  55   traitRefNode *newelements;
  56
  57   s->nspace += traitRefNodeListBASESIZE;
  58   newelements = (traitRefNode *) 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 traitRefNodeList
  71 traitRefNodeList_add (traitRefNodeList s, /*@only@*/ traitRefNode el)
  72 {
  73   if (s->nspace <= 0)
  74     traitRefNodeList_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 traitRefNodeList_unparse (traitRefNodeList s)
  86 {
  87   cstring st = cstring_undefined;
  88
  89   traitRefNodeList_elements (s, current)
  90   {
  91     st = message ("%quses (%q)", st, printLeaves2 (current->traitid));
  92
  93     if (current->rename != 0)
  94       {
  95         st = message ("%q (%q)", st, renamingNode_unparse (current->rename));
  96       }
  97
  98     st = message ("%q\n", st);
  99   } end_traitRefNodeList_elements;
 100
 101   return (st);
 102 }
 103 # endif /* DEADCODE */
 104
 105 void
 106 traitRefNodeList_free (traitRefNodeList s)
 107 {
 108   int i;
 109   for (i = 0; i < s->nelements; i++)
 110     {
 111       traitRefNode_free (s->elements[i]);
 112     }
 113
 114   sfree (s->elements);
 115   sfree (s);
 116 }