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