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