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