/* $NetBSD: lex.c,v 1.25 2021/04/08 22:18:27 rillig Exp $ */ /* * Copyright (c) 1996 Christopher G. Demetriou. All Rights Reserved. * Copyright (c) 1994, 1995 Jochen Pohl * All Rights Reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by Jochen Pohl for * The NetBSD Project. * 4. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #if HAVE_NBTOOL_CONFIG_H #include "nbtool_config.h" #endif #include #if defined(__RCSID) && !defined(lint) __RCSID("$NetBSD: lex.c,v 1.25 2021/04/08 22:18:27 rillig Exp $"); #endif #include #include #include #include #include #include #include #include "lint1.h" #include "cgram.h" #define CHAR_MASK ((int)(~(~0U << CHAR_SIZE))) /* Current position (it's also updated when an included file is parsed) */ pos_t curr_pos = { "", 1, 0 }; /* * Current position in C source (not updated when an included file is * parsed). */ pos_t csrc_pos = { "", 1, 0 }; /* Are we parsing a gcc attribute? */ bool attron; bool in_system_header = false; static sbuf_t *allocsb(void); static void freesb(sbuf_t *); static int inpc(void); static int hash(const char *); static sym_t * search(sbuf_t *); static int keyw(sym_t *); static int get_escaped_char(int); void lex_next_line(void) { curr_pos.p_line++; curr_pos.p_uniq = 0; #ifdef DEBUG printf("parsing %s:%d\n", curr_pos.p_file, curr_pos.p_line); #endif if (curr_pos.p_file == csrc_pos.p_file) { csrc_pos.p_line++; csrc_pos.p_uniq = 0; } } void lex_unknown_character(int c) { /* unknown character \%o */ error(250, c); } #define kwdef(name, token, scl, tspec, tqual, c89, c99, gcc, attr, deco) \ { \ name, token, scl, tspec, tqual, \ (c89) > 0, (c99) > 0, (gcc) > 0, (attr) > 0, deco, \ } #define kwdef_token(name, token, c89, c99, gcc, attr, deco) \ kwdef(name, token, 0, 0, 0, c89, c99, gcc, attr, deco) #define kwdef_sclass(name, sclass, c89, c99, gcc, attr, deco) \ kwdef(name, T_SCLASS, sclass, 0, 0, c89, c99, gcc, attr, deco) #define kwdef_type(name, tspec, c89, c99, gcc, attr, deco) \ kwdef(name, T_TYPE, 0, tspec, 0, c89, c99, gcc, attr, deco) #define kwdef_tqual(name, tqual, c89, c99, gcc, attr, deco) \ kwdef(name, T_QUAL, 0, 0, tqual, c89, c99, gcc, attr, deco) /* * Keywords. * During initialization they are written to the symbol table. */ static struct kwtab { const char *kw_name; /* keyword */ int kw_token; /* token returned by yylex() */ scl_t kw_scl; /* storage class if kw_token T_SCLASS */ tspec_t kw_tspec; /* type spec. if kw_token * T_TYPE or T_STRUCT_OR_UNION */ tqual_t kw_tqual; /* type qual. if kw_token T_QUAL */ bool kw_c89 : 1; /* C89 keyword */ bool kw_c99 : 1; /* C99 keyword */ bool kw_gcc : 1; /* GCC keyword */ bool kw_attr : 1; /* GCC attribute, keyword */ u_int kw_deco : 3; /* 1 = name, 2 = __name, 4 = __name__ */ } kwtab[] = { #ifdef INT128_SIZE kwdef_type( "__int128_t", INT128, 0,1,0,0,1), kwdef_type( "__uint128_t", UINT128, 0,1,0,0,1), #endif kwdef_tqual( "__thread", THREAD, 0,0,1,0,1), kwdef_token( "_Alignas", T_ALIGNAS, 0,0,0,0,1), kwdef_token( "_Alignof", T_ALIGNOF, 0,0,0,0,1), kwdef_type( "_Bool", BOOL, 0,1,0,0,1), kwdef_type( "_Complex", COMPLEX, 0,1,0,0,1), kwdef_token( "_Generic", T_GENERIC, 0,1,0,0,1), kwdef_token( "_Noreturn", T_NORETURN, 0,1,0,0,1), kwdef_tqual( "_Thread_local", THREAD, 0,1,0,0,1), kwdef_token( "alias", T_AT_ALIAS, 0,0,1,1,5), kwdef_token( "aligned", T_AT_ALIGNED, 0,0,1,1,5), kwdef_token( "alignof", T_ALIGNOF, 0,0,0,0,4), kwdef_token( "alloc_size", T_AT_ALLOC_SIZE, 0,0,1,1,5), kwdef_token( "always_inline", T_AT_ALWAYS_INLINE, 0,0,1,1,5), kwdef_token( "asm", T_ASM, 0,0,1,0,7), kwdef_token( "attribute", T_ATTRIBUTE, 0,0,1,0,6), kwdef_sclass( "auto", AUTO, 0,0,0,0,1), kwdef_token( "bounded", T_AT_BOUNDED, 0,0,1,1,5), kwdef_token( "break", T_BREAK, 0,0,0,0,1), kwdef_token( "buffer", T_AT_BUFFER, 0,0,1,1,5), kwdef_token( "builtin_offsetof", T_BUILTIN_OFFSETOF, 0,0,1,0,2), kwdef_token( "case", T_CASE, 0,0,0,0,1), kwdef_type( "char", CHAR, 0,0,0,0,1), kwdef_token( "cold", T_AT_COLD, 0,0,1,1,5), kwdef_tqual( "const", CONST, 1,0,0,0,7), kwdef_token( "constructor", T_AT_CONSTRUCTOR, 0,0,1,1,5), kwdef_token( "continue", T_CONTINUE, 0,0,0,0,1), kwdef_token( "default", T_DEFAULT, 0,0,0,0,1), kwdef_token( "deprecated", T_AT_DEPRECATED, 0,0,1,1,5), kwdef_token( "destructor", T_AT_DESTRUCTOR, 0,0,1,1,5), kwdef_token( "do", T_DO, 0,0,0,0,1), kwdef_type( "double", DOUBLE, 0,0,0,0,1), kwdef_token( "else", T_ELSE, 0,0,0,0,1), kwdef_token( "enum", T_ENUM, 0,0,0,0,1), kwdef_token( "extension", T_EXTENSION, 0,0,1,0,4), kwdef_sclass( "extern", EXTERN, 0,0,0,0,1), kwdef_type( "float", FLOAT, 0,0,0,0,1), kwdef_token( "for", T_FOR, 0,0,0,0,1), kwdef_token( "format", T_AT_FORMAT, 0,0,1,1,5), kwdef_token( "format_arg", T_AT_FORMAT_ARG, 0,0,1,1,5), kwdef_token( "gnu_inline", T_AT_GNU_INLINE, 0,0,1,1,5), kwdef_token( "gnu_printf", T_AT_FORMAT_GNU_PRINTF, 0,0,1,1,5), kwdef_token( "goto", T_GOTO, 0,0,0,0,1), kwdef_token( "if", T_IF, 0,0,0,0,1), kwdef_token( "imag", T_IMAG, 0,1,0,0,4), kwdef_sclass( "inline", INLINE, 0,1,0,0,7), kwdef_type( "int", INT, 0,0,0,0,1), kwdef_type( "long", LONG, 0,0,0,0,1), kwdef_token( "malloc", T_AT_MALLOC, 0,0,1,1,5), kwdef_token( "may_alias", T_AT_MAY_ALIAS, 0,0,1,1,5), kwdef_token( "minbytes", T_AT_MINBYTES, 0,0,1,1,5), kwdef_token( "mode", T_AT_MODE, 0,0,1,1,5), kwdef_token( "no_instrument_function", T_AT_NO_INSTRUMENT_FUNCTION, 0,0,1,1,5), kwdef_token( "nonnull", T_AT_NONNULL, 0,0,1,1,5), kwdef_token( "noinline", T_AT_NOINLINE, 0,0,1,1,5), kwdef_token( "noreturn", T_AT_NORETURN, 0,0,1,1,5), kwdef_token( "nothrow", T_AT_NOTHROW, 0,0,1,1,5), kwdef_token( "optimize", T_AT_OPTIMIZE, 0,0,1,1,5), kwdef_token( "packed", T_AT_PACKED, 0,0,1,1,5), kwdef_token( "packed", T_PACKED, 0,0,0,0,2), kwdef_token( "pcs", T_AT_PCS, 0,0,0,0,5), kwdef_token( "printf", T_AT_FORMAT_PRINTF, 0,0,1,1,5), kwdef_token( "pure", T_AT_PURE, 0,0,1,1,5), kwdef_token( "real", T_REAL, 0,1,0,0,4), kwdef_sclass( "register", REG, 0,0,0,0,1), kwdef_tqual( "restrict", RESTRICT, 0,1,0,0,5), kwdef_token( "return", T_RETURN, 0,0,0,0,1), kwdef_token( "returns_twice", T_AT_RETURNS_TWICE, 0,0,1,1,5), kwdef_token( "scanf", T_AT_FORMAT_SCANF, 0,0,1,1,5), kwdef_token( "section", T_AT_SECTION, 0,0,1,1,7), kwdef_token( "sentinel", T_AT_SENTINEL, 0,0,1,1,5), kwdef_type( "short", SHORT, 0,0,0,0,1), kwdef_type( "signed", SIGNED, 1,0,0,0,3), kwdef_token( "sizeof", T_SIZEOF, 0,0,0,0,1), kwdef_sclass( "static", STATIC, 0,0,0,0,1), kwdef_token( "strfmon", T_AT_FORMAT_STRFMON, 0,0,1,1,5), kwdef_token( "strftime", T_AT_FORMAT_STRFTIME, 0,0,1,1,5), kwdef_token( "string", T_AT_STRING, 0,0,1,1,5), kwdef("struct", T_STRUCT_OR_UNION, 0, STRUCT, 0, 0,0,0,0,1), kwdef_token( "switch", T_SWITCH, 0,0,0,0,1), kwdef_token( "symbolrename", T_SYMBOLRENAME, 0,0,0,0,2), kwdef_token( "syslog", T_AT_FORMAT_SYSLOG, 0,0,1,1,5), kwdef_token( "transparent_union", T_AT_TUNION, 0,0,1,1,5), kwdef_token( "tls_model", T_AT_TLS_MODEL, 0,0,1,1,5), kwdef_sclass( "typedef", TYPEDEF, 0,0,0,0,1), kwdef_token( "typeof", T_TYPEOF, 0,0,1,0,7), kwdef("union", T_STRUCT_OR_UNION, 0, UNION, 0, 0,0,0,0,1), kwdef_type( "unsigned", UNSIGN, 0,0,0,0,1), kwdef_token( "unused", T_AT_UNUSED, 0,0,1,1,5), kwdef_token( "used", T_AT_USED, 0,0,1,1,5), kwdef_token( "visibility", T_AT_VISIBILITY, 0,0,1,1,5), kwdef_type( "void", VOID, 0,0,0,0,1), kwdef_tqual( "volatile", VOLATILE, 1,0,0,0,7), kwdef_token("warn_unused_result", T_AT_WARN_UNUSED_RESULT, 0,0,1,1,5), kwdef_token( "weak", T_AT_WEAK, 0,0,1,1,5), kwdef_token( "while", T_WHILE, 0,0,0,0,1), kwdef(NULL, 0, 0, 0, 0, 0, 0, 0, 0, 0), #undef kwdef #undef kwdef_token #undef kwdef_sclass #undef kwdef_type #undef kwdef_tqual }; /* Symbol table */ static sym_t *symtab[HSHSIZ1]; /* bit i of the entry with index i is set */ uint64_t qbmasks[64]; /* least significant i bits are set in the entry with index i */ uint64_t qlmasks[64 + 1]; /* least significant i bits are not set in the entry with index i */ uint64_t qumasks[64 + 1]; /* free list for sbuf structures */ static sbuf_t *sbfrlst; /* type of next expected symbol */ symt_t symtyp; static void add_keyword(struct kwtab *kw, int deco) { sym_t *sym; size_t h; char buf[256]; const char *name; if ((kw->kw_deco & deco) == 0) return; switch (deco) { case 1: name = kw->kw_name; break; case 2: snprintf(buf, sizeof(buf), "__%s", kw->kw_name); name = strdup(buf); break; default: lint_assert(deco == 4); snprintf(buf, sizeof(buf), "__%s__", kw->kw_name); name = strdup(buf); break; } if (name == NULL) err(1, "Can't init symbol table"); sym = getblk(sizeof(*sym)); sym->s_name = name; sym->s_keyword = kw; sym->s_value.v_quad = kw->kw_token; if (kw->kw_token == T_TYPE || kw->kw_token == T_STRUCT_OR_UNION) { sym->s_tspec = kw->kw_tspec; } else if (kw->kw_token == T_SCLASS) { sym->s_scl = kw->kw_scl; } else if (kw->kw_token == T_QUAL) { sym->s_tqual = kw->kw_tqual; } h = hash(sym->s_name); if ((sym->s_link = symtab[h]) != NULL) symtab[h]->s_rlink = &sym->s_link; sym->s_rlink = &symtab[h]; symtab[h] = sym; } /* * All keywords are written to the symbol table. This saves us looking * in a extra table for each name we found. */ void initscan(void) { struct kwtab *kw; size_t i; uint64_t uq; for (kw = kwtab; kw->kw_name != NULL; kw++) { if ((kw->kw_c89 || kw->kw_c99) && tflag) continue; if (kw->kw_c99 && !(Sflag || gflag)) continue; if (kw->kw_gcc && !gflag) continue; add_keyword(kw, 1); add_keyword(kw, 2); add_keyword(kw, 4); } /* initialize bit-masks for quads */ for (i = 0; i < 64; i++) { qbmasks[i] = (uint64_t)1 << i; uq = ~(uint64_t)0 << i; qumasks[i] = uq; qlmasks[i] = ~uq; } qumasks[i] = 0; qlmasks[i] = ~(uint64_t)0; } /* * Get a free sbuf structure, if possible from the free list */ static sbuf_t * allocsb(void) { sbuf_t *sb; if ((sb = sbfrlst) != NULL) { sbfrlst = sb->sb_next; #ifdef BLKDEBUG (void)memset(sb, 0, sizeof(*sb)); #else sb->sb_next = NULL; #endif } else { sb = xmalloc(sizeof(*sb)); (void)memset(sb, 0, sizeof(*sb)); } return sb; } /* * Put a sbuf structure to the free list */ static void freesb(sbuf_t *sb) { (void)memset(sb, ZERO, sizeof(*sb)); sb->sb_next = sbfrlst; sbfrlst = sb; } /* * Read a character and ensure that it is positive (except EOF). * Increment line count(s) if necessary. */ static int inpc(void) { int c; if ((c = lex_input()) != EOF && (c &= CHAR_MASK) == '\n') lex_next_line(); return c; } static int hash(const char *s) { u_int v; const u_char *us; v = 0; for (us = (const u_char *)s; *us != '\0'; us++) { v = (v << sizeof(v)) + *us; v ^= v >> (sizeof(v) * CHAR_BIT - sizeof(v)); } return v % HSHSIZ1; } /* * Lex has found a letter followed by zero or more letters or digits. * It looks for a symbol in the symbol table with the same name. This * symbol must either be a keyword or a symbol of the type required by * symtyp (label, member, tag, ...). * * If it is a keyword, the token is returned. In some cases it is described * more deeply by data written to yylval. * * If it is a symbol, T_NAME is returned and the pointer to a sbuf struct * is stored in yylval. This struct contains the name of the symbol, its * length and hash value. If there is already a symbol of the same name * and type in the symbol table, the sbuf struct also contains a pointer * to the symbol table entry. */ extern int lex_name(const char *yytext, size_t yyleng) { char *s; sbuf_t *sb; sym_t *sym; int tok; sb = allocsb(); sb->sb_name = yytext; sb->sb_len = yyleng; sb->sb_hash = hash(yytext); if ((sym = search(sb)) != NULL && sym->s_keyword != NULL) { freesb(sb); return keyw(sym); } sb->sb_sym = sym; if (sym != NULL) { lint_assert(block_level >= sym->s_block_level); sb->sb_name = sym->s_name; sb->sb_len = strlen(sym->s_name); tok = sym->s_scl == TYPEDEF ? T_TYPENAME : T_NAME; } else { s = getblk(yyleng + 1); (void)memcpy(s, yytext, yyleng + 1); sb->sb_name = s; sb->sb_len = yyleng; tok = T_NAME; } yylval.y_sb = sb; return tok; } static sym_t * search(sbuf_t *sb) { sym_t *sym; for (sym = symtab[sb->sb_hash]; sym != NULL; sym = sym->s_link) { if (strcmp(sym->s_name, sb->sb_name) == 0) { if (sym->s_keyword != NULL) { struct kwtab *kw = sym->s_keyword; if (!kw->kw_attr || attron) return sym; } else if (!attron && sym->s_kind == symtyp) return sym; } } return NULL; } static int keyw(sym_t *sym) { int t; if ((t = (int)sym->s_value.v_quad) == T_SCLASS) { yylval.y_scl = sym->s_scl; } else if (t == T_TYPE || t == T_STRUCT_OR_UNION) { yylval.y_tspec = sym->s_tspec; } else if (t == T_QUAL) { yylval.y_tqual = sym->s_tqual; } return t; } /* * Convert a string representing an integer into internal representation. * Return T_CON, storing the numeric value in yylval, for yylex. */ int lex_integer_constant(const char *yytext, size_t yyleng, int base) { int l_suffix, u_suffix; int len; const char *cp; char c, *eptr; tspec_t typ; bool ansiu; bool warned = false; #ifdef TARG_INT128_MAX __uint128_t uq = 0; static tspec_t contypes[2][4] = { { INT, LONG, QUAD, INT128, }, { UINT, ULONG, UQUAD, UINT128, } }; #else uint64_t uq = 0; static tspec_t contypes[2][3] = { { INT, LONG, QUAD, }, { UINT, ULONG, UQUAD, } }; #endif cp = yytext; len = yyleng; /* skip 0[xX] or 0[bB] */ if (base == 16 || base == 2) { cp += 2; len -= 2; } /* read suffixes */ l_suffix = u_suffix = 0; for (;;) { if ((c = cp[len - 1]) == 'l' || c == 'L') { l_suffix++; } else if (c == 'u' || c == 'U') { u_suffix++; } else { break; } len--; } if (l_suffix > 2 || u_suffix > 1) { /* malformed integer constant */ warning(251); if (l_suffix > 2) l_suffix = 2; if (u_suffix > 1) u_suffix = 1; } if (tflag && u_suffix != 0) { /* suffix U is illegal in traditional C */ warning(97); } typ = contypes[u_suffix][l_suffix]; errno = 0; uq = strtouq(cp, &eptr, base); lint_assert(eptr == cp + len); if (errno != 0) { /* integer constant out of range */ warning(252); warned = true; } /* * If the value is too big for the current type, we must choose * another type. */ ansiu = false; switch (typ) { case INT: if (uq <= TARG_INT_MAX) { /* ok */ } else if (uq <= TARG_UINT_MAX && base != 10) { typ = UINT; } else if (uq <= TARG_LONG_MAX) { typ = LONG; } else { typ = ULONG; if (uq > TARG_ULONG_MAX && !warned) { /* integer constant out of range */ warning(252); } } if (typ == UINT || typ == ULONG) { if (tflag) { typ = LONG; } else if (!sflag) { /* * Remember that the constant is unsigned * only in ANSI C */ ansiu = true; } } break; case UINT: if (uq > TARG_UINT_MAX) { typ = ULONG; if (uq > TARG_ULONG_MAX && !warned) { /* integer constant out of range */ warning(252); } } break; case LONG: if (uq > TARG_LONG_MAX && !tflag) { typ = ULONG; if (!sflag) ansiu = true; if (uq > TARG_ULONG_MAX && !warned) { /* integer constant out of range */ warning(252); } } break; case ULONG: if (uq > TARG_ULONG_MAX && !warned) { /* integer constant out of range */ warning(252); } break; case QUAD: if (uq > TARG_QUAD_MAX && !tflag) { typ = UQUAD; if (!sflag) ansiu = true; } break; case UQUAD: if (uq > TARG_UQUAD_MAX && !warned) { /* integer constant out of range */ warning(252); } break; #ifdef INT128_SIZE case INT128: #ifdef TARG_INT128_MAX if (uq > TARG_INT128_MAX && !tflag) { typ = UINT128; if (!sflag) ansiu = true; } #endif break; case UINT128: #ifdef TARG_INT128_MAX if (uq > TARG_UINT128_MAX && !warned) { /* integer constant out of range */ warning(252); } #endif break; #endif /* LINTED206: (enumeration values not handled in switch) */ case STRUCT: case VOID: case LDOUBLE: case FUNC: case ARRAY: case PTR: case ENUM: case UNION: case SIGNED: case NOTSPEC: case DOUBLE: case FLOAT: case USHORT: case SHORT: case UCHAR: case SCHAR: case CHAR: case BOOL: case UNSIGN: case FCOMPLEX: case DCOMPLEX: case LCOMPLEX: case COMPLEX: break; } uq = (uint64_t)xsign((int64_t)uq, typ, -1); yylval.y_val = xcalloc(1, sizeof(*yylval.y_val)); yylval.y_val->v_tspec = typ; yylval.y_val->v_ansiu = ansiu; yylval.y_val->v_quad = (int64_t)uq; return T_CON; } /* * Returns whether t is a signed type and the value is negative. * * len is the number of significant bits. If len is -1, len is set * to the width of type t. */ static bool sign(int64_t q, tspec_t t, int len) { if (t == PTR || is_uinteger(t)) return false; return msb(q, t, len) != 0; } int msb(int64_t q, tspec_t t, int len) { if (len <= 0) len = size_in_bits(t); return (q & qbmasks[len - 1]) != 0 ? 1 : 0; } /* * Extends the sign of q. */ int64_t xsign(int64_t q, tspec_t t, int len) { if (len <= 0) len = size_in_bits(t); if (t == PTR || is_uinteger(t) || !sign(q, t, len)) { q &= qlmasks[len]; } else { q |= qumasks[len]; } return q; } /* * Convert a string representing a floating point value into its integral * representation. Type and value are returned in yylval. fcon() * (and yylex()) returns T_CON. * XXX Currently it is not possible to convert constants of type * long double which are greater than DBL_MAX. */ int lex_floating_constant(const char *yytext, size_t yyleng) { const char *cp; int len; tspec_t typ; char c, *eptr; double d; float f = 0; cp = yytext; len = yyleng; if (cp[len - 1] == 'i') { /* imaginary, do nothing for now */ len--; } if ((c = cp[len - 1]) == 'f' || c == 'F') { typ = FLOAT; len--; } else if (c == 'l' || c == 'L') { typ = LDOUBLE; len--; } else { if (c == 'd' || c == 'D') len--; typ = DOUBLE; } if (tflag && typ != DOUBLE) { /* suffixes F and L are illegal in traditional C */ warning(98); } errno = 0; d = strtod(cp, &eptr); if (eptr != cp + len) { switch (*eptr) { /* * XXX: non-native non-current strtod() may not handle hex * floats, ignore the rest if we find traces of hex float * syntax... */ case 'p': case 'P': case 'x': case 'X': d = 0; errno = 0; break; default: INTERNAL_ERROR("fcon(%s->%s)", cp, eptr); } } if (errno != 0) /* floating-point constant out of range */ warning(248); if (typ == FLOAT) { f = (float)d; if (finite(f) == 0) { /* floating-point constant out of range */ warning(248); f = f > 0 ? FLT_MAX : -FLT_MAX; } } yylval.y_val = xcalloc(1, sizeof(*yylval.y_val)); yylval.y_val->v_tspec = typ; if (typ == FLOAT) { yylval.y_val->v_ldbl = f; } else { yylval.y_val->v_ldbl = d; } return T_CON; } int lex_operator(int t, op_t o) { yylval.y_op = o; return t; } /* * Called if lex found a leading \'. */ int lex_character_constant(void) { size_t n; int val, c; char cv; n = 0; val = 0; while ((c = get_escaped_char('\'')) >= 0) { val = (val << CHAR_SIZE) + c; n++; } if (c == -2) { /* unterminated character constant */ error(253); } else { /* XXX: should rather be sizeof(TARG_INT) */ if (n > sizeof(int) || (n > 1 && (pflag || hflag))) { /* too many characters in character constant */ error(71); } else if (n > 1) { /* multi-character character constant */ warning(294); } else if (n == 0) { /* empty character constant */ error(73); } } if (n == 1) { cv = (char)val; val = cv; } yylval.y_val = xcalloc(1, sizeof(*yylval.y_val)); yylval.y_val->v_tspec = INT; yylval.y_val->v_quad = val; return T_CON; } /* * Called if lex found a leading L\' */ int lex_wide_character_constant(void) { static char buf[MB_LEN_MAX + 1]; size_t i, imax; int c; wchar_t wc; imax = MB_CUR_MAX; i = 0; while ((c = get_escaped_char('\'')) >= 0) { if (i < imax) buf[i] = (char)c; i++; } wc = 0; if (c == -2) { /* unterminated character constant */ error(253); } else if (c == 0) { /* empty character constant */ error(73); } else { if (i > imax) { i = imax; /* too many characters in character constant */ error(71); } else { buf[i] = '\0'; (void)mbtowc(NULL, NULL, 0); if (mbtowc(&wc, buf, imax) < 0) /* invalid multibyte character */ error(291); } } yylval.y_val = xcalloc(1, sizeof(*yylval.y_val)); yylval.y_val->v_tspec = WCHAR; yylval.y_val->v_quad = wc; return T_CON; } /* * Read a character which is part of a character constant or of a string * and handle escapes. * * The argument is the character which delimits the character constant or * string. * * Returns -1 if the end of the character constant or string is reached, * -2 if the EOF is reached, and the character otherwise. */ static int get_escaped_char(int delim) { static int pbc = -1; int n, c, v; if (pbc == -1) { c = inpc(); } else { c = pbc; pbc = -1; } if (c == delim) return -1; switch (c) { case '\n': if (tflag) { /* newline in string or char constant */ error(254); return -2; } return c; case EOF: return -2; case '\\': switch (c = inpc()) { case '"': if (tflag && delim == '\'') /* \" inside character constants undef... */ warning(262); return '"'; case '\'': return '\''; case '?': if (tflag) /* \? undefined in traditional C */ warning(263); return '?'; case '\\': return '\\'; case 'a': if (tflag) /* \a undefined in traditional C */ warning(81); return '\a'; case 'b': return '\b'; case 'f': return '\f'; case 'n': return '\n'; case 'r': return '\r'; case 't': return '\t'; case 'v': if (tflag) /* \v undefined in traditional C */ warning(264); return '\v'; case '8': case '9': /* bad octal digit %c */ warning(77, c); /* FALLTHROUGH */ case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': n = 3; v = 0; do { v = (v << 3) + (c - '0'); c = inpc(); } while (--n > 0 && isdigit(c) && (tflag || c <= '7')); if (tflag && n > 0 && isdigit(c)) /* bad octal digit %c */ warning(77, c); pbc = c; if (v > TARG_UCHAR_MAX) { /* character escape does not fit in character */ warning(76); v &= CHAR_MASK; } return v; case 'x': if (tflag) /* \x undefined in traditional C */ warning(82); v = 0; n = 0; while ((c = inpc()) >= 0 && isxdigit(c)) { c = isdigit(c) ? c - '0' : toupper(c) - 'A' + 10; v = (v << 4) + c; if (n >= 0) { if ((v & ~CHAR_MASK) != 0) { /* overflow in hex escape */ warning(75); n = -1; } else { n++; } } } pbc = c; if (n == 0) { /* no hex digits follow \x */ error(74); } if (n == -1) { v &= CHAR_MASK; } return v; case '\n': return get_escaped_char(delim); case EOF: return -2; default: if (isprint(c)) { /* dubious escape \%c */ warning(79, c); } else { /* dubious escape \%o */ warning(80, c); } } } return c; } /* See https://gcc.gnu.org/onlinedocs/cpp/Preprocessor-Output.html */ static void parse_line_directive_flags(const char *p, bool *is_begin, bool *is_end, bool *is_system) { *is_begin = false; *is_end = false; *is_system = false; while (*p != '\0') { while (ch_isspace(*p)) p++; const char *word_start = p; while (*p != '\0' && !ch_isspace(*p)) p++; const char *word_end = p; if (word_end - word_start == 1 && word_start[0] == '1') *is_begin = true; if (word_end - word_start == 1 && word_start[0] == '2') *is_end = true; if (word_end - word_start == 1 && word_start[0] == '3') *is_system = true; /* Flag '4' would only be interesting if lint handled C++. */ } #if 0 if (*p != '\0') { /* syntax error '%s' */ warning(249, "extra character(s) after directive"); } #endif } /* * Called for preprocessor directives. Currently implemented are: * # lineno * # lineno "filename" * # lineno "filename" GCC-flag... */ void lex_directive(const char *yytext) { const char *cp, *fn; char c, *eptr; size_t fnl; long ln; bool is_begin, is_end, is_system; static bool first = true; /* Go to first non-whitespace after # */ for (cp = yytext + 1; (c = *cp) == ' ' || c == '\t'; cp++) continue; if (!ch_isdigit(c)) { if (strncmp(cp, "pragma", 6) == 0 && ch_isspace(cp[6])) return; error: /* undefined or invalid # directive */ warning(255); return; } ln = strtol(--cp, &eptr, 10); if (cp == eptr) goto error; if ((c = *(cp = eptr)) != ' ' && c != '\t' && c != '\0') goto error; while ((c = *cp++) == ' ' || c == '\t') continue; if (c != '\0') { if (c != '"') goto error; fn = cp; while ((c = *cp) != '"' && c != '\0') cp++; if (c != '"') goto error; if ((fnl = cp++ - fn) > PATH_MAX) goto error; /* empty string means stdin */ if (fnl == 0) { fn = "{standard input}"; fnl = 16; /* strlen (fn) */ } curr_pos.p_file = record_filename(fn, fnl); /* * If this is the first directive, the name is the name * of the C source file as specified at the command line. * It is written to the output file. */ if (first) { csrc_pos.p_file = curr_pos.p_file; outsrc(transform_filename(curr_pos.p_file, strlen(curr_pos.p_file))); first = false; } parse_line_directive_flags(cp, &is_begin, &is_end, &is_system); update_position(curr_pos.p_file, (int)ln, is_begin, is_end, is_system); } curr_pos.p_line = (int)ln - 1; curr_pos.p_uniq = 0; if (curr_pos.p_file == csrc_pos.p_file) { csrc_pos.p_line = (int)ln - 1; csrc_pos.p_uniq = 0; } } /* * Handle lint comments such as ARGSUSED. * * If one of these comments is recognized, the argument, if any, is * parsed and a function which handles this comment is called. */ void lex_comment(void) { int c, lc; static const struct { const char *keywd; bool arg; void (*func)(int); } keywtab[] = { { "ARGSUSED", true, argsused }, { "BITFIELDTYPE", false, bitfieldtype }, { "CONSTCOND", false, constcond }, { "CONSTANTCOND", false, constcond }, { "CONSTANTCONDITION", false, constcond }, { "FALLTHRU", false, fallthru }, { "FALLTHROUGH", false, fallthru }, { "LINTLIBRARY", false, lintlib }, { "LINTED", true, linted }, { "LONGLONG", false, longlong }, { "NOSTRICT", true, linted }, { "NOTREACHED", false, not_reached }, { "PRINTFLIKE", true, printflike }, { "PROTOLIB", true, protolib }, { "SCANFLIKE", true, scanflike }, { "VARARGS", true, varargs }, }; char keywd[32]; char arg[32]; size_t l, i; int a; bool eoc; eoc = false; /* Skip whitespace after the start of the comment */ while ((c = inpc()) != EOF && isspace(c)) continue; /* Read the potential keyword to keywd */ l = 0; while (c != EOF && isupper(c) && l < sizeof(keywd) - 1) { keywd[l++] = (char)c; c = inpc(); } keywd[l] = '\0'; /* look for the keyword */ for (i = 0; i < sizeof(keywtab) / sizeof(keywtab[0]); i++) { if (strcmp(keywtab[i].keywd, keywd) == 0) break; } if (i == sizeof(keywtab) / sizeof(keywtab[0])) goto skip_rest; /* skip whitespace after the keyword */ while (c != EOF && isspace(c)) c = inpc(); /* read the argument, if the keyword accepts one and there is one */ l = 0; if (keywtab[i].arg) { while (c != EOF && isdigit(c) && l < sizeof(arg) - 1) { arg[l++] = (char)c; c = inpc(); } } arg[l] = '\0'; a = l != 0 ? atoi(arg) : -1; /* skip whitespace after the argument */ while (c != EOF && isspace(c)) c = inpc(); if (c != '*' || (c = inpc()) != '/') { if (keywtab[i].func != linted) /* extra characters in lint comment */ warning(257); } else { /* * remember that we have already found the end of the * comment */ eoc = true; } if (keywtab[i].func != NULL) (*keywtab[i].func)(a); skip_rest: while (!eoc) { lc = c; if ((c = inpc()) == EOF) { /* unterminated comment */ error(256); break; } if (lc == '*' && c == '/') eoc = true; } } /* * Handle // style comments */ void lex_slash_slash_comment(void) { int c; if (!Sflag && !gflag) /* %s C does not support // comments */ gnuism(312, tflag ? "traditional" : "ANSI"); while ((c = inpc()) != EOF && c != '\n') continue; } /* * Clear flags for lint comments LINTED, LONGLONG and CONSTCOND. * clear_warn_flags() is called after function definitions and global and * local declarations and definitions. It is also called between * the controlling expression and the body of control statements * (if, switch, for, while). */ void clear_warn_flags(void) { lwarn = LWARN_ALL; quadflg = false; constcond_flag = false; } /* * Strings are stored in a dynamically allocated buffer and passed * in yylval.y_xstrg to the parser. The parser or the routines called * by the parser are responsible for freeing this buffer. */ int lex_string(void) { u_char *s; int c; size_t len, max; strg_t *strg; s = xmalloc(max = 64); len = 0; while ((c = get_escaped_char('"')) >= 0) { /* +1 to reserve space for a trailing NUL character */ if (len + 1 == max) s = xrealloc(s, max *= 2); s[len++] = (char)c; } s[len] = '\0'; if (c == -2) /* unterminated string constant */ error(258); strg = xcalloc(1, sizeof(*strg)); strg->st_tspec = CHAR; strg->st_len = len; strg->st_cp = s; yylval.y_string = strg; return T_STRING; } int lex_wide_string(void) { char *s; int c, n; size_t i, wi; size_t len, max, wlen; wchar_t *ws; strg_t *strg; s = xmalloc(max = 64); len = 0; while ((c = get_escaped_char('"')) >= 0) { /* +1 to save space for a trailing NUL character */ if (len + 1 >= max) s = xrealloc(s, max *= 2); s[len++] = (char)c; } s[len] = '\0'; if (c == -2) /* unterminated string constant */ error(258); /* get length of wide-character string */ (void)mblen(NULL, 0); for (i = 0, wlen = 0; i < len; i += n, wlen++) { if ((n = mblen(&s[i], MB_CUR_MAX)) == -1) { /* invalid multibyte character */ error(291); break; } if (n == 0) n = 1; } ws = xmalloc((wlen + 1) * sizeof(*ws)); /* convert from multibyte to wide char */ (void)mbtowc(NULL, NULL, 0); for (i = 0, wi = 0; i < len; i += n, wi++) { if ((n = mbtowc(&ws[wi], &s[i], MB_CUR_MAX)) == -1) break; if (n == 0) n = 1; } ws[wi] = 0; free(s); strg = xcalloc(1, sizeof(*strg)); strg->st_tspec = WCHAR; strg->st_len = wlen; strg->st_wcp = ws; yylval.y_string = strg; return T_STRING; } /* * As noted above the scanner does not create new symbol table entries * for symbols it cannot find in the symbol table. This is to avoid * putting undeclared symbols into the symbol table if a syntax error * occurs. * * getsym() is called as soon as it is probably ok to put the symbol to * the symbol table. This does not mean that it is not possible that * symbols are put to the symbol table which are not completely * declared due to syntax errors. To avoid too many problems in this * case, symbols get type int in getsym(). * * XXX calls to getsym() should be delayed until decl1*() is called. */ sym_t * getsym(sbuf_t *sb) { dinfo_t *di; char *s; sym_t *sym; sym = sb->sb_sym; /* * During member declaration it is possible that name() looked * for symbols of type FVFT, although it should have looked for * symbols of type FTAG. Same can happen for labels. Both cases * are compensated here. */ if (symtyp == FMEMBER || symtyp == FLABEL) { if (sym == NULL || sym->s_kind == FVFT) sym = search(sb); } if (sym != NULL) { if (sym->s_kind != symtyp) INTERNAL_ERROR("getsym(%d, %d)", sym->s_kind, symtyp); symtyp = FVFT; freesb(sb); return sym; } /* create a new symbol table entry */ /* labels must always be allocated at level 1 (outermost block) */ if (symtyp == FLABEL) { sym = getlblk(1, sizeof(*sym)); s = getlblk(1, sb->sb_len + 1); (void)memcpy(s, sb->sb_name, sb->sb_len + 1); sym->s_name = s; sym->s_block_level = 1; di = dcs; while (di->d_next != NULL && di->d_next->d_next != NULL) di = di->d_next; lint_assert(di->d_ctx == AUTO); } else { sym = getblk(sizeof(*sym)); sym->s_name = sb->sb_name; sym->s_block_level = block_level; di = dcs; } UNIQUE_CURR_POS(sym->s_def_pos); if ((sym->s_kind = symtyp) != FLABEL) sym->s_type = gettyp(INT); symtyp = FVFT; if ((sym->s_link = symtab[sb->sb_hash]) != NULL) symtab[sb->sb_hash]->s_rlink = &sym->s_link; sym->s_rlink = &symtab[sb->sb_hash]; symtab[sb->sb_hash] = sym; *di->d_ldlsym = sym; di->d_ldlsym = &sym->s_dlnxt; freesb(sb); return sym; } /* * Construct a temporary symbol. The symbol starts with a digit, so that * it is illegal. */ sym_t * mktempsym(type_t *t) { static int n = 0; int h; char *s = getlblk(block_level, 64); sym_t *sym = getblk(sizeof(*sym)); (void)snprintf(s, 64, "%.8d_tmp", n++); h = hash(s); sym->s_name = s; sym->s_type = t; sym->s_block_level = block_level; sym->s_scl = AUTO; sym->s_kind = FVFT; sym->s_used = true; sym->s_set = true; if ((sym->s_link = symtab[h]) != NULL) symtab[h]->s_rlink = &sym->s_link; sym->s_rlink = &symtab[h]; symtab[h] = sym; *dcs->d_ldlsym = sym; dcs->d_ldlsym = &sym->s_dlnxt; return sym; } /* * Remove a symbol forever from the symbol table. s_block_level * is set to -1 to avoid that the symbol will later be put * back to the symbol table. */ void rmsym(sym_t *sym) { if ((*sym->s_rlink = sym->s_link) != NULL) sym->s_link->s_rlink = sym->s_rlink; sym->s_block_level = -1; sym->s_link = NULL; } /* * Remove a list of symbols declared at one level from the symbol * table. */ void rmsyms(sym_t *syms) { sym_t *sym; for (sym = syms; sym != NULL; sym = sym->s_dlnxt) { if (sym->s_block_level != -1) { if ((*sym->s_rlink = sym->s_link) != NULL) sym->s_link->s_rlink = sym->s_rlink; sym->s_link = NULL; sym->s_rlink = NULL; } } } /* * Put a symbol into the symbol table. */ void inssym(int bl, sym_t *sym) { int h; h = hash(sym->s_name); if ((sym->s_link = symtab[h]) != NULL) symtab[h]->s_rlink = &sym->s_link; sym->s_rlink = &symtab[h]; symtab[h] = sym; sym->s_block_level = bl; lint_assert(sym->s_link == NULL || sym->s_block_level >= sym->s_link->s_block_level); } /* * Called at level 0 after syntax errors. * * Removes all symbols which are not declared at level 0 from the * symbol table. Also frees all memory which is not associated with * level 0. */ void cleanup(void) { sym_t *sym, *nsym; int i; for (i = 0; i < HSHSIZ1; i++) { for (sym = symtab[i]; sym != NULL; sym = nsym) { nsym = sym->s_link; if (sym->s_block_level >= 1) { if ((*sym->s_rlink = nsym) != NULL) nsym->s_rlink = sym->s_rlink; } } } for (i = mem_block_level; i > 0; i--) freelblk(i); } /* * Create a new symbol with the name of an existing symbol. */ sym_t * pushdown(const sym_t *sym) { int h; sym_t *nsym; h = hash(sym->s_name); nsym = getblk(sizeof(*nsym)); lint_assert(sym->s_block_level <= block_level); nsym->s_name = sym->s_name; UNIQUE_CURR_POS(nsym->s_def_pos); nsym->s_kind = sym->s_kind; nsym->s_block_level = block_level; if ((nsym->s_link = symtab[h]) != NULL) symtab[h]->s_rlink = &nsym->s_link; nsym->s_rlink = &symtab[h]; symtab[h] = nsym; *dcs->d_ldlsym = nsym; dcs->d_ldlsym = &nsym->s_dlnxt; return nsym; } /* * Free any dynamically allocated memory referenced by * the value stack or yylval. * The type of information in yylval is described by tok. */ void freeyyv(void *sp, int tok) { if (tok == T_NAME || tok == T_TYPENAME) { sbuf_t *sb = *(sbuf_t **)sp; freesb(sb); } else if (tok == T_CON) { val_t *val = *(val_t **)sp; free(val); } else if (tok == T_STRING) { strg_t *strg = *(strg_t **)sp; if (strg->st_tspec == CHAR) { free(strg->st_cp); } else { lint_assert(strg->st_tspec == WCHAR); free(strg->st_wcp); } free(strg); } }