tyname.c revision 1.51 1 1.51 rillig /* $NetBSD: tyname.c,v 1.51 2022/05/20 21:18:54 rillig Exp $ */
2 1.3 skrll
3 1.1 christos /*-
4 1.1 christos * Copyright (c) 2005 The NetBSD Foundation, Inc.
5 1.1 christos * All rights reserved.
6 1.1 christos *
7 1.1 christos * This code is derived from software contributed to The NetBSD Foundation
8 1.1 christos * by Christos Zoulas.
9 1.1 christos *
10 1.1 christos * Redistribution and use in source and binary forms, with or without
11 1.1 christos * modification, are permitted provided that the following conditions
12 1.1 christos * are met:
13 1.1 christos * 1. Redistributions of source code must retain the above copyright
14 1.1 christos * notice, this list of conditions and the following disclaimer.
15 1.1 christos * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 christos * notice, this list of conditions and the following disclaimer in the
17 1.1 christos * documentation and/or other materials provided with the distribution.
18 1.1 christos *
19 1.1 christos * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 christos * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 christos * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 christos * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 christos * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 christos * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 christos * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 christos * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 christos * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 christos * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 christos * POSSIBILITY OF SUCH DAMAGE.
30 1.1 christos */
31 1.1 christos
32 1.1 christos #if HAVE_NBTOOL_CONFIG_H
33 1.1 christos #include "nbtool_config.h"
34 1.1 christos #endif
35 1.1 christos
36 1.1 christos #include <sys/cdefs.h>
37 1.51 rillig #if defined(__RCSID)
38 1.51 rillig __RCSID("$NetBSD: tyname.c,v 1.51 2022/05/20 21:18:54 rillig Exp $");
39 1.1 christos #endif
40 1.1 christos
41 1.1 christos #include <limits.h>
42 1.8 christos #include <string.h>
43 1.1 christos #include <stdlib.h>
44 1.1 christos #include <err.h>
45 1.1 christos
46 1.39 rillig #if defined(IS_LINT1)
47 1.39 rillig #include "lint1.h"
48 1.39 rillig #else
49 1.39 rillig #include "lint2.h"
50 1.39 rillig #endif
51 1.1 christos
52 1.36 rillig #ifndef INTERNAL_ERROR
53 1.36 rillig #define INTERNAL_ERROR(fmt, args...) \
54 1.15 rillig do { \
55 1.15 rillig (void)warnx("%s, %d: " fmt, __FILE__, __LINE__, ##args); \
56 1.15 rillig abort(); \
57 1.40 rillig } while (false)
58 1.1 christos #endif
59 1.1 christos
60 1.20 rillig /* A tree of strings. */
61 1.20 rillig typedef struct name_tree_node {
62 1.44 rillig const char *ntn_name;
63 1.20 rillig struct name_tree_node *ntn_less;
64 1.20 rillig struct name_tree_node *ntn_greater;
65 1.20 rillig } name_tree_node;
66 1.20 rillig
67 1.20 rillig /* A growable string buffer. */
68 1.20 rillig typedef struct buffer {
69 1.20 rillig size_t len;
70 1.20 rillig size_t cap;
71 1.20 rillig char * data;
72 1.20 rillig } buffer;
73 1.20 rillig
74 1.20 rillig static name_tree_node *type_names;
75 1.20 rillig
76 1.20 rillig static name_tree_node *
77 1.20 rillig new_name_tree_node(const char *name)
78 1.20 rillig {
79 1.20 rillig name_tree_node *n;
80 1.20 rillig
81 1.37 rillig n = xmalloc(sizeof(*n));
82 1.20 rillig n->ntn_name = xstrdup(name);
83 1.20 rillig n->ntn_less = NULL;
84 1.20 rillig n->ntn_greater = NULL;
85 1.20 rillig return n;
86 1.20 rillig }
87 1.20 rillig
88 1.44 rillig /* Return the canonical instance of the string, with unlimited lifetime. */
89 1.26 rillig static const char *
90 1.20 rillig intern(const char *name)
91 1.20 rillig {
92 1.25 rillig name_tree_node *n = type_names, **next;
93 1.20 rillig int cmp;
94 1.20 rillig
95 1.20 rillig if (n == NULL) {
96 1.20 rillig n = new_name_tree_node(name);
97 1.20 rillig type_names = n;
98 1.20 rillig return n->ntn_name;
99 1.20 rillig }
100 1.20 rillig
101 1.20 rillig while ((cmp = strcmp(name, n->ntn_name)) != 0) {
102 1.25 rillig next = cmp < 0 ? &n->ntn_less : &n->ntn_greater;
103 1.25 rillig if (*next == NULL) {
104 1.25 rillig *next = new_name_tree_node(name);
105 1.25 rillig return (*next)->ntn_name;
106 1.20 rillig }
107 1.25 rillig n = *next;
108 1.20 rillig }
109 1.20 rillig return n->ntn_name;
110 1.20 rillig }
111 1.20 rillig
112 1.20 rillig static void
113 1.20 rillig buf_init(buffer *buf)
114 1.20 rillig {
115 1.20 rillig buf->len = 0;
116 1.20 rillig buf->cap = 128;
117 1.20 rillig buf->data = xmalloc(buf->cap);
118 1.20 rillig buf->data[0] = '\0';
119 1.20 rillig }
120 1.20 rillig
121 1.20 rillig static void
122 1.20 rillig buf_done(buffer *buf)
123 1.20 rillig {
124 1.20 rillig free(buf->data);
125 1.20 rillig }
126 1.20 rillig
127 1.20 rillig static void
128 1.20 rillig buf_add(buffer *buf, const char *s)
129 1.20 rillig {
130 1.20 rillig size_t len = strlen(s);
131 1.20 rillig
132 1.20 rillig while (buf->len + len + 1 >= buf->cap) {
133 1.20 rillig buf->data = xrealloc(buf->data, 2 * buf->cap);
134 1.20 rillig buf->cap = 2 * buf->cap;
135 1.20 rillig }
136 1.20 rillig
137 1.20 rillig memcpy(buf->data + buf->len, s, len + 1);
138 1.20 rillig buf->len += len;
139 1.20 rillig }
140 1.20 rillig
141 1.20 rillig static void
142 1.20 rillig buf_add_int(buffer *buf, int n)
143 1.20 rillig {
144 1.37 rillig char num[1 + sizeof(n) * CHAR_BIT + 1];
145 1.20 rillig
146 1.45 rillig (void)snprintf(num, sizeof(num), "%d", n);
147 1.20 rillig buf_add(buf, num);
148 1.20 rillig }
149 1.20 rillig
150 1.1 christos const char *
151 1.18 rillig tspec_name(tspec_t t)
152 1.1 christos {
153 1.49 rillig const char *name = ttab[t].tt_name;
154 1.48 rillig if (name == NULL)
155 1.36 rillig INTERNAL_ERROR("tspec_name(%d)", t);
156 1.48 rillig return name;
157 1.1 christos }
158 1.1 christos
159 1.21 rillig static void
160 1.21 rillig type_name_of_function(buffer *buf, const type_t *tp)
161 1.21 rillig {
162 1.21 rillig const char *sep = "";
163 1.21 rillig
164 1.21 rillig buf_add(buf, "(");
165 1.21 rillig if (tp->t_proto) {
166 1.50 rillig #ifdef IS_LINT1
167 1.21 rillig sym_t *arg;
168 1.21 rillig
169 1.42 rillig arg = tp->t_args;
170 1.42 rillig if (arg == NULL)
171 1.42 rillig buf_add(buf, "void");
172 1.42 rillig for (; arg != NULL; arg = arg->s_next) {
173 1.21 rillig buf_add(buf, sep), sep = ", ";
174 1.21 rillig buf_add(buf, type_name(arg->s_type));
175 1.21 rillig }
176 1.50 rillig #else
177 1.21 rillig type_t **argtype;
178 1.21 rillig
179 1.42 rillig argtype = tp->t_args;
180 1.42 rillig if (argtype == NULL)
181 1.42 rillig buf_add(buf, "void");
182 1.42 rillig for (; *argtype != NULL; argtype++) {
183 1.21 rillig buf_add(buf, sep), sep = ", ";
184 1.21 rillig buf_add(buf, type_name(*argtype));
185 1.21 rillig }
186 1.21 rillig #endif
187 1.21 rillig }
188 1.21 rillig if (tp->t_vararg) {
189 1.22 rillig buf_add(buf, sep);
190 1.21 rillig buf_add(buf, "...");
191 1.21 rillig }
192 1.21 rillig buf_add(buf, ") returning ");
193 1.21 rillig buf_add(buf, type_name(tp->t_subt));
194 1.21 rillig }
195 1.21 rillig
196 1.32 rillig static void
197 1.32 rillig type_name_of_struct_or_union(buffer *buf, const type_t *tp)
198 1.32 rillig {
199 1.32 rillig buf_add(buf, " ");
200 1.50 rillig #ifdef IS_LINT1
201 1.32 rillig if (tp->t_str->sou_tag->s_name == unnamed &&
202 1.32 rillig tp->t_str->sou_first_typedef != NULL) {
203 1.32 rillig buf_add(buf, "typedef ");
204 1.32 rillig buf_add(buf, tp->t_str->sou_first_typedef->s_name);
205 1.32 rillig } else {
206 1.32 rillig buf_add(buf, tp->t_str->sou_tag->s_name);
207 1.32 rillig }
208 1.32 rillig #else
209 1.32 rillig buf_add(buf, tp->t_isuniqpos ? "*anonymous*" : tp->t_tag->h_name);
210 1.32 rillig #endif
211 1.32 rillig }
212 1.32 rillig
213 1.32 rillig static void
214 1.32 rillig type_name_of_enum(buffer *buf, const type_t *tp)
215 1.32 rillig {
216 1.32 rillig buf_add(buf, " ");
217 1.50 rillig #ifdef IS_LINT1
218 1.32 rillig if (tp->t_enum->en_tag->s_name == unnamed &&
219 1.32 rillig tp->t_enum->en_first_typedef != NULL) {
220 1.32 rillig buf_add(buf, "typedef ");
221 1.32 rillig buf_add(buf, tp->t_enum->en_first_typedef->s_name);
222 1.32 rillig } else {
223 1.32 rillig buf_add(buf, tp->t_enum->en_tag->s_name);
224 1.32 rillig }
225 1.32 rillig #else
226 1.32 rillig buf_add(buf, tp->t_isuniqpos ? "*anonymous*" : tp->t_tag->h_name);
227 1.32 rillig #endif
228 1.32 rillig }
229 1.32 rillig
230 1.33 rillig static void
231 1.33 rillig type_name_of_array(buffer *buf, const type_t *tp)
232 1.33 rillig {
233 1.33 rillig buf_add(buf, "[");
234 1.50 rillig #ifdef IS_LINT1
235 1.33 rillig if (tp->t_incomplete_array)
236 1.33 rillig buf_add(buf, "unknown_size");
237 1.33 rillig else
238 1.33 rillig buf_add_int(buf, tp->t_dim);
239 1.33 rillig #else
240 1.33 rillig buf_add_int(buf, tp->t_dim);
241 1.33 rillig #endif
242 1.33 rillig buf_add(buf, "]");
243 1.34 rillig buf_add(buf, " of ");
244 1.34 rillig buf_add(buf, type_name(tp->t_subt));
245 1.33 rillig }
246 1.33 rillig
247 1.1 christos const char *
248 1.20 rillig type_name(const type_t *tp)
249 1.1 christos {
250 1.20 rillig tspec_t t;
251 1.20 rillig buffer buf;
252 1.20 rillig const char *name;
253 1.1 christos
254 1.11 christos if (tp == NULL)
255 1.11 christos return "(null)";
256 1.20 rillig
257 1.29 rillig if ((t = tp->t_tspec) == INT && tp->t_is_enum)
258 1.1 christos t = ENUM;
259 1.1 christos
260 1.20 rillig buf_init(&buf);
261 1.8 christos if (tp->t_const)
262 1.20 rillig buf_add(&buf, "const ");
263 1.8 christos if (tp->t_volatile)
264 1.20 rillig buf_add(&buf, "volatile ");
265 1.32 rillig
266 1.50 rillig #ifdef IS_LINT1
267 1.38 rillig if ((t == STRUCT || t == UNION) && tp->t_str->sou_incomplete)
268 1.38 rillig buf_add(&buf, "incomplete ");
269 1.38 rillig #endif
270 1.20 rillig buf_add(&buf, tspec_name(t));
271 1.1 christos
272 1.1 christos switch (t) {
273 1.1 christos case PTR:
274 1.20 rillig buf_add(&buf, " to ");
275 1.20 rillig buf_add(&buf, type_name(tp->t_subt));
276 1.1 christos break;
277 1.1 christos case ENUM:
278 1.32 rillig type_name_of_enum(&buf, tp);
279 1.1 christos break;
280 1.1 christos case STRUCT:
281 1.1 christos case UNION:
282 1.32 rillig type_name_of_struct_or_union(&buf, tp);
283 1.1 christos break;
284 1.1 christos case ARRAY:
285 1.33 rillig type_name_of_array(&buf, tp);
286 1.1 christos break;
287 1.21 rillig case FUNC:
288 1.21 rillig type_name_of_function(&buf, tp);
289 1.21 rillig break;
290 1.1 christos default:
291 1.46 rillig break;
292 1.1 christos }
293 1.20 rillig
294 1.20 rillig name = intern(buf.data);
295 1.20 rillig buf_done(&buf);
296 1.20 rillig return name;
297 1.1 christos }
298