gdb/parser-defs.h

   1 /* Parser definitions for GDB.
   2    Copyright (C) 1986, 1989, 1990, 1991 Free Software Foundation, Inc.
   3    Modified from expread.y by the Department of Computer Science at the
   4    State University of New York at Buffalo.
   5
   6 This file is part of GDB.
   7
   8 This program is free software; you can redistribute it and/or modify
   9 it under the terms of the GNU General Public License as published by
  10 the Free Software Foundation; either version 2 of the License, or
  11 (at your option) any later version.
  12
  13 This program is distributed in the hope that it will be useful,
  14 but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 GNU General Public License for more details.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with this program; if not, write to the Free Software
  20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */
  21
  22 struct std_regs {
  23         char *name;
  24         int regnum;
  25 };
  26
  27 extern struct std_regs std_regs[];
  28 extern unsigned num_std_regs;
  29
  30 struct expression *expout;
  31 int expout_size;
  32 int expout_ptr;
  33
  34 extern struct type *init_type ();
  35
  36 void write_exp_elt ();
  37 void write_exp_elt_opcode ();
  38 void write_exp_elt_sym ();
  39 void write_exp_elt_longcst ();
  40 void write_exp_elt_dblcst ();
  41 void write_exp_elt_type ();
  42 void write_exp_elt_intern ();
  43 void write_exp_string ();
  44 void start_arglist ();
  45 int end_arglist ();
  46 void free_funcalls ();
  47 char *copy_name ();
  48
  49 /* If this is nonzero, this block is used as the lexical context
  50    for symbol names.  */
  51
  52 struct block *expression_context_block;
  53
  54 /* The innermost context required by the stack and register variables
  55    we've encountered so far. */
  56 struct block *innermost_block;
  57
  58 /* The block in which the most recently discovered symbol was found. */
  59 struct block *block_found;
  60
  61 /* Number of arguments seen so far in innermost function call.  */
  62 int arglist_len;
  63
  64 /* Data structure for saving values of arglist_len
  65    for function calls whose arguments contain other function calls.  */
  66
  67 struct funcall
  68   {
  69     struct funcall *next;
  70     int arglist_len;
  71   };
  72
  73 struct funcall *funcall_chain;
  74
  75 /* This kind of datum is used to represent the name
  76    of a symbol token.  */
  77
  78 struct stoken
  79   {
  80     char *ptr;
  81     int length;
  82   };
  83
  84 struct ttype
  85   {
  86     struct stoken stoken;
  87     struct type *type;
  88   };
  89
  90 struct symtoken
  91   {
  92     struct stoken stoken;
  93     struct symbol *sym;
  94     int is_a_field_of_this;
  95   };
  96
  97 /* For parsing of complicated types.
  98    An array should be preceded in the list by the size of the array.  */
  99 enum type_pieces
 100   {tp_end = -1, tp_pointer, tp_reference, tp_array, tp_function};
 101 /* The stack can contain either an enum type_pieces or an int.  */
 102 union type_stack_elt {
 103   enum type_pieces piece;
 104   int int_val;
 105 };
 106 union type_stack_elt *type_stack;
 107 int type_stack_depth, type_stack_size;
 108
 109 void push_type ();
 110 void push_type_int ();
 111 enum type_pieces pop_type ();
 112 int pop_type_int ();
 113
 114 /* During parsing of a C expression, the pointer to the next character
 115    is in this variable.  */
 116
 117 char *lexptr;
 118
 119 /* Tokens that refer to names do so with explicit pointer and length,
 120    so they can share the storage that lexptr is parsing.
 121
 122    When it is necessary to pass a name to a function that expects
 123    a null-terminated string, the substring is copied out
 124    into a block of storage that namecopy points to.
 125
 126    namecopy is allocated once, guaranteed big enough, for each parsing.  */
 127
 128 char *namecopy;
 129
 130 /* Current depth in parentheses within the expression.  */
 131
 132 int paren_depth;
 133
 134 /* Nonzero means stop parsing on first comma (if not within parentheses).  */
 135
 136 int comma_terminates;
 137 \f
 138 /* These codes indicate operator precedences for expression printing,
 139    least tightly binding first.  */
 140 /* Adding 1 to a precedence value is done for binary operators,
 141    on the operand which is more tightly bound, so that operators
 142    of equal precedence within that operand will get parentheses.  */
 143 /* PREC_HYPER and PREC_ABOVE_COMMA are not the precedence of any operator;
 144    they are used as the "surrounding precedence" to force
 145    various kinds of things to be parenthesized.  */
 146 enum precedence
 147 { PREC_NULL, PREC_COMMA, PREC_ABOVE_COMMA, PREC_ASSIGN, PREC_OR, PREC_AND,
 148   PREC_LOGIOR, PREC_LOGAND, PREC_LOGXOR, PREC_EQUAL, PREC_ORDER,
 149   PREC_SHIFT, PREC_ADD, PREC_MUL, PREC_REPEAT,
 150   PREC_HYPER, PREC_PREFIX, PREC_SUFFIX };
 151
 152 /* Table mapping opcodes into strings for printing operators
 153    and precedences of the operators.  */
 154
 155 struct op_print
 156 {
 157   char *string;
 158   enum exp_opcode opcode;
 159   /* Precedence of operator.  These values are used only by comparisons.  */
 160   enum precedence precedence;
 161   int right_assoc;
 162 };