2006-12-06 Jim Blandy <jimb@codesourcery.com>
[deliverable/binutils-gdb.git] / gdb / p-exp.y
1 /* YACC parser for Pascal expressions, for GDB.
2 Copyright (C) 2000, 2006
3 Free Software Foundation, Inc.
4
5 This file is part of GDB.
6
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
11
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
21
22 /* This file is derived from c-exp.y */
23
24 /* Parse a Pascal expression from text in a string,
25 and return the result as a struct expression pointer.
26 That structure contains arithmetic operations in reverse polish,
27 with constants represented by operations that are followed by special data.
28 See expression.h for the details of the format.
29 What is important here is that it can be built up sequentially
30 during the process of parsing; the lower levels of the tree always
31 come first in the result.
32
33 Note that malloc's and realloc's in this file are transformed to
34 xmalloc and xrealloc respectively by the same sed command in the
35 makefile that remaps any other malloc/realloc inserted by the parser
36 generator. Doing this with #defines and trying to control the interaction
37 with include files (<malloc.h> and <stdlib.h> for example) just became
38 too messy, particularly when such includes can be inserted at random
39 times by the parser generator. */
40
41 /* Known bugs or limitations:
42 - pascal string operations are not supported at all.
43 - there are some problems with boolean types.
44 - Pascal type hexadecimal constants are not supported
45 because they conflict with the internal variables format.
46 Probably also lots of other problems, less well defined PM */
47 %{
48
49 #include "defs.h"
50 #include "gdb_string.h"
51 #include <ctype.h>
52 #include "expression.h"
53 #include "value.h"
54 #include "parser-defs.h"
55 #include "language.h"
56 #include "p-lang.h"
57 #include "bfd.h" /* Required by objfiles.h. */
58 #include "symfile.h" /* Required by objfiles.h. */
59 #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
60 #include "block.h"
61
62 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
63 as well as gratuitiously global symbol names, so we can have multiple
64 yacc generated parsers in gdb. Note that these are only the variables
65 produced by yacc. If other parser generators (bison, byacc, etc) produce
66 additional global names that conflict at link time, then those parser
67 generators need to be fixed instead of adding those names to this list. */
68
69 #define yymaxdepth pascal_maxdepth
70 #define yyparse pascal_parse
71 #define yylex pascal_lex
72 #define yyerror pascal_error
73 #define yylval pascal_lval
74 #define yychar pascal_char
75 #define yydebug pascal_debug
76 #define yypact pascal_pact
77 #define yyr1 pascal_r1
78 #define yyr2 pascal_r2
79 #define yydef pascal_def
80 #define yychk pascal_chk
81 #define yypgo pascal_pgo
82 #define yyact pascal_act
83 #define yyexca pascal_exca
84 #define yyerrflag pascal_errflag
85 #define yynerrs pascal_nerrs
86 #define yyps pascal_ps
87 #define yypv pascal_pv
88 #define yys pascal_s
89 #define yy_yys pascal_yys
90 #define yystate pascal_state
91 #define yytmp pascal_tmp
92 #define yyv pascal_v
93 #define yy_yyv pascal_yyv
94 #define yyval pascal_val
95 #define yylloc pascal_lloc
96 #define yyreds pascal_reds /* With YYDEBUG defined */
97 #define yytoks pascal_toks /* With YYDEBUG defined */
98 #define yyname pascal_name /* With YYDEBUG defined */
99 #define yyrule pascal_rule /* With YYDEBUG defined */
100 #define yylhs pascal_yylhs
101 #define yylen pascal_yylen
102 #define yydefred pascal_yydefred
103 #define yydgoto pascal_yydgoto
104 #define yysindex pascal_yysindex
105 #define yyrindex pascal_yyrindex
106 #define yygindex pascal_yygindex
107 #define yytable pascal_yytable
108 #define yycheck pascal_yycheck
109
110 #ifndef YYDEBUG
111 #define YYDEBUG 1 /* Default to yydebug support */
112 #endif
113
114 #define YYFPRINTF parser_fprintf
115
116 int yyparse (void);
117
118 static int yylex (void);
119
120 void
121 yyerror (char *);
122
123 static char * uptok (char *, int);
124 %}
125
126 /* Although the yacc "value" of an expression is not used,
127 since the result is stored in the structure being created,
128 other node types do have values. */
129
130 %union
131 {
132 LONGEST lval;
133 struct {
134 LONGEST val;
135 struct type *type;
136 } typed_val_int;
137 struct {
138 DOUBLEST dval;
139 struct type *type;
140 } typed_val_float;
141 struct symbol *sym;
142 struct type *tval;
143 struct stoken sval;
144 struct ttype tsym;
145 struct symtoken ssym;
146 int voidval;
147 struct block *bval;
148 enum exp_opcode opcode;
149 struct internalvar *ivar;
150
151 struct type **tvec;
152 int *ivec;
153 }
154
155 %{
156 /* YYSTYPE gets defined by %union */
157 static int
158 parse_number (char *, int, int, YYSTYPE *);
159
160 static struct type *current_type;
161
162 static void push_current_type (void);
163 static void pop_current_type (void);
164 static int search_field;
165 %}
166
167 %type <voidval> exp exp1 type_exp start normal_start variable qualified_name
168 %type <tval> type typebase
169 /* %type <bval> block */
170
171 /* Fancy type parsing. */
172 %type <tval> ptype
173
174 %token <typed_val_int> INT
175 %token <typed_val_float> FLOAT
176
177 /* Both NAME and TYPENAME tokens represent symbols in the input,
178 and both convey their data as strings.
179 But a TYPENAME is a string that happens to be defined as a typedef
180 or builtin type name (such as int or char)
181 and a NAME is any other symbol.
182 Contexts where this distinction is not important can use the
183 nonterminal "name", which matches either NAME or TYPENAME. */
184
185 %token <sval> STRING
186 %token <sval> FIELDNAME
187 %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */
188 %token <tsym> TYPENAME
189 %type <sval> name
190 %type <ssym> name_not_typename
191
192 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
193 but which would parse as a valid number in the current input radix.
194 E.g. "c" when input_radix==16. Depending on the parse, it will be
195 turned into a name or into a number. */
196
197 %token <ssym> NAME_OR_INT
198
199 %token STRUCT CLASS SIZEOF COLONCOLON
200 %token ERROR
201
202 /* Special type cases, put in to allow the parser to distinguish different
203 legal basetypes. */
204
205 %token <voidval> VARIABLE
206
207
208 /* Object pascal */
209 %token THIS
210 %token <lval> TRUEKEYWORD FALSEKEYWORD
211
212 %left ','
213 %left ABOVE_COMMA
214 %right ASSIGN
215 %left NOT
216 %left OR
217 %left XOR
218 %left ANDAND
219 %left '=' NOTEQUAL
220 %left '<' '>' LEQ GEQ
221 %left LSH RSH DIV MOD
222 %left '@'
223 %left '+' '-'
224 %left '*' '/'
225 %right UNARY INCREMENT DECREMENT
226 %right ARROW '.' '[' '('
227 %left '^'
228 %token <ssym> BLOCKNAME
229 %type <bval> block
230 %left COLONCOLON
231
232 \f
233 %%
234
235 start : { current_type = NULL;
236 search_field = 0;
237 }
238 normal_start {}
239 ;
240
241 normal_start :
242 exp1
243 | type_exp
244 ;
245
246 type_exp: type
247 { write_exp_elt_opcode(OP_TYPE);
248 write_exp_elt_type($1);
249 write_exp_elt_opcode(OP_TYPE);
250 current_type = $1; } ;
251
252 /* Expressions, including the comma operator. */
253 exp1 : exp
254 | exp1 ',' exp
255 { write_exp_elt_opcode (BINOP_COMMA); }
256 ;
257
258 /* Expressions, not including the comma operator. */
259 exp : exp '^' %prec UNARY
260 { write_exp_elt_opcode (UNOP_IND);
261 if (current_type)
262 current_type = TYPE_TARGET_TYPE (current_type); }
263 ;
264
265 exp : '@' exp %prec UNARY
266 { write_exp_elt_opcode (UNOP_ADDR);
267 if (current_type)
268 current_type = TYPE_POINTER_TYPE (current_type); }
269 ;
270
271 exp : '-' exp %prec UNARY
272 { write_exp_elt_opcode (UNOP_NEG); }
273 ;
274
275 exp : NOT exp %prec UNARY
276 { write_exp_elt_opcode (UNOP_LOGICAL_NOT); }
277 ;
278
279 exp : INCREMENT '(' exp ')' %prec UNARY
280 { write_exp_elt_opcode (UNOP_PREINCREMENT); }
281 ;
282
283 exp : DECREMENT '(' exp ')' %prec UNARY
284 { write_exp_elt_opcode (UNOP_PREDECREMENT); }
285 ;
286
287 exp : exp '.' { search_field = 1; }
288 FIELDNAME
289 /* name */
290 { write_exp_elt_opcode (STRUCTOP_STRUCT);
291 write_exp_string ($4);
292 write_exp_elt_opcode (STRUCTOP_STRUCT);
293 search_field = 0;
294 if (current_type)
295 { while (TYPE_CODE (current_type) == TYPE_CODE_PTR)
296 current_type = TYPE_TARGET_TYPE (current_type);
297 current_type = lookup_struct_elt_type (
298 current_type, $4.ptr, 0); };
299 } ;
300 exp : exp '['
301 /* We need to save the current_type value */
302 { char *arrayname;
303 int arrayfieldindex;
304 arrayfieldindex = is_pascal_string_type (
305 current_type, NULL, NULL,
306 NULL, NULL, &arrayname);
307 if (arrayfieldindex)
308 {
309 struct stoken stringsval;
310 stringsval.ptr = alloca (strlen (arrayname) + 1);
311 stringsval.length = strlen (arrayname);
312 strcpy (stringsval.ptr, arrayname);
313 current_type = TYPE_FIELD_TYPE (current_type,
314 arrayfieldindex - 1);
315 write_exp_elt_opcode (STRUCTOP_STRUCT);
316 write_exp_string (stringsval);
317 write_exp_elt_opcode (STRUCTOP_STRUCT);
318 }
319 push_current_type (); }
320 exp1 ']'
321 { pop_current_type ();
322 write_exp_elt_opcode (BINOP_SUBSCRIPT);
323 if (current_type)
324 current_type = TYPE_TARGET_TYPE (current_type); }
325 ;
326
327 exp : exp '('
328 /* This is to save the value of arglist_len
329 being accumulated by an outer function call. */
330 { push_current_type ();
331 start_arglist (); }
332 arglist ')' %prec ARROW
333 { write_exp_elt_opcode (OP_FUNCALL);
334 write_exp_elt_longcst ((LONGEST) end_arglist ());
335 write_exp_elt_opcode (OP_FUNCALL);
336 pop_current_type (); }
337 ;
338
339 arglist :
340 | exp
341 { arglist_len = 1; }
342 | arglist ',' exp %prec ABOVE_COMMA
343 { arglist_len++; }
344 ;
345
346 exp : type '(' exp ')' %prec UNARY
347 { if (current_type)
348 {
349 /* Allow automatic dereference of classes. */
350 if ((TYPE_CODE (current_type) == TYPE_CODE_PTR)
351 && (TYPE_CODE (TYPE_TARGET_TYPE (current_type)) == TYPE_CODE_CLASS)
352 && (TYPE_CODE ($1) == TYPE_CODE_CLASS))
353 write_exp_elt_opcode (UNOP_IND);
354 }
355 write_exp_elt_opcode (UNOP_CAST);
356 write_exp_elt_type ($1);
357 write_exp_elt_opcode (UNOP_CAST);
358 current_type = $1; }
359 ;
360
361 exp : '(' exp1 ')'
362 { }
363 ;
364
365 /* Binary operators in order of decreasing precedence. */
366
367 exp : exp '*' exp
368 { write_exp_elt_opcode (BINOP_MUL); }
369 ;
370
371 exp : exp '/' exp
372 { write_exp_elt_opcode (BINOP_DIV); }
373 ;
374
375 exp : exp DIV exp
376 { write_exp_elt_opcode (BINOP_INTDIV); }
377 ;
378
379 exp : exp MOD exp
380 { write_exp_elt_opcode (BINOP_REM); }
381 ;
382
383 exp : exp '+' exp
384 { write_exp_elt_opcode (BINOP_ADD); }
385 ;
386
387 exp : exp '-' exp
388 { write_exp_elt_opcode (BINOP_SUB); }
389 ;
390
391 exp : exp LSH exp
392 { write_exp_elt_opcode (BINOP_LSH); }
393 ;
394
395 exp : exp RSH exp
396 { write_exp_elt_opcode (BINOP_RSH); }
397 ;
398
399 exp : exp '=' exp
400 { write_exp_elt_opcode (BINOP_EQUAL); }
401 ;
402
403 exp : exp NOTEQUAL exp
404 { write_exp_elt_opcode (BINOP_NOTEQUAL); }
405 ;
406
407 exp : exp LEQ exp
408 { write_exp_elt_opcode (BINOP_LEQ); }
409 ;
410
411 exp : exp GEQ exp
412 { write_exp_elt_opcode (BINOP_GEQ); }
413 ;
414
415 exp : exp '<' exp
416 { write_exp_elt_opcode (BINOP_LESS); }
417 ;
418
419 exp : exp '>' exp
420 { write_exp_elt_opcode (BINOP_GTR); }
421 ;
422
423 exp : exp ANDAND exp
424 { write_exp_elt_opcode (BINOP_BITWISE_AND); }
425 ;
426
427 exp : exp XOR exp
428 { write_exp_elt_opcode (BINOP_BITWISE_XOR); }
429 ;
430
431 exp : exp OR exp
432 { write_exp_elt_opcode (BINOP_BITWISE_IOR); }
433 ;
434
435 exp : exp ASSIGN exp
436 { write_exp_elt_opcode (BINOP_ASSIGN); }
437 ;
438
439 exp : TRUEKEYWORD
440 { write_exp_elt_opcode (OP_BOOL);
441 write_exp_elt_longcst ((LONGEST) $1);
442 write_exp_elt_opcode (OP_BOOL); }
443 ;
444
445 exp : FALSEKEYWORD
446 { write_exp_elt_opcode (OP_BOOL);
447 write_exp_elt_longcst ((LONGEST) $1);
448 write_exp_elt_opcode (OP_BOOL); }
449 ;
450
451 exp : INT
452 { write_exp_elt_opcode (OP_LONG);
453 write_exp_elt_type ($1.type);
454 write_exp_elt_longcst ((LONGEST)($1.val));
455 write_exp_elt_opcode (OP_LONG); }
456 ;
457
458 exp : NAME_OR_INT
459 { YYSTYPE val;
460 parse_number ($1.stoken.ptr, $1.stoken.length, 0, &val);
461 write_exp_elt_opcode (OP_LONG);
462 write_exp_elt_type (val.typed_val_int.type);
463 write_exp_elt_longcst ((LONGEST)val.typed_val_int.val);
464 write_exp_elt_opcode (OP_LONG);
465 }
466 ;
467
468
469 exp : FLOAT
470 { write_exp_elt_opcode (OP_DOUBLE);
471 write_exp_elt_type ($1.type);
472 write_exp_elt_dblcst ($1.dval);
473 write_exp_elt_opcode (OP_DOUBLE); }
474 ;
475
476 exp : variable
477 ;
478
479 exp : VARIABLE
480 /* Already written by write_dollar_variable. */
481 ;
482
483 exp : SIZEOF '(' type ')' %prec UNARY
484 { write_exp_elt_opcode (OP_LONG);
485 write_exp_elt_type (builtin_type_int);
486 CHECK_TYPEDEF ($3);
487 write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3));
488 write_exp_elt_opcode (OP_LONG); }
489 ;
490
491 exp : STRING
492 { /* C strings are converted into array constants with
493 an explicit null byte added at the end. Thus
494 the array upper bound is the string length.
495 There is no such thing in C as a completely empty
496 string. */
497 char *sp = $1.ptr; int count = $1.length;
498 while (count-- > 0)
499 {
500 write_exp_elt_opcode (OP_LONG);
501 write_exp_elt_type (builtin_type_char);
502 write_exp_elt_longcst ((LONGEST)(*sp++));
503 write_exp_elt_opcode (OP_LONG);
504 }
505 write_exp_elt_opcode (OP_LONG);
506 write_exp_elt_type (builtin_type_char);
507 write_exp_elt_longcst ((LONGEST)'\0');
508 write_exp_elt_opcode (OP_LONG);
509 write_exp_elt_opcode (OP_ARRAY);
510 write_exp_elt_longcst ((LONGEST) 0);
511 write_exp_elt_longcst ((LONGEST) ($1.length));
512 write_exp_elt_opcode (OP_ARRAY); }
513 ;
514
515 /* Object pascal */
516 exp : THIS
517 {
518 struct value * this_val;
519 struct type * this_type;
520 write_exp_elt_opcode (OP_THIS);
521 write_exp_elt_opcode (OP_THIS);
522 /* we need type of this */
523 this_val = value_of_this (0);
524 if (this_val)
525 this_type = value_type (this_val);
526 else
527 this_type = NULL;
528 if (this_type)
529 {
530 if (TYPE_CODE (this_type) == TYPE_CODE_PTR)
531 {
532 this_type = TYPE_TARGET_TYPE (this_type);
533 write_exp_elt_opcode (UNOP_IND);
534 }
535 }
536
537 current_type = this_type;
538 }
539 ;
540
541 /* end of object pascal. */
542
543 block : BLOCKNAME
544 {
545 if ($1.sym != 0)
546 $$ = SYMBOL_BLOCK_VALUE ($1.sym);
547 else
548 {
549 struct symtab *tem =
550 lookup_symtab (copy_name ($1.stoken));
551 if (tem)
552 $$ = BLOCKVECTOR_BLOCK (BLOCKVECTOR (tem), STATIC_BLOCK);
553 else
554 error ("No file or function \"%s\".",
555 copy_name ($1.stoken));
556 }
557 }
558 ;
559
560 block : block COLONCOLON name
561 { struct symbol *tem
562 = lookup_symbol (copy_name ($3), $1,
563 VAR_DOMAIN, (int *) NULL,
564 (struct symtab **) NULL);
565 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
566 error ("No function \"%s\" in specified context.",
567 copy_name ($3));
568 $$ = SYMBOL_BLOCK_VALUE (tem); }
569 ;
570
571 variable: block COLONCOLON name
572 { struct symbol *sym;
573 sym = lookup_symbol (copy_name ($3), $1,
574 VAR_DOMAIN, (int *) NULL,
575 (struct symtab **) NULL);
576 if (sym == 0)
577 error ("No symbol \"%s\" in specified context.",
578 copy_name ($3));
579
580 write_exp_elt_opcode (OP_VAR_VALUE);
581 /* block_found is set by lookup_symbol. */
582 write_exp_elt_block (block_found);
583 write_exp_elt_sym (sym);
584 write_exp_elt_opcode (OP_VAR_VALUE); }
585 ;
586
587 qualified_name: typebase COLONCOLON name
588 {
589 struct type *type = $1;
590 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
591 && TYPE_CODE (type) != TYPE_CODE_UNION)
592 error ("`%s' is not defined as an aggregate type.",
593 TYPE_NAME (type));
594
595 write_exp_elt_opcode (OP_SCOPE);
596 write_exp_elt_type (type);
597 write_exp_string ($3);
598 write_exp_elt_opcode (OP_SCOPE);
599 }
600 ;
601
602 variable: qualified_name
603 | COLONCOLON name
604 {
605 char *name = copy_name ($2);
606 struct symbol *sym;
607 struct minimal_symbol *msymbol;
608
609 sym =
610 lookup_symbol (name, (const struct block *) NULL,
611 VAR_DOMAIN, (int *) NULL,
612 (struct symtab **) NULL);
613 if (sym)
614 {
615 write_exp_elt_opcode (OP_VAR_VALUE);
616 write_exp_elt_block (NULL);
617 write_exp_elt_sym (sym);
618 write_exp_elt_opcode (OP_VAR_VALUE);
619 break;
620 }
621
622 msymbol = lookup_minimal_symbol (name, NULL, NULL);
623 if (msymbol != NULL)
624 {
625 write_exp_msymbol (msymbol,
626 lookup_function_type (builtin_type_int),
627 builtin_type_int);
628 }
629 else
630 if (!have_full_symbols () && !have_partial_symbols ())
631 error ("No symbol table is loaded. Use the \"file\" command.");
632 else
633 error ("No symbol \"%s\" in current context.", name);
634 }
635 ;
636
637 variable: name_not_typename
638 { struct symbol *sym = $1.sym;
639
640 if (sym)
641 {
642 if (symbol_read_needs_frame (sym))
643 {
644 if (innermost_block == 0 ||
645 contained_in (block_found,
646 innermost_block))
647 innermost_block = block_found;
648 }
649
650 write_exp_elt_opcode (OP_VAR_VALUE);
651 /* We want to use the selected frame, not
652 another more inner frame which happens to
653 be in the same block. */
654 write_exp_elt_block (NULL);
655 write_exp_elt_sym (sym);
656 write_exp_elt_opcode (OP_VAR_VALUE);
657 current_type = sym->type; }
658 else if ($1.is_a_field_of_this)
659 {
660 struct value * this_val;
661 struct type * this_type;
662 /* Object pascal: it hangs off of `this'. Must
663 not inadvertently convert from a method call
664 to data ref. */
665 if (innermost_block == 0 ||
666 contained_in (block_found, innermost_block))
667 innermost_block = block_found;
668 write_exp_elt_opcode (OP_THIS);
669 write_exp_elt_opcode (OP_THIS);
670 write_exp_elt_opcode (STRUCTOP_PTR);
671 write_exp_string ($1.stoken);
672 write_exp_elt_opcode (STRUCTOP_PTR);
673 /* we need type of this */
674 this_val = value_of_this (0);
675 if (this_val)
676 this_type = value_type (this_val);
677 else
678 this_type = NULL;
679 if (this_type)
680 current_type = lookup_struct_elt_type (
681 this_type,
682 copy_name ($1.stoken), 0);
683 else
684 current_type = NULL;
685 }
686 else
687 {
688 struct minimal_symbol *msymbol;
689 char *arg = copy_name ($1.stoken);
690
691 msymbol =
692 lookup_minimal_symbol (arg, NULL, NULL);
693 if (msymbol != NULL)
694 {
695 write_exp_msymbol (msymbol,
696 lookup_function_type (builtin_type_int),
697 builtin_type_int);
698 }
699 else if (!have_full_symbols () && !have_partial_symbols ())
700 error ("No symbol table is loaded. Use the \"file\" command.");
701 else
702 error ("No symbol \"%s\" in current context.",
703 copy_name ($1.stoken));
704 }
705 }
706 ;
707
708
709 ptype : typebase
710 ;
711
712 /* We used to try to recognize more pointer to member types here, but
713 that didn't work (shift/reduce conflicts meant that these rules never
714 got executed). The problem is that
715 int (foo::bar::baz::bizzle)
716 is a function type but
717 int (foo::bar::baz::bizzle::*)
718 is a pointer to member type. Stroustrup loses again! */
719
720 type : ptype
721 ;
722
723 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
724 : '^' typebase
725 { $$ = lookup_pointer_type ($2); }
726 | TYPENAME
727 { $$ = $1.type; }
728 | STRUCT name
729 { $$ = lookup_struct (copy_name ($2),
730 expression_context_block); }
731 | CLASS name
732 { $$ = lookup_struct (copy_name ($2),
733 expression_context_block); }
734 /* "const" and "volatile" are curently ignored. A type qualifier
735 after the type is handled in the ptype rule. I think these could
736 be too. */
737 ;
738
739 name : NAME { $$ = $1.stoken; }
740 | BLOCKNAME { $$ = $1.stoken; }
741 | TYPENAME { $$ = $1.stoken; }
742 | NAME_OR_INT { $$ = $1.stoken; }
743 ;
744
745 name_not_typename : NAME
746 | BLOCKNAME
747 /* These would be useful if name_not_typename was useful, but it is just
748 a fake for "variable", so these cause reduce/reduce conflicts because
749 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
750 =exp) or just an exp. If name_not_typename was ever used in an lvalue
751 context where only a name could occur, this might be useful.
752 | NAME_OR_INT
753 */
754 ;
755
756 %%
757
758 /* Take care of parsing a number (anything that starts with a digit).
759 Set yylval and return the token type; update lexptr.
760 LEN is the number of characters in it. */
761
762 /*** Needs some error checking for the float case ***/
763
764 static int
765 parse_number (p, len, parsed_float, putithere)
766 char *p;
767 int len;
768 int parsed_float;
769 YYSTYPE *putithere;
770 {
771 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
772 here, and we do kind of silly things like cast to unsigned. */
773 LONGEST n = 0;
774 LONGEST prevn = 0;
775 ULONGEST un;
776
777 int i = 0;
778 int c;
779 int base = input_radix;
780 int unsigned_p = 0;
781
782 /* Number of "L" suffixes encountered. */
783 int long_p = 0;
784
785 /* We have found a "L" or "U" suffix. */
786 int found_suffix = 0;
787
788 ULONGEST high_bit;
789 struct type *signed_type;
790 struct type *unsigned_type;
791
792 if (parsed_float)
793 {
794 /* It's a float since it contains a point or an exponent. */
795 char c;
796 int num = 0; /* number of tokens scanned by scanf */
797 char saved_char = p[len];
798
799 p[len] = 0; /* null-terminate the token */
800 num = sscanf (p, DOUBLEST_SCAN_FORMAT "%c",
801 &putithere->typed_val_float.dval, &c);
802 p[len] = saved_char; /* restore the input stream */
803 if (num != 1) /* check scanf found ONLY a float ... */
804 return ERROR;
805 /* See if it has `f' or `l' suffix (float or long double). */
806
807 c = tolower (p[len - 1]);
808
809 if (c == 'f')
810 putithere->typed_val_float.type = builtin_type_float;
811 else if (c == 'l')
812 putithere->typed_val_float.type = builtin_type_long_double;
813 else if (isdigit (c) || c == '.')
814 putithere->typed_val_float.type = builtin_type_double;
815 else
816 return ERROR;
817
818 return FLOAT;
819 }
820
821 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
822 if (p[0] == '0')
823 switch (p[1])
824 {
825 case 'x':
826 case 'X':
827 if (len >= 3)
828 {
829 p += 2;
830 base = 16;
831 len -= 2;
832 }
833 break;
834
835 case 't':
836 case 'T':
837 case 'd':
838 case 'D':
839 if (len >= 3)
840 {
841 p += 2;
842 base = 10;
843 len -= 2;
844 }
845 break;
846
847 default:
848 base = 8;
849 break;
850 }
851
852 while (len-- > 0)
853 {
854 c = *p++;
855 if (c >= 'A' && c <= 'Z')
856 c += 'a' - 'A';
857 if (c != 'l' && c != 'u')
858 n *= base;
859 if (c >= '0' && c <= '9')
860 {
861 if (found_suffix)
862 return ERROR;
863 n += i = c - '0';
864 }
865 else
866 {
867 if (base > 10 && c >= 'a' && c <= 'f')
868 {
869 if (found_suffix)
870 return ERROR;
871 n += i = c - 'a' + 10;
872 }
873 else if (c == 'l')
874 {
875 ++long_p;
876 found_suffix = 1;
877 }
878 else if (c == 'u')
879 {
880 unsigned_p = 1;
881 found_suffix = 1;
882 }
883 else
884 return ERROR; /* Char not a digit */
885 }
886 if (i >= base)
887 return ERROR; /* Invalid digit in this base */
888
889 /* Portably test for overflow (only works for nonzero values, so make
890 a second check for zero). FIXME: Can't we just make n and prevn
891 unsigned and avoid this? */
892 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
893 unsigned_p = 1; /* Try something unsigned */
894
895 /* Portably test for unsigned overflow.
896 FIXME: This check is wrong; for example it doesn't find overflow
897 on 0x123456789 when LONGEST is 32 bits. */
898 if (c != 'l' && c != 'u' && n != 0)
899 {
900 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
901 error ("Numeric constant too large.");
902 }
903 prevn = n;
904 }
905
906 /* An integer constant is an int, a long, or a long long. An L
907 suffix forces it to be long; an LL suffix forces it to be long
908 long. If not forced to a larger size, it gets the first type of
909 the above that it fits in. To figure out whether it fits, we
910 shift it right and see whether anything remains. Note that we
911 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
912 operation, because many compilers will warn about such a shift
913 (which always produces a zero result). Sometimes TARGET_INT_BIT
914 or TARGET_LONG_BIT will be that big, sometimes not. To deal with
915 the case where it is we just always shift the value more than
916 once, with fewer bits each time. */
917
918 un = (ULONGEST)n >> 2;
919 if (long_p == 0
920 && (un >> (TARGET_INT_BIT - 2)) == 0)
921 {
922 high_bit = ((ULONGEST)1) << (TARGET_INT_BIT-1);
923
924 /* A large decimal (not hex or octal) constant (between INT_MAX
925 and UINT_MAX) is a long or unsigned long, according to ANSI,
926 never an unsigned int, but this code treats it as unsigned
927 int. This probably should be fixed. GCC gives a warning on
928 such constants. */
929
930 unsigned_type = builtin_type_unsigned_int;
931 signed_type = builtin_type_int;
932 }
933 else if (long_p <= 1
934 && (un >> (TARGET_LONG_BIT - 2)) == 0)
935 {
936 high_bit = ((ULONGEST)1) << (TARGET_LONG_BIT-1);
937 unsigned_type = builtin_type_unsigned_long;
938 signed_type = builtin_type_long;
939 }
940 else
941 {
942 int shift;
943 if (sizeof (ULONGEST) * HOST_CHAR_BIT < TARGET_LONG_LONG_BIT)
944 /* A long long does not fit in a LONGEST. */
945 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
946 else
947 shift = (TARGET_LONG_LONG_BIT - 1);
948 high_bit = (ULONGEST) 1 << shift;
949 unsigned_type = builtin_type_unsigned_long_long;
950 signed_type = builtin_type_long_long;
951 }
952
953 putithere->typed_val_int.val = n;
954
955 /* If the high bit of the worked out type is set then this number
956 has to be unsigned. */
957
958 if (unsigned_p || (n & high_bit))
959 {
960 putithere->typed_val_int.type = unsigned_type;
961 }
962 else
963 {
964 putithere->typed_val_int.type = signed_type;
965 }
966
967 return INT;
968 }
969
970
971 struct type_push
972 {
973 struct type *stored;
974 struct type_push *next;
975 };
976
977 static struct type_push *tp_top = NULL;
978
979 static void
980 push_current_type (void)
981 {
982 struct type_push *tpnew;
983 tpnew = (struct type_push *) malloc (sizeof (struct type_push));
984 tpnew->next = tp_top;
985 tpnew->stored = current_type;
986 current_type = NULL;
987 tp_top = tpnew;
988 }
989
990 static void
991 pop_current_type (void)
992 {
993 struct type_push *tp = tp_top;
994 if (tp)
995 {
996 current_type = tp->stored;
997 tp_top = tp->next;
998 xfree (tp);
999 }
1000 }
1001
1002 struct token
1003 {
1004 char *operator;
1005 int token;
1006 enum exp_opcode opcode;
1007 };
1008
1009 static const struct token tokentab3[] =
1010 {
1011 {"shr", RSH, BINOP_END},
1012 {"shl", LSH, BINOP_END},
1013 {"and", ANDAND, BINOP_END},
1014 {"div", DIV, BINOP_END},
1015 {"not", NOT, BINOP_END},
1016 {"mod", MOD, BINOP_END},
1017 {"inc", INCREMENT, BINOP_END},
1018 {"dec", DECREMENT, BINOP_END},
1019 {"xor", XOR, BINOP_END}
1020 };
1021
1022 static const struct token tokentab2[] =
1023 {
1024 {"or", OR, BINOP_END},
1025 {"<>", NOTEQUAL, BINOP_END},
1026 {"<=", LEQ, BINOP_END},
1027 {">=", GEQ, BINOP_END},
1028 {":=", ASSIGN, BINOP_END},
1029 {"::", COLONCOLON, BINOP_END} };
1030
1031 /* Allocate uppercased var */
1032 /* make an uppercased copy of tokstart */
1033 static char * uptok (tokstart, namelen)
1034 char *tokstart;
1035 int namelen;
1036 {
1037 int i;
1038 char *uptokstart = (char *)malloc(namelen+1);
1039 for (i = 0;i <= namelen;i++)
1040 {
1041 if ((tokstart[i]>='a' && tokstart[i]<='z'))
1042 uptokstart[i] = tokstart[i]-('a'-'A');
1043 else
1044 uptokstart[i] = tokstart[i];
1045 }
1046 uptokstart[namelen]='\0';
1047 return uptokstart;
1048 }
1049 /* Read one token, getting characters through lexptr. */
1050
1051
1052 static int
1053 yylex ()
1054 {
1055 int c;
1056 int namelen;
1057 unsigned int i;
1058 char *tokstart;
1059 char *uptokstart;
1060 char *tokptr;
1061 char *p;
1062 int explen, tempbufindex;
1063 static char *tempbuf;
1064 static int tempbufsize;
1065
1066 retry:
1067
1068 prev_lexptr = lexptr;
1069
1070 tokstart = lexptr;
1071 explen = strlen (lexptr);
1072 /* See if it is a special token of length 3. */
1073 if (explen > 2)
1074 for (i = 0; i < sizeof (tokentab3) / sizeof (tokentab3[0]); i++)
1075 if (strncasecmp (tokstart, tokentab3[i].operator, 3) == 0
1076 && (!isalpha (tokentab3[i].operator[0]) || explen == 3
1077 || (!isalpha (tokstart[3]) && !isdigit (tokstart[3]) && tokstart[3] != '_')))
1078 {
1079 lexptr += 3;
1080 yylval.opcode = tokentab3[i].opcode;
1081 return tokentab3[i].token;
1082 }
1083
1084 /* See if it is a special token of length 2. */
1085 if (explen > 1)
1086 for (i = 0; i < sizeof (tokentab2) / sizeof (tokentab2[0]); i++)
1087 if (strncasecmp (tokstart, tokentab2[i].operator, 2) == 0
1088 && (!isalpha (tokentab2[i].operator[0]) || explen == 2
1089 || (!isalpha (tokstart[2]) && !isdigit (tokstart[2]) && tokstart[2] != '_')))
1090 {
1091 lexptr += 2;
1092 yylval.opcode = tokentab2[i].opcode;
1093 return tokentab2[i].token;
1094 }
1095
1096 switch (c = *tokstart)
1097 {
1098 case 0:
1099 return 0;
1100
1101 case ' ':
1102 case '\t':
1103 case '\n':
1104 lexptr++;
1105 goto retry;
1106
1107 case '\'':
1108 /* We either have a character constant ('0' or '\177' for example)
1109 or we have a quoted symbol reference ('foo(int,int)' in object pascal
1110 for example). */
1111 lexptr++;
1112 c = *lexptr++;
1113 if (c == '\\')
1114 c = parse_escape (&lexptr);
1115 else if (c == '\'')
1116 error ("Empty character constant.");
1117
1118 yylval.typed_val_int.val = c;
1119 yylval.typed_val_int.type = builtin_type_char;
1120
1121 c = *lexptr++;
1122 if (c != '\'')
1123 {
1124 namelen = skip_quoted (tokstart) - tokstart;
1125 if (namelen > 2)
1126 {
1127 lexptr = tokstart + namelen;
1128 if (lexptr[-1] != '\'')
1129 error ("Unmatched single quote.");
1130 namelen -= 2;
1131 tokstart++;
1132 uptokstart = uptok(tokstart,namelen);
1133 goto tryname;
1134 }
1135 error ("Invalid character constant.");
1136 }
1137 return INT;
1138
1139 case '(':
1140 paren_depth++;
1141 lexptr++;
1142 return c;
1143
1144 case ')':
1145 if (paren_depth == 0)
1146 return 0;
1147 paren_depth--;
1148 lexptr++;
1149 return c;
1150
1151 case ',':
1152 if (comma_terminates && paren_depth == 0)
1153 return 0;
1154 lexptr++;
1155 return c;
1156
1157 case '.':
1158 /* Might be a floating point number. */
1159 if (lexptr[1] < '0' || lexptr[1] > '9')
1160 goto symbol; /* Nope, must be a symbol. */
1161 /* FALL THRU into number case. */
1162
1163 case '0':
1164 case '1':
1165 case '2':
1166 case '3':
1167 case '4':
1168 case '5':
1169 case '6':
1170 case '7':
1171 case '8':
1172 case '9':
1173 {
1174 /* It's a number. */
1175 int got_dot = 0, got_e = 0, toktype;
1176 char *p = tokstart;
1177 int hex = input_radix > 10;
1178
1179 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
1180 {
1181 p += 2;
1182 hex = 1;
1183 }
1184 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
1185 {
1186 p += 2;
1187 hex = 0;
1188 }
1189
1190 for (;; ++p)
1191 {
1192 /* This test includes !hex because 'e' is a valid hex digit
1193 and thus does not indicate a floating point number when
1194 the radix is hex. */
1195 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
1196 got_dot = got_e = 1;
1197 /* This test does not include !hex, because a '.' always indicates
1198 a decimal floating point number regardless of the radix. */
1199 else if (!got_dot && *p == '.')
1200 got_dot = 1;
1201 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
1202 && (*p == '-' || *p == '+'))
1203 /* This is the sign of the exponent, not the end of the
1204 number. */
1205 continue;
1206 /* We will take any letters or digits. parse_number will
1207 complain if past the radix, or if L or U are not final. */
1208 else if ((*p < '0' || *p > '9')
1209 && ((*p < 'a' || *p > 'z')
1210 && (*p < 'A' || *p > 'Z')))
1211 break;
1212 }
1213 toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval);
1214 if (toktype == ERROR)
1215 {
1216 char *err_copy = (char *) alloca (p - tokstart + 1);
1217
1218 memcpy (err_copy, tokstart, p - tokstart);
1219 err_copy[p - tokstart] = 0;
1220 error ("Invalid number \"%s\".", err_copy);
1221 }
1222 lexptr = p;
1223 return toktype;
1224 }
1225
1226 case '+':
1227 case '-':
1228 case '*':
1229 case '/':
1230 case '|':
1231 case '&':
1232 case '^':
1233 case '~':
1234 case '!':
1235 case '@':
1236 case '<':
1237 case '>':
1238 case '[':
1239 case ']':
1240 case '?':
1241 case ':':
1242 case '=':
1243 case '{':
1244 case '}':
1245 symbol:
1246 lexptr++;
1247 return c;
1248
1249 case '"':
1250
1251 /* Build the gdb internal form of the input string in tempbuf,
1252 translating any standard C escape forms seen. Note that the
1253 buffer is null byte terminated *only* for the convenience of
1254 debugging gdb itself and printing the buffer contents when
1255 the buffer contains no embedded nulls. Gdb does not depend
1256 upon the buffer being null byte terminated, it uses the length
1257 string instead. This allows gdb to handle C strings (as well
1258 as strings in other languages) with embedded null bytes */
1259
1260 tokptr = ++tokstart;
1261 tempbufindex = 0;
1262
1263 do {
1264 /* Grow the static temp buffer if necessary, including allocating
1265 the first one on demand. */
1266 if (tempbufindex + 1 >= tempbufsize)
1267 {
1268 tempbuf = (char *) realloc (tempbuf, tempbufsize += 64);
1269 }
1270
1271 switch (*tokptr)
1272 {
1273 case '\0':
1274 case '"':
1275 /* Do nothing, loop will terminate. */
1276 break;
1277 case '\\':
1278 tokptr++;
1279 c = parse_escape (&tokptr);
1280 if (c == -1)
1281 {
1282 continue;
1283 }
1284 tempbuf[tempbufindex++] = c;
1285 break;
1286 default:
1287 tempbuf[tempbufindex++] = *tokptr++;
1288 break;
1289 }
1290 } while ((*tokptr != '"') && (*tokptr != '\0'));
1291 if (*tokptr++ != '"')
1292 {
1293 error ("Unterminated string in expression.");
1294 }
1295 tempbuf[tempbufindex] = '\0'; /* See note above */
1296 yylval.sval.ptr = tempbuf;
1297 yylval.sval.length = tempbufindex;
1298 lexptr = tokptr;
1299 return (STRING);
1300 }
1301
1302 if (!(c == '_' || c == '$'
1303 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
1304 /* We must have come across a bad character (e.g. ';'). */
1305 error ("Invalid character '%c' in expression.", c);
1306
1307 /* It's a name. See how long it is. */
1308 namelen = 0;
1309 for (c = tokstart[namelen];
1310 (c == '_' || c == '$' || (c >= '0' && c <= '9')
1311 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
1312 {
1313 /* Template parameter lists are part of the name.
1314 FIXME: This mishandles `print $a<4&&$a>3'. */
1315 if (c == '<')
1316 {
1317 int i = namelen;
1318 int nesting_level = 1;
1319 while (tokstart[++i])
1320 {
1321 if (tokstart[i] == '<')
1322 nesting_level++;
1323 else if (tokstart[i] == '>')
1324 {
1325 if (--nesting_level == 0)
1326 break;
1327 }
1328 }
1329 if (tokstart[i] == '>')
1330 namelen = i;
1331 else
1332 break;
1333 }
1334
1335 /* do NOT uppercase internals because of registers !!! */
1336 c = tokstart[++namelen];
1337 }
1338
1339 uptokstart = uptok(tokstart,namelen);
1340
1341 /* The token "if" terminates the expression and is NOT
1342 removed from the input stream. */
1343 if (namelen == 2 && uptokstart[0] == 'I' && uptokstart[1] == 'F')
1344 {
1345 return 0;
1346 }
1347
1348 lexptr += namelen;
1349
1350 tryname:
1351
1352 /* Catch specific keywords. Should be done with a data structure. */
1353 switch (namelen)
1354 {
1355 case 6:
1356 if (DEPRECATED_STREQ (uptokstart, "OBJECT"))
1357 return CLASS;
1358 if (DEPRECATED_STREQ (uptokstart, "RECORD"))
1359 return STRUCT;
1360 if (DEPRECATED_STREQ (uptokstart, "SIZEOF"))
1361 return SIZEOF;
1362 break;
1363 case 5:
1364 if (DEPRECATED_STREQ (uptokstart, "CLASS"))
1365 return CLASS;
1366 if (DEPRECATED_STREQ (uptokstart, "FALSE"))
1367 {
1368 yylval.lval = 0;
1369 return FALSEKEYWORD;
1370 }
1371 break;
1372 case 4:
1373 if (DEPRECATED_STREQ (uptokstart, "TRUE"))
1374 {
1375 yylval.lval = 1;
1376 return TRUEKEYWORD;
1377 }
1378 if (DEPRECATED_STREQ (uptokstart, "SELF"))
1379 {
1380 /* here we search for 'this' like
1381 inserted in FPC stabs debug info */
1382 static const char this_name[] = "this";
1383
1384 if (lookup_symbol (this_name, expression_context_block,
1385 VAR_DOMAIN, (int *) NULL,
1386 (struct symtab **) NULL))
1387 return THIS;
1388 }
1389 break;
1390 default:
1391 break;
1392 }
1393
1394 yylval.sval.ptr = tokstart;
1395 yylval.sval.length = namelen;
1396
1397 if (*tokstart == '$')
1398 {
1399 /* $ is the normal prefix for pascal hexadecimal values
1400 but this conflicts with the GDB use for debugger variables
1401 so in expression to enter hexadecimal values
1402 we still need to use C syntax with 0xff */
1403 write_dollar_variable (yylval.sval);
1404 return VARIABLE;
1405 }
1406
1407 /* Use token-type BLOCKNAME for symbols that happen to be defined as
1408 functions or symtabs. If this is not so, then ...
1409 Use token-type TYPENAME for symbols that happen to be defined
1410 currently as names of types; NAME for other symbols.
1411 The caller is not constrained to care about the distinction. */
1412 {
1413 char *tmp = copy_name (yylval.sval);
1414 struct symbol *sym;
1415 int is_a_field_of_this = 0;
1416 int is_a_field = 0;
1417 int hextype;
1418
1419
1420 if (search_field && current_type)
1421 is_a_field = (lookup_struct_elt_type (current_type, tmp, 1) != NULL);
1422 if (is_a_field)
1423 sym = NULL;
1424 else
1425 sym = lookup_symbol (tmp, expression_context_block,
1426 VAR_DOMAIN,
1427 &is_a_field_of_this,
1428 (struct symtab **) NULL);
1429 /* second chance uppercased (as Free Pascal does). */
1430 if (!sym && !is_a_field_of_this && !is_a_field)
1431 {
1432 for (i = 0; i <= namelen; i++)
1433 {
1434 if ((tmp[i] >= 'a' && tmp[i] <= 'z'))
1435 tmp[i] -= ('a'-'A');
1436 }
1437 if (search_field && current_type)
1438 is_a_field = (lookup_struct_elt_type (current_type, tmp, 1) != NULL);
1439 if (is_a_field)
1440 sym = NULL;
1441 else
1442 sym = lookup_symbol (tmp, expression_context_block,
1443 VAR_DOMAIN,
1444 &is_a_field_of_this,
1445 (struct symtab **) NULL);
1446 if (sym || is_a_field_of_this || is_a_field)
1447 for (i = 0; i <= namelen; i++)
1448 {
1449 if ((tokstart[i] >= 'a' && tokstart[i] <= 'z'))
1450 tokstart[i] -= ('a'-'A');
1451 }
1452 }
1453 /* Third chance Capitalized (as GPC does). */
1454 if (!sym && !is_a_field_of_this && !is_a_field)
1455 {
1456 for (i = 0; i <= namelen; i++)
1457 {
1458 if (i == 0)
1459 {
1460 if ((tmp[i] >= 'a' && tmp[i] <= 'z'))
1461 tmp[i] -= ('a'-'A');
1462 }
1463 else
1464 if ((tmp[i] >= 'A' && tmp[i] <= 'Z'))
1465 tmp[i] -= ('A'-'a');
1466 }
1467 if (search_field && current_type)
1468 is_a_field = (lookup_struct_elt_type (current_type, tmp, 1) != NULL);
1469 if (is_a_field)
1470 sym = NULL;
1471 else
1472 sym = lookup_symbol (tmp, expression_context_block,
1473 VAR_DOMAIN,
1474 &is_a_field_of_this,
1475 (struct symtab **) NULL);
1476 if (sym || is_a_field_of_this || is_a_field)
1477 for (i = 0; i <= namelen; i++)
1478 {
1479 if (i == 0)
1480 {
1481 if ((tokstart[i] >= 'a' && tokstart[i] <= 'z'))
1482 tokstart[i] -= ('a'-'A');
1483 }
1484 else
1485 if ((tokstart[i] >= 'A' && tokstart[i] <= 'Z'))
1486 tokstart[i] -= ('A'-'a');
1487 }
1488 }
1489
1490 if (is_a_field)
1491 {
1492 tempbuf = (char *) realloc (tempbuf, namelen + 1);
1493 strncpy (tempbuf, tokstart, namelen); tempbuf [namelen] = 0;
1494 yylval.sval.ptr = tempbuf;
1495 yylval.sval.length = namelen;
1496 return FIELDNAME;
1497 }
1498 /* Call lookup_symtab, not lookup_partial_symtab, in case there are
1499 no psymtabs (coff, xcoff, or some future change to blow away the
1500 psymtabs once once symbols are read). */
1501 if ((sym && SYMBOL_CLASS (sym) == LOC_BLOCK) ||
1502 lookup_symtab (tmp))
1503 {
1504 yylval.ssym.sym = sym;
1505 yylval.ssym.is_a_field_of_this = is_a_field_of_this;
1506 return BLOCKNAME;
1507 }
1508 if (sym && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
1509 {
1510 #if 1
1511 /* Despite the following flaw, we need to keep this code enabled.
1512 Because we can get called from check_stub_method, if we don't
1513 handle nested types then it screws many operations in any
1514 program which uses nested types. */
1515 /* In "A::x", if x is a member function of A and there happens
1516 to be a type (nested or not, since the stabs don't make that
1517 distinction) named x, then this code incorrectly thinks we
1518 are dealing with nested types rather than a member function. */
1519
1520 char *p;
1521 char *namestart;
1522 struct symbol *best_sym;
1523
1524 /* Look ahead to detect nested types. This probably should be
1525 done in the grammar, but trying seemed to introduce a lot
1526 of shift/reduce and reduce/reduce conflicts. It's possible
1527 that it could be done, though. Or perhaps a non-grammar, but
1528 less ad hoc, approach would work well. */
1529
1530 /* Since we do not currently have any way of distinguishing
1531 a nested type from a non-nested one (the stabs don't tell
1532 us whether a type is nested), we just ignore the
1533 containing type. */
1534
1535 p = lexptr;
1536 best_sym = sym;
1537 while (1)
1538 {
1539 /* Skip whitespace. */
1540 while (*p == ' ' || *p == '\t' || *p == '\n')
1541 ++p;
1542 if (*p == ':' && p[1] == ':')
1543 {
1544 /* Skip the `::'. */
1545 p += 2;
1546 /* Skip whitespace. */
1547 while (*p == ' ' || *p == '\t' || *p == '\n')
1548 ++p;
1549 namestart = p;
1550 while (*p == '_' || *p == '$' || (*p >= '0' && *p <= '9')
1551 || (*p >= 'a' && *p <= 'z')
1552 || (*p >= 'A' && *p <= 'Z'))
1553 ++p;
1554 if (p != namestart)
1555 {
1556 struct symbol *cur_sym;
1557 /* As big as the whole rest of the expression, which is
1558 at least big enough. */
1559 char *ncopy = alloca (strlen (tmp)+strlen (namestart)+3);
1560 char *tmp1;
1561
1562 tmp1 = ncopy;
1563 memcpy (tmp1, tmp, strlen (tmp));
1564 tmp1 += strlen (tmp);
1565 memcpy (tmp1, "::", 2);
1566 tmp1 += 2;
1567 memcpy (tmp1, namestart, p - namestart);
1568 tmp1[p - namestart] = '\0';
1569 cur_sym = lookup_symbol (ncopy, expression_context_block,
1570 VAR_DOMAIN, (int *) NULL,
1571 (struct symtab **) NULL);
1572 if (cur_sym)
1573 {
1574 if (SYMBOL_CLASS (cur_sym) == LOC_TYPEDEF)
1575 {
1576 best_sym = cur_sym;
1577 lexptr = p;
1578 }
1579 else
1580 break;
1581 }
1582 else
1583 break;
1584 }
1585 else
1586 break;
1587 }
1588 else
1589 break;
1590 }
1591
1592 yylval.tsym.type = SYMBOL_TYPE (best_sym);
1593 #else /* not 0 */
1594 yylval.tsym.type = SYMBOL_TYPE (sym);
1595 #endif /* not 0 */
1596 return TYPENAME;
1597 }
1598 yylval.tsym.type
1599 = language_lookup_primitive_type_by_name (current_language,
1600 current_gdbarch, tmp);
1601 if (yylval.tsym.type != NULL)
1602 return TYPENAME;
1603
1604 /* Input names that aren't symbols but ARE valid hex numbers,
1605 when the input radix permits them, can be names or numbers
1606 depending on the parse. Note we support radixes > 16 here. */
1607 if (!sym &&
1608 ((tokstart[0] >= 'a' && tokstart[0] < 'a' + input_radix - 10) ||
1609 (tokstart[0] >= 'A' && tokstart[0] < 'A' + input_radix - 10)))
1610 {
1611 YYSTYPE newlval; /* Its value is ignored. */
1612 hextype = parse_number (tokstart, namelen, 0, &newlval);
1613 if (hextype == INT)
1614 {
1615 yylval.ssym.sym = sym;
1616 yylval.ssym.is_a_field_of_this = is_a_field_of_this;
1617 return NAME_OR_INT;
1618 }
1619 }
1620
1621 free(uptokstart);
1622 /* Any other kind of symbol */
1623 yylval.ssym.sym = sym;
1624 yylval.ssym.is_a_field_of_this = is_a_field_of_this;
1625 return NAME;
1626 }
1627 }
1628
1629 void
1630 yyerror (msg)
1631 char *msg;
1632 {
1633 if (prev_lexptr)
1634 lexptr = prev_lexptr;
1635
1636 error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr);
1637 }
This page took 0.093791 seconds and 4 git commands to generate.