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