/* YACC parser for C expressions, for GDB.
|
/* YACC parser for C expressions, for GDB.
|
Copyright (C) 1986, 1989, 1990, 1991, 1993, 1994, 1996, 1997
|
Copyright (C) 1986, 1989, 1990, 1991, 1993, 1994, 1996, 1997
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
|
|
This file is part of GDB.
|
This file is part of GDB.
|
|
|
This program is free software; you can redistribute it and/or modify
|
This program is free software; you can redistribute it and/or modify
|
it under the terms of the GNU General Public License as published by
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 2 of the License, or
|
the Free Software Foundation; either version 2 of the License, or
|
(at your option) any later version.
|
(at your option) any later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program; if not, write to the Free Software
|
along with this program; if not, write to the Free Software
|
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
|
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
|
|
|
/* Parse a C expression from text in a string,
|
/* Parse a C expression from text in a string,
|
and return the result as a struct expression pointer.
|
and return the result as a struct expression pointer.
|
That structure contains arithmetic operations in reverse polish,
|
That structure contains arithmetic operations in reverse polish,
|
with constants represented by operations that are followed by special data.
|
with constants represented by operations that are followed by special data.
|
See expression.h for the details of the format.
|
See expression.h for the details of the format.
|
What is important here is that it can be built up sequentially
|
What is important here is that it can be built up sequentially
|
during the process of parsing; the lower levels of the tree always
|
during the process of parsing; the lower levels of the tree always
|
come first in the result.
|
come first in the result.
|
|
|
Note that malloc's and realloc's in this file are transformed to
|
Note that malloc's and realloc's in this file are transformed to
|
xmalloc and xrealloc respectively by the same sed command in the
|
xmalloc and xrealloc respectively by the same sed command in the
|
makefile that remaps any other malloc/realloc inserted by the parser
|
makefile that remaps any other malloc/realloc inserted by the parser
|
generator. Doing this with #defines and trying to control the interaction
|
generator. Doing this with #defines and trying to control the interaction
|
with include files ( and for example) just became
|
with include files ( and for example) just became
|
too messy, particularly when such includes can be inserted at random
|
too messy, particularly when such includes can be inserted at random
|
times by the parser generator. */
|
times by the parser generator. */
|
|
|
%{
|
%{
|
|
|
#include "defs.h"
|
#include "defs.h"
|
#include "gdb_string.h"
|
#include "gdb_string.h"
|
#include
|
#include
|
#include "expression.h"
|
#include "expression.h"
|
#include "value.h"
|
#include "value.h"
|
#include "parser-defs.h"
|
#include "parser-defs.h"
|
#include "language.h"
|
#include "language.h"
|
#include "c-lang.h"
|
#include "c-lang.h"
|
#include "bfd.h" /* Required by objfiles.h. */
|
#include "bfd.h" /* Required by objfiles.h. */
|
#include "symfile.h" /* Required by objfiles.h. */
|
#include "symfile.h" /* Required by objfiles.h. */
|
#include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
|
#include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
|
|
|
/* Flag indicating we're dealing with HP-compiled objects */
|
/* Flag indicating we're dealing with HP-compiled objects */
|
extern int hp_som_som_object_present;
|
extern int hp_som_som_object_present;
|
|
|
/* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
|
/* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
|
as well as gratuitiously global symbol names, so we can have multiple
|
as well as gratuitiously global symbol names, so we can have multiple
|
yacc generated parsers in gdb. Note that these are only the variables
|
yacc generated parsers in gdb. Note that these are only the variables
|
produced by yacc. If other parser generators (bison, byacc, etc) produce
|
produced by yacc. If other parser generators (bison, byacc, etc) produce
|
additional global names that conflict at link time, then those parser
|
additional global names that conflict at link time, then those parser
|
generators need to be fixed instead of adding those names to this list. */
|
generators need to be fixed instead of adding those names to this list. */
|
|
|
#define yymaxdepth c_maxdepth
|
#define yymaxdepth c_maxdepth
|
#define yyparse c_parse
|
#define yyparse c_parse
|
#define yylex c_lex
|
#define yylex c_lex
|
#define yyerror c_error
|
#define yyerror c_error
|
#define yylval c_lval
|
#define yylval c_lval
|
#define yychar c_char
|
#define yychar c_char
|
#define yydebug c_debug
|
#define yydebug c_debug
|
#define yypact c_pact
|
#define yypact c_pact
|
#define yyr1 c_r1
|
#define yyr1 c_r1
|
#define yyr2 c_r2
|
#define yyr2 c_r2
|
#define yydef c_def
|
#define yydef c_def
|
#define yychk c_chk
|
#define yychk c_chk
|
#define yypgo c_pgo
|
#define yypgo c_pgo
|
#define yyact c_act
|
#define yyact c_act
|
#define yyexca c_exca
|
#define yyexca c_exca
|
#define yyerrflag c_errflag
|
#define yyerrflag c_errflag
|
#define yynerrs c_nerrs
|
#define yynerrs c_nerrs
|
#define yyps c_ps
|
#define yyps c_ps
|
#define yypv c_pv
|
#define yypv c_pv
|
#define yys c_s
|
#define yys c_s
|
#define yy_yys c_yys
|
#define yy_yys c_yys
|
#define yystate c_state
|
#define yystate c_state
|
#define yytmp c_tmp
|
#define yytmp c_tmp
|
#define yyv c_v
|
#define yyv c_v
|
#define yy_yyv c_yyv
|
#define yy_yyv c_yyv
|
#define yyval c_val
|
#define yyval c_val
|
#define yylloc c_lloc
|
#define yylloc c_lloc
|
#define yyreds c_reds /* With YYDEBUG defined */
|
#define yyreds c_reds /* With YYDEBUG defined */
|
#define yytoks c_toks /* With YYDEBUG defined */
|
#define yytoks c_toks /* With YYDEBUG defined */
|
#define yylhs c_yylhs
|
#define yylhs c_yylhs
|
#define yylen c_yylen
|
#define yylen c_yylen
|
#define yydefred c_yydefred
|
#define yydefred c_yydefred
|
#define yydgoto c_yydgoto
|
#define yydgoto c_yydgoto
|
#define yysindex c_yysindex
|
#define yysindex c_yysindex
|
#define yyrindex c_yyrindex
|
#define yyrindex c_yyrindex
|
#define yygindex c_yygindex
|
#define yygindex c_yygindex
|
#define yytable c_yytable
|
#define yytable c_yytable
|
#define yycheck c_yycheck
|
#define yycheck c_yycheck
|
|
|
#ifndef YYDEBUG
|
#ifndef YYDEBUG
|
#define YYDEBUG 0 /* Default to no yydebug support */
|
#define YYDEBUG 0 /* Default to no yydebug support */
|
#endif
|
#endif
|
|
|
int
|
int
|
yyparse PARAMS ((void));
|
yyparse PARAMS ((void));
|
|
|
static int
|
static int
|
yylex PARAMS ((void));
|
yylex PARAMS ((void));
|
|
|
void
|
void
|
yyerror PARAMS ((char *));
|
yyerror PARAMS ((char *));
|
|
|
%}
|
%}
|
|
|
/* Although the yacc "value" of an expression is not used,
|
/* Although the yacc "value" of an expression is not used,
|
since the result is stored in the structure being created,
|
since the result is stored in the structure being created,
|
other node types do have values. */
|
other node types do have values. */
|
|
|
%union
|
%union
|
{
|
{
|
LONGEST lval;
|
LONGEST lval;
|
struct {
|
struct {
|
LONGEST val;
|
LONGEST val;
|
struct type *type;
|
struct type *type;
|
} typed_val_int;
|
} typed_val_int;
|
struct {
|
struct {
|
DOUBLEST dval;
|
DOUBLEST dval;
|
struct type *type;
|
struct type *type;
|
} typed_val_float;
|
} typed_val_float;
|
struct symbol *sym;
|
struct symbol *sym;
|
struct type *tval;
|
struct type *tval;
|
struct stoken sval;
|
struct stoken sval;
|
struct ttype tsym;
|
struct ttype tsym;
|
struct symtoken ssym;
|
struct symtoken ssym;
|
int voidval;
|
int voidval;
|
struct block *bval;
|
struct block *bval;
|
enum exp_opcode opcode;
|
enum exp_opcode opcode;
|
struct internalvar *ivar;
|
struct internalvar *ivar;
|
|
|
struct type **tvec;
|
struct type **tvec;
|
int *ivec;
|
int *ivec;
|
}
|
}
|
|
|
%{
|
%{
|
/* YYSTYPE gets defined by %union */
|
/* YYSTYPE gets defined by %union */
|
static int
|
static int
|
parse_number PARAMS ((char *, int, int, YYSTYPE *));
|
parse_number PARAMS ((char *, int, int, YYSTYPE *));
|
%}
|
%}
|
|
|
%type exp exp1 type_exp start variable qualified_name lcurly
|
%type exp exp1 type_exp start variable qualified_name lcurly
|
%type rcurly
|
%type rcurly
|
%type type typebase
|
%type type typebase
|
%type nonempty_typelist
|
%type nonempty_typelist
|
/* %type block */
|
/* %type block */
|
|
|
/* Fancy type parsing. */
|
/* Fancy type parsing. */
|
%type func_mod direct_abs_decl abs_decl
|
%type func_mod direct_abs_decl abs_decl
|
%type ptype
|
%type ptype
|
%type array_mod
|
%type array_mod
|
|
|
%token INT
|
%token INT
|
%token FLOAT
|
%token FLOAT
|
|
|
/* Both NAME and TYPENAME tokens represent symbols in the input,
|
/* Both NAME and TYPENAME tokens represent symbols in the input,
|
and both convey their data as strings.
|
and both convey their data as strings.
|
But a TYPENAME is a string that happens to be defined as a typedef
|
But a TYPENAME is a string that happens to be defined as a typedef
|
or builtin type name (such as int or char)
|
or builtin type name (such as int or char)
|
and a NAME is any other symbol.
|
and a NAME is any other symbol.
|
Contexts where this distinction is not important can use the
|
Contexts where this distinction is not important can use the
|
nonterminal "name", which matches either NAME or TYPENAME. */
|
nonterminal "name", which matches either NAME or TYPENAME. */
|
|
|
%token STRING
|
%token STRING
|
%token NAME /* BLOCKNAME defined below to give it higher precedence. */
|
%token NAME /* BLOCKNAME defined below to give it higher precedence. */
|
%token TYPENAME
|
%token TYPENAME
|
%type name
|
%type name
|
%type name_not_typename
|
%type name_not_typename
|
%type typename
|
%type typename
|
|
|
/* A NAME_OR_INT is a symbol which is not known in the symbol table,
|
/* A NAME_OR_INT is a symbol which is not known in the symbol table,
|
but which would parse as a valid number in the current input radix.
|
but which would parse as a valid number in the current input radix.
|
E.g. "c" when input_radix==16. Depending on the parse, it will be
|
E.g. "c" when input_radix==16. Depending on the parse, it will be
|
turned into a name or into a number. */
|
turned into a name or into a number. */
|
|
|
%token NAME_OR_INT
|
%token NAME_OR_INT
|
|
|
%token STRUCT CLASS UNION ENUM SIZEOF UNSIGNED COLONCOLON
|
%token STRUCT CLASS UNION ENUM SIZEOF UNSIGNED COLONCOLON
|
%token TEMPLATE
|
%token TEMPLATE
|
%token ERROR
|
%token ERROR
|
|
|
/* Special type cases, put in to allow the parser to distinguish different
|
/* Special type cases, put in to allow the parser to distinguish different
|
legal basetypes. */
|
legal basetypes. */
|
%token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD
|
%token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD
|
|
|
%token VARIABLE
|
%token VARIABLE
|
|
|
%token ASSIGN_MODIFY
|
%token ASSIGN_MODIFY
|
|
|
/* C++ */
|
/* C++ */
|
%token THIS
|
%token THIS
|
%token TRUEKEYWORD
|
%token TRUEKEYWORD
|
%token FALSEKEYWORD
|
%token FALSEKEYWORD
|
|
|
|
|
%left ','
|
%left ','
|
%left ABOVE_COMMA
|
%left ABOVE_COMMA
|
%right '=' ASSIGN_MODIFY
|
%right '=' ASSIGN_MODIFY
|
%right '?'
|
%right '?'
|
%left OROR
|
%left OROR
|
%left ANDAND
|
%left ANDAND
|
%left '|'
|
%left '|'
|
%left '^'
|
%left '^'
|
%left '&'
|
%left '&'
|
%left EQUAL NOTEQUAL
|
%left EQUAL NOTEQUAL
|
%left '<' '>' LEQ GEQ
|
%left '<' '>' LEQ GEQ
|
%left LSH RSH
|
%left LSH RSH
|
%left '@'
|
%left '@'
|
%left '+' '-'
|
%left '+' '-'
|
%left '*' '/' '%'
|
%left '*' '/' '%'
|
%right UNARY INCREMENT DECREMENT
|
%right UNARY INCREMENT DECREMENT
|
%right ARROW '.' '[' '('
|
%right ARROW '.' '[' '('
|
%token BLOCKNAME
|
%token BLOCKNAME
|
%token FILENAME
|
%token FILENAME
|
%type block
|
%type block
|
%left COLONCOLON
|
%left COLONCOLON
|
|
|
|
|
%%
|
%%
|
|
|
start : exp1
|
start : exp1
|
| type_exp
|
| type_exp
|
;
|
;
|
|
|
type_exp: type
|
type_exp: type
|
{ write_exp_elt_opcode(OP_TYPE);
|
{ write_exp_elt_opcode(OP_TYPE);
|
write_exp_elt_type($1);
|
write_exp_elt_type($1);
|
write_exp_elt_opcode(OP_TYPE);}
|
write_exp_elt_opcode(OP_TYPE);}
|
;
|
;
|
|
|
/* Expressions, including the comma operator. */
|
/* Expressions, including the comma operator. */
|
exp1 : exp
|
exp1 : exp
|
| exp1 ',' exp
|
| exp1 ',' exp
|
{ write_exp_elt_opcode (BINOP_COMMA); }
|
{ write_exp_elt_opcode (BINOP_COMMA); }
|
;
|
;
|
|
|
/* Expressions, not including the comma operator. */
|
/* Expressions, not including the comma operator. */
|
exp : '*' exp %prec UNARY
|
exp : '*' exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_IND); }
|
{ write_exp_elt_opcode (UNOP_IND); }
|
|
|
exp : '&' exp %prec UNARY
|
exp : '&' exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_ADDR); }
|
{ write_exp_elt_opcode (UNOP_ADDR); }
|
|
|
exp : '-' exp %prec UNARY
|
exp : '-' exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_NEG); }
|
{ write_exp_elt_opcode (UNOP_NEG); }
|
;
|
;
|
|
|
exp : '!' exp %prec UNARY
|
exp : '!' exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_LOGICAL_NOT); }
|
{ write_exp_elt_opcode (UNOP_LOGICAL_NOT); }
|
;
|
;
|
|
|
exp : '~' exp %prec UNARY
|
exp : '~' exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_COMPLEMENT); }
|
{ write_exp_elt_opcode (UNOP_COMPLEMENT); }
|
;
|
;
|
|
|
exp : INCREMENT exp %prec UNARY
|
exp : INCREMENT exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_PREINCREMENT); }
|
{ write_exp_elt_opcode (UNOP_PREINCREMENT); }
|
;
|
;
|
|
|
exp : DECREMENT exp %prec UNARY
|
exp : DECREMENT exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_PREDECREMENT); }
|
{ write_exp_elt_opcode (UNOP_PREDECREMENT); }
|
;
|
;
|
|
|
exp : exp INCREMENT %prec UNARY
|
exp : exp INCREMENT %prec UNARY
|
{ write_exp_elt_opcode (UNOP_POSTINCREMENT); }
|
{ write_exp_elt_opcode (UNOP_POSTINCREMENT); }
|
;
|
;
|
|
|
exp : exp DECREMENT %prec UNARY
|
exp : exp DECREMENT %prec UNARY
|
{ write_exp_elt_opcode (UNOP_POSTDECREMENT); }
|
{ write_exp_elt_opcode (UNOP_POSTDECREMENT); }
|
;
|
;
|
|
|
exp : SIZEOF exp %prec UNARY
|
exp : SIZEOF exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_SIZEOF); }
|
{ write_exp_elt_opcode (UNOP_SIZEOF); }
|
;
|
;
|
|
|
exp : exp ARROW name
|
exp : exp ARROW name
|
{ write_exp_elt_opcode (STRUCTOP_PTR);
|
{ write_exp_elt_opcode (STRUCTOP_PTR);
|
write_exp_string ($3);
|
write_exp_string ($3);
|
write_exp_elt_opcode (STRUCTOP_PTR); }
|
write_exp_elt_opcode (STRUCTOP_PTR); }
|
;
|
;
|
|
|
exp : exp ARROW qualified_name
|
exp : exp ARROW qualified_name
|
{ /* exp->type::name becomes exp->*(&type::name) */
|
{ /* exp->type::name becomes exp->*(&type::name) */
|
/* Note: this doesn't work if name is a
|
/* Note: this doesn't work if name is a
|
static member! FIXME */
|
static member! FIXME */
|
write_exp_elt_opcode (UNOP_ADDR);
|
write_exp_elt_opcode (UNOP_ADDR);
|
write_exp_elt_opcode (STRUCTOP_MPTR); }
|
write_exp_elt_opcode (STRUCTOP_MPTR); }
|
;
|
;
|
|
|
exp : exp ARROW '*' exp
|
exp : exp ARROW '*' exp
|
{ write_exp_elt_opcode (STRUCTOP_MPTR); }
|
{ write_exp_elt_opcode (STRUCTOP_MPTR); }
|
;
|
;
|
|
|
exp : exp '.' name
|
exp : exp '.' name
|
{ write_exp_elt_opcode (STRUCTOP_STRUCT);
|
{ write_exp_elt_opcode (STRUCTOP_STRUCT);
|
write_exp_string ($3);
|
write_exp_string ($3);
|
write_exp_elt_opcode (STRUCTOP_STRUCT); }
|
write_exp_elt_opcode (STRUCTOP_STRUCT); }
|
;
|
;
|
|
|
exp : exp '.' qualified_name
|
exp : exp '.' qualified_name
|
{ /* exp.type::name becomes exp.*(&type::name) */
|
{ /* exp.type::name becomes exp.*(&type::name) */
|
/* Note: this doesn't work if name is a
|
/* Note: this doesn't work if name is a
|
static member! FIXME */
|
static member! FIXME */
|
write_exp_elt_opcode (UNOP_ADDR);
|
write_exp_elt_opcode (UNOP_ADDR);
|
write_exp_elt_opcode (STRUCTOP_MEMBER); }
|
write_exp_elt_opcode (STRUCTOP_MEMBER); }
|
;
|
;
|
|
|
exp : exp '.' '*' exp
|
exp : exp '.' '*' exp
|
{ write_exp_elt_opcode (STRUCTOP_MEMBER); }
|
{ write_exp_elt_opcode (STRUCTOP_MEMBER); }
|
;
|
;
|
|
|
exp : exp '[' exp1 ']'
|
exp : exp '[' exp1 ']'
|
{ write_exp_elt_opcode (BINOP_SUBSCRIPT); }
|
{ write_exp_elt_opcode (BINOP_SUBSCRIPT); }
|
;
|
;
|
|
|
exp : exp '('
|
exp : exp '('
|
/* This is to save the value of arglist_len
|
/* This is to save the value of arglist_len
|
being accumulated by an outer function call. */
|
being accumulated by an outer function call. */
|
{ start_arglist (); }
|
{ start_arglist (); }
|
arglist ')' %prec ARROW
|
arglist ')' %prec ARROW
|
{ write_exp_elt_opcode (OP_FUNCALL);
|
{ write_exp_elt_opcode (OP_FUNCALL);
|
write_exp_elt_longcst ((LONGEST) end_arglist ());
|
write_exp_elt_longcst ((LONGEST) end_arglist ());
|
write_exp_elt_opcode (OP_FUNCALL); }
|
write_exp_elt_opcode (OP_FUNCALL); }
|
;
|
;
|
|
|
lcurly : '{'
|
lcurly : '{'
|
{ start_arglist (); }
|
{ start_arglist (); }
|
;
|
;
|
|
|
arglist :
|
arglist :
|
;
|
;
|
|
|
arglist : exp
|
arglist : exp
|
{ arglist_len = 1; }
|
{ arglist_len = 1; }
|
;
|
;
|
|
|
arglist : arglist ',' exp %prec ABOVE_COMMA
|
arglist : arglist ',' exp %prec ABOVE_COMMA
|
{ arglist_len++; }
|
{ arglist_len++; }
|
;
|
;
|
|
|
rcurly : '}'
|
rcurly : '}'
|
{ $$ = end_arglist () - 1; }
|
{ $$ = end_arglist () - 1; }
|
;
|
;
|
exp : lcurly arglist rcurly %prec ARROW
|
exp : lcurly arglist rcurly %prec ARROW
|
{ write_exp_elt_opcode (OP_ARRAY);
|
{ write_exp_elt_opcode (OP_ARRAY);
|
write_exp_elt_longcst ((LONGEST) 0);
|
write_exp_elt_longcst ((LONGEST) 0);
|
write_exp_elt_longcst ((LONGEST) $3);
|
write_exp_elt_longcst ((LONGEST) $3);
|
write_exp_elt_opcode (OP_ARRAY); }
|
write_exp_elt_opcode (OP_ARRAY); }
|
;
|
;
|
|
|
exp : lcurly type rcurly exp %prec UNARY
|
exp : lcurly type rcurly exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_MEMVAL);
|
{ write_exp_elt_opcode (UNOP_MEMVAL);
|
write_exp_elt_type ($2);
|
write_exp_elt_type ($2);
|
write_exp_elt_opcode (UNOP_MEMVAL); }
|
write_exp_elt_opcode (UNOP_MEMVAL); }
|
;
|
;
|
|
|
exp : '(' type ')' exp %prec UNARY
|
exp : '(' type ')' exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_CAST);
|
{ write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_type ($2);
|
write_exp_elt_type ($2);
|
write_exp_elt_opcode (UNOP_CAST); }
|
write_exp_elt_opcode (UNOP_CAST); }
|
;
|
;
|
|
|
exp : '(' exp1 ')'
|
exp : '(' exp1 ')'
|
{ }
|
{ }
|
;
|
;
|
|
|
/* Binary operators in order of decreasing precedence. */
|
/* Binary operators in order of decreasing precedence. */
|
|
|
exp : exp '@' exp
|
exp : exp '@' exp
|
{ write_exp_elt_opcode (BINOP_REPEAT); }
|
{ write_exp_elt_opcode (BINOP_REPEAT); }
|
;
|
;
|
|
|
exp : exp '*' exp
|
exp : exp '*' exp
|
{ write_exp_elt_opcode (BINOP_MUL); }
|
{ write_exp_elt_opcode (BINOP_MUL); }
|
;
|
;
|
|
|
exp : exp '/' exp
|
exp : exp '/' exp
|
{ write_exp_elt_opcode (BINOP_DIV); }
|
{ write_exp_elt_opcode (BINOP_DIV); }
|
;
|
;
|
|
|
exp : exp '%' exp
|
exp : exp '%' exp
|
{ write_exp_elt_opcode (BINOP_REM); }
|
{ write_exp_elt_opcode (BINOP_REM); }
|
;
|
;
|
|
|
exp : exp '+' exp
|
exp : exp '+' exp
|
{ write_exp_elt_opcode (BINOP_ADD); }
|
{ write_exp_elt_opcode (BINOP_ADD); }
|
;
|
;
|
|
|
exp : exp '-' exp
|
exp : exp '-' exp
|
{ write_exp_elt_opcode (BINOP_SUB); }
|
{ write_exp_elt_opcode (BINOP_SUB); }
|
;
|
;
|
|
|
exp : exp LSH exp
|
exp : exp LSH exp
|
{ write_exp_elt_opcode (BINOP_LSH); }
|
{ write_exp_elt_opcode (BINOP_LSH); }
|
;
|
;
|
|
|
exp : exp RSH exp
|
exp : exp RSH exp
|
{ write_exp_elt_opcode (BINOP_RSH); }
|
{ write_exp_elt_opcode (BINOP_RSH); }
|
;
|
;
|
|
|
exp : exp EQUAL exp
|
exp : exp EQUAL exp
|
{ write_exp_elt_opcode (BINOP_EQUAL); }
|
{ write_exp_elt_opcode (BINOP_EQUAL); }
|
;
|
;
|
|
|
exp : exp NOTEQUAL exp
|
exp : exp NOTEQUAL exp
|
{ write_exp_elt_opcode (BINOP_NOTEQUAL); }
|
{ write_exp_elt_opcode (BINOP_NOTEQUAL); }
|
;
|
;
|
|
|
exp : exp LEQ exp
|
exp : exp LEQ exp
|
{ write_exp_elt_opcode (BINOP_LEQ); }
|
{ write_exp_elt_opcode (BINOP_LEQ); }
|
;
|
;
|
|
|
exp : exp GEQ exp
|
exp : exp GEQ exp
|
{ write_exp_elt_opcode (BINOP_GEQ); }
|
{ write_exp_elt_opcode (BINOP_GEQ); }
|
;
|
;
|
|
|
exp : exp '<' exp
|
exp : exp '<' exp
|
{ write_exp_elt_opcode (BINOP_LESS); }
|
{ write_exp_elt_opcode (BINOP_LESS); }
|
;
|
;
|
|
|
exp : exp '>' exp
|
exp : exp '>' exp
|
{ write_exp_elt_opcode (BINOP_GTR); }
|
{ write_exp_elt_opcode (BINOP_GTR); }
|
;
|
;
|
|
|
exp : exp '&' exp
|
exp : exp '&' exp
|
{ write_exp_elt_opcode (BINOP_BITWISE_AND); }
|
{ write_exp_elt_opcode (BINOP_BITWISE_AND); }
|
;
|
;
|
|
|
exp : exp '^' exp
|
exp : exp '^' exp
|
{ write_exp_elt_opcode (BINOP_BITWISE_XOR); }
|
{ write_exp_elt_opcode (BINOP_BITWISE_XOR); }
|
;
|
;
|
|
|
exp : exp '|' exp
|
exp : exp '|' exp
|
{ write_exp_elt_opcode (BINOP_BITWISE_IOR); }
|
{ write_exp_elt_opcode (BINOP_BITWISE_IOR); }
|
;
|
;
|
|
|
exp : exp ANDAND exp
|
exp : exp ANDAND exp
|
{ write_exp_elt_opcode (BINOP_LOGICAL_AND); }
|
{ write_exp_elt_opcode (BINOP_LOGICAL_AND); }
|
;
|
;
|
|
|
exp : exp OROR exp
|
exp : exp OROR exp
|
{ write_exp_elt_opcode (BINOP_LOGICAL_OR); }
|
{ write_exp_elt_opcode (BINOP_LOGICAL_OR); }
|
;
|
;
|
|
|
exp : exp '?' exp ':' exp %prec '?'
|
exp : exp '?' exp ':' exp %prec '?'
|
{ write_exp_elt_opcode (TERNOP_COND); }
|
{ write_exp_elt_opcode (TERNOP_COND); }
|
;
|
;
|
|
|
exp : exp '=' exp
|
exp : exp '=' exp
|
{ write_exp_elt_opcode (BINOP_ASSIGN); }
|
{ write_exp_elt_opcode (BINOP_ASSIGN); }
|
;
|
;
|
|
|
exp : exp ASSIGN_MODIFY exp
|
exp : exp ASSIGN_MODIFY exp
|
{ write_exp_elt_opcode (BINOP_ASSIGN_MODIFY);
|
{ write_exp_elt_opcode (BINOP_ASSIGN_MODIFY);
|
write_exp_elt_opcode ($2);
|
write_exp_elt_opcode ($2);
|
write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); }
|
write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); }
|
;
|
;
|
|
|
exp : INT
|
exp : INT
|
{ write_exp_elt_opcode (OP_LONG);
|
{ write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type ($1.type);
|
write_exp_elt_type ($1.type);
|
write_exp_elt_longcst ((LONGEST)($1.val));
|
write_exp_elt_longcst ((LONGEST)($1.val));
|
write_exp_elt_opcode (OP_LONG); }
|
write_exp_elt_opcode (OP_LONG); }
|
;
|
;
|
|
|
exp : NAME_OR_INT
|
exp : NAME_OR_INT
|
{ YYSTYPE val;
|
{ YYSTYPE val;
|
parse_number ($1.stoken.ptr, $1.stoken.length, 0, &val);
|
parse_number ($1.stoken.ptr, $1.stoken.length, 0, &val);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (val.typed_val_int.type);
|
write_exp_elt_type (val.typed_val_int.type);
|
write_exp_elt_longcst ((LONGEST)val.typed_val_int.val);
|
write_exp_elt_longcst ((LONGEST)val.typed_val_int.val);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
}
|
}
|
;
|
;
|
|
|
|
|
exp : FLOAT
|
exp : FLOAT
|
{ write_exp_elt_opcode (OP_DOUBLE);
|
{ write_exp_elt_opcode (OP_DOUBLE);
|
write_exp_elt_type ($1.type);
|
write_exp_elt_type ($1.type);
|
write_exp_elt_dblcst ($1.dval);
|
write_exp_elt_dblcst ($1.dval);
|
write_exp_elt_opcode (OP_DOUBLE); }
|
write_exp_elt_opcode (OP_DOUBLE); }
|
;
|
;
|
|
|
exp : variable
|
exp : variable
|
;
|
;
|
|
|
exp : VARIABLE
|
exp : VARIABLE
|
/* Already written by write_dollar_variable. */
|
/* Already written by write_dollar_variable. */
|
;
|
;
|
|
|
exp : SIZEOF '(' type ')' %prec UNARY
|
exp : SIZEOF '(' type ')' %prec UNARY
|
{ write_exp_elt_opcode (OP_LONG);
|
{ write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (builtin_type_int);
|
write_exp_elt_type (builtin_type_int);
|
CHECK_TYPEDEF ($3);
|
CHECK_TYPEDEF ($3);
|
write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3));
|
write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3));
|
write_exp_elt_opcode (OP_LONG); }
|
write_exp_elt_opcode (OP_LONG); }
|
;
|
;
|
|
|
exp : STRING
|
exp : STRING
|
{ /* C strings are converted into array constants with
|
{ /* C strings are converted into array constants with
|
an explicit null byte added at the end. Thus
|
an explicit null byte added at the end. Thus
|
the array upper bound is the string length.
|
the array upper bound is the string length.
|
There is no such thing in C as a completely empty
|
There is no such thing in C as a completely empty
|
string. */
|
string. */
|
char *sp = $1.ptr; int count = $1.length;
|
char *sp = $1.ptr; int count = $1.length;
|
while (count-- > 0)
|
while (count-- > 0)
|
{
|
{
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (builtin_type_char);
|
write_exp_elt_type (builtin_type_char);
|
write_exp_elt_longcst ((LONGEST)(*sp++));
|
write_exp_elt_longcst ((LONGEST)(*sp++));
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
}
|
}
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (builtin_type_char);
|
write_exp_elt_type (builtin_type_char);
|
write_exp_elt_longcst ((LONGEST)'\0');
|
write_exp_elt_longcst ((LONGEST)'\0');
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_ARRAY);
|
write_exp_elt_opcode (OP_ARRAY);
|
write_exp_elt_longcst ((LONGEST) 0);
|
write_exp_elt_longcst ((LONGEST) 0);
|
write_exp_elt_longcst ((LONGEST) ($1.length));
|
write_exp_elt_longcst ((LONGEST) ($1.length));
|
write_exp_elt_opcode (OP_ARRAY); }
|
write_exp_elt_opcode (OP_ARRAY); }
|
;
|
;
|
|
|
/* C++. */
|
/* C++. */
|
exp : THIS
|
exp : THIS
|
{ write_exp_elt_opcode (OP_THIS);
|
{ write_exp_elt_opcode (OP_THIS);
|
write_exp_elt_opcode (OP_THIS); }
|
write_exp_elt_opcode (OP_THIS); }
|
;
|
;
|
|
|
exp : TRUEKEYWORD
|
exp : TRUEKEYWORD
|
{ write_exp_elt_opcode (OP_LONG);
|
{ write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (builtin_type_bool);
|
write_exp_elt_type (builtin_type_bool);
|
write_exp_elt_longcst ((LONGEST) 1);
|
write_exp_elt_longcst ((LONGEST) 1);
|
write_exp_elt_opcode (OP_LONG); }
|
write_exp_elt_opcode (OP_LONG); }
|
;
|
;
|
|
|
exp : FALSEKEYWORD
|
exp : FALSEKEYWORD
|
{ write_exp_elt_opcode (OP_LONG);
|
{ write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (builtin_type_bool);
|
write_exp_elt_type (builtin_type_bool);
|
write_exp_elt_longcst ((LONGEST) 0);
|
write_exp_elt_longcst ((LONGEST) 0);
|
write_exp_elt_opcode (OP_LONG); }
|
write_exp_elt_opcode (OP_LONG); }
|
;
|
;
|
|
|
/* end of C++. */
|
/* end of C++. */
|
|
|
block : BLOCKNAME
|
block : BLOCKNAME
|
{
|
{
|
if ($1.sym)
|
if ($1.sym)
|
$$ = SYMBOL_BLOCK_VALUE ($1.sym);
|
$$ = SYMBOL_BLOCK_VALUE ($1.sym);
|
else
|
else
|
error ("No file or function \"%s\".",
|
error ("No file or function \"%s\".",
|
copy_name ($1.stoken));
|
copy_name ($1.stoken));
|
}
|
}
|
| FILENAME
|
| FILENAME
|
{
|
{
|
$$ = $1;
|
$$ = $1;
|
}
|
}
|
;
|
;
|
|
|
block : block COLONCOLON name
|
block : block COLONCOLON name
|
{ struct symbol *tem
|
{ struct symbol *tem
|
= lookup_symbol (copy_name ($3), $1,
|
= lookup_symbol (copy_name ($3), $1,
|
VAR_NAMESPACE, (int *) NULL,
|
VAR_NAMESPACE, (int *) NULL,
|
(struct symtab **) NULL);
|
(struct symtab **) NULL);
|
if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
|
if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
|
error ("No function \"%s\" in specified context.",
|
error ("No function \"%s\" in specified context.",
|
copy_name ($3));
|
copy_name ($3));
|
$$ = SYMBOL_BLOCK_VALUE (tem); }
|
$$ = SYMBOL_BLOCK_VALUE (tem); }
|
;
|
;
|
|
|
variable: block COLONCOLON name
|
variable: block COLONCOLON name
|
{ struct symbol *sym;
|
{ struct symbol *sym;
|
sym = lookup_symbol (copy_name ($3), $1,
|
sym = lookup_symbol (copy_name ($3), $1,
|
VAR_NAMESPACE, (int *) NULL,
|
VAR_NAMESPACE, (int *) NULL,
|
(struct symtab **) NULL);
|
(struct symtab **) NULL);
|
if (sym == 0)
|
if (sym == 0)
|
error ("No symbol \"%s\" in specified context.",
|
error ("No symbol \"%s\" in specified context.",
|
copy_name ($3));
|
copy_name ($3));
|
|
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
/* block_found is set by lookup_symbol. */
|
/* block_found is set by lookup_symbol. */
|
write_exp_elt_block (block_found);
|
write_exp_elt_block (block_found);
|
write_exp_elt_sym (sym);
|
write_exp_elt_sym (sym);
|
write_exp_elt_opcode (OP_VAR_VALUE); }
|
write_exp_elt_opcode (OP_VAR_VALUE); }
|
;
|
;
|
|
|
qualified_name: typebase COLONCOLON name
|
qualified_name: typebase COLONCOLON name
|
{
|
{
|
struct type *type = $1;
|
struct type *type = $1;
|
if (TYPE_CODE (type) != TYPE_CODE_STRUCT
|
if (TYPE_CODE (type) != TYPE_CODE_STRUCT
|
&& TYPE_CODE (type) != TYPE_CODE_UNION)
|
&& TYPE_CODE (type) != TYPE_CODE_UNION)
|
error ("`%s' is not defined as an aggregate type.",
|
error ("`%s' is not defined as an aggregate type.",
|
TYPE_NAME (type));
|
TYPE_NAME (type));
|
|
|
write_exp_elt_opcode (OP_SCOPE);
|
write_exp_elt_opcode (OP_SCOPE);
|
write_exp_elt_type (type);
|
write_exp_elt_type (type);
|
write_exp_string ($3);
|
write_exp_string ($3);
|
write_exp_elt_opcode (OP_SCOPE);
|
write_exp_elt_opcode (OP_SCOPE);
|
}
|
}
|
| typebase COLONCOLON '~' name
|
| typebase COLONCOLON '~' name
|
{
|
{
|
struct type *type = $1;
|
struct type *type = $1;
|
struct stoken tmp_token;
|
struct stoken tmp_token;
|
if (TYPE_CODE (type) != TYPE_CODE_STRUCT
|
if (TYPE_CODE (type) != TYPE_CODE_STRUCT
|
&& TYPE_CODE (type) != TYPE_CODE_UNION)
|
&& TYPE_CODE (type) != TYPE_CODE_UNION)
|
error ("`%s' is not defined as an aggregate type.",
|
error ("`%s' is not defined as an aggregate type.",
|
TYPE_NAME (type));
|
TYPE_NAME (type));
|
|
|
tmp_token.ptr = (char*) alloca ($4.length + 2);
|
tmp_token.ptr = (char*) alloca ($4.length + 2);
|
tmp_token.length = $4.length + 1;
|
tmp_token.length = $4.length + 1;
|
tmp_token.ptr[0] = '~';
|
tmp_token.ptr[0] = '~';
|
memcpy (tmp_token.ptr+1, $4.ptr, $4.length);
|
memcpy (tmp_token.ptr+1, $4.ptr, $4.length);
|
tmp_token.ptr[tmp_token.length] = 0;
|
tmp_token.ptr[tmp_token.length] = 0;
|
|
|
/* Check for valid destructor name. */
|
/* Check for valid destructor name. */
|
destructor_name_p (tmp_token.ptr, type);
|
destructor_name_p (tmp_token.ptr, type);
|
write_exp_elt_opcode (OP_SCOPE);
|
write_exp_elt_opcode (OP_SCOPE);
|
write_exp_elt_type (type);
|
write_exp_elt_type (type);
|
write_exp_string (tmp_token);
|
write_exp_string (tmp_token);
|
write_exp_elt_opcode (OP_SCOPE);
|
write_exp_elt_opcode (OP_SCOPE);
|
}
|
}
|
;
|
;
|
|
|
variable: qualified_name
|
variable: qualified_name
|
| COLONCOLON name
|
| COLONCOLON name
|
{
|
{
|
char *name = copy_name ($2);
|
char *name = copy_name ($2);
|
struct symbol *sym;
|
struct symbol *sym;
|
struct minimal_symbol *msymbol;
|
struct minimal_symbol *msymbol;
|
|
|
sym =
|
sym =
|
lookup_symbol (name, (const struct block *) NULL,
|
lookup_symbol (name, (const struct block *) NULL,
|
VAR_NAMESPACE, (int *) NULL,
|
VAR_NAMESPACE, (int *) NULL,
|
(struct symtab **) NULL);
|
(struct symtab **) NULL);
|
if (sym)
|
if (sym)
|
{
|
{
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_block (NULL);
|
write_exp_elt_block (NULL);
|
write_exp_elt_sym (sym);
|
write_exp_elt_sym (sym);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
break;
|
break;
|
}
|
}
|
|
|
msymbol = lookup_minimal_symbol (name, NULL, NULL);
|
msymbol = lookup_minimal_symbol (name, NULL, NULL);
|
if (msymbol != NULL)
|
if (msymbol != NULL)
|
{
|
{
|
write_exp_msymbol (msymbol,
|
write_exp_msymbol (msymbol,
|
lookup_function_type (builtin_type_int),
|
lookup_function_type (builtin_type_int),
|
builtin_type_int);
|
builtin_type_int);
|
}
|
}
|
else
|
else
|
if (!have_full_symbols () && !have_partial_symbols ())
|
if (!have_full_symbols () && !have_partial_symbols ())
|
error ("No symbol table is loaded. Use the \"file\" command.");
|
error ("No symbol table is loaded. Use the \"file\" command.");
|
else
|
else
|
error ("No symbol \"%s\" in current context.", name);
|
error ("No symbol \"%s\" in current context.", name);
|
}
|
}
|
;
|
;
|
|
|
variable: name_not_typename
|
variable: name_not_typename
|
{ struct symbol *sym = $1.sym;
|
{ struct symbol *sym = $1.sym;
|
|
|
if (sym)
|
if (sym)
|
{
|
{
|
if (symbol_read_needs_frame (sym))
|
if (symbol_read_needs_frame (sym))
|
{
|
{
|
if (innermost_block == 0 ||
|
if (innermost_block == 0 ||
|
contained_in (block_found,
|
contained_in (block_found,
|
innermost_block))
|
innermost_block))
|
innermost_block = block_found;
|
innermost_block = block_found;
|
}
|
}
|
|
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
/* We want to use the selected frame, not
|
/* We want to use the selected frame, not
|
another more inner frame which happens to
|
another more inner frame which happens to
|
be in the same block. */
|
be in the same block. */
|
write_exp_elt_block (NULL);
|
write_exp_elt_block (NULL);
|
write_exp_elt_sym (sym);
|
write_exp_elt_sym (sym);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
}
|
}
|
else if ($1.is_a_field_of_this)
|
else if ($1.is_a_field_of_this)
|
{
|
{
|
/* C++: it hangs off of `this'. Must
|
/* C++: it hangs off of `this'. Must
|
not inadvertently convert from a method call
|
not inadvertently convert from a method call
|
to data ref. */
|
to data ref. */
|
if (innermost_block == 0 ||
|
if (innermost_block == 0 ||
|
contained_in (block_found, innermost_block))
|
contained_in (block_found, innermost_block))
|
innermost_block = block_found;
|
innermost_block = block_found;
|
write_exp_elt_opcode (OP_THIS);
|
write_exp_elt_opcode (OP_THIS);
|
write_exp_elt_opcode (OP_THIS);
|
write_exp_elt_opcode (OP_THIS);
|
write_exp_elt_opcode (STRUCTOP_PTR);
|
write_exp_elt_opcode (STRUCTOP_PTR);
|
write_exp_string ($1.stoken);
|
write_exp_string ($1.stoken);
|
write_exp_elt_opcode (STRUCTOP_PTR);
|
write_exp_elt_opcode (STRUCTOP_PTR);
|
}
|
}
|
else
|
else
|
{
|
{
|
struct minimal_symbol *msymbol;
|
struct minimal_symbol *msymbol;
|
register char *arg = copy_name ($1.stoken);
|
register char *arg = copy_name ($1.stoken);
|
|
|
msymbol =
|
msymbol =
|
lookup_minimal_symbol (arg, NULL, NULL);
|
lookup_minimal_symbol (arg, NULL, NULL);
|
if (msymbol != NULL)
|
if (msymbol != NULL)
|
{
|
{
|
write_exp_msymbol (msymbol,
|
write_exp_msymbol (msymbol,
|
lookup_function_type (builtin_type_int),
|
lookup_function_type (builtin_type_int),
|
builtin_type_int);
|
builtin_type_int);
|
}
|
}
|
else if (!have_full_symbols () && !have_partial_symbols ())
|
else if (!have_full_symbols () && !have_partial_symbols ())
|
error ("No symbol table is loaded. Use the \"file\" command.");
|
error ("No symbol table is loaded. Use the \"file\" command.");
|
else
|
else
|
error ("No symbol \"%s\" in current context.",
|
error ("No symbol \"%s\" in current context.",
|
copy_name ($1.stoken));
|
copy_name ($1.stoken));
|
}
|
}
|
}
|
}
|
;
|
;
|
|
|
|
|
ptype : typebase
|
ptype : typebase
|
/* "const" and "volatile" are curently ignored. A type qualifier
|
/* "const" and "volatile" are curently ignored. A type qualifier
|
before the type is currently handled in the typebase rule.
|
before the type is currently handled in the typebase rule.
|
The reason for recognizing these here (shift/reduce conflicts)
|
The reason for recognizing these here (shift/reduce conflicts)
|
might be obsolete now that some pointer to member rules have
|
might be obsolete now that some pointer to member rules have
|
been deleted. */
|
been deleted. */
|
| typebase CONST_KEYWORD
|
| typebase CONST_KEYWORD
|
| typebase VOLATILE_KEYWORD
|
| typebase VOLATILE_KEYWORD
|
| typebase abs_decl
|
| typebase abs_decl
|
{ $$ = follow_types ($1); }
|
{ $$ = follow_types ($1); }
|
| typebase CONST_KEYWORD abs_decl
|
| typebase CONST_KEYWORD abs_decl
|
{ $$ = follow_types ($1); }
|
{ $$ = follow_types ($1); }
|
| typebase VOLATILE_KEYWORD abs_decl
|
| typebase VOLATILE_KEYWORD abs_decl
|
{ $$ = follow_types ($1); }
|
{ $$ = follow_types ($1); }
|
;
|
;
|
|
|
abs_decl: '*'
|
abs_decl: '*'
|
{ push_type (tp_pointer); $$ = 0; }
|
{ push_type (tp_pointer); $$ = 0; }
|
| '*' abs_decl
|
| '*' abs_decl
|
{ push_type (tp_pointer); $$ = $2; }
|
{ push_type (tp_pointer); $$ = $2; }
|
| '&'
|
| '&'
|
{ push_type (tp_reference); $$ = 0; }
|
{ push_type (tp_reference); $$ = 0; }
|
| '&' abs_decl
|
| '&' abs_decl
|
{ push_type (tp_reference); $$ = $2; }
|
{ push_type (tp_reference); $$ = $2; }
|
| direct_abs_decl
|
| direct_abs_decl
|
;
|
;
|
|
|
direct_abs_decl: '(' abs_decl ')'
|
direct_abs_decl: '(' abs_decl ')'
|
{ $$ = $2; }
|
{ $$ = $2; }
|
| direct_abs_decl array_mod
|
| direct_abs_decl array_mod
|
{
|
{
|
push_type_int ($2);
|
push_type_int ($2);
|
push_type (tp_array);
|
push_type (tp_array);
|
}
|
}
|
| array_mod
|
| array_mod
|
{
|
{
|
push_type_int ($1);
|
push_type_int ($1);
|
push_type (tp_array);
|
push_type (tp_array);
|
$$ = 0;
|
$$ = 0;
|
}
|
}
|
|
|
| direct_abs_decl func_mod
|
| direct_abs_decl func_mod
|
{ push_type (tp_function); }
|
{ push_type (tp_function); }
|
| func_mod
|
| func_mod
|
{ push_type (tp_function); }
|
{ push_type (tp_function); }
|
;
|
;
|
|
|
array_mod: '[' ']'
|
array_mod: '[' ']'
|
{ $$ = -1; }
|
{ $$ = -1; }
|
| '[' INT ']'
|
| '[' INT ']'
|
{ $$ = $2.val; }
|
{ $$ = $2.val; }
|
;
|
;
|
|
|
func_mod: '(' ')'
|
func_mod: '(' ')'
|
{ $$ = 0; }
|
{ $$ = 0; }
|
| '(' nonempty_typelist ')'
|
| '(' nonempty_typelist ')'
|
{ free ((PTR)$2); $$ = 0; }
|
{ free ((PTR)$2); $$ = 0; }
|
;
|
;
|
|
|
/* We used to try to recognize more pointer to member types here, but
|
/* We used to try to recognize more pointer to member types here, but
|
that didn't work (shift/reduce conflicts meant that these rules never
|
that didn't work (shift/reduce conflicts meant that these rules never
|
got executed). The problem is that
|
got executed). The problem is that
|
int (foo::bar::baz::bizzle)
|
int (foo::bar::baz::bizzle)
|
is a function type but
|
is a function type but
|
int (foo::bar::baz::bizzle::*)
|
int (foo::bar::baz::bizzle::*)
|
is a pointer to member type. Stroustrup loses again! */
|
is a pointer to member type. Stroustrup loses again! */
|
|
|
type : ptype
|
type : ptype
|
| typebase COLONCOLON '*'
|
| typebase COLONCOLON '*'
|
{ $$ = lookup_member_type (builtin_type_int, $1); }
|
{ $$ = lookup_member_type (builtin_type_int, $1); }
|
;
|
;
|
|
|
typebase /* Implements (approximately): (type-qualifier)* type-specifier */
|
typebase /* Implements (approximately): (type-qualifier)* type-specifier */
|
: TYPENAME
|
: TYPENAME
|
{ $$ = $1.type; }
|
{ $$ = $1.type; }
|
| INT_KEYWORD
|
| INT_KEYWORD
|
{ $$ = builtin_type_int; }
|
{ $$ = builtin_type_int; }
|
| LONG
|
| LONG
|
{ $$ = builtin_type_long; }
|
{ $$ = builtin_type_long; }
|
| SHORT
|
| SHORT
|
{ $$ = builtin_type_short; }
|
{ $$ = builtin_type_short; }
|
| LONG INT_KEYWORD
|
| LONG INT_KEYWORD
|
{ $$ = builtin_type_long; }
|
{ $$ = builtin_type_long; }
|
| UNSIGNED LONG INT_KEYWORD
|
| UNSIGNED LONG INT_KEYWORD
|
{ $$ = builtin_type_unsigned_long; }
|
{ $$ = builtin_type_unsigned_long; }
|
| LONG LONG
|
| LONG LONG
|
{ $$ = builtin_type_long_long; }
|
{ $$ = builtin_type_long_long; }
|
| LONG LONG INT_KEYWORD
|
| LONG LONG INT_KEYWORD
|
{ $$ = builtin_type_long_long; }
|
{ $$ = builtin_type_long_long; }
|
| UNSIGNED LONG LONG
|
| UNSIGNED LONG LONG
|
{ $$ = builtin_type_unsigned_long_long; }
|
{ $$ = builtin_type_unsigned_long_long; }
|
| UNSIGNED LONG LONG INT_KEYWORD
|
| UNSIGNED LONG LONG INT_KEYWORD
|
{ $$ = builtin_type_unsigned_long_long; }
|
{ $$ = builtin_type_unsigned_long_long; }
|
| SHORT INT_KEYWORD
|
| SHORT INT_KEYWORD
|
{ $$ = builtin_type_short; }
|
{ $$ = builtin_type_short; }
|
| UNSIGNED SHORT INT_KEYWORD
|
| UNSIGNED SHORT INT_KEYWORD
|
{ $$ = builtin_type_unsigned_short; }
|
{ $$ = builtin_type_unsigned_short; }
|
| DOUBLE_KEYWORD
|
| DOUBLE_KEYWORD
|
{ $$ = builtin_type_double; }
|
{ $$ = builtin_type_double; }
|
| LONG DOUBLE_KEYWORD
|
| LONG DOUBLE_KEYWORD
|
{ $$ = builtin_type_long_double; }
|
{ $$ = builtin_type_long_double; }
|
| STRUCT name
|
| STRUCT name
|
{ $$ = lookup_struct (copy_name ($2),
|
{ $$ = lookup_struct (copy_name ($2),
|
expression_context_block); }
|
expression_context_block); }
|
| CLASS name
|
| CLASS name
|
{ $$ = lookup_struct (copy_name ($2),
|
{ $$ = lookup_struct (copy_name ($2),
|
expression_context_block); }
|
expression_context_block); }
|
| UNION name
|
| UNION name
|
{ $$ = lookup_union (copy_name ($2),
|
{ $$ = lookup_union (copy_name ($2),
|
expression_context_block); }
|
expression_context_block); }
|
| ENUM name
|
| ENUM name
|
{ $$ = lookup_enum (copy_name ($2),
|
{ $$ = lookup_enum (copy_name ($2),
|
expression_context_block); }
|
expression_context_block); }
|
| UNSIGNED typename
|
| UNSIGNED typename
|
{ $$ = lookup_unsigned_typename (TYPE_NAME($2.type)); }
|
{ $$ = lookup_unsigned_typename (TYPE_NAME($2.type)); }
|
| UNSIGNED
|
| UNSIGNED
|
{ $$ = builtin_type_unsigned_int; }
|
{ $$ = builtin_type_unsigned_int; }
|
| SIGNED_KEYWORD typename
|
| SIGNED_KEYWORD typename
|
{ $$ = lookup_signed_typename (TYPE_NAME($2.type)); }
|
{ $$ = lookup_signed_typename (TYPE_NAME($2.type)); }
|
| SIGNED_KEYWORD
|
| SIGNED_KEYWORD
|
{ $$ = builtin_type_int; }
|
{ $$ = builtin_type_int; }
|
/* It appears that this rule for templates is never
|
/* It appears that this rule for templates is never
|
reduced; template recognition happens by lookahead
|
reduced; template recognition happens by lookahead
|
in the token processing code in yylex. */
|
in the token processing code in yylex. */
|
| TEMPLATE name '<' type '>'
|
| TEMPLATE name '<' type '>'
|
{ $$ = lookup_template_type(copy_name($2), $4,
|
{ $$ = lookup_template_type(copy_name($2), $4,
|
expression_context_block);
|
expression_context_block);
|
}
|
}
|
/* "const" and "volatile" are curently ignored. A type qualifier
|
/* "const" and "volatile" are curently ignored. A type qualifier
|
after the type is handled in the ptype rule. I think these could
|
after the type is handled in the ptype rule. I think these could
|
be too. */
|
be too. */
|
| CONST_KEYWORD typebase { $$ = $2; }
|
| CONST_KEYWORD typebase { $$ = $2; }
|
| VOLATILE_KEYWORD typebase { $$ = $2; }
|
| VOLATILE_KEYWORD typebase { $$ = $2; }
|
;
|
;
|
|
|
typename: TYPENAME
|
typename: TYPENAME
|
| INT_KEYWORD
|
| INT_KEYWORD
|
{
|
{
|
$$.stoken.ptr = "int";
|
$$.stoken.ptr = "int";
|
$$.stoken.length = 3;
|
$$.stoken.length = 3;
|
$$.type = builtin_type_int;
|
$$.type = builtin_type_int;
|
}
|
}
|
| LONG
|
| LONG
|
{
|
{
|
$$.stoken.ptr = "long";
|
$$.stoken.ptr = "long";
|
$$.stoken.length = 4;
|
$$.stoken.length = 4;
|
$$.type = builtin_type_long;
|
$$.type = builtin_type_long;
|
}
|
}
|
| SHORT
|
| SHORT
|
{
|
{
|
$$.stoken.ptr = "short";
|
$$.stoken.ptr = "short";
|
$$.stoken.length = 5;
|
$$.stoken.length = 5;
|
$$.type = builtin_type_short;
|
$$.type = builtin_type_short;
|
}
|
}
|
;
|
;
|
|
|
nonempty_typelist
|
nonempty_typelist
|
: type
|
: type
|
{ $$ = (struct type **) malloc (sizeof (struct type *) * 2);
|
{ $$ = (struct type **) malloc (sizeof (struct type *) * 2);
|
$$[0] = 1; /* Number of types in vector */
|
$$[0] = 1; /* Number of types in vector */
|
$$[1] = $1;
|
$$[1] = $1;
|
}
|
}
|
| nonempty_typelist ',' type
|
| nonempty_typelist ',' type
|
{ int len = sizeof (struct type *) * (++($1[0]) + 1);
|
{ int len = sizeof (struct type *) * (++($1[0]) + 1);
|
$$ = (struct type **) realloc ((char *) $1, len);
|
$$ = (struct type **) realloc ((char *) $1, len);
|
$$[$$[0]] = $3;
|
$$[$$[0]] = $3;
|
}
|
}
|
;
|
;
|
|
|
name : NAME { $$ = $1.stoken; }
|
name : NAME { $$ = $1.stoken; }
|
| BLOCKNAME { $$ = $1.stoken; }
|
| BLOCKNAME { $$ = $1.stoken; }
|
| TYPENAME { $$ = $1.stoken; }
|
| TYPENAME { $$ = $1.stoken; }
|
| NAME_OR_INT { $$ = $1.stoken; }
|
| NAME_OR_INT { $$ = $1.stoken; }
|
;
|
;
|
|
|
name_not_typename : NAME
|
name_not_typename : NAME
|
| BLOCKNAME
|
| BLOCKNAME
|
/* These would be useful if name_not_typename was useful, but it is just
|
/* These would be useful if name_not_typename was useful, but it is just
|
a fake for "variable", so these cause reduce/reduce conflicts because
|
a fake for "variable", so these cause reduce/reduce conflicts because
|
the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
|
the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
|
=exp) or just an exp. If name_not_typename was ever used in an lvalue
|
=exp) or just an exp. If name_not_typename was ever used in an lvalue
|
context where only a name could occur, this might be useful.
|
context where only a name could occur, this might be useful.
|
| NAME_OR_INT
|
| NAME_OR_INT
|
*/
|
*/
|
;
|
;
|
|
|
%%
|
%%
|
|
|
/* Take care of parsing a number (anything that starts with a digit).
|
/* Take care of parsing a number (anything that starts with a digit).
|
Set yylval and return the token type; update lexptr.
|
Set yylval and return the token type; update lexptr.
|
LEN is the number of characters in it. */
|
LEN is the number of characters in it. */
|
|
|
/*** Needs some error checking for the float case ***/
|
/*** Needs some error checking for the float case ***/
|
|
|
static int
|
static int
|
parse_number (p, len, parsed_float, putithere)
|
parse_number (p, len, parsed_float, putithere)
|
register char *p;
|
register char *p;
|
register int len;
|
register int len;
|
int parsed_float;
|
int parsed_float;
|
YYSTYPE *putithere;
|
YYSTYPE *putithere;
|
{
|
{
|
/* FIXME: Shouldn't these be unsigned? We don't deal with negative values
|
/* FIXME: Shouldn't these be unsigned? We don't deal with negative values
|
here, and we do kind of silly things like cast to unsigned. */
|
here, and we do kind of silly things like cast to unsigned. */
|
register LONGEST n = 0;
|
register LONGEST n = 0;
|
register LONGEST prevn = 0;
|
register LONGEST prevn = 0;
|
ULONGEST un;
|
ULONGEST un;
|
|
|
register int i = 0;
|
register int i = 0;
|
register int c;
|
register int c;
|
register int base = input_radix;
|
register int base = input_radix;
|
int unsigned_p = 0;
|
int unsigned_p = 0;
|
|
|
/* Number of "L" suffixes encountered. */
|
/* Number of "L" suffixes encountered. */
|
int long_p = 0;
|
int long_p = 0;
|
|
|
/* We have found a "L" or "U" suffix. */
|
/* We have found a "L" or "U" suffix. */
|
int found_suffix = 0;
|
int found_suffix = 0;
|
|
|
ULONGEST high_bit;
|
ULONGEST high_bit;
|
struct type *signed_type;
|
struct type *signed_type;
|
struct type *unsigned_type;
|
struct type *unsigned_type;
|
|
|
if (parsed_float)
|
if (parsed_float)
|
{
|
{
|
/* It's a float since it contains a point or an exponent. */
|
/* It's a float since it contains a point or an exponent. */
|
char c;
|
char c;
|
int num = 0; /* number of tokens scanned by scanf */
|
int num = 0; /* number of tokens scanned by scanf */
|
char saved_char = p[len];
|
char saved_char = p[len];
|
|
|
p[len] = 0; /* null-terminate the token */
|
p[len] = 0; /* null-terminate the token */
|
if (sizeof (putithere->typed_val_float.dval) <= sizeof (float))
|
if (sizeof (putithere->typed_val_float.dval) <= sizeof (float))
|
num = sscanf (p, "%g%c", (float *) &putithere->typed_val_float.dval,&c);
|
num = sscanf (p, "%g%c", (float *) &putithere->typed_val_float.dval,&c);
|
else if (sizeof (putithere->typed_val_float.dval) <= sizeof (double))
|
else if (sizeof (putithere->typed_val_float.dval) <= sizeof (double))
|
num = sscanf (p, "%lg%c", (double *) &putithere->typed_val_float.dval,&c);
|
num = sscanf (p, "%lg%c", (double *) &putithere->typed_val_float.dval,&c);
|
else
|
else
|
{
|
{
|
#ifdef SCANF_HAS_LONG_DOUBLE
|
#ifdef SCANF_HAS_LONG_DOUBLE
|
num = sscanf (p, "%Lg%c", &putithere->typed_val_float.dval,&c);
|
num = sscanf (p, "%Lg%c", &putithere->typed_val_float.dval,&c);
|
#else
|
#else
|
/* Scan it into a double, then assign it to the long double.
|
/* Scan it into a double, then assign it to the long double.
|
This at least wins with values representable in the range
|
This at least wins with values representable in the range
|
of doubles. */
|
of doubles. */
|
double temp;
|
double temp;
|
num = sscanf (p, "%lg%c", &temp,&c);
|
num = sscanf (p, "%lg%c", &temp,&c);
|
putithere->typed_val_float.dval = temp;
|
putithere->typed_val_float.dval = temp;
|
#endif
|
#endif
|
}
|
}
|
p[len] = saved_char; /* restore the input stream */
|
p[len] = saved_char; /* restore the input stream */
|
if (num != 1) /* check scanf found ONLY a float ... */
|
if (num != 1) /* check scanf found ONLY a float ... */
|
return ERROR;
|
return ERROR;
|
/* See if it has `f' or `l' suffix (float or long double). */
|
/* See if it has `f' or `l' suffix (float or long double). */
|
|
|
c = tolower (p[len - 1]);
|
c = tolower (p[len - 1]);
|
|
|
if (c == 'f')
|
if (c == 'f')
|
putithere->typed_val_float.type = builtin_type_float;
|
putithere->typed_val_float.type = builtin_type_float;
|
else if (c == 'l')
|
else if (c == 'l')
|
putithere->typed_val_float.type = builtin_type_long_double;
|
putithere->typed_val_float.type = builtin_type_long_double;
|
else if (isdigit (c) || c == '.')
|
else if (isdigit (c) || c == '.')
|
putithere->typed_val_float.type = builtin_type_double;
|
putithere->typed_val_float.type = builtin_type_double;
|
else
|
else
|
return ERROR;
|
return ERROR;
|
|
|
return FLOAT;
|
return FLOAT;
|
}
|
}
|
|
|
/* Handle base-switching prefixes 0x, 0t, 0d, 0 */
|
/* Handle base-switching prefixes 0x, 0t, 0d, 0 */
|
if (p[0] == '0')
|
if (p[0] == '0')
|
switch (p[1])
|
switch (p[1])
|
{
|
{
|
case 'x':
|
case 'x':
|
case 'X':
|
case 'X':
|
if (len >= 3)
|
if (len >= 3)
|
{
|
{
|
p += 2;
|
p += 2;
|
base = 16;
|
base = 16;
|
len -= 2;
|
len -= 2;
|
}
|
}
|
break;
|
break;
|
|
|
case 't':
|
case 't':
|
case 'T':
|
case 'T':
|
case 'd':
|
case 'd':
|
case 'D':
|
case 'D':
|
if (len >= 3)
|
if (len >= 3)
|
{
|
{
|
p += 2;
|
p += 2;
|
base = 10;
|
base = 10;
|
len -= 2;
|
len -= 2;
|
}
|
}
|
break;
|
break;
|
|
|
default:
|
default:
|
base = 8;
|
base = 8;
|
break;
|
break;
|
}
|
}
|
|
|
while (len-- > 0)
|
while (len-- > 0)
|
{
|
{
|
c = *p++;
|
c = *p++;
|
if (c >= 'A' && c <= 'Z')
|
if (c >= 'A' && c <= 'Z')
|
c += 'a' - 'A';
|
c += 'a' - 'A';
|
if (c != 'l' && c != 'u')
|
if (c != 'l' && c != 'u')
|
n *= base;
|
n *= base;
|
if (c >= '0' && c <= '9')
|
if (c >= '0' && c <= '9')
|
{
|
{
|
if (found_suffix)
|
if (found_suffix)
|
return ERROR;
|
return ERROR;
|
n += i = c - '0';
|
n += i = c - '0';
|
}
|
}
|
else
|
else
|
{
|
{
|
if (base > 10 && c >= 'a' && c <= 'f')
|
if (base > 10 && c >= 'a' && c <= 'f')
|
{
|
{
|
if (found_suffix)
|
if (found_suffix)
|
return ERROR;
|
return ERROR;
|
n += i = c - 'a' + 10;
|
n += i = c - 'a' + 10;
|
}
|
}
|
else if (c == 'l')
|
else if (c == 'l')
|
{
|
{
|
++long_p;
|
++long_p;
|
found_suffix = 1;
|
found_suffix = 1;
|
}
|
}
|
else if (c == 'u')
|
else if (c == 'u')
|
{
|
{
|
unsigned_p = 1;
|
unsigned_p = 1;
|
found_suffix = 1;
|
found_suffix = 1;
|
}
|
}
|
else
|
else
|
return ERROR; /* Char not a digit */
|
return ERROR; /* Char not a digit */
|
}
|
}
|
if (i >= base)
|
if (i >= base)
|
return ERROR; /* Invalid digit in this base */
|
return ERROR; /* Invalid digit in this base */
|
|
|
/* Portably test for overflow (only works for nonzero values, so make
|
/* Portably test for overflow (only works for nonzero values, so make
|
a second check for zero). FIXME: Can't we just make n and prevn
|
a second check for zero). FIXME: Can't we just make n and prevn
|
unsigned and avoid this? */
|
unsigned and avoid this? */
|
if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
|
if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
|
unsigned_p = 1; /* Try something unsigned */
|
unsigned_p = 1; /* Try something unsigned */
|
|
|
/* Portably test for unsigned overflow.
|
/* Portably test for unsigned overflow.
|
FIXME: This check is wrong; for example it doesn't find overflow
|
FIXME: This check is wrong; for example it doesn't find overflow
|
on 0x123456789 when LONGEST is 32 bits. */
|
on 0x123456789 when LONGEST is 32 bits. */
|
if (c != 'l' && c != 'u' && n != 0)
|
if (c != 'l' && c != 'u' && n != 0)
|
{
|
{
|
if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
|
if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
|
error ("Numeric constant too large.");
|
error ("Numeric constant too large.");
|
}
|
}
|
prevn = n;
|
prevn = n;
|
}
|
}
|
|
|
/* An integer constant is an int, a long, or a long long. An L
|
/* An integer constant is an int, a long, or a long long. An L
|
suffix forces it to be long; an LL suffix forces it to be long
|
suffix forces it to be long; an LL suffix forces it to be long
|
long. If not forced to a larger size, it gets the first type of
|
long. If not forced to a larger size, it gets the first type of
|
the above that it fits in. To figure out whether it fits, we
|
the above that it fits in. To figure out whether it fits, we
|
shift it right and see whether anything remains. Note that we
|
shift it right and see whether anything remains. Note that we
|
can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
|
can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
|
operation, because many compilers will warn about such a shift
|
operation, because many compilers will warn about such a shift
|
(which always produces a zero result). Sometimes TARGET_INT_BIT
|
(which always produces a zero result). Sometimes TARGET_INT_BIT
|
or TARGET_LONG_BIT will be that big, sometimes not. To deal with
|
or TARGET_LONG_BIT will be that big, sometimes not. To deal with
|
the case where it is we just always shift the value more than
|
the case where it is we just always shift the value more than
|
once, with fewer bits each time. */
|
once, with fewer bits each time. */
|
|
|
un = (ULONGEST)n >> 2;
|
un = (ULONGEST)n >> 2;
|
if (long_p == 0
|
if (long_p == 0
|
&& (un >> (TARGET_INT_BIT - 2)) == 0)
|
&& (un >> (TARGET_INT_BIT - 2)) == 0)
|
{
|
{
|
high_bit = ((ULONGEST)1) << (TARGET_INT_BIT-1);
|
high_bit = ((ULONGEST)1) << (TARGET_INT_BIT-1);
|
|
|
/* A large decimal (not hex or octal) constant (between INT_MAX
|
/* A large decimal (not hex or octal) constant (between INT_MAX
|
and UINT_MAX) is a long or unsigned long, according to ANSI,
|
and UINT_MAX) is a long or unsigned long, according to ANSI,
|
never an unsigned int, but this code treats it as unsigned
|
never an unsigned int, but this code treats it as unsigned
|
int. This probably should be fixed. GCC gives a warning on
|
int. This probably should be fixed. GCC gives a warning on
|
such constants. */
|
such constants. */
|
|
|
unsigned_type = builtin_type_unsigned_int;
|
unsigned_type = builtin_type_unsigned_int;
|
signed_type = builtin_type_int;
|
signed_type = builtin_type_int;
|
}
|
}
|
else if (long_p <= 1
|
else if (long_p <= 1
|
&& (un >> (TARGET_LONG_BIT - 2)) == 0)
|
&& (un >> (TARGET_LONG_BIT - 2)) == 0)
|
{
|
{
|
high_bit = ((ULONGEST)1) << (TARGET_LONG_BIT-1);
|
high_bit = ((ULONGEST)1) << (TARGET_LONG_BIT-1);
|
unsigned_type = builtin_type_unsigned_long;
|
unsigned_type = builtin_type_unsigned_long;
|
signed_type = builtin_type_long;
|
signed_type = builtin_type_long;
|
}
|
}
|
else
|
else
|
{
|
{
|
int shift;
|
int shift;
|
if (sizeof (ULONGEST) * HOST_CHAR_BIT < TARGET_LONG_LONG_BIT)
|
if (sizeof (ULONGEST) * HOST_CHAR_BIT < TARGET_LONG_LONG_BIT)
|
/* A long long does not fit in a LONGEST. */
|
/* A long long does not fit in a LONGEST. */
|
shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
|
shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
|
else
|
else
|
shift = (TARGET_LONG_LONG_BIT - 1);
|
shift = (TARGET_LONG_LONG_BIT - 1);
|
high_bit = (ULONGEST) 1 << shift;
|
high_bit = (ULONGEST) 1 << shift;
|
unsigned_type = builtin_type_unsigned_long_long;
|
unsigned_type = builtin_type_unsigned_long_long;
|
signed_type = builtin_type_long_long;
|
signed_type = builtin_type_long_long;
|
}
|
}
|
|
|
putithere->typed_val_int.val = n;
|
putithere->typed_val_int.val = n;
|
|
|
/* If the high bit of the worked out type is set then this number
|
/* If the high bit of the worked out type is set then this number
|
has to be unsigned. */
|
has to be unsigned. */
|
|
|
if (unsigned_p || (n & high_bit))
|
if (unsigned_p || (n & high_bit))
|
{
|
{
|
putithere->typed_val_int.type = unsigned_type;
|
putithere->typed_val_int.type = unsigned_type;
|
}
|
}
|
else
|
else
|
{
|
{
|
putithere->typed_val_int.type = signed_type;
|
putithere->typed_val_int.type = signed_type;
|
}
|
}
|
|
|
return INT;
|
return INT;
|
}
|
}
|
|
|
struct token
|
struct token
|
{
|
{
|
char *operator;
|
char *operator;
|
int token;
|
int token;
|
enum exp_opcode opcode;
|
enum exp_opcode opcode;
|
};
|
};
|
|
|
static const struct token tokentab3[] =
|
static const struct token tokentab3[] =
|
{
|
{
|
{">>=", ASSIGN_MODIFY, BINOP_RSH},
|
{">>=", ASSIGN_MODIFY, BINOP_RSH},
|
{"<<=", ASSIGN_MODIFY, BINOP_LSH}
|
{"<<=", ASSIGN_MODIFY, BINOP_LSH}
|
};
|
};
|
|
|
static const struct token tokentab2[] =
|
static const struct token tokentab2[] =
|
{
|
{
|
{"+=", ASSIGN_MODIFY, BINOP_ADD},
|
{"+=", ASSIGN_MODIFY, BINOP_ADD},
|
{"-=", ASSIGN_MODIFY, BINOP_SUB},
|
{"-=", ASSIGN_MODIFY, BINOP_SUB},
|
{"*=", ASSIGN_MODIFY, BINOP_MUL},
|
{"*=", ASSIGN_MODIFY, BINOP_MUL},
|
{"/=", ASSIGN_MODIFY, BINOP_DIV},
|
{"/=", ASSIGN_MODIFY, BINOP_DIV},
|
{"%=", ASSIGN_MODIFY, BINOP_REM},
|
{"%=", ASSIGN_MODIFY, BINOP_REM},
|
{"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR},
|
{"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR},
|
{"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND},
|
{"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND},
|
{"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR},
|
{"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR},
|
{"++", INCREMENT, BINOP_END},
|
{"++", INCREMENT, BINOP_END},
|
{"--", DECREMENT, BINOP_END},
|
{"--", DECREMENT, BINOP_END},
|
{"->", ARROW, BINOP_END},
|
{"->", ARROW, BINOP_END},
|
{"&&", ANDAND, BINOP_END},
|
{"&&", ANDAND, BINOP_END},
|
{"||", OROR, BINOP_END},
|
{"||", OROR, BINOP_END},
|
{"::", COLONCOLON, BINOP_END},
|
{"::", COLONCOLON, BINOP_END},
|
{"<<", LSH, BINOP_END},
|
{"<<", LSH, BINOP_END},
|
{">>", RSH, BINOP_END},
|
{">>", RSH, BINOP_END},
|
{"==", EQUAL, BINOP_END},
|
{"==", EQUAL, BINOP_END},
|
{"!=", NOTEQUAL, BINOP_END},
|
{"!=", NOTEQUAL, BINOP_END},
|
{"<=", LEQ, BINOP_END},
|
{"<=", LEQ, BINOP_END},
|
{">=", GEQ, BINOP_END}
|
{">=", GEQ, BINOP_END}
|
};
|
};
|
|
|
/* Read one token, getting characters through lexptr. */
|
/* Read one token, getting characters through lexptr. */
|
|
|
static int
|
static int
|
yylex ()
|
yylex ()
|
{
|
{
|
int c;
|
int c;
|
int namelen;
|
int namelen;
|
unsigned int i;
|
unsigned int i;
|
char *tokstart;
|
char *tokstart;
|
char *tokptr;
|
char *tokptr;
|
int tempbufindex;
|
int tempbufindex;
|
static char *tempbuf;
|
static char *tempbuf;
|
static int tempbufsize;
|
static int tempbufsize;
|
struct symbol * sym_class = NULL;
|
struct symbol * sym_class = NULL;
|
char * token_string = NULL;
|
char * token_string = NULL;
|
int class_prefix = 0;
|
int class_prefix = 0;
|
int unquoted_expr;
|
int unquoted_expr;
|
|
|
retry:
|
retry:
|
|
|
unquoted_expr = 1;
|
unquoted_expr = 1;
|
|
|
tokstart = lexptr;
|
tokstart = lexptr;
|
/* See if it is a special token of length 3. */
|
/* See if it is a special token of length 3. */
|
for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
|
for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
|
if (STREQN (tokstart, tokentab3[i].operator, 3))
|
if (STREQN (tokstart, tokentab3[i].operator, 3))
|
{
|
{
|
lexptr += 3;
|
lexptr += 3;
|
yylval.opcode = tokentab3[i].opcode;
|
yylval.opcode = tokentab3[i].opcode;
|
return tokentab3[i].token;
|
return tokentab3[i].token;
|
}
|
}
|
|
|
/* See if it is a special token of length 2. */
|
/* See if it is a special token of length 2. */
|
for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
|
for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
|
if (STREQN (tokstart, tokentab2[i].operator, 2))
|
if (STREQN (tokstart, tokentab2[i].operator, 2))
|
{
|
{
|
lexptr += 2;
|
lexptr += 2;
|
yylval.opcode = tokentab2[i].opcode;
|
yylval.opcode = tokentab2[i].opcode;
|
return tokentab2[i].token;
|
return tokentab2[i].token;
|
}
|
}
|
|
|
switch (c = *tokstart)
|
switch (c = *tokstart)
|
{
|
{
|
case 0:
|
case 0:
|
return 0;
|
return 0;
|
|
|
case ' ':
|
case ' ':
|
case '\t':
|
case '\t':
|
case '\n':
|
case '\n':
|
lexptr++;
|
lexptr++;
|
goto retry;
|
goto retry;
|
|
|
case '\'':
|
case '\'':
|
/* We either have a character constant ('0' or '\177' for example)
|
/* We either have a character constant ('0' or '\177' for example)
|
or we have a quoted symbol reference ('foo(int,int)' in C++
|
or we have a quoted symbol reference ('foo(int,int)' in C++
|
for example). */
|
for example). */
|
lexptr++;
|
lexptr++;
|
c = *lexptr++;
|
c = *lexptr++;
|
if (c == '\\')
|
if (c == '\\')
|
c = parse_escape (&lexptr);
|
c = parse_escape (&lexptr);
|
else if (c == '\'')
|
else if (c == '\'')
|
error ("Empty character constant.");
|
error ("Empty character constant.");
|
|
|
yylval.typed_val_int.val = c;
|
yylval.typed_val_int.val = c;
|
yylval.typed_val_int.type = builtin_type_char;
|
yylval.typed_val_int.type = builtin_type_char;
|
|
|
c = *lexptr++;
|
c = *lexptr++;
|
if (c != '\'')
|
if (c != '\'')
|
{
|
{
|
namelen = skip_quoted (tokstart) - tokstart;
|
namelen = skip_quoted (tokstart) - tokstart;
|
if (namelen > 2)
|
if (namelen > 2)
|
{
|
{
|
lexptr = tokstart + namelen;
|
lexptr = tokstart + namelen;
|
unquoted_expr = 0;
|
unquoted_expr = 0;
|
if (lexptr[-1] != '\'')
|
if (lexptr[-1] != '\'')
|
error ("Unmatched single quote.");
|
error ("Unmatched single quote.");
|
namelen -= 2;
|
namelen -= 2;
|
tokstart++;
|
tokstart++;
|
goto tryname;
|
goto tryname;
|
}
|
}
|
error ("Invalid character constant.");
|
error ("Invalid character constant.");
|
}
|
}
|
return INT;
|
return INT;
|
|
|
case '(':
|
case '(':
|
paren_depth++;
|
paren_depth++;
|
lexptr++;
|
lexptr++;
|
return c;
|
return c;
|
|
|
case ')':
|
case ')':
|
if (paren_depth == 0)
|
if (paren_depth == 0)
|
return 0;
|
return 0;
|
paren_depth--;
|
paren_depth--;
|
lexptr++;
|
lexptr++;
|
return c;
|
return c;
|
|
|
case ',':
|
case ',':
|
if (comma_terminates && paren_depth == 0)
|
if (comma_terminates && paren_depth == 0)
|
return 0;
|
return 0;
|
lexptr++;
|
lexptr++;
|
return c;
|
return c;
|
|
|
case '.':
|
case '.':
|
/* Might be a floating point number. */
|
/* Might be a floating point number. */
|
if (lexptr[1] < '0' || lexptr[1] > '9')
|
if (lexptr[1] < '0' || lexptr[1] > '9')
|
goto symbol; /* Nope, must be a symbol. */
|
goto symbol; /* Nope, must be a symbol. */
|
/* FALL THRU into number case. */
|
/* FALL THRU into number case. */
|
|
|
case '0':
|
case '0':
|
case '1':
|
case '1':
|
case '2':
|
case '2':
|
case '3':
|
case '3':
|
case '4':
|
case '4':
|
case '5':
|
case '5':
|
case '6':
|
case '6':
|
case '7':
|
case '7':
|
case '8':
|
case '8':
|
case '9':
|
case '9':
|
{
|
{
|
/* It's a number. */
|
/* It's a number. */
|
int got_dot = 0, got_e = 0, toktype;
|
int got_dot = 0, got_e = 0, toktype;
|
register char *p = tokstart;
|
register char *p = tokstart;
|
int hex = input_radix > 10;
|
int hex = input_radix > 10;
|
|
|
if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
|
if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
|
{
|
{
|
p += 2;
|
p += 2;
|
hex = 1;
|
hex = 1;
|
}
|
}
|
else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
|
else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
|
{
|
{
|
p += 2;
|
p += 2;
|
hex = 0;
|
hex = 0;
|
}
|
}
|
|
|
for (;; ++p)
|
for (;; ++p)
|
{
|
{
|
/* This test includes !hex because 'e' is a valid hex digit
|
/* This test includes !hex because 'e' is a valid hex digit
|
and thus does not indicate a floating point number when
|
and thus does not indicate a floating point number when
|
the radix is hex. */
|
the radix is hex. */
|
if (!hex && !got_e && (*p == 'e' || *p == 'E'))
|
if (!hex && !got_e && (*p == 'e' || *p == 'E'))
|
got_dot = got_e = 1;
|
got_dot = got_e = 1;
|
/* This test does not include !hex, because a '.' always indicates
|
/* This test does not include !hex, because a '.' always indicates
|
a decimal floating point number regardless of the radix. */
|
a decimal floating point number regardless of the radix. */
|
else if (!got_dot && *p == '.')
|
else if (!got_dot && *p == '.')
|
got_dot = 1;
|
got_dot = 1;
|
else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
|
else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
|
&& (*p == '-' || *p == '+'))
|
&& (*p == '-' || *p == '+'))
|
/* This is the sign of the exponent, not the end of the
|
/* This is the sign of the exponent, not the end of the
|
number. */
|
number. */
|
continue;
|
continue;
|
/* We will take any letters or digits. parse_number will
|
/* We will take any letters or digits. parse_number will
|
complain if past the radix, or if L or U are not final. */
|
complain if past the radix, or if L or U are not final. */
|
else if ((*p < '0' || *p > '9')
|
else if ((*p < '0' || *p > '9')
|
&& ((*p < 'a' || *p > 'z')
|
&& ((*p < 'a' || *p > 'z')
|
&& (*p < 'A' || *p > 'Z')))
|
&& (*p < 'A' || *p > 'Z')))
|
break;
|
break;
|
}
|
}
|
toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval);
|
toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval);
|
if (toktype == ERROR)
|
if (toktype == ERROR)
|
{
|
{
|
char *err_copy = (char *) alloca (p - tokstart + 1);
|
char *err_copy = (char *) alloca (p - tokstart + 1);
|
|
|
memcpy (err_copy, tokstart, p - tokstart);
|
memcpy (err_copy, tokstart, p - tokstart);
|
err_copy[p - tokstart] = 0;
|
err_copy[p - tokstart] = 0;
|
error ("Invalid number \"%s\".", err_copy);
|
error ("Invalid number \"%s\".", err_copy);
|
}
|
}
|
lexptr = p;
|
lexptr = p;
|
return toktype;
|
return toktype;
|
}
|
}
|
|
|
case '+':
|
case '+':
|
case '-':
|
case '-':
|
case '*':
|
case '*':
|
case '/':
|
case '/':
|
case '%':
|
case '%':
|
case '|':
|
case '|':
|
case '&':
|
case '&':
|
case '^':
|
case '^':
|
case '~':
|
case '~':
|
case '!':
|
case '!':
|
case '@':
|
case '@':
|
case '<':
|
case '<':
|
case '>':
|
case '>':
|
case '[':
|
case '[':
|
case ']':
|
case ']':
|
case '?':
|
case '?':
|
case ':':
|
case ':':
|
case '=':
|
case '=':
|
case '{':
|
case '{':
|
case '}':
|
case '}':
|
symbol:
|
symbol:
|
lexptr++;
|
lexptr++;
|
return c;
|
return c;
|
|
|
case '"':
|
case '"':
|
|
|
/* Build the gdb internal form of the input string in tempbuf,
|
/* Build the gdb internal form of the input string in tempbuf,
|
translating any standard C escape forms seen. Note that the
|
translating any standard C escape forms seen. Note that the
|
buffer is null byte terminated *only* for the convenience of
|
buffer is null byte terminated *only* for the convenience of
|
debugging gdb itself and printing the buffer contents when
|
debugging gdb itself and printing the buffer contents when
|
the buffer contains no embedded nulls. Gdb does not depend
|
the buffer contains no embedded nulls. Gdb does not depend
|
upon the buffer being null byte terminated, it uses the length
|
upon the buffer being null byte terminated, it uses the length
|
string instead. This allows gdb to handle C strings (as well
|
string instead. This allows gdb to handle C strings (as well
|
as strings in other languages) with embedded null bytes */
|
as strings in other languages) with embedded null bytes */
|
|
|
tokptr = ++tokstart;
|
tokptr = ++tokstart;
|
tempbufindex = 0;
|
tempbufindex = 0;
|
|
|
do {
|
do {
|
/* Grow the static temp buffer if necessary, including allocating
|
/* Grow the static temp buffer if necessary, including allocating
|
the first one on demand. */
|
the first one on demand. */
|
if (tempbufindex + 1 >= tempbufsize)
|
if (tempbufindex + 1 >= tempbufsize)
|
{
|
{
|
tempbuf = (char *) realloc (tempbuf, tempbufsize += 64);
|
tempbuf = (char *) realloc (tempbuf, tempbufsize += 64);
|
}
|
}
|
switch (*tokptr)
|
switch (*tokptr)
|
{
|
{
|
case '\0':
|
case '\0':
|
case '"':
|
case '"':
|
/* Do nothing, loop will terminate. */
|
/* Do nothing, loop will terminate. */
|
break;
|
break;
|
case '\\':
|
case '\\':
|
tokptr++;
|
tokptr++;
|
c = parse_escape (&tokptr);
|
c = parse_escape (&tokptr);
|
if (c == -1)
|
if (c == -1)
|
{
|
{
|
continue;
|
continue;
|
}
|
}
|
tempbuf[tempbufindex++] = c;
|
tempbuf[tempbufindex++] = c;
|
break;
|
break;
|
default:
|
default:
|
tempbuf[tempbufindex++] = *tokptr++;
|
tempbuf[tempbufindex++] = *tokptr++;
|
break;
|
break;
|
}
|
}
|
} while ((*tokptr != '"') && (*tokptr != '\0'));
|
} while ((*tokptr != '"') && (*tokptr != '\0'));
|
if (*tokptr++ != '"')
|
if (*tokptr++ != '"')
|
{
|
{
|
error ("Unterminated string in expression.");
|
error ("Unterminated string in expression.");
|
}
|
}
|
tempbuf[tempbufindex] = '\0'; /* See note above */
|
tempbuf[tempbufindex] = '\0'; /* See note above */
|
yylval.sval.ptr = tempbuf;
|
yylval.sval.ptr = tempbuf;
|
yylval.sval.length = tempbufindex;
|
yylval.sval.length = tempbufindex;
|
lexptr = tokptr;
|
lexptr = tokptr;
|
return (STRING);
|
return (STRING);
|
}
|
}
|
|
|
if (!(c == '_' || c == '$'
|
if (!(c == '_' || c == '$'
|
|| (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
|
|| (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
|
/* We must have come across a bad character (e.g. ';'). */
|
/* We must have come across a bad character (e.g. ';'). */
|
error ("Invalid character '%c' in expression.", c);
|
error ("Invalid character '%c' in expression.", c);
|
|
|
/* It's a name. See how long it is. */
|
/* It's a name. See how long it is. */
|
namelen = 0;
|
namelen = 0;
|
for (c = tokstart[namelen];
|
for (c = tokstart[namelen];
|
(c == '_' || c == '$' || (c >= '0' && c <= '9')
|
(c == '_' || c == '$' || (c >= '0' && c <= '9')
|
|| (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
|
|| (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
|
{
|
{
|
/* Template parameter lists are part of the name.
|
/* Template parameter lists are part of the name.
|
FIXME: This mishandles `print $a<4&&$a>3'. */
|
FIXME: This mishandles `print $a<4&&$a>3'. */
|
|
|
if (c == '<')
|
if (c == '<')
|
{
|
{
|
if (hp_som_som_object_present)
|
if (hp_som_som_object_present)
|
{
|
{
|
/* Scan ahead to get rest of the template specification. Note
|
/* Scan ahead to get rest of the template specification. Note
|
that we look ahead only when the '<' adjoins non-whitespace
|
that we look ahead only when the '<' adjoins non-whitespace
|
characters; for comparison expressions, e.g. "a < b > c",
|
characters; for comparison expressions, e.g. "a < b > c",
|
there must be spaces before the '<', etc. */
|
there must be spaces before the '<', etc. */
|
|
|
char * p = find_template_name_end (tokstart + namelen);
|
char * p = find_template_name_end (tokstart + namelen);
|
if (p)
|
if (p)
|
namelen = p - tokstart;
|
namelen = p - tokstart;
|
break;
|
break;
|
}
|
}
|
else
|
else
|
{
|
{
|
int i = namelen;
|
int i = namelen;
|
int nesting_level = 1;
|
int nesting_level = 1;
|
while (tokstart[++i])
|
while (tokstart[++i])
|
{
|
{
|
if (tokstart[i] == '<')
|
if (tokstart[i] == '<')
|
nesting_level++;
|
nesting_level++;
|
else if (tokstart[i] == '>')
|
else if (tokstart[i] == '>')
|
{
|
{
|
if (--nesting_level == 0)
|
if (--nesting_level == 0)
|
break;
|
break;
|
}
|
}
|
}
|
}
|
if (tokstart[i] == '>')
|
if (tokstart[i] == '>')
|
namelen = i;
|
namelen = i;
|
else
|
else
|
break;
|
break;
|
}
|
}
|
}
|
}
|
c = tokstart[++namelen];
|
c = tokstart[++namelen];
|
}
|
}
|
|
|
/* The token "if" terminates the expression and is NOT
|
/* The token "if" terminates the expression and is NOT
|
removed from the input stream. */
|
removed from the input stream. */
|
if (namelen == 2 && tokstart[0] == 'i' && tokstart[1] == 'f')
|
if (namelen == 2 && tokstart[0] == 'i' && tokstart[1] == 'f')
|
{
|
{
|
return 0;
|
return 0;
|
}
|
}
|
|
|
lexptr += namelen;
|
lexptr += namelen;
|
|
|
tryname:
|
tryname:
|
|
|
/* Catch specific keywords. Should be done with a data structure. */
|
/* Catch specific keywords. Should be done with a data structure. */
|
switch (namelen)
|
switch (namelen)
|
{
|
{
|
case 8:
|
case 8:
|
if (STREQN (tokstart, "unsigned", 8))
|
if (STREQN (tokstart, "unsigned", 8))
|
return UNSIGNED;
|
return UNSIGNED;
|
if (current_language->la_language == language_cplus
|
if (current_language->la_language == language_cplus
|
&& STREQN (tokstart, "template", 8))
|
&& STREQN (tokstart, "template", 8))
|
return TEMPLATE;
|
return TEMPLATE;
|
if (STREQN (tokstart, "volatile", 8))
|
if (STREQN (tokstart, "volatile", 8))
|
return VOLATILE_KEYWORD;
|
return VOLATILE_KEYWORD;
|
break;
|
break;
|
case 6:
|
case 6:
|
if (STREQN (tokstart, "struct", 6))
|
if (STREQN (tokstart, "struct", 6))
|
return STRUCT;
|
return STRUCT;
|
if (STREQN (tokstart, "signed", 6))
|
if (STREQN (tokstart, "signed", 6))
|
return SIGNED_KEYWORD;
|
return SIGNED_KEYWORD;
|
if (STREQN (tokstart, "sizeof", 6))
|
if (STREQN (tokstart, "sizeof", 6))
|
return SIZEOF;
|
return SIZEOF;
|
if (STREQN (tokstart, "double", 6))
|
if (STREQN (tokstart, "double", 6))
|
return DOUBLE_KEYWORD;
|
return DOUBLE_KEYWORD;
|
break;
|
break;
|
case 5:
|
case 5:
|
if (current_language->la_language == language_cplus)
|
if (current_language->la_language == language_cplus)
|
{
|
{
|
if (STREQN (tokstart, "false", 5))
|
if (STREQN (tokstart, "false", 5))
|
return FALSEKEYWORD;
|
return FALSEKEYWORD;
|
if (STREQN (tokstart, "class", 5))
|
if (STREQN (tokstart, "class", 5))
|
return CLASS;
|
return CLASS;
|
}
|
}
|
if (STREQN (tokstart, "union", 5))
|
if (STREQN (tokstart, "union", 5))
|
return UNION;
|
return UNION;
|
if (STREQN (tokstart, "short", 5))
|
if (STREQN (tokstart, "short", 5))
|
return SHORT;
|
return SHORT;
|
if (STREQN (tokstart, "const", 5))
|
if (STREQN (tokstart, "const", 5))
|
return CONST_KEYWORD;
|
return CONST_KEYWORD;
|
break;
|
break;
|
case 4:
|
case 4:
|
if (STREQN (tokstart, "enum", 4))
|
if (STREQN (tokstart, "enum", 4))
|
return ENUM;
|
return ENUM;
|
if (STREQN (tokstart, "long", 4))
|
if (STREQN (tokstart, "long", 4))
|
return LONG;
|
return LONG;
|
if (current_language->la_language == language_cplus)
|
if (current_language->la_language == language_cplus)
|
{
|
{
|
if (STREQN (tokstart, "true", 4))
|
if (STREQN (tokstart, "true", 4))
|
return TRUEKEYWORD;
|
return TRUEKEYWORD;
|
|
|
if (STREQN (tokstart, "this", 4))
|
if (STREQN (tokstart, "this", 4))
|
{
|
{
|
static const char this_name[] =
|
static const char this_name[] =
|
{ CPLUS_MARKER, 't', 'h', 'i', 's', '\0' };
|
{ CPLUS_MARKER, 't', 'h', 'i', 's', '\0' };
|
|
|
if (lookup_symbol (this_name, expression_context_block,
|
if (lookup_symbol (this_name, expression_context_block,
|
VAR_NAMESPACE, (int *) NULL,
|
VAR_NAMESPACE, (int *) NULL,
|
(struct symtab **) NULL))
|
(struct symtab **) NULL))
|
return THIS;
|
return THIS;
|
}
|
}
|
}
|
}
|
break;
|
break;
|
case 3:
|
case 3:
|
if (STREQN (tokstart, "int", 3))
|
if (STREQN (tokstart, "int", 3))
|
return INT_KEYWORD;
|
return INT_KEYWORD;
|
break;
|
break;
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
yylval.sval.ptr = tokstart;
|
yylval.sval.ptr = tokstart;
|
yylval.sval.length = namelen;
|
yylval.sval.length = namelen;
|
|
|
if (*tokstart == '$')
|
if (*tokstart == '$')
|
{
|
{
|
write_dollar_variable (yylval.sval);
|
write_dollar_variable (yylval.sval);
|
return VARIABLE;
|
return VARIABLE;
|
}
|
}
|
|
|
/* Look ahead and see if we can consume more of the input
|
/* Look ahead and see if we can consume more of the input
|
string to get a reasonable class/namespace spec or a
|
string to get a reasonable class/namespace spec or a
|
fully-qualified name. This is a kludge to get around the
|
fully-qualified name. This is a kludge to get around the
|
HP aCC compiler's generation of symbol names with embedded
|
HP aCC compiler's generation of symbol names with embedded
|
colons for namespace and nested classes. */
|
colons for namespace and nested classes. */
|
if (unquoted_expr)
|
if (unquoted_expr)
|
{
|
{
|
/* Only do it if not inside single quotes */
|
/* Only do it if not inside single quotes */
|
sym_class = parse_nested_classes_for_hpacc (yylval.sval.ptr, yylval.sval.length,
|
sym_class = parse_nested_classes_for_hpacc (yylval.sval.ptr, yylval.sval.length,
|
&token_string, &class_prefix, &lexptr);
|
&token_string, &class_prefix, &lexptr);
|
if (sym_class)
|
if (sym_class)
|
{
|
{
|
/* Replace the current token with the bigger one we found */
|
/* Replace the current token with the bigger one we found */
|
yylval.sval.ptr = token_string;
|
yylval.sval.ptr = token_string;
|
yylval.sval.length = strlen (token_string);
|
yylval.sval.length = strlen (token_string);
|
}
|
}
|
}
|
}
|
|
|
/* Use token-type BLOCKNAME for symbols that happen to be defined as
|
/* Use token-type BLOCKNAME for symbols that happen to be defined as
|
functions or symtabs. If this is not so, then ...
|
functions or symtabs. If this is not so, then ...
|
Use token-type TYPENAME for symbols that happen to be defined
|
Use token-type TYPENAME for symbols that happen to be defined
|
currently as names of types; NAME for other symbols.
|
currently as names of types; NAME for other symbols.
|
The caller is not constrained to care about the distinction. */
|
The caller is not constrained to care about the distinction. */
|
{
|
{
|
char *tmp = copy_name (yylval.sval);
|
char *tmp = copy_name (yylval.sval);
|
struct symbol *sym;
|
struct symbol *sym;
|
int is_a_field_of_this = 0;
|
int is_a_field_of_this = 0;
|
int hextype;
|
int hextype;
|
|
|
sym = lookup_symbol (tmp, expression_context_block,
|
sym = lookup_symbol (tmp, expression_context_block,
|
VAR_NAMESPACE,
|
VAR_NAMESPACE,
|
current_language->la_language == language_cplus
|
current_language->la_language == language_cplus
|
? &is_a_field_of_this : (int *) NULL,
|
? &is_a_field_of_this : (int *) NULL,
|
(struct symtab **) NULL);
|
(struct symtab **) NULL);
|
/* Call lookup_symtab, not lookup_partial_symtab, in case there are
|
/* Call lookup_symtab, not lookup_partial_symtab, in case there are
|
no psymtabs (coff, xcoff, or some future change to blow away the
|
no psymtabs (coff, xcoff, or some future change to blow away the
|
psymtabs once once symbols are read). */
|
psymtabs once once symbols are read). */
|
if (sym && SYMBOL_CLASS (sym) == LOC_BLOCK)
|
if (sym && SYMBOL_CLASS (sym) == LOC_BLOCK)
|
{
|
{
|
yylval.ssym.sym = sym;
|
yylval.ssym.sym = sym;
|
yylval.ssym.is_a_field_of_this = is_a_field_of_this;
|
yylval.ssym.is_a_field_of_this = is_a_field_of_this;
|
return BLOCKNAME;
|
return BLOCKNAME;
|
}
|
}
|
else if (!sym)
|
else if (!sym)
|
{ /* See if it's a file name. */
|
{ /* See if it's a file name. */
|
struct symtab *symtab;
|
struct symtab *symtab;
|
|
|
symtab = lookup_symtab (tmp);
|
symtab = lookup_symtab (tmp);
|
|
|
if (symtab)
|
if (symtab)
|
{
|
{
|
yylval.bval = BLOCKVECTOR_BLOCK (BLOCKVECTOR (symtab), STATIC_BLOCK);
|
yylval.bval = BLOCKVECTOR_BLOCK (BLOCKVECTOR (symtab), STATIC_BLOCK);
|
return FILENAME;
|
return FILENAME;
|
}
|
}
|
}
|
}
|
|
|
if (sym && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
|
if (sym && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
|
{
|
{
|
#if 1
|
#if 1
|
/* Despite the following flaw, we need to keep this code enabled.
|
/* Despite the following flaw, we need to keep this code enabled.
|
Because we can get called from check_stub_method, if we don't
|
Because we can get called from check_stub_method, if we don't
|
handle nested types then it screws many operations in any
|
handle nested types then it screws many operations in any
|
program which uses nested types. */
|
program which uses nested types. */
|
/* In "A::x", if x is a member function of A and there happens
|
/* In "A::x", if x is a member function of A and there happens
|
to be a type (nested or not, since the stabs don't make that
|
to be a type (nested or not, since the stabs don't make that
|
distinction) named x, then this code incorrectly thinks we
|
distinction) named x, then this code incorrectly thinks we
|
are dealing with nested types rather than a member function. */
|
are dealing with nested types rather than a member function. */
|
|
|
char *p;
|
char *p;
|
char *namestart;
|
char *namestart;
|
struct symbol *best_sym;
|
struct symbol *best_sym;
|
|
|
/* Look ahead to detect nested types. This probably should be
|
/* Look ahead to detect nested types. This probably should be
|
done in the grammar, but trying seemed to introduce a lot
|
done in the grammar, but trying seemed to introduce a lot
|
of shift/reduce and reduce/reduce conflicts. It's possible
|
of shift/reduce and reduce/reduce conflicts. It's possible
|
that it could be done, though. Or perhaps a non-grammar, but
|
that it could be done, though. Or perhaps a non-grammar, but
|
less ad hoc, approach would work well. */
|
less ad hoc, approach would work well. */
|
|
|
/* Since we do not currently have any way of distinguishing
|
/* Since we do not currently have any way of distinguishing
|
a nested type from a non-nested one (the stabs don't tell
|
a nested type from a non-nested one (the stabs don't tell
|
us whether a type is nested), we just ignore the
|
us whether a type is nested), we just ignore the
|
containing type. */
|
containing type. */
|
|
|
p = lexptr;
|
p = lexptr;
|
best_sym = sym;
|
best_sym = sym;
|
while (1)
|
while (1)
|
{
|
{
|
/* Skip whitespace. */
|
/* Skip whitespace. */
|
while (*p == ' ' || *p == '\t' || *p == '\n')
|
while (*p == ' ' || *p == '\t' || *p == '\n')
|
++p;
|
++p;
|
if (*p == ':' && p[1] == ':')
|
if (*p == ':' && p[1] == ':')
|
{
|
{
|
/* Skip the `::'. */
|
/* Skip the `::'. */
|
p += 2;
|
p += 2;
|
/* Skip whitespace. */
|
/* Skip whitespace. */
|
while (*p == ' ' || *p == '\t' || *p == '\n')
|
while (*p == ' ' || *p == '\t' || *p == '\n')
|
++p;
|
++p;
|
namestart = p;
|
namestart = p;
|
while (*p == '_' || *p == '$' || (*p >= '0' && *p <= '9')
|
while (*p == '_' || *p == '$' || (*p >= '0' && *p <= '9')
|
|| (*p >= 'a' && *p <= 'z')
|
|| (*p >= 'a' && *p <= 'z')
|
|| (*p >= 'A' && *p <= 'Z'))
|
|| (*p >= 'A' && *p <= 'Z'))
|
++p;
|
++p;
|
if (p != namestart)
|
if (p != namestart)
|
{
|
{
|
struct symbol *cur_sym;
|
struct symbol *cur_sym;
|
/* As big as the whole rest of the expression, which is
|
/* As big as the whole rest of the expression, which is
|
at least big enough. */
|
at least big enough. */
|
char *ncopy = alloca (strlen (tmp)+strlen (namestart)+3);
|
char *ncopy = alloca (strlen (tmp)+strlen (namestart)+3);
|
char *tmp1;
|
char *tmp1;
|
|
|
tmp1 = ncopy;
|
tmp1 = ncopy;
|
memcpy (tmp1, tmp, strlen (tmp));
|
memcpy (tmp1, tmp, strlen (tmp));
|
tmp1 += strlen (tmp);
|
tmp1 += strlen (tmp);
|
memcpy (tmp1, "::", 2);
|
memcpy (tmp1, "::", 2);
|
tmp1 += 2;
|
tmp1 += 2;
|
memcpy (tmp1, namestart, p - namestart);
|
memcpy (tmp1, namestart, p - namestart);
|
tmp1[p - namestart] = '\0';
|
tmp1[p - namestart] = '\0';
|
cur_sym = lookup_symbol (ncopy, expression_context_block,
|
cur_sym = lookup_symbol (ncopy, expression_context_block,
|
VAR_NAMESPACE, (int *) NULL,
|
VAR_NAMESPACE, (int *) NULL,
|
(struct symtab **) NULL);
|
(struct symtab **) NULL);
|
if (cur_sym)
|
if (cur_sym)
|
{
|
{
|
if (SYMBOL_CLASS (cur_sym) == LOC_TYPEDEF)
|
if (SYMBOL_CLASS (cur_sym) == LOC_TYPEDEF)
|
{
|
{
|
best_sym = cur_sym;
|
best_sym = cur_sym;
|
lexptr = p;
|
lexptr = p;
|
}
|
}
|
else
|
else
|
break;
|
break;
|
}
|
}
|
else
|
else
|
break;
|
break;
|
}
|
}
|
else
|
else
|
break;
|
break;
|
}
|
}
|
else
|
else
|
break;
|
break;
|
}
|
}
|
|
|
yylval.tsym.type = SYMBOL_TYPE (best_sym);
|
yylval.tsym.type = SYMBOL_TYPE (best_sym);
|
#else /* not 0 */
|
#else /* not 0 */
|
yylval.tsym.type = SYMBOL_TYPE (sym);
|
yylval.tsym.type = SYMBOL_TYPE (sym);
|
#endif /* not 0 */
|
#endif /* not 0 */
|
return TYPENAME;
|
return TYPENAME;
|
}
|
}
|
if ((yylval.tsym.type = lookup_primitive_typename (tmp)) != 0)
|
if ((yylval.tsym.type = lookup_primitive_typename (tmp)) != 0)
|
return TYPENAME;
|
return TYPENAME;
|
|
|
/* Input names that aren't symbols but ARE valid hex numbers,
|
/* Input names that aren't symbols but ARE valid hex numbers,
|
when the input radix permits them, can be names or numbers
|
when the input radix permits them, can be names or numbers
|
depending on the parse. Note we support radixes > 16 here. */
|
depending on the parse. Note we support radixes > 16 here. */
|
if (!sym &&
|
if (!sym &&
|
((tokstart[0] >= 'a' && tokstart[0] < 'a' + input_radix - 10) ||
|
((tokstart[0] >= 'a' && tokstart[0] < 'a' + input_radix - 10) ||
|
(tokstart[0] >= 'A' && tokstart[0] < 'A' + input_radix - 10)))
|
(tokstart[0] >= 'A' && tokstart[0] < 'A' + input_radix - 10)))
|
{
|
{
|
YYSTYPE newlval; /* Its value is ignored. */
|
YYSTYPE newlval; /* Its value is ignored. */
|
hextype = parse_number (tokstart, namelen, 0, &newlval);
|
hextype = parse_number (tokstart, namelen, 0, &newlval);
|
if (hextype == INT)
|
if (hextype == INT)
|
{
|
{
|
yylval.ssym.sym = sym;
|
yylval.ssym.sym = sym;
|
yylval.ssym.is_a_field_of_this = is_a_field_of_this;
|
yylval.ssym.is_a_field_of_this = is_a_field_of_this;
|
return NAME_OR_INT;
|
return NAME_OR_INT;
|
}
|
}
|
}
|
}
|
|
|
/* Any other kind of symbol */
|
/* Any other kind of symbol */
|
yylval.ssym.sym = sym;
|
yylval.ssym.sym = sym;
|
yylval.ssym.is_a_field_of_this = is_a_field_of_this;
|
yylval.ssym.is_a_field_of_this = is_a_field_of_this;
|
return NAME;
|
return NAME;
|
}
|
}
|
}
|
}
|
|
|
void
|
void
|
yyerror (msg)
|
yyerror (msg)
|
char *msg;
|
char *msg;
|
{
|
{
|
error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr);
|
error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr);
|
}
|
}
|
|
|
