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