mirror of
https://github.com/darlinghq/darling-gdb.git
synced 2024-12-11 14:14:23 +00:00
163 lines
4.5 KiB
C
163 lines
4.5 KiB
C
|
/* Parser definitions for GDB.
|
|||
|
Copyright (C) 1986, 1989, 1990, 1991 Free Software Foundation, Inc.
|
|||
|
Modified from expread.y by the Department of Computer Science at the
|
|||
|
State University of New York at Buffalo.
|
|||
|
|
|||
|
This file is part of GDB.
|
|||
|
|
|||
|
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
|
|||
|
the Free Software Foundation; either version 2 of the License, or
|
|||
|
(at your option) any later version.
|
|||
|
|
|||
|
This program is distributed in the hope that it will be useful,
|
|||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|||
|
GNU General Public License for more details.
|
|||
|
|
|||
|
You should have received a copy of the GNU General Public License
|
|||
|
along with this program; if not, write to the Free Software
|
|||
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
|
|||
|
|
|||
|
struct std_regs {
|
|||
|
char *name;
|
|||
|
int regnum;
|
|||
|
};
|
|||
|
|
|||
|
extern struct std_regs std_regs[];
|
|||
|
extern unsigned num_std_regs;
|
|||
|
|
|||
|
struct expression *expout;
|
|||
|
int expout_size;
|
|||
|
int expout_ptr;
|
|||
|
|
|||
|
extern struct type *init_type ();
|
|||
|
|
|||
|
void write_exp_elt ();
|
|||
|
void write_exp_elt_opcode ();
|
|||
|
void write_exp_elt_sym ();
|
|||
|
void write_exp_elt_longcst ();
|
|||
|
void write_exp_elt_dblcst ();
|
|||
|
void write_exp_elt_type ();
|
|||
|
void write_exp_elt_intern ();
|
|||
|
void write_exp_string ();
|
|||
|
void start_arglist ();
|
|||
|
int end_arglist ();
|
|||
|
void free_funcalls ();
|
|||
|
char *copy_name ();
|
|||
|
|
|||
|
/* If this is nonzero, this block is used as the lexical context
|
|||
|
for symbol names. */
|
|||
|
|
|||
|
struct block *expression_context_block;
|
|||
|
|
|||
|
/* The innermost context required by the stack and register variables
|
|||
|
we've encountered so far. */
|
|||
|
struct block *innermost_block;
|
|||
|
|
|||
|
/* The block in which the most recently discovered symbol was found. */
|
|||
|
struct block *block_found;
|
|||
|
|
|||
|
/* Number of arguments seen so far in innermost function call. */
|
|||
|
int arglist_len;
|
|||
|
|
|||
|
/* Data structure for saving values of arglist_len
|
|||
|
for function calls whose arguments contain other function calls. */
|
|||
|
|
|||
|
struct funcall
|
|||
|
{
|
|||
|
struct funcall *next;
|
|||
|
int arglist_len;
|
|||
|
};
|
|||
|
|
|||
|
struct funcall *funcall_chain;
|
|||
|
|
|||
|
/* This kind of datum is used to represent the name
|
|||
|
of a symbol token. */
|
|||
|
|
|||
|
struct stoken
|
|||
|
{
|
|||
|
char *ptr;
|
|||
|
int length;
|
|||
|
};
|
|||
|
|
|||
|
struct ttype
|
|||
|
{
|
|||
|
struct stoken stoken;
|
|||
|
struct type *type;
|
|||
|
};
|
|||
|
|
|||
|
struct symtoken
|
|||
|
{
|
|||
|
struct stoken stoken;
|
|||
|
struct symbol *sym;
|
|||
|
int is_a_field_of_this;
|
|||
|
};
|
|||
|
|
|||
|
/* For parsing of complicated types.
|
|||
|
An array should be preceded in the list by the size of the array. */
|
|||
|
enum type_pieces
|
|||
|
{tp_end = -1, tp_pointer, tp_reference, tp_array, tp_function};
|
|||
|
/* The stack can contain either an enum type_pieces or an int. */
|
|||
|
union type_stack_elt {
|
|||
|
enum type_pieces piece;
|
|||
|
int int_val;
|
|||
|
};
|
|||
|
union type_stack_elt *type_stack;
|
|||
|
int type_stack_depth, type_stack_size;
|
|||
|
|
|||
|
void push_type ();
|
|||
|
void push_type_int ();
|
|||
|
enum type_pieces pop_type ();
|
|||
|
int pop_type_int ();
|
|||
|
|
|||
|
/* During parsing of a C expression, the pointer to the next character
|
|||
|
is in this variable. */
|
|||
|
|
|||
|
char *lexptr;
|
|||
|
|
|||
|
/* Tokens that refer to names do so with explicit pointer and length,
|
|||
|
so they can share the storage that lexptr is parsing.
|
|||
|
|
|||
|
When it is necessary to pass a name to a function that expects
|
|||
|
a null-terminated string, the substring is copied out
|
|||
|
into a block of storage that namecopy points to.
|
|||
|
|
|||
|
namecopy is allocated once, guaranteed big enough, for each parsing. */
|
|||
|
|
|||
|
char *namecopy;
|
|||
|
|
|||
|
/* Current depth in parentheses within the expression. */
|
|||
|
|
|||
|
int paren_depth;
|
|||
|
|
|||
|
/* Nonzero means stop parsing on first comma (if not within parentheses). */
|
|||
|
|
|||
|
int comma_terminates;
|
|||
|
|
|||
|
/* These codes indicate operator precedences for expression printing,
|
|||
|
least tightly binding first. */
|
|||
|
/* Adding 1 to a precedence value is done for binary operators,
|
|||
|
on the operand which is more tightly bound, so that operators
|
|||
|
of equal precedence within that operand will get parentheses. */
|
|||
|
/* PREC_HYPER and PREC_ABOVE_COMMA are not the precedence of any operator;
|
|||
|
they are used as the "surrounding precedence" to force
|
|||
|
various kinds of things to be parenthesized. */
|
|||
|
enum precedence
|
|||
|
{ PREC_NULL, PREC_COMMA, PREC_ABOVE_COMMA, PREC_ASSIGN, PREC_OR, PREC_AND,
|
|||
|
PREC_LOGIOR, PREC_LOGAND, PREC_LOGXOR, PREC_EQUAL, PREC_ORDER,
|
|||
|
PREC_SHIFT, PREC_ADD, PREC_MUL, PREC_REPEAT,
|
|||
|
PREC_HYPER, PREC_PREFIX, PREC_SUFFIX };
|
|||
|
|
|||
|
/* Table mapping opcodes into strings for printing operators
|
|||
|
and precedences of the operators. */
|
|||
|
|
|||
|
struct op_print
|
|||
|
{
|
|||
|
char *string;
|
|||
|
enum exp_opcode opcode;
|
|||
|
/* Precedence of operator. These values are used only by comparisons. */
|
|||
|
enum precedence precedence;
|
|||
|
int right_assoc;
|
|||
|
};
|