2 * Copyright (c) 2000-2001
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
36 #define INITIAL_SIZE 32
39 #define INITIAL3 536870911
40 #define MIN -1073741824 /* -2^30 */
41 #define MAX 1073741824 /* 2^30 */
43 static hash_table str_hash;
44 static region str_hash_rgn;
46 static int count1 = INITIAL1, count2 = INITIAL2, count3 = INITIAL3;
47 static int bounds1 = MIN, bounds2 = 536870911, bounds3 = MAX;
49 static inline stamp check1(int i)
52 fail ("Unable to create stamp with small index\n");
56 static inline stamp check2(int i)
59 fail ("Unable to create a stamp with regular index\n");
63 static inline stamp check3(int i)
66 fail ("Unable to create a stamp with large index\n");
70 stamp stamp_fresh(void)
72 return (check2(++count2));
75 stamp stamp_fresh_small(void)
77 return (check1(--count1));
80 stamp stamp_fresh_large(void)
82 return (check3(++count3));
85 stamp stamp_string(const char *str) deletes
88 assert(str_hash != NULL);
90 if (! hash_table_lookup(str_hash,(hash_key)str, (void *)(char *) &st))
93 (void)hash_table_insert(str_hash,(hash_key)str,(hash_data) st);
98 void stamp_reset(void) deletes
103 hash_table_reset(str_hash);
104 deleteregion_ptr(&str_hash_rgn);
109 void stamp_init(void)
111 str_hash_rgn = newregion();
112 str_hash = make_string_hash_table(str_hash_rgn,INITIAL_SIZE,FALSE);
116 const char *stamp_to_str(region r,stamp st)
118 return inttostr(r,st);