src/sortSetList.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 ** sortSetList.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 /*@only@*/ sortSetList
  36 sortSetList_new ()
  37 {
  38   sortSetList s = (sortSetList) dmalloc (sizeof (*s));
  39
  40   s->nelements = 0;
  41   s->free = sortSetListBASESIZE;
  42   s->elements = (sortSet *) dmalloc (sizeof (*s->elements) * sortSetListBASESIZE);
  43   s->current = 0;
  44
  45   return (s);
  46 }
  47
  48 static void
  49 sortSetList_grow (sortSetList s)
  50 {
  51   int i;
  52   sortSet *newelements;
  53
  54   s->free += sortSetListBASESIZE;
  55   newelements = (sortSet *) dmalloc (sizeof (*newelements)
  56                                      * (s->nelements + s->free));
  57
  58   if (newelements == (sortSet *) 0)
  59     {
  60       llfatalerror (cstring_makeLiteral ("sortSetList_grow: out of memory!"));
  61     }
  62
  63   for (i = 0; i < s->nelements; i++)
  64     {
  65       newelements[i] = s->elements[i];
  66     }
  67
  68   sfree (s->elements);
  69   s->elements = newelements;
  70 }
  71
  72 void
  73 sortSetList_addh (sortSetList s, sortSet el)
  74 {
  75   llassert (sortSetListBASESIZE > 0);
  76
  77   if (s->free <= 0)
  78     sortSetList_grow (s);
  79
  80   s->free--;
  81   s->elements[s->nelements] = el;
  82   s->nelements++;
  83 }
  84
  85 void
  86 sortSetList_reset (sortSetList s)
  87 {
  88   s->current = 0;
  89 }
  90
  91 void
  92 sortSetList_advance (sortSetList s)
  93 {
  94   s->current++;
  95 }
  96
  97 /*@observer@*/ sortSet
  98 sortSetList_head (sortSetList s)
  99 {
 100   llassert (s->nelements > 0);
 101   return (s->elements[0]);
 102 }
 103
 104 /*@observer@*/ sortSet
 105 sortSetList_current (sortSetList s)
 106 {
 107   if (s->current < 0 || s->current >= s->nelements)
 108     {
 109       llbug (message ("sortSetList_current: current out of range: %d (size: %d)",
 110                       s->current, s->nelements));
 111     }
 112   return (s->elements[s->current]);
 113 }
 114
 115 /*@only@*/ cstring
 116 sortSetList_unparse (sortSetList s)
 117 {
 118   int i;
 119   cstring st = cstring_makeLiteral ("[ ");
 120
 121   for (i = 0; i < s->nelements; i++)
 122     {
 123       if (i != 0)
 124         st = message ("%q, %q", st, sortSet_unparse (s->elements[i]));
 125       else
 126         st = message ("%q%q", st, sortSet_unparse (s->elements[i]));
 127     }
 128
 129   st = message ("%q]", st);
 130   return st;
 131 }
 132
 133 void
 134 sortSetList_free (sortSetList s)
 135 {
 136   /* note: elements are dependent */
 137
 138   sfree (s->elements);
 139   sfree (s);
 140 }