read.c revision 1.63 1 1.63 rillig /* $NetBSD: read.c,v 1.63 2021/08/30 21:35:23 rillig Exp $ */
2 1.2 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1996 Christopher G. Demetriou. All Rights Reserved.
5 1.1 cgd * Copyright (c) 1994, 1995 Jochen Pohl
6 1.1 cgd * All Rights Reserved.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by Jochen Pohl for
19 1.1 cgd * The NetBSD Project.
20 1.1 cgd * 4. The name of the author may not be used to endorse or promote products
21 1.1 cgd * derived from this software without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 1.1 cgd * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 1.1 cgd * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 1.1 cgd * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 1.1 cgd * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 1.1 cgd * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 1.1 cgd * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 1.1 cgd * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 1.1 cgd * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 1.1 cgd * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.14 jmc #if HAVE_NBTOOL_CONFIG_H
36 1.14 jmc #include "nbtool_config.h"
37 1.14 jmc #endif
38 1.14 jmc
39 1.5 christos #include <sys/cdefs.h>
40 1.13 tv #if defined(__RCSID) && !defined(lint)
41 1.63 rillig __RCSID("$NetBSD: read.c,v 1.63 2021/08/30 21:35:23 rillig Exp $");
42 1.1 cgd #endif
43 1.1 cgd
44 1.12 tv #include <ctype.h>
45 1.12 tv #include <limits.h>
46 1.29 rillig #include <stdarg.h>
47 1.1 cgd #include <stdio.h>
48 1.1 cgd #include <stdlib.h>
49 1.1 cgd #include <string.h>
50 1.1 cgd
51 1.1 cgd #include "lint2.h"
52 1.1 cgd
53 1.1 cgd
54 1.1 cgd /* index of current (included) source file */
55 1.1 cgd static int srcfile;
56 1.1 cgd
57 1.1 cgd /*
58 1.1 cgd * The array pointed to by inpfns maps the file name indices of input files
59 1.1 cgd * to the file name indices used in lint2
60 1.1 cgd */
61 1.1 cgd static short *inpfns;
62 1.1 cgd static size_t ninpfns;
63 1.1 cgd
64 1.1 cgd /*
65 1.36 rillig * The array pointed to by *fnames maps file name indices to file names.
66 1.1 cgd * Indices of type short are used instead of pointers to save memory.
67 1.1 cgd */
68 1.1 cgd const char **fnames;
69 1.20 christos static size_t *flines;
70 1.1 cgd static size_t nfnames;
71 1.1 cgd
72 1.1 cgd /*
73 1.1 cgd * Types are shared (to save memory for the types itself) and accessed
74 1.1 cgd * via indices (to save memory for references to types (indices are short)).
75 1.1 cgd * To share types, a equal type must be located fast. This is done by a
76 1.1 cgd * hash table. Access by indices is done via an array of pointers to the
77 1.1 cgd * types.
78 1.1 cgd */
79 1.1 cgd typedef struct thtab {
80 1.56 rillig const char *th_name;
81 1.56 rillig unsigned short th_idx;
82 1.56 rillig struct thtab *th_next;
83 1.1 cgd } thtab_t;
84 1.1 cgd static thtab_t **thtab; /* hash table */
85 1.1 cgd type_t **tlst; /* array for indexed access */
86 1.1 cgd static size_t tlstlen; /* length of tlst */
87 1.1 cgd
88 1.4 cgd static hte_t **renametab;
89 1.4 cgd
90 1.36 rillig /* index of current C source file (as specified at the command line) */
91 1.1 cgd static int csrcfile;
92 1.1 cgd
93 1.1 cgd
94 1.31 rillig #define inperr(fmt, args...) \
95 1.31 rillig inperror(__FILE__, __LINE__, fmt, ##args)
96 1.20 christos static void inperror(const char *, size_t, const char *, ...);
97 1.9 lukem static void setsrc(const char *);
98 1.9 lukem static void setfnid(int, const char *);
99 1.9 lukem static void funccall(pos_t *, const char *);
100 1.9 lukem static void decldef(pos_t *, const char *);
101 1.9 lukem static void usedsym(pos_t *, const char *);
102 1.56 rillig static unsigned short inptype(const char *, const char **);
103 1.9 lukem static int gettlen(const char *, const char **);
104 1.56 rillig static unsigned short findtype(const char *, size_t, int);
105 1.56 rillig static unsigned short storetyp(type_t *, const char *, size_t, int);
106 1.9 lukem static int thash(const char *, size_t);
107 1.9 lukem static char *inpqstrg(const char *, const char **);
108 1.9 lukem static const char *inpname(const char *, const char **);
109 1.9 lukem static int getfnidx(const char *);
110 1.1 cgd
111 1.44 rillig static bool
112 1.44 rillig try_parse_int(const char **p, int *num)
113 1.44 rillig {
114 1.44 rillig char *end;
115 1.44 rillig
116 1.44 rillig *num = (int)strtol(*p, &end, 10);
117 1.44 rillig if (end == *p)
118 1.44 rillig return false;
119 1.44 rillig *p = end;
120 1.44 rillig return true;
121 1.44 rillig }
122 1.44 rillig
123 1.44 rillig static int
124 1.44 rillig parse_int(const char **p)
125 1.44 rillig {
126 1.44 rillig char *end;
127 1.44 rillig int n;
128 1.44 rillig
129 1.44 rillig n = (int)strtol(*p, &end, 10);
130 1.44 rillig if (end == *p)
131 1.44 rillig inperr("not a number: %s", *p);
132 1.44 rillig *p = end;
133 1.44 rillig return n;
134 1.44 rillig }
135 1.44 rillig
136 1.44 rillig static short
137 1.44 rillig parse_short(const char **p)
138 1.44 rillig {
139 1.61 rillig return (short)parse_int(p);
140 1.44 rillig }
141 1.44 rillig
142 1.1 cgd void
143 1.9 lukem readfile(const char *name)
144 1.1 cgd {
145 1.1 cgd FILE *inp;
146 1.1 cgd size_t len;
147 1.1 cgd const char *cp;
148 1.44 rillig char *line, rt = '\0';
149 1.1 cgd int cline, isrc, iline;
150 1.1 cgd pos_t pos;
151 1.1 cgd
152 1.1 cgd if (inpfns == NULL)
153 1.42 rillig inpfns = xcalloc(ninpfns = 128, sizeof(*inpfns));
154 1.1 cgd if (fnames == NULL)
155 1.42 rillig fnames = xcalloc(nfnames = 256, sizeof(*fnames));
156 1.20 christos if (flines == NULL)
157 1.42 rillig flines = xcalloc(nfnames, sizeof(*flines));
158 1.1 cgd if (tlstlen == 0)
159 1.42 rillig tlst = xcalloc(tlstlen = 256, sizeof(*tlst));
160 1.1 cgd if (thtab == NULL)
161 1.42 rillig thtab = xcalloc(THSHSIZ2, sizeof(*thtab));
162 1.1 cgd
163 1.4 cgd _inithash(&renametab);
164 1.4 cgd
165 1.1 cgd srcfile = getfnidx(name);
166 1.1 cgd
167 1.1 cgd if ((inp = fopen(name, "r")) == NULL)
168 1.1 cgd err(1, "cannot open %s", name);
169 1.1 cgd
170 1.1 cgd while ((line = fgetln(inp, &len)) != NULL) {
171 1.20 christos flines[srcfile]++;
172 1.1 cgd
173 1.1 cgd if (len == 0 || line[len - 1] != '\n')
174 1.20 christos inperr("%s", &line[len - 1]);
175 1.1 cgd line[len - 1] = '\0';
176 1.1 cgd cp = line;
177 1.1 cgd
178 1.1 cgd /* line number in csrcfile */
179 1.44 rillig if (!try_parse_int(&cp, &cline))
180 1.44 rillig cline = -1;
181 1.1 cgd
182 1.1 cgd /* record type */
183 1.43 rillig if (*cp == '\0')
184 1.43 rillig inperr("missing record type");
185 1.43 rillig rt = *cp++;
186 1.1 cgd
187 1.1 cgd if (rt == 'S') {
188 1.1 cgd setsrc(cp);
189 1.1 cgd continue;
190 1.1 cgd } else if (rt == 's') {
191 1.1 cgd setfnid(cline, cp);
192 1.1 cgd continue;
193 1.1 cgd }
194 1.1 cgd
195 1.1 cgd /*
196 1.1 cgd * Index of (included) source file. If this index is
197 1.1 cgd * different from csrcfile, it refers to an included
198 1.1 cgd * file.
199 1.1 cgd */
200 1.44 rillig isrc = parse_int(&cp);
201 1.1 cgd isrc = inpfns[isrc];
202 1.1 cgd
203 1.1 cgd /* line number in isrc */
204 1.1 cgd if (*cp++ != '.')
205 1.20 christos inperr("bad line number");
206 1.44 rillig iline = parse_int(&cp);
207 1.1 cgd
208 1.56 rillig pos.p_src = (unsigned short)csrcfile;
209 1.56 rillig pos.p_line = (unsigned short)cline;
210 1.56 rillig pos.p_isrc = (unsigned short)isrc;
211 1.56 rillig pos.p_iline = (unsigned short)iline;
212 1.1 cgd
213 1.1 cgd /* process rest of this record */
214 1.1 cgd switch (rt) {
215 1.1 cgd case 'c':
216 1.1 cgd funccall(&pos, cp);
217 1.1 cgd break;
218 1.1 cgd case 'd':
219 1.1 cgd decldef(&pos, cp);
220 1.1 cgd break;
221 1.1 cgd case 'u':
222 1.1 cgd usedsym(&pos, cp);
223 1.1 cgd break;
224 1.1 cgd default:
225 1.20 christos inperr("bad record type %c", rt);
226 1.1 cgd }
227 1.1 cgd
228 1.1 cgd }
229 1.1 cgd
230 1.4 cgd _destroyhash(renametab);
231 1.4 cgd
232 1.37 rillig if (ferror(inp) != 0)
233 1.1 cgd err(1, "read error on %s", name);
234 1.1 cgd
235 1.1 cgd (void)fclose(inp);
236 1.1 cgd }
237 1.1 cgd
238 1.1 cgd
239 1.45 rillig static void __attribute__((format(printf, 3, 4))) __attribute__((noreturn))
240 1.20 christos inperror(const char *file, size_t line, const char *fmt, ...)
241 1.1 cgd {
242 1.20 christos va_list ap;
243 1.20 christos char buf[1024];
244 1.9 lukem
245 1.20 christos va_start(ap, fmt);
246 1.42 rillig (void)vsnprintf(buf, sizeof(buf), fmt, ap);
247 1.20 christos va_end(ap);
248 1.20 christos
249 1.20 christos errx(1, "%s,%zu: input file error: %s,%zu (%s)", file, line,
250 1.20 christos fnames[srcfile], flines[srcfile], buf);
251 1.1 cgd }
252 1.1 cgd
253 1.1 cgd /*
254 1.1 cgd * Set the name of the C source file of the .ln file which is
255 1.1 cgd * currently read.
256 1.1 cgd */
257 1.1 cgd static void
258 1.9 lukem setsrc(const char *cp)
259 1.1 cgd {
260 1.9 lukem
261 1.1 cgd csrcfile = getfnidx(cp);
262 1.1 cgd }
263 1.1 cgd
264 1.1 cgd /*
265 1.1 cgd * setfnid() gets as input an index as used in an input file and the
266 1.10 wiz * associated file name. If necessary, it creates a new lint2 file
267 1.1 cgd * name index for this file name and creates the mapping of the index
268 1.1 cgd * as used in the input file to the index used in lint2.
269 1.1 cgd */
270 1.1 cgd static void
271 1.9 lukem setfnid(int fid, const char *cp)
272 1.1 cgd {
273 1.9 lukem
274 1.25 christos if (fid < 0)
275 1.20 christos inperr("bad fid");
276 1.1 cgd
277 1.25 christos if ((size_t)fid >= ninpfns) {
278 1.42 rillig inpfns = xrealloc(inpfns, (ninpfns * 2) * sizeof(*inpfns));
279 1.42 rillig (void)memset(inpfns + ninpfns, 0, ninpfns * sizeof(*inpfns));
280 1.1 cgd ninpfns *= 2;
281 1.1 cgd }
282 1.1 cgd /*
283 1.1 cgd * Should always be true because indices written in the output
284 1.1 cgd * file by lint1 are always the previous index + 1.
285 1.1 cgd */
286 1.25 christos if ((size_t)fid >= ninpfns)
287 1.1 cgd errx(1, "internal error: setfnid()");
288 1.56 rillig inpfns[fid] = (unsigned short)getfnidx(cp);
289 1.1 cgd }
290 1.1 cgd
291 1.1 cgd /*
292 1.1 cgd * Process a function call record (c-record).
293 1.1 cgd */
294 1.1 cgd static void
295 1.9 lukem funccall(pos_t *posp, const char *cp)
296 1.1 cgd {
297 1.1 cgd arginf_t *ai, **lai;
298 1.44 rillig char c;
299 1.37 rillig bool rused, rdisc;
300 1.1 cgd hte_t *hte;
301 1.1 cgd fcall_t *fcall;
302 1.4 cgd const char *name;
303 1.1 cgd
304 1.42 rillig fcall = xalloc(sizeof(*fcall));
305 1.34 rillig fcall->f_pos = *posp;
306 1.1 cgd
307 1.1 cgd /* read flags */
308 1.37 rillig rused = rdisc = false;
309 1.1 cgd lai = &fcall->f_args;
310 1.1 cgd while ((c = *cp) == 'u' || c == 'i' || c == 'd' ||
311 1.1 cgd c == 'z' || c == 'p' || c == 'n' || c == 's') {
312 1.1 cgd cp++;
313 1.1 cgd switch (c) {
314 1.1 cgd case 'u':
315 1.1 cgd if (rused || rdisc)
316 1.20 christos inperr("used or discovered: %c", c);
317 1.37 rillig rused = true;
318 1.1 cgd break;
319 1.1 cgd case 'i':
320 1.1 cgd if (rused || rdisc)
321 1.20 christos inperr("used or discovered: %c", c);
322 1.1 cgd break;
323 1.1 cgd case 'd':
324 1.1 cgd if (rused || rdisc)
325 1.20 christos inperr("used or discovered: %c", c);
326 1.37 rillig rdisc = true;
327 1.1 cgd break;
328 1.1 cgd case 'z':
329 1.1 cgd case 'p':
330 1.1 cgd case 'n':
331 1.1 cgd case 's':
332 1.42 rillig ai = xalloc(sizeof(*ai));
333 1.44 rillig ai->a_num = parse_int(&cp);
334 1.1 cgd if (c == 'z') {
335 1.37 rillig ai->a_pcon = ai->a_zero = true;
336 1.1 cgd } else if (c == 'p') {
337 1.37 rillig ai->a_pcon = true;
338 1.1 cgd } else if (c == 'n') {
339 1.37 rillig ai->a_ncon = true;
340 1.1 cgd } else {
341 1.37 rillig ai->a_fmt = true;
342 1.1 cgd ai->a_fstrg = inpqstrg(cp, &cp);
343 1.1 cgd }
344 1.1 cgd *lai = ai;
345 1.33 rillig lai = &ai->a_next;
346 1.1 cgd break;
347 1.1 cgd }
348 1.1 cgd }
349 1.1 cgd fcall->f_rused = rused;
350 1.1 cgd fcall->f_rdisc = rdisc;
351 1.1 cgd
352 1.1 cgd /* read name of function */
353 1.4 cgd name = inpname(cp, &cp);
354 1.4 cgd
355 1.4 cgd /* first look it up in the renaming table, then in the normal table */
356 1.38 rillig hte = _hsearch(renametab, name, false);
357 1.4 cgd if (hte != NULL)
358 1.4 cgd hte = hte->h_hte;
359 1.4 cgd else
360 1.38 rillig hte = hsearch(name, true);
361 1.37 rillig hte->h_used = true;
362 1.1 cgd
363 1.1 cgd fcall->f_type = inptype(cp, &cp);
364 1.1 cgd
365 1.1 cgd *hte->h_lcall = fcall;
366 1.33 rillig hte->h_lcall = &fcall->f_next;
367 1.1 cgd
368 1.1 cgd if (*cp != '\0')
369 1.20 christos inperr("trailing line data: %s", cp);
370 1.1 cgd }
371 1.1 cgd
372 1.63 rillig static bool
373 1.63 rillig parse_function_attribute(const char **pp, sym_t *sym, bool *used)
374 1.63 rillig {
375 1.63 rillig
376 1.63 rillig switch (*(*pp)++) {
377 1.63 rillig case 'd':
378 1.63 rillig if (sym->s_def != NODECL)
379 1.63 rillig inperr("def");
380 1.63 rillig sym->s_def = DEF;
381 1.63 rillig break;
382 1.63 rillig case 'e':
383 1.63 rillig if (sym->s_def != NODECL)
384 1.63 rillig inperr("decl");
385 1.63 rillig sym->s_def = DECL;
386 1.63 rillig break;
387 1.63 rillig case 'i':
388 1.63 rillig if (sym->s_inline)
389 1.63 rillig inperr("inline");
390 1.63 rillig sym->s_inline = true;
391 1.63 rillig break;
392 1.63 rillig case 'o':
393 1.63 rillig if (sym->s_old_style_function)
394 1.63 rillig inperr("osdef");
395 1.63 rillig sym->s_old_style_function = true;
396 1.63 rillig break;
397 1.63 rillig case 'r':
398 1.63 rillig if (sym->s_function_has_return_value)
399 1.63 rillig inperr("r");
400 1.63 rillig sym->s_function_has_return_value = true;
401 1.63 rillig break;
402 1.63 rillig case 's':
403 1.63 rillig if (sym->s_static)
404 1.63 rillig inperr("static");
405 1.63 rillig sym->s_static = true;
406 1.63 rillig break;
407 1.63 rillig case 't':
408 1.63 rillig if (sym->s_def != NODECL)
409 1.63 rillig inperr("tdef");
410 1.63 rillig sym->s_def = TDEF;
411 1.63 rillig break;
412 1.63 rillig case 'u':
413 1.63 rillig if (*used)
414 1.63 rillig inperr("used");
415 1.63 rillig *used = true;
416 1.63 rillig break;
417 1.63 rillig case 'v':
418 1.63 rillig if (sym->s_check_only_first_args)
419 1.63 rillig inperr("v");
420 1.63 rillig sym->s_check_only_first_args = true;
421 1.63 rillig sym->s_check_num_args = parse_short(pp);
422 1.63 rillig break;
423 1.63 rillig case 'P':
424 1.63 rillig if (sym->s_printflike)
425 1.63 rillig inperr("P");
426 1.63 rillig sym->s_printflike = true;
427 1.63 rillig sym->s_printflike_arg = parse_short(pp);
428 1.63 rillig break;
429 1.63 rillig case 'S':
430 1.63 rillig if (sym->s_scanflike)
431 1.63 rillig inperr("S");
432 1.63 rillig sym->s_scanflike = true;
433 1.63 rillig sym->s_scanflike_arg = parse_short(pp);
434 1.63 rillig break;
435 1.63 rillig default:
436 1.63 rillig (*pp)--;
437 1.63 rillig return false;
438 1.63 rillig }
439 1.63 rillig return true;
440 1.63 rillig }
441 1.63 rillig
442 1.1 cgd /*
443 1.1 cgd * Process a declaration or definition (d-record).
444 1.1 cgd */
445 1.1 cgd static void
446 1.9 lukem decldef(pos_t *posp, const char *cp)
447 1.1 cgd {
448 1.1 cgd sym_t *symp, sym;
449 1.63 rillig char *pos1, *tname;
450 1.37 rillig bool used, renamed;
451 1.5 christos hte_t *hte, *renamehte = NULL;
452 1.24 lukem const char *name, *newname;
453 1.1 cgd
454 1.42 rillig (void)memset(&sym, 0, sizeof(sym));
455 1.34 rillig sym.s_pos = *posp;
456 1.1 cgd sym.s_def = NODECL;
457 1.1 cgd
458 1.37 rillig used = false;
459 1.1 cgd
460 1.63 rillig while (parse_function_attribute(&cp, &sym, &used))
461 1.63 rillig continue;
462 1.1 cgd
463 1.4 cgd /* read symbol name, doing renaming if necessary */
464 1.4 cgd name = inpname(cp, &cp);
465 1.37 rillig renamed = false;
466 1.4 cgd if (*cp == 'r') {
467 1.4 cgd cp++;
468 1.24 lukem tname = xstrdup(name);
469 1.24 lukem newname = inpname(cp, &cp);
470 1.4 cgd
471 1.4 cgd /* enter it and see if it's already been renamed */
472 1.38 rillig renamehte = _hsearch(renametab, tname, true);
473 1.4 cgd if (renamehte->h_hte == NULL) {
474 1.38 rillig hte = hsearch(newname, true);
475 1.4 cgd renamehte->h_hte = hte;
476 1.37 rillig renamed = true;
477 1.37 rillig } else if (hte = renamehte->h_hte,
478 1.37 rillig strcmp(hte->h_name, newname) != 0) {
479 1.4 cgd pos1 = xstrdup(mkpos(&renamehte->h_syms->s_pos));
480 1.40 rillig /* %s renamed multiple times \t%s :: %s */
481 1.24 lukem msg(18, tname, pos1, mkpos(&sym.s_pos));
482 1.4 cgd free(pos1);
483 1.4 cgd }
484 1.24 lukem free(tname);
485 1.4 cgd } else {
486 1.4 cgd /* it might be a previously-done rename */
487 1.38 rillig hte = _hsearch(renametab, name, false);
488 1.4 cgd if (hte != NULL)
489 1.4 cgd hte = hte->h_hte;
490 1.4 cgd else
491 1.38 rillig hte = hsearch(name, true);
492 1.4 cgd }
493 1.1 cgd hte->h_used |= used;
494 1.1 cgd if (sym.s_def == DEF || sym.s_def == TDEF)
495 1.37 rillig hte->h_def = true;
496 1.1 cgd
497 1.1 cgd sym.s_type = inptype(cp, &cp);
498 1.1 cgd
499 1.1 cgd /*
500 1.1 cgd * Allocate memory for this symbol only if it was not already
501 1.1 cgd * declared or tentatively defined at the same location with
502 1.1 cgd * the same type. Works only for symbols with external linkage,
503 1.1 cgd * because static symbols, tentatively defined at the same location
504 1.1 cgd * but in different translation units are really different symbols.
505 1.1 cgd */
506 1.32 rillig for (symp = hte->h_syms; symp != NULL; symp = symp->s_next) {
507 1.1 cgd if (symp->s_pos.p_isrc == sym.s_pos.p_isrc &&
508 1.1 cgd symp->s_pos.p_iline == sym.s_pos.p_iline &&
509 1.1 cgd symp->s_type == sym.s_type &&
510 1.1 cgd ((symp->s_def == DECL && sym.s_def == DECL) ||
511 1.1 cgd (!sflag && symp->s_def == TDEF && sym.s_def == TDEF)) &&
512 1.1 cgd !symp->s_static && !sym.s_static) {
513 1.1 cgd break;
514 1.1 cgd }
515 1.1 cgd }
516 1.1 cgd
517 1.1 cgd if (symp == NULL) {
518 1.57 rillig if (sym.s_check_only_first_args ||
519 1.57 rillig sym.s_printflike || sym.s_scanflike) {
520 1.42 rillig symp = xalloc(sizeof(*symp));
521 1.34 rillig *symp = sym;
522 1.1 cgd } else {
523 1.57 rillig /* no need to allocate memory for unused members */
524 1.42 rillig symp = xalloc(sizeof(symp->s_s));
525 1.34 rillig symp->s_s = sym.s_s;
526 1.1 cgd }
527 1.1 cgd *hte->h_lsym = symp;
528 1.32 rillig hte->h_lsym = &symp->s_next;
529 1.4 cgd
530 1.4 cgd /* XXX hack so we can remember where a symbol was renamed */
531 1.4 cgd if (renamed)
532 1.4 cgd renamehte->h_syms = symp;
533 1.1 cgd }
534 1.1 cgd
535 1.1 cgd if (*cp != '\0')
536 1.20 christos inperr("trailing line: %s", cp);
537 1.1 cgd }
538 1.1 cgd
539 1.1 cgd /*
540 1.36 rillig * Read an u-record (emitted by lint1 if a symbol was used).
541 1.1 cgd */
542 1.1 cgd static void
543 1.9 lukem usedsym(pos_t *posp, const char *cp)
544 1.1 cgd {
545 1.1 cgd usym_t *usym;
546 1.1 cgd hte_t *hte;
547 1.4 cgd const char *name;
548 1.1 cgd
549 1.42 rillig usym = xalloc(sizeof(*usym));
550 1.34 rillig usym->u_pos = *posp;
551 1.1 cgd
552 1.1 cgd /* needed as delimiter between two numbers */
553 1.1 cgd if (*cp++ != 'x')
554 1.20 christos inperr("bad delim %c", cp[-1]);
555 1.1 cgd
556 1.4 cgd name = inpname(cp, &cp);
557 1.38 rillig hte = _hsearch(renametab, name, false);
558 1.4 cgd if (hte != NULL)
559 1.4 cgd hte = hte->h_hte;
560 1.4 cgd else
561 1.38 rillig hte = hsearch(name, true);
562 1.37 rillig hte->h_used = true;
563 1.1 cgd
564 1.1 cgd *hte->h_lusym = usym;
565 1.33 rillig hte->h_lusym = &usym->u_next;
566 1.1 cgd }
567 1.1 cgd
568 1.50 rillig static tspec_t
569 1.50 rillig parse_tspec(const char **pp, char c, bool *osdef)
570 1.50 rillig {
571 1.50 rillig char s;
572 1.50 rillig
573 1.50 rillig switch (c) {
574 1.50 rillig case 's': /* 'signed' or 'struct' or 'float' */
575 1.50 rillig case 'u': /* 'unsigned' or 'union' */
576 1.50 rillig case 'l': /* 'long double' */
577 1.50 rillig case 'e': /* 'enum' */
578 1.50 rillig s = c;
579 1.50 rillig c = *(*pp)++;
580 1.50 rillig break;
581 1.50 rillig default:
582 1.50 rillig s = '\0';
583 1.50 rillig break;
584 1.50 rillig }
585 1.50 rillig
586 1.50 rillig switch (c) {
587 1.50 rillig case 'B':
588 1.50 rillig return BOOL;
589 1.50 rillig case 'C':
590 1.50 rillig return s == 's' ? SCHAR : (s == 'u' ? UCHAR : CHAR);
591 1.50 rillig case 'S':
592 1.50 rillig return s == 'u' ? USHORT : SHORT;
593 1.50 rillig case 'I':
594 1.50 rillig return s == 'u' ? UINT : INT;
595 1.50 rillig case 'L':
596 1.50 rillig return s == 'u' ? ULONG : LONG;
597 1.50 rillig case 'Q':
598 1.50 rillig return s == 'u' ? UQUAD : QUAD;
599 1.50 rillig #ifdef INT128_SIZE
600 1.50 rillig case 'J':
601 1.50 rillig return s == 'u' ? UINT128 : INT128;
602 1.50 rillig #endif
603 1.50 rillig case 'D':
604 1.50 rillig return s == 's' ? FLOAT : (s == 'l' ? LDOUBLE : DOUBLE);
605 1.50 rillig case 'V':
606 1.50 rillig return VOID;
607 1.50 rillig case 'P':
608 1.50 rillig return PTR;
609 1.50 rillig case 'A':
610 1.50 rillig return ARRAY;
611 1.50 rillig case 'F':
612 1.50 rillig case 'f':
613 1.50 rillig *osdef = c == 'f';
614 1.50 rillig return FUNC;
615 1.50 rillig case 'T':
616 1.50 rillig return s == 'e' ? ENUM : (s == 's' ? STRUCT : UNION);
617 1.50 rillig case 'X':
618 1.50 rillig return s == 's' ? FCOMPLEX
619 1.50 rillig : (s == 'l' ? LCOMPLEX : DCOMPLEX);
620 1.50 rillig default:
621 1.50 rillig inperr("tspec '%c'", c);
622 1.50 rillig }
623 1.50 rillig }
624 1.50 rillig
625 1.1 cgd /*
626 1.1 cgd * Read a type and return the index of this type.
627 1.1 cgd */
628 1.56 rillig static unsigned short
629 1.9 lukem inptype(const char *cp, const char **epp)
630 1.1 cgd {
631 1.50 rillig char c;
632 1.1 cgd const char *ep;
633 1.1 cgd type_t *tp;
634 1.37 rillig int narg, i;
635 1.37 rillig bool osdef = false;
636 1.1 cgd size_t tlen;
637 1.56 rillig unsigned short tidx;
638 1.1 cgd int h;
639 1.1 cgd
640 1.26 snj /* If we have this type already, return its index. */
641 1.1 cgd tlen = gettlen(cp, &ep);
642 1.1 cgd h = thash(cp, tlen);
643 1.1 cgd if ((tidx = findtype(cp, tlen, h)) != 0) {
644 1.1 cgd *epp = ep;
645 1.30 rillig return tidx;
646 1.1 cgd }
647 1.1 cgd
648 1.1 cgd /* No, we must create a new type. */
649 1.42 rillig tp = xalloc(sizeof(*tp));
650 1.1 cgd
651 1.1 cgd tidx = storetyp(tp, cp, tlen, h);
652 1.1 cgd
653 1.1 cgd c = *cp++;
654 1.1 cgd
655 1.53 rillig if (c == 'c') {
656 1.53 rillig tp->t_const = true;
657 1.53 rillig c = *cp++;
658 1.53 rillig }
659 1.53 rillig if (c == 'v') {
660 1.53 rillig tp->t_volatile = true;
661 1.1 cgd c = *cp++;
662 1.1 cgd }
663 1.1 cgd
664 1.50 rillig tp->t_tspec = parse_tspec(&cp, c, &osdef);
665 1.1 cgd
666 1.1 cgd switch (tp->t_tspec) {
667 1.1 cgd case ARRAY:
668 1.44 rillig tp->t_dim = parse_int(&cp);
669 1.51 rillig tp->t_subt = TP(inptype(cp, &cp));
670 1.1 cgd break;
671 1.1 cgd case PTR:
672 1.51 rillig tp->t_subt = TP(inptype(cp, &cp));
673 1.1 cgd break;
674 1.1 cgd case FUNC:
675 1.1 cgd c = *cp;
676 1.37 rillig if (ch_isdigit(c)) {
677 1.1 cgd if (!osdef)
678 1.37 rillig tp->t_proto = true;
679 1.44 rillig narg = parse_int(&cp);
680 1.51 rillig tp->t_args = xcalloc((size_t)narg + 1,
681 1.42 rillig sizeof(*tp->t_args));
682 1.1 cgd for (i = 0; i < narg; i++) {
683 1.1 cgd if (i == narg - 1 && *cp == 'E') {
684 1.37 rillig tp->t_vararg = true;
685 1.1 cgd cp++;
686 1.1 cgd } else {
687 1.51 rillig tp->t_args[i] = TP(inptype(cp, &cp));
688 1.1 cgd }
689 1.1 cgd }
690 1.1 cgd }
691 1.51 rillig tp->t_subt = TP(inptype(cp, &cp));
692 1.1 cgd break;
693 1.1 cgd case ENUM:
694 1.1 cgd tp->t_tspec = INT;
695 1.39 rillig tp->t_is_enum = true;
696 1.1 cgd /* FALLTHROUGH */
697 1.1 cgd case STRUCT:
698 1.1 cgd case UNION:
699 1.1 cgd switch (*cp++) {
700 1.1 cgd case '1':
701 1.37 rillig tp->t_istag = true;
702 1.38 rillig tp->t_tag = hsearch(inpname(cp, &cp), true);
703 1.1 cgd break;
704 1.1 cgd case '2':
705 1.37 rillig tp->t_istynam = true;
706 1.38 rillig tp->t_tynam = hsearch(inpname(cp, &cp), true);
707 1.1 cgd break;
708 1.3 cgd case '3':
709 1.37 rillig tp->t_isuniqpos = true;
710 1.44 rillig tp->t_uniqpos.p_line = parse_int(&cp);
711 1.3 cgd cp++;
712 1.3 cgd /* xlate to 'global' file name. */
713 1.3 cgd tp->t_uniqpos.p_file =
714 1.44 rillig addoutfile(inpfns[parse_int(&cp)]);
715 1.3 cgd cp++;
716 1.44 rillig tp->t_uniqpos.p_uniq = parse_int(&cp);
717 1.3 cgd break;
718 1.1 cgd }
719 1.1 cgd break;
720 1.52 rillig default:
721 1.5 christos break;
722 1.1 cgd }
723 1.1 cgd
724 1.1 cgd *epp = cp;
725 1.30 rillig return tidx;
726 1.1 cgd }
727 1.1 cgd
728 1.1 cgd /*
729 1.1 cgd * Get the length of a type string.
730 1.1 cgd */
731 1.1 cgd static int
732 1.9 lukem gettlen(const char *cp, const char **epp)
733 1.1 cgd {
734 1.1 cgd const char *cp1;
735 1.44 rillig char c, s;
736 1.1 cgd tspec_t t;
737 1.37 rillig int narg, i;
738 1.1 cgd
739 1.1 cgd cp1 = cp;
740 1.1 cgd
741 1.1 cgd c = *cp++;
742 1.1 cgd
743 1.53 rillig if (c == 'c')
744 1.53 rillig c = *cp++;
745 1.53 rillig if (c == 'v')
746 1.1 cgd c = *cp++;
747 1.1 cgd
748 1.22 christos switch (c) {
749 1.22 christos case 's':
750 1.22 christos case 'u':
751 1.22 christos case 'l':
752 1.22 christos case 'e':
753 1.1 cgd s = c;
754 1.1 cgd c = *cp++;
755 1.22 christos break;
756 1.22 christos default:
757 1.1 cgd s = '\0';
758 1.22 christos break;
759 1.1 cgd }
760 1.1 cgd
761 1.1 cgd t = NOTSPEC;
762 1.1 cgd
763 1.1 cgd switch (c) {
764 1.15 yamt case 'B':
765 1.15 yamt if (s == '\0')
766 1.15 yamt t = BOOL;
767 1.15 yamt break;
768 1.1 cgd case 'C':
769 1.1 cgd if (s == 's') {
770 1.1 cgd t = SCHAR;
771 1.1 cgd } else if (s == 'u') {
772 1.1 cgd t = UCHAR;
773 1.1 cgd } else if (s == '\0') {
774 1.1 cgd t = CHAR;
775 1.1 cgd }
776 1.1 cgd break;
777 1.1 cgd case 'S':
778 1.1 cgd if (s == 'u') {
779 1.1 cgd t = USHORT;
780 1.1 cgd } else if (s == '\0') {
781 1.1 cgd t = SHORT;
782 1.1 cgd }
783 1.1 cgd break;
784 1.1 cgd case 'I':
785 1.1 cgd if (s == 'u') {
786 1.1 cgd t = UINT;
787 1.1 cgd } else if (s == '\0') {
788 1.1 cgd t = INT;
789 1.1 cgd }
790 1.1 cgd break;
791 1.1 cgd case 'L':
792 1.1 cgd if (s == 'u') {
793 1.1 cgd t = ULONG;
794 1.1 cgd } else if (s == '\0') {
795 1.1 cgd t = LONG;
796 1.1 cgd }
797 1.1 cgd break;
798 1.1 cgd case 'Q':
799 1.1 cgd if (s == 'u') {
800 1.1 cgd t = UQUAD;
801 1.1 cgd } else if (s == '\0') {
802 1.1 cgd t = QUAD;
803 1.1 cgd }
804 1.1 cgd break;
805 1.47 rillig #ifdef INT128_SIZE
806 1.47 rillig case 'J':
807 1.47 rillig if (s == 'u') {
808 1.47 rillig t = UINT128;
809 1.47 rillig } else if (s == '\0') {
810 1.47 rillig t = INT128;
811 1.47 rillig }
812 1.47 rillig break;
813 1.47 rillig #endif
814 1.1 cgd case 'D':
815 1.1 cgd if (s == 's') {
816 1.1 cgd t = FLOAT;
817 1.1 cgd } else if (s == 'l') {
818 1.1 cgd t = LDOUBLE;
819 1.1 cgd } else if (s == '\0') {
820 1.1 cgd t = DOUBLE;
821 1.1 cgd }
822 1.1 cgd break;
823 1.1 cgd case 'V':
824 1.1 cgd if (s == '\0')
825 1.1 cgd t = VOID;
826 1.1 cgd break;
827 1.1 cgd case 'P':
828 1.1 cgd if (s == '\0')
829 1.1 cgd t = PTR;
830 1.1 cgd break;
831 1.1 cgd case 'A':
832 1.1 cgd if (s == '\0')
833 1.1 cgd t = ARRAY;
834 1.1 cgd break;
835 1.1 cgd case 'F':
836 1.1 cgd case 'f':
837 1.1 cgd if (s == '\0')
838 1.1 cgd t = FUNC;
839 1.1 cgd break;
840 1.1 cgd case 'T':
841 1.1 cgd if (s == 'e') {
842 1.1 cgd t = ENUM;
843 1.1 cgd } else if (s == 's') {
844 1.1 cgd t = STRUCT;
845 1.1 cgd } else if (s == 'u') {
846 1.1 cgd t = UNION;
847 1.1 cgd }
848 1.1 cgd break;
849 1.20 christos case 'X':
850 1.22 christos if (s == 's') {
851 1.22 christos t = FCOMPLEX;
852 1.23 matt } else if (s == 'l') {
853 1.23 matt t = LCOMPLEX;
854 1.22 christos } else if (s == '\0') {
855 1.20 christos t = DCOMPLEX;
856 1.20 christos }
857 1.20 christos break;
858 1.1 cgd default:
859 1.52 rillig break;
860 1.1 cgd }
861 1.1 cgd
862 1.52 rillig if (t == NOTSPEC)
863 1.52 rillig inperr("bad type: %c %c", c, s);
864 1.1 cgd
865 1.1 cgd switch (t) {
866 1.1 cgd case ARRAY:
867 1.44 rillig (void)parse_int(&cp);
868 1.1 cgd (void)gettlen(cp, &cp);
869 1.1 cgd break;
870 1.1 cgd case PTR:
871 1.1 cgd (void)gettlen(cp, &cp);
872 1.1 cgd break;
873 1.1 cgd case FUNC:
874 1.1 cgd c = *cp;
875 1.37 rillig if (ch_isdigit(c)) {
876 1.44 rillig narg = parse_int(&cp);
877 1.1 cgd for (i = 0; i < narg; i++) {
878 1.1 cgd if (i == narg - 1 && *cp == 'E') {
879 1.1 cgd cp++;
880 1.1 cgd } else {
881 1.1 cgd (void)gettlen(cp, &cp);
882 1.1 cgd }
883 1.1 cgd }
884 1.1 cgd }
885 1.1 cgd (void)gettlen(cp, &cp);
886 1.1 cgd break;
887 1.1 cgd case ENUM:
888 1.1 cgd case STRUCT:
889 1.1 cgd case UNION:
890 1.1 cgd switch (*cp++) {
891 1.1 cgd case '1':
892 1.1 cgd case '2':
893 1.1 cgd (void)inpname(cp, &cp);
894 1.3 cgd break;
895 1.3 cgd case '3':
896 1.3 cgd /* unique position: line.file.uniquifier */
897 1.44 rillig (void)parse_int(&cp);
898 1.3 cgd if (*cp++ != '.')
899 1.20 christos inperr("not dot: %c", cp[-1]);
900 1.44 rillig (void)parse_int(&cp);
901 1.3 cgd if (*cp++ != '.')
902 1.20 christos inperr("not dot: %c", cp[-1]);
903 1.44 rillig (void)parse_int(&cp);
904 1.1 cgd break;
905 1.1 cgd default:
906 1.55 rillig inperr("bad value: %c", cp[-1]);
907 1.1 cgd }
908 1.1 cgd break;
909 1.52 rillig default:
910 1.5 christos break;
911 1.1 cgd }
912 1.1 cgd
913 1.1 cgd *epp = cp;
914 1.30 rillig return cp - cp1;
915 1.1 cgd }
916 1.1 cgd
917 1.1 cgd /*
918 1.26 snj * Search a type by its type string.
919 1.1 cgd */
920 1.56 rillig static unsigned short
921 1.9 lukem findtype(const char *cp, size_t len, int h)
922 1.1 cgd {
923 1.1 cgd thtab_t *thte;
924 1.1 cgd
925 1.33 rillig for (thte = thtab[h]; thte != NULL; thte = thte->th_next) {
926 1.1 cgd if (strncmp(thte->th_name, cp, len) != 0)
927 1.1 cgd continue;
928 1.1 cgd if (thte->th_name[len] == '\0')
929 1.30 rillig return thte->th_idx;
930 1.1 cgd }
931 1.1 cgd
932 1.30 rillig return 0;
933 1.1 cgd }
934 1.1 cgd
935 1.1 cgd /*
936 1.51 rillig * Store a type and its type string, so we can later share this type
937 1.1 cgd * if we read the same type string from the input file.
938 1.1 cgd */
939 1.56 rillig static unsigned short
940 1.9 lukem storetyp(type_t *tp, const char *cp, size_t len, int h)
941 1.1 cgd {
942 1.56 rillig static unsigned int tidx = 1; /* 0 is reserved */
943 1.1 cgd thtab_t *thte;
944 1.1 cgd char *name;
945 1.1 cgd
946 1.1 cgd if (tidx >= USHRT_MAX)
947 1.1 cgd errx(1, "sorry, too many types");
948 1.1 cgd
949 1.1 cgd if (tidx == tlstlen - 1) {
950 1.42 rillig tlst = xrealloc(tlst, (tlstlen * 2) * sizeof(*tlst));
951 1.42 rillig (void)memset(tlst + tlstlen, 0, tlstlen * sizeof(*tlst));
952 1.1 cgd tlstlen *= 2;
953 1.1 cgd }
954 1.1 cgd
955 1.1 cgd tlst[tidx] = tp;
956 1.1 cgd
957 1.1 cgd /* create a hash table entry */
958 1.1 cgd name = xalloc(len + 1);
959 1.1 cgd (void)memcpy(name, cp, len);
960 1.1 cgd name[len] = '\0';
961 1.1 cgd
962 1.42 rillig thte = xalloc(sizeof(*thte));
963 1.1 cgd thte->th_name = name;
964 1.1 cgd thte->th_idx = tidx;
965 1.33 rillig thte->th_next = thtab[h];
966 1.1 cgd thtab[h] = thte;
967 1.1 cgd
968 1.56 rillig return (unsigned short)tidx++;
969 1.1 cgd }
970 1.1 cgd
971 1.1 cgd /*
972 1.1 cgd * Hash function for types
973 1.1 cgd */
974 1.1 cgd static int
975 1.9 lukem thash(const char *s, size_t len)
976 1.1 cgd {
977 1.56 rillig unsigned int v;
978 1.1 cgd
979 1.1 cgd v = 0;
980 1.1 cgd while (len-- != 0) {
981 1.56 rillig v = (v << sizeof(v)) + (unsigned char)*s++;
982 1.42 rillig v ^= v >> (sizeof(v) * CHAR_BIT - sizeof(v));
983 1.1 cgd }
984 1.30 rillig return v % THSHSIZ2;
985 1.1 cgd }
986 1.1 cgd
987 1.1 cgd /*
988 1.1 cgd * Read a string enclosed by "". This string may contain quoted chars.
989 1.1 cgd */
990 1.1 cgd static char *
991 1.9 lukem inpqstrg(const char *src, const char **epp)
992 1.1 cgd {
993 1.1 cgd char *strg, *dst;
994 1.1 cgd size_t slen;
995 1.48 rillig char c;
996 1.1 cgd int v;
997 1.1 cgd
998 1.1 cgd dst = strg = xmalloc(slen = 32);
999 1.1 cgd
1000 1.1 cgd if ((c = *src++) != '"')
1001 1.20 christos inperr("not quote: %c", c);
1002 1.1 cgd if ((c = *src++) == '\0')
1003 1.20 christos inperr("trailing data: %c", c);
1004 1.1 cgd
1005 1.1 cgd while (c != '"') {
1006 1.1 cgd if (c == '\\') {
1007 1.1 cgd if ((c = *src++) == '\0')
1008 1.20 christos inperr("missing after \\");
1009 1.1 cgd switch (c) {
1010 1.1 cgd case 'n':
1011 1.1 cgd c = '\n';
1012 1.1 cgd break;
1013 1.1 cgd case 't':
1014 1.1 cgd c = '\t';
1015 1.1 cgd break;
1016 1.1 cgd case 'v':
1017 1.1 cgd c = '\v';
1018 1.1 cgd break;
1019 1.1 cgd case 'b':
1020 1.1 cgd c = '\b';
1021 1.1 cgd break;
1022 1.1 cgd case 'r':
1023 1.1 cgd c = '\r';
1024 1.1 cgd break;
1025 1.1 cgd case 'f':
1026 1.1 cgd c = '\f';
1027 1.1 cgd break;
1028 1.1 cgd case 'a':
1029 1.1 cgd c = '\a';
1030 1.1 cgd break;
1031 1.1 cgd case '\\':
1032 1.1 cgd c = '\\';
1033 1.1 cgd break;
1034 1.1 cgd case '"':
1035 1.1 cgd c = '"';
1036 1.1 cgd break;
1037 1.1 cgd case '\'':
1038 1.1 cgd c = '\'';
1039 1.1 cgd break;
1040 1.1 cgd case '0': case '1': case '2': case '3':
1041 1.1 cgd v = (c - '0') << 6;
1042 1.1 cgd if ((c = *src++) < '0' || c > '7')
1043 1.20 christos inperr("not octal: %c", c);
1044 1.1 cgd v |= (c - '0') << 3;
1045 1.1 cgd if ((c = *src++) < '0' || c > '7')
1046 1.20 christos inperr("not octal: %c", c);
1047 1.1 cgd v |= c - '0';
1048 1.48 rillig c = (char)v;
1049 1.1 cgd break;
1050 1.1 cgd default:
1051 1.20 christos inperr("bad \\ escape: %c", c);
1052 1.1 cgd }
1053 1.1 cgd }
1054 1.1 cgd /* keep space for trailing '\0' */
1055 1.25 christos if ((size_t)(dst - strg) == slen - 1) {
1056 1.1 cgd strg = xrealloc(strg, slen * 2);
1057 1.1 cgd dst = strg + (slen - 1);
1058 1.1 cgd slen *= 2;
1059 1.1 cgd }
1060 1.48 rillig *dst++ = c;
1061 1.1 cgd if ((c = *src++) == '\0')
1062 1.20 christos inperr("missing closing quote");
1063 1.1 cgd }
1064 1.1 cgd *dst = '\0';
1065 1.1 cgd
1066 1.1 cgd *epp = src;
1067 1.30 rillig return strg;
1068 1.1 cgd }
1069 1.1 cgd
1070 1.1 cgd /*
1071 1.1 cgd * Read the name of a symbol in static memory.
1072 1.1 cgd */
1073 1.1 cgd static const char *
1074 1.9 lukem inpname(const char *cp, const char **epp)
1075 1.1 cgd {
1076 1.1 cgd static char *buf;
1077 1.1 cgd static size_t blen = 0;
1078 1.1 cgd size_t len, i;
1079 1.44 rillig char c;
1080 1.1 cgd
1081 1.44 rillig len = parse_int(&cp);
1082 1.1 cgd if (len + 1 > blen)
1083 1.1 cgd buf = xrealloc(buf, blen = len + 1);
1084 1.1 cgd for (i = 0; i < len; i++) {
1085 1.1 cgd c = *cp++;
1086 1.37 rillig if (!ch_isalnum(c) && c != '_')
1087 1.20 christos inperr("not alnum or _: %c", c);
1088 1.1 cgd buf[i] = c;
1089 1.1 cgd }
1090 1.1 cgd buf[i] = '\0';
1091 1.1 cgd
1092 1.1 cgd *epp = cp;
1093 1.30 rillig return buf;
1094 1.1 cgd }
1095 1.1 cgd
1096 1.1 cgd /*
1097 1.1 cgd * Return the index of a file name. If the name cannot be found, create
1098 1.1 cgd * a new entry and return the index of the newly created entry.
1099 1.1 cgd */
1100 1.1 cgd static int
1101 1.9 lukem getfnidx(const char *fn)
1102 1.1 cgd {
1103 1.21 christos size_t i;
1104 1.1 cgd
1105 1.21 christos /* 0 is reserved */
1106 1.1 cgd for (i = 1; fnames[i] != NULL; i++) {
1107 1.1 cgd if (strcmp(fnames[i], fn) == 0)
1108 1.21 christos return i;
1109 1.1 cgd }
1110 1.1 cgd
1111 1.1 cgd if (i == nfnames - 1) {
1112 1.21 christos size_t nlen = nfnames * 2;
1113 1.42 rillig fnames = xrealloc(fnames, nlen * sizeof(*fnames));
1114 1.42 rillig (void)memset(fnames + nfnames, 0, nfnames * sizeof(*fnames));
1115 1.42 rillig flines = xrealloc(flines, nlen * sizeof(*flines));
1116 1.42 rillig (void)memset(flines + nfnames, 0, nfnames * sizeof(*flines));
1117 1.21 christos nfnames = nlen;
1118 1.1 cgd }
1119 1.1 cgd
1120 1.1 cgd fnames[i] = xstrdup(fn);
1121 1.20 christos flines[i] = 0;
1122 1.30 rillig return i;
1123 1.1 cgd }
1124 1.1 cgd
1125 1.1 cgd /*
1126 1.1 cgd * Separate symbols with static and external linkage.
1127 1.1 cgd */
1128 1.1 cgd void
1129 1.9 lukem mkstatic(hte_t *hte)
1130 1.1 cgd {
1131 1.1 cgd sym_t *sym1, **symp, *sym;
1132 1.1 cgd fcall_t **callp, *call;
1133 1.1 cgd usym_t **usymp, *usym;
1134 1.1 cgd hte_t *nhte;
1135 1.37 rillig bool ofnd;
1136 1.1 cgd
1137 1.1 cgd /* Look for first static definition */
1138 1.32 rillig for (sym1 = hte->h_syms; sym1 != NULL; sym1 = sym1->s_next) {
1139 1.1 cgd if (sym1->s_static)
1140 1.1 cgd break;
1141 1.1 cgd }
1142 1.1 cgd if (sym1 == NULL)
1143 1.1 cgd return;
1144 1.1 cgd
1145 1.1 cgd /* Do nothing if this name is used only in one translation unit. */
1146 1.37 rillig ofnd = false;
1147 1.32 rillig for (sym = hte->h_syms; sym != NULL && !ofnd; sym = sym->s_next) {
1148 1.1 cgd if (sym->s_pos.p_src != sym1->s_pos.p_src)
1149 1.37 rillig ofnd = true;
1150 1.1 cgd }
1151 1.33 rillig for (call = hte->h_calls; call != NULL && !ofnd; call = call->f_next) {
1152 1.1 cgd if (call->f_pos.p_src != sym1->s_pos.p_src)
1153 1.37 rillig ofnd = true;
1154 1.1 cgd }
1155 1.33 rillig for (usym = hte->h_usyms; usym != NULL && !ofnd; usym = usym->u_next) {
1156 1.1 cgd if (usym->u_pos.p_src != sym1->s_pos.p_src)
1157 1.37 rillig ofnd = true;
1158 1.1 cgd }
1159 1.1 cgd if (!ofnd) {
1160 1.37 rillig hte->h_used = true;
1161 1.1 cgd /* errors about undef. static symbols are printed in lint1 */
1162 1.37 rillig hte->h_def = true;
1163 1.37 rillig hte->h_static = true;
1164 1.1 cgd return;
1165 1.1 cgd }
1166 1.1 cgd
1167 1.1 cgd /*
1168 1.1 cgd * Create a new hash table entry
1169 1.1 cgd *
1170 1.1 cgd * XXX this entry should be put at the beginning of the list to
1171 1.54 rillig * avoid processing the same symbol twice.
1172 1.1 cgd */
1173 1.9 lukem for (nhte = hte; nhte->h_link != NULL; nhte = nhte->h_link)
1174 1.9 lukem continue;
1175 1.42 rillig nhte->h_link = xmalloc(sizeof(*nhte->h_link));
1176 1.1 cgd nhte = nhte->h_link;
1177 1.1 cgd nhte->h_name = hte->h_name;
1178 1.37 rillig nhte->h_used = true;
1179 1.37 rillig nhte->h_def = true; /* error in lint1 */
1180 1.37 rillig nhte->h_static = true;
1181 1.6 mycroft nhte->h_syms = NULL;
1182 1.1 cgd nhte->h_lsym = &nhte->h_syms;
1183 1.6 mycroft nhte->h_calls = NULL;
1184 1.1 cgd nhte->h_lcall = &nhte->h_calls;
1185 1.6 mycroft nhte->h_usyms = NULL;
1186 1.1 cgd nhte->h_lusym = &nhte->h_usyms;
1187 1.6 mycroft nhte->h_link = NULL;
1188 1.6 mycroft nhte->h_hte = NULL;
1189 1.1 cgd
1190 1.1 cgd /*
1191 1.1 cgd * move all symbols used in this translation unit into the new
1192 1.1 cgd * hash table entry.
1193 1.1 cgd */
1194 1.1 cgd for (symp = &hte->h_syms; (sym = *symp) != NULL; ) {
1195 1.1 cgd if (sym->s_pos.p_src == sym1->s_pos.p_src) {
1196 1.37 rillig sym->s_static = true;
1197 1.32 rillig (*symp) = sym->s_next;
1198 1.32 rillig if (hte->h_lsym == &sym->s_next)
1199 1.1 cgd hte->h_lsym = symp;
1200 1.32 rillig sym->s_next = NULL;
1201 1.1 cgd *nhte->h_lsym = sym;
1202 1.32 rillig nhte->h_lsym = &sym->s_next;
1203 1.1 cgd } else {
1204 1.32 rillig symp = &sym->s_next;
1205 1.1 cgd }
1206 1.1 cgd }
1207 1.1 cgd for (callp = &hte->h_calls; (call = *callp) != NULL; ) {
1208 1.1 cgd if (call->f_pos.p_src == sym1->s_pos.p_src) {
1209 1.33 rillig (*callp) = call->f_next;
1210 1.33 rillig if (hte->h_lcall == &call->f_next)
1211 1.1 cgd hte->h_lcall = callp;
1212 1.33 rillig call->f_next = NULL;
1213 1.1 cgd *nhte->h_lcall = call;
1214 1.33 rillig nhte->h_lcall = &call->f_next;
1215 1.1 cgd } else {
1216 1.33 rillig callp = &call->f_next;
1217 1.1 cgd }
1218 1.1 cgd }
1219 1.1 cgd for (usymp = &hte->h_usyms; (usym = *usymp) != NULL; ) {
1220 1.1 cgd if (usym->u_pos.p_src == sym1->s_pos.p_src) {
1221 1.33 rillig (*usymp) = usym->u_next;
1222 1.33 rillig if (hte->h_lusym == &usym->u_next)
1223 1.1 cgd hte->h_lusym = usymp;
1224 1.33 rillig usym->u_next = NULL;
1225 1.1 cgd *nhte->h_lusym = usym;
1226 1.33 rillig nhte->h_lusym = &usym->u_next;
1227 1.1 cgd } else {
1228 1.33 rillig usymp = &usym->u_next;
1229 1.1 cgd }
1230 1.1 cgd }
1231 1.1 cgd
1232 1.1 cgd /* h_def must be recalculated for old hte */
1233 1.37 rillig hte->h_def = nhte->h_def = false;
1234 1.32 rillig for (sym = hte->h_syms; sym != NULL; sym = sym->s_next) {
1235 1.1 cgd if (sym->s_def == DEF || sym->s_def == TDEF) {
1236 1.37 rillig hte->h_def = true;
1237 1.1 cgd break;
1238 1.1 cgd }
1239 1.1 cgd }
1240 1.1 cgd
1241 1.1 cgd mkstatic(hte);
1242 1.1 cgd }
1243