Fix printing address of packed array
[deliverable/binutils-gdb.git] / gdb / ada-typeprint.c
CommitLineData
14f9c5c9 1/* Support for printing Ada types for GDB, the GNU debugger.
6aba47ca 2 Copyright (C) 1986, 1988, 1989, 1991, 1997, 1998, 1999, 2000, 2001, 2002,
7b6bb8da 3 2003, 2004, 2007, 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
14f9c5c9 4
a9762ec7 5 This file is part of GDB.
14f9c5c9 6
a9762ec7
JB
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 3 of the License, or
10 (at your option) any later version.
14f9c5c9 11
a9762ec7
JB
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.
14f9c5c9 16
a9762ec7
JB
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
14f9c5c9
AS
19
20#include "defs.h"
04ea0df1 21#include "gdb_obstack.h"
14f9c5c9
AS
22#include "bfd.h" /* Binary File Description */
23#include "symtab.h"
24#include "gdbtypes.h"
25#include "expression.h"
26#include "value.h"
27#include "gdbcore.h"
28#include "target.h"
29#include "command.h"
30#include "gdbcmd.h"
31#include "language.h"
32#include "demangle.h"
33#include "c-lang.h"
34#include "typeprint.h"
35#include "ada-lang.h"
36
37#include <ctype.h>
0c30c098 38#include "gdb_string.h"
14f9c5c9
AS
39#include <errno.h>
40
83e3a93c
PH
41static int print_selected_record_field_types (struct type *, struct type *,
42 int, int,
43 struct ui_file *, int, int);
44
d2e4a39e 45static int print_record_field_types (struct type *, struct type *,
14f9c5c9
AS
46 struct ui_file *, int, int);
47
d2e4a39e 48static void print_array_type (struct type *, struct ui_file *, int, int);
14f9c5c9 49
83e3a93c
PH
50static int print_choices (struct type *, int, struct ui_file *,
51 struct type *);
14f9c5c9 52
d2e4a39e 53static void print_range (struct type *, struct ui_file *);
14f9c5c9 54
d2e4a39e
AS
55static void print_range_bound (struct type *, char *, int *,
56 struct ui_file *);
14f9c5c9 57
d2e4a39e
AS
58static void
59print_dynamic_range_bound (struct type *, const char *, int,
60 const char *, struct ui_file *);
14f9c5c9 61
28c85d6c 62static void print_range_type (struct type *, struct ui_file *);
14f9c5c9
AS
63\f
64
d2e4a39e
AS
65
66static char *name_buffer;
14f9c5c9
AS
67static int name_buffer_len;
68
4c4b4cd2
PH
69/* The (decoded) Ada name of TYPE. This value persists until the
70 next call. */
14f9c5c9 71
d2e4a39e 72static char *
4c4b4cd2 73decoded_type_name (struct type *type)
14f9c5c9
AS
74{
75 if (ada_type_name (type) == NULL)
76 return NULL;
d2e4a39e 77 else
14f9c5c9 78 {
d2e4a39e
AS
79 char *raw_name = ada_type_name (type);
80 char *s, *q;
14f9c5c9
AS
81
82 if (name_buffer == NULL || name_buffer_len <= strlen (raw_name))
83 {
84 name_buffer_len = 16 + 2 * strlen (raw_name);
85 name_buffer = xrealloc (name_buffer, name_buffer_len);
86 }
87 strcpy (name_buffer, raw_name);
88
d2e4a39e 89 s = (char *) strstr (name_buffer, "___");
14f9c5c9
AS
90 if (s != NULL)
91 *s = '\0';
92
93 s = name_buffer + strlen (name_buffer) - 1;
94 while (s > name_buffer && (s[0] != '_' || s[-1] != '_'))
95 s -= 1;
96
97 if (s == name_buffer)
98 return name_buffer;
99
d2e4a39e 100 if (!islower (s[1]))
14f9c5c9
AS
101 return NULL;
102
103 for (s = q = name_buffer; *s != '\0'; q += 1)
104 {
105 if (s[0] == '_' && s[1] == '_')
106 {
d2e4a39e
AS
107 *q = '.';
108 s += 2;
14f9c5c9
AS
109 }
110 else
111 {
d2e4a39e
AS
112 *q = *s;
113 s += 1;
14f9c5c9
AS
114 }
115 }
116 *q = '\0';
117 return name_buffer;
118 }
119}
120
43bbcdc2 121/* Print TYPE on STREAM, preferably as a range. */
14f9c5c9
AS
122
123static void
d2e4a39e 124print_range (struct type *type, struct ui_file *stream)
14f9c5c9 125{
43bbcdc2 126 switch (TYPE_CODE (type))
14f9c5c9
AS
127 {
128 case TYPE_CODE_RANGE:
14f9c5c9 129 case TYPE_CODE_ENUM:
43bbcdc2
PH
130 {
131 struct type *target_type;
132 target_type = TYPE_TARGET_TYPE (type);
133 if (target_type == NULL)
134 target_type = type;
135 ada_print_scalar (target_type, ada_discrete_type_low_bound (type),
136 stream);
137 fprintf_filtered (stream, " .. ");
138 ada_print_scalar (target_type, ada_discrete_type_high_bound (type),
139 stream);
140 }
14f9c5c9
AS
141 break;
142 default:
14f9c5c9 143 fprintf_filtered (stream, "%.*s",
d2e4a39e
AS
144 ada_name_prefix_len (TYPE_NAME (type)),
145 TYPE_NAME (type));
43bbcdc2 146 break;
14f9c5c9
AS
147 }
148}
149
150/* Print the number or discriminant bound at BOUNDS+*N on STREAM, and
4c4b4cd2 151 set *N past the bound and its delimiter, if any. */
14f9c5c9
AS
152
153static void
d2e4a39e
AS
154print_range_bound (struct type *type, char *bounds, int *n,
155 struct ui_file *stream)
14f9c5c9
AS
156{
157 LONGEST B;
5b4ee69b 158
14f9c5c9
AS
159 if (ada_scan_number (bounds, *n, &B, n))
160 {
4c4b4cd2
PH
161 /* STABS decodes all range types which bounds are 0 .. -1 as
162 unsigned integers (ie. the type code is TYPE_CODE_INT, not
163 TYPE_CODE_RANGE). Unfortunately, ada_print_scalar() relies
164 on the unsigned flag to determine whether the bound should
165 be printed as a signed or an unsigned value. This causes
166 the upper bound of the 0 .. -1 range types to be printed as
167 a very large unsigned number instead of -1.
7c964f07
UW
168 To workaround this stabs deficiency, we replace the TYPE by NULL
169 to indicate default output when we detect that the bound is negative,
4c4b4cd2
PH
170 and the type is a TYPE_CODE_INT. The bound is negative when
171 'm' is the last character of the number scanned in BOUNDS. */
172 if (bounds[*n - 1] == 'm' && TYPE_CODE (type) == TYPE_CODE_INT)
7c964f07 173 type = NULL;
14f9c5c9
AS
174 ada_print_scalar (type, B, stream);
175 if (bounds[*n] == '_')
176 *n += 2;
177 }
178 else
179 {
180 int bound_len;
d2e4a39e
AS
181 char *bound = bounds + *n;
182 char *pend;
14f9c5c9
AS
183
184 pend = strstr (bound, "__");
185 if (pend == NULL)
186 *n += bound_len = strlen (bound);
d2e4a39e 187 else
14f9c5c9
AS
188 {
189 bound_len = pend - bound;
190 *n += bound_len + 2;
191 }
192 fprintf_filtered (stream, "%.*s", bound_len, bound);
193 }
194}
195
196/* Assuming NAME[0 .. NAME_LEN-1] is the name of a range type, print
197 the value (if found) of the bound indicated by SUFFIX ("___L" or
4c4b4cd2 198 "___U") according to the ___XD conventions. */
14f9c5c9
AS
199
200static void
d2e4a39e
AS
201print_dynamic_range_bound (struct type *type, const char *name, int name_len,
202 const char *suffix, struct ui_file *stream)
14f9c5c9
AS
203{
204 static char *name_buf = NULL;
205 static size_t name_buf_len = 0;
206 LONGEST B;
207 int OK;
208
209 GROW_VECT (name_buf, name_buf_len, name_len + strlen (suffix) + 1);
210 strncpy (name_buf, name, name_len);
211 strcpy (name_buf + name_len, suffix);
212
4c4b4cd2 213 B = get_int_var_value (name_buf, &OK);
14f9c5c9
AS
214 if (OK)
215 ada_print_scalar (type, B, stream);
216 else
217 fprintf_filtered (stream, "?");
218}
219
28c85d6c
JB
220/* Print RAW_TYPE as a range type, using any bound information
221 following the GNAT encoding (if available). */
14f9c5c9
AS
222
223static void
28c85d6c 224print_range_type (struct type *raw_type, struct ui_file *stream)
14f9c5c9 225{
28c85d6c 226 char *name;
14f9c5c9 227 struct type *base_type;
d2e4a39e 228 char *subtype_info;
14f9c5c9 229
28c85d6c
JB
230 gdb_assert (raw_type != NULL);
231 name = TYPE_NAME (raw_type);
232 gdb_assert (name != NULL);
1ce677a4
UW
233
234 if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
14f9c5c9
AS
235 base_type = TYPE_TARGET_TYPE (raw_type);
236 else
237 base_type = raw_type;
238
239 subtype_info = strstr (name, "___XD");
1ce677a4 240 if (subtype_info == NULL)
14f9c5c9
AS
241 print_range (raw_type, stream);
242 else
243 {
244 int prefix_len = subtype_info - name;
245 char *bounds_str;
246 int n;
247
248 subtype_info += 5;
249 bounds_str = strchr (subtype_info, '_');
250 n = 1;
251
d2e4a39e 252 if (*subtype_info == 'L')
14f9c5c9 253 {
4c4b4cd2 254 print_range_bound (base_type, bounds_str, &n, stream);
14f9c5c9
AS
255 subtype_info += 1;
256 }
257 else
4c4b4cd2 258 print_dynamic_range_bound (base_type, name, prefix_len, "___L",
d2e4a39e 259 stream);
14f9c5c9
AS
260
261 fprintf_filtered (stream, " .. ");
262
d2e4a39e 263 if (*subtype_info == 'U')
4c4b4cd2 264 print_range_bound (base_type, bounds_str, &n, stream);
14f9c5c9 265 else
4c4b4cd2 266 print_dynamic_range_bound (base_type, name, prefix_len, "___U",
d2e4a39e 267 stream);
14f9c5c9 268 }
d2e4a39e 269}
14f9c5c9 270
4c4b4cd2 271/* Print enumerated type TYPE on STREAM. */
14f9c5c9
AS
272
273static void
ebf56fd3 274print_enum_type (struct type *type, struct ui_file *stream)
14f9c5c9
AS
275{
276 int len = TYPE_NFIELDS (type);
277 int i, lastval;
278
279 fprintf_filtered (stream, "(");
280 wrap_here (" ");
281
282 lastval = 0;
283 for (i = 0; i < len; i++)
284 {
285 QUIT;
d2e4a39e
AS
286 if (i)
287 fprintf_filtered (stream, ", ");
14f9c5c9
AS
288 wrap_here (" ");
289 fputs_filtered (ada_enum_name (TYPE_FIELD_NAME (type, i)), stream);
290 if (lastval != TYPE_FIELD_BITPOS (type, i))
291 {
292 fprintf_filtered (stream, " => %d", TYPE_FIELD_BITPOS (type, i));
293 lastval = TYPE_FIELD_BITPOS (type, i);
294 }
295 lastval += 1;
296 }
297 fprintf_filtered (stream, ")");
298}
299
4c4b4cd2 300/* Print representation of Ada fixed-point type TYPE on STREAM. */
14f9c5c9
AS
301
302static void
ebf56fd3 303print_fixed_point_type (struct type *type, struct ui_file *stream)
14f9c5c9
AS
304{
305 DOUBLEST delta = ada_delta (type);
306 DOUBLEST small = ada_fixed_to_float (type, 1.0);
307
308 if (delta < 0.0)
309 fprintf_filtered (stream, "delta ??");
310 else
311 {
312 fprintf_filtered (stream, "delta %g", (double) delta);
d2e4a39e 313 if (delta != small)
14f9c5c9
AS
314 fprintf_filtered (stream, " <'small = %g>", (double) small);
315 }
316}
317
4c4b4cd2
PH
318/* Print simple (constrained) array type TYPE on STREAM. LEVEL is the
319 recursion (indentation) level, in case the element type itself has
14f9c5c9 320 nested structure, and SHOW is the number of levels of internal
4c4b4cd2 321 structure to show (see ada_print_type). */
14f9c5c9
AS
322
323static void
d2e4a39e
AS
324print_array_type (struct type *type, struct ui_file *stream, int show,
325 int level)
14f9c5c9
AS
326{
327 int bitsize;
328 int n_indices;
329
ad82864c 330 if (ada_is_constrained_packed_array_type (type))
727e3d2e
JB
331 type = ada_coerce_to_simple_array_type (type);
332
14f9c5c9
AS
333 bitsize = 0;
334 fprintf_filtered (stream, "array (");
335
cb249c71
TT
336 if (type == NULL)
337 {
338 fprintf_filtered (stream, _("<undecipherable array type>"));
339 return;
340 }
341
14f9c5c9 342 n_indices = -1;
54ae186f 343 if (ada_is_simple_array_type (type))
14f9c5c9 344 {
54ae186f
JB
345 struct type *range_desc_type;
346 struct type *arr_type;
14f9c5c9 347
54ae186f
JB
348 range_desc_type = ada_find_parallel_type (type, "___XA");
349 ada_fixup_array_indexes_type (range_desc_type);
28c85d6c 350
54ae186f
JB
351 bitsize = 0;
352 if (range_desc_type == NULL)
353 {
354 for (arr_type = type; TYPE_CODE (arr_type) == TYPE_CODE_ARRAY;
355 arr_type = TYPE_TARGET_TYPE (arr_type))
14f9c5c9 356 {
54ae186f
JB
357 if (arr_type != type)
358 fprintf_filtered (stream, ", ");
359 print_range (TYPE_INDEX_TYPE (arr_type), stream);
360 if (TYPE_FIELD_BITSIZE (arr_type, 0) > 0)
361 bitsize = TYPE_FIELD_BITSIZE (arr_type, 0);
14f9c5c9
AS
362 }
363 }
d2e4a39e 364 else
14f9c5c9 365 {
54ae186f 366 int k;
5b4ee69b 367
54ae186f
JB
368 n_indices = TYPE_NFIELDS (range_desc_type);
369 for (k = 0, arr_type = type;
370 k < n_indices;
371 k += 1, arr_type = TYPE_TARGET_TYPE (arr_type))
372 {
373 if (k > 0)
374 fprintf_filtered (stream, ", ");
375 print_range_type (TYPE_FIELD_TYPE (range_desc_type, k),
376 stream);
377 if (TYPE_FIELD_BITSIZE (arr_type, 0) > 0)
378 bitsize = TYPE_FIELD_BITSIZE (arr_type, 0);
379 }
14f9c5c9
AS
380 }
381 }
54ae186f
JB
382 else
383 {
384 int i, i0;
385
386 for (i = i0 = ada_array_arity (type); i > 0; i -= 1)
387 fprintf_filtered (stream, "%s<>", i == i0 ? "" : ", ");
388 }
14f9c5c9
AS
389
390 fprintf_filtered (stream, ") of ");
391 wrap_here ("");
d2e4a39e
AS
392 ada_print_type (ada_array_element_type (type, n_indices), "", stream,
393 show == 0 ? 0 : show - 1, level + 1);
14f9c5c9
AS
394 if (bitsize > 0)
395 fprintf_filtered (stream, " <packed: %d-bit elements>", bitsize);
396}
397
398/* Print the choices encoded by field FIELD_NUM of variant-part TYPE on
83e3a93c 399 STREAM, assuming that VAL_TYPE (if non-NULL) is the type of the
feb864b7 400 values. Return non-zero if the field is an encoding of
83e3a93c
PH
401 discriminant values, as in a standard variant record, and 0 if the
402 field is not so encoded (as happens with single-component variants
feb864b7 403 in types annotated with pragma Unchecked_Variant). */
14f9c5c9 404
83e3a93c 405static int
d2e4a39e
AS
406print_choices (struct type *type, int field_num, struct ui_file *stream,
407 struct type *val_type)
14f9c5c9
AS
408{
409 int have_output;
410 int p;
d2e4a39e 411 const char *name = TYPE_FIELD_NAME (type, field_num);
14f9c5c9
AS
412
413 have_output = 0;
414
4c4b4cd2 415 /* Skip over leading 'V': NOTE soon to be obsolete. */
14f9c5c9
AS
416 if (name[0] == 'V')
417 {
d2e4a39e 418 if (!ada_scan_number (name, 1, NULL, &p))
14f9c5c9
AS
419 goto Huh;
420 }
421 else
422 p = 0;
423
424 while (1)
425 {
d2e4a39e 426 switch (name[p])
14f9c5c9
AS
427 {
428 default:
83e3a93c
PH
429 goto Huh;
430 case '_':
431 case '\0':
432 fprintf_filtered (stream, " =>");
433 return 1;
14f9c5c9
AS
434 case 'S':
435 case 'R':
436 case 'O':
d2e4a39e 437 if (have_output)
14f9c5c9
AS
438 fprintf_filtered (stream, " | ");
439 have_output = 1;
440 break;
441 }
442
d2e4a39e 443 switch (name[p])
14f9c5c9
AS
444 {
445 case 'S':
446 {
447 LONGEST W;
5b4ee69b 448
d2e4a39e 449 if (!ada_scan_number (name, p + 1, &W, &p))
14f9c5c9
AS
450 goto Huh;
451 ada_print_scalar (val_type, W, stream);
452 break;
453 }
454 case 'R':
455 {
456 LONGEST L, U;
5b4ee69b 457
d2e4a39e
AS
458 if (!ada_scan_number (name, p + 1, &L, &p)
459 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
14f9c5c9
AS
460 goto Huh;
461 ada_print_scalar (val_type, L, stream);
462 fprintf_filtered (stream, " .. ");
463 ada_print_scalar (val_type, U, stream);
464 break;
465 }
466 case 'O':
467 fprintf_filtered (stream, "others");
468 p += 1;
469 break;
470 }
471 }
472
473Huh:
83e3a93c
PH
474 fprintf_filtered (stream, "?? =>");
475 return 0;
14f9c5c9
AS
476}
477
83e3a93c
PH
478/* Assuming that field FIELD_NUM of TYPE represents variants whose
479 discriminant is contained in OUTER_TYPE, print its components on STREAM.
480 LEVEL is the recursion (indentation) level, in case any of the fields
481 themselves have nested structure, and SHOW is the number of levels of
482 internal structure to show (see ada_print_type). For this purpose,
483 fields nested in a variant part are taken to be at the same level as
484 the fields immediately outside the variant part. */
14f9c5c9
AS
485
486static void
ebf56fd3
AS
487print_variant_clauses (struct type *type, int field_num,
488 struct type *outer_type, struct ui_file *stream,
489 int show, int level)
14f9c5c9
AS
490{
491 int i;
4c4b4cd2 492 struct type *var_type, *par_type;
14f9c5c9
AS
493 struct type *discr_type;
494
495 var_type = TYPE_FIELD_TYPE (type, field_num);
496 discr_type = ada_variant_discrim_type (var_type, outer_type);
497
498 if (TYPE_CODE (var_type) == TYPE_CODE_PTR)
499 {
500 var_type = TYPE_TARGET_TYPE (var_type);
4c4b4cd2
PH
501 if (var_type == NULL || TYPE_CODE (var_type) != TYPE_CODE_UNION)
502 return;
14f9c5c9
AS
503 }
504
4c4b4cd2
PH
505 par_type = ada_find_parallel_type (var_type, "___XVU");
506 if (par_type != NULL)
507 var_type = par_type;
508
d2e4a39e 509 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
14f9c5c9
AS
510 {
511 fprintf_filtered (stream, "\n%*swhen ", level + 4, "");
83e3a93c
PH
512 if (print_choices (var_type, i, stream, discr_type))
513 {
514 if (print_record_field_types (TYPE_FIELD_TYPE (var_type, i),
515 outer_type, stream, show, level + 4)
516 <= 0)
517 fprintf_filtered (stream, " null;");
518 }
519 else
520 print_selected_record_field_types (var_type, outer_type, i, i,
521 stream, show, level + 4);
14f9c5c9
AS
522 }
523}
524
4c4b4cd2 525/* Assuming that field FIELD_NUM of TYPE is a variant part whose
14f9c5c9 526 discriminants are contained in OUTER_TYPE, print a description of it
4c4b4cd2
PH
527 on STREAM. LEVEL is the recursion (indentation) level, in case any of
528 the fields themselves have nested structure, and SHOW is the number of
529 levels of internal structure to show (see ada_print_type). For this
530 purpose, fields nested in a variant part are taken to be at the same
531 level as the fields immediately outside the variant part. */
14f9c5c9
AS
532
533static void
ebf56fd3
AS
534print_variant_part (struct type *type, int field_num, struct type *outer_type,
535 struct ui_file *stream, int show, int level)
14f9c5c9
AS
536{
537 fprintf_filtered (stream, "\n%*scase %s is", level + 4, "",
d2e4a39e
AS
538 ada_variant_discrim_name
539 (TYPE_FIELD_TYPE (type, field_num)));
540 print_variant_clauses (type, field_num, outer_type, stream, show,
541 level + 4);
14f9c5c9
AS
542 fprintf_filtered (stream, "\n%*send case;", level + 4, "");
543}
544
83e3a93c
PH
545/* Print a description on STREAM of the fields FLD0 through FLD1 in
546 record or union type TYPE, whose discriminants are in OUTER_TYPE.
547 LEVEL is the recursion (indentation) level, in case any of the
548 fields themselves have nested structure, and SHOW is the number of
549 levels of internal structure to show (see ada_print_type). Does
feb864b7 550 not print parent type information of TYPE. Returns 0 if no fields
83e3a93c
PH
551 printed, -1 for an incomplete type, else > 0. Prints each field
552 beginning on a new line, but does not put a new line at end. */
14f9c5c9
AS
553
554static int
83e3a93c
PH
555print_selected_record_field_types (struct type *type, struct type *outer_type,
556 int fld0, int fld1,
557 struct ui_file *stream, int show, int level)
14f9c5c9 558{
83e3a93c 559 int i, flds;
14f9c5c9
AS
560
561 flds = 0;
14f9c5c9 562
83e3a93c 563 if (fld0 > fld1 && TYPE_STUB (type))
14f9c5c9
AS
564 return -1;
565
83e3a93c 566 for (i = fld0; i <= fld1; i += 1)
14f9c5c9
AS
567 {
568 QUIT;
569
d2e4a39e 570 if (ada_is_parent_field (type, i) || ada_is_ignored_field (type, i))
14f9c5c9
AS
571 ;
572 else if (ada_is_wrapper_field (type, i))
573 flds += print_record_field_types (TYPE_FIELD_TYPE (type, i), type,
574 stream, show, level);
d2e4a39e 575 else if (ada_is_variant_part (type, i))
14f9c5c9
AS
576 {
577 print_variant_part (type, i, outer_type, stream, show, level);
578 flds = 1;
579 }
580 else
581 {
582 flds += 1;
583 fprintf_filtered (stream, "\n%*s", level + 4, "");
584 ada_print_type (TYPE_FIELD_TYPE (type, i),
585 TYPE_FIELD_NAME (type, i),
586 stream, show - 1, level + 4);
587 fprintf_filtered (stream, ";");
588 }
589 }
590
591 return flds;
592}
593
83e3a93c
PH
594/* Print a description on STREAM of all fields of record or union type
595 TYPE, as for print_selected_record_field_types, above. */
596
597static int
598print_record_field_types (struct type *type, struct type *outer_type,
599 struct ui_file *stream, int show, int level)
600{
601 return print_selected_record_field_types (type, outer_type,
602 0, TYPE_NFIELDS (type) - 1,
603 stream, show, level);
604}
605
606
4c4b4cd2
PH
607/* Print record type TYPE on STREAM. LEVEL is the recursion (indentation)
608 level, in case the element type itself has nested structure, and SHOW is
609 the number of levels of internal structure to show (see ada_print_type). */
14f9c5c9
AS
610
611static void
d2e4a39e
AS
612print_record_type (struct type *type0, struct ui_file *stream, int show,
613 int level)
14f9c5c9 614{
d2e4a39e
AS
615 struct type *parent_type;
616 struct type *type;
617
4c4b4cd2
PH
618 type = ada_find_parallel_type (type0, "___XVE");
619 if (type == NULL)
620 type = type0;
14f9c5c9
AS
621
622 parent_type = ada_parent_type (type);
d2e4a39e 623 if (ada_type_name (parent_type) != NULL)
0b48a291 624 fprintf_filtered (stream, "new %s with record",
4c4b4cd2
PH
625 decoded_type_name (parent_type));
626 else if (parent_type == NULL && ada_is_tagged_type (type, 0))
0b48a291
PH
627 fprintf_filtered (stream, "tagged record");
628 else
629 fprintf_filtered (stream, "record");
14f9c5c9
AS
630
631 if (show < 0)
0b48a291 632 fprintf_filtered (stream, " ... end record");
14f9c5c9
AS
633 else
634 {
635 int flds;
636
637 flds = 0;
638 if (parent_type != NULL && ada_type_name (parent_type) == NULL)
d2e4a39e 639 flds += print_record_field_types (parent_type, parent_type,
14f9c5c9
AS
640 stream, show, level);
641 flds += print_record_field_types (type, type, stream, show, level);
d2e4a39e 642
14f9c5c9 643 if (flds > 0)
0b48a291 644 fprintf_filtered (stream, "\n%*send record", level, "");
d2e4a39e 645 else if (flds < 0)
323e0a4a 646 fprintf_filtered (stream, _(" <incomplete type> end record"));
d2e4a39e 647 else
0b48a291 648 fprintf_filtered (stream, " null; end record");
14f9c5c9
AS
649 }
650}
651
652/* Print the unchecked union type TYPE in something resembling Ada
4c4b4cd2 653 format on STREAM. LEVEL is the recursion (indentation) level
14f9c5c9 654 in case the element type itself has nested structure, and SHOW is the
4c4b4cd2 655 number of levels of internal structure to show (see ada_print_type). */
14f9c5c9 656static void
d2e4a39e 657print_unchecked_union_type (struct type *type, struct ui_file *stream,
14f9c5c9
AS
658 int show, int level)
659{
14f9c5c9 660 if (show < 0)
0b48a291 661 fprintf_filtered (stream, "record (?) is ... end record");
d2e4a39e 662 else if (TYPE_NFIELDS (type) == 0)
0b48a291 663 fprintf_filtered (stream, "record (?) is null; end record");
14f9c5c9
AS
664 else
665 {
666 int i;
667
0b48a291 668 fprintf_filtered (stream, "record (?) is\n%*scase ? is", level + 4, "");
14f9c5c9 669
d2e4a39e 670 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
14f9c5c9 671 {
0b48a291 672 fprintf_filtered (stream, "\n%*swhen ? =>\n%*s", level + 8, "",
d2e4a39e 673 level + 12, "");
14f9c5c9
AS
674 ada_print_type (TYPE_FIELD_TYPE (type, i),
675 TYPE_FIELD_NAME (type, i),
676 stream, show - 1, level + 12);
677 fprintf_filtered (stream, ";");
678 }
679
0b48a291 680 fprintf_filtered (stream, "\n%*send case;\n%*send record",
d2e4a39e 681 level + 4, "", level, "");
14f9c5c9
AS
682 }
683}
d2e4a39e 684
14f9c5c9
AS
685
686
687/* Print function or procedure type TYPE on STREAM. Make it a header
4c4b4cd2 688 for function or procedure NAME if NAME is not null. */
14f9c5c9
AS
689
690static void
25b524e8 691print_func_type (struct type *type, struct ui_file *stream, const char *name)
14f9c5c9
AS
692{
693 int i, len = TYPE_NFIELDS (type);
694
695 if (TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_VOID)
696 fprintf_filtered (stream, "procedure");
697 else
698 fprintf_filtered (stream, "function");
699
d2e4a39e 700 if (name != NULL && name[0] != '\0')
14f9c5c9
AS
701 fprintf_filtered (stream, " %s", name);
702
d2e4a39e 703 if (len > 0)
14f9c5c9
AS
704 {
705 fprintf_filtered (stream, " (");
706 for (i = 0; i < len; i += 1)
707 {
708 if (i > 0)
709 {
710 fputs_filtered ("; ", stream);
711 wrap_here (" ");
712 }
d2e4a39e 713 fprintf_filtered (stream, "a%d: ", i + 1);
14f9c5c9
AS
714 ada_print_type (TYPE_FIELD_TYPE (type, i), "", stream, -1, 0);
715 }
716 fprintf_filtered (stream, ")");
d2e4a39e 717 }
14f9c5c9
AS
718
719 if (TYPE_CODE (TYPE_TARGET_TYPE (type)) != TYPE_CODE_VOID)
720 {
721 fprintf_filtered (stream, " return ");
722 ada_print_type (TYPE_TARGET_TYPE (type), "", stream, 0, 0);
723 }
724}
725
726
727/* Print a description of a type TYPE0.
728 Output goes to STREAM (via stdio).
729 If VARSTRING is a non-empty string, print as an Ada variable/field
730 declaration.
4c4b4cd2 731 SHOW+1 is the maximum number of levels of internal type structure
14f9c5c9
AS
732 to show (this applies to record types, enumerated types, and
733 array types).
734 SHOW is the number of levels of internal type structure to show
4c4b4cd2 735 when there is a type name for the SHOWth deepest level (0th is
14f9c5c9
AS
736 outer level).
737 When SHOW<0, no inner structure is shown.
4c4b4cd2 738 LEVEL indicates level of recursion (for nested definitions). */
14f9c5c9
AS
739
740void
25b524e8
JK
741ada_print_type (struct type *type0, const char *varstring,
742 struct ui_file *stream, int show, int level)
14f9c5c9 743{
61ee279c 744 struct type *type = ada_check_typedef (ada_get_base_type (type0));
f192137b 745 char *type_name = decoded_type_name (type0);
14f9c5c9
AS
746 int is_var_decl = (varstring != NULL && varstring[0] != '\0');
747
748 if (type == NULL)
749 {
750 if (is_var_decl)
751 fprintf_filtered (stream, "%.*s: ",
d2e4a39e 752 ada_name_prefix_len (varstring), varstring);
14f9c5c9
AS
753 fprintf_filtered (stream, "<null type?>");
754 return;
755 }
756
757 if (show > 0)
61ee279c 758 type = ada_check_typedef (type);
14f9c5c9
AS
759
760 if (is_var_decl && TYPE_CODE (type) != TYPE_CODE_FUNC)
d2e4a39e
AS
761 fprintf_filtered (stream, "%.*s: ",
762 ada_name_prefix_len (varstring), varstring);
14f9c5c9 763
d2d43431 764 if (type_name != NULL && show <= 0 && !ada_is_aligner_type (type))
14f9c5c9 765 {
d2e4a39e 766 fprintf_filtered (stream, "%.*s",
14f9c5c9
AS
767 ada_name_prefix_len (type_name), type_name);
768 return;
769 }
770
771 if (ada_is_aligner_type (type))
772 ada_print_type (ada_aligned_type (type), "", stream, show, level);
d2d43431
JB
773 else if (ada_is_constrained_packed_array_type (type)
774 && TYPE_CODE (type) != TYPE_CODE_PTR)
775 print_array_type (type, stream, show, level);
14f9c5c9 776 else
d2e4a39e
AS
777 switch (TYPE_CODE (type))
778 {
779 default:
780 fprintf_filtered (stream, "<");
781 c_print_type (type, "", stream, show, level);
782 fprintf_filtered (stream, ">");
783 break;
784 case TYPE_CODE_PTR:
720d1a40 785 case TYPE_CODE_TYPEDEF:
d2e4a39e
AS
786 fprintf_filtered (stream, "access ");
787 ada_print_type (TYPE_TARGET_TYPE (type), "", stream, show, level);
788 break;
789 case TYPE_CODE_REF:
790 fprintf_filtered (stream, "<ref> ");
791 ada_print_type (TYPE_TARGET_TYPE (type), "", stream, show, level);
792 break;
793 case TYPE_CODE_ARRAY:
14f9c5c9 794 print_array_type (type, stream, show, level);
d2e4a39e 795 break;
690cc4eb
PH
796 case TYPE_CODE_BOOL:
797 fprintf_filtered (stream, "(false, true)");
798 break;
d2e4a39e
AS
799 case TYPE_CODE_INT:
800 if (ada_is_fixed_point_type (type))
801 print_fixed_point_type (type, stream);
d2e4a39e
AS
802 else
803 {
804 char *name = ada_type_name (type);
5b4ee69b 805
d2e4a39e 806 if (!ada_is_range_type_name (name))
e1d5a0d2 807 fprintf_filtered (stream, _("<%d-byte integer>"),
d2e4a39e
AS
808 TYPE_LENGTH (type));
809 else
810 {
811 fprintf_filtered (stream, "range ");
28c85d6c 812 print_range_type (type, stream);
d2e4a39e
AS
813 }
814 }
815 break;
816 case TYPE_CODE_RANGE:
817 if (ada_is_fixed_point_type (type))
818 print_fixed_point_type (type, stream);
d2e4a39e 819 else if (ada_is_modular_type (type))
529cad9c
PH
820 fprintf_filtered (stream, "mod %s",
821 int_string (ada_modulus (type), 10, 0, 0, 1));
d2e4a39e
AS
822 else
823 {
824 fprintf_filtered (stream, "range ");
825 print_range (type, stream);
826 }
827 break;
828 case TYPE_CODE_FLT:
e1d5a0d2 829 fprintf_filtered (stream, _("<%d-byte float>"), TYPE_LENGTH (type));
d2e4a39e
AS
830 break;
831 case TYPE_CODE_ENUM:
832 if (show < 0)
833 fprintf_filtered (stream, "(...)");
834 else
835 print_enum_type (type, stream);
836 break;
837 case TYPE_CODE_STRUCT:
4c4b4cd2 838 if (ada_is_array_descriptor_type (type))
d2e4a39e
AS
839 print_array_type (type, stream, show, level);
840 else if (ada_is_bogus_array_descriptor (type))
841 fprintf_filtered (stream,
e1d5a0d2 842 _("array (?) of ? (<mal-formed descriptor>)"));
d2e4a39e
AS
843 else
844 print_record_type (type, stream, show, level);
845 break;
846 case TYPE_CODE_UNION:
847 print_unchecked_union_type (type, stream, show, level);
848 break;
849 case TYPE_CODE_FUNC:
850 print_func_type (type, stream, varstring);
851 break;
852 }
14f9c5c9 853}
be942545
JB
854
855/* Implement the la_print_typedef language method for Ada. */
856
857void
858ada_print_typedef (struct type *type, struct symbol *new_symbol,
859 struct ui_file *stream)
860{
861 type = ada_check_typedef (type);
862 ada_print_type (type, "", stream, 0, 0);
863 fprintf_filtered (stream, "\n");
864}
This page took 0.830344 seconds and 4 git commands to generate.