]> git.saurik.com Git - bison.git/blob - src/uniqstr.c
style: syntax-check fixes
[bison.git] / src / uniqstr.c
1 /* Keep a unique copy of strings.
2
3 Copyright (C) 2002-2005, 2009-2013 Free Software Foundation, Inc.
4
5 This file is part of Bison, the GNU Compiler Compiler.
6
7 This program is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
11
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
19
20 #include <config.h>
21 #include "system.h"
22
23 #include <error.h>
24 #include <hash.h>
25 #include <quotearg.h>
26 #include <stdarg.h>
27
28 #include "uniqstr.h"
29
30 /*-----------------------.
31 | A uniqstr hash table. |
32 `-----------------------*/
33
34 /* Initial capacity of uniqstr hash table. */
35 #define HT_INITIAL_CAPACITY 257
36
37 static struct hash_table *uniqstrs_table = NULL;
38
39 /*-------------------------------------.
40 | Create the uniqstr for S if needed. |
41 `-------------------------------------*/
42
43 uniqstr
44 uniqstr_new (char const *str)
45 {
46 uniqstr res = hash_lookup (uniqstrs_table, str);
47 if (!res)
48 {
49 /* First insertion in the hash. */
50 res = xstrdup (str);
51 if (!hash_insert (uniqstrs_table, res))
52 xalloc_die ();
53 }
54 return res;
55 }
56
57 uniqstr
58 uniqstr_vsprintf (char const *format, ...)
59 {
60 va_list args;
61 size_t length;
62 va_start (args, format);
63 length = vsnprintf (NULL, 0, format, args);
64 va_end (args);
65
66 char res[length + 1];
67 va_start (args, format);
68 vsprintf (res, format, args);
69 va_end (args);
70 return uniqstr_new (res);
71 }
72
73 /*------------------------------.
74 | Abort if S is not a uniqstr. |
75 `------------------------------*/
76
77 void
78 uniqstr_assert (char const *str)
79 {
80 if (!hash_lookup (uniqstrs_table, str))
81 {
82 error (0, 0,
83 "not a uniqstr: %s", quotearg (str));
84 abort ();
85 }
86 }
87
88
89 /*--------------------.
90 | Print the uniqstr. |
91 `--------------------*/
92
93 static inline bool
94 uniqstr_print (uniqstr ustr)
95 {
96 fprintf (stderr, "%s\n", ustr);
97 return true;
98 }
99
100 static bool
101 uniqstr_print_processor (void *ustr, void *null ATTRIBUTE_UNUSED)
102 {
103 return uniqstr_print (ustr);
104 }
105
106
107 int
108 uniqstr_cmp (uniqstr l, uniqstr r)
109 {
110 return (l == r ? 0
111 : !l ? -1
112 : !r ? +1
113 : strcmp (l, r));
114 }
115
116
117 /*-----------------------.
118 | A uniqstr hash table. |
119 `-----------------------*/
120
121 static bool
122 hash_compare_uniqstr (void const *m1, void const *m2)
123 {
124 return STREQ (m1, m2);
125 }
126
127 static size_t
128 hash_uniqstr (void const *m, size_t tablesize)
129 {
130 return hash_string (m, tablesize);
131 }
132
133
134 /*----------------------------.
135 | Create the uniqstrs table. |
136 `----------------------------*/
137
138 void
139 uniqstrs_new (void)
140 {
141 uniqstrs_table = hash_initialize (HT_INITIAL_CAPACITY,
142 NULL,
143 hash_uniqstr,
144 hash_compare_uniqstr,
145 free);
146 }
147
148
149 /*-------------------------------------.
150 | Perform a task on all the uniqstrs. |
151 `-------------------------------------*/
152
153 static void
154 uniqstrs_do (Hash_processor processor, void *processor_data)
155 {
156 hash_do_for_each (uniqstrs_table, processor, processor_data);
157 }
158
159
160 /*-----------------.
161 | Print them all. |
162 `-----------------*/
163
164 void
165 uniqstrs_print (void)
166 {
167 uniqstrs_do (uniqstr_print_processor, NULL);
168 }
169
170
171 /*--------------------.
172 | Free the uniqstrs. |
173 `--------------------*/
174
175 void
176 uniqstrs_free (void)
177 {
178 hash_free (uniqstrs_table);
179 }