tyname.c revision 1.59 1 1.59 rillig /* $NetBSD: tyname.c,v 1.59 2024/02/01 18:37:06 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.59 rillig __RCSID("$NetBSD: tyname.c,v 1.59 2024/02/01 18:37:06 rillig Exp $");
39 1.1 christos #endif
40 1.1 christos
41 1.54 rillig #include <assert.h>
42 1.1 christos #include <limits.h>
43 1.8 christos #include <string.h>
44 1.1 christos #include <stdlib.h>
45 1.1 christos
46 1.58 rillig #if 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.20 rillig /* A tree of strings. */
53 1.20 rillig typedef struct name_tree_node {
54 1.44 rillig const char *ntn_name;
55 1.20 rillig struct name_tree_node *ntn_less;
56 1.20 rillig struct name_tree_node *ntn_greater;
57 1.20 rillig } name_tree_node;
58 1.20 rillig
59 1.20 rillig static name_tree_node *type_names;
60 1.20 rillig
61 1.20 rillig static name_tree_node *
62 1.20 rillig new_name_tree_node(const char *name)
63 1.20 rillig {
64 1.20 rillig name_tree_node *n;
65 1.20 rillig
66 1.37 rillig n = xmalloc(sizeof(*n));
67 1.20 rillig n->ntn_name = xstrdup(name);
68 1.20 rillig n->ntn_less = NULL;
69 1.20 rillig n->ntn_greater = NULL;
70 1.20 rillig return n;
71 1.20 rillig }
72 1.20 rillig
73 1.44 rillig /* Return the canonical instance of the string, with unlimited lifetime. */
74 1.26 rillig static const char *
75 1.20 rillig intern(const char *name)
76 1.20 rillig {
77 1.25 rillig name_tree_node *n = type_names, **next;
78 1.20 rillig int cmp;
79 1.20 rillig
80 1.20 rillig if (n == NULL) {
81 1.20 rillig n = new_name_tree_node(name);
82 1.20 rillig type_names = n;
83 1.20 rillig return n->ntn_name;
84 1.20 rillig }
85 1.20 rillig
86 1.20 rillig while ((cmp = strcmp(name, n->ntn_name)) != 0) {
87 1.25 rillig next = cmp < 0 ? &n->ntn_less : &n->ntn_greater;
88 1.25 rillig if (*next == NULL) {
89 1.25 rillig *next = new_name_tree_node(name);
90 1.25 rillig return (*next)->ntn_name;
91 1.20 rillig }
92 1.25 rillig n = *next;
93 1.20 rillig }
94 1.20 rillig return n->ntn_name;
95 1.20 rillig }
96 1.20 rillig
97 1.20 rillig static void
98 1.20 rillig buf_init(buffer *buf)
99 1.20 rillig {
100 1.20 rillig buf->len = 0;
101 1.20 rillig buf->cap = 128;
102 1.20 rillig buf->data = xmalloc(buf->cap);
103 1.20 rillig buf->data[0] = '\0';
104 1.20 rillig }
105 1.20 rillig
106 1.20 rillig static void
107 1.20 rillig buf_done(buffer *buf)
108 1.20 rillig {
109 1.20 rillig free(buf->data);
110 1.20 rillig }
111 1.20 rillig
112 1.20 rillig static void
113 1.20 rillig buf_add(buffer *buf, const char *s)
114 1.20 rillig {
115 1.20 rillig size_t len = strlen(s);
116 1.20 rillig
117 1.20 rillig while (buf->len + len + 1 >= buf->cap) {
118 1.20 rillig buf->data = xrealloc(buf->data, 2 * buf->cap);
119 1.20 rillig buf->cap = 2 * buf->cap;
120 1.20 rillig }
121 1.20 rillig
122 1.20 rillig memcpy(buf->data + buf->len, s, len + 1);
123 1.20 rillig buf->len += len;
124 1.20 rillig }
125 1.20 rillig
126 1.20 rillig static void
127 1.20 rillig buf_add_int(buffer *buf, int n)
128 1.20 rillig {
129 1.37 rillig char num[1 + sizeof(n) * CHAR_BIT + 1];
130 1.20 rillig
131 1.45 rillig (void)snprintf(num, sizeof(num), "%d", n);
132 1.20 rillig buf_add(buf, num);
133 1.20 rillig }
134 1.20 rillig
135 1.1 christos const char *
136 1.18 rillig tspec_name(tspec_t t)
137 1.1 christos {
138 1.49 rillig const char *name = ttab[t].tt_name;
139 1.54 rillig assert(name != NULL);
140 1.48 rillig return name;
141 1.1 christos }
142 1.1 christos
143 1.21 rillig static void
144 1.21 rillig type_name_of_function(buffer *buf, const type_t *tp)
145 1.21 rillig {
146 1.21 rillig const char *sep = "";
147 1.21 rillig
148 1.21 rillig buf_add(buf, "(");
149 1.21 rillig if (tp->t_proto) {
150 1.58 rillig #if IS_LINT1
151 1.57 rillig const sym_t *param = tp->t_params;
152 1.57 rillig if (param == NULL)
153 1.42 rillig buf_add(buf, "void");
154 1.57 rillig for (; param != NULL; param = param->s_next) {
155 1.21 rillig buf_add(buf, sep), sep = ", ";
156 1.57 rillig buf_add(buf, type_name(param->s_type));
157 1.21 rillig }
158 1.50 rillig #else
159 1.21 rillig type_t **argtype;
160 1.21 rillig
161 1.42 rillig argtype = tp->t_args;
162 1.42 rillig if (argtype == NULL)
163 1.42 rillig buf_add(buf, "void");
164 1.42 rillig for (; *argtype != NULL; argtype++) {
165 1.21 rillig buf_add(buf, sep), sep = ", ";
166 1.21 rillig buf_add(buf, type_name(*argtype));
167 1.21 rillig }
168 1.21 rillig #endif
169 1.21 rillig }
170 1.21 rillig if (tp->t_vararg) {
171 1.22 rillig buf_add(buf, sep);
172 1.21 rillig buf_add(buf, "...");
173 1.21 rillig }
174 1.21 rillig buf_add(buf, ") returning ");
175 1.21 rillig buf_add(buf, type_name(tp->t_subt));
176 1.21 rillig }
177 1.21 rillig
178 1.32 rillig static void
179 1.32 rillig type_name_of_struct_or_union(buffer *buf, const type_t *tp)
180 1.32 rillig {
181 1.32 rillig buf_add(buf, " ");
182 1.58 rillig #if IS_LINT1
183 1.55 rillig if (tp->t_sou->sou_tag->s_name == unnamed &&
184 1.55 rillig tp->t_sou->sou_first_typedef != NULL) {
185 1.32 rillig buf_add(buf, "typedef ");
186 1.55 rillig buf_add(buf, tp->t_sou->sou_first_typedef->s_name);
187 1.32 rillig } else {
188 1.55 rillig buf_add(buf, tp->t_sou->sou_tag->s_name);
189 1.32 rillig }
190 1.32 rillig #else
191 1.32 rillig buf_add(buf, tp->t_isuniqpos ? "*anonymous*" : tp->t_tag->h_name);
192 1.32 rillig #endif
193 1.32 rillig }
194 1.32 rillig
195 1.32 rillig static void
196 1.32 rillig type_name_of_enum(buffer *buf, const type_t *tp)
197 1.32 rillig {
198 1.32 rillig buf_add(buf, " ");
199 1.58 rillig #if IS_LINT1
200 1.32 rillig if (tp->t_enum->en_tag->s_name == unnamed &&
201 1.32 rillig tp->t_enum->en_first_typedef != NULL) {
202 1.32 rillig buf_add(buf, "typedef ");
203 1.32 rillig buf_add(buf, tp->t_enum->en_first_typedef->s_name);
204 1.32 rillig } else {
205 1.32 rillig buf_add(buf, tp->t_enum->en_tag->s_name);
206 1.32 rillig }
207 1.32 rillig #else
208 1.32 rillig buf_add(buf, tp->t_isuniqpos ? "*anonymous*" : tp->t_tag->h_name);
209 1.32 rillig #endif
210 1.32 rillig }
211 1.32 rillig
212 1.33 rillig static void
213 1.33 rillig type_name_of_array(buffer *buf, const type_t *tp)
214 1.33 rillig {
215 1.33 rillig buf_add(buf, "[");
216 1.58 rillig #if IS_LINT1
217 1.33 rillig if (tp->t_incomplete_array)
218 1.33 rillig buf_add(buf, "unknown_size");
219 1.33 rillig else
220 1.33 rillig buf_add_int(buf, tp->t_dim);
221 1.33 rillig #else
222 1.33 rillig buf_add_int(buf, tp->t_dim);
223 1.33 rillig #endif
224 1.33 rillig buf_add(buf, "]");
225 1.34 rillig buf_add(buf, " of ");
226 1.34 rillig buf_add(buf, type_name(tp->t_subt));
227 1.33 rillig }
228 1.33 rillig
229 1.1 christos const char *
230 1.20 rillig type_name(const type_t *tp)
231 1.1 christos {
232 1.20 rillig tspec_t t;
233 1.20 rillig buffer buf;
234 1.20 rillig const char *name;
235 1.1 christos
236 1.11 christos if (tp == NULL)
237 1.11 christos return "(null)";
238 1.20 rillig
239 1.29 rillig if ((t = tp->t_tspec) == INT && tp->t_is_enum)
240 1.1 christos t = ENUM;
241 1.1 christos
242 1.20 rillig buf_init(&buf);
243 1.8 christos if (tp->t_const)
244 1.20 rillig buf_add(&buf, "const ");
245 1.8 christos if (tp->t_volatile)
246 1.20 rillig buf_add(&buf, "volatile ");
247 1.32 rillig
248 1.58 rillig #if IS_LINT1
249 1.55 rillig if (is_struct_or_union(t) && tp->t_sou->sou_incomplete)
250 1.38 rillig buf_add(&buf, "incomplete ");
251 1.38 rillig #endif
252 1.20 rillig buf_add(&buf, tspec_name(t));
253 1.1 christos
254 1.58 rillig #if IS_LINT1
255 1.53 rillig if (tp->t_bitfield) {
256 1.53 rillig buf_add(&buf, ":");
257 1.56 rillig buf_add_int(&buf, (int)tp->t_bit_field_width);
258 1.53 rillig }
259 1.53 rillig #endif
260 1.53 rillig
261 1.1 christos switch (t) {
262 1.1 christos case PTR:
263 1.20 rillig buf_add(&buf, " to ");
264 1.20 rillig buf_add(&buf, type_name(tp->t_subt));
265 1.1 christos break;
266 1.1 christos case ENUM:
267 1.32 rillig type_name_of_enum(&buf, tp);
268 1.1 christos break;
269 1.1 christos case STRUCT:
270 1.1 christos case UNION:
271 1.32 rillig type_name_of_struct_or_union(&buf, tp);
272 1.1 christos break;
273 1.1 christos case ARRAY:
274 1.33 rillig type_name_of_array(&buf, tp);
275 1.1 christos break;
276 1.21 rillig case FUNC:
277 1.21 rillig type_name_of_function(&buf, tp);
278 1.21 rillig break;
279 1.1 christos default:
280 1.46 rillig break;
281 1.1 christos }
282 1.20 rillig
283 1.20 rillig name = intern(buf.data);
284 1.20 rillig buf_done(&buf);
285 1.20 rillig return name;
286 1.1 christos }
287