Commit | Line | Data |
---|---|---|
3d6b6a90 JG |
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 | ||
1ab3bf1b JG |
22 | #if !defined (PARSER_DEFS_H) |
23 | #define PARSER_DEFS_H 1 | |
24 | ||
3d6b6a90 JG |
25 | struct std_regs { |
26 | char *name; | |
27 | int regnum; | |
28 | }; | |
29 | ||
30 | extern struct std_regs std_regs[]; | |
31 | extern unsigned num_std_regs; | |
32 | ||
33 | struct expression *expout; | |
34 | int expout_size; | |
35 | int expout_ptr; | |
36 | ||
3d6b6a90 JG |
37 | /* If this is nonzero, this block is used as the lexical context |
38 | for symbol names. */ | |
39 | ||
40 | struct block *expression_context_block; | |
41 | ||
42 | /* The innermost context required by the stack and register variables | |
43 | we've encountered so far. */ | |
44 | struct block *innermost_block; | |
45 | ||
46 | /* The block in which the most recently discovered symbol was found. */ | |
47 | struct block *block_found; | |
48 | ||
49 | /* Number of arguments seen so far in innermost function call. */ | |
50 | int arglist_len; | |
51 | ||
52 | /* Data structure for saving values of arglist_len | |
53 | for function calls whose arguments contain other function calls. */ | |
54 | ||
55 | struct funcall | |
56 | { | |
57 | struct funcall *next; | |
58 | int arglist_len; | |
59 | }; | |
60 | ||
61 | struct funcall *funcall_chain; | |
62 | ||
81028ab0 FF |
63 | /* A string token, either a char-string or bit-string. Char-strings are |
64 | used, for example, for the names of symbols. */ | |
3d6b6a90 JG |
65 | |
66 | struct stoken | |
67 | { | |
81028ab0 | 68 | /* Pointer to first byte of char-string or first bit of bit-string */ |
3d6b6a90 | 69 | char *ptr; |
81028ab0 | 70 | /* Length of string in bytes for char-string or bits for bit-string */ |
3d6b6a90 JG |
71 | int length; |
72 | }; | |
73 | ||
74 | struct ttype | |
75 | { | |
76 | struct stoken stoken; | |
77 | struct type *type; | |
78 | }; | |
79 | ||
80 | struct symtoken | |
81 | { | |
82 | struct stoken stoken; | |
83 | struct symbol *sym; | |
84 | int is_a_field_of_this; | |
85 | }; | |
86 | ||
87 | /* For parsing of complicated types. | |
88 | An array should be preceded in the list by the size of the array. */ | |
89 | enum type_pieces | |
90 | {tp_end = -1, tp_pointer, tp_reference, tp_array, tp_function}; | |
91 | /* The stack can contain either an enum type_pieces or an int. */ | |
92 | union type_stack_elt { | |
93 | enum type_pieces piece; | |
94 | int int_val; | |
95 | }; | |
96 | union type_stack_elt *type_stack; | |
97 | int type_stack_depth, type_stack_size; | |
98 | ||
1ab3bf1b JG |
99 | extern void |
100 | write_exp_elt PARAMS ((union exp_element)); | |
101 | ||
102 | extern void | |
103 | write_exp_elt_opcode PARAMS ((enum exp_opcode)); | |
104 | ||
105 | extern void | |
106 | write_exp_elt_sym PARAMS ((struct symbol *)); | |
107 | ||
108 | extern void | |
109 | write_exp_elt_longcst PARAMS ((LONGEST)); | |
110 | ||
111 | extern void | |
112 | write_exp_elt_dblcst PARAMS ((double)); | |
113 | ||
114 | extern void | |
115 | write_exp_elt_type PARAMS ((struct type *)); | |
116 | ||
117 | extern void | |
118 | write_exp_elt_intern PARAMS ((struct internalvar *)); | |
119 | ||
120 | extern void | |
121 | write_exp_string PARAMS ((struct stoken)); | |
122 | ||
81028ab0 FF |
123 | extern void |
124 | write_exp_bitstring PARAMS ((struct stoken)); | |
125 | ||
1ab3bf1b JG |
126 | extern void |
127 | start_arglist PARAMS ((void)); | |
128 | ||
129 | extern int | |
130 | end_arglist PARAMS ((void)); | |
131 | ||
132 | extern void | |
133 | free_funcalls PARAMS ((void)); | |
134 | ||
135 | extern char * | |
136 | copy_name PARAMS ((struct stoken)); | |
137 | ||
138 | extern void | |
139 | push_type PARAMS ((enum type_pieces)); | |
140 | ||
141 | extern void | |
142 | push_type_int PARAMS ((int)); | |
143 | ||
144 | extern enum type_pieces | |
145 | pop_type PARAMS ((void)); | |
146 | ||
147 | extern int | |
148 | pop_type_int PARAMS ((void)); | |
3d6b6a90 JG |
149 | |
150 | /* During parsing of a C expression, the pointer to the next character | |
151 | is in this variable. */ | |
152 | ||
153 | char *lexptr; | |
154 | ||
155 | /* Tokens that refer to names do so with explicit pointer and length, | |
156 | so they can share the storage that lexptr is parsing. | |
157 | ||
158 | When it is necessary to pass a name to a function that expects | |
159 | a null-terminated string, the substring is copied out | |
160 | into a block of storage that namecopy points to. | |
161 | ||
162 | namecopy is allocated once, guaranteed big enough, for each parsing. */ | |
163 | ||
164 | char *namecopy; | |
165 | ||
166 | /* Current depth in parentheses within the expression. */ | |
167 | ||
168 | int paren_depth; | |
169 | ||
170 | /* Nonzero means stop parsing on first comma (if not within parentheses). */ | |
171 | ||
172 | int comma_terminates; | |
173 | \f | |
174 | /* These codes indicate operator precedences for expression printing, | |
175 | least tightly binding first. */ | |
176 | /* Adding 1 to a precedence value is done for binary operators, | |
177 | on the operand which is more tightly bound, so that operators | |
178 | of equal precedence within that operand will get parentheses. */ | |
179 | /* PREC_HYPER and PREC_ABOVE_COMMA are not the precedence of any operator; | |
180 | they are used as the "surrounding precedence" to force | |
181 | various kinds of things to be parenthesized. */ | |
182 | enum precedence | |
e58de8a2 FF |
183 | { PREC_NULL, PREC_COMMA, PREC_ABOVE_COMMA, PREC_ASSIGN, PREC_LOGICAL_OR, |
184 | PREC_LOGICAL_AND, PREC_BITWISE_IOR, PREC_BITWISE_AND, PREC_BITWISE_XOR, | |
185 | PREC_EQUAL, PREC_ORDER, PREC_SHIFT, PREC_ADD, PREC_MUL, PREC_REPEAT, | |
3d6b6a90 JG |
186 | PREC_HYPER, PREC_PREFIX, PREC_SUFFIX }; |
187 | ||
188 | /* Table mapping opcodes into strings for printing operators | |
189 | and precedences of the operators. */ | |
190 | ||
191 | struct op_print | |
192 | { | |
193 | char *string; | |
194 | enum exp_opcode opcode; | |
195 | /* Precedence of operator. These values are used only by comparisons. */ | |
196 | enum precedence precedence; | |
197 | int right_assoc; | |
198 | }; | |
1ab3bf1b JG |
199 | |
200 | #endif /* PARSER_DEFS_H */ |