src/exprNodeSList.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 ** exprNodeSList.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 # include "exprNodeSList.h"
  35
  36 /*@constant int exprNodeSListBASESIZE;@*/
  37 # define exprNodeSListBASESIZE SMALLBASESIZE
  38
  39 exprNodeSList
  40 exprNodeSList_new (void)
  41 {
  42   exprNodeSList s = (exprNodeSList) dmalloc (sizeof (*s));
  43
  44   s->nelements = 0;
  45   s->nspace = exprNodeSListBASESIZE;
  46   s->elements = (exprNode *)
  47     dmalloc (sizeof (*s->elements) * exprNodeSListBASESIZE);
  48
  49   return (s);
  50 }
  51
  52 static void
  53 exprNodeSList_grow (exprNodeSList s)
  54 {
  55   int i;
  56   exprNode *newelements;
  57
  58   s->nspace += exprNodeSListBASESIZE;
  59
  60   newelements = (exprNode *) dmalloc (sizeof (*newelements)
  61                                       * (s->nelements + s->nspace));
  62
  63   if (newelements == (exprNode *) 0)
  64     {
  65       llfatalerror (cstring_makeLiteral ("exprNodeSList_grow: out of memory!"));
  66     }
  67
  68   for (i = 0; i < s->nelements; i++)
  69     {
  70       newelements[i] = s->elements[i];
  71     }
  72
  73   sfree (s->elements);
  74   s->elements = newelements;
  75 }
  76
  77 static /*@unused@*/ void exprNodeSList_addh (exprNodeSList s, /*@exposed@*/ /*@dependent@*/ exprNode el)
  78 {
  79   llassert (exprNodeSListBASESIZE > 0);
  80
  81   if (s->nspace <= 0)
  82     exprNodeSList_grow (s);
  83
  84   s->nspace--;
  85   s->elements[s->nelements] = el;
  86   s->nelements++;
  87 }
  88
  89 /*
  90 ** appends s2 to s1
  91 */
  92
  93 exprNodeSList exprNodeSList_append (/*@returned@*/ exprNodeSList s1, /*@only@*/ exprNodeSList s2)
  94 {
  95   exprNodeSList_elements (s2, x)
  96     {
  97       exprNodeSList_addh (s1, x);
  98     } end_exprNodeSList_elements;
  99
 100   exprNodeSList_free (s2);
 101   return s1;
 102 }
 103
 104 /*@only@*/ exprNodeSList exprNodeSList_singleton (/*@exposed@*/ /*@dependent@*/ exprNode e)
 105 {
 106   exprNodeSList s = (exprNodeSList) dmalloc (sizeof (*s));
 107
 108   s->nelements = 1;
 109   s->nspace = exprNodeSListBASESIZE - 1;
 110   s->elements = (exprNode *) dmalloc (sizeof (*s->elements) * exprNodeSListBASESIZE);
 111   s->elements[0] = e;
 112
 113   return (s);
 114 }
 115
 116 # ifdef DEADCODE
 117 /*@only@*/ cstring
 118 exprNodeSList_unparse (exprNodeSList s)
 119 {
 120    int i;
 121    cstring st = cstring_undefined;
 122
 123    for (i = 0; i < s->nelements; i++)
 124      {
 125        if (i == 0)
 126          {
 127            st = cstring_copy (exprNode_unparse (s->elements[i]));
 128          }
 129        else
 130          st = message ("%q, %s", st, exprNode_unparse (s->elements[i]));
 131      }
 132
 133    return st;
 134 }
 135 # endif /* DEADCODE */
 136
 137 void
 138 exprNodeSList_free (exprNodeSList s)
 139 {
 140   sfree (s->elements);
 141   sfree (s);
 142 }
 143