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.
6 This file is part of GDB.
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.
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.
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. */
22 #if !defined (PARSER_DEFS_H)
23 #define PARSER_DEFS_H 1
30 extern struct std_regs std_regs[];
31 extern unsigned num_std_regs;
33 extern struct expression *expout;
34 extern int expout_size;
35 extern int expout_ptr;
37 /* If this is nonzero, this block is used as the lexical context
40 extern struct block *expression_context_block;
42 /* The innermost context required by the stack and register variables
43 we've encountered so far. */
44 extern struct block *innermost_block;
46 /* The block in which the most recently discovered symbol was found. */
47 extern struct block *block_found;
49 /* Number of arguments seen so far in innermost function call. */
50 extern int arglist_len;
52 /* A string token, either a char-string or bit-string. Char-strings are
53 used, for example, for the names of symbols. */
57 /* Pointer to first byte of char-string or first bit of bit-string */
59 /* Length of string in bytes for char-string or bits for bit-string */
73 int is_a_field_of_this;
76 /* For parsing of complicated types.
77 An array should be preceded in the list by the size of the array. */
79 {tp_end = -1, tp_pointer, tp_reference, tp_array, tp_function};
80 /* The stack can contain either an enum type_pieces or an int. */
81 union type_stack_elt {
82 enum type_pieces piece;
85 extern union type_stack_elt *type_stack;
86 extern int type_stack_depth, type_stack_size;
88 extern void write_exp_elt PARAMS ((union exp_element));
90 extern void write_exp_elt_opcode PARAMS ((enum exp_opcode));
92 extern void write_exp_elt_sym PARAMS ((struct symbol *));
94 extern void write_exp_elt_longcst PARAMS ((LONGEST));
96 extern void write_exp_elt_dblcst PARAMS ((double));
98 extern void write_exp_elt_type PARAMS ((struct type *));
100 extern void write_exp_elt_intern PARAMS ((struct internalvar *));
102 extern void write_exp_string PARAMS ((struct stoken));
104 extern void write_exp_bitstring PARAMS ((struct stoken));
106 extern void write_exp_elt_block PARAMS ((struct block *));
108 extern void write_exp_msymbol PARAMS ((struct minimal_symbol *,
109 struct type *, struct type *));
112 start_arglist PARAMS ((void));
115 end_arglist PARAMS ((void));
118 copy_name PARAMS ((struct stoken));
121 push_type PARAMS ((enum type_pieces));
124 push_type_int PARAMS ((int));
126 extern enum type_pieces
127 pop_type PARAMS ((void));
130 pop_type_int PARAMS ((void));
132 extern struct type *follow_types PARAMS ((struct type *));
134 /* During parsing of a C expression, the pointer to the next character
135 is in this variable. */
139 /* Tokens that refer to names do so with explicit pointer and length,
140 so they can share the storage that lexptr is parsing.
142 When it is necessary to pass a name to a function that expects
143 a null-terminated string, the substring is copied out
144 into a block of storage that namecopy points to.
146 namecopy is allocated once, guaranteed big enough, for each parsing. */
148 extern char *namecopy;
150 /* Current depth in parentheses within the expression. */
152 extern int paren_depth;
154 /* Nonzero means stop parsing on first comma (if not within parentheses). */
156 extern int comma_terminates;
158 /* These codes indicate operator precedences for expression printing,
159 least tightly binding first. */
160 /* Adding 1 to a precedence value is done for binary operators,
161 on the operand which is more tightly bound, so that operators
162 of equal precedence within that operand will get parentheses. */
163 /* PREC_HYPER and PREC_ABOVE_COMMA are not the precedence of any operator;
164 they are used as the "surrounding precedence" to force
165 various kinds of things to be parenthesized. */
167 { PREC_NULL, PREC_COMMA, PREC_ABOVE_COMMA, PREC_ASSIGN, PREC_LOGICAL_OR,
168 PREC_LOGICAL_AND, PREC_BITWISE_IOR, PREC_BITWISE_AND, PREC_BITWISE_XOR,
169 PREC_EQUAL, PREC_ORDER, PREC_SHIFT, PREC_ADD, PREC_MUL, PREC_REPEAT,
170 PREC_HYPER, PREC_PREFIX, PREC_SUFFIX };
172 /* Table mapping opcodes into strings for printing operators
173 and precedences of the operators. */
178 enum exp_opcode opcode;
179 /* Precedence of operator. These values are used only by comparisons. */
180 enum precedence precedence;
184 #endif /* PARSER_DEFS_H */