Commit | Line | Data |
---|---|---|
c906108c | 1 | /* YACC parser for C expressions, for GDB. |
3666a048 | 2 | Copyright (C) 1986-2021 Free Software Foundation, Inc. |
c906108c | 3 | |
5b1ba0e5 | 4 | This file is part of GDB. |
c906108c | 5 | |
5b1ba0e5 NS |
6 | This program is free software; you can redistribute it and/or modify |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 3 of the License, or | |
9 | (at your option) any later version. | |
c906108c | 10 | |
5b1ba0e5 NS |
11 | This program is distributed in the hope that it will be useful, |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
c906108c | 15 | |
5b1ba0e5 NS |
16 | You should have received a copy of the GNU General Public License |
17 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ | |
c906108c SS |
18 | |
19 | /* Parse a C expression from text in a string, | |
20 | and return the result as a struct expression pointer. | |
21 | That structure contains arithmetic operations in reverse polish, | |
22 | with constants represented by operations that are followed by special data. | |
23 | See expression.h for the details of the format. | |
24 | What is important here is that it can be built up sequentially | |
25 | during the process of parsing; the lower levels of the tree always | |
26 | come first in the result. | |
27 | ||
28 | Note that malloc's and realloc's in this file are transformed to | |
29 | xmalloc and xrealloc respectively by the same sed command in the | |
30 | makefile that remaps any other malloc/realloc inserted by the parser | |
31 | generator. Doing this with #defines and trying to control the interaction | |
32 | with include files (<malloc.h> and <stdlib.h> for example) just became | |
33 | too messy, particularly when such includes can be inserted at random | |
34 | times by the parser generator. */ | |
4d29c0a8 | 35 | |
c906108c SS |
36 | %{ |
37 | ||
38 | #include "defs.h" | |
c906108c SS |
39 | #include <ctype.h> |
40 | #include "expression.h" | |
41 | #include "value.h" | |
42 | #include "parser-defs.h" | |
43 | #include "language.h" | |
44 | #include "c-lang.h" | |
b1b60145 | 45 | #include "c-support.h" |
c906108c SS |
46 | #include "bfd.h" /* Required by objfiles.h. */ |
47 | #include "symfile.h" /* Required by objfiles.h. */ | |
48 | #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */ | |
234b45d4 | 49 | #include "charset.h" |
fe898f56 | 50 | #include "block.h" |
79c2c32d | 51 | #include "cp-support.h" |
7c8adf68 | 52 | #include "macroscope.h" |
f2e8016f | 53 | #include "objc-lang.h" |
79d43c61 | 54 | #include "typeprint.h" |
6592e36f | 55 | #include "cp-abi.h" |
dac43e32 | 56 | #include "type-stack.h" |
fa649bb7 | 57 | #include "target-float.h" |
c906108c | 58 | |
fa9f5be6 | 59 | #define parse_type(ps) builtin_type (ps->gdbarch ()) |
3e79cecf | 60 | |
b3f11165 PA |
61 | /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, |
62 | etc). */ | |
63 | #define GDB_YY_REMAP_PREFIX c_ | |
64 | #include "yy-remap.h" | |
f461f5cf | 65 | |
410a0ff2 SDJ |
66 | /* The state of the parser, used internally when we are parsing the |
67 | expression. */ | |
68 | ||
69 | static struct parser_state *pstate = NULL; | |
70 | ||
02e12e38 TT |
71 | /* Data that must be held for the duration of a parse. */ |
72 | ||
73 | struct c_parse_state | |
74 | { | |
75 | /* These are used to hold type lists and type stacks that are | |
76 | allocated during the parse. */ | |
77 | std::vector<std::unique_ptr<std::vector<struct type *>>> type_lists; | |
78 | std::vector<std::unique_ptr<struct type_stack>> type_stacks; | |
c65bac38 TT |
79 | |
80 | /* Storage for some strings allocated during the parse. */ | |
81 | std::vector<gdb::unique_xmalloc_ptr<char>> strings; | |
9d30e1fd TT |
82 | |
83 | /* When we find that lexptr (the global var defined in parse.c) is | |
84 | pointing at a macro invocation, we expand the invocation, and call | |
85 | scan_macro_expansion to save the old lexptr here and point lexptr | |
86 | into the expanded text. When we reach the end of that, we call | |
87 | end_macro_expansion to pop back to the value we saved here. The | |
88 | macro expansion code promises to return only fully-expanded text, | |
89 | so we don't need to "push" more than one level. | |
90 | ||
91 | This is disgusting, of course. It would be cleaner to do all macro | |
92 | expansion beforehand, and then hand that to lexptr. But we don't | |
93 | really know where the expression ends. Remember, in a command like | |
94 | ||
95 | (gdb) break *ADDRESS if CONDITION | |
96 | ||
97 | we evaluate ADDRESS in the scope of the current frame, but we | |
98 | evaluate CONDITION in the scope of the breakpoint's location. So | |
99 | it's simply wrong to try to macro-expand the whole thing at once. */ | |
100 | const char *macro_original_text = nullptr; | |
101 | ||
102 | /* We save all intermediate macro expansions on this obstack for the | |
103 | duration of a single parse. The expansion text may sometimes have | |
104 | to live past the end of the expansion, due to yacc lookahead. | |
105 | Rather than try to be clever about saving the data for a single | |
106 | token, we simply keep it all and delete it after parsing has | |
107 | completed. */ | |
108 | auto_obstack expansion_obstack; | |
dac43e32 TT |
109 | |
110 | /* The type stack. */ | |
111 | struct type_stack type_stack; | |
02e12e38 TT |
112 | }; |
113 | ||
114 | /* This is set and cleared in c_parse. */ | |
115 | ||
116 | static struct c_parse_state *cpstate; | |
117 | ||
a14ed312 | 118 | int yyparse (void); |
c906108c | 119 | |
a14ed312 | 120 | static int yylex (void); |
c906108c | 121 | |
69d340c6 | 122 | static void yyerror (const char *); |
c906108c | 123 | |
3d567982 TT |
124 | static int type_aggregate_p (struct type *); |
125 | ||
c906108c SS |
126 | %} |
127 | ||
128 | /* Although the yacc "value" of an expression is not used, | |
129 | since the result is stored in the structure being created, | |
130 | other node types do have values. */ | |
131 | ||
132 | %union | |
133 | { | |
134 | LONGEST lval; | |
135 | struct { | |
136 | LONGEST val; | |
137 | struct type *type; | |
138 | } typed_val_int; | |
27bc4d80 TJB |
139 | struct { |
140 | gdb_byte val[16]; | |
141 | struct type *type; | |
edd079d9 | 142 | } typed_val_float; |
c906108c SS |
143 | struct type *tval; |
144 | struct stoken sval; | |
6c7a06a3 | 145 | struct typed_stoken tsval; |
c906108c SS |
146 | struct ttype tsym; |
147 | struct symtoken ssym; | |
148 | int voidval; | |
3977b71f | 149 | const struct block *bval; |
c906108c | 150 | enum exp_opcode opcode; |
c906108c | 151 | |
6c7a06a3 | 152 | struct stoken_vector svec; |
02e12e38 | 153 | std::vector<struct type *> *tvec; |
fcde5961 TT |
154 | |
155 | struct type_stack *type_stack; | |
f2e8016f | 156 | |
fe978cb0 | 157 | struct objc_class_str theclass; |
c906108c SS |
158 | } |
159 | ||
160 | %{ | |
161 | /* YYSTYPE gets defined by %union */ | |
410a0ff2 SDJ |
162 | static int parse_number (struct parser_state *par_state, |
163 | const char *, int, int, YYSTYPE *); | |
66c53f2b | 164 | static struct stoken operator_stoken (const char *); |
6f0ffe50 | 165 | static struct stoken typename_stoken (const char *); |
02e12e38 | 166 | static void check_parameter_typelist (std::vector<struct type *> *); |
410a0ff2 SDJ |
167 | static void write_destructor_name (struct parser_state *par_state, |
168 | struct stoken); | |
9507860e | 169 | |
12c5175d | 170 | #ifdef YYBISON |
9507860e TT |
171 | static void c_print_token (FILE *file, int type, YYSTYPE value); |
172 | #define YYPRINT(FILE, TYPE, VALUE) c_print_token (FILE, TYPE, VALUE) | |
12c5175d | 173 | #endif |
c906108c SS |
174 | %} |
175 | ||
858be34c | 176 | %type <voidval> exp exp1 type_exp start variable qualified_name lcurly function_method |
c906108c | 177 | %type <lval> rcurly |
3638a098 | 178 | %type <tval> type typebase scalar_type |
a6fb9c08 | 179 | %type <tvec> nonempty_typelist func_mod parameter_typelist |
c906108c SS |
180 | /* %type <bval> block */ |
181 | ||
182 | /* Fancy type parsing. */ | |
c906108c SS |
183 | %type <tval> ptype |
184 | %type <lval> array_mod | |
95c391b6 | 185 | %type <tval> conversion_type_id |
c906108c | 186 | |
fcde5961 TT |
187 | %type <type_stack> ptr_operator_ts abs_decl direct_abs_decl |
188 | ||
fa649bb7 TT |
189 | %token <typed_val_int> INT COMPLEX_INT |
190 | %token <typed_val_float> FLOAT COMPLEX_FLOAT | |
c906108c SS |
191 | |
192 | /* Both NAME and TYPENAME tokens represent symbols in the input, | |
193 | and both convey their data as strings. | |
194 | But a TYPENAME is a string that happens to be defined as a typedef | |
195 | or builtin type name (such as int or char) | |
196 | and a NAME is any other symbol. | |
197 | Contexts where this distinction is not important can use the | |
198 | nonterminal "name", which matches either NAME or TYPENAME. */ | |
199 | ||
6c7a06a3 | 200 | %token <tsval> STRING |
f2e8016f TT |
201 | %token <sval> NSSTRING /* ObjC Foundation "NSString" literal */ |
202 | %token SELECTOR /* ObjC "@selector" pseudo-operator */ | |
6c7a06a3 | 203 | %token <tsval> CHAR |
c906108c | 204 | %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */ |
7322dca9 | 205 | %token <ssym> UNKNOWN_CPP_NAME |
65d12d83 | 206 | %token <voidval> COMPLETE |
c906108c | 207 | %token <tsym> TYPENAME |
fe978cb0 | 208 | %token <theclass> CLASSNAME /* ObjC Class name */ |
0f5d3f63 | 209 | %type <sval> name field_name |
6c7a06a3 | 210 | %type <svec> string_exp |
c906108c | 211 | %type <ssym> name_not_typename |
fe978cb0 | 212 | %type <tsym> type_name |
c906108c | 213 | |
f2e8016f TT |
214 | /* This is like a '[' token, but is only generated when parsing |
215 | Objective C. This lets us reuse the same parser without | |
216 | erroneously parsing ObjC-specific expressions in C. */ | |
217 | %token OBJC_LBRAC | |
218 | ||
c906108c SS |
219 | /* A NAME_OR_INT is a symbol which is not known in the symbol table, |
220 | but which would parse as a valid number in the current input radix. | |
221 | E.g. "c" when input_radix==16. Depending on the parse, it will be | |
222 | turned into a name or into a number. */ | |
223 | ||
4d29c0a8 | 224 | %token <ssym> NAME_OR_INT |
c906108c | 225 | |
66c53f2b | 226 | %token OPERATOR |
007e1530 | 227 | %token STRUCT CLASS UNION ENUM SIZEOF ALIGNOF UNSIGNED COLONCOLON |
c906108c SS |
228 | %token TEMPLATE |
229 | %token ERROR | |
66c53f2b | 230 | %token NEW DELETE |
fe978cb0 | 231 | %type <sval> oper |
4e8f195d | 232 | %token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST |
941b2081 | 233 | %token ENTRY |
608b4967 TT |
234 | %token TYPEOF |
235 | %token DECLTYPE | |
6e72ca20 | 236 | %token TYPEID |
c906108c SS |
237 | |
238 | /* Special type cases, put in to allow the parser to distinguish different | |
239 | legal basetypes. */ | |
240 | %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD | |
3293bbaf | 241 | %token RESTRICT ATOMIC |
3638a098 | 242 | %token FLOAT_KEYWORD COMPLEX |
c906108c | 243 | |
cfeadda5 | 244 | %token <sval> DOLLAR_VARIABLE |
c906108c SS |
245 | |
246 | %token <opcode> ASSIGN_MODIFY | |
247 | ||
248 | /* C++ */ | |
c906108c SS |
249 | %token TRUEKEYWORD |
250 | %token FALSEKEYWORD | |
251 | ||
252 | ||
253 | %left ',' | |
254 | %left ABOVE_COMMA | |
255 | %right '=' ASSIGN_MODIFY | |
256 | %right '?' | |
257 | %left OROR | |
258 | %left ANDAND | |
259 | %left '|' | |
260 | %left '^' | |
261 | %left '&' | |
262 | %left EQUAL NOTEQUAL | |
263 | %left '<' '>' LEQ GEQ | |
264 | %left LSH RSH | |
265 | %left '@' | |
266 | %left '+' '-' | |
267 | %left '*' '/' '%' | |
268 | %right UNARY INCREMENT DECREMENT | |
f2e8016f | 269 | %right ARROW ARROW_STAR '.' DOT_STAR '[' OBJC_LBRAC '(' |
4d29c0a8 | 270 | %token <ssym> BLOCKNAME |
c906108c SS |
271 | %token <bval> FILENAME |
272 | %type <bval> block | |
273 | %left COLONCOLON | |
274 | ||
a6fb9c08 TT |
275 | %token DOTDOTDOT |
276 | ||
c906108c SS |
277 | \f |
278 | %% | |
279 | ||
280 | start : exp1 | |
281 | | type_exp | |
282 | ; | |
283 | ||
284 | type_exp: type | |
410a0ff2 SDJ |
285 | { write_exp_elt_opcode(pstate, OP_TYPE); |
286 | write_exp_elt_type(pstate, $1); | |
287 | write_exp_elt_opcode(pstate, OP_TYPE);} | |
608b4967 TT |
288 | | TYPEOF '(' exp ')' |
289 | { | |
410a0ff2 | 290 | write_exp_elt_opcode (pstate, OP_TYPEOF); |
608b4967 TT |
291 | } |
292 | | TYPEOF '(' type ')' | |
293 | { | |
410a0ff2 SDJ |
294 | write_exp_elt_opcode (pstate, OP_TYPE); |
295 | write_exp_elt_type (pstate, $3); | |
296 | write_exp_elt_opcode (pstate, OP_TYPE); | |
608b4967 TT |
297 | } |
298 | | DECLTYPE '(' exp ')' | |
299 | { | |
410a0ff2 | 300 | write_exp_elt_opcode (pstate, OP_DECLTYPE); |
608b4967 | 301 | } |
c906108c SS |
302 | ; |
303 | ||
304 | /* Expressions, including the comma operator. */ | |
305 | exp1 : exp | |
306 | | exp1 ',' exp | |
410a0ff2 | 307 | { write_exp_elt_opcode (pstate, BINOP_COMMA); } |
c906108c SS |
308 | ; |
309 | ||
310 | /* Expressions, not including the comma operator. */ | |
311 | exp : '*' exp %prec UNARY | |
410a0ff2 | 312 | { write_exp_elt_opcode (pstate, UNOP_IND); } |
ef944135 | 313 | ; |
c906108c SS |
314 | |
315 | exp : '&' exp %prec UNARY | |
410a0ff2 | 316 | { write_exp_elt_opcode (pstate, UNOP_ADDR); } |
ef944135 | 317 | ; |
c906108c SS |
318 | |
319 | exp : '-' exp %prec UNARY | |
410a0ff2 | 320 | { write_exp_elt_opcode (pstate, UNOP_NEG); } |
c906108c SS |
321 | ; |
322 | ||
36e9969c | 323 | exp : '+' exp %prec UNARY |
410a0ff2 | 324 | { write_exp_elt_opcode (pstate, UNOP_PLUS); } |
36e9969c NS |
325 | ; |
326 | ||
c906108c | 327 | exp : '!' exp %prec UNARY |
410a0ff2 | 328 | { write_exp_elt_opcode (pstate, UNOP_LOGICAL_NOT); } |
c906108c SS |
329 | ; |
330 | ||
331 | exp : '~' exp %prec UNARY | |
410a0ff2 | 332 | { write_exp_elt_opcode (pstate, UNOP_COMPLEMENT); } |
c906108c SS |
333 | ; |
334 | ||
335 | exp : INCREMENT exp %prec UNARY | |
410a0ff2 | 336 | { write_exp_elt_opcode (pstate, UNOP_PREINCREMENT); } |
c906108c SS |
337 | ; |
338 | ||
339 | exp : DECREMENT exp %prec UNARY | |
410a0ff2 | 340 | { write_exp_elt_opcode (pstate, UNOP_PREDECREMENT); } |
c906108c SS |
341 | ; |
342 | ||
343 | exp : exp INCREMENT %prec UNARY | |
410a0ff2 | 344 | { write_exp_elt_opcode (pstate, UNOP_POSTINCREMENT); } |
c906108c SS |
345 | ; |
346 | ||
347 | exp : exp DECREMENT %prec UNARY | |
410a0ff2 | 348 | { write_exp_elt_opcode (pstate, UNOP_POSTDECREMENT); } |
c906108c SS |
349 | ; |
350 | ||
6e72ca20 | 351 | exp : TYPEID '(' exp ')' %prec UNARY |
410a0ff2 | 352 | { write_exp_elt_opcode (pstate, OP_TYPEID); } |
6e72ca20 TT |
353 | ; |
354 | ||
355 | exp : TYPEID '(' type_exp ')' %prec UNARY | |
410a0ff2 | 356 | { write_exp_elt_opcode (pstate, OP_TYPEID); } |
6e72ca20 TT |
357 | ; |
358 | ||
c906108c | 359 | exp : SIZEOF exp %prec UNARY |
410a0ff2 | 360 | { write_exp_elt_opcode (pstate, UNOP_SIZEOF); } |
c906108c SS |
361 | ; |
362 | ||
007e1530 TT |
363 | exp : ALIGNOF '(' type_exp ')' %prec UNARY |
364 | { write_exp_elt_opcode (pstate, UNOP_ALIGNOF); } | |
365 | ; | |
366 | ||
0f5d3f63 | 367 | exp : exp ARROW field_name |
410a0ff2 SDJ |
368 | { write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
369 | write_exp_string (pstate, $3); | |
370 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); } | |
c906108c SS |
371 | ; |
372 | ||
0f5d3f63 | 373 | exp : exp ARROW field_name COMPLETE |
2a612529 | 374 | { pstate->mark_struct_expression (); |
410a0ff2 SDJ |
375 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
376 | write_exp_string (pstate, $3); | |
377 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); } | |
65d12d83 TT |
378 | ; |
379 | ||
380 | exp : exp ARROW COMPLETE | |
381 | { struct stoken s; | |
2a612529 | 382 | pstate->mark_struct_expression (); |
410a0ff2 | 383 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
65d12d83 TT |
384 | s.ptr = ""; |
385 | s.length = 0; | |
410a0ff2 SDJ |
386 | write_exp_string (pstate, s); |
387 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); } | |
65d12d83 TT |
388 | ; |
389 | ||
24955f63 | 390 | exp : exp ARROW '~' name |
410a0ff2 SDJ |
391 | { write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
392 | write_destructor_name (pstate, $4); | |
393 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); } | |
24955f63 TT |
394 | ; |
395 | ||
396 | exp : exp ARROW '~' name COMPLETE | |
2a612529 | 397 | { pstate->mark_struct_expression (); |
410a0ff2 SDJ |
398 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
399 | write_destructor_name (pstate, $4); | |
400 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); } | |
24955f63 TT |
401 | ; |
402 | ||
c906108c SS |
403 | exp : exp ARROW qualified_name |
404 | { /* exp->type::name becomes exp->*(&type::name) */ | |
405 | /* Note: this doesn't work if name is a | |
406 | static member! FIXME */ | |
410a0ff2 SDJ |
407 | write_exp_elt_opcode (pstate, UNOP_ADDR); |
408 | write_exp_elt_opcode (pstate, STRUCTOP_MPTR); } | |
c906108c SS |
409 | ; |
410 | ||
c1af96a0 | 411 | exp : exp ARROW_STAR exp |
410a0ff2 | 412 | { write_exp_elt_opcode (pstate, STRUCTOP_MPTR); } |
c906108c SS |
413 | ; |
414 | ||
0f5d3f63 | 415 | exp : exp '.' field_name |
410a0ff2 SDJ |
416 | { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); |
417 | write_exp_string (pstate, $3); | |
418 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); } | |
c906108c SS |
419 | ; |
420 | ||
0f5d3f63 | 421 | exp : exp '.' field_name COMPLETE |
2a612529 | 422 | { pstate->mark_struct_expression (); |
410a0ff2 SDJ |
423 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); |
424 | write_exp_string (pstate, $3); | |
425 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); } | |
65d12d83 TT |
426 | ; |
427 | ||
428 | exp : exp '.' COMPLETE | |
429 | { struct stoken s; | |
2a612529 | 430 | pstate->mark_struct_expression (); |
410a0ff2 | 431 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); |
65d12d83 TT |
432 | s.ptr = ""; |
433 | s.length = 0; | |
410a0ff2 SDJ |
434 | write_exp_string (pstate, s); |
435 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); } | |
65d12d83 TT |
436 | ; |
437 | ||
24955f63 | 438 | exp : exp '.' '~' name |
410a0ff2 SDJ |
439 | { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); |
440 | write_destructor_name (pstate, $4); | |
441 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); } | |
24955f63 TT |
442 | ; |
443 | ||
444 | exp : exp '.' '~' name COMPLETE | |
2a612529 | 445 | { pstate->mark_struct_expression (); |
410a0ff2 SDJ |
446 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); |
447 | write_destructor_name (pstate, $4); | |
448 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); } | |
24955f63 TT |
449 | ; |
450 | ||
c906108c SS |
451 | exp : exp '.' qualified_name |
452 | { /* exp.type::name becomes exp.*(&type::name) */ | |
453 | /* Note: this doesn't work if name is a | |
454 | static member! FIXME */ | |
410a0ff2 SDJ |
455 | write_exp_elt_opcode (pstate, UNOP_ADDR); |
456 | write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); } | |
c906108c SS |
457 | ; |
458 | ||
c1af96a0 | 459 | exp : exp DOT_STAR exp |
410a0ff2 | 460 | { write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); } |
c906108c SS |
461 | ; |
462 | ||
463 | exp : exp '[' exp1 ']' | |
410a0ff2 | 464 | { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); } |
c906108c SS |
465 | ; |
466 | ||
f2e8016f | 467 | exp : exp OBJC_LBRAC exp1 ']' |
410a0ff2 | 468 | { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); } |
f2e8016f TT |
469 | ; |
470 | ||
471 | /* | |
472 | * The rules below parse ObjC message calls of the form: | |
473 | * '[' target selector {':' argument}* ']' | |
474 | */ | |
475 | ||
476 | exp : OBJC_LBRAC TYPENAME | |
477 | { | |
fe978cb0 | 478 | CORE_ADDR theclass; |
f2e8016f | 479 | |
61f4b350 | 480 | std::string copy = copy_name ($2.stoken); |
fa9f5be6 | 481 | theclass = lookup_objc_class (pstate->gdbarch (), |
61f4b350 | 482 | copy.c_str ()); |
fe978cb0 | 483 | if (theclass == 0) |
f2e8016f | 484 | error (_("%s is not an ObjC Class"), |
61f4b350 | 485 | copy.c_str ()); |
410a0ff2 SDJ |
486 | write_exp_elt_opcode (pstate, OP_LONG); |
487 | write_exp_elt_type (pstate, | |
61f4b350 | 488 | parse_type (pstate)->builtin_int); |
fe978cb0 | 489 | write_exp_elt_longcst (pstate, (LONGEST) theclass); |
410a0ff2 | 490 | write_exp_elt_opcode (pstate, OP_LONG); |
f2e8016f TT |
491 | start_msglist(); |
492 | } | |
493 | msglist ']' | |
410a0ff2 SDJ |
494 | { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); |
495 | end_msglist (pstate); | |
496 | write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); | |
f2e8016f TT |
497 | } |
498 | ; | |
499 | ||
500 | exp : OBJC_LBRAC CLASSNAME | |
501 | { | |
410a0ff2 SDJ |
502 | write_exp_elt_opcode (pstate, OP_LONG); |
503 | write_exp_elt_type (pstate, | |
504 | parse_type (pstate)->builtin_int); | |
fe978cb0 | 505 | write_exp_elt_longcst (pstate, (LONGEST) $2.theclass); |
410a0ff2 | 506 | write_exp_elt_opcode (pstate, OP_LONG); |
f2e8016f TT |
507 | start_msglist(); |
508 | } | |
509 | msglist ']' | |
410a0ff2 SDJ |
510 | { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); |
511 | end_msglist (pstate); | |
512 | write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); | |
f2e8016f TT |
513 | } |
514 | ; | |
515 | ||
516 | exp : OBJC_LBRAC exp | |
517 | { start_msglist(); } | |
518 | msglist ']' | |
410a0ff2 SDJ |
519 | { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); |
520 | end_msglist (pstate); | |
521 | write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); | |
f2e8016f TT |
522 | } |
523 | ; | |
524 | ||
525 | msglist : name | |
526 | { add_msglist(&$1, 0); } | |
527 | | msgarglist | |
528 | ; | |
529 | ||
530 | msgarglist : msgarg | |
531 | | msgarglist msgarg | |
532 | ; | |
533 | ||
534 | msgarg : name ':' exp | |
535 | { add_msglist(&$1, 1); } | |
536 | | ':' exp /* Unnamed arg. */ | |
537 | { add_msglist(0, 1); } | |
538 | | ',' exp /* Variable number of args. */ | |
539 | { add_msglist(0, 0); } | |
540 | ; | |
541 | ||
4d29c0a8 | 542 | exp : exp '(' |
c906108c SS |
543 | /* This is to save the value of arglist_len |
544 | being accumulated by an outer function call. */ | |
43476f0b | 545 | { pstate->start_arglist (); } |
c906108c | 546 | arglist ')' %prec ARROW |
410a0ff2 SDJ |
547 | { write_exp_elt_opcode (pstate, OP_FUNCALL); |
548 | write_exp_elt_longcst (pstate, | |
43476f0b | 549 | pstate->end_arglist ()); |
410a0ff2 | 550 | write_exp_elt_opcode (pstate, OP_FUNCALL); } |
c906108c SS |
551 | ; |
552 | ||
858be34c PA |
553 | /* This is here to disambiguate with the production for |
554 | "func()::static_var" further below, which uses | |
555 | function_method_void. */ | |
556 | exp : exp '(' ')' %prec ARROW | |
43476f0b | 557 | { pstate->start_arglist (); |
858be34c PA |
558 | write_exp_elt_opcode (pstate, OP_FUNCALL); |
559 | write_exp_elt_longcst (pstate, | |
43476f0b | 560 | pstate->end_arglist ()); |
858be34c PA |
561 | write_exp_elt_opcode (pstate, OP_FUNCALL); } |
562 | ; | |
563 | ||
564 | ||
941b2081 | 565 | exp : UNKNOWN_CPP_NAME '(' |
7322dca9 SW |
566 | { |
567 | /* This could potentially be a an argument defined | |
568 | lookup function (Koenig). */ | |
410a0ff2 | 569 | write_exp_elt_opcode (pstate, OP_ADL_FUNC); |
1e58a4a4 TT |
570 | write_exp_elt_block |
571 | (pstate, pstate->expression_context_block); | |
410a0ff2 SDJ |
572 | write_exp_elt_sym (pstate, |
573 | NULL); /* Placeholder. */ | |
574 | write_exp_string (pstate, $1.stoken); | |
575 | write_exp_elt_opcode (pstate, OP_ADL_FUNC); | |
7322dca9 SW |
576 | |
577 | /* This is to save the value of arglist_len | |
578 | being accumulated by an outer function call. */ | |
579 | ||
43476f0b | 580 | pstate->start_arglist (); |
7322dca9 SW |
581 | } |
582 | arglist ')' %prec ARROW | |
583 | { | |
410a0ff2 SDJ |
584 | write_exp_elt_opcode (pstate, OP_FUNCALL); |
585 | write_exp_elt_longcst (pstate, | |
43476f0b | 586 | pstate->end_arglist ()); |
410a0ff2 | 587 | write_exp_elt_opcode (pstate, OP_FUNCALL); |
7322dca9 SW |
588 | } |
589 | ; | |
590 | ||
c906108c | 591 | lcurly : '{' |
43476f0b | 592 | { pstate->start_arglist (); } |
c906108c SS |
593 | ; |
594 | ||
595 | arglist : | |
596 | ; | |
597 | ||
598 | arglist : exp | |
43476f0b | 599 | { pstate->arglist_len = 1; } |
c906108c SS |
600 | ; |
601 | ||
602 | arglist : arglist ',' exp %prec ABOVE_COMMA | |
43476f0b | 603 | { pstate->arglist_len++; } |
c906108c SS |
604 | ; |
605 | ||
858be34c | 606 | function_method: exp '(' parameter_typelist ')' const_or_volatile |
02e12e38 TT |
607 | { |
608 | std::vector<struct type *> *type_list = $3; | |
609 | LONGEST len = type_list->size (); | |
71918a86 | 610 | |
410a0ff2 | 611 | write_exp_elt_opcode (pstate, TYPE_INSTANCE); |
3693fdb3 PA |
612 | /* Save the const/volatile qualifiers as |
613 | recorded by the const_or_volatile | |
614 | production's actions. */ | |
dac43e32 TT |
615 | write_exp_elt_longcst |
616 | (pstate, | |
617 | (cpstate->type_stack | |
618 | .follow_type_instance_flags ())); | |
410a0ff2 | 619 | write_exp_elt_longcst (pstate, len); |
02e12e38 | 620 | for (type *type_elt : *type_list) |
410a0ff2 SDJ |
621 | write_exp_elt_type (pstate, type_elt); |
622 | write_exp_elt_longcst(pstate, len); | |
623 | write_exp_elt_opcode (pstate, TYPE_INSTANCE); | |
072bba3b KS |
624 | } |
625 | ; | |
626 | ||
858be34c PA |
627 | function_method_void: exp '(' ')' const_or_volatile |
628 | { write_exp_elt_opcode (pstate, TYPE_INSTANCE); | |
3693fdb3 | 629 | /* See above. */ |
dac43e32 TT |
630 | write_exp_elt_longcst |
631 | (pstate, | |
632 | cpstate->type_stack.follow_type_instance_flags ()); | |
858be34c PA |
633 | write_exp_elt_longcst (pstate, 0); |
634 | write_exp_elt_longcst (pstate, 0); | |
635 | write_exp_elt_opcode (pstate, TYPE_INSTANCE); | |
636 | } | |
637 | ; | |
638 | ||
639 | exp : function_method | |
640 | ; | |
641 | ||
642 | /* Normally we must interpret "func()" as a function call, instead of | |
643 | a type. The user needs to write func(void) to disambiguate. | |
644 | However, in the "func()::static_var" case, there's no | |
645 | ambiguity. */ | |
646 | function_method_void_or_typelist: function_method | |
647 | | function_method_void | |
648 | ; | |
649 | ||
650 | exp : function_method_void_or_typelist COLONCOLON name | |
651 | { | |
652 | write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR); | |
653 | write_exp_string (pstate, $3); | |
654 | write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR); | |
655 | } | |
656 | ; | |
657 | ||
c906108c | 658 | rcurly : '}' |
43476f0b | 659 | { $$ = pstate->end_arglist () - 1; } |
c906108c SS |
660 | ; |
661 | exp : lcurly arglist rcurly %prec ARROW | |
410a0ff2 SDJ |
662 | { write_exp_elt_opcode (pstate, OP_ARRAY); |
663 | write_exp_elt_longcst (pstate, (LONGEST) 0); | |
664 | write_exp_elt_longcst (pstate, (LONGEST) $3); | |
665 | write_exp_elt_opcode (pstate, OP_ARRAY); } | |
c906108c SS |
666 | ; |
667 | ||
9eaf6705 | 668 | exp : lcurly type_exp rcurly exp %prec UNARY |
410a0ff2 | 669 | { write_exp_elt_opcode (pstate, UNOP_MEMVAL_TYPE); } |
c906108c SS |
670 | ; |
671 | ||
9eaf6705 | 672 | exp : '(' type_exp ')' exp %prec UNARY |
410a0ff2 | 673 | { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); } |
c906108c SS |
674 | ; |
675 | ||
676 | exp : '(' exp1 ')' | |
677 | { } | |
678 | ; | |
679 | ||
680 | /* Binary operators in order of decreasing precedence. */ | |
681 | ||
682 | exp : exp '@' exp | |
410a0ff2 | 683 | { write_exp_elt_opcode (pstate, BINOP_REPEAT); } |
c906108c SS |
684 | ; |
685 | ||
686 | exp : exp '*' exp | |
410a0ff2 | 687 | { write_exp_elt_opcode (pstate, BINOP_MUL); } |
c906108c SS |
688 | ; |
689 | ||
690 | exp : exp '/' exp | |
410a0ff2 | 691 | { write_exp_elt_opcode (pstate, BINOP_DIV); } |
c906108c SS |
692 | ; |
693 | ||
694 | exp : exp '%' exp | |
410a0ff2 | 695 | { write_exp_elt_opcode (pstate, BINOP_REM); } |
c906108c SS |
696 | ; |
697 | ||
698 | exp : exp '+' exp | |
410a0ff2 | 699 | { write_exp_elt_opcode (pstate, BINOP_ADD); } |
c906108c SS |
700 | ; |
701 | ||
702 | exp : exp '-' exp | |
410a0ff2 | 703 | { write_exp_elt_opcode (pstate, BINOP_SUB); } |
c906108c SS |
704 | ; |
705 | ||
706 | exp : exp LSH exp | |
410a0ff2 | 707 | { write_exp_elt_opcode (pstate, BINOP_LSH); } |
c906108c SS |
708 | ; |
709 | ||
710 | exp : exp RSH exp | |
410a0ff2 | 711 | { write_exp_elt_opcode (pstate, BINOP_RSH); } |
c906108c SS |
712 | ; |
713 | ||
714 | exp : exp EQUAL exp | |
410a0ff2 | 715 | { write_exp_elt_opcode (pstate, BINOP_EQUAL); } |
c906108c SS |
716 | ; |
717 | ||
718 | exp : exp NOTEQUAL exp | |
410a0ff2 | 719 | { write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); } |
c906108c SS |
720 | ; |
721 | ||
722 | exp : exp LEQ exp | |
410a0ff2 | 723 | { write_exp_elt_opcode (pstate, BINOP_LEQ); } |
c906108c SS |
724 | ; |
725 | ||
726 | exp : exp GEQ exp | |
410a0ff2 | 727 | { write_exp_elt_opcode (pstate, BINOP_GEQ); } |
c906108c SS |
728 | ; |
729 | ||
730 | exp : exp '<' exp | |
410a0ff2 | 731 | { write_exp_elt_opcode (pstate, BINOP_LESS); } |
c906108c SS |
732 | ; |
733 | ||
734 | exp : exp '>' exp | |
410a0ff2 | 735 | { write_exp_elt_opcode (pstate, BINOP_GTR); } |
c906108c SS |
736 | ; |
737 | ||
738 | exp : exp '&' exp | |
410a0ff2 | 739 | { write_exp_elt_opcode (pstate, BINOP_BITWISE_AND); } |
c906108c SS |
740 | ; |
741 | ||
742 | exp : exp '^' exp | |
410a0ff2 | 743 | { write_exp_elt_opcode (pstate, BINOP_BITWISE_XOR); } |
c906108c SS |
744 | ; |
745 | ||
746 | exp : exp '|' exp | |
410a0ff2 | 747 | { write_exp_elt_opcode (pstate, BINOP_BITWISE_IOR); } |
c906108c SS |
748 | ; |
749 | ||
750 | exp : exp ANDAND exp | |
410a0ff2 | 751 | { write_exp_elt_opcode (pstate, BINOP_LOGICAL_AND); } |
c906108c SS |
752 | ; |
753 | ||
754 | exp : exp OROR exp | |
410a0ff2 | 755 | { write_exp_elt_opcode (pstate, BINOP_LOGICAL_OR); } |
c906108c SS |
756 | ; |
757 | ||
758 | exp : exp '?' exp ':' exp %prec '?' | |
410a0ff2 | 759 | { write_exp_elt_opcode (pstate, TERNOP_COND); } |
c906108c | 760 | ; |
4d29c0a8 | 761 | |
c906108c | 762 | exp : exp '=' exp |
410a0ff2 | 763 | { write_exp_elt_opcode (pstate, BINOP_ASSIGN); } |
c906108c SS |
764 | ; |
765 | ||
766 | exp : exp ASSIGN_MODIFY exp | |
410a0ff2 SDJ |
767 | { write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY); |
768 | write_exp_elt_opcode (pstate, $2); | |
769 | write_exp_elt_opcode (pstate, | |
770 | BINOP_ASSIGN_MODIFY); } | |
c906108c SS |
771 | ; |
772 | ||
773 | exp : INT | |
410a0ff2 SDJ |
774 | { write_exp_elt_opcode (pstate, OP_LONG); |
775 | write_exp_elt_type (pstate, $1.type); | |
776 | write_exp_elt_longcst (pstate, (LONGEST) ($1.val)); | |
777 | write_exp_elt_opcode (pstate, OP_LONG); } | |
c906108c SS |
778 | ; |
779 | ||
fa649bb7 TT |
780 | exp : COMPLEX_INT |
781 | { | |
782 | write_exp_elt_opcode (pstate, OP_LONG); | |
783 | write_exp_elt_type (pstate, TYPE_TARGET_TYPE ($1.type)); | |
784 | write_exp_elt_longcst (pstate, 0); | |
785 | write_exp_elt_opcode (pstate, OP_LONG); | |
786 | write_exp_elt_opcode (pstate, OP_LONG); | |
787 | write_exp_elt_type (pstate, TYPE_TARGET_TYPE ($1.type)); | |
788 | write_exp_elt_longcst (pstate, (LONGEST) ($1.val)); | |
789 | write_exp_elt_opcode (pstate, OP_LONG); | |
790 | write_exp_elt_opcode (pstate, OP_COMPLEX); | |
791 | write_exp_elt_type (pstate, $1.type); | |
792 | write_exp_elt_opcode (pstate, OP_COMPLEX); | |
793 | } | |
794 | ; | |
795 | ||
6c7a06a3 TT |
796 | exp : CHAR |
797 | { | |
798 | struct stoken_vector vec; | |
799 | vec.len = 1; | |
800 | vec.tokens = &$1; | |
410a0ff2 | 801 | write_exp_string_vector (pstate, $1.type, &vec); |
6c7a06a3 TT |
802 | } |
803 | ; | |
804 | ||
c906108c SS |
805 | exp : NAME_OR_INT |
806 | { YYSTYPE val; | |
410a0ff2 SDJ |
807 | parse_number (pstate, $1.stoken.ptr, |
808 | $1.stoken.length, 0, &val); | |
809 | write_exp_elt_opcode (pstate, OP_LONG); | |
810 | write_exp_elt_type (pstate, val.typed_val_int.type); | |
811 | write_exp_elt_longcst (pstate, | |
812 | (LONGEST) val.typed_val_int.val); | |
813 | write_exp_elt_opcode (pstate, OP_LONG); | |
c906108c SS |
814 | } |
815 | ; | |
816 | ||
817 | ||
818 | exp : FLOAT | |
edd079d9 | 819 | { write_exp_elt_opcode (pstate, OP_FLOAT); |
410a0ff2 | 820 | write_exp_elt_type (pstate, $1.type); |
edd079d9 UW |
821 | write_exp_elt_floatcst (pstate, $1.val); |
822 | write_exp_elt_opcode (pstate, OP_FLOAT); } | |
27bc4d80 TJB |
823 | ; |
824 | ||
fa649bb7 TT |
825 | exp : COMPLEX_FLOAT |
826 | { | |
827 | struct type *underlying | |
828 | = TYPE_TARGET_TYPE ($1.type); | |
829 | ||
830 | write_exp_elt_opcode (pstate, OP_FLOAT); | |
831 | write_exp_elt_type (pstate, underlying); | |
832 | gdb_byte val[16]; | |
833 | target_float_from_host_double (val, underlying, 0); | |
834 | write_exp_elt_floatcst (pstate, val); | |
835 | write_exp_elt_opcode (pstate, OP_FLOAT); | |
836 | write_exp_elt_opcode (pstate, OP_FLOAT); | |
837 | write_exp_elt_type (pstate, underlying); | |
838 | write_exp_elt_floatcst (pstate, $1.val); | |
839 | write_exp_elt_opcode (pstate, OP_FLOAT); | |
840 | write_exp_elt_opcode (pstate, OP_COMPLEX); | |
841 | write_exp_elt_type (pstate, $1.type); | |
842 | write_exp_elt_opcode (pstate, OP_COMPLEX); | |
843 | } | |
844 | ; | |
845 | ||
c906108c SS |
846 | exp : variable |
847 | ; | |
848 | ||
cfeadda5 | 849 | exp : DOLLAR_VARIABLE |
48e32051 | 850 | { |
410a0ff2 | 851 | write_dollar_variable (pstate, $1); |
48e32051 | 852 | } |
c906108c SS |
853 | ; |
854 | ||
f2e8016f TT |
855 | exp : SELECTOR '(' name ')' |
856 | { | |
410a0ff2 SDJ |
857 | write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR); |
858 | write_exp_string (pstate, $3); | |
859 | write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR); } | |
f2e8016f TT |
860 | ; |
861 | ||
c906108c | 862 | exp : SIZEOF '(' type ')' %prec UNARY |
245a5f0b KS |
863 | { struct type *type = $3; |
864 | write_exp_elt_opcode (pstate, OP_LONG); | |
410a0ff2 | 865 | write_exp_elt_type (pstate, lookup_signed_typename |
73923d7e | 866 | (pstate->language (), |
f4b8a18d | 867 | "int")); |
f168693b | 868 | type = check_typedef (type); |
245a5f0b KS |
869 | |
870 | /* $5.3.3/2 of the C++ Standard (n3290 draft) | |
871 | says of sizeof: "When applied to a reference | |
872 | or a reference type, the result is the size of | |
873 | the referenced type." */ | |
53cc15f5 | 874 | if (TYPE_IS_REFERENCE (type)) |
245a5f0b | 875 | type = check_typedef (TYPE_TARGET_TYPE (type)); |
410a0ff2 | 876 | write_exp_elt_longcst (pstate, |
245a5f0b | 877 | (LONGEST) TYPE_LENGTH (type)); |
410a0ff2 | 878 | write_exp_elt_opcode (pstate, OP_LONG); } |
c906108c SS |
879 | ; |
880 | ||
9eaf6705 | 881 | exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY |
410a0ff2 SDJ |
882 | { write_exp_elt_opcode (pstate, |
883 | UNOP_REINTERPRET_CAST); } | |
4e8f195d TT |
884 | ; |
885 | ||
9eaf6705 | 886 | exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY |
410a0ff2 | 887 | { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); } |
4e8f195d TT |
888 | ; |
889 | ||
9eaf6705 | 890 | exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY |
410a0ff2 | 891 | { write_exp_elt_opcode (pstate, UNOP_DYNAMIC_CAST); } |
4e8f195d TT |
892 | ; |
893 | ||
9eaf6705 | 894 | exp : CONST_CAST '<' type_exp '>' '(' exp ')' %prec UNARY |
4e8f195d TT |
895 | { /* We could do more error checking here, but |
896 | it doesn't seem worthwhile. */ | |
410a0ff2 | 897 | write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); } |
4e8f195d TT |
898 | ; |
899 | ||
c209f847 TT |
900 | string_exp: |
901 | STRING | |
902 | { | |
903 | /* We copy the string here, and not in the | |
904 | lexer, to guarantee that we do not leak a | |
905 | string. Note that we follow the | |
906 | NUL-termination convention of the | |
907 | lexer. */ | |
6c7a06a3 TT |
908 | struct typed_stoken *vec = XNEW (struct typed_stoken); |
909 | $$.len = 1; | |
910 | $$.tokens = vec; | |
911 | ||
912 | vec->type = $1.type; | |
913 | vec->length = $1.length; | |
224c3ddb | 914 | vec->ptr = (char *) malloc ($1.length + 1); |
6c7a06a3 | 915 | memcpy (vec->ptr, $1.ptr, $1.length + 1); |
c209f847 TT |
916 | } |
917 | ||
918 | | string_exp STRING | |
919 | { | |
920 | /* Note that we NUL-terminate here, but just | |
921 | for convenience. */ | |
6c7a06a3 TT |
922 | char *p; |
923 | ++$$.len; | |
224c3ddb SM |
924 | $$.tokens = XRESIZEVEC (struct typed_stoken, |
925 | $$.tokens, $$.len); | |
6c7a06a3 | 926 | |
224c3ddb | 927 | p = (char *) malloc ($2.length + 1); |
6c7a06a3 TT |
928 | memcpy (p, $2.ptr, $2.length + 1); |
929 | ||
930 | $$.tokens[$$.len - 1].type = $2.type; | |
931 | $$.tokens[$$.len - 1].length = $2.length; | |
932 | $$.tokens[$$.len - 1].ptr = p; | |
c209f847 TT |
933 | } |
934 | ; | |
935 | ||
936 | exp : string_exp | |
6c7a06a3 TT |
937 | { |
938 | int i; | |
0c801b96 | 939 | c_string_type type = C_STRING; |
6c7a06a3 TT |
940 | |
941 | for (i = 0; i < $1.len; ++i) | |
c906108c | 942 | { |
6c7a06a3 TT |
943 | switch ($1.tokens[i].type) |
944 | { | |
945 | case C_STRING: | |
946 | break; | |
947 | case C_WIDE_STRING: | |
948 | case C_STRING_16: | |
949 | case C_STRING_32: | |
950 | if (type != C_STRING | |
951 | && type != $1.tokens[i].type) | |
001083c6 | 952 | error (_("Undefined string concatenation.")); |
0c801b96 | 953 | type = (enum c_string_type_values) $1.tokens[i].type; |
6c7a06a3 TT |
954 | break; |
955 | default: | |
956 | /* internal error */ | |
957 | internal_error (__FILE__, __LINE__, | |
958 | "unrecognized type in string concatenation"); | |
959 | } | |
c906108c | 960 | } |
6c7a06a3 | 961 | |
410a0ff2 | 962 | write_exp_string_vector (pstate, type, &$1); |
6c7a06a3 TT |
963 | for (i = 0; i < $1.len; ++i) |
964 | free ($1.tokens[i].ptr); | |
965 | free ($1.tokens); | |
c209f847 | 966 | } |
c906108c SS |
967 | ; |
968 | ||
f2e8016f TT |
969 | exp : NSSTRING /* ObjC NextStep NSString constant |
970 | * of the form '@' '"' string '"'. | |
971 | */ | |
410a0ff2 SDJ |
972 | { write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING); |
973 | write_exp_string (pstate, $1); | |
974 | write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING); } | |
f2e8016f TT |
975 | ; |
976 | ||
c906108c | 977 | /* C++. */ |
4d29c0a8 | 978 | exp : TRUEKEYWORD |
dda83cd7 SM |
979 | { write_exp_elt_opcode (pstate, OP_LONG); |
980 | write_exp_elt_type (pstate, | |
410a0ff2 | 981 | parse_type (pstate)->builtin_bool); |
dda83cd7 SM |
982 | write_exp_elt_longcst (pstate, (LONGEST) 1); |
983 | write_exp_elt_opcode (pstate, OP_LONG); } | |
c906108c SS |
984 | ; |
985 | ||
4d29c0a8 | 986 | exp : FALSEKEYWORD |
dda83cd7 SM |
987 | { write_exp_elt_opcode (pstate, OP_LONG); |
988 | write_exp_elt_type (pstate, | |
410a0ff2 | 989 | parse_type (pstate)->builtin_bool); |
dda83cd7 SM |
990 | write_exp_elt_longcst (pstate, (LONGEST) 0); |
991 | write_exp_elt_opcode (pstate, OP_LONG); } | |
c906108c SS |
992 | ; |
993 | ||
994 | /* end of C++. */ | |
995 | ||
996 | block : BLOCKNAME | |
997 | { | |
d12307c1 PMR |
998 | if ($1.sym.symbol) |
999 | $$ = SYMBOL_BLOCK_VALUE ($1.sym.symbol); | |
c906108c | 1000 | else |
001083c6 | 1001 | error (_("No file or function \"%s\"."), |
61f4b350 | 1002 | copy_name ($1.stoken).c_str ()); |
c906108c SS |
1003 | } |
1004 | | FILENAME | |
1005 | { | |
1006 | $$ = $1; | |
1007 | } | |
1008 | ; | |
1009 | ||
1010 | block : block COLONCOLON name | |
61f4b350 TT |
1011 | { |
1012 | std::string copy = copy_name ($3); | |
1013 | struct symbol *tem | |
1014 | = lookup_symbol (copy.c_str (), $1, | |
d12307c1 PMR |
1015 | VAR_DOMAIN, NULL).symbol; |
1016 | ||
c906108c | 1017 | if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK) |
001083c6 | 1018 | error (_("No function \"%s\" in specified context."), |
61f4b350 | 1019 | copy.c_str ()); |
c906108c SS |
1020 | $$ = SYMBOL_BLOCK_VALUE (tem); } |
1021 | ; | |
1022 | ||
941b2081 | 1023 | variable: name_not_typename ENTRY |
d12307c1 | 1024 | { struct symbol *sym = $1.sym.symbol; |
36b11add JK |
1025 | |
1026 | if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym) | |
1027 | || !symbol_read_needs_frame (sym)) | |
1028 | error (_("@entry can be used only for function " | |
1029 | "parameters, not for \"%s\""), | |
61f4b350 | 1030 | copy_name ($1.stoken).c_str ()); |
36b11add | 1031 | |
410a0ff2 SDJ |
1032 | write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE); |
1033 | write_exp_elt_sym (pstate, sym); | |
1034 | write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE); | |
36b11add JK |
1035 | } |
1036 | ; | |
1037 | ||
c906108c | 1038 | variable: block COLONCOLON name |
61f4b350 TT |
1039 | { |
1040 | std::string copy = copy_name ($3); | |
1041 | struct block_symbol sym | |
1042 | = lookup_symbol (copy.c_str (), $1, | |
d12307c1 PMR |
1043 | VAR_DOMAIN, NULL); |
1044 | ||
1045 | if (sym.symbol == 0) | |
001083c6 | 1046 | error (_("No symbol \"%s\" in specified context."), |
61f4b350 | 1047 | copy.c_str ()); |
d12307c1 | 1048 | if (symbol_read_needs_frame (sym.symbol)) |
699bd4cf | 1049 | pstate->block_tracker->update (sym); |
c906108c | 1050 | |
410a0ff2 | 1051 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); |
d12307c1 PMR |
1052 | write_exp_elt_block (pstate, sym.block); |
1053 | write_exp_elt_sym (pstate, sym.symbol); | |
410a0ff2 | 1054 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); } |
c906108c SS |
1055 | ; |
1056 | ||
48e32051 | 1057 | qualified_name: TYPENAME COLONCOLON name |
c906108c | 1058 | { |
48e32051 | 1059 | struct type *type = $1.type; |
f168693b | 1060 | type = check_typedef (type); |
3d567982 | 1061 | if (!type_aggregate_p (type)) |
001083c6 | 1062 | error (_("`%s' is not defined as an aggregate type."), |
7fc75ca7 | 1063 | TYPE_SAFE_NAME (type)); |
c906108c | 1064 | |
410a0ff2 SDJ |
1065 | write_exp_elt_opcode (pstate, OP_SCOPE); |
1066 | write_exp_elt_type (pstate, type); | |
1067 | write_exp_string (pstate, $3); | |
1068 | write_exp_elt_opcode (pstate, OP_SCOPE); | |
c906108c | 1069 | } |
48e32051 | 1070 | | TYPENAME COLONCOLON '~' name |
c906108c | 1071 | { |
48e32051 | 1072 | struct type *type = $1.type; |
c906108c | 1073 | struct stoken tmp_token; |
d7561cbb KS |
1074 | char *buf; |
1075 | ||
f168693b | 1076 | type = check_typedef (type); |
3d567982 | 1077 | if (!type_aggregate_p (type)) |
001083c6 | 1078 | error (_("`%s' is not defined as an aggregate type."), |
7fc75ca7 | 1079 | TYPE_SAFE_NAME (type)); |
224c3ddb | 1080 | buf = (char *) alloca ($4.length + 2); |
d7561cbb | 1081 | tmp_token.ptr = buf; |
c906108c | 1082 | tmp_token.length = $4.length + 1; |
d7561cbb KS |
1083 | buf[0] = '~'; |
1084 | memcpy (buf+1, $4.ptr, $4.length); | |
1085 | buf[tmp_token.length] = 0; | |
c906108c SS |
1086 | |
1087 | /* Check for valid destructor name. */ | |
d8228535 | 1088 | destructor_name_p (tmp_token.ptr, $1.type); |
410a0ff2 SDJ |
1089 | write_exp_elt_opcode (pstate, OP_SCOPE); |
1090 | write_exp_elt_type (pstate, type); | |
1091 | write_exp_string (pstate, tmp_token); | |
1092 | write_exp_elt_opcode (pstate, OP_SCOPE); | |
c906108c | 1093 | } |
48e32051 TT |
1094 | | TYPENAME COLONCOLON name COLONCOLON name |
1095 | { | |
61f4b350 | 1096 | std::string copy = copy_name ($3); |
48e32051 TT |
1097 | error (_("No type \"%s\" within class " |
1098 | "or namespace \"%s\"."), | |
61f4b350 | 1099 | copy.c_str (), TYPE_SAFE_NAME ($1.type)); |
48e32051 | 1100 | } |
c906108c SS |
1101 | ; |
1102 | ||
1103 | variable: qualified_name | |
48e32051 | 1104 | | COLONCOLON name_not_typename |
c906108c | 1105 | { |
61f4b350 | 1106 | std::string name = copy_name ($2.stoken); |
1b30f421 | 1107 | struct block_symbol sym |
61f4b350 TT |
1108 | = lookup_symbol (name.c_str (), |
1109 | (const struct block *) NULL, | |
1b30f421 TT |
1110 | VAR_DOMAIN, NULL); |
1111 | write_exp_symbol_reference (pstate, name.c_str (), | |
1112 | sym); | |
c906108c SS |
1113 | } |
1114 | ; | |
1115 | ||
1116 | variable: name_not_typename | |
d12307c1 | 1117 | { struct block_symbol sym = $1.sym; |
c906108c | 1118 | |
d12307c1 | 1119 | if (sym.symbol) |
c906108c | 1120 | { |
d12307c1 | 1121 | if (symbol_read_needs_frame (sym.symbol)) |
699bd4cf | 1122 | pstate->block_tracker->update (sym); |
c906108c | 1123 | |
ca31ab1d PA |
1124 | /* If we found a function, see if it's |
1125 | an ifunc resolver that has the same | |
1126 | address as the ifunc symbol itself. | |
1127 | If so, prefer the ifunc symbol. */ | |
1128 | ||
1129 | bound_minimal_symbol resolver | |
1130 | = find_gnu_ifunc (sym.symbol); | |
1131 | if (resolver.minsym != NULL) | |
1132 | write_exp_msymbol (pstate, resolver); | |
1133 | else | |
1134 | { | |
1135 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); | |
1136 | write_exp_elt_block (pstate, sym.block); | |
1137 | write_exp_elt_sym (pstate, sym.symbol); | |
1138 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); | |
1139 | } | |
c906108c SS |
1140 | } |
1141 | else if ($1.is_a_field_of_this) | |
1142 | { | |
1143 | /* C++: it hangs off of `this'. Must | |
dda83cd7 | 1144 | not inadvertently convert from a method call |
c906108c | 1145 | to data ref. */ |
699bd4cf | 1146 | pstate->block_tracker->update (sym); |
410a0ff2 SDJ |
1147 | write_exp_elt_opcode (pstate, OP_THIS); |
1148 | write_exp_elt_opcode (pstate, OP_THIS); | |
1149 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); | |
1150 | write_exp_string (pstate, $1.stoken); | |
1151 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); | |
c906108c SS |
1152 | } |
1153 | else | |
1154 | { | |
61f4b350 | 1155 | std::string arg = copy_name ($1.stoken); |
c906108c | 1156 | |
bf223d3e | 1157 | bound_minimal_symbol msymbol |
61f4b350 | 1158 | = lookup_bound_minimal_symbol (arg.c_str ()); |
bf223d3e PA |
1159 | if (msymbol.minsym == NULL) |
1160 | { | |
1161 | if (!have_full_symbols () && !have_partial_symbols ()) | |
1162 | error (_("No symbol table is loaded. Use the \"file\" command.")); | |
1163 | else | |
1164 | error (_("No symbol \"%s\" in current context."), | |
61f4b350 | 1165 | arg.c_str ()); |
bf223d3e PA |
1166 | } |
1167 | ||
1168 | /* This minsym might be an alias for | |
1169 | another function. See if we can find | |
1170 | the debug symbol for the target, and | |
1171 | if so, use it instead, since it has | |
1172 | return type / prototype info. This | |
1173 | is important for example for "p | |
1174 | *__errno_location()". */ | |
1175 | symbol *alias_target | |
f50776aa PA |
1176 | = ((msymbol.minsym->type != mst_text_gnu_ifunc |
1177 | && msymbol.minsym->type != mst_data_gnu_ifunc) | |
a376e11d PA |
1178 | ? find_function_alias_target (msymbol) |
1179 | : NULL); | |
bf223d3e PA |
1180 | if (alias_target != NULL) |
1181 | { | |
1182 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); | |
1183 | write_exp_elt_block | |
1184 | (pstate, SYMBOL_BLOCK_VALUE (alias_target)); | |
1185 | write_exp_elt_sym (pstate, alias_target); | |
1186 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); | |
1187 | } | |
c906108c | 1188 | else |
bf223d3e | 1189 | write_exp_msymbol (pstate, msymbol); |
c906108c SS |
1190 | } |
1191 | } | |
1192 | ; | |
1193 | ||
47663de5 MS |
1194 | const_or_volatile: const_or_volatile_noopt |
1195 | | | |
c906108c | 1196 | ; |
47663de5 | 1197 | |
3293bbaf TT |
1198 | single_qualifier: |
1199 | CONST_KEYWORD | |
1200 | { cpstate->type_stack.insert (tp_const); } | |
1201 | | VOLATILE_KEYWORD | |
1202 | { cpstate->type_stack.insert (tp_volatile); } | |
1203 | | ATOMIC | |
1204 | { cpstate->type_stack.insert (tp_atomic); } | |
1205 | | RESTRICT | |
1206 | { cpstate->type_stack.insert (tp_restrict); } | |
1207 | | '@' NAME | |
1208 | { | |
1209 | cpstate->type_stack.insert (pstate, | |
1210 | copy_name ($2.stoken).c_str ()); | |
1211 | } | |
56e2d25a | 1212 | ; |
47663de5 | 1213 | |
3293bbaf TT |
1214 | qualifier_seq_noopt: |
1215 | single_qualifier | |
1216 | | qualifier_seq single_qualifier | |
56e2d25a | 1217 | ; |
47663de5 | 1218 | |
3293bbaf TT |
1219 | qualifier_seq: |
1220 | qualifier_seq_noopt | |
47663de5 | 1221 | | |
56e2d25a | 1222 | ; |
47663de5 | 1223 | |
95c391b6 TT |
1224 | ptr_operator: |
1225 | ptr_operator '*' | |
dac43e32 | 1226 | { cpstate->type_stack.insert (tp_pointer); } |
3293bbaf | 1227 | qualifier_seq |
4d29c0a8 | 1228 | | '*' |
dac43e32 | 1229 | { cpstate->type_stack.insert (tp_pointer); } |
3293bbaf | 1230 | qualifier_seq |
c906108c | 1231 | | '&' |
dac43e32 | 1232 | { cpstate->type_stack.insert (tp_reference); } |
95c391b6 | 1233 | | '&' ptr_operator |
dac43e32 | 1234 | { cpstate->type_stack.insert (tp_reference); } |
53cc15f5 | 1235 | | ANDAND |
dac43e32 | 1236 | { cpstate->type_stack.insert (tp_rvalue_reference); } |
53cc15f5 | 1237 | | ANDAND ptr_operator |
dac43e32 | 1238 | { cpstate->type_stack.insert (tp_rvalue_reference); } |
95c391b6 TT |
1239 | ; |
1240 | ||
fcde5961 TT |
1241 | ptr_operator_ts: ptr_operator |
1242 | { | |
dac43e32 | 1243 | $$ = cpstate->type_stack.create (); |
02e12e38 | 1244 | cpstate->type_stacks.emplace_back ($$); |
fcde5961 TT |
1245 | } |
1246 | ; | |
1247 | ||
1248 | abs_decl: ptr_operator_ts direct_abs_decl | |
dac43e32 | 1249 | { $$ = $2->append ($1); } |
4d29c0a8 | 1250 | | ptr_operator_ts |
c906108c SS |
1251 | | direct_abs_decl |
1252 | ; | |
1253 | ||
1254 | direct_abs_decl: '(' abs_decl ')' | |
fcde5961 | 1255 | { $$ = $2; } |
c906108c SS |
1256 | | direct_abs_decl array_mod |
1257 | { | |
dac43e32 TT |
1258 | cpstate->type_stack.push ($1); |
1259 | cpstate->type_stack.push ($2); | |
1260 | cpstate->type_stack.push (tp_array); | |
1261 | $$ = cpstate->type_stack.create (); | |
ab759ca8 | 1262 | cpstate->type_stacks.emplace_back ($$); |
c906108c SS |
1263 | } |
1264 | | array_mod | |
1265 | { | |
dac43e32 TT |
1266 | cpstate->type_stack.push ($1); |
1267 | cpstate->type_stack.push (tp_array); | |
1268 | $$ = cpstate->type_stack.create (); | |
ab759ca8 | 1269 | cpstate->type_stacks.emplace_back ($$); |
c906108c SS |
1270 | } |
1271 | ||
1272 | | direct_abs_decl func_mod | |
fcde5961 | 1273 | { |
dac43e32 TT |
1274 | cpstate->type_stack.push ($1); |
1275 | cpstate->type_stack.push ($2); | |
1276 | $$ = cpstate->type_stack.create (); | |
ab759ca8 | 1277 | cpstate->type_stacks.emplace_back ($$); |
fcde5961 | 1278 | } |
c906108c | 1279 | | func_mod |
fcde5961 | 1280 | { |
dac43e32 TT |
1281 | cpstate->type_stack.push ($1); |
1282 | $$ = cpstate->type_stack.create (); | |
ab759ca8 | 1283 | cpstate->type_stacks.emplace_back ($$); |
fcde5961 | 1284 | } |
c906108c SS |
1285 | ; |
1286 | ||
1287 | array_mod: '[' ']' | |
1288 | { $$ = -1; } | |
f2e8016f TT |
1289 | | OBJC_LBRAC ']' |
1290 | { $$ = -1; } | |
c906108c SS |
1291 | | '[' INT ']' |
1292 | { $$ = $2.val; } | |
f2e8016f TT |
1293 | | OBJC_LBRAC INT ']' |
1294 | { $$ = $2.val; } | |
c906108c SS |
1295 | ; |
1296 | ||
1297 | func_mod: '(' ')' | |
02e12e38 TT |
1298 | { |
1299 | $$ = new std::vector<struct type *>; | |
1300 | cpstate->type_lists.emplace_back ($$); | |
1301 | } | |
a6fb9c08 | 1302 | | '(' parameter_typelist ')' |
71918a86 | 1303 | { $$ = $2; } |
c906108c SS |
1304 | ; |
1305 | ||
a22229c4 | 1306 | /* We used to try to recognize pointer to member types here, but |
c906108c SS |
1307 | that didn't work (shift/reduce conflicts meant that these rules never |
1308 | got executed). The problem is that | |
1309 | int (foo::bar::baz::bizzle) | |
1310 | is a function type but | |
1311 | int (foo::bar::baz::bizzle::*) | |
1312 | is a pointer to member type. Stroustrup loses again! */ | |
1313 | ||
1314 | type : ptype | |
c906108c SS |
1315 | ; |
1316 | ||
3638a098 TT |
1317 | /* A helper production that recognizes scalar types that can validly |
1318 | be used with _Complex. */ | |
b6c95c0c | 1319 | |
3638a098 TT |
1320 | scalar_type: |
1321 | INT_KEYWORD | |
73923d7e | 1322 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1323 | "int"); } |
c906108c | 1324 | | LONG |
73923d7e | 1325 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1326 | "long"); } |
c906108c | 1327 | | SHORT |
73923d7e | 1328 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1329 | "short"); } |
c906108c | 1330 | | LONG INT_KEYWORD |
73923d7e | 1331 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1332 | "long"); } |
b2c4da81 | 1333 | | LONG SIGNED_KEYWORD INT_KEYWORD |
73923d7e | 1334 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1335 | "long"); } |
b2c4da81 | 1336 | | LONG SIGNED_KEYWORD |
73923d7e | 1337 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1338 | "long"); } |
b2c4da81 | 1339 | | SIGNED_KEYWORD LONG INT_KEYWORD |
73923d7e | 1340 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1341 | "long"); } |
c906108c | 1342 | | UNSIGNED LONG INT_KEYWORD |
73923d7e | 1343 | { $$ = lookup_unsigned_typename (pstate->language (), |
f4b8a18d | 1344 | "long"); } |
b2c4da81 | 1345 | | LONG UNSIGNED INT_KEYWORD |
73923d7e | 1346 | { $$ = lookup_unsigned_typename (pstate->language (), |
f4b8a18d | 1347 | "long"); } |
b2c4da81 | 1348 | | LONG UNSIGNED |
73923d7e | 1349 | { $$ = lookup_unsigned_typename (pstate->language (), |
f4b8a18d | 1350 | "long"); } |
c906108c | 1351 | | LONG LONG |
73923d7e | 1352 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1353 | "long long"); } |
c906108c | 1354 | | LONG LONG INT_KEYWORD |
73923d7e | 1355 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1356 | "long long"); } |
b2c4da81 | 1357 | | LONG LONG SIGNED_KEYWORD INT_KEYWORD |
73923d7e | 1358 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1359 | "long long"); } |
b2c4da81 | 1360 | | LONG LONG SIGNED_KEYWORD |
73923d7e | 1361 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1362 | "long long"); } |
b2c4da81 | 1363 | | SIGNED_KEYWORD LONG LONG |
73923d7e | 1364 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1365 | "long long"); } |
55baeb84 | 1366 | | SIGNED_KEYWORD LONG LONG INT_KEYWORD |
73923d7e | 1367 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1368 | "long long"); } |
c906108c | 1369 | | UNSIGNED LONG LONG |
73923d7e | 1370 | { $$ = lookup_unsigned_typename (pstate->language (), |
f4b8a18d | 1371 | "long long"); } |
c906108c | 1372 | | UNSIGNED LONG LONG INT_KEYWORD |
73923d7e | 1373 | { $$ = lookup_unsigned_typename (pstate->language (), |
f4b8a18d | 1374 | "long long"); } |
b2c4da81 | 1375 | | LONG LONG UNSIGNED |
73923d7e | 1376 | { $$ = lookup_unsigned_typename (pstate->language (), |
f4b8a18d | 1377 | "long long"); } |
b2c4da81 | 1378 | | LONG LONG UNSIGNED INT_KEYWORD |
73923d7e | 1379 | { $$ = lookup_unsigned_typename (pstate->language (), |
f4b8a18d | 1380 | "long long"); } |
c906108c | 1381 | | SHORT INT_KEYWORD |
73923d7e | 1382 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1383 | "short"); } |
b2c4da81 | 1384 | | SHORT SIGNED_KEYWORD INT_KEYWORD |
73923d7e | 1385 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1386 | "short"); } |
b2c4da81 | 1387 | | SHORT SIGNED_KEYWORD |
73923d7e | 1388 | { $$ = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1389 | "short"); } |
c906108c | 1390 | | UNSIGNED SHORT INT_KEYWORD |
73923d7e | 1391 | { $$ = lookup_unsigned_typename (pstate->language (), |
f4b8a18d | 1392 | "short"); } |
4d29c0a8 | 1393 | | SHORT UNSIGNED |
73923d7e | 1394 | { $$ = lookup_unsigned_typename (pstate->language (), |
f4b8a18d | 1395 | "short"); } |
b2c4da81 | 1396 | | SHORT UNSIGNED INT_KEYWORD |
73923d7e | 1397 | { $$ = lookup_unsigned_typename (pstate->language (), |
f4b8a18d | 1398 | "short"); } |
c906108c | 1399 | | DOUBLE_KEYWORD |
73923d7e | 1400 | { $$ = lookup_typename (pstate->language (), |
410a0ff2 | 1401 | "double", |
582942f4 | 1402 | NULL, |
f4b8a18d | 1403 | 0); } |
3638a098 TT |
1404 | | FLOAT_KEYWORD |
1405 | { $$ = lookup_typename (pstate->language (), | |
1406 | "float", | |
1407 | NULL, | |
1408 | 0); } | |
c906108c | 1409 | | LONG DOUBLE_KEYWORD |
73923d7e | 1410 | { $$ = lookup_typename (pstate->language (), |
f4b8a18d | 1411 | "long double", |
582942f4 | 1412 | NULL, |
410a0ff2 | 1413 | 0); } |
3638a098 TT |
1414 | | UNSIGNED type_name |
1415 | { $$ = lookup_unsigned_typename (pstate->language (), | |
7d93a1e0 | 1416 | $2.type->name ()); } |
3638a098 TT |
1417 | | UNSIGNED |
1418 | { $$ = lookup_unsigned_typename (pstate->language (), | |
1419 | "int"); } | |
1420 | | SIGNED_KEYWORD type_name | |
1421 | { $$ = lookup_signed_typename (pstate->language (), | |
7d93a1e0 | 1422 | $2.type->name ()); } |
3638a098 TT |
1423 | | SIGNED_KEYWORD |
1424 | { $$ = lookup_signed_typename (pstate->language (), | |
1425 | "int"); } | |
1426 | ; | |
1427 | ||
1428 | /* Implements (approximately): (type-qualifier)* type-specifier. | |
1429 | ||
1430 | When type-specifier is only ever a single word, like 'float' then these | |
1431 | arrive as pre-built TYPENAME tokens thanks to the classify_name | |
1432 | function. However, when a type-specifier can contain multiple words, | |
1433 | for example 'double' can appear as just 'double' or 'long double', and | |
1434 | similarly 'long' can appear as just 'long' or in 'long double', then | |
1435 | these type-specifiers are parsed into their own tokens in the function | |
1436 | lex_one_token and the ident_tokens array. These separate tokens are all | |
1437 | recognised here. */ | |
1438 | typebase | |
1439 | : TYPENAME | |
1440 | { $$ = $1.type; } | |
1441 | | scalar_type | |
1442 | { $$ = $1; } | |
1443 | | COMPLEX scalar_type | |
1444 | { | |
1445 | $$ = init_complex_type (nullptr, $2); | |
1446 | } | |
c906108c | 1447 | | STRUCT name |
1e58a4a4 | 1448 | { $$ |
61f4b350 | 1449 | = lookup_struct (copy_name ($2).c_str (), |
1e58a4a4 TT |
1450 | pstate->expression_context_block); |
1451 | } | |
2f68a895 TT |
1452 | | STRUCT COMPLETE |
1453 | { | |
2a612529 TT |
1454 | pstate->mark_completion_tag (TYPE_CODE_STRUCT, |
1455 | "", 0); | |
2f68a895 TT |
1456 | $$ = NULL; |
1457 | } | |
1458 | | STRUCT name COMPLETE | |
1459 | { | |
2a612529 TT |
1460 | pstate->mark_completion_tag (TYPE_CODE_STRUCT, |
1461 | $2.ptr, $2.length); | |
2f68a895 TT |
1462 | $$ = NULL; |
1463 | } | |
c906108c | 1464 | | CLASS name |
1e58a4a4 | 1465 | { $$ = lookup_struct |
61f4b350 TT |
1466 | (copy_name ($2).c_str (), |
1467 | pstate->expression_context_block); | |
1e58a4a4 | 1468 | } |
2f68a895 TT |
1469 | | CLASS COMPLETE |
1470 | { | |
2a612529 TT |
1471 | pstate->mark_completion_tag (TYPE_CODE_STRUCT, |
1472 | "", 0); | |
2f68a895 TT |
1473 | $$ = NULL; |
1474 | } | |
1475 | | CLASS name COMPLETE | |
1476 | { | |
2a612529 TT |
1477 | pstate->mark_completion_tag (TYPE_CODE_STRUCT, |
1478 | $2.ptr, $2.length); | |
2f68a895 TT |
1479 | $$ = NULL; |
1480 | } | |
c906108c | 1481 | | UNION name |
1e58a4a4 | 1482 | { $$ |
61f4b350 | 1483 | = lookup_union (copy_name ($2).c_str (), |
1e58a4a4 TT |
1484 | pstate->expression_context_block); |
1485 | } | |
2f68a895 TT |
1486 | | UNION COMPLETE |
1487 | { | |
2a612529 TT |
1488 | pstate->mark_completion_tag (TYPE_CODE_UNION, |
1489 | "", 0); | |
2f68a895 TT |
1490 | $$ = NULL; |
1491 | } | |
1492 | | UNION name COMPLETE | |
1493 | { | |
2a612529 TT |
1494 | pstate->mark_completion_tag (TYPE_CODE_UNION, |
1495 | $2.ptr, $2.length); | |
2f68a895 TT |
1496 | $$ = NULL; |
1497 | } | |
c906108c | 1498 | | ENUM name |
61f4b350 | 1499 | { $$ = lookup_enum (copy_name ($2).c_str (), |
1e58a4a4 TT |
1500 | pstate->expression_context_block); |
1501 | } | |
2f68a895 TT |
1502 | | ENUM COMPLETE |
1503 | { | |
2a612529 | 1504 | pstate->mark_completion_tag (TYPE_CODE_ENUM, "", 0); |
2f68a895 TT |
1505 | $$ = NULL; |
1506 | } | |
1507 | | ENUM name COMPLETE | |
1508 | { | |
2a612529 TT |
1509 | pstate->mark_completion_tag (TYPE_CODE_ENUM, $2.ptr, |
1510 | $2.length); | |
2f68a895 TT |
1511 | $$ = NULL; |
1512 | } | |
dda83cd7 SM |
1513 | /* It appears that this rule for templates is never |
1514 | reduced; template recognition happens by lookahead | |
1515 | in the token processing code in yylex. */ | |
c906108c | 1516 | | TEMPLATE name '<' type '>' |
1e58a4a4 | 1517 | { $$ = lookup_template_type |
61f4b350 | 1518 | (copy_name($2).c_str (), $4, |
1e58a4a4 | 1519 | pstate->expression_context_block); |
c906108c | 1520 | } |
3293bbaf | 1521 | | qualifier_seq_noopt typebase |
dac43e32 | 1522 | { $$ = cpstate->type_stack.follow_types ($2); } |
3293bbaf | 1523 | | typebase qualifier_seq_noopt |
dac43e32 | 1524 | { $$ = cpstate->type_stack.follow_types ($1); } |
c906108c SS |
1525 | ; |
1526 | ||
fe978cb0 | 1527 | type_name: TYPENAME |
c906108c SS |
1528 | | INT_KEYWORD |
1529 | { | |
1530 | $$.stoken.ptr = "int"; | |
1531 | $$.stoken.length = 3; | |
73923d7e | 1532 | $$.type = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1533 | "int"); |
c906108c SS |
1534 | } |
1535 | | LONG | |
1536 | { | |
1537 | $$.stoken.ptr = "long"; | |
1538 | $$.stoken.length = 4; | |
73923d7e | 1539 | $$.type = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1540 | "long"); |
c906108c SS |
1541 | } |
1542 | | SHORT | |
1543 | { | |
1544 | $$.stoken.ptr = "short"; | |
1545 | $$.stoken.length = 5; | |
73923d7e | 1546 | $$.type = lookup_signed_typename (pstate->language (), |
f4b8a18d | 1547 | "short"); |
c906108c SS |
1548 | } |
1549 | ; | |
1550 | ||
a6fb9c08 TT |
1551 | parameter_typelist: |
1552 | nonempty_typelist | |
e314d629 | 1553 | { check_parameter_typelist ($1); } |
a6fb9c08 TT |
1554 | | nonempty_typelist ',' DOTDOTDOT |
1555 | { | |
02e12e38 | 1556 | $1->push_back (NULL); |
e314d629 | 1557 | check_parameter_typelist ($1); |
a6fb9c08 TT |
1558 | $$ = $1; |
1559 | } | |
1560 | ; | |
1561 | ||
c906108c SS |
1562 | nonempty_typelist |
1563 | : type | |
71918a86 | 1564 | { |
02e12e38 TT |
1565 | std::vector<struct type *> *typelist |
1566 | = new std::vector<struct type *>; | |
1567 | cpstate->type_lists.emplace_back (typelist); | |
1568 | ||
1569 | typelist->push_back ($1); | |
71918a86 | 1570 | $$ = typelist; |
c906108c SS |
1571 | } |
1572 | | nonempty_typelist ',' type | |
71918a86 | 1573 | { |
02e12e38 | 1574 | $1->push_back ($3); |
71918a86 | 1575 | $$ = $1; |
c906108c SS |
1576 | } |
1577 | ; | |
1578 | ||
47663de5 | 1579 | ptype : typebase |
95c391b6 | 1580 | | ptype abs_decl |
fcde5961 | 1581 | { |
dac43e32 TT |
1582 | cpstate->type_stack.push ($2); |
1583 | $$ = cpstate->type_stack.follow_types ($1); | |
fcde5961 | 1584 | } |
47663de5 MS |
1585 | ; |
1586 | ||
95c391b6 | 1587 | conversion_type_id: typebase conversion_declarator |
dac43e32 | 1588 | { $$ = cpstate->type_stack.follow_types ($1); } |
95c391b6 TT |
1589 | ; |
1590 | ||
1591 | conversion_declarator: /* Nothing. */ | |
1592 | | ptr_operator conversion_declarator | |
1593 | ; | |
1594 | ||
47663de5 MS |
1595 | const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD |
1596 | | VOLATILE_KEYWORD CONST_KEYWORD | |
1597 | ; | |
1598 | ||
4d29c0a8 | 1599 | const_or_volatile_noopt: const_and_volatile |
dac43e32 TT |
1600 | { cpstate->type_stack.insert (tp_const); |
1601 | cpstate->type_stack.insert (tp_volatile); | |
47663de5 MS |
1602 | } |
1603 | | CONST_KEYWORD | |
dac43e32 | 1604 | { cpstate->type_stack.insert (tp_const); } |
47663de5 | 1605 | | VOLATILE_KEYWORD |
dac43e32 | 1606 | { cpstate->type_stack.insert (tp_volatile); } |
47663de5 MS |
1607 | ; |
1608 | ||
fe978cb0 | 1609 | oper: OPERATOR NEW |
66c53f2b KS |
1610 | { $$ = operator_stoken (" new"); } |
1611 | | OPERATOR DELETE | |
4cd18215 | 1612 | { $$ = operator_stoken (" delete"); } |
66c53f2b KS |
1613 | | OPERATOR NEW '[' ']' |
1614 | { $$ = operator_stoken (" new[]"); } | |
1615 | | OPERATOR DELETE '[' ']' | |
4cd18215 | 1616 | { $$ = operator_stoken (" delete[]"); } |
f2e8016f TT |
1617 | | OPERATOR NEW OBJC_LBRAC ']' |
1618 | { $$ = operator_stoken (" new[]"); } | |
1619 | | OPERATOR DELETE OBJC_LBRAC ']' | |
1620 | { $$ = operator_stoken (" delete[]"); } | |
66c53f2b KS |
1621 | | OPERATOR '+' |
1622 | { $$ = operator_stoken ("+"); } | |
1623 | | OPERATOR '-' | |
1624 | { $$ = operator_stoken ("-"); } | |
1625 | | OPERATOR '*' | |
1626 | { $$ = operator_stoken ("*"); } | |
1627 | | OPERATOR '/' | |
1628 | { $$ = operator_stoken ("/"); } | |
1629 | | OPERATOR '%' | |
1630 | { $$ = operator_stoken ("%"); } | |
1631 | | OPERATOR '^' | |
1632 | { $$ = operator_stoken ("^"); } | |
1633 | | OPERATOR '&' | |
1634 | { $$ = operator_stoken ("&"); } | |
1635 | | OPERATOR '|' | |
1636 | { $$ = operator_stoken ("|"); } | |
1637 | | OPERATOR '~' | |
1638 | { $$ = operator_stoken ("~"); } | |
1639 | | OPERATOR '!' | |
1640 | { $$ = operator_stoken ("!"); } | |
1641 | | OPERATOR '=' | |
1642 | { $$ = operator_stoken ("="); } | |
1643 | | OPERATOR '<' | |
1644 | { $$ = operator_stoken ("<"); } | |
1645 | | OPERATOR '>' | |
1646 | { $$ = operator_stoken (">"); } | |
1647 | | OPERATOR ASSIGN_MODIFY | |
c8ba13ad | 1648 | { const char *op = " unknown"; |
66c53f2b KS |
1649 | switch ($2) |
1650 | { | |
1651 | case BINOP_RSH: | |
1652 | op = ">>="; | |
1653 | break; | |
1654 | case BINOP_LSH: | |
1655 | op = "<<="; | |
1656 | break; | |
1657 | case BINOP_ADD: | |
1658 | op = "+="; | |
1659 | break; | |
1660 | case BINOP_SUB: | |
1661 | op = "-="; | |
1662 | break; | |
1663 | case BINOP_MUL: | |
1664 | op = "*="; | |
1665 | break; | |
1666 | case BINOP_DIV: | |
1667 | op = "/="; | |
1668 | break; | |
1669 | case BINOP_REM: | |
1670 | op = "%="; | |
1671 | break; | |
1672 | case BINOP_BITWISE_IOR: | |
1673 | op = "|="; | |
1674 | break; | |
1675 | case BINOP_BITWISE_AND: | |
1676 | op = "&="; | |
1677 | break; | |
1678 | case BINOP_BITWISE_XOR: | |
1679 | op = "^="; | |
1680 | break; | |
1681 | default: | |
1682 | break; | |
1683 | } | |
1684 | ||
1685 | $$ = operator_stoken (op); | |
1686 | } | |
1687 | | OPERATOR LSH | |
1688 | { $$ = operator_stoken ("<<"); } | |
1689 | | OPERATOR RSH | |
1690 | { $$ = operator_stoken (">>"); } | |
1691 | | OPERATOR EQUAL | |
1692 | { $$ = operator_stoken ("=="); } | |
1693 | | OPERATOR NOTEQUAL | |
1694 | { $$ = operator_stoken ("!="); } | |
1695 | | OPERATOR LEQ | |
1696 | { $$ = operator_stoken ("<="); } | |
1697 | | OPERATOR GEQ | |
1698 | { $$ = operator_stoken (">="); } | |
1699 | | OPERATOR ANDAND | |
1700 | { $$ = operator_stoken ("&&"); } | |
1701 | | OPERATOR OROR | |
1702 | { $$ = operator_stoken ("||"); } | |
1703 | | OPERATOR INCREMENT | |
1704 | { $$ = operator_stoken ("++"); } | |
1705 | | OPERATOR DECREMENT | |
1706 | { $$ = operator_stoken ("--"); } | |
1707 | | OPERATOR ',' | |
1708 | { $$ = operator_stoken (","); } | |
1709 | | OPERATOR ARROW_STAR | |
1710 | { $$ = operator_stoken ("->*"); } | |
1711 | | OPERATOR ARROW | |
1712 | { $$ = operator_stoken ("->"); } | |
1713 | | OPERATOR '(' ')' | |
1714 | { $$ = operator_stoken ("()"); } | |
1715 | | OPERATOR '[' ']' | |
1716 | { $$ = operator_stoken ("[]"); } | |
f2e8016f TT |
1717 | | OPERATOR OBJC_LBRAC ']' |
1718 | { $$ = operator_stoken ("[]"); } | |
95c391b6 | 1719 | | OPERATOR conversion_type_id |
d7e74731 | 1720 | { string_file buf; |
66c53f2b | 1721 | |
d7e74731 | 1722 | c_print_type ($2, NULL, &buf, -1, 0, |
79d43c61 | 1723 | &type_print_raw_options); |
596dc4ad | 1724 | std::string name = std::move (buf.string ()); |
c8ba13ad KS |
1725 | |
1726 | /* This also needs canonicalization. */ | |
596dc4ad TT |
1727 | gdb::unique_xmalloc_ptr<char> canon |
1728 | = cp_canonicalize_string (name.c_str ()); | |
1729 | if (canon != nullptr) | |
1730 | name = canon.get (); | |
1731 | $$ = operator_stoken ((" " + name).c_str ()); | |
66c53f2b KS |
1732 | } |
1733 | ; | |
1734 | ||
6f0ffe50 AB |
1735 | /* This rule exists in order to allow some tokens that would not normally |
1736 | match the 'name' rule to appear as fields within a struct. The example | |
1737 | that initially motivated this was the RISC-V target which models the | |
1738 | floating point registers as a union with fields called 'float' and | |
3638a098 | 1739 | 'double'. */ |
0f5d3f63 AB |
1740 | field_name |
1741 | : name | |
6f0ffe50 | 1742 | | DOUBLE_KEYWORD { $$ = typename_stoken ("double"); } |
3638a098 | 1743 | | FLOAT_KEYWORD { $$ = typename_stoken ("float"); } |
6f0ffe50 AB |
1744 | | INT_KEYWORD { $$ = typename_stoken ("int"); } |
1745 | | LONG { $$ = typename_stoken ("long"); } | |
1746 | | SHORT { $$ = typename_stoken ("short"); } | |
1747 | | SIGNED_KEYWORD { $$ = typename_stoken ("signed"); } | |
1748 | | UNSIGNED { $$ = typename_stoken ("unsigned"); } | |
0f5d3f63 | 1749 | ; |
66c53f2b | 1750 | |
c906108c SS |
1751 | name : NAME { $$ = $1.stoken; } |
1752 | | BLOCKNAME { $$ = $1.stoken; } | |
1753 | | TYPENAME { $$ = $1.stoken; } | |
1754 | | NAME_OR_INT { $$ = $1.stoken; } | |
7322dca9 | 1755 | | UNKNOWN_CPP_NAME { $$ = $1.stoken; } |
fe978cb0 | 1756 | | oper { $$ = $1; } |
c906108c SS |
1757 | ; |
1758 | ||
1759 | name_not_typename : NAME | |
1760 | | BLOCKNAME | |
1761 | /* These would be useful if name_not_typename was useful, but it is just | |
1762 | a fake for "variable", so these cause reduce/reduce conflicts because | |
1763 | the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable, | |
1764 | =exp) or just an exp. If name_not_typename was ever used in an lvalue | |
1765 | context where only a name could occur, this might be useful. | |
1766 | | NAME_OR_INT | |
1767 | */ | |
fe978cb0 | 1768 | | oper |
6e31430b | 1769 | { |
1993b719 TT |
1770 | struct field_of_this_result is_a_field_of_this; |
1771 | ||
6e31430b | 1772 | $$.stoken = $1; |
1e58a4a4 TT |
1773 | $$.sym |
1774 | = lookup_symbol ($1.ptr, | |
1775 | pstate->expression_context_block, | |
1776 | VAR_DOMAIN, | |
1777 | &is_a_field_of_this); | |
1993b719 TT |
1778 | $$.is_a_field_of_this |
1779 | = is_a_field_of_this.type != NULL; | |
6e31430b | 1780 | } |
7322dca9 | 1781 | | UNKNOWN_CPP_NAME |
c906108c SS |
1782 | ; |
1783 | ||
1784 | %% | |
1785 | ||
24955f63 TT |
1786 | /* Like write_exp_string, but prepends a '~'. */ |
1787 | ||
1788 | static void | |
410a0ff2 | 1789 | write_destructor_name (struct parser_state *par_state, struct stoken token) |
24955f63 | 1790 | { |
224c3ddb | 1791 | char *copy = (char *) alloca (token.length + 1); |
24955f63 TT |
1792 | |
1793 | copy[0] = '~'; | |
1794 | memcpy (©[1], token.ptr, token.length); | |
1795 | ||
1796 | token.ptr = copy; | |
1797 | ++token.length; | |
1798 | ||
410a0ff2 | 1799 | write_exp_string (par_state, token); |
24955f63 TT |
1800 | } |
1801 | ||
66c53f2b | 1802 | /* Returns a stoken of the operator name given by OP (which does not |
4d29c0a8 DE |
1803 | include the string "operator"). */ |
1804 | ||
66c53f2b KS |
1805 | static struct stoken |
1806 | operator_stoken (const char *op) | |
1807 | { | |
66c53f2b | 1808 | struct stoken st = { NULL, 0 }; |
d7561cbb KS |
1809 | char *buf; |
1810 | ||
8090b426 | 1811 | st.length = CP_OPERATOR_LEN + strlen (op); |
224c3ddb | 1812 | buf = (char *) malloc (st.length + 1); |
8090b426 | 1813 | strcpy (buf, CP_OPERATOR_STR); |
d7561cbb KS |
1814 | strcat (buf, op); |
1815 | st.ptr = buf; | |
66c53f2b KS |
1816 | |
1817 | /* The toplevel (c_parse) will free the memory allocated here. */ | |
c65bac38 | 1818 | cpstate->strings.emplace_back (buf); |
66c53f2b KS |
1819 | return st; |
1820 | }; | |
1821 | ||
6f0ffe50 AB |
1822 | /* Returns a stoken of the type named TYPE. */ |
1823 | ||
1824 | static struct stoken | |
1825 | typename_stoken (const char *type) | |
1826 | { | |
1827 | struct stoken st = { type, 0 }; | |
1828 | st.length = strlen (type); | |
1829 | return st; | |
1830 | }; | |
1831 | ||
3d567982 TT |
1832 | /* Return true if the type is aggregate-like. */ |
1833 | ||
1834 | static int | |
1835 | type_aggregate_p (struct type *type) | |
1836 | { | |
78134374 SM |
1837 | return (type->code () == TYPE_CODE_STRUCT |
1838 | || type->code () == TYPE_CODE_UNION | |
1839 | || type->code () == TYPE_CODE_NAMESPACE | |
1840 | || (type->code () == TYPE_CODE_ENUM | |
3d567982 TT |
1841 | && TYPE_DECLARED_CLASS (type))); |
1842 | } | |
1843 | ||
e314d629 TT |
1844 | /* Validate a parameter typelist. */ |
1845 | ||
1846 | static void | |
02e12e38 | 1847 | check_parameter_typelist (std::vector<struct type *> *params) |
e314d629 TT |
1848 | { |
1849 | struct type *type; | |
1850 | int ix; | |
1851 | ||
02e12e38 | 1852 | for (ix = 0; ix < params->size (); ++ix) |
e314d629 | 1853 | { |
02e12e38 | 1854 | type = (*params)[ix]; |
78134374 | 1855 | if (type != NULL && check_typedef (type)->code () == TYPE_CODE_VOID) |
e314d629 TT |
1856 | { |
1857 | if (ix == 0) | |
1858 | { | |
02e12e38 | 1859 | if (params->size () == 1) |
e314d629 TT |
1860 | { |
1861 | /* Ok. */ | |
1862 | break; | |
1863 | } | |
e314d629 TT |
1864 | error (_("parameter types following 'void'")); |
1865 | } | |
1866 | else | |
02e12e38 | 1867 | error (_("'void' invalid as parameter type")); |
e314d629 TT |
1868 | } |
1869 | } | |
1870 | } | |
1871 | ||
c906108c SS |
1872 | /* Take care of parsing a number (anything that starts with a digit). |
1873 | Set yylval and return the token type; update lexptr. | |
1874 | LEN is the number of characters in it. */ | |
1875 | ||
1876 | /*** Needs some error checking for the float case ***/ | |
1877 | ||
1878 | static int | |
410a0ff2 SDJ |
1879 | parse_number (struct parser_state *par_state, |
1880 | const char *buf, int len, int parsed_float, YYSTYPE *putithere) | |
c906108c | 1881 | { |
20562150 TT |
1882 | ULONGEST n = 0; |
1883 | ULONGEST prevn = 0; | |
c906108c SS |
1884 | ULONGEST un; |
1885 | ||
710122da DC |
1886 | int i = 0; |
1887 | int c; | |
1888 | int base = input_radix; | |
c906108c SS |
1889 | int unsigned_p = 0; |
1890 | ||
1891 | /* Number of "L" suffixes encountered. */ | |
1892 | int long_p = 0; | |
1893 | ||
fa649bb7 TT |
1894 | /* Imaginary number. */ |
1895 | bool imaginary_p = false; | |
1896 | ||
1897 | /* We have found a "L" or "U" (or "i") suffix. */ | |
c906108c SS |
1898 | int found_suffix = 0; |
1899 | ||
1900 | ULONGEST high_bit; | |
1901 | struct type *signed_type; | |
1902 | struct type *unsigned_type; | |
d7561cbb KS |
1903 | char *p; |
1904 | ||
224c3ddb | 1905 | p = (char *) alloca (len); |
d7561cbb | 1906 | memcpy (p, buf, len); |
c906108c SS |
1907 | |
1908 | if (parsed_float) | |
1909 | { | |
fa649bb7 TT |
1910 | if (len >= 1 && p[len - 1] == 'i') |
1911 | { | |
1912 | imaginary_p = true; | |
1913 | --len; | |
1914 | } | |
1915 | ||
edd079d9 | 1916 | /* Handle suffixes for decimal floating-point: "df", "dd" or "dl". */ |
fe9441f6 | 1917 | if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f') |
27bc4d80 | 1918 | { |
edd079d9 | 1919 | putithere->typed_val_float.type |
410a0ff2 | 1920 | = parse_type (par_state)->builtin_decfloat; |
edd079d9 | 1921 | len -= 2; |
27bc4d80 | 1922 | } |
edd079d9 | 1923 | else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd') |
27bc4d80 | 1924 | { |
edd079d9 | 1925 | putithere->typed_val_float.type |
410a0ff2 | 1926 | = parse_type (par_state)->builtin_decdouble; |
edd079d9 | 1927 | len -= 2; |
27bc4d80 | 1928 | } |
edd079d9 | 1929 | else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l') |
27bc4d80 | 1930 | { |
edd079d9 | 1931 | putithere->typed_val_float.type |
410a0ff2 | 1932 | = parse_type (par_state)->builtin_declong; |
edd079d9 UW |
1933 | len -= 2; |
1934 | } | |
1935 | /* Handle suffixes: 'f' for float, 'l' for long double. */ | |
b1b60145 | 1936 | else if (len >= 1 && TOLOWER (p[len - 1]) == 'f') |
edd079d9 UW |
1937 | { |
1938 | putithere->typed_val_float.type | |
1939 | = parse_type (par_state)->builtin_float; | |
1940 | len -= 1; | |
1941 | } | |
b1b60145 | 1942 | else if (len >= 1 && TOLOWER (p[len - 1]) == 'l') |
edd079d9 UW |
1943 | { |
1944 | putithere->typed_val_float.type | |
1945 | = parse_type (par_state)->builtin_long_double; | |
1946 | len -= 1; | |
1947 | } | |
1948 | /* Default type for floating-point literals is double. */ | |
1949 | else | |
1950 | { | |
1951 | putithere->typed_val_float.type | |
1952 | = parse_type (par_state)->builtin_double; | |
27bc4d80 TJB |
1953 | } |
1954 | ||
edd079d9 UW |
1955 | if (!parse_float (p, len, |
1956 | putithere->typed_val_float.type, | |
1957 | putithere->typed_val_float.val)) | |
dda83cd7 | 1958 | return ERROR; |
fa649bb7 TT |
1959 | |
1960 | if (imaginary_p) | |
1961 | putithere->typed_val_float.type | |
1962 | = init_complex_type (nullptr, putithere->typed_val_float.type); | |
1963 | ||
1964 | return imaginary_p ? COMPLEX_FLOAT : FLOAT; | |
c906108c SS |
1965 | } |
1966 | ||
1967 | /* Handle base-switching prefixes 0x, 0t, 0d, 0 */ | |
ebf13736 | 1968 | if (p[0] == '0' && len > 1) |
c906108c SS |
1969 | switch (p[1]) |
1970 | { | |
1971 | case 'x': | |
1972 | case 'X': | |
1973 | if (len >= 3) | |
1974 | { | |
1975 | p += 2; | |
1976 | base = 16; | |
1977 | len -= 2; | |
1978 | } | |
1979 | break; | |
1980 | ||
b5cfddf5 JK |
1981 | case 'b': |
1982 | case 'B': | |
1983 | if (len >= 3) | |
1984 | { | |
1985 | p += 2; | |
1986 | base = 2; | |
1987 | len -= 2; | |
1988 | } | |
1989 | break; | |
1990 | ||
c906108c SS |
1991 | case 't': |
1992 | case 'T': | |
1993 | case 'd': | |
1994 | case 'D': | |
1995 | if (len >= 3) | |
1996 | { | |
1997 | p += 2; | |
1998 | base = 10; | |
1999 | len -= 2; | |
2000 | } | |
2001 | break; | |
2002 | ||
2003 | default: | |
2004 | base = 8; | |
2005 | break; | |
2006 | } | |
2007 | ||
2008 | while (len-- > 0) | |
2009 | { | |
2010 | c = *p++; | |
2011 | if (c >= 'A' && c <= 'Z') | |
2012 | c += 'a' - 'A'; | |
fa649bb7 | 2013 | if (c != 'l' && c != 'u' && c != 'i') |
c906108c SS |
2014 | n *= base; |
2015 | if (c >= '0' && c <= '9') | |
2016 | { | |
2017 | if (found_suffix) | |
2018 | return ERROR; | |
2019 | n += i = c - '0'; | |
2020 | } | |
2021 | else | |
2022 | { | |
2023 | if (base > 10 && c >= 'a' && c <= 'f') | |
2024 | { | |
2025 | if (found_suffix) | |
2026 | return ERROR; | |
2027 | n += i = c - 'a' + 10; | |
2028 | } | |
2029 | else if (c == 'l') | |
2030 | { | |
2031 | ++long_p; | |
2032 | found_suffix = 1; | |
2033 | } | |
2034 | else if (c == 'u') | |
2035 | { | |
2036 | unsigned_p = 1; | |
2037 | found_suffix = 1; | |
2038 | } | |
fa649bb7 TT |
2039 | else if (c == 'i') |
2040 | { | |
2041 | imaginary_p = true; | |
2042 | found_suffix = 1; | |
2043 | } | |
c906108c SS |
2044 | else |
2045 | return ERROR; /* Char not a digit */ | |
2046 | } | |
2047 | if (i >= base) | |
2048 | return ERROR; /* Invalid digit in this base */ | |
2049 | ||
2050 | /* Portably test for overflow (only works for nonzero values, so make | |
2051 | a second check for zero). FIXME: Can't we just make n and prevn | |
2052 | unsigned and avoid this? */ | |
fa649bb7 | 2053 | if (c != 'l' && c != 'u' && c != 'i' && (prevn >= n) && n != 0) |
c906108c SS |
2054 | unsigned_p = 1; /* Try something unsigned */ |
2055 | ||
2056 | /* Portably test for unsigned overflow. | |
2057 | FIXME: This check is wrong; for example it doesn't find overflow | |
2058 | on 0x123456789 when LONGEST is 32 bits. */ | |
fa649bb7 | 2059 | if (c != 'l' && c != 'u' && c != 'i' && n != 0) |
c906108c | 2060 | { |
20562150 | 2061 | if (unsigned_p && prevn >= n) |
001083c6 | 2062 | error (_("Numeric constant too large.")); |
c906108c SS |
2063 | } |
2064 | prevn = n; | |
2065 | } | |
2066 | ||
2067 | /* An integer constant is an int, a long, or a long long. An L | |
2068 | suffix forces it to be long; an LL suffix forces it to be long | |
2069 | long. If not forced to a larger size, it gets the first type of | |
2070 | the above that it fits in. To figure out whether it fits, we | |
2071 | shift it right and see whether anything remains. Note that we | |
2072 | can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one | |
2073 | operation, because many compilers will warn about such a shift | |
9a76efb6 UW |
2074 | (which always produces a zero result). Sometimes gdbarch_int_bit |
2075 | or gdbarch_long_bit will be that big, sometimes not. To deal with | |
c906108c SS |
2076 | the case where it is we just always shift the value more than |
2077 | once, with fewer bits each time. */ | |
2078 | ||
20562150 | 2079 | un = n >> 2; |
c906108c | 2080 | if (long_p == 0 |
fa9f5be6 | 2081 | && (un >> (gdbarch_int_bit (par_state->gdbarch ()) - 2)) == 0) |
c906108c | 2082 | { |
410a0ff2 | 2083 | high_bit |
fa9f5be6 | 2084 | = ((ULONGEST)1) << (gdbarch_int_bit (par_state->gdbarch ()) - 1); |
c906108c SS |
2085 | |
2086 | /* A large decimal (not hex or octal) constant (between INT_MAX | |
2087 | and UINT_MAX) is a long or unsigned long, according to ANSI, | |
2088 | never an unsigned int, but this code treats it as unsigned | |
2089 | int. This probably should be fixed. GCC gives a warning on | |
2090 | such constants. */ | |
2091 | ||
410a0ff2 SDJ |
2092 | unsigned_type = parse_type (par_state)->builtin_unsigned_int; |
2093 | signed_type = parse_type (par_state)->builtin_int; | |
c906108c SS |
2094 | } |
2095 | else if (long_p <= 1 | |
fa9f5be6 | 2096 | && (un >> (gdbarch_long_bit (par_state->gdbarch ()) - 2)) == 0) |
c906108c | 2097 | { |
410a0ff2 | 2098 | high_bit |
fa9f5be6 | 2099 | = ((ULONGEST)1) << (gdbarch_long_bit (par_state->gdbarch ()) - 1); |
410a0ff2 SDJ |
2100 | unsigned_type = parse_type (par_state)->builtin_unsigned_long; |
2101 | signed_type = parse_type (par_state)->builtin_long; | |
c906108c SS |
2102 | } |
2103 | else | |
2104 | { | |
2105 | int shift; | |
4d29c0a8 | 2106 | if (sizeof (ULONGEST) * HOST_CHAR_BIT |
fa9f5be6 | 2107 | < gdbarch_long_long_bit (par_state->gdbarch ())) |
c906108c SS |
2108 | /* A long long does not fit in a LONGEST. */ |
2109 | shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1); | |
2110 | else | |
fa9f5be6 | 2111 | shift = (gdbarch_long_long_bit (par_state->gdbarch ()) - 1); |
c906108c | 2112 | high_bit = (ULONGEST) 1 << shift; |
410a0ff2 SDJ |
2113 | unsigned_type = parse_type (par_state)->builtin_unsigned_long_long; |
2114 | signed_type = parse_type (par_state)->builtin_long_long; | |
c906108c SS |
2115 | } |
2116 | ||
2117 | putithere->typed_val_int.val = n; | |
2118 | ||
2119 | /* If the high bit of the worked out type is set then this number | |
2120 | has to be unsigned. */ | |
2121 | ||
4d29c0a8 | 2122 | if (unsigned_p || (n & high_bit)) |
c906108c SS |
2123 | { |
2124 | putithere->typed_val_int.type = unsigned_type; | |
2125 | } | |
4d29c0a8 | 2126 | else |
c906108c SS |
2127 | { |
2128 | putithere->typed_val_int.type = signed_type; | |
2129 | } | |
2130 | ||
fa649bb7 TT |
2131 | if (imaginary_p) |
2132 | putithere->typed_val_int.type | |
2133 | = init_complex_type (nullptr, putithere->typed_val_int.type); | |
2134 | ||
2135 | return imaginary_p ? COMPLEX_INT : INT; | |
c906108c SS |
2136 | } |
2137 | ||
6c7a06a3 TT |
2138 | /* Temporary obstack used for holding strings. */ |
2139 | static struct obstack tempbuf; | |
2140 | static int tempbuf_init; | |
2141 | ||
2142 | /* Parse a C escape sequence. The initial backslash of the sequence | |
2143 | is at (*PTR)[-1]. *PTR will be updated to point to just after the | |
2144 | last character of the sequence. If OUTPUT is not NULL, the | |
2145 | translated form of the escape sequence will be written there. If | |
2146 | OUTPUT is NULL, no output is written and the call will only affect | |
2147 | *PTR. If an escape sequence is expressed in target bytes, then the | |
2148 | entire sequence will simply be copied to OUTPUT. Return 1 if any | |
2149 | character was emitted, 0 otherwise. */ | |
2150 | ||
2151 | int | |
d7561cbb | 2152 | c_parse_escape (const char **ptr, struct obstack *output) |
6c7a06a3 | 2153 | { |
d7561cbb | 2154 | const char *tokptr = *ptr; |
6c7a06a3 TT |
2155 | int result = 1; |
2156 | ||
2157 | /* Some escape sequences undergo character set conversion. Those we | |
2158 | translate here. */ | |
2159 | switch (*tokptr) | |
2160 | { | |
2161 | /* Hex escapes do not undergo character set conversion, so keep | |
2162 | the escape sequence for later. */ | |
2163 | case 'x': | |
2164 | if (output) | |
2165 | obstack_grow_str (output, "\\x"); | |
2166 | ++tokptr; | |
b1b60145 | 2167 | if (!ISXDIGIT (*tokptr)) |
6c7a06a3 | 2168 | error (_("\\x escape without a following hex digit")); |
b1b60145 | 2169 | while (ISXDIGIT (*tokptr)) |
6c7a06a3 TT |
2170 | { |
2171 | if (output) | |
2172 | obstack_1grow (output, *tokptr); | |
2173 | ++tokptr; | |
2174 | } | |
2175 | break; | |
2176 | ||
2177 | /* Octal escapes do not undergo character set conversion, so | |
2178 | keep the escape sequence for later. */ | |
2179 | case '0': | |
2180 | case '1': | |
2181 | case '2': | |
2182 | case '3': | |
2183 | case '4': | |
2184 | case '5': | |
2185 | case '6': | |
2186 | case '7': | |
30b66ecc TT |
2187 | { |
2188 | int i; | |
2189 | if (output) | |
2190 | obstack_grow_str (output, "\\"); | |
2191 | for (i = 0; | |
b1b60145 | 2192 | i < 3 && ISDIGIT (*tokptr) && *tokptr != '8' && *tokptr != '9'; |
30b66ecc TT |
2193 | ++i) |
2194 | { | |
2195 | if (output) | |
2196 | obstack_1grow (output, *tokptr); | |
2197 | ++tokptr; | |
2198 | } | |
2199 | } | |
6c7a06a3 TT |
2200 | break; |
2201 | ||
2202 | /* We handle UCNs later. We could handle them here, but that | |
2203 | would mean a spurious error in the case where the UCN could | |
2204 | be converted to the target charset but not the host | |
2205 | charset. */ | |
2206 | case 'u': | |
2207 | case 'U': | |
2208 | { | |
2209 | char c = *tokptr; | |
2210 | int i, len = c == 'U' ? 8 : 4; | |
2211 | if (output) | |
2212 | { | |
2213 | obstack_1grow (output, '\\'); | |
2214 | obstack_1grow (output, *tokptr); | |
2215 | } | |
2216 | ++tokptr; | |
b1b60145 | 2217 | if (!ISXDIGIT (*tokptr)) |
6c7a06a3 | 2218 | error (_("\\%c escape without a following hex digit"), c); |
b1b60145 | 2219 | for (i = 0; i < len && ISXDIGIT (*tokptr); ++i) |
6c7a06a3 TT |
2220 | { |
2221 | if (output) | |
2222 | obstack_1grow (output, *tokptr); | |
2223 | ++tokptr; | |
2224 | } | |
2225 | } | |
2226 | break; | |
2227 | ||
2228 | /* We must pass backslash through so that it does not | |
2229 | cause quoting during the second expansion. */ | |
2230 | case '\\': | |
2231 | if (output) | |
2232 | obstack_grow_str (output, "\\\\"); | |
2233 | ++tokptr; | |
2234 | break; | |
2235 | ||
2236 | /* Escapes which undergo conversion. */ | |
2237 | case 'a': | |
2238 | if (output) | |
2239 | obstack_1grow (output, '\a'); | |
2240 | ++tokptr; | |
2241 | break; | |
2242 | case 'b': | |
2243 | if (output) | |
2244 | obstack_1grow (output, '\b'); | |
2245 | ++tokptr; | |
2246 | break; | |
2247 | case 'f': | |
2248 | if (output) | |
2249 | obstack_1grow (output, '\f'); | |
2250 | ++tokptr; | |
2251 | break; | |
2252 | case 'n': | |
2253 | if (output) | |
2254 | obstack_1grow (output, '\n'); | |
2255 | ++tokptr; | |
2256 | break; | |
2257 | case 'r': | |
2258 | if (output) | |
2259 | obstack_1grow (output, '\r'); | |
2260 | ++tokptr; | |
2261 | break; | |
2262 | case 't': | |
2263 | if (output) | |
2264 | obstack_1grow (output, '\t'); | |
2265 | ++tokptr; | |
2266 | break; | |
2267 | case 'v': | |
2268 | if (output) | |
2269 | obstack_1grow (output, '\v'); | |
2270 | ++tokptr; | |
2271 | break; | |
2272 | ||
2273 | /* GCC extension. */ | |
2274 | case 'e': | |
2275 | if (output) | |
2276 | obstack_1grow (output, HOST_ESCAPE_CHAR); | |
2277 | ++tokptr; | |
2278 | break; | |
2279 | ||
2280 | /* Backslash-newline expands to nothing at all. */ | |
2281 | case '\n': | |
2282 | ++tokptr; | |
2283 | result = 0; | |
2284 | break; | |
2285 | ||
2286 | /* A few escapes just expand to the character itself. */ | |
2287 | case '\'': | |
2288 | case '\"': | |
2289 | case '?': | |
2290 | /* GCC extensions. */ | |
2291 | case '(': | |
2292 | case '{': | |
2293 | case '[': | |
2294 | case '%': | |
2295 | /* Unrecognized escapes turn into the character itself. */ | |
2296 | default: | |
2297 | if (output) | |
2298 | obstack_1grow (output, *tokptr); | |
2299 | ++tokptr; | |
2300 | break; | |
2301 | } | |
2302 | *ptr = tokptr; | |
2303 | return result; | |
2304 | } | |
2305 | ||
2306 | /* Parse a string or character literal from TOKPTR. The string or | |
2307 | character may be wide or unicode. *OUTPTR is set to just after the | |
2308 | end of the literal in the input string. The resulting token is | |
2309 | stored in VALUE. This returns a token value, either STRING or | |
2310 | CHAR, depending on what was parsed. *HOST_CHARS is set to the | |
2311 | number of host characters in the literal. */ | |
4d29c0a8 | 2312 | |
6c7a06a3 | 2313 | static int |
d7561cbb KS |
2314 | parse_string_or_char (const char *tokptr, const char **outptr, |
2315 | struct typed_stoken *value, int *host_chars) | |
6c7a06a3 | 2316 | { |
8c5630cb | 2317 | int quote; |
0c801b96 | 2318 | c_string_type type; |
f2e8016f | 2319 | int is_objc = 0; |
6c7a06a3 TT |
2320 | |
2321 | /* Build the gdb internal form of the input string in tempbuf. Note | |
2322 | that the buffer is null byte terminated *only* for the | |
2323 | convenience of debugging gdb itself and printing the buffer | |
2324 | contents when the buffer contains no embedded nulls. Gdb does | |
2325 | not depend upon the buffer being null byte terminated, it uses | |
2326 | the length string instead. This allows gdb to handle C strings | |
2327 | (as well as strings in other languages) with embedded null | |
2328 | bytes */ | |
2329 | ||
2330 | if (!tempbuf_init) | |
2331 | tempbuf_init = 1; | |
2332 | else | |
2333 | obstack_free (&tempbuf, NULL); | |
2334 | obstack_init (&tempbuf); | |
2335 | ||
2336 | /* Record the string type. */ | |
2337 | if (*tokptr == 'L') | |
2338 | { | |
2339 | type = C_WIDE_STRING; | |
2340 | ++tokptr; | |
2341 | } | |
2342 | else if (*tokptr == 'u') | |
2343 | { | |
2344 | type = C_STRING_16; | |
2345 | ++tokptr; | |
2346 | } | |
2347 | else if (*tokptr == 'U') | |
2348 | { | |
2349 | type = C_STRING_32; | |
2350 | ++tokptr; | |
2351 | } | |
f2e8016f TT |
2352 | else if (*tokptr == '@') |
2353 | { | |
2354 | /* An Objective C string. */ | |
2355 | is_objc = 1; | |
2356 | type = C_STRING; | |
2357 | ++tokptr; | |
2358 | } | |
6c7a06a3 TT |
2359 | else |
2360 | type = C_STRING; | |
2361 | ||
2362 | /* Skip the quote. */ | |
2363 | quote = *tokptr; | |
2364 | if (quote == '\'') | |
2365 | type |= C_CHAR; | |
2366 | ++tokptr; | |
2367 | ||
2368 | *host_chars = 0; | |
2369 | ||
2370 | while (*tokptr) | |
2371 | { | |
2372 | char c = *tokptr; | |
2373 | if (c == '\\') | |
2374 | { | |
2375 | ++tokptr; | |
2376 | *host_chars += c_parse_escape (&tokptr, &tempbuf); | |
2377 | } | |
2378 | else if (c == quote) | |
2379 | break; | |
2380 | else | |
2381 | { | |
2382 | obstack_1grow (&tempbuf, c); | |
2383 | ++tokptr; | |
2384 | /* FIXME: this does the wrong thing with multi-byte host | |
2385 | characters. We could use mbrlen here, but that would | |
2386 | make "set host-charset" a bit less useful. */ | |
2387 | ++*host_chars; | |
2388 | } | |
2389 | } | |
2390 | ||
2391 | if (*tokptr != quote) | |
2392 | { | |
2393 | if (quote == '"') | |
001083c6 | 2394 | error (_("Unterminated string in expression.")); |
6c7a06a3 | 2395 | else |
001083c6 | 2396 | error (_("Unmatched single quote.")); |
6c7a06a3 TT |
2397 | } |
2398 | ++tokptr; | |
2399 | ||
2400 | value->type = type; | |
79f33898 | 2401 | value->ptr = (char *) obstack_base (&tempbuf); |
6c7a06a3 TT |
2402 | value->length = obstack_object_size (&tempbuf); |
2403 | ||
2404 | *outptr = tokptr; | |
2405 | ||
f2e8016f | 2406 | return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR; |
6c7a06a3 TT |
2407 | } |
2408 | ||
274b54d7 TT |
2409 | /* This is used to associate some attributes with a token. */ |
2410 | ||
8d297bbf | 2411 | enum token_flag |
274b54d7 TT |
2412 | { |
2413 | /* If this bit is set, the token is C++-only. */ | |
2414 | ||
2415 | FLAG_CXX = 1, | |
2416 | ||
3293bbaf TT |
2417 | /* If this bit is set, the token is C-only. */ |
2418 | ||
2419 | FLAG_C = 2, | |
2420 | ||
274b54d7 TT |
2421 | /* If this bit is set, the token is conditional: if there is a |
2422 | symbol of the same name, then the token is a symbol; otherwise, | |
2423 | the token is a keyword. */ | |
2424 | ||
3293bbaf | 2425 | FLAG_SHADOW = 4 |
274b54d7 | 2426 | }; |
8d297bbf | 2427 | DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags); |
274b54d7 | 2428 | |
c906108c SS |
2429 | struct token |
2430 | { | |
a121b7c1 | 2431 | const char *oper; |
c906108c SS |
2432 | int token; |
2433 | enum exp_opcode opcode; | |
8d297bbf | 2434 | token_flags flags; |
c906108c SS |
2435 | }; |
2436 | ||
2437 | static const struct token tokentab3[] = | |
2438 | { | |
ba163c7e | 2439 | {">>=", ASSIGN_MODIFY, BINOP_RSH, 0}, |
c1af96a0 | 2440 | {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0}, |
274b54d7 | 2441 | {"->*", ARROW_STAR, BINOP_END, FLAG_CXX}, |
a6fb9c08 | 2442 | {"...", DOTDOTDOT, BINOP_END, 0} |
c906108c SS |
2443 | }; |
2444 | ||
2445 | static const struct token tokentab2[] = | |
2446 | { | |
ba163c7e TT |
2447 | {"+=", ASSIGN_MODIFY, BINOP_ADD, 0}, |
2448 | {"-=", ASSIGN_MODIFY, BINOP_SUB, 0}, | |
2449 | {"*=", ASSIGN_MODIFY, BINOP_MUL, 0}, | |
2450 | {"/=", ASSIGN_MODIFY, BINOP_DIV, 0}, | |
2451 | {"%=", ASSIGN_MODIFY, BINOP_REM, 0}, | |
2452 | {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0}, | |
2453 | {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0}, | |
2454 | {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0}, | |
2455 | {"++", INCREMENT, BINOP_END, 0}, | |
2456 | {"--", DECREMENT, BINOP_END, 0}, | |
2457 | {"->", ARROW, BINOP_END, 0}, | |
2458 | {"&&", ANDAND, BINOP_END, 0}, | |
2459 | {"||", OROR, BINOP_END, 0}, | |
ec7f2efe KS |
2460 | /* "::" is *not* only C++: gdb overrides its meaning in several |
2461 | different ways, e.g., 'filename'::func, function::variable. */ | |
ba163c7e TT |
2462 | {"::", COLONCOLON, BINOP_END, 0}, |
2463 | {"<<", LSH, BINOP_END, 0}, | |
2464 | {">>", RSH, BINOP_END, 0}, | |
2465 | {"==", EQUAL, BINOP_END, 0}, | |
2466 | {"!=", NOTEQUAL, BINOP_END, 0}, | |
2467 | {"<=", LEQ, BINOP_END, 0}, | |
c1af96a0 | 2468 | {">=", GEQ, BINOP_END, 0}, |
274b54d7 | 2469 | {".*", DOT_STAR, BINOP_END, FLAG_CXX} |
ba163c7e TT |
2470 | }; |
2471 | ||
b6c95c0c AB |
2472 | /* Identifier-like tokens. Only type-specifiers than can appear in |
2473 | multi-word type names (for example 'double' can appear in 'long | |
2474 | double') need to be listed here. type-specifiers that are only ever | |
3638a098 | 2475 | single word (like 'char') are handled by the classify_name function. */ |
ba163c7e TT |
2476 | static const struct token ident_tokens[] = |
2477 | { | |
2478 | {"unsigned", UNSIGNED, OP_NULL, 0}, | |
274b54d7 | 2479 | {"template", TEMPLATE, OP_NULL, FLAG_CXX}, |
ba163c7e TT |
2480 | {"volatile", VOLATILE_KEYWORD, OP_NULL, 0}, |
2481 | {"struct", STRUCT, OP_NULL, 0}, | |
2482 | {"signed", SIGNED_KEYWORD, OP_NULL, 0}, | |
2483 | {"sizeof", SIZEOF, OP_NULL, 0}, | |
007e1530 TT |
2484 | {"_Alignof", ALIGNOF, OP_NULL, 0}, |
2485 | {"alignof", ALIGNOF, OP_NULL, FLAG_CXX}, | |
ba163c7e | 2486 | {"double", DOUBLE_KEYWORD, OP_NULL, 0}, |
3638a098 | 2487 | {"float", FLOAT_KEYWORD, OP_NULL, 0}, |
274b54d7 TT |
2488 | {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX}, |
2489 | {"class", CLASS, OP_NULL, FLAG_CXX}, | |
ba163c7e TT |
2490 | {"union", UNION, OP_NULL, 0}, |
2491 | {"short", SHORT, OP_NULL, 0}, | |
2492 | {"const", CONST_KEYWORD, OP_NULL, 0}, | |
3293bbaf TT |
2493 | {"restrict", RESTRICT, OP_NULL, FLAG_C | FLAG_SHADOW}, |
2494 | {"__restrict__", RESTRICT, OP_NULL, 0}, | |
2495 | {"__restrict", RESTRICT, OP_NULL, 0}, | |
2496 | {"_Atomic", ATOMIC, OP_NULL, 0}, | |
ba163c7e TT |
2497 | {"enum", ENUM, OP_NULL, 0}, |
2498 | {"long", LONG, OP_NULL, 0}, | |
3638a098 TT |
2499 | {"_Complex", COMPLEX, OP_NULL, 0}, |
2500 | {"__complex__", COMPLEX, OP_NULL, 0}, | |
2501 | ||
274b54d7 | 2502 | {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX}, |
ba163c7e | 2503 | {"int", INT_KEYWORD, OP_NULL, 0}, |
274b54d7 TT |
2504 | {"new", NEW, OP_NULL, FLAG_CXX}, |
2505 | {"delete", DELETE, OP_NULL, FLAG_CXX}, | |
2506 | {"operator", OPERATOR, OP_NULL, FLAG_CXX}, | |
2507 | ||
2508 | {"and", ANDAND, BINOP_END, FLAG_CXX}, | |
2509 | {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX}, | |
2510 | {"bitand", '&', OP_NULL, FLAG_CXX}, | |
2511 | {"bitor", '|', OP_NULL, FLAG_CXX}, | |
2512 | {"compl", '~', OP_NULL, FLAG_CXX}, | |
2513 | {"not", '!', OP_NULL, FLAG_CXX}, | |
2514 | {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX}, | |
2515 | {"or", OROR, BINOP_END, FLAG_CXX}, | |
2516 | {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX}, | |
2517 | {"xor", '^', OP_NULL, FLAG_CXX}, | |
2518 | {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX}, | |
2519 | ||
2520 | {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX }, | |
2521 | {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX }, | |
2522 | {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX }, | |
608b4967 TT |
2523 | {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX }, |
2524 | ||
2525 | {"__typeof__", TYPEOF, OP_TYPEOF, 0 }, | |
2526 | {"__typeof", TYPEOF, OP_TYPEOF, 0 }, | |
2527 | {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW }, | |
2528 | {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX }, | |
6e72ca20 TT |
2529 | {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW }, |
2530 | ||
2531 | {"typeid", TYPEID, OP_TYPEID, FLAG_CXX} | |
c906108c SS |
2532 | }; |
2533 | ||
7c8adf68 TT |
2534 | |
2535 | static void | |
14d960c8 | 2536 | scan_macro_expansion (const char *expansion) |
7c8adf68 | 2537 | { |
7c8adf68 | 2538 | /* We'd better not be trying to push the stack twice. */ |
9d30e1fd | 2539 | gdb_assert (! cpstate->macro_original_text); |
7c8adf68 | 2540 | |
14d960c8 SM |
2541 | /* Copy to the obstack. */ |
2542 | const char *copy = obstack_strdup (&cpstate->expansion_obstack, expansion); | |
7c8adf68 TT |
2543 | |
2544 | /* Save the old lexptr value, so we can return to it when we're done | |
2545 | parsing the expanded text. */ | |
5776fca3 TT |
2546 | cpstate->macro_original_text = pstate->lexptr; |
2547 | pstate->lexptr = copy; | |
7c8adf68 TT |
2548 | } |
2549 | ||
7c8adf68 TT |
2550 | static int |
2551 | scanning_macro_expansion (void) | |
2552 | { | |
9d30e1fd | 2553 | return cpstate->macro_original_text != 0; |
7c8adf68 TT |
2554 | } |
2555 | ||
4d29c0a8 | 2556 | static void |
7c8adf68 TT |
2557 | finished_macro_expansion (void) |
2558 | { | |
2559 | /* There'd better be something to pop back to. */ | |
9d30e1fd | 2560 | gdb_assert (cpstate->macro_original_text); |
7c8adf68 TT |
2561 | |
2562 | /* Pop back to the original text. */ | |
5776fca3 | 2563 | pstate->lexptr = cpstate->macro_original_text; |
9d30e1fd | 2564 | cpstate->macro_original_text = 0; |
7c8adf68 TT |
2565 | } |
2566 | ||
4e8f195d TT |
2567 | /* Return true iff the token represents a C++ cast operator. */ |
2568 | ||
2569 | static int | |
2570 | is_cast_operator (const char *token, int len) | |
2571 | { | |
2572 | return (! strncmp (token, "dynamic_cast", len) | |
2573 | || ! strncmp (token, "static_cast", len) | |
2574 | || ! strncmp (token, "reinterpret_cast", len) | |
2575 | || ! strncmp (token, "const_cast", len)); | |
2576 | } | |
7c8adf68 TT |
2577 | |
2578 | /* The scope used for macro expansion. */ | |
2579 | static struct macro_scope *expression_macro_scope; | |
2580 | ||
65d12d83 TT |
2581 | /* This is set if a NAME token appeared at the very end of the input |
2582 | string, with no whitespace separating the name from the EOF. This | |
2583 | is used only when parsing to do field name completion. */ | |
2584 | static int saw_name_at_eof; | |
2585 | ||
2586 | /* This is set if the previously-returned token was a structure | |
59498c30 LS |
2587 | operator -- either '.' or ARROW. */ |
2588 | static bool last_was_structop; | |
65d12d83 | 2589 | |
28aaf3fd TT |
2590 | /* Depth of parentheses. */ |
2591 | static int paren_depth; | |
2592 | ||
c906108c SS |
2593 | /* Read one token, getting characters through lexptr. */ |
2594 | ||
2595 | static int | |
59498c30 | 2596 | lex_one_token (struct parser_state *par_state, bool *is_quoted_name) |
c906108c SS |
2597 | { |
2598 | int c; | |
2599 | int namelen; | |
2600 | unsigned int i; | |
d7561cbb | 2601 | const char *tokstart; |
59498c30 | 2602 | bool saw_structop = last_was_structop; |
65d12d83 | 2603 | |
59498c30 LS |
2604 | last_was_structop = false; |
2605 | *is_quoted_name = false; | |
65d12d83 | 2606 | |
c906108c SS |
2607 | retry: |
2608 | ||
84f0252a JB |
2609 | /* Check if this is a macro invocation that we need to expand. */ |
2610 | if (! scanning_macro_expansion ()) | |
2611 | { | |
14d960c8 SM |
2612 | gdb::unique_xmalloc_ptr<char> expanded |
2613 | = macro_expand_next (&pstate->lexptr, *expression_macro_scope); | |
84f0252a | 2614 | |
14d960c8 | 2615 | if (expanded != nullptr) |
dda83cd7 | 2616 | scan_macro_expansion (expanded.get ()); |
84f0252a JB |
2617 | } |
2618 | ||
5776fca3 | 2619 | pstate->prev_lexptr = pstate->lexptr; |
c906108c | 2620 | |
5776fca3 | 2621 | tokstart = pstate->lexptr; |
c906108c SS |
2622 | /* See if it is a special token of length 3. */ |
2623 | for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++) | |
fe978cb0 | 2624 | if (strncmp (tokstart, tokentab3[i].oper, 3) == 0) |
c906108c | 2625 | { |
274b54d7 | 2626 | if ((tokentab3[i].flags & FLAG_CXX) != 0 |
73923d7e | 2627 | && par_state->language ()->la_language != language_cplus) |
ec7f2efe | 2628 | break; |
3293bbaf | 2629 | gdb_assert ((tokentab3[i].flags & FLAG_C) == 0); |
ec7f2efe | 2630 | |
5776fca3 | 2631 | pstate->lexptr += 3; |
c906108c SS |
2632 | yylval.opcode = tokentab3[i].opcode; |
2633 | return tokentab3[i].token; | |
2634 | } | |
2635 | ||
2636 | /* See if it is a special token of length 2. */ | |
2637 | for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++) | |
fe978cb0 | 2638 | if (strncmp (tokstart, tokentab2[i].oper, 2) == 0) |
c906108c | 2639 | { |
274b54d7 | 2640 | if ((tokentab2[i].flags & FLAG_CXX) != 0 |
73923d7e | 2641 | && par_state->language ()->la_language != language_cplus) |
ec7f2efe | 2642 | break; |
f7d4f0b1 | 2643 | gdb_assert ((tokentab2[i].flags & FLAG_C) == 0); |
ec7f2efe | 2644 | |
5776fca3 | 2645 | pstate->lexptr += 2; |
c906108c | 2646 | yylval.opcode = tokentab2[i].opcode; |
59498c30 | 2647 | if (tokentab2[i].token == ARROW) |
65d12d83 | 2648 | last_was_structop = 1; |
c906108c SS |
2649 | return tokentab2[i].token; |
2650 | } | |
2651 | ||
2652 | switch (c = *tokstart) | |
2653 | { | |
2654 | case 0: | |
84f0252a | 2655 | /* If we were just scanning the result of a macro expansion, |
dda83cd7 | 2656 | then we need to resume scanning the original text. |
65d12d83 TT |
2657 | If we're parsing for field name completion, and the previous |
2658 | token allows such completion, return a COMPLETE token. | |
dda83cd7 SM |
2659 | Otherwise, we were already scanning the original text, and |
2660 | we're really done. */ | |
84f0252a | 2661 | if (scanning_macro_expansion ()) |
dda83cd7 SM |
2662 | { |
2663 | finished_macro_expansion (); | |
2664 | goto retry; | |
2665 | } | |
65d12d83 TT |
2666 | else if (saw_name_at_eof) |
2667 | { | |
2668 | saw_name_at_eof = 0; | |
2669 | return COMPLETE; | |
2670 | } | |
2a612529 | 2671 | else if (par_state->parse_completion && saw_structop) |
65d12d83 | 2672 | return COMPLETE; |
84f0252a | 2673 | else |
dda83cd7 | 2674 | return 0; |
c906108c SS |
2675 | |
2676 | case ' ': | |
2677 | case '\t': | |
2678 | case '\n': | |
5776fca3 | 2679 | pstate->lexptr++; |
c906108c SS |
2680 | goto retry; |
2681 | ||
379a77b5 | 2682 | case '[': |
c906108c SS |
2683 | case '(': |
2684 | paren_depth++; | |
5776fca3 | 2685 | pstate->lexptr++; |
73923d7e | 2686 | if (par_state->language ()->la_language == language_objc |
410a0ff2 | 2687 | && c == '[') |
f2e8016f | 2688 | return OBJC_LBRAC; |
c906108c SS |
2689 | return c; |
2690 | ||
379a77b5 | 2691 | case ']': |
c906108c SS |
2692 | case ')': |
2693 | if (paren_depth == 0) | |
2694 | return 0; | |
2695 | paren_depth--; | |
5776fca3 | 2696 | pstate->lexptr++; |
c906108c SS |
2697 | return c; |
2698 | ||
2699 | case ',': | |
8621b685 | 2700 | if (pstate->comma_terminates |
dda83cd7 SM |
2701 | && paren_depth == 0 |
2702 | && ! scanning_macro_expansion ()) | |
c906108c | 2703 | return 0; |
5776fca3 | 2704 | pstate->lexptr++; |
c906108c SS |
2705 | return c; |
2706 | ||
2707 | case '.': | |
2708 | /* Might be a floating point number. */ | |
5776fca3 | 2709 | if (pstate->lexptr[1] < '0' || pstate->lexptr[1] > '9') |
65d12d83 | 2710 | { |
59498c30 | 2711 | last_was_structop = true; |
65d12d83 TT |
2712 | goto symbol; /* Nope, must be a symbol. */ |
2713 | } | |
86a73007 | 2714 | /* FALL THRU. */ |
c906108c SS |
2715 | |
2716 | case '0': | |
2717 | case '1': | |
2718 | case '2': | |
2719 | case '3': | |
2720 | case '4': | |
2721 | case '5': | |
2722 | case '6': | |
2723 | case '7': | |
2724 | case '8': | |
2725 | case '9': | |
2726 | { | |
2727 | /* It's a number. */ | |
2b4e6a3f | 2728 | int got_dot = 0, got_e = 0, got_p = 0, toktype; |
d7561cbb | 2729 | const char *p = tokstart; |
c906108c SS |
2730 | int hex = input_radix > 10; |
2731 | ||
2732 | if (c == '0' && (p[1] == 'x' || p[1] == 'X')) | |
2733 | { | |
2734 | p += 2; | |
2735 | hex = 1; | |
2736 | } | |
2737 | else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D')) | |
2738 | { | |
2739 | p += 2; | |
2740 | hex = 0; | |
2741 | } | |
2742 | ||
2743 | for (;; ++p) | |
2744 | { | |
2745 | /* This test includes !hex because 'e' is a valid hex digit | |
2746 | and thus does not indicate a floating point number when | |
2747 | the radix is hex. */ | |
2b4e6a3f | 2748 | if (!hex && !got_e && !got_p && (*p == 'e' || *p == 'E')) |
c906108c | 2749 | got_dot = got_e = 1; |
2b4e6a3f TT |
2750 | else if (!got_e && !got_p && (*p == 'p' || *p == 'P')) |
2751 | got_dot = got_p = 1; | |
c906108c SS |
2752 | /* This test does not include !hex, because a '.' always indicates |
2753 | a decimal floating point number regardless of the radix. */ | |
2754 | else if (!got_dot && *p == '.') | |
2755 | got_dot = 1; | |
2b4e6a3f TT |
2756 | else if (((got_e && (p[-1] == 'e' || p[-1] == 'E')) |
2757 | || (got_p && (p[-1] == 'p' || p[-1] == 'P'))) | |
c906108c SS |
2758 | && (*p == '-' || *p == '+')) |
2759 | /* This is the sign of the exponent, not the end of the | |
2760 | number. */ | |
2761 | continue; | |
2762 | /* We will take any letters or digits. parse_number will | |
2763 | complain if past the radix, or if L or U are not final. */ | |
2764 | else if ((*p < '0' || *p > '9') | |
2765 | && ((*p < 'a' || *p > 'z') | |
2766 | && (*p < 'A' || *p > 'Z'))) | |
2767 | break; | |
2768 | } | |
410a0ff2 | 2769 | toktype = parse_number (par_state, tokstart, p - tokstart, |
2b4e6a3f | 2770 | got_dot | got_e | got_p, &yylval); |
dda83cd7 | 2771 | if (toktype == ERROR) |
c906108c SS |
2772 | { |
2773 | char *err_copy = (char *) alloca (p - tokstart + 1); | |
2774 | ||
2775 | memcpy (err_copy, tokstart, p - tokstart); | |
2776 | err_copy[p - tokstart] = 0; | |
001083c6 | 2777 | error (_("Invalid number \"%s\"."), err_copy); |
c906108c | 2778 | } |
5776fca3 | 2779 | pstate->lexptr = p; |
c906108c SS |
2780 | return toktype; |
2781 | } | |
2782 | ||
941b2081 JK |
2783 | case '@': |
2784 | { | |
d7561cbb | 2785 | const char *p = &tokstart[1]; |
941b2081 | 2786 | |
73923d7e | 2787 | if (par_state->language ()->la_language == language_objc) |
f2e8016f TT |
2788 | { |
2789 | size_t len = strlen ("selector"); | |
2790 | ||
2791 | if (strncmp (p, "selector", len) == 0 | |
b1b60145 | 2792 | && (p[len] == '\0' || ISSPACE (p[len]))) |
f2e8016f | 2793 | { |
5776fca3 | 2794 | pstate->lexptr = p + len; |
f2e8016f TT |
2795 | return SELECTOR; |
2796 | } | |
2797 | else if (*p == '"') | |
2798 | goto parse_string; | |
2799 | } | |
2800 | ||
b1b60145 | 2801 | while (ISSPACE (*p)) |
941b2081 | 2802 | p++; |
b926417a | 2803 | size_t len = strlen ("entry"); |
b1b60145 | 2804 | if (strncmp (p, "entry", len) == 0 && !c_ident_is_alnum (p[len]) |
941b2081 JK |
2805 | && p[len] != '_') |
2806 | { | |
5776fca3 | 2807 | pstate->lexptr = &p[len]; |
941b2081 JK |
2808 | return ENTRY; |
2809 | } | |
2810 | } | |
2811 | /* FALLTHRU */ | |
c906108c SS |
2812 | case '+': |
2813 | case '-': | |
2814 | case '*': | |
2815 | case '/': | |
2816 | case '%': | |
2817 | case '|': | |
2818 | case '&': | |
2819 | case '^': | |
2820 | case '~': | |
2821 | case '!': | |
c906108c SS |
2822 | case '<': |
2823 | case '>': | |
c906108c SS |
2824 | case '?': |
2825 | case ':': | |
2826 | case '=': | |
2827 | case '{': | |
2828 | case '}': | |
2829 | symbol: | |
5776fca3 | 2830 | pstate->lexptr++; |
c906108c SS |
2831 | return c; |
2832 | ||
6c7a06a3 TT |
2833 | case 'L': |
2834 | case 'u': | |
2835 | case 'U': | |
2836 | if (tokstart[1] != '"' && tokstart[1] != '\'') | |
2837 | break; | |
2838 | /* Fall through. */ | |
2839 | case '\'': | |
c906108c | 2840 | case '"': |
f2e8016f TT |
2841 | |
2842 | parse_string: | |
6c7a06a3 TT |
2843 | { |
2844 | int host_len; | |
5776fca3 TT |
2845 | int result = parse_string_or_char (tokstart, &pstate->lexptr, |
2846 | &yylval.tsval, &host_len); | |
6c7a06a3 | 2847 | if (result == CHAR) |
c906108c | 2848 | { |
6c7a06a3 | 2849 | if (host_len == 0) |
001083c6 | 2850 | error (_("Empty character constant.")); |
6c7a06a3 | 2851 | else if (host_len > 2 && c == '\'') |
c906108c | 2852 | { |
6c7a06a3 | 2853 | ++tokstart; |
5776fca3 | 2854 | namelen = pstate->lexptr - tokstart - 1; |
59498c30 | 2855 | *is_quoted_name = true; |
805e1f19 | 2856 | |
6c7a06a3 | 2857 | goto tryname; |
c906108c | 2858 | } |
6c7a06a3 | 2859 | else if (host_len > 1) |
001083c6 | 2860 | error (_("Invalid character constant.")); |
c906108c | 2861 | } |
6c7a06a3 TT |
2862 | return result; |
2863 | } | |
c906108c SS |
2864 | } |
2865 | ||
b1b60145 | 2866 | if (!(c == '_' || c == '$' || c_ident_is_alpha (c))) |
c906108c | 2867 | /* We must have come across a bad character (e.g. ';'). */ |
001083c6 | 2868 | error (_("Invalid character '%c' in expression."), c); |
c906108c SS |
2869 | |
2870 | /* It's a name. See how long it is. */ | |
2871 | namelen = 0; | |
2872 | for (c = tokstart[namelen]; | |
b1b60145 | 2873 | (c == '_' || c == '$' || c_ident_is_alnum (c) || c == '<');) |
c906108c SS |
2874 | { |
2875 | /* Template parameter lists are part of the name. | |
2876 | FIXME: This mishandles `print $a<4&&$a>3'. */ | |
2877 | ||
2878 | if (c == '<') | |
4e8f195d TT |
2879 | { |
2880 | if (! is_cast_operator (tokstart, namelen)) | |
2881 | { | |
2882 | /* Scan ahead to get rest of the template specification. Note | |
2883 | that we look ahead only when the '<' adjoins non-whitespace | |
2884 | characters; for comparison expressions, e.g. "a < b > c", | |
2885 | there must be spaces before the '<', etc. */ | |
d7561cbb KS |
2886 | const char *p = find_template_name_end (tokstart + namelen); |
2887 | ||
4e8f195d TT |
2888 | if (p) |
2889 | namelen = p - tokstart; | |
2890 | } | |
2891 | break; | |
c906108c SS |
2892 | } |
2893 | c = tokstart[++namelen]; | |
2894 | } | |
2895 | ||
84f0252a JB |
2896 | /* The token "if" terminates the expression and is NOT removed from |
2897 | the input stream. It doesn't count if it appears in the | |
2898 | expansion of a macro. */ | |
2899 | if (namelen == 2 | |
2900 | && tokstart[0] == 'i' | |
2901 | && tokstart[1] == 'f' | |
2902 | && ! scanning_macro_expansion ()) | |
c906108c SS |
2903 | { |
2904 | return 0; | |
2905 | } | |
2906 | ||
b6199126 DJ |
2907 | /* For the same reason (breakpoint conditions), "thread N" |
2908 | terminates the expression. "thread" could be an identifier, but | |
2909 | an identifier is never followed by a number without intervening | |
2910 | punctuation. "task" is similar. Handle abbreviations of these, | |
2911 | similarly to breakpoint.c:find_condition_and_thread. */ | |
2912 | if (namelen >= 1 | |
2913 | && (strncmp (tokstart, "thread", namelen) == 0 | |
2914 | || strncmp (tokstart, "task", namelen) == 0) | |
2915 | && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t') | |
2916 | && ! scanning_macro_expansion ()) | |
2917 | { | |
d7561cbb KS |
2918 | const char *p = tokstart + namelen + 1; |
2919 | ||
b6199126 DJ |
2920 | while (*p == ' ' || *p == '\t') |
2921 | p++; | |
2922 | if (*p >= '0' && *p <= '9') | |
2923 | return 0; | |
2924 | } | |
2925 | ||
5776fca3 | 2926 | pstate->lexptr += namelen; |
c906108c SS |
2927 | |
2928 | tryname: | |
2929 | ||
c906108c SS |
2930 | yylval.sval.ptr = tokstart; |
2931 | yylval.sval.length = namelen; | |
2932 | ||
ba163c7e | 2933 | /* Catch specific keywords. */ |
61f4b350 | 2934 | std::string copy = copy_name (yylval.sval); |
ba163c7e | 2935 | for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++) |
61f4b350 | 2936 | if (copy == ident_tokens[i].oper) |
ba163c7e | 2937 | { |
274b54d7 | 2938 | if ((ident_tokens[i].flags & FLAG_CXX) != 0 |
73923d7e | 2939 | && par_state->language ()->la_language != language_cplus) |
ba163c7e | 2940 | break; |
3293bbaf TT |
2941 | if ((ident_tokens[i].flags & FLAG_C) != 0 |
2942 | && par_state->language ()->la_language != language_c | |
2943 | && par_state->language ()->la_language != language_objc) | |
2944 | break; | |
ba163c7e | 2945 | |
274b54d7 TT |
2946 | if ((ident_tokens[i].flags & FLAG_SHADOW) != 0) |
2947 | { | |
1993b719 | 2948 | struct field_of_this_result is_a_field_of_this; |
274b54d7 | 2949 | |
61f4b350 | 2950 | if (lookup_symbol (copy.c_str (), |
1e58a4a4 | 2951 | pstate->expression_context_block, |
274b54d7 | 2952 | VAR_DOMAIN, |
73923d7e | 2953 | (par_state->language ()->la_language |
dda83cd7 | 2954 | == language_cplus ? &is_a_field_of_this |
d12307c1 | 2955 | : NULL)).symbol |
274b54d7 TT |
2956 | != NULL) |
2957 | { | |
2958 | /* The keyword is shadowed. */ | |
2959 | break; | |
2960 | } | |
2961 | } | |
2962 | ||
ba163c7e TT |
2963 | /* It is ok to always set this, even though we don't always |
2964 | strictly need to. */ | |
2965 | yylval.opcode = ident_tokens[i].opcode; | |
2966 | return ident_tokens[i].token; | |
2967 | } | |
2968 | ||
c906108c | 2969 | if (*tokstart == '$') |
cfeadda5 | 2970 | return DOLLAR_VARIABLE; |
48e32051 | 2971 | |
2a612529 | 2972 | if (pstate->parse_completion && *pstate->lexptr == '\0') |
48e32051 | 2973 | saw_name_at_eof = 1; |
e234dfaf TT |
2974 | |
2975 | yylval.ssym.stoken = yylval.sval; | |
d12307c1 PMR |
2976 | yylval.ssym.sym.symbol = NULL; |
2977 | yylval.ssym.sym.block = NULL; | |
e234dfaf | 2978 | yylval.ssym.is_a_field_of_this = 0; |
48e32051 TT |
2979 | return NAME; |
2980 | } | |
2981 | ||
2982 | /* An object of this type is pushed on a FIFO by the "outer" lexer. */ | |
5fe3f3e4 | 2983 | struct token_and_value |
48e32051 TT |
2984 | { |
2985 | int token; | |
e707a91d | 2986 | YYSTYPE value; |
5fe3f3e4 | 2987 | }; |
48e32051 TT |
2988 | |
2989 | /* A FIFO of tokens that have been read but not yet returned to the | |
2990 | parser. */ | |
5fe3f3e4 | 2991 | static std::vector<token_and_value> token_fifo; |
48e32051 TT |
2992 | |
2993 | /* Non-zero if the lexer should return tokens from the FIFO. */ | |
2994 | static int popping; | |
2995 | ||
2996 | /* Temporary storage for c_lex; this holds symbol names as they are | |
2997 | built up. */ | |
9519b2ee | 2998 | static auto_obstack name_obstack; |
48e32051 TT |
2999 | |
3000 | /* Classify a NAME token. The contents of the token are in `yylval'. | |
3001 | Updates yylval and returns the new token type. BLOCK is the block | |
805e1f19 TT |
3002 | in which lookups start; this can be NULL to mean the global scope. |
3003 | IS_QUOTED_NAME is non-zero if the name token was originally quoted | |
59498c30 LS |
3004 | in single quotes. IS_AFTER_STRUCTOP is true if this name follows |
3005 | a structure operator -- either '.' or ARROW */ | |
4d29c0a8 | 3006 | |
48e32051 | 3007 | static int |
410a0ff2 | 3008 | classify_name (struct parser_state *par_state, const struct block *block, |
59498c30 | 3009 | bool is_quoted_name, bool is_after_structop) |
48e32051 | 3010 | { |
d12307c1 | 3011 | struct block_symbol bsym; |
1993b719 | 3012 | struct field_of_this_result is_a_field_of_this; |
48e32051 | 3013 | |
61f4b350 | 3014 | std::string copy = copy_name (yylval.sval); |
48e32051 | 3015 | |
1993b719 TT |
3016 | /* Initialize this in case we *don't* use it in this call; that way |
3017 | we can refer to it unconditionally below. */ | |
3018 | memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this)); | |
3019 | ||
61f4b350 | 3020 | bsym = lookup_symbol (copy.c_str (), block, VAR_DOMAIN, |
5bae7c4e | 3021 | par_state->language ()->name_of_this () |
d12307c1 | 3022 | ? &is_a_field_of_this : NULL); |
48e32051 | 3023 | |
d12307c1 | 3024 | if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK) |
c906108c | 3025 | { |
d12307c1 | 3026 | yylval.ssym.sym = bsym; |
1993b719 | 3027 | yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL; |
48e32051 | 3028 | return BLOCKNAME; |
c906108c | 3029 | } |
d12307c1 | 3030 | else if (!bsym.symbol) |
48e32051 | 3031 | { |
6592e36f TT |
3032 | /* If we found a field of 'this', we might have erroneously |
3033 | found a constructor where we wanted a type name. Handle this | |
3034 | case by noticing that we found a constructor and then look up | |
3035 | the type tag instead. */ | |
3036 | if (is_a_field_of_this.type != NULL | |
3037 | && is_a_field_of_this.fn_field != NULL | |
3038 | && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields, | |
3039 | 0)) | |
3040 | { | |
3041 | struct field_of_this_result inner_is_a_field_of_this; | |
3042 | ||
61f4b350 | 3043 | bsym = lookup_symbol (copy.c_str (), block, STRUCT_DOMAIN, |
d12307c1 PMR |
3044 | &inner_is_a_field_of_this); |
3045 | if (bsym.symbol != NULL) | |
6592e36f | 3046 | { |
d12307c1 | 3047 | yylval.tsym.type = SYMBOL_TYPE (bsym.symbol); |
6592e36f TT |
3048 | return TYPENAME; |
3049 | } | |
3050 | } | |
805e1f19 | 3051 | |
59498c30 LS |
3052 | /* If we found a field on the "this" object, or we are looking |
3053 | up a field on a struct, then we want to prefer it over a | |
805e1f19 TT |
3054 | filename. However, if the name was quoted, then it is better |
3055 | to check for a filename or a block, since this is the only | |
3056 | way the user has of requiring the extension to be used. */ | |
59498c30 LS |
3057 | if ((is_a_field_of_this.type == NULL && !is_after_structop) |
3058 | || is_quoted_name) | |
805e1f19 TT |
3059 | { |
3060 | /* See if it's a file name. */ | |
3061 | struct symtab *symtab; | |
3062 | ||
61f4b350 | 3063 | symtab = lookup_symtab (copy.c_str ()); |
805e1f19 TT |
3064 | if (symtab) |
3065 | { | |
439247b6 | 3066 | yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab), |
805e1f19 TT |
3067 | STATIC_BLOCK); |
3068 | return FILENAME; | |
3069 | } | |
3070 | } | |
48e32051 | 3071 | } |
c906108c | 3072 | |
d12307c1 | 3073 | if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF) |
48e32051 | 3074 | { |
d12307c1 | 3075 | yylval.tsym.type = SYMBOL_TYPE (bsym.symbol); |
47663de5 | 3076 | return TYPENAME; |
48e32051 | 3077 | } |
c906108c | 3078 | |
f2e8016f | 3079 | /* See if it's an ObjC classname. */ |
73923d7e | 3080 | if (par_state->language ()->la_language == language_objc && !bsym.symbol) |
f2e8016f | 3081 | { |
61f4b350 TT |
3082 | CORE_ADDR Class = lookup_objc_class (par_state->gdbarch (), |
3083 | copy.c_str ()); | |
f2e8016f TT |
3084 | if (Class) |
3085 | { | |
d12307c1 PMR |
3086 | struct symbol *sym; |
3087 | ||
fe978cb0 | 3088 | yylval.theclass.theclass = Class; |
61f4b350 | 3089 | sym = lookup_struct_typedef (copy.c_str (), |
1e58a4a4 | 3090 | par_state->expression_context_block, 1); |
826f0041 | 3091 | if (sym) |
fe978cb0 | 3092 | yylval.theclass.type = SYMBOL_TYPE (sym); |
f2e8016f TT |
3093 | return CLASSNAME; |
3094 | } | |
3095 | } | |
3096 | ||
48e32051 TT |
3097 | /* Input names that aren't symbols but ARE valid hex numbers, when |
3098 | the input radix permits them, can be names or numbers depending | |
3099 | on the parse. Note we support radixes > 16 here. */ | |
d12307c1 | 3100 | if (!bsym.symbol |
48e32051 TT |
3101 | && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10) |
3102 | || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10))) | |
3103 | { | |
3104 | YYSTYPE newlval; /* Its value is ignored. */ | |
61f4b350 | 3105 | int hextype = parse_number (par_state, copy.c_str (), yylval.sval.length, |
410a0ff2 | 3106 | 0, &newlval); |
d12307c1 | 3107 | |
48e32051 TT |
3108 | if (hextype == INT) |
3109 | { | |
d12307c1 | 3110 | yylval.ssym.sym = bsym; |
1993b719 | 3111 | yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL; |
48e32051 TT |
3112 | return NAME_OR_INT; |
3113 | } | |
3114 | } | |
3115 | ||
3116 | /* Any other kind of symbol */ | |
d12307c1 | 3117 | yylval.ssym.sym = bsym; |
1993b719 | 3118 | yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL; |
7322dca9 | 3119 | |
d12307c1 | 3120 | if (bsym.symbol == NULL |
73923d7e | 3121 | && par_state->language ()->la_language == language_cplus |
1993b719 | 3122 | && is_a_field_of_this.type == NULL |
61f4b350 | 3123 | && lookup_minimal_symbol (copy.c_str (), NULL, NULL).minsym == NULL) |
7322dca9 SW |
3124 | return UNKNOWN_CPP_NAME; |
3125 | ||
48e32051 TT |
3126 | return NAME; |
3127 | } | |
c906108c | 3128 | |
48e32051 | 3129 | /* Like classify_name, but used by the inner loop of the lexer, when a |
e234dfaf TT |
3130 | name might have already been seen. CONTEXT is the context type, or |
3131 | NULL if this is the first component of a name. */ | |
50af5481 | 3132 | |
48e32051 | 3133 | static int |
410a0ff2 SDJ |
3134 | classify_inner_name (struct parser_state *par_state, |
3135 | const struct block *block, struct type *context) | |
48e32051 | 3136 | { |
df54f8eb | 3137 | struct type *type; |
48e32051 | 3138 | |
e234dfaf | 3139 | if (context == NULL) |
59498c30 | 3140 | return classify_name (par_state, block, false, false); |
48e32051 | 3141 | |
e234dfaf | 3142 | type = check_typedef (context); |
3d567982 | 3143 | if (!type_aggregate_p (type)) |
50af5481 | 3144 | return ERROR; |
48e32051 | 3145 | |
61f4b350 | 3146 | std::string copy = copy_name (yylval.ssym.stoken); |
4dcabcc2 | 3147 | /* N.B. We assume the symbol can only be in VAR_DOMAIN. */ |
61f4b350 TT |
3148 | yylval.ssym.sym = cp_lookup_nested_symbol (type, copy.c_str (), block, |
3149 | VAR_DOMAIN); | |
f7e3ecae KS |
3150 | |
3151 | /* If no symbol was found, search for a matching base class named | |
3152 | COPY. This will allow users to enter qualified names of class members | |
3153 | relative to the `this' pointer. */ | |
d12307c1 | 3154 | if (yylval.ssym.sym.symbol == NULL) |
f7e3ecae | 3155 | { |
61f4b350 TT |
3156 | struct type *base_type = cp_find_type_baseclass_by_name (type, |
3157 | copy.c_str ()); | |
f7e3ecae KS |
3158 | |
3159 | if (base_type != NULL) | |
3160 | { | |
3161 | yylval.tsym.type = base_type; | |
3162 | return TYPENAME; | |
3163 | } | |
3164 | ||
3165 | return ERROR; | |
3166 | } | |
50af5481 | 3167 | |
d12307c1 | 3168 | switch (SYMBOL_CLASS (yylval.ssym.sym.symbol)) |
50af5481 JK |
3169 | { |
3170 | case LOC_BLOCK: | |
3171 | case LOC_LABEL: | |
f7e3ecae KS |
3172 | /* cp_lookup_nested_symbol might have accidentally found a constructor |
3173 | named COPY when we really wanted a base class of the same name. | |
3174 | Double-check this case by looking for a base class. */ | |
3175 | { | |
61f4b350 TT |
3176 | struct type *base_type |
3177 | = cp_find_type_baseclass_by_name (type, copy.c_str ()); | |
f7e3ecae KS |
3178 | |
3179 | if (base_type != NULL) | |
3180 | { | |
3181 | yylval.tsym.type = base_type; | |
3182 | return TYPENAME; | |
3183 | } | |
3184 | } | |
50af5481 | 3185 | return ERROR; |
48e32051 | 3186 | |
50af5481 | 3187 | case LOC_TYPEDEF: |
d12307c1 | 3188 | yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol); |
50af5481 | 3189 | return TYPENAME; |
48e32051 | 3190 | |
50af5481 | 3191 | default: |
50af5481 JK |
3192 | return NAME; |
3193 | } | |
3194 | internal_error (__FILE__, __LINE__, _("not reached")); | |
48e32051 TT |
3195 | } |
3196 | ||
3197 | /* The outer level of a two-level lexer. This calls the inner lexer | |
3198 | to return tokens. It then either returns these tokens, or | |
3199 | aggregates them into a larger token. This lets us work around a | |
3200 | problem in our parsing approach, where the parser could not | |
3201 | distinguish between qualified names and qualified types at the | |
3202 | right point. | |
4d29c0a8 | 3203 | |
48e32051 TT |
3204 | This approach is still not ideal, because it mishandles template |
3205 | types. See the comment in lex_one_token for an example. However, | |
3206 | this is still an improvement over the earlier approach, and will | |
3207 | suffice until we move to better parsing technology. */ | |
4d29c0a8 | 3208 | |
48e32051 TT |
3209 | static int |
3210 | yylex (void) | |
3211 | { | |
3212 | token_and_value current; | |
b2f83c08 | 3213 | int first_was_coloncolon, last_was_coloncolon; |
e234dfaf | 3214 | struct type *context_type = NULL; |
b2f83c08 TT |
3215 | int last_to_examine, next_to_examine, checkpoint; |
3216 | const struct block *search_block; | |
59498c30 | 3217 | bool is_quoted_name, last_lex_was_structop; |
48e32051 | 3218 | |
5fe3f3e4 | 3219 | if (popping && !token_fifo.empty ()) |
b2f83c08 | 3220 | goto do_pop; |
48e32051 TT |
3221 | popping = 0; |
3222 | ||
59498c30 LS |
3223 | last_lex_was_structop = last_was_structop; |
3224 | ||
b2f83c08 TT |
3225 | /* Read the first token and decide what to do. Most of the |
3226 | subsequent code is C++-only; but also depends on seeing a "::" or | |
3227 | name-like token. */ | |
410a0ff2 | 3228 | current.token = lex_one_token (pstate, &is_quoted_name); |
48e32051 | 3229 | if (current.token == NAME) |
1e58a4a4 | 3230 | current.token = classify_name (pstate, pstate->expression_context_block, |
59498c30 | 3231 | is_quoted_name, last_lex_was_structop); |
73923d7e | 3232 | if (pstate->language ()->la_language != language_cplus |
b2f83c08 TT |
3233 | || (current.token != TYPENAME && current.token != COLONCOLON |
3234 | && current.token != FILENAME)) | |
48e32051 TT |
3235 | return current.token; |
3236 | ||
b2f83c08 TT |
3237 | /* Read any sequence of alternating "::" and name-like tokens into |
3238 | the token FIFO. */ | |
3239 | current.value = yylval; | |
5fe3f3e4 | 3240 | token_fifo.push_back (current); |
b2f83c08 TT |
3241 | last_was_coloncolon = current.token == COLONCOLON; |
3242 | while (1) | |
3243 | { | |
59498c30 | 3244 | bool ignore; |
805e1f19 TT |
3245 | |
3246 | /* We ignore quoted names other than the very first one. | |
3247 | Subsequent ones do not have any special meaning. */ | |
410a0ff2 | 3248 | current.token = lex_one_token (pstate, &ignore); |
b2f83c08 | 3249 | current.value = yylval; |
5fe3f3e4 | 3250 | token_fifo.push_back (current); |
b2f83c08 TT |
3251 | |
3252 | if ((last_was_coloncolon && current.token != NAME) | |
3253 | || (!last_was_coloncolon && current.token != COLONCOLON)) | |
3254 | break; | |
3255 | last_was_coloncolon = !last_was_coloncolon; | |
3256 | } | |
3257 | popping = 1; | |
3258 | ||
3259 | /* We always read one extra token, so compute the number of tokens | |
3260 | to examine accordingly. */ | |
5fe3f3e4 | 3261 | last_to_examine = token_fifo.size () - 2; |
b2f83c08 TT |
3262 | next_to_examine = 0; |
3263 | ||
5fe3f3e4 | 3264 | current = token_fifo[next_to_examine]; |
b2f83c08 TT |
3265 | ++next_to_examine; |
3266 | ||
8268c778 | 3267 | name_obstack.clear (); |
b2f83c08 TT |
3268 | checkpoint = 0; |
3269 | if (current.token == FILENAME) | |
3270 | search_block = current.value.bval; | |
3271 | else if (current.token == COLONCOLON) | |
3272 | search_block = NULL; | |
3273 | else | |
e234dfaf | 3274 | { |
b2f83c08 | 3275 | gdb_assert (current.token == TYPENAME); |
1e58a4a4 | 3276 | search_block = pstate->expression_context_block; |
b2f83c08 TT |
3277 | obstack_grow (&name_obstack, current.value.sval.ptr, |
3278 | current.value.sval.length); | |
3279 | context_type = current.value.tsym.type; | |
3280 | checkpoint = 1; | |
e234dfaf | 3281 | } |
b2f83c08 TT |
3282 | |
3283 | first_was_coloncolon = current.token == COLONCOLON; | |
3284 | last_was_coloncolon = first_was_coloncolon; | |
3285 | ||
3286 | while (next_to_examine <= last_to_examine) | |
48e32051 | 3287 | { |
5fe3f3e4 | 3288 | token_and_value next; |
48e32051 | 3289 | |
5fe3f3e4 | 3290 | next = token_fifo[next_to_examine]; |
b2f83c08 | 3291 | ++next_to_examine; |
48e32051 | 3292 | |
5fe3f3e4 | 3293 | if (next.token == NAME && last_was_coloncolon) |
48e32051 TT |
3294 | { |
3295 | int classification; | |
3296 | ||
5fe3f3e4 | 3297 | yylval = next.value; |
410a0ff2 SDJ |
3298 | classification = classify_inner_name (pstate, search_block, |
3299 | context_type); | |
48e32051 TT |
3300 | /* We keep going until we either run out of names, or until |
3301 | we have a qualified name which is not a type. */ | |
50af5481 | 3302 | if (classification != TYPENAME && classification != NAME) |
b2f83c08 TT |
3303 | break; |
3304 | ||
3305 | /* Accept up to this token. */ | |
3306 | checkpoint = next_to_examine; | |
48e32051 TT |
3307 | |
3308 | /* Update the partial name we are constructing. */ | |
e234dfaf | 3309 | if (context_type != NULL) |
48e32051 TT |
3310 | { |
3311 | /* We don't want to put a leading "::" into the name. */ | |
3312 | obstack_grow_str (&name_obstack, "::"); | |
3313 | } | |
5fe3f3e4 TT |
3314 | obstack_grow (&name_obstack, next.value.sval.ptr, |
3315 | next.value.sval.length); | |
48e32051 | 3316 | |
79f33898 | 3317 | yylval.sval.ptr = (const char *) obstack_base (&name_obstack); |
48e32051 TT |
3318 | yylval.sval.length = obstack_object_size (&name_obstack); |
3319 | current.value = yylval; | |
3320 | current.token = classification; | |
3321 | ||
3322 | last_was_coloncolon = 0; | |
4d29c0a8 | 3323 | |
e234dfaf TT |
3324 | if (classification == NAME) |
3325 | break; | |
3326 | ||
3327 | context_type = yylval.tsym.type; | |
48e32051 | 3328 | } |
5fe3f3e4 | 3329 | else if (next.token == COLONCOLON && !last_was_coloncolon) |
48e32051 TT |
3330 | last_was_coloncolon = 1; |
3331 | else | |
3332 | { | |
3333 | /* We've reached the end of the name. */ | |
48e32051 TT |
3334 | break; |
3335 | } | |
48e32051 TT |
3336 | } |
3337 | ||
b2f83c08 TT |
3338 | /* If we have a replacement token, install it as the first token in |
3339 | the FIFO, and delete the other constituent tokens. */ | |
3340 | if (checkpoint > 0) | |
48e32051 | 3341 | { |
224c3ddb | 3342 | current.value.sval.ptr |
0cf9feb9 TT |
3343 | = obstack_strndup (&cpstate->expansion_obstack, |
3344 | current.value.sval.ptr, | |
3345 | current.value.sval.length); | |
b2f83c08 | 3346 | |
5fe3f3e4 | 3347 | token_fifo[0] = current; |
b2f83c08 | 3348 | if (checkpoint > 1) |
5fe3f3e4 TT |
3349 | token_fifo.erase (token_fifo.begin () + 1, |
3350 | token_fifo.begin () + checkpoint); | |
48e32051 TT |
3351 | } |
3352 | ||
b2f83c08 | 3353 | do_pop: |
5fe3f3e4 TT |
3354 | current = token_fifo[0]; |
3355 | token_fifo.erase (token_fifo.begin ()); | |
48e32051 | 3356 | yylval = current.value; |
48e32051 | 3357 | return current.token; |
c906108c SS |
3358 | } |
3359 | ||
65d12d83 | 3360 | int |
410a0ff2 | 3361 | c_parse (struct parser_state *par_state) |
65d12d83 | 3362 | { |
410a0ff2 | 3363 | /* Setting up the parser state. */ |
eae49211 | 3364 | scoped_restore pstate_restore = make_scoped_restore (&pstate); |
410a0ff2 SDJ |
3365 | gdb_assert (par_state != NULL); |
3366 | pstate = par_state; | |
3367 | ||
02e12e38 TT |
3368 | c_parse_state cstate; |
3369 | scoped_restore cstate_restore = make_scoped_restore (&cpstate, &cstate); | |
3370 | ||
f6c2623e | 3371 | gdb::unique_xmalloc_ptr<struct macro_scope> macro_scope; |
7c8adf68 | 3372 | |
1e58a4a4 TT |
3373 | if (par_state->expression_context_block) |
3374 | macro_scope | |
3375 | = sal_macro_scope (find_pc_line (par_state->expression_context_pc, 0)); | |
7c8adf68 | 3376 | else |
f6c2623e TT |
3377 | macro_scope = default_macro_scope (); |
3378 | if (! macro_scope) | |
3379 | macro_scope = user_macro_scope (); | |
3380 | ||
3381 | scoped_restore restore_macro_scope | |
3382 | = make_scoped_restore (&expression_macro_scope, macro_scope.get ()); | |
7c8adf68 | 3383 | |
156d9eab TT |
3384 | scoped_restore restore_yydebug = make_scoped_restore (&yydebug, |
3385 | parser_debug); | |
92981e24 | 3386 | |
7c8adf68 | 3387 | /* Initialize some state used by the lexer. */ |
59498c30 | 3388 | last_was_structop = false; |
65d12d83 | 3389 | saw_name_at_eof = 0; |
28aaf3fd | 3390 | paren_depth = 0; |
7c8adf68 | 3391 | |
5fe3f3e4 | 3392 | token_fifo.clear (); |
48e32051 | 3393 | popping = 0; |
8268c778 | 3394 | name_obstack.clear (); |
48e32051 | 3395 | |
9d30e1fd | 3396 | return yyparse (); |
65d12d83 TT |
3397 | } |
3398 | ||
12c5175d MK |
3399 | #ifdef YYBISON |
3400 | ||
9507860e TT |
3401 | /* This is called via the YYPRINT macro when parser debugging is |
3402 | enabled. It prints a token's value. */ | |
3403 | ||
3404 | static void | |
3405 | c_print_token (FILE *file, int type, YYSTYPE value) | |
3406 | { | |
3407 | switch (type) | |
3408 | { | |
3409 | case INT: | |
66be918f PA |
3410 | parser_fprintf (file, "typed_val_int<%s, %s>", |
3411 | TYPE_SAFE_NAME (value.typed_val_int.type), | |
3412 | pulongest (value.typed_val_int.val)); | |
9507860e TT |
3413 | break; |
3414 | ||
3415 | case CHAR: | |
3416 | case STRING: | |
3417 | { | |
224c3ddb | 3418 | char *copy = (char *) alloca (value.tsval.length + 1); |
9507860e TT |
3419 | |
3420 | memcpy (copy, value.tsval.ptr, value.tsval.length); | |
3421 | copy[value.tsval.length] = '\0'; | |
3422 | ||
66be918f | 3423 | parser_fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy); |
9507860e TT |
3424 | } |
3425 | break; | |
3426 | ||
3427 | case NSSTRING: | |
cfeadda5 | 3428 | case DOLLAR_VARIABLE: |
61f4b350 | 3429 | parser_fprintf (file, "sval<%s>", copy_name (value.sval).c_str ()); |
9507860e TT |
3430 | break; |
3431 | ||
3432 | case TYPENAME: | |
66be918f PA |
3433 | parser_fprintf (file, "tsym<type=%s, name=%s>", |
3434 | TYPE_SAFE_NAME (value.tsym.type), | |
61f4b350 | 3435 | copy_name (value.tsym.stoken).c_str ()); |
9507860e TT |
3436 | break; |
3437 | ||
3438 | case NAME: | |
3439 | case UNKNOWN_CPP_NAME: | |
3440 | case NAME_OR_INT: | |
3441 | case BLOCKNAME: | |
66be918f | 3442 | parser_fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>", |
61f4b350 | 3443 | copy_name (value.ssym.stoken).c_str (), |
66be918f | 3444 | (value.ssym.sym.symbol == NULL |
987012b8 | 3445 | ? "(null)" : value.ssym.sym.symbol->print_name ()), |
66be918f | 3446 | value.ssym.is_a_field_of_this); |
9507860e TT |
3447 | break; |
3448 | ||
3449 | case FILENAME: | |
66be918f | 3450 | parser_fprintf (file, "bval<%s>", host_address_to_string (value.bval)); |
9507860e TT |
3451 | break; |
3452 | } | |
3453 | } | |
7c8adf68 | 3454 | |
12c5175d MK |
3455 | #endif |
3456 | ||
69d340c6 | 3457 | static void |
a121b7c1 | 3458 | yyerror (const char *msg) |
c906108c | 3459 | { |
5776fca3 TT |
3460 | if (pstate->prev_lexptr) |
3461 | pstate->lexptr = pstate->prev_lexptr; | |
665132f9 | 3462 | |
5776fca3 | 3463 | error (_("A %s in expression, near `%s'."), msg, pstate->lexptr); |
c906108c | 3464 | } |