Home | History | Annotate | Line # | Download | only in lint1
lex.c revision 1.106
      1  1.106    rillig /* $NetBSD: lex.c,v 1.106 2022/02/28 22:41:07 rillig Exp $ */
      2    1.1    rillig 
      3    1.1    rillig /*
      4    1.1    rillig  * Copyright (c) 1996 Christopher G. Demetriou.  All Rights Reserved.
      5    1.1    rillig  * Copyright (c) 1994, 1995 Jochen Pohl
      6    1.1    rillig  * All Rights Reserved.
      7    1.1    rillig  *
      8    1.1    rillig  * Redistribution and use in source and binary forms, with or without
      9    1.1    rillig  * modification, are permitted provided that the following conditions
     10    1.1    rillig  * are met:
     11    1.1    rillig  * 1. Redistributions of source code must retain the above copyright
     12    1.1    rillig  *    notice, this list of conditions and the following disclaimer.
     13    1.1    rillig  * 2. Redistributions in binary form must reproduce the above copyright
     14    1.1    rillig  *    notice, this list of conditions and the following disclaimer in the
     15    1.1    rillig  *    documentation and/or other materials provided with the distribution.
     16    1.1    rillig  * 3. All advertising materials mentioning features or use of this software
     17    1.1    rillig  *    must display the following acknowledgement:
     18    1.1    rillig  *      This product includes software developed by Jochen Pohl for
     19    1.1    rillig  *      The NetBSD Project.
     20    1.1    rillig  * 4. The name of the author may not be used to endorse or promote products
     21    1.1    rillig  *    derived from this software without specific prior written permission.
     22    1.1    rillig  *
     23    1.1    rillig  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     24    1.1    rillig  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     25    1.1    rillig  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     26    1.1    rillig  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     27    1.1    rillig  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     28    1.1    rillig  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     29    1.1    rillig  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     30    1.1    rillig  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     31    1.1    rillig  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     32    1.1    rillig  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     33    1.1    rillig  */
     34    1.1    rillig 
     35    1.4  christos #if HAVE_NBTOOL_CONFIG_H
     36    1.4  christos #include "nbtool_config.h"
     37    1.4  christos #endif
     38    1.4  christos 
     39    1.1    rillig #include <sys/cdefs.h>
     40    1.1    rillig #if defined(__RCSID) && !defined(lint)
     41  1.106    rillig __RCSID("$NetBSD: lex.c,v 1.106 2022/02/28 22:41:07 rillig Exp $");
     42    1.1    rillig #endif
     43    1.1    rillig 
     44    1.1    rillig #include <ctype.h>
     45    1.1    rillig #include <errno.h>
     46    1.1    rillig #include <float.h>
     47    1.1    rillig #include <limits.h>
     48    1.1    rillig #include <math.h>
     49    1.1    rillig #include <stdlib.h>
     50    1.1    rillig #include <string.h>
     51    1.1    rillig 
     52    1.1    rillig #include "lint1.h"
     53    1.1    rillig #include "cgram.h"
     54    1.1    rillig 
     55   1.72    rillig #define CHAR_MASK	((1U << CHAR_SIZE) - 1)
     56    1.1    rillig 
     57    1.1    rillig 
     58    1.1    rillig /* Current position (it's also updated when an included file is parsed) */
     59   1.23    rillig pos_t	curr_pos = { "", 1, 0 };
     60    1.1    rillig 
     61    1.1    rillig /*
     62    1.1    rillig  * Current position in C source (not updated when an included file is
     63    1.1    rillig  * parsed).
     64    1.1    rillig  */
     65   1.23    rillig pos_t	csrc_pos = { "", 1, 0 };
     66    1.1    rillig 
     67   1.94    rillig bool in_gcc_attribute;
     68   1.94    rillig bool in_system_header;
     69    1.1    rillig 
     70   1.92    rillig #define kwdef(name, token, scl, tspec, tqual,	c90, c99, gcc, attr, deco) \
     71   1.13    rillig 	{ \
     72   1.13    rillig 		name, token, scl, tspec, tqual, \
     73   1.92    rillig 		(c90) > 0, (c99) > 0, (gcc) > 0, (attr) > 0, \
     74   1.66    rillig 		((deco) & 1) != 0, ((deco) & 2) != 0, ((deco) & 4) != 0, \
     75   1.13    rillig 	}
     76   1.92    rillig #define kwdef_token(name, token,		c90, c99, gcc, attr, deco) \
     77   1.92    rillig 	kwdef(name, token, 0, 0, 0,		c90, c99, gcc, attr, deco)
     78   1.92    rillig #define kwdef_sclass(name, sclass,		c90, c99, gcc, attr, deco) \
     79   1.92    rillig 	kwdef(name, T_SCLASS, sclass, 0, 0,	c90, c99, gcc, attr, deco)
     80   1.92    rillig #define kwdef_type(name, tspec,			c90, c99, gcc, attr, deco) \
     81   1.92    rillig 	kwdef(name, T_TYPE, 0, tspec, 0,	c90, c99, gcc, attr, deco)
     82   1.92    rillig #define kwdef_tqual(name, tqual,		c90, c99, gcc, attr, deco) \
     83   1.92    rillig 	kwdef(name, T_QUAL, 0, 0, tqual,	c90, c99, gcc, attr, deco)
     84   1.35    rillig #define kwdef_keyword(name, token) \
     85   1.35    rillig 	kwdef(name, token, 0, 0, 0,		0, 0, 0, 0, 1)
     86   1.34    rillig #define kwdef_gcc_attr(name, token) \
     87   1.34    rillig 	kwdef(name, token, 0, 0, 0,		0, 0, 1, 1, 5)
     88   1.13    rillig 
     89   1.94    rillig /* During initialization, these keywords are written to the symbol table. */
     90  1.106    rillig static const struct keyword {
     91    1.1    rillig 	const	char *kw_name;	/* keyword */
     92    1.1    rillig 	int	kw_token;	/* token returned by yylex() */
     93    1.1    rillig 	scl_t	kw_scl;		/* storage class if kw_token T_SCLASS */
     94    1.1    rillig 	tspec_t	kw_tspec;	/* type spec. if kw_token
     95    1.1    rillig 				 * T_TYPE or T_STRUCT_OR_UNION */
     96   1.13    rillig 	tqual_t	kw_tqual;	/* type qual. if kw_token T_QUAL */
     97   1.93    rillig 	bool	kw_c90:1;	/* C90 keyword */
     98   1.93    rillig 	bool	kw_c99:1;	/* C99 keyword */
     99   1.93    rillig 	bool	kw_gcc:1;	/* GCC keyword */
    100   1.93    rillig 	bool	kw_attr:1;	/* GCC attribute, keyword */
    101   1.93    rillig 	bool	kw_plain:1;	/* 'name' */
    102   1.93    rillig 	bool	kw_leading:1;	/* '__name' */
    103   1.93    rillig 	bool	kw_both:1;	/* '__name__' */
    104   1.94    rillig } keywords[] = {
    105   1.56    rillig 	kwdef_gcc_attr(	"alias",	T_AT_ALIAS),
    106   1.35    rillig 	kwdef_keyword(	"_Alignas",	T_ALIGNAS),
    107   1.35    rillig 	kwdef_keyword(	"_Alignof",	T_ALIGNOF),
    108   1.34    rillig 	kwdef_gcc_attr(	"aligned",	T_AT_ALIGNED),
    109   1.56    rillig 	kwdef_token(	"__alignof__",	T_ALIGNOF,		0,0,0,0,1),
    110   1.34    rillig 	kwdef_gcc_attr(	"alloc_size",	T_AT_ALLOC_SIZE),
    111   1.34    rillig 	kwdef_gcc_attr(	"always_inline",T_AT_ALWAYS_INLINE),
    112   1.13    rillig 	kwdef_token(	"asm",		T_ASM,			0,0,1,0,7),
    113   1.13    rillig 	kwdef_token(	"attribute",	T_ATTRIBUTE,		0,0,1,0,6),
    114   1.13    rillig 	kwdef_sclass(	"auto",		AUTO,			0,0,0,0,1),
    115   1.56    rillig 	kwdef_type(	"_Bool",	BOOL,			0,1,0,0,1),
    116   1.34    rillig 	kwdef_gcc_attr(	"bounded",	T_AT_BOUNDED),
    117   1.35    rillig 	kwdef_keyword(	"break",	T_BREAK),
    118   1.34    rillig 	kwdef_gcc_attr(	"buffer",	T_AT_BUFFER),
    119   1.56    rillig 	kwdef_token(	"__builtin_offsetof", T_BUILTIN_OFFSETOF, 0,0,1,0,1),
    120   1.35    rillig 	kwdef_keyword(	"case",		T_CASE),
    121   1.13    rillig 	kwdef_type(	"char",		CHAR,			0,0,0,0,1),
    122   1.34    rillig 	kwdef_gcc_attr(	"cold",		T_AT_COLD),
    123   1.34    rillig 	kwdef_gcc_attr(	"common",	T_AT_COMMON),
    124   1.56    rillig 	kwdef_type(	"_Complex",	COMPLEX,		0,1,0,0,1),
    125   1.13    rillig 	kwdef_tqual(	"const",	CONST,			1,0,0,0,7),
    126   1.34    rillig 	kwdef_gcc_attr(	"constructor",	T_AT_CONSTRUCTOR),
    127   1.35    rillig 	kwdef_keyword(	"continue",	T_CONTINUE),
    128   1.35    rillig 	kwdef_keyword(	"default",	T_DEFAULT),
    129   1.34    rillig 	kwdef_gcc_attr(	"deprecated",	T_AT_DEPRECATED),
    130   1.34    rillig 	kwdef_gcc_attr(	"destructor",	T_AT_DESTRUCTOR),
    131   1.90  christos 	kwdef_gcc_attr(	"disable_sanitizer_instrumentation",
    132   1.90  christos 	    T_AT_DISABLE_SANITIZER_INSTRUMENTATION),
    133   1.35    rillig 	kwdef_keyword(	"do",		T_DO),
    134   1.13    rillig 	kwdef_type(	"double",	DOUBLE,			0,0,0,0,1),
    135   1.35    rillig 	kwdef_keyword(	"else",		T_ELSE),
    136   1.35    rillig 	kwdef_keyword(	"enum",		T_ENUM),
    137   1.56    rillig 	kwdef_token(	"__extension__",T_EXTENSION,		0,0,1,0,1),
    138   1.13    rillig 	kwdef_sclass(	"extern",	EXTERN,			0,0,0,0,1),
    139   1.34    rillig 	kwdef_gcc_attr(	"fallthrough",	T_AT_FALLTHROUGH),
    140   1.13    rillig 	kwdef_type(	"float",	FLOAT,			0,0,0,0,1),
    141   1.35    rillig 	kwdef_keyword(	"for",		T_FOR),
    142   1.34    rillig 	kwdef_gcc_attr(	"format",	T_AT_FORMAT),
    143   1.34    rillig 	kwdef_gcc_attr(	"format_arg",	T_AT_FORMAT_ARG),
    144   1.56    rillig 	kwdef_token(	"_Generic",	T_GENERIC,		0,1,0,0,1),
    145   1.34    rillig 	kwdef_gcc_attr(	"gnu_inline",	T_AT_GNU_INLINE),
    146   1.34    rillig 	kwdef_gcc_attr(	"gnu_printf",	T_AT_FORMAT_GNU_PRINTF),
    147   1.35    rillig 	kwdef_keyword(	"goto",		T_GOTO),
    148   1.55    rillig 	kwdef_gcc_attr(	"hot",		T_AT_HOT),
    149   1.35    rillig 	kwdef_keyword(	"if",		T_IF),
    150   1.56    rillig 	kwdef_token(	"__imag__",	T_IMAG,			0,0,1,0,1),
    151   1.13    rillig 	kwdef_sclass(	"inline",	INLINE,			0,1,0,0,7),
    152   1.13    rillig 	kwdef_type(	"int",		INT,			0,0,0,0,1),
    153   1.56    rillig #ifdef INT128_SIZE
    154   1.56    rillig 	kwdef_type(	"__int128_t",	INT128,			0,1,0,0,1),
    155   1.56    rillig #endif
    156   1.13    rillig 	kwdef_type(	"long",		LONG,			0,0,0,0,1),
    157   1.34    rillig 	kwdef_gcc_attr(	"malloc",	T_AT_MALLOC),
    158   1.34    rillig 	kwdef_gcc_attr(	"may_alias",	T_AT_MAY_ALIAS),
    159   1.34    rillig 	kwdef_gcc_attr(	"minbytes",	T_AT_MINBYTES),
    160   1.34    rillig 	kwdef_gcc_attr(	"mode",		T_AT_MODE),
    161   1.34    rillig 	kwdef_gcc_attr("no_instrument_function",
    162   1.34    rillig 					T_AT_NO_INSTRUMENT_FUNCTION),
    163   1.90  christos 	kwdef_gcc_attr(	"no_sanitize",	T_AT_NO_SANITIZE),
    164   1.90  christos 	kwdef_gcc_attr(	"no_sanitize_thread",	T_AT_NO_SANITIZE_THREAD),
    165   1.34    rillig 	kwdef_gcc_attr(	"noinline",	T_AT_NOINLINE),
    166   1.34    rillig 	kwdef_gcc_attr(	"nonnull",	T_AT_NONNULL),
    167   1.34    rillig 	kwdef_gcc_attr(	"nonstring",	T_AT_NONSTRING),
    168   1.56    rillig 	kwdef_token(	"_Noreturn",	T_NORETURN,		0,1,0,0,1),
    169   1.34    rillig 	kwdef_gcc_attr(	"noreturn",	T_AT_NORETURN),
    170   1.34    rillig 	kwdef_gcc_attr(	"nothrow",	T_AT_NOTHROW),
    171   1.34    rillig 	kwdef_gcc_attr(	"optimize",	T_AT_OPTIMIZE),
    172   1.97  christos 	kwdef_gcc_attr(	"optnone",	T_AT_OPTNONE),
    173   1.34    rillig 	kwdef_gcc_attr(	"packed",	T_AT_PACKED),
    174   1.56    rillig 	kwdef_token(	"__packed",	T_PACKED,		0,0,0,0,1),
    175   1.34    rillig 	kwdef_gcc_attr(	"pcs",		T_AT_PCS),
    176   1.34    rillig 	kwdef_gcc_attr(	"printf",	T_AT_FORMAT_PRINTF),
    177   1.34    rillig 	kwdef_gcc_attr(	"pure",		T_AT_PURE),
    178   1.56    rillig 	kwdef_token(	"__real__",	T_REAL,			0,0,1,0,1),
    179   1.13    rillig 	kwdef_sclass(	"register",	REG,			0,0,0,0,1),
    180   1.70    rillig 	kwdef_gcc_attr(	"regparm",	T_AT_REGPARM),
    181   1.89  christos 	kwdef_tqual(	"restrict",	RESTRICT,		0,1,0,0,7),
    182   1.35    rillig 	kwdef_keyword(	"return",	T_RETURN),
    183   1.63  christos 	kwdef_gcc_attr(	"returns_nonnull",T_AT_RETURNS_NONNULL),
    184   1.34    rillig 	kwdef_gcc_attr(	"returns_twice",T_AT_RETURNS_TWICE),
    185   1.34    rillig 	kwdef_gcc_attr(	"scanf",	T_AT_FORMAT_SCANF),
    186   1.13    rillig 	kwdef_token(	"section",	T_AT_SECTION,		0,0,1,1,7),
    187   1.34    rillig 	kwdef_gcc_attr(	"sentinel",	T_AT_SENTINEL),
    188   1.13    rillig 	kwdef_type(	"short",	SHORT,			0,0,0,0,1),
    189   1.13    rillig 	kwdef_type(	"signed",	SIGNED,			1,0,0,0,3),
    190   1.35    rillig 	kwdef_keyword(	"sizeof",	T_SIZEOF),
    191   1.13    rillig 	kwdef_sclass(	"static",	STATIC,			0,0,0,0,1),
    192   1.83  christos 	kwdef_keyword(	"_Static_assert",	T_STATIC_ASSERT),
    193   1.34    rillig 	kwdef_gcc_attr(	"strfmon",	T_AT_FORMAT_STRFMON),
    194   1.34    rillig 	kwdef_gcc_attr(	"strftime",	T_AT_FORMAT_STRFTIME),
    195   1.34    rillig 	kwdef_gcc_attr(	"string",	T_AT_STRING),
    196   1.13    rillig 	kwdef("struct",	T_STRUCT_OR_UNION, 0,	STRUCT,	0,	0,0,0,0,1),
    197   1.35    rillig 	kwdef_keyword(	"switch",	T_SWITCH),
    198   1.56    rillig 	kwdef_token(	"__symbolrename",	T_SYMBOLRENAME,	0,0,0,0,1),
    199   1.34    rillig 	kwdef_gcc_attr(	"syslog",	T_AT_FORMAT_SYSLOG),
    200   1.88  christos 	kwdef_gcc_attr(	"target",	T_AT_TARGET),
    201   1.56    rillig 	kwdef_tqual(	"__thread",	THREAD,			0,0,1,0,1),
    202   1.56    rillig 	kwdef_tqual(	"_Thread_local", THREAD,		0,1,0,0,1),
    203   1.56    rillig 	kwdef_gcc_attr(	"tls_model",	T_AT_TLS_MODEL),
    204   1.34    rillig 	kwdef_gcc_attr(	"transparent_union", T_AT_TUNION),
    205   1.13    rillig 	kwdef_sclass(	"typedef",	TYPEDEF,		0,0,0,0,1),
    206   1.13    rillig 	kwdef_token(	"typeof",	T_TYPEOF,		0,0,1,0,7),
    207   1.56    rillig #ifdef INT128_SIZE
    208   1.56    rillig 	kwdef_type(	"__uint128_t",	UINT128,		0,1,0,0,1),
    209   1.56    rillig #endif
    210   1.13    rillig 	kwdef("union",	T_STRUCT_OR_UNION, 0,	UNION,	0,	0,0,0,0,1),
    211   1.13    rillig 	kwdef_type(	"unsigned",	UNSIGN,			0,0,0,0,1),
    212   1.34    rillig 	kwdef_gcc_attr(	"unused",	T_AT_UNUSED),
    213   1.34    rillig 	kwdef_gcc_attr(	"used",		T_AT_USED),
    214   1.34    rillig 	kwdef_gcc_attr(	"visibility",	T_AT_VISIBILITY),
    215   1.13    rillig 	kwdef_type(	"void",		VOID,			0,0,0,0,1),
    216   1.13    rillig 	kwdef_tqual(	"volatile",	VOLATILE,		1,0,0,0,7),
    217   1.34    rillig 	kwdef_gcc_attr(	"warn_unused_result", T_AT_WARN_UNUSED_RESULT),
    218   1.34    rillig 	kwdef_gcc_attr(	"weak",		T_AT_WEAK),
    219   1.35    rillig 	kwdef_keyword(	"while",	T_WHILE),
    220   1.13    rillig 	kwdef(NULL, 0, 0, 0, 0, 0, 0, 0, 0, 0),
    221   1.13    rillig #undef kwdef
    222   1.13    rillig #undef kwdef_token
    223   1.13    rillig #undef kwdef_sclass
    224   1.13    rillig #undef kwdef_type
    225   1.13    rillig #undef kwdef_tqual
    226   1.36    rillig #undef kwdef_keyword
    227   1.36    rillig #undef kwdef_gcc_attr
    228    1.1    rillig };
    229    1.1    rillig 
    230    1.1    rillig /* Symbol table */
    231    1.1    rillig static	sym_t	*symtab[HSHSIZ1];
    232    1.1    rillig 
    233    1.1    rillig /* type of next expected symbol */
    234    1.1    rillig symt_t	symtyp;
    235    1.1    rillig 
    236    1.1    rillig 
    237  1.105    rillig static	int	get_escaped_char(int);
    238  1.105    rillig 
    239  1.105    rillig 
    240  1.104    rillig static unsigned int
    241  1.104    rillig hash(const char *s)
    242  1.104    rillig {
    243  1.104    rillig 	unsigned int v;
    244  1.104    rillig 	const char *p;
    245  1.104    rillig 
    246  1.104    rillig 	v = 0;
    247  1.104    rillig 	for (p = s; *p != '\0'; p++) {
    248  1.104    rillig 		v = (v << 4) + (unsigned char)*p;
    249  1.104    rillig 		v ^= v >> 28;
    250  1.104    rillig 	}
    251  1.104    rillig 	return v % HSHSIZ1;
    252  1.104    rillig }
    253  1.104    rillig 
    254    1.1    rillig static void
    255   1.62    rillig symtab_add(sym_t *sym)
    256   1.60    rillig {
    257  1.104    rillig 	unsigned int h;
    258   1.60    rillig 
    259   1.62    rillig 	h = hash(sym->s_name);
    260  1.102    rillig 	if ((sym->s_symtab_next = symtab[h]) != NULL)
    261  1.102    rillig 		symtab[h]->s_symtab_ref = &sym->s_symtab_next;
    262  1.102    rillig 	sym->s_symtab_ref = &symtab[h];
    263   1.60    rillig 	symtab[h] = sym;
    264   1.60    rillig }
    265   1.60    rillig 
    266  1.104    rillig static sym_t *
    267  1.104    rillig symtab_search(sbuf_t *sb)
    268  1.104    rillig {
    269  1.104    rillig 
    270  1.104    rillig 	unsigned int h = hash(sb->sb_name);
    271  1.104    rillig 	for (sym_t *sym = symtab[h]; sym != NULL; sym = sym->s_symtab_next) {
    272  1.104    rillig 		if (strcmp(sym->s_name, sb->sb_name) != 0)
    273  1.104    rillig 			continue;
    274  1.104    rillig 
    275  1.104    rillig 		const struct keyword *kw = sym->s_keyword;
    276  1.104    rillig 		if (kw != NULL && !kw->kw_attr)
    277  1.104    rillig 			return sym;
    278  1.104    rillig 		if (kw != NULL && in_gcc_attribute)
    279  1.104    rillig 			return sym;
    280  1.104    rillig 		if (kw == NULL && !in_gcc_attribute && sym->s_kind == symtyp)
    281  1.104    rillig 			return sym;
    282  1.104    rillig 	}
    283  1.104    rillig 
    284  1.104    rillig 	return NULL;
    285  1.104    rillig }
    286  1.104    rillig 
    287   1.60    rillig static void
    288   1.61    rillig symtab_remove(sym_t *sym)
    289   1.61    rillig {
    290   1.61    rillig 
    291  1.102    rillig 	if ((*sym->s_symtab_ref = sym->s_symtab_next) != NULL)
    292  1.102    rillig 		sym->s_symtab_next->s_symtab_ref = sym->s_symtab_ref;
    293  1.102    rillig 	sym->s_symtab_next = NULL;
    294   1.61    rillig }
    295   1.61    rillig 
    296  1.104    rillig static void
    297  1.104    rillig symtab_remove_locals(void)
    298  1.104    rillig {
    299  1.104    rillig 
    300  1.104    rillig 	for (size_t i = 0; i < HSHSIZ1; i++) {
    301  1.104    rillig 		for (sym_t *sym = symtab[i]; sym != NULL; ) {
    302  1.104    rillig 			sym_t *next = sym->s_symtab_next;
    303  1.104    rillig 			if (sym->s_block_level >= 1)
    304  1.104    rillig 				symtab_remove(sym);
    305  1.104    rillig 			sym = next;
    306  1.104    rillig 		}
    307  1.104    rillig 	}
    308  1.104    rillig }
    309   1.61    rillig 
    310   1.61    rillig static void
    311   1.94    rillig add_keyword(const struct keyword *kw, bool leading, bool trailing)
    312    1.1    rillig {
    313    1.1    rillig 	sym_t *sym;
    314    1.1    rillig 	char buf[256];
    315    1.1    rillig 	const char *name;
    316    1.1    rillig 
    317   1.66    rillig 	if (!leading && !trailing) {
    318    1.1    rillig 		name = kw->kw_name;
    319   1.66    rillig 	} else {
    320   1.73    rillig 		(void)snprintf(buf, sizeof(buf), "%s%s%s",
    321   1.66    rillig 		    leading ? "__" : "", kw->kw_name, trailing ? "__" : "");
    322   1.66    rillig 		name = xstrdup(buf);
    323    1.1    rillig 	}
    324    1.1    rillig 
    325  1.101    rillig 	sym = block_zero_alloc(sizeof(*sym));
    326    1.1    rillig 	sym->s_name = name;
    327    1.1    rillig 	sym->s_keyword = kw;
    328    1.1    rillig 	sym->s_value.v_quad = kw->kw_token;
    329    1.1    rillig 	if (kw->kw_token == T_TYPE || kw->kw_token == T_STRUCT_OR_UNION) {
    330    1.1    rillig 		sym->s_tspec = kw->kw_tspec;
    331    1.1    rillig 	} else if (kw->kw_token == T_SCLASS) {
    332    1.1    rillig 		sym->s_scl = kw->kw_scl;
    333    1.1    rillig 	} else if (kw->kw_token == T_QUAL) {
    334    1.1    rillig 		sym->s_tqual = kw->kw_tqual;
    335    1.1    rillig 	}
    336   1.60    rillig 
    337   1.60    rillig 	symtab_add(sym);
    338    1.1    rillig }
    339    1.1    rillig 
    340    1.1    rillig /*
    341    1.1    rillig  * All keywords are written to the symbol table. This saves us looking
    342   1.67    rillig  * in an extra table for each name we found.
    343    1.1    rillig  */
    344    1.1    rillig void
    345    1.1    rillig initscan(void)
    346    1.1    rillig {
    347  1.106    rillig 	const struct keyword *kw;
    348    1.1    rillig 
    349   1.94    rillig 	for (kw = keywords; kw->kw_name != NULL; kw++) {
    350   1.92    rillig 		if ((kw->kw_c90 || kw->kw_c99) && tflag)
    351    1.1    rillig 			continue;
    352    1.1    rillig 		if (kw->kw_c99 && !(Sflag || gflag))
    353    1.1    rillig 			continue;
    354    1.1    rillig 		if (kw->kw_gcc && !gflag)
    355    1.1    rillig 			continue;
    356   1.66    rillig 		if (kw->kw_plain)
    357   1.66    rillig 			add_keyword(kw, false, false);
    358   1.66    rillig 		if (kw->kw_leading)
    359   1.66    rillig 			add_keyword(kw, true, false);
    360   1.66    rillig 		if (kw->kw_both)
    361   1.66    rillig 			add_keyword(kw, true, true);
    362    1.1    rillig 	}
    363    1.1    rillig }
    364    1.1    rillig 
    365    1.1    rillig /*
    366    1.1    rillig  * Read a character and ensure that it is positive (except EOF).
    367    1.1    rillig  * Increment line count(s) if necessary.
    368    1.1    rillig  */
    369    1.1    rillig static int
    370    1.1    rillig inpc(void)
    371    1.1    rillig {
    372    1.1    rillig 	int	c;
    373    1.1    rillig 
    374   1.41    rillig 	if ((c = lex_input()) == EOF)
    375   1.41    rillig 		return c;
    376   1.41    rillig 	c &= CHAR_MASK;
    377   1.41    rillig 	if (c == '\0')
    378   1.41    rillig 		return EOF;	/* lex returns 0 on EOF. */
    379   1.41    rillig 	if (c == '\n')
    380    1.6    rillig 		lex_next_line();
    381    1.1    rillig 	return c;
    382    1.1    rillig }
    383    1.1    rillig 
    384  1.105    rillig static int
    385  1.105    rillig lex_keyword(sym_t *sym)
    386  1.105    rillig {
    387  1.105    rillig 	int	t;
    388  1.105    rillig 
    389  1.105    rillig 	if ((t = (int)sym->s_value.v_quad) == T_SCLASS) {
    390  1.105    rillig 		yylval.y_scl = sym->s_scl;
    391  1.105    rillig 	} else if (t == T_TYPE || t == T_STRUCT_OR_UNION) {
    392  1.105    rillig 		yylval.y_tspec = sym->s_tspec;
    393  1.105    rillig 	} else if (t == T_QUAL) {
    394  1.105    rillig 		yylval.y_tqual = sym->s_tqual;
    395  1.105    rillig 	}
    396  1.105    rillig 	return t;
    397  1.105    rillig }
    398  1.105    rillig 
    399    1.1    rillig /*
    400    1.1    rillig  * Lex has found a letter followed by zero or more letters or digits.
    401    1.1    rillig  * It looks for a symbol in the symbol table with the same name. This
    402    1.1    rillig  * symbol must either be a keyword or a symbol of the type required by
    403    1.1    rillig  * symtyp (label, member, tag, ...).
    404    1.1    rillig  *
    405    1.1    rillig  * If it is a keyword, the token is returned. In some cases it is described
    406    1.1    rillig  * more deeply by data written to yylval.
    407    1.1    rillig  *
    408   1.94    rillig  * If it is a symbol, T_NAME is returned and the name is stored in yylval.
    409   1.94    rillig  * If there is already a symbol of the same name and type in the symbol
    410   1.94    rillig  * table, yylval.y_name->sb_sym points there.
    411    1.1    rillig  */
    412    1.1    rillig extern int
    413    1.1    rillig lex_name(const char *yytext, size_t yyleng)
    414    1.1    rillig {
    415    1.1    rillig 	char	*s;
    416    1.1    rillig 	sbuf_t	*sb;
    417    1.1    rillig 	sym_t	*sym;
    418    1.1    rillig 	int	tok;
    419    1.1    rillig 
    420  1.100    rillig 	sb = xmalloc(sizeof(*sb));
    421    1.1    rillig 	sb->sb_name = yytext;
    422    1.1    rillig 	sb->sb_len = yyleng;
    423  1.104    rillig 	if ((sym = symtab_search(sb)) != NULL && sym->s_keyword != NULL) {
    424  1.100    rillig 		free(sb);
    425  1.105    rillig 		return lex_keyword(sym);
    426    1.1    rillig 	}
    427    1.1    rillig 
    428    1.1    rillig 	sb->sb_sym = sym;
    429    1.1    rillig 
    430    1.1    rillig 	if (sym != NULL) {
    431   1.12    rillig 		lint_assert(block_level >= sym->s_block_level);
    432    1.1    rillig 		sb->sb_name = sym->s_name;
    433    1.1    rillig 		sb->sb_len = strlen(sym->s_name);
    434    1.1    rillig 		tok = sym->s_scl == TYPEDEF ? T_TYPENAME : T_NAME;
    435    1.1    rillig 	} else {
    436  1.101    rillig 		s = block_zero_alloc(yyleng + 1);
    437    1.1    rillig 		(void)memcpy(s, yytext, yyleng + 1);
    438    1.1    rillig 		sb->sb_name = s;
    439    1.1    rillig 		sb->sb_len = yyleng;
    440    1.1    rillig 		tok = T_NAME;
    441    1.1    rillig 	}
    442    1.1    rillig 
    443   1.54    rillig 	yylval.y_name = sb;
    444    1.1    rillig 	return tok;
    445    1.1    rillig }
    446    1.1    rillig 
    447    1.1    rillig /*
    448    1.1    rillig  * Convert a string representing an integer into internal representation.
    449   1.24    rillig  * Return T_CON, storing the numeric value in yylval, for yylex.
    450    1.1    rillig  */
    451    1.1    rillig int
    452    1.6    rillig lex_integer_constant(const char *yytext, size_t yyleng, int base)
    453    1.1    rillig {
    454    1.1    rillig 	int	l_suffix, u_suffix;
    455   1.72    rillig 	size_t	len;
    456    1.1    rillig 	const	char *cp;
    457    1.1    rillig 	char	c, *eptr;
    458    1.1    rillig 	tspec_t	typ;
    459    1.1    rillig 	bool	ansiu;
    460   1.11    rillig 	bool	warned = false;
    461    1.1    rillig 	uint64_t uq = 0;
    462   1.77    rillig 
    463   1.77    rillig 	/* C11 6.4.4.1p5 */
    464   1.77    rillig 	static const tspec_t suffix_type[2][3] = {
    465    1.1    rillig 		{ INT,  LONG,  QUAD, },
    466    1.1    rillig 		{ UINT, ULONG, UQUAD, }
    467    1.1    rillig 	};
    468    1.1    rillig 
    469    1.1    rillig 	cp = yytext;
    470    1.1    rillig 	len = yyleng;
    471    1.1    rillig 
    472    1.1    rillig 	/* skip 0[xX] or 0[bB] */
    473    1.1    rillig 	if (base == 16 || base == 2) {
    474    1.1    rillig 		cp += 2;
    475    1.1    rillig 		len -= 2;
    476    1.1    rillig 	}
    477    1.1    rillig 
    478    1.1    rillig 	/* read suffixes */
    479    1.1    rillig 	l_suffix = u_suffix = 0;
    480    1.1    rillig 	for (;;) {
    481    1.1    rillig 		if ((c = cp[len - 1]) == 'l' || c == 'L') {
    482    1.1    rillig 			l_suffix++;
    483    1.1    rillig 		} else if (c == 'u' || c == 'U') {
    484    1.1    rillig 			u_suffix++;
    485    1.1    rillig 		} else {
    486    1.1    rillig 			break;
    487    1.1    rillig 		}
    488    1.1    rillig 		len--;
    489    1.1    rillig 	}
    490    1.1    rillig 	if (l_suffix > 2 || u_suffix > 1) {
    491    1.1    rillig 		/* malformed integer constant */
    492    1.1    rillig 		warning(251);
    493    1.1    rillig 		if (l_suffix > 2)
    494    1.1    rillig 			l_suffix = 2;
    495    1.1    rillig 		if (u_suffix > 1)
    496    1.1    rillig 			u_suffix = 1;
    497    1.1    rillig 	}
    498    1.1    rillig 	if (tflag && u_suffix != 0) {
    499    1.1    rillig 		/* suffix U is illegal in traditional C */
    500    1.1    rillig 		warning(97);
    501    1.1    rillig 	}
    502   1.77    rillig 	typ = suffix_type[u_suffix][l_suffix];
    503    1.1    rillig 
    504    1.1    rillig 	errno = 0;
    505    1.1    rillig 
    506   1.81    rillig 	uq = (uint64_t)strtoull(cp, &eptr, base);
    507    1.1    rillig 	lint_assert(eptr == cp + len);
    508   1.11    rillig 	if (errno != 0) {
    509    1.1    rillig 		/* integer constant out of range */
    510    1.1    rillig 		warning(252);
    511   1.11    rillig 		warned = true;
    512   1.11    rillig 	}
    513    1.1    rillig 
    514    1.1    rillig 	/*
    515    1.1    rillig 	 * If the value is too big for the current type, we must choose
    516    1.1    rillig 	 * another type.
    517    1.1    rillig 	 */
    518    1.1    rillig 	ansiu = false;
    519    1.1    rillig 	switch (typ) {
    520    1.1    rillig 	case INT:
    521    1.1    rillig 		if (uq <= TARG_INT_MAX) {
    522    1.1    rillig 			/* ok */
    523    1.1    rillig 		} else if (uq <= TARG_UINT_MAX && base != 10) {
    524    1.1    rillig 			typ = UINT;
    525    1.1    rillig 		} else if (uq <= TARG_LONG_MAX) {
    526    1.1    rillig 			typ = LONG;
    527    1.1    rillig 		} else {
    528    1.1    rillig 			typ = ULONG;
    529   1.11    rillig 			if (uq > TARG_ULONG_MAX && !warned) {
    530    1.1    rillig 				/* integer constant out of range */
    531    1.1    rillig 				warning(252);
    532    1.1    rillig 			}
    533    1.1    rillig 		}
    534    1.1    rillig 		if (typ == UINT || typ == ULONG) {
    535    1.1    rillig 			if (tflag) {
    536    1.1    rillig 				typ = LONG;
    537    1.1    rillig 			} else if (!sflag) {
    538    1.1    rillig 				/*
    539    1.1    rillig 				 * Remember that the constant is unsigned
    540    1.1    rillig 				 * only in ANSI C
    541    1.1    rillig 				 */
    542    1.1    rillig 				ansiu = true;
    543    1.1    rillig 			}
    544    1.1    rillig 		}
    545    1.1    rillig 		break;
    546    1.1    rillig 	case UINT:
    547    1.1    rillig 		if (uq > TARG_UINT_MAX) {
    548    1.1    rillig 			typ = ULONG;
    549   1.11    rillig 			if (uq > TARG_ULONG_MAX && !warned) {
    550    1.1    rillig 				/* integer constant out of range */
    551    1.1    rillig 				warning(252);
    552    1.1    rillig 			}
    553    1.1    rillig 		}
    554    1.1    rillig 		break;
    555    1.1    rillig 	case LONG:
    556    1.1    rillig 		if (uq > TARG_LONG_MAX && !tflag) {
    557    1.1    rillig 			typ = ULONG;
    558    1.1    rillig 			if (!sflag)
    559    1.1    rillig 				ansiu = true;
    560   1.11    rillig 			if (uq > TARG_ULONG_MAX && !warned) {
    561    1.1    rillig 				/* integer constant out of range */
    562    1.1    rillig 				warning(252);
    563    1.1    rillig 			}
    564    1.1    rillig 		}
    565    1.1    rillig 		break;
    566    1.1    rillig 	case ULONG:
    567   1.11    rillig 		if (uq > TARG_ULONG_MAX && !warned) {
    568    1.1    rillig 			/* integer constant out of range */
    569    1.1    rillig 			warning(252);
    570    1.1    rillig 		}
    571    1.1    rillig 		break;
    572    1.1    rillig 	case QUAD:
    573    1.1    rillig 		if (uq > TARG_QUAD_MAX && !tflag) {
    574    1.1    rillig 			typ = UQUAD;
    575    1.1    rillig 			if (!sflag)
    576    1.1    rillig 				ansiu = true;
    577    1.1    rillig 		}
    578    1.1    rillig 		break;
    579    1.1    rillig 	case UQUAD:
    580   1.11    rillig 		if (uq > TARG_UQUAD_MAX && !warned) {
    581    1.1    rillig 			/* integer constant out of range */
    582    1.1    rillig 			warning(252);
    583    1.1    rillig 		}
    584    1.1    rillig 		break;
    585   1.64    rillig 	default:
    586    1.1    rillig 		break;
    587    1.1    rillig 	}
    588    1.1    rillig 
    589   1.72    rillig 	uq = (uint64_t)convert_integer((int64_t)uq, typ, 0);
    590    1.1    rillig 
    591   1.22    rillig 	yylval.y_val = xcalloc(1, sizeof(*yylval.y_val));
    592   1.17    rillig 	yylval.y_val->v_tspec = typ;
    593   1.46    rillig 	yylval.y_val->v_unsigned_since_c90 = ansiu;
    594    1.1    rillig 	yylval.y_val->v_quad = (int64_t)uq;
    595    1.1    rillig 
    596    1.1    rillig 	return T_CON;
    597    1.1    rillig }
    598    1.1    rillig 
    599    1.1    rillig /*
    600   1.49    rillig  * Extend or truncate q to match t.  If t is signed, sign-extend.
    601   1.50    rillig  *
    602   1.50    rillig  * len is the number of significant bits. If len is -1, len is set
    603   1.50    rillig  * to the width of type t.
    604    1.1    rillig  */
    605    1.1    rillig int64_t
    606   1.72    rillig convert_integer(int64_t q, tspec_t t, unsigned int len)
    607    1.1    rillig {
    608   1.37    rillig 	uint64_t vbits;
    609    1.1    rillig 
    610   1.72    rillig 	if (len == 0)
    611   1.10    rillig 		len = size_in_bits(t);
    612    1.1    rillig 
    613   1.37    rillig 	vbits = value_bits(len);
    614   1.68    rillig 	return t == PTR || is_uinteger(t) || ((q & bit(len - 1)) == 0)
    615   1.65    rillig 	    ? (int64_t)(q & vbits)
    616   1.65    rillig 	    : (int64_t)(q | ~vbits);
    617    1.1    rillig }
    618    1.1    rillig 
    619    1.1    rillig /*
    620   1.87    rillig  * Convert a string representing a floating point value into its numerical
    621   1.87    rillig  * representation. Type and value are returned in yylval.
    622   1.87    rillig  *
    623    1.1    rillig  * XXX Currently it is not possible to convert constants of type
    624    1.1    rillig  * long double which are greater than DBL_MAX.
    625    1.1    rillig  */
    626    1.1    rillig int
    627    1.6    rillig lex_floating_constant(const char *yytext, size_t yyleng)
    628    1.1    rillig {
    629    1.1    rillig 	const	char *cp;
    630   1.81    rillig 	size_t	len;
    631    1.1    rillig 	tspec_t typ;
    632    1.1    rillig 	char	c, *eptr;
    633    1.1    rillig 	double	d;
    634    1.1    rillig 	float	f = 0;
    635    1.1    rillig 
    636    1.1    rillig 	cp = yytext;
    637    1.1    rillig 	len = yyleng;
    638    1.1    rillig 
    639   1.81    rillig 	if (cp[len - 1] == 'i')
    640   1.81    rillig 		len--;		/* imaginary, do nothing for now */
    641   1.81    rillig 
    642    1.1    rillig 	if ((c = cp[len - 1]) == 'f' || c == 'F') {
    643    1.1    rillig 		typ = FLOAT;
    644    1.1    rillig 		len--;
    645    1.1    rillig 	} else if (c == 'l' || c == 'L') {
    646    1.1    rillig 		typ = LDOUBLE;
    647    1.1    rillig 		len--;
    648    1.1    rillig 	} else {
    649    1.1    rillig 		if (c == 'd' || c == 'D')
    650    1.1    rillig 			len--;
    651    1.1    rillig 		typ = DOUBLE;
    652    1.1    rillig 	}
    653    1.1    rillig 
    654    1.1    rillig 	if (tflag && typ != DOUBLE) {
    655    1.1    rillig 		/* suffixes F and L are illegal in traditional C */
    656    1.1    rillig 		warning(98);
    657    1.1    rillig 	}
    658    1.1    rillig 
    659    1.1    rillig 	errno = 0;
    660    1.1    rillig 	d = strtod(cp, &eptr);
    661    1.1    rillig 	if (eptr != cp + len) {
    662    1.1    rillig 		switch (*eptr) {
    663    1.1    rillig 			/*
    664    1.1    rillig 			 * XXX: non-native non-current strtod() may not handle hex
    665    1.1    rillig 			 * floats, ignore the rest if we find traces of hex float
    666    1.1    rillig 			 * syntax...
    667    1.1    rillig 			 */
    668    1.1    rillig 		case 'p':
    669    1.1    rillig 		case 'P':
    670    1.1    rillig 		case 'x':
    671    1.1    rillig 		case 'X':
    672    1.1    rillig 			d = 0;
    673    1.1    rillig 			errno = 0;
    674    1.1    rillig 			break;
    675    1.1    rillig 		default:
    676   1.87    rillig 			INTERNAL_ERROR("lex_floating_constant(%s->%s)",
    677   1.87    rillig 			    cp, eptr);
    678    1.1    rillig 		}
    679    1.1    rillig 	}
    680    1.1    rillig 	if (errno != 0)
    681    1.1    rillig 		/* floating-point constant out of range */
    682    1.1    rillig 		warning(248);
    683    1.1    rillig 
    684    1.1    rillig 	if (typ == FLOAT) {
    685    1.1    rillig 		f = (float)d;
    686   1.84  jmcneill 		if (isfinite(f) == 0) {
    687    1.1    rillig 			/* floating-point constant out of range */
    688    1.1    rillig 			warning(248);
    689    1.1    rillig 			f = f > 0 ? FLT_MAX : -FLT_MAX;
    690    1.1    rillig 		}
    691    1.1    rillig 	}
    692    1.1    rillig 
    693   1.22    rillig 	yylval.y_val = xcalloc(1, sizeof(*yylval.y_val));
    694   1.17    rillig 	yylval.y_val->v_tspec = typ;
    695    1.1    rillig 	if (typ == FLOAT) {
    696    1.1    rillig 		yylval.y_val->v_ldbl = f;
    697    1.1    rillig 	} else {
    698    1.1    rillig 		yylval.y_val->v_ldbl = d;
    699    1.1    rillig 	}
    700    1.1    rillig 
    701    1.1    rillig 	return T_CON;
    702    1.1    rillig }
    703    1.1    rillig 
    704    1.1    rillig int
    705    1.1    rillig lex_operator(int t, op_t o)
    706    1.1    rillig {
    707    1.1    rillig 
    708    1.1    rillig 	yylval.y_op = o;
    709    1.1    rillig 	return t;
    710    1.1    rillig }
    711    1.1    rillig 
    712    1.1    rillig /*
    713    1.1    rillig  * Called if lex found a leading \'.
    714    1.1    rillig  */
    715    1.1    rillig int
    716    1.6    rillig lex_character_constant(void)
    717    1.1    rillig {
    718    1.1    rillig 	size_t	n;
    719    1.1    rillig 	int val, c;
    720    1.1    rillig 
    721    1.1    rillig 	n = 0;
    722    1.1    rillig 	val = 0;
    723    1.6    rillig 	while ((c = get_escaped_char('\'')) >= 0) {
    724    1.1    rillig 		val = (val << CHAR_SIZE) + c;
    725    1.1    rillig 		n++;
    726    1.1    rillig 	}
    727    1.1    rillig 	if (c == -2) {
    728    1.1    rillig 		/* unterminated character constant */
    729    1.1    rillig 		error(253);
    730   1.43    rillig 	} else if (n > sizeof(int) || (n > 1 && (pflag || hflag))) {
    731   1.17    rillig 		/* XXX: should rather be sizeof(TARG_INT) */
    732   1.43    rillig 
    733   1.43    rillig 		/* too many characters in character constant */
    734   1.43    rillig 		error(71);
    735   1.43    rillig 	} else if (n > 1) {
    736   1.43    rillig 		/* multi-character character constant */
    737   1.43    rillig 		warning(294);
    738   1.43    rillig 	} else if (n == 0) {
    739   1.43    rillig 		/* empty character constant */
    740   1.43    rillig 		error(73);
    741    1.1    rillig 	}
    742   1.74    rillig 	if (n == 1)
    743   1.74    rillig 		val = (int)convert_integer(val, CHAR, CHAR_SIZE);
    744    1.1    rillig 
    745   1.22    rillig 	yylval.y_val = xcalloc(1, sizeof(*yylval.y_val));
    746    1.1    rillig 	yylval.y_val->v_tspec = INT;
    747    1.1    rillig 	yylval.y_val->v_quad = val;
    748    1.1    rillig 
    749    1.1    rillig 	return T_CON;
    750    1.1    rillig }
    751    1.1    rillig 
    752    1.1    rillig /*
    753    1.1    rillig  * Called if lex found a leading L\'
    754    1.1    rillig  */
    755    1.1    rillig int
    756    1.6    rillig lex_wide_character_constant(void)
    757    1.1    rillig {
    758    1.1    rillig 	static	char buf[MB_LEN_MAX + 1];
    759   1.44    rillig 	size_t	n, nmax;
    760    1.1    rillig 	int c;
    761    1.1    rillig 	wchar_t	wc;
    762    1.1    rillig 
    763   1.44    rillig 	nmax = MB_CUR_MAX;
    764    1.7    rillig 
    765   1.44    rillig 	n = 0;
    766    1.6    rillig 	while ((c = get_escaped_char('\'')) >= 0) {
    767   1.44    rillig 		if (n < nmax)
    768   1.44    rillig 			buf[n] = (char)c;
    769   1.44    rillig 		n++;
    770    1.1    rillig 	}
    771    1.1    rillig 
    772    1.1    rillig 	wc = 0;
    773    1.1    rillig 
    774    1.1    rillig 	if (c == -2) {
    775    1.1    rillig 		/* unterminated character constant */
    776    1.1    rillig 		error(253);
    777   1.44    rillig 	} else if (n == 0) {
    778    1.1    rillig 		/* empty character constant */
    779    1.1    rillig 		error(73);
    780   1.44    rillig 	} else if (n > nmax) {
    781   1.44    rillig 		n = nmax;
    782   1.43    rillig 		/* too many characters in character constant */
    783   1.43    rillig 		error(71);
    784    1.1    rillig 	} else {
    785   1.44    rillig 		buf[n] = '\0';
    786   1.43    rillig 		(void)mbtowc(NULL, NULL, 0);
    787   1.44    rillig 		if (mbtowc(&wc, buf, nmax) < 0)
    788   1.43    rillig 			/* invalid multibyte character */
    789   1.43    rillig 			error(291);
    790    1.1    rillig 	}
    791    1.1    rillig 
    792   1.22    rillig 	yylval.y_val = xcalloc(1, sizeof(*yylval.y_val));
    793    1.1    rillig 	yylval.y_val->v_tspec = WCHAR;
    794    1.1    rillig 	yylval.y_val->v_quad = wc;
    795    1.1    rillig 
    796    1.1    rillig 	return T_CON;
    797    1.1    rillig }
    798    1.1    rillig 
    799    1.1    rillig /*
    800    1.1    rillig  * Read a character which is part of a character constant or of a string
    801    1.1    rillig  * and handle escapes.
    802    1.1    rillig  *
    803    1.2    rillig  * The argument is the character which delimits the character constant or
    804    1.1    rillig  * string.
    805    1.1    rillig  *
    806    1.1    rillig  * Returns -1 if the end of the character constant or string is reached,
    807    1.1    rillig  * -2 if the EOF is reached, and the character otherwise.
    808    1.1    rillig  */
    809    1.1    rillig static int
    810    1.6    rillig get_escaped_char(int delim)
    811    1.1    rillig {
    812    1.1    rillig 	static	int pbc = -1;
    813    1.1    rillig 	int	n, c, v;
    814    1.1    rillig 
    815    1.1    rillig 	if (pbc == -1) {
    816    1.1    rillig 		c = inpc();
    817    1.1    rillig 	} else {
    818    1.1    rillig 		c = pbc;
    819    1.1    rillig 		pbc = -1;
    820    1.1    rillig 	}
    821    1.2    rillig 	if (c == delim)
    822    1.1    rillig 		return -1;
    823    1.1    rillig 	switch (c) {
    824    1.1    rillig 	case '\n':
    825    1.1    rillig 		if (tflag) {
    826    1.1    rillig 			/* newline in string or char constant */
    827    1.1    rillig 			error(254);
    828    1.1    rillig 			return -2;
    829    1.1    rillig 		}
    830    1.1    rillig 		return c;
    831   1.40    rillig 	case 0:
    832   1.40    rillig 		/* syntax error '%s' */
    833   1.40    rillig 		error(249, "EOF or null byte in literal");
    834   1.40    rillig 		return -2;
    835    1.1    rillig 	case EOF:
    836    1.1    rillig 		return -2;
    837    1.1    rillig 	case '\\':
    838    1.1    rillig 		switch (c = inpc()) {
    839    1.1    rillig 		case '"':
    840    1.2    rillig 			if (tflag && delim == '\'')
    841    1.1    rillig 				/* \" inside character constants undef... */
    842    1.1    rillig 				warning(262);
    843    1.1    rillig 			return '"';
    844    1.1    rillig 		case '\'':
    845    1.1    rillig 			return '\'';
    846    1.1    rillig 		case '?':
    847    1.1    rillig 			if (tflag)
    848    1.1    rillig 				/* \? undefined in traditional C */
    849    1.1    rillig 				warning(263);
    850    1.1    rillig 			return '?';
    851    1.1    rillig 		case '\\':
    852    1.1    rillig 			return '\\';
    853    1.1    rillig 		case 'a':
    854    1.1    rillig 			if (tflag)
    855    1.1    rillig 				/* \a undefined in traditional C */
    856    1.1    rillig 				warning(81);
    857    1.1    rillig 			return '\a';
    858    1.1    rillig 		case 'b':
    859    1.1    rillig 			return '\b';
    860    1.1    rillig 		case 'f':
    861    1.1    rillig 			return '\f';
    862    1.1    rillig 		case 'n':
    863    1.1    rillig 			return '\n';
    864    1.1    rillig 		case 'r':
    865    1.1    rillig 			return '\r';
    866    1.1    rillig 		case 't':
    867    1.1    rillig 			return '\t';
    868    1.1    rillig 		case 'v':
    869    1.1    rillig 			if (tflag)
    870    1.1    rillig 				/* \v undefined in traditional C */
    871    1.1    rillig 				warning(264);
    872    1.1    rillig 			return '\v';
    873    1.1    rillig 		case '8': case '9':
    874    1.1    rillig 			/* bad octal digit %c */
    875    1.1    rillig 			warning(77, c);
    876    1.1    rillig 			/* FALLTHROUGH */
    877    1.1    rillig 		case '0': case '1': case '2': case '3':
    878    1.1    rillig 		case '4': case '5': case '6': case '7':
    879    1.1    rillig 			n = 3;
    880    1.1    rillig 			v = 0;
    881    1.1    rillig 			do {
    882    1.1    rillig 				v = (v << 3) + (c - '0');
    883    1.1    rillig 				c = inpc();
    884   1.47    rillig 			} while (--n > 0 && '0' <= c && c <= '7');
    885    1.1    rillig 			pbc = c;
    886    1.1    rillig 			if (v > TARG_UCHAR_MAX) {
    887    1.1    rillig 				/* character escape does not fit in character */
    888    1.1    rillig 				warning(76);
    889    1.1    rillig 				v &= CHAR_MASK;
    890    1.1    rillig 			}
    891    1.1    rillig 			return v;
    892    1.1    rillig 		case 'x':
    893    1.1    rillig 			if (tflag)
    894    1.1    rillig 				/* \x undefined in traditional C */
    895    1.1    rillig 				warning(82);
    896    1.1    rillig 			v = 0;
    897    1.1    rillig 			n = 0;
    898   1.95    rillig 			while (c = inpc(), isxdigit(c)) {
    899    1.1    rillig 				c = isdigit(c) ?
    900    1.1    rillig 				    c - '0' : toupper(c) - 'A' + 10;
    901    1.1    rillig 				v = (v << 4) + c;
    902    1.1    rillig 				if (n >= 0) {
    903    1.1    rillig 					if ((v & ~CHAR_MASK) != 0) {
    904    1.1    rillig 						/* overflow in hex escape */
    905    1.1    rillig 						warning(75);
    906    1.1    rillig 						n = -1;
    907    1.1    rillig 					} else {
    908    1.1    rillig 						n++;
    909    1.1    rillig 					}
    910    1.1    rillig 				}
    911    1.1    rillig 			}
    912    1.1    rillig 			pbc = c;
    913    1.1    rillig 			if (n == 0) {
    914    1.1    rillig 				/* no hex digits follow \x */
    915    1.1    rillig 				error(74);
    916    1.1    rillig 			} if (n == -1) {
    917    1.1    rillig 				v &= CHAR_MASK;
    918    1.1    rillig 			}
    919    1.1    rillig 			return v;
    920    1.1    rillig 		case '\n':
    921    1.6    rillig 			return get_escaped_char(delim);
    922    1.1    rillig 		case EOF:
    923    1.1    rillig 			return -2;
    924    1.1    rillig 		default:
    925    1.1    rillig 			if (isprint(c)) {
    926    1.1    rillig 				/* dubious escape \%c */
    927    1.1    rillig 				warning(79, c);
    928    1.1    rillig 			} else {
    929    1.1    rillig 				/* dubious escape \%o */
    930    1.1    rillig 				warning(80, c);
    931    1.1    rillig 			}
    932    1.1    rillig 		}
    933    1.1    rillig 	}
    934    1.1    rillig 	return c;
    935    1.1    rillig }
    936    1.1    rillig 
    937    1.1    rillig /* See https://gcc.gnu.org/onlinedocs/cpp/Preprocessor-Output.html */
    938    1.1    rillig static void
    939   1.25    rillig parse_line_directive_flags(const char *p,
    940   1.25    rillig 			   bool *is_begin, bool *is_end, bool *is_system)
    941    1.1    rillig {
    942    1.1    rillig 
    943   1.25    rillig 	*is_begin = false;
    944   1.25    rillig 	*is_end = false;
    945   1.25    rillig 	*is_system = false;
    946    1.1    rillig 
    947    1.8    rillig 	while (*p != '\0') {
    948   1.85    rillig 		const char *word_start, *word_end;
    949   1.85    rillig 
    950    1.1    rillig 		while (ch_isspace(*p))
    951    1.1    rillig 			p++;
    952    1.8    rillig 
    953   1.85    rillig 		word_start = p;
    954    1.8    rillig 		while (*p != '\0' && !ch_isspace(*p))
    955    1.8    rillig 			p++;
    956   1.85    rillig 		word_end = p;
    957    1.8    rillig 
    958   1.25    rillig 		if (word_end - word_start == 1 && word_start[0] == '1')
    959   1.25    rillig 			*is_begin = true;
    960   1.25    rillig 		if (word_end - word_start == 1 && word_start[0] == '2')
    961   1.25    rillig 			*is_end = true;
    962    1.8    rillig 		if (word_end - word_start == 1 && word_start[0] == '3')
    963   1.25    rillig 			*is_system = true;
    964   1.94    rillig 		/* Flag '4' is only interesting for C++. */
    965    1.1    rillig 	}
    966    1.1    rillig }
    967    1.1    rillig 
    968    1.1    rillig /*
    969    1.1    rillig  * Called for preprocessor directives. Currently implemented are:
    970   1.94    rillig  *	# pragma [argument...]
    971    1.1    rillig  *	# lineno
    972    1.1    rillig  *	# lineno "filename"
    973    1.2    rillig  *	# lineno "filename" GCC-flag...
    974    1.1    rillig  */
    975    1.1    rillig void
    976    1.1    rillig lex_directive(const char *yytext)
    977    1.1    rillig {
    978    1.1    rillig 	const	char *cp, *fn;
    979    1.1    rillig 	char	c, *eptr;
    980    1.1    rillig 	size_t	fnl;
    981    1.1    rillig 	long	ln;
    982   1.25    rillig 	bool	is_begin, is_end, is_system;
    983   1.25    rillig 
    984    1.1    rillig 	static	bool first = true;
    985    1.1    rillig 
    986    1.1    rillig 	/* Go to first non-whitespace after # */
    987    1.1    rillig 	for (cp = yytext + 1; (c = *cp) == ' ' || c == '\t'; cp++)
    988    1.1    rillig 		continue;
    989    1.1    rillig 
    990    1.1    rillig 	if (!ch_isdigit(c)) {
    991    1.1    rillig 		if (strncmp(cp, "pragma", 6) == 0 && ch_isspace(cp[6]))
    992    1.1    rillig 			return;
    993    1.1    rillig 	error:
    994    1.1    rillig 		/* undefined or invalid # directive */
    995    1.1    rillig 		warning(255);
    996    1.1    rillig 		return;
    997    1.1    rillig 	}
    998    1.1    rillig 	ln = strtol(--cp, &eptr, 10);
    999   1.94    rillig 	if (eptr == cp)
   1000    1.1    rillig 		goto error;
   1001    1.1    rillig 	if ((c = *(cp = eptr)) != ' ' && c != '\t' && c != '\0')
   1002    1.1    rillig 		goto error;
   1003    1.1    rillig 	while ((c = *cp++) == ' ' || c == '\t')
   1004    1.1    rillig 		continue;
   1005    1.1    rillig 	if (c != '\0') {
   1006    1.1    rillig 		if (c != '"')
   1007    1.1    rillig 			goto error;
   1008    1.1    rillig 		fn = cp;
   1009    1.1    rillig 		while ((c = *cp) != '"' && c != '\0')
   1010    1.1    rillig 			cp++;
   1011    1.1    rillig 		if (c != '"')
   1012    1.1    rillig 			goto error;
   1013    1.1    rillig 		if ((fnl = cp++ - fn) > PATH_MAX)
   1014    1.1    rillig 			goto error;
   1015    1.1    rillig 		/* empty string means stdin */
   1016    1.1    rillig 		if (fnl == 0) {
   1017    1.1    rillig 			fn = "{standard input}";
   1018    1.1    rillig 			fnl = 16;			/* strlen (fn) */
   1019    1.1    rillig 		}
   1020   1.19    rillig 		curr_pos.p_file = record_filename(fn, fnl);
   1021    1.1    rillig 		/*
   1022    1.1    rillig 		 * If this is the first directive, the name is the name
   1023    1.1    rillig 		 * of the C source file as specified at the command line.
   1024    1.1    rillig 		 * It is written to the output file.
   1025    1.1    rillig 		 */
   1026    1.1    rillig 		if (first) {
   1027    1.1    rillig 			csrc_pos.p_file = curr_pos.p_file;
   1028   1.19    rillig 			outsrc(transform_filename(curr_pos.p_file,
   1029    1.1    rillig 			    strlen(curr_pos.p_file)));
   1030    1.1    rillig 			first = false;
   1031    1.1    rillig 		}
   1032   1.25    rillig 
   1033   1.25    rillig 		parse_line_directive_flags(cp, &is_begin, &is_end, &is_system);
   1034   1.26    rillig 		update_location(curr_pos.p_file, (int)ln, is_begin, is_end);
   1035   1.26    rillig 		in_system_header = is_system;
   1036    1.1    rillig 	}
   1037    1.1    rillig 	curr_pos.p_line = (int)ln - 1;
   1038    1.1    rillig 	curr_pos.p_uniq = 0;
   1039    1.1    rillig 	if (curr_pos.p_file == csrc_pos.p_file) {
   1040    1.1    rillig 		csrc_pos.p_line = (int)ln - 1;
   1041    1.1    rillig 		csrc_pos.p_uniq = 0;
   1042    1.1    rillig 	}
   1043    1.1    rillig }
   1044    1.1    rillig 
   1045    1.1    rillig /*
   1046    1.2    rillig  * Handle lint comments such as ARGSUSED.
   1047    1.2    rillig  *
   1048    1.1    rillig  * If one of these comments is recognized, the argument, if any, is
   1049    1.1    rillig  * parsed and a function which handles this comment is called.
   1050    1.1    rillig  */
   1051    1.1    rillig void
   1052    1.1    rillig lex_comment(void)
   1053    1.1    rillig {
   1054    1.1    rillig 	int	c, lc;
   1055    1.1    rillig 	static const struct {
   1056    1.1    rillig 		const	char *keywd;
   1057    1.3    rillig 		bool	arg;
   1058    1.1    rillig 		void	(*func)(int);
   1059    1.1    rillig 	} keywtab[] = {
   1060    1.3    rillig 		{ "ARGSUSED",		true,	argsused	},
   1061    1.3    rillig 		{ "BITFIELDTYPE",	false,	bitfieldtype	},
   1062    1.3    rillig 		{ "CONSTCOND",		false,	constcond	},
   1063    1.3    rillig 		{ "CONSTANTCOND",	false,	constcond	},
   1064    1.3    rillig 		{ "CONSTANTCONDITION",	false,	constcond	},
   1065    1.3    rillig 		{ "FALLTHRU",		false,	fallthru	},
   1066    1.3    rillig 		{ "FALLTHROUGH",	false,	fallthru	},
   1067   1.79    rillig 		{ "FALL THROUGH",	false,	fallthru	},
   1068   1.80    rillig 		{ "fallthrough",	false,	fallthru	},
   1069    1.3    rillig 		{ "LINTLIBRARY",	false,	lintlib		},
   1070    1.3    rillig 		{ "LINTED",		true,	linted		},
   1071    1.3    rillig 		{ "LONGLONG",		false,	longlong	},
   1072    1.3    rillig 		{ "NOSTRICT",		true,	linted		},
   1073   1.15    rillig 		{ "NOTREACHED",		false,	not_reached	},
   1074    1.3    rillig 		{ "PRINTFLIKE",		true,	printflike	},
   1075    1.3    rillig 		{ "PROTOLIB",		true,	protolib	},
   1076    1.3    rillig 		{ "SCANFLIKE",		true,	scanflike	},
   1077    1.3    rillig 		{ "VARARGS",		true,	varargs		},
   1078    1.1    rillig 	};
   1079    1.1    rillig 	char	keywd[32];
   1080    1.1    rillig 	char	arg[32];
   1081    1.1    rillig 	size_t	l, i;
   1082    1.1    rillig 	int	a;
   1083    1.1    rillig 	bool	eoc;
   1084    1.1    rillig 
   1085    1.1    rillig 	eoc = false;
   1086    1.1    rillig 
   1087    1.1    rillig 	/* Skip whitespace after the start of the comment */
   1088   1.95    rillig 	while (c = inpc(), isspace(c))
   1089    1.1    rillig 		continue;
   1090    1.1    rillig 
   1091    1.1    rillig 	/* Read the potential keyword to keywd */
   1092    1.1    rillig 	l = 0;
   1093   1.79    rillig 	while (c != EOF && l < sizeof(keywd) - 1 &&
   1094   1.80    rillig 	    (isalpha(c) || isspace(c))) {
   1095   1.80    rillig 		if (islower(c) && l > 0 && ch_isupper(keywd[0]))
   1096   1.80    rillig 			break;
   1097    1.1    rillig 		keywd[l++] = (char)c;
   1098    1.1    rillig 		c = inpc();
   1099    1.1    rillig 	}
   1100   1.79    rillig 	while (l > 0 && ch_isspace(keywd[l - 1]))
   1101   1.79    rillig 		l--;
   1102    1.1    rillig 	keywd[l] = '\0';
   1103    1.1    rillig 
   1104    1.1    rillig 	/* look for the keyword */
   1105   1.22    rillig 	for (i = 0; i < sizeof(keywtab) / sizeof(keywtab[0]); i++) {
   1106    1.1    rillig 		if (strcmp(keywtab[i].keywd, keywd) == 0)
   1107    1.1    rillig 			break;
   1108    1.1    rillig 	}
   1109   1.22    rillig 	if (i == sizeof(keywtab) / sizeof(keywtab[0]))
   1110    1.1    rillig 		goto skip_rest;
   1111    1.1    rillig 
   1112    1.1    rillig 	/* skip whitespace after the keyword */
   1113   1.94    rillig 	while (isspace(c))
   1114    1.1    rillig 		c = inpc();
   1115    1.1    rillig 
   1116    1.1    rillig 	/* read the argument, if the keyword accepts one and there is one */
   1117    1.1    rillig 	l = 0;
   1118    1.1    rillig 	if (keywtab[i].arg) {
   1119   1.94    rillig 		while (isdigit(c) && l < sizeof(arg) - 1) {
   1120    1.1    rillig 			arg[l++] = (char)c;
   1121    1.1    rillig 			c = inpc();
   1122    1.1    rillig 		}
   1123    1.1    rillig 	}
   1124    1.1    rillig 	arg[l] = '\0';
   1125    1.1    rillig 	a = l != 0 ? atoi(arg) : -1;
   1126    1.1    rillig 
   1127    1.1    rillig 	/* skip whitespace after the argument */
   1128   1.94    rillig 	while (isspace(c))
   1129    1.1    rillig 		c = inpc();
   1130    1.1    rillig 
   1131    1.1    rillig 	if (c != '*' || (c = inpc()) != '/') {
   1132    1.1    rillig 		if (keywtab[i].func != linted)
   1133    1.1    rillig 			/* extra characters in lint comment */
   1134    1.1    rillig 			warning(257);
   1135    1.1    rillig 	} else {
   1136    1.1    rillig 		/*
   1137    1.1    rillig 		 * remember that we have already found the end of the
   1138    1.1    rillig 		 * comment
   1139    1.1    rillig 		 */
   1140    1.1    rillig 		eoc = true;
   1141    1.1    rillig 	}
   1142    1.1    rillig 
   1143    1.1    rillig 	if (keywtab[i].func != NULL)
   1144    1.1    rillig 		(*keywtab[i].func)(a);
   1145    1.1    rillig 
   1146    1.1    rillig skip_rest:
   1147    1.1    rillig 	while (!eoc) {
   1148    1.1    rillig 		lc = c;
   1149    1.1    rillig 		if ((c = inpc()) == EOF) {
   1150    1.1    rillig 			/* unterminated comment */
   1151    1.1    rillig 			error(256);
   1152    1.1    rillig 			break;
   1153    1.1    rillig 		}
   1154    1.1    rillig 		if (lc == '*' && c == '/')
   1155    1.1    rillig 			eoc = true;
   1156    1.1    rillig 	}
   1157    1.1    rillig }
   1158    1.1    rillig 
   1159    1.1    rillig /*
   1160    1.1    rillig  * Handle // style comments
   1161    1.1    rillig  */
   1162    1.1    rillig void
   1163    1.6    rillig lex_slash_slash_comment(void)
   1164    1.1    rillig {
   1165    1.1    rillig 	int c;
   1166    1.1    rillig 
   1167    1.1    rillig 	if (!Sflag && !gflag)
   1168   1.91    rillig 		/* %s does not support // comments */
   1169   1.91    rillig 		gnuism(312, tflag ? "traditional C" : "C90");
   1170    1.1    rillig 
   1171    1.1    rillig 	while ((c = inpc()) != EOF && c != '\n')
   1172    1.1    rillig 		continue;
   1173    1.1    rillig }
   1174    1.1    rillig 
   1175    1.1    rillig /*
   1176    1.1    rillig  * Clear flags for lint comments LINTED, LONGLONG and CONSTCOND.
   1177   1.94    rillig  * clear_warn_flags is called after function definitions and global and
   1178    1.1    rillig  * local declarations and definitions. It is also called between
   1179    1.1    rillig  * the controlling expression and the body of control statements
   1180    1.1    rillig  * (if, switch, for, while).
   1181    1.1    rillig  */
   1182    1.1    rillig void
   1183    1.1    rillig clear_warn_flags(void)
   1184    1.1    rillig {
   1185    1.1    rillig 
   1186    1.1    rillig 	lwarn = LWARN_ALL;
   1187    1.1    rillig 	quadflg = false;
   1188    1.1    rillig 	constcond_flag = false;
   1189    1.1    rillig }
   1190    1.1    rillig 
   1191    1.1    rillig /*
   1192    1.1    rillig  * Strings are stored in a dynamically allocated buffer and passed
   1193   1.94    rillig  * in yylval.y_string to the parser. The parser or the routines called
   1194    1.1    rillig  * by the parser are responsible for freeing this buffer.
   1195    1.1    rillig  */
   1196    1.1    rillig int
   1197    1.1    rillig lex_string(void)
   1198    1.1    rillig {
   1199   1.71    rillig 	unsigned char *s;
   1200    1.1    rillig 	int	c;
   1201    1.1    rillig 	size_t	len, max;
   1202    1.1    rillig 	strg_t	*strg;
   1203    1.1    rillig 
   1204    1.1    rillig 	s = xmalloc(max = 64);
   1205    1.1    rillig 
   1206    1.1    rillig 	len = 0;
   1207   1.39    rillig 	while ((c = get_escaped_char('"')) >= 0) {
   1208    1.1    rillig 		/* +1 to reserve space for a trailing NUL character */
   1209    1.1    rillig 		if (len + 1 == max)
   1210    1.1    rillig 			s = xrealloc(s, max *= 2);
   1211    1.1    rillig 		s[len++] = (char)c;
   1212    1.1    rillig 	}
   1213    1.1    rillig 	s[len] = '\0';
   1214    1.1    rillig 	if (c == -2)
   1215    1.1    rillig 		/* unterminated string constant */
   1216    1.1    rillig 		error(258);
   1217    1.1    rillig 
   1218   1.22    rillig 	strg = xcalloc(1, sizeof(*strg));
   1219  1.103    rillig 	strg->st_char = true;
   1220    1.1    rillig 	strg->st_len = len;
   1221  1.103    rillig 	strg->st_mem = s;
   1222    1.1    rillig 
   1223    1.1    rillig 	yylval.y_string = strg;
   1224    1.1    rillig 	return T_STRING;
   1225    1.1    rillig }
   1226    1.1    rillig 
   1227    1.1    rillig int
   1228    1.6    rillig lex_wide_string(void)
   1229    1.1    rillig {
   1230    1.1    rillig 	char	*s;
   1231    1.1    rillig 	int	c, n;
   1232    1.1    rillig 	size_t	i, wi;
   1233    1.1    rillig 	size_t	len, max, wlen;
   1234    1.1    rillig 	wchar_t	*ws;
   1235    1.1    rillig 	strg_t	*strg;
   1236    1.1    rillig 
   1237    1.1    rillig 	s = xmalloc(max = 64);
   1238    1.1    rillig 	len = 0;
   1239    1.6    rillig 	while ((c = get_escaped_char('"')) >= 0) {
   1240    1.1    rillig 		/* +1 to save space for a trailing NUL character */
   1241    1.1    rillig 		if (len + 1 >= max)
   1242    1.1    rillig 			s = xrealloc(s, max *= 2);
   1243    1.1    rillig 		s[len++] = (char)c;
   1244    1.1    rillig 	}
   1245    1.1    rillig 	s[len] = '\0';
   1246    1.1    rillig 	if (c == -2)
   1247    1.1    rillig 		/* unterminated string constant */
   1248    1.1    rillig 		error(258);
   1249    1.1    rillig 
   1250    1.1    rillig 	/* get length of wide-character string */
   1251    1.1    rillig 	(void)mblen(NULL, 0);
   1252    1.1    rillig 	for (i = 0, wlen = 0; i < len; i += n, wlen++) {
   1253    1.1    rillig 		if ((n = mblen(&s[i], MB_CUR_MAX)) == -1) {
   1254    1.1    rillig 			/* invalid multibyte character */
   1255    1.1    rillig 			error(291);
   1256    1.1    rillig 			break;
   1257    1.1    rillig 		}
   1258    1.1    rillig 		if (n == 0)
   1259    1.1    rillig 			n = 1;
   1260    1.1    rillig 	}
   1261    1.1    rillig 
   1262   1.22    rillig 	ws = xmalloc((wlen + 1) * sizeof(*ws));
   1263    1.1    rillig 
   1264    1.1    rillig 	/* convert from multibyte to wide char */
   1265    1.1    rillig 	(void)mbtowc(NULL, NULL, 0);
   1266    1.1    rillig 	for (i = 0, wi = 0; i < len; i += n, wi++) {
   1267    1.1    rillig 		if ((n = mbtowc(&ws[wi], &s[i], MB_CUR_MAX)) == -1)
   1268    1.1    rillig 			break;
   1269    1.1    rillig 		if (n == 0)
   1270    1.1    rillig 			n = 1;
   1271    1.1    rillig 	}
   1272    1.1    rillig 	ws[wi] = 0;
   1273    1.1    rillig 	free(s);
   1274    1.1    rillig 
   1275   1.22    rillig 	strg = xcalloc(1, sizeof(*strg));
   1276  1.103    rillig 	strg->st_char = false;
   1277    1.1    rillig 	strg->st_len = wlen;
   1278  1.103    rillig 	strg->st_mem = ws;
   1279    1.1    rillig 
   1280    1.1    rillig 	yylval.y_string = strg;
   1281    1.1    rillig 	return T_STRING;
   1282    1.1    rillig }
   1283    1.1    rillig 
   1284  1.105    rillig void
   1285  1.105    rillig lex_next_line(void)
   1286  1.105    rillig {
   1287  1.105    rillig 	curr_pos.p_line++;
   1288  1.105    rillig 	curr_pos.p_uniq = 0;
   1289  1.105    rillig 	debug_step("parsing %s:%d", curr_pos.p_file, curr_pos.p_line);
   1290  1.105    rillig 	if (curr_pos.p_file == csrc_pos.p_file) {
   1291  1.105    rillig 		csrc_pos.p_line++;
   1292  1.105    rillig 		csrc_pos.p_uniq = 0;
   1293  1.105    rillig 	}
   1294  1.105    rillig }
   1295  1.105    rillig 
   1296  1.105    rillig void
   1297  1.105    rillig lex_unknown_character(int c)
   1298  1.105    rillig {
   1299  1.105    rillig 
   1300  1.105    rillig 	/* unknown character \%o */
   1301  1.105    rillig 	error(250, c);
   1302  1.105    rillig }
   1303  1.105    rillig 
   1304   1.98    rillig #ifdef DEBUG
   1305   1.98    rillig static const char *
   1306   1.98    rillig symt_name(symt_t kind)
   1307   1.98    rillig {
   1308   1.98    rillig 	static const char *name[] = {
   1309   1.98    rillig 		"var-func-type",
   1310   1.98    rillig 		"member",
   1311   1.98    rillig 		"tag",
   1312   1.98    rillig 		"label",
   1313   1.98    rillig 	};
   1314   1.98    rillig 	return name[kind];
   1315   1.98    rillig }
   1316   1.98    rillig #endif
   1317   1.98    rillig 
   1318    1.1    rillig /*
   1319   1.60    rillig  * As noted above, the scanner does not create new symbol table entries
   1320    1.1    rillig  * for symbols it cannot find in the symbol table. This is to avoid
   1321    1.1    rillig  * putting undeclared symbols into the symbol table if a syntax error
   1322    1.1    rillig  * occurs.
   1323    1.1    rillig  *
   1324   1.60    rillig  * getsym() is called as soon as it is probably ok to put the symbol in the
   1325   1.53    rillig  * symbol table. It is still possible that symbols are put in the symbol
   1326   1.53    rillig  * table that are not completely declared due to syntax errors. To avoid too
   1327   1.60    rillig  * many problems in this case, symbols get type 'int' in getsym().
   1328    1.1    rillig  *
   1329    1.2    rillig  * XXX calls to getsym() should be delayed until decl1*() is called.
   1330    1.1    rillig  */
   1331    1.1    rillig sym_t *
   1332    1.1    rillig getsym(sbuf_t *sb)
   1333    1.1    rillig {
   1334    1.1    rillig 	dinfo_t	*di;
   1335    1.1    rillig 	char	*s;
   1336    1.1    rillig 	sym_t	*sym;
   1337    1.1    rillig 
   1338    1.1    rillig 	sym = sb->sb_sym;
   1339    1.1    rillig 
   1340    1.1    rillig 	/*
   1341    1.1    rillig 	 * During member declaration it is possible that name() looked
   1342    1.1    rillig 	 * for symbols of type FVFT, although it should have looked for
   1343    1.1    rillig 	 * symbols of type FTAG. Same can happen for labels. Both cases
   1344    1.1    rillig 	 * are compensated here.
   1345    1.1    rillig 	 */
   1346    1.1    rillig 	if (symtyp == FMEMBER || symtyp == FLABEL) {
   1347    1.1    rillig 		if (sym == NULL || sym->s_kind == FVFT)
   1348  1.104    rillig 			sym = symtab_search(sb);
   1349    1.1    rillig 	}
   1350    1.1    rillig 
   1351    1.1    rillig 	if (sym != NULL) {
   1352   1.98    rillig 		lint_assert(sym->s_kind == symtyp);
   1353    1.1    rillig 		symtyp = FVFT;
   1354  1.100    rillig 		free(sb);
   1355    1.1    rillig 		return sym;
   1356    1.1    rillig 	}
   1357    1.1    rillig 
   1358    1.1    rillig 	/* create a new symbol table entry */
   1359    1.1    rillig 
   1360    1.1    rillig 	/* labels must always be allocated at level 1 (outermost block) */
   1361    1.1    rillig 	if (symtyp == FLABEL) {
   1362  1.101    rillig 		sym = level_zero_alloc(1, sizeof(*sym));
   1363  1.101    rillig 		s = level_zero_alloc(1, sb->sb_len + 1);
   1364    1.1    rillig 		(void)memcpy(s, sb->sb_name, sb->sb_len + 1);
   1365    1.1    rillig 		sym->s_name = s;
   1366   1.12    rillig 		sym->s_block_level = 1;
   1367    1.1    rillig 		di = dcs;
   1368    1.1    rillig 		while (di->d_next != NULL && di->d_next->d_next != NULL)
   1369    1.1    rillig 			di = di->d_next;
   1370    1.1    rillig 		lint_assert(di->d_ctx == AUTO);
   1371    1.1    rillig 	} else {
   1372  1.101    rillig 		sym = block_zero_alloc(sizeof(*sym));
   1373    1.1    rillig 		sym->s_name = sb->sb_name;
   1374   1.12    rillig 		sym->s_block_level = block_level;
   1375    1.1    rillig 		di = dcs;
   1376    1.1    rillig 	}
   1377    1.1    rillig 
   1378    1.1    rillig 	UNIQUE_CURR_POS(sym->s_def_pos);
   1379    1.1    rillig 	if ((sym->s_kind = symtyp) != FLABEL)
   1380    1.1    rillig 		sym->s_type = gettyp(INT);
   1381    1.1    rillig 
   1382    1.1    rillig 	symtyp = FVFT;
   1383    1.1    rillig 
   1384   1.62    rillig 	symtab_add(sym);
   1385    1.1    rillig 
   1386    1.1    rillig 	*di->d_ldlsym = sym;
   1387  1.102    rillig 	di->d_ldlsym = &sym->s_level_next;
   1388    1.1    rillig 
   1389  1.100    rillig 	free(sb);
   1390    1.1    rillig 	return sym;
   1391    1.1    rillig }
   1392    1.1    rillig 
   1393    1.1    rillig /*
   1394   1.53    rillig  * Construct a temporary symbol. The symbol name starts with a digit, making
   1395   1.53    rillig  * the name illegal.
   1396    1.1    rillig  */
   1397    1.1    rillig sym_t *
   1398    1.1    rillig mktempsym(type_t *t)
   1399    1.1    rillig {
   1400    1.1    rillig 	static int n = 0;
   1401  1.101    rillig 	char *s = level_zero_alloc(block_level, 64);
   1402  1.101    rillig 	sym_t *sym = block_zero_alloc(sizeof(*sym));
   1403   1.28    rillig 	scl_t scl;
   1404    1.1    rillig 
   1405    1.1    rillig 	(void)snprintf(s, 64, "%.8d_tmp", n++);
   1406    1.1    rillig 
   1407   1.28    rillig 	scl = dcs->d_scl;
   1408   1.28    rillig 	if (scl == NOSCL)
   1409   1.28    rillig 		scl = block_level > 0 ? AUTO : EXTERN;
   1410   1.28    rillig 
   1411    1.1    rillig 	sym->s_name = s;
   1412    1.1    rillig 	sym->s_type = t;
   1413   1.12    rillig 	sym->s_block_level = block_level;
   1414   1.28    rillig 	sym->s_scl = scl;
   1415    1.1    rillig 	sym->s_kind = FVFT;
   1416    1.1    rillig 	sym->s_used = true;
   1417    1.1    rillig 	sym->s_set = true;
   1418    1.1    rillig 
   1419   1.60    rillig 	symtab_add(sym);
   1420    1.1    rillig 
   1421    1.1    rillig 	*dcs->d_ldlsym = sym;
   1422  1.102    rillig 	dcs->d_ldlsym = &sym->s_level_next;
   1423    1.1    rillig 
   1424    1.1    rillig 	return sym;
   1425    1.1    rillig }
   1426    1.1    rillig 
   1427   1.61    rillig /* Remove a symbol forever from the symbol table. */
   1428    1.1    rillig void
   1429    1.1    rillig rmsym(sym_t *sym)
   1430    1.1    rillig {
   1431    1.1    rillig 
   1432   1.98    rillig 	debug_step("rmsym '%s' %s '%s'",
   1433   1.98    rillig 	    sym->s_name, symt_name(sym->s_kind), type_name(sym->s_type));
   1434   1.61    rillig 	symtab_remove(sym);
   1435   1.61    rillig 
   1436   1.61    rillig 	/* avoid that the symbol will later be put back to the symbol table */
   1437   1.12    rillig 	sym->s_block_level = -1;
   1438    1.1    rillig }
   1439    1.1    rillig 
   1440    1.1    rillig /*
   1441    1.1    rillig  * Remove a list of symbols declared at one level from the symbol
   1442    1.1    rillig  * table.
   1443    1.1    rillig  */
   1444    1.1    rillig void
   1445    1.1    rillig rmsyms(sym_t *syms)
   1446    1.1    rillig {
   1447    1.1    rillig 	sym_t	*sym;
   1448    1.1    rillig 
   1449  1.102    rillig 	for (sym = syms; sym != NULL; sym = sym->s_level_next) {
   1450   1.12    rillig 		if (sym->s_block_level != -1) {
   1451   1.98    rillig 			debug_step("rmsyms '%s' %s '%s'",
   1452   1.98    rillig 			    sym->s_name, symt_name(sym->s_kind),
   1453   1.59    rillig 			    type_name(sym->s_type));
   1454   1.61    rillig 			symtab_remove(sym);
   1455  1.102    rillig 			sym->s_symtab_ref = NULL;
   1456    1.1    rillig 		}
   1457    1.1    rillig 	}
   1458    1.1    rillig }
   1459    1.1    rillig 
   1460    1.1    rillig /*
   1461    1.2    rillig  * Put a symbol into the symbol table.
   1462    1.1    rillig  */
   1463    1.1    rillig void
   1464    1.1    rillig inssym(int bl, sym_t *sym)
   1465    1.1    rillig {
   1466    1.1    rillig 
   1467   1.98    rillig 	debug_step("inssym '%s' %s '%s'",
   1468   1.98    rillig 	    sym->s_name, symt_name(sym->s_kind), type_name(sym->s_type));
   1469   1.60    rillig 	symtab_add(sym);
   1470   1.12    rillig 	sym->s_block_level = bl;
   1471  1.102    rillig 	lint_assert(sym->s_symtab_next == NULL ||
   1472  1.102    rillig 		    sym->s_block_level >= sym->s_symtab_next->s_block_level);
   1473    1.1    rillig }
   1474    1.1    rillig 
   1475    1.1    rillig /*
   1476    1.2    rillig  * Called at level 0 after syntax errors.
   1477    1.2    rillig  *
   1478    1.1    rillig  * Removes all symbols which are not declared at level 0 from the
   1479    1.1    rillig  * symbol table. Also frees all memory which is not associated with
   1480    1.1    rillig  * level 0.
   1481    1.1    rillig  */
   1482    1.1    rillig void
   1483    1.1    rillig cleanup(void)
   1484    1.1    rillig {
   1485    1.1    rillig 
   1486  1.104    rillig 	symtab_remove_locals();
   1487    1.1    rillig 
   1488  1.104    rillig 	for (size_t i = mem_block_level; i > 0; i--)
   1489  1.101    rillig 		level_free_all(i);
   1490    1.1    rillig }
   1491    1.1    rillig 
   1492    1.1    rillig /*
   1493    1.1    rillig  * Create a new symbol with the name of an existing symbol.
   1494    1.1    rillig  */
   1495    1.1    rillig sym_t *
   1496   1.21    rillig pushdown(const sym_t *sym)
   1497    1.1    rillig {
   1498    1.1    rillig 	sym_t	*nsym;
   1499    1.1    rillig 
   1500   1.98    rillig 	debug_step("pushdown '%s' %s '%s'",
   1501   1.98    rillig 	    sym->s_name, symt_name(sym->s_kind), type_name(sym->s_type));
   1502  1.101    rillig 	nsym = block_zero_alloc(sizeof(*nsym));
   1503   1.12    rillig 	lint_assert(sym->s_block_level <= block_level);
   1504    1.1    rillig 	nsym->s_name = sym->s_name;
   1505    1.1    rillig 	UNIQUE_CURR_POS(nsym->s_def_pos);
   1506    1.1    rillig 	nsym->s_kind = sym->s_kind;
   1507   1.12    rillig 	nsym->s_block_level = block_level;
   1508    1.1    rillig 
   1509   1.60    rillig 	symtab_add(nsym);
   1510    1.1    rillig 
   1511    1.1    rillig 	*dcs->d_ldlsym = nsym;
   1512  1.102    rillig 	dcs->d_ldlsym = &nsym->s_level_next;
   1513    1.1    rillig 
   1514    1.1    rillig 	return nsym;
   1515    1.1    rillig }
   1516    1.1    rillig 
   1517    1.1    rillig /*
   1518    1.1    rillig  * Free any dynamically allocated memory referenced by
   1519    1.1    rillig  * the value stack or yylval.
   1520    1.1    rillig  * The type of information in yylval is described by tok.
   1521    1.1    rillig  */
   1522    1.1    rillig void
   1523    1.1    rillig freeyyv(void *sp, int tok)
   1524    1.1    rillig {
   1525    1.1    rillig 	if (tok == T_NAME || tok == T_TYPENAME) {
   1526    1.1    rillig 		sbuf_t *sb = *(sbuf_t **)sp;
   1527  1.100    rillig 		free(sb);
   1528    1.1    rillig 	} else if (tok == T_CON) {
   1529    1.1    rillig 		val_t *val = *(val_t **)sp;
   1530    1.1    rillig 		free(val);
   1531    1.1    rillig 	} else if (tok == T_STRING) {
   1532    1.1    rillig 		strg_t *strg = *(strg_t **)sp;
   1533  1.103    rillig 		free(strg->st_mem);
   1534    1.1    rillig 		free(strg);
   1535    1.1    rillig 	}
   1536    1.1    rillig }
   1537