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