1 /* Parse expressions for GDB.
3 Copyright 1986, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996,
4 1997, 1998, 1999, 2000, 2001, 2004 Free Software Foundation, Inc.
6 Modified from expread.y by the Department of Computer Science at the
7 State University of New York at Buffalo, 1991.
9 This file is part of GDB.
11 This program is free software; you can redistribute it and/or modify
12 it under the terms of the GNU General Public License as published by
13 the Free Software Foundation; either version 2 of the License, or
14 (at your option) any later version.
16 This program is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU General Public License for more details.
21 You should have received a copy of the GNU General Public License
22 along with this program; if not, write to the Free Software
23 Foundation, Inc., 59 Temple Place - Suite 330,
24 Boston, MA 02111-1307, USA. */
26 /* Parse an expression from text in a string,
27 and return the result as a struct expression pointer.
28 That structure contains arithmetic operations in reverse polish,
29 with constants represented by operations that are followed by special data.
30 See expression.h for the details of the format.
31 What is important here is that it can be built up sequentially
32 during the process of parsing; the lower levels of the tree always
33 come first in the result. */
38 #include "gdb_string.h"
42 #include "expression.h"
46 #include "parser-defs.h"
48 #include "symfile.h" /* for overlay functions */
49 #include "inferior.h" /* for NUM_PSEUDO_REGS. NOTE: replace
50 with "gdbarch.h" when appropriate. */
52 #include "gdb_assert.h"
55 /* Standard set of definitions for printing, dumping, prefixifying,
56 * and evaluating expressions. */
58 const struct exp_descriptor exp_descriptor_standard =
60 print_subexp_standard,
61 operator_length_standard,
63 dump_subexp_body_standard,
64 evaluate_subexp_standard
67 /* Global variables declared in parser-defs.h (and commented there). */
68 struct expression *expout;
71 struct block *expression_context_block;
72 CORE_ADDR expression_context_pc;
73 struct block *innermost_block;
75 union type_stack_elt *type_stack;
76 int type_stack_depth, type_stack_size;
83 static int expressiondebug = 0;
85 static void free_funcalls (void *ignore);
87 static void prefixify_expression (struct expression *);
89 static void prefixify_subexp (struct expression *, struct expression *, int,
92 static struct expression *parse_exp_in_context (char **, struct block *, int,
95 void _initialize_parse (void);
97 /* Data structure for saving values of arglist_len for function calls whose
98 arguments contain other function calls. */
102 struct funcall *next;
106 static struct funcall *funcall_chain;
108 /* Begin counting arguments for a function call,
109 saving the data about any containing call. */
116 new = (struct funcall *) xmalloc (sizeof (struct funcall));
117 new->next = funcall_chain;
118 new->arglist_len = arglist_len;
123 /* Return the number of arguments in a function call just terminated,
124 and restore the data for the containing function call. */
129 int val = arglist_len;
130 struct funcall *call = funcall_chain;
131 funcall_chain = call->next;
132 arglist_len = call->arglist_len;
137 /* Free everything in the funcall chain.
138 Used when there is an error inside parsing. */
141 free_funcalls (void *ignore)
143 struct funcall *call, *next;
145 for (call = funcall_chain; call; call = next)
152 /* This page contains the functions for adding data to the struct expression
153 being constructed. */
155 /* Add one element to the end of the expression. */
157 /* To avoid a bug in the Sun 4 compiler, we pass things that can fit into
158 a register through here */
161 write_exp_elt (union exp_element expelt)
163 if (expout_ptr >= expout_size)
166 expout = (struct expression *)
167 xrealloc ((char *) expout, sizeof (struct expression)
168 + EXP_ELEM_TO_BYTES (expout_size));
170 expout->elts[expout_ptr++] = expelt;
174 write_exp_elt_opcode (enum exp_opcode expelt)
176 union exp_element tmp;
184 write_exp_elt_sym (struct symbol *expelt)
186 union exp_element tmp;
194 write_exp_elt_block (struct block *b)
196 union exp_element tmp;
202 write_exp_elt_longcst (LONGEST expelt)
204 union exp_element tmp;
206 tmp.longconst = expelt;
212 write_exp_elt_dblcst (DOUBLEST expelt)
214 union exp_element tmp;
216 tmp.doubleconst = expelt;
222 write_exp_elt_type (struct type *expelt)
224 union exp_element tmp;
232 write_exp_elt_intern (struct internalvar *expelt)
234 union exp_element tmp;
236 tmp.internalvar = expelt;
241 /* Add a string constant to the end of the expression.
243 String constants are stored by first writing an expression element
244 that contains the length of the string, then stuffing the string
245 constant itself into however many expression elements are needed
246 to hold it, and then writing another expression element that contains
247 the length of the string. I.E. an expression element at each end of
248 the string records the string length, so you can skip over the
249 expression elements containing the actual string bytes from either
250 end of the string. Note that this also allows gdb to handle
251 strings with embedded null bytes, as is required for some languages.
253 Don't be fooled by the fact that the string is null byte terminated,
254 this is strictly for the convenience of debugging gdb itself. Gdb
255 Gdb does not depend up the string being null terminated, since the
256 actual length is recorded in expression elements at each end of the
257 string. The null byte is taken into consideration when computing how
258 many expression elements are required to hold the string constant, of
263 write_exp_string (struct stoken str)
265 int len = str.length;
269 /* Compute the number of expression elements required to hold the string
270 (including a null byte terminator), along with one expression element
271 at each end to record the actual string length (not including the
272 null byte terminator). */
274 lenelt = 2 + BYTES_TO_EXP_ELEM (len + 1);
276 /* Ensure that we have enough available expression elements to store
279 if ((expout_ptr + lenelt) >= expout_size)
281 expout_size = max (expout_size * 2, expout_ptr + lenelt + 10);
282 expout = (struct expression *)
283 xrealloc ((char *) expout, (sizeof (struct expression)
284 + EXP_ELEM_TO_BYTES (expout_size)));
287 /* Write the leading length expression element (which advances the current
288 expression element index), then write the string constant followed by a
289 terminating null byte, and then write the trailing length expression
292 write_exp_elt_longcst ((LONGEST) len);
293 strdata = (char *) &expout->elts[expout_ptr];
294 memcpy (strdata, str.ptr, len);
295 *(strdata + len) = '\0';
296 expout_ptr += lenelt - 2;
297 write_exp_elt_longcst ((LONGEST) len);
300 /* Add a bitstring constant to the end of the expression.
302 Bitstring constants are stored by first writing an expression element
303 that contains the length of the bitstring (in bits), then stuffing the
304 bitstring constant itself into however many expression elements are
305 needed to hold it, and then writing another expression element that
306 contains the length of the bitstring. I.E. an expression element at
307 each end of the bitstring records the bitstring length, so you can skip
308 over the expression elements containing the actual bitstring bytes from
309 either end of the bitstring. */
312 write_exp_bitstring (struct stoken str)
314 int bits = str.length; /* length in bits */
315 int len = (bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
319 /* Compute the number of expression elements required to hold the bitstring,
320 along with one expression element at each end to record the actual
321 bitstring length in bits. */
323 lenelt = 2 + BYTES_TO_EXP_ELEM (len);
325 /* Ensure that we have enough available expression elements to store
328 if ((expout_ptr + lenelt) >= expout_size)
330 expout_size = max (expout_size * 2, expout_ptr + lenelt + 10);
331 expout = (struct expression *)
332 xrealloc ((char *) expout, (sizeof (struct expression)
333 + EXP_ELEM_TO_BYTES (expout_size)));
336 /* Write the leading length expression element (which advances the current
337 expression element index), then write the bitstring constant, and then
338 write the trailing length expression element. */
340 write_exp_elt_longcst ((LONGEST) bits);
341 strdata = (char *) &expout->elts[expout_ptr];
342 memcpy (strdata, str.ptr, len);
343 expout_ptr += lenelt - 2;
344 write_exp_elt_longcst ((LONGEST) bits);
347 /* Add the appropriate elements for a minimal symbol to the end of
348 the expression. The rationale behind passing in text_symbol_type and
349 data_symbol_type was so that Modula-2 could pass in WORD for
350 data_symbol_type. Perhaps it still is useful to have those types vary
351 based on the language, but they no longer have names like "int", so
352 the initial rationale is gone. */
354 static struct type *msym_text_symbol_type;
355 static struct type *msym_data_symbol_type;
356 static struct type *msym_unknown_symbol_type;
359 write_exp_msymbol (struct minimal_symbol *msymbol,
360 struct type *text_symbol_type,
361 struct type *data_symbol_type)
365 write_exp_elt_opcode (OP_LONG);
366 /* Let's make the type big enough to hold a 64-bit address. */
367 write_exp_elt_type (builtin_type_CORE_ADDR);
369 addr = SYMBOL_VALUE_ADDRESS (msymbol);
370 if (overlay_debugging)
371 addr = symbol_overlayed_address (addr, SYMBOL_BFD_SECTION (msymbol));
372 write_exp_elt_longcst ((LONGEST) addr);
374 write_exp_elt_opcode (OP_LONG);
376 write_exp_elt_opcode (UNOP_MEMVAL);
377 switch (msymbol->type)
381 case mst_solib_trampoline:
382 write_exp_elt_type (msym_text_symbol_type);
389 write_exp_elt_type (msym_data_symbol_type);
393 write_exp_elt_type (msym_unknown_symbol_type);
396 write_exp_elt_opcode (UNOP_MEMVAL);
399 /* Recognize tokens that start with '$'. These include:
401 $regname A native register name or a "standard
404 $variable A convenience variable with a name chosen
407 $digits Value history with index <digits>, starting
408 from the first value which has index 1.
410 $$digits Value history with index <digits> relative
411 to the last value. I.E. $$0 is the last
412 value, $$1 is the one previous to that, $$2
413 is the one previous to $$1, etc.
415 $ | $0 | $$0 The last value in the value history.
417 $$ An abbreviation for the second to the last
418 value in the value history, I.E. $$1
423 write_dollar_variable (struct stoken str)
425 struct symbol *sym = NULL;
426 struct minimal_symbol *msym = NULL;
428 /* Handle the tokens $digits; also $ (short for $0) and $$ (short for $$1)
429 and $$digits (equivalent to $<-digits> if you could type that). */
433 /* Double dollar means negate the number and add -1 as well.
434 Thus $$ alone means -1. */
435 if (str.length >= 2 && str.ptr[1] == '$')
442 /* Just dollars (one or two) */
446 /* Is the rest of the token digits? */
447 for (; i < str.length; i++)
448 if (!(str.ptr[i] >= '0' && str.ptr[i] <= '9'))
452 i = atoi (str.ptr + 1 + negate);
458 /* Handle tokens that refer to machine registers:
459 $ followed by a register name. */
460 i = frame_map_name_to_regnum (deprecated_selected_frame,
461 str.ptr + 1, str.length - 1);
463 goto handle_register;
465 /* On some systems, such as HP-UX and hppa-linux, certain system routines
466 have names beginning with $ or $$. Check for those, first. */
468 sym = lookup_symbol (copy_name (str), (struct block *) NULL,
469 VAR_DOMAIN, (int *) NULL, (struct symtab **) NULL);
472 write_exp_elt_opcode (OP_VAR_VALUE);
473 write_exp_elt_block (block_found); /* set by lookup_symbol */
474 write_exp_elt_sym (sym);
475 write_exp_elt_opcode (OP_VAR_VALUE);
478 msym = lookup_minimal_symbol (copy_name (str), NULL, NULL);
481 write_exp_msymbol (msym,
482 lookup_function_type (builtin_type_int),
487 /* Any other names starting in $ are debugger internal variables. */
489 write_exp_elt_opcode (OP_INTERNALVAR);
490 write_exp_elt_intern (lookup_internalvar (copy_name (str) + 1));
491 write_exp_elt_opcode (OP_INTERNALVAR);
494 write_exp_elt_opcode (OP_LAST);
495 write_exp_elt_longcst ((LONGEST) i);
496 write_exp_elt_opcode (OP_LAST);
499 write_exp_elt_opcode (OP_REGISTER);
500 write_exp_elt_longcst (i);
501 write_exp_elt_opcode (OP_REGISTER);
506 /* Parse a string that is possibly a namespace / nested class
507 specification, i.e., something of the form A::B::C::x. Input
508 (NAME) is the entire string; LEN is the current valid length; the
509 output is a string, TOKEN, which points to the largest recognized
510 prefix which is a series of namespaces or classes. CLASS_PREFIX is
511 another output, which records whether a nested class spec was
512 recognized (= 1) or a fully qualified variable name was found (=
513 0). ARGPTR is side-effected (if non-NULL) to point to beyond the
514 string recognized and consumed by this routine.
516 The return value is a pointer to the symbol for the base class or
517 variable if found, or NULL if not found. Callers must check this
518 first -- if NULL, the outputs may not be correct.
520 This function is used c-exp.y. This is used specifically to get
521 around HP aCC (and possibly other compilers), which insists on
522 generating names with embedded colons for namespace or nested class
525 (Argument LEN is currently unused. 1997-08-27)
527 Callers must free memory allocated for the output string TOKEN. */
529 static const char coloncolon[2] =
533 parse_nested_classes_for_hpacc (char *name, int len, char **token,
534 int *class_prefix, char **argptr)
536 /* Comment below comes from decode_line_1 which has very similar
537 code, which is called for "break" command parsing. */
539 /* We have what looks like a class or namespace
540 scope specification (A::B), possibly with many
541 levels of namespaces or classes (A::B::C::D).
543 Some versions of the HP ANSI C++ compiler (as also possibly
544 other compilers) generate class/function/member names with
545 embedded double-colons if they are inside namespaces. To
546 handle this, we loop a few times, considering larger and
547 larger prefixes of the string as though they were single
548 symbols. So, if the initially supplied string is
549 A::B::C::D::foo, we have to look up "A", then "A::B",
550 then "A::B::C", then "A::B::C::D", and finally
551 "A::B::C::D::foo" as single, monolithic symbols, because
552 A, B, C or D may be namespaces.
554 Note that namespaces can nest only inside other
555 namespaces, and not inside classes. So we need only
556 consider *prefixes* of the string; there is no need to look up
557 "B::C" separately as a symbol in the previous example. */
563 struct symbol *sym_class = NULL;
564 struct symbol *sym_var = NULL;
570 /* Check for HP-compiled executable -- in other cases
571 return NULL, and caller must default to standard GDB
574 if (!deprecated_hp_som_som_object_present)
575 return (struct symbol *) NULL;
579 /* Skip over whitespace and possible global "::" */
580 while (*p && (*p == ' ' || *p == '\t'))
582 if (p[0] == ':' && p[1] == ':')
584 while (*p && (*p == ' ' || *p == '\t'))
589 /* Get to the end of the next namespace or class spec. */
590 /* If we're looking at some non-token, fail immediately */
592 if (!(isalpha (*p) || *p == '$' || *p == '_'))
593 return (struct symbol *) NULL;
595 while (*p && (isalnum (*p) || *p == '$' || *p == '_'))
600 /* If we have the start of a template specification,
601 scan right ahead to its end */
602 q = find_template_name_end (p);
609 /* Skip over "::" and whitespace for next time around */
610 while (*p && (*p == ' ' || *p == '\t'))
612 if (p[0] == ':' && p[1] == ':')
614 while (*p && (*p == ' ' || *p == '\t'))
617 /* Done with tokens? */
618 if (!*p || !(isalpha (*p) || *p == '$' || *p == '_'))
621 tmp = (char *) alloca (prefix_len + end - start + 3);
624 memcpy (tmp, prefix, prefix_len);
625 memcpy (tmp + prefix_len, coloncolon, 2);
626 memcpy (tmp + prefix_len + 2, start, end - start);
627 tmp[prefix_len + 2 + end - start] = '\000';
631 memcpy (tmp, start, end - start);
632 tmp[end - start] = '\000';
636 prefix_len = strlen (prefix);
638 /* See if the prefix we have now is something we know about */
642 /* More tokens to process, so this must be a class/namespace */
643 sym_class = lookup_symbol (prefix, 0, STRUCT_DOMAIN,
644 0, (struct symtab **) NULL);
648 /* No more tokens, so try as a variable first */
649 sym_var = lookup_symbol (prefix, 0, VAR_DOMAIN,
650 0, (struct symtab **) NULL);
651 /* If failed, try as class/namespace */
653 sym_class = lookup_symbol (prefix, 0, STRUCT_DOMAIN,
654 0, (struct symtab **) NULL);
659 (t = check_typedef (SYMBOL_TYPE (sym_class)),
660 (TYPE_CODE (t) == TYPE_CODE_STRUCT
661 || TYPE_CODE (t) == TYPE_CODE_UNION))))
663 /* We found a valid token */
664 *token = (char *) xmalloc (prefix_len + 1);
665 memcpy (*token, prefix, prefix_len);
666 (*token)[prefix_len] = '\000';
670 /* No variable or class/namespace found, no more tokens */
672 return (struct symbol *) NULL;
675 /* Out of loop, so we must have found a valid token */
682 *argptr = done ? p : end;
684 return sym_var ? sym_var : sym_class; /* found */
688 find_template_name_end (char *p)
691 int just_seen_right = 0;
692 int just_seen_colon = 0;
693 int just_seen_space = 0;
695 if (!p || (*p != '<'))
706 /* In future, may want to allow these?? */
709 depth++; /* start nested template */
710 if (just_seen_colon || just_seen_right || just_seen_space)
711 return 0; /* but not after : or :: or > or space */
714 if (just_seen_colon || just_seen_right)
715 return 0; /* end a (nested?) template */
716 just_seen_right = 1; /* but not after : or :: */
717 if (--depth == 0) /* also disallow >>, insist on > > */
718 return ++p; /* if outermost ended, return */
721 if (just_seen_space || (just_seen_colon > 1))
722 return 0; /* nested class spec coming up */
723 just_seen_colon++; /* we allow :: but not :::: */
728 if (!((*p >= 'a' && *p <= 'z') || /* allow token chars */
729 (*p >= 'A' && *p <= 'Z') ||
730 (*p >= '0' && *p <= '9') ||
731 (*p == '_') || (*p == ',') || /* commas for template args */
732 (*p == '&') || (*p == '*') || /* pointer and ref types */
733 (*p == '(') || (*p == ')') || /* function types */
734 (*p == '[') || (*p == ']'))) /* array types */
749 /* Return a null-terminated temporary copy of the name
750 of a string token. */
753 copy_name (struct stoken token)
755 memcpy (namecopy, token.ptr, token.length);
756 namecopy[token.length] = 0;
760 /* Reverse an expression from suffix form (in which it is constructed)
761 to prefix form (in which we can conveniently print or execute it). */
764 prefixify_expression (struct expression *expr)
767 sizeof (struct expression) + EXP_ELEM_TO_BYTES (expr->nelts);
768 struct expression *temp;
769 int inpos = expr->nelts, outpos = 0;
771 temp = (struct expression *) alloca (len);
773 /* Copy the original expression into temp. */
774 memcpy (temp, expr, len);
776 prefixify_subexp (temp, expr, inpos, outpos);
779 /* Return the number of exp_elements in the postfix subexpression
780 of EXPR whose operator is at index ENDPOS - 1 in EXPR. */
783 length_of_subexp (struct expression *expr, int endpos)
787 operator_length (expr, endpos, &oplen, &args);
791 oplen += length_of_subexp (expr, endpos - oplen);
798 /* Sets *OPLENP to the length of the operator whose (last) index is
799 ENDPOS - 1 in EXPR, and sets *ARGSP to the number of arguments that
803 operator_length (struct expression *expr, int endpos, int *oplenp, int *argsp)
805 expr->language_defn->la_exp_desc->operator_length (expr, endpos,
809 /* Default value for operator_length in exp_descriptor vectors. */
812 operator_length_standard (struct expression *expr, int endpos,
813 int *oplenp, int *argsp)
820 error (_("?error in operator_length_standard"));
822 i = (int) expr->elts[endpos - 1].opcode;
828 oplen = longest_to_int (expr->elts[endpos - 2].longconst);
829 oplen = 5 + BYTES_TO_EXP_ELEM (oplen + 1);
852 case OP_F77_UNDETERMINED_ARGLIST:
854 args = 1 + longest_to_int (expr->elts[endpos - 2].longconst);
857 case OP_OBJC_MSGCALL: /* Objective C message (method) call */
859 args = 1 + longest_to_int (expr->elts[endpos - 2].longconst);
887 case STRUCTOP_STRUCT:
893 case OP_OBJC_NSSTRING: /* Objective C Foundation Class NSString constant */
894 case OP_OBJC_SELECTOR: /* Objective C "@selector" pseudo-op */
897 oplen = longest_to_int (expr->elts[endpos - 2].longconst);
898 oplen = 4 + BYTES_TO_EXP_ELEM (oplen + 1);
902 oplen = longest_to_int (expr->elts[endpos - 2].longconst);
903 oplen = (oplen + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
904 oplen = 4 + BYTES_TO_EXP_ELEM (oplen);
909 args = longest_to_int (expr->elts[endpos - 2].longconst);
910 args -= longest_to_int (expr->elts[endpos - 3].longconst);
916 case TERNOP_SLICE_COUNT:
921 case MULTI_SUBSCRIPT:
923 args = 1 + longest_to_int (expr->elts[endpos - 2].longconst);
926 case BINOP_ASSIGN_MODIFY:
938 args = 1 + (i < (int) BINOP_END);
945 /* Copy the subexpression ending just before index INEND in INEXPR
946 into OUTEXPR, starting at index OUTBEG.
947 In the process, convert it from suffix to prefix form. */
950 prefixify_subexp (struct expression *inexpr,
951 struct expression *outexpr, int inend, int outbeg)
957 enum exp_opcode opcode;
959 operator_length (inexpr, inend, &oplen, &args);
961 /* Copy the final operator itself, from the end of the input
962 to the beginning of the output. */
964 memcpy (&outexpr->elts[outbeg], &inexpr->elts[inend],
965 EXP_ELEM_TO_BYTES (oplen));
968 /* Find the lengths of the arg subexpressions. */
969 arglens = (int *) alloca (args * sizeof (int));
970 for (i = args - 1; i >= 0; i--)
972 oplen = length_of_subexp (inexpr, inend);
977 /* Now copy each subexpression, preserving the order of
978 the subexpressions, but prefixifying each one.
979 In this loop, inend starts at the beginning of
980 the expression this level is working on
981 and marches forward over the arguments.
982 outbeg does similarly in the output. */
983 for (i = 0; i < args; i++)
987 prefixify_subexp (inexpr, outexpr, inend, outbeg);
992 /* This page contains the two entry points to this file. */
994 /* Read an expression from the string *STRINGPTR points to,
995 parse it, and return a pointer to a struct expression that we malloc.
996 Use block BLOCK as the lexical context for variable names;
997 if BLOCK is zero, use the block of the selected stack frame.
998 Meanwhile, advance *STRINGPTR to point after the expression,
999 at the first nonwhite character that is not part of the expression
1000 (possibly a null character).
1002 If COMMA is nonzero, stop if a comma is reached. */
1005 parse_exp_1 (char **stringptr, struct block *block, int comma)
1007 return parse_exp_in_context (stringptr, block, comma, 0);
1010 /* As for parse_exp_1, except that if VOID_CONTEXT_P, then
1011 no value is expected from the expression. */
1013 static struct expression *
1014 parse_exp_in_context (char **stringptr, struct block *block, int comma,
1017 struct cleanup *old_chain;
1019 lexptr = *stringptr;
1023 type_stack_depth = 0;
1025 comma_terminates = comma;
1027 if (lexptr == 0 || *lexptr == 0)
1028 error_no_arg ("expression to compute");
1030 old_chain = make_cleanup (free_funcalls, 0 /*ignore*/);
1035 expression_context_block = block;
1036 expression_context_pc = BLOCK_START (block);
1039 expression_context_block = get_selected_block (&expression_context_pc);
1041 namecopy = (char *) alloca (strlen (lexptr) + 1);
1044 expout = (struct expression *)
1045 xmalloc (sizeof (struct expression) + EXP_ELEM_TO_BYTES (expout_size));
1046 expout->language_defn = current_language;
1047 make_cleanup (free_current_contents, &expout);
1049 if (current_language->la_parser ())
1050 current_language->la_error (NULL);
1052 discard_cleanups (old_chain);
1054 /* Record the actual number of expression elements, and then
1055 reallocate the expression memory so that we free up any
1058 expout->nelts = expout_ptr;
1059 expout = (struct expression *)
1060 xrealloc ((char *) expout,
1061 sizeof (struct expression) + EXP_ELEM_TO_BYTES (expout_ptr));;
1063 /* Convert expression from postfix form as generated by yacc
1064 parser, to a prefix form. */
1066 if (expressiondebug)
1067 dump_raw_expression (expout, gdb_stdlog,
1068 "before conversion to prefix form");
1070 prefixify_expression (expout);
1072 current_language->la_post_parser (&expout, void_context_p);
1074 if (expressiondebug)
1075 dump_prefix_expression (expout, gdb_stdlog);
1077 *stringptr = lexptr;
1081 /* Parse STRING as an expression, and complain if this fails
1082 to use up all of the contents of STRING. */
1085 parse_expression (char *string)
1087 struct expression *exp;
1088 exp = parse_exp_1 (&string, 0, 0);
1090 error (_("Junk after end of expression."));
1095 /* As for parse_expression, except that if VOID_CONTEXT_P, then
1096 no value is expected from the expression. */
1099 parse_expression_in_context (char *string, int void_context_p)
1101 struct expression *exp;
1102 exp = parse_exp_in_context (&string, 0, 0, void_context_p);
1103 if (*string != '\000')
1104 error (_("Junk after end of expression."));
1108 /* A post-parser that does nothing */
1111 null_post_parser (struct expression **exp, int void_context_p)
1115 /* Stuff for maintaining a stack of types. Currently just used by C, but
1116 probably useful for any language which declares its types "backwards". */
1119 check_type_stack_depth (void)
1121 if (type_stack_depth == type_stack_size)
1123 type_stack_size *= 2;
1124 type_stack = (union type_stack_elt *)
1125 xrealloc ((char *) type_stack, type_stack_size * sizeof (*type_stack));
1130 push_type (enum type_pieces tp)
1132 check_type_stack_depth ();
1133 type_stack[type_stack_depth++].piece = tp;
1137 push_type_int (int n)
1139 check_type_stack_depth ();
1140 type_stack[type_stack_depth++].int_val = n;
1144 push_type_address_space (char *string)
1146 push_type_int (address_space_name_to_int (string));
1152 if (type_stack_depth)
1153 return type_stack[--type_stack_depth].piece;
1160 if (type_stack_depth)
1161 return type_stack[--type_stack_depth].int_val;
1162 /* "Can't happen". */
1166 /* Pop the type stack and return the type which corresponds to FOLLOW_TYPE
1167 as modified by all the stuff on the stack. */
1169 follow_types (struct type *follow_type)
1173 int make_volatile = 0;
1174 int make_addr_space = 0;
1176 struct type *range_type;
1179 switch (pop_type ())
1184 follow_type = make_cv_type (make_const,
1185 TYPE_VOLATILE (follow_type),
1188 follow_type = make_cv_type (TYPE_CONST (follow_type),
1191 if (make_addr_space)
1192 follow_type = make_type_with_address_space (follow_type,
1194 make_const = make_volatile = 0;
1195 make_addr_space = 0;
1203 case tp_space_identifier:
1204 make_addr_space = pop_type_int ();
1207 follow_type = lookup_pointer_type (follow_type);
1209 follow_type = make_cv_type (make_const,
1210 TYPE_VOLATILE (follow_type),
1213 follow_type = make_cv_type (TYPE_CONST (follow_type),
1216 if (make_addr_space)
1217 follow_type = make_type_with_address_space (follow_type,
1219 make_const = make_volatile = 0;
1220 make_addr_space = 0;
1223 follow_type = lookup_reference_type (follow_type);
1225 follow_type = make_cv_type (make_const,
1226 TYPE_VOLATILE (follow_type),
1229 follow_type = make_cv_type (TYPE_CONST (follow_type),
1232 if (make_addr_space)
1233 follow_type = make_type_with_address_space (follow_type,
1235 make_const = make_volatile = 0;
1236 make_addr_space = 0;
1239 array_size = pop_type_int ();
1240 /* FIXME-type-allocation: need a way to free this type when we are
1243 create_range_type ((struct type *) NULL,
1244 builtin_type_int, 0,
1245 array_size >= 0 ? array_size - 1 : 0);
1247 create_array_type ((struct type *) NULL,
1248 follow_type, range_type);
1250 TYPE_ARRAY_UPPER_BOUND_TYPE (follow_type)
1251 = BOUND_CANNOT_BE_DETERMINED;
1254 /* FIXME-type-allocation: need a way to free this type when we are
1256 follow_type = lookup_function_type (follow_type);
1262 static void build_parse (void);
1268 msym_text_symbol_type =
1269 init_type (TYPE_CODE_FUNC, 1, 0, "<text variable, no debug info>", NULL);
1270 TYPE_TARGET_TYPE (msym_text_symbol_type) = builtin_type_int;
1271 msym_data_symbol_type =
1272 init_type (TYPE_CODE_INT, TARGET_INT_BIT / HOST_CHAR_BIT, 0,
1273 "<data variable, no debug info>", NULL);
1274 msym_unknown_symbol_type =
1275 init_type (TYPE_CODE_INT, 1, 0,
1276 "<variable (not text or data), no debug info>",
1280 /* This function avoids direct calls to fprintf
1281 in the parser generated debug code. */
1283 parser_fprintf (FILE *x, const char *y, ...)
1288 vfprintf_unfiltered (gdb_stderr, y, args);
1291 fprintf_unfiltered (gdb_stderr, " Unknown FILE used.\n");
1292 vfprintf_unfiltered (gdb_stderr, y, args);
1298 _initialize_parse (void)
1300 type_stack_size = 80;
1301 type_stack_depth = 0;
1302 type_stack = (union type_stack_elt *)
1303 xmalloc (type_stack_size * sizeof (*type_stack));
1307 /* FIXME - For the moment, handle types by swapping them in and out.
1308 Should be using the per-architecture data-pointer and a large
1310 DEPRECATED_REGISTER_GDBARCH_SWAP (msym_text_symbol_type);
1311 DEPRECATED_REGISTER_GDBARCH_SWAP (msym_data_symbol_type);
1312 DEPRECATED_REGISTER_GDBARCH_SWAP (msym_unknown_symbol_type);
1313 deprecated_register_gdbarch_swap (NULL, 0, build_parse);
1315 deprecated_add_show_from_set
1316 (add_set_cmd ("expression", class_maintenance, var_zinteger,
1317 (char *) &expressiondebug,
1318 "Set expression debugging.\n\
1319 When non-zero, the internal representation of expressions will be printed.",