1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2021 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
23 #include "gdb_regex.h"
28 #include "expression.h"
29 #include "parser-defs.h"
35 #include "breakpoint.h"
38 #include "gdb_obstack.h"
40 #include "completer.h"
47 #include "observable.h"
49 #include "typeprint.h"
50 #include "namespace.h"
51 #include "cli/cli-style.h"
54 #include "mi/mi-common.h"
55 #include "arch-utils.h"
56 #include "cli/cli-utils.h"
57 #include "gdbsupport/function-view.h"
58 #include "gdbsupport/byte-vector.h"
62 /* Define whether or not the C operator '/' truncates towards zero for
63 differently signed operands (truncation direction is undefined in C).
64 Copied from valarith.c. */
66 #ifndef TRUNCATION_TOWARDS_ZERO
67 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
70 static struct type
*desc_base_type (struct type
*);
72 static struct type
*desc_bounds_type (struct type
*);
74 static struct value
*desc_bounds (struct value
*);
76 static int fat_pntr_bounds_bitpos (struct type
*);
78 static int fat_pntr_bounds_bitsize (struct type
*);
80 static struct type
*desc_data_target_type (struct type
*);
82 static struct value
*desc_data (struct value
*);
84 static int fat_pntr_data_bitpos (struct type
*);
86 static int fat_pntr_data_bitsize (struct type
*);
88 static struct value
*desc_one_bound (struct value
*, int, int);
90 static int desc_bound_bitpos (struct type
*, int, int);
92 static int desc_bound_bitsize (struct type
*, int, int);
94 static struct type
*desc_index_type (struct type
*, int);
96 static int desc_arity (struct type
*);
98 static int ada_type_match (struct type
*, struct type
*, int);
100 static int ada_args_match (struct symbol
*, struct value
**, int);
102 static struct value
*make_array_descriptor (struct type
*, struct value
*);
104 static void ada_add_block_symbols (std::vector
<struct block_symbol
> &,
105 const struct block
*,
106 const lookup_name_info
&lookup_name
,
107 domain_enum
, struct objfile
*);
109 static void ada_add_all_symbols (std::vector
<struct block_symbol
> &,
110 const struct block
*,
111 const lookup_name_info
&lookup_name
,
112 domain_enum
, int, int *);
114 static int is_nonfunction (const std::vector
<struct block_symbol
> &);
116 static void add_defn_to_vec (std::vector
<struct block_symbol
> &,
118 const struct block
*);
120 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
122 static const char *ada_decoded_op_name (enum exp_opcode
);
124 static int numeric_type_p (struct type
*);
126 static int integer_type_p (struct type
*);
128 static int scalar_type_p (struct type
*);
130 static int discrete_type_p (struct type
*);
132 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
135 static struct type
*ada_find_parallel_type_with_name (struct type
*,
138 static int is_dynamic_field (struct type
*, int);
140 static struct type
*to_fixed_variant_branch_type (struct type
*,
142 CORE_ADDR
, struct value
*);
144 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
146 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
148 static struct type
*to_static_fixed_type (struct type
*);
149 static struct type
*static_unwrap_type (struct type
*type
);
151 static struct value
*unwrap_value (struct value
*);
153 static struct type
*constrained_packed_array_type (struct type
*, long *);
155 static struct type
*decode_constrained_packed_array_type (struct type
*);
157 static long decode_packed_array_bitsize (struct type
*);
159 static struct value
*decode_constrained_packed_array (struct value
*);
161 static int ada_is_unconstrained_packed_array_type (struct type
*);
163 static struct value
*value_subscript_packed (struct value
*, int,
166 static struct value
*coerce_unspec_val_to_type (struct value
*,
169 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
171 static int equiv_types (struct type
*, struct type
*);
173 static int is_name_suffix (const char *);
175 static int advance_wild_match (const char **, const char *, char);
177 static bool wild_match (const char *name
, const char *patn
);
179 static struct value
*ada_coerce_ref (struct value
*);
181 static LONGEST
pos_atr (struct value
*);
183 static struct value
*val_atr (struct type
*, LONGEST
);
185 static struct symbol
*standard_lookup (const char *, const struct block
*,
188 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
191 static int find_struct_field (const char *, struct type
*, int,
192 struct type
**, int *, int *, int *, int *);
194 static int ada_resolve_function (std::vector
<struct block_symbol
> &,
195 struct value
**, int, const char *,
198 static int ada_is_direct_array_type (struct type
*);
200 static struct value
*ada_index_struct_field (int, struct value
*, int,
203 static void add_component_interval (LONGEST
, LONGEST
, std::vector
<LONGEST
> &);
206 static struct type
*ada_find_any_type (const char *name
);
208 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
209 (const lookup_name_info
&lookup_name
);
213 /* The result of a symbol lookup to be stored in our symbol cache. */
217 /* The name used to perform the lookup. */
219 /* The namespace used during the lookup. */
221 /* The symbol returned by the lookup, or NULL if no matching symbol
224 /* The block where the symbol was found, or NULL if no matching
226 const struct block
*block
;
227 /* A pointer to the next entry with the same hash. */
228 struct cache_entry
*next
;
231 /* The Ada symbol cache, used to store the result of Ada-mode symbol
232 lookups in the course of executing the user's commands.
234 The cache is implemented using a simple, fixed-sized hash.
235 The size is fixed on the grounds that there are not likely to be
236 all that many symbols looked up during any given session, regardless
237 of the size of the symbol table. If we decide to go to a resizable
238 table, let's just use the stuff from libiberty instead. */
240 #define HASH_SIZE 1009
242 struct ada_symbol_cache
244 /* An obstack used to store the entries in our cache. */
245 struct auto_obstack cache_space
;
247 /* The root of the hash table used to implement our symbol cache. */
248 struct cache_entry
*root
[HASH_SIZE
] {};
251 /* Maximum-sized dynamic type. */
252 static unsigned int varsize_limit
;
254 static const char ada_completer_word_break_characters
[] =
256 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
258 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
261 /* The name of the symbol to use to get the name of the main subprogram. */
262 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
263 = "__gnat_ada_main_program_name";
265 /* Limit on the number of warnings to raise per expression evaluation. */
266 static int warning_limit
= 2;
268 /* Number of warning messages issued; reset to 0 by cleanups after
269 expression evaluation. */
270 static int warnings_issued
= 0;
272 static const char * const known_runtime_file_name_patterns
[] = {
273 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
276 static const char * const known_auxiliary_function_name_patterns
[] = {
277 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
280 /* Maintenance-related settings for this module. */
282 static struct cmd_list_element
*maint_set_ada_cmdlist
;
283 static struct cmd_list_element
*maint_show_ada_cmdlist
;
285 /* The "maintenance ada set/show ignore-descriptive-type" value. */
287 static bool ada_ignore_descriptive_types_p
= false;
289 /* Inferior-specific data. */
291 /* Per-inferior data for this module. */
293 struct ada_inferior_data
295 /* The ada__tags__type_specific_data type, which is used when decoding
296 tagged types. With older versions of GNAT, this type was directly
297 accessible through a component ("tsd") in the object tag. But this
298 is no longer the case, so we cache it for each inferior. */
299 struct type
*tsd_type
= nullptr;
301 /* The exception_support_info data. This data is used to determine
302 how to implement support for Ada exception catchpoints in a given
304 const struct exception_support_info
*exception_info
= nullptr;
307 /* Our key to this module's inferior data. */
308 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
310 /* Return our inferior data for the given inferior (INF).
312 This function always returns a valid pointer to an allocated
313 ada_inferior_data structure. If INF's inferior data has not
314 been previously set, this functions creates a new one with all
315 fields set to zero, sets INF's inferior to it, and then returns
316 a pointer to that newly allocated ada_inferior_data. */
318 static struct ada_inferior_data
*
319 get_ada_inferior_data (struct inferior
*inf
)
321 struct ada_inferior_data
*data
;
323 data
= ada_inferior_data
.get (inf
);
325 data
= ada_inferior_data
.emplace (inf
);
330 /* Perform all necessary cleanups regarding our module's inferior data
331 that is required after the inferior INF just exited. */
334 ada_inferior_exit (struct inferior
*inf
)
336 ada_inferior_data
.clear (inf
);
340 /* program-space-specific data. */
342 /* This module's per-program-space data. */
343 struct ada_pspace_data
345 /* The Ada symbol cache. */
346 std::unique_ptr
<ada_symbol_cache
> sym_cache
;
349 /* Key to our per-program-space data. */
350 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
352 /* Return this module's data for the given program space (PSPACE).
353 If not is found, add a zero'ed one now.
355 This function always returns a valid object. */
357 static struct ada_pspace_data
*
358 get_ada_pspace_data (struct program_space
*pspace
)
360 struct ada_pspace_data
*data
;
362 data
= ada_pspace_data_handle
.get (pspace
);
364 data
= ada_pspace_data_handle
.emplace (pspace
);
371 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
372 all typedef layers have been peeled. Otherwise, return TYPE.
374 Normally, we really expect a typedef type to only have 1 typedef layer.
375 In other words, we really expect the target type of a typedef type to be
376 a non-typedef type. This is particularly true for Ada units, because
377 the language does not have a typedef vs not-typedef distinction.
378 In that respect, the Ada compiler has been trying to eliminate as many
379 typedef definitions in the debugging information, since they generally
380 do not bring any extra information (we still use typedef under certain
381 circumstances related mostly to the GNAT encoding).
383 Unfortunately, we have seen situations where the debugging information
384 generated by the compiler leads to such multiple typedef layers. For
385 instance, consider the following example with stabs:
387 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
388 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
390 This is an error in the debugging information which causes type
391 pck__float_array___XUP to be defined twice, and the second time,
392 it is defined as a typedef of a typedef.
394 This is on the fringe of legality as far as debugging information is
395 concerned, and certainly unexpected. But it is easy to handle these
396 situations correctly, so we can afford to be lenient in this case. */
399 ada_typedef_target_type (struct type
*type
)
401 while (type
->code () == TYPE_CODE_TYPEDEF
)
402 type
= TYPE_TARGET_TYPE (type
);
406 /* Given DECODED_NAME a string holding a symbol name in its
407 decoded form (ie using the Ada dotted notation), returns
408 its unqualified name. */
411 ada_unqualified_name (const char *decoded_name
)
415 /* If the decoded name starts with '<', it means that the encoded
416 name does not follow standard naming conventions, and thus that
417 it is not your typical Ada symbol name. Trying to unqualify it
418 is therefore pointless and possibly erroneous. */
419 if (decoded_name
[0] == '<')
422 result
= strrchr (decoded_name
, '.');
424 result
++; /* Skip the dot... */
426 result
= decoded_name
;
431 /* Return a string starting with '<', followed by STR, and '>'. */
434 add_angle_brackets (const char *str
)
436 return string_printf ("<%s>", str
);
439 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
440 suffix of FIELD_NAME beginning "___". */
443 field_name_match (const char *field_name
, const char *target
)
445 int len
= strlen (target
);
448 (strncmp (field_name
, target
, len
) == 0
449 && (field_name
[len
] == '\0'
450 || (startswith (field_name
+ len
, "___")
451 && strcmp (field_name
+ strlen (field_name
) - 6,
456 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
457 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
458 and return its index. This function also handles fields whose name
459 have ___ suffixes because the compiler sometimes alters their name
460 by adding such a suffix to represent fields with certain constraints.
461 If the field could not be found, return a negative number if
462 MAYBE_MISSING is set. Otherwise raise an error. */
465 ada_get_field_index (const struct type
*type
, const char *field_name
,
469 struct type
*struct_type
= check_typedef ((struct type
*) type
);
471 for (fieldno
= 0; fieldno
< struct_type
->num_fields (); fieldno
++)
472 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
476 error (_("Unable to find field %s in struct %s. Aborting"),
477 field_name
, struct_type
->name ());
482 /* The length of the prefix of NAME prior to any "___" suffix. */
485 ada_name_prefix_len (const char *name
)
491 const char *p
= strstr (name
, "___");
494 return strlen (name
);
500 /* Return non-zero if SUFFIX is a suffix of STR.
501 Return zero if STR is null. */
504 is_suffix (const char *str
, const char *suffix
)
511 len2
= strlen (suffix
);
512 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
515 /* The contents of value VAL, treated as a value of type TYPE. The
516 result is an lval in memory if VAL is. */
518 static struct value
*
519 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
521 type
= ada_check_typedef (type
);
522 if (value_type (val
) == type
)
526 struct value
*result
;
528 /* Make sure that the object size is not unreasonable before
529 trying to allocate some memory for it. */
530 ada_ensure_varsize_limit (type
);
532 if (value_optimized_out (val
))
533 result
= allocate_optimized_out_value (type
);
534 else if (value_lazy (val
)
535 /* Be careful not to make a lazy not_lval value. */
536 || (VALUE_LVAL (val
) != not_lval
537 && TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
))))
538 result
= allocate_value_lazy (type
);
541 result
= allocate_value (type
);
542 value_contents_copy (result
, 0, val
, 0, TYPE_LENGTH (type
));
544 set_value_component_location (result
, val
);
545 set_value_bitsize (result
, value_bitsize (val
));
546 set_value_bitpos (result
, value_bitpos (val
));
547 if (VALUE_LVAL (result
) == lval_memory
)
548 set_value_address (result
, value_address (val
));
553 static const gdb_byte
*
554 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
559 return valaddr
+ offset
;
563 cond_offset_target (CORE_ADDR address
, long offset
)
568 return address
+ offset
;
571 /* Issue a warning (as for the definition of warning in utils.c, but
572 with exactly one argument rather than ...), unless the limit on the
573 number of warnings has passed during the evaluation of the current
576 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
577 provided by "complaint". */
578 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
581 lim_warning (const char *format
, ...)
585 va_start (args
, format
);
586 warnings_issued
+= 1;
587 if (warnings_issued
<= warning_limit
)
588 vwarning (format
, args
);
593 /* Issue an error if the size of an object of type T is unreasonable,
594 i.e. if it would be a bad idea to allocate a value of this type in
598 ada_ensure_varsize_limit (const struct type
*type
)
600 if (TYPE_LENGTH (type
) > varsize_limit
)
601 error (_("object size is larger than varsize-limit"));
604 /* Maximum value of a SIZE-byte signed integer type. */
606 max_of_size (int size
)
608 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
610 return top_bit
| (top_bit
- 1);
613 /* Minimum value of a SIZE-byte signed integer type. */
615 min_of_size (int size
)
617 return -max_of_size (size
) - 1;
620 /* Maximum value of a SIZE-byte unsigned integer type. */
622 umax_of_size (int size
)
624 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
626 return top_bit
| (top_bit
- 1);
629 /* Maximum value of integral type T, as a signed quantity. */
631 max_of_type (struct type
*t
)
633 if (t
->is_unsigned ())
634 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
636 return max_of_size (TYPE_LENGTH (t
));
639 /* Minimum value of integral type T, as a signed quantity. */
641 min_of_type (struct type
*t
)
643 if (t
->is_unsigned ())
646 return min_of_size (TYPE_LENGTH (t
));
649 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
651 ada_discrete_type_high_bound (struct type
*type
)
653 type
= resolve_dynamic_type (type
, {}, 0);
654 switch (type
->code ())
656 case TYPE_CODE_RANGE
:
658 const dynamic_prop
&high
= type
->bounds ()->high
;
660 if (high
.kind () == PROP_CONST
)
661 return high
.const_val ();
664 gdb_assert (high
.kind () == PROP_UNDEFINED
);
666 /* This happens when trying to evaluate a type's dynamic bound
667 without a live target. There is nothing relevant for us to
668 return here, so return 0. */
673 return TYPE_FIELD_ENUMVAL (type
, type
->num_fields () - 1);
678 return max_of_type (type
);
680 error (_("Unexpected type in ada_discrete_type_high_bound."));
684 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
686 ada_discrete_type_low_bound (struct type
*type
)
688 type
= resolve_dynamic_type (type
, {}, 0);
689 switch (type
->code ())
691 case TYPE_CODE_RANGE
:
693 const dynamic_prop
&low
= type
->bounds ()->low
;
695 if (low
.kind () == PROP_CONST
)
696 return low
.const_val ();
699 gdb_assert (low
.kind () == PROP_UNDEFINED
);
701 /* This happens when trying to evaluate a type's dynamic bound
702 without a live target. There is nothing relevant for us to
703 return here, so return 0. */
708 return TYPE_FIELD_ENUMVAL (type
, 0);
713 return min_of_type (type
);
715 error (_("Unexpected type in ada_discrete_type_low_bound."));
719 /* The identity on non-range types. For range types, the underlying
720 non-range scalar type. */
723 get_base_type (struct type
*type
)
725 while (type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
)
727 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
729 type
= TYPE_TARGET_TYPE (type
);
734 /* Return a decoded version of the given VALUE. This means returning
735 a value whose type is obtained by applying all the GNAT-specific
736 encodings, making the resulting type a static but standard description
737 of the initial type. */
740 ada_get_decoded_value (struct value
*value
)
742 struct type
*type
= ada_check_typedef (value_type (value
));
744 if (ada_is_array_descriptor_type (type
)
745 || (ada_is_constrained_packed_array_type (type
)
746 && type
->code () != TYPE_CODE_PTR
))
748 if (type
->code () == TYPE_CODE_TYPEDEF
) /* array access type. */
749 value
= ada_coerce_to_simple_array_ptr (value
);
751 value
= ada_coerce_to_simple_array (value
);
754 value
= ada_to_fixed_value (value
);
759 /* Same as ada_get_decoded_value, but with the given TYPE.
760 Because there is no associated actual value for this type,
761 the resulting type might be a best-effort approximation in
762 the case of dynamic types. */
765 ada_get_decoded_type (struct type
*type
)
767 type
= to_static_fixed_type (type
);
768 if (ada_is_constrained_packed_array_type (type
))
769 type
= ada_coerce_to_simple_array_type (type
);
775 /* Language Selection */
777 /* If the main program is in Ada, return language_ada, otherwise return LANG
778 (the main program is in Ada iif the adainit symbol is found). */
781 ada_update_initial_language (enum language lang
)
783 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
789 /* If the main procedure is written in Ada, then return its name.
790 The result is good until the next call. Return NULL if the main
791 procedure doesn't appear to be in Ada. */
796 struct bound_minimal_symbol msym
;
797 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
799 /* For Ada, the name of the main procedure is stored in a specific
800 string constant, generated by the binder. Look for that symbol,
801 extract its address, and then read that string. If we didn't find
802 that string, then most probably the main procedure is not written
804 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
806 if (msym
.minsym
!= NULL
)
808 CORE_ADDR main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
809 if (main_program_name_addr
== 0)
810 error (_("Invalid address for Ada main program name."));
812 main_program_name
= target_read_string (main_program_name_addr
, 1024);
813 return main_program_name
.get ();
816 /* The main procedure doesn't seem to be in Ada. */
822 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
825 const struct ada_opname_map ada_opname_table
[] = {
826 {"Oadd", "\"+\"", BINOP_ADD
},
827 {"Osubtract", "\"-\"", BINOP_SUB
},
828 {"Omultiply", "\"*\"", BINOP_MUL
},
829 {"Odivide", "\"/\"", BINOP_DIV
},
830 {"Omod", "\"mod\"", BINOP_MOD
},
831 {"Orem", "\"rem\"", BINOP_REM
},
832 {"Oexpon", "\"**\"", BINOP_EXP
},
833 {"Olt", "\"<\"", BINOP_LESS
},
834 {"Ole", "\"<=\"", BINOP_LEQ
},
835 {"Ogt", "\">\"", BINOP_GTR
},
836 {"Oge", "\">=\"", BINOP_GEQ
},
837 {"Oeq", "\"=\"", BINOP_EQUAL
},
838 {"One", "\"/=\"", BINOP_NOTEQUAL
},
839 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
840 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
841 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
842 {"Oconcat", "\"&\"", BINOP_CONCAT
},
843 {"Oabs", "\"abs\"", UNOP_ABS
},
844 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
845 {"Oadd", "\"+\"", UNOP_PLUS
},
846 {"Osubtract", "\"-\"", UNOP_NEG
},
850 /* The "encoded" form of DECODED, according to GNAT conventions. If
851 THROW_ERRORS, throw an error if invalid operator name is found.
852 Otherwise, return the empty string in that case. */
855 ada_encode_1 (const char *decoded
, bool throw_errors
)
860 std::string encoding_buffer
;
861 for (const char *p
= decoded
; *p
!= '\0'; p
+= 1)
864 encoding_buffer
.append ("__");
867 const struct ada_opname_map
*mapping
;
869 for (mapping
= ada_opname_table
;
870 mapping
->encoded
!= NULL
871 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
873 if (mapping
->encoded
== NULL
)
876 error (_("invalid Ada operator name: %s"), p
);
880 encoding_buffer
.append (mapping
->encoded
);
884 encoding_buffer
.push_back (*p
);
887 return encoding_buffer
;
890 /* The "encoded" form of DECODED, according to GNAT conventions. */
893 ada_encode (const char *decoded
)
895 return ada_encode_1 (decoded
, true);
898 /* Return NAME folded to lower case, or, if surrounded by single
899 quotes, unfolded, but with the quotes stripped away. Result good
903 ada_fold_name (gdb::string_view name
)
905 static std::string fold_storage
;
907 if (!name
.empty () && name
[0] == '\'')
908 fold_storage
= gdb::to_string (name
.substr (1, name
.size () - 2));
911 fold_storage
= gdb::to_string (name
);
912 for (int i
= 0; i
< name
.size (); i
+= 1)
913 fold_storage
[i
] = tolower (fold_storage
[i
]);
916 return fold_storage
.c_str ();
919 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
922 is_lower_alphanum (const char c
)
924 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
927 /* ENCODED is the linkage name of a symbol and LEN contains its length.
928 This function saves in LEN the length of that same symbol name but
929 without either of these suffixes:
935 These are suffixes introduced by the compiler for entities such as
936 nested subprogram for instance, in order to avoid name clashes.
937 They do not serve any purpose for the debugger. */
940 ada_remove_trailing_digits (const char *encoded
, int *len
)
942 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
946 while (i
> 0 && isdigit (encoded
[i
]))
948 if (i
>= 0 && encoded
[i
] == '.')
950 else if (i
>= 0 && encoded
[i
] == '$')
952 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
954 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
959 /* Remove the suffix introduced by the compiler for protected object
963 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
965 /* Remove trailing N. */
967 /* Protected entry subprograms are broken into two
968 separate subprograms: The first one is unprotected, and has
969 a 'N' suffix; the second is the protected version, and has
970 the 'P' suffix. The second calls the first one after handling
971 the protection. Since the P subprograms are internally generated,
972 we leave these names undecoded, giving the user a clue that this
973 entity is internal. */
976 && encoded
[*len
- 1] == 'N'
977 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
981 /* If ENCODED follows the GNAT entity encoding conventions, then return
982 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
983 replaced by ENCODED. */
986 ada_decode (const char *encoded
)
994 /* With function descriptors on PPC64, the value of a symbol named
995 ".FN", if it exists, is the entry point of the function "FN". */
996 if (encoded
[0] == '.')
999 /* The name of the Ada main procedure starts with "_ada_".
1000 This prefix is not part of the decoded name, so skip this part
1001 if we see this prefix. */
1002 if (startswith (encoded
, "_ada_"))
1005 /* If the name starts with '_', then it is not a properly encoded
1006 name, so do not attempt to decode it. Similarly, if the name
1007 starts with '<', the name should not be decoded. */
1008 if (encoded
[0] == '_' || encoded
[0] == '<')
1011 len0
= strlen (encoded
);
1013 ada_remove_trailing_digits (encoded
, &len0
);
1014 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1016 /* Remove the ___X.* suffix if present. Do not forget to verify that
1017 the suffix is located before the current "end" of ENCODED. We want
1018 to avoid re-matching parts of ENCODED that have previously been
1019 marked as discarded (by decrementing LEN0). */
1020 p
= strstr (encoded
, "___");
1021 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1029 /* Remove any trailing TKB suffix. It tells us that this symbol
1030 is for the body of a task, but that information does not actually
1031 appear in the decoded name. */
1033 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1036 /* Remove any trailing TB suffix. The TB suffix is slightly different
1037 from the TKB suffix because it is used for non-anonymous task
1040 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1043 /* Remove trailing "B" suffixes. */
1044 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1046 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1049 /* Make decoded big enough for possible expansion by operator name. */
1051 decoded
.resize (2 * len0
+ 1, 'X');
1053 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1055 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1058 while ((i
>= 0 && isdigit (encoded
[i
]))
1059 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1061 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1063 else if (encoded
[i
] == '$')
1067 /* The first few characters that are not alphabetic are not part
1068 of any encoding we use, so we can copy them over verbatim. */
1070 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1071 decoded
[j
] = encoded
[i
];
1076 /* Is this a symbol function? */
1077 if (at_start_name
&& encoded
[i
] == 'O')
1081 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1083 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1084 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1086 && !isalnum (encoded
[i
+ op_len
]))
1088 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1091 j
+= strlen (ada_opname_table
[k
].decoded
);
1095 if (ada_opname_table
[k
].encoded
!= NULL
)
1100 /* Replace "TK__" with "__", which will eventually be translated
1101 into "." (just below). */
1103 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1106 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1107 be translated into "." (just below). These are internal names
1108 generated for anonymous blocks inside which our symbol is nested. */
1110 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1111 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1112 && isdigit (encoded
[i
+4]))
1116 while (k
< len0
&& isdigit (encoded
[k
]))
1117 k
++; /* Skip any extra digit. */
1119 /* Double-check that the "__B_{DIGITS}+" sequence we found
1120 is indeed followed by "__". */
1121 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1125 /* Remove _E{DIGITS}+[sb] */
1127 /* Just as for protected object subprograms, there are 2 categories
1128 of subprograms created by the compiler for each entry. The first
1129 one implements the actual entry code, and has a suffix following
1130 the convention above; the second one implements the barrier and
1131 uses the same convention as above, except that the 'E' is replaced
1134 Just as above, we do not decode the name of barrier functions
1135 to give the user a clue that the code he is debugging has been
1136 internally generated. */
1138 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1139 && isdigit (encoded
[i
+2]))
1143 while (k
< len0
&& isdigit (encoded
[k
]))
1147 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1150 /* Just as an extra precaution, make sure that if this
1151 suffix is followed by anything else, it is a '_'.
1152 Otherwise, we matched this sequence by accident. */
1154 || (k
< len0
&& encoded
[k
] == '_'))
1159 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1160 the GNAT front-end in protected object subprograms. */
1163 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1165 /* Backtrack a bit up until we reach either the begining of
1166 the encoded name, or "__". Make sure that we only find
1167 digits or lowercase characters. */
1168 const char *ptr
= encoded
+ i
- 1;
1170 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1173 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1177 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1179 /* This is a X[bn]* sequence not separated from the previous
1180 part of the name with a non-alpha-numeric character (in other
1181 words, immediately following an alpha-numeric character), then
1182 verify that it is placed at the end of the encoded name. If
1183 not, then the encoding is not valid and we should abort the
1184 decoding. Otherwise, just skip it, it is used in body-nested
1188 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1192 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1194 /* Replace '__' by '.'. */
1202 /* It's a character part of the decoded name, so just copy it
1204 decoded
[j
] = encoded
[i
];
1211 /* Decoded names should never contain any uppercase character.
1212 Double-check this, and abort the decoding if we find one. */
1214 for (i
= 0; i
< decoded
.length(); ++i
)
1215 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1221 if (encoded
[0] == '<')
1224 decoded
= '<' + std::string(encoded
) + '>';
1229 /* Table for keeping permanent unique copies of decoded names. Once
1230 allocated, names in this table are never released. While this is a
1231 storage leak, it should not be significant unless there are massive
1232 changes in the set of decoded names in successive versions of a
1233 symbol table loaded during a single session. */
1234 static struct htab
*decoded_names_store
;
1236 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1237 in the language-specific part of GSYMBOL, if it has not been
1238 previously computed. Tries to save the decoded name in the same
1239 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1240 in any case, the decoded symbol has a lifetime at least that of
1242 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1243 const, but nevertheless modified to a semantically equivalent form
1244 when a decoded name is cached in it. */
1247 ada_decode_symbol (const struct general_symbol_info
*arg
)
1249 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1250 const char **resultp
=
1251 &gsymbol
->language_specific
.demangled_name
;
1253 if (!gsymbol
->ada_mangled
)
1255 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1256 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1258 gsymbol
->ada_mangled
= 1;
1260 if (obstack
!= NULL
)
1261 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1264 /* Sometimes, we can't find a corresponding objfile, in
1265 which case, we put the result on the heap. Since we only
1266 decode when needed, we hope this usually does not cause a
1267 significant memory leak (FIXME). */
1269 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1270 decoded
.c_str (), INSERT
);
1273 *slot
= xstrdup (decoded
.c_str ());
1282 ada_la_decode (const char *encoded
, int options
)
1284 return xstrdup (ada_decode (encoded
).c_str ());
1291 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1292 generated by the GNAT compiler to describe the index type used
1293 for each dimension of an array, check whether it follows the latest
1294 known encoding. If not, fix it up to conform to the latest encoding.
1295 Otherwise, do nothing. This function also does nothing if
1296 INDEX_DESC_TYPE is NULL.
1298 The GNAT encoding used to describe the array index type evolved a bit.
1299 Initially, the information would be provided through the name of each
1300 field of the structure type only, while the type of these fields was
1301 described as unspecified and irrelevant. The debugger was then expected
1302 to perform a global type lookup using the name of that field in order
1303 to get access to the full index type description. Because these global
1304 lookups can be very expensive, the encoding was later enhanced to make
1305 the global lookup unnecessary by defining the field type as being
1306 the full index type description.
1308 The purpose of this routine is to allow us to support older versions
1309 of the compiler by detecting the use of the older encoding, and by
1310 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1311 we essentially replace each field's meaningless type by the associated
1315 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1319 if (index_desc_type
== NULL
)
1321 gdb_assert (index_desc_type
->num_fields () > 0);
1323 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1324 to check one field only, no need to check them all). If not, return
1327 If our INDEX_DESC_TYPE was generated using the older encoding,
1328 the field type should be a meaningless integer type whose name
1329 is not equal to the field name. */
1330 if (index_desc_type
->field (0).type ()->name () != NULL
1331 && strcmp (index_desc_type
->field (0).type ()->name (),
1332 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1335 /* Fixup each field of INDEX_DESC_TYPE. */
1336 for (i
= 0; i
< index_desc_type
->num_fields (); i
++)
1338 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1339 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1342 index_desc_type
->field (i
).set_type (raw_type
);
1346 /* The desc_* routines return primitive portions of array descriptors
1349 /* The descriptor or array type, if any, indicated by TYPE; removes
1350 level of indirection, if needed. */
1352 static struct type
*
1353 desc_base_type (struct type
*type
)
1357 type
= ada_check_typedef (type
);
1358 if (type
->code () == TYPE_CODE_TYPEDEF
)
1359 type
= ada_typedef_target_type (type
);
1362 && (type
->code () == TYPE_CODE_PTR
1363 || type
->code () == TYPE_CODE_REF
))
1364 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1369 /* True iff TYPE indicates a "thin" array pointer type. */
1372 is_thin_pntr (struct type
*type
)
1375 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1376 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1379 /* The descriptor type for thin pointer type TYPE. */
1381 static struct type
*
1382 thin_descriptor_type (struct type
*type
)
1384 struct type
*base_type
= desc_base_type (type
);
1386 if (base_type
== NULL
)
1388 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1392 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1394 if (alt_type
== NULL
)
1401 /* A pointer to the array data for thin-pointer value VAL. */
1403 static struct value
*
1404 thin_data_pntr (struct value
*val
)
1406 struct type
*type
= ada_check_typedef (value_type (val
));
1407 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1409 data_type
= lookup_pointer_type (data_type
);
1411 if (type
->code () == TYPE_CODE_PTR
)
1412 return value_cast (data_type
, value_copy (val
));
1414 return value_from_longest (data_type
, value_address (val
));
1417 /* True iff TYPE indicates a "thick" array pointer type. */
1420 is_thick_pntr (struct type
*type
)
1422 type
= desc_base_type (type
);
1423 return (type
!= NULL
&& type
->code () == TYPE_CODE_STRUCT
1424 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1427 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1428 pointer to one, the type of its bounds data; otherwise, NULL. */
1430 static struct type
*
1431 desc_bounds_type (struct type
*type
)
1435 type
= desc_base_type (type
);
1439 else if (is_thin_pntr (type
))
1441 type
= thin_descriptor_type (type
);
1444 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1446 return ada_check_typedef (r
);
1448 else if (type
->code () == TYPE_CODE_STRUCT
)
1450 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1452 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1457 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1458 one, a pointer to its bounds data. Otherwise NULL. */
1460 static struct value
*
1461 desc_bounds (struct value
*arr
)
1463 struct type
*type
= ada_check_typedef (value_type (arr
));
1465 if (is_thin_pntr (type
))
1467 struct type
*bounds_type
=
1468 desc_bounds_type (thin_descriptor_type (type
));
1471 if (bounds_type
== NULL
)
1472 error (_("Bad GNAT array descriptor"));
1474 /* NOTE: The following calculation is not really kosher, but
1475 since desc_type is an XVE-encoded type (and shouldn't be),
1476 the correct calculation is a real pain. FIXME (and fix GCC). */
1477 if (type
->code () == TYPE_CODE_PTR
)
1478 addr
= value_as_long (arr
);
1480 addr
= value_address (arr
);
1483 value_from_longest (lookup_pointer_type (bounds_type
),
1484 addr
- TYPE_LENGTH (bounds_type
));
1487 else if (is_thick_pntr (type
))
1489 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1490 _("Bad GNAT array descriptor"));
1491 struct type
*p_bounds_type
= value_type (p_bounds
);
1494 && p_bounds_type
->code () == TYPE_CODE_PTR
)
1496 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1498 if (target_type
->is_stub ())
1499 p_bounds
= value_cast (lookup_pointer_type
1500 (ada_check_typedef (target_type
)),
1504 error (_("Bad GNAT array descriptor"));
1512 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1513 position of the field containing the address of the bounds data. */
1516 fat_pntr_bounds_bitpos (struct type
*type
)
1518 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1521 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1522 size of the field containing the address of the bounds data. */
1525 fat_pntr_bounds_bitsize (struct type
*type
)
1527 type
= desc_base_type (type
);
1529 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1530 return TYPE_FIELD_BITSIZE (type
, 1);
1532 return 8 * TYPE_LENGTH (ada_check_typedef (type
->field (1).type ()));
1535 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1536 pointer to one, the type of its array data (a array-with-no-bounds type);
1537 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1540 static struct type
*
1541 desc_data_target_type (struct type
*type
)
1543 type
= desc_base_type (type
);
1545 /* NOTE: The following is bogus; see comment in desc_bounds. */
1546 if (is_thin_pntr (type
))
1547 return desc_base_type (thin_descriptor_type (type
)->field (1).type ());
1548 else if (is_thick_pntr (type
))
1550 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1553 && ada_check_typedef (data_type
)->code () == TYPE_CODE_PTR
)
1554 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1560 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1563 static struct value
*
1564 desc_data (struct value
*arr
)
1566 struct type
*type
= value_type (arr
);
1568 if (is_thin_pntr (type
))
1569 return thin_data_pntr (arr
);
1570 else if (is_thick_pntr (type
))
1571 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1572 _("Bad GNAT array descriptor"));
1578 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1579 position of the field containing the address of the data. */
1582 fat_pntr_data_bitpos (struct type
*type
)
1584 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1587 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1588 size of the field containing the address of the data. */
1591 fat_pntr_data_bitsize (struct type
*type
)
1593 type
= desc_base_type (type
);
1595 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1596 return TYPE_FIELD_BITSIZE (type
, 0);
1598 return TARGET_CHAR_BIT
* TYPE_LENGTH (type
->field (0).type ());
1601 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1602 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1603 bound, if WHICH is 1. The first bound is I=1. */
1605 static struct value
*
1606 desc_one_bound (struct value
*bounds
, int i
, int which
)
1608 char bound_name
[20];
1609 xsnprintf (bound_name
, sizeof (bound_name
), "%cB%d",
1610 which
? 'U' : 'L', i
- 1);
1611 return value_struct_elt (&bounds
, NULL
, bound_name
, NULL
,
1612 _("Bad GNAT array descriptor bounds"));
1615 /* If BOUNDS is an array-bounds structure type, return the bit position
1616 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1617 bound, if WHICH is 1. The first bound is I=1. */
1620 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1622 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1625 /* If BOUNDS is an array-bounds structure type, return the bit field size
1626 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1627 bound, if WHICH is 1. The first bound is I=1. */
1630 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1632 type
= desc_base_type (type
);
1634 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1635 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1637 return 8 * TYPE_LENGTH (type
->field (2 * i
+ which
- 2).type ());
1640 /* If TYPE is the type of an array-bounds structure, the type of its
1641 Ith bound (numbering from 1). Otherwise, NULL. */
1643 static struct type
*
1644 desc_index_type (struct type
*type
, int i
)
1646 type
= desc_base_type (type
);
1648 if (type
->code () == TYPE_CODE_STRUCT
)
1650 char bound_name
[20];
1651 xsnprintf (bound_name
, sizeof (bound_name
), "LB%d", i
- 1);
1652 return lookup_struct_elt_type (type
, bound_name
, 1);
1658 /* The number of index positions in the array-bounds type TYPE.
1659 Return 0 if TYPE is NULL. */
1662 desc_arity (struct type
*type
)
1664 type
= desc_base_type (type
);
1667 return type
->num_fields () / 2;
1671 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1672 an array descriptor type (representing an unconstrained array
1676 ada_is_direct_array_type (struct type
*type
)
1680 type
= ada_check_typedef (type
);
1681 return (type
->code () == TYPE_CODE_ARRAY
1682 || ada_is_array_descriptor_type (type
));
1685 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1689 ada_is_array_type (struct type
*type
)
1692 && (type
->code () == TYPE_CODE_PTR
1693 || type
->code () == TYPE_CODE_REF
))
1694 type
= TYPE_TARGET_TYPE (type
);
1695 return ada_is_direct_array_type (type
);
1698 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1701 ada_is_simple_array_type (struct type
*type
)
1705 type
= ada_check_typedef (type
);
1706 return (type
->code () == TYPE_CODE_ARRAY
1707 || (type
->code () == TYPE_CODE_PTR
1708 && (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ()
1709 == TYPE_CODE_ARRAY
)));
1712 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1715 ada_is_array_descriptor_type (struct type
*type
)
1717 struct type
*data_type
= desc_data_target_type (type
);
1721 type
= ada_check_typedef (type
);
1722 return (data_type
!= NULL
1723 && data_type
->code () == TYPE_CODE_ARRAY
1724 && desc_arity (desc_bounds_type (type
)) > 0);
1727 /* Non-zero iff type is a partially mal-formed GNAT array
1728 descriptor. FIXME: This is to compensate for some problems with
1729 debugging output from GNAT. Re-examine periodically to see if it
1733 ada_is_bogus_array_descriptor (struct type
*type
)
1737 && type
->code () == TYPE_CODE_STRUCT
1738 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1739 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1740 && !ada_is_array_descriptor_type (type
);
1744 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1745 (fat pointer) returns the type of the array data described---specifically,
1746 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1747 in from the descriptor; otherwise, they are left unspecified. If
1748 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1749 returns NULL. The result is simply the type of ARR if ARR is not
1752 static struct type
*
1753 ada_type_of_array (struct value
*arr
, int bounds
)
1755 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1756 return decode_constrained_packed_array_type (value_type (arr
));
1758 if (!ada_is_array_descriptor_type (value_type (arr
)))
1759 return value_type (arr
);
1763 struct type
*array_type
=
1764 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1766 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1767 TYPE_FIELD_BITSIZE (array_type
, 0) =
1768 decode_packed_array_bitsize (value_type (arr
));
1774 struct type
*elt_type
;
1776 struct value
*descriptor
;
1778 elt_type
= ada_array_element_type (value_type (arr
), -1);
1779 arity
= ada_array_arity (value_type (arr
));
1781 if (elt_type
== NULL
|| arity
== 0)
1782 return ada_check_typedef (value_type (arr
));
1784 descriptor
= desc_bounds (arr
);
1785 if (value_as_long (descriptor
) == 0)
1789 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1790 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1791 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1792 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1795 create_static_range_type (range_type
, value_type (low
),
1796 longest_to_int (value_as_long (low
)),
1797 longest_to_int (value_as_long (high
)));
1798 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1800 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1802 /* We need to store the element packed bitsize, as well as
1803 recompute the array size, because it was previously
1804 computed based on the unpacked element size. */
1805 LONGEST lo
= value_as_long (low
);
1806 LONGEST hi
= value_as_long (high
);
1808 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1809 decode_packed_array_bitsize (value_type (arr
));
1810 /* If the array has no element, then the size is already
1811 zero, and does not need to be recomputed. */
1815 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1817 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1822 return lookup_pointer_type (elt_type
);
1826 /* If ARR does not represent an array, returns ARR unchanged.
1827 Otherwise, returns either a standard GDB array with bounds set
1828 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1829 GDB array. Returns NULL if ARR is a null fat pointer. */
1832 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1834 if (ada_is_array_descriptor_type (value_type (arr
)))
1836 struct type
*arrType
= ada_type_of_array (arr
, 1);
1838 if (arrType
== NULL
)
1840 return value_cast (arrType
, value_copy (desc_data (arr
)));
1842 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1843 return decode_constrained_packed_array (arr
);
1848 /* If ARR does not represent an array, returns ARR unchanged.
1849 Otherwise, returns a standard GDB array describing ARR (which may
1850 be ARR itself if it already is in the proper form). */
1853 ada_coerce_to_simple_array (struct value
*arr
)
1855 if (ada_is_array_descriptor_type (value_type (arr
)))
1857 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1860 error (_("Bounds unavailable for null array pointer."));
1861 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
1862 return value_ind (arrVal
);
1864 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1865 return decode_constrained_packed_array (arr
);
1870 /* If TYPE represents a GNAT array type, return it translated to an
1871 ordinary GDB array type (possibly with BITSIZE fields indicating
1872 packing). For other types, is the identity. */
1875 ada_coerce_to_simple_array_type (struct type
*type
)
1877 if (ada_is_constrained_packed_array_type (type
))
1878 return decode_constrained_packed_array_type (type
);
1880 if (ada_is_array_descriptor_type (type
))
1881 return ada_check_typedef (desc_data_target_type (type
));
1886 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1889 ada_is_gnat_encoded_packed_array_type (struct type
*type
)
1893 type
= desc_base_type (type
);
1894 type
= ada_check_typedef (type
);
1896 ada_type_name (type
) != NULL
1897 && strstr (ada_type_name (type
), "___XP") != NULL
;
1900 /* Non-zero iff TYPE represents a standard GNAT constrained
1901 packed-array type. */
1904 ada_is_constrained_packed_array_type (struct type
*type
)
1906 return ada_is_gnat_encoded_packed_array_type (type
)
1907 && !ada_is_array_descriptor_type (type
);
1910 /* Non-zero iff TYPE represents an array descriptor for a
1911 unconstrained packed-array type. */
1914 ada_is_unconstrained_packed_array_type (struct type
*type
)
1916 if (!ada_is_array_descriptor_type (type
))
1919 if (ada_is_gnat_encoded_packed_array_type (type
))
1922 /* If we saw GNAT encodings, then the above code is sufficient.
1923 However, with minimal encodings, we will just have a thick
1925 if (is_thick_pntr (type
))
1927 type
= desc_base_type (type
);
1928 /* The structure's first field is a pointer to an array, so this
1929 fetches the array type. */
1930 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
1931 /* Now we can see if the array elements are packed. */
1932 return TYPE_FIELD_BITSIZE (type
, 0) > 0;
1938 /* Return true if TYPE is a (Gnat-encoded) constrained packed array
1939 type, or if it is an ordinary (non-Gnat-encoded) packed array. */
1942 ada_is_any_packed_array_type (struct type
*type
)
1944 return (ada_is_constrained_packed_array_type (type
)
1945 || (type
->code () == TYPE_CODE_ARRAY
1946 && TYPE_FIELD_BITSIZE (type
, 0) % 8 != 0));
1949 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1950 return the size of its elements in bits. */
1953 decode_packed_array_bitsize (struct type
*type
)
1955 const char *raw_name
;
1959 /* Access to arrays implemented as fat pointers are encoded as a typedef
1960 of the fat pointer type. We need the name of the fat pointer type
1961 to do the decoding, so strip the typedef layer. */
1962 if (type
->code () == TYPE_CODE_TYPEDEF
)
1963 type
= ada_typedef_target_type (type
);
1965 raw_name
= ada_type_name (ada_check_typedef (type
));
1967 raw_name
= ada_type_name (desc_base_type (type
));
1972 tail
= strstr (raw_name
, "___XP");
1973 if (tail
== nullptr)
1975 gdb_assert (is_thick_pntr (type
));
1976 /* The structure's first field is a pointer to an array, so this
1977 fetches the array type. */
1978 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
1979 /* Now we can see if the array elements are packed. */
1980 return TYPE_FIELD_BITSIZE (type
, 0);
1983 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1986 (_("could not understand bit size information on packed array"));
1993 /* Given that TYPE is a standard GDB array type with all bounds filled
1994 in, and that the element size of its ultimate scalar constituents
1995 (that is, either its elements, or, if it is an array of arrays, its
1996 elements' elements, etc.) is *ELT_BITS, return an identical type,
1997 but with the bit sizes of its elements (and those of any
1998 constituent arrays) recorded in the BITSIZE components of its
1999 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2002 Note that, for arrays whose index type has an XA encoding where
2003 a bound references a record discriminant, getting that discriminant,
2004 and therefore the actual value of that bound, is not possible
2005 because none of the given parameters gives us access to the record.
2006 This function assumes that it is OK in the context where it is being
2007 used to return an array whose bounds are still dynamic and where
2008 the length is arbitrary. */
2010 static struct type
*
2011 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2013 struct type
*new_elt_type
;
2014 struct type
*new_type
;
2015 struct type
*index_type_desc
;
2016 struct type
*index_type
;
2017 LONGEST low_bound
, high_bound
;
2019 type
= ada_check_typedef (type
);
2020 if (type
->code () != TYPE_CODE_ARRAY
)
2023 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2024 if (index_type_desc
)
2025 index_type
= to_fixed_range_type (index_type_desc
->field (0).type (),
2028 index_type
= type
->index_type ();
2030 new_type
= alloc_type_copy (type
);
2032 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2034 create_array_type (new_type
, new_elt_type
, index_type
);
2035 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2036 new_type
->set_name (ada_type_name (type
));
2038 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2039 && is_dynamic_type (check_typedef (index_type
)))
2040 || !get_discrete_bounds (index_type
, &low_bound
, &high_bound
))
2041 low_bound
= high_bound
= 0;
2042 if (high_bound
< low_bound
)
2043 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2046 *elt_bits
*= (high_bound
- low_bound
+ 1);
2047 TYPE_LENGTH (new_type
) =
2048 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2051 new_type
->set_is_fixed_instance (true);
2055 /* The array type encoded by TYPE, where
2056 ada_is_constrained_packed_array_type (TYPE). */
2058 static struct type
*
2059 decode_constrained_packed_array_type (struct type
*type
)
2061 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2064 struct type
*shadow_type
;
2068 raw_name
= ada_type_name (desc_base_type (type
));
2073 name
= (char *) alloca (strlen (raw_name
) + 1);
2074 tail
= strstr (raw_name
, "___XP");
2075 type
= desc_base_type (type
);
2077 memcpy (name
, raw_name
, tail
- raw_name
);
2078 name
[tail
- raw_name
] = '\000';
2080 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2082 if (shadow_type
== NULL
)
2084 lim_warning (_("could not find bounds information on packed array"));
2087 shadow_type
= check_typedef (shadow_type
);
2089 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2091 lim_warning (_("could not understand bounds "
2092 "information on packed array"));
2096 bits
= decode_packed_array_bitsize (type
);
2097 return constrained_packed_array_type (shadow_type
, &bits
);
2100 /* Helper function for decode_constrained_packed_array. Set the field
2101 bitsize on a series of packed arrays. Returns the number of
2102 elements in TYPE. */
2105 recursively_update_array_bitsize (struct type
*type
)
2107 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
2110 if (!get_discrete_bounds (type
->index_type (), &low
, &high
)
2113 LONGEST our_len
= high
- low
+ 1;
2115 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
2116 if (elt_type
->code () == TYPE_CODE_ARRAY
)
2118 LONGEST elt_len
= recursively_update_array_bitsize (elt_type
);
2119 LONGEST elt_bitsize
= elt_len
* TYPE_FIELD_BITSIZE (elt_type
, 0);
2120 TYPE_FIELD_BITSIZE (type
, 0) = elt_bitsize
;
2122 TYPE_LENGTH (type
) = ((our_len
* elt_bitsize
+ HOST_CHAR_BIT
- 1)
2129 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2130 array, returns a simple array that denotes that array. Its type is a
2131 standard GDB array type except that the BITSIZEs of the array
2132 target types are set to the number of bits in each element, and the
2133 type length is set appropriately. */
2135 static struct value
*
2136 decode_constrained_packed_array (struct value
*arr
)
2140 /* If our value is a pointer, then dereference it. Likewise if
2141 the value is a reference. Make sure that this operation does not
2142 cause the target type to be fixed, as this would indirectly cause
2143 this array to be decoded. The rest of the routine assumes that
2144 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2145 and "value_ind" routines to perform the dereferencing, as opposed
2146 to using "ada_coerce_ref" or "ada_value_ind". */
2147 arr
= coerce_ref (arr
);
2148 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2149 arr
= value_ind (arr
);
2151 type
= decode_constrained_packed_array_type (value_type (arr
));
2154 error (_("can't unpack array"));
2158 /* Decoding the packed array type could not correctly set the field
2159 bitsizes for any dimension except the innermost, because the
2160 bounds may be variable and were not passed to that function. So,
2161 we further resolve the array bounds here and then update the
2163 const gdb_byte
*valaddr
= value_contents_for_printing (arr
);
2164 CORE_ADDR address
= value_address (arr
);
2165 gdb::array_view
<const gdb_byte
> view
2166 = gdb::make_array_view (valaddr
, TYPE_LENGTH (type
));
2167 type
= resolve_dynamic_type (type
, view
, address
);
2168 recursively_update_array_bitsize (type
);
2170 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2171 && ada_is_modular_type (value_type (arr
)))
2173 /* This is a (right-justified) modular type representing a packed
2174 array with no wrapper. In order to interpret the value through
2175 the (left-justified) packed array type we just built, we must
2176 first left-justify it. */
2177 int bit_size
, bit_pos
;
2180 mod
= ada_modulus (value_type (arr
)) - 1;
2187 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2188 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2189 bit_pos
/ HOST_CHAR_BIT
,
2190 bit_pos
% HOST_CHAR_BIT
,
2195 return coerce_unspec_val_to_type (arr
, type
);
2199 /* The value of the element of packed array ARR at the ARITY indices
2200 given in IND. ARR must be a simple array. */
2202 static struct value
*
2203 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2206 int bits
, elt_off
, bit_off
;
2207 long elt_total_bit_offset
;
2208 struct type
*elt_type
;
2212 elt_total_bit_offset
= 0;
2213 elt_type
= ada_check_typedef (value_type (arr
));
2214 for (i
= 0; i
< arity
; i
+= 1)
2216 if (elt_type
->code () != TYPE_CODE_ARRAY
2217 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2219 (_("attempt to do packed indexing of "
2220 "something other than a packed array"));
2223 struct type
*range_type
= elt_type
->index_type ();
2224 LONGEST lowerbound
, upperbound
;
2227 if (!get_discrete_bounds (range_type
, &lowerbound
, &upperbound
))
2229 lim_warning (_("don't know bounds of array"));
2230 lowerbound
= upperbound
= 0;
2233 idx
= pos_atr (ind
[i
]);
2234 if (idx
< lowerbound
|| idx
> upperbound
)
2235 lim_warning (_("packed array index %ld out of bounds"),
2237 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2238 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2239 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2242 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2243 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2245 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2250 /* Non-zero iff TYPE includes negative integer values. */
2253 has_negatives (struct type
*type
)
2255 switch (type
->code ())
2260 return !type
->is_unsigned ();
2261 case TYPE_CODE_RANGE
:
2262 return type
->bounds ()->low
.const_val () - type
->bounds ()->bias
< 0;
2266 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2267 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2268 the unpacked buffer.
2270 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2271 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2273 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2276 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2278 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2281 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2282 gdb_byte
*unpacked
, int unpacked_len
,
2283 int is_big_endian
, int is_signed_type
,
2286 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2287 int src_idx
; /* Index into the source area */
2288 int src_bytes_left
; /* Number of source bytes left to process. */
2289 int srcBitsLeft
; /* Number of source bits left to move */
2290 int unusedLS
; /* Number of bits in next significant
2291 byte of source that are unused */
2293 int unpacked_idx
; /* Index into the unpacked buffer */
2294 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2296 unsigned long accum
; /* Staging area for bits being transferred */
2297 int accumSize
; /* Number of meaningful bits in accum */
2300 /* Transmit bytes from least to most significant; delta is the direction
2301 the indices move. */
2302 int delta
= is_big_endian
? -1 : 1;
2304 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2306 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2307 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2308 bit_size
, unpacked_len
);
2310 srcBitsLeft
= bit_size
;
2311 src_bytes_left
= src_len
;
2312 unpacked_bytes_left
= unpacked_len
;
2317 src_idx
= src_len
- 1;
2319 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2323 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2329 unpacked_idx
= unpacked_len
- 1;
2333 /* Non-scalar values must be aligned at a byte boundary... */
2335 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2336 /* ... And are placed at the beginning (most-significant) bytes
2338 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2339 unpacked_bytes_left
= unpacked_idx
+ 1;
2344 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2346 src_idx
= unpacked_idx
= 0;
2347 unusedLS
= bit_offset
;
2350 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2355 while (src_bytes_left
> 0)
2357 /* Mask for removing bits of the next source byte that are not
2358 part of the value. */
2359 unsigned int unusedMSMask
=
2360 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2362 /* Sign-extend bits for this byte. */
2363 unsigned int signMask
= sign
& ~unusedMSMask
;
2366 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2367 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2368 if (accumSize
>= HOST_CHAR_BIT
)
2370 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2371 accumSize
-= HOST_CHAR_BIT
;
2372 accum
>>= HOST_CHAR_BIT
;
2373 unpacked_bytes_left
-= 1;
2374 unpacked_idx
+= delta
;
2376 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2378 src_bytes_left
-= 1;
2381 while (unpacked_bytes_left
> 0)
2383 accum
|= sign
<< accumSize
;
2384 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2385 accumSize
-= HOST_CHAR_BIT
;
2388 accum
>>= HOST_CHAR_BIT
;
2389 unpacked_bytes_left
-= 1;
2390 unpacked_idx
+= delta
;
2394 /* Create a new value of type TYPE from the contents of OBJ starting
2395 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2396 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2397 assigning through the result will set the field fetched from.
2398 VALADDR is ignored unless OBJ is NULL, in which case,
2399 VALADDR+OFFSET must address the start of storage containing the
2400 packed value. The value returned in this case is never an lval.
2401 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2404 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2405 long offset
, int bit_offset
, int bit_size
,
2409 const gdb_byte
*src
; /* First byte containing data to unpack */
2411 const int is_scalar
= is_scalar_type (type
);
2412 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2413 gdb::byte_vector staging
;
2415 type
= ada_check_typedef (type
);
2418 src
= valaddr
+ offset
;
2420 src
= value_contents (obj
) + offset
;
2422 if (is_dynamic_type (type
))
2424 /* The length of TYPE might by dynamic, so we need to resolve
2425 TYPE in order to know its actual size, which we then use
2426 to create the contents buffer of the value we return.
2427 The difficulty is that the data containing our object is
2428 packed, and therefore maybe not at a byte boundary. So, what
2429 we do, is unpack the data into a byte-aligned buffer, and then
2430 use that buffer as our object's value for resolving the type. */
2431 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2432 staging
.resize (staging_len
);
2434 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2435 staging
.data (), staging
.size (),
2436 is_big_endian
, has_negatives (type
),
2438 type
= resolve_dynamic_type (type
, staging
, 0);
2439 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2441 /* This happens when the length of the object is dynamic,
2442 and is actually smaller than the space reserved for it.
2443 For instance, in an array of variant records, the bit_size
2444 we're given is the array stride, which is constant and
2445 normally equal to the maximum size of its element.
2446 But, in reality, each element only actually spans a portion
2448 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2454 v
= allocate_value (type
);
2455 src
= valaddr
+ offset
;
2457 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2459 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2462 v
= value_at (type
, value_address (obj
) + offset
);
2463 buf
= (gdb_byte
*) alloca (src_len
);
2464 read_memory (value_address (v
), buf
, src_len
);
2469 v
= allocate_value (type
);
2470 src
= value_contents (obj
) + offset
;
2475 long new_offset
= offset
;
2477 set_value_component_location (v
, obj
);
2478 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2479 set_value_bitsize (v
, bit_size
);
2480 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2483 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2485 set_value_offset (v
, new_offset
);
2487 /* Also set the parent value. This is needed when trying to
2488 assign a new value (in inferior memory). */
2489 set_value_parent (v
, obj
);
2492 set_value_bitsize (v
, bit_size
);
2493 unpacked
= value_contents_writeable (v
);
2497 memset (unpacked
, 0, TYPE_LENGTH (type
));
2501 if (staging
.size () == TYPE_LENGTH (type
))
2503 /* Small short-cut: If we've unpacked the data into a buffer
2504 of the same size as TYPE's length, then we can reuse that,
2505 instead of doing the unpacking again. */
2506 memcpy (unpacked
, staging
.data (), staging
.size ());
2509 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2510 unpacked
, TYPE_LENGTH (type
),
2511 is_big_endian
, has_negatives (type
), is_scalar
);
2516 /* Store the contents of FROMVAL into the location of TOVAL.
2517 Return a new value with the location of TOVAL and contents of
2518 FROMVAL. Handles assignment into packed fields that have
2519 floating-point or non-scalar types. */
2521 static struct value
*
2522 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2524 struct type
*type
= value_type (toval
);
2525 int bits
= value_bitsize (toval
);
2527 toval
= ada_coerce_ref (toval
);
2528 fromval
= ada_coerce_ref (fromval
);
2530 if (ada_is_direct_array_type (value_type (toval
)))
2531 toval
= ada_coerce_to_simple_array (toval
);
2532 if (ada_is_direct_array_type (value_type (fromval
)))
2533 fromval
= ada_coerce_to_simple_array (fromval
);
2535 if (!deprecated_value_modifiable (toval
))
2536 error (_("Left operand of assignment is not a modifiable lvalue."));
2538 if (VALUE_LVAL (toval
) == lval_memory
2540 && (type
->code () == TYPE_CODE_FLT
2541 || type
->code () == TYPE_CODE_STRUCT
))
2543 int len
= (value_bitpos (toval
)
2544 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2546 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2548 CORE_ADDR to_addr
= value_address (toval
);
2550 if (type
->code () == TYPE_CODE_FLT
)
2551 fromval
= value_cast (type
, fromval
);
2553 read_memory (to_addr
, buffer
, len
);
2554 from_size
= value_bitsize (fromval
);
2556 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2558 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2559 ULONGEST from_offset
= 0;
2560 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2561 from_offset
= from_size
- bits
;
2562 copy_bitwise (buffer
, value_bitpos (toval
),
2563 value_contents (fromval
), from_offset
,
2564 bits
, is_big_endian
);
2565 write_memory_with_notification (to_addr
, buffer
, len
);
2567 val
= value_copy (toval
);
2568 memcpy (value_contents_raw (val
), value_contents (fromval
),
2569 TYPE_LENGTH (type
));
2570 deprecated_set_value_type (val
, type
);
2575 return value_assign (toval
, fromval
);
2579 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2580 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2581 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2582 COMPONENT, and not the inferior's memory. The current contents
2583 of COMPONENT are ignored.
2585 Although not part of the initial design, this function also works
2586 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2587 had a null address, and COMPONENT had an address which is equal to
2588 its offset inside CONTAINER. */
2591 value_assign_to_component (struct value
*container
, struct value
*component
,
2594 LONGEST offset_in_container
=
2595 (LONGEST
) (value_address (component
) - value_address (container
));
2596 int bit_offset_in_container
=
2597 value_bitpos (component
) - value_bitpos (container
);
2600 val
= value_cast (value_type (component
), val
);
2602 if (value_bitsize (component
) == 0)
2603 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2605 bits
= value_bitsize (component
);
2607 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2611 if (is_scalar_type (check_typedef (value_type (component
))))
2613 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2616 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2617 value_bitpos (container
) + bit_offset_in_container
,
2618 value_contents (val
), src_offset
, bits
, 1);
2621 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2622 value_bitpos (container
) + bit_offset_in_container
,
2623 value_contents (val
), 0, bits
, 0);
2626 /* Determine if TYPE is an access to an unconstrained array. */
2629 ada_is_access_to_unconstrained_array (struct type
*type
)
2631 return (type
->code () == TYPE_CODE_TYPEDEF
2632 && is_thick_pntr (ada_typedef_target_type (type
)));
2635 /* The value of the element of array ARR at the ARITY indices given in IND.
2636 ARR may be either a simple array, GNAT array descriptor, or pointer
2640 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2644 struct type
*elt_type
;
2646 elt
= ada_coerce_to_simple_array (arr
);
2648 elt_type
= ada_check_typedef (value_type (elt
));
2649 if (elt_type
->code () == TYPE_CODE_ARRAY
2650 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2651 return value_subscript_packed (elt
, arity
, ind
);
2653 for (k
= 0; k
< arity
; k
+= 1)
2655 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2657 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2658 error (_("too many subscripts (%d expected)"), k
);
2660 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2662 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2663 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2665 /* The element is a typedef to an unconstrained array,
2666 except that the value_subscript call stripped the
2667 typedef layer. The typedef layer is GNAT's way to
2668 specify that the element is, at the source level, an
2669 access to the unconstrained array, rather than the
2670 unconstrained array. So, we need to restore that
2671 typedef layer, which we can do by forcing the element's
2672 type back to its original type. Otherwise, the returned
2673 value is going to be printed as the array, rather
2674 than as an access. Another symptom of the same issue
2675 would be that an expression trying to dereference the
2676 element would also be improperly rejected. */
2677 deprecated_set_value_type (elt
, saved_elt_type
);
2680 elt_type
= ada_check_typedef (value_type (elt
));
2686 /* Assuming ARR is a pointer to a GDB array, the value of the element
2687 of *ARR at the ARITY indices given in IND.
2688 Does not read the entire array into memory.
2690 Note: Unlike what one would expect, this function is used instead of
2691 ada_value_subscript for basically all non-packed array types. The reason
2692 for this is that a side effect of doing our own pointer arithmetics instead
2693 of relying on value_subscript is that there is no implicit typedef peeling.
2694 This is important for arrays of array accesses, where it allows us to
2695 preserve the fact that the array's element is an array access, where the
2696 access part os encoded in a typedef layer. */
2698 static struct value
*
2699 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2702 struct value
*array_ind
= ada_value_ind (arr
);
2704 = check_typedef (value_enclosing_type (array_ind
));
2706 if (type
->code () == TYPE_CODE_ARRAY
2707 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2708 return value_subscript_packed (array_ind
, arity
, ind
);
2710 for (k
= 0; k
< arity
; k
+= 1)
2714 if (type
->code () != TYPE_CODE_ARRAY
)
2715 error (_("too many subscripts (%d expected)"), k
);
2716 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2718 get_discrete_bounds (type
->index_type (), &lwb
, &upb
);
2719 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2720 type
= TYPE_TARGET_TYPE (type
);
2723 return value_ind (arr
);
2726 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2727 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2728 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2729 this array is LOW, as per Ada rules. */
2730 static struct value
*
2731 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2734 struct type
*type0
= ada_check_typedef (type
);
2735 struct type
*base_index_type
= TYPE_TARGET_TYPE (type0
->index_type ());
2736 struct type
*index_type
2737 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2738 struct type
*slice_type
= create_array_type_with_stride
2739 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2740 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2741 TYPE_FIELD_BITSIZE (type0
, 0));
2742 int base_low
= ada_discrete_type_low_bound (type0
->index_type ());
2743 gdb::optional
<LONGEST
> base_low_pos
, low_pos
;
2746 low_pos
= discrete_position (base_index_type
, low
);
2747 base_low_pos
= discrete_position (base_index_type
, base_low
);
2749 if (!low_pos
.has_value () || !base_low_pos
.has_value ())
2751 warning (_("unable to get positions in slice, use bounds instead"));
2753 base_low_pos
= base_low
;
2756 ULONGEST stride
= TYPE_FIELD_BITSIZE (slice_type
, 0) / 8;
2758 stride
= TYPE_LENGTH (TYPE_TARGET_TYPE (type0
));
2760 base
= value_as_address (array_ptr
) + (*low_pos
- *base_low_pos
) * stride
;
2761 return value_at_lazy (slice_type
, base
);
2765 static struct value
*
2766 ada_value_slice (struct value
*array
, int low
, int high
)
2768 struct type
*type
= ada_check_typedef (value_type (array
));
2769 struct type
*base_index_type
= TYPE_TARGET_TYPE (type
->index_type ());
2770 struct type
*index_type
2771 = create_static_range_type (NULL
, type
->index_type (), low
, high
);
2772 struct type
*slice_type
= create_array_type_with_stride
2773 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2774 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2775 TYPE_FIELD_BITSIZE (type
, 0));
2776 gdb::optional
<LONGEST
> low_pos
, high_pos
;
2779 low_pos
= discrete_position (base_index_type
, low
);
2780 high_pos
= discrete_position (base_index_type
, high
);
2782 if (!low_pos
.has_value () || !high_pos
.has_value ())
2784 warning (_("unable to get positions in slice, use bounds instead"));
2789 return value_cast (slice_type
,
2790 value_slice (array
, low
, *high_pos
- *low_pos
+ 1));
2793 /* If type is a record type in the form of a standard GNAT array
2794 descriptor, returns the number of dimensions for type. If arr is a
2795 simple array, returns the number of "array of"s that prefix its
2796 type designation. Otherwise, returns 0. */
2799 ada_array_arity (struct type
*type
)
2806 type
= desc_base_type (type
);
2809 if (type
->code () == TYPE_CODE_STRUCT
)
2810 return desc_arity (desc_bounds_type (type
));
2812 while (type
->code () == TYPE_CODE_ARRAY
)
2815 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2821 /* If TYPE is a record type in the form of a standard GNAT array
2822 descriptor or a simple array type, returns the element type for
2823 TYPE after indexing by NINDICES indices, or by all indices if
2824 NINDICES is -1. Otherwise, returns NULL. */
2827 ada_array_element_type (struct type
*type
, int nindices
)
2829 type
= desc_base_type (type
);
2831 if (type
->code () == TYPE_CODE_STRUCT
)
2834 struct type
*p_array_type
;
2836 p_array_type
= desc_data_target_type (type
);
2838 k
= ada_array_arity (type
);
2842 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2843 if (nindices
>= 0 && k
> nindices
)
2845 while (k
> 0 && p_array_type
!= NULL
)
2847 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2850 return p_array_type
;
2852 else if (type
->code () == TYPE_CODE_ARRAY
)
2854 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2856 type
= TYPE_TARGET_TYPE (type
);
2865 /* See ada-lang.h. */
2868 ada_index_type (struct type
*type
, int n
, const char *name
)
2870 struct type
*result_type
;
2872 type
= desc_base_type (type
);
2874 if (n
< 0 || n
> ada_array_arity (type
))
2875 error (_("invalid dimension number to '%s"), name
);
2877 if (ada_is_simple_array_type (type
))
2881 for (i
= 1; i
< n
; i
+= 1)
2882 type
= TYPE_TARGET_TYPE (type
);
2883 result_type
= TYPE_TARGET_TYPE (type
->index_type ());
2884 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2885 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2886 perhaps stabsread.c would make more sense. */
2887 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2892 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2893 if (result_type
== NULL
)
2894 error (_("attempt to take bound of something that is not an array"));
2900 /* Given that arr is an array type, returns the lower bound of the
2901 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2902 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2903 array-descriptor type. It works for other arrays with bounds supplied
2904 by run-time quantities other than discriminants. */
2907 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2909 struct type
*type
, *index_type_desc
, *index_type
;
2912 gdb_assert (which
== 0 || which
== 1);
2914 if (ada_is_constrained_packed_array_type (arr_type
))
2915 arr_type
= decode_constrained_packed_array_type (arr_type
);
2917 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2918 return (LONGEST
) - which
;
2920 if (arr_type
->code () == TYPE_CODE_PTR
)
2921 type
= TYPE_TARGET_TYPE (arr_type
);
2925 if (type
->is_fixed_instance ())
2927 /* The array has already been fixed, so we do not need to
2928 check the parallel ___XA type again. That encoding has
2929 already been applied, so ignore it now. */
2930 index_type_desc
= NULL
;
2934 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2935 ada_fixup_array_indexes_type (index_type_desc
);
2938 if (index_type_desc
!= NULL
)
2939 index_type
= to_fixed_range_type (index_type_desc
->field (n
- 1).type (),
2943 struct type
*elt_type
= check_typedef (type
);
2945 for (i
= 1; i
< n
; i
++)
2946 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
2948 index_type
= elt_type
->index_type ();
2952 (LONGEST
) (which
== 0
2953 ? ada_discrete_type_low_bound (index_type
)
2954 : ada_discrete_type_high_bound (index_type
));
2957 /* Given that arr is an array value, returns the lower bound of the
2958 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2959 WHICH is 1. This routine will also work for arrays with bounds
2960 supplied by run-time quantities other than discriminants. */
2963 ada_array_bound (struct value
*arr
, int n
, int which
)
2965 struct type
*arr_type
;
2967 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2968 arr
= value_ind (arr
);
2969 arr_type
= value_enclosing_type (arr
);
2971 if (ada_is_constrained_packed_array_type (arr_type
))
2972 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2973 else if (ada_is_simple_array_type (arr_type
))
2974 return ada_array_bound_from_type (arr_type
, n
, which
);
2976 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2979 /* Given that arr is an array value, returns the length of the
2980 nth index. This routine will also work for arrays with bounds
2981 supplied by run-time quantities other than discriminants.
2982 Does not work for arrays indexed by enumeration types with representation
2983 clauses at the moment. */
2986 ada_array_length (struct value
*arr
, int n
)
2988 struct type
*arr_type
, *index_type
;
2991 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2992 arr
= value_ind (arr
);
2993 arr_type
= value_enclosing_type (arr
);
2995 if (ada_is_constrained_packed_array_type (arr_type
))
2996 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2998 if (ada_is_simple_array_type (arr_type
))
3000 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3001 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3005 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3006 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3009 arr_type
= check_typedef (arr_type
);
3010 index_type
= ada_index_type (arr_type
, n
, "length");
3011 if (index_type
!= NULL
)
3013 struct type
*base_type
;
3014 if (index_type
->code () == TYPE_CODE_RANGE
)
3015 base_type
= TYPE_TARGET_TYPE (index_type
);
3017 base_type
= index_type
;
3019 low
= pos_atr (value_from_longest (base_type
, low
));
3020 high
= pos_atr (value_from_longest (base_type
, high
));
3022 return high
- low
+ 1;
3025 /* An array whose type is that of ARR_TYPE (an array type), with
3026 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3027 less than LOW, then LOW-1 is used. */
3029 static struct value
*
3030 empty_array (struct type
*arr_type
, int low
, int high
)
3032 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3033 struct type
*index_type
3034 = create_static_range_type
3035 (NULL
, TYPE_TARGET_TYPE (arr_type0
->index_type ()), low
,
3036 high
< low
? low
- 1 : high
);
3037 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3039 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3043 /* Name resolution */
3045 /* The "decoded" name for the user-definable Ada operator corresponding
3049 ada_decoded_op_name (enum exp_opcode op
)
3053 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3055 if (ada_opname_table
[i
].op
== op
)
3056 return ada_opname_table
[i
].decoded
;
3058 error (_("Could not find operator name for opcode"));
3061 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3062 in a listing of choices during disambiguation (see sort_choices, below).
3063 The idea is that overloadings of a subprogram name from the
3064 same package should sort in their source order. We settle for ordering
3065 such symbols by their trailing number (__N or $N). */
3068 encoded_ordered_before (const char *N0
, const char *N1
)
3072 else if (N0
== NULL
)
3078 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3080 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3082 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3083 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3088 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3091 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3093 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3094 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3096 return (strcmp (N0
, N1
) < 0);
3100 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3104 sort_choices (struct block_symbol syms
[], int nsyms
)
3108 for (i
= 1; i
< nsyms
; i
+= 1)
3110 struct block_symbol sym
= syms
[i
];
3113 for (j
= i
- 1; j
>= 0; j
-= 1)
3115 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3116 sym
.symbol
->linkage_name ()))
3118 syms
[j
+ 1] = syms
[j
];
3124 /* Whether GDB should display formals and return types for functions in the
3125 overloads selection menu. */
3126 static bool print_signatures
= true;
3128 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3129 all but functions, the signature is just the name of the symbol. For
3130 functions, this is the name of the function, the list of types for formals
3131 and the return type (if any). */
3134 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3135 const struct type_print_options
*flags
)
3137 struct type
*type
= SYMBOL_TYPE (sym
);
3139 fprintf_filtered (stream
, "%s", sym
->print_name ());
3140 if (!print_signatures
3142 || type
->code () != TYPE_CODE_FUNC
)
3145 if (type
->num_fields () > 0)
3149 fprintf_filtered (stream
, " (");
3150 for (i
= 0; i
< type
->num_fields (); ++i
)
3153 fprintf_filtered (stream
, "; ");
3154 ada_print_type (type
->field (i
).type (), NULL
, stream
, -1, 0,
3157 fprintf_filtered (stream
, ")");
3159 if (TYPE_TARGET_TYPE (type
) != NULL
3160 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3162 fprintf_filtered (stream
, " return ");
3163 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3167 /* Read and validate a set of numeric choices from the user in the
3168 range 0 .. N_CHOICES-1. Place the results in increasing
3169 order in CHOICES[0 .. N-1], and return N.
3171 The user types choices as a sequence of numbers on one line
3172 separated by blanks, encoding them as follows:
3174 + A choice of 0 means to cancel the selection, throwing an error.
3175 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3176 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3178 The user is not allowed to choose more than MAX_RESULTS values.
3180 ANNOTATION_SUFFIX, if present, is used to annotate the input
3181 prompts (for use with the -f switch). */
3184 get_selections (int *choices
, int n_choices
, int max_results
,
3185 int is_all_choice
, const char *annotation_suffix
)
3190 int first_choice
= is_all_choice
? 2 : 1;
3192 prompt
= getenv ("PS2");
3196 args
= command_line_input (prompt
, annotation_suffix
);
3199 error_no_arg (_("one or more choice numbers"));
3203 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3204 order, as given in args. Choices are validated. */
3210 args
= skip_spaces (args
);
3211 if (*args
== '\0' && n_chosen
== 0)
3212 error_no_arg (_("one or more choice numbers"));
3213 else if (*args
== '\0')
3216 choice
= strtol (args
, &args2
, 10);
3217 if (args
== args2
|| choice
< 0
3218 || choice
> n_choices
+ first_choice
- 1)
3219 error (_("Argument must be choice number"));
3223 error (_("cancelled"));
3225 if (choice
< first_choice
)
3227 n_chosen
= n_choices
;
3228 for (j
= 0; j
< n_choices
; j
+= 1)
3232 choice
-= first_choice
;
3234 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3238 if (j
< 0 || choice
!= choices
[j
])
3242 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3243 choices
[k
+ 1] = choices
[k
];
3244 choices
[j
+ 1] = choice
;
3249 if (n_chosen
> max_results
)
3250 error (_("Select no more than %d of the above"), max_results
);
3255 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3256 by asking the user (if necessary), returning the number selected,
3257 and setting the first elements of SYMS items. Error if no symbols
3260 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3261 to be re-integrated one of these days. */
3264 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3267 int *chosen
= XALLOCAVEC (int , nsyms
);
3269 int first_choice
= (max_results
== 1) ? 1 : 2;
3270 const char *select_mode
= multiple_symbols_select_mode ();
3272 if (max_results
< 1)
3273 error (_("Request to select 0 symbols!"));
3277 if (select_mode
== multiple_symbols_cancel
)
3279 canceled because the command is ambiguous\n\
3280 See set/show multiple-symbol."));
3282 /* If select_mode is "all", then return all possible symbols.
3283 Only do that if more than one symbol can be selected, of course.
3284 Otherwise, display the menu as usual. */
3285 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3288 printf_filtered (_("[0] cancel\n"));
3289 if (max_results
> 1)
3290 printf_filtered (_("[1] all\n"));
3292 sort_choices (syms
, nsyms
);
3294 for (i
= 0; i
< nsyms
; i
+= 1)
3296 if (syms
[i
].symbol
== NULL
)
3299 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3301 struct symtab_and_line sal
=
3302 find_function_start_sal (syms
[i
].symbol
, 1);
3304 printf_filtered ("[%d] ", i
+ first_choice
);
3305 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3306 &type_print_raw_options
);
3307 if (sal
.symtab
== NULL
)
3308 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3309 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3313 styled_string (file_name_style
.style (),
3314 symtab_to_filename_for_display (sal
.symtab
)),
3321 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3322 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3323 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3324 struct symtab
*symtab
= NULL
;
3326 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3327 symtab
= symbol_symtab (syms
[i
].symbol
);
3329 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3331 printf_filtered ("[%d] ", i
+ first_choice
);
3332 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3333 &type_print_raw_options
);
3334 printf_filtered (_(" at %s:%d\n"),
3335 symtab_to_filename_for_display (symtab
),
3336 SYMBOL_LINE (syms
[i
].symbol
));
3338 else if (is_enumeral
3339 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3341 printf_filtered (("[%d] "), i
+ first_choice
);
3342 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3343 gdb_stdout
, -1, 0, &type_print_raw_options
);
3344 printf_filtered (_("'(%s) (enumeral)\n"),
3345 syms
[i
].symbol
->print_name ());
3349 printf_filtered ("[%d] ", i
+ first_choice
);
3350 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3351 &type_print_raw_options
);
3354 printf_filtered (is_enumeral
3355 ? _(" in %s (enumeral)\n")
3357 symtab_to_filename_for_display (symtab
));
3359 printf_filtered (is_enumeral
3360 ? _(" (enumeral)\n")
3366 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3369 for (i
= 0; i
< n_chosen
; i
+= 1)
3370 syms
[i
] = syms
[chosen
[i
]];
3375 /* See ada-lang.h. */
3378 ada_find_operator_symbol (enum exp_opcode op
, int parse_completion
,
3379 int nargs
, value
*argvec
[])
3381 if (possible_user_operator_p (op
, argvec
))
3383 std::vector
<struct block_symbol
> candidates
3384 = ada_lookup_symbol_list (ada_decoded_op_name (op
),
3387 int i
= ada_resolve_function (candidates
, argvec
,
3388 nargs
, ada_decoded_op_name (op
), NULL
,
3391 return candidates
[i
];
3396 /* See ada-lang.h. */
3399 ada_resolve_funcall (struct symbol
*sym
, const struct block
*block
,
3400 struct type
*context_type
,
3401 int parse_completion
,
3402 int nargs
, value
*argvec
[],
3403 innermost_block_tracker
*tracker
)
3405 std::vector
<struct block_symbol
> candidates
3406 = ada_lookup_symbol_list (sym
->linkage_name (), block
, VAR_DOMAIN
);
3409 if (candidates
.size () == 1)
3413 i
= ada_resolve_function
3416 sym
->linkage_name (),
3417 context_type
, parse_completion
);
3419 error (_("Could not find a match for %s"), sym
->print_name ());
3422 tracker
->update (candidates
[i
]);
3423 return candidates
[i
];
3426 /* See ada-lang.h. */
3429 ada_resolve_variable (struct symbol
*sym
, const struct block
*block
,
3430 struct type
*context_type
,
3431 int parse_completion
,
3433 innermost_block_tracker
*tracker
)
3435 std::vector
<struct block_symbol
> candidates
3436 = ada_lookup_symbol_list (sym
->linkage_name (), block
, VAR_DOMAIN
);
3438 if (std::any_of (candidates
.begin (),
3440 [] (block_symbol
&bsym
)
3442 switch (SYMBOL_CLASS (bsym
.symbol
))
3447 case LOC_REGPARM_ADDR
:
3456 /* Types tend to get re-introduced locally, so if there
3457 are any local symbols that are not types, first filter
3461 (candidates
.begin (),
3463 [] (block_symbol
&bsym
)
3465 return SYMBOL_CLASS (bsym
.symbol
) == LOC_TYPEDEF
;
3471 if (candidates
.empty ())
3472 error (_("No definition found for %s"), sym
->print_name ());
3473 else if (candidates
.size () == 1)
3475 else if (deprocedure_p
&& !is_nonfunction (candidates
))
3477 i
= ada_resolve_function
3478 (candidates
, NULL
, 0,
3479 sym
->linkage_name (),
3480 context_type
, parse_completion
);
3482 error (_("Could not find a match for %s"), sym
->print_name ());
3486 printf_filtered (_("Multiple matches for %s\n"), sym
->print_name ());
3487 user_select_syms (candidates
.data (), candidates
.size (), 1);
3491 tracker
->update (candidates
[i
]);
3492 return candidates
[i
];
3495 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3496 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3498 /* The term "match" here is rather loose. The match is heuristic and
3502 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3504 ftype
= ada_check_typedef (ftype
);
3505 atype
= ada_check_typedef (atype
);
3507 if (ftype
->code () == TYPE_CODE_REF
)
3508 ftype
= TYPE_TARGET_TYPE (ftype
);
3509 if (atype
->code () == TYPE_CODE_REF
)
3510 atype
= TYPE_TARGET_TYPE (atype
);
3512 switch (ftype
->code ())
3515 return ftype
->code () == atype
->code ();
3517 if (atype
->code () == TYPE_CODE_PTR
)
3518 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3519 TYPE_TARGET_TYPE (atype
), 0);
3522 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3524 case TYPE_CODE_ENUM
:
3525 case TYPE_CODE_RANGE
:
3526 switch (atype
->code ())
3529 case TYPE_CODE_ENUM
:
3530 case TYPE_CODE_RANGE
:
3536 case TYPE_CODE_ARRAY
:
3537 return (atype
->code () == TYPE_CODE_ARRAY
3538 || ada_is_array_descriptor_type (atype
));
3540 case TYPE_CODE_STRUCT
:
3541 if (ada_is_array_descriptor_type (ftype
))
3542 return (atype
->code () == TYPE_CODE_ARRAY
3543 || ada_is_array_descriptor_type (atype
));
3545 return (atype
->code () == TYPE_CODE_STRUCT
3546 && !ada_is_array_descriptor_type (atype
));
3548 case TYPE_CODE_UNION
:
3550 return (atype
->code () == ftype
->code ());
3554 /* Return non-zero if the formals of FUNC "sufficiently match" the
3555 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3556 may also be an enumeral, in which case it is treated as a 0-
3557 argument function. */
3560 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3563 struct type
*func_type
= SYMBOL_TYPE (func
);
3565 if (SYMBOL_CLASS (func
) == LOC_CONST
3566 && func_type
->code () == TYPE_CODE_ENUM
)
3567 return (n_actuals
== 0);
3568 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3571 if (func_type
->num_fields () != n_actuals
)
3574 for (i
= 0; i
< n_actuals
; i
+= 1)
3576 if (actuals
[i
] == NULL
)
3580 struct type
*ftype
= ada_check_typedef (func_type
->field (i
).type ());
3581 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3583 if (!ada_type_match (ftype
, atype
, 1))
3590 /* False iff function type FUNC_TYPE definitely does not produce a value
3591 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3592 FUNC_TYPE is not a valid function type with a non-null return type
3593 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3596 return_match (struct type
*func_type
, struct type
*context_type
)
3598 struct type
*return_type
;
3600 if (func_type
== NULL
)
3603 if (func_type
->code () == TYPE_CODE_FUNC
)
3604 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3606 return_type
= get_base_type (func_type
);
3607 if (return_type
== NULL
)
3610 context_type
= get_base_type (context_type
);
3612 if (return_type
->code () == TYPE_CODE_ENUM
)
3613 return context_type
== NULL
|| return_type
== context_type
;
3614 else if (context_type
== NULL
)
3615 return return_type
->code () != TYPE_CODE_VOID
;
3617 return return_type
->code () == context_type
->code ();
3621 /* Returns the index in SYMS that contains the symbol for the
3622 function (if any) that matches the types of the NARGS arguments in
3623 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3624 that returns that type, then eliminate matches that don't. If
3625 CONTEXT_TYPE is void and there is at least one match that does not
3626 return void, eliminate all matches that do.
3628 Asks the user if there is more than one match remaining. Returns -1
3629 if there is no such symbol or none is selected. NAME is used
3630 solely for messages. May re-arrange and modify SYMS in
3631 the process; the index returned is for the modified vector. */
3634 ada_resolve_function (std::vector
<struct block_symbol
> &syms
,
3635 struct value
**args
, int nargs
,
3636 const char *name
, struct type
*context_type
,
3637 int parse_completion
)
3641 int m
; /* Number of hits */
3644 /* In the first pass of the loop, we only accept functions matching
3645 context_type. If none are found, we add a second pass of the loop
3646 where every function is accepted. */
3647 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3649 for (k
= 0; k
< syms
.size (); k
+= 1)
3651 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3653 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3654 && (fallback
|| return_match (type
, context_type
)))
3662 /* If we got multiple matches, ask the user which one to use. Don't do this
3663 interactive thing during completion, though, as the purpose of the
3664 completion is providing a list of all possible matches. Prompting the
3665 user to filter it down would be completely unexpected in this case. */
3668 else if (m
> 1 && !parse_completion
)
3670 printf_filtered (_("Multiple matches for %s\n"), name
);
3671 user_select_syms (syms
.data (), m
, 1);
3677 /* Type-class predicates */
3679 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3683 numeric_type_p (struct type
*type
)
3689 switch (type
->code ())
3694 case TYPE_CODE_RANGE
:
3695 return (type
== TYPE_TARGET_TYPE (type
)
3696 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3703 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3706 integer_type_p (struct type
*type
)
3712 switch (type
->code ())
3716 case TYPE_CODE_RANGE
:
3717 return (type
== TYPE_TARGET_TYPE (type
)
3718 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3725 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3728 scalar_type_p (struct type
*type
)
3734 switch (type
->code ())
3737 case TYPE_CODE_RANGE
:
3738 case TYPE_CODE_ENUM
:
3747 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3750 discrete_type_p (struct type
*type
)
3756 switch (type
->code ())
3759 case TYPE_CODE_RANGE
:
3760 case TYPE_CODE_ENUM
:
3761 case TYPE_CODE_BOOL
:
3769 /* Returns non-zero if OP with operands in the vector ARGS could be
3770 a user-defined function. Errs on the side of pre-defined operators
3771 (i.e., result 0). */
3774 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3776 struct type
*type0
=
3777 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3778 struct type
*type1
=
3779 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3793 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3797 case BINOP_BITWISE_AND
:
3798 case BINOP_BITWISE_IOR
:
3799 case BINOP_BITWISE_XOR
:
3800 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3803 case BINOP_NOTEQUAL
:
3808 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3811 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3814 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3818 case UNOP_LOGICAL_NOT
:
3820 return (!numeric_type_p (type0
));
3829 1. In the following, we assume that a renaming type's name may
3830 have an ___XD suffix. It would be nice if this went away at some
3832 2. We handle both the (old) purely type-based representation of
3833 renamings and the (new) variable-based encoding. At some point,
3834 it is devoutly to be hoped that the former goes away
3835 (FIXME: hilfinger-2007-07-09).
3836 3. Subprogram renamings are not implemented, although the XRS
3837 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3839 /* If SYM encodes a renaming,
3841 <renaming> renames <renamed entity>,
3843 sets *LEN to the length of the renamed entity's name,
3844 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3845 the string describing the subcomponent selected from the renamed
3846 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3847 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3848 are undefined). Otherwise, returns a value indicating the category
3849 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3850 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3851 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3852 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3853 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3854 may be NULL, in which case they are not assigned.
3856 [Currently, however, GCC does not generate subprogram renamings.] */
3858 enum ada_renaming_category
3859 ada_parse_renaming (struct symbol
*sym
,
3860 const char **renamed_entity
, int *len
,
3861 const char **renaming_expr
)
3863 enum ada_renaming_category kind
;
3868 return ADA_NOT_RENAMING
;
3869 switch (SYMBOL_CLASS (sym
))
3872 return ADA_NOT_RENAMING
;
3876 case LOC_OPTIMIZED_OUT
:
3877 info
= strstr (sym
->linkage_name (), "___XR");
3879 return ADA_NOT_RENAMING
;
3883 kind
= ADA_OBJECT_RENAMING
;
3887 kind
= ADA_EXCEPTION_RENAMING
;
3891 kind
= ADA_PACKAGE_RENAMING
;
3895 kind
= ADA_SUBPROGRAM_RENAMING
;
3899 return ADA_NOT_RENAMING
;
3903 if (renamed_entity
!= NULL
)
3904 *renamed_entity
= info
;
3905 suffix
= strstr (info
, "___XE");
3906 if (suffix
== NULL
|| suffix
== info
)
3907 return ADA_NOT_RENAMING
;
3909 *len
= strlen (info
) - strlen (suffix
);
3911 if (renaming_expr
!= NULL
)
3912 *renaming_expr
= suffix
;
3916 /* Compute the value of the given RENAMING_SYM, which is expected to
3917 be a symbol encoding a renaming expression. BLOCK is the block
3918 used to evaluate the renaming. */
3920 static struct value
*
3921 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
3922 const struct block
*block
)
3924 const char *sym_name
;
3926 sym_name
= renaming_sym
->linkage_name ();
3927 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
3928 return evaluate_expression (expr
.get ());
3932 /* Evaluation: Function Calls */
3934 /* Return an lvalue containing the value VAL. This is the identity on
3935 lvalues, and otherwise has the side-effect of allocating memory
3936 in the inferior where a copy of the value contents is copied. */
3938 static struct value
*
3939 ensure_lval (struct value
*val
)
3941 if (VALUE_LVAL (val
) == not_lval
3942 || VALUE_LVAL (val
) == lval_internalvar
)
3944 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3945 const CORE_ADDR addr
=
3946 value_as_long (value_allocate_space_in_inferior (len
));
3948 VALUE_LVAL (val
) = lval_memory
;
3949 set_value_address (val
, addr
);
3950 write_memory (addr
, value_contents (val
), len
);
3956 /* Given ARG, a value of type (pointer or reference to a)*
3957 structure/union, extract the component named NAME from the ultimate
3958 target structure/union and return it as a value with its
3961 The routine searches for NAME among all members of the structure itself
3962 and (recursively) among all members of any wrapper members
3965 If NO_ERR, then simply return NULL in case of error, rather than
3968 static struct value
*
3969 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
3971 struct type
*t
, *t1
;
3976 t1
= t
= ada_check_typedef (value_type (arg
));
3977 if (t
->code () == TYPE_CODE_REF
)
3979 t1
= TYPE_TARGET_TYPE (t
);
3982 t1
= ada_check_typedef (t1
);
3983 if (t1
->code () == TYPE_CODE_PTR
)
3985 arg
= coerce_ref (arg
);
3990 while (t
->code () == TYPE_CODE_PTR
)
3992 t1
= TYPE_TARGET_TYPE (t
);
3995 t1
= ada_check_typedef (t1
);
3996 if (t1
->code () == TYPE_CODE_PTR
)
3998 arg
= value_ind (arg
);
4005 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4009 v
= ada_search_struct_field (name
, arg
, 0, t
);
4012 int bit_offset
, bit_size
, byte_offset
;
4013 struct type
*field_type
;
4016 if (t
->code () == TYPE_CODE_PTR
)
4017 address
= value_address (ada_value_ind (arg
));
4019 address
= value_address (ada_coerce_ref (arg
));
4021 /* Check to see if this is a tagged type. We also need to handle
4022 the case where the type is a reference to a tagged type, but
4023 we have to be careful to exclude pointers to tagged types.
4024 The latter should be shown as usual (as a pointer), whereas
4025 a reference should mostly be transparent to the user. */
4027 if (ada_is_tagged_type (t1
, 0)
4028 || (t1
->code () == TYPE_CODE_REF
4029 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4031 /* We first try to find the searched field in the current type.
4032 If not found then let's look in the fixed type. */
4034 if (!find_struct_field (name
, t1
, 0,
4035 &field_type
, &byte_offset
, &bit_offset
,
4044 /* Convert to fixed type in all cases, so that we have proper
4045 offsets to each field in unconstrained record types. */
4046 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4047 address
, NULL
, check_tag
);
4049 /* Resolve the dynamic type as well. */
4050 arg
= value_from_contents_and_address (t1
, nullptr, address
);
4051 t1
= value_type (arg
);
4053 if (find_struct_field (name
, t1
, 0,
4054 &field_type
, &byte_offset
, &bit_offset
,
4059 if (t
->code () == TYPE_CODE_REF
)
4060 arg
= ada_coerce_ref (arg
);
4062 arg
= ada_value_ind (arg
);
4063 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4064 bit_offset
, bit_size
,
4068 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4072 if (v
!= NULL
|| no_err
)
4075 error (_("There is no member named %s."), name
);
4081 error (_("Attempt to extract a component of "
4082 "a value that is not a record."));
4085 /* Return the value ACTUAL, converted to be an appropriate value for a
4086 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4087 allocating any necessary descriptors (fat pointers), or copies of
4088 values not residing in memory, updating it as needed. */
4091 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4093 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4094 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4095 struct type
*formal_target
=
4096 formal_type
->code () == TYPE_CODE_PTR
4097 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4098 struct type
*actual_target
=
4099 actual_type
->code () == TYPE_CODE_PTR
4100 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4102 if (ada_is_array_descriptor_type (formal_target
)
4103 && actual_target
->code () == TYPE_CODE_ARRAY
)
4104 return make_array_descriptor (formal_type
, actual
);
4105 else if (formal_type
->code () == TYPE_CODE_PTR
4106 || formal_type
->code () == TYPE_CODE_REF
)
4108 struct value
*result
;
4110 if (formal_target
->code () == TYPE_CODE_ARRAY
4111 && ada_is_array_descriptor_type (actual_target
))
4112 result
= desc_data (actual
);
4113 else if (formal_type
->code () != TYPE_CODE_PTR
)
4115 if (VALUE_LVAL (actual
) != lval_memory
)
4119 actual_type
= ada_check_typedef (value_type (actual
));
4120 val
= allocate_value (actual_type
);
4121 memcpy ((char *) value_contents_raw (val
),
4122 (char *) value_contents (actual
),
4123 TYPE_LENGTH (actual_type
));
4124 actual
= ensure_lval (val
);
4126 result
= value_addr (actual
);
4130 return value_cast_pointers (formal_type
, result
, 0);
4132 else if (actual_type
->code () == TYPE_CODE_PTR
)
4133 return ada_value_ind (actual
);
4134 else if (ada_is_aligner_type (formal_type
))
4136 /* We need to turn this parameter into an aligner type
4138 struct value
*aligner
= allocate_value (formal_type
);
4139 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4141 value_assign_to_component (aligner
, component
, actual
);
4148 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4149 type TYPE. This is usually an inefficient no-op except on some targets
4150 (such as AVR) where the representation of a pointer and an address
4154 value_pointer (struct value
*value
, struct type
*type
)
4156 unsigned len
= TYPE_LENGTH (type
);
4157 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4160 addr
= value_address (value
);
4161 gdbarch_address_to_pointer (type
->arch (), type
, buf
, addr
);
4162 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4167 /* Push a descriptor of type TYPE for array value ARR on the stack at
4168 *SP, updating *SP to reflect the new descriptor. Return either
4169 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4170 to-descriptor type rather than a descriptor type), a struct value *
4171 representing a pointer to this descriptor. */
4173 static struct value
*
4174 make_array_descriptor (struct type
*type
, struct value
*arr
)
4176 struct type
*bounds_type
= desc_bounds_type (type
);
4177 struct type
*desc_type
= desc_base_type (type
);
4178 struct value
*descriptor
= allocate_value (desc_type
);
4179 struct value
*bounds
= allocate_value (bounds_type
);
4182 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4185 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4186 ada_array_bound (arr
, i
, 0),
4187 desc_bound_bitpos (bounds_type
, i
, 0),
4188 desc_bound_bitsize (bounds_type
, i
, 0));
4189 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4190 ada_array_bound (arr
, i
, 1),
4191 desc_bound_bitpos (bounds_type
, i
, 1),
4192 desc_bound_bitsize (bounds_type
, i
, 1));
4195 bounds
= ensure_lval (bounds
);
4197 modify_field (value_type (descriptor
),
4198 value_contents_writeable (descriptor
),
4199 value_pointer (ensure_lval (arr
),
4200 desc_type
->field (0).type ()),
4201 fat_pntr_data_bitpos (desc_type
),
4202 fat_pntr_data_bitsize (desc_type
));
4204 modify_field (value_type (descriptor
),
4205 value_contents_writeable (descriptor
),
4206 value_pointer (bounds
,
4207 desc_type
->field (1).type ()),
4208 fat_pntr_bounds_bitpos (desc_type
),
4209 fat_pntr_bounds_bitsize (desc_type
));
4211 descriptor
= ensure_lval (descriptor
);
4213 if (type
->code () == TYPE_CODE_PTR
)
4214 return value_addr (descriptor
);
4219 /* Symbol Cache Module */
4221 /* Performance measurements made as of 2010-01-15 indicate that
4222 this cache does bring some noticeable improvements. Depending
4223 on the type of entity being printed, the cache can make it as much
4224 as an order of magnitude faster than without it.
4226 The descriptive type DWARF extension has significantly reduced
4227 the need for this cache, at least when DWARF is being used. However,
4228 even in this case, some expensive name-based symbol searches are still
4229 sometimes necessary - to find an XVZ variable, mostly. */
4231 /* Return the symbol cache associated to the given program space PSPACE.
4232 If not allocated for this PSPACE yet, allocate and initialize one. */
4234 static struct ada_symbol_cache
*
4235 ada_get_symbol_cache (struct program_space
*pspace
)
4237 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4239 if (pspace_data
->sym_cache
== nullptr)
4240 pspace_data
->sym_cache
.reset (new ada_symbol_cache
);
4242 return pspace_data
->sym_cache
.get ();
4245 /* Clear all entries from the symbol cache. */
4248 ada_clear_symbol_cache ()
4250 struct ada_pspace_data
*pspace_data
4251 = get_ada_pspace_data (current_program_space
);
4253 if (pspace_data
->sym_cache
!= nullptr)
4254 pspace_data
->sym_cache
.reset ();
4257 /* Search our cache for an entry matching NAME and DOMAIN.
4258 Return it if found, or NULL otherwise. */
4260 static struct cache_entry
**
4261 find_entry (const char *name
, domain_enum domain
)
4263 struct ada_symbol_cache
*sym_cache
4264 = ada_get_symbol_cache (current_program_space
);
4265 int h
= msymbol_hash (name
) % HASH_SIZE
;
4266 struct cache_entry
**e
;
4268 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4270 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4276 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4277 Return 1 if found, 0 otherwise.
4279 If an entry was found and SYM is not NULL, set *SYM to the entry's
4280 SYM. Same principle for BLOCK if not NULL. */
4283 lookup_cached_symbol (const char *name
, domain_enum domain
,
4284 struct symbol
**sym
, const struct block
**block
)
4286 struct cache_entry
**e
= find_entry (name
, domain
);
4293 *block
= (*e
)->block
;
4297 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4298 in domain DOMAIN, save this result in our symbol cache. */
4301 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4302 const struct block
*block
)
4304 struct ada_symbol_cache
*sym_cache
4305 = ada_get_symbol_cache (current_program_space
);
4307 struct cache_entry
*e
;
4309 /* Symbols for builtin types don't have a block.
4310 For now don't cache such symbols. */
4311 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4314 /* If the symbol is a local symbol, then do not cache it, as a search
4315 for that symbol depends on the context. To determine whether
4316 the symbol is local or not, we check the block where we found it
4317 against the global and static blocks of its associated symtab. */
4319 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4320 GLOBAL_BLOCK
) != block
4321 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4322 STATIC_BLOCK
) != block
)
4325 h
= msymbol_hash (name
) % HASH_SIZE
;
4326 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4327 e
->next
= sym_cache
->root
[h
];
4328 sym_cache
->root
[h
] = e
;
4329 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4337 /* Return the symbol name match type that should be used used when
4338 searching for all symbols matching LOOKUP_NAME.
4340 LOOKUP_NAME is expected to be a symbol name after transformation
4343 static symbol_name_match_type
4344 name_match_type_from_name (const char *lookup_name
)
4346 return (strstr (lookup_name
, "__") == NULL
4347 ? symbol_name_match_type::WILD
4348 : symbol_name_match_type::FULL
);
4351 /* Return the result of a standard (literal, C-like) lookup of NAME in
4352 given DOMAIN, visible from lexical block BLOCK. */
4354 static struct symbol
*
4355 standard_lookup (const char *name
, const struct block
*block
,
4358 /* Initialize it just to avoid a GCC false warning. */
4359 struct block_symbol sym
= {};
4361 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4363 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4364 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4369 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4370 in the symbol fields of SYMS. We treat enumerals as functions,
4371 since they contend in overloading in the same way. */
4373 is_nonfunction (const std::vector
<struct block_symbol
> &syms
)
4375 for (const block_symbol
&sym
: syms
)
4376 if (SYMBOL_TYPE (sym
.symbol
)->code () != TYPE_CODE_FUNC
4377 && (SYMBOL_TYPE (sym
.symbol
)->code () != TYPE_CODE_ENUM
4378 || SYMBOL_CLASS (sym
.symbol
) != LOC_CONST
))
4384 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4385 struct types. Otherwise, they may not. */
4388 equiv_types (struct type
*type0
, struct type
*type1
)
4392 if (type0
== NULL
|| type1
== NULL
4393 || type0
->code () != type1
->code ())
4395 if ((type0
->code () == TYPE_CODE_STRUCT
4396 || type0
->code () == TYPE_CODE_ENUM
)
4397 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4398 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4404 /* True iff SYM0 represents the same entity as SYM1, or one that is
4405 no more defined than that of SYM1. */
4408 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4412 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4413 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4416 switch (SYMBOL_CLASS (sym0
))
4422 struct type
*type0
= SYMBOL_TYPE (sym0
);
4423 struct type
*type1
= SYMBOL_TYPE (sym1
);
4424 const char *name0
= sym0
->linkage_name ();
4425 const char *name1
= sym1
->linkage_name ();
4426 int len0
= strlen (name0
);
4429 type0
->code () == type1
->code ()
4430 && (equiv_types (type0
, type1
)
4431 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4432 && startswith (name1
+ len0
, "___XV")));
4435 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4436 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4440 const char *name0
= sym0
->linkage_name ();
4441 const char *name1
= sym1
->linkage_name ();
4442 return (strcmp (name0
, name1
) == 0
4443 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4451 /* Append (SYM,BLOCK) to the end of the array of struct block_symbol
4452 records in RESULT. Do nothing if SYM is a duplicate. */
4455 add_defn_to_vec (std::vector
<struct block_symbol
> &result
,
4457 const struct block
*block
)
4459 /* Do not try to complete stub types, as the debugger is probably
4460 already scanning all symbols matching a certain name at the
4461 time when this function is called. Trying to replace the stub
4462 type by its associated full type will cause us to restart a scan
4463 which may lead to an infinite recursion. Instead, the client
4464 collecting the matching symbols will end up collecting several
4465 matches, with at least one of them complete. It can then filter
4466 out the stub ones if needed. */
4468 for (int i
= result
.size () - 1; i
>= 0; i
-= 1)
4470 if (lesseq_defined_than (sym
, result
[i
].symbol
))
4472 else if (lesseq_defined_than (result
[i
].symbol
, sym
))
4474 result
[i
].symbol
= sym
;
4475 result
[i
].block
= block
;
4480 struct block_symbol info
;
4483 result
.push_back (info
);
4486 /* Return a bound minimal symbol matching NAME according to Ada
4487 decoding rules. Returns an invalid symbol if there is no such
4488 minimal symbol. Names prefixed with "standard__" are handled
4489 specially: "standard__" is first stripped off, and only static and
4490 global symbols are searched. */
4492 struct bound_minimal_symbol
4493 ada_lookup_simple_minsym (const char *name
)
4495 struct bound_minimal_symbol result
;
4497 memset (&result
, 0, sizeof (result
));
4499 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4500 lookup_name_info
lookup_name (name
, match_type
);
4502 symbol_name_matcher_ftype
*match_name
4503 = ada_get_symbol_name_matcher (lookup_name
);
4505 for (objfile
*objfile
: current_program_space
->objfiles ())
4507 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4509 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4510 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4512 result
.minsym
= msymbol
;
4513 result
.objfile
= objfile
;
4522 /* For all subprograms that statically enclose the subprogram of the
4523 selected frame, add symbols matching identifier NAME in DOMAIN
4524 and their blocks to the list of data in RESULT, as for
4525 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4526 with a wildcard prefix. */
4529 add_symbols_from_enclosing_procs (std::vector
<struct block_symbol
> &result
,
4530 const lookup_name_info
&lookup_name
,
4535 /* True if TYPE is definitely an artificial type supplied to a symbol
4536 for which no debugging information was given in the symbol file. */
4539 is_nondebugging_type (struct type
*type
)
4541 const char *name
= ada_type_name (type
);
4543 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4546 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4547 that are deemed "identical" for practical purposes.
4549 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4550 types and that their number of enumerals is identical (in other
4551 words, type1->num_fields () == type2->num_fields ()). */
4554 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4558 /* The heuristic we use here is fairly conservative. We consider
4559 that 2 enumerate types are identical if they have the same
4560 number of enumerals and that all enumerals have the same
4561 underlying value and name. */
4563 /* All enums in the type should have an identical underlying value. */
4564 for (i
= 0; i
< type1
->num_fields (); i
++)
4565 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4568 /* All enumerals should also have the same name (modulo any numerical
4570 for (i
= 0; i
< type1
->num_fields (); i
++)
4572 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4573 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4574 int len_1
= strlen (name_1
);
4575 int len_2
= strlen (name_2
);
4577 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4578 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4580 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4581 TYPE_FIELD_NAME (type2
, i
),
4589 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4590 that are deemed "identical" for practical purposes. Sometimes,
4591 enumerals are not strictly identical, but their types are so similar
4592 that they can be considered identical.
4594 For instance, consider the following code:
4596 type Color is (Black, Red, Green, Blue, White);
4597 type RGB_Color is new Color range Red .. Blue;
4599 Type RGB_Color is a subrange of an implicit type which is a copy
4600 of type Color. If we call that implicit type RGB_ColorB ("B" is
4601 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4602 As a result, when an expression references any of the enumeral
4603 by name (Eg. "print green"), the expression is technically
4604 ambiguous and the user should be asked to disambiguate. But
4605 doing so would only hinder the user, since it wouldn't matter
4606 what choice he makes, the outcome would always be the same.
4607 So, for practical purposes, we consider them as the same. */
4610 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
4614 /* Before performing a thorough comparison check of each type,
4615 we perform a series of inexpensive checks. We expect that these
4616 checks will quickly fail in the vast majority of cases, and thus
4617 help prevent the unnecessary use of a more expensive comparison.
4618 Said comparison also expects us to make some of these checks
4619 (see ada_identical_enum_types_p). */
4621 /* Quick check: All symbols should have an enum type. */
4622 for (i
= 0; i
< syms
.size (); i
++)
4623 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
4626 /* Quick check: They should all have the same value. */
4627 for (i
= 1; i
< syms
.size (); i
++)
4628 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
4631 /* Quick check: They should all have the same number of enumerals. */
4632 for (i
= 1; i
< syms
.size (); i
++)
4633 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
4634 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
4637 /* All the sanity checks passed, so we might have a set of
4638 identical enumeration types. Perform a more complete
4639 comparison of the type of each symbol. */
4640 for (i
= 1; i
< syms
.size (); i
++)
4641 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
4642 SYMBOL_TYPE (syms
[0].symbol
)))
4648 /* Remove any non-debugging symbols in SYMS that definitely
4649 duplicate other symbols in the list (The only case I know of where
4650 this happens is when object files containing stabs-in-ecoff are
4651 linked with files containing ordinary ecoff debugging symbols (or no
4652 debugging symbols)). Modifies SYMS to squeeze out deleted entries. */
4655 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
4659 /* We should never be called with less than 2 symbols, as there
4660 cannot be any extra symbol in that case. But it's easy to
4661 handle, since we have nothing to do in that case. */
4662 if (syms
->size () < 2)
4666 while (i
< syms
->size ())
4670 /* If two symbols have the same name and one of them is a stub type,
4671 the get rid of the stub. */
4673 if (SYMBOL_TYPE ((*syms
)[i
].symbol
)->is_stub ()
4674 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
4676 for (j
= 0; j
< syms
->size (); j
++)
4679 && !SYMBOL_TYPE ((*syms
)[j
].symbol
)->is_stub ()
4680 && (*syms
)[j
].symbol
->linkage_name () != NULL
4681 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
4682 (*syms
)[j
].symbol
->linkage_name ()) == 0)
4687 /* Two symbols with the same name, same class and same address
4688 should be identical. */
4690 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
4691 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
4692 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
4694 for (j
= 0; j
< syms
->size (); j
+= 1)
4697 && (*syms
)[j
].symbol
->linkage_name () != NULL
4698 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
4699 (*syms
)[j
].symbol
->linkage_name ()) == 0
4700 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
4701 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
4702 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
4703 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
4709 syms
->erase (syms
->begin () + i
);
4714 /* If all the remaining symbols are identical enumerals, then
4715 just keep the first one and discard the rest.
4717 Unlike what we did previously, we do not discard any entry
4718 unless they are ALL identical. This is because the symbol
4719 comparison is not a strict comparison, but rather a practical
4720 comparison. If all symbols are considered identical, then
4721 we can just go ahead and use the first one and discard the rest.
4722 But if we cannot reduce the list to a single element, we have
4723 to ask the user to disambiguate anyways. And if we have to
4724 present a multiple-choice menu, it's less confusing if the list
4725 isn't missing some choices that were identical and yet distinct. */
4726 if (symbols_are_identical_enums (*syms
))
4730 /* Given a type that corresponds to a renaming entity, use the type name
4731 to extract the scope (package name or function name, fully qualified,
4732 and following the GNAT encoding convention) where this renaming has been
4736 xget_renaming_scope (struct type
*renaming_type
)
4738 /* The renaming types adhere to the following convention:
4739 <scope>__<rename>___<XR extension>.
4740 So, to extract the scope, we search for the "___XR" extension,
4741 and then backtrack until we find the first "__". */
4743 const char *name
= renaming_type
->name ();
4744 const char *suffix
= strstr (name
, "___XR");
4747 /* Now, backtrack a bit until we find the first "__". Start looking
4748 at suffix - 3, as the <rename> part is at least one character long. */
4750 for (last
= suffix
- 3; last
> name
; last
--)
4751 if (last
[0] == '_' && last
[1] == '_')
4754 /* Make a copy of scope and return it. */
4755 return std::string (name
, last
);
4758 /* Return nonzero if NAME corresponds to a package name. */
4761 is_package_name (const char *name
)
4763 /* Here, We take advantage of the fact that no symbols are generated
4764 for packages, while symbols are generated for each function.
4765 So the condition for NAME represent a package becomes equivalent
4766 to NAME not existing in our list of symbols. There is only one
4767 small complication with library-level functions (see below). */
4769 /* If it is a function that has not been defined at library level,
4770 then we should be able to look it up in the symbols. */
4771 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4774 /* Library-level function names start with "_ada_". See if function
4775 "_ada_" followed by NAME can be found. */
4777 /* Do a quick check that NAME does not contain "__", since library-level
4778 functions names cannot contain "__" in them. */
4779 if (strstr (name
, "__") != NULL
)
4782 std::string fun_name
= string_printf ("_ada_%s", name
);
4784 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
4787 /* Return nonzero if SYM corresponds to a renaming entity that is
4788 not visible from FUNCTION_NAME. */
4791 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
4793 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4796 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4798 /* If the rename has been defined in a package, then it is visible. */
4799 if (is_package_name (scope
.c_str ()))
4802 /* Check that the rename is in the current function scope by checking
4803 that its name starts with SCOPE. */
4805 /* If the function name starts with "_ada_", it means that it is
4806 a library-level function. Strip this prefix before doing the
4807 comparison, as the encoding for the renaming does not contain
4809 if (startswith (function_name
, "_ada_"))
4812 return !startswith (function_name
, scope
.c_str ());
4815 /* Remove entries from SYMS that corresponds to a renaming entity that
4816 is not visible from the function associated with CURRENT_BLOCK or
4817 that is superfluous due to the presence of more specific renaming
4818 information. Places surviving symbols in the initial entries of
4822 First, in cases where an object renaming is implemented as a
4823 reference variable, GNAT may produce both the actual reference
4824 variable and the renaming encoding. In this case, we discard the
4827 Second, GNAT emits a type following a specified encoding for each renaming
4828 entity. Unfortunately, STABS currently does not support the definition
4829 of types that are local to a given lexical block, so all renamings types
4830 are emitted at library level. As a consequence, if an application
4831 contains two renaming entities using the same name, and a user tries to
4832 print the value of one of these entities, the result of the ada symbol
4833 lookup will also contain the wrong renaming type.
4835 This function partially covers for this limitation by attempting to
4836 remove from the SYMS list renaming symbols that should be visible
4837 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4838 method with the current information available. The implementation
4839 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4841 - When the user tries to print a rename in a function while there
4842 is another rename entity defined in a package: Normally, the
4843 rename in the function has precedence over the rename in the
4844 package, so the latter should be removed from the list. This is
4845 currently not the case.
4847 - This function will incorrectly remove valid renames if
4848 the CURRENT_BLOCK corresponds to a function which symbol name
4849 has been changed by an "Export" pragma. As a consequence,
4850 the user will be unable to print such rename entities. */
4853 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
4854 const struct block
*current_block
)
4856 struct symbol
*current_function
;
4857 const char *current_function_name
;
4859 int is_new_style_renaming
;
4861 /* If there is both a renaming foo___XR... encoded as a variable and
4862 a simple variable foo in the same block, discard the latter.
4863 First, zero out such symbols, then compress. */
4864 is_new_style_renaming
= 0;
4865 for (i
= 0; i
< syms
->size (); i
+= 1)
4867 struct symbol
*sym
= (*syms
)[i
].symbol
;
4868 const struct block
*block
= (*syms
)[i
].block
;
4872 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4874 name
= sym
->linkage_name ();
4875 suffix
= strstr (name
, "___XR");
4879 int name_len
= suffix
- name
;
4882 is_new_style_renaming
= 1;
4883 for (j
= 0; j
< syms
->size (); j
+= 1)
4884 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
4885 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
4887 && block
== (*syms
)[j
].block
)
4888 (*syms
)[j
].symbol
= NULL
;
4891 if (is_new_style_renaming
)
4895 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
4896 if ((*syms
)[j
].symbol
!= NULL
)
4898 (*syms
)[k
] = (*syms
)[j
];
4905 /* Extract the function name associated to CURRENT_BLOCK.
4906 Abort if unable to do so. */
4908 if (current_block
== NULL
)
4911 current_function
= block_linkage_function (current_block
);
4912 if (current_function
== NULL
)
4915 current_function_name
= current_function
->linkage_name ();
4916 if (current_function_name
== NULL
)
4919 /* Check each of the symbols, and remove it from the list if it is
4920 a type corresponding to a renaming that is out of the scope of
4921 the current block. */
4924 while (i
< syms
->size ())
4926 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
4927 == ADA_OBJECT_RENAMING
4928 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
4929 current_function_name
))
4930 syms
->erase (syms
->begin () + i
);
4936 /* Add to RESULT all symbols from BLOCK (and its super-blocks)
4937 whose name and domain match NAME and DOMAIN respectively.
4938 If no match was found, then extend the search to "enclosing"
4939 routines (in other words, if we're inside a nested function,
4940 search the symbols defined inside the enclosing functions).
4941 If WILD_MATCH_P is nonzero, perform the naming matching in
4942 "wild" mode (see function "wild_match" for more info).
4944 Note: This function assumes that RESULT has 0 (zero) element in it. */
4947 ada_add_local_symbols (std::vector
<struct block_symbol
> &result
,
4948 const lookup_name_info
&lookup_name
,
4949 const struct block
*block
, domain_enum domain
)
4951 int block_depth
= 0;
4953 while (block
!= NULL
)
4956 ada_add_block_symbols (result
, block
, lookup_name
, domain
, NULL
);
4958 /* If we found a non-function match, assume that's the one. */
4959 if (is_nonfunction (result
))
4962 block
= BLOCK_SUPERBLOCK (block
);
4965 /* If no luck so far, try to find NAME as a local symbol in some lexically
4966 enclosing subprogram. */
4967 if (result
.empty () && block_depth
> 2)
4968 add_symbols_from_enclosing_procs (result
, lookup_name
, domain
);
4971 /* An object of this type is used as the user_data argument when
4972 calling the map_matching_symbols method. */
4976 explicit match_data (std::vector
<struct block_symbol
> *rp
)
4980 DISABLE_COPY_AND_ASSIGN (match_data
);
4982 struct objfile
*objfile
= nullptr;
4983 std::vector
<struct block_symbol
> *resultp
;
4984 struct symbol
*arg_sym
= nullptr;
4985 bool found_sym
= false;
4988 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
4989 to a list of symbols. DATA is a pointer to a struct match_data *
4990 containing the vector that collects the symbol list, the file that SYM
4991 must come from, a flag indicating whether a non-argument symbol has
4992 been found in the current block, and the last argument symbol
4993 passed in SYM within the current block (if any). When SYM is null,
4994 marking the end of a block, the argument symbol is added if no
4995 other has been found. */
4998 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
4999 struct match_data
*data
)
5001 const struct block
*block
= bsym
->block
;
5002 struct symbol
*sym
= bsym
->symbol
;
5006 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5007 add_defn_to_vec (*data
->resultp
,
5008 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5010 data
->found_sym
= false;
5011 data
->arg_sym
= NULL
;
5015 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5017 else if (SYMBOL_IS_ARGUMENT (sym
))
5018 data
->arg_sym
= sym
;
5021 data
->found_sym
= true;
5022 add_defn_to_vec (*data
->resultp
,
5023 fixup_symbol_section (sym
, data
->objfile
),
5030 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5031 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5032 symbols to RESULT. Return whether we found such symbols. */
5035 ada_add_block_renamings (std::vector
<struct block_symbol
> &result
,
5036 const struct block
*block
,
5037 const lookup_name_info
&lookup_name
,
5040 struct using_direct
*renaming
;
5041 int defns_mark
= result
.size ();
5043 symbol_name_matcher_ftype
*name_match
5044 = ada_get_symbol_name_matcher (lookup_name
);
5046 for (renaming
= block_using (block
);
5048 renaming
= renaming
->next
)
5052 /* Avoid infinite recursions: skip this renaming if we are actually
5053 already traversing it.
5055 Currently, symbol lookup in Ada don't use the namespace machinery from
5056 C++/Fortran support: skip namespace imports that use them. */
5057 if (renaming
->searched
5058 || (renaming
->import_src
!= NULL
5059 && renaming
->import_src
[0] != '\0')
5060 || (renaming
->import_dest
!= NULL
5061 && renaming
->import_dest
[0] != '\0'))
5063 renaming
->searched
= 1;
5065 /* TODO: here, we perform another name-based symbol lookup, which can
5066 pull its own multiple overloads. In theory, we should be able to do
5067 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5068 not a simple name. But in order to do this, we would need to enhance
5069 the DWARF reader to associate a symbol to this renaming, instead of a
5070 name. So, for now, we do something simpler: re-use the C++/Fortran
5071 namespace machinery. */
5072 r_name
= (renaming
->alias
!= NULL
5074 : renaming
->declaration
);
5075 if (name_match (r_name
, lookup_name
, NULL
))
5077 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5078 lookup_name
.match_type ());
5079 ada_add_all_symbols (result
, block
, decl_lookup_name
, domain
,
5082 renaming
->searched
= 0;
5084 return result
.size () != defns_mark
;
5087 /* Implements compare_names, but only applying the comparision using
5088 the given CASING. */
5091 compare_names_with_case (const char *string1
, const char *string2
,
5092 enum case_sensitivity casing
)
5094 while (*string1
!= '\0' && *string2
!= '\0')
5098 if (isspace (*string1
) || isspace (*string2
))
5099 return strcmp_iw_ordered (string1
, string2
);
5101 if (casing
== case_sensitive_off
)
5103 c1
= tolower (*string1
);
5104 c2
= tolower (*string2
);
5121 return strcmp_iw_ordered (string1
, string2
);
5123 if (*string2
== '\0')
5125 if (is_name_suffix (string1
))
5132 if (*string2
== '(')
5133 return strcmp_iw_ordered (string1
, string2
);
5136 if (casing
== case_sensitive_off
)
5137 return tolower (*string1
) - tolower (*string2
);
5139 return *string1
- *string2
;
5144 /* Compare STRING1 to STRING2, with results as for strcmp.
5145 Compatible with strcmp_iw_ordered in that...
5147 strcmp_iw_ordered (STRING1, STRING2) <= 0
5151 compare_names (STRING1, STRING2) <= 0
5153 (they may differ as to what symbols compare equal). */
5156 compare_names (const char *string1
, const char *string2
)
5160 /* Similar to what strcmp_iw_ordered does, we need to perform
5161 a case-insensitive comparison first, and only resort to
5162 a second, case-sensitive, comparison if the first one was
5163 not sufficient to differentiate the two strings. */
5165 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5167 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5172 /* Convenience function to get at the Ada encoded lookup name for
5173 LOOKUP_NAME, as a C string. */
5176 ada_lookup_name (const lookup_name_info
&lookup_name
)
5178 return lookup_name
.ada ().lookup_name ().c_str ();
5181 /* Add to RESULT all non-local symbols whose name and domain match
5182 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5183 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5184 symbols otherwise. */
5187 add_nonlocal_symbols (std::vector
<struct block_symbol
> &result
,
5188 const lookup_name_info
&lookup_name
,
5189 domain_enum domain
, int global
)
5191 struct match_data
data (&result
);
5193 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5195 auto callback
= [&] (struct block_symbol
*bsym
)
5197 return aux_add_nonlocal_symbols (bsym
, &data
);
5200 for (objfile
*objfile
: current_program_space
->objfiles ())
5202 data
.objfile
= objfile
;
5204 if (objfile
->sf
!= nullptr)
5205 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5206 domain
, global
, callback
,
5208 ? NULL
: compare_names
));
5210 for (compunit_symtab
*cu
: objfile
->compunits ())
5212 const struct block
*global_block
5213 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5215 if (ada_add_block_renamings (result
, global_block
, lookup_name
,
5217 data
.found_sym
= true;
5221 if (result
.empty () && global
&& !is_wild_match
)
5223 const char *name
= ada_lookup_name (lookup_name
);
5224 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5225 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5227 for (objfile
*objfile
: current_program_space
->objfiles ())
5229 data
.objfile
= objfile
;
5230 if (objfile
->sf
!= nullptr)
5231 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5232 domain
, global
, callback
,
5238 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5239 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5240 returning the number of matches. Add these to RESULT.
5242 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5243 symbol match within the nest of blocks whose innermost member is BLOCK,
5244 is the one match returned (no other matches in that or
5245 enclosing blocks is returned). If there are any matches in or
5246 surrounding BLOCK, then these alone are returned.
5248 Names prefixed with "standard__" are handled specially:
5249 "standard__" is first stripped off (by the lookup_name
5250 constructor), and only static and global symbols are searched.
5252 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5253 to lookup global symbols. */
5256 ada_add_all_symbols (std::vector
<struct block_symbol
> &result
,
5257 const struct block
*block
,
5258 const lookup_name_info
&lookup_name
,
5261 int *made_global_lookup_p
)
5265 if (made_global_lookup_p
)
5266 *made_global_lookup_p
= 0;
5268 /* Special case: If the user specifies a symbol name inside package
5269 Standard, do a non-wild matching of the symbol name without
5270 the "standard__" prefix. This was primarily introduced in order
5271 to allow the user to specifically access the standard exceptions
5272 using, for instance, Standard.Constraint_Error when Constraint_Error
5273 is ambiguous (due to the user defining its own Constraint_Error
5274 entity inside its program). */
5275 if (lookup_name
.ada ().standard_p ())
5278 /* Check the non-global symbols. If we have ANY match, then we're done. */
5283 ada_add_local_symbols (result
, lookup_name
, block
, domain
);
5286 /* In the !full_search case we're are being called by
5287 iterate_over_symbols, and we don't want to search
5289 ada_add_block_symbols (result
, block
, lookup_name
, domain
, NULL
);
5291 if (!result
.empty () || !full_search
)
5295 /* No non-global symbols found. Check our cache to see if we have
5296 already performed this search before. If we have, then return
5299 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5300 domain
, &sym
, &block
))
5303 add_defn_to_vec (result
, sym
, block
);
5307 if (made_global_lookup_p
)
5308 *made_global_lookup_p
= 1;
5310 /* Search symbols from all global blocks. */
5312 add_nonlocal_symbols (result
, lookup_name
, domain
, 1);
5314 /* Now add symbols from all per-file blocks if we've gotten no hits
5315 (not strictly correct, but perhaps better than an error). */
5317 if (result
.empty ())
5318 add_nonlocal_symbols (result
, lookup_name
, domain
, 0);
5321 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5322 is non-zero, enclosing scope and in global scopes.
5324 Returns (SYM,BLOCK) tuples, indicating the symbols found and the
5325 blocks and symbol tables (if any) in which they were found.
5327 When full_search is non-zero, any non-function/non-enumeral
5328 symbol match within the nest of blocks whose innermost member is BLOCK,
5329 is the one match returned (no other matches in that or
5330 enclosing blocks is returned). If there are any matches in or
5331 surrounding BLOCK, then these alone are returned.
5333 Names prefixed with "standard__" are handled specially: "standard__"
5334 is first stripped off, and only static and global symbols are searched. */
5336 static std::vector
<struct block_symbol
>
5337 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5338 const struct block
*block
,
5342 int syms_from_global_search
;
5343 std::vector
<struct block_symbol
> results
;
5345 ada_add_all_symbols (results
, block
, lookup_name
,
5346 domain
, full_search
, &syms_from_global_search
);
5348 remove_extra_symbols (&results
);
5350 if (results
.empty () && full_search
&& syms_from_global_search
)
5351 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5353 if (results
.size () == 1 && full_search
&& syms_from_global_search
)
5354 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5355 results
[0].symbol
, results
[0].block
);
5357 remove_irrelevant_renamings (&results
, block
);
5361 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5362 in global scopes, returning (SYM,BLOCK) tuples.
5364 See ada_lookup_symbol_list_worker for further details. */
5366 std::vector
<struct block_symbol
>
5367 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5370 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5371 lookup_name_info
lookup_name (name
, name_match_type
);
5373 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, 1);
5376 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5377 to 1, but choosing the first symbol found if there are multiple
5380 The result is stored in *INFO, which must be non-NULL.
5381 If no match is found, INFO->SYM is set to NULL. */
5384 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5386 struct block_symbol
*info
)
5388 /* Since we already have an encoded name, wrap it in '<>' to force a
5389 verbatim match. Otherwise, if the name happens to not look like
5390 an encoded name (because it doesn't include a "__"),
5391 ada_lookup_name_info would re-encode/fold it again, and that
5392 would e.g., incorrectly lowercase object renaming names like
5393 "R28b" -> "r28b". */
5394 std::string verbatim
= add_angle_brackets (name
);
5396 gdb_assert (info
!= NULL
);
5397 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5400 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5401 scope and in global scopes, or NULL if none. NAME is folded and
5402 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5403 choosing the first symbol if there are multiple choices. */
5406 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5409 std::vector
<struct block_symbol
> candidates
5410 = ada_lookup_symbol_list (name
, block0
, domain
);
5412 if (candidates
.empty ())
5415 block_symbol info
= candidates
[0];
5416 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5421 /* True iff STR is a possible encoded suffix of a normal Ada name
5422 that is to be ignored for matching purposes. Suffixes of parallel
5423 names (e.g., XVE) are not included here. Currently, the possible suffixes
5424 are given by any of the regular expressions:
5426 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5427 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5428 TKB [subprogram suffix for task bodies]
5429 _E[0-9]+[bs]$ [protected object entry suffixes]
5430 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5432 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5433 match is performed. This sequence is used to differentiate homonyms,
5434 is an optional part of a valid name suffix. */
5437 is_name_suffix (const char *str
)
5440 const char *matching
;
5441 const int len
= strlen (str
);
5443 /* Skip optional leading __[0-9]+. */
5445 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5448 while (isdigit (str
[0]))
5454 if (str
[0] == '.' || str
[0] == '$')
5457 while (isdigit (matching
[0]))
5459 if (matching
[0] == '\0')
5465 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5468 while (isdigit (matching
[0]))
5470 if (matching
[0] == '\0')
5474 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5476 if (strcmp (str
, "TKB") == 0)
5480 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5481 with a N at the end. Unfortunately, the compiler uses the same
5482 convention for other internal types it creates. So treating
5483 all entity names that end with an "N" as a name suffix causes
5484 some regressions. For instance, consider the case of an enumerated
5485 type. To support the 'Image attribute, it creates an array whose
5487 Having a single character like this as a suffix carrying some
5488 information is a bit risky. Perhaps we should change the encoding
5489 to be something like "_N" instead. In the meantime, do not do
5490 the following check. */
5491 /* Protected Object Subprograms */
5492 if (len
== 1 && str
[0] == 'N')
5497 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5500 while (isdigit (matching
[0]))
5502 if ((matching
[0] == 'b' || matching
[0] == 's')
5503 && matching
[1] == '\0')
5507 /* ??? We should not modify STR directly, as we are doing below. This
5508 is fine in this case, but may become problematic later if we find
5509 that this alternative did not work, and want to try matching
5510 another one from the begining of STR. Since we modified it, we
5511 won't be able to find the begining of the string anymore! */
5515 while (str
[0] != '_' && str
[0] != '\0')
5517 if (str
[0] != 'n' && str
[0] != 'b')
5523 if (str
[0] == '\000')
5528 if (str
[1] != '_' || str
[2] == '\000')
5532 if (strcmp (str
+ 3, "JM") == 0)
5534 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5535 the LJM suffix in favor of the JM one. But we will
5536 still accept LJM as a valid suffix for a reasonable
5537 amount of time, just to allow ourselves to debug programs
5538 compiled using an older version of GNAT. */
5539 if (strcmp (str
+ 3, "LJM") == 0)
5543 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5544 || str
[4] == 'U' || str
[4] == 'P')
5546 if (str
[4] == 'R' && str
[5] != 'T')
5550 if (!isdigit (str
[2]))
5552 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5553 if (!isdigit (str
[k
]) && str
[k
] != '_')
5557 if (str
[0] == '$' && isdigit (str
[1]))
5559 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5560 if (!isdigit (str
[k
]) && str
[k
] != '_')
5567 /* Return non-zero if the string starting at NAME and ending before
5568 NAME_END contains no capital letters. */
5571 is_valid_name_for_wild_match (const char *name0
)
5573 std::string decoded_name
= ada_decode (name0
);
5576 /* If the decoded name starts with an angle bracket, it means that
5577 NAME0 does not follow the GNAT encoding format. It should then
5578 not be allowed as a possible wild match. */
5579 if (decoded_name
[0] == '<')
5582 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5583 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5589 /* Advance *NAMEP to next occurrence in the string NAME0 of the TARGET0
5590 character which could start a simple name. Assumes that *NAMEP points
5591 somewhere inside the string beginning at NAME0. */
5594 advance_wild_match (const char **namep
, const char *name0
, char target0
)
5596 const char *name
= *namep
;
5606 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5609 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
5614 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5615 || name
[2] == target0
))
5620 else if (t1
== '_' && name
[2] == 'B' && name
[3] == '_')
5622 /* Names like "pkg__B_N__name", where N is a number, are
5623 block-local. We can handle these by simply skipping
5630 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5640 /* Return true iff NAME encodes a name of the form prefix.PATN.
5641 Ignores any informational suffixes of NAME (i.e., for which
5642 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
5646 wild_match (const char *name
, const char *patn
)
5649 const char *name0
= name
;
5653 const char *match
= name
;
5657 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5660 if (*p
== '\0' && is_name_suffix (name
))
5661 return match
== name0
|| is_valid_name_for_wild_match (name0
);
5663 if (name
[-1] == '_')
5666 if (!advance_wild_match (&name
, name0
, *patn
))
5671 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to RESULT (if
5672 necessary). OBJFILE is the section containing BLOCK. */
5675 ada_add_block_symbols (std::vector
<struct block_symbol
> &result
,
5676 const struct block
*block
,
5677 const lookup_name_info
&lookup_name
,
5678 domain_enum domain
, struct objfile
*objfile
)
5680 struct block_iterator iter
;
5681 /* A matching argument symbol, if any. */
5682 struct symbol
*arg_sym
;
5683 /* Set true when we find a matching non-argument symbol. */
5689 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
5691 sym
= block_iter_match_next (lookup_name
, &iter
))
5693 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
5695 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5697 if (SYMBOL_IS_ARGUMENT (sym
))
5702 add_defn_to_vec (result
,
5703 fixup_symbol_section (sym
, objfile
),
5710 /* Handle renamings. */
5712 if (ada_add_block_renamings (result
, block
, lookup_name
, domain
))
5715 if (!found_sym
&& arg_sym
!= NULL
)
5717 add_defn_to_vec (result
,
5718 fixup_symbol_section (arg_sym
, objfile
),
5722 if (!lookup_name
.ada ().wild_match_p ())
5726 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
5727 const char *name
= ada_lookup_name
.c_str ();
5728 size_t name_len
= ada_lookup_name
.size ();
5730 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5732 if (symbol_matches_domain (sym
->language (),
5733 SYMBOL_DOMAIN (sym
), domain
))
5737 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
5740 cmp
= !startswith (sym
->linkage_name (), "_ada_");
5742 cmp
= strncmp (name
, sym
->linkage_name () + 5,
5747 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
5749 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5751 if (SYMBOL_IS_ARGUMENT (sym
))
5756 add_defn_to_vec (result
,
5757 fixup_symbol_section (sym
, objfile
),
5765 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5766 They aren't parameters, right? */
5767 if (!found_sym
&& arg_sym
!= NULL
)
5769 add_defn_to_vec (result
,
5770 fixup_symbol_section (arg_sym
, objfile
),
5777 /* Symbol Completion */
5782 ada_lookup_name_info::matches
5783 (const char *sym_name
,
5784 symbol_name_match_type match_type
,
5785 completion_match_result
*comp_match_res
) const
5788 const char *text
= m_encoded_name
.c_str ();
5789 size_t text_len
= m_encoded_name
.size ();
5791 /* First, test against the fully qualified name of the symbol. */
5793 if (strncmp (sym_name
, text
, text_len
) == 0)
5796 std::string decoded_name
= ada_decode (sym_name
);
5797 if (match
&& !m_encoded_p
)
5799 /* One needed check before declaring a positive match is to verify
5800 that iff we are doing a verbatim match, the decoded version
5801 of the symbol name starts with '<'. Otherwise, this symbol name
5802 is not a suitable completion. */
5804 bool has_angle_bracket
= (decoded_name
[0] == '<');
5805 match
= (has_angle_bracket
== m_verbatim_p
);
5808 if (match
&& !m_verbatim_p
)
5810 /* When doing non-verbatim match, another check that needs to
5811 be done is to verify that the potentially matching symbol name
5812 does not include capital letters, because the ada-mode would
5813 not be able to understand these symbol names without the
5814 angle bracket notation. */
5817 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5822 /* Second: Try wild matching... */
5824 if (!match
&& m_wild_match_p
)
5826 /* Since we are doing wild matching, this means that TEXT
5827 may represent an unqualified symbol name. We therefore must
5828 also compare TEXT against the unqualified name of the symbol. */
5829 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
5831 if (strncmp (sym_name
, text
, text_len
) == 0)
5835 /* Finally: If we found a match, prepare the result to return. */
5840 if (comp_match_res
!= NULL
)
5842 std::string
&match_str
= comp_match_res
->match
.storage ();
5845 match_str
= ada_decode (sym_name
);
5849 match_str
= add_angle_brackets (sym_name
);
5851 match_str
= sym_name
;
5855 comp_match_res
->set_match (match_str
.c_str ());
5863 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5864 for tagged types. */
5867 ada_is_dispatch_table_ptr_type (struct type
*type
)
5871 if (type
->code () != TYPE_CODE_PTR
)
5874 name
= TYPE_TARGET_TYPE (type
)->name ();
5878 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5881 /* Return non-zero if TYPE is an interface tag. */
5884 ada_is_interface_tag (struct type
*type
)
5886 const char *name
= type
->name ();
5891 return (strcmp (name
, "ada__tags__interface_tag") == 0);
5894 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5895 to be invisible to users. */
5898 ada_is_ignored_field (struct type
*type
, int field_num
)
5900 if (field_num
< 0 || field_num
> type
->num_fields ())
5903 /* Check the name of that field. */
5905 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5907 /* Anonymous field names should not be printed.
5908 brobecker/2007-02-20: I don't think this can actually happen
5909 but we don't want to print the value of anonymous fields anyway. */
5913 /* Normally, fields whose name start with an underscore ("_")
5914 are fields that have been internally generated by the compiler,
5915 and thus should not be printed. The "_parent" field is special,
5916 however: This is a field internally generated by the compiler
5917 for tagged types, and it contains the components inherited from
5918 the parent type. This field should not be printed as is, but
5919 should not be ignored either. */
5920 if (name
[0] == '_' && !startswith (name
, "_parent"))
5924 /* If this is the dispatch table of a tagged type or an interface tag,
5926 if (ada_is_tagged_type (type
, 1)
5927 && (ada_is_dispatch_table_ptr_type (type
->field (field_num
).type ())
5928 || ada_is_interface_tag (type
->field (field_num
).type ())))
5931 /* Not a special field, so it should not be ignored. */
5935 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5936 pointer or reference type whose ultimate target has a tag field. */
5939 ada_is_tagged_type (struct type
*type
, int refok
)
5941 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
5944 /* True iff TYPE represents the type of X'Tag */
5947 ada_is_tag_type (struct type
*type
)
5949 type
= ada_check_typedef (type
);
5951 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
5955 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5957 return (name
!= NULL
5958 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5962 /* The type of the tag on VAL. */
5964 static struct type
*
5965 ada_tag_type (struct value
*val
)
5967 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
5970 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
5971 retired at Ada 05). */
5974 is_ada95_tag (struct value
*tag
)
5976 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
5979 /* The value of the tag on VAL. */
5981 static struct value
*
5982 ada_value_tag (struct value
*val
)
5984 return ada_value_struct_elt (val
, "_tag", 0);
5987 /* The value of the tag on the object of type TYPE whose contents are
5988 saved at VALADDR, if it is non-null, or is at memory address
5991 static struct value
*
5992 value_tag_from_contents_and_address (struct type
*type
,
5993 const gdb_byte
*valaddr
,
5996 int tag_byte_offset
;
5997 struct type
*tag_type
;
5999 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6002 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6004 : valaddr
+ tag_byte_offset
);
6005 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6007 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6012 static struct type
*
6013 type_from_tag (struct value
*tag
)
6015 gdb::unique_xmalloc_ptr
<char> type_name
= ada_tag_name (tag
);
6017 if (type_name
!= NULL
)
6018 return ada_find_any_type (ada_encode (type_name
.get ()).c_str ());
6022 /* Given a value OBJ of a tagged type, return a value of this
6023 type at the base address of the object. The base address, as
6024 defined in Ada.Tags, it is the address of the primary tag of
6025 the object, and therefore where the field values of its full
6026 view can be fetched. */
6029 ada_tag_value_at_base_address (struct value
*obj
)
6032 LONGEST offset_to_top
= 0;
6033 struct type
*ptr_type
, *obj_type
;
6035 CORE_ADDR base_address
;
6037 obj_type
= value_type (obj
);
6039 /* It is the responsability of the caller to deref pointers. */
6041 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6044 tag
= ada_value_tag (obj
);
6048 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6050 if (is_ada95_tag (tag
))
6053 ptr_type
= language_lookup_primitive_type
6054 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6055 ptr_type
= lookup_pointer_type (ptr_type
);
6056 val
= value_cast (ptr_type
, tag
);
6060 /* It is perfectly possible that an exception be raised while
6061 trying to determine the base address, just like for the tag;
6062 see ada_tag_name for more details. We do not print the error
6063 message for the same reason. */
6067 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6070 catch (const gdb_exception_error
&e
)
6075 /* If offset is null, nothing to do. */
6077 if (offset_to_top
== 0)
6080 /* -1 is a special case in Ada.Tags; however, what should be done
6081 is not quite clear from the documentation. So do nothing for
6084 if (offset_to_top
== -1)
6087 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6088 from the base address. This was however incompatible with
6089 C++ dispatch table: C++ uses a *negative* value to *add*
6090 to the base address. Ada's convention has therefore been
6091 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6092 use the same convention. Here, we support both cases by
6093 checking the sign of OFFSET_TO_TOP. */
6095 if (offset_to_top
> 0)
6096 offset_to_top
= -offset_to_top
;
6098 base_address
= value_address (obj
) + offset_to_top
;
6099 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6101 /* Make sure that we have a proper tag at the new address.
6102 Otherwise, offset_to_top is bogus (which can happen when
6103 the object is not initialized yet). */
6108 obj_type
= type_from_tag (tag
);
6113 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6116 /* Return the "ada__tags__type_specific_data" type. */
6118 static struct type
*
6119 ada_get_tsd_type (struct inferior
*inf
)
6121 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6123 if (data
->tsd_type
== 0)
6124 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6125 return data
->tsd_type
;
6128 /* Return the TSD (type-specific data) associated to the given TAG.
6129 TAG is assumed to be the tag of a tagged-type entity.
6131 May return NULL if we are unable to get the TSD. */
6133 static struct value
*
6134 ada_get_tsd_from_tag (struct value
*tag
)
6139 /* First option: The TSD is simply stored as a field of our TAG.
6140 Only older versions of GNAT would use this format, but we have
6141 to test it first, because there are no visible markers for
6142 the current approach except the absence of that field. */
6144 val
= ada_value_struct_elt (tag
, "tsd", 1);
6148 /* Try the second representation for the dispatch table (in which
6149 there is no explicit 'tsd' field in the referent of the tag pointer,
6150 and instead the tsd pointer is stored just before the dispatch
6153 type
= ada_get_tsd_type (current_inferior());
6156 type
= lookup_pointer_type (lookup_pointer_type (type
));
6157 val
= value_cast (type
, tag
);
6160 return value_ind (value_ptradd (val
, -1));
6163 /* Given the TSD of a tag (type-specific data), return a string
6164 containing the name of the associated type.
6166 May return NULL if we are unable to determine the tag name. */
6168 static gdb::unique_xmalloc_ptr
<char>
6169 ada_tag_name_from_tsd (struct value
*tsd
)
6174 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6177 gdb::unique_xmalloc_ptr
<char> buffer
6178 = target_read_string (value_as_address (val
), INT_MAX
);
6179 if (buffer
== nullptr)
6182 for (p
= buffer
.get (); *p
!= '\0'; ++p
)
6191 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6194 Return NULL if the TAG is not an Ada tag, or if we were unable to
6195 determine the name of that tag. */
6197 gdb::unique_xmalloc_ptr
<char>
6198 ada_tag_name (struct value
*tag
)
6200 gdb::unique_xmalloc_ptr
<char> name
;
6202 if (!ada_is_tag_type (value_type (tag
)))
6205 /* It is perfectly possible that an exception be raised while trying
6206 to determine the TAG's name, even under normal circumstances:
6207 The associated variable may be uninitialized or corrupted, for
6208 instance. We do not let any exception propagate past this point.
6209 instead we return NULL.
6211 We also do not print the error message either (which often is very
6212 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6213 the caller print a more meaningful message if necessary. */
6216 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6219 name
= ada_tag_name_from_tsd (tsd
);
6221 catch (const gdb_exception_error
&e
)
6228 /* The parent type of TYPE, or NULL if none. */
6231 ada_parent_type (struct type
*type
)
6235 type
= ada_check_typedef (type
);
6237 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6240 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6241 if (ada_is_parent_field (type
, i
))
6243 struct type
*parent_type
= type
->field (i
).type ();
6245 /* If the _parent field is a pointer, then dereference it. */
6246 if (parent_type
->code () == TYPE_CODE_PTR
)
6247 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6248 /* If there is a parallel XVS type, get the actual base type. */
6249 parent_type
= ada_get_base_type (parent_type
);
6251 return ada_check_typedef (parent_type
);
6257 /* True iff field number FIELD_NUM of structure type TYPE contains the
6258 parent-type (inherited) fields of a derived type. Assumes TYPE is
6259 a structure type with at least FIELD_NUM+1 fields. */
6262 ada_is_parent_field (struct type
*type
, int field_num
)
6264 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6266 return (name
!= NULL
6267 && (startswith (name
, "PARENT")
6268 || startswith (name
, "_parent")));
6271 /* True iff field number FIELD_NUM of structure type TYPE is a
6272 transparent wrapper field (which should be silently traversed when doing
6273 field selection and flattened when printing). Assumes TYPE is a
6274 structure type with at least FIELD_NUM+1 fields. Such fields are always
6278 ada_is_wrapper_field (struct type
*type
, int field_num
)
6280 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6282 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6284 /* This happens in functions with "out" or "in out" parameters
6285 which are passed by copy. For such functions, GNAT describes
6286 the function's return type as being a struct where the return
6287 value is in a field called RETVAL, and where the other "out"
6288 or "in out" parameters are fields of that struct. This is not
6293 return (name
!= NULL
6294 && (startswith (name
, "PARENT")
6295 || strcmp (name
, "REP") == 0
6296 || startswith (name
, "_parent")
6297 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6300 /* True iff field number FIELD_NUM of structure or union type TYPE
6301 is a variant wrapper. Assumes TYPE is a structure type with at least
6302 FIELD_NUM+1 fields. */
6305 ada_is_variant_part (struct type
*type
, int field_num
)
6307 /* Only Ada types are eligible. */
6308 if (!ADA_TYPE_P (type
))
6311 struct type
*field_type
= type
->field (field_num
).type ();
6313 return (field_type
->code () == TYPE_CODE_UNION
6314 || (is_dynamic_field (type
, field_num
)
6315 && (TYPE_TARGET_TYPE (field_type
)->code ()
6316 == TYPE_CODE_UNION
)));
6319 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6320 whose discriminants are contained in the record type OUTER_TYPE,
6321 returns the type of the controlling discriminant for the variant.
6322 May return NULL if the type could not be found. */
6325 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6327 const char *name
= ada_variant_discrim_name (var_type
);
6329 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6332 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6333 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6334 represents a 'when others' clause; otherwise 0. */
6337 ada_is_others_clause (struct type
*type
, int field_num
)
6339 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6341 return (name
!= NULL
&& name
[0] == 'O');
6344 /* Assuming that TYPE0 is the type of the variant part of a record,
6345 returns the name of the discriminant controlling the variant.
6346 The value is valid until the next call to ada_variant_discrim_name. */
6349 ada_variant_discrim_name (struct type
*type0
)
6351 static std::string result
;
6354 const char *discrim_end
;
6355 const char *discrim_start
;
6357 if (type0
->code () == TYPE_CODE_PTR
)
6358 type
= TYPE_TARGET_TYPE (type0
);
6362 name
= ada_type_name (type
);
6364 if (name
== NULL
|| name
[0] == '\000')
6367 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6370 if (startswith (discrim_end
, "___XVN"))
6373 if (discrim_end
== name
)
6376 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6379 if (discrim_start
== name
+ 1)
6381 if ((discrim_start
> name
+ 3
6382 && startswith (discrim_start
- 3, "___"))
6383 || discrim_start
[-1] == '.')
6387 result
= std::string (discrim_start
, discrim_end
- discrim_start
);
6388 return result
.c_str ();
6391 /* Scan STR for a subtype-encoded number, beginning at position K.
6392 Put the position of the character just past the number scanned in
6393 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6394 Return 1 if there was a valid number at the given position, and 0
6395 otherwise. A "subtype-encoded" number consists of the absolute value
6396 in decimal, followed by the letter 'm' to indicate a negative number.
6397 Assumes 0m does not occur. */
6400 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6404 if (!isdigit (str
[k
]))
6407 /* Do it the hard way so as not to make any assumption about
6408 the relationship of unsigned long (%lu scan format code) and
6411 while (isdigit (str
[k
]))
6413 RU
= RU
* 10 + (str
[k
] - '0');
6420 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6426 /* NOTE on the above: Technically, C does not say what the results of
6427 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6428 number representable as a LONGEST (although either would probably work
6429 in most implementations). When RU>0, the locution in the then branch
6430 above is always equivalent to the negative of RU. */
6437 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6438 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6439 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6442 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6444 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6458 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6468 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6469 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6471 if (val
>= L
&& val
<= U
)
6483 /* FIXME: Lots of redundancy below. Try to consolidate. */
6485 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6486 ARG_TYPE, extract and return the value of one of its (non-static)
6487 fields. FIELDNO says which field. Differs from value_primitive_field
6488 only in that it can handle packed values of arbitrary type. */
6491 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6492 struct type
*arg_type
)
6496 arg_type
= ada_check_typedef (arg_type
);
6497 type
= arg_type
->field (fieldno
).type ();
6499 /* Handle packed fields. It might be that the field is not packed
6500 relative to its containing structure, but the structure itself is
6501 packed; in this case we must take the bit-field path. */
6502 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
6504 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6505 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6507 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6508 offset
+ bit_pos
/ 8,
6509 bit_pos
% 8, bit_size
, type
);
6512 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6515 /* Find field with name NAME in object of type TYPE. If found,
6516 set the following for each argument that is non-null:
6517 - *FIELD_TYPE_P to the field's type;
6518 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6519 an object of that type;
6520 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6521 - *BIT_SIZE_P to its size in bits if the field is packed, and
6523 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6524 fields up to but not including the desired field, or by the total
6525 number of fields if not found. A NULL value of NAME never
6526 matches; the function just counts visible fields in this case.
6528 Notice that we need to handle when a tagged record hierarchy
6529 has some components with the same name, like in this scenario:
6531 type Top_T is tagged record
6537 type Middle_T is new Top.Top_T with record
6538 N : Character := 'a';
6542 type Bottom_T is new Middle.Middle_T with record
6544 C : Character := '5';
6546 A : Character := 'J';
6549 Let's say we now have a variable declared and initialized as follow:
6551 TC : Top_A := new Bottom_T;
6553 And then we use this variable to call this function
6555 procedure Assign (Obj: in out Top_T; TV : Integer);
6559 Assign (Top_T (B), 12);
6561 Now, we're in the debugger, and we're inside that procedure
6562 then and we want to print the value of obj.c:
6564 Usually, the tagged record or one of the parent type owns the
6565 component to print and there's no issue but in this particular
6566 case, what does it mean to ask for Obj.C? Since the actual
6567 type for object is type Bottom_T, it could mean two things: type
6568 component C from the Middle_T view, but also component C from
6569 Bottom_T. So in that "undefined" case, when the component is
6570 not found in the non-resolved type (which includes all the
6571 components of the parent type), then resolve it and see if we
6572 get better luck once expanded.
6574 In the case of homonyms in the derived tagged type, we don't
6575 guaranty anything, and pick the one that's easiest for us
6578 Returns 1 if found, 0 otherwise. */
6581 find_struct_field (const char *name
, struct type
*type
, int offset
,
6582 struct type
**field_type_p
,
6583 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6587 int parent_offset
= -1;
6589 type
= ada_check_typedef (type
);
6591 if (field_type_p
!= NULL
)
6592 *field_type_p
= NULL
;
6593 if (byte_offset_p
!= NULL
)
6595 if (bit_offset_p
!= NULL
)
6597 if (bit_size_p
!= NULL
)
6600 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6602 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6603 int fld_offset
= offset
+ bit_pos
/ 8;
6604 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6606 if (t_field_name
== NULL
)
6609 else if (ada_is_parent_field (type
, i
))
6611 /* This is a field pointing us to the parent type of a tagged
6612 type. As hinted in this function's documentation, we give
6613 preference to fields in the current record first, so what
6614 we do here is just record the index of this field before
6615 we skip it. If it turns out we couldn't find our field
6616 in the current record, then we'll get back to it and search
6617 inside it whether the field might exist in the parent. */
6623 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6625 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6627 if (field_type_p
!= NULL
)
6628 *field_type_p
= type
->field (i
).type ();
6629 if (byte_offset_p
!= NULL
)
6630 *byte_offset_p
= fld_offset
;
6631 if (bit_offset_p
!= NULL
)
6632 *bit_offset_p
= bit_pos
% 8;
6633 if (bit_size_p
!= NULL
)
6634 *bit_size_p
= bit_size
;
6637 else if (ada_is_wrapper_field (type
, i
))
6639 if (find_struct_field (name
, type
->field (i
).type (), fld_offset
,
6640 field_type_p
, byte_offset_p
, bit_offset_p
,
6641 bit_size_p
, index_p
))
6644 else if (ada_is_variant_part (type
, i
))
6646 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6649 struct type
*field_type
6650 = ada_check_typedef (type
->field (i
).type ());
6652 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
6654 if (find_struct_field (name
, field_type
->field (j
).type (),
6656 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6657 field_type_p
, byte_offset_p
,
6658 bit_offset_p
, bit_size_p
, index_p
))
6662 else if (index_p
!= NULL
)
6666 /* Field not found so far. If this is a tagged type which
6667 has a parent, try finding that field in the parent now. */
6669 if (parent_offset
!= -1)
6671 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
6672 int fld_offset
= offset
+ bit_pos
/ 8;
6674 if (find_struct_field (name
, type
->field (parent_offset
).type (),
6675 fld_offset
, field_type_p
, byte_offset_p
,
6676 bit_offset_p
, bit_size_p
, index_p
))
6683 /* Number of user-visible fields in record type TYPE. */
6686 num_visible_fields (struct type
*type
)
6691 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6695 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6696 and search in it assuming it has (class) type TYPE.
6697 If found, return value, else return NULL.
6699 Searches recursively through wrapper fields (e.g., '_parent').
6701 In the case of homonyms in the tagged types, please refer to the
6702 long explanation in find_struct_field's function documentation. */
6704 static struct value
*
6705 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
6709 int parent_offset
= -1;
6711 type
= ada_check_typedef (type
);
6712 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6714 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6716 if (t_field_name
== NULL
)
6719 else if (ada_is_parent_field (type
, i
))
6721 /* This is a field pointing us to the parent type of a tagged
6722 type. As hinted in this function's documentation, we give
6723 preference to fields in the current record first, so what
6724 we do here is just record the index of this field before
6725 we skip it. If it turns out we couldn't find our field
6726 in the current record, then we'll get back to it and search
6727 inside it whether the field might exist in the parent. */
6733 else if (field_name_match (t_field_name
, name
))
6734 return ada_value_primitive_field (arg
, offset
, i
, type
);
6736 else if (ada_is_wrapper_field (type
, i
))
6738 struct value
*v
= /* Do not let indent join lines here. */
6739 ada_search_struct_field (name
, arg
,
6740 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6741 type
->field (i
).type ());
6747 else if (ada_is_variant_part (type
, i
))
6749 /* PNH: Do we ever get here? See find_struct_field. */
6751 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
6752 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6754 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
6756 struct value
*v
= ada_search_struct_field
/* Force line
6759 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6760 field_type
->field (j
).type ());
6768 /* Field not found so far. If this is a tagged type which
6769 has a parent, try finding that field in the parent now. */
6771 if (parent_offset
!= -1)
6773 struct value
*v
= ada_search_struct_field (
6774 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
6775 type
->field (parent_offset
).type ());
6784 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6785 int, struct type
*);
6788 /* Return field #INDEX in ARG, where the index is that returned by
6789 * find_struct_field through its INDEX_P argument. Adjust the address
6790 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6791 * If found, return value, else return NULL. */
6793 static struct value
*
6794 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6797 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6801 /* Auxiliary function for ada_index_struct_field. Like
6802 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6805 static struct value
*
6806 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6810 type
= ada_check_typedef (type
);
6812 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6814 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6816 else if (ada_is_wrapper_field (type
, i
))
6818 struct value
*v
= /* Do not let indent join lines here. */
6819 ada_index_struct_field_1 (index_p
, arg
,
6820 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6821 type
->field (i
).type ());
6827 else if (ada_is_variant_part (type
, i
))
6829 /* PNH: Do we ever get here? See ada_search_struct_field,
6830 find_struct_field. */
6831 error (_("Cannot assign this kind of variant record"));
6833 else if (*index_p
== 0)
6834 return ada_value_primitive_field (arg
, offset
, i
, type
);
6841 /* Return a string representation of type TYPE. */
6844 type_as_string (struct type
*type
)
6846 string_file tmp_stream
;
6848 type_print (type
, "", &tmp_stream
, -1);
6850 return std::move (tmp_stream
.string ());
6853 /* Given a type TYPE, look up the type of the component of type named NAME.
6854 If DISPP is non-null, add its byte displacement from the beginning of a
6855 structure (pointed to by a value) of type TYPE to *DISPP (does not
6856 work for packed fields).
6858 Matches any field whose name has NAME as a prefix, possibly
6861 TYPE can be either a struct or union. If REFOK, TYPE may also
6862 be a (pointer or reference)+ to a struct or union, and the
6863 ultimate target type will be searched.
6865 Looks recursively into variant clauses and parent types.
6867 In the case of homonyms in the tagged types, please refer to the
6868 long explanation in find_struct_field's function documentation.
6870 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6871 TYPE is not a type of the right kind. */
6873 static struct type
*
6874 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
6878 int parent_offset
= -1;
6883 if (refok
&& type
!= NULL
)
6886 type
= ada_check_typedef (type
);
6887 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
6889 type
= TYPE_TARGET_TYPE (type
);
6893 || (type
->code () != TYPE_CODE_STRUCT
6894 && type
->code () != TYPE_CODE_UNION
))
6899 error (_("Type %s is not a structure or union type"),
6900 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
6903 type
= to_static_fixed_type (type
);
6905 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6907 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6910 if (t_field_name
== NULL
)
6913 else if (ada_is_parent_field (type
, i
))
6915 /* This is a field pointing us to the parent type of a tagged
6916 type. As hinted in this function's documentation, we give
6917 preference to fields in the current record first, so what
6918 we do here is just record the index of this field before
6919 we skip it. If it turns out we couldn't find our field
6920 in the current record, then we'll get back to it and search
6921 inside it whether the field might exist in the parent. */
6927 else if (field_name_match (t_field_name
, name
))
6928 return type
->field (i
).type ();
6930 else if (ada_is_wrapper_field (type
, i
))
6932 t
= ada_lookup_struct_elt_type (type
->field (i
).type (), name
,
6938 else if (ada_is_variant_part (type
, i
))
6941 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
6943 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
6945 /* FIXME pnh 2008/01/26: We check for a field that is
6946 NOT wrapped in a struct, since the compiler sometimes
6947 generates these for unchecked variant types. Revisit
6948 if the compiler changes this practice. */
6949 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6951 if (v_field_name
!= NULL
6952 && field_name_match (v_field_name
, name
))
6953 t
= field_type
->field (j
).type ();
6955 t
= ada_lookup_struct_elt_type (field_type
->field (j
).type (),
6965 /* Field not found so far. If this is a tagged type which
6966 has a parent, try finding that field in the parent now. */
6968 if (parent_offset
!= -1)
6972 t
= ada_lookup_struct_elt_type (type
->field (parent_offset
).type (),
6981 const char *name_str
= name
!= NULL
? name
: _("<null>");
6983 error (_("Type %s has no component named %s"),
6984 type_as_string (type
).c_str (), name_str
);
6990 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6991 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6992 represents an unchecked union (that is, the variant part of a
6993 record that is named in an Unchecked_Union pragma). */
6996 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6998 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7000 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7004 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7005 within OUTER, determine which variant clause (field number in VAR_TYPE,
7006 numbering from 0) is applicable. Returns -1 if none are. */
7009 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7013 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7014 struct value
*discrim
;
7015 LONGEST discrim_val
;
7017 /* Using plain value_from_contents_and_address here causes problems
7018 because we will end up trying to resolve a type that is currently
7019 being constructed. */
7020 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7021 if (discrim
== NULL
)
7023 discrim_val
= value_as_long (discrim
);
7026 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7028 if (ada_is_others_clause (var_type
, i
))
7030 else if (ada_in_variant (discrim_val
, var_type
, i
))
7034 return others_clause
;
7039 /* Dynamic-Sized Records */
7041 /* Strategy: The type ostensibly attached to a value with dynamic size
7042 (i.e., a size that is not statically recorded in the debugging
7043 data) does not accurately reflect the size or layout of the value.
7044 Our strategy is to convert these values to values with accurate,
7045 conventional types that are constructed on the fly. */
7047 /* There is a subtle and tricky problem here. In general, we cannot
7048 determine the size of dynamic records without its data. However,
7049 the 'struct value' data structure, which GDB uses to represent
7050 quantities in the inferior process (the target), requires the size
7051 of the type at the time of its allocation in order to reserve space
7052 for GDB's internal copy of the data. That's why the
7053 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7054 rather than struct value*s.
7056 However, GDB's internal history variables ($1, $2, etc.) are
7057 struct value*s containing internal copies of the data that are not, in
7058 general, the same as the data at their corresponding addresses in
7059 the target. Fortunately, the types we give to these values are all
7060 conventional, fixed-size types (as per the strategy described
7061 above), so that we don't usually have to perform the
7062 'to_fixed_xxx_type' conversions to look at their values.
7063 Unfortunately, there is one exception: if one of the internal
7064 history variables is an array whose elements are unconstrained
7065 records, then we will need to create distinct fixed types for each
7066 element selected. */
7068 /* The upshot of all of this is that many routines take a (type, host
7069 address, target address) triple as arguments to represent a value.
7070 The host address, if non-null, is supposed to contain an internal
7071 copy of the relevant data; otherwise, the program is to consult the
7072 target at the target address. */
7074 /* Assuming that VAL0 represents a pointer value, the result of
7075 dereferencing it. Differs from value_ind in its treatment of
7076 dynamic-sized types. */
7079 ada_value_ind (struct value
*val0
)
7081 struct value
*val
= value_ind (val0
);
7083 if (ada_is_tagged_type (value_type (val
), 0))
7084 val
= ada_tag_value_at_base_address (val
);
7086 return ada_to_fixed_value (val
);
7089 /* The value resulting from dereferencing any "reference to"
7090 qualifiers on VAL0. */
7092 static struct value
*
7093 ada_coerce_ref (struct value
*val0
)
7095 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7097 struct value
*val
= val0
;
7099 val
= coerce_ref (val
);
7101 if (ada_is_tagged_type (value_type (val
), 0))
7102 val
= ada_tag_value_at_base_address (val
);
7104 return ada_to_fixed_value (val
);
7110 /* Return the bit alignment required for field #F of template type TYPE. */
7113 field_alignment (struct type
*type
, int f
)
7115 const char *name
= TYPE_FIELD_NAME (type
, f
);
7119 /* The field name should never be null, unless the debugging information
7120 is somehow malformed. In this case, we assume the field does not
7121 require any alignment. */
7125 len
= strlen (name
);
7127 if (!isdigit (name
[len
- 1]))
7130 if (isdigit (name
[len
- 2]))
7131 align_offset
= len
- 2;
7133 align_offset
= len
- 1;
7135 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7136 return TARGET_CHAR_BIT
;
7138 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7141 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7143 static struct symbol
*
7144 ada_find_any_type_symbol (const char *name
)
7148 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7149 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7152 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7156 /* Find a type named NAME. Ignores ambiguity. This routine will look
7157 solely for types defined by debug info, it will not search the GDB
7160 static struct type
*
7161 ada_find_any_type (const char *name
)
7163 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7166 return SYMBOL_TYPE (sym
);
7171 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7172 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7173 symbol, in which case it is returned. Otherwise, this looks for
7174 symbols whose name is that of NAME_SYM suffixed with "___XR".
7175 Return symbol if found, and NULL otherwise. */
7178 ada_is_renaming_symbol (struct symbol
*name_sym
)
7180 const char *name
= name_sym
->linkage_name ();
7181 return strstr (name
, "___XR") != NULL
;
7184 /* Because of GNAT encoding conventions, several GDB symbols may match a
7185 given type name. If the type denoted by TYPE0 is to be preferred to
7186 that of TYPE1 for purposes of type printing, return non-zero;
7187 otherwise return 0. */
7190 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7194 else if (type0
== NULL
)
7196 else if (type1
->code () == TYPE_CODE_VOID
)
7198 else if (type0
->code () == TYPE_CODE_VOID
)
7200 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7202 else if (ada_is_constrained_packed_array_type (type0
))
7204 else if (ada_is_array_descriptor_type (type0
)
7205 && !ada_is_array_descriptor_type (type1
))
7209 const char *type0_name
= type0
->name ();
7210 const char *type1_name
= type1
->name ();
7212 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7213 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7219 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7223 ada_type_name (struct type
*type
)
7227 return type
->name ();
7230 /* Search the list of "descriptive" types associated to TYPE for a type
7231 whose name is NAME. */
7233 static struct type
*
7234 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7236 struct type
*result
, *tmp
;
7238 if (ada_ignore_descriptive_types_p
)
7241 /* If there no descriptive-type info, then there is no parallel type
7243 if (!HAVE_GNAT_AUX_INFO (type
))
7246 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7247 while (result
!= NULL
)
7249 const char *result_name
= ada_type_name (result
);
7251 if (result_name
== NULL
)
7253 warning (_("unexpected null name on descriptive type"));
7257 /* If the names match, stop. */
7258 if (strcmp (result_name
, name
) == 0)
7261 /* Otherwise, look at the next item on the list, if any. */
7262 if (HAVE_GNAT_AUX_INFO (result
))
7263 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7267 /* If not found either, try after having resolved the typedef. */
7272 result
= check_typedef (result
);
7273 if (HAVE_GNAT_AUX_INFO (result
))
7274 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7280 /* If we didn't find a match, see whether this is a packed array. With
7281 older compilers, the descriptive type information is either absent or
7282 irrelevant when it comes to packed arrays so the above lookup fails.
7283 Fall back to using a parallel lookup by name in this case. */
7284 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7285 return ada_find_any_type (name
);
7290 /* Find a parallel type to TYPE with the specified NAME, using the
7291 descriptive type taken from the debugging information, if available,
7292 and otherwise using the (slower) name-based method. */
7294 static struct type
*
7295 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7297 struct type
*result
= NULL
;
7299 if (HAVE_GNAT_AUX_INFO (type
))
7300 result
= find_parallel_type_by_descriptive_type (type
, name
);
7302 result
= ada_find_any_type (name
);
7307 /* Same as above, but specify the name of the parallel type by appending
7308 SUFFIX to the name of TYPE. */
7311 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7314 const char *type_name
= ada_type_name (type
);
7317 if (type_name
== NULL
)
7320 len
= strlen (type_name
);
7322 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7324 strcpy (name
, type_name
);
7325 strcpy (name
+ len
, suffix
);
7327 return ada_find_parallel_type_with_name (type
, name
);
7330 /* If TYPE is a variable-size record type, return the corresponding template
7331 type describing its fields. Otherwise, return NULL. */
7333 static struct type
*
7334 dynamic_template_type (struct type
*type
)
7336 type
= ada_check_typedef (type
);
7338 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7339 || ada_type_name (type
) == NULL
)
7343 int len
= strlen (ada_type_name (type
));
7345 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7348 return ada_find_parallel_type (type
, "___XVE");
7352 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7353 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7356 is_dynamic_field (struct type
*templ_type
, int field_num
)
7358 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7361 && templ_type
->field (field_num
).type ()->code () == TYPE_CODE_PTR
7362 && strstr (name
, "___XVL") != NULL
;
7365 /* The index of the variant field of TYPE, or -1 if TYPE does not
7366 represent a variant record type. */
7369 variant_field_index (struct type
*type
)
7373 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
7376 for (f
= 0; f
< type
->num_fields (); f
+= 1)
7378 if (ada_is_variant_part (type
, f
))
7384 /* A record type with no fields. */
7386 static struct type
*
7387 empty_record (struct type
*templ
)
7389 struct type
*type
= alloc_type_copy (templ
);
7391 type
->set_code (TYPE_CODE_STRUCT
);
7392 INIT_NONE_SPECIFIC (type
);
7393 type
->set_name ("<empty>");
7394 TYPE_LENGTH (type
) = 0;
7398 /* An ordinary record type (with fixed-length fields) that describes
7399 the value of type TYPE at VALADDR or ADDRESS (see comments at
7400 the beginning of this section) VAL according to GNAT conventions.
7401 DVAL0 should describe the (portion of a) record that contains any
7402 necessary discriminants. It should be NULL if value_type (VAL) is
7403 an outer-level type (i.e., as opposed to a branch of a variant.) A
7404 variant field (unless unchecked) is replaced by a particular branch
7407 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7408 length are not statically known are discarded. As a consequence,
7409 VALADDR, ADDRESS and DVAL0 are ignored.
7411 NOTE: Limitations: For now, we assume that dynamic fields and
7412 variants occupy whole numbers of bytes. However, they need not be
7416 ada_template_to_fixed_record_type_1 (struct type
*type
,
7417 const gdb_byte
*valaddr
,
7418 CORE_ADDR address
, struct value
*dval0
,
7419 int keep_dynamic_fields
)
7421 struct value
*mark
= value_mark ();
7424 int nfields
, bit_len
;
7430 /* Compute the number of fields in this record type that are going
7431 to be processed: unless keep_dynamic_fields, this includes only
7432 fields whose position and length are static will be processed. */
7433 if (keep_dynamic_fields
)
7434 nfields
= type
->num_fields ();
7438 while (nfields
< type
->num_fields ()
7439 && !ada_is_variant_part (type
, nfields
)
7440 && !is_dynamic_field (type
, nfields
))
7444 rtype
= alloc_type_copy (type
);
7445 rtype
->set_code (TYPE_CODE_STRUCT
);
7446 INIT_NONE_SPECIFIC (rtype
);
7447 rtype
->set_num_fields (nfields
);
7449 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
7450 rtype
->set_name (ada_type_name (type
));
7451 rtype
->set_is_fixed_instance (true);
7457 for (f
= 0; f
< nfields
; f
+= 1)
7459 off
= align_up (off
, field_alignment (type
, f
))
7460 + TYPE_FIELD_BITPOS (type
, f
);
7461 SET_FIELD_BITPOS (rtype
->field (f
), off
);
7462 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7464 if (ada_is_variant_part (type
, f
))
7469 else if (is_dynamic_field (type
, f
))
7471 const gdb_byte
*field_valaddr
= valaddr
;
7472 CORE_ADDR field_address
= address
;
7473 struct type
*field_type
=
7474 TYPE_TARGET_TYPE (type
->field (f
).type ());
7478 /* rtype's length is computed based on the run-time
7479 value of discriminants. If the discriminants are not
7480 initialized, the type size may be completely bogus and
7481 GDB may fail to allocate a value for it. So check the
7482 size first before creating the value. */
7483 ada_ensure_varsize_limit (rtype
);
7484 /* Using plain value_from_contents_and_address here
7485 causes problems because we will end up trying to
7486 resolve a type that is currently being
7488 dval
= value_from_contents_and_address_unresolved (rtype
,
7491 rtype
= value_type (dval
);
7496 /* If the type referenced by this field is an aligner type, we need
7497 to unwrap that aligner type, because its size might not be set.
7498 Keeping the aligner type would cause us to compute the wrong
7499 size for this field, impacting the offset of the all the fields
7500 that follow this one. */
7501 if (ada_is_aligner_type (field_type
))
7503 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7505 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7506 field_address
= cond_offset_target (field_address
, field_offset
);
7507 field_type
= ada_aligned_type (field_type
);
7510 field_valaddr
= cond_offset_host (field_valaddr
,
7511 off
/ TARGET_CHAR_BIT
);
7512 field_address
= cond_offset_target (field_address
,
7513 off
/ TARGET_CHAR_BIT
);
7515 /* Get the fixed type of the field. Note that, in this case,
7516 we do not want to get the real type out of the tag: if
7517 the current field is the parent part of a tagged record,
7518 we will get the tag of the object. Clearly wrong: the real
7519 type of the parent is not the real type of the child. We
7520 would end up in an infinite loop. */
7521 field_type
= ada_get_base_type (field_type
);
7522 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7523 field_address
, dval
, 0);
7524 /* If the field size is already larger than the maximum
7525 object size, then the record itself will necessarily
7526 be larger than the maximum object size. We need to make
7527 this check now, because the size might be so ridiculously
7528 large (due to an uninitialized variable in the inferior)
7529 that it would cause an overflow when adding it to the
7531 ada_ensure_varsize_limit (field_type
);
7533 rtype
->field (f
).set_type (field_type
);
7534 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7535 /* The multiplication can potentially overflow. But because
7536 the field length has been size-checked just above, and
7537 assuming that the maximum size is a reasonable value,
7538 an overflow should not happen in practice. So rather than
7539 adding overflow recovery code to this already complex code,
7540 we just assume that it's not going to happen. */
7542 TYPE_LENGTH (rtype
->field (f
).type ()) * TARGET_CHAR_BIT
;
7546 /* Note: If this field's type is a typedef, it is important
7547 to preserve the typedef layer.
7549 Otherwise, we might be transforming a typedef to a fat
7550 pointer (encoding a pointer to an unconstrained array),
7551 into a basic fat pointer (encoding an unconstrained
7552 array). As both types are implemented using the same
7553 structure, the typedef is the only clue which allows us
7554 to distinguish between the two options. Stripping it
7555 would prevent us from printing this field appropriately. */
7556 rtype
->field (f
).set_type (type
->field (f
).type ());
7557 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7558 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7560 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7563 struct type
*field_type
= type
->field (f
).type ();
7565 /* We need to be careful of typedefs when computing
7566 the length of our field. If this is a typedef,
7567 get the length of the target type, not the length
7569 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
7570 field_type
= ada_typedef_target_type (field_type
);
7573 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7576 if (off
+ fld_bit_len
> bit_len
)
7577 bit_len
= off
+ fld_bit_len
;
7579 TYPE_LENGTH (rtype
) =
7580 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7583 /* We handle the variant part, if any, at the end because of certain
7584 odd cases in which it is re-ordered so as NOT to be the last field of
7585 the record. This can happen in the presence of representation
7587 if (variant_field
>= 0)
7589 struct type
*branch_type
;
7591 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7595 /* Using plain value_from_contents_and_address here causes
7596 problems because we will end up trying to resolve a type
7597 that is currently being constructed. */
7598 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
7600 rtype
= value_type (dval
);
7606 to_fixed_variant_branch_type
7607 (type
->field (variant_field
).type (),
7608 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7609 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7610 if (branch_type
== NULL
)
7612 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
7613 rtype
->field (f
- 1) = rtype
->field (f
);
7614 rtype
->set_num_fields (rtype
->num_fields () - 1);
7618 rtype
->field (variant_field
).set_type (branch_type
);
7619 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7621 TYPE_LENGTH (rtype
->field (variant_field
).type ()) *
7623 if (off
+ fld_bit_len
> bit_len
)
7624 bit_len
= off
+ fld_bit_len
;
7625 TYPE_LENGTH (rtype
) =
7626 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7630 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7631 should contain the alignment of that record, which should be a strictly
7632 positive value. If null or negative, then something is wrong, most
7633 probably in the debug info. In that case, we don't round up the size
7634 of the resulting type. If this record is not part of another structure,
7635 the current RTYPE length might be good enough for our purposes. */
7636 if (TYPE_LENGTH (type
) <= 0)
7639 warning (_("Invalid type size for `%s' detected: %s."),
7640 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
7642 warning (_("Invalid type size for <unnamed> detected: %s."),
7643 pulongest (TYPE_LENGTH (type
)));
7647 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
7648 TYPE_LENGTH (type
));
7651 value_free_to_mark (mark
);
7652 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7653 error (_("record type with dynamic size is larger than varsize-limit"));
7657 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7660 static struct type
*
7661 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7662 CORE_ADDR address
, struct value
*dval0
)
7664 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7668 /* An ordinary record type in which ___XVL-convention fields and
7669 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7670 static approximations, containing all possible fields. Uses
7671 no runtime values. Useless for use in values, but that's OK,
7672 since the results are used only for type determinations. Works on both
7673 structs and unions. Representation note: to save space, we memorize
7674 the result of this function in the TYPE_TARGET_TYPE of the
7677 static struct type
*
7678 template_to_static_fixed_type (struct type
*type0
)
7684 /* No need no do anything if the input type is already fixed. */
7685 if (type0
->is_fixed_instance ())
7688 /* Likewise if we already have computed the static approximation. */
7689 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7690 return TYPE_TARGET_TYPE (type0
);
7692 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
7694 nfields
= type0
->num_fields ();
7696 /* Whether or not we cloned TYPE0, cache the result so that we don't do
7697 recompute all over next time. */
7698 TYPE_TARGET_TYPE (type0
) = type
;
7700 for (f
= 0; f
< nfields
; f
+= 1)
7702 struct type
*field_type
= type0
->field (f
).type ();
7703 struct type
*new_type
;
7705 if (is_dynamic_field (type0
, f
))
7707 field_type
= ada_check_typedef (field_type
);
7708 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7711 new_type
= static_unwrap_type (field_type
);
7713 if (new_type
!= field_type
)
7715 /* Clone TYPE0 only the first time we get a new field type. */
7718 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
7719 type
->set_code (type0
->code ());
7720 INIT_NONE_SPECIFIC (type
);
7721 type
->set_num_fields (nfields
);
7725 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
7726 memcpy (fields
, type0
->fields (),
7727 sizeof (struct field
) * nfields
);
7728 type
->set_fields (fields
);
7730 type
->set_name (ada_type_name (type0
));
7731 type
->set_is_fixed_instance (true);
7732 TYPE_LENGTH (type
) = 0;
7734 type
->field (f
).set_type (new_type
);
7735 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7742 /* Given an object of type TYPE whose contents are at VALADDR and
7743 whose address in memory is ADDRESS, returns a revision of TYPE,
7744 which should be a non-dynamic-sized record, in which the variant
7745 part, if any, is replaced with the appropriate branch. Looks
7746 for discriminant values in DVAL0, which can be NULL if the record
7747 contains the necessary discriminant values. */
7749 static struct type
*
7750 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7751 CORE_ADDR address
, struct value
*dval0
)
7753 struct value
*mark
= value_mark ();
7756 struct type
*branch_type
;
7757 int nfields
= type
->num_fields ();
7758 int variant_field
= variant_field_index (type
);
7760 if (variant_field
== -1)
7765 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7766 type
= value_type (dval
);
7771 rtype
= alloc_type_copy (type
);
7772 rtype
->set_code (TYPE_CODE_STRUCT
);
7773 INIT_NONE_SPECIFIC (rtype
);
7774 rtype
->set_num_fields (nfields
);
7777 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7778 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
7779 rtype
->set_fields (fields
);
7781 rtype
->set_name (ada_type_name (type
));
7782 rtype
->set_is_fixed_instance (true);
7783 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7785 branch_type
= to_fixed_variant_branch_type
7786 (type
->field (variant_field
).type (),
7787 cond_offset_host (valaddr
,
7788 TYPE_FIELD_BITPOS (type
, variant_field
)
7790 cond_offset_target (address
,
7791 TYPE_FIELD_BITPOS (type
, variant_field
)
7792 / TARGET_CHAR_BIT
), dval
);
7793 if (branch_type
== NULL
)
7797 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7798 rtype
->field (f
- 1) = rtype
->field (f
);
7799 rtype
->set_num_fields (rtype
->num_fields () - 1);
7803 rtype
->field (variant_field
).set_type (branch_type
);
7804 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7805 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7806 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7808 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (type
->field (variant_field
).type ());
7810 value_free_to_mark (mark
);
7814 /* An ordinary record type (with fixed-length fields) that describes
7815 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7816 beginning of this section]. Any necessary discriminants' values
7817 should be in DVAL, a record value; it may be NULL if the object
7818 at ADDR itself contains any necessary discriminant values.
7819 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7820 values from the record are needed. Except in the case that DVAL,
7821 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7822 unchecked) is replaced by a particular branch of the variant.
7824 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7825 is questionable and may be removed. It can arise during the
7826 processing of an unconstrained-array-of-record type where all the
7827 variant branches have exactly the same size. This is because in
7828 such cases, the compiler does not bother to use the XVS convention
7829 when encoding the record. I am currently dubious of this
7830 shortcut and suspect the compiler should be altered. FIXME. */
7832 static struct type
*
7833 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7834 CORE_ADDR address
, struct value
*dval
)
7836 struct type
*templ_type
;
7838 if (type0
->is_fixed_instance ())
7841 templ_type
= dynamic_template_type (type0
);
7843 if (templ_type
!= NULL
)
7844 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7845 else if (variant_field_index (type0
) >= 0)
7847 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7849 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7854 type0
->set_is_fixed_instance (true);
7860 /* An ordinary record type (with fixed-length fields) that describes
7861 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7862 union type. Any necessary discriminants' values should be in DVAL,
7863 a record value. That is, this routine selects the appropriate
7864 branch of the union at ADDR according to the discriminant value
7865 indicated in the union's type name. Returns VAR_TYPE0 itself if
7866 it represents a variant subject to a pragma Unchecked_Union. */
7868 static struct type
*
7869 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7870 CORE_ADDR address
, struct value
*dval
)
7873 struct type
*templ_type
;
7874 struct type
*var_type
;
7876 if (var_type0
->code () == TYPE_CODE_PTR
)
7877 var_type
= TYPE_TARGET_TYPE (var_type0
);
7879 var_type
= var_type0
;
7881 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7883 if (templ_type
!= NULL
)
7884 var_type
= templ_type
;
7886 if (is_unchecked_variant (var_type
, value_type (dval
)))
7888 which
= ada_which_variant_applies (var_type
, dval
);
7891 return empty_record (var_type
);
7892 else if (is_dynamic_field (var_type
, which
))
7893 return to_fixed_record_type
7894 (TYPE_TARGET_TYPE (var_type
->field (which
).type ()),
7895 valaddr
, address
, dval
);
7896 else if (variant_field_index (var_type
->field (which
).type ()) >= 0)
7898 to_fixed_record_type
7899 (var_type
->field (which
).type (), valaddr
, address
, dval
);
7901 return var_type
->field (which
).type ();
7904 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
7905 ENCODING_TYPE, a type following the GNAT conventions for discrete
7906 type encodings, only carries redundant information. */
7909 ada_is_redundant_range_encoding (struct type
*range_type
,
7910 struct type
*encoding_type
)
7912 const char *bounds_str
;
7916 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
7918 if (get_base_type (range_type
)->code ()
7919 != get_base_type (encoding_type
)->code ())
7921 /* The compiler probably used a simple base type to describe
7922 the range type instead of the range's actual base type,
7923 expecting us to get the real base type from the encoding
7924 anyway. In this situation, the encoding cannot be ignored
7929 if (is_dynamic_type (range_type
))
7932 if (encoding_type
->name () == NULL
)
7935 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
7936 if (bounds_str
== NULL
)
7939 n
= 8; /* Skip "___XDLU_". */
7940 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
7942 if (range_type
->bounds ()->low
.const_val () != lo
)
7945 n
+= 2; /* Skip the "__" separator between the two bounds. */
7946 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
7948 if (range_type
->bounds ()->high
.const_val () != hi
)
7954 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
7955 a type following the GNAT encoding for describing array type
7956 indices, only carries redundant information. */
7959 ada_is_redundant_index_type_desc (struct type
*array_type
,
7960 struct type
*desc_type
)
7962 struct type
*this_layer
= check_typedef (array_type
);
7965 for (i
= 0; i
< desc_type
->num_fields (); i
++)
7967 if (!ada_is_redundant_range_encoding (this_layer
->index_type (),
7968 desc_type
->field (i
).type ()))
7970 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
7976 /* Assuming that TYPE0 is an array type describing the type of a value
7977 at ADDR, and that DVAL describes a record containing any
7978 discriminants used in TYPE0, returns a type for the value that
7979 contains no dynamic components (that is, no components whose sizes
7980 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7981 true, gives an error message if the resulting type's size is over
7984 static struct type
*
7985 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7988 struct type
*index_type_desc
;
7989 struct type
*result
;
7990 int constrained_packed_array_p
;
7991 static const char *xa_suffix
= "___XA";
7993 type0
= ada_check_typedef (type0
);
7994 if (type0
->is_fixed_instance ())
7997 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7998 if (constrained_packed_array_p
)
8000 type0
= decode_constrained_packed_array_type (type0
);
8001 if (type0
== nullptr)
8002 error (_("could not decode constrained packed array type"));
8005 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8007 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8008 encoding suffixed with 'P' may still be generated. If so,
8009 it should be used to find the XA type. */
8011 if (index_type_desc
== NULL
)
8013 const char *type_name
= ada_type_name (type0
);
8015 if (type_name
!= NULL
)
8017 const int len
= strlen (type_name
);
8018 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8020 if (type_name
[len
- 1] == 'P')
8022 strcpy (name
, type_name
);
8023 strcpy (name
+ len
- 1, xa_suffix
);
8024 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8029 ada_fixup_array_indexes_type (index_type_desc
);
8030 if (index_type_desc
!= NULL
8031 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8033 /* Ignore this ___XA parallel type, as it does not bring any
8034 useful information. This allows us to avoid creating fixed
8035 versions of the array's index types, which would be identical
8036 to the original ones. This, in turn, can also help avoid
8037 the creation of fixed versions of the array itself. */
8038 index_type_desc
= NULL
;
8041 if (index_type_desc
== NULL
)
8043 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8045 /* NOTE: elt_type---the fixed version of elt_type0---should never
8046 depend on the contents of the array in properly constructed
8048 /* Create a fixed version of the array element type.
8049 We're not providing the address of an element here,
8050 and thus the actual object value cannot be inspected to do
8051 the conversion. This should not be a problem, since arrays of
8052 unconstrained objects are not allowed. In particular, all
8053 the elements of an array of a tagged type should all be of
8054 the same type specified in the debugging info. No need to
8055 consult the object tag. */
8056 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8058 /* Make sure we always create a new array type when dealing with
8059 packed array types, since we're going to fix-up the array
8060 type length and element bitsize a little further down. */
8061 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8064 result
= create_array_type (alloc_type_copy (type0
),
8065 elt_type
, type0
->index_type ());
8070 struct type
*elt_type0
;
8073 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8074 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8076 /* NOTE: result---the fixed version of elt_type0---should never
8077 depend on the contents of the array in properly constructed
8079 /* Create a fixed version of the array element type.
8080 We're not providing the address of an element here,
8081 and thus the actual object value cannot be inspected to do
8082 the conversion. This should not be a problem, since arrays of
8083 unconstrained objects are not allowed. In particular, all
8084 the elements of an array of a tagged type should all be of
8085 the same type specified in the debugging info. No need to
8086 consult the object tag. */
8088 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8091 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8093 struct type
*range_type
=
8094 to_fixed_range_type (index_type_desc
->field (i
).type (), dval
);
8096 result
= create_array_type (alloc_type_copy (elt_type0
),
8097 result
, range_type
);
8098 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8100 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8101 error (_("array type with dynamic size is larger than varsize-limit"));
8104 /* We want to preserve the type name. This can be useful when
8105 trying to get the type name of a value that has already been
8106 printed (for instance, if the user did "print VAR; whatis $". */
8107 result
->set_name (type0
->name ());
8109 if (constrained_packed_array_p
)
8111 /* So far, the resulting type has been created as if the original
8112 type was a regular (non-packed) array type. As a result, the
8113 bitsize of the array elements needs to be set again, and the array
8114 length needs to be recomputed based on that bitsize. */
8115 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8116 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8118 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8119 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8120 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8121 TYPE_LENGTH (result
)++;
8124 result
->set_is_fixed_instance (true);
8129 /* A standard type (containing no dynamically sized components)
8130 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8131 DVAL describes a record containing any discriminants used in TYPE0,
8132 and may be NULL if there are none, or if the object of type TYPE at
8133 ADDRESS or in VALADDR contains these discriminants.
8135 If CHECK_TAG is not null, in the case of tagged types, this function
8136 attempts to locate the object's tag and use it to compute the actual
8137 type. However, when ADDRESS is null, we cannot use it to determine the
8138 location of the tag, and therefore compute the tagged type's actual type.
8139 So we return the tagged type without consulting the tag. */
8141 static struct type
*
8142 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8143 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8145 type
= ada_check_typedef (type
);
8147 /* Only un-fixed types need to be handled here. */
8148 if (!HAVE_GNAT_AUX_INFO (type
))
8151 switch (type
->code ())
8155 case TYPE_CODE_STRUCT
:
8157 struct type
*static_type
= to_static_fixed_type (type
);
8158 struct type
*fixed_record_type
=
8159 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8161 /* If STATIC_TYPE is a tagged type and we know the object's address,
8162 then we can determine its tag, and compute the object's actual
8163 type from there. Note that we have to use the fixed record
8164 type (the parent part of the record may have dynamic fields
8165 and the way the location of _tag is expressed may depend on
8168 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8171 value_tag_from_contents_and_address
8175 struct type
*real_type
= type_from_tag (tag
);
8177 value_from_contents_and_address (fixed_record_type
,
8180 fixed_record_type
= value_type (obj
);
8181 if (real_type
!= NULL
)
8182 return to_fixed_record_type
8184 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8187 /* Check to see if there is a parallel ___XVZ variable.
8188 If there is, then it provides the actual size of our type. */
8189 else if (ada_type_name (fixed_record_type
) != NULL
)
8191 const char *name
= ada_type_name (fixed_record_type
);
8193 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8194 bool xvz_found
= false;
8197 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8200 xvz_found
= get_int_var_value (xvz_name
, size
);
8202 catch (const gdb_exception_error
&except
)
8204 /* We found the variable, but somehow failed to read
8205 its value. Rethrow the same error, but with a little
8206 bit more information, to help the user understand
8207 what went wrong (Eg: the variable might have been
8209 throw_error (except
.error
,
8210 _("unable to read value of %s (%s)"),
8211 xvz_name
, except
.what ());
8214 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8216 fixed_record_type
= copy_type (fixed_record_type
);
8217 TYPE_LENGTH (fixed_record_type
) = size
;
8219 /* The FIXED_RECORD_TYPE may have be a stub. We have
8220 observed this when the debugging info is STABS, and
8221 apparently it is something that is hard to fix.
8223 In practice, we don't need the actual type definition
8224 at all, because the presence of the XVZ variable allows us
8225 to assume that there must be a XVS type as well, which we
8226 should be able to use later, when we need the actual type
8229 In the meantime, pretend that the "fixed" type we are
8230 returning is NOT a stub, because this can cause trouble
8231 when using this type to create new types targeting it.
8232 Indeed, the associated creation routines often check
8233 whether the target type is a stub and will try to replace
8234 it, thus using a type with the wrong size. This, in turn,
8235 might cause the new type to have the wrong size too.
8236 Consider the case of an array, for instance, where the size
8237 of the array is computed from the number of elements in
8238 our array multiplied by the size of its element. */
8239 fixed_record_type
->set_is_stub (false);
8242 return fixed_record_type
;
8244 case TYPE_CODE_ARRAY
:
8245 return to_fixed_array_type (type
, dval
, 1);
8246 case TYPE_CODE_UNION
:
8250 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8254 /* The same as ada_to_fixed_type_1, except that it preserves the type
8255 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8257 The typedef layer needs be preserved in order to differentiate between
8258 arrays and array pointers when both types are implemented using the same
8259 fat pointer. In the array pointer case, the pointer is encoded as
8260 a typedef of the pointer type. For instance, considering:
8262 type String_Access is access String;
8263 S1 : String_Access := null;
8265 To the debugger, S1 is defined as a typedef of type String. But
8266 to the user, it is a pointer. So if the user tries to print S1,
8267 we should not dereference the array, but print the array address
8270 If we didn't preserve the typedef layer, we would lose the fact that
8271 the type is to be presented as a pointer (needs de-reference before
8272 being printed). And we would also use the source-level type name. */
8275 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8276 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8279 struct type
*fixed_type
=
8280 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8282 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8283 then preserve the typedef layer.
8285 Implementation note: We can only check the main-type portion of
8286 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8287 from TYPE now returns a type that has the same instance flags
8288 as TYPE. For instance, if TYPE is a "typedef const", and its
8289 target type is a "struct", then the typedef elimination will return
8290 a "const" version of the target type. See check_typedef for more
8291 details about how the typedef layer elimination is done.
8293 brobecker/2010-11-19: It seems to me that the only case where it is
8294 useful to preserve the typedef layer is when dealing with fat pointers.
8295 Perhaps, we could add a check for that and preserve the typedef layer
8296 only in that situation. But this seems unnecessary so far, probably
8297 because we call check_typedef/ada_check_typedef pretty much everywhere.
8299 if (type
->code () == TYPE_CODE_TYPEDEF
8300 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8301 == TYPE_MAIN_TYPE (fixed_type
)))
8307 /* A standard (static-sized) type corresponding as well as possible to
8308 TYPE0, but based on no runtime data. */
8310 static struct type
*
8311 to_static_fixed_type (struct type
*type0
)
8318 if (type0
->is_fixed_instance ())
8321 type0
= ada_check_typedef (type0
);
8323 switch (type0
->code ())
8327 case TYPE_CODE_STRUCT
:
8328 type
= dynamic_template_type (type0
);
8330 return template_to_static_fixed_type (type
);
8332 return template_to_static_fixed_type (type0
);
8333 case TYPE_CODE_UNION
:
8334 type
= ada_find_parallel_type (type0
, "___XVU");
8336 return template_to_static_fixed_type (type
);
8338 return template_to_static_fixed_type (type0
);
8342 /* A static approximation of TYPE with all type wrappers removed. */
8344 static struct type
*
8345 static_unwrap_type (struct type
*type
)
8347 if (ada_is_aligner_type (type
))
8349 struct type
*type1
= ada_check_typedef (type
)->field (0).type ();
8350 if (ada_type_name (type1
) == NULL
)
8351 type1
->set_name (ada_type_name (type
));
8353 return static_unwrap_type (type1
);
8357 struct type
*raw_real_type
= ada_get_base_type (type
);
8359 if (raw_real_type
== type
)
8362 return to_static_fixed_type (raw_real_type
);
8366 /* In some cases, incomplete and private types require
8367 cross-references that are not resolved as records (for example,
8369 type FooP is access Foo;
8371 type Foo is array ...;
8372 ). In these cases, since there is no mechanism for producing
8373 cross-references to such types, we instead substitute for FooP a
8374 stub enumeration type that is nowhere resolved, and whose tag is
8375 the name of the actual type. Call these types "non-record stubs". */
8377 /* A type equivalent to TYPE that is not a non-record stub, if one
8378 exists, otherwise TYPE. */
8381 ada_check_typedef (struct type
*type
)
8386 /* If our type is an access to an unconstrained array, which is encoded
8387 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
8388 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8389 what allows us to distinguish between fat pointers that represent
8390 array types, and fat pointers that represent array access types
8391 (in both cases, the compiler implements them as fat pointers). */
8392 if (ada_is_access_to_unconstrained_array (type
))
8395 type
= check_typedef (type
);
8396 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
8397 || !type
->is_stub ()
8398 || type
->name () == NULL
)
8402 const char *name
= type
->name ();
8403 struct type
*type1
= ada_find_any_type (name
);
8408 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8409 stubs pointing to arrays, as we don't create symbols for array
8410 types, only for the typedef-to-array types). If that's the case,
8411 strip the typedef layer. */
8412 if (type1
->code () == TYPE_CODE_TYPEDEF
)
8413 type1
= ada_check_typedef (type1
);
8419 /* A value representing the data at VALADDR/ADDRESS as described by
8420 type TYPE0, but with a standard (static-sized) type that correctly
8421 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8422 type, then return VAL0 [this feature is simply to avoid redundant
8423 creation of struct values]. */
8425 static struct value
*
8426 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8429 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8431 if (type
== type0
&& val0
!= NULL
)
8434 if (VALUE_LVAL (val0
) != lval_memory
)
8436 /* Our value does not live in memory; it could be a convenience
8437 variable, for instance. Create a not_lval value using val0's
8439 return value_from_contents (type
, value_contents (val0
));
8442 return value_from_contents_and_address (type
, 0, address
);
8445 /* A value representing VAL, but with a standard (static-sized) type
8446 that correctly describes it. Does not necessarily create a new
8450 ada_to_fixed_value (struct value
*val
)
8452 val
= unwrap_value (val
);
8453 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
8460 /* Table mapping attribute numbers to names.
8461 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8463 static const char * const attribute_names
[] = {
8481 ada_attribute_name (enum exp_opcode n
)
8483 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8484 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8486 return attribute_names
[0];
8489 /* Evaluate the 'POS attribute applied to ARG. */
8492 pos_atr (struct value
*arg
)
8494 struct value
*val
= coerce_ref (arg
);
8495 struct type
*type
= value_type (val
);
8497 if (!discrete_type_p (type
))
8498 error (_("'POS only defined on discrete types"));
8500 gdb::optional
<LONGEST
> result
= discrete_position (type
, value_as_long (val
));
8501 if (!result
.has_value ())
8502 error (_("enumeration value is invalid: can't find 'POS"));
8508 ada_pos_atr (struct type
*expect_type
,
8509 struct expression
*exp
,
8510 enum noside noside
, enum exp_opcode op
,
8513 struct type
*type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8514 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8515 return value_zero (type
, not_lval
);
8516 return value_from_longest (type
, pos_atr (arg
));
8519 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8521 static struct value
*
8522 val_atr (struct type
*type
, LONGEST val
)
8524 gdb_assert (discrete_type_p (type
));
8525 if (type
->code () == TYPE_CODE_RANGE
)
8526 type
= TYPE_TARGET_TYPE (type
);
8527 if (type
->code () == TYPE_CODE_ENUM
)
8529 if (val
< 0 || val
>= type
->num_fields ())
8530 error (_("argument to 'VAL out of range"));
8531 val
= TYPE_FIELD_ENUMVAL (type
, val
);
8533 return value_from_longest (type
, val
);
8537 ada_val_atr (enum noside noside
, struct type
*type
, struct value
*arg
)
8539 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8540 return value_zero (type
, not_lval
);
8542 if (!discrete_type_p (type
))
8543 error (_("'VAL only defined on discrete types"));
8544 if (!integer_type_p (value_type (arg
)))
8545 error (_("'VAL requires integral argument"));
8547 return val_atr (type
, value_as_long (arg
));
8553 /* True if TYPE appears to be an Ada character type.
8554 [At the moment, this is true only for Character and Wide_Character;
8555 It is a heuristic test that could stand improvement]. */
8558 ada_is_character_type (struct type
*type
)
8562 /* If the type code says it's a character, then assume it really is,
8563 and don't check any further. */
8564 if (type
->code () == TYPE_CODE_CHAR
)
8567 /* Otherwise, assume it's a character type iff it is a discrete type
8568 with a known character type name. */
8569 name
= ada_type_name (type
);
8570 return (name
!= NULL
8571 && (type
->code () == TYPE_CODE_INT
8572 || type
->code () == TYPE_CODE_RANGE
)
8573 && (strcmp (name
, "character") == 0
8574 || strcmp (name
, "wide_character") == 0
8575 || strcmp (name
, "wide_wide_character") == 0
8576 || strcmp (name
, "unsigned char") == 0));
8579 /* True if TYPE appears to be an Ada string type. */
8582 ada_is_string_type (struct type
*type
)
8584 type
= ada_check_typedef (type
);
8586 && type
->code () != TYPE_CODE_PTR
8587 && (ada_is_simple_array_type (type
)
8588 || ada_is_array_descriptor_type (type
))
8589 && ada_array_arity (type
) == 1)
8591 struct type
*elttype
= ada_array_element_type (type
, 1);
8593 return ada_is_character_type (elttype
);
8599 /* The compiler sometimes provides a parallel XVS type for a given
8600 PAD type. Normally, it is safe to follow the PAD type directly,
8601 but older versions of the compiler have a bug that causes the offset
8602 of its "F" field to be wrong. Following that field in that case
8603 would lead to incorrect results, but this can be worked around
8604 by ignoring the PAD type and using the associated XVS type instead.
8606 Set to True if the debugger should trust the contents of PAD types.
8607 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8608 static bool trust_pad_over_xvs
= true;
8610 /* True if TYPE is a struct type introduced by the compiler to force the
8611 alignment of a value. Such types have a single field with a
8612 distinctive name. */
8615 ada_is_aligner_type (struct type
*type
)
8617 type
= ada_check_typedef (type
);
8619 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8622 return (type
->code () == TYPE_CODE_STRUCT
8623 && type
->num_fields () == 1
8624 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8627 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8628 the parallel type. */
8631 ada_get_base_type (struct type
*raw_type
)
8633 struct type
*real_type_namer
;
8634 struct type
*raw_real_type
;
8636 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
8639 if (ada_is_aligner_type (raw_type
))
8640 /* The encoding specifies that we should always use the aligner type.
8641 So, even if this aligner type has an associated XVS type, we should
8644 According to the compiler gurus, an XVS type parallel to an aligner
8645 type may exist because of a stabs limitation. In stabs, aligner
8646 types are empty because the field has a variable-sized type, and
8647 thus cannot actually be used as an aligner type. As a result,
8648 we need the associated parallel XVS type to decode the type.
8649 Since the policy in the compiler is to not change the internal
8650 representation based on the debugging info format, we sometimes
8651 end up having a redundant XVS type parallel to the aligner type. */
8654 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8655 if (real_type_namer
== NULL
8656 || real_type_namer
->code () != TYPE_CODE_STRUCT
8657 || real_type_namer
->num_fields () != 1)
8660 if (real_type_namer
->field (0).type ()->code () != TYPE_CODE_REF
)
8662 /* This is an older encoding form where the base type needs to be
8663 looked up by name. We prefer the newer encoding because it is
8665 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8666 if (raw_real_type
== NULL
)
8669 return raw_real_type
;
8672 /* The field in our XVS type is a reference to the base type. */
8673 return TYPE_TARGET_TYPE (real_type_namer
->field (0).type ());
8676 /* The type of value designated by TYPE, with all aligners removed. */
8679 ada_aligned_type (struct type
*type
)
8681 if (ada_is_aligner_type (type
))
8682 return ada_aligned_type (type
->field (0).type ());
8684 return ada_get_base_type (type
);
8688 /* The address of the aligned value in an object at address VALADDR
8689 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8692 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8694 if (ada_is_aligner_type (type
))
8695 return ada_aligned_value_addr (type
->field (0).type (),
8697 TYPE_FIELD_BITPOS (type
,
8698 0) / TARGET_CHAR_BIT
);
8705 /* The printed representation of an enumeration literal with encoded
8706 name NAME. The value is good to the next call of ada_enum_name. */
8708 ada_enum_name (const char *name
)
8710 static std::string storage
;
8713 /* First, unqualify the enumeration name:
8714 1. Search for the last '.' character. If we find one, then skip
8715 all the preceding characters, the unqualified name starts
8716 right after that dot.
8717 2. Otherwise, we may be debugging on a target where the compiler
8718 translates dots into "__". Search forward for double underscores,
8719 but stop searching when we hit an overloading suffix, which is
8720 of the form "__" followed by digits. */
8722 tmp
= strrchr (name
, '.');
8727 while ((tmp
= strstr (name
, "__")) != NULL
)
8729 if (isdigit (tmp
[2]))
8740 if (name
[1] == 'U' || name
[1] == 'W')
8742 if (sscanf (name
+ 2, "%x", &v
) != 1)
8745 else if (((name
[1] >= '0' && name
[1] <= '9')
8746 || (name
[1] >= 'a' && name
[1] <= 'z'))
8749 storage
= string_printf ("'%c'", name
[1]);
8750 return storage
.c_str ();
8755 if (isascii (v
) && isprint (v
))
8756 storage
= string_printf ("'%c'", v
);
8757 else if (name
[1] == 'U')
8758 storage
= string_printf ("[\"%02x\"]", v
);
8760 storage
= string_printf ("[\"%04x\"]", v
);
8762 return storage
.c_str ();
8766 tmp
= strstr (name
, "__");
8768 tmp
= strstr (name
, "$");
8771 storage
= std::string (name
, tmp
- name
);
8772 return storage
.c_str ();
8779 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8782 static struct value
*
8783 unwrap_value (struct value
*val
)
8785 struct type
*type
= ada_check_typedef (value_type (val
));
8787 if (ada_is_aligner_type (type
))
8789 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
8790 struct type
*val_type
= ada_check_typedef (value_type (v
));
8792 if (ada_type_name (val_type
) == NULL
)
8793 val_type
->set_name (ada_type_name (type
));
8795 return unwrap_value (v
);
8799 struct type
*raw_real_type
=
8800 ada_check_typedef (ada_get_base_type (type
));
8802 /* If there is no parallel XVS or XVE type, then the value is
8803 already unwrapped. Return it without further modification. */
8804 if ((type
== raw_real_type
)
8805 && ada_find_parallel_type (type
, "___XVE") == NULL
)
8809 coerce_unspec_val_to_type
8810 (val
, ada_to_fixed_type (raw_real_type
, 0,
8811 value_address (val
),
8816 /* Given two array types T1 and T2, return nonzero iff both arrays
8817 contain the same number of elements. */
8820 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
8822 LONGEST lo1
, hi1
, lo2
, hi2
;
8824 /* Get the array bounds in order to verify that the size of
8825 the two arrays match. */
8826 if (!get_array_bounds (t1
, &lo1
, &hi1
)
8827 || !get_array_bounds (t2
, &lo2
, &hi2
))
8828 error (_("unable to determine array bounds"));
8830 /* To make things easier for size comparison, normalize a bit
8831 the case of empty arrays by making sure that the difference
8832 between upper bound and lower bound is always -1. */
8838 return (hi1
- lo1
== hi2
- lo2
);
8841 /* Assuming that VAL is an array of integrals, and TYPE represents
8842 an array with the same number of elements, but with wider integral
8843 elements, return an array "casted" to TYPE. In practice, this
8844 means that the returned array is built by casting each element
8845 of the original array into TYPE's (wider) element type. */
8847 static struct value
*
8848 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
8850 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
8855 /* Verify that both val and type are arrays of scalars, and
8856 that the size of val's elements is smaller than the size
8857 of type's element. */
8858 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
8859 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
8860 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
8861 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
8862 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
8863 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
8865 if (!get_array_bounds (type
, &lo
, &hi
))
8866 error (_("unable to determine array bounds"));
8868 res
= allocate_value (type
);
8870 /* Promote each array element. */
8871 for (i
= 0; i
< hi
- lo
+ 1; i
++)
8873 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
8875 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
8876 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
8882 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8883 return the converted value. */
8885 static struct value
*
8886 coerce_for_assign (struct type
*type
, struct value
*val
)
8888 struct type
*type2
= value_type (val
);
8893 type2
= ada_check_typedef (type2
);
8894 type
= ada_check_typedef (type
);
8896 if (type2
->code () == TYPE_CODE_PTR
8897 && type
->code () == TYPE_CODE_ARRAY
)
8899 val
= ada_value_ind (val
);
8900 type2
= value_type (val
);
8903 if (type2
->code () == TYPE_CODE_ARRAY
8904 && type
->code () == TYPE_CODE_ARRAY
)
8906 if (!ada_same_array_size_p (type
, type2
))
8907 error (_("cannot assign arrays of different length"));
8909 if (is_integral_type (TYPE_TARGET_TYPE (type
))
8910 && is_integral_type (TYPE_TARGET_TYPE (type2
))
8911 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8912 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
8914 /* Allow implicit promotion of the array elements to
8916 return ada_promote_array_of_integrals (type
, val
);
8919 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8920 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
8921 error (_("Incompatible types in assignment"));
8922 deprecated_set_value_type (val
, type
);
8927 static struct value
*
8928 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8931 struct type
*type1
, *type2
;
8934 arg1
= coerce_ref (arg1
);
8935 arg2
= coerce_ref (arg2
);
8936 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
8937 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
8939 if (type1
->code () != TYPE_CODE_INT
8940 || type2
->code () != TYPE_CODE_INT
)
8941 return value_binop (arg1
, arg2
, op
);
8950 return value_binop (arg1
, arg2
, op
);
8953 v2
= value_as_long (arg2
);
8957 if (op
== BINOP_MOD
)
8959 else if (op
== BINOP_DIV
)
8963 gdb_assert (op
== BINOP_REM
);
8967 error (_("second operand of %s must not be zero."), name
);
8970 if (type1
->is_unsigned () || op
== BINOP_MOD
)
8971 return value_binop (arg1
, arg2
, op
);
8973 v1
= value_as_long (arg1
);
8978 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8979 v
+= v
> 0 ? -1 : 1;
8987 /* Should not reach this point. */
8991 val
= allocate_value (type1
);
8992 store_unsigned_integer (value_contents_raw (val
),
8993 TYPE_LENGTH (value_type (val
)),
8994 type_byte_order (type1
), v
);
8999 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9001 if (ada_is_direct_array_type (value_type (arg1
))
9002 || ada_is_direct_array_type (value_type (arg2
)))
9004 struct type
*arg1_type
, *arg2_type
;
9006 /* Automatically dereference any array reference before
9007 we attempt to perform the comparison. */
9008 arg1
= ada_coerce_ref (arg1
);
9009 arg2
= ada_coerce_ref (arg2
);
9011 arg1
= ada_coerce_to_simple_array (arg1
);
9012 arg2
= ada_coerce_to_simple_array (arg2
);
9014 arg1_type
= ada_check_typedef (value_type (arg1
));
9015 arg2_type
= ada_check_typedef (value_type (arg2
));
9017 if (arg1_type
->code () != TYPE_CODE_ARRAY
9018 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9019 error (_("Attempt to compare array with non-array"));
9020 /* FIXME: The following works only for types whose
9021 representations use all bits (no padding or undefined bits)
9022 and do not have user-defined equality. */
9023 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9024 && memcmp (value_contents (arg1
), value_contents (arg2
),
9025 TYPE_LENGTH (arg1_type
)) == 0);
9027 return value_equal (arg1
, arg2
);
9034 check_objfile (const std::unique_ptr
<ada_component
> &comp
,
9035 struct objfile
*objfile
)
9037 return comp
->uses_objfile (objfile
);
9040 /* Assign the result of evaluating ARG starting at *POS to the INDEXth
9041 component of LHS (a simple array or a record). Does not modify the
9042 inferior's memory, nor does it modify LHS (unless LHS ==
9046 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9047 struct expression
*exp
, operation_up
&arg
)
9049 scoped_value_mark mark
;
9052 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9054 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9056 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9057 struct value
*index_val
= value_from_longest (index_type
, index
);
9059 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9063 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9064 elt
= ada_to_fixed_value (elt
);
9067 ada_aggregate_operation
*ag_op
9068 = dynamic_cast<ada_aggregate_operation
*> (arg
.get ());
9069 if (ag_op
!= nullptr)
9070 ag_op
->assign_aggregate (container
, elt
, exp
);
9072 value_assign_to_component (container
, elt
,
9073 arg
->evaluate (nullptr, exp
,
9078 ada_aggregate_component::uses_objfile (struct objfile
*objfile
)
9080 for (const auto &item
: m_components
)
9081 if (item
->uses_objfile (objfile
))
9087 ada_aggregate_component::dump (ui_file
*stream
, int depth
)
9089 fprintf_filtered (stream
, _("%*sAggregate\n"), depth
, "");
9090 for (const auto &item
: m_components
)
9091 item
->dump (stream
, depth
+ 1);
9095 ada_aggregate_component::assign (struct value
*container
,
9096 struct value
*lhs
, struct expression
*exp
,
9097 std::vector
<LONGEST
> &indices
,
9098 LONGEST low
, LONGEST high
)
9100 for (auto &item
: m_components
)
9101 item
->assign (container
, lhs
, exp
, indices
, low
, high
);
9104 /* Assuming that LHS represents an lvalue having a record or array
9105 type, evaluate an assignment of this aggregate's value to LHS.
9106 CONTAINER is an lvalue containing LHS (possibly LHS itself). Does
9107 not modify the inferior's memory, nor does it modify the contents
9108 of LHS (unless == CONTAINER). */
9111 ada_aggregate_operation::assign_aggregate (struct value
*container
,
9113 struct expression
*exp
)
9115 struct type
*lhs_type
;
9116 LONGEST low_index
, high_index
;
9118 container
= ada_coerce_ref (container
);
9119 if (ada_is_direct_array_type (value_type (container
)))
9120 container
= ada_coerce_to_simple_array (container
);
9121 lhs
= ada_coerce_ref (lhs
);
9122 if (!deprecated_value_modifiable (lhs
))
9123 error (_("Left operand of assignment is not a modifiable lvalue."));
9125 lhs_type
= check_typedef (value_type (lhs
));
9126 if (ada_is_direct_array_type (lhs_type
))
9128 lhs
= ada_coerce_to_simple_array (lhs
);
9129 lhs_type
= check_typedef (value_type (lhs
));
9130 low_index
= lhs_type
->bounds ()->low
.const_val ();
9131 high_index
= lhs_type
->bounds ()->high
.const_val ();
9133 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9136 high_index
= num_visible_fields (lhs_type
) - 1;
9139 error (_("Left-hand side must be array or record."));
9141 std::vector
<LONGEST
> indices (4);
9142 indices
[0] = indices
[1] = low_index
- 1;
9143 indices
[2] = indices
[3] = high_index
+ 1;
9145 std::get
<0> (m_storage
)->assign (container
, lhs
, exp
, indices
,
9146 low_index
, high_index
);
9150 ada_positional_component::uses_objfile (struct objfile
*objfile
)
9152 return m_op
->uses_objfile (objfile
);
9156 ada_positional_component::dump (ui_file
*stream
, int depth
)
9158 fprintf_filtered (stream
, _("%*sPositional, index = %d\n"),
9159 depth
, "", m_index
);
9160 m_op
->dump (stream
, depth
+ 1);
9163 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9164 construct, given that the positions are relative to lower bound
9165 LOW, where HIGH is the upper bound. Record the position in
9166 INDICES. CONTAINER is as for assign_aggregate. */
9168 ada_positional_component::assign (struct value
*container
,
9169 struct value
*lhs
, struct expression
*exp
,
9170 std::vector
<LONGEST
> &indices
,
9171 LONGEST low
, LONGEST high
)
9173 LONGEST ind
= m_index
+ low
;
9175 if (ind
- 1 == high
)
9176 warning (_("Extra components in aggregate ignored."));
9179 add_component_interval (ind
, ind
, indices
);
9180 assign_component (container
, lhs
, ind
, exp
, m_op
);
9185 ada_discrete_range_association::uses_objfile (struct objfile
*objfile
)
9187 return m_low
->uses_objfile (objfile
) || m_high
->uses_objfile (objfile
);
9191 ada_discrete_range_association::dump (ui_file
*stream
, int depth
)
9193 fprintf_filtered (stream
, _("%*sDiscrete range:\n"), depth
, "");
9194 m_low
->dump (stream
, depth
+ 1);
9195 m_high
->dump (stream
, depth
+ 1);
9199 ada_discrete_range_association::assign (struct value
*container
,
9201 struct expression
*exp
,
9202 std::vector
<LONGEST
> &indices
,
9203 LONGEST low
, LONGEST high
,
9206 LONGEST lower
= value_as_long (m_low
->evaluate (nullptr, exp
, EVAL_NORMAL
));
9207 LONGEST upper
= value_as_long (m_high
->evaluate (nullptr, exp
, EVAL_NORMAL
));
9209 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9210 error (_("Index in component association out of bounds."));
9212 add_component_interval (lower
, upper
, indices
);
9213 while (lower
<= upper
)
9215 assign_component (container
, lhs
, lower
, exp
, op
);
9221 ada_name_association::uses_objfile (struct objfile
*objfile
)
9223 return m_val
->uses_objfile (objfile
);
9227 ada_name_association::dump (ui_file
*stream
, int depth
)
9229 fprintf_filtered (stream
, _("%*sName:\n"), depth
, "");
9230 m_val
->dump (stream
, depth
+ 1);
9234 ada_name_association::assign (struct value
*container
,
9236 struct expression
*exp
,
9237 std::vector
<LONGEST
> &indices
,
9238 LONGEST low
, LONGEST high
,
9243 if (ada_is_direct_array_type (value_type (lhs
)))
9244 index
= longest_to_int (value_as_long (m_val
->evaluate (nullptr, exp
,
9248 ada_string_operation
*strop
9249 = dynamic_cast<ada_string_operation
*> (m_val
.get ());
9252 if (strop
!= nullptr)
9253 name
= strop
->get_name ();
9256 ada_var_value_operation
*vvo
9257 = dynamic_cast<ada_var_value_operation
*> (m_val
.get ());
9259 error (_("Invalid record component association."));
9260 name
= vvo
->get_symbol ()->natural_name ();
9264 if (! find_struct_field (name
, value_type (lhs
), 0,
9265 NULL
, NULL
, NULL
, NULL
, &index
))
9266 error (_("Unknown component name: %s."), name
);
9269 add_component_interval (index
, index
, indices
);
9270 assign_component (container
, lhs
, index
, exp
, op
);
9274 ada_choices_component::uses_objfile (struct objfile
*objfile
)
9276 if (m_op
->uses_objfile (objfile
))
9278 for (const auto &item
: m_assocs
)
9279 if (item
->uses_objfile (objfile
))
9285 ada_choices_component::dump (ui_file
*stream
, int depth
)
9287 fprintf_filtered (stream
, _("%*sChoices:\n"), depth
, "");
9288 m_op
->dump (stream
, depth
+ 1);
9289 for (const auto &item
: m_assocs
)
9290 item
->dump (stream
, depth
+ 1);
9293 /* Assign into the components of LHS indexed by the OP_CHOICES
9294 construct at *POS, updating *POS past the construct, given that
9295 the allowable indices are LOW..HIGH. Record the indices assigned
9296 to in INDICES. CONTAINER is as for assign_aggregate. */
9298 ada_choices_component::assign (struct value
*container
,
9299 struct value
*lhs
, struct expression
*exp
,
9300 std::vector
<LONGEST
> &indices
,
9301 LONGEST low
, LONGEST high
)
9303 for (auto &item
: m_assocs
)
9304 item
->assign (container
, lhs
, exp
, indices
, low
, high
, m_op
);
9308 ada_others_component::uses_objfile (struct objfile
*objfile
)
9310 return m_op
->uses_objfile (objfile
);
9314 ada_others_component::dump (ui_file
*stream
, int depth
)
9316 fprintf_filtered (stream
, _("%*sOthers:\n"), depth
, "");
9317 m_op
->dump (stream
, depth
+ 1);
9320 /* Assign the value of the expression in the OP_OTHERS construct in
9321 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9322 have not been previously assigned. The index intervals already assigned
9323 are in INDICES. CONTAINER is as for assign_aggregate. */
9325 ada_others_component::assign (struct value
*container
,
9326 struct value
*lhs
, struct expression
*exp
,
9327 std::vector
<LONGEST
> &indices
,
9328 LONGEST low
, LONGEST high
)
9330 int num_indices
= indices
.size ();
9331 for (int i
= 0; i
< num_indices
- 2; i
+= 2)
9333 for (LONGEST ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9334 assign_component (container
, lhs
, ind
, exp
, m_op
);
9339 ada_assign_operation::evaluate (struct type
*expect_type
,
9340 struct expression
*exp
,
9343 value
*arg1
= std::get
<0> (m_storage
)->evaluate (nullptr, exp
, noside
);
9345 ada_aggregate_operation
*ag_op
9346 = dynamic_cast<ada_aggregate_operation
*> (std::get
<1> (m_storage
).get ());
9347 if (ag_op
!= nullptr)
9349 if (noside
!= EVAL_NORMAL
)
9352 ag_op
->assign_aggregate (arg1
, arg1
, exp
);
9353 return ada_value_assign (arg1
, arg1
);
9355 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9356 except if the lhs of our assignment is a convenience variable.
9357 In the case of assigning to a convenience variable, the lhs
9358 should be exactly the result of the evaluation of the rhs. */
9359 struct type
*type
= value_type (arg1
);
9360 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9362 value
*arg2
= std::get
<1> (m_storage
)->evaluate (type
, exp
, noside
);
9363 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9365 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9370 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
9371 return ada_value_assign (arg1
, arg2
);
9374 } /* namespace expr */
9376 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9377 [ INDICES[0] .. INDICES[1] ],... The resulting intervals do not
9380 add_component_interval (LONGEST low
, LONGEST high
,
9381 std::vector
<LONGEST
> &indices
)
9385 int size
= indices
.size ();
9386 for (i
= 0; i
< size
; i
+= 2) {
9387 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9391 for (kh
= i
+ 2; kh
< size
; kh
+= 2)
9392 if (high
< indices
[kh
])
9394 if (low
< indices
[i
])
9396 indices
[i
+ 1] = indices
[kh
- 1];
9397 if (high
> indices
[i
+ 1])
9398 indices
[i
+ 1] = high
;
9399 memcpy (indices
.data () + i
+ 2, indices
.data () + kh
, size
- kh
);
9400 indices
.resize (kh
- i
- 2);
9403 else if (high
< indices
[i
])
9407 indices
.resize (indices
.size () + 2);
9408 for (j
= indices
.size () - 1; j
>= i
+ 2; j
-= 1)
9409 indices
[j
] = indices
[j
- 2];
9411 indices
[i
+ 1] = high
;
9414 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9417 static struct value
*
9418 ada_value_cast (struct type
*type
, struct value
*arg2
)
9420 if (type
== ada_check_typedef (value_type (arg2
)))
9423 return value_cast (type
, arg2
);
9426 /* Evaluating Ada expressions, and printing their result.
9427 ------------------------------------------------------
9432 We usually evaluate an Ada expression in order to print its value.
9433 We also evaluate an expression in order to print its type, which
9434 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9435 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9436 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9437 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9440 Evaluating expressions is a little more complicated for Ada entities
9441 than it is for entities in languages such as C. The main reason for
9442 this is that Ada provides types whose definition might be dynamic.
9443 One example of such types is variant records. Or another example
9444 would be an array whose bounds can only be known at run time.
9446 The following description is a general guide as to what should be
9447 done (and what should NOT be done) in order to evaluate an expression
9448 involving such types, and when. This does not cover how the semantic
9449 information is encoded by GNAT as this is covered separatly. For the
9450 document used as the reference for the GNAT encoding, see exp_dbug.ads
9451 in the GNAT sources.
9453 Ideally, we should embed each part of this description next to its
9454 associated code. Unfortunately, the amount of code is so vast right
9455 now that it's hard to see whether the code handling a particular
9456 situation might be duplicated or not. One day, when the code is
9457 cleaned up, this guide might become redundant with the comments
9458 inserted in the code, and we might want to remove it.
9460 2. ``Fixing'' an Entity, the Simple Case:
9461 -----------------------------------------
9463 When evaluating Ada expressions, the tricky issue is that they may
9464 reference entities whose type contents and size are not statically
9465 known. Consider for instance a variant record:
9467 type Rec (Empty : Boolean := True) is record
9470 when False => Value : Integer;
9473 Yes : Rec := (Empty => False, Value => 1);
9474 No : Rec := (empty => True);
9476 The size and contents of that record depends on the value of the
9477 descriminant (Rec.Empty). At this point, neither the debugging
9478 information nor the associated type structure in GDB are able to
9479 express such dynamic types. So what the debugger does is to create
9480 "fixed" versions of the type that applies to the specific object.
9481 We also informally refer to this operation as "fixing" an object,
9482 which means creating its associated fixed type.
9484 Example: when printing the value of variable "Yes" above, its fixed
9485 type would look like this:
9492 On the other hand, if we printed the value of "No", its fixed type
9499 Things become a little more complicated when trying to fix an entity
9500 with a dynamic type that directly contains another dynamic type,
9501 such as an array of variant records, for instance. There are
9502 two possible cases: Arrays, and records.
9504 3. ``Fixing'' Arrays:
9505 ---------------------
9507 The type structure in GDB describes an array in terms of its bounds,
9508 and the type of its elements. By design, all elements in the array
9509 have the same type and we cannot represent an array of variant elements
9510 using the current type structure in GDB. When fixing an array,
9511 we cannot fix the array element, as we would potentially need one
9512 fixed type per element of the array. As a result, the best we can do
9513 when fixing an array is to produce an array whose bounds and size
9514 are correct (allowing us to read it from memory), but without having
9515 touched its element type. Fixing each element will be done later,
9516 when (if) necessary.
9518 Arrays are a little simpler to handle than records, because the same
9519 amount of memory is allocated for each element of the array, even if
9520 the amount of space actually used by each element differs from element
9521 to element. Consider for instance the following array of type Rec:
9523 type Rec_Array is array (1 .. 2) of Rec;
9525 The actual amount of memory occupied by each element might be different
9526 from element to element, depending on the value of their discriminant.
9527 But the amount of space reserved for each element in the array remains
9528 fixed regardless. So we simply need to compute that size using
9529 the debugging information available, from which we can then determine
9530 the array size (we multiply the number of elements of the array by
9531 the size of each element).
9533 The simplest case is when we have an array of a constrained element
9534 type. For instance, consider the following type declarations:
9536 type Bounded_String (Max_Size : Integer) is
9538 Buffer : String (1 .. Max_Size);
9540 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9542 In this case, the compiler describes the array as an array of
9543 variable-size elements (identified by its XVS suffix) for which
9544 the size can be read in the parallel XVZ variable.
9546 In the case of an array of an unconstrained element type, the compiler
9547 wraps the array element inside a private PAD type. This type should not
9548 be shown to the user, and must be "unwrap"'ed before printing. Note
9549 that we also use the adjective "aligner" in our code to designate
9550 these wrapper types.
9552 In some cases, the size allocated for each element is statically
9553 known. In that case, the PAD type already has the correct size,
9554 and the array element should remain unfixed.
9556 But there are cases when this size is not statically known.
9557 For instance, assuming that "Five" is an integer variable:
9559 type Dynamic is array (1 .. Five) of Integer;
9560 type Wrapper (Has_Length : Boolean := False) is record
9563 when True => Length : Integer;
9567 type Wrapper_Array is array (1 .. 2) of Wrapper;
9569 Hello : Wrapper_Array := (others => (Has_Length => True,
9570 Data => (others => 17),
9574 The debugging info would describe variable Hello as being an
9575 array of a PAD type. The size of that PAD type is not statically
9576 known, but can be determined using a parallel XVZ variable.
9577 In that case, a copy of the PAD type with the correct size should
9578 be used for the fixed array.
9580 3. ``Fixing'' record type objects:
9581 ----------------------------------
9583 Things are slightly different from arrays in the case of dynamic
9584 record types. In this case, in order to compute the associated
9585 fixed type, we need to determine the size and offset of each of
9586 its components. This, in turn, requires us to compute the fixed
9587 type of each of these components.
9589 Consider for instance the example:
9591 type Bounded_String (Max_Size : Natural) is record
9592 Str : String (1 .. Max_Size);
9595 My_String : Bounded_String (Max_Size => 10);
9597 In that case, the position of field "Length" depends on the size
9598 of field Str, which itself depends on the value of the Max_Size
9599 discriminant. In order to fix the type of variable My_String,
9600 we need to fix the type of field Str. Therefore, fixing a variant
9601 record requires us to fix each of its components.
9603 However, if a component does not have a dynamic size, the component
9604 should not be fixed. In particular, fields that use a PAD type
9605 should not fixed. Here is an example where this might happen
9606 (assuming type Rec above):
9608 type Container (Big : Boolean) is record
9612 when True => Another : Integer;
9616 My_Container : Container := (Big => False,
9617 First => (Empty => True),
9620 In that example, the compiler creates a PAD type for component First,
9621 whose size is constant, and then positions the component After just
9622 right after it. The offset of component After is therefore constant
9625 The debugger computes the position of each field based on an algorithm
9626 that uses, among other things, the actual position and size of the field
9627 preceding it. Let's now imagine that the user is trying to print
9628 the value of My_Container. If the type fixing was recursive, we would
9629 end up computing the offset of field After based on the size of the
9630 fixed version of field First. And since in our example First has
9631 only one actual field, the size of the fixed type is actually smaller
9632 than the amount of space allocated to that field, and thus we would
9633 compute the wrong offset of field After.
9635 To make things more complicated, we need to watch out for dynamic
9636 components of variant records (identified by the ___XVL suffix in
9637 the component name). Even if the target type is a PAD type, the size
9638 of that type might not be statically known. So the PAD type needs
9639 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9640 we might end up with the wrong size for our component. This can be
9641 observed with the following type declarations:
9643 type Octal is new Integer range 0 .. 7;
9644 type Octal_Array is array (Positive range <>) of Octal;
9645 pragma Pack (Octal_Array);
9647 type Octal_Buffer (Size : Positive) is record
9648 Buffer : Octal_Array (1 .. Size);
9652 In that case, Buffer is a PAD type whose size is unset and needs
9653 to be computed by fixing the unwrapped type.
9655 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9656 ----------------------------------------------------------
9658 Lastly, when should the sub-elements of an entity that remained unfixed
9659 thus far, be actually fixed?
9661 The answer is: Only when referencing that element. For instance
9662 when selecting one component of a record, this specific component
9663 should be fixed at that point in time. Or when printing the value
9664 of a record, each component should be fixed before its value gets
9665 printed. Similarly for arrays, the element of the array should be
9666 fixed when printing each element of the array, or when extracting
9667 one element out of that array. On the other hand, fixing should
9668 not be performed on the elements when taking a slice of an array!
9670 Note that one of the side effects of miscomputing the offset and
9671 size of each field is that we end up also miscomputing the size
9672 of the containing type. This can have adverse results when computing
9673 the value of an entity. GDB fetches the value of an entity based
9674 on the size of its type, and thus a wrong size causes GDB to fetch
9675 the wrong amount of memory. In the case where the computed size is
9676 too small, GDB fetches too little data to print the value of our
9677 entity. Results in this case are unpredictable, as we usually read
9678 past the buffer containing the data =:-o. */
9680 /* A helper function for TERNOP_IN_RANGE. */
9683 eval_ternop_in_range (struct type
*expect_type
, struct expression
*exp
,
9685 value
*arg1
, value
*arg2
, value
*arg3
)
9687 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9688 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9689 struct type
*type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9691 value_from_longest (type
,
9692 (value_less (arg1
, arg3
)
9693 || value_equal (arg1
, arg3
))
9694 && (value_less (arg2
, arg1
)
9695 || value_equal (arg2
, arg1
)));
9698 /* A helper function for UNOP_NEG. */
9701 ada_unop_neg (struct type
*expect_type
,
9702 struct expression
*exp
,
9703 enum noside noside
, enum exp_opcode op
,
9706 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9707 return value_neg (arg1
);
9710 /* A helper function for UNOP_IN_RANGE. */
9713 ada_unop_in_range (struct type
*expect_type
,
9714 struct expression
*exp
,
9715 enum noside noside
, enum exp_opcode op
,
9716 struct value
*arg1
, struct type
*type
)
9718 struct value
*arg2
, *arg3
;
9719 switch (type
->code ())
9722 lim_warning (_("Membership test incompletely implemented; "
9723 "always returns true"));
9724 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9725 return value_from_longest (type
, (LONGEST
) 1);
9727 case TYPE_CODE_RANGE
:
9728 arg2
= value_from_longest (type
,
9729 type
->bounds ()->low
.const_val ());
9730 arg3
= value_from_longest (type
,
9731 type
->bounds ()->high
.const_val ());
9732 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9733 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9734 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9736 value_from_longest (type
,
9737 (value_less (arg1
, arg3
)
9738 || value_equal (arg1
, arg3
))
9739 && (value_less (arg2
, arg1
)
9740 || value_equal (arg2
, arg1
)));
9744 /* A helper function for OP_ATR_TAG. */
9747 ada_atr_tag (struct type
*expect_type
,
9748 struct expression
*exp
,
9749 enum noside noside
, enum exp_opcode op
,
9752 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9753 return value_zero (ada_tag_type (arg1
), not_lval
);
9755 return ada_value_tag (arg1
);
9758 /* A helper function for OP_ATR_SIZE. */
9761 ada_atr_size (struct type
*expect_type
,
9762 struct expression
*exp
,
9763 enum noside noside
, enum exp_opcode op
,
9766 struct type
*type
= value_type (arg1
);
9768 /* If the argument is a reference, then dereference its type, since
9769 the user is really asking for the size of the actual object,
9770 not the size of the pointer. */
9771 if (type
->code () == TYPE_CODE_REF
)
9772 type
= TYPE_TARGET_TYPE (type
);
9774 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9775 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
9777 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
9778 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9781 /* A helper function for UNOP_ABS. */
9784 ada_abs (struct type
*expect_type
,
9785 struct expression
*exp
,
9786 enum noside noside
, enum exp_opcode op
,
9789 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9790 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9791 return value_neg (arg1
);
9796 /* A helper function for BINOP_MUL. */
9799 ada_mult_binop (struct type
*expect_type
,
9800 struct expression
*exp
,
9801 enum noside noside
, enum exp_opcode op
,
9802 struct value
*arg1
, struct value
*arg2
)
9804 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9806 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9807 return value_zero (value_type (arg1
), not_lval
);
9811 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9812 return ada_value_binop (arg1
, arg2
, op
);
9816 /* A helper function for BINOP_EQUAL and BINOP_NOTEQUAL. */
9819 ada_equal_binop (struct type
*expect_type
,
9820 struct expression
*exp
,
9821 enum noside noside
, enum exp_opcode op
,
9822 struct value
*arg1
, struct value
*arg2
)
9825 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9829 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9830 tem
= ada_value_equal (arg1
, arg2
);
9832 if (op
== BINOP_NOTEQUAL
)
9834 struct type
*type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9835 return value_from_longest (type
, (LONGEST
) tem
);
9838 /* A helper function for TERNOP_SLICE. */
9841 ada_ternop_slice (struct expression
*exp
,
9843 struct value
*array
, struct value
*low_bound_val
,
9844 struct value
*high_bound_val
)
9849 low_bound_val
= coerce_ref (low_bound_val
);
9850 high_bound_val
= coerce_ref (high_bound_val
);
9851 low_bound
= value_as_long (low_bound_val
);
9852 high_bound
= value_as_long (high_bound_val
);
9854 /* If this is a reference to an aligner type, then remove all
9856 if (value_type (array
)->code () == TYPE_CODE_REF
9857 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
9858 TYPE_TARGET_TYPE (value_type (array
)) =
9859 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
9861 if (ada_is_any_packed_array_type (value_type (array
)))
9862 error (_("cannot slice a packed array"));
9864 /* If this is a reference to an array or an array lvalue,
9865 convert to a pointer. */
9866 if (value_type (array
)->code () == TYPE_CODE_REF
9867 || (value_type (array
)->code () == TYPE_CODE_ARRAY
9868 && VALUE_LVAL (array
) == lval_memory
))
9869 array
= value_addr (array
);
9871 if (noside
== EVAL_AVOID_SIDE_EFFECTS
9872 && ada_is_array_descriptor_type (ada_check_typedef
9873 (value_type (array
))))
9874 return empty_array (ada_type_of_array (array
, 0), low_bound
,
9877 array
= ada_coerce_to_simple_array_ptr (array
);
9879 /* If we have more than one level of pointer indirection,
9880 dereference the value until we get only one level. */
9881 while (value_type (array
)->code () == TYPE_CODE_PTR
9882 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
9884 array
= value_ind (array
);
9886 /* Make sure we really do have an array type before going further,
9887 to avoid a SEGV when trying to get the index type or the target
9888 type later down the road if the debug info generated by
9889 the compiler is incorrect or incomplete. */
9890 if (!ada_is_simple_array_type (value_type (array
)))
9891 error (_("cannot take slice of non-array"));
9893 if (ada_check_typedef (value_type (array
))->code ()
9896 struct type
*type0
= ada_check_typedef (value_type (array
));
9898 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9899 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
9902 struct type
*arr_type0
=
9903 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
9905 return ada_value_slice_from_ptr (array
, arr_type0
,
9906 longest_to_int (low_bound
),
9907 longest_to_int (high_bound
));
9910 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9912 else if (high_bound
< low_bound
)
9913 return empty_array (value_type (array
), low_bound
, high_bound
);
9915 return ada_value_slice (array
, longest_to_int (low_bound
),
9916 longest_to_int (high_bound
));
9919 /* A helper function for BINOP_IN_BOUNDS. */
9922 ada_binop_in_bounds (struct expression
*exp
, enum noside noside
,
9923 struct value
*arg1
, struct value
*arg2
, int n
)
9925 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9927 struct type
*type
= language_bool_type (exp
->language_defn
,
9929 return value_zero (type
, not_lval
);
9932 struct type
*type
= ada_index_type (value_type (arg2
), n
, "range");
9934 type
= value_type (arg1
);
9936 value
*arg3
= value_from_longest (type
, ada_array_bound (arg2
, n
, 1));
9937 arg2
= value_from_longest (type
, ada_array_bound (arg2
, n
, 0));
9939 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9940 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9941 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9942 return value_from_longest (type
,
9943 (value_less (arg1
, arg3
)
9944 || value_equal (arg1
, arg3
))
9945 && (value_less (arg2
, arg1
)
9946 || value_equal (arg2
, arg1
)));
9949 /* A helper function for some attribute operations. */
9952 ada_unop_atr (struct expression
*exp
, enum noside noside
, enum exp_opcode op
,
9953 struct value
*arg1
, struct type
*type_arg
, int tem
)
9955 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9957 if (type_arg
== NULL
)
9958 type_arg
= value_type (arg1
);
9960 if (ada_is_constrained_packed_array_type (type_arg
))
9961 type_arg
= decode_constrained_packed_array_type (type_arg
);
9963 if (!discrete_type_p (type_arg
))
9967 default: /* Should never happen. */
9968 error (_("unexpected attribute encountered"));
9971 type_arg
= ada_index_type (type_arg
, tem
,
9972 ada_attribute_name (op
));
9975 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
9980 return value_zero (type_arg
, not_lval
);
9982 else if (type_arg
== NULL
)
9984 arg1
= ada_coerce_ref (arg1
);
9986 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9987 arg1
= ada_coerce_to_simple_array (arg1
);
9990 if (op
== OP_ATR_LENGTH
)
9991 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9994 type
= ada_index_type (value_type (arg1
), tem
,
9995 ada_attribute_name (op
));
9997 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10002 default: /* Should never happen. */
10003 error (_("unexpected attribute encountered"));
10005 return value_from_longest
10006 (type
, ada_array_bound (arg1
, tem
, 0));
10008 return value_from_longest
10009 (type
, ada_array_bound (arg1
, tem
, 1));
10010 case OP_ATR_LENGTH
:
10011 return value_from_longest
10012 (type
, ada_array_length (arg1
, tem
));
10015 else if (discrete_type_p (type_arg
))
10017 struct type
*range_type
;
10018 const char *name
= ada_type_name (type_arg
);
10021 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
10022 range_type
= to_fixed_range_type (type_arg
, NULL
);
10023 if (range_type
== NULL
)
10024 range_type
= type_arg
;
10028 error (_("unexpected attribute encountered"));
10030 return value_from_longest
10031 (range_type
, ada_discrete_type_low_bound (range_type
));
10033 return value_from_longest
10034 (range_type
, ada_discrete_type_high_bound (range_type
));
10035 case OP_ATR_LENGTH
:
10036 error (_("the 'length attribute applies only to array types"));
10039 else if (type_arg
->code () == TYPE_CODE_FLT
)
10040 error (_("unimplemented type attribute"));
10045 if (ada_is_constrained_packed_array_type (type_arg
))
10046 type_arg
= decode_constrained_packed_array_type (type_arg
);
10049 if (op
== OP_ATR_LENGTH
)
10050 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10053 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10055 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10061 error (_("unexpected attribute encountered"));
10063 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10064 return value_from_longest (type
, low
);
10066 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10067 return value_from_longest (type
, high
);
10068 case OP_ATR_LENGTH
:
10069 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10070 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10071 return value_from_longest (type
, high
- low
+ 1);
10076 /* A helper function for OP_ATR_MIN and OP_ATR_MAX. */
10079 ada_binop_minmax (struct type
*expect_type
,
10080 struct expression
*exp
,
10081 enum noside noside
, enum exp_opcode op
,
10082 struct value
*arg1
, struct value
*arg2
)
10084 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10085 return value_zero (value_type (arg1
), not_lval
);
10088 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10089 return value_binop (arg1
, arg2
, op
);
10093 /* A helper function for BINOP_EXP. */
10096 ada_binop_exp (struct type
*expect_type
,
10097 struct expression
*exp
,
10098 enum noside noside
, enum exp_opcode op
,
10099 struct value
*arg1
, struct value
*arg2
)
10101 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10102 return value_zero (value_type (arg1
), not_lval
);
10105 /* For integer exponentiation operations,
10106 only promote the first argument. */
10107 if (is_integral_type (value_type (arg2
)))
10108 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10110 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10112 return value_binop (arg1
, arg2
, op
);
10120 ada_wrapped_operation::evaluate (struct type
*expect_type
,
10121 struct expression
*exp
,
10122 enum noside noside
)
10124 value
*result
= std::get
<0> (m_storage
)->evaluate (expect_type
, exp
, noside
);
10125 if (noside
== EVAL_NORMAL
)
10126 result
= unwrap_value (result
);
10128 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10129 then we need to perform the conversion manually, because
10130 evaluate_subexp_standard doesn't do it. This conversion is
10131 necessary in Ada because the different kinds of float/fixed
10132 types in Ada have different representations.
10134 Similarly, we need to perform the conversion from OP_LONG
10136 if ((opcode () == OP_FLOAT
|| opcode () == OP_LONG
) && expect_type
!= NULL
)
10137 result
= ada_value_cast (expect_type
, result
);
10143 ada_string_operation::evaluate (struct type
*expect_type
,
10144 struct expression
*exp
,
10145 enum noside noside
)
10147 value
*result
= string_operation::evaluate (expect_type
, exp
, noside
);
10148 /* The result type will have code OP_STRING, bashed there from
10149 OP_ARRAY. Bash it back. */
10150 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10151 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10156 ada_qual_operation::evaluate (struct type
*expect_type
,
10157 struct expression
*exp
,
10158 enum noside noside
)
10160 struct type
*type
= std::get
<1> (m_storage
);
10161 return std::get
<0> (m_storage
)->evaluate (type
, exp
, noside
);
10165 ada_ternop_range_operation::evaluate (struct type
*expect_type
,
10166 struct expression
*exp
,
10167 enum noside noside
)
10169 value
*arg0
= std::get
<0> (m_storage
)->evaluate (nullptr, exp
, noside
);
10170 value
*arg1
= std::get
<1> (m_storage
)->evaluate (nullptr, exp
, noside
);
10171 value
*arg2
= std::get
<2> (m_storage
)->evaluate (nullptr, exp
, noside
);
10172 return eval_ternop_in_range (expect_type
, exp
, noside
, arg0
, arg1
, arg2
);
10176 ada_binop_addsub_operation::evaluate (struct type
*expect_type
,
10177 struct expression
*exp
,
10178 enum noside noside
)
10180 value
*arg1
= std::get
<1> (m_storage
)->evaluate_with_coercion (exp
, noside
);
10181 value
*arg2
= std::get
<2> (m_storage
)->evaluate_with_coercion (exp
, noside
);
10183 auto do_op
= [=] (LONGEST x
, LONGEST y
)
10185 if (std::get
<0> (m_storage
) == BINOP_ADD
)
10190 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10191 return (value_from_longest
10192 (value_type (arg1
),
10193 do_op (value_as_long (arg1
), value_as_long (arg2
))));
10194 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10195 return (value_from_longest
10196 (value_type (arg2
),
10197 do_op (value_as_long (arg1
), value_as_long (arg2
))));
10198 /* Preserve the original type for use by the range case below.
10199 We cannot cast the result to a reference type, so if ARG1 is
10200 a reference type, find its underlying type. */
10201 struct type
*type
= value_type (arg1
);
10202 while (type
->code () == TYPE_CODE_REF
)
10203 type
= TYPE_TARGET_TYPE (type
);
10204 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10205 arg1
= value_binop (arg1
, arg2
, std::get
<0> (m_storage
));
10206 /* We need to special-case the result with a range.
10207 This is done for the benefit of "ptype". gdb's Ada support
10208 historically used the LHS to set the result type here, so
10209 preserve this behavior. */
10210 if (type
->code () == TYPE_CODE_RANGE
)
10211 arg1
= value_cast (type
, arg1
);
10216 ada_unop_atr_operation::evaluate (struct type
*expect_type
,
10217 struct expression
*exp
,
10218 enum noside noside
)
10220 struct type
*type_arg
= nullptr;
10221 value
*val
= nullptr;
10223 if (std::get
<0> (m_storage
)->opcode () == OP_TYPE
)
10225 value
*tem
= std::get
<0> (m_storage
)->evaluate (nullptr, exp
,
10226 EVAL_AVOID_SIDE_EFFECTS
);
10227 type_arg
= value_type (tem
);
10230 val
= std::get
<0> (m_storage
)->evaluate (nullptr, exp
, noside
);
10232 return ada_unop_atr (exp
, noside
, std::get
<1> (m_storage
),
10233 val
, type_arg
, std::get
<2> (m_storage
));
10237 ada_var_msym_value_operation::evaluate_for_cast (struct type
*expect_type
,
10238 struct expression
*exp
,
10239 enum noside noside
)
10241 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10242 return value_zero (expect_type
, not_lval
);
10244 value
*val
= evaluate_var_msym_value (noside
,
10245 std::get
<1> (m_storage
),
10246 std::get
<0> (m_storage
));
10248 val
= ada_value_cast (expect_type
, val
);
10250 /* Follow the Ada language semantics that do not allow taking
10251 an address of the result of a cast (view conversion in Ada). */
10252 if (VALUE_LVAL (val
) == lval_memory
)
10254 if (value_lazy (val
))
10255 value_fetch_lazy (val
);
10256 VALUE_LVAL (val
) = not_lval
;
10262 ada_var_value_operation::evaluate_for_cast (struct type
*expect_type
,
10263 struct expression
*exp
,
10264 enum noside noside
)
10266 value
*val
= evaluate_var_value (noside
,
10267 std::get
<1> (m_storage
),
10268 std::get
<0> (m_storage
));
10270 val
= ada_value_cast (expect_type
, val
);
10272 /* Follow the Ada language semantics that do not allow taking
10273 an address of the result of a cast (view conversion in Ada). */
10274 if (VALUE_LVAL (val
) == lval_memory
)
10276 if (value_lazy (val
))
10277 value_fetch_lazy (val
);
10278 VALUE_LVAL (val
) = not_lval
;
10284 ada_var_value_operation::evaluate (struct type
*expect_type
,
10285 struct expression
*exp
,
10286 enum noside noside
)
10288 symbol
*sym
= std::get
<0> (m_storage
);
10290 if (SYMBOL_DOMAIN (sym
) == UNDEF_DOMAIN
)
10291 /* Only encountered when an unresolved symbol occurs in a
10292 context other than a function call, in which case, it is
10294 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10295 sym
->print_name ());
10297 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10299 struct type
*type
= static_unwrap_type (SYMBOL_TYPE (sym
));
10300 /* Check to see if this is a tagged type. We also need to handle
10301 the case where the type is a reference to a tagged type, but
10302 we have to be careful to exclude pointers to tagged types.
10303 The latter should be shown as usual (as a pointer), whereas
10304 a reference should mostly be transparent to the user. */
10305 if (ada_is_tagged_type (type
, 0)
10306 || (type
->code () == TYPE_CODE_REF
10307 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10309 /* Tagged types are a little special in the fact that the real
10310 type is dynamic and can only be determined by inspecting the
10311 object's tag. This means that we need to get the object's
10312 value first (EVAL_NORMAL) and then extract the actual object
10315 Note that we cannot skip the final step where we extract
10316 the object type from its tag, because the EVAL_NORMAL phase
10317 results in dynamic components being resolved into fixed ones.
10318 This can cause problems when trying to print the type
10319 description of tagged types whose parent has a dynamic size:
10320 We use the type name of the "_parent" component in order
10321 to print the name of the ancestor type in the type description.
10322 If that component had a dynamic size, the resolution into
10323 a fixed type would result in the loss of that type name,
10324 thus preventing us from printing the name of the ancestor
10325 type in the type description. */
10326 value
*arg1
= var_value_operation::evaluate (nullptr, exp
,
10329 if (type
->code () != TYPE_CODE_REF
)
10331 struct type
*actual_type
;
10333 actual_type
= type_from_tag (ada_value_tag (arg1
));
10334 if (actual_type
== NULL
)
10335 /* If, for some reason, we were unable to determine
10336 the actual type from the tag, then use the static
10337 approximation that we just computed as a fallback.
10338 This can happen if the debugging information is
10339 incomplete, for instance. */
10340 actual_type
= type
;
10341 return value_zero (actual_type
, not_lval
);
10345 /* In the case of a ref, ada_coerce_ref takes care
10346 of determining the actual type. But the evaluation
10347 should return a ref as it should be valid to ask
10348 for its address; so rebuild a ref after coerce. */
10349 arg1
= ada_coerce_ref (arg1
);
10350 return value_ref (arg1
, TYPE_CODE_REF
);
10354 /* Records and unions for which GNAT encodings have been
10355 generated need to be statically fixed as well.
10356 Otherwise, non-static fixing produces a type where
10357 all dynamic properties are removed, which prevents "ptype"
10358 from being able to completely describe the type.
10359 For instance, a case statement in a variant record would be
10360 replaced by the relevant components based on the actual
10361 value of the discriminants. */
10362 if ((type
->code () == TYPE_CODE_STRUCT
10363 && dynamic_template_type (type
) != NULL
)
10364 || (type
->code () == TYPE_CODE_UNION
10365 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10366 return value_zero (to_static_fixed_type (type
), not_lval
);
10369 value
*arg1
= var_value_operation::evaluate (expect_type
, exp
, noside
);
10370 return ada_to_fixed_value (arg1
);
10374 ada_var_value_operation::resolve (struct expression
*exp
,
10375 bool deprocedure_p
,
10376 bool parse_completion
,
10377 innermost_block_tracker
*tracker
,
10378 struct type
*context_type
)
10380 symbol
*sym
= std::get
<0> (m_storage
);
10381 if (SYMBOL_DOMAIN (sym
) == UNDEF_DOMAIN
)
10383 block_symbol resolved
10384 = ada_resolve_variable (sym
, std::get
<1> (m_storage
),
10385 context_type
, parse_completion
,
10386 deprocedure_p
, tracker
);
10387 std::get
<0> (m_storage
) = resolved
.symbol
;
10388 std::get
<1> (m_storage
) = resolved
.block
;
10392 && SYMBOL_TYPE (std::get
<0> (m_storage
))->code () == TYPE_CODE_FUNC
)
10399 ada_atr_val_operation::evaluate (struct type
*expect_type
,
10400 struct expression
*exp
,
10401 enum noside noside
)
10403 value
*arg
= std::get
<1> (m_storage
)->evaluate (nullptr, exp
, noside
);
10404 return ada_val_atr (noside
, std::get
<0> (m_storage
), arg
);
10408 ada_unop_ind_operation::evaluate (struct type
*expect_type
,
10409 struct expression
*exp
,
10410 enum noside noside
)
10412 value
*arg1
= std::get
<0> (m_storage
)->evaluate (expect_type
, exp
, noside
);
10414 struct type
*type
= ada_check_typedef (value_type (arg1
));
10415 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10417 if (ada_is_array_descriptor_type (type
))
10418 /* GDB allows dereferencing GNAT array descriptors. */
10420 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10422 if (arrType
== NULL
)
10423 error (_("Attempt to dereference null array pointer."));
10424 return value_at_lazy (arrType
, 0);
10426 else if (type
->code () == TYPE_CODE_PTR
10427 || type
->code () == TYPE_CODE_REF
10428 /* In C you can dereference an array to get the 1st elt. */
10429 || type
->code () == TYPE_CODE_ARRAY
)
10431 /* As mentioned in the OP_VAR_VALUE case, tagged types can
10432 only be determined by inspecting the object's tag.
10433 This means that we need to evaluate completely the
10434 expression in order to get its type. */
10436 if ((type
->code () == TYPE_CODE_REF
10437 || type
->code () == TYPE_CODE_PTR
)
10438 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
10440 arg1
= std::get
<0> (m_storage
)->evaluate (nullptr, exp
,
10442 type
= value_type (ada_value_ind (arg1
));
10446 type
= to_static_fixed_type
10448 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10450 ada_ensure_varsize_limit (type
);
10451 return value_zero (type
, lval_memory
);
10453 else if (type
->code () == TYPE_CODE_INT
)
10455 /* GDB allows dereferencing an int. */
10456 if (expect_type
== NULL
)
10457 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10462 to_static_fixed_type (ada_aligned_type (expect_type
));
10463 return value_zero (expect_type
, lval_memory
);
10467 error (_("Attempt to take contents of a non-pointer value."));
10469 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10470 type
= ada_check_typedef (value_type (arg1
));
10472 if (type
->code () == TYPE_CODE_INT
)
10473 /* GDB allows dereferencing an int. If we were given
10474 the expect_type, then use that as the target type.
10475 Otherwise, assume that the target type is an int. */
10477 if (expect_type
!= NULL
)
10478 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10481 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10482 (CORE_ADDR
) value_as_address (arg1
));
10485 if (ada_is_array_descriptor_type (type
))
10486 /* GDB allows dereferencing GNAT array descriptors. */
10487 return ada_coerce_to_simple_array (arg1
);
10489 return ada_value_ind (arg1
);
10493 ada_structop_operation::evaluate (struct type
*expect_type
,
10494 struct expression
*exp
,
10495 enum noside noside
)
10497 value
*arg1
= std::get
<0> (m_storage
)->evaluate (nullptr, exp
, noside
);
10498 const char *str
= std::get
<1> (m_storage
).c_str ();
10499 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10502 struct type
*type1
= value_type (arg1
);
10504 if (ada_is_tagged_type (type1
, 1))
10506 type
= ada_lookup_struct_elt_type (type1
, str
, 1, 1);
10508 /* If the field is not found, check if it exists in the
10509 extension of this object's type. This means that we
10510 need to evaluate completely the expression. */
10514 arg1
= std::get
<0> (m_storage
)->evaluate (nullptr, exp
,
10516 arg1
= ada_value_struct_elt (arg1
, str
, 0);
10517 arg1
= unwrap_value (arg1
);
10518 type
= value_type (ada_to_fixed_value (arg1
));
10522 type
= ada_lookup_struct_elt_type (type1
, str
, 1, 0);
10524 return value_zero (ada_aligned_type (type
), lval_memory
);
10528 arg1
= ada_value_struct_elt (arg1
, str
, 0);
10529 arg1
= unwrap_value (arg1
);
10530 return ada_to_fixed_value (arg1
);
10535 ada_funcall_operation::evaluate (struct type
*expect_type
,
10536 struct expression
*exp
,
10537 enum noside noside
)
10539 const std::vector
<operation_up
> &args_up
= std::get
<1> (m_storage
);
10540 int nargs
= args_up
.size ();
10541 std::vector
<value
*> argvec (nargs
);
10542 operation_up
&callee_op
= std::get
<0> (m_storage
);
10544 ada_var_value_operation
*avv
10545 = dynamic_cast<ada_var_value_operation
*> (callee_op
.get ());
10547 && SYMBOL_DOMAIN (avv
->get_symbol ()) == UNDEF_DOMAIN
)
10548 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10549 avv
->get_symbol ()->print_name ());
10551 value
*callee
= callee_op
->evaluate (nullptr, exp
, noside
);
10552 for (int i
= 0; i
< args_up
.size (); ++i
)
10553 argvec
[i
] = args_up
[i
]->evaluate (nullptr, exp
, noside
);
10555 if (ada_is_constrained_packed_array_type
10556 (desc_base_type (value_type (callee
))))
10557 callee
= ada_coerce_to_simple_array (callee
);
10558 else if (value_type (callee
)->code () == TYPE_CODE_ARRAY
10559 && TYPE_FIELD_BITSIZE (value_type (callee
), 0) != 0)
10560 /* This is a packed array that has already been fixed, and
10561 therefore already coerced to a simple array. Nothing further
10564 else if (value_type (callee
)->code () == TYPE_CODE_REF
)
10566 /* Make sure we dereference references so that all the code below
10567 feels like it's really handling the referenced value. Wrapping
10568 types (for alignment) may be there, so make sure we strip them as
10570 callee
= ada_to_fixed_value (coerce_ref (callee
));
10572 else if (value_type (callee
)->code () == TYPE_CODE_ARRAY
10573 && VALUE_LVAL (callee
) == lval_memory
)
10574 callee
= value_addr (callee
);
10576 struct type
*type
= ada_check_typedef (value_type (callee
));
10578 /* Ada allows us to implicitly dereference arrays when subscripting
10579 them. So, if this is an array typedef (encoding use for array
10580 access types encoded as fat pointers), strip it now. */
10581 if (type
->code () == TYPE_CODE_TYPEDEF
)
10582 type
= ada_typedef_target_type (type
);
10584 if (type
->code () == TYPE_CODE_PTR
)
10586 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10588 case TYPE_CODE_FUNC
:
10589 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10591 case TYPE_CODE_ARRAY
:
10593 case TYPE_CODE_STRUCT
:
10594 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10595 callee
= ada_value_ind (callee
);
10596 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10599 error (_("cannot subscript or call something of type `%s'"),
10600 ada_type_name (value_type (callee
)));
10605 switch (type
->code ())
10607 case TYPE_CODE_FUNC
:
10608 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10610 if (TYPE_TARGET_TYPE (type
) == NULL
)
10611 error_call_unknown_return_type (NULL
);
10612 return allocate_value (TYPE_TARGET_TYPE (type
));
10614 return call_function_by_hand (callee
, NULL
, argvec
);
10615 case TYPE_CODE_INTERNAL_FUNCTION
:
10616 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10617 /* We don't know anything about what the internal
10618 function might return, but we have to return
10620 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10623 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10627 case TYPE_CODE_STRUCT
:
10631 arity
= ada_array_arity (type
);
10632 type
= ada_array_element_type (type
, nargs
);
10634 error (_("cannot subscript or call a record"));
10635 if (arity
!= nargs
)
10636 error (_("wrong number of subscripts; expecting %d"), arity
);
10637 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10638 return value_zero (ada_aligned_type (type
), lval_memory
);
10640 unwrap_value (ada_value_subscript
10641 (callee
, nargs
, argvec
.data ()));
10643 case TYPE_CODE_ARRAY
:
10644 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10646 type
= ada_array_element_type (type
, nargs
);
10648 error (_("element type of array unknown"));
10650 return value_zero (ada_aligned_type (type
), lval_memory
);
10653 unwrap_value (ada_value_subscript
10654 (ada_coerce_to_simple_array (callee
),
10655 nargs
, argvec
.data ()));
10656 case TYPE_CODE_PTR
: /* Pointer to array */
10657 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10659 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10660 type
= ada_array_element_type (type
, nargs
);
10662 error (_("element type of array unknown"));
10664 return value_zero (ada_aligned_type (type
), lval_memory
);
10667 unwrap_value (ada_value_ptr_subscript (callee
, nargs
,
10671 error (_("Attempt to index or call something other than an "
10672 "array or function"));
10677 ada_funcall_operation::resolve (struct expression
*exp
,
10678 bool deprocedure_p
,
10679 bool parse_completion
,
10680 innermost_block_tracker
*tracker
,
10681 struct type
*context_type
)
10683 operation_up
&callee_op
= std::get
<0> (m_storage
);
10685 ada_var_value_operation
*avv
10686 = dynamic_cast<ada_var_value_operation
*> (callee_op
.get ());
10687 if (avv
== nullptr)
10690 symbol
*sym
= avv
->get_symbol ();
10691 if (SYMBOL_DOMAIN (sym
) != UNDEF_DOMAIN
)
10694 const std::vector
<operation_up
> &args_up
= std::get
<1> (m_storage
);
10695 int nargs
= args_up
.size ();
10696 std::vector
<value
*> argvec (nargs
);
10698 for (int i
= 0; i
< args_up
.size (); ++i
)
10699 argvec
[i
] = args_up
[i
]->evaluate (nullptr, exp
, EVAL_AVOID_SIDE_EFFECTS
);
10701 const block
*block
= avv
->get_block ();
10702 block_symbol resolved
10703 = ada_resolve_funcall (sym
, block
,
10704 context_type
, parse_completion
,
10705 nargs
, argvec
.data (),
10708 std::get
<0> (m_storage
)
10709 = make_operation
<ada_var_value_operation
> (resolved
.symbol
,
10715 ada_ternop_slice_operation::resolve (struct expression
*exp
,
10716 bool deprocedure_p
,
10717 bool parse_completion
,
10718 innermost_block_tracker
*tracker
,
10719 struct type
*context_type
)
10721 /* Historically this check was done during resolution, so we
10722 continue that here. */
10723 value
*v
= std::get
<0> (m_storage
)->evaluate (context_type
, exp
,
10724 EVAL_AVOID_SIDE_EFFECTS
);
10725 if (ada_is_any_packed_array_type (value_type (v
)))
10726 error (_("cannot slice a packed array"));
10734 /* Return non-zero iff TYPE represents a System.Address type. */
10737 ada_is_system_address_type (struct type
*type
)
10739 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
10746 /* Scan STR beginning at position K for a discriminant name, and
10747 return the value of that discriminant field of DVAL in *PX. If
10748 PNEW_K is not null, put the position of the character beyond the
10749 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
10750 not alter *PX and *PNEW_K if unsuccessful. */
10753 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
10756 static std::string storage
;
10757 const char *pstart
, *pend
, *bound
;
10758 struct value
*bound_val
;
10760 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
10764 pend
= strstr (pstart
, "__");
10768 k
+= strlen (bound
);
10772 int len
= pend
- pstart
;
10774 /* Strip __ and beyond. */
10775 storage
= std::string (pstart
, len
);
10776 bound
= storage
.c_str ();
10780 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
10781 if (bound_val
== NULL
)
10784 *px
= value_as_long (bound_val
);
10785 if (pnew_k
!= NULL
)
10790 /* Value of variable named NAME. Only exact matches are considered.
10791 If no such variable found, then if ERR_MSG is null, returns 0, and
10792 otherwise causes an error with message ERR_MSG. */
10794 static struct value
*
10795 get_var_value (const char *name
, const char *err_msg
)
10797 std::string quoted_name
= add_angle_brackets (name
);
10799 lookup_name_info
lookup_name (quoted_name
, symbol_name_match_type::FULL
);
10801 std::vector
<struct block_symbol
> syms
10802 = ada_lookup_symbol_list_worker (lookup_name
,
10803 get_selected_block (0),
10806 if (syms
.size () != 1)
10808 if (err_msg
== NULL
)
10811 error (("%s"), err_msg
);
10814 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
10817 /* Value of integer variable named NAME in the current environment.
10818 If no such variable is found, returns false. Otherwise, sets VALUE
10819 to the variable's value and returns true. */
10822 get_int_var_value (const char *name
, LONGEST
&value
)
10824 struct value
*var_val
= get_var_value (name
, 0);
10829 value
= value_as_long (var_val
);
10834 /* Return a range type whose base type is that of the range type named
10835 NAME in the current environment, and whose bounds are calculated
10836 from NAME according to the GNAT range encoding conventions.
10837 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10838 corresponding range type from debug information; fall back to using it
10839 if symbol lookup fails. If a new type must be created, allocate it
10840 like ORIG_TYPE was. The bounds information, in general, is encoded
10841 in NAME, the base type given in the named range type. */
10843 static struct type
*
10844 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
10847 struct type
*base_type
;
10848 const char *subtype_info
;
10850 gdb_assert (raw_type
!= NULL
);
10851 gdb_assert (raw_type
->name () != NULL
);
10853 if (raw_type
->code () == TYPE_CODE_RANGE
)
10854 base_type
= TYPE_TARGET_TYPE (raw_type
);
10856 base_type
= raw_type
;
10858 name
= raw_type
->name ();
10859 subtype_info
= strstr (name
, "___XD");
10860 if (subtype_info
== NULL
)
10862 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
10863 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
10865 if (L
< INT_MIN
|| U
> INT_MAX
)
10868 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
10873 int prefix_len
= subtype_info
- name
;
10876 const char *bounds_str
;
10880 bounds_str
= strchr (subtype_info
, '_');
10883 if (*subtype_info
== 'L')
10885 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
10886 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
10888 if (bounds_str
[n
] == '_')
10890 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
10896 std::string name_buf
= std::string (name
, prefix_len
) + "___L";
10897 if (!get_int_var_value (name_buf
.c_str (), L
))
10899 lim_warning (_("Unknown lower bound, using 1."));
10904 if (*subtype_info
== 'U')
10906 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
10907 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
10912 std::string name_buf
= std::string (name
, prefix_len
) + "___U";
10913 if (!get_int_var_value (name_buf
.c_str (), U
))
10915 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
10920 type
= create_static_range_type (alloc_type_copy (raw_type
),
10922 /* create_static_range_type alters the resulting type's length
10923 to match the size of the base_type, which is not what we want.
10924 Set it back to the original range type's length. */
10925 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
10926 type
->set_name (name
);
10931 /* True iff NAME is the name of a range type. */
10934 ada_is_range_type_name (const char *name
)
10936 return (name
!= NULL
&& strstr (name
, "___XD"));
10940 /* Modular types */
10942 /* True iff TYPE is an Ada modular type. */
10945 ada_is_modular_type (struct type
*type
)
10947 struct type
*subranged_type
= get_base_type (type
);
10949 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
10950 && subranged_type
->code () == TYPE_CODE_INT
10951 && subranged_type
->is_unsigned ());
10954 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10957 ada_modulus (struct type
*type
)
10959 const dynamic_prop
&high
= type
->bounds ()->high
;
10961 if (high
.kind () == PROP_CONST
)
10962 return (ULONGEST
) high
.const_val () + 1;
10964 /* If TYPE is unresolved, the high bound might be a location list. Return
10965 0, for lack of a better value to return. */
10970 /* Ada exception catchpoint support:
10971 ---------------------------------
10973 We support 3 kinds of exception catchpoints:
10974 . catchpoints on Ada exceptions
10975 . catchpoints on unhandled Ada exceptions
10976 . catchpoints on failed assertions
10978 Exceptions raised during failed assertions, or unhandled exceptions
10979 could perfectly be caught with the general catchpoint on Ada exceptions.
10980 However, we can easily differentiate these two special cases, and having
10981 the option to distinguish these two cases from the rest can be useful
10982 to zero-in on certain situations.
10984 Exception catchpoints are a specialized form of breakpoint,
10985 since they rely on inserting breakpoints inside known routines
10986 of the GNAT runtime. The implementation therefore uses a standard
10987 breakpoint structure of the BP_BREAKPOINT type, but with its own set
10990 Support in the runtime for exception catchpoints have been changed
10991 a few times already, and these changes affect the implementation
10992 of these catchpoints. In order to be able to support several
10993 variants of the runtime, we use a sniffer that will determine
10994 the runtime variant used by the program being debugged. */
10996 /* Ada's standard exceptions.
10998 The Ada 83 standard also defined Numeric_Error. But there so many
10999 situations where it was unclear from the Ada 83 Reference Manual
11000 (RM) whether Constraint_Error or Numeric_Error should be raised,
11001 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11002 Interpretation saying that anytime the RM says that Numeric_Error
11003 should be raised, the implementation may raise Constraint_Error.
11004 Ada 95 went one step further and pretty much removed Numeric_Error
11005 from the list of standard exceptions (it made it a renaming of
11006 Constraint_Error, to help preserve compatibility when compiling
11007 an Ada83 compiler). As such, we do not include Numeric_Error from
11008 this list of standard exceptions. */
11010 static const char * const standard_exc
[] = {
11011 "constraint_error",
11017 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11019 /* A structure that describes how to support exception catchpoints
11020 for a given executable. */
11022 struct exception_support_info
11024 /* The name of the symbol to break on in order to insert
11025 a catchpoint on exceptions. */
11026 const char *catch_exception_sym
;
11028 /* The name of the symbol to break on in order to insert
11029 a catchpoint on unhandled exceptions. */
11030 const char *catch_exception_unhandled_sym
;
11032 /* The name of the symbol to break on in order to insert
11033 a catchpoint on failed assertions. */
11034 const char *catch_assert_sym
;
11036 /* The name of the symbol to break on in order to insert
11037 a catchpoint on exception handling. */
11038 const char *catch_handlers_sym
;
11040 /* Assuming that the inferior just triggered an unhandled exception
11041 catchpoint, this function is responsible for returning the address
11042 in inferior memory where the name of that exception is stored.
11043 Return zero if the address could not be computed. */
11044 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11047 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11048 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11050 /* The following exception support info structure describes how to
11051 implement exception catchpoints with the latest version of the
11052 Ada runtime (as of 2019-08-??). */
11054 static const struct exception_support_info default_exception_support_info
=
11056 "__gnat_debug_raise_exception", /* catch_exception_sym */
11057 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11058 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11059 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11060 ada_unhandled_exception_name_addr
11063 /* The following exception support info structure describes how to
11064 implement exception catchpoints with an earlier version of the
11065 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11067 static const struct exception_support_info exception_support_info_v0
=
11069 "__gnat_debug_raise_exception", /* catch_exception_sym */
11070 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11071 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11072 "__gnat_begin_handler", /* catch_handlers_sym */
11073 ada_unhandled_exception_name_addr
11076 /* The following exception support info structure describes how to
11077 implement exception catchpoints with a slightly older version
11078 of the Ada runtime. */
11080 static const struct exception_support_info exception_support_info_fallback
=
11082 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11083 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11084 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11085 "__gnat_begin_handler", /* catch_handlers_sym */
11086 ada_unhandled_exception_name_addr_from_raise
11089 /* Return nonzero if we can detect the exception support routines
11090 described in EINFO.
11092 This function errors out if an abnormal situation is detected
11093 (for instance, if we find the exception support routines, but
11094 that support is found to be incomplete). */
11097 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11099 struct symbol
*sym
;
11101 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11102 that should be compiled with debugging information. As a result, we
11103 expect to find that symbol in the symtabs. */
11105 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11108 /* Perhaps we did not find our symbol because the Ada runtime was
11109 compiled without debugging info, or simply stripped of it.
11110 It happens on some GNU/Linux distributions for instance, where
11111 users have to install a separate debug package in order to get
11112 the runtime's debugging info. In that situation, let the user
11113 know why we cannot insert an Ada exception catchpoint.
11115 Note: Just for the purpose of inserting our Ada exception
11116 catchpoint, we could rely purely on the associated minimal symbol.
11117 But we would be operating in degraded mode anyway, since we are
11118 still lacking the debugging info needed later on to extract
11119 the name of the exception being raised (this name is printed in
11120 the catchpoint message, and is also used when trying to catch
11121 a specific exception). We do not handle this case for now. */
11122 struct bound_minimal_symbol msym
11123 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11125 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11126 error (_("Your Ada runtime appears to be missing some debugging "
11127 "information.\nCannot insert Ada exception catchpoint "
11128 "in this configuration."));
11133 /* Make sure that the symbol we found corresponds to a function. */
11135 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11137 error (_("Symbol \"%s\" is not a function (class = %d)"),
11138 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11142 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11145 struct bound_minimal_symbol msym
11146 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11148 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11149 error (_("Your Ada runtime appears to be missing some debugging "
11150 "information.\nCannot insert Ada exception catchpoint "
11151 "in this configuration."));
11156 /* Make sure that the symbol we found corresponds to a function. */
11158 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11160 error (_("Symbol \"%s\" is not a function (class = %d)"),
11161 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11168 /* Inspect the Ada runtime and determine which exception info structure
11169 should be used to provide support for exception catchpoints.
11171 This function will always set the per-inferior exception_info,
11172 or raise an error. */
11175 ada_exception_support_info_sniffer (void)
11177 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11179 /* If the exception info is already known, then no need to recompute it. */
11180 if (data
->exception_info
!= NULL
)
11183 /* Check the latest (default) exception support info. */
11184 if (ada_has_this_exception_support (&default_exception_support_info
))
11186 data
->exception_info
= &default_exception_support_info
;
11190 /* Try the v0 exception suport info. */
11191 if (ada_has_this_exception_support (&exception_support_info_v0
))
11193 data
->exception_info
= &exception_support_info_v0
;
11197 /* Try our fallback exception suport info. */
11198 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11200 data
->exception_info
= &exception_support_info_fallback
;
11204 /* Sometimes, it is normal for us to not be able to find the routine
11205 we are looking for. This happens when the program is linked with
11206 the shared version of the GNAT runtime, and the program has not been
11207 started yet. Inform the user of these two possible causes if
11210 if (ada_update_initial_language (language_unknown
) != language_ada
)
11211 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11213 /* If the symbol does not exist, then check that the program is
11214 already started, to make sure that shared libraries have been
11215 loaded. If it is not started, this may mean that the symbol is
11216 in a shared library. */
11218 if (inferior_ptid
.pid () == 0)
11219 error (_("Unable to insert catchpoint. Try to start the program first."));
11221 /* At this point, we know that we are debugging an Ada program and
11222 that the inferior has been started, but we still are not able to
11223 find the run-time symbols. That can mean that we are in
11224 configurable run time mode, or that a-except as been optimized
11225 out by the linker... In any case, at this point it is not worth
11226 supporting this feature. */
11228 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11231 /* True iff FRAME is very likely to be that of a function that is
11232 part of the runtime system. This is all very heuristic, but is
11233 intended to be used as advice as to what frames are uninteresting
11237 is_known_support_routine (struct frame_info
*frame
)
11239 enum language func_lang
;
11241 const char *fullname
;
11243 /* If this code does not have any debugging information (no symtab),
11244 This cannot be any user code. */
11246 symtab_and_line sal
= find_frame_sal (frame
);
11247 if (sal
.symtab
== NULL
)
11250 /* If there is a symtab, but the associated source file cannot be
11251 located, then assume this is not user code: Selecting a frame
11252 for which we cannot display the code would not be very helpful
11253 for the user. This should also take care of case such as VxWorks
11254 where the kernel has some debugging info provided for a few units. */
11256 fullname
= symtab_to_fullname (sal
.symtab
);
11257 if (access (fullname
, R_OK
) != 0)
11260 /* Check the unit filename against the Ada runtime file naming.
11261 We also check the name of the objfile against the name of some
11262 known system libraries that sometimes come with debugging info
11265 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11267 re_comp (known_runtime_file_name_patterns
[i
]);
11268 if (re_exec (lbasename (sal
.symtab
->filename
)))
11270 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11271 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11275 /* Check whether the function is a GNAT-generated entity. */
11277 gdb::unique_xmalloc_ptr
<char> func_name
11278 = find_frame_funname (frame
, &func_lang
, NULL
);
11279 if (func_name
== NULL
)
11282 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11284 re_comp (known_auxiliary_function_name_patterns
[i
]);
11285 if (re_exec (func_name
.get ()))
11292 /* Find the first frame that contains debugging information and that is not
11293 part of the Ada run-time, starting from FI and moving upward. */
11296 ada_find_printable_frame (struct frame_info
*fi
)
11298 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11300 if (!is_known_support_routine (fi
))
11309 /* Assuming that the inferior just triggered an unhandled exception
11310 catchpoint, return the address in inferior memory where the name
11311 of the exception is stored.
11313 Return zero if the address could not be computed. */
11316 ada_unhandled_exception_name_addr (void)
11318 return parse_and_eval_address ("e.full_name");
11321 /* Same as ada_unhandled_exception_name_addr, except that this function
11322 should be used when the inferior uses an older version of the runtime,
11323 where the exception name needs to be extracted from a specific frame
11324 several frames up in the callstack. */
11327 ada_unhandled_exception_name_addr_from_raise (void)
11330 struct frame_info
*fi
;
11331 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11333 /* To determine the name of this exception, we need to select
11334 the frame corresponding to RAISE_SYM_NAME. This frame is
11335 at least 3 levels up, so we simply skip the first 3 frames
11336 without checking the name of their associated function. */
11337 fi
= get_current_frame ();
11338 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11340 fi
= get_prev_frame (fi
);
11344 enum language func_lang
;
11346 gdb::unique_xmalloc_ptr
<char> func_name
11347 = find_frame_funname (fi
, &func_lang
, NULL
);
11348 if (func_name
!= NULL
)
11350 if (strcmp (func_name
.get (),
11351 data
->exception_info
->catch_exception_sym
) == 0)
11352 break; /* We found the frame we were looking for... */
11354 fi
= get_prev_frame (fi
);
11361 return parse_and_eval_address ("id.full_name");
11364 /* Assuming the inferior just triggered an Ada exception catchpoint
11365 (of any type), return the address in inferior memory where the name
11366 of the exception is stored, if applicable.
11368 Assumes the selected frame is the current frame.
11370 Return zero if the address could not be computed, or if not relevant. */
11373 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11374 struct breakpoint
*b
)
11376 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11380 case ada_catch_exception
:
11381 return (parse_and_eval_address ("e.full_name"));
11384 case ada_catch_exception_unhandled
:
11385 return data
->exception_info
->unhandled_exception_name_addr ();
11388 case ada_catch_handlers
:
11389 return 0; /* The runtimes does not provide access to the exception
11393 case ada_catch_assert
:
11394 return 0; /* Exception name is not relevant in this case. */
11398 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11402 return 0; /* Should never be reached. */
11405 /* Assuming the inferior is stopped at an exception catchpoint,
11406 return the message which was associated to the exception, if
11407 available. Return NULL if the message could not be retrieved.
11409 Note: The exception message can be associated to an exception
11410 either through the use of the Raise_Exception function, or
11411 more simply (Ada 2005 and later), via:
11413 raise Exception_Name with "exception message";
11417 static gdb::unique_xmalloc_ptr
<char>
11418 ada_exception_message_1 (void)
11420 struct value
*e_msg_val
;
11423 /* For runtimes that support this feature, the exception message
11424 is passed as an unbounded string argument called "message". */
11425 e_msg_val
= parse_and_eval ("message");
11426 if (e_msg_val
== NULL
)
11427 return NULL
; /* Exception message not supported. */
11429 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
11430 gdb_assert (e_msg_val
!= NULL
);
11431 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
11433 /* If the message string is empty, then treat it as if there was
11434 no exception message. */
11435 if (e_msg_len
<= 0)
11438 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
11439 read_memory (value_address (e_msg_val
), (gdb_byte
*) e_msg
.get (),
11441 e_msg
.get ()[e_msg_len
] = '\0';
11446 /* Same as ada_exception_message_1, except that all exceptions are
11447 contained here (returning NULL instead). */
11449 static gdb::unique_xmalloc_ptr
<char>
11450 ada_exception_message (void)
11452 gdb::unique_xmalloc_ptr
<char> e_msg
;
11456 e_msg
= ada_exception_message_1 ();
11458 catch (const gdb_exception_error
&e
)
11460 e_msg
.reset (nullptr);
11466 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11467 any error that ada_exception_name_addr_1 might cause to be thrown.
11468 When an error is intercepted, a warning with the error message is printed,
11469 and zero is returned. */
11472 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11473 struct breakpoint
*b
)
11475 CORE_ADDR result
= 0;
11479 result
= ada_exception_name_addr_1 (ex
, b
);
11482 catch (const gdb_exception_error
&e
)
11484 warning (_("failed to get exception name: %s"), e
.what ());
11491 static std::string ada_exception_catchpoint_cond_string
11492 (const char *excep_string
,
11493 enum ada_exception_catchpoint_kind ex
);
11495 /* Ada catchpoints.
11497 In the case of catchpoints on Ada exceptions, the catchpoint will
11498 stop the target on every exception the program throws. When a user
11499 specifies the name of a specific exception, we translate this
11500 request into a condition expression (in text form), and then parse
11501 it into an expression stored in each of the catchpoint's locations.
11502 We then use this condition to check whether the exception that was
11503 raised is the one the user is interested in. If not, then the
11504 target is resumed again. We store the name of the requested
11505 exception, in order to be able to re-set the condition expression
11506 when symbols change. */
11508 /* An instance of this type is used to represent an Ada catchpoint
11509 breakpoint location. */
11511 class ada_catchpoint_location
: public bp_location
11514 ada_catchpoint_location (breakpoint
*owner
)
11515 : bp_location (owner
, bp_loc_software_breakpoint
)
11518 /* The condition that checks whether the exception that was raised
11519 is the specific exception the user specified on catchpoint
11521 expression_up excep_cond_expr
;
11524 /* An instance of this type is used to represent an Ada catchpoint. */
11526 struct ada_catchpoint
: public breakpoint
11528 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
11533 /* The name of the specific exception the user specified. */
11534 std::string excep_string
;
11536 /* What kind of catchpoint this is. */
11537 enum ada_exception_catchpoint_kind m_kind
;
11540 /* Parse the exception condition string in the context of each of the
11541 catchpoint's locations, and store them for later evaluation. */
11544 create_excep_cond_exprs (struct ada_catchpoint
*c
,
11545 enum ada_exception_catchpoint_kind ex
)
11547 struct bp_location
*bl
;
11549 /* Nothing to do if there's no specific exception to catch. */
11550 if (c
->excep_string
.empty ())
11553 /* Same if there are no locations... */
11554 if (c
->loc
== NULL
)
11557 /* Compute the condition expression in text form, from the specific
11558 expection we want to catch. */
11559 std::string cond_string
11560 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
11562 /* Iterate over all the catchpoint's locations, and parse an
11563 expression for each. */
11564 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
11566 struct ada_catchpoint_location
*ada_loc
11567 = (struct ada_catchpoint_location
*) bl
;
11570 if (!bl
->shlib_disabled
)
11574 s
= cond_string
.c_str ();
11577 exp
= parse_exp_1 (&s
, bl
->address
,
11578 block_for_pc (bl
->address
),
11581 catch (const gdb_exception_error
&e
)
11583 warning (_("failed to reevaluate internal exception condition "
11584 "for catchpoint %d: %s"),
11585 c
->number
, e
.what ());
11589 ada_loc
->excep_cond_expr
= std::move (exp
);
11593 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11594 structure for all exception catchpoint kinds. */
11596 static struct bp_location
*
11597 allocate_location_exception (struct breakpoint
*self
)
11599 return new ada_catchpoint_location (self
);
11602 /* Implement the RE_SET method in the breakpoint_ops structure for all
11603 exception catchpoint kinds. */
11606 re_set_exception (struct breakpoint
*b
)
11608 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11610 /* Call the base class's method. This updates the catchpoint's
11612 bkpt_breakpoint_ops
.re_set (b
);
11614 /* Reparse the exception conditional expressions. One for each
11616 create_excep_cond_exprs (c
, c
->m_kind
);
11619 /* Returns true if we should stop for this breakpoint hit. If the
11620 user specified a specific exception, we only want to cause a stop
11621 if the program thrown that exception. */
11624 should_stop_exception (const struct bp_location
*bl
)
11626 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
11627 const struct ada_catchpoint_location
*ada_loc
11628 = (const struct ada_catchpoint_location
*) bl
;
11631 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
11632 if (c
->m_kind
== ada_catch_assert
)
11633 clear_internalvar (var
);
11640 if (c
->m_kind
== ada_catch_handlers
)
11641 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
11642 ".all.occurrence.id");
11646 struct value
*exc
= parse_and_eval (expr
);
11647 set_internalvar (var
, exc
);
11649 catch (const gdb_exception_error
&ex
)
11651 clear_internalvar (var
);
11655 /* With no specific exception, should always stop. */
11656 if (c
->excep_string
.empty ())
11659 if (ada_loc
->excep_cond_expr
== NULL
)
11661 /* We will have a NULL expression if back when we were creating
11662 the expressions, this location's had failed to parse. */
11669 struct value
*mark
;
11671 mark
= value_mark ();
11672 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
11673 value_free_to_mark (mark
);
11675 catch (const gdb_exception
&ex
)
11677 exception_fprintf (gdb_stderr
, ex
,
11678 _("Error in testing exception condition:\n"));
11684 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11685 for all exception catchpoint kinds. */
11688 check_status_exception (bpstat bs
)
11690 bs
->stop
= should_stop_exception (bs
->bp_location_at
.get ());
11693 /* Implement the PRINT_IT method in the breakpoint_ops structure
11694 for all exception catchpoint kinds. */
11696 static enum print_stop_action
11697 print_it_exception (bpstat bs
)
11699 struct ui_out
*uiout
= current_uiout
;
11700 struct breakpoint
*b
= bs
->breakpoint_at
;
11702 annotate_catchpoint (b
->number
);
11704 if (uiout
->is_mi_like_p ())
11706 uiout
->field_string ("reason",
11707 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
11708 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
11711 uiout
->text (b
->disposition
== disp_del
11712 ? "\nTemporary catchpoint " : "\nCatchpoint ");
11713 uiout
->field_signed ("bkptno", b
->number
);
11714 uiout
->text (", ");
11716 /* ada_exception_name_addr relies on the selected frame being the
11717 current frame. Need to do this here because this function may be
11718 called more than once when printing a stop, and below, we'll
11719 select the first frame past the Ada run-time (see
11720 ada_find_printable_frame). */
11721 select_frame (get_current_frame ());
11723 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11726 case ada_catch_exception
:
11727 case ada_catch_exception_unhandled
:
11728 case ada_catch_handlers
:
11730 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
11731 char exception_name
[256];
11735 read_memory (addr
, (gdb_byte
*) exception_name
,
11736 sizeof (exception_name
) - 1);
11737 exception_name
[sizeof (exception_name
) - 1] = '\0';
11741 /* For some reason, we were unable to read the exception
11742 name. This could happen if the Runtime was compiled
11743 without debugging info, for instance. In that case,
11744 just replace the exception name by the generic string
11745 "exception" - it will read as "an exception" in the
11746 notification we are about to print. */
11747 memcpy (exception_name
, "exception", sizeof ("exception"));
11749 /* In the case of unhandled exception breakpoints, we print
11750 the exception name as "unhandled EXCEPTION_NAME", to make
11751 it clearer to the user which kind of catchpoint just got
11752 hit. We used ui_out_text to make sure that this extra
11753 info does not pollute the exception name in the MI case. */
11754 if (c
->m_kind
== ada_catch_exception_unhandled
)
11755 uiout
->text ("unhandled ");
11756 uiout
->field_string ("exception-name", exception_name
);
11759 case ada_catch_assert
:
11760 /* In this case, the name of the exception is not really
11761 important. Just print "failed assertion" to make it clearer
11762 that his program just hit an assertion-failure catchpoint.
11763 We used ui_out_text because this info does not belong in
11765 uiout
->text ("failed assertion");
11769 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
11770 if (exception_message
!= NULL
)
11772 uiout
->text (" (");
11773 uiout
->field_string ("exception-message", exception_message
.get ());
11777 uiout
->text (" at ");
11778 ada_find_printable_frame (get_current_frame ());
11780 return PRINT_SRC_AND_LOC
;
11783 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11784 for all exception catchpoint kinds. */
11787 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
11789 struct ui_out
*uiout
= current_uiout
;
11790 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11791 struct value_print_options opts
;
11793 get_user_print_options (&opts
);
11795 if (opts
.addressprint
)
11796 uiout
->field_skip ("addr");
11798 annotate_field (5);
11801 case ada_catch_exception
:
11802 if (!c
->excep_string
.empty ())
11804 std::string msg
= string_printf (_("`%s' Ada exception"),
11805 c
->excep_string
.c_str ());
11807 uiout
->field_string ("what", msg
);
11810 uiout
->field_string ("what", "all Ada exceptions");
11814 case ada_catch_exception_unhandled
:
11815 uiout
->field_string ("what", "unhandled Ada exceptions");
11818 case ada_catch_handlers
:
11819 if (!c
->excep_string
.empty ())
11821 uiout
->field_fmt ("what",
11822 _("`%s' Ada exception handlers"),
11823 c
->excep_string
.c_str ());
11826 uiout
->field_string ("what", "all Ada exceptions handlers");
11829 case ada_catch_assert
:
11830 uiout
->field_string ("what", "failed Ada assertions");
11834 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11839 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
11840 for all exception catchpoint kinds. */
11843 print_mention_exception (struct breakpoint
*b
)
11845 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11846 struct ui_out
*uiout
= current_uiout
;
11848 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
11849 : _("Catchpoint "));
11850 uiout
->field_signed ("bkptno", b
->number
);
11851 uiout
->text (": ");
11855 case ada_catch_exception
:
11856 if (!c
->excep_string
.empty ())
11858 std::string info
= string_printf (_("`%s' Ada exception"),
11859 c
->excep_string
.c_str ());
11860 uiout
->text (info
.c_str ());
11863 uiout
->text (_("all Ada exceptions"));
11866 case ada_catch_exception_unhandled
:
11867 uiout
->text (_("unhandled Ada exceptions"));
11870 case ada_catch_handlers
:
11871 if (!c
->excep_string
.empty ())
11874 = string_printf (_("`%s' Ada exception handlers"),
11875 c
->excep_string
.c_str ());
11876 uiout
->text (info
.c_str ());
11879 uiout
->text (_("all Ada exceptions handlers"));
11882 case ada_catch_assert
:
11883 uiout
->text (_("failed Ada assertions"));
11887 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11892 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
11893 for all exception catchpoint kinds. */
11896 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
11898 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11902 case ada_catch_exception
:
11903 fprintf_filtered (fp
, "catch exception");
11904 if (!c
->excep_string
.empty ())
11905 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
11908 case ada_catch_exception_unhandled
:
11909 fprintf_filtered (fp
, "catch exception unhandled");
11912 case ada_catch_handlers
:
11913 fprintf_filtered (fp
, "catch handlers");
11916 case ada_catch_assert
:
11917 fprintf_filtered (fp
, "catch assert");
11921 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11923 print_recreate_thread (b
, fp
);
11926 /* Virtual tables for various breakpoint types. */
11927 static struct breakpoint_ops catch_exception_breakpoint_ops
;
11928 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
11929 static struct breakpoint_ops catch_assert_breakpoint_ops
;
11930 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
11932 /* See ada-lang.h. */
11935 is_ada_exception_catchpoint (breakpoint
*bp
)
11937 return (bp
->ops
== &catch_exception_breakpoint_ops
11938 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
11939 || bp
->ops
== &catch_assert_breakpoint_ops
11940 || bp
->ops
== &catch_handlers_breakpoint_ops
);
11943 /* Split the arguments specified in a "catch exception" command.
11944 Set EX to the appropriate catchpoint type.
11945 Set EXCEP_STRING to the name of the specific exception if
11946 specified by the user.
11947 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
11948 "catch handlers" command. False otherwise.
11949 If a condition is found at the end of the arguments, the condition
11950 expression is stored in COND_STRING (memory must be deallocated
11951 after use). Otherwise COND_STRING is set to NULL. */
11954 catch_ada_exception_command_split (const char *args
,
11955 bool is_catch_handlers_cmd
,
11956 enum ada_exception_catchpoint_kind
*ex
,
11957 std::string
*excep_string
,
11958 std::string
*cond_string
)
11960 std::string exception_name
;
11962 exception_name
= extract_arg (&args
);
11963 if (exception_name
== "if")
11965 /* This is not an exception name; this is the start of a condition
11966 expression for a catchpoint on all exceptions. So, "un-get"
11967 this token, and set exception_name to NULL. */
11968 exception_name
.clear ();
11972 /* Check to see if we have a condition. */
11974 args
= skip_spaces (args
);
11975 if (startswith (args
, "if")
11976 && (isspace (args
[2]) || args
[2] == '\0'))
11979 args
= skip_spaces (args
);
11981 if (args
[0] == '\0')
11982 error (_("Condition missing after `if' keyword"));
11983 *cond_string
= args
;
11985 args
+= strlen (args
);
11988 /* Check that we do not have any more arguments. Anything else
11991 if (args
[0] != '\0')
11992 error (_("Junk at end of expression"));
11994 if (is_catch_handlers_cmd
)
11996 /* Catch handling of exceptions. */
11997 *ex
= ada_catch_handlers
;
11998 *excep_string
= exception_name
;
12000 else if (exception_name
.empty ())
12002 /* Catch all exceptions. */
12003 *ex
= ada_catch_exception
;
12004 excep_string
->clear ();
12006 else if (exception_name
== "unhandled")
12008 /* Catch unhandled exceptions. */
12009 *ex
= ada_catch_exception_unhandled
;
12010 excep_string
->clear ();
12014 /* Catch a specific exception. */
12015 *ex
= ada_catch_exception
;
12016 *excep_string
= exception_name
;
12020 /* Return the name of the symbol on which we should break in order to
12021 implement a catchpoint of the EX kind. */
12023 static const char *
12024 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12026 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12028 gdb_assert (data
->exception_info
!= NULL
);
12032 case ada_catch_exception
:
12033 return (data
->exception_info
->catch_exception_sym
);
12035 case ada_catch_exception_unhandled
:
12036 return (data
->exception_info
->catch_exception_unhandled_sym
);
12038 case ada_catch_assert
:
12039 return (data
->exception_info
->catch_assert_sym
);
12041 case ada_catch_handlers
:
12042 return (data
->exception_info
->catch_handlers_sym
);
12045 internal_error (__FILE__
, __LINE__
,
12046 _("unexpected catchpoint kind (%d)"), ex
);
12050 /* Return the breakpoint ops "virtual table" used for catchpoints
12053 static const struct breakpoint_ops
*
12054 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12058 case ada_catch_exception
:
12059 return (&catch_exception_breakpoint_ops
);
12061 case ada_catch_exception_unhandled
:
12062 return (&catch_exception_unhandled_breakpoint_ops
);
12064 case ada_catch_assert
:
12065 return (&catch_assert_breakpoint_ops
);
12067 case ada_catch_handlers
:
12068 return (&catch_handlers_breakpoint_ops
);
12071 internal_error (__FILE__
, __LINE__
,
12072 _("unexpected catchpoint kind (%d)"), ex
);
12076 /* Return the condition that will be used to match the current exception
12077 being raised with the exception that the user wants to catch. This
12078 assumes that this condition is used when the inferior just triggered
12079 an exception catchpoint.
12080 EX: the type of catchpoints used for catching Ada exceptions. */
12083 ada_exception_catchpoint_cond_string (const char *excep_string
,
12084 enum ada_exception_catchpoint_kind ex
)
12087 bool is_standard_exc
= false;
12088 std::string result
;
12090 if (ex
== ada_catch_handlers
)
12092 /* For exception handlers catchpoints, the condition string does
12093 not use the same parameter as for the other exceptions. */
12094 result
= ("long_integer (GNAT_GCC_exception_Access"
12095 "(gcc_exception).all.occurrence.id)");
12098 result
= "long_integer (e)";
12100 /* The standard exceptions are a special case. They are defined in
12101 runtime units that have been compiled without debugging info; if
12102 EXCEP_STRING is the not-fully-qualified name of a standard
12103 exception (e.g. "constraint_error") then, during the evaluation
12104 of the condition expression, the symbol lookup on this name would
12105 *not* return this standard exception. The catchpoint condition
12106 may then be set only on user-defined exceptions which have the
12107 same not-fully-qualified name (e.g. my_package.constraint_error).
12109 To avoid this unexcepted behavior, these standard exceptions are
12110 systematically prefixed by "standard". This means that "catch
12111 exception constraint_error" is rewritten into "catch exception
12112 standard.constraint_error".
12114 If an exception named constraint_error is defined in another package of
12115 the inferior program, then the only way to specify this exception as a
12116 breakpoint condition is to use its fully-qualified named:
12117 e.g. my_package.constraint_error. */
12119 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12121 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12123 is_standard_exc
= true;
12130 if (is_standard_exc
)
12131 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12133 string_appendf (result
, "long_integer (&%s)", excep_string
);
12138 /* Return the symtab_and_line that should be used to insert an exception
12139 catchpoint of the TYPE kind.
12141 ADDR_STRING returns the name of the function where the real
12142 breakpoint that implements the catchpoints is set, depending on the
12143 type of catchpoint we need to create. */
12145 static struct symtab_and_line
12146 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12147 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12149 const char *sym_name
;
12150 struct symbol
*sym
;
12152 /* First, find out which exception support info to use. */
12153 ada_exception_support_info_sniffer ();
12155 /* Then lookup the function on which we will break in order to catch
12156 the Ada exceptions requested by the user. */
12157 sym_name
= ada_exception_sym_name (ex
);
12158 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12161 error (_("Catchpoint symbol not found: %s"), sym_name
);
12163 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12164 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12166 /* Set ADDR_STRING. */
12167 *addr_string
= sym_name
;
12170 *ops
= ada_exception_breakpoint_ops (ex
);
12172 return find_function_start_sal (sym
, 1);
12175 /* Create an Ada exception catchpoint.
12177 EX_KIND is the kind of exception catchpoint to be created.
12179 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12180 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12181 of the exception to which this catchpoint applies.
12183 COND_STRING, if not empty, is the catchpoint condition.
12185 TEMPFLAG, if nonzero, means that the underlying breakpoint
12186 should be temporary.
12188 FROM_TTY is the usual argument passed to all commands implementations. */
12191 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12192 enum ada_exception_catchpoint_kind ex_kind
,
12193 const std::string
&excep_string
,
12194 const std::string
&cond_string
,
12199 std::string addr_string
;
12200 const struct breakpoint_ops
*ops
= NULL
;
12201 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12203 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12204 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12205 ops
, tempflag
, disabled
, from_tty
);
12206 c
->excep_string
= excep_string
;
12207 create_excep_cond_exprs (c
.get (), ex_kind
);
12208 if (!cond_string
.empty ())
12209 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
, false);
12210 install_breakpoint (0, std::move (c
), 1);
12213 /* Implement the "catch exception" command. */
12216 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12217 struct cmd_list_element
*command
)
12219 const char *arg
= arg_entry
;
12220 struct gdbarch
*gdbarch
= get_current_arch ();
12222 enum ada_exception_catchpoint_kind ex_kind
;
12223 std::string excep_string
;
12224 std::string cond_string
;
12226 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12230 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12232 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12233 excep_string
, cond_string
,
12234 tempflag
, 1 /* enabled */,
12238 /* Implement the "catch handlers" command. */
12241 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12242 struct cmd_list_element
*command
)
12244 const char *arg
= arg_entry
;
12245 struct gdbarch
*gdbarch
= get_current_arch ();
12247 enum ada_exception_catchpoint_kind ex_kind
;
12248 std::string excep_string
;
12249 std::string cond_string
;
12251 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12255 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
12257 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12258 excep_string
, cond_string
,
12259 tempflag
, 1 /* enabled */,
12263 /* Completion function for the Ada "catch" commands. */
12266 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
12267 const char *text
, const char *word
)
12269 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
12271 for (const ada_exc_info
&info
: exceptions
)
12273 if (startswith (info
.name
, word
))
12274 tracker
.add_completion (make_unique_xstrdup (info
.name
));
12278 /* Split the arguments specified in a "catch assert" command.
12280 ARGS contains the command's arguments (or the empty string if
12281 no arguments were passed).
12283 If ARGS contains a condition, set COND_STRING to that condition
12284 (the memory needs to be deallocated after use). */
12287 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
12289 args
= skip_spaces (args
);
12291 /* Check whether a condition was provided. */
12292 if (startswith (args
, "if")
12293 && (isspace (args
[2]) || args
[2] == '\0'))
12296 args
= skip_spaces (args
);
12297 if (args
[0] == '\0')
12298 error (_("condition missing after `if' keyword"));
12299 cond_string
.assign (args
);
12302 /* Otherwise, there should be no other argument at the end of
12304 else if (args
[0] != '\0')
12305 error (_("Junk at end of arguments."));
12308 /* Implement the "catch assert" command. */
12311 catch_assert_command (const char *arg_entry
, int from_tty
,
12312 struct cmd_list_element
*command
)
12314 const char *arg
= arg_entry
;
12315 struct gdbarch
*gdbarch
= get_current_arch ();
12317 std::string cond_string
;
12319 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12323 catch_ada_assert_command_split (arg
, cond_string
);
12324 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12326 tempflag
, 1 /* enabled */,
12330 /* Return non-zero if the symbol SYM is an Ada exception object. */
12333 ada_is_exception_sym (struct symbol
*sym
)
12335 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
12337 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12338 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12339 && SYMBOL_CLASS (sym
) != LOC_CONST
12340 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12341 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12344 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12345 Ada exception object. This matches all exceptions except the ones
12346 defined by the Ada language. */
12349 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12353 if (!ada_is_exception_sym (sym
))
12356 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12357 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
12358 return 0; /* A standard exception. */
12360 /* Numeric_Error is also a standard exception, so exclude it.
12361 See the STANDARD_EXC description for more details as to why
12362 this exception is not listed in that array. */
12363 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
12369 /* A helper function for std::sort, comparing two struct ada_exc_info
12372 The comparison is determined first by exception name, and then
12373 by exception address. */
12376 ada_exc_info::operator< (const ada_exc_info
&other
) const
12380 result
= strcmp (name
, other
.name
);
12383 if (result
== 0 && addr
< other
.addr
)
12389 ada_exc_info::operator== (const ada_exc_info
&other
) const
12391 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
12394 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12395 routine, but keeping the first SKIP elements untouched.
12397 All duplicates are also removed. */
12400 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
12403 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
12404 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
12405 exceptions
->end ());
12408 /* Add all exceptions defined by the Ada standard whose name match
12409 a regular expression.
12411 If PREG is not NULL, then this regexp_t object is used to
12412 perform the symbol name matching. Otherwise, no name-based
12413 filtering is performed.
12415 EXCEPTIONS is a vector of exceptions to which matching exceptions
12419 ada_add_standard_exceptions (compiled_regex
*preg
,
12420 std::vector
<ada_exc_info
> *exceptions
)
12424 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12427 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
12429 struct bound_minimal_symbol msymbol
12430 = ada_lookup_simple_minsym (standard_exc
[i
]);
12432 if (msymbol
.minsym
!= NULL
)
12434 struct ada_exc_info info
12435 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12437 exceptions
->push_back (info
);
12443 /* Add all Ada exceptions defined locally and accessible from the given
12446 If PREG is not NULL, then this regexp_t object is used to
12447 perform the symbol name matching. Otherwise, no name-based
12448 filtering is performed.
12450 EXCEPTIONS is a vector of exceptions to which matching exceptions
12454 ada_add_exceptions_from_frame (compiled_regex
*preg
,
12455 struct frame_info
*frame
,
12456 std::vector
<ada_exc_info
> *exceptions
)
12458 const struct block
*block
= get_frame_block (frame
, 0);
12462 struct block_iterator iter
;
12463 struct symbol
*sym
;
12465 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12467 switch (SYMBOL_CLASS (sym
))
12474 if (ada_is_exception_sym (sym
))
12476 struct ada_exc_info info
= {sym
->print_name (),
12477 SYMBOL_VALUE_ADDRESS (sym
)};
12479 exceptions
->push_back (info
);
12483 if (BLOCK_FUNCTION (block
) != NULL
)
12485 block
= BLOCK_SUPERBLOCK (block
);
12489 /* Return true if NAME matches PREG or if PREG is NULL. */
12492 name_matches_regex (const char *name
, compiled_regex
*preg
)
12494 return (preg
== NULL
12495 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
12498 /* Add all exceptions defined globally whose name name match
12499 a regular expression, excluding standard exceptions.
12501 The reason we exclude standard exceptions is that they need
12502 to be handled separately: Standard exceptions are defined inside
12503 a runtime unit which is normally not compiled with debugging info,
12504 and thus usually do not show up in our symbol search. However,
12505 if the unit was in fact built with debugging info, we need to
12506 exclude them because they would duplicate the entry we found
12507 during the special loop that specifically searches for those
12508 standard exceptions.
12510 If PREG is not NULL, then this regexp_t object is used to
12511 perform the symbol name matching. Otherwise, no name-based
12512 filtering is performed.
12514 EXCEPTIONS is a vector of exceptions to which matching exceptions
12518 ada_add_global_exceptions (compiled_regex
*preg
,
12519 std::vector
<ada_exc_info
> *exceptions
)
12521 /* In Ada, the symbol "search name" is a linkage name, whereas the
12522 regular expression used to do the matching refers to the natural
12523 name. So match against the decoded name. */
12524 expand_symtabs_matching (NULL
,
12525 lookup_name_info::match_any (),
12526 [&] (const char *search_name
)
12528 std::string decoded
= ada_decode (search_name
);
12529 return name_matches_regex (decoded
.c_str (), preg
);
12534 for (objfile
*objfile
: current_program_space
->objfiles ())
12536 for (compunit_symtab
*s
: objfile
->compunits ())
12538 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
12541 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
12543 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
12544 struct block_iterator iter
;
12545 struct symbol
*sym
;
12547 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
12548 if (ada_is_non_standard_exception_sym (sym
)
12549 && name_matches_regex (sym
->natural_name (), preg
))
12551 struct ada_exc_info info
12552 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
12554 exceptions
->push_back (info
);
12561 /* Implements ada_exceptions_list with the regular expression passed
12562 as a regex_t, rather than a string.
12564 If not NULL, PREG is used to filter out exceptions whose names
12565 do not match. Otherwise, all exceptions are listed. */
12567 static std::vector
<ada_exc_info
>
12568 ada_exceptions_list_1 (compiled_regex
*preg
)
12570 std::vector
<ada_exc_info
> result
;
12573 /* First, list the known standard exceptions. These exceptions
12574 need to be handled separately, as they are usually defined in
12575 runtime units that have been compiled without debugging info. */
12577 ada_add_standard_exceptions (preg
, &result
);
12579 /* Next, find all exceptions whose scope is local and accessible
12580 from the currently selected frame. */
12582 if (has_stack_frames ())
12584 prev_len
= result
.size ();
12585 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
12587 if (result
.size () > prev_len
)
12588 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12591 /* Add all exceptions whose scope is global. */
12593 prev_len
= result
.size ();
12594 ada_add_global_exceptions (preg
, &result
);
12595 if (result
.size () > prev_len
)
12596 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12601 /* Return a vector of ada_exc_info.
12603 If REGEXP is NULL, all exceptions are included in the result.
12604 Otherwise, it should contain a valid regular expression,
12605 and only the exceptions whose names match that regular expression
12606 are included in the result.
12608 The exceptions are sorted in the following order:
12609 - Standard exceptions (defined by the Ada language), in
12610 alphabetical order;
12611 - Exceptions only visible from the current frame, in
12612 alphabetical order;
12613 - Exceptions whose scope is global, in alphabetical order. */
12615 std::vector
<ada_exc_info
>
12616 ada_exceptions_list (const char *regexp
)
12618 if (regexp
== NULL
)
12619 return ada_exceptions_list_1 (NULL
);
12621 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
12622 return ada_exceptions_list_1 (®
);
12625 /* Implement the "info exceptions" command. */
12628 info_exceptions_command (const char *regexp
, int from_tty
)
12630 struct gdbarch
*gdbarch
= get_current_arch ();
12632 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
12634 if (regexp
!= NULL
)
12636 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
12638 printf_filtered (_("All defined Ada exceptions:\n"));
12640 for (const ada_exc_info
&info
: exceptions
)
12641 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
12645 /* Language vector */
12647 /* symbol_name_matcher_ftype adapter for wild_match. */
12650 do_wild_match (const char *symbol_search_name
,
12651 const lookup_name_info
&lookup_name
,
12652 completion_match_result
*comp_match_res
)
12654 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
12657 /* symbol_name_matcher_ftype adapter for full_match. */
12660 do_full_match (const char *symbol_search_name
,
12661 const lookup_name_info
&lookup_name
,
12662 completion_match_result
*comp_match_res
)
12664 const char *lname
= lookup_name
.ada ().lookup_name ().c_str ();
12666 /* If both symbols start with "_ada_", just let the loop below
12667 handle the comparison. However, if only the symbol name starts
12668 with "_ada_", skip the prefix and let the match proceed as
12670 if (startswith (symbol_search_name
, "_ada_")
12671 && !startswith (lname
, "_ada"))
12672 symbol_search_name
+= 5;
12674 int uscore_count
= 0;
12675 while (*lname
!= '\0')
12677 if (*symbol_search_name
!= *lname
)
12679 if (*symbol_search_name
== 'B' && uscore_count
== 2
12680 && symbol_search_name
[1] == '_')
12682 symbol_search_name
+= 2;
12683 while (isdigit (*symbol_search_name
))
12684 ++symbol_search_name
;
12685 if (symbol_search_name
[0] == '_'
12686 && symbol_search_name
[1] == '_')
12688 symbol_search_name
+= 2;
12695 if (*symbol_search_name
== '_')
12700 ++symbol_search_name
;
12704 return is_name_suffix (symbol_search_name
);
12707 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
12710 do_exact_match (const char *symbol_search_name
,
12711 const lookup_name_info
&lookup_name
,
12712 completion_match_result
*comp_match_res
)
12714 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
12717 /* Build the Ada lookup name for LOOKUP_NAME. */
12719 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
12721 gdb::string_view user_name
= lookup_name
.name ();
12723 if (!user_name
.empty () && user_name
[0] == '<')
12725 if (user_name
.back () == '>')
12727 = gdb::to_string (user_name
.substr (1, user_name
.size () - 2));
12730 = gdb::to_string (user_name
.substr (1, user_name
.size () - 1));
12731 m_encoded_p
= true;
12732 m_verbatim_p
= true;
12733 m_wild_match_p
= false;
12734 m_standard_p
= false;
12738 m_verbatim_p
= false;
12740 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
12744 const char *folded
= ada_fold_name (user_name
);
12745 m_encoded_name
= ada_encode_1 (folded
, false);
12746 if (m_encoded_name
.empty ())
12747 m_encoded_name
= gdb::to_string (user_name
);
12750 m_encoded_name
= gdb::to_string (user_name
);
12752 /* Handle the 'package Standard' special case. See description
12753 of m_standard_p. */
12754 if (startswith (m_encoded_name
.c_str (), "standard__"))
12756 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
12757 m_standard_p
= true;
12760 m_standard_p
= false;
12762 /* If the name contains a ".", then the user is entering a fully
12763 qualified entity name, and the match must not be done in wild
12764 mode. Similarly, if the user wants to complete what looks
12765 like an encoded name, the match must not be done in wild
12766 mode. Also, in the standard__ special case always do
12767 non-wild matching. */
12769 = (lookup_name
.match_type () != symbol_name_match_type::FULL
12772 && user_name
.find ('.') == std::string::npos
);
12776 /* symbol_name_matcher_ftype method for Ada. This only handles
12777 completion mode. */
12780 ada_symbol_name_matches (const char *symbol_search_name
,
12781 const lookup_name_info
&lookup_name
,
12782 completion_match_result
*comp_match_res
)
12784 return lookup_name
.ada ().matches (symbol_search_name
,
12785 lookup_name
.match_type (),
12789 /* A name matcher that matches the symbol name exactly, with
12793 literal_symbol_name_matcher (const char *symbol_search_name
,
12794 const lookup_name_info
&lookup_name
,
12795 completion_match_result
*comp_match_res
)
12797 gdb::string_view name_view
= lookup_name
.name ();
12799 if (lookup_name
.completion_mode ()
12800 ? (strncmp (symbol_search_name
, name_view
.data (),
12801 name_view
.size ()) == 0)
12802 : symbol_search_name
== name_view
)
12804 if (comp_match_res
!= NULL
)
12805 comp_match_res
->set_match (symbol_search_name
);
12812 /* Implement the "get_symbol_name_matcher" language_defn method for
12815 static symbol_name_matcher_ftype
*
12816 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
12818 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
12819 return literal_symbol_name_matcher
;
12821 if (lookup_name
.completion_mode ())
12822 return ada_symbol_name_matches
;
12825 if (lookup_name
.ada ().wild_match_p ())
12826 return do_wild_match
;
12827 else if (lookup_name
.ada ().verbatim_p ())
12828 return do_exact_match
;
12830 return do_full_match
;
12834 /* Class representing the Ada language. */
12836 class ada_language
: public language_defn
12840 : language_defn (language_ada
)
12843 /* See language.h. */
12845 const char *name () const override
12848 /* See language.h. */
12850 const char *natural_name () const override
12853 /* See language.h. */
12855 const std::vector
<const char *> &filename_extensions () const override
12857 static const std::vector
<const char *> extensions
12858 = { ".adb", ".ads", ".a", ".ada", ".dg" };
12862 /* Print an array element index using the Ada syntax. */
12864 void print_array_index (struct type
*index_type
,
12866 struct ui_file
*stream
,
12867 const value_print_options
*options
) const override
12869 struct value
*index_value
= val_atr (index_type
, index
);
12871 value_print (index_value
, stream
, options
);
12872 fprintf_filtered (stream
, " => ");
12875 /* Implement the "read_var_value" language_defn method for Ada. */
12877 struct value
*read_var_value (struct symbol
*var
,
12878 const struct block
*var_block
,
12879 struct frame_info
*frame
) const override
12881 /* The only case where default_read_var_value is not sufficient
12882 is when VAR is a renaming... */
12883 if (frame
!= nullptr)
12885 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
12886 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
12887 return ada_read_renaming_var_value (var
, frame_block
);
12890 /* This is a typical case where we expect the default_read_var_value
12891 function to work. */
12892 return language_defn::read_var_value (var
, var_block
, frame
);
12895 /* See language.h. */
12896 void language_arch_info (struct gdbarch
*gdbarch
,
12897 struct language_arch_info
*lai
) const override
12899 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
12901 /* Helper function to allow shorter lines below. */
12902 auto add
= [&] (struct type
*t
)
12904 lai
->add_primitive_type (t
);
12907 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12909 add (arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
12910 0, "long_integer"));
12911 add (arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
12912 0, "short_integer"));
12913 struct type
*char_type
= arch_character_type (gdbarch
, TARGET_CHAR_BIT
,
12915 lai
->set_string_char_type (char_type
);
12917 add (arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
12918 "float", gdbarch_float_format (gdbarch
)));
12919 add (arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
12920 "long_float", gdbarch_double_format (gdbarch
)));
12921 add (arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
12922 0, "long_long_integer"));
12923 add (arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
12925 gdbarch_long_double_format (gdbarch
)));
12926 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12928 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12930 add (builtin
->builtin_void
);
12932 struct type
*system_addr_ptr
12933 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
12935 system_addr_ptr
->set_name ("system__address");
12936 add (system_addr_ptr
);
12938 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
12939 type. This is a signed integral type whose size is the same as
12940 the size of addresses. */
12941 unsigned int addr_length
= TYPE_LENGTH (system_addr_ptr
);
12942 add (arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
12943 "storage_offset"));
12945 lai
->set_bool_type (builtin
->builtin_bool
);
12948 /* See language.h. */
12950 bool iterate_over_symbols
12951 (const struct block
*block
, const lookup_name_info
&name
,
12952 domain_enum domain
,
12953 gdb::function_view
<symbol_found_callback_ftype
> callback
) const override
12955 std::vector
<struct block_symbol
> results
12956 = ada_lookup_symbol_list_worker (name
, block
, domain
, 0);
12957 for (block_symbol
&sym
: results
)
12959 if (!callback (&sym
))
12966 /* See language.h. */
12967 bool sniff_from_mangled_name (const char *mangled
,
12968 char **out
) const override
12970 std::string demangled
= ada_decode (mangled
);
12974 if (demangled
!= mangled
&& demangled
[0] != '<')
12976 /* Set the gsymbol language to Ada, but still return 0.
12977 Two reasons for that:
12979 1. For Ada, we prefer computing the symbol's decoded name
12980 on the fly rather than pre-compute it, in order to save
12981 memory (Ada projects are typically very large).
12983 2. There are some areas in the definition of the GNAT
12984 encoding where, with a bit of bad luck, we might be able
12985 to decode a non-Ada symbol, generating an incorrect
12986 demangled name (Eg: names ending with "TB" for instance
12987 are identified as task bodies and so stripped from
12988 the decoded name returned).
12990 Returning true, here, but not setting *DEMANGLED, helps us get
12991 a little bit of the best of both worlds. Because we're last,
12992 we should not affect any of the other languages that were
12993 able to demangle the symbol before us; we get to correctly
12994 tag Ada symbols as such; and even if we incorrectly tagged a
12995 non-Ada symbol, which should be rare, any routing through the
12996 Ada language should be transparent (Ada tries to behave much
12997 like C/C++ with non-Ada symbols). */
13004 /* See language.h. */
13006 char *demangle_symbol (const char *mangled
, int options
) const override
13008 return ada_la_decode (mangled
, options
);
13011 /* See language.h. */
13013 void print_type (struct type
*type
, const char *varstring
,
13014 struct ui_file
*stream
, int show
, int level
,
13015 const struct type_print_options
*flags
) const override
13017 ada_print_type (type
, varstring
, stream
, show
, level
, flags
);
13020 /* See language.h. */
13022 const char *word_break_characters (void) const override
13024 return ada_completer_word_break_characters
;
13027 /* See language.h. */
13029 void collect_symbol_completion_matches (completion_tracker
&tracker
,
13030 complete_symbol_mode mode
,
13031 symbol_name_match_type name_match_type
,
13032 const char *text
, const char *word
,
13033 enum type_code code
) const override
13035 struct symbol
*sym
;
13036 const struct block
*b
, *surrounding_static_block
= 0;
13037 struct block_iterator iter
;
13039 gdb_assert (code
== TYPE_CODE_UNDEF
);
13041 lookup_name_info
lookup_name (text
, name_match_type
, true);
13043 /* First, look at the partial symtab symbols. */
13044 expand_symtabs_matching (NULL
,
13050 /* At this point scan through the misc symbol vectors and add each
13051 symbol you find to the list. Eventually we want to ignore
13052 anything that isn't a text symbol (everything else will be
13053 handled by the psymtab code above). */
13055 for (objfile
*objfile
: current_program_space
->objfiles ())
13057 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
13061 if (completion_skip_symbol (mode
, msymbol
))
13064 language symbol_language
= msymbol
->language ();
13066 /* Ada minimal symbols won't have their language set to Ada. If
13067 we let completion_list_add_name compare using the
13068 default/C-like matcher, then when completing e.g., symbols in a
13069 package named "pck", we'd match internal Ada symbols like
13070 "pckS", which are invalid in an Ada expression, unless you wrap
13071 them in '<' '>' to request a verbatim match.
13073 Unfortunately, some Ada encoded names successfully demangle as
13074 C++ symbols (using an old mangling scheme), such as "name__2Xn"
13075 -> "Xn::name(void)" and thus some Ada minimal symbols end up
13076 with the wrong language set. Paper over that issue here. */
13077 if (symbol_language
== language_auto
13078 || symbol_language
== language_cplus
)
13079 symbol_language
= language_ada
;
13081 completion_list_add_name (tracker
,
13083 msymbol
->linkage_name (),
13084 lookup_name
, text
, word
);
13088 /* Search upwards from currently selected frame (so that we can
13089 complete on local vars. */
13091 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
13093 if (!BLOCK_SUPERBLOCK (b
))
13094 surrounding_static_block
= b
; /* For elmin of dups */
13096 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13098 if (completion_skip_symbol (mode
, sym
))
13101 completion_list_add_name (tracker
,
13103 sym
->linkage_name (),
13104 lookup_name
, text
, word
);
13108 /* Go through the symtabs and check the externs and statics for
13109 symbols which match. */
13111 for (objfile
*objfile
: current_program_space
->objfiles ())
13113 for (compunit_symtab
*s
: objfile
->compunits ())
13116 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
13117 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13119 if (completion_skip_symbol (mode
, sym
))
13122 completion_list_add_name (tracker
,
13124 sym
->linkage_name (),
13125 lookup_name
, text
, word
);
13130 for (objfile
*objfile
: current_program_space
->objfiles ())
13132 for (compunit_symtab
*s
: objfile
->compunits ())
13135 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
13136 /* Don't do this block twice. */
13137 if (b
== surrounding_static_block
)
13139 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13141 if (completion_skip_symbol (mode
, sym
))
13144 completion_list_add_name (tracker
,
13146 sym
->linkage_name (),
13147 lookup_name
, text
, word
);
13153 /* See language.h. */
13155 gdb::unique_xmalloc_ptr
<char> watch_location_expression
13156 (struct type
*type
, CORE_ADDR addr
) const override
13158 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
13159 std::string name
= type_to_string (type
);
13160 return gdb::unique_xmalloc_ptr
<char>
13161 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
13164 /* See language.h. */
13166 void value_print (struct value
*val
, struct ui_file
*stream
,
13167 const struct value_print_options
*options
) const override
13169 return ada_value_print (val
, stream
, options
);
13172 /* See language.h. */
13174 void value_print_inner
13175 (struct value
*val
, struct ui_file
*stream
, int recurse
,
13176 const struct value_print_options
*options
) const override
13178 return ada_value_print_inner (val
, stream
, recurse
, options
);
13181 /* See language.h. */
13183 struct block_symbol lookup_symbol_nonlocal
13184 (const char *name
, const struct block
*block
,
13185 const domain_enum domain
) const override
13187 struct block_symbol sym
;
13189 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
13190 if (sym
.symbol
!= NULL
)
13193 /* If we haven't found a match at this point, try the primitive
13194 types. In other languages, this search is performed before
13195 searching for global symbols in order to short-circuit that
13196 global-symbol search if it happens that the name corresponds
13197 to a primitive type. But we cannot do the same in Ada, because
13198 it is perfectly legitimate for a program to declare a type which
13199 has the same name as a standard type. If looking up a type in
13200 that situation, we have traditionally ignored the primitive type
13201 in favor of user-defined types. This is why, unlike most other
13202 languages, we search the primitive types this late and only after
13203 having searched the global symbols without success. */
13205 if (domain
== VAR_DOMAIN
)
13207 struct gdbarch
*gdbarch
;
13210 gdbarch
= target_gdbarch ();
13212 gdbarch
= block_gdbarch (block
);
13214 = language_lookup_primitive_type_as_symbol (this, gdbarch
, name
);
13215 if (sym
.symbol
!= NULL
)
13222 /* See language.h. */
13224 int parser (struct parser_state
*ps
) const override
13226 warnings_issued
= 0;
13227 return ada_parse (ps
);
13230 /* See language.h. */
13232 void emitchar (int ch
, struct type
*chtype
,
13233 struct ui_file
*stream
, int quoter
) const override
13235 ada_emit_char (ch
, chtype
, stream
, quoter
, 1);
13238 /* See language.h. */
13240 void printchar (int ch
, struct type
*chtype
,
13241 struct ui_file
*stream
) const override
13243 ada_printchar (ch
, chtype
, stream
);
13246 /* See language.h. */
13248 void printstr (struct ui_file
*stream
, struct type
*elttype
,
13249 const gdb_byte
*string
, unsigned int length
,
13250 const char *encoding
, int force_ellipses
,
13251 const struct value_print_options
*options
) const override
13253 ada_printstr (stream
, elttype
, string
, length
, encoding
,
13254 force_ellipses
, options
);
13257 /* See language.h. */
13259 void print_typedef (struct type
*type
, struct symbol
*new_symbol
,
13260 struct ui_file
*stream
) const override
13262 ada_print_typedef (type
, new_symbol
, stream
);
13265 /* See language.h. */
13267 bool is_string_type_p (struct type
*type
) const override
13269 return ada_is_string_type (type
);
13272 /* See language.h. */
13274 const char *struct_too_deep_ellipsis () const override
13275 { return "(...)"; }
13277 /* See language.h. */
13279 bool c_style_arrays_p () const override
13282 /* See language.h. */
13284 bool store_sym_names_in_linkage_form_p () const override
13287 /* See language.h. */
13289 const struct lang_varobj_ops
*varobj_ops () const override
13290 { return &ada_varobj_ops
; }
13293 /* See language.h. */
13295 symbol_name_matcher_ftype
*get_symbol_name_matcher_inner
13296 (const lookup_name_info
&lookup_name
) const override
13298 return ada_get_symbol_name_matcher (lookup_name
);
13302 /* Single instance of the Ada language class. */
13304 static ada_language ada_language_defn
;
13306 /* Command-list for the "set/show ada" prefix command. */
13307 static struct cmd_list_element
*set_ada_list
;
13308 static struct cmd_list_element
*show_ada_list
;
13311 initialize_ada_catchpoint_ops (void)
13313 struct breakpoint_ops
*ops
;
13315 initialize_breakpoint_ops ();
13317 ops
= &catch_exception_breakpoint_ops
;
13318 *ops
= bkpt_breakpoint_ops
;
13319 ops
->allocate_location
= allocate_location_exception
;
13320 ops
->re_set
= re_set_exception
;
13321 ops
->check_status
= check_status_exception
;
13322 ops
->print_it
= print_it_exception
;
13323 ops
->print_one
= print_one_exception
;
13324 ops
->print_mention
= print_mention_exception
;
13325 ops
->print_recreate
= print_recreate_exception
;
13327 ops
= &catch_exception_unhandled_breakpoint_ops
;
13328 *ops
= bkpt_breakpoint_ops
;
13329 ops
->allocate_location
= allocate_location_exception
;
13330 ops
->re_set
= re_set_exception
;
13331 ops
->check_status
= check_status_exception
;
13332 ops
->print_it
= print_it_exception
;
13333 ops
->print_one
= print_one_exception
;
13334 ops
->print_mention
= print_mention_exception
;
13335 ops
->print_recreate
= print_recreate_exception
;
13337 ops
= &catch_assert_breakpoint_ops
;
13338 *ops
= bkpt_breakpoint_ops
;
13339 ops
->allocate_location
= allocate_location_exception
;
13340 ops
->re_set
= re_set_exception
;
13341 ops
->check_status
= check_status_exception
;
13342 ops
->print_it
= print_it_exception
;
13343 ops
->print_one
= print_one_exception
;
13344 ops
->print_mention
= print_mention_exception
;
13345 ops
->print_recreate
= print_recreate_exception
;
13347 ops
= &catch_handlers_breakpoint_ops
;
13348 *ops
= bkpt_breakpoint_ops
;
13349 ops
->allocate_location
= allocate_location_exception
;
13350 ops
->re_set
= re_set_exception
;
13351 ops
->check_status
= check_status_exception
;
13352 ops
->print_it
= print_it_exception
;
13353 ops
->print_one
= print_one_exception
;
13354 ops
->print_mention
= print_mention_exception
;
13355 ops
->print_recreate
= print_recreate_exception
;
13358 /* This module's 'new_objfile' observer. */
13361 ada_new_objfile_observer (struct objfile
*objfile
)
13363 ada_clear_symbol_cache ();
13366 /* This module's 'free_objfile' observer. */
13369 ada_free_objfile_observer (struct objfile
*objfile
)
13371 ada_clear_symbol_cache ();
13374 void _initialize_ada_language ();
13376 _initialize_ada_language ()
13378 initialize_ada_catchpoint_ops ();
13380 add_basic_prefix_cmd ("ada", no_class
,
13381 _("Prefix command for changing Ada-specific settings."),
13382 &set_ada_list
, "set ada ", 0, &setlist
);
13384 add_show_prefix_cmd ("ada", no_class
,
13385 _("Generic command for showing Ada-specific settings."),
13386 &show_ada_list
, "show ada ", 0, &showlist
);
13388 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
13389 &trust_pad_over_xvs
, _("\
13390 Enable or disable an optimization trusting PAD types over XVS types."), _("\
13391 Show whether an optimization trusting PAD types over XVS types is activated."),
13393 This is related to the encoding used by the GNAT compiler. The debugger\n\
13394 should normally trust the contents of PAD types, but certain older versions\n\
13395 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13396 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13397 work around this bug. It is always safe to turn this option \"off\", but\n\
13398 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13399 this option to \"off\" unless necessary."),
13400 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13402 add_setshow_boolean_cmd ("print-signatures", class_vars
,
13403 &print_signatures
, _("\
13404 Enable or disable the output of formal and return types for functions in the \
13405 overloads selection menu."), _("\
13406 Show whether the output of formal and return types for functions in the \
13407 overloads selection menu is activated."),
13408 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13410 add_catch_command ("exception", _("\
13411 Catch Ada exceptions, when raised.\n\
13412 Usage: catch exception [ARG] [if CONDITION]\n\
13413 Without any argument, stop when any Ada exception is raised.\n\
13414 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
13415 being raised does not have a handler (and will therefore lead to the task's\n\
13417 Otherwise, the catchpoint only stops when the name of the exception being\n\
13418 raised is the same as ARG.\n\
13419 CONDITION is a boolean expression that is evaluated to see whether the\n\
13420 exception should cause a stop."),
13421 catch_ada_exception_command
,
13422 catch_ada_completer
,
13426 add_catch_command ("handlers", _("\
13427 Catch Ada exceptions, when handled.\n\
13428 Usage: catch handlers [ARG] [if CONDITION]\n\
13429 Without any argument, stop when any Ada exception is handled.\n\
13430 With an argument, catch only exceptions with the given name.\n\
13431 CONDITION is a boolean expression that is evaluated to see whether the\n\
13432 exception should cause a stop."),
13433 catch_ada_handlers_command
,
13434 catch_ada_completer
,
13437 add_catch_command ("assert", _("\
13438 Catch failed Ada assertions, when raised.\n\
13439 Usage: catch assert [if CONDITION]\n\
13440 CONDITION is a boolean expression that is evaluated to see whether the\n\
13441 exception should cause a stop."),
13442 catch_assert_command
,
13447 varsize_limit
= 65536;
13448 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
13449 &varsize_limit
, _("\
13450 Set the maximum number of bytes allowed in a variable-size object."), _("\
13451 Show the maximum number of bytes allowed in a variable-size object."), _("\
13452 Attempts to access an object whose size is not a compile-time constant\n\
13453 and exceeds this limit will cause an error."),
13454 NULL
, NULL
, &setlist
, &showlist
);
13456 add_info ("exceptions", info_exceptions_command
,
13458 List all Ada exception names.\n\
13459 Usage: info exceptions [REGEXP]\n\
13460 If a regular expression is passed as an argument, only those matching\n\
13461 the regular expression are listed."));
13463 add_basic_prefix_cmd ("ada", class_maintenance
,
13464 _("Set Ada maintenance-related variables."),
13465 &maint_set_ada_cmdlist
, "maintenance set ada ",
13466 0/*allow-unknown*/, &maintenance_set_cmdlist
);
13468 add_show_prefix_cmd ("ada", class_maintenance
,
13469 _("Show Ada maintenance-related variables."),
13470 &maint_show_ada_cmdlist
, "maintenance show ada ",
13471 0/*allow-unknown*/, &maintenance_show_cmdlist
);
13473 add_setshow_boolean_cmd
13474 ("ignore-descriptive-types", class_maintenance
,
13475 &ada_ignore_descriptive_types_p
,
13476 _("Set whether descriptive types generated by GNAT should be ignored."),
13477 _("Show whether descriptive types generated by GNAT should be ignored."),
13479 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13480 DWARF attribute."),
13481 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
13483 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
13484 NULL
, xcalloc
, xfree
);
13486 /* The ada-lang observers. */
13487 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
13488 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
13489 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);