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