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