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 FIXME: Should be declared along with lookup_symbol in symtab.h; is not
48 related specifically to parsing. */
49 extern struct block *block_found;
51 /* Number of arguments seen so far in innermost function call. */
52 extern int arglist_len;
54 /* A string token, either a char-string or bit-string. Char-strings are
55 used, for example, for the names of symbols. */
59 /* Pointer to first byte of char-string or first bit of bit-string */
61 /* Length of string in bytes for char-string or bits for bit-string */
75 int is_a_field_of_this;
78 /* For parsing of complicated types.
79 An array should be preceded in the list by the size of the array. */
81 {tp_end = -1, tp_pointer, tp_reference, tp_array, tp_function};
82 /* The stack can contain either an enum type_pieces or an int. */
83 union type_stack_elt {
84 enum type_pieces piece;
87 extern union type_stack_elt *type_stack;
88 extern int type_stack_depth, type_stack_size;
90 extern void write_exp_elt PARAMS ((union exp_element));
92 extern void write_exp_elt_opcode PARAMS ((enum exp_opcode));
94 extern void write_exp_elt_sym PARAMS ((struct symbol *));
96 extern void write_exp_elt_longcst PARAMS ((LONGEST));
98 extern void write_exp_elt_dblcst PARAMS ((double));
100 extern void write_exp_elt_type PARAMS ((struct type *));
102 extern void write_exp_elt_intern PARAMS ((struct internalvar *));
104 extern void write_exp_string PARAMS ((struct stoken));
106 extern void write_exp_bitstring PARAMS ((struct stoken));
108 extern void write_exp_elt_block PARAMS ((struct block *));
110 extern void write_exp_msymbol PARAMS ((struct minimal_symbol *,
111 struct type *, struct type *));
114 start_arglist PARAMS ((void));
117 end_arglist PARAMS ((void));
120 copy_name PARAMS ((struct stoken));
123 push_type PARAMS ((enum type_pieces));
126 push_type_int PARAMS ((int));
128 extern enum type_pieces
129 pop_type PARAMS ((void));
132 pop_type_int PARAMS ((void));
134 extern struct type *follow_types PARAMS ((struct type *));
136 /* During parsing of a C expression, the pointer to the next character
137 is in this variable. */
141 /* Tokens that refer to names do so with explicit pointer and length,
142 so they can share the storage that lexptr is parsing.
144 When it is necessary to pass a name to a function that expects
145 a null-terminated string, the substring is copied out
146 into a block of storage that namecopy points to.
148 namecopy is allocated once, guaranteed big enough, for each parsing. */
150 extern char *namecopy;
152 /* Current depth in parentheses within the expression. */
154 extern int paren_depth;
156 /* Nonzero means stop parsing on first comma (if not within parentheses). */
158 extern int comma_terminates;
160 /* These codes indicate operator precedences for expression printing,
161 least tightly binding first. */
162 /* Adding 1 to a precedence value is done for binary operators,
163 on the operand which is more tightly bound, so that operators
164 of equal precedence within that operand will get parentheses. */
165 /* PREC_HYPER and PREC_ABOVE_COMMA are not the precedence of any operator;
166 they are used as the "surrounding precedence" to force
167 various kinds of things to be parenthesized. */
169 { PREC_NULL, PREC_COMMA, PREC_ABOVE_COMMA, PREC_ASSIGN, PREC_LOGICAL_OR,
170 PREC_LOGICAL_AND, PREC_BITWISE_IOR, PREC_BITWISE_AND, PREC_BITWISE_XOR,
171 PREC_EQUAL, PREC_ORDER, PREC_SHIFT, PREC_ADD, PREC_MUL, PREC_REPEAT,
172 PREC_HYPER, PREC_PREFIX, PREC_SUFFIX, PREC_BUILTIN_FUNCTION };
174 /* Table mapping opcodes into strings for printing operators
175 and precedences of the operators. */
180 enum exp_opcode opcode;
181 /* Precedence of operator. These values are used only by comparisons. */
182 enum precedence precedence;
184 /* For a binary operator: 1 iff right associate.
185 For a unary operator: 1 iff postfix. */
189 #endif /* PARSER_DEFS_H */