1 /* Parser definitions for GDB.
3 Copyright 1986, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996,
4 1997, 1998, 1999, 2000, 2002 Free Software Foundation, Inc.
6 Modified from expread.y by the Department of Computer Science at the
7 State University of New York at Buffalo.
9 This file is part of GDB.
11 This program is free software; you can redistribute it and/or modify
12 it under the terms of the GNU General Public License as published by
13 the Free Software Foundation; either version 2 of the License, or
14 (at your option) any later version.
16 This program is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU General Public License for more details.
21 You should have received a copy of the GNU General Public License
22 along with this program; if not, write to the Free Software
23 Foundation, Inc., 59 Temple Place - Suite 330,
24 Boston, MA 02111-1307, USA. */
26 #if !defined (PARSER_DEFS_H)
27 #define PARSER_DEFS_H 1
31 extern struct expression
*expout
;
32 extern int expout_size
;
33 extern int expout_ptr
;
35 /* If this is nonzero, this block is used as the lexical context
38 extern struct block
*expression_context_block
;
40 /* The innermost context required by the stack and register variables
41 we've encountered so far. */
42 extern struct block
*innermost_block
;
44 /* The block in which the most recently discovered symbol was found.
45 FIXME: Should be declared along with lookup_symbol in symtab.h; is not
46 related specifically to parsing. */
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. */
89 /* The stack can contain either an enum type_pieces or an int. */
92 enum type_pieces piece
;
95 extern union type_stack_elt
*type_stack
;
96 extern int type_stack_depth
, type_stack_size
;
98 extern void write_exp_elt (union exp_element
);
100 extern void write_exp_elt_opcode (enum exp_opcode
);
102 extern void write_exp_elt_sym (struct symbol
*);
104 extern void write_exp_elt_longcst (LONGEST
);
106 extern void write_exp_elt_dblcst (DOUBLEST
);
108 extern void write_exp_elt_type (struct type
*);
110 extern void write_exp_elt_intern (struct internalvar
*);
112 extern void write_exp_string (struct stoken
);
114 extern void write_exp_bitstring (struct stoken
);
116 extern void write_exp_elt_block (struct block
*);
118 extern void write_exp_msymbol (struct minimal_symbol
*,
119 struct type
*, struct type
*);
121 extern void write_dollar_variable (struct stoken str
);
123 extern struct symbol
*parse_nested_classes_for_hpacc (char *, int, char **,
126 extern char *find_template_name_end (char *);
128 extern void start_arglist (void);
130 extern int end_arglist (void);
132 extern char *copy_name (struct stoken
);
134 extern void push_type (enum type_pieces
);
136 extern void push_type_int (int);
138 extern void push_type_address_space (char *);
140 extern enum type_pieces
pop_type (void);
142 extern int pop_type_int (void);
144 extern int length_of_subexp (struct expression
*, int);
146 extern struct type
*follow_types (struct type
*);
148 /* During parsing of a C expression, the pointer to the next character
149 is in this variable. */
153 /* Tokens that refer to names do so with explicit pointer and length,
154 so they can share the storage that lexptr is parsing.
156 When it is necessary to pass a name to a function that expects
157 a null-terminated string, the substring is copied out
158 into a block of storage that namecopy points to.
160 namecopy is allocated once, guaranteed big enough, for each parsing. */
162 extern char *namecopy
;
164 /* Current depth in parentheses within the expression. */
166 extern int paren_depth
;
168 /* Nonzero means stop parsing on first comma (if not within parentheses). */
170 extern int comma_terminates
;
172 /* These codes indicate operator precedences for expression printing,
173 least tightly binding first. */
174 /* Adding 1 to a precedence value is done for binary operators,
175 on the operand which is more tightly bound, so that operators
176 of equal precedence within that operand will get parentheses. */
177 /* PREC_HYPER and PREC_ABOVE_COMMA are not the precedence of any operator;
178 they are used as the "surrounding precedence" to force
179 various kinds of things to be parenthesized. */
182 PREC_NULL
, PREC_COMMA
, PREC_ABOVE_COMMA
, PREC_ASSIGN
, PREC_LOGICAL_OR
,
183 PREC_LOGICAL_AND
, PREC_BITWISE_IOR
, PREC_BITWISE_AND
, PREC_BITWISE_XOR
,
184 PREC_EQUAL
, PREC_ORDER
, PREC_SHIFT
, PREC_ADD
, PREC_MUL
, PREC_REPEAT
,
185 PREC_HYPER
, PREC_PREFIX
, PREC_SUFFIX
, PREC_BUILTIN_FUNCTION
188 /* Table mapping opcodes into strings for printing operators
189 and precedences of the operators. */
194 enum exp_opcode opcode
;
195 /* Precedence of operator. These values are used only by comparisons. */
196 enum precedence precedence
;
198 /* For a binary operator: 1 iff right associate.
199 For a unary operator: 1 iff postfix. */
203 /* The generic method for targets to specify how their registers are
204 named. The mapping can be derived from two sources: REGISTER_NAME;
207 extern int target_map_name_to_register (char *, int);
209 #endif /* PARSER_DEFS_H */
This page took 0.033888 seconds and 4 git commands to generate.