1 /* Print in infix form a struct expression.
3 Copyright 1986, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
4 1998, 1999, 2000, 2003 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
26 #include "expression.h"
29 #include "parser-defs.h"
30 #include "user-regs.h" /* For user_reg_map_regnum_to_name. */
32 #include "gdb_string.h"
40 print_expression (struct expression
*exp
, struct ui_file
*stream
)
43 print_subexp (exp
, &pc
, stream
, PREC_NULL
);
46 /* Print the subexpression of EXP that starts in position POS, on STREAM.
47 PREC is the precedence of the surrounding operator;
48 if the precedence of the main operator of this subexpression is less,
49 parentheses are needed here. */
52 print_subexp (struct expression
*exp
, int *pos
,
53 struct ui_file
*stream
, enum precedence prec
)
55 exp
->language_defn
->la_exp_desc
->print_subexp (exp
, pos
, stream
, prec
);
58 /* Standard implementation of print_subexp for use in language_defn
61 print_subexp_standard (struct expression
*exp
, int *pos
,
62 struct ui_file
*stream
, enum precedence prec
)
65 const struct op_print
*op_print_tab
;
69 int assign_modify
= 0;
70 enum exp_opcode opcode
;
71 enum precedence myprec
= PREC_NULL
;
72 /* Set to 1 for a right-associative operator. */
77 op_print_tab
= exp
->language_defn
->la_op_print_tab
;
79 opcode
= exp
->elts
[pc
].opcode
;
87 fputs_filtered (type_name_no_tag (exp
->elts
[pc
+ 1].type
), stream
);
88 fputs_filtered ("::", stream
);
89 nargs
= longest_to_int (exp
->elts
[pc
+ 2].longconst
);
90 (*pos
) += 4 + BYTES_TO_EXP_ELEM (nargs
+ 1);
91 fputs_filtered (&exp
->elts
[pc
+ 3].string
, stream
);
96 value_print (value_from_longest (exp
->elts
[pc
+ 1].type
,
97 exp
->elts
[pc
+ 2].longconst
),
98 stream
, 0, Val_no_prettyprint
);
103 value_print (value_from_double (exp
->elts
[pc
+ 1].type
,
104 exp
->elts
[pc
+ 2].doubleconst
),
105 stream
, 0, Val_no_prettyprint
);
112 b
= exp
->elts
[pc
+ 1].block
;
114 && BLOCK_FUNCTION (b
) != NULL
115 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)) != NULL
)
117 fputs_filtered (SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)), stream
);
118 fputs_filtered ("::", stream
);
120 fputs_filtered (SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
126 fprintf_filtered (stream
, "$%d",
127 longest_to_int (exp
->elts
[pc
+ 1].longconst
));
132 int regnum
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
133 const char *name
= user_reg_map_regnum_to_name (current_gdbarch
,
136 fprintf_filtered (stream
, "$%s", name
);
142 fprintf_filtered (stream
, "%s",
143 longest_to_int (exp
->elts
[pc
+ 1].longconst
)
149 fprintf_filtered (stream
, "$%s",
150 internalvar_name (exp
->elts
[pc
+ 1].internalvar
));
155 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
156 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
157 fputs_filtered (" (", stream
);
158 for (tem
= 0; tem
< nargs
; tem
++)
161 fputs_filtered (", ", stream
);
162 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
164 fputs_filtered (")", stream
);
169 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
170 (*pos
) += 3 + BYTES_TO_EXP_ELEM (nargs
+ 1);
171 fputs_filtered (&exp
->elts
[pc
+ 2].string
, stream
);
175 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
176 (*pos
) += 3 + BYTES_TO_EXP_ELEM (nargs
+ 1);
177 /* LA_PRINT_STRING will print using the current repeat count threshold.
178 If necessary, we can temporarily set it to zero, or pass it as an
179 additional parameter to LA_PRINT_STRING. -fnf */
180 LA_PRINT_STRING (stream
, &exp
->elts
[pc
+ 2].string
, nargs
, 1, 0);
184 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
186 += 3 + BYTES_TO_EXP_ELEM ((nargs
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
);
187 fprintf_unfiltered (stream
, "B'<unimplemented>'");
190 case OP_OBJC_NSSTRING
: /* Objective-C Foundation Class NSString constant. */
191 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
192 (*pos
) += 3 + BYTES_TO_EXP_ELEM (nargs
+ 1);
193 fputs_filtered ("@\"", stream
);
194 LA_PRINT_STRING (stream
, &exp
->elts
[pc
+ 2].string
, nargs
, 1, 0);
195 fputs_filtered ("\"", stream
);
198 case OP_OBJC_MSGCALL
:
199 { /* Objective C message (method) call. */
202 nargs
= longest_to_int (exp
->elts
[pc
+ 2].longconst
);
203 fprintf_unfiltered (stream
, "[");
204 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
205 if (0 == target_read_string (exp
->elts
[pc
+ 1].longconst
,
206 &selector
, 1024, NULL
))
208 error ("bad selector");
214 s
= alloca (strlen (selector
) + 1);
215 strcpy (s
, selector
);
216 for (tem
= 0; tem
< nargs
; tem
++)
218 nextS
= strchr (s
, ':');
220 fprintf_unfiltered (stream
, " %s: ", s
);
222 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
227 fprintf_unfiltered (stream
, " %s", selector
);
229 fprintf_unfiltered (stream
, "]");
230 /* "selector" was malloc'd by target_read_string. Free it. */
237 nargs
= longest_to_int (exp
->elts
[pc
+ 2].longconst
);
238 nargs
-= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
241 if (exp
->elts
[pc
+ 4].opcode
== OP_LONG
242 && exp
->elts
[pc
+ 5].type
== builtin_type_char
243 && exp
->language_defn
->la_language
== language_c
)
245 /* Attempt to print C character arrays using string syntax.
246 Walk through the args, picking up one character from each
247 of the OP_LONG expression elements. If any array element
248 does not match our expection of what we should find for
249 a simple string, revert back to array printing. Note that
250 the last expression element is an explicit null terminator
251 byte, which doesn't get printed. */
252 tempstr
= alloca (nargs
);
256 if (exp
->elts
[pc
].opcode
!= OP_LONG
257 || exp
->elts
[pc
+ 1].type
!= builtin_type_char
)
259 /* Not a simple array of char, use regular array printing. */
266 longest_to_int (exp
->elts
[pc
+ 2].longconst
);
273 LA_PRINT_STRING (stream
, tempstr
, nargs
- 1, 1, 0);
278 fputs_filtered (" {", stream
);
279 for (tem
= 0; tem
< nargs
; tem
++)
283 fputs_filtered (", ", stream
);
285 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
287 fputs_filtered ("}", stream
);
292 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
293 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
294 /* Gcc support both these syntaxes. Unsure which is preferred. */
296 fputs_filtered (&exp
->elts
[pc
+ 2].string
, stream
);
297 fputs_filtered (": ", stream
);
299 fputs_filtered (".", stream
);
300 fputs_filtered (&exp
->elts
[pc
+ 2].string
, stream
);
301 fputs_filtered ("=", stream
);
303 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
307 if ((int) prec
> (int) PREC_COMMA
)
308 fputs_filtered ("(", stream
);
309 /* Print the subexpressions, forcing parentheses
310 around any binary operations within them.
311 This is more parentheses than are strictly necessary,
312 but it looks clearer. */
313 print_subexp (exp
, pos
, stream
, PREC_HYPER
);
314 fputs_filtered (" ? ", stream
);
315 print_subexp (exp
, pos
, stream
, PREC_HYPER
);
316 fputs_filtered (" : ", stream
);
317 print_subexp (exp
, pos
, stream
, PREC_HYPER
);
318 if ((int) prec
> (int) PREC_COMMA
)
319 fputs_filtered (")", stream
);
323 case TERNOP_SLICE_COUNT
:
324 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
325 fputs_filtered ("(", stream
);
326 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
327 fputs_filtered (opcode
== TERNOP_SLICE
? " : " : " UP ", stream
);
328 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
329 fputs_filtered (")", stream
);
332 case STRUCTOP_STRUCT
:
333 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
334 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
335 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
336 fputs_filtered (".", stream
);
337 fputs_filtered (&exp
->elts
[pc
+ 2].string
, stream
);
340 /* Will not occur for Modula-2 */
342 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
343 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
344 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
345 fputs_filtered ("->", stream
);
346 fputs_filtered (&exp
->elts
[pc
+ 2].string
, stream
);
349 case BINOP_SUBSCRIPT
:
350 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
351 fputs_filtered ("[", stream
);
352 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
353 fputs_filtered ("]", stream
);
356 case UNOP_POSTINCREMENT
:
357 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
358 fputs_filtered ("++", stream
);
361 case UNOP_POSTDECREMENT
:
362 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
363 fputs_filtered ("--", stream
);
368 if ((int) prec
> (int) PREC_PREFIX
)
369 fputs_filtered ("(", stream
);
370 fputs_filtered ("(", stream
);
371 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
372 fputs_filtered (") ", stream
);
373 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
374 if ((int) prec
> (int) PREC_PREFIX
)
375 fputs_filtered (")", stream
);
380 if ((int) prec
> (int) PREC_PREFIX
)
381 fputs_filtered ("(", stream
);
382 if (TYPE_CODE (exp
->elts
[pc
+ 1].type
) == TYPE_CODE_FUNC
&&
383 exp
->elts
[pc
+ 3].opcode
== OP_LONG
)
385 /* We have a minimal symbol fn, probably. It's encoded
386 as a UNOP_MEMVAL (function-type) of an OP_LONG (int, address).
387 Swallow the OP_LONG (including both its opcodes); ignore
388 its type; print the value in the type of the MEMVAL. */
390 val
= value_at_lazy (exp
->elts
[pc
+ 1].type
,
391 (CORE_ADDR
) exp
->elts
[pc
+ 5].longconst
);
392 value_print (val
, stream
, 0, Val_no_prettyprint
);
396 fputs_filtered ("{", stream
);
397 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
398 fputs_filtered ("} ", stream
);
399 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
401 if ((int) prec
> (int) PREC_PREFIX
)
402 fputs_filtered (")", stream
);
405 case BINOP_ASSIGN_MODIFY
:
406 opcode
= exp
->elts
[pc
+ 1].opcode
;
408 myprec
= PREC_ASSIGN
;
412 for (tem
= 0; op_print_tab
[tem
].opcode
!= OP_NULL
; tem
++)
413 if (op_print_tab
[tem
].opcode
== opcode
)
415 op_str
= op_print_tab
[tem
].string
;
418 if (op_print_tab
[tem
].opcode
!= opcode
)
419 /* Not found; don't try to keep going because we don't know how
420 to interpret further elements. */
421 error ("Invalid expression");
428 fputs_filtered ("this", stream
);
431 /* Objective-C ops */
435 fputs_filtered ("self", stream
); /* The ObjC equivalent of "this". */
440 case MULTI_SUBSCRIPT
:
442 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
443 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
444 fprintf_unfiltered (stream
, " [");
445 for (tem
= 0; tem
< nargs
; tem
++)
448 fprintf_unfiltered (stream
, ", ");
449 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
451 fprintf_unfiltered (stream
, "]");
456 fprintf_unfiltered (stream
, "VAL(");
457 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
458 fprintf_unfiltered (stream
, ",");
459 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
460 fprintf_unfiltered (stream
, ")");
465 error ("print_subexp: Not implemented.");
471 for (tem
= 0; op_print_tab
[tem
].opcode
!= OP_NULL
; tem
++)
472 if (op_print_tab
[tem
].opcode
== opcode
)
474 op_str
= op_print_tab
[tem
].string
;
475 myprec
= op_print_tab
[tem
].precedence
;
476 assoc
= op_print_tab
[tem
].right_assoc
;
479 if (op_print_tab
[tem
].opcode
!= opcode
)
480 /* Not found; don't try to keep going because we don't know how
481 to interpret further elements. For example, this happens
482 if opcode is OP_TYPE. */
483 error ("Invalid expression");
486 /* Note that PREC_BUILTIN will always emit parentheses. */
487 if ((int) myprec
< (int) prec
)
488 fputs_filtered ("(", stream
);
489 if ((int) opcode
> (int) BINOP_END
)
493 /* Unary postfix operator. */
494 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
495 fputs_filtered (op_str
, stream
);
499 /* Unary prefix operator. */
500 fputs_filtered (op_str
, stream
);
501 if (myprec
== PREC_BUILTIN_FUNCTION
)
502 fputs_filtered ("(", stream
);
503 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
504 if (myprec
== PREC_BUILTIN_FUNCTION
)
505 fputs_filtered (")", stream
);
510 /* Binary operator. */
511 /* Print left operand.
512 If operator is right-associative,
513 increment precedence for this operand. */
514 print_subexp (exp
, pos
, stream
,
515 (enum precedence
) ((int) myprec
+ assoc
));
516 /* Print the operator itself. */
518 fprintf_filtered (stream
, " %s= ", op_str
);
519 else if (op_str
[0] == ',')
520 fprintf_filtered (stream
, "%s ", op_str
);
522 fprintf_filtered (stream
, " %s ", op_str
);
523 /* Print right operand.
524 If operator is left-associative,
525 increment precedence for this operand. */
526 print_subexp (exp
, pos
, stream
,
527 (enum precedence
) ((int) myprec
+ !assoc
));
530 if ((int) myprec
< (int) prec
)
531 fputs_filtered (")", stream
);
534 /* Return the operator corresponding to opcode OP as
535 a string. NULL indicates that the opcode was not found in the
536 current language table. */
538 op_string (enum exp_opcode op
)
541 const struct op_print
*op_print_tab
;
543 op_print_tab
= current_language
->la_op_print_tab
;
544 for (tem
= 0; op_print_tab
[tem
].opcode
!= OP_NULL
; tem
++)
545 if (op_print_tab
[tem
].opcode
== op
)
546 return op_print_tab
[tem
].string
;
550 /* Support for dumping the raw data from expressions in a human readable
553 static char *op_name (struct expression
*, enum exp_opcode
);
554 static int dump_subexp_body (struct expression
*exp
, struct ui_file
*, int);
556 /* Name for OPCODE, when it appears in expression EXP. */
559 op_name (struct expression
*exp
, enum exp_opcode opcode
)
561 return exp
->language_defn
->la_exp_desc
->op_name (opcode
);
564 /* Default name for the standard operator OPCODE (i.e., one defined in
565 the definition of enum exp_opcode). */
568 op_name_standard (enum exp_opcode opcode
)
576 sprintf (buf
, "<unknown %d>", opcode
);
597 case BINOP_LOGICAL_AND
:
598 return "BINOP_LOGICAL_AND";
599 case BINOP_LOGICAL_OR
:
600 return "BINOP_LOGICAL_OR";
601 case BINOP_BITWISE_AND
:
602 return "BINOP_BITWISE_AND";
603 case BINOP_BITWISE_IOR
:
604 return "BINOP_BITWISE_IOR";
605 case BINOP_BITWISE_XOR
:
606 return "BINOP_BITWISE_XOR";
608 return "BINOP_EQUAL";
610 return "BINOP_NOTEQUAL";
620 return "BINOP_REPEAT";
622 return "BINOP_ASSIGN";
624 return "BINOP_COMMA";
625 case BINOP_SUBSCRIPT
:
626 return "BINOP_SUBSCRIPT";
627 case MULTI_SUBSCRIPT
:
628 return "MULTI_SUBSCRIPT";
635 case STRUCTOP_MEMBER
:
636 return "STRUCTOP_MEMBER";
638 return "STRUCTOP_MPTR";
640 return "BINOP_INTDIV";
641 case BINOP_ASSIGN_MODIFY
:
642 return "BINOP_ASSIGN_MODIFY";
650 return "BINOP_CONCAT";
652 return "BINOP_RANGE";
656 return "TERNOP_COND";
658 return "TERNOP_SLICE";
659 case TERNOP_SLICE_COUNT
:
660 return "TERNOP_SLICE_COUNT";
666 return "OP_VAR_VALUE";
670 return "OP_REGISTER";
672 return "OP_INTERNALVAR";
678 return "OP_BITSTRING";
684 return "UNOP_MEMVAL";
687 case UNOP_LOGICAL_NOT
:
688 return "UNOP_LOGICAL_NOT";
689 case UNOP_COMPLEMENT
:
690 return "UNOP_COMPLEMENT";
695 case UNOP_PREINCREMENT
:
696 return "UNOP_PREINCREMENT";
697 case UNOP_POSTINCREMENT
:
698 return "UNOP_POSTINCREMENT";
699 case UNOP_PREDECREMENT
:
700 return "UNOP_PREDECREMENT";
701 case UNOP_POSTDECREMENT
:
702 return "UNOP_POSTDECREMENT";
704 return "UNOP_SIZEOF";
710 return "UNOP_LENGTH";
736 return "OP_M2_STRING";
737 case STRUCTOP_STRUCT
:
738 return "STRUCTOP_STRUCT";
740 return "STRUCTOP_PTR";
744 return "OP_OBJC_SELF";
755 dump_raw_expression (struct expression
*exp
, struct ui_file
*stream
,
763 fprintf_filtered (stream
, "Dump of expression @ ");
764 gdb_print_host_address (exp
, stream
);
765 fprintf_filtered (stream
, "'\n\tLanguage %s, %d elements, %ld bytes each.\n",
766 exp
->language_defn
->la_name
, exp
->nelts
,
767 (long) sizeof (union exp_element
));
768 fprintf_filtered (stream
, "\t%5s %20s %16s %s\n", "Index", "Opcode",
769 "Hex Value", "String Value");
770 for (elt
= 0; elt
< exp
->nelts
; elt
++)
772 fprintf_filtered (stream
, "\t%5d ", elt
);
773 opcode_name
= op_name (exp
, exp
->elts
[elt
].opcode
);
775 fprintf_filtered (stream
, "%20s ", opcode_name
);
776 print_longest (stream
, 'd', 0, exp
->elts
[elt
].longconst
);
777 fprintf_filtered (stream
, " ");
779 for (eltscan
= (char *) &exp
->elts
[elt
],
780 eltsize
= sizeof (union exp_element
);
784 fprintf_filtered (stream
, "%c",
785 isprint (*eltscan
) ? (*eltscan
& 0xFF) : '.');
787 fprintf_filtered (stream
, "\n");
791 /* Dump the subexpression of prefix expression EXP whose operator is at
792 position ELT onto STREAM. Returns the position of the next
793 subexpression in EXP. */
796 dump_subexp (struct expression
*exp
, struct ui_file
*stream
, int elt
)
798 static int indent
= 0;
801 fprintf_filtered (stream
, "\n");
802 fprintf_filtered (stream
, "\t%5d ", elt
);
804 for (i
= 1; i
<= indent
; i
++)
805 fprintf_filtered (stream
, " ");
808 fprintf_filtered (stream
, "%-20s ", op_name (exp
, exp
->elts
[elt
].opcode
));
810 elt
= dump_subexp_body (exp
, stream
, elt
);
817 /* Dump the operands of prefix expression EXP whose opcode is at
818 position ELT onto STREAM. Returns the position of the next
819 subexpression in EXP. */
822 dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
824 return exp
->language_defn
->la_exp_desc
->dump_subexp_body (exp
, stream
, elt
);
827 /* Default value for subexp_body in exp_descriptor vector. */
830 dump_subexp_body_standard (struct expression
*exp
,
831 struct ui_file
*stream
, int elt
)
833 int opcode
= exp
->elts
[elt
++].opcode
;
839 case TERNOP_SLICE_COUNT
:
840 elt
= dump_subexp (exp
, stream
, elt
);
849 case BINOP_LOGICAL_AND
:
850 case BINOP_LOGICAL_OR
:
851 case BINOP_BITWISE_AND
:
852 case BINOP_BITWISE_IOR
:
853 case BINOP_BITWISE_XOR
:
863 case BINOP_SUBSCRIPT
:
868 case BINOP_ASSIGN_MODIFY
:
876 elt
= dump_subexp (exp
, stream
, elt
);
878 case UNOP_LOGICAL_NOT
:
879 case UNOP_COMPLEMENT
:
882 case UNOP_PREINCREMENT
:
883 case UNOP_POSTINCREMENT
:
884 case UNOP_PREDECREMENT
:
885 case UNOP_POSTDECREMENT
:
904 elt
= dump_subexp (exp
, stream
, elt
);
907 fprintf_filtered (stream
, "Type @");
908 gdb_print_host_address (exp
->elts
[elt
].type
, stream
);
909 fprintf_filtered (stream
, " (");
910 type_print (exp
->elts
[elt
].type
, NULL
, stream
, 0);
911 fprintf_filtered (stream
, "), value %ld (0x%lx)",
912 (long) exp
->elts
[elt
+ 1].longconst
,
913 (long) exp
->elts
[elt
+ 1].longconst
);
917 fprintf_filtered (stream
, "Type @");
918 gdb_print_host_address (exp
->elts
[elt
].type
, stream
);
919 fprintf_filtered (stream
, " (");
920 type_print (exp
->elts
[elt
].type
, NULL
, stream
, 0);
921 fprintf_filtered (stream
, "), value %g",
922 (double) exp
->elts
[elt
+ 1].doubleconst
);
926 fprintf_filtered (stream
, "Block @");
927 gdb_print_host_address (exp
->elts
[elt
].block
, stream
);
928 fprintf_filtered (stream
, ", symbol @");
929 gdb_print_host_address (exp
->elts
[elt
+ 1].symbol
, stream
);
930 fprintf_filtered (stream
, " (%s)",
931 DEPRECATED_SYMBOL_NAME (exp
->elts
[elt
+ 1].symbol
));
935 fprintf_filtered (stream
, "History element %ld",
936 (long) exp
->elts
[elt
].longconst
);
940 fprintf_filtered (stream
, "Register %ld",
941 (long) exp
->elts
[elt
].longconst
);
945 fprintf_filtered (stream
, "Internal var @");
946 gdb_print_host_address (exp
->elts
[elt
].internalvar
, stream
);
947 fprintf_filtered (stream
, " (%s)",
948 exp
->elts
[elt
].internalvar
->name
);
955 nargs
= longest_to_int (exp
->elts
[elt
].longconst
);
957 fprintf_filtered (stream
, "Number of args: %d", nargs
);
960 for (i
= 1; i
<= nargs
+ 1; i
++)
961 elt
= dump_subexp (exp
, stream
, elt
);
969 lower
= longest_to_int (exp
->elts
[elt
].longconst
);
970 upper
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
972 fprintf_filtered (stream
, "Bounds [%d:%d]", lower
, upper
);
975 for (i
= 1; i
<= upper
- lower
+ 1; i
++)
976 elt
= dump_subexp (exp
, stream
, elt
);
981 fprintf_filtered (stream
, "Type @");
982 gdb_print_host_address (exp
->elts
[elt
].type
, stream
);
983 fprintf_filtered (stream
, " (");
984 type_print (exp
->elts
[elt
].type
, NULL
, stream
, 0);
985 fprintf_filtered (stream
, ")");
986 elt
= dump_subexp (exp
, stream
, elt
+ 2);
989 fprintf_filtered (stream
, "Type @");
990 gdb_print_host_address (exp
->elts
[elt
].type
, stream
);
991 fprintf_filtered (stream
, " (");
992 type_print (exp
->elts
[elt
].type
, NULL
, stream
, 0);
993 fprintf_filtered (stream
, ")");
996 case STRUCTOP_STRUCT
:
1002 len
= longest_to_int (exp
->elts
[elt
].longconst
);
1003 elem_name
= &exp
->elts
[elt
+ 1].string
;
1005 fprintf_filtered (stream
, "Element name: `%.*s'", len
, elem_name
);
1006 elt
= dump_subexp (exp
, stream
, elt
+ 3 + BYTES_TO_EXP_ELEM (len
+ 1));
1014 fprintf_filtered (stream
, "Type @");
1015 gdb_print_host_address (exp
->elts
[elt
].type
, stream
);
1016 fprintf_filtered (stream
, " (");
1017 type_print (exp
->elts
[elt
].type
, NULL
, stream
, 0);
1018 fprintf_filtered (stream
, ") ");
1020 len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
1021 elem_name
= &exp
->elts
[elt
+ 2].string
;
1023 fprintf_filtered (stream
, "Field name: `%.*s'", len
, elem_name
);
1024 elt
+= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
1029 case STRUCTOP_MEMBER
:
1031 case MULTI_SUBSCRIPT
:
1032 case OP_F77_UNDETERMINED_ARGLIST
:
1042 fprintf_filtered (stream
, "Unknown format");
1049 dump_prefix_expression (struct expression
*exp
, struct ui_file
*stream
)
1053 fprintf_filtered (stream
, "Dump of expression @ ");
1054 gdb_print_host_address (exp
, stream
);
1055 fputs_filtered (", after conversion to prefix form:\nExpression: `", stream
);
1056 if (exp
->elts
[0].opcode
!= OP_TYPE
)
1057 print_expression (exp
, stream
);
1059 fputs_filtered ("Type printing not yet supported....", stream
);
1060 fprintf_filtered (stream
, "'\n\tLanguage %s, %d elements, %ld bytes each.\n",
1061 exp
->language_defn
->la_name
, exp
->nelts
,
1062 (long) sizeof (union exp_element
));
1063 fputs_filtered ("\n", stream
);
1065 for (elt
= 0; elt
< exp
->nelts
;)
1066 elt
= dump_subexp (exp
, stream
, elt
);
1067 fputs_filtered ("\n", stream
);