/* YACC parser for Ada expressions, for GDB.
|
/* YACC parser for Ada expressions, for GDB.
|
Copyright (C) 1986, 1989, 1990, 1991, 1993, 1994, 1997, 2000, 2003, 2004,
|
Copyright (C) 1986, 1989, 1990, 1991, 1993, 1994, 1997, 2000, 2003, 2004,
|
2007, 2008 Free Software Foundation, Inc.
|
2007, 2008 Free Software Foundation, Inc.
|
|
|
This file is part of GDB.
|
This file is part of GDB.
|
|
|
This program is free software; you can redistribute it and/or modify
|
This program is free software; you can redistribute it and/or modify
|
it under the terms of the GNU General Public License as published by
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 2 of the License, or
|
the Free Software Foundation; either version 2 of the License, or
|
(at your option) any later version.
|
(at your option) any later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program; if not, write to the Free Software
|
along with this program; if not, write to the Free Software
|
Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
Boston, MA 02110-1301, USA. */
|
Boston, MA 02110-1301, USA. */
|
|
|
/* Parse an Ada expression from text in a string,
|
/* Parse an Ada 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.
|
|
|
malloc's and realloc's in this file are transformed to
|
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 "ada-lang.h"
|
#include "ada-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 "frame.h"
|
#include "frame.h"
|
#include "block.h"
|
#include "block.h"
|
|
|
/* 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. These are only the variables
|
yacc generated parsers in gdb. 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. */
|
|
|
/* NOTE: This is clumsy, especially since BISON and FLEX provide --prefix
|
/* NOTE: This is clumsy, especially since BISON and FLEX provide --prefix
|
options. I presume we are maintaining it to accommodate systems
|
options. I presume we are maintaining it to accommodate systems
|
without BISON? (PNH) */
|
without BISON? (PNH) */
|
|
|
#define yymaxdepth ada_maxdepth
|
#define yymaxdepth ada_maxdepth
|
#define yyparse _ada_parse /* ada_parse calls this after initialization */
|
#define yyparse _ada_parse /* ada_parse calls this after initialization */
|
#define yylex ada_lex
|
#define yylex ada_lex
|
#define yyerror ada_error
|
#define yyerror ada_error
|
#define yylval ada_lval
|
#define yylval ada_lval
|
#define yychar ada_char
|
#define yychar ada_char
|
#define yydebug ada_debug
|
#define yydebug ada_debug
|
#define yypact ada_pact
|
#define yypact ada_pact
|
#define yyr1 ada_r1
|
#define yyr1 ada_r1
|
#define yyr2 ada_r2
|
#define yyr2 ada_r2
|
#define yydef ada_def
|
#define yydef ada_def
|
#define yychk ada_chk
|
#define yychk ada_chk
|
#define yypgo ada_pgo
|
#define yypgo ada_pgo
|
#define yyact ada_act
|
#define yyact ada_act
|
#define yyexca ada_exca
|
#define yyexca ada_exca
|
#define yyerrflag ada_errflag
|
#define yyerrflag ada_errflag
|
#define yynerrs ada_nerrs
|
#define yynerrs ada_nerrs
|
#define yyps ada_ps
|
#define yyps ada_ps
|
#define yypv ada_pv
|
#define yypv ada_pv
|
#define yys ada_s
|
#define yys ada_s
|
#define yy_yys ada_yys
|
#define yy_yys ada_yys
|
#define yystate ada_state
|
#define yystate ada_state
|
#define yytmp ada_tmp
|
#define yytmp ada_tmp
|
#define yyv ada_v
|
#define yyv ada_v
|
#define yy_yyv ada_yyv
|
#define yy_yyv ada_yyv
|
#define yyval ada_val
|
#define yyval ada_val
|
#define yylloc ada_lloc
|
#define yylloc ada_lloc
|
#define yyreds ada_reds /* With YYDEBUG defined */
|
#define yyreds ada_reds /* With YYDEBUG defined */
|
#define yytoks ada_toks /* With YYDEBUG defined */
|
#define yytoks ada_toks /* With YYDEBUG defined */
|
#define yyname ada_name /* With YYDEBUG defined */
|
#define yyname ada_name /* With YYDEBUG defined */
|
#define yyrule ada_rule /* With YYDEBUG defined */
|
#define yyrule ada_rule /* With YYDEBUG defined */
|
|
|
#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
|
|
|
struct name_info {
|
struct name_info {
|
struct symbol *sym;
|
struct symbol *sym;
|
struct minimal_symbol *msym;
|
struct minimal_symbol *msym;
|
struct block *block;
|
struct block *block;
|
struct stoken stoken;
|
struct stoken stoken;
|
};
|
};
|
|
|
static struct stoken empty_stoken = { "", 0 };
|
static struct stoken empty_stoken = { "", 0 };
|
|
|
/* If expression is in the context of TYPE'(...), then TYPE, else
|
/* If expression is in the context of TYPE'(...), then TYPE, else
|
* NULL. */
|
* NULL. */
|
static struct type *type_qualifier;
|
static struct type *type_qualifier;
|
|
|
int yyparse (void);
|
int yyparse (void);
|
|
|
static int yylex (void);
|
static int yylex (void);
|
|
|
void yyerror (char *);
|
void yyerror (char *);
|
|
|
static struct stoken string_to_operator (struct stoken);
|
static struct stoken string_to_operator (struct stoken);
|
|
|
static void write_int (LONGEST, struct type *);
|
static void write_int (LONGEST, struct type *);
|
|
|
static void write_object_renaming (struct block *, const char *, int,
|
static void write_object_renaming (struct block *, const char *, int,
|
const char *, int);
|
const char *, int);
|
|
|
static struct type* write_var_or_type (struct block *, struct stoken);
|
static struct type* write_var_or_type (struct block *, struct stoken);
|
|
|
static void write_name_assoc (struct stoken);
|
static void write_name_assoc (struct stoken);
|
|
|
static void write_exp_op_with_string (enum exp_opcode, struct stoken);
|
static void write_exp_op_with_string (enum exp_opcode, struct stoken);
|
|
|
static struct block *block_lookup (struct block *, char *);
|
static struct block *block_lookup (struct block *, char *);
|
|
|
static LONGEST convert_char_literal (struct type *, LONGEST);
|
static LONGEST convert_char_literal (struct type *, LONGEST);
|
|
|
static void write_ambiguous_var (struct block *, char *, int);
|
static void write_ambiguous_var (struct block *, char *, int);
|
|
|
static struct type *type_int (void);
|
static struct type *type_int (void);
|
|
|
static struct type *type_long (void);
|
static struct type *type_long (void);
|
|
|
static struct type *type_long_long (void);
|
static struct type *type_long_long (void);
|
|
|
static struct type *type_float (void);
|
static struct type *type_float (void);
|
|
|
static struct type *type_double (void);
|
static struct type *type_double (void);
|
|
|
static struct type *type_long_double (void);
|
static struct type *type_long_double (void);
|
|
|
static struct type *type_char (void);
|
static struct type *type_char (void);
|
|
|
static struct type *type_system_address (void);
|
static struct type *type_system_address (void);
|
|
|
%}
|
%}
|
|
|
%union
|
%union
|
{
|
{
|
LONGEST lval;
|
LONGEST lval;
|
struct {
|
struct {
|
LONGEST val;
|
LONGEST val;
|
struct type *type;
|
struct type *type;
|
} typed_val;
|
} typed_val;
|
struct {
|
struct {
|
DOUBLEST dval;
|
DOUBLEST dval;
|
struct type *type;
|
struct type *type;
|
} typed_val_float;
|
} typed_val_float;
|
struct type *tval;
|
struct type *tval;
|
struct stoken sval;
|
struct stoken sval;
|
struct block *bval;
|
struct block *bval;
|
struct internalvar *ivar;
|
struct internalvar *ivar;
|
}
|
}
|
|
|
%type positional_list component_groups component_associations
|
%type positional_list component_groups component_associations
|
%type aggregate_component_list
|
%type aggregate_component_list
|
%type var_or_type
|
%type var_or_type
|
|
|
%token INT NULL_PTR CHARLIT
|
%token INT NULL_PTR CHARLIT
|
%token FLOAT
|
%token FLOAT
|
%token COLONCOLON
|
%token COLONCOLON
|
%token STRING NAME DOT_ID
|
%token STRING NAME DOT_ID
|
%type block
|
%type block
|
%type arglist tick_arglist
|
%type arglist tick_arglist
|
|
|
%type save_qualifier
|
%type save_qualifier
|
|
|
%token DOT_ALL
|
%token DOT_ALL
|
|
|
/* 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 SPECIAL_VARIABLE
|
%token SPECIAL_VARIABLE
|
|
|
%nonassoc ASSIGN
|
%nonassoc ASSIGN
|
%left _AND_ OR XOR THEN ELSE
|
%left _AND_ OR XOR THEN ELSE
|
%left '=' NOTEQUAL '<' '>' LEQ GEQ IN DOTDOT
|
%left '=' NOTEQUAL '<' '>' LEQ GEQ IN DOTDOT
|
%left '@'
|
%left '@'
|
%left '+' '-' '&'
|
%left '+' '-' '&'
|
%left UNARY
|
%left UNARY
|
%left '*' '/' MOD REM
|
%left '*' '/' MOD REM
|
%right STARSTAR ABS NOT
|
%right STARSTAR ABS NOT
|
|
|
/* Artificial token to give NAME => ... and NAME | priority over reducing
|
/* Artificial token to give NAME => ... and NAME | priority over reducing
|
NAME to and to give ' priority over reducing
|
NAME to and to give ' priority over reducing
|
to . */
|
to . */
|
%nonassoc VAR
|
%nonassoc VAR
|
|
|
%nonassoc ARROW '|'
|
%nonassoc ARROW '|'
|
|
|
%right TICK_ACCESS TICK_ADDRESS TICK_FIRST TICK_LAST TICK_LENGTH
|
%right TICK_ACCESS TICK_ADDRESS TICK_FIRST TICK_LAST TICK_LENGTH
|
%right TICK_MAX TICK_MIN TICK_MODULUS
|
%right TICK_MAX TICK_MIN TICK_MODULUS
|
%right TICK_POS TICK_RANGE TICK_SIZE TICK_TAG TICK_VAL
|
%right TICK_POS TICK_RANGE TICK_SIZE TICK_TAG TICK_VAL
|
/* The following are right-associative only so that reductions at this
|
/* The following are right-associative only so that reductions at this
|
precedence have lower precedence than '.' and '('. The syntax still
|
precedence have lower precedence than '.' and '('. The syntax still
|
forces a.b.c, e.g., to be LEFT-associated. */
|
forces a.b.c, e.g., to be LEFT-associated. */
|
%right '.' '(' '[' DOT_ID DOT_ALL
|
%right '.' '(' '[' DOT_ID DOT_ALL
|
|
|
%token NEW OTHERS
|
%token NEW OTHERS
|
|
|
|
|
%%
|
%%
|
|
|
start : exp1
|
start : exp1
|
;
|
;
|
|
|
/* Expressions, including the sequencing operator. */
|
/* Expressions, including the sequencing operator. */
|
exp1 : exp
|
exp1 : exp
|
| exp1 ';' exp
|
| exp1 ';' exp
|
{ write_exp_elt_opcode (BINOP_COMMA); }
|
{ write_exp_elt_opcode (BINOP_COMMA); }
|
| primary ASSIGN exp /* Extension for convenience */
|
| primary ASSIGN exp /* Extension for convenience */
|
{ write_exp_elt_opcode (BINOP_ASSIGN); }
|
{ write_exp_elt_opcode (BINOP_ASSIGN); }
|
;
|
;
|
|
|
/* Expressions, not including the sequencing operator. */
|
/* Expressions, not including the sequencing operator. */
|
primary : primary DOT_ALL
|
primary : primary DOT_ALL
|
{ write_exp_elt_opcode (UNOP_IND); }
|
{ write_exp_elt_opcode (UNOP_IND); }
|
;
|
;
|
|
|
primary : primary DOT_ID
|
primary : primary DOT_ID
|
{ write_exp_op_with_string (STRUCTOP_STRUCT, $2); }
|
{ write_exp_op_with_string (STRUCTOP_STRUCT, $2); }
|
;
|
;
|
|
|
primary : primary '(' arglist ')'
|
primary : primary '(' arglist ')'
|
{
|
{
|
write_exp_elt_opcode (OP_FUNCALL);
|
write_exp_elt_opcode (OP_FUNCALL);
|
write_exp_elt_longcst ($3);
|
write_exp_elt_longcst ($3);
|
write_exp_elt_opcode (OP_FUNCALL);
|
write_exp_elt_opcode (OP_FUNCALL);
|
}
|
}
|
| var_or_type '(' arglist ')'
|
| var_or_type '(' arglist ')'
|
{
|
{
|
if ($1 != NULL)
|
if ($1 != NULL)
|
{
|
{
|
if ($3 != 1)
|
if ($3 != 1)
|
error (_("Invalid conversion"));
|
error (_("Invalid conversion"));
|
write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_type ($1);
|
write_exp_elt_type ($1);
|
write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_opcode (UNOP_CAST);
|
}
|
}
|
else
|
else
|
{
|
{
|
write_exp_elt_opcode (OP_FUNCALL);
|
write_exp_elt_opcode (OP_FUNCALL);
|
write_exp_elt_longcst ($3);
|
write_exp_elt_longcst ($3);
|
write_exp_elt_opcode (OP_FUNCALL);
|
write_exp_elt_opcode (OP_FUNCALL);
|
}
|
}
|
}
|
}
|
;
|
;
|
|
|
primary : var_or_type '\'' save_qualifier { type_qualifier = $1; }
|
primary : var_or_type '\'' save_qualifier { type_qualifier = $1; }
|
'(' exp ')'
|
'(' exp ')'
|
{
|
{
|
if ($1 == NULL)
|
if ($1 == NULL)
|
error (_("Type required for qualification"));
|
error (_("Type required for qualification"));
|
write_exp_elt_opcode (UNOP_QUAL);
|
write_exp_elt_opcode (UNOP_QUAL);
|
write_exp_elt_type ($1);
|
write_exp_elt_type ($1);
|
write_exp_elt_opcode (UNOP_QUAL);
|
write_exp_elt_opcode (UNOP_QUAL);
|
type_qualifier = $3;
|
type_qualifier = $3;
|
}
|
}
|
;
|
;
|
|
|
save_qualifier : { $$ = type_qualifier; }
|
save_qualifier : { $$ = type_qualifier; }
|
;
|
;
|
|
|
primary :
|
primary :
|
primary '(' simple_exp DOTDOT simple_exp ')'
|
primary '(' simple_exp DOTDOT simple_exp ')'
|
{ write_exp_elt_opcode (TERNOP_SLICE); }
|
{ write_exp_elt_opcode (TERNOP_SLICE); }
|
| var_or_type '(' simple_exp DOTDOT simple_exp ')'
|
| var_or_type '(' simple_exp DOTDOT simple_exp ')'
|
{ if ($1 == NULL)
|
{ if ($1 == NULL)
|
write_exp_elt_opcode (TERNOP_SLICE);
|
write_exp_elt_opcode (TERNOP_SLICE);
|
else
|
else
|
error (_("Cannot slice a type"));
|
error (_("Cannot slice a type"));
|
}
|
}
|
;
|
;
|
|
|
primary : '(' exp1 ')' { }
|
primary : '(' exp1 ')' { }
|
;
|
;
|
|
|
/* The following rule causes a conflict with the type conversion
|
/* The following rule causes a conflict with the type conversion
|
var_or_type (exp)
|
var_or_type (exp)
|
To get around it, we give '(' higher priority and add bridge rules for
|
To get around it, we give '(' higher priority and add bridge rules for
|
var_or_type (exp, exp, ...)
|
var_or_type (exp, exp, ...)
|
var_or_type (exp .. exp)
|
var_or_type (exp .. exp)
|
We also have the action for var_or_type(exp) generate a function call
|
We also have the action for var_or_type(exp) generate a function call
|
when the first symbol does not denote a type. */
|
when the first symbol does not denote a type. */
|
|
|
primary : var_or_type %prec VAR
|
primary : var_or_type %prec VAR
|
{ if ($1 != NULL)
|
{ if ($1 != NULL)
|
{
|
{
|
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);
|
}
|
}
|
}
|
}
|
;
|
;
|
|
|
primary : SPECIAL_VARIABLE /* Various GDB extensions */
|
primary : SPECIAL_VARIABLE /* Various GDB extensions */
|
{ write_dollar_variable ($1); }
|
{ write_dollar_variable ($1); }
|
;
|
;
|
|
|
primary : aggregate
|
primary : aggregate
|
;
|
;
|
|
|
simple_exp : primary
|
simple_exp : primary
|
;
|
;
|
|
|
simple_exp : '-' simple_exp %prec UNARY
|
simple_exp : '-' simple_exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_NEG); }
|
{ write_exp_elt_opcode (UNOP_NEG); }
|
;
|
;
|
|
|
simple_exp : '+' simple_exp %prec UNARY
|
simple_exp : '+' simple_exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_PLUS); }
|
{ write_exp_elt_opcode (UNOP_PLUS); }
|
;
|
;
|
|
|
simple_exp : NOT simple_exp %prec UNARY
|
simple_exp : NOT simple_exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_LOGICAL_NOT); }
|
{ write_exp_elt_opcode (UNOP_LOGICAL_NOT); }
|
;
|
;
|
|
|
simple_exp : ABS simple_exp %prec UNARY
|
simple_exp : ABS simple_exp %prec UNARY
|
{ write_exp_elt_opcode (UNOP_ABS); }
|
{ write_exp_elt_opcode (UNOP_ABS); }
|
;
|
;
|
|
|
arglist : { $$ = 0; }
|
arglist : { $$ = 0; }
|
;
|
;
|
|
|
arglist : exp
|
arglist : exp
|
{ $$ = 1; }
|
{ $$ = 1; }
|
| NAME ARROW exp
|
| NAME ARROW exp
|
{ $$ = 1; }
|
{ $$ = 1; }
|
| arglist ',' exp
|
| arglist ',' exp
|
{ $$ = $1 + 1; }
|
{ $$ = $1 + 1; }
|
| arglist ',' NAME ARROW exp
|
| arglist ',' NAME ARROW exp
|
{ $$ = $1 + 1; }
|
{ $$ = $1 + 1; }
|
;
|
;
|
|
|
primary : '{' var_or_type '}' primary %prec '.'
|
primary : '{' var_or_type '}' primary %prec '.'
|
/* GDB extension */
|
/* GDB extension */
|
{
|
{
|
if ($2 == NULL)
|
if ($2 == NULL)
|
error (_("Type required within braces in coercion"));
|
error (_("Type required within braces in coercion"));
|
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);
|
}
|
}
|
;
|
;
|
|
|
/* Binary operators in order of decreasing precedence. */
|
/* Binary operators in order of decreasing precedence. */
|
|
|
simple_exp : simple_exp STARSTAR simple_exp
|
simple_exp : simple_exp STARSTAR simple_exp
|
{ write_exp_elt_opcode (BINOP_EXP); }
|
{ write_exp_elt_opcode (BINOP_EXP); }
|
;
|
;
|
|
|
simple_exp : simple_exp '*' simple_exp
|
simple_exp : simple_exp '*' simple_exp
|
{ write_exp_elt_opcode (BINOP_MUL); }
|
{ write_exp_elt_opcode (BINOP_MUL); }
|
;
|
;
|
|
|
simple_exp : simple_exp '/' simple_exp
|
simple_exp : simple_exp '/' simple_exp
|
{ write_exp_elt_opcode (BINOP_DIV); }
|
{ write_exp_elt_opcode (BINOP_DIV); }
|
;
|
;
|
|
|
simple_exp : simple_exp REM simple_exp /* May need to be fixed to give correct Ada REM */
|
simple_exp : simple_exp REM simple_exp /* May need to be fixed to give correct Ada REM */
|
{ write_exp_elt_opcode (BINOP_REM); }
|
{ write_exp_elt_opcode (BINOP_REM); }
|
;
|
;
|
|
|
simple_exp : simple_exp MOD simple_exp
|
simple_exp : simple_exp MOD simple_exp
|
{ write_exp_elt_opcode (BINOP_MOD); }
|
{ write_exp_elt_opcode (BINOP_MOD); }
|
;
|
;
|
|
|
simple_exp : simple_exp '@' simple_exp /* GDB extension */
|
simple_exp : simple_exp '@' simple_exp /* GDB extension */
|
{ write_exp_elt_opcode (BINOP_REPEAT); }
|
{ write_exp_elt_opcode (BINOP_REPEAT); }
|
;
|
;
|
|
|
simple_exp : simple_exp '+' simple_exp
|
simple_exp : simple_exp '+' simple_exp
|
{ write_exp_elt_opcode (BINOP_ADD); }
|
{ write_exp_elt_opcode (BINOP_ADD); }
|
;
|
;
|
|
|
simple_exp : simple_exp '&' simple_exp
|
simple_exp : simple_exp '&' simple_exp
|
{ write_exp_elt_opcode (BINOP_CONCAT); }
|
{ write_exp_elt_opcode (BINOP_CONCAT); }
|
;
|
;
|
|
|
simple_exp : simple_exp '-' simple_exp
|
simple_exp : simple_exp '-' simple_exp
|
{ write_exp_elt_opcode (BINOP_SUB); }
|
{ write_exp_elt_opcode (BINOP_SUB); }
|
;
|
;
|
|
|
relation : simple_exp
|
relation : simple_exp
|
;
|
;
|
|
|
relation : simple_exp '=' simple_exp
|
relation : simple_exp '=' simple_exp
|
{ write_exp_elt_opcode (BINOP_EQUAL); }
|
{ write_exp_elt_opcode (BINOP_EQUAL); }
|
;
|
;
|
|
|
relation : simple_exp NOTEQUAL simple_exp
|
relation : simple_exp NOTEQUAL simple_exp
|
{ write_exp_elt_opcode (BINOP_NOTEQUAL); }
|
{ write_exp_elt_opcode (BINOP_NOTEQUAL); }
|
;
|
;
|
|
|
relation : simple_exp LEQ simple_exp
|
relation : simple_exp LEQ simple_exp
|
{ write_exp_elt_opcode (BINOP_LEQ); }
|
{ write_exp_elt_opcode (BINOP_LEQ); }
|
;
|
;
|
|
|
relation : simple_exp IN simple_exp DOTDOT simple_exp
|
relation : simple_exp IN simple_exp DOTDOT simple_exp
|
{ write_exp_elt_opcode (TERNOP_IN_RANGE); }
|
{ write_exp_elt_opcode (TERNOP_IN_RANGE); }
|
| simple_exp IN primary TICK_RANGE tick_arglist
|
| simple_exp IN primary TICK_RANGE tick_arglist
|
{ write_exp_elt_opcode (BINOP_IN_BOUNDS);
|
{ write_exp_elt_opcode (BINOP_IN_BOUNDS);
|
write_exp_elt_longcst ((LONGEST) $5);
|
write_exp_elt_longcst ((LONGEST) $5);
|
write_exp_elt_opcode (BINOP_IN_BOUNDS);
|
write_exp_elt_opcode (BINOP_IN_BOUNDS);
|
}
|
}
|
| simple_exp IN var_or_type %prec TICK_ACCESS
|
| simple_exp IN var_or_type %prec TICK_ACCESS
|
{
|
{
|
if ($3 == NULL)
|
if ($3 == NULL)
|
error (_("Right operand of 'in' must be type"));
|
error (_("Right operand of 'in' must be type"));
|
write_exp_elt_opcode (UNOP_IN_RANGE);
|
write_exp_elt_opcode (UNOP_IN_RANGE);
|
write_exp_elt_type ($3);
|
write_exp_elt_type ($3);
|
write_exp_elt_opcode (UNOP_IN_RANGE);
|
write_exp_elt_opcode (UNOP_IN_RANGE);
|
}
|
}
|
| simple_exp NOT IN simple_exp DOTDOT simple_exp
|
| simple_exp NOT IN simple_exp DOTDOT simple_exp
|
{ write_exp_elt_opcode (TERNOP_IN_RANGE);
|
{ write_exp_elt_opcode (TERNOP_IN_RANGE);
|
write_exp_elt_opcode (UNOP_LOGICAL_NOT);
|
write_exp_elt_opcode (UNOP_LOGICAL_NOT);
|
}
|
}
|
| simple_exp NOT IN primary TICK_RANGE tick_arglist
|
| simple_exp NOT IN primary TICK_RANGE tick_arglist
|
{ write_exp_elt_opcode (BINOP_IN_BOUNDS);
|
{ write_exp_elt_opcode (BINOP_IN_BOUNDS);
|
write_exp_elt_longcst ((LONGEST) $6);
|
write_exp_elt_longcst ((LONGEST) $6);
|
write_exp_elt_opcode (BINOP_IN_BOUNDS);
|
write_exp_elt_opcode (BINOP_IN_BOUNDS);
|
write_exp_elt_opcode (UNOP_LOGICAL_NOT);
|
write_exp_elt_opcode (UNOP_LOGICAL_NOT);
|
}
|
}
|
| simple_exp NOT IN var_or_type %prec TICK_ACCESS
|
| simple_exp NOT IN var_or_type %prec TICK_ACCESS
|
{
|
{
|
if ($4 == NULL)
|
if ($4 == NULL)
|
error (_("Right operand of 'in' must be type"));
|
error (_("Right operand of 'in' must be type"));
|
write_exp_elt_opcode (UNOP_IN_RANGE);
|
write_exp_elt_opcode (UNOP_IN_RANGE);
|
write_exp_elt_type ($4);
|
write_exp_elt_type ($4);
|
write_exp_elt_opcode (UNOP_IN_RANGE);
|
write_exp_elt_opcode (UNOP_IN_RANGE);
|
write_exp_elt_opcode (UNOP_LOGICAL_NOT);
|
write_exp_elt_opcode (UNOP_LOGICAL_NOT);
|
}
|
}
|
;
|
;
|
|
|
relation : simple_exp GEQ simple_exp
|
relation : simple_exp GEQ simple_exp
|
{ write_exp_elt_opcode (BINOP_GEQ); }
|
{ write_exp_elt_opcode (BINOP_GEQ); }
|
;
|
;
|
|
|
relation : simple_exp '<' simple_exp
|
relation : simple_exp '<' simple_exp
|
{ write_exp_elt_opcode (BINOP_LESS); }
|
{ write_exp_elt_opcode (BINOP_LESS); }
|
;
|
;
|
|
|
relation : simple_exp '>' simple_exp
|
relation : simple_exp '>' simple_exp
|
{ write_exp_elt_opcode (BINOP_GTR); }
|
{ write_exp_elt_opcode (BINOP_GTR); }
|
;
|
;
|
|
|
exp : relation
|
exp : relation
|
| and_exp
|
| and_exp
|
| and_then_exp
|
| and_then_exp
|
| or_exp
|
| or_exp
|
| or_else_exp
|
| or_else_exp
|
| xor_exp
|
| xor_exp
|
;
|
;
|
|
|
and_exp :
|
and_exp :
|
relation _AND_ relation
|
relation _AND_ relation
|
{ write_exp_elt_opcode (BINOP_BITWISE_AND); }
|
{ write_exp_elt_opcode (BINOP_BITWISE_AND); }
|
| and_exp _AND_ relation
|
| and_exp _AND_ relation
|
{ write_exp_elt_opcode (BINOP_BITWISE_AND); }
|
{ write_exp_elt_opcode (BINOP_BITWISE_AND); }
|
;
|
;
|
|
|
and_then_exp :
|
and_then_exp :
|
relation _AND_ THEN relation
|
relation _AND_ THEN relation
|
{ write_exp_elt_opcode (BINOP_LOGICAL_AND); }
|
{ write_exp_elt_opcode (BINOP_LOGICAL_AND); }
|
| and_then_exp _AND_ THEN relation
|
| and_then_exp _AND_ THEN relation
|
{ write_exp_elt_opcode (BINOP_LOGICAL_AND); }
|
{ write_exp_elt_opcode (BINOP_LOGICAL_AND); }
|
;
|
;
|
|
|
or_exp :
|
or_exp :
|
relation OR relation
|
relation OR relation
|
{ write_exp_elt_opcode (BINOP_BITWISE_IOR); }
|
{ write_exp_elt_opcode (BINOP_BITWISE_IOR); }
|
| or_exp OR relation
|
| or_exp OR relation
|
{ write_exp_elt_opcode (BINOP_BITWISE_IOR); }
|
{ write_exp_elt_opcode (BINOP_BITWISE_IOR); }
|
;
|
;
|
|
|
or_else_exp :
|
or_else_exp :
|
relation OR ELSE relation
|
relation OR ELSE relation
|
{ write_exp_elt_opcode (BINOP_LOGICAL_OR); }
|
{ write_exp_elt_opcode (BINOP_LOGICAL_OR); }
|
| or_else_exp OR ELSE relation
|
| or_else_exp OR ELSE relation
|
{ write_exp_elt_opcode (BINOP_LOGICAL_OR); }
|
{ write_exp_elt_opcode (BINOP_LOGICAL_OR); }
|
;
|
;
|
|
|
xor_exp : relation XOR relation
|
xor_exp : relation XOR relation
|
{ write_exp_elt_opcode (BINOP_BITWISE_XOR); }
|
{ write_exp_elt_opcode (BINOP_BITWISE_XOR); }
|
| xor_exp XOR relation
|
| xor_exp XOR relation
|
{ write_exp_elt_opcode (BINOP_BITWISE_XOR); }
|
{ write_exp_elt_opcode (BINOP_BITWISE_XOR); }
|
;
|
;
|
|
|
/* Primaries can denote types (OP_TYPE). In cases such as
|
/* Primaries can denote types (OP_TYPE). In cases such as
|
primary TICK_ADDRESS, where a type would be invalid, it will be
|
primary TICK_ADDRESS, where a type would be invalid, it will be
|
caught when evaluate_subexp in ada-lang.c tries to evaluate the
|
caught when evaluate_subexp in ada-lang.c tries to evaluate the
|
primary, expecting a value. Precedence rules resolve the ambiguity
|
primary, expecting a value. Precedence rules resolve the ambiguity
|
in NAME TICK_ACCESS in favor of shifting to form a var_or_type. A
|
in NAME TICK_ACCESS in favor of shifting to form a var_or_type. A
|
construct such as aType'access'access will again cause an error when
|
construct such as aType'access'access will again cause an error when
|
aType'access evaluates to a type that evaluate_subexp attempts to
|
aType'access evaluates to a type that evaluate_subexp attempts to
|
evaluate. */
|
evaluate. */
|
primary : primary TICK_ACCESS
|
primary : primary TICK_ACCESS
|
{ write_exp_elt_opcode (UNOP_ADDR); }
|
{ write_exp_elt_opcode (UNOP_ADDR); }
|
| primary TICK_ADDRESS
|
| primary TICK_ADDRESS
|
{ write_exp_elt_opcode (UNOP_ADDR);
|
{ write_exp_elt_opcode (UNOP_ADDR);
|
write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_type (type_system_address ());
|
write_exp_elt_type (type_system_address ());
|
write_exp_elt_opcode (UNOP_CAST);
|
write_exp_elt_opcode (UNOP_CAST);
|
}
|
}
|
| primary TICK_FIRST tick_arglist
|
| primary TICK_FIRST tick_arglist
|
{ write_int ($3, type_int ());
|
{ write_int ($3, type_int ());
|
write_exp_elt_opcode (OP_ATR_FIRST); }
|
write_exp_elt_opcode (OP_ATR_FIRST); }
|
| primary TICK_LAST tick_arglist
|
| primary TICK_LAST tick_arglist
|
{ write_int ($3, type_int ());
|
{ write_int ($3, type_int ());
|
write_exp_elt_opcode (OP_ATR_LAST); }
|
write_exp_elt_opcode (OP_ATR_LAST); }
|
| primary TICK_LENGTH tick_arglist
|
| primary TICK_LENGTH tick_arglist
|
{ write_int ($3, type_int ());
|
{ write_int ($3, type_int ());
|
write_exp_elt_opcode (OP_ATR_LENGTH); }
|
write_exp_elt_opcode (OP_ATR_LENGTH); }
|
| primary TICK_SIZE
|
| primary TICK_SIZE
|
{ write_exp_elt_opcode (OP_ATR_SIZE); }
|
{ write_exp_elt_opcode (OP_ATR_SIZE); }
|
| primary TICK_TAG
|
| primary TICK_TAG
|
{ write_exp_elt_opcode (OP_ATR_TAG); }
|
{ write_exp_elt_opcode (OP_ATR_TAG); }
|
| opt_type_prefix TICK_MIN '(' exp ',' exp ')'
|
| opt_type_prefix TICK_MIN '(' exp ',' exp ')'
|
{ write_exp_elt_opcode (OP_ATR_MIN); }
|
{ write_exp_elt_opcode (OP_ATR_MIN); }
|
| opt_type_prefix TICK_MAX '(' exp ',' exp ')'
|
| opt_type_prefix TICK_MAX '(' exp ',' exp ')'
|
{ write_exp_elt_opcode (OP_ATR_MAX); }
|
{ write_exp_elt_opcode (OP_ATR_MAX); }
|
| opt_type_prefix TICK_POS '(' exp ')'
|
| opt_type_prefix TICK_POS '(' exp ')'
|
{ write_exp_elt_opcode (OP_ATR_POS); }
|
{ write_exp_elt_opcode (OP_ATR_POS); }
|
| type_prefix TICK_VAL '(' exp ')'
|
| type_prefix TICK_VAL '(' exp ')'
|
{ write_exp_elt_opcode (OP_ATR_VAL); }
|
{ write_exp_elt_opcode (OP_ATR_VAL); }
|
| type_prefix TICK_MODULUS
|
| type_prefix TICK_MODULUS
|
{ write_exp_elt_opcode (OP_ATR_MODULUS); }
|
{ write_exp_elt_opcode (OP_ATR_MODULUS); }
|
;
|
;
|
|
|
tick_arglist : %prec '('
|
tick_arglist : %prec '('
|
{ $$ = 1; }
|
{ $$ = 1; }
|
| '(' INT ')'
|
| '(' INT ')'
|
{ $$ = $2.val; }
|
{ $$ = $2.val; }
|
;
|
;
|
|
|
type_prefix :
|
type_prefix :
|
var_or_type
|
var_or_type
|
{
|
{
|
if ($1 == NULL)
|
if ($1 == NULL)
|
error (_("Prefix must be type"));
|
error (_("Prefix must be 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); }
|
;
|
;
|
|
|
opt_type_prefix :
|
opt_type_prefix :
|
type_prefix
|
type_prefix
|
| /* EMPTY */
|
| /* EMPTY */
|
{ write_exp_elt_opcode (OP_TYPE);
|
{ write_exp_elt_opcode (OP_TYPE);
|
write_exp_elt_type (builtin_type_void);
|
write_exp_elt_type (builtin_type_void);
|
write_exp_elt_opcode (OP_TYPE); }
|
write_exp_elt_opcode (OP_TYPE); }
|
;
|
;
|
|
|
|
|
primary : INT
|
primary : INT
|
{ write_int ((LONGEST) $1.val, $1.type); }
|
{ write_int ((LONGEST) $1.val, $1.type); }
|
;
|
;
|
|
|
primary : CHARLIT
|
primary : CHARLIT
|
{ write_int (convert_char_literal (type_qualifier, $1.val),
|
{ write_int (convert_char_literal (type_qualifier, $1.val),
|
(type_qualifier == NULL)
|
(type_qualifier == NULL)
|
? $1.type : type_qualifier);
|
? $1.type : type_qualifier);
|
}
|
}
|
;
|
;
|
|
|
primary : FLOAT
|
primary : 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);
|
}
|
}
|
;
|
;
|
|
|
primary : NULL_PTR
|
primary : NULL_PTR
|
{ write_int (0, type_int ()); }
|
{ write_int (0, type_int ()); }
|
;
|
;
|
|
|
primary : STRING
|
primary : STRING
|
{
|
{
|
write_exp_op_with_string (OP_STRING, $1);
|
write_exp_op_with_string (OP_STRING, $1);
|
}
|
}
|
;
|
;
|
|
|
primary : NEW NAME
|
primary : NEW NAME
|
{ error (_("NEW not implemented.")); }
|
{ error (_("NEW not implemented.")); }
|
;
|
;
|
|
|
var_or_type: NAME %prec VAR
|
var_or_type: NAME %prec VAR
|
{ $$ = write_var_or_type (NULL, $1); }
|
{ $$ = write_var_or_type (NULL, $1); }
|
| block NAME %prec VAR
|
| block NAME %prec VAR
|
{ $$ = write_var_or_type ($1, $2); }
|
{ $$ = write_var_or_type ($1, $2); }
|
| NAME TICK_ACCESS
|
| NAME TICK_ACCESS
|
{
|
{
|
$$ = write_var_or_type (NULL, $1);
|
$$ = write_var_or_type (NULL, $1);
|
if ($$ == NULL)
|
if ($$ == NULL)
|
write_exp_elt_opcode (UNOP_ADDR);
|
write_exp_elt_opcode (UNOP_ADDR);
|
else
|
else
|
$$ = lookup_pointer_type ($$);
|
$$ = lookup_pointer_type ($$);
|
}
|
}
|
| block NAME TICK_ACCESS
|
| block NAME TICK_ACCESS
|
{
|
{
|
$$ = write_var_or_type ($1, $2);
|
$$ = write_var_or_type ($1, $2);
|
if ($$ == NULL)
|
if ($$ == NULL)
|
write_exp_elt_opcode (UNOP_ADDR);
|
write_exp_elt_opcode (UNOP_ADDR);
|
else
|
else
|
$$ = lookup_pointer_type ($$);
|
$$ = lookup_pointer_type ($$);
|
}
|
}
|
;
|
;
|
|
|
/* GDB extension */
|
/* GDB extension */
|
block : NAME COLONCOLON
|
block : NAME COLONCOLON
|
{ $$ = block_lookup (NULL, $1.ptr); }
|
{ $$ = block_lookup (NULL, $1.ptr); }
|
| block NAME COLONCOLON
|
| block NAME COLONCOLON
|
{ $$ = block_lookup ($1, $2.ptr); }
|
{ $$ = block_lookup ($1, $2.ptr); }
|
;
|
;
|
|
|
aggregate :
|
aggregate :
|
'(' aggregate_component_list ')'
|
'(' aggregate_component_list ')'
|
{
|
{
|
write_exp_elt_opcode (OP_AGGREGATE);
|
write_exp_elt_opcode (OP_AGGREGATE);
|
write_exp_elt_longcst ($2);
|
write_exp_elt_longcst ($2);
|
write_exp_elt_opcode (OP_AGGREGATE);
|
write_exp_elt_opcode (OP_AGGREGATE);
|
}
|
}
|
;
|
;
|
|
|
aggregate_component_list :
|
aggregate_component_list :
|
component_groups { $$ = $1; }
|
component_groups { $$ = $1; }
|
| positional_list exp
|
| positional_list exp
|
{ write_exp_elt_opcode (OP_POSITIONAL);
|
{ write_exp_elt_opcode (OP_POSITIONAL);
|
write_exp_elt_longcst ($1);
|
write_exp_elt_longcst ($1);
|
write_exp_elt_opcode (OP_POSITIONAL);
|
write_exp_elt_opcode (OP_POSITIONAL);
|
$$ = $1 + 1;
|
$$ = $1 + 1;
|
}
|
}
|
| positional_list component_groups
|
| positional_list component_groups
|
{ $$ = $1 + $2; }
|
{ $$ = $1 + $2; }
|
;
|
;
|
|
|
positional_list :
|
positional_list :
|
exp ','
|
exp ','
|
{ write_exp_elt_opcode (OP_POSITIONAL);
|
{ write_exp_elt_opcode (OP_POSITIONAL);
|
write_exp_elt_longcst (0);
|
write_exp_elt_longcst (0);
|
write_exp_elt_opcode (OP_POSITIONAL);
|
write_exp_elt_opcode (OP_POSITIONAL);
|
$$ = 1;
|
$$ = 1;
|
}
|
}
|
| positional_list exp ','
|
| positional_list exp ','
|
{ write_exp_elt_opcode (OP_POSITIONAL);
|
{ write_exp_elt_opcode (OP_POSITIONAL);
|
write_exp_elt_longcst ($1);
|
write_exp_elt_longcst ($1);
|
write_exp_elt_opcode (OP_POSITIONAL);
|
write_exp_elt_opcode (OP_POSITIONAL);
|
$$ = $1 + 1;
|
$$ = $1 + 1;
|
}
|
}
|
;
|
;
|
|
|
component_groups:
|
component_groups:
|
others { $$ = 1; }
|
others { $$ = 1; }
|
| component_group { $$ = 1; }
|
| component_group { $$ = 1; }
|
| component_group ',' component_groups
|
| component_group ',' component_groups
|
{ $$ = $3 + 1; }
|
{ $$ = $3 + 1; }
|
;
|
;
|
|
|
others : OTHERS ARROW exp
|
others : OTHERS ARROW exp
|
{ write_exp_elt_opcode (OP_OTHERS); }
|
{ write_exp_elt_opcode (OP_OTHERS); }
|
;
|
;
|
|
|
component_group :
|
component_group :
|
component_associations
|
component_associations
|
{
|
{
|
write_exp_elt_opcode (OP_CHOICES);
|
write_exp_elt_opcode (OP_CHOICES);
|
write_exp_elt_longcst ($1);
|
write_exp_elt_longcst ($1);
|
write_exp_elt_opcode (OP_CHOICES);
|
write_exp_elt_opcode (OP_CHOICES);
|
}
|
}
|
;
|
;
|
|
|
/* We use this somewhat obscure definition in order to handle NAME => and
|
/* We use this somewhat obscure definition in order to handle NAME => and
|
NAME | differently from exp => and exp |. ARROW and '|' have a precedence
|
NAME | differently from exp => and exp |. ARROW and '|' have a precedence
|
above that of the reduction of NAME to var_or_type. By delaying
|
above that of the reduction of NAME to var_or_type. By delaying
|
decisions until after the => or '|', we convert the ambiguity to a
|
decisions until after the => or '|', we convert the ambiguity to a
|
resolved shift/reduce conflict. */
|
resolved shift/reduce conflict. */
|
component_associations :
|
component_associations :
|
NAME ARROW
|
NAME ARROW
|
{ write_name_assoc ($1); }
|
{ write_name_assoc ($1); }
|
exp { $$ = 1; }
|
exp { $$ = 1; }
|
| simple_exp ARROW exp
|
| simple_exp ARROW exp
|
{ $$ = 1; }
|
{ $$ = 1; }
|
| simple_exp DOTDOT simple_exp ARROW
|
| simple_exp DOTDOT simple_exp ARROW
|
{ write_exp_elt_opcode (OP_DISCRETE_RANGE);
|
{ write_exp_elt_opcode (OP_DISCRETE_RANGE);
|
write_exp_op_with_string (OP_NAME, empty_stoken);
|
write_exp_op_with_string (OP_NAME, empty_stoken);
|
}
|
}
|
exp { $$ = 1; }
|
exp { $$ = 1; }
|
| NAME '|'
|
| NAME '|'
|
{ write_name_assoc ($1); }
|
{ write_name_assoc ($1); }
|
component_associations { $$ = $4 + 1; }
|
component_associations { $$ = $4 + 1; }
|
| simple_exp '|'
|
| simple_exp '|'
|
component_associations { $$ = $3 + 1; }
|
component_associations { $$ = $3 + 1; }
|
| simple_exp DOTDOT simple_exp '|'
|
| simple_exp DOTDOT simple_exp '|'
|
{ write_exp_elt_opcode (OP_DISCRETE_RANGE); }
|
{ write_exp_elt_opcode (OP_DISCRETE_RANGE); }
|
component_associations { $$ = $6 + 1; }
|
component_associations { $$ = $6 + 1; }
|
;
|
;
|
|
|
/* Some extensions borrowed from C, for the benefit of those who find they
|
/* Some extensions borrowed from C, for the benefit of those who find they
|
can't get used to Ada notation in GDB. */
|
can't get used to Ada notation in GDB. */
|
|
|
primary : '*' primary %prec '.'
|
primary : '*' primary %prec '.'
|
{ write_exp_elt_opcode (UNOP_IND); }
|
{ write_exp_elt_opcode (UNOP_IND); }
|
| '&' primary %prec '.'
|
| '&' primary %prec '.'
|
{ write_exp_elt_opcode (UNOP_ADDR); }
|
{ write_exp_elt_opcode (UNOP_ADDR); }
|
| primary '[' exp ']'
|
| primary '[' exp ']'
|
{ write_exp_elt_opcode (BINOP_SUBSCRIPT); }
|
{ write_exp_elt_opcode (BINOP_SUBSCRIPT); }
|
;
|
;
|
|
|
%%
|
%%
|
|
|
/* yylex defined in ada-lex.c: Reads one token, getting characters */
|
/* yylex defined in ada-lex.c: Reads one token, getting characters */
|
/* through lexptr. */
|
/* through lexptr. */
|
|
|
/* Remap normal flex interface names (yylex) as well as gratuitiously */
|
/* Remap normal flex interface names (yylex) as well as gratuitiously */
|
/* global symbol names, so we can have multiple flex-generated parsers */
|
/* global symbol names, so we can have multiple flex-generated parsers */
|
/* in gdb. */
|
/* in gdb. */
|
|
|
/* (See note above on previous definitions for YACC.) */
|
/* (See note above on previous definitions for YACC.) */
|
|
|
#define yy_create_buffer ada_yy_create_buffer
|
#define yy_create_buffer ada_yy_create_buffer
|
#define yy_delete_buffer ada_yy_delete_buffer
|
#define yy_delete_buffer ada_yy_delete_buffer
|
#define yy_init_buffer ada_yy_init_buffer
|
#define yy_init_buffer ada_yy_init_buffer
|
#define yy_load_buffer_state ada_yy_load_buffer_state
|
#define yy_load_buffer_state ada_yy_load_buffer_state
|
#define yy_switch_to_buffer ada_yy_switch_to_buffer
|
#define yy_switch_to_buffer ada_yy_switch_to_buffer
|
#define yyrestart ada_yyrestart
|
#define yyrestart ada_yyrestart
|
#define yytext ada_yytext
|
#define yytext ada_yytext
|
#define yywrap ada_yywrap
|
#define yywrap ada_yywrap
|
|
|
static struct obstack temp_parse_space;
|
static struct obstack temp_parse_space;
|
|
|
/* The following kludge was found necessary to prevent conflicts between */
|
/* The following kludge was found necessary to prevent conflicts between */
|
/* defs.h and non-standard stdlib.h files. */
|
/* defs.h and non-standard stdlib.h files. */
|
#define qsort __qsort__dummy
|
#define qsort __qsort__dummy
|
#include "ada-lex.c"
|
#include "ada-lex.c"
|
|
|
int
|
int
|
ada_parse (void)
|
ada_parse (void)
|
{
|
{
|
lexer_init (yyin); /* (Re-)initialize lexer. */
|
lexer_init (yyin); /* (Re-)initialize lexer. */
|
type_qualifier = NULL;
|
type_qualifier = NULL;
|
obstack_free (&temp_parse_space, NULL);
|
obstack_free (&temp_parse_space, NULL);
|
obstack_init (&temp_parse_space);
|
obstack_init (&temp_parse_space);
|
|
|
return _ada_parse ();
|
return _ada_parse ();
|
}
|
}
|
|
|
void
|
void
|
yyerror (char *msg)
|
yyerror (char *msg)
|
{
|
{
|
error (_("Error in expression, near `%s'."), lexptr);
|
error (_("Error in expression, near `%s'."), lexptr);
|
}
|
}
|
|
|
/* The operator name corresponding to operator symbol STRING (adds
|
/* The operator name corresponding to operator symbol STRING (adds
|
quotes and maps to lower-case). Destroys the previous contents of
|
quotes and maps to lower-case). Destroys the previous contents of
|
the array pointed to by STRING.ptr. Error if STRING does not match
|
the array pointed to by STRING.ptr. Error if STRING does not match
|
a valid Ada operator. Assumes that STRING.ptr points to a
|
a valid Ada operator. Assumes that STRING.ptr points to a
|
null-terminated string and that, if STRING is a valid operator
|
null-terminated string and that, if STRING is a valid operator
|
symbol, the array pointed to by STRING.ptr contains at least
|
symbol, the array pointed to by STRING.ptr contains at least
|
STRING.length+3 characters. */
|
STRING.length+3 characters. */
|
|
|
static struct stoken
|
static struct stoken
|
string_to_operator (struct stoken string)
|
string_to_operator (struct stoken string)
|
{
|
{
|
int i;
|
int i;
|
|
|
for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
|
for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
|
{
|
{
|
if (string.length == strlen (ada_opname_table[i].decoded)-2
|
if (string.length == strlen (ada_opname_table[i].decoded)-2
|
&& strncasecmp (string.ptr, ada_opname_table[i].decoded+1,
|
&& strncasecmp (string.ptr, ada_opname_table[i].decoded+1,
|
string.length) == 0)
|
string.length) == 0)
|
{
|
{
|
strncpy (string.ptr, ada_opname_table[i].decoded,
|
strncpy (string.ptr, ada_opname_table[i].decoded,
|
string.length+2);
|
string.length+2);
|
string.length += 2;
|
string.length += 2;
|
return string;
|
return string;
|
}
|
}
|
}
|
}
|
error (_("Invalid operator symbol `%s'"), string.ptr);
|
error (_("Invalid operator symbol `%s'"), string.ptr);
|
}
|
}
|
|
|
/* Emit expression to access an instance of SYM, in block BLOCK (if
|
/* Emit expression to access an instance of SYM, in block BLOCK (if
|
* non-NULL), and with :: qualification ORIG_LEFT_CONTEXT. */
|
* non-NULL), and with :: qualification ORIG_LEFT_CONTEXT. */
|
static void
|
static void
|
write_var_from_sym (struct block *orig_left_context,
|
write_var_from_sym (struct block *orig_left_context,
|
struct block *block,
|
struct block *block,
|
struct symbol *sym)
|
struct symbol *sym)
|
{
|
{
|
if (orig_left_context == NULL && symbol_read_needs_frame (sym))
|
if (orig_left_context == NULL && symbol_read_needs_frame (sym))
|
{
|
{
|
if (innermost_block == 0
|
if (innermost_block == 0
|
|| contained_in (block, innermost_block))
|
|| contained_in (block, innermost_block))
|
innermost_block = block;
|
innermost_block = block;
|
}
|
}
|
|
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_block (block);
|
write_exp_elt_block (block);
|
write_exp_elt_sym (sym);
|
write_exp_elt_sym (sym);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
}
|
}
|
|
|
/* Write integer constant ARG of type TYPE. */
|
/* Write integer constant ARG of type TYPE. */
|
|
|
static void
|
static void
|
write_int (LONGEST arg, struct type *type)
|
write_int (LONGEST arg, struct type *type)
|
{
|
{
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (type);
|
write_exp_elt_type (type);
|
write_exp_elt_longcst (arg);
|
write_exp_elt_longcst (arg);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
}
|
}
|
|
|
/* Write an OPCODE, string, OPCODE sequence to the current expression. */
|
/* Write an OPCODE, string, OPCODE sequence to the current expression. */
|
static void
|
static void
|
write_exp_op_with_string (enum exp_opcode opcode, struct stoken token)
|
write_exp_op_with_string (enum exp_opcode opcode, struct stoken token)
|
{
|
{
|
write_exp_elt_opcode (opcode);
|
write_exp_elt_opcode (opcode);
|
write_exp_string (token);
|
write_exp_string (token);
|
write_exp_elt_opcode (opcode);
|
write_exp_elt_opcode (opcode);
|
}
|
}
|
|
|
/* Emit expression corresponding to the renamed object named
|
/* Emit expression corresponding to the renamed object named
|
* designated by RENAMED_ENTITY[0 .. RENAMED_ENTITY_LEN-1] in the
|
* designated by RENAMED_ENTITY[0 .. RENAMED_ENTITY_LEN-1] in the
|
* context of ORIG_LEFT_CONTEXT, to which is applied the operations
|
* context of ORIG_LEFT_CONTEXT, to which is applied the operations
|
* encoded by RENAMING_EXPR. MAX_DEPTH is the maximum number of
|
* encoded by RENAMING_EXPR. MAX_DEPTH is the maximum number of
|
* cascaded renamings to allow. If ORIG_LEFT_CONTEXT is null, it
|
* cascaded renamings to allow. If ORIG_LEFT_CONTEXT is null, it
|
* defaults to the currently selected block. ORIG_SYMBOL is the
|
* defaults to the currently selected block. ORIG_SYMBOL is the
|
* symbol that originally encoded the renaming. It is needed only
|
* symbol that originally encoded the renaming. It is needed only
|
* because its prefix also qualifies any index variables used to index
|
* because its prefix also qualifies any index variables used to index
|
* or slice an array. It should not be necessary once we go to the
|
* or slice an array. It should not be necessary once we go to the
|
* new encoding entirely (FIXME pnh 7/20/2007). */
|
* new encoding entirely (FIXME pnh 7/20/2007). */
|
|
|
static void
|
static void
|
write_object_renaming (struct block *orig_left_context,
|
write_object_renaming (struct block *orig_left_context,
|
const char *renamed_entity, int renamed_entity_len,
|
const char *renamed_entity, int renamed_entity_len,
|
const char *renaming_expr, int max_depth)
|
const char *renaming_expr, int max_depth)
|
{
|
{
|
char *name;
|
char *name;
|
enum { SIMPLE_INDEX, LOWER_BOUND, UPPER_BOUND } slice_state;
|
enum { SIMPLE_INDEX, LOWER_BOUND, UPPER_BOUND } slice_state;
|
struct symbol *sym;
|
struct symbol *sym;
|
struct block *block;
|
struct block *block;
|
|
|
if (max_depth <= 0)
|
if (max_depth <= 0)
|
error (_("Could not find renamed symbol"));
|
error (_("Could not find renamed symbol"));
|
|
|
if (orig_left_context == NULL)
|
if (orig_left_context == NULL)
|
orig_left_context = get_selected_block (NULL);
|
orig_left_context = get_selected_block (NULL);
|
|
|
name = obsavestring (renamed_entity, renamed_entity_len, &temp_parse_space);
|
name = obsavestring (renamed_entity, renamed_entity_len, &temp_parse_space);
|
sym = ada_lookup_encoded_symbol (name, orig_left_context, VAR_DOMAIN,
|
sym = ada_lookup_encoded_symbol (name, orig_left_context, VAR_DOMAIN,
|
&block, NULL);
|
&block, NULL);
|
if (sym == NULL)
|
if (sym == NULL)
|
error (_("Could not find renamed variable: %s"), ada_decode (name));
|
error (_("Could not find renamed variable: %s"), ada_decode (name));
|
else if (SYMBOL_CLASS (sym) == LOC_TYPEDEF)
|
else if (SYMBOL_CLASS (sym) == LOC_TYPEDEF)
|
/* We have a renaming of an old-style renaming symbol. Don't
|
/* We have a renaming of an old-style renaming symbol. Don't
|
trust the block information. */
|
trust the block information. */
|
block = orig_left_context;
|
block = orig_left_context;
|
|
|
{
|
{
|
const char *inner_renamed_entity;
|
const char *inner_renamed_entity;
|
int inner_renamed_entity_len;
|
int inner_renamed_entity_len;
|
const char *inner_renaming_expr;
|
const char *inner_renaming_expr;
|
|
|
switch (ada_parse_renaming (sym, &inner_renamed_entity,
|
switch (ada_parse_renaming (sym, &inner_renamed_entity,
|
&inner_renamed_entity_len,
|
&inner_renamed_entity_len,
|
&inner_renaming_expr))
|
&inner_renaming_expr))
|
{
|
{
|
case ADA_NOT_RENAMING:
|
case ADA_NOT_RENAMING:
|
write_var_from_sym (orig_left_context, block, sym);
|
write_var_from_sym (orig_left_context, block, sym);
|
break;
|
break;
|
case ADA_OBJECT_RENAMING:
|
case ADA_OBJECT_RENAMING:
|
write_object_renaming (block,
|
write_object_renaming (block,
|
inner_renamed_entity, inner_renamed_entity_len,
|
inner_renamed_entity, inner_renamed_entity_len,
|
inner_renaming_expr, max_depth - 1);
|
inner_renaming_expr, max_depth - 1);
|
break;
|
break;
|
default:
|
default:
|
goto BadEncoding;
|
goto BadEncoding;
|
}
|
}
|
}
|
}
|
|
|
slice_state = SIMPLE_INDEX;
|
slice_state = SIMPLE_INDEX;
|
while (*renaming_expr == 'X')
|
while (*renaming_expr == 'X')
|
{
|
{
|
renaming_expr += 1;
|
renaming_expr += 1;
|
|
|
switch (*renaming_expr) {
|
switch (*renaming_expr) {
|
case 'A':
|
case 'A':
|
renaming_expr += 1;
|
renaming_expr += 1;
|
write_exp_elt_opcode (UNOP_IND);
|
write_exp_elt_opcode (UNOP_IND);
|
break;
|
break;
|
case 'L':
|
case 'L':
|
slice_state = LOWER_BOUND;
|
slice_state = LOWER_BOUND;
|
case 'S':
|
case 'S':
|
renaming_expr += 1;
|
renaming_expr += 1;
|
if (isdigit (*renaming_expr))
|
if (isdigit (*renaming_expr))
|
{
|
{
|
char *next;
|
char *next;
|
long val = strtol (renaming_expr, &next, 10);
|
long val = strtol (renaming_expr, &next, 10);
|
if (next == renaming_expr)
|
if (next == renaming_expr)
|
goto BadEncoding;
|
goto BadEncoding;
|
renaming_expr = next;
|
renaming_expr = next;
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_type (type_int ());
|
write_exp_elt_type (type_int ());
|
write_exp_elt_longcst ((LONGEST) val);
|
write_exp_elt_longcst ((LONGEST) val);
|
write_exp_elt_opcode (OP_LONG);
|
write_exp_elt_opcode (OP_LONG);
|
}
|
}
|
else
|
else
|
{
|
{
|
const char *end;
|
const char *end;
|
char *index_name;
|
char *index_name;
|
struct symbol *index_sym;
|
struct symbol *index_sym;
|
|
|
end = strchr (renaming_expr, 'X');
|
end = strchr (renaming_expr, 'X');
|
if (end == NULL)
|
if (end == NULL)
|
end = renaming_expr + strlen (renaming_expr);
|
end = renaming_expr + strlen (renaming_expr);
|
|
|
index_name =
|
index_name =
|
obsavestring (renaming_expr, end - renaming_expr,
|
obsavestring (renaming_expr, end - renaming_expr,
|
&temp_parse_space);
|
&temp_parse_space);
|
renaming_expr = end;
|
renaming_expr = end;
|
|
|
index_sym = ada_lookup_encoded_symbol (index_name, NULL,
|
index_sym = ada_lookup_encoded_symbol (index_name, NULL,
|
VAR_DOMAIN, &block,
|
VAR_DOMAIN, &block,
|
NULL);
|
NULL);
|
if (index_sym == NULL)
|
if (index_sym == NULL)
|
error (_("Could not find %s"), index_name);
|
error (_("Could not find %s"), index_name);
|
else if (SYMBOL_CLASS (index_sym) == LOC_TYPEDEF)
|
else if (SYMBOL_CLASS (index_sym) == LOC_TYPEDEF)
|
/* Index is an old-style renaming symbol. */
|
/* Index is an old-style renaming symbol. */
|
block = orig_left_context;
|
block = orig_left_context;
|
write_var_from_sym (NULL, block, index_sym);
|
write_var_from_sym (NULL, block, index_sym);
|
}
|
}
|
if (slice_state == SIMPLE_INDEX)
|
if (slice_state == SIMPLE_INDEX)
|
{
|
{
|
write_exp_elt_opcode (OP_FUNCALL);
|
write_exp_elt_opcode (OP_FUNCALL);
|
write_exp_elt_longcst ((LONGEST) 1);
|
write_exp_elt_longcst ((LONGEST) 1);
|
write_exp_elt_opcode (OP_FUNCALL);
|
write_exp_elt_opcode (OP_FUNCALL);
|
}
|
}
|
else if (slice_state == LOWER_BOUND)
|
else if (slice_state == LOWER_BOUND)
|
slice_state = UPPER_BOUND;
|
slice_state = UPPER_BOUND;
|
else if (slice_state == UPPER_BOUND)
|
else if (slice_state == UPPER_BOUND)
|
{
|
{
|
write_exp_elt_opcode (TERNOP_SLICE);
|
write_exp_elt_opcode (TERNOP_SLICE);
|
slice_state = SIMPLE_INDEX;
|
slice_state = SIMPLE_INDEX;
|
}
|
}
|
break;
|
break;
|
|
|
case 'R':
|
case 'R':
|
{
|
{
|
struct stoken field_name;
|
struct stoken field_name;
|
const char *end;
|
const char *end;
|
renaming_expr += 1;
|
renaming_expr += 1;
|
|
|
if (slice_state != SIMPLE_INDEX)
|
if (slice_state != SIMPLE_INDEX)
|
goto BadEncoding;
|
goto BadEncoding;
|
end = strchr (renaming_expr, 'X');
|
end = strchr (renaming_expr, 'X');
|
if (end == NULL)
|
if (end == NULL)
|
end = renaming_expr + strlen (renaming_expr);
|
end = renaming_expr + strlen (renaming_expr);
|
field_name.length = end - renaming_expr;
|
field_name.length = end - renaming_expr;
|
field_name.ptr = xmalloc (end - renaming_expr + 1);
|
field_name.ptr = xmalloc (end - renaming_expr + 1);
|
strncpy (field_name.ptr, renaming_expr, end - renaming_expr);
|
strncpy (field_name.ptr, renaming_expr, end - renaming_expr);
|
field_name.ptr[end - renaming_expr] = '\000';
|
field_name.ptr[end - renaming_expr] = '\000';
|
renaming_expr = end;
|
renaming_expr = end;
|
write_exp_op_with_string (STRUCTOP_STRUCT, field_name);
|
write_exp_op_with_string (STRUCTOP_STRUCT, field_name);
|
break;
|
break;
|
}
|
}
|
|
|
default:
|
default:
|
goto BadEncoding;
|
goto BadEncoding;
|
}
|
}
|
}
|
}
|
if (slice_state == SIMPLE_INDEX)
|
if (slice_state == SIMPLE_INDEX)
|
return;
|
return;
|
|
|
BadEncoding:
|
BadEncoding:
|
error (_("Internal error in encoding of renaming declaration"));
|
error (_("Internal error in encoding of renaming declaration"));
|
}
|
}
|
|
|
static struct block*
|
static struct block*
|
block_lookup (struct block *context, char *raw_name)
|
block_lookup (struct block *context, char *raw_name)
|
{
|
{
|
char *name;
|
char *name;
|
struct ada_symbol_info *syms;
|
struct ada_symbol_info *syms;
|
int nsyms;
|
int nsyms;
|
struct symtab *symtab;
|
struct symtab *symtab;
|
|
|
if (raw_name[0] == '\'')
|
if (raw_name[0] == '\'')
|
{
|
{
|
raw_name += 1;
|
raw_name += 1;
|
name = raw_name;
|
name = raw_name;
|
}
|
}
|
else
|
else
|
name = ada_encode (raw_name);
|
name = ada_encode (raw_name);
|
|
|
nsyms = ada_lookup_symbol_list (name, context, VAR_DOMAIN, &syms);
|
nsyms = ada_lookup_symbol_list (name, context, VAR_DOMAIN, &syms);
|
if (context == NULL &&
|
if (context == NULL &&
|
(nsyms == 0 || SYMBOL_CLASS (syms[0].sym) != LOC_BLOCK))
|
(nsyms == 0 || SYMBOL_CLASS (syms[0].sym) != LOC_BLOCK))
|
symtab = lookup_symtab (name);
|
symtab = lookup_symtab (name);
|
else
|
else
|
symtab = NULL;
|
symtab = NULL;
|
|
|
if (symtab != NULL)
|
if (symtab != NULL)
|
return BLOCKVECTOR_BLOCK (BLOCKVECTOR (symtab), STATIC_BLOCK);
|
return BLOCKVECTOR_BLOCK (BLOCKVECTOR (symtab), STATIC_BLOCK);
|
else if (nsyms == 0 || SYMBOL_CLASS (syms[0].sym) != LOC_BLOCK)
|
else if (nsyms == 0 || SYMBOL_CLASS (syms[0].sym) != LOC_BLOCK)
|
{
|
{
|
if (context == NULL)
|
if (context == NULL)
|
error (_("No file or function \"%s\"."), raw_name);
|
error (_("No file or function \"%s\"."), raw_name);
|
else
|
else
|
error (_("No function \"%s\" in specified context."), raw_name);
|
error (_("No function \"%s\" in specified context."), raw_name);
|
}
|
}
|
else
|
else
|
{
|
{
|
if (nsyms > 1)
|
if (nsyms > 1)
|
warning (_("Function name \"%s\" ambiguous here"), raw_name);
|
warning (_("Function name \"%s\" ambiguous here"), raw_name);
|
return SYMBOL_BLOCK_VALUE (syms[0].sym);
|
return SYMBOL_BLOCK_VALUE (syms[0].sym);
|
}
|
}
|
}
|
}
|
|
|
static struct symbol*
|
static struct symbol*
|
select_possible_type_sym (struct ada_symbol_info *syms, int nsyms)
|
select_possible_type_sym (struct ada_symbol_info *syms, int nsyms)
|
{
|
{
|
int i;
|
int i;
|
int preferred_index;
|
int preferred_index;
|
struct type *preferred_type;
|
struct type *preferred_type;
|
|
|
preferred_index = -1; preferred_type = NULL;
|
preferred_index = -1; preferred_type = NULL;
|
for (i = 0; i < nsyms; i += 1)
|
for (i = 0; i < nsyms; i += 1)
|
switch (SYMBOL_CLASS (syms[i].sym))
|
switch (SYMBOL_CLASS (syms[i].sym))
|
{
|
{
|
case LOC_TYPEDEF:
|
case LOC_TYPEDEF:
|
if (ada_prefer_type (SYMBOL_TYPE (syms[i].sym), preferred_type))
|
if (ada_prefer_type (SYMBOL_TYPE (syms[i].sym), preferred_type))
|
{
|
{
|
preferred_index = i;
|
preferred_index = i;
|
preferred_type = SYMBOL_TYPE (syms[i].sym);
|
preferred_type = SYMBOL_TYPE (syms[i].sym);
|
}
|
}
|
break;
|
break;
|
case LOC_REGISTER:
|
case LOC_REGISTER:
|
case LOC_ARG:
|
case LOC_ARG:
|
case LOC_REF_ARG:
|
case LOC_REF_ARG:
|
case LOC_REGPARM:
|
case LOC_REGPARM:
|
case LOC_REGPARM_ADDR:
|
case LOC_REGPARM_ADDR:
|
case LOC_LOCAL:
|
case LOC_LOCAL:
|
case LOC_LOCAL_ARG:
|
case LOC_LOCAL_ARG:
|
case LOC_BASEREG:
|
case LOC_BASEREG:
|
case LOC_BASEREG_ARG:
|
case LOC_BASEREG_ARG:
|
case LOC_COMPUTED:
|
case LOC_COMPUTED:
|
case LOC_COMPUTED_ARG:
|
case LOC_COMPUTED_ARG:
|
return NULL;
|
return NULL;
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
if (preferred_type == NULL)
|
if (preferred_type == NULL)
|
return NULL;
|
return NULL;
|
return syms[preferred_index].sym;
|
return syms[preferred_index].sym;
|
}
|
}
|
|
|
static struct type*
|
static struct type*
|
find_primitive_type (char *name)
|
find_primitive_type (char *name)
|
{
|
{
|
struct type *type;
|
struct type *type;
|
type = language_lookup_primitive_type_by_name (current_language,
|
type = language_lookup_primitive_type_by_name (current_language,
|
current_gdbarch,
|
current_gdbarch,
|
name);
|
name);
|
if (type == NULL && strcmp ("system__address", name) == 0)
|
if (type == NULL && strcmp ("system__address", name) == 0)
|
type = type_system_address ();
|
type = type_system_address ();
|
|
|
if (type != NULL)
|
if (type != NULL)
|
{
|
{
|
/* Check to see if we have a regular definition of this
|
/* Check to see if we have a regular definition of this
|
type that just didn't happen to have been read yet. */
|
type that just didn't happen to have been read yet. */
|
int ntypes;
|
int ntypes;
|
struct symbol *sym;
|
struct symbol *sym;
|
char *expanded_name =
|
char *expanded_name =
|
(char *) alloca (strlen (name) + sizeof ("standard__"));
|
(char *) alloca (strlen (name) + sizeof ("standard__"));
|
strcpy (expanded_name, "standard__");
|
strcpy (expanded_name, "standard__");
|
strcat (expanded_name, name);
|
strcat (expanded_name, name);
|
sym = ada_lookup_symbol (expanded_name, NULL, VAR_DOMAIN, NULL, NULL);
|
sym = ada_lookup_symbol (expanded_name, NULL, VAR_DOMAIN, NULL, NULL);
|
if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
|
if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
|
type = SYMBOL_TYPE (sym);
|
type = SYMBOL_TYPE (sym);
|
}
|
}
|
|
|
return type;
|
return type;
|
}
|
}
|
|
|
static int
|
static int
|
chop_selector (char *name, int end)
|
chop_selector (char *name, int end)
|
{
|
{
|
int i;
|
int i;
|
for (i = end - 1; i > 0; i -= 1)
|
for (i = end - 1; i > 0; i -= 1)
|
if (name[i] == '.' || (name[i] == '_' && name[i+1] == '_'))
|
if (name[i] == '.' || (name[i] == '_' && name[i+1] == '_'))
|
return i;
|
return i;
|
return -1;
|
return -1;
|
}
|
}
|
|
|
/* If NAME is a string beginning with a separator (either '__', or
|
/* If NAME is a string beginning with a separator (either '__', or
|
'.'), chop this separator and return the result; else, return
|
'.'), chop this separator and return the result; else, return
|
NAME. */
|
NAME. */
|
|
|
static char *
|
static char *
|
chop_separator (char *name)
|
chop_separator (char *name)
|
{
|
{
|
if (*name == '.')
|
if (*name == '.')
|
return name + 1;
|
return name + 1;
|
|
|
if (name[0] == '_' && name[1] == '_')
|
if (name[0] == '_' && name[1] == '_')
|
return name + 2;
|
return name + 2;
|
|
|
return name;
|
return name;
|
}
|
}
|
|
|
/* Given that SELS is a string of the form ()*, where
|
/* Given that SELS is a string of the form ()*, where
|
is '__' or '.', write the indicated sequence of
|
is '__' or '.', write the indicated sequence of
|
STRUCTOP_STRUCT expression operators. */
|
STRUCTOP_STRUCT expression operators. */
|
static void
|
static void
|
write_selectors (char *sels)
|
write_selectors (char *sels)
|
{
|
{
|
while (*sels != '\0')
|
while (*sels != '\0')
|
{
|
{
|
struct stoken field_name;
|
struct stoken field_name;
|
char *p = chop_separator (sels);
|
char *p = chop_separator (sels);
|
sels = p;
|
sels = p;
|
while (*sels != '\0' && *sels != '.'
|
while (*sels != '\0' && *sels != '.'
|
&& (sels[0] != '_' || sels[1] != '_'))
|
&& (sels[0] != '_' || sels[1] != '_'))
|
sels += 1;
|
sels += 1;
|
field_name.length = sels - p;
|
field_name.length = sels - p;
|
field_name.ptr = p;
|
field_name.ptr = p;
|
write_exp_op_with_string (STRUCTOP_STRUCT, field_name);
|
write_exp_op_with_string (STRUCTOP_STRUCT, field_name);
|
}
|
}
|
}
|
}
|
|
|
/* Write a variable access (OP_VAR_VALUE) to ambiguous encoded name
|
/* Write a variable access (OP_VAR_VALUE) to ambiguous encoded name
|
NAME[0..LEN-1], in block context BLOCK, to be resolved later. Writes
|
NAME[0..LEN-1], in block context BLOCK, to be resolved later. Writes
|
a temporary symbol that is valid until the next call to ada_parse.
|
a temporary symbol that is valid until the next call to ada_parse.
|
*/
|
*/
|
static void
|
static void
|
write_ambiguous_var (struct block *block, char *name, int len)
|
write_ambiguous_var (struct block *block, char *name, int len)
|
{
|
{
|
struct symbol *sym =
|
struct symbol *sym =
|
obstack_alloc (&temp_parse_space, sizeof (struct symbol));
|
obstack_alloc (&temp_parse_space, sizeof (struct symbol));
|
memset (sym, 0, sizeof (struct symbol));
|
memset (sym, 0, sizeof (struct symbol));
|
SYMBOL_DOMAIN (sym) = UNDEF_DOMAIN;
|
SYMBOL_DOMAIN (sym) = UNDEF_DOMAIN;
|
SYMBOL_LINKAGE_NAME (sym) = obsavestring (name, len, &temp_parse_space);
|
SYMBOL_LINKAGE_NAME (sym) = obsavestring (name, len, &temp_parse_space);
|
SYMBOL_LANGUAGE (sym) = language_ada;
|
SYMBOL_LANGUAGE (sym) = language_ada;
|
|
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_block (block);
|
write_exp_elt_block (block);
|
write_exp_elt_sym (sym);
|
write_exp_elt_sym (sym);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
write_exp_elt_opcode (OP_VAR_VALUE);
|
}
|
}
|
|
|
/* A convenient wrapper around ada_get_field_index that takes
|
/* A convenient wrapper around ada_get_field_index that takes
|
a non NUL-terminated FIELD_NAME0 and a FIELD_NAME_LEN instead
|
a non NUL-terminated FIELD_NAME0 and a FIELD_NAME_LEN instead
|
of a NUL-terminated field name. */
|
of a NUL-terminated field name. */
|
|
|
static int
|
static int
|
ada_nget_field_index (const struct type *type, const char *field_name0,
|
ada_nget_field_index (const struct type *type, const char *field_name0,
|
int field_name_len, int maybe_missing)
|
int field_name_len, int maybe_missing)
|
{
|
{
|
char *field_name = alloca ((field_name_len + 1) * sizeof (char));
|
char *field_name = alloca ((field_name_len + 1) * sizeof (char));
|
|
|
strncpy (field_name, field_name0, field_name_len);
|
strncpy (field_name, field_name0, field_name_len);
|
field_name[field_name_len] = '\0';
|
field_name[field_name_len] = '\0';
|
return ada_get_field_index (type, field_name, maybe_missing);
|
return ada_get_field_index (type, field_name, maybe_missing);
|
}
|
}
|
|
|
/* If encoded_field_name is the name of a field inside symbol SYM,
|
/* If encoded_field_name is the name of a field inside symbol SYM,
|
then return the type of that field. Otherwise, return NULL.
|
then return the type of that field. Otherwise, return NULL.
|
|
|
This function is actually recursive, so if ENCODED_FIELD_NAME
|
This function is actually recursive, so if ENCODED_FIELD_NAME
|
doesn't match one of the fields of our symbol, then try to see
|
doesn't match one of the fields of our symbol, then try to see
|
if ENCODED_FIELD_NAME could not be a succession of field names
|
if ENCODED_FIELD_NAME could not be a succession of field names
|
(in other words, the user entered an expression of the form
|
(in other words, the user entered an expression of the form
|
TYPE_NAME.FIELD1.FIELD2.FIELD3), in which case we evaluate
|
TYPE_NAME.FIELD1.FIELD2.FIELD3), in which case we evaluate
|
each field name sequentially to obtain the desired field type.
|
each field name sequentially to obtain the desired field type.
|
In case of failure, we return NULL. */
|
In case of failure, we return NULL. */
|
|
|
static struct type *
|
static struct type *
|
get_symbol_field_type (struct symbol *sym, char *encoded_field_name)
|
get_symbol_field_type (struct symbol *sym, char *encoded_field_name)
|
{
|
{
|
char *field_name = encoded_field_name;
|
char *field_name = encoded_field_name;
|
char *subfield_name;
|
char *subfield_name;
|
struct type *type = SYMBOL_TYPE (sym);
|
struct type *type = SYMBOL_TYPE (sym);
|
int fieldno;
|
int fieldno;
|
|
|
if (type == NULL || field_name == NULL)
|
if (type == NULL || field_name == NULL)
|
return NULL;
|
return NULL;
|
|
|
while (field_name[0] != '\0')
|
while (field_name[0] != '\0')
|
{
|
{
|
field_name = chop_separator (field_name);
|
field_name = chop_separator (field_name);
|
|
|
fieldno = ada_get_field_index (type, field_name, 1);
|
fieldno = ada_get_field_index (type, field_name, 1);
|
if (fieldno >= 0)
|
if (fieldno >= 0)
|
return TYPE_FIELD_TYPE (type, fieldno);
|
return TYPE_FIELD_TYPE (type, fieldno);
|
|
|
subfield_name = field_name;
|
subfield_name = field_name;
|
while (*subfield_name != '\0' && *subfield_name != '.'
|
while (*subfield_name != '\0' && *subfield_name != '.'
|
&& (subfield_name[0] != '_' || subfield_name[1] != '_'))
|
&& (subfield_name[0] != '_' || subfield_name[1] != '_'))
|
subfield_name += 1;
|
subfield_name += 1;
|
|
|
if (subfield_name[0] == '\0')
|
if (subfield_name[0] == '\0')
|
return NULL;
|
return NULL;
|
|
|
fieldno = ada_nget_field_index (type, field_name,
|
fieldno = ada_nget_field_index (type, field_name,
|
subfield_name - field_name, 1);
|
subfield_name - field_name, 1);
|
if (fieldno < 0)
|
if (fieldno < 0)
|
return NULL;
|
return NULL;
|
|
|
type = TYPE_FIELD_TYPE (type, fieldno);
|
type = TYPE_FIELD_TYPE (type, fieldno);
|
field_name = subfield_name;
|
field_name = subfield_name;
|
}
|
}
|
|
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* Look up NAME0 (an unencoded identifier or dotted name) in BLOCK (or
|
/* Look up NAME0 (an unencoded identifier or dotted name) in BLOCK (or
|
expression_block_context if NULL). If it denotes a type, return
|
expression_block_context if NULL). If it denotes a type, return
|
that type. Otherwise, write expression code to evaluate it as an
|
that type. Otherwise, write expression code to evaluate it as an
|
object and return NULL. In this second case, NAME0 will, in general,
|
object and return NULL. In this second case, NAME0 will, in general,
|
have the form (.)*, where is an object
|
have the form (.)*, where is an object
|
or renaming encoded in the debugging data. Calls error if no
|
or renaming encoded in the debugging data. Calls error if no
|
prefix matches a name in the debugging data (i.e., matches
|
prefix matches a name in the debugging data (i.e., matches
|
either a complete name or, as a wild-card match, the final
|
either a complete name or, as a wild-card match, the final
|
identifier). */
|
identifier). */
|
|
|
static struct type*
|
static struct type*
|
write_var_or_type (struct block *block, struct stoken name0)
|
write_var_or_type (struct block *block, struct stoken name0)
|
{
|
{
|
int depth;
|
int depth;
|
char *encoded_name;
|
char *encoded_name;
|
int name_len;
|
int name_len;
|
|
|
if (block == NULL)
|
if (block == NULL)
|
block = expression_context_block;
|
block = expression_context_block;
|
|
|
encoded_name = ada_encode (name0.ptr);
|
encoded_name = ada_encode (name0.ptr);
|
name_len = strlen (encoded_name);
|
name_len = strlen (encoded_name);
|
encoded_name = obsavestring (encoded_name, name_len, &temp_parse_space);
|
encoded_name = obsavestring (encoded_name, name_len, &temp_parse_space);
|
for (depth = 0; depth < MAX_RENAMING_CHAIN_LENGTH; depth += 1)
|
for (depth = 0; depth < MAX_RENAMING_CHAIN_LENGTH; depth += 1)
|
{
|
{
|
int tail_index;
|
int tail_index;
|
|
|
tail_index = name_len;
|
tail_index = name_len;
|
while (tail_index > 0)
|
while (tail_index > 0)
|
{
|
{
|
int nsyms;
|
int nsyms;
|
struct ada_symbol_info *syms;
|
struct ada_symbol_info *syms;
|
struct symbol *type_sym;
|
struct symbol *type_sym;
|
struct symbol *renaming_sym;
|
struct symbol *renaming_sym;
|
const char* renaming;
|
const char* renaming;
|
int renaming_len;
|
int renaming_len;
|
const char* renaming_expr;
|
const char* renaming_expr;
|
int terminator = encoded_name[tail_index];
|
int terminator = encoded_name[tail_index];
|
|
|
encoded_name[tail_index] = '\0';
|
encoded_name[tail_index] = '\0';
|
nsyms = ada_lookup_symbol_list (encoded_name, block,
|
nsyms = ada_lookup_symbol_list (encoded_name, block,
|
VAR_DOMAIN, &syms);
|
VAR_DOMAIN, &syms);
|
encoded_name[tail_index] = terminator;
|
encoded_name[tail_index] = terminator;
|
|
|
/* A single symbol may rename a package or object. */
|
/* A single symbol may rename a package or object. */
|
|
|
/* This should go away when we move entirely to new version.
|
/* This should go away when we move entirely to new version.
|
FIXME pnh 7/20/2007. */
|
FIXME pnh 7/20/2007. */
|
if (nsyms == 1)
|
if (nsyms == 1)
|
{
|
{
|
struct symbol *renaming =
|
struct symbol *renaming =
|
ada_find_renaming_symbol (SYMBOL_LINKAGE_NAME (syms[0].sym),
|
ada_find_renaming_symbol (SYMBOL_LINKAGE_NAME (syms[0].sym),
|
syms[0].block);
|
syms[0].block);
|
|
|
if (renaming != NULL)
|
if (renaming != NULL)
|
syms[0].sym = renaming;
|
syms[0].sym = renaming;
|
}
|
}
|
|
|
type_sym = select_possible_type_sym (syms, nsyms);
|
type_sym = select_possible_type_sym (syms, nsyms);
|
|
|
if (type_sym != NULL)
|
if (type_sym != NULL)
|
renaming_sym = type_sym;
|
renaming_sym = type_sym;
|
else if (nsyms == 1)
|
else if (nsyms == 1)
|
renaming_sym = syms[0].sym;
|
renaming_sym = syms[0].sym;
|
else
|
else
|
renaming_sym = NULL;
|
renaming_sym = NULL;
|
|
|
switch (ada_parse_renaming (renaming_sym, &renaming,
|
switch (ada_parse_renaming (renaming_sym, &renaming,
|
&renaming_len, &renaming_expr))
|
&renaming_len, &renaming_expr))
|
{
|
{
|
case ADA_NOT_RENAMING:
|
case ADA_NOT_RENAMING:
|
break;
|
break;
|
case ADA_PACKAGE_RENAMING:
|
case ADA_PACKAGE_RENAMING:
|
case ADA_EXCEPTION_RENAMING:
|
case ADA_EXCEPTION_RENAMING:
|
case ADA_SUBPROGRAM_RENAMING:
|
case ADA_SUBPROGRAM_RENAMING:
|
{
|
{
|
char *new_name
|
char *new_name
|
= obstack_alloc (&temp_parse_space,
|
= obstack_alloc (&temp_parse_space,
|
renaming_len + name_len - tail_index + 1);
|
renaming_len + name_len - tail_index + 1);
|
strncpy (new_name, renaming, renaming_len);
|
strncpy (new_name, renaming, renaming_len);
|
strcpy (new_name + renaming_len, encoded_name + tail_index);
|
strcpy (new_name + renaming_len, encoded_name + tail_index);
|
encoded_name = new_name;
|
encoded_name = new_name;
|
name_len = renaming_len + name_len - tail_index;
|
name_len = renaming_len + name_len - tail_index;
|
goto TryAfterRenaming;
|
goto TryAfterRenaming;
|
}
|
}
|
case ADA_OBJECT_RENAMING:
|
case ADA_OBJECT_RENAMING:
|
write_object_renaming (block, renaming, renaming_len,
|
write_object_renaming (block, renaming, renaming_len,
|
renaming_expr, MAX_RENAMING_CHAIN_LENGTH);
|
renaming_expr, MAX_RENAMING_CHAIN_LENGTH);
|
write_selectors (encoded_name + tail_index);
|
write_selectors (encoded_name + tail_index);
|
return NULL;
|
return NULL;
|
default:
|
default:
|
internal_error (__FILE__, __LINE__,
|
internal_error (__FILE__, __LINE__,
|
_("impossible value from ada_parse_renaming"));
|
_("impossible value from ada_parse_renaming"));
|
}
|
}
|
|
|
if (type_sym != NULL)
|
if (type_sym != NULL)
|
{
|
{
|
struct type *field_type;
|
struct type *field_type;
|
|
|
if (tail_index == name_len)
|
if (tail_index == name_len)
|
return SYMBOL_TYPE (type_sym);
|
return SYMBOL_TYPE (type_sym);
|
|
|
/* We have some extraneous characters after the type name.
|
/* We have some extraneous characters after the type name.
|
If this is an expression "TYPE_NAME.FIELD0.[...].FIELDN",
|
If this is an expression "TYPE_NAME.FIELD0.[...].FIELDN",
|
then try to get the type of FIELDN. */
|
then try to get the type of FIELDN. */
|
field_type
|
field_type
|
= get_symbol_field_type (type_sym, encoded_name + tail_index);
|
= get_symbol_field_type (type_sym, encoded_name + tail_index);
|
if (field_type != NULL)
|
if (field_type != NULL)
|
return field_type;
|
return field_type;
|
else
|
else
|
error (_("Invalid attempt to select from type: \"%s\"."),
|
error (_("Invalid attempt to select from type: \"%s\"."),
|
name0.ptr);
|
name0.ptr);
|
}
|
}
|
else if (tail_index == name_len && nsyms == 0)
|
else if (tail_index == name_len && nsyms == 0)
|
{
|
{
|
struct type *type = find_primitive_type (encoded_name);
|
struct type *type = find_primitive_type (encoded_name);
|
|
|
if (type != NULL)
|
if (type != NULL)
|
return type;
|
return type;
|
}
|
}
|
|
|
if (nsyms == 1)
|
if (nsyms == 1)
|
{
|
{
|
write_var_from_sym (block, syms[0].block, syms[0].sym);
|
write_var_from_sym (block, syms[0].block, syms[0].sym);
|
write_selectors (encoded_name + tail_index);
|
write_selectors (encoded_name + tail_index);
|
return NULL;
|
return NULL;
|
}
|
}
|
else if (nsyms == 0)
|
else if (nsyms == 0)
|
{
|
{
|
int i;
|
int i;
|
struct minimal_symbol *msym
|
struct minimal_symbol *msym
|
= ada_lookup_simple_minsym (encoded_name);
|
= ada_lookup_simple_minsym (encoded_name);
|
if (msym != NULL)
|
if (msym != NULL)
|
{
|
{
|
write_exp_msymbol (msym, lookup_function_type (type_int ()),
|
write_exp_msymbol (msym, lookup_function_type (type_int ()),
|
type_int ());
|
type_int ());
|
/* Maybe cause error here rather than later? FIXME? */
|
/* Maybe cause error here rather than later? FIXME? */
|
write_selectors (encoded_name + tail_index);
|
write_selectors (encoded_name + tail_index);
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
if (tail_index == name_len
|
if (tail_index == name_len
|
&& strncmp (encoded_name, "standard__",
|
&& strncmp (encoded_name, "standard__",
|
sizeof ("standard__") - 1) == 0)
|
sizeof ("standard__") - 1) == 0)
|
error (_("No definition of \"%s\" found."), name0.ptr);
|
error (_("No definition of \"%s\" found."), name0.ptr);
|
|
|
tail_index = chop_selector (encoded_name, tail_index);
|
tail_index = chop_selector (encoded_name, tail_index);
|
}
|
}
|
else
|
else
|
{
|
{
|
write_ambiguous_var (block, encoded_name, tail_index);
|
write_ambiguous_var (block, encoded_name, tail_index);
|
write_selectors (encoded_name + tail_index);
|
write_selectors (encoded_name + tail_index);
|
return NULL;
|
return NULL;
|
}
|
}
|
}
|
}
|
|
|
if (!have_full_symbols () && !have_partial_symbols () && block == NULL)
|
if (!have_full_symbols () && !have_partial_symbols () && block == NULL)
|
error (_("No symbol table is loaded. Use the \"file\" command."));
|
error (_("No symbol table is loaded. Use the \"file\" command."));
|
if (block == expression_context_block)
|
if (block == expression_context_block)
|
error (_("No definition of \"%s\" in current context."), name0.ptr);
|
error (_("No definition of \"%s\" in current context."), name0.ptr);
|
else
|
else
|
error (_("No definition of \"%s\" in specified context."), name0.ptr);
|
error (_("No definition of \"%s\" in specified context."), name0.ptr);
|
|
|
TryAfterRenaming: ;
|
TryAfterRenaming: ;
|
}
|
}
|
|
|
error (_("Could not find renamed symbol \"%s\""), name0.ptr);
|
error (_("Could not find renamed symbol \"%s\""), name0.ptr);
|
|
|
}
|
}
|
|
|
/* Write a left side of a component association (e.g., NAME in NAME =>
|
/* Write a left side of a component association (e.g., NAME in NAME =>
|
exp). If NAME has the form of a selected component, write it as an
|
exp). If NAME has the form of a selected component, write it as an
|
ordinary expression. If it is a simple variable that unambiguously
|
ordinary expression. If it is a simple variable that unambiguously
|
corresponds to exactly one symbol that does not denote a type or an
|
corresponds to exactly one symbol that does not denote a type or an
|
object renaming, also write it normally as an OP_VAR_VALUE.
|
object renaming, also write it normally as an OP_VAR_VALUE.
|
Otherwise, write it as an OP_NAME.
|
Otherwise, write it as an OP_NAME.
|
|
|
Unfortunately, we don't know at this point whether NAME is supposed
|
Unfortunately, we don't know at this point whether NAME is supposed
|
to denote a record component name or the value of an array index.
|
to denote a record component name or the value of an array index.
|
Therefore, it is not appropriate to disambiguate an ambiguous name
|
Therefore, it is not appropriate to disambiguate an ambiguous name
|
as we normally would, nor to replace a renaming with its referent.
|
as we normally would, nor to replace a renaming with its referent.
|
As a result, in the (one hopes) rare case that one writes an
|
As a result, in the (one hopes) rare case that one writes an
|
aggregate such as (R => 42) where R renames an object or is an
|
aggregate such as (R => 42) where R renames an object or is an
|
ambiguous name, one must write instead ((R) => 42). */
|
ambiguous name, one must write instead ((R) => 42). */
|
|
|
static void
|
static void
|
write_name_assoc (struct stoken name)
|
write_name_assoc (struct stoken name)
|
{
|
{
|
if (strchr (name.ptr, '.') == NULL)
|
if (strchr (name.ptr, '.') == NULL)
|
{
|
{
|
struct ada_symbol_info *syms;
|
struct ada_symbol_info *syms;
|
int nsyms = ada_lookup_symbol_list (name.ptr, expression_context_block,
|
int nsyms = ada_lookup_symbol_list (name.ptr, expression_context_block,
|
VAR_DOMAIN, &syms);
|
VAR_DOMAIN, &syms);
|
if (nsyms != 1 || SYMBOL_CLASS (syms[0].sym) == LOC_TYPEDEF)
|
if (nsyms != 1 || SYMBOL_CLASS (syms[0].sym) == LOC_TYPEDEF)
|
write_exp_op_with_string (OP_NAME, name);
|
write_exp_op_with_string (OP_NAME, name);
|
else
|
else
|
write_var_from_sym (NULL, syms[0].block, syms[0].sym);
|
write_var_from_sym (NULL, syms[0].block, syms[0].sym);
|
}
|
}
|
else
|
else
|
if (write_var_or_type (NULL, name) != NULL)
|
if (write_var_or_type (NULL, name) != NULL)
|
error (_("Invalid use of type."));
|
error (_("Invalid use of type."));
|
}
|
}
|
|
|
/* Convert the character literal whose ASCII value would be VAL to the
|
/* Convert the character literal whose ASCII value would be VAL to the
|
appropriate value of type TYPE, if there is a translation.
|
appropriate value of type TYPE, if there is a translation.
|
Otherwise return VAL. Hence, in an enumeration type ('A', 'B'),
|
Otherwise return VAL. Hence, in an enumeration type ('A', 'B'),
|
the literal 'A' (VAL == 65), returns 0. */
|
the literal 'A' (VAL == 65), returns 0. */
|
|
|
static LONGEST
|
static LONGEST
|
convert_char_literal (struct type *type, LONGEST val)
|
convert_char_literal (struct type *type, LONGEST val)
|
{
|
{
|
char name[7];
|
char name[7];
|
int f;
|
int f;
|
|
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM)
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM)
|
return val;
|
return val;
|
sprintf (name, "QU%02x", (int) val);
|
sprintf (name, "QU%02x", (int) val);
|
for (f = 0; f < TYPE_NFIELDS (type); f += 1)
|
for (f = 0; f < TYPE_NFIELDS (type); f += 1)
|
{
|
{
|
if (strcmp (name, TYPE_FIELD_NAME (type, f)) == 0)
|
if (strcmp (name, TYPE_FIELD_NAME (type, f)) == 0)
|
return TYPE_FIELD_BITPOS (type, f);
|
return TYPE_FIELD_BITPOS (type, f);
|
}
|
}
|
return val;
|
return val;
|
}
|
}
|
|
|
static struct type *
|
static struct type *
|
type_int (void)
|
type_int (void)
|
{
|
{
|
return builtin_type (current_gdbarch)->builtin_int;
|
return builtin_type (current_gdbarch)->builtin_int;
|
}
|
}
|
|
|
static struct type *
|
static struct type *
|
type_long (void)
|
type_long (void)
|
{
|
{
|
return builtin_type (current_gdbarch)->builtin_long;
|
return builtin_type (current_gdbarch)->builtin_long;
|
}
|
}
|
|
|
static struct type *
|
static struct type *
|
type_long_long (void)
|
type_long_long (void)
|
{
|
{
|
return builtin_type (current_gdbarch)->builtin_long_long;
|
return builtin_type (current_gdbarch)->builtin_long_long;
|
}
|
}
|
|
|
static struct type *
|
static struct type *
|
type_float (void)
|
type_float (void)
|
{
|
{
|
return builtin_type (current_gdbarch)->builtin_float;
|
return builtin_type (current_gdbarch)->builtin_float;
|
}
|
}
|
|
|
static struct type *
|
static struct type *
|
type_double (void)
|
type_double (void)
|
{
|
{
|
return builtin_type (current_gdbarch)->builtin_double;
|
return builtin_type (current_gdbarch)->builtin_double;
|
}
|
}
|
|
|
static struct type *
|
static struct type *
|
type_long_double (void)
|
type_long_double (void)
|
{
|
{
|
return builtin_type (current_gdbarch)->builtin_long_double;
|
return builtin_type (current_gdbarch)->builtin_long_double;
|
}
|
}
|
|
|
static struct type *
|
static struct type *
|
type_char (void)
|
type_char (void)
|
{
|
{
|
return language_string_char_type (current_language, current_gdbarch);
|
return language_string_char_type (current_language, current_gdbarch);
|
}
|
}
|
|
|
static struct type *
|
static struct type *
|
type_system_address (void)
|
type_system_address (void)
|
{
|
{
|
struct type *type
|
struct type *type
|
= language_lookup_primitive_type_by_name (current_language,
|
= language_lookup_primitive_type_by_name (current_language,
|
current_gdbarch,
|
current_gdbarch,
|
"system__address");
|
"system__address");
|
return type != NULL ? type : lookup_pointer_type (builtin_type_void);
|
return type != NULL ? type : lookup_pointer_type (builtin_type_void);
|
}
|
}
|
|
|
void
|
void
|
_initialize_ada_exp (void)
|
_initialize_ada_exp (void)
|
{
|
{
|
obstack_init (&temp_parse_space);
|
obstack_init (&temp_parse_space);
|
}
|
}
|
|
|
/* FIXME: hilfingr/2004-10-05: Hack to remove warning. The function
|
/* FIXME: hilfingr/2004-10-05: Hack to remove warning. The function
|
string_to_operator is supposed to be used for cases where one
|
string_to_operator is supposed to be used for cases where one
|
calls an operator function with prefix notation, as in
|
calls an operator function with prefix notation, as in
|
"+" (a, b), but at some point, this code seems to have gone
|
"+" (a, b), but at some point, this code seems to have gone
|
missing. */
|
missing. */
|
|
|
struct stoken (*dummy_string_to_ada_operator) (struct stoken)
|
struct stoken (*dummy_string_to_ada_operator) (struct stoken)
|
= string_to_operator;
|
= string_to_operator;
|
|
|
