lex.c revision 1.62 1 1.62 rillig /* $NetBSD: lex.c,v 1.62 2021/08/01 08:03:43 rillig Exp $ */
2 1.1 rillig
3 1.1 rillig /*
4 1.1 rillig * Copyright (c) 1996 Christopher G. Demetriou. All Rights Reserved.
5 1.1 rillig * Copyright (c) 1994, 1995 Jochen Pohl
6 1.1 rillig * All Rights Reserved.
7 1.1 rillig *
8 1.1 rillig * Redistribution and use in source and binary forms, with or without
9 1.1 rillig * modification, are permitted provided that the following conditions
10 1.1 rillig * are met:
11 1.1 rillig * 1. Redistributions of source code must retain the above copyright
12 1.1 rillig * notice, this list of conditions and the following disclaimer.
13 1.1 rillig * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 rillig * notice, this list of conditions and the following disclaimer in the
15 1.1 rillig * documentation and/or other materials provided with the distribution.
16 1.1 rillig * 3. All advertising materials mentioning features or use of this software
17 1.1 rillig * must display the following acknowledgement:
18 1.1 rillig * This product includes software developed by Jochen Pohl for
19 1.1 rillig * The NetBSD Project.
20 1.1 rillig * 4. The name of the author may not be used to endorse or promote products
21 1.1 rillig * derived from this software without specific prior written permission.
22 1.1 rillig *
23 1.1 rillig * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 1.1 rillig * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 1.1 rillig * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 1.1 rillig * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 1.1 rillig * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 1.1 rillig * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 1.1 rillig * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 1.1 rillig * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 1.1 rillig * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 1.1 rillig * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 1.1 rillig */
34 1.1 rillig
35 1.4 christos #if HAVE_NBTOOL_CONFIG_H
36 1.4 christos #include "nbtool_config.h"
37 1.4 christos #endif
38 1.4 christos
39 1.1 rillig #include <sys/cdefs.h>
40 1.1 rillig #if defined(__RCSID) && !defined(lint)
41 1.62 rillig __RCSID("$NetBSD: lex.c,v 1.62 2021/08/01 08:03:43 rillig Exp $");
42 1.1 rillig #endif
43 1.1 rillig
44 1.1 rillig #include <ctype.h>
45 1.1 rillig #include <errno.h>
46 1.1 rillig #include <float.h>
47 1.1 rillig #include <limits.h>
48 1.1 rillig #include <math.h>
49 1.1 rillig #include <stdlib.h>
50 1.1 rillig #include <string.h>
51 1.1 rillig
52 1.1 rillig #include "lint1.h"
53 1.1 rillig #include "cgram.h"
54 1.1 rillig
55 1.1 rillig #define CHAR_MASK ((int)(~(~0U << CHAR_SIZE)))
56 1.1 rillig
57 1.1 rillig
58 1.1 rillig /* Current position (it's also updated when an included file is parsed) */
59 1.23 rillig pos_t curr_pos = { "", 1, 0 };
60 1.1 rillig
61 1.1 rillig /*
62 1.1 rillig * Current position in C source (not updated when an included file is
63 1.1 rillig * parsed).
64 1.1 rillig */
65 1.23 rillig pos_t csrc_pos = { "", 1, 0 };
66 1.1 rillig
67 1.1 rillig /* Are we parsing a gcc attribute? */
68 1.1 rillig bool attron;
69 1.1 rillig
70 1.1 rillig bool in_system_header = false;
71 1.1 rillig
72 1.1 rillig static sbuf_t *allocsb(void);
73 1.1 rillig static void freesb(sbuf_t *);
74 1.1 rillig static int inpc(void);
75 1.1 rillig static int hash(const char *);
76 1.1 rillig static sym_t * search(sbuf_t *);
77 1.1 rillig static int keyw(sym_t *);
78 1.6 rillig static int get_escaped_char(int);
79 1.1 rillig
80 1.1 rillig void
81 1.6 rillig lex_next_line(void)
82 1.1 rillig {
83 1.1 rillig curr_pos.p_line++;
84 1.1 rillig curr_pos.p_uniq = 0;
85 1.58 rillig debug_step("parsing %s:%d", curr_pos.p_file, curr_pos.p_line);
86 1.1 rillig if (curr_pos.p_file == csrc_pos.p_file) {
87 1.1 rillig csrc_pos.p_line++;
88 1.1 rillig csrc_pos.p_uniq = 0;
89 1.1 rillig }
90 1.1 rillig }
91 1.1 rillig
92 1.1 rillig void
93 1.6 rillig lex_unknown_character(int c)
94 1.1 rillig {
95 1.1 rillig
96 1.1 rillig /* unknown character \%o */
97 1.1 rillig error(250, c);
98 1.1 rillig }
99 1.1 rillig
100 1.13 rillig #define kwdef(name, token, scl, tspec, tqual, c89, c99, gcc, attr, deco) \
101 1.13 rillig { \
102 1.13 rillig name, token, scl, tspec, tqual, \
103 1.13 rillig (c89) > 0, (c99) > 0, (gcc) > 0, (attr) > 0, deco, \
104 1.13 rillig }
105 1.13 rillig #define kwdef_token(name, token, c89, c99, gcc, attr, deco) \
106 1.13 rillig kwdef(name, token, 0, 0, 0, c89, c99, gcc, attr, deco)
107 1.13 rillig #define kwdef_sclass(name, sclass, c89, c99, gcc, attr, deco) \
108 1.13 rillig kwdef(name, T_SCLASS, sclass, 0, 0, c89, c99, gcc, attr, deco)
109 1.13 rillig #define kwdef_type(name, tspec, c89, c99, gcc, attr, deco) \
110 1.13 rillig kwdef(name, T_TYPE, 0, tspec, 0, c89, c99, gcc, attr, deco)
111 1.13 rillig #define kwdef_tqual(name, tqual, c89, c99, gcc, attr, deco) \
112 1.13 rillig kwdef(name, T_QUAL, 0, 0, tqual, c89, c99, gcc, attr, deco)
113 1.35 rillig #define kwdef_keyword(name, token) \
114 1.35 rillig kwdef(name, token, 0, 0, 0, 0, 0, 0, 0, 1)
115 1.34 rillig #define kwdef_gcc_attr(name, token) \
116 1.34 rillig kwdef(name, token, 0, 0, 0, 0, 0, 1, 1, 5)
117 1.13 rillig
118 1.1 rillig /*
119 1.1 rillig * Keywords.
120 1.9 rillig * During initialization they are written to the symbol table.
121 1.1 rillig */
122 1.1 rillig static struct kwtab {
123 1.1 rillig const char *kw_name; /* keyword */
124 1.1 rillig int kw_token; /* token returned by yylex() */
125 1.1 rillig scl_t kw_scl; /* storage class if kw_token T_SCLASS */
126 1.1 rillig tspec_t kw_tspec; /* type spec. if kw_token
127 1.1 rillig * T_TYPE or T_STRUCT_OR_UNION */
128 1.13 rillig tqual_t kw_tqual; /* type qual. if kw_token T_QUAL */
129 1.1 rillig bool kw_c89 : 1; /* C89 keyword */
130 1.1 rillig bool kw_c99 : 1; /* C99 keyword */
131 1.1 rillig bool kw_gcc : 1; /* GCC keyword */
132 1.1 rillig bool kw_attr : 1; /* GCC attribute, keyword */
133 1.1 rillig u_int kw_deco : 3; /* 1 = name, 2 = __name, 4 = __name__ */
134 1.1 rillig } kwtab[] = {
135 1.56 rillig kwdef_gcc_attr( "alias", T_AT_ALIAS),
136 1.35 rillig kwdef_keyword( "_Alignas", T_ALIGNAS),
137 1.35 rillig kwdef_keyword( "_Alignof", T_ALIGNOF),
138 1.34 rillig kwdef_gcc_attr( "aligned", T_AT_ALIGNED),
139 1.56 rillig kwdef_token( "__alignof__", T_ALIGNOF, 0,0,0,0,1),
140 1.34 rillig kwdef_gcc_attr( "alloc_size", T_AT_ALLOC_SIZE),
141 1.34 rillig kwdef_gcc_attr( "always_inline",T_AT_ALWAYS_INLINE),
142 1.13 rillig kwdef_token( "asm", T_ASM, 0,0,1,0,7),
143 1.13 rillig kwdef_token( "attribute", T_ATTRIBUTE, 0,0,1,0,6),
144 1.13 rillig kwdef_sclass( "auto", AUTO, 0,0,0,0,1),
145 1.56 rillig kwdef_type( "_Bool", BOOL, 0,1,0,0,1),
146 1.34 rillig kwdef_gcc_attr( "bounded", T_AT_BOUNDED),
147 1.35 rillig kwdef_keyword( "break", T_BREAK),
148 1.34 rillig kwdef_gcc_attr( "buffer", T_AT_BUFFER),
149 1.56 rillig kwdef_token( "__builtin_offsetof", T_BUILTIN_OFFSETOF, 0,0,1,0,1),
150 1.35 rillig kwdef_keyword( "case", T_CASE),
151 1.13 rillig kwdef_type( "char", CHAR, 0,0,0,0,1),
152 1.34 rillig kwdef_gcc_attr( "cold", T_AT_COLD),
153 1.34 rillig kwdef_gcc_attr( "common", T_AT_COMMON),
154 1.56 rillig kwdef_type( "_Complex", COMPLEX, 0,1,0,0,1),
155 1.13 rillig kwdef_tqual( "const", CONST, 1,0,0,0,7),
156 1.34 rillig kwdef_gcc_attr( "constructor", T_AT_CONSTRUCTOR),
157 1.35 rillig kwdef_keyword( "continue", T_CONTINUE),
158 1.35 rillig kwdef_keyword( "default", T_DEFAULT),
159 1.34 rillig kwdef_gcc_attr( "deprecated", T_AT_DEPRECATED),
160 1.34 rillig kwdef_gcc_attr( "destructor", T_AT_DESTRUCTOR),
161 1.35 rillig kwdef_keyword( "do", T_DO),
162 1.13 rillig kwdef_type( "double", DOUBLE, 0,0,0,0,1),
163 1.35 rillig kwdef_keyword( "else", T_ELSE),
164 1.35 rillig kwdef_keyword( "enum", T_ENUM),
165 1.56 rillig kwdef_token( "__extension__",T_EXTENSION, 0,0,1,0,1),
166 1.13 rillig kwdef_sclass( "extern", EXTERN, 0,0,0,0,1),
167 1.34 rillig kwdef_gcc_attr( "fallthrough", T_AT_FALLTHROUGH),
168 1.13 rillig kwdef_type( "float", FLOAT, 0,0,0,0,1),
169 1.35 rillig kwdef_keyword( "for", T_FOR),
170 1.34 rillig kwdef_gcc_attr( "format", T_AT_FORMAT),
171 1.34 rillig kwdef_gcc_attr( "format_arg", T_AT_FORMAT_ARG),
172 1.56 rillig kwdef_token( "_Generic", T_GENERIC, 0,1,0,0,1),
173 1.34 rillig kwdef_gcc_attr( "gnu_inline", T_AT_GNU_INLINE),
174 1.34 rillig kwdef_gcc_attr( "gnu_printf", T_AT_FORMAT_GNU_PRINTF),
175 1.35 rillig kwdef_keyword( "goto", T_GOTO),
176 1.55 rillig kwdef_gcc_attr( "hot", T_AT_HOT),
177 1.35 rillig kwdef_keyword( "if", T_IF),
178 1.56 rillig kwdef_token( "__imag__", T_IMAG, 0,0,1,0,1),
179 1.13 rillig kwdef_sclass( "inline", INLINE, 0,1,0,0,7),
180 1.13 rillig kwdef_type( "int", INT, 0,0,0,0,1),
181 1.56 rillig #ifdef INT128_SIZE
182 1.56 rillig kwdef_type( "__int128_t", INT128, 0,1,0,0,1),
183 1.56 rillig #endif
184 1.13 rillig kwdef_type( "long", LONG, 0,0,0,0,1),
185 1.34 rillig kwdef_gcc_attr( "malloc", T_AT_MALLOC),
186 1.34 rillig kwdef_gcc_attr( "may_alias", T_AT_MAY_ALIAS),
187 1.34 rillig kwdef_gcc_attr( "minbytes", T_AT_MINBYTES),
188 1.34 rillig kwdef_gcc_attr( "mode", T_AT_MODE),
189 1.34 rillig kwdef_gcc_attr("no_instrument_function",
190 1.34 rillig T_AT_NO_INSTRUMENT_FUNCTION),
191 1.34 rillig kwdef_gcc_attr( "noinline", T_AT_NOINLINE),
192 1.34 rillig kwdef_gcc_attr( "nonnull", T_AT_NONNULL),
193 1.34 rillig kwdef_gcc_attr( "nonstring", T_AT_NONSTRING),
194 1.56 rillig kwdef_token( "_Noreturn", T_NORETURN, 0,1,0,0,1),
195 1.34 rillig kwdef_gcc_attr( "noreturn", T_AT_NORETURN),
196 1.34 rillig kwdef_gcc_attr( "nothrow", T_AT_NOTHROW),
197 1.34 rillig kwdef_gcc_attr( "optimize", T_AT_OPTIMIZE),
198 1.34 rillig kwdef_gcc_attr( "packed", T_AT_PACKED),
199 1.56 rillig kwdef_token( "__packed", T_PACKED, 0,0,0,0,1),
200 1.34 rillig kwdef_gcc_attr( "pcs", T_AT_PCS),
201 1.34 rillig kwdef_gcc_attr( "printf", T_AT_FORMAT_PRINTF),
202 1.34 rillig kwdef_gcc_attr( "pure", T_AT_PURE),
203 1.56 rillig kwdef_token( "__real__", T_REAL, 0,0,1,0,1),
204 1.13 rillig kwdef_sclass( "register", REG, 0,0,0,0,1),
205 1.13 rillig kwdef_tqual( "restrict", RESTRICT, 0,1,0,0,5),
206 1.35 rillig kwdef_keyword( "return", T_RETURN),
207 1.34 rillig kwdef_gcc_attr( "returns_twice",T_AT_RETURNS_TWICE),
208 1.34 rillig kwdef_gcc_attr( "scanf", T_AT_FORMAT_SCANF),
209 1.13 rillig kwdef_token( "section", T_AT_SECTION, 0,0,1,1,7),
210 1.34 rillig kwdef_gcc_attr( "sentinel", T_AT_SENTINEL),
211 1.13 rillig kwdef_type( "short", SHORT, 0,0,0,0,1),
212 1.13 rillig kwdef_type( "signed", SIGNED, 1,0,0,0,3),
213 1.35 rillig kwdef_keyword( "sizeof", T_SIZEOF),
214 1.13 rillig kwdef_sclass( "static", STATIC, 0,0,0,0,1),
215 1.34 rillig kwdef_gcc_attr( "strfmon", T_AT_FORMAT_STRFMON),
216 1.34 rillig kwdef_gcc_attr( "strftime", T_AT_FORMAT_STRFTIME),
217 1.34 rillig kwdef_gcc_attr( "string", T_AT_STRING),
218 1.13 rillig kwdef("struct", T_STRUCT_OR_UNION, 0, STRUCT, 0, 0,0,0,0,1),
219 1.35 rillig kwdef_keyword( "switch", T_SWITCH),
220 1.56 rillig kwdef_token( "__symbolrename", T_SYMBOLRENAME, 0,0,0,0,1),
221 1.34 rillig kwdef_gcc_attr( "syslog", T_AT_FORMAT_SYSLOG),
222 1.56 rillig kwdef_tqual( "__thread", THREAD, 0,0,1,0,1),
223 1.56 rillig kwdef_tqual( "_Thread_local", THREAD, 0,1,0,0,1),
224 1.56 rillig kwdef_gcc_attr( "tls_model", T_AT_TLS_MODEL),
225 1.34 rillig kwdef_gcc_attr( "transparent_union", T_AT_TUNION),
226 1.13 rillig kwdef_sclass( "typedef", TYPEDEF, 0,0,0,0,1),
227 1.13 rillig kwdef_token( "typeof", T_TYPEOF, 0,0,1,0,7),
228 1.56 rillig #ifdef INT128_SIZE
229 1.56 rillig kwdef_type( "__uint128_t", UINT128, 0,1,0,0,1),
230 1.56 rillig #endif
231 1.13 rillig kwdef("union", T_STRUCT_OR_UNION, 0, UNION, 0, 0,0,0,0,1),
232 1.13 rillig kwdef_type( "unsigned", UNSIGN, 0,0,0,0,1),
233 1.34 rillig kwdef_gcc_attr( "unused", T_AT_UNUSED),
234 1.34 rillig kwdef_gcc_attr( "used", T_AT_USED),
235 1.34 rillig kwdef_gcc_attr( "visibility", T_AT_VISIBILITY),
236 1.13 rillig kwdef_type( "void", VOID, 0,0,0,0,1),
237 1.13 rillig kwdef_tqual( "volatile", VOLATILE, 1,0,0,0,7),
238 1.34 rillig kwdef_gcc_attr( "warn_unused_result", T_AT_WARN_UNUSED_RESULT),
239 1.34 rillig kwdef_gcc_attr( "weak", T_AT_WEAK),
240 1.35 rillig kwdef_keyword( "while", T_WHILE),
241 1.13 rillig kwdef(NULL, 0, 0, 0, 0, 0, 0, 0, 0, 0),
242 1.13 rillig #undef kwdef
243 1.13 rillig #undef kwdef_token
244 1.13 rillig #undef kwdef_sclass
245 1.13 rillig #undef kwdef_type
246 1.13 rillig #undef kwdef_tqual
247 1.36 rillig #undef kwdef_keyword
248 1.36 rillig #undef kwdef_gcc_attr
249 1.1 rillig };
250 1.1 rillig
251 1.1 rillig /* Symbol table */
252 1.1 rillig static sym_t *symtab[HSHSIZ1];
253 1.1 rillig
254 1.1 rillig /* free list for sbuf structures */
255 1.1 rillig static sbuf_t *sbfrlst;
256 1.1 rillig
257 1.1 rillig /* type of next expected symbol */
258 1.1 rillig symt_t symtyp;
259 1.1 rillig
260 1.1 rillig
261 1.1 rillig static void
262 1.62 rillig symtab_add(sym_t *sym)
263 1.60 rillig {
264 1.62 rillig size_t h;
265 1.60 rillig
266 1.62 rillig h = hash(sym->s_name);
267 1.60 rillig if ((sym->s_link = symtab[h]) != NULL)
268 1.60 rillig symtab[h]->s_rlink = &sym->s_link;
269 1.60 rillig sym->s_rlink = &symtab[h];
270 1.60 rillig symtab[h] = sym;
271 1.60 rillig }
272 1.60 rillig
273 1.60 rillig static void
274 1.61 rillig symtab_remove(sym_t *sym)
275 1.61 rillig {
276 1.61 rillig
277 1.61 rillig if ((*sym->s_rlink = sym->s_link) != NULL)
278 1.61 rillig sym->s_link->s_rlink = sym->s_rlink;
279 1.61 rillig sym->s_link = NULL;
280 1.61 rillig }
281 1.61 rillig
282 1.61 rillig
283 1.61 rillig static void
284 1.52 rillig add_keyword(const struct kwtab *kw, u_int deco)
285 1.1 rillig {
286 1.1 rillig sym_t *sym;
287 1.1 rillig char buf[256];
288 1.1 rillig const char *name;
289 1.1 rillig
290 1.14 rillig if ((kw->kw_deco & deco) == 0)
291 1.1 rillig return;
292 1.1 rillig
293 1.1 rillig switch (deco) {
294 1.1 rillig case 1:
295 1.1 rillig name = kw->kw_name;
296 1.1 rillig break;
297 1.1 rillig case 2:
298 1.22 rillig snprintf(buf, sizeof(buf), "__%s", kw->kw_name);
299 1.1 rillig name = strdup(buf);
300 1.1 rillig break;
301 1.1 rillig default:
302 1.1 rillig lint_assert(deco == 4);
303 1.22 rillig snprintf(buf, sizeof(buf), "__%s__", kw->kw_name);
304 1.1 rillig name = strdup(buf);
305 1.1 rillig break;
306 1.1 rillig }
307 1.1 rillig
308 1.1 rillig if (name == NULL)
309 1.1 rillig err(1, "Can't init symbol table");
310 1.1 rillig
311 1.22 rillig sym = getblk(sizeof(*sym));
312 1.1 rillig sym->s_name = name;
313 1.1 rillig sym->s_keyword = kw;
314 1.1 rillig sym->s_value.v_quad = kw->kw_token;
315 1.1 rillig if (kw->kw_token == T_TYPE || kw->kw_token == T_STRUCT_OR_UNION) {
316 1.1 rillig sym->s_tspec = kw->kw_tspec;
317 1.1 rillig } else if (kw->kw_token == T_SCLASS) {
318 1.1 rillig sym->s_scl = kw->kw_scl;
319 1.1 rillig } else if (kw->kw_token == T_QUAL) {
320 1.1 rillig sym->s_tqual = kw->kw_tqual;
321 1.1 rillig }
322 1.60 rillig
323 1.60 rillig symtab_add(sym);
324 1.1 rillig }
325 1.1 rillig
326 1.1 rillig /*
327 1.1 rillig * All keywords are written to the symbol table. This saves us looking
328 1.1 rillig * in a extra table for each name we found.
329 1.1 rillig */
330 1.1 rillig void
331 1.1 rillig initscan(void)
332 1.1 rillig {
333 1.1 rillig struct kwtab *kw;
334 1.1 rillig
335 1.1 rillig for (kw = kwtab; kw->kw_name != NULL; kw++) {
336 1.1 rillig if ((kw->kw_c89 || kw->kw_c99) && tflag)
337 1.1 rillig continue;
338 1.1 rillig if (kw->kw_c99 && !(Sflag || gflag))
339 1.1 rillig continue;
340 1.1 rillig if (kw->kw_gcc && !gflag)
341 1.1 rillig continue;
342 1.1 rillig add_keyword(kw, 1);
343 1.1 rillig add_keyword(kw, 2);
344 1.1 rillig add_keyword(kw, 4);
345 1.1 rillig }
346 1.1 rillig }
347 1.1 rillig
348 1.1 rillig /*
349 1.1 rillig * Get a free sbuf structure, if possible from the free list
350 1.1 rillig */
351 1.1 rillig static sbuf_t *
352 1.1 rillig allocsb(void)
353 1.1 rillig {
354 1.1 rillig sbuf_t *sb;
355 1.1 rillig
356 1.1 rillig if ((sb = sbfrlst) != NULL) {
357 1.1 rillig sbfrlst = sb->sb_next;
358 1.1 rillig #ifdef BLKDEBUG
359 1.22 rillig (void)memset(sb, 0, sizeof(*sb));
360 1.1 rillig #else
361 1.1 rillig sb->sb_next = NULL;
362 1.1 rillig #endif
363 1.1 rillig } else {
364 1.22 rillig sb = xmalloc(sizeof(*sb));
365 1.22 rillig (void)memset(sb, 0, sizeof(*sb));
366 1.1 rillig }
367 1.1 rillig return sb;
368 1.1 rillig }
369 1.1 rillig
370 1.1 rillig /*
371 1.1 rillig * Put a sbuf structure to the free list
372 1.1 rillig */
373 1.1 rillig static void
374 1.1 rillig freesb(sbuf_t *sb)
375 1.1 rillig {
376 1.1 rillig
377 1.22 rillig (void)memset(sb, ZERO, sizeof(*sb));
378 1.1 rillig sb->sb_next = sbfrlst;
379 1.1 rillig sbfrlst = sb;
380 1.1 rillig }
381 1.1 rillig
382 1.1 rillig /*
383 1.1 rillig * Read a character and ensure that it is positive (except EOF).
384 1.1 rillig * Increment line count(s) if necessary.
385 1.1 rillig */
386 1.1 rillig static int
387 1.1 rillig inpc(void)
388 1.1 rillig {
389 1.1 rillig int c;
390 1.1 rillig
391 1.41 rillig if ((c = lex_input()) == EOF)
392 1.41 rillig return c;
393 1.41 rillig c &= CHAR_MASK;
394 1.41 rillig if (c == '\0')
395 1.41 rillig return EOF; /* lex returns 0 on EOF. */
396 1.41 rillig if (c == '\n')
397 1.6 rillig lex_next_line();
398 1.1 rillig return c;
399 1.1 rillig }
400 1.1 rillig
401 1.1 rillig static int
402 1.1 rillig hash(const char *s)
403 1.1 rillig {
404 1.1 rillig u_int v;
405 1.1 rillig const u_char *us;
406 1.1 rillig
407 1.1 rillig v = 0;
408 1.1 rillig for (us = (const u_char *)s; *us != '\0'; us++) {
409 1.22 rillig v = (v << sizeof(v)) + *us;
410 1.22 rillig v ^= v >> (sizeof(v) * CHAR_BIT - sizeof(v));
411 1.1 rillig }
412 1.1 rillig return v % HSHSIZ1;
413 1.1 rillig }
414 1.1 rillig
415 1.1 rillig /*
416 1.1 rillig * Lex has found a letter followed by zero or more letters or digits.
417 1.1 rillig * It looks for a symbol in the symbol table with the same name. This
418 1.1 rillig * symbol must either be a keyword or a symbol of the type required by
419 1.1 rillig * symtyp (label, member, tag, ...).
420 1.1 rillig *
421 1.1 rillig * If it is a keyword, the token is returned. In some cases it is described
422 1.1 rillig * more deeply by data written to yylval.
423 1.1 rillig *
424 1.1 rillig * If it is a symbol, T_NAME is returned and the pointer to a sbuf struct
425 1.1 rillig * is stored in yylval. This struct contains the name of the symbol, its
426 1.1 rillig * length and hash value. If there is already a symbol of the same name
427 1.1 rillig * and type in the symbol table, the sbuf struct also contains a pointer
428 1.1 rillig * to the symbol table entry.
429 1.1 rillig */
430 1.1 rillig extern int
431 1.1 rillig lex_name(const char *yytext, size_t yyleng)
432 1.1 rillig {
433 1.1 rillig char *s;
434 1.1 rillig sbuf_t *sb;
435 1.1 rillig sym_t *sym;
436 1.1 rillig int tok;
437 1.1 rillig
438 1.1 rillig sb = allocsb();
439 1.1 rillig sb->sb_name = yytext;
440 1.1 rillig sb->sb_len = yyleng;
441 1.3 rillig if ((sym = search(sb)) != NULL && sym->s_keyword != NULL) {
442 1.1 rillig freesb(sb);
443 1.1 rillig return keyw(sym);
444 1.1 rillig }
445 1.1 rillig
446 1.1 rillig sb->sb_sym = sym;
447 1.1 rillig
448 1.1 rillig if (sym != NULL) {
449 1.12 rillig lint_assert(block_level >= sym->s_block_level);
450 1.1 rillig sb->sb_name = sym->s_name;
451 1.1 rillig sb->sb_len = strlen(sym->s_name);
452 1.1 rillig tok = sym->s_scl == TYPEDEF ? T_TYPENAME : T_NAME;
453 1.1 rillig } else {
454 1.1 rillig s = getblk(yyleng + 1);
455 1.1 rillig (void)memcpy(s, yytext, yyleng + 1);
456 1.1 rillig sb->sb_name = s;
457 1.1 rillig sb->sb_len = yyleng;
458 1.1 rillig tok = T_NAME;
459 1.1 rillig }
460 1.1 rillig
461 1.54 rillig yylval.y_name = sb;
462 1.1 rillig return tok;
463 1.1 rillig }
464 1.1 rillig
465 1.1 rillig static sym_t *
466 1.1 rillig search(sbuf_t *sb)
467 1.1 rillig {
468 1.62 rillig int h;
469 1.57 rillig sym_t *sym;
470 1.57 rillig const struct kwtab *kw;
471 1.1 rillig
472 1.62 rillig h = hash(sb->sb_name);
473 1.62 rillig for (sym = symtab[h]; sym != NULL; sym = sym->s_link) {
474 1.57 rillig if (strcmp(sym->s_name, sb->sb_name) != 0)
475 1.57 rillig continue;
476 1.57 rillig kw = sym->s_keyword;
477 1.57 rillig
478 1.57 rillig if (kw != NULL && !kw->kw_attr)
479 1.57 rillig return sym;
480 1.57 rillig if (kw != NULL && attron)
481 1.57 rillig return sym;
482 1.57 rillig if (kw == NULL && !attron && sym->s_kind == symtyp)
483 1.57 rillig return sym;
484 1.1 rillig }
485 1.1 rillig
486 1.1 rillig return NULL;
487 1.1 rillig }
488 1.1 rillig
489 1.1 rillig static int
490 1.1 rillig keyw(sym_t *sym)
491 1.1 rillig {
492 1.1 rillig int t;
493 1.1 rillig
494 1.1 rillig if ((t = (int)sym->s_value.v_quad) == T_SCLASS) {
495 1.1 rillig yylval.y_scl = sym->s_scl;
496 1.1 rillig } else if (t == T_TYPE || t == T_STRUCT_OR_UNION) {
497 1.1 rillig yylval.y_tspec = sym->s_tspec;
498 1.1 rillig } else if (t == T_QUAL) {
499 1.1 rillig yylval.y_tqual = sym->s_tqual;
500 1.1 rillig }
501 1.1 rillig return t;
502 1.1 rillig }
503 1.1 rillig
504 1.1 rillig /*
505 1.1 rillig * Convert a string representing an integer into internal representation.
506 1.24 rillig * Return T_CON, storing the numeric value in yylval, for yylex.
507 1.1 rillig */
508 1.1 rillig int
509 1.6 rillig lex_integer_constant(const char *yytext, size_t yyleng, int base)
510 1.1 rillig {
511 1.1 rillig int l_suffix, u_suffix;
512 1.1 rillig int len;
513 1.1 rillig const char *cp;
514 1.1 rillig char c, *eptr;
515 1.1 rillig tspec_t typ;
516 1.1 rillig bool ansiu;
517 1.11 rillig bool warned = false;
518 1.1 rillig #ifdef TARG_INT128_MAX
519 1.1 rillig __uint128_t uq = 0;
520 1.1 rillig static tspec_t contypes[2][4] = {
521 1.1 rillig { INT, LONG, QUAD, INT128, },
522 1.1 rillig { UINT, ULONG, UQUAD, UINT128, }
523 1.1 rillig };
524 1.1 rillig #else
525 1.1 rillig uint64_t uq = 0;
526 1.1 rillig static tspec_t contypes[2][3] = {
527 1.1 rillig { INT, LONG, QUAD, },
528 1.1 rillig { UINT, ULONG, UQUAD, }
529 1.1 rillig };
530 1.1 rillig #endif
531 1.1 rillig
532 1.1 rillig cp = yytext;
533 1.1 rillig len = yyleng;
534 1.1 rillig
535 1.1 rillig /* skip 0[xX] or 0[bB] */
536 1.1 rillig if (base == 16 || base == 2) {
537 1.1 rillig cp += 2;
538 1.1 rillig len -= 2;
539 1.1 rillig }
540 1.1 rillig
541 1.1 rillig /* read suffixes */
542 1.1 rillig l_suffix = u_suffix = 0;
543 1.1 rillig for (;;) {
544 1.1 rillig if ((c = cp[len - 1]) == 'l' || c == 'L') {
545 1.1 rillig l_suffix++;
546 1.1 rillig } else if (c == 'u' || c == 'U') {
547 1.1 rillig u_suffix++;
548 1.1 rillig } else {
549 1.1 rillig break;
550 1.1 rillig }
551 1.1 rillig len--;
552 1.1 rillig }
553 1.1 rillig if (l_suffix > 2 || u_suffix > 1) {
554 1.1 rillig /* malformed integer constant */
555 1.1 rillig warning(251);
556 1.1 rillig if (l_suffix > 2)
557 1.1 rillig l_suffix = 2;
558 1.1 rillig if (u_suffix > 1)
559 1.1 rillig u_suffix = 1;
560 1.1 rillig }
561 1.1 rillig if (tflag && u_suffix != 0) {
562 1.1 rillig /* suffix U is illegal in traditional C */
563 1.1 rillig warning(97);
564 1.1 rillig }
565 1.1 rillig typ = contypes[u_suffix][l_suffix];
566 1.1 rillig
567 1.1 rillig errno = 0;
568 1.1 rillig
569 1.1 rillig uq = strtouq(cp, &eptr, base);
570 1.1 rillig lint_assert(eptr == cp + len);
571 1.11 rillig if (errno != 0) {
572 1.1 rillig /* integer constant out of range */
573 1.1 rillig warning(252);
574 1.11 rillig warned = true;
575 1.11 rillig }
576 1.1 rillig
577 1.1 rillig /*
578 1.1 rillig * If the value is too big for the current type, we must choose
579 1.1 rillig * another type.
580 1.1 rillig */
581 1.1 rillig ansiu = false;
582 1.1 rillig switch (typ) {
583 1.1 rillig case INT:
584 1.1 rillig if (uq <= TARG_INT_MAX) {
585 1.1 rillig /* ok */
586 1.1 rillig } else if (uq <= TARG_UINT_MAX && base != 10) {
587 1.1 rillig typ = UINT;
588 1.1 rillig } else if (uq <= TARG_LONG_MAX) {
589 1.1 rillig typ = LONG;
590 1.1 rillig } else {
591 1.1 rillig typ = ULONG;
592 1.11 rillig if (uq > TARG_ULONG_MAX && !warned) {
593 1.1 rillig /* integer constant out of range */
594 1.1 rillig warning(252);
595 1.1 rillig }
596 1.1 rillig }
597 1.1 rillig if (typ == UINT || typ == ULONG) {
598 1.1 rillig if (tflag) {
599 1.1 rillig typ = LONG;
600 1.1 rillig } else if (!sflag) {
601 1.1 rillig /*
602 1.1 rillig * Remember that the constant is unsigned
603 1.1 rillig * only in ANSI C
604 1.1 rillig */
605 1.1 rillig ansiu = true;
606 1.1 rillig }
607 1.1 rillig }
608 1.1 rillig break;
609 1.1 rillig case UINT:
610 1.1 rillig if (uq > TARG_UINT_MAX) {
611 1.1 rillig typ = ULONG;
612 1.11 rillig if (uq > TARG_ULONG_MAX && !warned) {
613 1.1 rillig /* integer constant out of range */
614 1.1 rillig warning(252);
615 1.1 rillig }
616 1.1 rillig }
617 1.1 rillig break;
618 1.1 rillig case LONG:
619 1.1 rillig if (uq > TARG_LONG_MAX && !tflag) {
620 1.1 rillig typ = ULONG;
621 1.1 rillig if (!sflag)
622 1.1 rillig ansiu = true;
623 1.11 rillig if (uq > TARG_ULONG_MAX && !warned) {
624 1.1 rillig /* integer constant out of range */
625 1.1 rillig warning(252);
626 1.1 rillig }
627 1.1 rillig }
628 1.1 rillig break;
629 1.1 rillig case ULONG:
630 1.11 rillig if (uq > TARG_ULONG_MAX && !warned) {
631 1.1 rillig /* integer constant out of range */
632 1.1 rillig warning(252);
633 1.1 rillig }
634 1.1 rillig break;
635 1.1 rillig case QUAD:
636 1.1 rillig if (uq > TARG_QUAD_MAX && !tflag) {
637 1.1 rillig typ = UQUAD;
638 1.1 rillig if (!sflag)
639 1.1 rillig ansiu = true;
640 1.1 rillig }
641 1.1 rillig break;
642 1.1 rillig case UQUAD:
643 1.11 rillig if (uq > TARG_UQUAD_MAX && !warned) {
644 1.1 rillig /* integer constant out of range */
645 1.1 rillig warning(252);
646 1.1 rillig }
647 1.1 rillig break;
648 1.1 rillig #ifdef INT128_SIZE
649 1.1 rillig case INT128:
650 1.1 rillig #ifdef TARG_INT128_MAX
651 1.1 rillig if (uq > TARG_INT128_MAX && !tflag) {
652 1.1 rillig typ = UINT128;
653 1.1 rillig if (!sflag)
654 1.1 rillig ansiu = true;
655 1.1 rillig }
656 1.1 rillig #endif
657 1.1 rillig break;
658 1.1 rillig case UINT128:
659 1.1 rillig #ifdef TARG_INT128_MAX
660 1.11 rillig if (uq > TARG_UINT128_MAX && !warned) {
661 1.1 rillig /* integer constant out of range */
662 1.1 rillig warning(252);
663 1.1 rillig }
664 1.1 rillig #endif
665 1.1 rillig break;
666 1.1 rillig #endif
667 1.1 rillig /* LINTED206: (enumeration values not handled in switch) */
668 1.1 rillig case STRUCT:
669 1.1 rillig case VOID:
670 1.1 rillig case LDOUBLE:
671 1.1 rillig case FUNC:
672 1.1 rillig case ARRAY:
673 1.1 rillig case PTR:
674 1.1 rillig case ENUM:
675 1.1 rillig case UNION:
676 1.1 rillig case SIGNED:
677 1.1 rillig case NOTSPEC:
678 1.1 rillig case DOUBLE:
679 1.1 rillig case FLOAT:
680 1.1 rillig case USHORT:
681 1.1 rillig case SHORT:
682 1.1 rillig case UCHAR:
683 1.1 rillig case SCHAR:
684 1.1 rillig case CHAR:
685 1.1 rillig case BOOL:
686 1.1 rillig case UNSIGN:
687 1.1 rillig case FCOMPLEX:
688 1.1 rillig case DCOMPLEX:
689 1.1 rillig case LCOMPLEX:
690 1.1 rillig case COMPLEX:
691 1.1 rillig break;
692 1.1 rillig }
693 1.1 rillig
694 1.49 rillig uq = (uint64_t)convert_integer((int64_t)uq, typ, -1);
695 1.1 rillig
696 1.22 rillig yylval.y_val = xcalloc(1, sizeof(*yylval.y_val));
697 1.17 rillig yylval.y_val->v_tspec = typ;
698 1.46 rillig yylval.y_val->v_unsigned_since_c90 = ansiu;
699 1.1 rillig yylval.y_val->v_quad = (int64_t)uq;
700 1.1 rillig
701 1.1 rillig return T_CON;
702 1.1 rillig }
703 1.1 rillig
704 1.1 rillig int
705 1.1 rillig msb(int64_t q, tspec_t t, int len)
706 1.1 rillig {
707 1.1 rillig
708 1.1 rillig if (len <= 0)
709 1.10 rillig len = size_in_bits(t);
710 1.37 rillig return (q & bit(len - 1)) != 0 ? 1 : 0;
711 1.1 rillig }
712 1.1 rillig
713 1.1 rillig /*
714 1.49 rillig * Extend or truncate q to match t. If t is signed, sign-extend.
715 1.50 rillig *
716 1.50 rillig * len is the number of significant bits. If len is -1, len is set
717 1.50 rillig * to the width of type t.
718 1.1 rillig */
719 1.1 rillig int64_t
720 1.49 rillig convert_integer(int64_t q, tspec_t t, int len)
721 1.1 rillig {
722 1.37 rillig uint64_t vbits;
723 1.1 rillig
724 1.1 rillig if (len <= 0)
725 1.10 rillig len = size_in_bits(t);
726 1.1 rillig
727 1.37 rillig vbits = value_bits(len);
728 1.50 rillig return t == PTR || is_uinteger(t) || msb(q, t, len) == 0
729 1.37 rillig ? q & vbits
730 1.37 rillig : q | ~vbits;
731 1.1 rillig }
732 1.1 rillig
733 1.1 rillig /*
734 1.1 rillig * Convert a string representing a floating point value into its integral
735 1.1 rillig * representation. Type and value are returned in yylval. fcon()
736 1.1 rillig * (and yylex()) returns T_CON.
737 1.1 rillig * XXX Currently it is not possible to convert constants of type
738 1.1 rillig * long double which are greater than DBL_MAX.
739 1.1 rillig */
740 1.1 rillig int
741 1.6 rillig lex_floating_constant(const char *yytext, size_t yyleng)
742 1.1 rillig {
743 1.1 rillig const char *cp;
744 1.1 rillig int len;
745 1.1 rillig tspec_t typ;
746 1.1 rillig char c, *eptr;
747 1.1 rillig double d;
748 1.1 rillig float f = 0;
749 1.1 rillig
750 1.1 rillig cp = yytext;
751 1.1 rillig len = yyleng;
752 1.1 rillig
753 1.1 rillig if (cp[len - 1] == 'i') {
754 1.1 rillig /* imaginary, do nothing for now */
755 1.1 rillig len--;
756 1.1 rillig }
757 1.1 rillig if ((c = cp[len - 1]) == 'f' || c == 'F') {
758 1.1 rillig typ = FLOAT;
759 1.1 rillig len--;
760 1.1 rillig } else if (c == 'l' || c == 'L') {
761 1.1 rillig typ = LDOUBLE;
762 1.1 rillig len--;
763 1.1 rillig } else {
764 1.1 rillig if (c == 'd' || c == 'D')
765 1.1 rillig len--;
766 1.1 rillig typ = DOUBLE;
767 1.1 rillig }
768 1.1 rillig
769 1.1 rillig if (tflag && typ != DOUBLE) {
770 1.1 rillig /* suffixes F and L are illegal in traditional C */
771 1.1 rillig warning(98);
772 1.1 rillig }
773 1.1 rillig
774 1.1 rillig errno = 0;
775 1.1 rillig d = strtod(cp, &eptr);
776 1.1 rillig if (eptr != cp + len) {
777 1.1 rillig switch (*eptr) {
778 1.1 rillig /*
779 1.1 rillig * XXX: non-native non-current strtod() may not handle hex
780 1.1 rillig * floats, ignore the rest if we find traces of hex float
781 1.1 rillig * syntax...
782 1.1 rillig */
783 1.1 rillig case 'p':
784 1.1 rillig case 'P':
785 1.1 rillig case 'x':
786 1.1 rillig case 'X':
787 1.1 rillig d = 0;
788 1.1 rillig errno = 0;
789 1.1 rillig break;
790 1.1 rillig default:
791 1.20 rillig INTERNAL_ERROR("fcon(%s->%s)", cp, eptr);
792 1.1 rillig }
793 1.1 rillig }
794 1.1 rillig if (errno != 0)
795 1.1 rillig /* floating-point constant out of range */
796 1.1 rillig warning(248);
797 1.1 rillig
798 1.1 rillig if (typ == FLOAT) {
799 1.1 rillig f = (float)d;
800 1.5 rillig if (finite(f) == 0) {
801 1.1 rillig /* floating-point constant out of range */
802 1.1 rillig warning(248);
803 1.1 rillig f = f > 0 ? FLT_MAX : -FLT_MAX;
804 1.1 rillig }
805 1.1 rillig }
806 1.1 rillig
807 1.22 rillig yylval.y_val = xcalloc(1, sizeof(*yylval.y_val));
808 1.17 rillig yylval.y_val->v_tspec = typ;
809 1.1 rillig if (typ == FLOAT) {
810 1.1 rillig yylval.y_val->v_ldbl = f;
811 1.1 rillig } else {
812 1.1 rillig yylval.y_val->v_ldbl = d;
813 1.1 rillig }
814 1.1 rillig
815 1.1 rillig return T_CON;
816 1.1 rillig }
817 1.1 rillig
818 1.1 rillig int
819 1.1 rillig lex_operator(int t, op_t o)
820 1.1 rillig {
821 1.1 rillig
822 1.1 rillig yylval.y_op = o;
823 1.1 rillig return t;
824 1.1 rillig }
825 1.1 rillig
826 1.1 rillig /*
827 1.1 rillig * Called if lex found a leading \'.
828 1.1 rillig */
829 1.1 rillig int
830 1.6 rillig lex_character_constant(void)
831 1.1 rillig {
832 1.1 rillig size_t n;
833 1.1 rillig int val, c;
834 1.1 rillig
835 1.1 rillig n = 0;
836 1.1 rillig val = 0;
837 1.6 rillig while ((c = get_escaped_char('\'')) >= 0) {
838 1.1 rillig val = (val << CHAR_SIZE) + c;
839 1.1 rillig n++;
840 1.1 rillig }
841 1.1 rillig if (c == -2) {
842 1.1 rillig /* unterminated character constant */
843 1.1 rillig error(253);
844 1.43 rillig } else if (n > sizeof(int) || (n > 1 && (pflag || hflag))) {
845 1.17 rillig /* XXX: should rather be sizeof(TARG_INT) */
846 1.43 rillig
847 1.43 rillig /* too many characters in character constant */
848 1.43 rillig error(71);
849 1.43 rillig } else if (n > 1) {
850 1.43 rillig /* multi-character character constant */
851 1.43 rillig warning(294);
852 1.43 rillig } else if (n == 0) {
853 1.43 rillig /* empty character constant */
854 1.43 rillig error(73);
855 1.1 rillig }
856 1.1 rillig if (n == 1) {
857 1.48 rillig /*
858 1.48 rillig * XXX: use the target platform's 'char' instead of the
859 1.48 rillig * 'char' from the execution environment, to be able to
860 1.48 rillig * run lint for powerpc on x86_64.
861 1.48 rillig */
862 1.48 rillig val = (char)val;
863 1.1 rillig }
864 1.1 rillig
865 1.22 rillig yylval.y_val = xcalloc(1, sizeof(*yylval.y_val));
866 1.1 rillig yylval.y_val->v_tspec = INT;
867 1.1 rillig yylval.y_val->v_quad = val;
868 1.1 rillig
869 1.1 rillig return T_CON;
870 1.1 rillig }
871 1.1 rillig
872 1.1 rillig /*
873 1.1 rillig * Called if lex found a leading L\'
874 1.1 rillig */
875 1.1 rillig int
876 1.6 rillig lex_wide_character_constant(void)
877 1.1 rillig {
878 1.1 rillig static char buf[MB_LEN_MAX + 1];
879 1.44 rillig size_t n, nmax;
880 1.1 rillig int c;
881 1.1 rillig wchar_t wc;
882 1.1 rillig
883 1.44 rillig nmax = MB_CUR_MAX;
884 1.7 rillig
885 1.44 rillig n = 0;
886 1.6 rillig while ((c = get_escaped_char('\'')) >= 0) {
887 1.44 rillig if (n < nmax)
888 1.44 rillig buf[n] = (char)c;
889 1.44 rillig n++;
890 1.1 rillig }
891 1.1 rillig
892 1.1 rillig wc = 0;
893 1.1 rillig
894 1.1 rillig if (c == -2) {
895 1.1 rillig /* unterminated character constant */
896 1.1 rillig error(253);
897 1.44 rillig } else if (n == 0) {
898 1.1 rillig /* empty character constant */
899 1.1 rillig error(73);
900 1.44 rillig } else if (n > nmax) {
901 1.44 rillig n = nmax;
902 1.43 rillig /* too many characters in character constant */
903 1.43 rillig error(71);
904 1.1 rillig } else {
905 1.44 rillig buf[n] = '\0';
906 1.43 rillig (void)mbtowc(NULL, NULL, 0);
907 1.44 rillig if (mbtowc(&wc, buf, nmax) < 0)
908 1.43 rillig /* invalid multibyte character */
909 1.43 rillig error(291);
910 1.1 rillig }
911 1.1 rillig
912 1.22 rillig yylval.y_val = xcalloc(1, sizeof(*yylval.y_val));
913 1.1 rillig yylval.y_val->v_tspec = WCHAR;
914 1.1 rillig yylval.y_val->v_quad = wc;
915 1.1 rillig
916 1.1 rillig return T_CON;
917 1.1 rillig }
918 1.1 rillig
919 1.1 rillig /*
920 1.1 rillig * Read a character which is part of a character constant or of a string
921 1.1 rillig * and handle escapes.
922 1.1 rillig *
923 1.2 rillig * The argument is the character which delimits the character constant or
924 1.1 rillig * string.
925 1.1 rillig *
926 1.1 rillig * Returns -1 if the end of the character constant or string is reached,
927 1.1 rillig * -2 if the EOF is reached, and the character otherwise.
928 1.1 rillig */
929 1.1 rillig static int
930 1.6 rillig get_escaped_char(int delim)
931 1.1 rillig {
932 1.1 rillig static int pbc = -1;
933 1.1 rillig int n, c, v;
934 1.1 rillig
935 1.1 rillig if (pbc == -1) {
936 1.1 rillig c = inpc();
937 1.1 rillig } else {
938 1.1 rillig c = pbc;
939 1.1 rillig pbc = -1;
940 1.1 rillig }
941 1.2 rillig if (c == delim)
942 1.1 rillig return -1;
943 1.1 rillig switch (c) {
944 1.1 rillig case '\n':
945 1.1 rillig if (tflag) {
946 1.1 rillig /* newline in string or char constant */
947 1.1 rillig error(254);
948 1.1 rillig return -2;
949 1.1 rillig }
950 1.1 rillig return c;
951 1.40 rillig case 0:
952 1.40 rillig /* syntax error '%s' */
953 1.40 rillig error(249, "EOF or null byte in literal");
954 1.40 rillig return -2;
955 1.1 rillig case EOF:
956 1.1 rillig return -2;
957 1.1 rillig case '\\':
958 1.1 rillig switch (c = inpc()) {
959 1.1 rillig case '"':
960 1.2 rillig if (tflag && delim == '\'')
961 1.1 rillig /* \" inside character constants undef... */
962 1.1 rillig warning(262);
963 1.1 rillig return '"';
964 1.1 rillig case '\'':
965 1.1 rillig return '\'';
966 1.1 rillig case '?':
967 1.1 rillig if (tflag)
968 1.1 rillig /* \? undefined in traditional C */
969 1.1 rillig warning(263);
970 1.1 rillig return '?';
971 1.1 rillig case '\\':
972 1.1 rillig return '\\';
973 1.1 rillig case 'a':
974 1.1 rillig if (tflag)
975 1.1 rillig /* \a undefined in traditional C */
976 1.1 rillig warning(81);
977 1.1 rillig return '\a';
978 1.1 rillig case 'b':
979 1.1 rillig return '\b';
980 1.1 rillig case 'f':
981 1.1 rillig return '\f';
982 1.1 rillig case 'n':
983 1.1 rillig return '\n';
984 1.1 rillig case 'r':
985 1.1 rillig return '\r';
986 1.1 rillig case 't':
987 1.1 rillig return '\t';
988 1.1 rillig case 'v':
989 1.1 rillig if (tflag)
990 1.1 rillig /* \v undefined in traditional C */
991 1.1 rillig warning(264);
992 1.1 rillig return '\v';
993 1.1 rillig case '8': case '9':
994 1.1 rillig /* bad octal digit %c */
995 1.1 rillig warning(77, c);
996 1.1 rillig /* FALLTHROUGH */
997 1.1 rillig case '0': case '1': case '2': case '3':
998 1.1 rillig case '4': case '5': case '6': case '7':
999 1.1 rillig n = 3;
1000 1.1 rillig v = 0;
1001 1.1 rillig do {
1002 1.1 rillig v = (v << 3) + (c - '0');
1003 1.1 rillig c = inpc();
1004 1.47 rillig } while (--n > 0 && '0' <= c && c <= '7');
1005 1.1 rillig pbc = c;
1006 1.1 rillig if (v > TARG_UCHAR_MAX) {
1007 1.1 rillig /* character escape does not fit in character */
1008 1.1 rillig warning(76);
1009 1.1 rillig v &= CHAR_MASK;
1010 1.1 rillig }
1011 1.1 rillig return v;
1012 1.1 rillig case 'x':
1013 1.1 rillig if (tflag)
1014 1.1 rillig /* \x undefined in traditional C */
1015 1.1 rillig warning(82);
1016 1.1 rillig v = 0;
1017 1.1 rillig n = 0;
1018 1.1 rillig while ((c = inpc()) >= 0 && isxdigit(c)) {
1019 1.1 rillig c = isdigit(c) ?
1020 1.1 rillig c - '0' : toupper(c) - 'A' + 10;
1021 1.1 rillig v = (v << 4) + c;
1022 1.1 rillig if (n >= 0) {
1023 1.1 rillig if ((v & ~CHAR_MASK) != 0) {
1024 1.1 rillig /* overflow in hex escape */
1025 1.1 rillig warning(75);
1026 1.1 rillig n = -1;
1027 1.1 rillig } else {
1028 1.1 rillig n++;
1029 1.1 rillig }
1030 1.1 rillig }
1031 1.1 rillig }
1032 1.1 rillig pbc = c;
1033 1.1 rillig if (n == 0) {
1034 1.1 rillig /* no hex digits follow \x */
1035 1.1 rillig error(74);
1036 1.1 rillig } if (n == -1) {
1037 1.1 rillig v &= CHAR_MASK;
1038 1.1 rillig }
1039 1.1 rillig return v;
1040 1.1 rillig case '\n':
1041 1.6 rillig return get_escaped_char(delim);
1042 1.1 rillig case EOF:
1043 1.1 rillig return -2;
1044 1.1 rillig default:
1045 1.1 rillig if (isprint(c)) {
1046 1.1 rillig /* dubious escape \%c */
1047 1.1 rillig warning(79, c);
1048 1.1 rillig } else {
1049 1.1 rillig /* dubious escape \%o */
1050 1.1 rillig warning(80, c);
1051 1.1 rillig }
1052 1.1 rillig }
1053 1.1 rillig }
1054 1.1 rillig return c;
1055 1.1 rillig }
1056 1.1 rillig
1057 1.1 rillig /* See https://gcc.gnu.org/onlinedocs/cpp/Preprocessor-Output.html */
1058 1.1 rillig static void
1059 1.25 rillig parse_line_directive_flags(const char *p,
1060 1.25 rillig bool *is_begin, bool *is_end, bool *is_system)
1061 1.1 rillig {
1062 1.1 rillig
1063 1.25 rillig *is_begin = false;
1064 1.25 rillig *is_end = false;
1065 1.25 rillig *is_system = false;
1066 1.1 rillig
1067 1.8 rillig while (*p != '\0') {
1068 1.1 rillig while (ch_isspace(*p))
1069 1.1 rillig p++;
1070 1.8 rillig
1071 1.8 rillig const char *word_start = p;
1072 1.8 rillig while (*p != '\0' && !ch_isspace(*p))
1073 1.8 rillig p++;
1074 1.8 rillig const char *word_end = p;
1075 1.8 rillig
1076 1.25 rillig if (word_end - word_start == 1 && word_start[0] == '1')
1077 1.25 rillig *is_begin = true;
1078 1.25 rillig if (word_end - word_start == 1 && word_start[0] == '2')
1079 1.25 rillig *is_end = true;
1080 1.8 rillig if (word_end - word_start == 1 && word_start[0] == '3')
1081 1.25 rillig *is_system = true;
1082 1.25 rillig /* Flag '4' would only be interesting if lint handled C++. */
1083 1.1 rillig }
1084 1.1 rillig
1085 1.1 rillig #if 0
1086 1.25 rillig if (*p != '\0') {
1087 1.25 rillig /* syntax error '%s' */
1088 1.25 rillig warning(249, "extra character(s) after directive");
1089 1.25 rillig }
1090 1.1 rillig #endif
1091 1.1 rillig }
1092 1.1 rillig
1093 1.1 rillig /*
1094 1.1 rillig * Called for preprocessor directives. Currently implemented are:
1095 1.1 rillig * # lineno
1096 1.1 rillig * # lineno "filename"
1097 1.2 rillig * # lineno "filename" GCC-flag...
1098 1.1 rillig */
1099 1.1 rillig void
1100 1.1 rillig lex_directive(const char *yytext)
1101 1.1 rillig {
1102 1.1 rillig const char *cp, *fn;
1103 1.1 rillig char c, *eptr;
1104 1.1 rillig size_t fnl;
1105 1.1 rillig long ln;
1106 1.25 rillig bool is_begin, is_end, is_system;
1107 1.25 rillig
1108 1.1 rillig static bool first = true;
1109 1.1 rillig
1110 1.1 rillig /* Go to first non-whitespace after # */
1111 1.1 rillig for (cp = yytext + 1; (c = *cp) == ' ' || c == '\t'; cp++)
1112 1.1 rillig continue;
1113 1.1 rillig
1114 1.1 rillig if (!ch_isdigit(c)) {
1115 1.1 rillig if (strncmp(cp, "pragma", 6) == 0 && ch_isspace(cp[6]))
1116 1.1 rillig return;
1117 1.1 rillig error:
1118 1.1 rillig /* undefined or invalid # directive */
1119 1.1 rillig warning(255);
1120 1.1 rillig return;
1121 1.1 rillig }
1122 1.1 rillig ln = strtol(--cp, &eptr, 10);
1123 1.1 rillig if (cp == eptr)
1124 1.1 rillig goto error;
1125 1.1 rillig if ((c = *(cp = eptr)) != ' ' && c != '\t' && c != '\0')
1126 1.1 rillig goto error;
1127 1.1 rillig while ((c = *cp++) == ' ' || c == '\t')
1128 1.1 rillig continue;
1129 1.1 rillig if (c != '\0') {
1130 1.1 rillig if (c != '"')
1131 1.1 rillig goto error;
1132 1.1 rillig fn = cp;
1133 1.1 rillig while ((c = *cp) != '"' && c != '\0')
1134 1.1 rillig cp++;
1135 1.1 rillig if (c != '"')
1136 1.1 rillig goto error;
1137 1.1 rillig if ((fnl = cp++ - fn) > PATH_MAX)
1138 1.1 rillig goto error;
1139 1.1 rillig /* empty string means stdin */
1140 1.1 rillig if (fnl == 0) {
1141 1.1 rillig fn = "{standard input}";
1142 1.1 rillig fnl = 16; /* strlen (fn) */
1143 1.1 rillig }
1144 1.19 rillig curr_pos.p_file = record_filename(fn, fnl);
1145 1.1 rillig /*
1146 1.1 rillig * If this is the first directive, the name is the name
1147 1.1 rillig * of the C source file as specified at the command line.
1148 1.1 rillig * It is written to the output file.
1149 1.1 rillig */
1150 1.1 rillig if (first) {
1151 1.1 rillig csrc_pos.p_file = curr_pos.p_file;
1152 1.19 rillig outsrc(transform_filename(curr_pos.p_file,
1153 1.1 rillig strlen(curr_pos.p_file)));
1154 1.1 rillig first = false;
1155 1.1 rillig }
1156 1.25 rillig
1157 1.25 rillig parse_line_directive_flags(cp, &is_begin, &is_end, &is_system);
1158 1.26 rillig update_location(curr_pos.p_file, (int)ln, is_begin, is_end);
1159 1.26 rillig in_system_header = is_system;
1160 1.1 rillig }
1161 1.1 rillig curr_pos.p_line = (int)ln - 1;
1162 1.1 rillig curr_pos.p_uniq = 0;
1163 1.1 rillig if (curr_pos.p_file == csrc_pos.p_file) {
1164 1.1 rillig csrc_pos.p_line = (int)ln - 1;
1165 1.1 rillig csrc_pos.p_uniq = 0;
1166 1.1 rillig }
1167 1.1 rillig }
1168 1.1 rillig
1169 1.1 rillig /*
1170 1.2 rillig * Handle lint comments such as ARGSUSED.
1171 1.2 rillig *
1172 1.1 rillig * If one of these comments is recognized, the argument, if any, is
1173 1.1 rillig * parsed and a function which handles this comment is called.
1174 1.1 rillig */
1175 1.1 rillig void
1176 1.1 rillig lex_comment(void)
1177 1.1 rillig {
1178 1.1 rillig int c, lc;
1179 1.1 rillig static const struct {
1180 1.1 rillig const char *keywd;
1181 1.3 rillig bool arg;
1182 1.1 rillig void (*func)(int);
1183 1.1 rillig } keywtab[] = {
1184 1.3 rillig { "ARGSUSED", true, argsused },
1185 1.3 rillig { "BITFIELDTYPE", false, bitfieldtype },
1186 1.3 rillig { "CONSTCOND", false, constcond },
1187 1.3 rillig { "CONSTANTCOND", false, constcond },
1188 1.3 rillig { "CONSTANTCONDITION", false, constcond },
1189 1.3 rillig { "FALLTHRU", false, fallthru },
1190 1.3 rillig { "FALLTHROUGH", false, fallthru },
1191 1.3 rillig { "LINTLIBRARY", false, lintlib },
1192 1.3 rillig { "LINTED", true, linted },
1193 1.3 rillig { "LONGLONG", false, longlong },
1194 1.3 rillig { "NOSTRICT", true, linted },
1195 1.15 rillig { "NOTREACHED", false, not_reached },
1196 1.3 rillig { "PRINTFLIKE", true, printflike },
1197 1.3 rillig { "PROTOLIB", true, protolib },
1198 1.3 rillig { "SCANFLIKE", true, scanflike },
1199 1.3 rillig { "VARARGS", true, varargs },
1200 1.1 rillig };
1201 1.1 rillig char keywd[32];
1202 1.1 rillig char arg[32];
1203 1.1 rillig size_t l, i;
1204 1.1 rillig int a;
1205 1.1 rillig bool eoc;
1206 1.1 rillig
1207 1.1 rillig eoc = false;
1208 1.1 rillig
1209 1.1 rillig /* Skip whitespace after the start of the comment */
1210 1.1 rillig while ((c = inpc()) != EOF && isspace(c))
1211 1.1 rillig continue;
1212 1.1 rillig
1213 1.1 rillig /* Read the potential keyword to keywd */
1214 1.1 rillig l = 0;
1215 1.22 rillig while (c != EOF && isupper(c) && l < sizeof(keywd) - 1) {
1216 1.1 rillig keywd[l++] = (char)c;
1217 1.1 rillig c = inpc();
1218 1.1 rillig }
1219 1.1 rillig keywd[l] = '\0';
1220 1.1 rillig
1221 1.1 rillig /* look for the keyword */
1222 1.22 rillig for (i = 0; i < sizeof(keywtab) / sizeof(keywtab[0]); i++) {
1223 1.1 rillig if (strcmp(keywtab[i].keywd, keywd) == 0)
1224 1.1 rillig break;
1225 1.1 rillig }
1226 1.22 rillig if (i == sizeof(keywtab) / sizeof(keywtab[0]))
1227 1.1 rillig goto skip_rest;
1228 1.1 rillig
1229 1.1 rillig /* skip whitespace after the keyword */
1230 1.1 rillig while (c != EOF && isspace(c))
1231 1.1 rillig c = inpc();
1232 1.1 rillig
1233 1.1 rillig /* read the argument, if the keyword accepts one and there is one */
1234 1.1 rillig l = 0;
1235 1.1 rillig if (keywtab[i].arg) {
1236 1.22 rillig while (c != EOF && isdigit(c) && l < sizeof(arg) - 1) {
1237 1.1 rillig arg[l++] = (char)c;
1238 1.1 rillig c = inpc();
1239 1.1 rillig }
1240 1.1 rillig }
1241 1.1 rillig arg[l] = '\0';
1242 1.1 rillig a = l != 0 ? atoi(arg) : -1;
1243 1.1 rillig
1244 1.1 rillig /* skip whitespace after the argument */
1245 1.1 rillig while (c != EOF && isspace(c))
1246 1.1 rillig c = inpc();
1247 1.1 rillig
1248 1.1 rillig if (c != '*' || (c = inpc()) != '/') {
1249 1.1 rillig if (keywtab[i].func != linted)
1250 1.1 rillig /* extra characters in lint comment */
1251 1.1 rillig warning(257);
1252 1.1 rillig } else {
1253 1.1 rillig /*
1254 1.1 rillig * remember that we have already found the end of the
1255 1.1 rillig * comment
1256 1.1 rillig */
1257 1.1 rillig eoc = true;
1258 1.1 rillig }
1259 1.1 rillig
1260 1.1 rillig if (keywtab[i].func != NULL)
1261 1.1 rillig (*keywtab[i].func)(a);
1262 1.1 rillig
1263 1.1 rillig skip_rest:
1264 1.1 rillig while (!eoc) {
1265 1.1 rillig lc = c;
1266 1.1 rillig if ((c = inpc()) == EOF) {
1267 1.1 rillig /* unterminated comment */
1268 1.1 rillig error(256);
1269 1.1 rillig break;
1270 1.1 rillig }
1271 1.1 rillig if (lc == '*' && c == '/')
1272 1.1 rillig eoc = true;
1273 1.1 rillig }
1274 1.1 rillig }
1275 1.1 rillig
1276 1.1 rillig /*
1277 1.1 rillig * Handle // style comments
1278 1.1 rillig */
1279 1.1 rillig void
1280 1.6 rillig lex_slash_slash_comment(void)
1281 1.1 rillig {
1282 1.1 rillig int c;
1283 1.1 rillig
1284 1.1 rillig if (!Sflag && !gflag)
1285 1.1 rillig /* %s C does not support // comments */
1286 1.1 rillig gnuism(312, tflag ? "traditional" : "ANSI");
1287 1.1 rillig
1288 1.1 rillig while ((c = inpc()) != EOF && c != '\n')
1289 1.1 rillig continue;
1290 1.1 rillig }
1291 1.1 rillig
1292 1.1 rillig /*
1293 1.1 rillig * Clear flags for lint comments LINTED, LONGLONG and CONSTCOND.
1294 1.1 rillig * clear_warn_flags() is called after function definitions and global and
1295 1.1 rillig * local declarations and definitions. It is also called between
1296 1.1 rillig * the controlling expression and the body of control statements
1297 1.1 rillig * (if, switch, for, while).
1298 1.1 rillig */
1299 1.1 rillig void
1300 1.1 rillig clear_warn_flags(void)
1301 1.1 rillig {
1302 1.1 rillig
1303 1.1 rillig lwarn = LWARN_ALL;
1304 1.1 rillig quadflg = false;
1305 1.1 rillig constcond_flag = false;
1306 1.1 rillig }
1307 1.1 rillig
1308 1.1 rillig /*
1309 1.1 rillig * Strings are stored in a dynamically allocated buffer and passed
1310 1.1 rillig * in yylval.y_xstrg to the parser. The parser or the routines called
1311 1.1 rillig * by the parser are responsible for freeing this buffer.
1312 1.1 rillig */
1313 1.1 rillig int
1314 1.1 rillig lex_string(void)
1315 1.1 rillig {
1316 1.1 rillig u_char *s;
1317 1.1 rillig int c;
1318 1.1 rillig size_t len, max;
1319 1.1 rillig strg_t *strg;
1320 1.1 rillig
1321 1.1 rillig s = xmalloc(max = 64);
1322 1.1 rillig
1323 1.1 rillig len = 0;
1324 1.39 rillig while ((c = get_escaped_char('"')) >= 0) {
1325 1.1 rillig /* +1 to reserve space for a trailing NUL character */
1326 1.1 rillig if (len + 1 == max)
1327 1.1 rillig s = xrealloc(s, max *= 2);
1328 1.1 rillig s[len++] = (char)c;
1329 1.1 rillig }
1330 1.1 rillig s[len] = '\0';
1331 1.1 rillig if (c == -2)
1332 1.1 rillig /* unterminated string constant */
1333 1.1 rillig error(258);
1334 1.1 rillig
1335 1.22 rillig strg = xcalloc(1, sizeof(*strg));
1336 1.1 rillig strg->st_tspec = CHAR;
1337 1.1 rillig strg->st_len = len;
1338 1.1 rillig strg->st_cp = s;
1339 1.1 rillig
1340 1.1 rillig yylval.y_string = strg;
1341 1.1 rillig return T_STRING;
1342 1.1 rillig }
1343 1.1 rillig
1344 1.1 rillig int
1345 1.6 rillig lex_wide_string(void)
1346 1.1 rillig {
1347 1.1 rillig char *s;
1348 1.1 rillig int c, n;
1349 1.1 rillig size_t i, wi;
1350 1.1 rillig size_t len, max, wlen;
1351 1.1 rillig wchar_t *ws;
1352 1.1 rillig strg_t *strg;
1353 1.1 rillig
1354 1.1 rillig s = xmalloc(max = 64);
1355 1.1 rillig len = 0;
1356 1.6 rillig while ((c = get_escaped_char('"')) >= 0) {
1357 1.1 rillig /* +1 to save space for a trailing NUL character */
1358 1.1 rillig if (len + 1 >= max)
1359 1.1 rillig s = xrealloc(s, max *= 2);
1360 1.1 rillig s[len++] = (char)c;
1361 1.1 rillig }
1362 1.1 rillig s[len] = '\0';
1363 1.1 rillig if (c == -2)
1364 1.1 rillig /* unterminated string constant */
1365 1.1 rillig error(258);
1366 1.1 rillig
1367 1.1 rillig /* get length of wide-character string */
1368 1.1 rillig (void)mblen(NULL, 0);
1369 1.1 rillig for (i = 0, wlen = 0; i < len; i += n, wlen++) {
1370 1.1 rillig if ((n = mblen(&s[i], MB_CUR_MAX)) == -1) {
1371 1.1 rillig /* invalid multibyte character */
1372 1.1 rillig error(291);
1373 1.1 rillig break;
1374 1.1 rillig }
1375 1.1 rillig if (n == 0)
1376 1.1 rillig n = 1;
1377 1.1 rillig }
1378 1.1 rillig
1379 1.22 rillig ws = xmalloc((wlen + 1) * sizeof(*ws));
1380 1.1 rillig
1381 1.1 rillig /* convert from multibyte to wide char */
1382 1.1 rillig (void)mbtowc(NULL, NULL, 0);
1383 1.1 rillig for (i = 0, wi = 0; i < len; i += n, wi++) {
1384 1.1 rillig if ((n = mbtowc(&ws[wi], &s[i], MB_CUR_MAX)) == -1)
1385 1.1 rillig break;
1386 1.1 rillig if (n == 0)
1387 1.1 rillig n = 1;
1388 1.1 rillig }
1389 1.1 rillig ws[wi] = 0;
1390 1.1 rillig free(s);
1391 1.1 rillig
1392 1.22 rillig strg = xcalloc(1, sizeof(*strg));
1393 1.1 rillig strg->st_tspec = WCHAR;
1394 1.1 rillig strg->st_len = wlen;
1395 1.1 rillig strg->st_wcp = ws;
1396 1.1 rillig
1397 1.1 rillig yylval.y_string = strg;
1398 1.1 rillig return T_STRING;
1399 1.1 rillig }
1400 1.1 rillig
1401 1.1 rillig /*
1402 1.60 rillig * As noted above, the scanner does not create new symbol table entries
1403 1.1 rillig * for symbols it cannot find in the symbol table. This is to avoid
1404 1.1 rillig * putting undeclared symbols into the symbol table if a syntax error
1405 1.1 rillig * occurs.
1406 1.1 rillig *
1407 1.60 rillig * getsym() is called as soon as it is probably ok to put the symbol in the
1408 1.53 rillig * symbol table. It is still possible that symbols are put in the symbol
1409 1.53 rillig * table that are not completely declared due to syntax errors. To avoid too
1410 1.60 rillig * many problems in this case, symbols get type 'int' in getsym().
1411 1.1 rillig *
1412 1.2 rillig * XXX calls to getsym() should be delayed until decl1*() is called.
1413 1.1 rillig */
1414 1.1 rillig sym_t *
1415 1.1 rillig getsym(sbuf_t *sb)
1416 1.1 rillig {
1417 1.1 rillig dinfo_t *di;
1418 1.1 rillig char *s;
1419 1.1 rillig sym_t *sym;
1420 1.1 rillig
1421 1.1 rillig sym = sb->sb_sym;
1422 1.1 rillig
1423 1.1 rillig /*
1424 1.1 rillig * During member declaration it is possible that name() looked
1425 1.1 rillig * for symbols of type FVFT, although it should have looked for
1426 1.1 rillig * symbols of type FTAG. Same can happen for labels. Both cases
1427 1.1 rillig * are compensated here.
1428 1.1 rillig */
1429 1.1 rillig if (symtyp == FMEMBER || symtyp == FLABEL) {
1430 1.1 rillig if (sym == NULL || sym->s_kind == FVFT)
1431 1.1 rillig sym = search(sb);
1432 1.1 rillig }
1433 1.1 rillig
1434 1.1 rillig if (sym != NULL) {
1435 1.1 rillig if (sym->s_kind != symtyp)
1436 1.20 rillig INTERNAL_ERROR("getsym(%d, %d)", sym->s_kind, symtyp);
1437 1.1 rillig symtyp = FVFT;
1438 1.1 rillig freesb(sb);
1439 1.1 rillig return sym;
1440 1.1 rillig }
1441 1.1 rillig
1442 1.1 rillig /* create a new symbol table entry */
1443 1.1 rillig
1444 1.1 rillig /* labels must always be allocated at level 1 (outermost block) */
1445 1.1 rillig if (symtyp == FLABEL) {
1446 1.22 rillig sym = getlblk(1, sizeof(*sym));
1447 1.1 rillig s = getlblk(1, sb->sb_len + 1);
1448 1.1 rillig (void)memcpy(s, sb->sb_name, sb->sb_len + 1);
1449 1.1 rillig sym->s_name = s;
1450 1.12 rillig sym->s_block_level = 1;
1451 1.1 rillig di = dcs;
1452 1.1 rillig while (di->d_next != NULL && di->d_next->d_next != NULL)
1453 1.1 rillig di = di->d_next;
1454 1.1 rillig lint_assert(di->d_ctx == AUTO);
1455 1.1 rillig } else {
1456 1.22 rillig sym = getblk(sizeof(*sym));
1457 1.1 rillig sym->s_name = sb->sb_name;
1458 1.12 rillig sym->s_block_level = block_level;
1459 1.1 rillig di = dcs;
1460 1.1 rillig }
1461 1.1 rillig
1462 1.1 rillig UNIQUE_CURR_POS(sym->s_def_pos);
1463 1.1 rillig if ((sym->s_kind = symtyp) != FLABEL)
1464 1.1 rillig sym->s_type = gettyp(INT);
1465 1.1 rillig
1466 1.1 rillig symtyp = FVFT;
1467 1.1 rillig
1468 1.62 rillig symtab_add(sym);
1469 1.1 rillig
1470 1.1 rillig *di->d_ldlsym = sym;
1471 1.1 rillig di->d_ldlsym = &sym->s_dlnxt;
1472 1.1 rillig
1473 1.1 rillig freesb(sb);
1474 1.1 rillig return sym;
1475 1.1 rillig }
1476 1.1 rillig
1477 1.1 rillig /*
1478 1.53 rillig * Construct a temporary symbol. The symbol name starts with a digit, making
1479 1.53 rillig * the name illegal.
1480 1.1 rillig */
1481 1.1 rillig sym_t *
1482 1.1 rillig mktempsym(type_t *t)
1483 1.1 rillig {
1484 1.1 rillig static int n = 0;
1485 1.12 rillig char *s = getlblk(block_level, 64);
1486 1.22 rillig sym_t *sym = getblk(sizeof(*sym));
1487 1.28 rillig scl_t scl;
1488 1.1 rillig
1489 1.1 rillig (void)snprintf(s, 64, "%.8d_tmp", n++);
1490 1.1 rillig
1491 1.28 rillig scl = dcs->d_scl;
1492 1.28 rillig if (scl == NOSCL)
1493 1.28 rillig scl = block_level > 0 ? AUTO : EXTERN;
1494 1.28 rillig
1495 1.1 rillig sym->s_name = s;
1496 1.1 rillig sym->s_type = t;
1497 1.12 rillig sym->s_block_level = block_level;
1498 1.28 rillig sym->s_scl = scl;
1499 1.1 rillig sym->s_kind = FVFT;
1500 1.1 rillig sym->s_used = true;
1501 1.1 rillig sym->s_set = true;
1502 1.1 rillig
1503 1.60 rillig symtab_add(sym);
1504 1.1 rillig
1505 1.1 rillig *dcs->d_ldlsym = sym;
1506 1.1 rillig dcs->d_ldlsym = &sym->s_dlnxt;
1507 1.1 rillig
1508 1.1 rillig return sym;
1509 1.1 rillig }
1510 1.1 rillig
1511 1.61 rillig /* Remove a symbol forever from the symbol table. */
1512 1.1 rillig void
1513 1.1 rillig rmsym(sym_t *sym)
1514 1.1 rillig {
1515 1.1 rillig
1516 1.59 rillig debug_step("rmsym '%s' %d '%s'",
1517 1.59 rillig sym->s_name, (int)sym->s_kind, type_name(sym->s_type));
1518 1.61 rillig symtab_remove(sym);
1519 1.61 rillig
1520 1.61 rillig /* avoid that the symbol will later be put back to the symbol table */
1521 1.12 rillig sym->s_block_level = -1;
1522 1.1 rillig }
1523 1.1 rillig
1524 1.1 rillig /*
1525 1.1 rillig * Remove a list of symbols declared at one level from the symbol
1526 1.1 rillig * table.
1527 1.1 rillig */
1528 1.1 rillig void
1529 1.1 rillig rmsyms(sym_t *syms)
1530 1.1 rillig {
1531 1.1 rillig sym_t *sym;
1532 1.1 rillig
1533 1.1 rillig for (sym = syms; sym != NULL; sym = sym->s_dlnxt) {
1534 1.12 rillig if (sym->s_block_level != -1) {
1535 1.59 rillig debug_step("rmsyms '%s' %d '%s'",
1536 1.59 rillig sym->s_name, (int)sym->s_kind,
1537 1.59 rillig type_name(sym->s_type));
1538 1.61 rillig symtab_remove(sym);
1539 1.1 rillig sym->s_rlink = NULL;
1540 1.1 rillig }
1541 1.1 rillig }
1542 1.1 rillig }
1543 1.1 rillig
1544 1.1 rillig /*
1545 1.2 rillig * Put a symbol into the symbol table.
1546 1.1 rillig */
1547 1.1 rillig void
1548 1.1 rillig inssym(int bl, sym_t *sym)
1549 1.1 rillig {
1550 1.1 rillig
1551 1.59 rillig debug_step("inssym '%s' %d '%s'",
1552 1.59 rillig sym->s_name, sym->s_kind, type_name(sym->s_type));
1553 1.60 rillig symtab_add(sym);
1554 1.12 rillig sym->s_block_level = bl;
1555 1.1 rillig lint_assert(sym->s_link == NULL ||
1556 1.12 rillig sym->s_block_level >= sym->s_link->s_block_level);
1557 1.1 rillig }
1558 1.1 rillig
1559 1.1 rillig /*
1560 1.2 rillig * Called at level 0 after syntax errors.
1561 1.2 rillig *
1562 1.1 rillig * Removes all symbols which are not declared at level 0 from the
1563 1.1 rillig * symbol table. Also frees all memory which is not associated with
1564 1.1 rillig * level 0.
1565 1.1 rillig */
1566 1.1 rillig void
1567 1.1 rillig cleanup(void)
1568 1.1 rillig {
1569 1.1 rillig sym_t *sym, *nsym;
1570 1.1 rillig int i;
1571 1.1 rillig
1572 1.1 rillig for (i = 0; i < HSHSIZ1; i++) {
1573 1.1 rillig for (sym = symtab[i]; sym != NULL; sym = nsym) {
1574 1.1 rillig nsym = sym->s_link;
1575 1.61 rillig if (sym->s_block_level >= 1)
1576 1.61 rillig symtab_remove(sym);
1577 1.1 rillig }
1578 1.1 rillig }
1579 1.1 rillig
1580 1.12 rillig for (i = mem_block_level; i > 0; i--)
1581 1.1 rillig freelblk(i);
1582 1.1 rillig }
1583 1.1 rillig
1584 1.1 rillig /*
1585 1.1 rillig * Create a new symbol with the name of an existing symbol.
1586 1.1 rillig */
1587 1.1 rillig sym_t *
1588 1.21 rillig pushdown(const sym_t *sym)
1589 1.1 rillig {
1590 1.1 rillig sym_t *nsym;
1591 1.1 rillig
1592 1.59 rillig debug_step("pushdown '%s' %d '%s'",
1593 1.59 rillig sym->s_name, (int)sym->s_kind, type_name(sym->s_type));
1594 1.22 rillig nsym = getblk(sizeof(*nsym));
1595 1.12 rillig lint_assert(sym->s_block_level <= block_level);
1596 1.1 rillig nsym->s_name = sym->s_name;
1597 1.1 rillig UNIQUE_CURR_POS(nsym->s_def_pos);
1598 1.1 rillig nsym->s_kind = sym->s_kind;
1599 1.12 rillig nsym->s_block_level = block_level;
1600 1.1 rillig
1601 1.60 rillig symtab_add(nsym);
1602 1.1 rillig
1603 1.1 rillig *dcs->d_ldlsym = nsym;
1604 1.1 rillig dcs->d_ldlsym = &nsym->s_dlnxt;
1605 1.1 rillig
1606 1.1 rillig return nsym;
1607 1.1 rillig }
1608 1.1 rillig
1609 1.1 rillig /*
1610 1.1 rillig * Free any dynamically allocated memory referenced by
1611 1.1 rillig * the value stack or yylval.
1612 1.1 rillig * The type of information in yylval is described by tok.
1613 1.1 rillig */
1614 1.1 rillig void
1615 1.1 rillig freeyyv(void *sp, int tok)
1616 1.1 rillig {
1617 1.1 rillig if (tok == T_NAME || tok == T_TYPENAME) {
1618 1.1 rillig sbuf_t *sb = *(sbuf_t **)sp;
1619 1.1 rillig freesb(sb);
1620 1.1 rillig } else if (tok == T_CON) {
1621 1.1 rillig val_t *val = *(val_t **)sp;
1622 1.1 rillig free(val);
1623 1.1 rillig } else if (tok == T_STRING) {
1624 1.1 rillig strg_t *strg = *(strg_t **)sp;
1625 1.1 rillig if (strg->st_tspec == CHAR) {
1626 1.1 rillig free(strg->st_cp);
1627 1.1 rillig } else {
1628 1.1 rillig lint_assert(strg->st_tspec == WCHAR);
1629 1.1 rillig free(strg->st_wcp);
1630 1.1 rillig }
1631 1.1 rillig free(strg);
1632 1.1 rillig }
1633 1.1 rillig }
1634