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