/* YACC parser for C expressions, for GDB.
|
/* YACC parser for C expressions, for GDB.
|
Copyright (C) 1986, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
|
Copyright (C) 1986, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
|
1998, 1999, 2000, 2003, 2004, 2006, 2007, 2008, 2009, 2010
|
1998, 1999, 2000, 2003, 2004, 2006, 2007, 2008, 2009, 2010
|
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 3 of the License, or
|
the Free Software Foundation; either version 3 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, see . */
|
along with this program. If not, see . */
|
|
|
/* 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 */
|
#include "charset.h"
|
#include "charset.h"
|
#include "block.h"
|
#include "block.h"
|
#include "cp-support.h"
|
#include "cp-support.h"
|
#include "dfp.h"
|
#include "dfp.h"
|
#include "gdb_assert.h"
|
#include "gdb_assert.h"
|
#include "macroscope.h"
|
#include "macroscope.h"
|
|
|
#define parse_type builtin_type (parse_gdbarch)
|
#define parse_type builtin_type (parse_gdbarch)
|
|
|
/* 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_internal
|
#define yyparse c_parse_internal
|
#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 yyname c_name /* With YYDEBUG defined */
|
#define yyname c_name /* With YYDEBUG defined */
|
#define yyrule c_rule /* With YYDEBUG defined */
|
#define yyrule c_rule /* 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 1 /* Default to yydebug support */
|
#define YYDEBUG 1 /* Default to yydebug support */
|
#endif
|
#endif
|
|
|
#define YYFPRINTF parser_fprintf
|
#define YYFPRINTF parser_fprintf
|
|
|
int yyparse (void);
|
int yyparse (void);
|
|
|
static int yylex (void);
|
static int yylex (void);
|
|
|
void yyerror (char *);
|
void yyerror (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 {
|
struct {
|
gdb_byte val[16];
|
gdb_byte val[16];
|
struct type *type;
|
struct type *type;
|
} typed_val_decfloat;
|
} typed_val_decfloat;
|
struct symbol *sym;
|
struct symbol *sym;
|
struct type *tval;
|
struct type *tval;
|
struct stoken sval;
|
struct stoken sval;
|
struct typed_stoken tsval;
|
struct typed_stoken tsval;
|
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 stoken_vector svec;
|
struct stoken_vector svec;
|
struct type **tvec;
|
struct type **tvec;
|
int *ivec;
|
int *ivec;
|
}
|
}
|
|
|
%{
|
%{
|
/* YYSTYPE gets defined by %union */
|
/* YYSTYPE gets defined by %union */
|
static int parse_number (char *, int, int, YYSTYPE *);
|
static int parse_number (char *, int, int, YYSTYPE *);
|
static struct stoken operator_stoken (const char *);
|
static struct stoken operator_stoken (const char *);
|
%}
|
%}
|
|
|
%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 qualified_type
|
%type type typebase qualified_type
|
%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
|
%token DECFLOAT
|
%token DECFLOAT
|
|
|
/* 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 CHAR
|
%token CHAR
|
%token NAME /* BLOCKNAME defined below to give it higher precedence. */
|
%token NAME /* BLOCKNAME defined below to give it higher precedence. */
|
%token COMPLETE
|
%token COMPLETE
|
%token TYPENAME
|
%token TYPENAME
|
%type name
|
%type name
|
%type string_exp
|
%type string_exp
|
%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 OPERATOR
|
%token OPERATOR
|
%token STRUCT CLASS UNION ENUM SIZEOF UNSIGNED COLONCOLON
|
%token STRUCT CLASS UNION ENUM SIZEOF UNSIGNED COLONCOLON
|
%token TEMPLATE
|
%token TEMPLATE
|
%token ERROR
|
%token ERROR
|
%token NEW DELETE
|
%token NEW DELETE
|
%type operator
|
%type operator
|
%token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST
|
%token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST
|
|
|
/* 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 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 ARROW_STAR '.' DOT_STAR '[' '('
|
%right ARROW ARROW_STAR '.' DOT_STAR '[' '('
|
%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_PLUS); }
|
{ write_exp_elt_opcode (UNOP_PLUS); }
|
;
|
;
|
|
|
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 name COMPLETE
|
exp : exp ARROW name COMPLETE
|
{ mark_struct_expression ();
|
{ mark_struct_expression ();
|
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 COMPLETE
|
exp : exp ARROW COMPLETE
|
{ struct stoken s;
|
{ struct stoken s;
|
mark_struct_expression ();
|
mark_struct_expression ();
|
write_exp_elt_opcode (STRUCTOP_PTR);
|
write_exp_elt_opcode (STRUCTOP_PTR);
|
s.ptr = "";
|
s.ptr = "";
|
s.length = 0;
|
s.length = 0;
|
write_exp_string (s);
|
write_exp_string (s);
|
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_STAR exp
|
exp : exp ARROW_STAR 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 '.' name COMPLETE
|
exp : exp '.' name COMPLETE
|
{ mark_struct_expression ();
|
{ mark_struct_expression ();
|
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 '.' COMPLETE
|
exp : exp '.' COMPLETE
|
{ struct stoken s;
|
{ struct stoken s;
|
mark_struct_expression ();
|
mark_struct_expression ();
|
write_exp_elt_opcode (STRUCTOP_STRUCT);
|
write_exp_elt_opcode (STRUCTOP_STRUCT);
|
s.ptr = "";
|
s.ptr = "";
|
s.length = 0;
|
s.length = 0;
|
write_exp_string (s);
|
write_exp_string (s);
|
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 DOT_STAR exp
|
exp : exp DOT_STAR 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++; }
|
;
|
;
|
|
|
exp : exp '(' nonempty_typelist ')' const_or_volatile
|
exp : exp '(' nonempty_typelist ')' const_or_volatile
|
{ int i;
|
{ int i;
|
write_exp_elt_opcode (TYPE_INSTANCE);
|
write_exp_elt_opcode (TYPE_INSTANCE);
|
write_exp_elt_longcst ((LONGEST) $3[0]);
|
write_exp_elt_longcst ((LONGEST) $3[0]);
|
for (i = 0; i < $3[0]; ++i)
|
for (i = 0; i < $3[0]; ++i)
|
write_exp_elt_type ($3[i + 1]);
|
write_exp_elt_type ($3[i + 1]);
|
write_exp_elt_longcst((LONGEST) $3[0]);
|
write_exp_elt_longcst((LONGEST) $3[0]);
|
write_exp_elt_opcode (TYPE_INSTANCE);
|
write_exp_elt_opcode (TYPE_INSTANCE);
|
free ($3);
|
free ($3);
|
}
|
}
|
;
|
;
|
|
|
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 : CHAR
|
exp : CHAR
|
{
|
{
|
struct stoken_vector vec;
|
struct stoken_vector vec;
|
vec.len = 1;
|
vec.len = 1;
|
vec.tokens = &$1;
|
vec.tokens = &$1;
|
write_exp_string_vector ($1.type, &vec);
|
write_exp_string_vector ($1.type, &vec);
|
}
|
}
|
;
|
;
|
|
|
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 : DECFLOAT
|
exp : DECFLOAT
|
{ write_exp_elt_opcode (OP_DECFLOAT);
|
{ write_exp_elt_opcode (OP_DECFLOAT);
|
write_exp_elt_type ($1.type);
|
write_exp_elt_type ($1.type);
|
write_exp_elt_decfloatcst ($1.val);
|
write_exp_elt_decfloatcst ($1.val);
|
write_exp_elt_opcode (OP_DECFLOAT); }
|
write_exp_elt_opcode (OP_DECFLOAT); }
|
;
|
;
|
|
|
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 (parse_type->builtin_int);
|
write_exp_elt_type (parse_type->builtin_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 : REINTERPRET_CAST '<' type '>' '(' exp ')' %prec UNARY
|
exp : REINTERPRET_CAST '<' type '>' '(' exp ')' %prec UNARY
|
{ write_exp_elt_opcode (UNOP_REINTERPRET_CAST);
|
{ write_exp_elt_opcode (UNOP_REINTERPRET_CAST);
|
write_exp_elt_type ($3);
|
write_exp_elt_type ($3);
|
write_exp_elt_opcode (UNOP_REINTERPRET_CAST); }
|
write_exp_elt_opcode (UNOP_REINTERPRET_CAST); }
|
;
|
;
|
|
|
exp : STATIC_CAST '<' type '>' '(' exp ')' %prec UNARY
|
exp : STATIC_CAST '<' type '>' '(' exp ')' %prec UNARY
|
{ write_exp_elt_opcode (UNOP_CAST);
|
{ write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_type ($3);
|
write_exp_elt_type ($3);
|
write_exp_elt_opcode (UNOP_CAST); }
|
write_exp_elt_opcode (UNOP_CAST); }
|
;
|
;
|
|
|
exp : DYNAMIC_CAST '<' type '>' '(' exp ')' %prec UNARY
|
exp : DYNAMIC_CAST '<' type '>' '(' exp ')' %prec UNARY
|
{ write_exp_elt_opcode (UNOP_DYNAMIC_CAST);
|
{ write_exp_elt_opcode (UNOP_DYNAMIC_CAST);
|
write_exp_elt_type ($3);
|
write_exp_elt_type ($3);
|
write_exp_elt_opcode (UNOP_DYNAMIC_CAST); }
|
write_exp_elt_opcode (UNOP_DYNAMIC_CAST); }
|
;
|
;
|
|
|
exp : CONST_CAST '<' type '>' '(' exp ')' %prec UNARY
|
exp : CONST_CAST '<' type '>' '(' exp ')' %prec UNARY
|
{ /* We could do more error checking here, but
|
{ /* We could do more error checking here, but
|
it doesn't seem worthwhile. */
|
it doesn't seem worthwhile. */
|
write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_type ($3);
|
write_exp_elt_type ($3);
|
write_exp_elt_opcode (UNOP_CAST); }
|
write_exp_elt_opcode (UNOP_CAST); }
|
;
|
;
|
|
|
string_exp:
|
string_exp:
|
STRING
|
STRING
|
{
|
{
|
/* We copy the string here, and not in the
|
/* We copy the string here, and not in the
|
lexer, to guarantee that we do not leak a
|
lexer, to guarantee that we do not leak a
|
string. Note that we follow the
|
string. Note that we follow the
|
NUL-termination convention of the
|
NUL-termination convention of the
|
lexer. */
|
lexer. */
|
struct typed_stoken *vec = XNEW (struct typed_stoken);
|
struct typed_stoken *vec = XNEW (struct typed_stoken);
|
$$.len = 1;
|
$$.len = 1;
|
$$.tokens = vec;
|
$$.tokens = vec;
|
|
|
vec->type = $1.type;
|
vec->type = $1.type;
|
vec->length = $1.length;
|
vec->length = $1.length;
|
vec->ptr = malloc ($1.length + 1);
|
vec->ptr = malloc ($1.length + 1);
|
memcpy (vec->ptr, $1.ptr, $1.length + 1);
|
memcpy (vec->ptr, $1.ptr, $1.length + 1);
|
}
|
}
|
|
|
| string_exp STRING
|
| string_exp STRING
|
{
|
{
|
/* Note that we NUL-terminate here, but just
|
/* Note that we NUL-terminate here, but just
|
for convenience. */
|
for convenience. */
|
char *p;
|
char *p;
|
++$$.len;
|
++$$.len;
|
$$.tokens = realloc ($$.tokens,
|
$$.tokens = realloc ($$.tokens,
|
$$.len * sizeof (struct typed_stoken));
|
$$.len * sizeof (struct typed_stoken));
|
|
|
p = malloc ($2.length + 1);
|
p = malloc ($2.length + 1);
|
memcpy (p, $2.ptr, $2.length + 1);
|
memcpy (p, $2.ptr, $2.length + 1);
|
|
|
$$.tokens[$$.len - 1].type = $2.type;
|
$$.tokens[$$.len - 1].type = $2.type;
|
$$.tokens[$$.len - 1].length = $2.length;
|
$$.tokens[$$.len - 1].length = $2.length;
|
$$.tokens[$$.len - 1].ptr = p;
|
$$.tokens[$$.len - 1].ptr = p;
|
}
|
}
|
;
|
;
|
|
|
exp : string_exp
|
exp : string_exp
|
{
|
{
|
int i;
|
int i;
|
enum c_string_type type = C_STRING;
|
enum c_string_type type = C_STRING;
|
|
|
for (i = 0; i < $1.len; ++i)
|
for (i = 0; i < $1.len; ++i)
|
{
|
{
|
switch ($1.tokens[i].type)
|
switch ($1.tokens[i].type)
|
{
|
{
|
case C_STRING:
|
case C_STRING:
|
break;
|
break;
|
case C_WIDE_STRING:
|
case C_WIDE_STRING:
|
case C_STRING_16:
|
case C_STRING_16:
|
case C_STRING_32:
|
case C_STRING_32:
|
if (type != C_STRING
|
if (type != C_STRING
|
&& type != $1.tokens[i].type)
|
&& type != $1.tokens[i].type)
|
error ("Undefined string concatenation.");
|
error ("Undefined string concatenation.");
|
type = $1.tokens[i].type;
|
type = $1.tokens[i].type;
|
break;
|
break;
|
default:
|
default:
|
/* internal error */
|
/* internal error */
|
internal_error (__FILE__, __LINE__,
|
internal_error (__FILE__, __LINE__,
|
"unrecognized type in string concatenation");
|
"unrecognized type in string concatenation");
|
}
|
}
|
}
|
}
|
|
|
write_exp_string_vector (type, &$1);
|
write_exp_string_vector (type, &$1);
|
for (i = 0; i < $1.len; ++i)
|
for (i = 0; i < $1.len; ++i)
|
free ($1.tokens[i].ptr);
|
free ($1.tokens[i].ptr);
|
free ($1.tokens);
|
free ($1.tokens);
|
}
|
}
|
;
|
;
|
|
|
/* C++. */
|
/* C++. */
|
exp : TRUEKEYWORD
|
exp : TRUEKEYWORD
|
{ write_exp_elt_opcode (OP_LONG);
|
{ write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (parse_type->builtin_bool);
|
write_exp_elt_type (parse_type->builtin_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 (parse_type->builtin_bool);
|
write_exp_elt_type (parse_type->builtin_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_DOMAIN, (int *) NULL);
|
VAR_DOMAIN, (int *) 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_DOMAIN, (int *) NULL);
|
VAR_DOMAIN, (int *) 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;
|
CHECK_TYPEDEF (type);
|
CHECK_TYPEDEF (type);
|
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
|
&& TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
|
&& TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
|
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;
|
CHECK_TYPEDEF (type);
|
CHECK_TYPEDEF (type);
|
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
|
&& TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
|
&& TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
|
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_DOMAIN, (int *) NULL);
|
VAR_DOMAIN, (int *) 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);
|
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.", 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,
|
|| contained_in (block_found,
|
innermost_block))
|
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;
|
char *arg = copy_name ($1.stoken);
|
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);
|
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));
|
}
|
}
|
}
|
}
|
;
|
;
|
|
|
space_identifier : '@' NAME
|
space_identifier : '@' NAME
|
{ push_type_address_space (copy_name ($2.stoken));
|
{ push_type_address_space (copy_name ($2.stoken));
|
push_type (tp_space_identifier);
|
push_type (tp_space_identifier);
|
}
|
}
|
;
|
;
|
|
|
const_or_volatile: const_or_volatile_noopt
|
const_or_volatile: const_or_volatile_noopt
|
|
|
|
|
;
|
;
|
|
|
cv_with_space_id : const_or_volatile space_identifier const_or_volatile
|
cv_with_space_id : const_or_volatile space_identifier const_or_volatile
|
;
|
;
|
|
|
const_or_volatile_or_space_identifier_noopt: cv_with_space_id
|
const_or_volatile_or_space_identifier_noopt: cv_with_space_id
|
| const_or_volatile_noopt
|
| const_or_volatile_noopt
|
;
|
;
|
|
|
const_or_volatile_or_space_identifier:
|
const_or_volatile_or_space_identifier:
|
const_or_volatile_or_space_identifier_noopt
|
const_or_volatile_or_space_identifier_noopt
|
|
|
|
|
;
|
;
|
|
|
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 ($2); $$ = 0; }
|
{ free ($2); $$ = 0; }
|
;
|
;
|
|
|
/* We used to try to recognize pointer to member types here, but
|
/* We used to try to recognize 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 /* Implements (approximately): (type-qualifier)* type-specifier */
|
typebase /* Implements (approximately): (type-qualifier)* type-specifier */
|
: TYPENAME
|
: TYPENAME
|
{ $$ = $1.type; }
|
{ $$ = $1.type; }
|
| INT_KEYWORD
|
| INT_KEYWORD
|
{ $$ = parse_type->builtin_int; }
|
{ $$ = parse_type->builtin_int; }
|
| LONG
|
| LONG
|
{ $$ = parse_type->builtin_long; }
|
{ $$ = parse_type->builtin_long; }
|
| SHORT
|
| SHORT
|
{ $$ = parse_type->builtin_short; }
|
{ $$ = parse_type->builtin_short; }
|
| LONG INT_KEYWORD
|
| LONG INT_KEYWORD
|
{ $$ = parse_type->builtin_long; }
|
{ $$ = parse_type->builtin_long; }
|
| LONG SIGNED_KEYWORD INT_KEYWORD
|
| LONG SIGNED_KEYWORD INT_KEYWORD
|
{ $$ = parse_type->builtin_long; }
|
{ $$ = parse_type->builtin_long; }
|
| LONG SIGNED_KEYWORD
|
| LONG SIGNED_KEYWORD
|
{ $$ = parse_type->builtin_long; }
|
{ $$ = parse_type->builtin_long; }
|
| SIGNED_KEYWORD LONG INT_KEYWORD
|
| SIGNED_KEYWORD LONG INT_KEYWORD
|
{ $$ = parse_type->builtin_long; }
|
{ $$ = parse_type->builtin_long; }
|
| UNSIGNED LONG INT_KEYWORD
|
| UNSIGNED LONG INT_KEYWORD
|
{ $$ = parse_type->builtin_unsigned_long; }
|
{ $$ = parse_type->builtin_unsigned_long; }
|
| LONG UNSIGNED INT_KEYWORD
|
| LONG UNSIGNED INT_KEYWORD
|
{ $$ = parse_type->builtin_unsigned_long; }
|
{ $$ = parse_type->builtin_unsigned_long; }
|
| LONG UNSIGNED
|
| LONG UNSIGNED
|
{ $$ = parse_type->builtin_unsigned_long; }
|
{ $$ = parse_type->builtin_unsigned_long; }
|
| LONG LONG
|
| LONG LONG
|
{ $$ = parse_type->builtin_long_long; }
|
{ $$ = parse_type->builtin_long_long; }
|
| LONG LONG INT_KEYWORD
|
| LONG LONG INT_KEYWORD
|
{ $$ = parse_type->builtin_long_long; }
|
{ $$ = parse_type->builtin_long_long; }
|
| LONG LONG SIGNED_KEYWORD INT_KEYWORD
|
| LONG LONG SIGNED_KEYWORD INT_KEYWORD
|
{ $$ = parse_type->builtin_long_long; }
|
{ $$ = parse_type->builtin_long_long; }
|
| LONG LONG SIGNED_KEYWORD
|
| LONG LONG SIGNED_KEYWORD
|
{ $$ = parse_type->builtin_long_long; }
|
{ $$ = parse_type->builtin_long_long; }
|
| SIGNED_KEYWORD LONG LONG
|
| SIGNED_KEYWORD LONG LONG
|
{ $$ = parse_type->builtin_long_long; }
|
{ $$ = parse_type->builtin_long_long; }
|
| SIGNED_KEYWORD LONG LONG INT_KEYWORD
|
| SIGNED_KEYWORD LONG LONG INT_KEYWORD
|
{ $$ = parse_type->builtin_long_long; }
|
{ $$ = parse_type->builtin_long_long; }
|
| UNSIGNED LONG LONG
|
| UNSIGNED LONG LONG
|
{ $$ = parse_type->builtin_unsigned_long_long; }
|
{ $$ = parse_type->builtin_unsigned_long_long; }
|
| UNSIGNED LONG LONG INT_KEYWORD
|
| UNSIGNED LONG LONG INT_KEYWORD
|
{ $$ = parse_type->builtin_unsigned_long_long; }
|
{ $$ = parse_type->builtin_unsigned_long_long; }
|
| LONG LONG UNSIGNED
|
| LONG LONG UNSIGNED
|
{ $$ = parse_type->builtin_unsigned_long_long; }
|
{ $$ = parse_type->builtin_unsigned_long_long; }
|
| LONG LONG UNSIGNED INT_KEYWORD
|
| LONG LONG UNSIGNED INT_KEYWORD
|
{ $$ = parse_type->builtin_unsigned_long_long; }
|
{ $$ = parse_type->builtin_unsigned_long_long; }
|
| SHORT INT_KEYWORD
|
| SHORT INT_KEYWORD
|
{ $$ = parse_type->builtin_short; }
|
{ $$ = parse_type->builtin_short; }
|
| SHORT SIGNED_KEYWORD INT_KEYWORD
|
| SHORT SIGNED_KEYWORD INT_KEYWORD
|
{ $$ = parse_type->builtin_short; }
|
{ $$ = parse_type->builtin_short; }
|
| SHORT SIGNED_KEYWORD
|
| SHORT SIGNED_KEYWORD
|
{ $$ = parse_type->builtin_short; }
|
{ $$ = parse_type->builtin_short; }
|
| UNSIGNED SHORT INT_KEYWORD
|
| UNSIGNED SHORT INT_KEYWORD
|
{ $$ = parse_type->builtin_unsigned_short; }
|
{ $$ = parse_type->builtin_unsigned_short; }
|
| SHORT UNSIGNED
|
| SHORT UNSIGNED
|
{ $$ = parse_type->builtin_unsigned_short; }
|
{ $$ = parse_type->builtin_unsigned_short; }
|
| SHORT UNSIGNED INT_KEYWORD
|
| SHORT UNSIGNED INT_KEYWORD
|
{ $$ = parse_type->builtin_unsigned_short; }
|
{ $$ = parse_type->builtin_unsigned_short; }
|
| DOUBLE_KEYWORD
|
| DOUBLE_KEYWORD
|
{ $$ = parse_type->builtin_double; }
|
{ $$ = parse_type->builtin_double; }
|
| LONG DOUBLE_KEYWORD
|
| LONG DOUBLE_KEYWORD
|
{ $$ = parse_type->builtin_long_double; }
|
{ $$ = parse_type->builtin_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 (parse_language,
|
{ $$ = lookup_unsigned_typename (parse_language,
|
parse_gdbarch,
|
parse_gdbarch,
|
TYPE_NAME($2.type)); }
|
TYPE_NAME($2.type)); }
|
| UNSIGNED
|
| UNSIGNED
|
{ $$ = parse_type->builtin_unsigned_int; }
|
{ $$ = parse_type->builtin_unsigned_int; }
|
| SIGNED_KEYWORD typename
|
| SIGNED_KEYWORD typename
|
{ $$ = lookup_signed_typename (parse_language,
|
{ $$ = lookup_signed_typename (parse_language,
|
parse_gdbarch,
|
parse_gdbarch,
|
TYPE_NAME($2.type)); }
|
TYPE_NAME($2.type)); }
|
| SIGNED_KEYWORD
|
| SIGNED_KEYWORD
|
{ $$ = parse_type->builtin_int; }
|
{ $$ = parse_type->builtin_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_or_volatile_or_space_identifier_noopt typebase
|
| const_or_volatile_or_space_identifier_noopt typebase
|
{ $$ = follow_types ($2); }
|
{ $$ = follow_types ($2); }
|
| typebase const_or_volatile_or_space_identifier_noopt
|
| typebase const_or_volatile_or_space_identifier_noopt
|
{ $$ = follow_types ($1); }
|
{ $$ = follow_types ($1); }
|
| qualified_type
|
| qualified_type
|
;
|
;
|
|
|
/* FIXME: carlton/2003-09-25: This next bit leads to lots of
|
/* FIXME: carlton/2003-09-25: This next bit leads to lots of
|
reduce-reduce conflicts, because the parser doesn't know whether or
|
reduce-reduce conflicts, because the parser doesn't know whether or
|
not to use qualified_name or qualified_type: the rules are
|
not to use qualified_name or qualified_type: the rules are
|
identical. If the parser is parsing 'A::B::x', then, when it sees
|
identical. If the parser is parsing 'A::B::x', then, when it sees
|
the second '::', it knows that the expression to the left of it has
|
the second '::', it knows that the expression to the left of it has
|
to be a type, so it uses qualified_type. But if it is parsing just
|
to be a type, so it uses qualified_type. But if it is parsing just
|
'A::B', then it doesn't have any way of knowing which rule to use,
|
'A::B', then it doesn't have any way of knowing which rule to use,
|
so there's a reduce-reduce conflict; it picks qualified_name, since
|
so there's a reduce-reduce conflict; it picks qualified_name, since
|
that occurs earlier in this file than qualified_type.
|
that occurs earlier in this file than qualified_type.
|
|
|
There's no good way to fix this with the grammar as it stands; as
|
There's no good way to fix this with the grammar as it stands; as
|
far as I can tell, some of the problems arise from ambiguities that
|
far as I can tell, some of the problems arise from ambiguities that
|
GDB introduces ('start' can be either an expression or a type), but
|
GDB introduces ('start' can be either an expression or a type), but
|
some of it is inherent to the nature of C++ (you want to treat the
|
some of it is inherent to the nature of C++ (you want to treat the
|
input "(FOO)" fairly differently depending on whether FOO is an
|
input "(FOO)" fairly differently depending on whether FOO is an
|
expression or a type, and if FOO is a complex expression, this can
|
expression or a type, and if FOO is a complex expression, this can
|
be hard to determine at the right time). Fortunately, it works
|
be hard to determine at the right time). Fortunately, it works
|
pretty well in most cases. For example, if you do 'ptype A::B',
|
pretty well in most cases. For example, if you do 'ptype A::B',
|
where A::B is a nested type, then the parser will mistakenly
|
where A::B is a nested type, then the parser will mistakenly
|
misidentify it as an expression; but evaluate_subexp will get
|
misidentify it as an expression; but evaluate_subexp will get
|
called with 'noside' set to EVAL_AVOID_SIDE_EFFECTS, and everything
|
called with 'noside' set to EVAL_AVOID_SIDE_EFFECTS, and everything
|
will work out anyways. But there are situations where the parser
|
will work out anyways. But there are situations where the parser
|
will get confused: the most common one that I've run into is when
|
will get confused: the most common one that I've run into is when
|
you want to do
|
you want to do
|
|
|
print *((A::B *) x)"
|
print *((A::B *) x)"
|
|
|
where the parser doesn't realize that A::B has to be a type until
|
where the parser doesn't realize that A::B has to be a type until
|
it hits the first right paren, at which point it's too late. (The
|
it hits the first right paren, at which point it's too late. (The
|
workaround is to type "print *(('A::B' *) x)" instead.) (And
|
workaround is to type "print *(('A::B' *) x)" instead.) (And
|
another solution is to fix our symbol-handling code so that the
|
another solution is to fix our symbol-handling code so that the
|
user never wants to type something like that in the first place,
|
user never wants to type something like that in the first place,
|
because we get all the types right without the user's help!)
|
because we get all the types right without the user's help!)
|
|
|
Perhaps we could fix this by making the lexer smarter. Some of
|
Perhaps we could fix this by making the lexer smarter. Some of
|
this functionality used to be in the lexer, but in a way that
|
this functionality used to be in the lexer, but in a way that
|
worked even less well than the current solution: that attempt
|
worked even less well than the current solution: that attempt
|
involved having the parser sometimes handle '::' and having the
|
involved having the parser sometimes handle '::' and having the
|
lexer sometimes handle it, and without a clear division of
|
lexer sometimes handle it, and without a clear division of
|
responsibility, it quickly degenerated into a big mess. Probably
|
responsibility, it quickly degenerated into a big mess. Probably
|
the eventual correct solution will give more of a role to the lexer
|
the eventual correct solution will give more of a role to the lexer
|
(ideally via code that is shared between the lexer and
|
(ideally via code that is shared between the lexer and
|
decode_line_1), but I'm not holding my breath waiting for somebody
|
decode_line_1), but I'm not holding my breath waiting for somebody
|
to get around to cleaning this up... */
|
to get around to cleaning this up... */
|
|
|
qualified_type: typebase COLONCOLON name
|
qualified_type: typebase COLONCOLON name
|
{
|
{
|
struct type *type = $1;
|
struct type *type = $1;
|
struct type *new_type;
|
struct type *new_type;
|
char *ncopy = alloca ($3.length + 1);
|
char *ncopy = alloca ($3.length + 1);
|
|
|
memcpy (ncopy, $3.ptr, $3.length);
|
memcpy (ncopy, $3.ptr, $3.length);
|
ncopy[$3.length] = '\0';
|
ncopy[$3.length] = '\0';
|
|
|
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
|
&& TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
|
&& TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
|
error ("`%s' is not defined as an aggregate type.",
|
error ("`%s' is not defined as an aggregate type.",
|
TYPE_NAME (type));
|
TYPE_NAME (type));
|
|
|
new_type = cp_lookup_nested_type (type, ncopy,
|
new_type = cp_lookup_nested_type (type, ncopy,
|
expression_context_block);
|
expression_context_block);
|
if (new_type == NULL)
|
if (new_type == NULL)
|
error ("No type \"%s\" within class or namespace \"%s\".",
|
error ("No type \"%s\" within class or namespace \"%s\".",
|
ncopy, TYPE_NAME (type));
|
ncopy, TYPE_NAME (type));
|
|
|
$$ = new_type;
|
$$ = new_type;
|
}
|
}
|
;
|
;
|
|
|
typename: TYPENAME
|
typename: TYPENAME
|
| INT_KEYWORD
|
| INT_KEYWORD
|
{
|
{
|
$$.stoken.ptr = "int";
|
$$.stoken.ptr = "int";
|
$$.stoken.length = 3;
|
$$.stoken.length = 3;
|
$$.type = parse_type->builtin_int;
|
$$.type = parse_type->builtin_int;
|
}
|
}
|
| LONG
|
| LONG
|
{
|
{
|
$$.stoken.ptr = "long";
|
$$.stoken.ptr = "long";
|
$$.stoken.length = 4;
|
$$.stoken.length = 4;
|
$$.type = parse_type->builtin_long;
|
$$.type = parse_type->builtin_long;
|
}
|
}
|
| SHORT
|
| SHORT
|
{
|
{
|
$$.stoken.ptr = "short";
|
$$.stoken.ptr = "short";
|
$$.stoken.length = 5;
|
$$.stoken.length = 5;
|
$$.type = parse_type->builtin_short;
|
$$.type = parse_type->builtin_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;
|
}
|
}
|
;
|
;
|
|
|
ptype : typebase
|
ptype : typebase
|
| ptype const_or_volatile_or_space_identifier abs_decl const_or_volatile_or_space_identifier
|
| ptype const_or_volatile_or_space_identifier abs_decl const_or_volatile_or_space_identifier
|
{ $$ = follow_types ($1); }
|
{ $$ = follow_types ($1); }
|
;
|
;
|
|
|
const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
|
const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
|
| VOLATILE_KEYWORD CONST_KEYWORD
|
| VOLATILE_KEYWORD CONST_KEYWORD
|
;
|
;
|
|
|
const_or_volatile_noopt: const_and_volatile
|
const_or_volatile_noopt: const_and_volatile
|
{ push_type (tp_const);
|
{ push_type (tp_const);
|
push_type (tp_volatile);
|
push_type (tp_volatile);
|
}
|
}
|
| CONST_KEYWORD
|
| CONST_KEYWORD
|
{ push_type (tp_const); }
|
{ push_type (tp_const); }
|
| VOLATILE_KEYWORD
|
| VOLATILE_KEYWORD
|
{ push_type (tp_volatile); }
|
{ push_type (tp_volatile); }
|
;
|
;
|
|
|
operator: OPERATOR NEW
|
operator: OPERATOR NEW
|
{ $$ = operator_stoken (" new"); }
|
{ $$ = operator_stoken (" new"); }
|
| OPERATOR DELETE
|
| OPERATOR DELETE
|
{ $$ = operator_stoken (" delete"); }
|
{ $$ = operator_stoken (" delete"); }
|
| OPERATOR NEW '[' ']'
|
| OPERATOR NEW '[' ']'
|
{ $$ = operator_stoken (" new[]"); }
|
{ $$ = operator_stoken (" new[]"); }
|
| OPERATOR DELETE '[' ']'
|
| OPERATOR DELETE '[' ']'
|
{ $$ = operator_stoken (" delete[]"); }
|
{ $$ = operator_stoken (" delete[]"); }
|
| OPERATOR '+'
|
| OPERATOR '+'
|
{ $$ = operator_stoken ("+"); }
|
{ $$ = operator_stoken ("+"); }
|
| OPERATOR '-'
|
| OPERATOR '-'
|
{ $$ = operator_stoken ("-"); }
|
{ $$ = operator_stoken ("-"); }
|
| OPERATOR '*'
|
| OPERATOR '*'
|
{ $$ = operator_stoken ("*"); }
|
{ $$ = operator_stoken ("*"); }
|
| OPERATOR '/'
|
| OPERATOR '/'
|
{ $$ = operator_stoken ("/"); }
|
{ $$ = operator_stoken ("/"); }
|
| OPERATOR '%'
|
| OPERATOR '%'
|
{ $$ = operator_stoken ("%"); }
|
{ $$ = operator_stoken ("%"); }
|
| OPERATOR '^'
|
| OPERATOR '^'
|
{ $$ = operator_stoken ("^"); }
|
{ $$ = operator_stoken ("^"); }
|
| OPERATOR '&'
|
| OPERATOR '&'
|
{ $$ = operator_stoken ("&"); }
|
{ $$ = operator_stoken ("&"); }
|
| OPERATOR '|'
|
| OPERATOR '|'
|
{ $$ = operator_stoken ("|"); }
|
{ $$ = operator_stoken ("|"); }
|
| OPERATOR '~'
|
| OPERATOR '~'
|
{ $$ = operator_stoken ("~"); }
|
{ $$ = operator_stoken ("~"); }
|
| OPERATOR '!'
|
| OPERATOR '!'
|
{ $$ = operator_stoken ("!"); }
|
{ $$ = operator_stoken ("!"); }
|
| OPERATOR '='
|
| OPERATOR '='
|
{ $$ = operator_stoken ("="); }
|
{ $$ = operator_stoken ("="); }
|
| OPERATOR '<'
|
| OPERATOR '<'
|
{ $$ = operator_stoken ("<"); }
|
{ $$ = operator_stoken ("<"); }
|
| OPERATOR '>'
|
| OPERATOR '>'
|
{ $$ = operator_stoken (">"); }
|
{ $$ = operator_stoken (">"); }
|
| OPERATOR ASSIGN_MODIFY
|
| OPERATOR ASSIGN_MODIFY
|
{ const char *op = "unknown";
|
{ const char *op = "unknown";
|
switch ($2)
|
switch ($2)
|
{
|
{
|
case BINOP_RSH:
|
case BINOP_RSH:
|
op = ">>=";
|
op = ">>=";
|
break;
|
break;
|
case BINOP_LSH:
|
case BINOP_LSH:
|
op = "<<=";
|
op = "<<=";
|
break;
|
break;
|
case BINOP_ADD:
|
case BINOP_ADD:
|
op = "+=";
|
op = "+=";
|
break;
|
break;
|
case BINOP_SUB:
|
case BINOP_SUB:
|
op = "-=";
|
op = "-=";
|
break;
|
break;
|
case BINOP_MUL:
|
case BINOP_MUL:
|
op = "*=";
|
op = "*=";
|
break;
|
break;
|
case BINOP_DIV:
|
case BINOP_DIV:
|
op = "/=";
|
op = "/=";
|
break;
|
break;
|
case BINOP_REM:
|
case BINOP_REM:
|
op = "%=";
|
op = "%=";
|
break;
|
break;
|
case BINOP_BITWISE_IOR:
|
case BINOP_BITWISE_IOR:
|
op = "|=";
|
op = "|=";
|
break;
|
break;
|
case BINOP_BITWISE_AND:
|
case BINOP_BITWISE_AND:
|
op = "&=";
|
op = "&=";
|
break;
|
break;
|
case BINOP_BITWISE_XOR:
|
case BINOP_BITWISE_XOR:
|
op = "^=";
|
op = "^=";
|
break;
|
break;
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
$$ = operator_stoken (op);
|
$$ = operator_stoken (op);
|
}
|
}
|
| OPERATOR LSH
|
| OPERATOR LSH
|
{ $$ = operator_stoken ("<<"); }
|
{ $$ = operator_stoken ("<<"); }
|
| OPERATOR RSH
|
| OPERATOR RSH
|
{ $$ = operator_stoken (">>"); }
|
{ $$ = operator_stoken (">>"); }
|
| OPERATOR EQUAL
|
| OPERATOR EQUAL
|
{ $$ = operator_stoken ("=="); }
|
{ $$ = operator_stoken ("=="); }
|
| OPERATOR NOTEQUAL
|
| OPERATOR NOTEQUAL
|
{ $$ = operator_stoken ("!="); }
|
{ $$ = operator_stoken ("!="); }
|
| OPERATOR LEQ
|
| OPERATOR LEQ
|
{ $$ = operator_stoken ("<="); }
|
{ $$ = operator_stoken ("<="); }
|
| OPERATOR GEQ
|
| OPERATOR GEQ
|
{ $$ = operator_stoken (">="); }
|
{ $$ = operator_stoken (">="); }
|
| OPERATOR ANDAND
|
| OPERATOR ANDAND
|
{ $$ = operator_stoken ("&&"); }
|
{ $$ = operator_stoken ("&&"); }
|
| OPERATOR OROR
|
| OPERATOR OROR
|
{ $$ = operator_stoken ("||"); }
|
{ $$ = operator_stoken ("||"); }
|
| OPERATOR INCREMENT
|
| OPERATOR INCREMENT
|
{ $$ = operator_stoken ("++"); }
|
{ $$ = operator_stoken ("++"); }
|
| OPERATOR DECREMENT
|
| OPERATOR DECREMENT
|
{ $$ = operator_stoken ("--"); }
|
{ $$ = operator_stoken ("--"); }
|
| OPERATOR ','
|
| OPERATOR ','
|
{ $$ = operator_stoken (","); }
|
{ $$ = operator_stoken (","); }
|
| OPERATOR ARROW_STAR
|
| OPERATOR ARROW_STAR
|
{ $$ = operator_stoken ("->*"); }
|
{ $$ = operator_stoken ("->*"); }
|
| OPERATOR ARROW
|
| OPERATOR ARROW
|
{ $$ = operator_stoken ("->"); }
|
{ $$ = operator_stoken ("->"); }
|
| OPERATOR '(' ')'
|
| OPERATOR '(' ')'
|
{ $$ = operator_stoken ("()"); }
|
{ $$ = operator_stoken ("()"); }
|
| OPERATOR '[' ']'
|
| OPERATOR '[' ']'
|
{ $$ = operator_stoken ("[]"); }
|
{ $$ = operator_stoken ("[]"); }
|
| OPERATOR ptype
|
| OPERATOR ptype
|
{ char *name;
|
{ char *name;
|
long length;
|
long length;
|
struct ui_file *buf = mem_fileopen ();
|
struct ui_file *buf = mem_fileopen ();
|
|
|
c_print_type ($2, NULL, buf, -1, 0);
|
c_print_type ($2, NULL, buf, -1, 0);
|
name = ui_file_xstrdup (buf, &length);
|
name = ui_file_xstrdup (buf, &length);
|
ui_file_delete (buf);
|
ui_file_delete (buf);
|
$$ = operator_stoken (name);
|
$$ = operator_stoken (name);
|
free (name);
|
free (name);
|
}
|
}
|
;
|
;
|
|
|
|
|
|
|
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; }
|
| operator { $$ = $1; }
|
| operator { $$ = $1; }
|
;
|
;
|
|
|
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
|
*/
|
*/
|
;
|
;
|
|
|
%%
|
%%
|
|
|
/* Returns a stoken of the operator name given by OP (which does not
|
/* Returns a stoken of the operator name given by OP (which does not
|
include the string "operator"). */
|
include the string "operator"). */
|
static struct stoken
|
static struct stoken
|
operator_stoken (const char *op)
|
operator_stoken (const char *op)
|
{
|
{
|
static const char *operator_string = "operator";
|
static const char *operator_string = "operator";
|
struct stoken st = { NULL, 0 };
|
struct stoken st = { NULL, 0 };
|
st.length = strlen (operator_string) + strlen (op);
|
st.length = strlen (operator_string) + strlen (op);
|
st.ptr = malloc (st.length + 1);
|
st.ptr = malloc (st.length + 1);
|
strcpy (st.ptr, operator_string);
|
strcpy (st.ptr, operator_string);
|
strcat (st.ptr, op);
|
strcat (st.ptr, op);
|
|
|
/* The toplevel (c_parse) will free the memory allocated here. */
|
/* The toplevel (c_parse) will free the memory allocated here. */
|
make_cleanup (free, st.ptr);
|
make_cleanup (free, st.ptr);
|
return st;
|
return st;
|
};
|
};
|
|
|
/* 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 (char *p, int len, int parsed_float, YYSTYPE *putithere)
|
parse_number (char *p, int len, int parsed_float, 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. */
|
LONGEST n = 0;
|
LONGEST n = 0;
|
LONGEST prevn = 0;
|
LONGEST prevn = 0;
|
ULONGEST un;
|
ULONGEST un;
|
|
|
int i = 0;
|
int i = 0;
|
int c;
|
int c;
|
int base = input_radix;
|
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 *s;
|
char *s;
|
int num; /* number of tokens scanned by scanf */
|
int num; /* number of tokens scanned by scanf */
|
char saved_char;
|
char saved_char;
|
|
|
/* If it ends at "df", "dd" or "dl", take it as type of decimal floating
|
/* If it ends at "df", "dd" or "dl", take it as type of decimal floating
|
point. Return DECFLOAT. */
|
point. Return DECFLOAT. */
|
|
|
if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
|
if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
|
{
|
{
|
p[len - 2] = '\0';
|
p[len - 2] = '\0';
|
putithere->typed_val_decfloat.type
|
putithere->typed_val_decfloat.type
|
= parse_type->builtin_decfloat;
|
= parse_type->builtin_decfloat;
|
decimal_from_string (putithere->typed_val_decfloat.val, 4,
|
decimal_from_string (putithere->typed_val_decfloat.val, 4,
|
gdbarch_byte_order (parse_gdbarch), p);
|
gdbarch_byte_order (parse_gdbarch), p);
|
p[len - 2] = 'd';
|
p[len - 2] = 'd';
|
return DECFLOAT;
|
return DECFLOAT;
|
}
|
}
|
|
|
if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
|
if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
|
{
|
{
|
p[len - 2] = '\0';
|
p[len - 2] = '\0';
|
putithere->typed_val_decfloat.type
|
putithere->typed_val_decfloat.type
|
= parse_type->builtin_decdouble;
|
= parse_type->builtin_decdouble;
|
decimal_from_string (putithere->typed_val_decfloat.val, 8,
|
decimal_from_string (putithere->typed_val_decfloat.val, 8,
|
gdbarch_byte_order (parse_gdbarch), p);
|
gdbarch_byte_order (parse_gdbarch), p);
|
p[len - 2] = 'd';
|
p[len - 2] = 'd';
|
return DECFLOAT;
|
return DECFLOAT;
|
}
|
}
|
|
|
if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
|
if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
|
{
|
{
|
p[len - 2] = '\0';
|
p[len - 2] = '\0';
|
putithere->typed_val_decfloat.type
|
putithere->typed_val_decfloat.type
|
= parse_type->builtin_declong;
|
= parse_type->builtin_declong;
|
decimal_from_string (putithere->typed_val_decfloat.val, 16,
|
decimal_from_string (putithere->typed_val_decfloat.val, 16,
|
gdbarch_byte_order (parse_gdbarch), p);
|
gdbarch_byte_order (parse_gdbarch), p);
|
p[len - 2] = 'd';
|
p[len - 2] = 'd';
|
return DECFLOAT;
|
return DECFLOAT;
|
}
|
}
|
|
|
s = malloc (len);
|
s = malloc (len);
|
saved_char = p[len];
|
saved_char = p[len];
|
p[len] = 0; /* null-terminate the token */
|
p[len] = 0; /* null-terminate the token */
|
num = sscanf (p, "%" DOUBLEST_SCAN_FORMAT "%s",
|
num = sscanf (p, "%" DOUBLEST_SCAN_FORMAT "%s",
|
&putithere->typed_val_float.dval, s);
|
&putithere->typed_val_float.dval, s);
|
p[len] = saved_char; /* restore the input stream */
|
p[len] = saved_char; /* restore the input stream */
|
|
|
if (num == 1)
|
if (num == 1)
|
putithere->typed_val_float.type =
|
putithere->typed_val_float.type =
|
parse_type->builtin_double;
|
parse_type->builtin_double;
|
|
|
if (num == 2 )
|
if (num == 2 )
|
{
|
{
|
/* See if it has any float suffix: 'f' for float, 'l' for long
|
/* See if it has any float suffix: 'f' for float, 'l' for long
|
double. */
|
double. */
|
if (!strcasecmp (s, "f"))
|
if (!strcasecmp (s, "f"))
|
putithere->typed_val_float.type =
|
putithere->typed_val_float.type =
|
parse_type->builtin_float;
|
parse_type->builtin_float;
|
else if (!strcasecmp (s, "l"))
|
else if (!strcasecmp (s, "l"))
|
putithere->typed_val_float.type =
|
putithere->typed_val_float.type =
|
parse_type->builtin_long_double;
|
parse_type->builtin_long_double;
|
else
|
else
|
{
|
{
|
free (s);
|
free (s);
|
return ERROR;
|
return ERROR;
|
}
|
}
|
}
|
}
|
|
|
free (s);
|
free (s);
|
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 'b':
|
case 'b':
|
case 'B':
|
case 'B':
|
if (len >= 3)
|
if (len >= 3)
|
{
|
{
|
p += 2;
|
p += 2;
|
base = 2;
|
base = 2;
|
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 gdbarch_int_bit
|
(which always produces a zero result). Sometimes gdbarch_int_bit
|
or gdbarch_long_bit will be that big, sometimes not. To deal with
|
or gdbarch_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 >> (gdbarch_int_bit (parse_gdbarch) - 2)) == 0)
|
&& (un >> (gdbarch_int_bit (parse_gdbarch) - 2)) == 0)
|
{
|
{
|
high_bit = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch) - 1);
|
high_bit = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch) - 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 = parse_type->builtin_unsigned_int;
|
unsigned_type = parse_type->builtin_unsigned_int;
|
signed_type = parse_type->builtin_int;
|
signed_type = parse_type->builtin_int;
|
}
|
}
|
else if (long_p <= 1
|
else if (long_p <= 1
|
&& (un >> (gdbarch_long_bit (parse_gdbarch) - 2)) == 0)
|
&& (un >> (gdbarch_long_bit (parse_gdbarch) - 2)) == 0)
|
{
|
{
|
high_bit = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch) - 1);
|
high_bit = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch) - 1);
|
unsigned_type = parse_type->builtin_unsigned_long;
|
unsigned_type = parse_type->builtin_unsigned_long;
|
signed_type = parse_type->builtin_long;
|
signed_type = parse_type->builtin_long;
|
}
|
}
|
else
|
else
|
{
|
{
|
int shift;
|
int shift;
|
if (sizeof (ULONGEST) * HOST_CHAR_BIT
|
if (sizeof (ULONGEST) * HOST_CHAR_BIT
|
< gdbarch_long_long_bit (parse_gdbarch))
|
< gdbarch_long_long_bit (parse_gdbarch))
|
/* 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 = (gdbarch_long_long_bit (parse_gdbarch) - 1);
|
shift = (gdbarch_long_long_bit (parse_gdbarch) - 1);
|
high_bit = (ULONGEST) 1 << shift;
|
high_bit = (ULONGEST) 1 << shift;
|
unsigned_type = parse_type->builtin_unsigned_long_long;
|
unsigned_type = parse_type->builtin_unsigned_long_long;
|
signed_type = parse_type->builtin_long_long;
|
signed_type = parse_type->builtin_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;
|
}
|
}
|
|
|
/* Temporary obstack used for holding strings. */
|
/* Temporary obstack used for holding strings. */
|
static struct obstack tempbuf;
|
static struct obstack tempbuf;
|
static int tempbuf_init;
|
static int tempbuf_init;
|
|
|
/* Parse a C escape sequence. The initial backslash of the sequence
|
/* Parse a C escape sequence. The initial backslash of the sequence
|
is at (*PTR)[-1]. *PTR will be updated to point to just after the
|
is at (*PTR)[-1]. *PTR will be updated to point to just after the
|
last character of the sequence. If OUTPUT is not NULL, the
|
last character of the sequence. If OUTPUT is not NULL, the
|
translated form of the escape sequence will be written there. If
|
translated form of the escape sequence will be written there. If
|
OUTPUT is NULL, no output is written and the call will only affect
|
OUTPUT is NULL, no output is written and the call will only affect
|
*PTR. If an escape sequence is expressed in target bytes, then the
|
*PTR. If an escape sequence is expressed in target bytes, then the
|
entire sequence will simply be copied to OUTPUT. Return 1 if any
|
entire sequence will simply be copied to OUTPUT. Return 1 if any
|
character was emitted, 0 otherwise. */
|
character was emitted, 0 otherwise. */
|
|
|
int
|
int
|
c_parse_escape (char **ptr, struct obstack *output)
|
c_parse_escape (char **ptr, struct obstack *output)
|
{
|
{
|
char *tokptr = *ptr;
|
char *tokptr = *ptr;
|
int result = 1;
|
int result = 1;
|
|
|
/* Some escape sequences undergo character set conversion. Those we
|
/* Some escape sequences undergo character set conversion. Those we
|
translate here. */
|
translate here. */
|
switch (*tokptr)
|
switch (*tokptr)
|
{
|
{
|
/* Hex escapes do not undergo character set conversion, so keep
|
/* Hex escapes do not undergo character set conversion, so keep
|
the escape sequence for later. */
|
the escape sequence for later. */
|
case 'x':
|
case 'x':
|
if (output)
|
if (output)
|
obstack_grow_str (output, "\\x");
|
obstack_grow_str (output, "\\x");
|
++tokptr;
|
++tokptr;
|
if (!isxdigit (*tokptr))
|
if (!isxdigit (*tokptr))
|
error (_("\\x escape without a following hex digit"));
|
error (_("\\x escape without a following hex digit"));
|
while (isxdigit (*tokptr))
|
while (isxdigit (*tokptr))
|
{
|
{
|
if (output)
|
if (output)
|
obstack_1grow (output, *tokptr);
|
obstack_1grow (output, *tokptr);
|
++tokptr;
|
++tokptr;
|
}
|
}
|
break;
|
break;
|
|
|
/* Octal escapes do not undergo character set conversion, so
|
/* Octal escapes do not undergo character set conversion, so
|
keep the escape sequence for later. */
|
keep the escape sequence for later. */
|
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':
|
{
|
{
|
int i;
|
int i;
|
if (output)
|
if (output)
|
obstack_grow_str (output, "\\");
|
obstack_grow_str (output, "\\");
|
for (i = 0;
|
for (i = 0;
|
i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
|
i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
|
++i)
|
++i)
|
{
|
{
|
if (output)
|
if (output)
|
obstack_1grow (output, *tokptr);
|
obstack_1grow (output, *tokptr);
|
++tokptr;
|
++tokptr;
|
}
|
}
|
}
|
}
|
break;
|
break;
|
|
|
/* We handle UCNs later. We could handle them here, but that
|
/* We handle UCNs later. We could handle them here, but that
|
would mean a spurious error in the case where the UCN could
|
would mean a spurious error in the case where the UCN could
|
be converted to the target charset but not the host
|
be converted to the target charset but not the host
|
charset. */
|
charset. */
|
case 'u':
|
case 'u':
|
case 'U':
|
case 'U':
|
{
|
{
|
char c = *tokptr;
|
char c = *tokptr;
|
int i, len = c == 'U' ? 8 : 4;
|
int i, len = c == 'U' ? 8 : 4;
|
if (output)
|
if (output)
|
{
|
{
|
obstack_1grow (output, '\\');
|
obstack_1grow (output, '\\');
|
obstack_1grow (output, *tokptr);
|
obstack_1grow (output, *tokptr);
|
}
|
}
|
++tokptr;
|
++tokptr;
|
if (!isxdigit (*tokptr))
|
if (!isxdigit (*tokptr))
|
error (_("\\%c escape without a following hex digit"), c);
|
error (_("\\%c escape without a following hex digit"), c);
|
for (i = 0; i < len && isxdigit (*tokptr); ++i)
|
for (i = 0; i < len && isxdigit (*tokptr); ++i)
|
{
|
{
|
if (output)
|
if (output)
|
obstack_1grow (output, *tokptr);
|
obstack_1grow (output, *tokptr);
|
++tokptr;
|
++tokptr;
|
}
|
}
|
}
|
}
|
break;
|
break;
|
|
|
/* We must pass backslash through so that it does not
|
/* We must pass backslash through so that it does not
|
cause quoting during the second expansion. */
|
cause quoting during the second expansion. */
|
case '\\':
|
case '\\':
|
if (output)
|
if (output)
|
obstack_grow_str (output, "\\\\");
|
obstack_grow_str (output, "\\\\");
|
++tokptr;
|
++tokptr;
|
break;
|
break;
|
|
|
/* Escapes which undergo conversion. */
|
/* Escapes which undergo conversion. */
|
case 'a':
|
case 'a':
|
if (output)
|
if (output)
|
obstack_1grow (output, '\a');
|
obstack_1grow (output, '\a');
|
++tokptr;
|
++tokptr;
|
break;
|
break;
|
case 'b':
|
case 'b':
|
if (output)
|
if (output)
|
obstack_1grow (output, '\b');
|
obstack_1grow (output, '\b');
|
++tokptr;
|
++tokptr;
|
break;
|
break;
|
case 'f':
|
case 'f':
|
if (output)
|
if (output)
|
obstack_1grow (output, '\f');
|
obstack_1grow (output, '\f');
|
++tokptr;
|
++tokptr;
|
break;
|
break;
|
case 'n':
|
case 'n':
|
if (output)
|
if (output)
|
obstack_1grow (output, '\n');
|
obstack_1grow (output, '\n');
|
++tokptr;
|
++tokptr;
|
break;
|
break;
|
case 'r':
|
case 'r':
|
if (output)
|
if (output)
|
obstack_1grow (output, '\r');
|
obstack_1grow (output, '\r');
|
++tokptr;
|
++tokptr;
|
break;
|
break;
|
case 't':
|
case 't':
|
if (output)
|
if (output)
|
obstack_1grow (output, '\t');
|
obstack_1grow (output, '\t');
|
++tokptr;
|
++tokptr;
|
break;
|
break;
|
case 'v':
|
case 'v':
|
if (output)
|
if (output)
|
obstack_1grow (output, '\v');
|
obstack_1grow (output, '\v');
|
++tokptr;
|
++tokptr;
|
break;
|
break;
|
|
|
/* GCC extension. */
|
/* GCC extension. */
|
case 'e':
|
case 'e':
|
if (output)
|
if (output)
|
obstack_1grow (output, HOST_ESCAPE_CHAR);
|
obstack_1grow (output, HOST_ESCAPE_CHAR);
|
++tokptr;
|
++tokptr;
|
break;
|
break;
|
|
|
/* Backslash-newline expands to nothing at all. */
|
/* Backslash-newline expands to nothing at all. */
|
case '\n':
|
case '\n':
|
++tokptr;
|
++tokptr;
|
result = 0;
|
result = 0;
|
break;
|
break;
|
|
|
/* A few escapes just expand to the character itself. */
|
/* A few escapes just expand to the character itself. */
|
case '\'':
|
case '\'':
|
case '\"':
|
case '\"':
|
case '?':
|
case '?':
|
/* GCC extensions. */
|
/* GCC extensions. */
|
case '(':
|
case '(':
|
case '{':
|
case '{':
|
case '[':
|
case '[':
|
case '%':
|
case '%':
|
/* Unrecognized escapes turn into the character itself. */
|
/* Unrecognized escapes turn into the character itself. */
|
default:
|
default:
|
if (output)
|
if (output)
|
obstack_1grow (output, *tokptr);
|
obstack_1grow (output, *tokptr);
|
++tokptr;
|
++tokptr;
|
break;
|
break;
|
}
|
}
|
*ptr = tokptr;
|
*ptr = tokptr;
|
return result;
|
return result;
|
}
|
}
|
|
|
/* Parse a string or character literal from TOKPTR. The string or
|
/* Parse a string or character literal from TOKPTR. The string or
|
character may be wide or unicode. *OUTPTR is set to just after the
|
character may be wide or unicode. *OUTPTR is set to just after the
|
end of the literal in the input string. The resulting token is
|
end of the literal in the input string. The resulting token is
|
stored in VALUE. This returns a token value, either STRING or
|
stored in VALUE. This returns a token value, either STRING or
|
CHAR, depending on what was parsed. *HOST_CHARS is set to the
|
CHAR, depending on what was parsed. *HOST_CHARS is set to the
|
number of host characters in the literal. */
|
number of host characters in the literal. */
|
static int
|
static int
|
parse_string_or_char (char *tokptr, char **outptr, struct typed_stoken *value,
|
parse_string_or_char (char *tokptr, char **outptr, struct typed_stoken *value,
|
int *host_chars)
|
int *host_chars)
|
{
|
{
|
int quote, i;
|
int quote, i;
|
enum c_string_type type;
|
enum c_string_type type;
|
|
|
/* Build the gdb internal form of the input string in tempbuf. Note
|
/* Build the gdb internal form of the input string in tempbuf. Note
|
that the buffer is null byte terminated *only* for the
|
that the buffer is null byte terminated *only* for the
|
convenience of debugging gdb itself and printing the buffer
|
convenience of debugging gdb itself and printing the buffer
|
contents when the buffer contains no embedded nulls. Gdb does
|
contents when the buffer contains no embedded nulls. Gdb does
|
not depend upon the buffer being null byte terminated, it uses
|
not depend upon the buffer being null byte terminated, it uses
|
the length string instead. This allows gdb to handle C strings
|
the length string instead. This allows gdb to handle C strings
|
(as well as strings in other languages) with embedded null
|
(as well as strings in other languages) with embedded null
|
bytes */
|
bytes */
|
|
|
if (!tempbuf_init)
|
if (!tempbuf_init)
|
tempbuf_init = 1;
|
tempbuf_init = 1;
|
else
|
else
|
obstack_free (&tempbuf, NULL);
|
obstack_free (&tempbuf, NULL);
|
obstack_init (&tempbuf);
|
obstack_init (&tempbuf);
|
|
|
/* Record the string type. */
|
/* Record the string type. */
|
if (*tokptr == 'L')
|
if (*tokptr == 'L')
|
{
|
{
|
type = C_WIDE_STRING;
|
type = C_WIDE_STRING;
|
++tokptr;
|
++tokptr;
|
}
|
}
|
else if (*tokptr == 'u')
|
else if (*tokptr == 'u')
|
{
|
{
|
type = C_STRING_16;
|
type = C_STRING_16;
|
++tokptr;
|
++tokptr;
|
}
|
}
|
else if (*tokptr == 'U')
|
else if (*tokptr == 'U')
|
{
|
{
|
type = C_STRING_32;
|
type = C_STRING_32;
|
++tokptr;
|
++tokptr;
|
}
|
}
|
else
|
else
|
type = C_STRING;
|
type = C_STRING;
|
|
|
/* Skip the quote. */
|
/* Skip the quote. */
|
quote = *tokptr;
|
quote = *tokptr;
|
if (quote == '\'')
|
if (quote == '\'')
|
type |= C_CHAR;
|
type |= C_CHAR;
|
++tokptr;
|
++tokptr;
|
|
|
*host_chars = 0;
|
*host_chars = 0;
|
|
|
while (*tokptr)
|
while (*tokptr)
|
{
|
{
|
char c = *tokptr;
|
char c = *tokptr;
|
if (c == '\\')
|
if (c == '\\')
|
{
|
{
|
++tokptr;
|
++tokptr;
|
*host_chars += c_parse_escape (&tokptr, &tempbuf);
|
*host_chars += c_parse_escape (&tokptr, &tempbuf);
|
}
|
}
|
else if (c == quote)
|
else if (c == quote)
|
break;
|
break;
|
else
|
else
|
{
|
{
|
obstack_1grow (&tempbuf, c);
|
obstack_1grow (&tempbuf, c);
|
++tokptr;
|
++tokptr;
|
/* FIXME: this does the wrong thing with multi-byte host
|
/* FIXME: this does the wrong thing with multi-byte host
|
characters. We could use mbrlen here, but that would
|
characters. We could use mbrlen here, but that would
|
make "set host-charset" a bit less useful. */
|
make "set host-charset" a bit less useful. */
|
++*host_chars;
|
++*host_chars;
|
}
|
}
|
}
|
}
|
|
|
if (*tokptr != quote)
|
if (*tokptr != quote)
|
{
|
{
|
if (quote == '"')
|
if (quote == '"')
|
error ("Unterminated string in expression.");
|
error ("Unterminated string in expression.");
|
else
|
else
|
error ("Unmatched single quote.");
|
error ("Unmatched single quote.");
|
}
|
}
|
++tokptr;
|
++tokptr;
|
|
|
value->type = type;
|
value->type = type;
|
value->ptr = obstack_base (&tempbuf);
|
value->ptr = obstack_base (&tempbuf);
|
value->length = obstack_object_size (&tempbuf);
|
value->length = obstack_object_size (&tempbuf);
|
|
|
*outptr = tokptr;
|
*outptr = tokptr;
|
|
|
return quote == '"' ? STRING : CHAR;
|
return quote == '"' ? STRING : CHAR;
|
}
|
}
|
|
|
struct token
|
struct token
|
{
|
{
|
char *operator;
|
char *operator;
|
int token;
|
int token;
|
enum exp_opcode opcode;
|
enum exp_opcode opcode;
|
int cxx_only;
|
int cxx_only;
|
};
|
};
|
|
|
static const struct token tokentab3[] =
|
static const struct token tokentab3[] =
|
{
|
{
|
{">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
|
{">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
|
{"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
|
{"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
|
{"->*", ARROW_STAR, BINOP_END, 1}
|
{"->*", ARROW_STAR, BINOP_END, 1}
|
};
|
};
|
|
|
static const struct token tokentab2[] =
|
static const struct token tokentab2[] =
|
{
|
{
|
{"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
|
{"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
|
{"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
|
{"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
|
{"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
|
{"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
|
{"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
|
{"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
|
{"%=", ASSIGN_MODIFY, BINOP_REM, 0},
|
{"%=", ASSIGN_MODIFY, BINOP_REM, 0},
|
{"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
|
{"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
|
{"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
|
{"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
|
{"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
|
{"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
|
{"++", INCREMENT, BINOP_END, 0},
|
{"++", INCREMENT, BINOP_END, 0},
|
{"--", DECREMENT, BINOP_END, 0},
|
{"--", DECREMENT, BINOP_END, 0},
|
{"->", ARROW, BINOP_END, 0},
|
{"->", ARROW, BINOP_END, 0},
|
{"&&", ANDAND, BINOP_END, 0},
|
{"&&", ANDAND, BINOP_END, 0},
|
{"||", OROR, BINOP_END, 0},
|
{"||", OROR, BINOP_END, 0},
|
/* "::" is *not* only C++: gdb overrides its meaning in several
|
/* "::" is *not* only C++: gdb overrides its meaning in several
|
different ways, e.g., 'filename'::func, function::variable. */
|
different ways, e.g., 'filename'::func, function::variable. */
|
{"::", COLONCOLON, BINOP_END, 0},
|
{"::", COLONCOLON, BINOP_END, 0},
|
{"<<", LSH, BINOP_END, 0},
|
{"<<", LSH, BINOP_END, 0},
|
{">>", RSH, BINOP_END, 0},
|
{">>", RSH, BINOP_END, 0},
|
{"==", EQUAL, BINOP_END, 0},
|
{"==", EQUAL, BINOP_END, 0},
|
{"!=", NOTEQUAL, BINOP_END, 0},
|
{"!=", NOTEQUAL, BINOP_END, 0},
|
{"<=", LEQ, BINOP_END, 0},
|
{"<=", LEQ, BINOP_END, 0},
|
{">=", GEQ, BINOP_END, 0},
|
{">=", GEQ, BINOP_END, 0},
|
{".*", DOT_STAR, BINOP_END, 1}
|
{".*", DOT_STAR, BINOP_END, 1}
|
};
|
};
|
|
|
/* Identifier-like tokens. */
|
/* Identifier-like tokens. */
|
static const struct token ident_tokens[] =
|
static const struct token ident_tokens[] =
|
{
|
{
|
{"unsigned", UNSIGNED, OP_NULL, 0},
|
{"unsigned", UNSIGNED, OP_NULL, 0},
|
{"template", TEMPLATE, OP_NULL, 1},
|
{"template", TEMPLATE, OP_NULL, 1},
|
{"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
|
{"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
|
{"struct", STRUCT, OP_NULL, 0},
|
{"struct", STRUCT, OP_NULL, 0},
|
{"signed", SIGNED_KEYWORD, OP_NULL, 0},
|
{"signed", SIGNED_KEYWORD, OP_NULL, 0},
|
{"sizeof", SIZEOF, OP_NULL, 0},
|
{"sizeof", SIZEOF, OP_NULL, 0},
|
{"double", DOUBLE_KEYWORD, OP_NULL, 0},
|
{"double", DOUBLE_KEYWORD, OP_NULL, 0},
|
{"false", FALSEKEYWORD, OP_NULL, 1},
|
{"false", FALSEKEYWORD, OP_NULL, 1},
|
{"class", CLASS, OP_NULL, 1},
|
{"class", CLASS, OP_NULL, 1},
|
{"union", UNION, OP_NULL, 0},
|
{"union", UNION, OP_NULL, 0},
|
{"short", SHORT, OP_NULL, 0},
|
{"short", SHORT, OP_NULL, 0},
|
{"const", CONST_KEYWORD, OP_NULL, 0},
|
{"const", CONST_KEYWORD, OP_NULL, 0},
|
{"enum", ENUM, OP_NULL, 0},
|
{"enum", ENUM, OP_NULL, 0},
|
{"long", LONG, OP_NULL, 0},
|
{"long", LONG, OP_NULL, 0},
|
{"true", TRUEKEYWORD, OP_NULL, 1},
|
{"true", TRUEKEYWORD, OP_NULL, 1},
|
{"int", INT_KEYWORD, OP_NULL, 0},
|
{"int", INT_KEYWORD, OP_NULL, 0},
|
{"new", NEW, OP_NULL, 1},
|
{"new", NEW, OP_NULL, 1},
|
{"delete", DELETE, OP_NULL, 1},
|
{"delete", DELETE, OP_NULL, 1},
|
{"operator", OPERATOR, OP_NULL, 1},
|
{"operator", OPERATOR, OP_NULL, 1},
|
|
|
{"and", ANDAND, BINOP_END, 1},
|
{"and", ANDAND, BINOP_END, 1},
|
{"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, 1},
|
{"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, 1},
|
{"bitand", '&', OP_NULL, 1},
|
{"bitand", '&', OP_NULL, 1},
|
{"bitor", '|', OP_NULL, 1},
|
{"bitor", '|', OP_NULL, 1},
|
{"compl", '~', OP_NULL, 1},
|
{"compl", '~', OP_NULL, 1},
|
{"not", '!', OP_NULL, 1},
|
{"not", '!', OP_NULL, 1},
|
{"not_eq", NOTEQUAL, BINOP_END, 1},
|
{"not_eq", NOTEQUAL, BINOP_END, 1},
|
{"or", OROR, BINOP_END, 1},
|
{"or", OROR, BINOP_END, 1},
|
{"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 1},
|
{"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 1},
|
{"xor", '^', OP_NULL, 1},
|
{"xor", '^', OP_NULL, 1},
|
{"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 1},
|
{"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 1},
|
|
|
{"const_cast", CONST_CAST, OP_NULL, 1 },
|
{"const_cast", CONST_CAST, OP_NULL, 1 },
|
{"dynamic_cast", DYNAMIC_CAST, OP_NULL, 1 },
|
{"dynamic_cast", DYNAMIC_CAST, OP_NULL, 1 },
|
{"static_cast", STATIC_CAST, OP_NULL, 1 },
|
{"static_cast", STATIC_CAST, OP_NULL, 1 },
|
{"reinterpret_cast", REINTERPRET_CAST, OP_NULL, 1 }
|
{"reinterpret_cast", REINTERPRET_CAST, OP_NULL, 1 }
|
};
|
};
|
|
|
/* When we find that lexptr (the global var defined in parse.c) is
|
/* When we find that lexptr (the global var defined in parse.c) is
|
pointing at a macro invocation, we expand the invocation, and call
|
pointing at a macro invocation, we expand the invocation, and call
|
scan_macro_expansion to save the old lexptr here and point lexptr
|
scan_macro_expansion to save the old lexptr here and point lexptr
|
into the expanded text. When we reach the end of that, we call
|
into the expanded text. When we reach the end of that, we call
|
end_macro_expansion to pop back to the value we saved here. The
|
end_macro_expansion to pop back to the value we saved here. The
|
macro expansion code promises to return only fully-expanded text,
|
macro expansion code promises to return only fully-expanded text,
|
so we don't need to "push" more than one level.
|
so we don't need to "push" more than one level.
|
|
|
This is disgusting, of course. It would be cleaner to do all macro
|
This is disgusting, of course. It would be cleaner to do all macro
|
expansion beforehand, and then hand that to lexptr. But we don't
|
expansion beforehand, and then hand that to lexptr. But we don't
|
really know where the expression ends. Remember, in a command like
|
really know where the expression ends. Remember, in a command like
|
|
|
(gdb) break *ADDRESS if CONDITION
|
(gdb) break *ADDRESS if CONDITION
|
|
|
we evaluate ADDRESS in the scope of the current frame, but we
|
we evaluate ADDRESS in the scope of the current frame, but we
|
evaluate CONDITION in the scope of the breakpoint's location. So
|
evaluate CONDITION in the scope of the breakpoint's location. So
|
it's simply wrong to try to macro-expand the whole thing at once. */
|
it's simply wrong to try to macro-expand the whole thing at once. */
|
static char *macro_original_text;
|
static char *macro_original_text;
|
|
|
/* We save all intermediate macro expansions on this obstack for the
|
/* We save all intermediate macro expansions on this obstack for the
|
duration of a single parse. The expansion text may sometimes have
|
duration of a single parse. The expansion text may sometimes have
|
to live past the end of the expansion, due to yacc lookahead.
|
to live past the end of the expansion, due to yacc lookahead.
|
Rather than try to be clever about saving the data for a single
|
Rather than try to be clever about saving the data for a single
|
token, we simply keep it all and delete it after parsing has
|
token, we simply keep it all and delete it after parsing has
|
completed. */
|
completed. */
|
static struct obstack expansion_obstack;
|
static struct obstack expansion_obstack;
|
|
|
static void
|
static void
|
scan_macro_expansion (char *expansion)
|
scan_macro_expansion (char *expansion)
|
{
|
{
|
char *copy;
|
char *copy;
|
|
|
/* We'd better not be trying to push the stack twice. */
|
/* We'd better not be trying to push the stack twice. */
|
gdb_assert (! macro_original_text);
|
gdb_assert (! macro_original_text);
|
|
|
/* Copy to the obstack, and then free the intermediate
|
/* Copy to the obstack, and then free the intermediate
|
expansion. */
|
expansion. */
|
copy = obstack_copy0 (&expansion_obstack, expansion, strlen (expansion));
|
copy = obstack_copy0 (&expansion_obstack, expansion, strlen (expansion));
|
xfree (expansion);
|
xfree (expansion);
|
|
|
/* Save the old lexptr value, so we can return to it when we're done
|
/* Save the old lexptr value, so we can return to it when we're done
|
parsing the expanded text. */
|
parsing the expanded text. */
|
macro_original_text = lexptr;
|
macro_original_text = lexptr;
|
lexptr = copy;
|
lexptr = copy;
|
}
|
}
|
|
|
|
|
static int
|
static int
|
scanning_macro_expansion (void)
|
scanning_macro_expansion (void)
|
{
|
{
|
return macro_original_text != 0;
|
return macro_original_text != 0;
|
}
|
}
|
|
|
|
|
static void
|
static void
|
finished_macro_expansion (void)
|
finished_macro_expansion (void)
|
{
|
{
|
/* There'd better be something to pop back to. */
|
/* There'd better be something to pop back to. */
|
gdb_assert (macro_original_text);
|
gdb_assert (macro_original_text);
|
|
|
/* Pop back to the original text. */
|
/* Pop back to the original text. */
|
lexptr = macro_original_text;
|
lexptr = macro_original_text;
|
macro_original_text = 0;
|
macro_original_text = 0;
|
}
|
}
|
|
|
|
|
static void
|
static void
|
scan_macro_cleanup (void *dummy)
|
scan_macro_cleanup (void *dummy)
|
{
|
{
|
if (macro_original_text)
|
if (macro_original_text)
|
finished_macro_expansion ();
|
finished_macro_expansion ();
|
|
|
obstack_free (&expansion_obstack, NULL);
|
obstack_free (&expansion_obstack, NULL);
|
}
|
}
|
|
|
/* Return true iff the token represents a C++ cast operator. */
|
/* Return true iff the token represents a C++ cast operator. */
|
|
|
static int
|
static int
|
is_cast_operator (const char *token, int len)
|
is_cast_operator (const char *token, int len)
|
{
|
{
|
return (! strncmp (token, "dynamic_cast", len)
|
return (! strncmp (token, "dynamic_cast", len)
|
|| ! strncmp (token, "static_cast", len)
|
|| ! strncmp (token, "static_cast", len)
|
|| ! strncmp (token, "reinterpret_cast", len)
|
|| ! strncmp (token, "reinterpret_cast", len)
|
|| ! strncmp (token, "const_cast", len));
|
|| ! strncmp (token, "const_cast", len));
|
}
|
}
|
|
|
/* The scope used for macro expansion. */
|
/* The scope used for macro expansion. */
|
static struct macro_scope *expression_macro_scope;
|
static struct macro_scope *expression_macro_scope;
|
|
|
/* This is set if a NAME token appeared at the very end of the input
|
/* This is set if a NAME token appeared at the very end of the input
|
string, with no whitespace separating the name from the EOF. This
|
string, with no whitespace separating the name from the EOF. This
|
is used only when parsing to do field name completion. */
|
is used only when parsing to do field name completion. */
|
static int saw_name_at_eof;
|
static int saw_name_at_eof;
|
|
|
/* This is set if the previously-returned token was a structure
|
/* This is set if the previously-returned token was a structure
|
operator -- either '.' or ARROW. This is used only when parsing to
|
operator -- either '.' or ARROW. This is used only when parsing to
|
do field name completion. */
|
do field name completion. */
|
static int last_was_structop;
|
static int last_was_structop;
|
|
|
/* Read one token, getting characters through lexptr. */
|
/* Read one token, getting characters through lexptr. */
|
|
|
static int
|
static int
|
yylex (void)
|
yylex (void)
|
{
|
{
|
int c;
|
int c;
|
int namelen;
|
int namelen;
|
unsigned int i;
|
unsigned int i;
|
char *tokstart;
|
char *tokstart;
|
int saw_structop = last_was_structop;
|
int saw_structop = last_was_structop;
|
char *copy;
|
char *copy;
|
|
|
last_was_structop = 0;
|
last_was_structop = 0;
|
|
|
retry:
|
retry:
|
|
|
/* Check if this is a macro invocation that we need to expand. */
|
/* Check if this is a macro invocation that we need to expand. */
|
if (! scanning_macro_expansion ())
|
if (! scanning_macro_expansion ())
|
{
|
{
|
char *expanded = macro_expand_next (&lexptr,
|
char *expanded = macro_expand_next (&lexptr,
|
standard_macro_lookup,
|
standard_macro_lookup,
|
expression_macro_scope);
|
expression_macro_scope);
|
|
|
if (expanded)
|
if (expanded)
|
scan_macro_expansion (expanded);
|
scan_macro_expansion (expanded);
|
}
|
}
|
|
|
prev_lexptr = lexptr;
|
prev_lexptr = lexptr;
|
|
|
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 (strncmp (tokstart, tokentab3[i].operator, 3) == 0)
|
if (strncmp (tokstart, tokentab3[i].operator, 3) == 0)
|
{
|
{
|
if (tokentab3[i].cxx_only
|
if (tokentab3[i].cxx_only
|
&& parse_language->la_language != language_cplus)
|
&& parse_language->la_language != language_cplus)
|
break;
|
break;
|
|
|
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 (strncmp (tokstart, tokentab2[i].operator, 2) == 0)
|
if (strncmp (tokstart, tokentab2[i].operator, 2) == 0)
|
{
|
{
|
if (tokentab2[i].cxx_only
|
if (tokentab2[i].cxx_only
|
&& parse_language->la_language != language_cplus)
|
&& parse_language->la_language != language_cplus)
|
break;
|
break;
|
|
|
lexptr += 2;
|
lexptr += 2;
|
yylval.opcode = tokentab2[i].opcode;
|
yylval.opcode = tokentab2[i].opcode;
|
if (in_parse_field && tokentab2[i].token == ARROW)
|
if (in_parse_field && tokentab2[i].token == ARROW)
|
last_was_structop = 1;
|
last_was_structop = 1;
|
return tokentab2[i].token;
|
return tokentab2[i].token;
|
}
|
}
|
|
|
switch (c = *tokstart)
|
switch (c = *tokstart)
|
{
|
{
|
case 0:
|
case 0:
|
/* If we were just scanning the result of a macro expansion,
|
/* If we were just scanning the result of a macro expansion,
|
then we need to resume scanning the original text.
|
then we need to resume scanning the original text.
|
If we're parsing for field name completion, and the previous
|
If we're parsing for field name completion, and the previous
|
token allows such completion, return a COMPLETE token.
|
token allows such completion, return a COMPLETE token.
|
Otherwise, we were already scanning the original text, and
|
Otherwise, we were already scanning the original text, and
|
we're really done. */
|
we're really done. */
|
if (scanning_macro_expansion ())
|
if (scanning_macro_expansion ())
|
{
|
{
|
finished_macro_expansion ();
|
finished_macro_expansion ();
|
goto retry;
|
goto retry;
|
}
|
}
|
else if (saw_name_at_eof)
|
else if (saw_name_at_eof)
|
{
|
{
|
saw_name_at_eof = 0;
|
saw_name_at_eof = 0;
|
return COMPLETE;
|
return COMPLETE;
|
}
|
}
|
else if (saw_structop)
|
else if (saw_structop)
|
return COMPLETE;
|
return COMPLETE;
|
else
|
else
|
return 0;
|
return 0;
|
|
|
case ' ':
|
case ' ':
|
case '\t':
|
case '\t':
|
case '\n':
|
case '\n':
|
lexptr++;
|
lexptr++;
|
goto retry;
|
goto retry;
|
|
|
case '[':
|
case '[':
|
case '(':
|
case '(':
|
paren_depth++;
|
paren_depth++;
|
lexptr++;
|
lexptr++;
|
return c;
|
return c;
|
|
|
case ']':
|
case ']':
|
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
|
if (comma_terminates
|
&& paren_depth == 0
|
&& paren_depth == 0
|
&& ! scanning_macro_expansion ())
|
&& ! scanning_macro_expansion ())
|
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')
|
{
|
{
|
if (in_parse_field)
|
if (in_parse_field)
|
last_was_structop = 1;
|
last_was_structop = 1;
|
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;
|
char *p = tokstart;
|
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 '}':
|
symbol:
|
symbol:
|
lexptr++;
|
lexptr++;
|
return c;
|
return c;
|
|
|
case 'L':
|
case 'L':
|
case 'u':
|
case 'u':
|
case 'U':
|
case 'U':
|
if (tokstart[1] != '"' && tokstart[1] != '\'')
|
if (tokstart[1] != '"' && tokstart[1] != '\'')
|
break;
|
break;
|
/* Fall through. */
|
/* Fall through. */
|
case '\'':
|
case '\'':
|
case '"':
|
case '"':
|
{
|
{
|
int host_len;
|
int host_len;
|
int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
|
int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
|
&host_len);
|
&host_len);
|
if (result == CHAR)
|
if (result == CHAR)
|
{
|
{
|
if (host_len == 0)
|
if (host_len == 0)
|
error ("Empty character constant.");
|
error ("Empty character constant.");
|
else if (host_len > 2 && c == '\'')
|
else if (host_len > 2 && c == '\'')
|
{
|
{
|
++tokstart;
|
++tokstart;
|
namelen = lexptr - tokstart - 1;
|
namelen = lexptr - tokstart - 1;
|
goto tryname;
|
goto tryname;
|
}
|
}
|
else if (host_len > 1)
|
else if (host_len > 1)
|
error ("Invalid character constant.");
|
error ("Invalid character constant.");
|
}
|
}
|
return result;
|
return result;
|
}
|
}
|
}
|
}
|
|
|
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 (! is_cast_operator (tokstart, namelen))
|
if (! is_cast_operator (tokstart, namelen))
|
{
|
{
|
/* 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;
|
}
|
}
|
c = tokstart[++namelen];
|
c = tokstart[++namelen];
|
}
|
}
|
|
|
/* The token "if" terminates the expression and is NOT removed from
|
/* The token "if" terminates the expression and is NOT removed from
|
the input stream. It doesn't count if it appears in the
|
the input stream. It doesn't count if it appears in the
|
expansion of a macro. */
|
expansion of a macro. */
|
if (namelen == 2
|
if (namelen == 2
|
&& tokstart[0] == 'i'
|
&& tokstart[0] == 'i'
|
&& tokstart[1] == 'f'
|
&& tokstart[1] == 'f'
|
&& ! scanning_macro_expansion ())
|
&& ! scanning_macro_expansion ())
|
{
|
{
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* For the same reason (breakpoint conditions), "thread N"
|
/* For the same reason (breakpoint conditions), "thread N"
|
terminates the expression. "thread" could be an identifier, but
|
terminates the expression. "thread" could be an identifier, but
|
an identifier is never followed by a number without intervening
|
an identifier is never followed by a number without intervening
|
punctuation. "task" is similar. Handle abbreviations of these,
|
punctuation. "task" is similar. Handle abbreviations of these,
|
similarly to breakpoint.c:find_condition_and_thread. */
|
similarly to breakpoint.c:find_condition_and_thread. */
|
if (namelen >= 1
|
if (namelen >= 1
|
&& (strncmp (tokstart, "thread", namelen) == 0
|
&& (strncmp (tokstart, "thread", namelen) == 0
|
|| strncmp (tokstart, "task", namelen) == 0)
|
|| strncmp (tokstart, "task", namelen) == 0)
|
&& (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
|
&& (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
|
&& ! scanning_macro_expansion ())
|
&& ! scanning_macro_expansion ())
|
{
|
{
|
char *p = tokstart + namelen + 1;
|
char *p = tokstart + namelen + 1;
|
while (*p == ' ' || *p == '\t')
|
while (*p == ' ' || *p == '\t')
|
p++;
|
p++;
|
if (*p >= '0' && *p <= '9')
|
if (*p >= '0' && *p <= '9')
|
return 0;
|
return 0;
|
}
|
}
|
|
|
lexptr += namelen;
|
lexptr += namelen;
|
|
|
tryname:
|
tryname:
|
|
|
yylval.sval.ptr = tokstart;
|
yylval.sval.ptr = tokstart;
|
yylval.sval.length = namelen;
|
yylval.sval.length = namelen;
|
|
|
/* Catch specific keywords. */
|
/* Catch specific keywords. */
|
copy = copy_name (yylval.sval);
|
copy = copy_name (yylval.sval);
|
for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
|
for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
|
if (strcmp (copy, ident_tokens[i].operator) == 0)
|
if (strcmp (copy, ident_tokens[i].operator) == 0)
|
{
|
{
|
if (ident_tokens[i].cxx_only
|
if (ident_tokens[i].cxx_only
|
&& parse_language->la_language != language_cplus)
|
&& parse_language->la_language != language_cplus)
|
break;
|
break;
|
|
|
/* It is ok to always set this, even though we don't always
|
/* It is ok to always set this, even though we don't always
|
strictly need to. */
|
strictly need to. */
|
yylval.opcode = ident_tokens[i].opcode;
|
yylval.opcode = ident_tokens[i].opcode;
|
return ident_tokens[i].token;
|
return ident_tokens[i].token;
|
}
|
}
|
|
|
if (*tokstart == '$')
|
if (*tokstart == '$')
|
{
|
{
|
write_dollar_variable (yylval.sval);
|
write_dollar_variable (yylval.sval);
|
return VARIABLE;
|
return VARIABLE;
|
}
|
}
|
|
|
/* 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. */
|
{
|
{
|
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 (copy, expression_context_block,
|
sym = lookup_symbol (copy, expression_context_block,
|
VAR_DOMAIN,
|
VAR_DOMAIN,
|
parse_language->la_language == language_cplus
|
parse_language->la_language == language_cplus
|
? &is_a_field_of_this : (int *) NULL);
|
? &is_a_field_of_this : (int *) 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 (copy);
|
symtab = lookup_symtab (copy);
|
|
|
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)
|
{
|
{
|
/* NOTE: carlton/2003-09-25: There used to be code here to
|
/* NOTE: carlton/2003-09-25: There used to be code here to
|
handle nested types. It didn't work very well. See the
|
handle nested types. It didn't work very well. See the
|
comment before qualified_type for more info. */
|
comment before qualified_type for more info. */
|
yylval.tsym.type = SYMBOL_TYPE (sym);
|
yylval.tsym.type = SYMBOL_TYPE (sym);
|
return TYPENAME;
|
return TYPENAME;
|
}
|
}
|
yylval.tsym.type
|
yylval.tsym.type
|
= language_lookup_primitive_type_by_name (parse_language,
|
= language_lookup_primitive_type_by_name (parse_language,
|
parse_gdbarch, copy);
|
parse_gdbarch, copy);
|
if (yylval.tsym.type != NULL)
|
if (yylval.tsym.type != NULL)
|
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;
|
if (in_parse_field && *lexptr == '\0')
|
if (in_parse_field && *lexptr == '\0')
|
saw_name_at_eof = 1;
|
saw_name_at_eof = 1;
|
return NAME;
|
return NAME;
|
}
|
}
|
}
|
}
|
|
|
int
|
int
|
c_parse (void)
|
c_parse (void)
|
{
|
{
|
int result;
|
int result;
|
struct cleanup *back_to = make_cleanup (free_current_contents,
|
struct cleanup *back_to = make_cleanup (free_current_contents,
|
&expression_macro_scope);
|
&expression_macro_scope);
|
|
|
/* Set up the scope for macro expansion. */
|
/* Set up the scope for macro expansion. */
|
expression_macro_scope = NULL;
|
expression_macro_scope = NULL;
|
|
|
if (expression_context_block)
|
if (expression_context_block)
|
expression_macro_scope
|
expression_macro_scope
|
= sal_macro_scope (find_pc_line (expression_context_pc, 0));
|
= sal_macro_scope (find_pc_line (expression_context_pc, 0));
|
else
|
else
|
expression_macro_scope = default_macro_scope ();
|
expression_macro_scope = default_macro_scope ();
|
if (! expression_macro_scope)
|
if (! expression_macro_scope)
|
expression_macro_scope = user_macro_scope ();
|
expression_macro_scope = user_macro_scope ();
|
|
|
/* Initialize macro expansion code. */
|
/* Initialize macro expansion code. */
|
obstack_init (&expansion_obstack);
|
obstack_init (&expansion_obstack);
|
gdb_assert (! macro_original_text);
|
gdb_assert (! macro_original_text);
|
make_cleanup (scan_macro_cleanup, 0);
|
make_cleanup (scan_macro_cleanup, 0);
|
|
|
make_cleanup_restore_integer (&yydebug);
|
make_cleanup_restore_integer (&yydebug);
|
yydebug = parser_debug;
|
yydebug = parser_debug;
|
|
|
/* Initialize some state used by the lexer. */
|
/* Initialize some state used by the lexer. */
|
last_was_structop = 0;
|
last_was_structop = 0;
|
saw_name_at_eof = 0;
|
saw_name_at_eof = 0;
|
|
|
result = yyparse ();
|
result = yyparse ();
|
do_cleanups (back_to);
|
do_cleanups (back_to);
|
return result;
|
return result;
|
}
|
}
|
|
|
|
|
void
|
void
|
yyerror (char *msg)
|
yyerror (char *msg)
|
{
|
{
|
if (prev_lexptr)
|
if (prev_lexptr)
|
lexptr = prev_lexptr;
|
lexptr = prev_lexptr;
|
|
|
error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr);
|
error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr);
|
}
|
}
|
|
|
