libbanshee/engine/bounds.c

   1 /*
   2  * Copyright (c) 2000-2001
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  * 3. Neither the name of the University nor the names of its contributors
  14  *    may be used to endorse or promote products derived from this software
  15  *    without specific prior written permission.
  16  *
  17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27  * SUCH DAMAGE.
  28  *
  29  */
  30
  31 #include <stdlib.h>
  32 #include <assert.h>
  33 #include "bounds.h"
  34
  35 struct bounds
  36 {
  37   hash_set set;
  38   gen_e_list elems;
  39 };
  40
  41 bounds bounds_create(region r)
  42 {
  43   bounds result;
  44
  45   result = ralloc(r, struct bounds);
  46   result->set = hs_create(r);
  47   result->elems = new_gen_e_list(r);
  48
  49   return result;
  50 }
  51
  52 gen_e_list bounds_exprs(bounds b)
  53 {
  54   return b->elems;
  55 }
  56
  57 bool bounds_add(bounds b, gen_e e, stamp s)
  58 {
  59   if (hs_member(b->set, s))
  60     return TRUE;
  61
  62   else
  63     {
  64       gen_e_list_cons(e,b->elems);
  65       return FALSE;
  66     }
  67 }
  68
  69 bool bounds_empty(bounds b)
  70 {
  71   return (gen_e_list_empty(b->elems));
  72 }
  73
  74 bool bounds_query(bounds b, stamp x)
  75 {
  76   return (hs_query(b->set, x));
  77 }
  78
  79 void bounds_set(bounds b,gen_e_list l)
  80 {
  81   b->elems = l;
  82 }
  83
  84 void bounds_delete(bounds b)
  85 {
  86   hs_delete(b->set);
  87 }
  88
  89