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