1 /* Print in infix form a struct expression.
2 Copyright 1986, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GDB.
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.
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.
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., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
25 #include "expression.h"
28 #include "parser-defs.h"
34 /* Prototypes for local functions */
36 static void print_subexp (struct expression *, int *, struct ui_file *,
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 (register struct expression *exp, register int *pos,
53 struct ui_file *stream, enum precedence prec)
55 register unsigned tem;
56 register const struct op_print *op_print_tab;
59 register char *op_str;
60 int assign_modify = 0;
61 enum exp_opcode opcode;
62 enum precedence myprec = PREC_NULL;
63 /* Set to 1 for a right-associative operator. */
68 op_print_tab = exp->language_defn->la_op_print_tab;
70 opcode = exp->elts[pc].opcode;
78 fputs_filtered (type_name_no_tag (exp->elts[pc + 1].type), stream);
79 fputs_filtered ("::", stream);
80 nargs = longest_to_int (exp->elts[pc + 2].longconst);
81 (*pos) += 4 + BYTES_TO_EXP_ELEM (nargs + 1);
82 fputs_filtered (&exp->elts[pc + 3].string, stream);
87 value_print (value_from_longest (exp->elts[pc + 1].type,
88 exp->elts[pc + 2].longconst),
89 stream, 0, Val_no_prettyprint);
94 value_print (value_from_double (exp->elts[pc + 1].type,
95 exp->elts[pc + 2].doubleconst),
96 stream, 0, Val_no_prettyprint);
103 b = exp->elts[pc + 1].block;
105 && BLOCK_FUNCTION (b) != NULL
106 && SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b)) != NULL)
108 fputs_filtered (SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b)), stream);
109 fputs_filtered ("::", stream);
111 fputs_filtered (SYMBOL_SOURCE_NAME (exp->elts[pc + 2].symbol), stream);
117 fprintf_filtered (stream, "$%d",
118 longest_to_int (exp->elts[pc + 1].longconst));
123 fprintf_filtered (stream, "$%s",
124 REGISTER_NAME (longest_to_int (exp->elts[pc + 1].longconst)));
129 fprintf_filtered (stream, "%s",
130 longest_to_int (exp->elts[pc + 1].longconst)
136 fprintf_filtered (stream, "$%s",
137 internalvar_name (exp->elts[pc + 1].internalvar));
142 nargs = longest_to_int (exp->elts[pc + 1].longconst);
143 print_subexp (exp, pos, stream, PREC_SUFFIX);
144 fputs_filtered (" (", stream);
145 for (tem = 0; tem < nargs; tem++)
148 fputs_filtered (", ", stream);
149 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
151 fputs_filtered (")", stream);
156 nargs = longest_to_int (exp->elts[pc + 1].longconst);
157 (*pos) += 3 + BYTES_TO_EXP_ELEM (nargs + 1);
158 fputs_filtered (&exp->elts[pc + 2].string, stream);
162 nargs = longest_to_int (exp->elts[pc + 1].longconst);
163 (*pos) += 3 + BYTES_TO_EXP_ELEM (nargs + 1);
164 /* LA_PRINT_STRING will print using the current repeat count threshold.
165 If necessary, we can temporarily set it to zero, or pass it as an
166 additional parameter to LA_PRINT_STRING. -fnf */
167 LA_PRINT_STRING (stream, &exp->elts[pc + 2].string, nargs, 1, 0);
171 nargs = longest_to_int (exp->elts[pc + 1].longconst);
173 += 3 + BYTES_TO_EXP_ELEM ((nargs + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT);
174 fprintf_unfiltered (stream, "B'<unimplemented>'");
179 nargs = longest_to_int (exp->elts[pc + 2].longconst);
180 nargs -= longest_to_int (exp->elts[pc + 1].longconst);
183 if (exp->elts[pc + 4].opcode == OP_LONG
184 && exp->elts[pc + 5].type == builtin_type_char
185 && exp->language_defn->la_language == language_c)
187 /* Attempt to print C character arrays using string syntax.
188 Walk through the args, picking up one character from each
189 of the OP_LONG expression elements. If any array element
190 does not match our expection of what we should find for
191 a simple string, revert back to array printing. Note that
192 the last expression element is an explicit null terminator
193 byte, which doesn't get printed. */
194 tempstr = alloca (nargs);
198 if (exp->elts[pc].opcode != OP_LONG
199 || exp->elts[pc + 1].type != builtin_type_char)
201 /* Not a simple array of char, use regular array printing. */
208 longest_to_int (exp->elts[pc + 2].longconst);
215 LA_PRINT_STRING (stream, tempstr, nargs - 1, 1, 0);
220 /* OBSOLETE int is_chill = exp->language_defn->la_language == language_chill; */
221 /* OBSOLETE fputs_filtered (is_chill ? " [" : " {", stream); */
222 fputs_filtered (" {", stream);
223 for (tem = 0; tem < nargs; tem++)
227 fputs_filtered (", ", stream);
229 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
231 /* OBSOLETE fputs_filtered (is_chill ? "]" : "}", stream); */
232 fputs_filtered ("}", stream);
237 tem = longest_to_int (exp->elts[pc + 1].longconst);
238 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
241 if (0 /* OBSOLETE exp->language_defn->la_language == language_chill */)
243 fputs_filtered (".", stream); /* OBSOLETE */
244 fputs_filtered (&exp->elts[pc + 2].string, stream); /* OBSOLETE */
245 fputs_filtered (exp->elts[*pos].opcode == OP_LABELED ? ", " /* OBSOLETE */
246 : ": ", /* OBSOLETE */
247 stream); /* OBSOLETE */
252 /* Gcc support both these syntaxes. Unsure which is preferred. */
254 fputs_filtered (&exp->elts[pc + 2].string, stream);
255 fputs_filtered (": ", stream);
257 fputs_filtered (".", stream);
258 fputs_filtered (&exp->elts[pc + 2].string, stream);
259 fputs_filtered ("=", stream);
262 print_subexp (exp, pos, stream, PREC_SUFFIX);
266 if ((int) prec > (int) PREC_COMMA)
267 fputs_filtered ("(", stream);
268 /* Print the subexpressions, forcing parentheses
269 around any binary operations within them.
270 This is more parentheses than are strictly necessary,
271 but it looks clearer. */
272 print_subexp (exp, pos, stream, PREC_HYPER);
273 fputs_filtered (" ? ", stream);
274 print_subexp (exp, pos, stream, PREC_HYPER);
275 fputs_filtered (" : ", stream);
276 print_subexp (exp, pos, stream, PREC_HYPER);
277 if ((int) prec > (int) PREC_COMMA)
278 fputs_filtered (")", stream);
282 case TERNOP_SLICE_COUNT:
283 print_subexp (exp, pos, stream, PREC_SUFFIX);
284 fputs_filtered ("(", stream);
285 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
286 fputs_filtered (opcode == TERNOP_SLICE ? " : " : " UP ", stream);
287 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
288 fputs_filtered (")", stream);
291 case STRUCTOP_STRUCT:
292 tem = longest_to_int (exp->elts[pc + 1].longconst);
293 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
294 print_subexp (exp, pos, stream, PREC_SUFFIX);
295 fputs_filtered (".", stream);
296 fputs_filtered (&exp->elts[pc + 2].string, stream);
299 /* Will not occur for Modula-2 */
301 tem = longest_to_int (exp->elts[pc + 1].longconst);
302 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
303 print_subexp (exp, pos, stream, PREC_SUFFIX);
304 fputs_filtered ("->", stream);
305 fputs_filtered (&exp->elts[pc + 2].string, stream);
308 case BINOP_SUBSCRIPT:
309 print_subexp (exp, pos, stream, PREC_SUFFIX);
310 fputs_filtered ("[", stream);
311 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
312 fputs_filtered ("]", stream);
315 case UNOP_POSTINCREMENT:
316 print_subexp (exp, pos, stream, PREC_SUFFIX);
317 fputs_filtered ("++", stream);
320 case UNOP_POSTDECREMENT:
321 print_subexp (exp, pos, stream, PREC_SUFFIX);
322 fputs_filtered ("--", stream);
327 if ((int) prec > (int) PREC_PREFIX)
328 fputs_filtered ("(", stream);
329 fputs_filtered ("(", stream);
330 type_print (exp->elts[pc + 1].type, "", stream, 0);
331 fputs_filtered (") ", stream);
332 print_subexp (exp, pos, stream, PREC_PREFIX);
333 if ((int) prec > (int) PREC_PREFIX)
334 fputs_filtered (")", stream);
339 if ((int) prec > (int) PREC_PREFIX)
340 fputs_filtered ("(", stream);
341 if (TYPE_CODE (exp->elts[pc + 1].type) == TYPE_CODE_FUNC &&
342 exp->elts[pc + 3].opcode == OP_LONG)
344 /* We have a minimal symbol fn, probably. It's encoded
345 as a UNOP_MEMVAL (function-type) of an OP_LONG (int, address).
346 Swallow the OP_LONG (including both its opcodes); ignore
347 its type; print the value in the type of the MEMVAL. */
349 val = value_at_lazy (exp->elts[pc + 1].type,
350 (CORE_ADDR) exp->elts[pc + 5].longconst,
352 value_print (val, stream, 0, Val_no_prettyprint);
356 fputs_filtered ("{", stream);
357 type_print (exp->elts[pc + 1].type, "", stream, 0);
358 fputs_filtered ("} ", stream);
359 print_subexp (exp, pos, stream, PREC_PREFIX);
361 if ((int) prec > (int) PREC_PREFIX)
362 fputs_filtered (")", stream);
365 case BINOP_ASSIGN_MODIFY:
366 opcode = exp->elts[pc + 1].opcode;
368 myprec = PREC_ASSIGN;
372 for (tem = 0; op_print_tab[tem].opcode != OP_NULL; tem++)
373 if (op_print_tab[tem].opcode == opcode)
375 op_str = op_print_tab[tem].string;
378 if (op_print_tab[tem].opcode != opcode)
379 /* Not found; don't try to keep going because we don't know how
380 to interpret further elements. */
381 error ("Invalid expression");
388 fputs_filtered ("this", stream);
393 case MULTI_SUBSCRIPT:
395 nargs = longest_to_int (exp->elts[pc + 1].longconst);
396 print_subexp (exp, pos, stream, PREC_SUFFIX);
397 fprintf_unfiltered (stream, " [");
398 for (tem = 0; tem < nargs; tem++)
401 fprintf_unfiltered (stream, ", ");
402 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
404 fprintf_unfiltered (stream, "]");
409 fprintf_unfiltered (stream, "VAL(");
410 type_print (exp->elts[pc + 1].type, "", stream, 0);
411 fprintf_unfiltered (stream, ",");
412 print_subexp (exp, pos, stream, PREC_PREFIX);
413 fprintf_unfiltered (stream, ")");
418 error ("print_subexp: Not implemented.");
424 for (tem = 0; op_print_tab[tem].opcode != OP_NULL; tem++)
425 if (op_print_tab[tem].opcode == opcode)
427 op_str = op_print_tab[tem].string;
428 myprec = op_print_tab[tem].precedence;
429 assoc = op_print_tab[tem].right_assoc;
432 if (op_print_tab[tem].opcode != opcode)
433 /* Not found; don't try to keep going because we don't know how
434 to interpret further elements. For example, this happens
435 if opcode is OP_TYPE. */
436 error ("Invalid expression");
439 /* Note that PREC_BUILTIN will always emit parentheses. */
440 if ((int) myprec < (int) prec)
441 fputs_filtered ("(", stream);
442 if ((int) opcode > (int) BINOP_END)
446 /* Unary postfix operator. */
447 print_subexp (exp, pos, stream, PREC_SUFFIX);
448 fputs_filtered (op_str, stream);
452 /* Unary prefix operator. */
453 fputs_filtered (op_str, stream);
454 if (myprec == PREC_BUILTIN_FUNCTION)
455 fputs_filtered ("(", stream);
456 print_subexp (exp, pos, stream, PREC_PREFIX);
457 if (myprec == PREC_BUILTIN_FUNCTION)
458 fputs_filtered (")", stream);
463 /* Binary operator. */
464 /* Print left operand.
465 If operator is right-associative,
466 increment precedence for this operand. */
467 print_subexp (exp, pos, stream,
468 (enum precedence) ((int) myprec + assoc));
469 /* Print the operator itself. */
471 fprintf_filtered (stream, " %s= ", op_str);
472 else if (op_str[0] == ',')
473 fprintf_filtered (stream, "%s ", op_str);
475 fprintf_filtered (stream, " %s ", op_str);
476 /* Print right operand.
477 If operator is left-associative,
478 increment precedence for this operand. */
479 print_subexp (exp, pos, stream,
480 (enum precedence) ((int) myprec + !assoc));
483 if ((int) myprec < (int) prec)
484 fputs_filtered (")", stream);
487 /* Return the operator corresponding to opcode OP as
488 a string. NULL indicates that the opcode was not found in the
489 current language table. */
491 op_string (enum exp_opcode op)
494 register const struct op_print *op_print_tab;
496 op_print_tab = current_language->la_op_print_tab;
497 for (tem = 0; op_print_tab[tem].opcode != OP_NULL; tem++)
498 if (op_print_tab[tem].opcode == op)
499 return op_print_tab[tem].string;
503 /* Support for dumping the raw data from expressions in a human readable
506 static char *op_name (int opcode);
517 sprintf (buf, "<unknown %d>", opcode);
538 case BINOP_LOGICAL_AND:
539 return "BINOP_LOGICAL_AND";
540 case BINOP_LOGICAL_OR:
541 return "BINOP_LOGICAL_OR";
542 case BINOP_BITWISE_AND:
543 return "BINOP_BITWISE_AND";
544 case BINOP_BITWISE_IOR:
545 return "BINOP_BITWISE_IOR";
546 case BINOP_BITWISE_XOR:
547 return "BINOP_BITWISE_XOR";
549 return "BINOP_EQUAL";
551 return "BINOP_NOTEQUAL";
561 return "BINOP_REPEAT";
563 return "BINOP_ASSIGN";
565 return "BINOP_COMMA";
566 case BINOP_SUBSCRIPT:
567 return "BINOP_SUBSCRIPT";
568 case MULTI_SUBSCRIPT:
569 return "MULTI_SUBSCRIPT";
576 case STRUCTOP_MEMBER:
577 return "STRUCTOP_MEMBER";
579 return "STRUCTOP_MPTR";
581 return "BINOP_INTDIV";
582 case BINOP_ASSIGN_MODIFY:
583 return "BINOP_ASSIGN_MODIFY";
591 return "BINOP_CONCAT";
593 return "BINOP_RANGE";
597 return "TERNOP_COND";
599 return "TERNOP_SLICE";
600 case TERNOP_SLICE_COUNT:
601 return "TERNOP_SLICE_COUNT";
607 return "OP_VAR_VALUE";
611 return "OP_REGISTER";
613 return "OP_INTERNALVAR";
619 return "OP_BITSTRING";
625 return "UNOP_MEMVAL";
628 case UNOP_LOGICAL_NOT:
629 return "UNOP_LOGICAL_NOT";
630 case UNOP_COMPLEMENT:
631 return "UNOP_COMPLEMENT";
636 case UNOP_PREINCREMENT:
637 return "UNOP_PREINCREMENT";
638 case UNOP_POSTINCREMENT:
639 return "UNOP_POSTINCREMENT";
640 case UNOP_PREDECREMENT:
641 return "UNOP_PREDECREMENT";
642 case UNOP_POSTDECREMENT:
643 return "UNOP_POSTDECREMENT";
645 return "UNOP_SIZEOF";
651 return "UNOP_LENGTH";
677 return "OP_M2_STRING";
678 case STRUCTOP_STRUCT:
679 return "STRUCTOP_STRUCT";
681 return "STRUCTOP_PTR";
694 dump_prefix_expression (struct expression *exp, struct ui_file *stream,
702 fprintf_filtered (stream, "Dump of expression @ ");
703 gdb_print_host_address (exp, stream);
704 fprintf_filtered (stream, ", %s:\nExpression: `", note);
705 if (exp->elts[0].opcode != OP_TYPE)
706 print_expression (exp, stream);
708 fprintf_filtered (stream, "Type printing not yet supported....");
709 fprintf_filtered (stream, "'\n\tLanguage %s, %d elements, %ld bytes each.\n",
710 exp->language_defn->la_name, exp->nelts,
711 (long) sizeof (union exp_element));
712 fprintf_filtered (stream, "\t%5s %20s %16s %s\n", "Index", "Opcode",
713 "Hex Value", "String Value");
714 for (elt = 0; elt < exp->nelts; elt++)
716 fprintf_filtered (stream, "\t%5d ", elt);
717 opcode_name = op_name (exp->elts[elt].opcode);
719 fprintf_filtered (stream, "%20s ", opcode_name);
720 print_longest (stream, 'd', 0, exp->elts[elt].longconst);
721 fprintf_filtered (stream, " ");
723 for (eltscan = (char *) &exp->elts[elt],
724 eltsize = sizeof (union exp_element);
728 fprintf_filtered (stream, "%c",
729 isprint (*eltscan) ? (*eltscan & 0xFF) : '.');
731 fprintf_filtered (stream, "\n");
735 static int dump_subexp (struct expression *exp, struct ui_file *stream,
739 dump_subexp (struct expression *exp, struct ui_file *stream, int elt)
741 static int indent = 0;
744 fprintf_filtered (stream, "\n");
745 fprintf_filtered (stream, "\t%5d ", elt);
747 for (i = 1; i <= indent; i++)
748 fprintf_filtered (stream, " ");
751 fprintf_filtered (stream, "%-20s ", op_name (exp->elts[elt].opcode));
753 switch (exp->elts[elt++].opcode)
757 case TERNOP_SLICE_COUNT:
758 elt = dump_subexp (exp, stream, elt);
767 case BINOP_LOGICAL_AND:
768 case BINOP_LOGICAL_OR:
769 case BINOP_BITWISE_AND:
770 case BINOP_BITWISE_IOR:
771 case BINOP_BITWISE_XOR:
781 case BINOP_SUBSCRIPT:
786 case BINOP_ASSIGN_MODIFY:
794 elt = dump_subexp (exp, stream, elt);
796 case UNOP_LOGICAL_NOT:
797 case UNOP_COMPLEMENT:
800 case UNOP_PREINCREMENT:
801 case UNOP_POSTINCREMENT:
802 case UNOP_PREDECREMENT:
803 case UNOP_POSTDECREMENT:
822 elt = dump_subexp (exp, stream, elt);
825 fprintf_filtered (stream, "Type @");
826 gdb_print_host_address (exp->elts[elt].type, stream);
827 fprintf_filtered (stream, " (");
828 type_print (exp->elts[elt].type, NULL, stream, 0);
829 fprintf_filtered (stream, "), value %ld (0x%lx)",
830 (long) exp->elts[elt + 1].longconst,
831 (long) exp->elts[elt + 1].longconst);
835 fprintf_filtered (stream, "Type @");
836 gdb_print_host_address (exp->elts[elt].type, stream);
837 fprintf_filtered (stream, " (");
838 type_print (exp->elts[elt].type, NULL, stream, 0);
839 fprintf_filtered (stream, "), value %g",
840 (double) exp->elts[elt + 1].doubleconst);
844 fprintf_filtered (stream, "Block @");
845 gdb_print_host_address (exp->elts[elt].block, stream);
846 fprintf_filtered (stream, ", symbol @");
847 gdb_print_host_address (exp->elts[elt + 1].symbol, stream);
848 fprintf_filtered (stream, " (%s)",
849 SYMBOL_NAME (exp->elts[elt + 1].symbol));
853 fprintf_filtered (stream, "History element %ld",
854 (long) exp->elts[elt].longconst);
858 fprintf_filtered (stream, "Register %ld",
859 (long) exp->elts[elt].longconst);
863 fprintf_filtered (stream, "Internal var @");
864 gdb_print_host_address (exp->elts[elt].internalvar, stream);
865 fprintf_filtered (stream, " (%s)",
866 exp->elts[elt].internalvar->name);
873 nargs = longest_to_int (exp->elts[elt].longconst);
875 fprintf_filtered (stream, "Number of args: %d", nargs);
878 for (i = 1; i <= nargs + 1; i++)
879 elt = dump_subexp (exp, stream, elt);
887 lower = longest_to_int (exp->elts[elt].longconst);
888 upper = longest_to_int (exp->elts[elt + 1].longconst);
890 fprintf_filtered (stream, "Bounds [%d:%d]", lower, upper);
893 for (i = 1; i <= upper - lower + 1; i++)
894 elt = dump_subexp (exp, stream, elt);
899 fprintf_filtered (stream, "Type @");
900 gdb_print_host_address (exp->elts[elt].type, stream);
901 fprintf_filtered (stream, " (");
902 type_print (exp->elts[elt].type, NULL, stream, 0);
903 fprintf_filtered (stream, ")");
904 elt = dump_subexp (exp, stream, elt + 2);
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, ")");
914 case STRUCTOP_STRUCT:
920 len = longest_to_int (exp->elts[elt].longconst);
921 elem_name = &exp->elts[elt + 1].string;
923 fprintf_filtered (stream, "Element name: `%.*s'", len, elem_name);
924 elt = dump_subexp (exp, stream, elt + 3 + BYTES_TO_EXP_ELEM (len + 1));
932 fprintf_filtered (stream, "Type @");
933 gdb_print_host_address (exp->elts[elt].type, stream);
934 fprintf_filtered (stream, " (");
935 type_print (exp->elts[elt].type, NULL, stream, 0);
936 fprintf_filtered (stream, ") ");
938 len = longest_to_int (exp->elts[elt + 1].longconst);
939 elem_name = &exp->elts[elt + 2].string;
941 fprintf_filtered (stream, "Field name: `%.*s'", len, elem_name);
942 elt += 4 + BYTES_TO_EXP_ELEM (len + 1);
947 case STRUCTOP_MEMBER:
949 case MULTI_SUBSCRIPT:
950 case OP_F77_UNDETERMINED_ARGLIST:
960 fprintf_filtered (stream, "Unknown format");
969 dump_postfix_expression (struct expression *exp, struct ui_file *stream,
974 fprintf_filtered (stream, "Dump of expression @ ");
975 gdb_print_host_address (exp, stream);
976 fprintf_filtered (stream, ", %s:\nExpression: `", note);
977 if (exp->elts[0].opcode != OP_TYPE)
978 print_expression (exp, stream);
980 fputs_filtered ("Type printing not yet supported....", stream);
981 fprintf_filtered (stream, "'\n\tLanguage %s, %d elements, %ld bytes each.\n",
982 exp->language_defn->la_name, exp->nelts,
983 (long) sizeof (union exp_element));
984 fputs_filtered ("\n", stream);
986 for (elt = 0; elt < exp->nelts;)
987 elt = dump_subexp (exp, stream, elt);
988 fputs_filtered ("\n", stream);