b50086a1b418df460351e8e0b20732bb0279b112
1 /* Print in infix form a struct expression.
2 Copyright (C) 1986, 1989, 1991 Free Software Foundation, Inc.
4 This file is part of GDB.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
23 #include "expression.h"
26 #include "parser-defs.h"
28 /* Prototypes for local functions */
31 print_subexp
PARAMS ((struct expression
*, int *, FILE *, enum precedence
));
34 print_simple_m2_func
PARAMS ((char *, struct expression
*, int *, FILE *));
37 print_expression (exp
, stream
)
38 struct expression
*exp
;
42 print_subexp (exp
, &pc
, stream
, PREC_NULL
);
45 /* Print the subexpression of EXP that starts in position POS, on STREAM.
46 PREC is the precedence of the surrounding operator;
47 if the precedence of the main operator of this subexpression is less,
48 parentheses are needed here. */
51 print_subexp (exp
, pos
, stream
, prec
)
52 register struct expression
*exp
;
57 register unsigned tem
;
58 register const struct op_print
*op_print_tab
;
61 register char *op_str
;
62 int assign_modify
= 0;
63 enum exp_opcode opcode
;
64 enum precedence myprec
;
65 /* Set to 1 for a right-associative operator. */
69 op_print_tab
= exp
->language_defn
->la_op_print_tab
;
71 opcode
= exp
->elts
[pc
].opcode
;
80 print_subexp (exp
, pos
, stream
,
81 (enum precedence
) ((int) myprec
+ assoc
));
82 fputs_filtered (" :: ", stream
);
83 nargs
= longest_to_int (exp
->elts
[pc
+ 2].longconst
);
84 (*pos
) += 2 + BYTES_TO_EXP_ELEM (nargs
+ 1);
85 fputs_filtered (&exp
->elts
[pc
+ 3].string
, stream
);
90 value_print (value_from_longest (exp
->elts
[pc
+ 1].type
,
91 exp
->elts
[pc
+ 2].longconst
),
92 stream
, 0, Val_no_prettyprint
);
97 value_print (value_from_double (exp
->elts
[pc
+ 1].type
,
98 exp
->elts
[pc
+ 2].doubleconst
),
99 stream
, 0, Val_no_prettyprint
);
104 fputs_filtered (SYMBOL_SOURCE_NAME (exp
->elts
[pc
+ 1].symbol
), stream
);
109 fprintf_filtered (stream
, "$%d",
110 longest_to_int (exp
->elts
[pc
+ 1].longconst
));
115 fprintf_filtered (stream
, "$%s",
116 reg_names
[longest_to_int (exp
->elts
[pc
+ 1].longconst
)]);
121 fprintf_filtered (stream
, "%s",
122 longest_to_int (exp
->elts
[pc
+ 1].longconst
)
128 fprintf_filtered (stream
, "$%s",
129 internalvar_name (exp
->elts
[pc
+ 1].internalvar
));
134 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
135 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
136 fputs_filtered (" (", stream
);
137 for (tem
= 0; tem
< nargs
; tem
++)
140 fputs_filtered (", ", stream
);
141 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
143 fputs_filtered (")", stream
);
147 nargs
= longest_to_int (exp
-> elts
[pc
+ 1].longconst
);
148 (*pos
) += 3 + BYTES_TO_EXP_ELEM (nargs
+ 1);
149 /* LA_PRINT_STRING will print using the current repeat count threshold.
150 If necessary, we can temporarily set it to zero, or pass it as an
151 additional parameter to LA_PRINT_STRING. -fnf */
152 LA_PRINT_STRING (stream
, &exp
->elts
[pc
+ 2].string
, nargs
, 0);
156 error ("support for OP_BITSTRING unimplemented");
160 error ("support for OP_ARRAY unimplemented");
164 if ((int) prec
> (int) PREC_COMMA
)
165 fputs_filtered ("(", stream
);
166 /* Print the subexpressions, forcing parentheses
167 around any binary operations within them.
168 This is more parentheses than are strictly necessary,
169 but it looks clearer. */
170 print_subexp (exp
, pos
, stream
, PREC_HYPER
);
171 fputs_filtered (" ? ", stream
);
172 print_subexp (exp
, pos
, stream
, PREC_HYPER
);
173 fputs_filtered (" : ", stream
);
174 print_subexp (exp
, pos
, stream
, PREC_HYPER
);
175 if ((int) prec
> (int) PREC_COMMA
)
176 fputs_filtered (")", stream
);
179 case STRUCTOP_STRUCT
:
180 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
181 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
182 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
183 fputs_filtered (".", stream
);
184 fputs_filtered (&exp
->elts
[pc
+ 2].string
, stream
);
187 /* Will not occur for Modula-2 */
189 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
190 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
191 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
192 fputs_filtered ("->", stream
);
193 fputs_filtered (&exp
->elts
[pc
+ 2].string
, stream
);
196 case BINOP_SUBSCRIPT
:
197 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
198 fputs_filtered ("[", stream
);
199 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
200 fputs_filtered ("]", stream
);
203 case UNOP_POSTINCREMENT
:
204 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
205 fputs_filtered ("++", stream
);
208 case UNOP_POSTDECREMENT
:
209 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
210 fputs_filtered ("--", stream
);
215 if ((int) prec
> (int) PREC_PREFIX
)
216 fputs_filtered ("(", stream
);
217 fputs_filtered ("(", stream
);
218 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
219 fputs_filtered (") ", stream
);
220 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
221 if ((int) prec
> (int) PREC_PREFIX
)
222 fputs_filtered (")", stream
);
227 if ((int) prec
> (int) PREC_PREFIX
)
228 fputs_filtered ("(", stream
);
229 if (exp
->elts
[pc
+ 1].type
->code
== TYPE_CODE_FUNC
&&
230 exp
->elts
[pc
+ 3].opcode
== OP_LONG
) {
231 /* We have a minimal symbol fn, probably. It's encoded
232 as a UNOP_MEMVAL (function-type) of an OP_LONG (int, address).
233 Swallow the OP_LONG (including both its opcodes); ignore
234 its type; print the value in the type of the MEMVAL. */
236 val
= value_at_lazy (exp
->elts
[pc
+ 1].type
,
237 (CORE_ADDR
) exp
->elts
[pc
+ 5].longconst
);
238 value_print (val
, stream
, 0, Val_no_prettyprint
);
240 fputs_filtered ("{", stream
);
241 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
242 fputs_filtered ("} ", stream
);
243 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
245 if ((int) prec
> (int) PREC_PREFIX
)
246 fputs_filtered (")", stream
);
249 case BINOP_ASSIGN_MODIFY
:
250 opcode
= exp
->elts
[pc
+ 1].opcode
;
252 myprec
= PREC_ASSIGN
;
256 for (tem
= 0; op_print_tab
[tem
].opcode
!= OP_NULL
; tem
++)
257 if (op_print_tab
[tem
].opcode
== opcode
)
259 op_str
= op_print_tab
[tem
].string
;
268 fputs_filtered ("this", stream
);
273 case MULTI_SUBSCRIPT
:
275 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
276 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
277 fprintf (stream
, " [");
278 for (tem
= 0; tem
< nargs
; tem
++)
281 fprintf (stream
, ", ");
282 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
284 fprintf (stream
, "]");
289 fprintf(stream
,"VAL(");
290 type_print(exp
->elts
[pc
+1].type
,"",stream
,0);
292 print_subexp(exp
,pos
,stream
,PREC_PREFIX
);
297 print_simple_m2_func("CAP",exp
,pos
,stream
);
301 print_simple_m2_func("CHR",exp
,pos
,stream
);
305 print_simple_m2_func("ORD",exp
,pos
,stream
);
309 print_simple_m2_func("ABS",exp
,pos
,stream
);
313 print_simple_m2_func("FLOAT",exp
,pos
,stream
);
317 print_simple_m2_func("HIGH",exp
,pos
,stream
);
321 print_simple_m2_func("MAX",exp
,pos
,stream
);
325 print_simple_m2_func("MIN",exp
,pos
,stream
);
329 print_simple_m2_func("ODD",exp
,pos
,stream
);
333 print_simple_m2_func("TRUNC",exp
,pos
,stream
);
338 error("print_subexp: Not implemented.");
344 for (tem
= 0; op_print_tab
[tem
].opcode
!= OP_NULL
; tem
++)
345 if (op_print_tab
[tem
].opcode
== opcode
)
347 op_str
= op_print_tab
[tem
].string
;
348 myprec
= op_print_tab
[tem
].precedence
;
349 assoc
= op_print_tab
[tem
].right_assoc
;
354 if ((int) myprec
< (int) prec
)
355 fputs_filtered ("(", stream
);
356 if ((int) opcode
> (int) BINOP_END
)
358 /* Unary prefix operator. */
359 fputs_filtered (op_str
, stream
);
360 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
364 /* Binary operator. */
365 /* Print left operand.
366 If operator is right-associative,
367 increment precedence for this operand. */
368 print_subexp (exp
, pos
, stream
,
369 (enum precedence
) ((int) myprec
+ assoc
));
370 /* Print the operator itself. */
372 fprintf_filtered (stream
, " %s= ", op_str
);
373 else if (op_str
[0] == ',')
374 fprintf_filtered (stream
, "%s ", op_str
);
376 fprintf_filtered (stream
, " %s ", op_str
);
377 /* Print right operand.
378 If operator is left-associative,
379 increment precedence for this operand. */
380 print_subexp (exp
, pos
, stream
,
381 (enum precedence
) ((int) myprec
+ !assoc
));
384 if ((int) myprec
< (int) prec
)
385 fputs_filtered (")", stream
);
388 /* Print out something of the form <s>(<arg>).
389 This is used to print out some builtin Modula-2
391 FIXME: There is probably some way to get the precedence
392 rules to do this (print a unary operand with parens around it). */
394 print_simple_m2_func(s
,exp
,pos
,stream
)
396 register struct expression
*exp
;
400 fprintf(stream
,"%s(",s
);
401 print_subexp(exp
,pos
,stream
,PREC_PREFIX
);
405 /* Return the operator corresponding to opcode OP as
406 a string. NULL indicates that the opcode was not found in the
407 current language table. */
413 register const struct op_print
*op_print_tab
;
415 op_print_tab
= current_language
->la_op_print_tab
;
416 for (tem
= 0; op_print_tab
[tem
].opcode
!= OP_NULL
; tem
++)
417 if (op_print_tab
[tem
].opcode
== op
)
418 return op_print_tab
[tem
].string
;
422 #ifdef DEBUG_EXPRESSIONS
424 /* Support for dumping the raw data from expressions in a human readable
428 dump_expression (exp
, stream
, note
)
429 struct expression
*exp
;
438 fprintf_filtered (stream
, "Dump of expression @ 0x%x, %s:\n", exp
, note
);
439 fprintf_filtered (stream
, "\tLanguage %s, %d elements, %d bytes each.\n",
440 exp
->language_defn
->la_name
, exp
-> nelts
,
441 sizeof (union exp_element
));
442 fprintf_filtered (stream
, "\t%5s %20s %16s %s\n", "Index", "Opcode",
443 "Hex Value", "String Value");
444 for (elt
= 0; elt
< exp
-> nelts
; elt
++)
446 fprintf_filtered (stream
, "\t%5d ", elt
);
447 switch (exp
-> elts
[elt
].opcode
)
449 default: opcode_name
= "<unknown>"; break;
450 case OP_NULL
: opcode_name
= "OP_NULL"; break;
451 case BINOP_ADD
: opcode_name
= "BINOP_ADD"; break;
452 case BINOP_SUB
: opcode_name
= "BINOP_SUB"; break;
453 case BINOP_MUL
: opcode_name
= "BINOP_MUL"; break;
454 case BINOP_DIV
: opcode_name
= "BINOP_DIV"; break;
455 case BINOP_REM
: opcode_name
= "BINOP_REM"; break;
456 case BINOP_MOD
: opcode_name
= "BINOP_MOD"; break;
457 case BINOP_LSH
: opcode_name
= "BINOP_LSH"; break;
458 case BINOP_RSH
: opcode_name
= "BINOP_RSH"; break;
459 case BINOP_LOGICAL_AND
: opcode_name
= "BINOP_LOGICAL_AND"; break;
460 case BINOP_LOGICAL_OR
: opcode_name
= "BINOP_LOGICAL_OR"; break;
461 case BINOP_BITWISE_AND
: opcode_name
= "BINOP_BITWISE_AND"; break;
462 case BINOP_BITWISE_IOR
: opcode_name
= "BINOP_BITWISE_IOR"; break;
463 case BINOP_BITWISE_XOR
: opcode_name
= "BINOP_BITWISE_XOR"; break;
464 case BINOP_EQUAL
: opcode_name
= "BINOP_EQUAL"; break;
465 case BINOP_NOTEQUAL
: opcode_name
= "BINOP_NOTEQUAL"; break;
466 case BINOP_LESS
: opcode_name
= "BINOP_LESS"; break;
467 case BINOP_GTR
: opcode_name
= "BINOP_GTR"; break;
468 case BINOP_LEQ
: opcode_name
= "BINOP_LEQ"; break;
469 case BINOP_GEQ
: opcode_name
= "BINOP_GEQ"; break;
470 case BINOP_REPEAT
: opcode_name
= "BINOP_REPEAT"; break;
471 case BINOP_ASSIGN
: opcode_name
= "BINOP_ASSIGN"; break;
472 case BINOP_COMMA
: opcode_name
= "BINOP_COMMA"; break;
473 case BINOP_SUBSCRIPT
: opcode_name
= "BINOP_SUBSCRIPT"; break;
474 case MULTI_SUBSCRIPT
: opcode_name
= "MULTI_SUBSCRIPT"; break;
475 case BINOP_EXP
: opcode_name
= "BINOP_EXP"; break;
476 case BINOP_MIN
: opcode_name
= "BINOP_MIN"; break;
477 case BINOP_MAX
: opcode_name
= "BINOP_MAX"; break;
478 case BINOP_SCOPE
: opcode_name
= "BINOP_SCOPE"; break;
479 case STRUCTOP_MEMBER
: opcode_name
= "STRUCTOP_MEMBER"; break;
480 case STRUCTOP_MPTR
: opcode_name
= "STRUCTOP_MPTR"; break;
481 case BINOP_INTDIV
: opcode_name
= "BINOP_INTDIV"; break;
482 case BINOP_ASSIGN_MODIFY
: opcode_name
= "BINOP_ASSIGN_MODIFY"; break;
483 case BINOP_VAL
: opcode_name
= "BINOP_VAL"; break;
484 case BINOP_INCL
: opcode_name
= "BINOP_INCL"; break;
485 case BINOP_EXCL
: opcode_name
= "BINOP_EXCL"; break;
486 case BINOP_END
: opcode_name
= "BINOP_END"; break;
487 case TERNOP_COND
: opcode_name
= "TERNOP_COND"; break;
488 case OP_LONG
: opcode_name
= "OP_LONG"; break;
489 case OP_DOUBLE
: opcode_name
= "OP_DOUBLE"; break;
490 case OP_VAR_VALUE
: opcode_name
= "OP_VAR_VALUE"; break;
491 case OP_LAST
: opcode_name
= "OP_LAST"; break;
492 case OP_REGISTER
: opcode_name
= "OP_REGISTER"; break;
493 case OP_INTERNALVAR
: opcode_name
= "OP_INTERNALVAR"; break;
494 case OP_FUNCALL
: opcode_name
= "OP_FUNCALL"; break;
495 case OP_STRING
: opcode_name
= "OP_STRING"; break;
496 case OP_BITSTRING
: opcode_name
= "OP_BITSTRING"; break;
497 case OP_ARRAY
: opcode_name
= "OP_ARRAY"; break;
498 case UNOP_CAST
: opcode_name
= "UNOP_CAST"; break;
499 case UNOP_MEMVAL
: opcode_name
= "UNOP_MEMVAL"; break;
500 case UNOP_NEG
: opcode_name
= "UNOP_NEG"; break;
501 case UNOP_LOGICAL_NOT
: opcode_name
= "UNOP_LOGICAL_NOT"; break;
502 case UNOP_COMPLEMENT
: opcode_name
= "UNOP_COMPLEMENT"; break;
503 case UNOP_IND
: opcode_name
= "UNOP_IND"; break;
504 case UNOP_ADDR
: opcode_name
= "UNOP_ADDR"; break;
505 case UNOP_PREINCREMENT
: opcode_name
= "UNOP_PREINCREMENT"; break;
506 case UNOP_POSTINCREMENT
: opcode_name
= "UNOP_POSTINCREMENT"; break;
507 case UNOP_PREDECREMENT
: opcode_name
= "UNOP_PREDECREMENT"; break;
508 case UNOP_POSTDECREMENT
: opcode_name
= "UNOP_POSTDECREMENT"; break;
509 case UNOP_SIZEOF
: opcode_name
= "UNOP_SIZEOF"; break;
510 case UNOP_PLUS
: opcode_name
= "UNOP_PLUS"; break;
511 case UNOP_CAP
: opcode_name
= "UNOP_CAP"; break;
512 case UNOP_CHR
: opcode_name
= "UNOP_CHR"; break;
513 case UNOP_ORD
: opcode_name
= "UNOP_ORD"; break;
514 case UNOP_ABS
: opcode_name
= "UNOP_ABS"; break;
515 case UNOP_FLOAT
: opcode_name
= "UNOP_FLOAT"; break;
516 case UNOP_HIGH
: opcode_name
= "UNOP_HIGH"; break;
517 case UNOP_MAX
: opcode_name
= "UNOP_MAX"; break;
518 case UNOP_MIN
: opcode_name
= "UNOP_MIN"; break;
519 case UNOP_ODD
: opcode_name
= "UNOP_ODD"; break;
520 case UNOP_TRUNC
: opcode_name
= "UNOP_TRUNC"; break;
521 case OP_BOOL
: opcode_name
= "OP_BOOL"; break;
522 case OP_M2_STRING
: opcode_name
= "OP_M2_STRING"; break;
523 case STRUCTOP_STRUCT
: opcode_name
= "STRUCTOP_STRUCT"; break;
524 case STRUCTOP_PTR
: opcode_name
= "STRUCTOP_PTR"; break;
525 case OP_THIS
: opcode_name
= "OP_THIS"; break;
526 case OP_SCOPE
: opcode_name
= "OP_SCOPE"; break;
527 case OP_TYPE
: opcode_name
= "OP_TYPE"; break;
529 fprintf_filtered (stream
, "%20s ", opcode_name
);
530 fprintf_filtered (stream
,
531 #if defined (LONG_LONG)
536 exp
-> elts
[elt
].longconst
);
538 for (eltscan
= (char *) &exp
->elts
[elt
],
539 eltsize
= sizeof (union exp_element
) ;
543 fprintf_filtered (stream
, "%c",
544 isprint (*eltscan
) ? (*eltscan
& 0xFF) : '.');
546 fprintf_filtered (stream
, "\n");
550 #endif /* DEBUG_EXPRESSIONS */
This page took 0.041059 seconds and 4 git commands to generate.