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 struct value
*resolve_subexp (expression_up
*, int *, int,
122 innermost_block_tracker
*);
124 static void replace_operator_with_call (expression_up
*, int, int, int,
125 struct symbol
*, const struct block
*);
127 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
129 static const char *ada_decoded_op_name (enum exp_opcode
);
131 static int numeric_type_p (struct type
*);
133 static int integer_type_p (struct type
*);
135 static int scalar_type_p (struct type
*);
137 static int discrete_type_p (struct type
*);
139 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
142 static struct value
*evaluate_subexp_type (struct expression
*, int *);
144 static struct type
*ada_find_parallel_type_with_name (struct type
*,
147 static int is_dynamic_field (struct type
*, int);
149 static struct type
*to_fixed_variant_branch_type (struct type
*,
151 CORE_ADDR
, struct value
*);
153 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
155 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
157 static struct type
*to_static_fixed_type (struct type
*);
158 static struct type
*static_unwrap_type (struct type
*type
);
160 static struct value
*unwrap_value (struct value
*);
162 static struct type
*constrained_packed_array_type (struct type
*, long *);
164 static struct type
*decode_constrained_packed_array_type (struct type
*);
166 static long decode_packed_array_bitsize (struct type
*);
168 static struct value
*decode_constrained_packed_array (struct value
*);
170 static int ada_is_unconstrained_packed_array_type (struct type
*);
172 static struct value
*value_subscript_packed (struct value
*, int,
175 static struct value
*coerce_unspec_val_to_type (struct value
*,
178 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
180 static int equiv_types (struct type
*, struct type
*);
182 static int is_name_suffix (const char *);
184 static int advance_wild_match (const char **, const char *, char);
186 static bool wild_match (const char *name
, const char *patn
);
188 static struct value
*ada_coerce_ref (struct value
*);
190 static LONGEST
pos_atr (struct value
*);
192 static struct value
*value_pos_atr (struct type
*, struct value
*);
194 static struct value
*val_atr (struct type
*, LONGEST
);
196 static struct symbol
*standard_lookup (const char *, const struct block
*,
199 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
202 static int find_struct_field (const char *, struct type
*, int,
203 struct type
**, int *, int *, int *, int *);
205 static int ada_resolve_function (std::vector
<struct block_symbol
> &,
206 struct value
**, int, const char *,
209 static int ada_is_direct_array_type (struct type
*);
211 static struct value
*ada_index_struct_field (int, struct value
*, int,
214 static struct value
*assign_aggregate (struct value
*, struct value
*,
218 static void aggregate_assign_from_choices (struct value
*, struct value
*,
220 int *, std::vector
<LONGEST
> &,
223 static void aggregate_assign_positional (struct value
*, struct value
*,
225 int *, std::vector
<LONGEST
> &,
229 static void aggregate_assign_others (struct value
*, struct value
*,
231 int *, std::vector
<LONGEST
> &,
235 static void add_component_interval (LONGEST
, LONGEST
, std::vector
<LONGEST
> &);
238 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
241 static void ada_forward_operator_length (struct expression
*, int, int *,
244 static struct type
*ada_find_any_type (const char *name
);
246 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
247 (const lookup_name_info
&lookup_name
);
251 /* The result of a symbol lookup to be stored in our symbol cache. */
255 /* The name used to perform the lookup. */
257 /* The namespace used during the lookup. */
259 /* The symbol returned by the lookup, or NULL if no matching symbol
262 /* The block where the symbol was found, or NULL if no matching
264 const struct block
*block
;
265 /* A pointer to the next entry with the same hash. */
266 struct cache_entry
*next
;
269 /* The Ada symbol cache, used to store the result of Ada-mode symbol
270 lookups in the course of executing the user's commands.
272 The cache is implemented using a simple, fixed-sized hash.
273 The size is fixed on the grounds that there are not likely to be
274 all that many symbols looked up during any given session, regardless
275 of the size of the symbol table. If we decide to go to a resizable
276 table, let's just use the stuff from libiberty instead. */
278 #define HASH_SIZE 1009
280 struct ada_symbol_cache
282 /* An obstack used to store the entries in our cache. */
283 struct auto_obstack cache_space
;
285 /* The root of the hash table used to implement our symbol cache. */
286 struct cache_entry
*root
[HASH_SIZE
] {};
289 /* Maximum-sized dynamic type. */
290 static unsigned int varsize_limit
;
292 static const char ada_completer_word_break_characters
[] =
294 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
296 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
299 /* The name of the symbol to use to get the name of the main subprogram. */
300 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
301 = "__gnat_ada_main_program_name";
303 /* Limit on the number of warnings to raise per expression evaluation. */
304 static int warning_limit
= 2;
306 /* Number of warning messages issued; reset to 0 by cleanups after
307 expression evaluation. */
308 static int warnings_issued
= 0;
310 static const char * const known_runtime_file_name_patterns
[] = {
311 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
314 static const char * const known_auxiliary_function_name_patterns
[] = {
315 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
318 /* Maintenance-related settings for this module. */
320 static struct cmd_list_element
*maint_set_ada_cmdlist
;
321 static struct cmd_list_element
*maint_show_ada_cmdlist
;
323 /* The "maintenance ada set/show ignore-descriptive-type" value. */
325 static bool ada_ignore_descriptive_types_p
= false;
327 /* Inferior-specific data. */
329 /* Per-inferior data for this module. */
331 struct ada_inferior_data
333 /* The ada__tags__type_specific_data type, which is used when decoding
334 tagged types. With older versions of GNAT, this type was directly
335 accessible through a component ("tsd") in the object tag. But this
336 is no longer the case, so we cache it for each inferior. */
337 struct type
*tsd_type
= nullptr;
339 /* The exception_support_info data. This data is used to determine
340 how to implement support for Ada exception catchpoints in a given
342 const struct exception_support_info
*exception_info
= nullptr;
345 /* Our key to this module's inferior data. */
346 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
348 /* Return our inferior data for the given inferior (INF).
350 This function always returns a valid pointer to an allocated
351 ada_inferior_data structure. If INF's inferior data has not
352 been previously set, this functions creates a new one with all
353 fields set to zero, sets INF's inferior to it, and then returns
354 a pointer to that newly allocated ada_inferior_data. */
356 static struct ada_inferior_data
*
357 get_ada_inferior_data (struct inferior
*inf
)
359 struct ada_inferior_data
*data
;
361 data
= ada_inferior_data
.get (inf
);
363 data
= ada_inferior_data
.emplace (inf
);
368 /* Perform all necessary cleanups regarding our module's inferior data
369 that is required after the inferior INF just exited. */
372 ada_inferior_exit (struct inferior
*inf
)
374 ada_inferior_data
.clear (inf
);
378 /* program-space-specific data. */
380 /* This module's per-program-space data. */
381 struct ada_pspace_data
383 /* The Ada symbol cache. */
384 std::unique_ptr
<ada_symbol_cache
> sym_cache
;
387 /* Key to our per-program-space data. */
388 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
390 /* Return this module's data for the given program space (PSPACE).
391 If not is found, add a zero'ed one now.
393 This function always returns a valid object. */
395 static struct ada_pspace_data
*
396 get_ada_pspace_data (struct program_space
*pspace
)
398 struct ada_pspace_data
*data
;
400 data
= ada_pspace_data_handle
.get (pspace
);
402 data
= ada_pspace_data_handle
.emplace (pspace
);
409 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
410 all typedef layers have been peeled. Otherwise, return TYPE.
412 Normally, we really expect a typedef type to only have 1 typedef layer.
413 In other words, we really expect the target type of a typedef type to be
414 a non-typedef type. This is particularly true for Ada units, because
415 the language does not have a typedef vs not-typedef distinction.
416 In that respect, the Ada compiler has been trying to eliminate as many
417 typedef definitions in the debugging information, since they generally
418 do not bring any extra information (we still use typedef under certain
419 circumstances related mostly to the GNAT encoding).
421 Unfortunately, we have seen situations where the debugging information
422 generated by the compiler leads to such multiple typedef layers. For
423 instance, consider the following example with stabs:
425 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
426 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
428 This is an error in the debugging information which causes type
429 pck__float_array___XUP to be defined twice, and the second time,
430 it is defined as a typedef of a typedef.
432 This is on the fringe of legality as far as debugging information is
433 concerned, and certainly unexpected. But it is easy to handle these
434 situations correctly, so we can afford to be lenient in this case. */
437 ada_typedef_target_type (struct type
*type
)
439 while (type
->code () == TYPE_CODE_TYPEDEF
)
440 type
= TYPE_TARGET_TYPE (type
);
444 /* Given DECODED_NAME a string holding a symbol name in its
445 decoded form (ie using the Ada dotted notation), returns
446 its unqualified name. */
449 ada_unqualified_name (const char *decoded_name
)
453 /* If the decoded name starts with '<', it means that the encoded
454 name does not follow standard naming conventions, and thus that
455 it is not your typical Ada symbol name. Trying to unqualify it
456 is therefore pointless and possibly erroneous. */
457 if (decoded_name
[0] == '<')
460 result
= strrchr (decoded_name
, '.');
462 result
++; /* Skip the dot... */
464 result
= decoded_name
;
469 /* Return a string starting with '<', followed by STR, and '>'. */
472 add_angle_brackets (const char *str
)
474 return string_printf ("<%s>", str
);
477 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
478 suffix of FIELD_NAME beginning "___". */
481 field_name_match (const char *field_name
, const char *target
)
483 int len
= strlen (target
);
486 (strncmp (field_name
, target
, len
) == 0
487 && (field_name
[len
] == '\0'
488 || (startswith (field_name
+ len
, "___")
489 && strcmp (field_name
+ strlen (field_name
) - 6,
494 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
495 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
496 and return its index. This function also handles fields whose name
497 have ___ suffixes because the compiler sometimes alters their name
498 by adding such a suffix to represent fields with certain constraints.
499 If the field could not be found, return a negative number if
500 MAYBE_MISSING is set. Otherwise raise an error. */
503 ada_get_field_index (const struct type
*type
, const char *field_name
,
507 struct type
*struct_type
= check_typedef ((struct type
*) type
);
509 for (fieldno
= 0; fieldno
< struct_type
->num_fields (); fieldno
++)
510 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
514 error (_("Unable to find field %s in struct %s. Aborting"),
515 field_name
, struct_type
->name ());
520 /* The length of the prefix of NAME prior to any "___" suffix. */
523 ada_name_prefix_len (const char *name
)
529 const char *p
= strstr (name
, "___");
532 return strlen (name
);
538 /* Return non-zero if SUFFIX is a suffix of STR.
539 Return zero if STR is null. */
542 is_suffix (const char *str
, const char *suffix
)
549 len2
= strlen (suffix
);
550 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
553 /* The contents of value VAL, treated as a value of type TYPE. The
554 result is an lval in memory if VAL is. */
556 static struct value
*
557 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
559 type
= ada_check_typedef (type
);
560 if (value_type (val
) == type
)
564 struct value
*result
;
566 /* Make sure that the object size is not unreasonable before
567 trying to allocate some memory for it. */
568 ada_ensure_varsize_limit (type
);
570 if (value_optimized_out (val
))
571 result
= allocate_optimized_out_value (type
);
572 else if (value_lazy (val
)
573 /* Be careful not to make a lazy not_lval value. */
574 || (VALUE_LVAL (val
) != not_lval
575 && TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
))))
576 result
= allocate_value_lazy (type
);
579 result
= allocate_value (type
);
580 value_contents_copy (result
, 0, val
, 0, TYPE_LENGTH (type
));
582 set_value_component_location (result
, val
);
583 set_value_bitsize (result
, value_bitsize (val
));
584 set_value_bitpos (result
, value_bitpos (val
));
585 if (VALUE_LVAL (result
) == lval_memory
)
586 set_value_address (result
, value_address (val
));
591 static const gdb_byte
*
592 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
597 return valaddr
+ offset
;
601 cond_offset_target (CORE_ADDR address
, long offset
)
606 return address
+ offset
;
609 /* Issue a warning (as for the definition of warning in utils.c, but
610 with exactly one argument rather than ...), unless the limit on the
611 number of warnings has passed during the evaluation of the current
614 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
615 provided by "complaint". */
616 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
619 lim_warning (const char *format
, ...)
623 va_start (args
, format
);
624 warnings_issued
+= 1;
625 if (warnings_issued
<= warning_limit
)
626 vwarning (format
, args
);
631 /* Issue an error if the size of an object of type T is unreasonable,
632 i.e. if it would be a bad idea to allocate a value of this type in
636 ada_ensure_varsize_limit (const struct type
*type
)
638 if (TYPE_LENGTH (type
) > varsize_limit
)
639 error (_("object size is larger than varsize-limit"));
642 /* Maximum value of a SIZE-byte signed integer type. */
644 max_of_size (int size
)
646 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
648 return top_bit
| (top_bit
- 1);
651 /* Minimum value of a SIZE-byte signed integer type. */
653 min_of_size (int size
)
655 return -max_of_size (size
) - 1;
658 /* Maximum value of a SIZE-byte unsigned integer type. */
660 umax_of_size (int size
)
662 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
664 return top_bit
| (top_bit
- 1);
667 /* Maximum value of integral type T, as a signed quantity. */
669 max_of_type (struct type
*t
)
671 if (t
->is_unsigned ())
672 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
674 return max_of_size (TYPE_LENGTH (t
));
677 /* Minimum value of integral type T, as a signed quantity. */
679 min_of_type (struct type
*t
)
681 if (t
->is_unsigned ())
684 return min_of_size (TYPE_LENGTH (t
));
687 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
689 ada_discrete_type_high_bound (struct type
*type
)
691 type
= resolve_dynamic_type (type
, {}, 0);
692 switch (type
->code ())
694 case TYPE_CODE_RANGE
:
696 const dynamic_prop
&high
= type
->bounds ()->high
;
698 if (high
.kind () == PROP_CONST
)
699 return high
.const_val ();
702 gdb_assert (high
.kind () == PROP_UNDEFINED
);
704 /* This happens when trying to evaluate a type's dynamic bound
705 without a live target. There is nothing relevant for us to
706 return here, so return 0. */
711 return TYPE_FIELD_ENUMVAL (type
, type
->num_fields () - 1);
716 return max_of_type (type
);
718 error (_("Unexpected type in ada_discrete_type_high_bound."));
722 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
724 ada_discrete_type_low_bound (struct type
*type
)
726 type
= resolve_dynamic_type (type
, {}, 0);
727 switch (type
->code ())
729 case TYPE_CODE_RANGE
:
731 const dynamic_prop
&low
= type
->bounds ()->low
;
733 if (low
.kind () == PROP_CONST
)
734 return low
.const_val ();
737 gdb_assert (low
.kind () == PROP_UNDEFINED
);
739 /* This happens when trying to evaluate a type's dynamic bound
740 without a live target. There is nothing relevant for us to
741 return here, so return 0. */
746 return TYPE_FIELD_ENUMVAL (type
, 0);
751 return min_of_type (type
);
753 error (_("Unexpected type in ada_discrete_type_low_bound."));
757 /* The identity on non-range types. For range types, the underlying
758 non-range scalar type. */
761 get_base_type (struct type
*type
)
763 while (type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
)
765 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
767 type
= TYPE_TARGET_TYPE (type
);
772 /* Return a decoded version of the given VALUE. This means returning
773 a value whose type is obtained by applying all the GNAT-specific
774 encodings, making the resulting type a static but standard description
775 of the initial type. */
778 ada_get_decoded_value (struct value
*value
)
780 struct type
*type
= ada_check_typedef (value_type (value
));
782 if (ada_is_array_descriptor_type (type
)
783 || (ada_is_constrained_packed_array_type (type
)
784 && type
->code () != TYPE_CODE_PTR
))
786 if (type
->code () == TYPE_CODE_TYPEDEF
) /* array access type. */
787 value
= ada_coerce_to_simple_array_ptr (value
);
789 value
= ada_coerce_to_simple_array (value
);
792 value
= ada_to_fixed_value (value
);
797 /* Same as ada_get_decoded_value, but with the given TYPE.
798 Because there is no associated actual value for this type,
799 the resulting type might be a best-effort approximation in
800 the case of dynamic types. */
803 ada_get_decoded_type (struct type
*type
)
805 type
= to_static_fixed_type (type
);
806 if (ada_is_constrained_packed_array_type (type
))
807 type
= ada_coerce_to_simple_array_type (type
);
813 /* Language Selection */
815 /* If the main program is in Ada, return language_ada, otherwise return LANG
816 (the main program is in Ada iif the adainit symbol is found). */
819 ada_update_initial_language (enum language lang
)
821 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
827 /* If the main procedure is written in Ada, then return its name.
828 The result is good until the next call. Return NULL if the main
829 procedure doesn't appear to be in Ada. */
834 struct bound_minimal_symbol msym
;
835 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
837 /* For Ada, the name of the main procedure is stored in a specific
838 string constant, generated by the binder. Look for that symbol,
839 extract its address, and then read that string. If we didn't find
840 that string, then most probably the main procedure is not written
842 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
844 if (msym
.minsym
!= NULL
)
846 CORE_ADDR main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
847 if (main_program_name_addr
== 0)
848 error (_("Invalid address for Ada main program name."));
850 main_program_name
= target_read_string (main_program_name_addr
, 1024);
851 return main_program_name
.get ();
854 /* The main procedure doesn't seem to be in Ada. */
860 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
863 const struct ada_opname_map ada_opname_table
[] = {
864 {"Oadd", "\"+\"", BINOP_ADD
},
865 {"Osubtract", "\"-\"", BINOP_SUB
},
866 {"Omultiply", "\"*\"", BINOP_MUL
},
867 {"Odivide", "\"/\"", BINOP_DIV
},
868 {"Omod", "\"mod\"", BINOP_MOD
},
869 {"Orem", "\"rem\"", BINOP_REM
},
870 {"Oexpon", "\"**\"", BINOP_EXP
},
871 {"Olt", "\"<\"", BINOP_LESS
},
872 {"Ole", "\"<=\"", BINOP_LEQ
},
873 {"Ogt", "\">\"", BINOP_GTR
},
874 {"Oge", "\">=\"", BINOP_GEQ
},
875 {"Oeq", "\"=\"", BINOP_EQUAL
},
876 {"One", "\"/=\"", BINOP_NOTEQUAL
},
877 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
878 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
879 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
880 {"Oconcat", "\"&\"", BINOP_CONCAT
},
881 {"Oabs", "\"abs\"", UNOP_ABS
},
882 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
883 {"Oadd", "\"+\"", UNOP_PLUS
},
884 {"Osubtract", "\"-\"", UNOP_NEG
},
888 /* The "encoded" form of DECODED, according to GNAT conventions. If
889 THROW_ERRORS, throw an error if invalid operator name is found.
890 Otherwise, return the empty string in that case. */
893 ada_encode_1 (const char *decoded
, bool throw_errors
)
898 std::string encoding_buffer
;
899 for (const char *p
= decoded
; *p
!= '\0'; p
+= 1)
902 encoding_buffer
.append ("__");
905 const struct ada_opname_map
*mapping
;
907 for (mapping
= ada_opname_table
;
908 mapping
->encoded
!= NULL
909 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
911 if (mapping
->encoded
== NULL
)
914 error (_("invalid Ada operator name: %s"), p
);
918 encoding_buffer
.append (mapping
->encoded
);
922 encoding_buffer
.push_back (*p
);
925 return encoding_buffer
;
928 /* The "encoded" form of DECODED, according to GNAT conventions. */
931 ada_encode (const char *decoded
)
933 return ada_encode_1 (decoded
, true);
936 /* Return NAME folded to lower case, or, if surrounded by single
937 quotes, unfolded, but with the quotes stripped away. Result good
941 ada_fold_name (gdb::string_view name
)
943 static std::string fold_storage
;
945 if (!name
.empty () && name
[0] == '\'')
946 fold_storage
= gdb::to_string (name
.substr (1, name
.size () - 2));
949 fold_storage
= gdb::to_string (name
);
950 for (int i
= 0; i
< name
.size (); i
+= 1)
951 fold_storage
[i
] = tolower (fold_storage
[i
]);
954 return fold_storage
.c_str ();
957 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
960 is_lower_alphanum (const char c
)
962 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
965 /* ENCODED is the linkage name of a symbol and LEN contains its length.
966 This function saves in LEN the length of that same symbol name but
967 without either of these suffixes:
973 These are suffixes introduced by the compiler for entities such as
974 nested subprogram for instance, in order to avoid name clashes.
975 They do not serve any purpose for the debugger. */
978 ada_remove_trailing_digits (const char *encoded
, int *len
)
980 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
984 while (i
> 0 && isdigit (encoded
[i
]))
986 if (i
>= 0 && encoded
[i
] == '.')
988 else if (i
>= 0 && encoded
[i
] == '$')
990 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
992 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
997 /* Remove the suffix introduced by the compiler for protected object
1001 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1003 /* Remove trailing N. */
1005 /* Protected entry subprograms are broken into two
1006 separate subprograms: The first one is unprotected, and has
1007 a 'N' suffix; the second is the protected version, and has
1008 the 'P' suffix. The second calls the first one after handling
1009 the protection. Since the P subprograms are internally generated,
1010 we leave these names undecoded, giving the user a clue that this
1011 entity is internal. */
1014 && encoded
[*len
- 1] == 'N'
1015 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1019 /* If ENCODED follows the GNAT entity encoding conventions, then return
1020 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1021 replaced by ENCODED. */
1024 ada_decode (const char *encoded
)
1030 std::string decoded
;
1032 /* With function descriptors on PPC64, the value of a symbol named
1033 ".FN", if it exists, is the entry point of the function "FN". */
1034 if (encoded
[0] == '.')
1037 /* The name of the Ada main procedure starts with "_ada_".
1038 This prefix is not part of the decoded name, so skip this part
1039 if we see this prefix. */
1040 if (startswith (encoded
, "_ada_"))
1043 /* If the name starts with '_', then it is not a properly encoded
1044 name, so do not attempt to decode it. Similarly, if the name
1045 starts with '<', the name should not be decoded. */
1046 if (encoded
[0] == '_' || encoded
[0] == '<')
1049 len0
= strlen (encoded
);
1051 ada_remove_trailing_digits (encoded
, &len0
);
1052 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1054 /* Remove the ___X.* suffix if present. Do not forget to verify that
1055 the suffix is located before the current "end" of ENCODED. We want
1056 to avoid re-matching parts of ENCODED that have previously been
1057 marked as discarded (by decrementing LEN0). */
1058 p
= strstr (encoded
, "___");
1059 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1067 /* Remove any trailing TKB suffix. It tells us that this symbol
1068 is for the body of a task, but that information does not actually
1069 appear in the decoded name. */
1071 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1074 /* Remove any trailing TB suffix. The TB suffix is slightly different
1075 from the TKB suffix because it is used for non-anonymous task
1078 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1081 /* Remove trailing "B" suffixes. */
1082 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1084 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1087 /* Make decoded big enough for possible expansion by operator name. */
1089 decoded
.resize (2 * len0
+ 1, 'X');
1091 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1093 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1096 while ((i
>= 0 && isdigit (encoded
[i
]))
1097 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1099 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1101 else if (encoded
[i
] == '$')
1105 /* The first few characters that are not alphabetic are not part
1106 of any encoding we use, so we can copy them over verbatim. */
1108 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1109 decoded
[j
] = encoded
[i
];
1114 /* Is this a symbol function? */
1115 if (at_start_name
&& encoded
[i
] == 'O')
1119 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1121 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1122 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1124 && !isalnum (encoded
[i
+ op_len
]))
1126 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1129 j
+= strlen (ada_opname_table
[k
].decoded
);
1133 if (ada_opname_table
[k
].encoded
!= NULL
)
1138 /* Replace "TK__" with "__", which will eventually be translated
1139 into "." (just below). */
1141 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1144 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1145 be translated into "." (just below). These are internal names
1146 generated for anonymous blocks inside which our symbol is nested. */
1148 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1149 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1150 && isdigit (encoded
[i
+4]))
1154 while (k
< len0
&& isdigit (encoded
[k
]))
1155 k
++; /* Skip any extra digit. */
1157 /* Double-check that the "__B_{DIGITS}+" sequence we found
1158 is indeed followed by "__". */
1159 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1163 /* Remove _E{DIGITS}+[sb] */
1165 /* Just as for protected object subprograms, there are 2 categories
1166 of subprograms created by the compiler for each entry. The first
1167 one implements the actual entry code, and has a suffix following
1168 the convention above; the second one implements the barrier and
1169 uses the same convention as above, except that the 'E' is replaced
1172 Just as above, we do not decode the name of barrier functions
1173 to give the user a clue that the code he is debugging has been
1174 internally generated. */
1176 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1177 && isdigit (encoded
[i
+2]))
1181 while (k
< len0
&& isdigit (encoded
[k
]))
1185 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1188 /* Just as an extra precaution, make sure that if this
1189 suffix is followed by anything else, it is a '_'.
1190 Otherwise, we matched this sequence by accident. */
1192 || (k
< len0
&& encoded
[k
] == '_'))
1197 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1198 the GNAT front-end in protected object subprograms. */
1201 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1203 /* Backtrack a bit up until we reach either the begining of
1204 the encoded name, or "__". Make sure that we only find
1205 digits or lowercase characters. */
1206 const char *ptr
= encoded
+ i
- 1;
1208 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1211 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1215 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1217 /* This is a X[bn]* sequence not separated from the previous
1218 part of the name with a non-alpha-numeric character (in other
1219 words, immediately following an alpha-numeric character), then
1220 verify that it is placed at the end of the encoded name. If
1221 not, then the encoding is not valid and we should abort the
1222 decoding. Otherwise, just skip it, it is used in body-nested
1226 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1230 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1232 /* Replace '__' by '.'. */
1240 /* It's a character part of the decoded name, so just copy it
1242 decoded
[j
] = encoded
[i
];
1249 /* Decoded names should never contain any uppercase character.
1250 Double-check this, and abort the decoding if we find one. */
1252 for (i
= 0; i
< decoded
.length(); ++i
)
1253 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1259 if (encoded
[0] == '<')
1262 decoded
= '<' + std::string(encoded
) + '>';
1267 /* Table for keeping permanent unique copies of decoded names. Once
1268 allocated, names in this table are never released. While this is a
1269 storage leak, it should not be significant unless there are massive
1270 changes in the set of decoded names in successive versions of a
1271 symbol table loaded during a single session. */
1272 static struct htab
*decoded_names_store
;
1274 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1275 in the language-specific part of GSYMBOL, if it has not been
1276 previously computed. Tries to save the decoded name in the same
1277 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1278 in any case, the decoded symbol has a lifetime at least that of
1280 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1281 const, but nevertheless modified to a semantically equivalent form
1282 when a decoded name is cached in it. */
1285 ada_decode_symbol (const struct general_symbol_info
*arg
)
1287 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1288 const char **resultp
=
1289 &gsymbol
->language_specific
.demangled_name
;
1291 if (!gsymbol
->ada_mangled
)
1293 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1294 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1296 gsymbol
->ada_mangled
= 1;
1298 if (obstack
!= NULL
)
1299 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1302 /* Sometimes, we can't find a corresponding objfile, in
1303 which case, we put the result on the heap. Since we only
1304 decode when needed, we hope this usually does not cause a
1305 significant memory leak (FIXME). */
1307 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1308 decoded
.c_str (), INSERT
);
1311 *slot
= xstrdup (decoded
.c_str ());
1320 ada_la_decode (const char *encoded
, int options
)
1322 return xstrdup (ada_decode (encoded
).c_str ());
1329 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1330 generated by the GNAT compiler to describe the index type used
1331 for each dimension of an array, check whether it follows the latest
1332 known encoding. If not, fix it up to conform to the latest encoding.
1333 Otherwise, do nothing. This function also does nothing if
1334 INDEX_DESC_TYPE is NULL.
1336 The GNAT encoding used to describe the array index type evolved a bit.
1337 Initially, the information would be provided through the name of each
1338 field of the structure type only, while the type of these fields was
1339 described as unspecified and irrelevant. The debugger was then expected
1340 to perform a global type lookup using the name of that field in order
1341 to get access to the full index type description. Because these global
1342 lookups can be very expensive, the encoding was later enhanced to make
1343 the global lookup unnecessary by defining the field type as being
1344 the full index type description.
1346 The purpose of this routine is to allow us to support older versions
1347 of the compiler by detecting the use of the older encoding, and by
1348 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1349 we essentially replace each field's meaningless type by the associated
1353 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1357 if (index_desc_type
== NULL
)
1359 gdb_assert (index_desc_type
->num_fields () > 0);
1361 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1362 to check one field only, no need to check them all). If not, return
1365 If our INDEX_DESC_TYPE was generated using the older encoding,
1366 the field type should be a meaningless integer type whose name
1367 is not equal to the field name. */
1368 if (index_desc_type
->field (0).type ()->name () != NULL
1369 && strcmp (index_desc_type
->field (0).type ()->name (),
1370 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1373 /* Fixup each field of INDEX_DESC_TYPE. */
1374 for (i
= 0; i
< index_desc_type
->num_fields (); i
++)
1376 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1377 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1380 index_desc_type
->field (i
).set_type (raw_type
);
1384 /* The desc_* routines return primitive portions of array descriptors
1387 /* The descriptor or array type, if any, indicated by TYPE; removes
1388 level of indirection, if needed. */
1390 static struct type
*
1391 desc_base_type (struct type
*type
)
1395 type
= ada_check_typedef (type
);
1396 if (type
->code () == TYPE_CODE_TYPEDEF
)
1397 type
= ada_typedef_target_type (type
);
1400 && (type
->code () == TYPE_CODE_PTR
1401 || type
->code () == TYPE_CODE_REF
))
1402 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1407 /* True iff TYPE indicates a "thin" array pointer type. */
1410 is_thin_pntr (struct type
*type
)
1413 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1414 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1417 /* The descriptor type for thin pointer type TYPE. */
1419 static struct type
*
1420 thin_descriptor_type (struct type
*type
)
1422 struct type
*base_type
= desc_base_type (type
);
1424 if (base_type
== NULL
)
1426 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1430 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1432 if (alt_type
== NULL
)
1439 /* A pointer to the array data for thin-pointer value VAL. */
1441 static struct value
*
1442 thin_data_pntr (struct value
*val
)
1444 struct type
*type
= ada_check_typedef (value_type (val
));
1445 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1447 data_type
= lookup_pointer_type (data_type
);
1449 if (type
->code () == TYPE_CODE_PTR
)
1450 return value_cast (data_type
, value_copy (val
));
1452 return value_from_longest (data_type
, value_address (val
));
1455 /* True iff TYPE indicates a "thick" array pointer type. */
1458 is_thick_pntr (struct type
*type
)
1460 type
= desc_base_type (type
);
1461 return (type
!= NULL
&& type
->code () == TYPE_CODE_STRUCT
1462 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1465 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1466 pointer to one, the type of its bounds data; otherwise, NULL. */
1468 static struct type
*
1469 desc_bounds_type (struct type
*type
)
1473 type
= desc_base_type (type
);
1477 else if (is_thin_pntr (type
))
1479 type
= thin_descriptor_type (type
);
1482 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1484 return ada_check_typedef (r
);
1486 else if (type
->code () == TYPE_CODE_STRUCT
)
1488 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1490 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1495 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1496 one, a pointer to its bounds data. Otherwise NULL. */
1498 static struct value
*
1499 desc_bounds (struct value
*arr
)
1501 struct type
*type
= ada_check_typedef (value_type (arr
));
1503 if (is_thin_pntr (type
))
1505 struct type
*bounds_type
=
1506 desc_bounds_type (thin_descriptor_type (type
));
1509 if (bounds_type
== NULL
)
1510 error (_("Bad GNAT array descriptor"));
1512 /* NOTE: The following calculation is not really kosher, but
1513 since desc_type is an XVE-encoded type (and shouldn't be),
1514 the correct calculation is a real pain. FIXME (and fix GCC). */
1515 if (type
->code () == TYPE_CODE_PTR
)
1516 addr
= value_as_long (arr
);
1518 addr
= value_address (arr
);
1521 value_from_longest (lookup_pointer_type (bounds_type
),
1522 addr
- TYPE_LENGTH (bounds_type
));
1525 else if (is_thick_pntr (type
))
1527 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1528 _("Bad GNAT array descriptor"));
1529 struct type
*p_bounds_type
= value_type (p_bounds
);
1532 && p_bounds_type
->code () == TYPE_CODE_PTR
)
1534 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1536 if (target_type
->is_stub ())
1537 p_bounds
= value_cast (lookup_pointer_type
1538 (ada_check_typedef (target_type
)),
1542 error (_("Bad GNAT array descriptor"));
1550 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1551 position of the field containing the address of the bounds data. */
1554 fat_pntr_bounds_bitpos (struct type
*type
)
1556 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1559 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1560 size of the field containing the address of the bounds data. */
1563 fat_pntr_bounds_bitsize (struct type
*type
)
1565 type
= desc_base_type (type
);
1567 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1568 return TYPE_FIELD_BITSIZE (type
, 1);
1570 return 8 * TYPE_LENGTH (ada_check_typedef (type
->field (1).type ()));
1573 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1574 pointer to one, the type of its array data (a array-with-no-bounds type);
1575 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1578 static struct type
*
1579 desc_data_target_type (struct type
*type
)
1581 type
= desc_base_type (type
);
1583 /* NOTE: The following is bogus; see comment in desc_bounds. */
1584 if (is_thin_pntr (type
))
1585 return desc_base_type (thin_descriptor_type (type
)->field (1).type ());
1586 else if (is_thick_pntr (type
))
1588 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1591 && ada_check_typedef (data_type
)->code () == TYPE_CODE_PTR
)
1592 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1598 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1601 static struct value
*
1602 desc_data (struct value
*arr
)
1604 struct type
*type
= value_type (arr
);
1606 if (is_thin_pntr (type
))
1607 return thin_data_pntr (arr
);
1608 else if (is_thick_pntr (type
))
1609 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1610 _("Bad GNAT array descriptor"));
1616 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1617 position of the field containing the address of the data. */
1620 fat_pntr_data_bitpos (struct type
*type
)
1622 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1625 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1626 size of the field containing the address of the data. */
1629 fat_pntr_data_bitsize (struct type
*type
)
1631 type
= desc_base_type (type
);
1633 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1634 return TYPE_FIELD_BITSIZE (type
, 0);
1636 return TARGET_CHAR_BIT
* TYPE_LENGTH (type
->field (0).type ());
1639 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1640 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1641 bound, if WHICH is 1. The first bound is I=1. */
1643 static struct value
*
1644 desc_one_bound (struct value
*bounds
, int i
, int which
)
1646 char bound_name
[20];
1647 xsnprintf (bound_name
, sizeof (bound_name
), "%cB%d",
1648 which
? 'U' : 'L', i
- 1);
1649 return value_struct_elt (&bounds
, NULL
, bound_name
, NULL
,
1650 _("Bad GNAT array descriptor bounds"));
1653 /* If BOUNDS is an array-bounds structure type, return the bit position
1654 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1655 bound, if WHICH is 1. The first bound is I=1. */
1658 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1660 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1663 /* If BOUNDS is an array-bounds structure type, return the bit field size
1664 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1665 bound, if WHICH is 1. The first bound is I=1. */
1668 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1670 type
= desc_base_type (type
);
1672 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1673 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1675 return 8 * TYPE_LENGTH (type
->field (2 * i
+ which
- 2).type ());
1678 /* If TYPE is the type of an array-bounds structure, the type of its
1679 Ith bound (numbering from 1). Otherwise, NULL. */
1681 static struct type
*
1682 desc_index_type (struct type
*type
, int i
)
1684 type
= desc_base_type (type
);
1686 if (type
->code () == TYPE_CODE_STRUCT
)
1688 char bound_name
[20];
1689 xsnprintf (bound_name
, sizeof (bound_name
), "LB%d", i
- 1);
1690 return lookup_struct_elt_type (type
, bound_name
, 1);
1696 /* The number of index positions in the array-bounds type TYPE.
1697 Return 0 if TYPE is NULL. */
1700 desc_arity (struct type
*type
)
1702 type
= desc_base_type (type
);
1705 return type
->num_fields () / 2;
1709 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1710 an array descriptor type (representing an unconstrained array
1714 ada_is_direct_array_type (struct type
*type
)
1718 type
= ada_check_typedef (type
);
1719 return (type
->code () == TYPE_CODE_ARRAY
1720 || ada_is_array_descriptor_type (type
));
1723 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1727 ada_is_array_type (struct type
*type
)
1730 && (type
->code () == TYPE_CODE_PTR
1731 || type
->code () == TYPE_CODE_REF
))
1732 type
= TYPE_TARGET_TYPE (type
);
1733 return ada_is_direct_array_type (type
);
1736 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1739 ada_is_simple_array_type (struct type
*type
)
1743 type
= ada_check_typedef (type
);
1744 return (type
->code () == TYPE_CODE_ARRAY
1745 || (type
->code () == TYPE_CODE_PTR
1746 && (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ()
1747 == TYPE_CODE_ARRAY
)));
1750 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1753 ada_is_array_descriptor_type (struct type
*type
)
1755 struct type
*data_type
= desc_data_target_type (type
);
1759 type
= ada_check_typedef (type
);
1760 return (data_type
!= NULL
1761 && data_type
->code () == TYPE_CODE_ARRAY
1762 && desc_arity (desc_bounds_type (type
)) > 0);
1765 /* Non-zero iff type is a partially mal-formed GNAT array
1766 descriptor. FIXME: This is to compensate for some problems with
1767 debugging output from GNAT. Re-examine periodically to see if it
1771 ada_is_bogus_array_descriptor (struct type
*type
)
1775 && type
->code () == TYPE_CODE_STRUCT
1776 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1777 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1778 && !ada_is_array_descriptor_type (type
);
1782 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1783 (fat pointer) returns the type of the array data described---specifically,
1784 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1785 in from the descriptor; otherwise, they are left unspecified. If
1786 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1787 returns NULL. The result is simply the type of ARR if ARR is not
1790 static struct type
*
1791 ada_type_of_array (struct value
*arr
, int bounds
)
1793 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1794 return decode_constrained_packed_array_type (value_type (arr
));
1796 if (!ada_is_array_descriptor_type (value_type (arr
)))
1797 return value_type (arr
);
1801 struct type
*array_type
=
1802 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1804 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1805 TYPE_FIELD_BITSIZE (array_type
, 0) =
1806 decode_packed_array_bitsize (value_type (arr
));
1812 struct type
*elt_type
;
1814 struct value
*descriptor
;
1816 elt_type
= ada_array_element_type (value_type (arr
), -1);
1817 arity
= ada_array_arity (value_type (arr
));
1819 if (elt_type
== NULL
|| arity
== 0)
1820 return ada_check_typedef (value_type (arr
));
1822 descriptor
= desc_bounds (arr
);
1823 if (value_as_long (descriptor
) == 0)
1827 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1828 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1829 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1830 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1833 create_static_range_type (range_type
, value_type (low
),
1834 longest_to_int (value_as_long (low
)),
1835 longest_to_int (value_as_long (high
)));
1836 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1838 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1840 /* We need to store the element packed bitsize, as well as
1841 recompute the array size, because it was previously
1842 computed based on the unpacked element size. */
1843 LONGEST lo
= value_as_long (low
);
1844 LONGEST hi
= value_as_long (high
);
1846 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1847 decode_packed_array_bitsize (value_type (arr
));
1848 /* If the array has no element, then the size is already
1849 zero, and does not need to be recomputed. */
1853 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1855 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1860 return lookup_pointer_type (elt_type
);
1864 /* If ARR does not represent an array, returns ARR unchanged.
1865 Otherwise, returns either a standard GDB array with bounds set
1866 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1867 GDB array. Returns NULL if ARR is a null fat pointer. */
1870 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1872 if (ada_is_array_descriptor_type (value_type (arr
)))
1874 struct type
*arrType
= ada_type_of_array (arr
, 1);
1876 if (arrType
== NULL
)
1878 return value_cast (arrType
, value_copy (desc_data (arr
)));
1880 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1881 return decode_constrained_packed_array (arr
);
1886 /* If ARR does not represent an array, returns ARR unchanged.
1887 Otherwise, returns a standard GDB array describing ARR (which may
1888 be ARR itself if it already is in the proper form). */
1891 ada_coerce_to_simple_array (struct value
*arr
)
1893 if (ada_is_array_descriptor_type (value_type (arr
)))
1895 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1898 error (_("Bounds unavailable for null array pointer."));
1899 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
1900 return value_ind (arrVal
);
1902 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1903 return decode_constrained_packed_array (arr
);
1908 /* If TYPE represents a GNAT array type, return it translated to an
1909 ordinary GDB array type (possibly with BITSIZE fields indicating
1910 packing). For other types, is the identity. */
1913 ada_coerce_to_simple_array_type (struct type
*type
)
1915 if (ada_is_constrained_packed_array_type (type
))
1916 return decode_constrained_packed_array_type (type
);
1918 if (ada_is_array_descriptor_type (type
))
1919 return ada_check_typedef (desc_data_target_type (type
));
1924 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1927 ada_is_gnat_encoded_packed_array_type (struct type
*type
)
1931 type
= desc_base_type (type
);
1932 type
= ada_check_typedef (type
);
1934 ada_type_name (type
) != NULL
1935 && strstr (ada_type_name (type
), "___XP") != NULL
;
1938 /* Non-zero iff TYPE represents a standard GNAT constrained
1939 packed-array type. */
1942 ada_is_constrained_packed_array_type (struct type
*type
)
1944 return ada_is_gnat_encoded_packed_array_type (type
)
1945 && !ada_is_array_descriptor_type (type
);
1948 /* Non-zero iff TYPE represents an array descriptor for a
1949 unconstrained packed-array type. */
1952 ada_is_unconstrained_packed_array_type (struct type
*type
)
1954 if (!ada_is_array_descriptor_type (type
))
1957 if (ada_is_gnat_encoded_packed_array_type (type
))
1960 /* If we saw GNAT encodings, then the above code is sufficient.
1961 However, with minimal encodings, we will just have a thick
1963 if (is_thick_pntr (type
))
1965 type
= desc_base_type (type
);
1966 /* The structure's first field is a pointer to an array, so this
1967 fetches the array type. */
1968 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
1969 /* Now we can see if the array elements are packed. */
1970 return TYPE_FIELD_BITSIZE (type
, 0) > 0;
1976 /* Return true if TYPE is a (Gnat-encoded) constrained packed array
1977 type, or if it is an ordinary (non-Gnat-encoded) packed array. */
1980 ada_is_any_packed_array_type (struct type
*type
)
1982 return (ada_is_constrained_packed_array_type (type
)
1983 || (type
->code () == TYPE_CODE_ARRAY
1984 && TYPE_FIELD_BITSIZE (type
, 0) % 8 != 0));
1987 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1988 return the size of its elements in bits. */
1991 decode_packed_array_bitsize (struct type
*type
)
1993 const char *raw_name
;
1997 /* Access to arrays implemented as fat pointers are encoded as a typedef
1998 of the fat pointer type. We need the name of the fat pointer type
1999 to do the decoding, so strip the typedef layer. */
2000 if (type
->code () == TYPE_CODE_TYPEDEF
)
2001 type
= ada_typedef_target_type (type
);
2003 raw_name
= ada_type_name (ada_check_typedef (type
));
2005 raw_name
= ada_type_name (desc_base_type (type
));
2010 tail
= strstr (raw_name
, "___XP");
2011 if (tail
== nullptr)
2013 gdb_assert (is_thick_pntr (type
));
2014 /* The structure's first field is a pointer to an array, so this
2015 fetches the array type. */
2016 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
2017 /* Now we can see if the array elements are packed. */
2018 return TYPE_FIELD_BITSIZE (type
, 0);
2021 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2024 (_("could not understand bit size information on packed array"));
2031 /* Given that TYPE is a standard GDB array type with all bounds filled
2032 in, and that the element size of its ultimate scalar constituents
2033 (that is, either its elements, or, if it is an array of arrays, its
2034 elements' elements, etc.) is *ELT_BITS, return an identical type,
2035 but with the bit sizes of its elements (and those of any
2036 constituent arrays) recorded in the BITSIZE components of its
2037 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2040 Note that, for arrays whose index type has an XA encoding where
2041 a bound references a record discriminant, getting that discriminant,
2042 and therefore the actual value of that bound, is not possible
2043 because none of the given parameters gives us access to the record.
2044 This function assumes that it is OK in the context where it is being
2045 used to return an array whose bounds are still dynamic and where
2046 the length is arbitrary. */
2048 static struct type
*
2049 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2051 struct type
*new_elt_type
;
2052 struct type
*new_type
;
2053 struct type
*index_type_desc
;
2054 struct type
*index_type
;
2055 LONGEST low_bound
, high_bound
;
2057 type
= ada_check_typedef (type
);
2058 if (type
->code () != TYPE_CODE_ARRAY
)
2061 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2062 if (index_type_desc
)
2063 index_type
= to_fixed_range_type (index_type_desc
->field (0).type (),
2066 index_type
= type
->index_type ();
2068 new_type
= alloc_type_copy (type
);
2070 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2072 create_array_type (new_type
, new_elt_type
, index_type
);
2073 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2074 new_type
->set_name (ada_type_name (type
));
2076 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2077 && is_dynamic_type (check_typedef (index_type
)))
2078 || !get_discrete_bounds (index_type
, &low_bound
, &high_bound
))
2079 low_bound
= high_bound
= 0;
2080 if (high_bound
< low_bound
)
2081 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2084 *elt_bits
*= (high_bound
- low_bound
+ 1);
2085 TYPE_LENGTH (new_type
) =
2086 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2089 new_type
->set_is_fixed_instance (true);
2093 /* The array type encoded by TYPE, where
2094 ada_is_constrained_packed_array_type (TYPE). */
2096 static struct type
*
2097 decode_constrained_packed_array_type (struct type
*type
)
2099 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2102 struct type
*shadow_type
;
2106 raw_name
= ada_type_name (desc_base_type (type
));
2111 name
= (char *) alloca (strlen (raw_name
) + 1);
2112 tail
= strstr (raw_name
, "___XP");
2113 type
= desc_base_type (type
);
2115 memcpy (name
, raw_name
, tail
- raw_name
);
2116 name
[tail
- raw_name
] = '\000';
2118 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2120 if (shadow_type
== NULL
)
2122 lim_warning (_("could not find bounds information on packed array"));
2125 shadow_type
= check_typedef (shadow_type
);
2127 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2129 lim_warning (_("could not understand bounds "
2130 "information on packed array"));
2134 bits
= decode_packed_array_bitsize (type
);
2135 return constrained_packed_array_type (shadow_type
, &bits
);
2138 /* Helper function for decode_constrained_packed_array. Set the field
2139 bitsize on a series of packed arrays. Returns the number of
2140 elements in TYPE. */
2143 recursively_update_array_bitsize (struct type
*type
)
2145 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
2148 if (!get_discrete_bounds (type
->index_type (), &low
, &high
)
2151 LONGEST our_len
= high
- low
+ 1;
2153 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
2154 if (elt_type
->code () == TYPE_CODE_ARRAY
)
2156 LONGEST elt_len
= recursively_update_array_bitsize (elt_type
);
2157 LONGEST elt_bitsize
= elt_len
* TYPE_FIELD_BITSIZE (elt_type
, 0);
2158 TYPE_FIELD_BITSIZE (type
, 0) = elt_bitsize
;
2160 TYPE_LENGTH (type
) = ((our_len
* elt_bitsize
+ HOST_CHAR_BIT
- 1)
2167 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2168 array, returns a simple array that denotes that array. Its type is a
2169 standard GDB array type except that the BITSIZEs of the array
2170 target types are set to the number of bits in each element, and the
2171 type length is set appropriately. */
2173 static struct value
*
2174 decode_constrained_packed_array (struct value
*arr
)
2178 /* If our value is a pointer, then dereference it. Likewise if
2179 the value is a reference. Make sure that this operation does not
2180 cause the target type to be fixed, as this would indirectly cause
2181 this array to be decoded. The rest of the routine assumes that
2182 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2183 and "value_ind" routines to perform the dereferencing, as opposed
2184 to using "ada_coerce_ref" or "ada_value_ind". */
2185 arr
= coerce_ref (arr
);
2186 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2187 arr
= value_ind (arr
);
2189 type
= decode_constrained_packed_array_type (value_type (arr
));
2192 error (_("can't unpack array"));
2196 /* Decoding the packed array type could not correctly set the field
2197 bitsizes for any dimension except the innermost, because the
2198 bounds may be variable and were not passed to that function. So,
2199 we further resolve the array bounds here and then update the
2201 const gdb_byte
*valaddr
= value_contents_for_printing (arr
);
2202 CORE_ADDR address
= value_address (arr
);
2203 gdb::array_view
<const gdb_byte
> view
2204 = gdb::make_array_view (valaddr
, TYPE_LENGTH (type
));
2205 type
= resolve_dynamic_type (type
, view
, address
);
2206 recursively_update_array_bitsize (type
);
2208 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2209 && ada_is_modular_type (value_type (arr
)))
2211 /* This is a (right-justified) modular type representing a packed
2212 array with no wrapper. In order to interpret the value through
2213 the (left-justified) packed array type we just built, we must
2214 first left-justify it. */
2215 int bit_size
, bit_pos
;
2218 mod
= ada_modulus (value_type (arr
)) - 1;
2225 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2226 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2227 bit_pos
/ HOST_CHAR_BIT
,
2228 bit_pos
% HOST_CHAR_BIT
,
2233 return coerce_unspec_val_to_type (arr
, type
);
2237 /* The value of the element of packed array ARR at the ARITY indices
2238 given in IND. ARR must be a simple array. */
2240 static struct value
*
2241 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2244 int bits
, elt_off
, bit_off
;
2245 long elt_total_bit_offset
;
2246 struct type
*elt_type
;
2250 elt_total_bit_offset
= 0;
2251 elt_type
= ada_check_typedef (value_type (arr
));
2252 for (i
= 0; i
< arity
; i
+= 1)
2254 if (elt_type
->code () != TYPE_CODE_ARRAY
2255 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2257 (_("attempt to do packed indexing of "
2258 "something other than a packed array"));
2261 struct type
*range_type
= elt_type
->index_type ();
2262 LONGEST lowerbound
, upperbound
;
2265 if (!get_discrete_bounds (range_type
, &lowerbound
, &upperbound
))
2267 lim_warning (_("don't know bounds of array"));
2268 lowerbound
= upperbound
= 0;
2271 idx
= pos_atr (ind
[i
]);
2272 if (idx
< lowerbound
|| idx
> upperbound
)
2273 lim_warning (_("packed array index %ld out of bounds"),
2275 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2276 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2277 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2280 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2281 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2283 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2288 /* Non-zero iff TYPE includes negative integer values. */
2291 has_negatives (struct type
*type
)
2293 switch (type
->code ())
2298 return !type
->is_unsigned ();
2299 case TYPE_CODE_RANGE
:
2300 return type
->bounds ()->low
.const_val () - type
->bounds ()->bias
< 0;
2304 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2305 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2306 the unpacked buffer.
2308 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2309 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2311 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2314 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2316 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2319 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2320 gdb_byte
*unpacked
, int unpacked_len
,
2321 int is_big_endian
, int is_signed_type
,
2324 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2325 int src_idx
; /* Index into the source area */
2326 int src_bytes_left
; /* Number of source bytes left to process. */
2327 int srcBitsLeft
; /* Number of source bits left to move */
2328 int unusedLS
; /* Number of bits in next significant
2329 byte of source that are unused */
2331 int unpacked_idx
; /* Index into the unpacked buffer */
2332 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2334 unsigned long accum
; /* Staging area for bits being transferred */
2335 int accumSize
; /* Number of meaningful bits in accum */
2338 /* Transmit bytes from least to most significant; delta is the direction
2339 the indices move. */
2340 int delta
= is_big_endian
? -1 : 1;
2342 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2344 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2345 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2346 bit_size
, unpacked_len
);
2348 srcBitsLeft
= bit_size
;
2349 src_bytes_left
= src_len
;
2350 unpacked_bytes_left
= unpacked_len
;
2355 src_idx
= src_len
- 1;
2357 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2361 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2367 unpacked_idx
= unpacked_len
- 1;
2371 /* Non-scalar values must be aligned at a byte boundary... */
2373 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2374 /* ... And are placed at the beginning (most-significant) bytes
2376 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2377 unpacked_bytes_left
= unpacked_idx
+ 1;
2382 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2384 src_idx
= unpacked_idx
= 0;
2385 unusedLS
= bit_offset
;
2388 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2393 while (src_bytes_left
> 0)
2395 /* Mask for removing bits of the next source byte that are not
2396 part of the value. */
2397 unsigned int unusedMSMask
=
2398 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2400 /* Sign-extend bits for this byte. */
2401 unsigned int signMask
= sign
& ~unusedMSMask
;
2404 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2405 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2406 if (accumSize
>= HOST_CHAR_BIT
)
2408 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2409 accumSize
-= HOST_CHAR_BIT
;
2410 accum
>>= HOST_CHAR_BIT
;
2411 unpacked_bytes_left
-= 1;
2412 unpacked_idx
+= delta
;
2414 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2416 src_bytes_left
-= 1;
2419 while (unpacked_bytes_left
> 0)
2421 accum
|= sign
<< accumSize
;
2422 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2423 accumSize
-= HOST_CHAR_BIT
;
2426 accum
>>= HOST_CHAR_BIT
;
2427 unpacked_bytes_left
-= 1;
2428 unpacked_idx
+= delta
;
2432 /* Create a new value of type TYPE from the contents of OBJ starting
2433 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2434 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2435 assigning through the result will set the field fetched from.
2436 VALADDR is ignored unless OBJ is NULL, in which case,
2437 VALADDR+OFFSET must address the start of storage containing the
2438 packed value. The value returned in this case is never an lval.
2439 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2442 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2443 long offset
, int bit_offset
, int bit_size
,
2447 const gdb_byte
*src
; /* First byte containing data to unpack */
2449 const int is_scalar
= is_scalar_type (type
);
2450 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2451 gdb::byte_vector staging
;
2453 type
= ada_check_typedef (type
);
2456 src
= valaddr
+ offset
;
2458 src
= value_contents (obj
) + offset
;
2460 if (is_dynamic_type (type
))
2462 /* The length of TYPE might by dynamic, so we need to resolve
2463 TYPE in order to know its actual size, which we then use
2464 to create the contents buffer of the value we return.
2465 The difficulty is that the data containing our object is
2466 packed, and therefore maybe not at a byte boundary. So, what
2467 we do, is unpack the data into a byte-aligned buffer, and then
2468 use that buffer as our object's value for resolving the type. */
2469 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2470 staging
.resize (staging_len
);
2472 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2473 staging
.data (), staging
.size (),
2474 is_big_endian
, has_negatives (type
),
2476 type
= resolve_dynamic_type (type
, staging
, 0);
2477 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2479 /* This happens when the length of the object is dynamic,
2480 and is actually smaller than the space reserved for it.
2481 For instance, in an array of variant records, the bit_size
2482 we're given is the array stride, which is constant and
2483 normally equal to the maximum size of its element.
2484 But, in reality, each element only actually spans a portion
2486 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2492 v
= allocate_value (type
);
2493 src
= valaddr
+ offset
;
2495 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2497 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2500 v
= value_at (type
, value_address (obj
) + offset
);
2501 buf
= (gdb_byte
*) alloca (src_len
);
2502 read_memory (value_address (v
), buf
, src_len
);
2507 v
= allocate_value (type
);
2508 src
= value_contents (obj
) + offset
;
2513 long new_offset
= offset
;
2515 set_value_component_location (v
, obj
);
2516 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2517 set_value_bitsize (v
, bit_size
);
2518 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2521 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2523 set_value_offset (v
, new_offset
);
2525 /* Also set the parent value. This is needed when trying to
2526 assign a new value (in inferior memory). */
2527 set_value_parent (v
, obj
);
2530 set_value_bitsize (v
, bit_size
);
2531 unpacked
= value_contents_writeable (v
);
2535 memset (unpacked
, 0, TYPE_LENGTH (type
));
2539 if (staging
.size () == TYPE_LENGTH (type
))
2541 /* Small short-cut: If we've unpacked the data into a buffer
2542 of the same size as TYPE's length, then we can reuse that,
2543 instead of doing the unpacking again. */
2544 memcpy (unpacked
, staging
.data (), staging
.size ());
2547 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2548 unpacked
, TYPE_LENGTH (type
),
2549 is_big_endian
, has_negatives (type
), is_scalar
);
2554 /* Store the contents of FROMVAL into the location of TOVAL.
2555 Return a new value with the location of TOVAL and contents of
2556 FROMVAL. Handles assignment into packed fields that have
2557 floating-point or non-scalar types. */
2559 static struct value
*
2560 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2562 struct type
*type
= value_type (toval
);
2563 int bits
= value_bitsize (toval
);
2565 toval
= ada_coerce_ref (toval
);
2566 fromval
= ada_coerce_ref (fromval
);
2568 if (ada_is_direct_array_type (value_type (toval
)))
2569 toval
= ada_coerce_to_simple_array (toval
);
2570 if (ada_is_direct_array_type (value_type (fromval
)))
2571 fromval
= ada_coerce_to_simple_array (fromval
);
2573 if (!deprecated_value_modifiable (toval
))
2574 error (_("Left operand of assignment is not a modifiable lvalue."));
2576 if (VALUE_LVAL (toval
) == lval_memory
2578 && (type
->code () == TYPE_CODE_FLT
2579 || type
->code () == TYPE_CODE_STRUCT
))
2581 int len
= (value_bitpos (toval
)
2582 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2584 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2586 CORE_ADDR to_addr
= value_address (toval
);
2588 if (type
->code () == TYPE_CODE_FLT
)
2589 fromval
= value_cast (type
, fromval
);
2591 read_memory (to_addr
, buffer
, len
);
2592 from_size
= value_bitsize (fromval
);
2594 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2596 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2597 ULONGEST from_offset
= 0;
2598 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2599 from_offset
= from_size
- bits
;
2600 copy_bitwise (buffer
, value_bitpos (toval
),
2601 value_contents (fromval
), from_offset
,
2602 bits
, is_big_endian
);
2603 write_memory_with_notification (to_addr
, buffer
, len
);
2605 val
= value_copy (toval
);
2606 memcpy (value_contents_raw (val
), value_contents (fromval
),
2607 TYPE_LENGTH (type
));
2608 deprecated_set_value_type (val
, type
);
2613 return value_assign (toval
, fromval
);
2617 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2618 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2619 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2620 COMPONENT, and not the inferior's memory. The current contents
2621 of COMPONENT are ignored.
2623 Although not part of the initial design, this function also works
2624 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2625 had a null address, and COMPONENT had an address which is equal to
2626 its offset inside CONTAINER. */
2629 value_assign_to_component (struct value
*container
, struct value
*component
,
2632 LONGEST offset_in_container
=
2633 (LONGEST
) (value_address (component
) - value_address (container
));
2634 int bit_offset_in_container
=
2635 value_bitpos (component
) - value_bitpos (container
);
2638 val
= value_cast (value_type (component
), val
);
2640 if (value_bitsize (component
) == 0)
2641 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2643 bits
= value_bitsize (component
);
2645 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2649 if (is_scalar_type (check_typedef (value_type (component
))))
2651 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2654 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2655 value_bitpos (container
) + bit_offset_in_container
,
2656 value_contents (val
), src_offset
, bits
, 1);
2659 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2660 value_bitpos (container
) + bit_offset_in_container
,
2661 value_contents (val
), 0, bits
, 0);
2664 /* Determine if TYPE is an access to an unconstrained array. */
2667 ada_is_access_to_unconstrained_array (struct type
*type
)
2669 return (type
->code () == TYPE_CODE_TYPEDEF
2670 && is_thick_pntr (ada_typedef_target_type (type
)));
2673 /* The value of the element of array ARR at the ARITY indices given in IND.
2674 ARR may be either a simple array, GNAT array descriptor, or pointer
2678 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2682 struct type
*elt_type
;
2684 elt
= ada_coerce_to_simple_array (arr
);
2686 elt_type
= ada_check_typedef (value_type (elt
));
2687 if (elt_type
->code () == TYPE_CODE_ARRAY
2688 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2689 return value_subscript_packed (elt
, arity
, ind
);
2691 for (k
= 0; k
< arity
; k
+= 1)
2693 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2695 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2696 error (_("too many subscripts (%d expected)"), k
);
2698 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2700 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2701 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2703 /* The element is a typedef to an unconstrained array,
2704 except that the value_subscript call stripped the
2705 typedef layer. The typedef layer is GNAT's way to
2706 specify that the element is, at the source level, an
2707 access to the unconstrained array, rather than the
2708 unconstrained array. So, we need to restore that
2709 typedef layer, which we can do by forcing the element's
2710 type back to its original type. Otherwise, the returned
2711 value is going to be printed as the array, rather
2712 than as an access. Another symptom of the same issue
2713 would be that an expression trying to dereference the
2714 element would also be improperly rejected. */
2715 deprecated_set_value_type (elt
, saved_elt_type
);
2718 elt_type
= ada_check_typedef (value_type (elt
));
2724 /* Assuming ARR is a pointer to a GDB array, the value of the element
2725 of *ARR at the ARITY indices given in IND.
2726 Does not read the entire array into memory.
2728 Note: Unlike what one would expect, this function is used instead of
2729 ada_value_subscript for basically all non-packed array types. The reason
2730 for this is that a side effect of doing our own pointer arithmetics instead
2731 of relying on value_subscript is that there is no implicit typedef peeling.
2732 This is important for arrays of array accesses, where it allows us to
2733 preserve the fact that the array's element is an array access, where the
2734 access part os encoded in a typedef layer. */
2736 static struct value
*
2737 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2740 struct value
*array_ind
= ada_value_ind (arr
);
2742 = check_typedef (value_enclosing_type (array_ind
));
2744 if (type
->code () == TYPE_CODE_ARRAY
2745 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2746 return value_subscript_packed (array_ind
, arity
, ind
);
2748 for (k
= 0; k
< arity
; k
+= 1)
2752 if (type
->code () != TYPE_CODE_ARRAY
)
2753 error (_("too many subscripts (%d expected)"), k
);
2754 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2756 get_discrete_bounds (type
->index_type (), &lwb
, &upb
);
2757 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2758 type
= TYPE_TARGET_TYPE (type
);
2761 return value_ind (arr
);
2764 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2765 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2766 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2767 this array is LOW, as per Ada rules. */
2768 static struct value
*
2769 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2772 struct type
*type0
= ada_check_typedef (type
);
2773 struct type
*base_index_type
= TYPE_TARGET_TYPE (type0
->index_type ());
2774 struct type
*index_type
2775 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2776 struct type
*slice_type
= create_array_type_with_stride
2777 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2778 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2779 TYPE_FIELD_BITSIZE (type0
, 0));
2780 int base_low
= ada_discrete_type_low_bound (type0
->index_type ());
2781 gdb::optional
<LONGEST
> base_low_pos
, low_pos
;
2784 low_pos
= discrete_position (base_index_type
, low
);
2785 base_low_pos
= discrete_position (base_index_type
, base_low
);
2787 if (!low_pos
.has_value () || !base_low_pos
.has_value ())
2789 warning (_("unable to get positions in slice, use bounds instead"));
2791 base_low_pos
= base_low
;
2794 ULONGEST stride
= TYPE_FIELD_BITSIZE (slice_type
, 0) / 8;
2796 stride
= TYPE_LENGTH (TYPE_TARGET_TYPE (type0
));
2798 base
= value_as_address (array_ptr
) + (*low_pos
- *base_low_pos
) * stride
;
2799 return value_at_lazy (slice_type
, base
);
2803 static struct value
*
2804 ada_value_slice (struct value
*array
, int low
, int high
)
2806 struct type
*type
= ada_check_typedef (value_type (array
));
2807 struct type
*base_index_type
= TYPE_TARGET_TYPE (type
->index_type ());
2808 struct type
*index_type
2809 = create_static_range_type (NULL
, type
->index_type (), low
, high
);
2810 struct type
*slice_type
= create_array_type_with_stride
2811 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2812 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2813 TYPE_FIELD_BITSIZE (type
, 0));
2814 gdb::optional
<LONGEST
> low_pos
, high_pos
;
2817 low_pos
= discrete_position (base_index_type
, low
);
2818 high_pos
= discrete_position (base_index_type
, high
);
2820 if (!low_pos
.has_value () || !high_pos
.has_value ())
2822 warning (_("unable to get positions in slice, use bounds instead"));
2827 return value_cast (slice_type
,
2828 value_slice (array
, low
, *high_pos
- *low_pos
+ 1));
2831 /* If type is a record type in the form of a standard GNAT array
2832 descriptor, returns the number of dimensions for type. If arr is a
2833 simple array, returns the number of "array of"s that prefix its
2834 type designation. Otherwise, returns 0. */
2837 ada_array_arity (struct type
*type
)
2844 type
= desc_base_type (type
);
2847 if (type
->code () == TYPE_CODE_STRUCT
)
2848 return desc_arity (desc_bounds_type (type
));
2850 while (type
->code () == TYPE_CODE_ARRAY
)
2853 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2859 /* If TYPE is a record type in the form of a standard GNAT array
2860 descriptor or a simple array type, returns the element type for
2861 TYPE after indexing by NINDICES indices, or by all indices if
2862 NINDICES is -1. Otherwise, returns NULL. */
2865 ada_array_element_type (struct type
*type
, int nindices
)
2867 type
= desc_base_type (type
);
2869 if (type
->code () == TYPE_CODE_STRUCT
)
2872 struct type
*p_array_type
;
2874 p_array_type
= desc_data_target_type (type
);
2876 k
= ada_array_arity (type
);
2880 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2881 if (nindices
>= 0 && k
> nindices
)
2883 while (k
> 0 && p_array_type
!= NULL
)
2885 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2888 return p_array_type
;
2890 else if (type
->code () == TYPE_CODE_ARRAY
)
2892 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2894 type
= TYPE_TARGET_TYPE (type
);
2903 /* The type of nth index in arrays of given type (n numbering from 1).
2904 Does not examine memory. Throws an error if N is invalid or TYPE
2905 is not an array type. NAME is the name of the Ada attribute being
2906 evaluated ('range, 'first, 'last, or 'length); it is used in building
2907 the error message. */
2909 static struct type
*
2910 ada_index_type (struct type
*type
, int n
, const char *name
)
2912 struct type
*result_type
;
2914 type
= desc_base_type (type
);
2916 if (n
< 0 || n
> ada_array_arity (type
))
2917 error (_("invalid dimension number to '%s"), name
);
2919 if (ada_is_simple_array_type (type
))
2923 for (i
= 1; i
< n
; i
+= 1)
2924 type
= TYPE_TARGET_TYPE (type
);
2925 result_type
= TYPE_TARGET_TYPE (type
->index_type ());
2926 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2927 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2928 perhaps stabsread.c would make more sense. */
2929 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2934 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2935 if (result_type
== NULL
)
2936 error (_("attempt to take bound of something that is not an array"));
2942 /* Given that arr is an array type, returns the lower bound of the
2943 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2944 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2945 array-descriptor type. It works for other arrays with bounds supplied
2946 by run-time quantities other than discriminants. */
2949 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2951 struct type
*type
, *index_type_desc
, *index_type
;
2954 gdb_assert (which
== 0 || which
== 1);
2956 if (ada_is_constrained_packed_array_type (arr_type
))
2957 arr_type
= decode_constrained_packed_array_type (arr_type
);
2959 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2960 return (LONGEST
) - which
;
2962 if (arr_type
->code () == TYPE_CODE_PTR
)
2963 type
= TYPE_TARGET_TYPE (arr_type
);
2967 if (type
->is_fixed_instance ())
2969 /* The array has already been fixed, so we do not need to
2970 check the parallel ___XA type again. That encoding has
2971 already been applied, so ignore it now. */
2972 index_type_desc
= NULL
;
2976 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2977 ada_fixup_array_indexes_type (index_type_desc
);
2980 if (index_type_desc
!= NULL
)
2981 index_type
= to_fixed_range_type (index_type_desc
->field (n
- 1).type (),
2985 struct type
*elt_type
= check_typedef (type
);
2987 for (i
= 1; i
< n
; i
++)
2988 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
2990 index_type
= elt_type
->index_type ();
2994 (LONGEST
) (which
== 0
2995 ? ada_discrete_type_low_bound (index_type
)
2996 : ada_discrete_type_high_bound (index_type
));
2999 /* Given that arr is an array value, returns the lower bound of the
3000 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3001 WHICH is 1. This routine will also work for arrays with bounds
3002 supplied by run-time quantities other than discriminants. */
3005 ada_array_bound (struct value
*arr
, int n
, int which
)
3007 struct type
*arr_type
;
3009 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3010 arr
= value_ind (arr
);
3011 arr_type
= value_enclosing_type (arr
);
3013 if (ada_is_constrained_packed_array_type (arr_type
))
3014 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3015 else if (ada_is_simple_array_type (arr_type
))
3016 return ada_array_bound_from_type (arr_type
, n
, which
);
3018 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3021 /* Given that arr is an array value, returns the length of the
3022 nth index. This routine will also work for arrays with bounds
3023 supplied by run-time quantities other than discriminants.
3024 Does not work for arrays indexed by enumeration types with representation
3025 clauses at the moment. */
3028 ada_array_length (struct value
*arr
, int n
)
3030 struct type
*arr_type
, *index_type
;
3033 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3034 arr
= value_ind (arr
);
3035 arr_type
= value_enclosing_type (arr
);
3037 if (ada_is_constrained_packed_array_type (arr_type
))
3038 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3040 if (ada_is_simple_array_type (arr_type
))
3042 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3043 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3047 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3048 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3051 arr_type
= check_typedef (arr_type
);
3052 index_type
= ada_index_type (arr_type
, n
, "length");
3053 if (index_type
!= NULL
)
3055 struct type
*base_type
;
3056 if (index_type
->code () == TYPE_CODE_RANGE
)
3057 base_type
= TYPE_TARGET_TYPE (index_type
);
3059 base_type
= index_type
;
3061 low
= pos_atr (value_from_longest (base_type
, low
));
3062 high
= pos_atr (value_from_longest (base_type
, high
));
3064 return high
- low
+ 1;
3067 /* An array whose type is that of ARR_TYPE (an array type), with
3068 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3069 less than LOW, then LOW-1 is used. */
3071 static struct value
*
3072 empty_array (struct type
*arr_type
, int low
, int high
)
3074 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3075 struct type
*index_type
3076 = create_static_range_type
3077 (NULL
, TYPE_TARGET_TYPE (arr_type0
->index_type ()), low
,
3078 high
< low
? low
- 1 : high
);
3079 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3081 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3085 /* Name resolution */
3087 /* The "decoded" name for the user-definable Ada operator corresponding
3091 ada_decoded_op_name (enum exp_opcode op
)
3095 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3097 if (ada_opname_table
[i
].op
== op
)
3098 return ada_opname_table
[i
].decoded
;
3100 error (_("Could not find operator name for opcode"));
3103 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3104 in a listing of choices during disambiguation (see sort_choices, below).
3105 The idea is that overloadings of a subprogram name from the
3106 same package should sort in their source order. We settle for ordering
3107 such symbols by their trailing number (__N or $N). */
3110 encoded_ordered_before (const char *N0
, const char *N1
)
3114 else if (N0
== NULL
)
3120 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3122 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3124 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3125 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3130 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3133 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3135 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3136 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3138 return (strcmp (N0
, N1
) < 0);
3142 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3146 sort_choices (struct block_symbol syms
[], int nsyms
)
3150 for (i
= 1; i
< nsyms
; i
+= 1)
3152 struct block_symbol sym
= syms
[i
];
3155 for (j
= i
- 1; j
>= 0; j
-= 1)
3157 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3158 sym
.symbol
->linkage_name ()))
3160 syms
[j
+ 1] = syms
[j
];
3166 /* Whether GDB should display formals and return types for functions in the
3167 overloads selection menu. */
3168 static bool print_signatures
= true;
3170 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3171 all but functions, the signature is just the name of the symbol. For
3172 functions, this is the name of the function, the list of types for formals
3173 and the return type (if any). */
3176 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3177 const struct type_print_options
*flags
)
3179 struct type
*type
= SYMBOL_TYPE (sym
);
3181 fprintf_filtered (stream
, "%s", sym
->print_name ());
3182 if (!print_signatures
3184 || type
->code () != TYPE_CODE_FUNC
)
3187 if (type
->num_fields () > 0)
3191 fprintf_filtered (stream
, " (");
3192 for (i
= 0; i
< type
->num_fields (); ++i
)
3195 fprintf_filtered (stream
, "; ");
3196 ada_print_type (type
->field (i
).type (), NULL
, stream
, -1, 0,
3199 fprintf_filtered (stream
, ")");
3201 if (TYPE_TARGET_TYPE (type
) != NULL
3202 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3204 fprintf_filtered (stream
, " return ");
3205 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3209 /* Read and validate a set of numeric choices from the user in the
3210 range 0 .. N_CHOICES-1. Place the results in increasing
3211 order in CHOICES[0 .. N-1], and return N.
3213 The user types choices as a sequence of numbers on one line
3214 separated by blanks, encoding them as follows:
3216 + A choice of 0 means to cancel the selection, throwing an error.
3217 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3218 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3220 The user is not allowed to choose more than MAX_RESULTS values.
3222 ANNOTATION_SUFFIX, if present, is used to annotate the input
3223 prompts (for use with the -f switch). */
3226 get_selections (int *choices
, int n_choices
, int max_results
,
3227 int is_all_choice
, const char *annotation_suffix
)
3232 int first_choice
= is_all_choice
? 2 : 1;
3234 prompt
= getenv ("PS2");
3238 args
= command_line_input (prompt
, annotation_suffix
);
3241 error_no_arg (_("one or more choice numbers"));
3245 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3246 order, as given in args. Choices are validated. */
3252 args
= skip_spaces (args
);
3253 if (*args
== '\0' && n_chosen
== 0)
3254 error_no_arg (_("one or more choice numbers"));
3255 else if (*args
== '\0')
3258 choice
= strtol (args
, &args2
, 10);
3259 if (args
== args2
|| choice
< 0
3260 || choice
> n_choices
+ first_choice
- 1)
3261 error (_("Argument must be choice number"));
3265 error (_("cancelled"));
3267 if (choice
< first_choice
)
3269 n_chosen
= n_choices
;
3270 for (j
= 0; j
< n_choices
; j
+= 1)
3274 choice
-= first_choice
;
3276 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3280 if (j
< 0 || choice
!= choices
[j
])
3284 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3285 choices
[k
+ 1] = choices
[k
];
3286 choices
[j
+ 1] = choice
;
3291 if (n_chosen
> max_results
)
3292 error (_("Select no more than %d of the above"), max_results
);
3297 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3298 by asking the user (if necessary), returning the number selected,
3299 and setting the first elements of SYMS items. Error if no symbols
3302 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3303 to be re-integrated one of these days. */
3306 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3309 int *chosen
= XALLOCAVEC (int , nsyms
);
3311 int first_choice
= (max_results
== 1) ? 1 : 2;
3312 const char *select_mode
= multiple_symbols_select_mode ();
3314 if (max_results
< 1)
3315 error (_("Request to select 0 symbols!"));
3319 if (select_mode
== multiple_symbols_cancel
)
3321 canceled because the command is ambiguous\n\
3322 See set/show multiple-symbol."));
3324 /* If select_mode is "all", then return all possible symbols.
3325 Only do that if more than one symbol can be selected, of course.
3326 Otherwise, display the menu as usual. */
3327 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3330 printf_filtered (_("[0] cancel\n"));
3331 if (max_results
> 1)
3332 printf_filtered (_("[1] all\n"));
3334 sort_choices (syms
, nsyms
);
3336 for (i
= 0; i
< nsyms
; i
+= 1)
3338 if (syms
[i
].symbol
== NULL
)
3341 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3343 struct symtab_and_line sal
=
3344 find_function_start_sal (syms
[i
].symbol
, 1);
3346 printf_filtered ("[%d] ", i
+ first_choice
);
3347 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3348 &type_print_raw_options
);
3349 if (sal
.symtab
== NULL
)
3350 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3351 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3355 styled_string (file_name_style
.style (),
3356 symtab_to_filename_for_display (sal
.symtab
)),
3363 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3364 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3365 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3366 struct symtab
*symtab
= NULL
;
3368 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3369 symtab
= symbol_symtab (syms
[i
].symbol
);
3371 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3373 printf_filtered ("[%d] ", i
+ first_choice
);
3374 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3375 &type_print_raw_options
);
3376 printf_filtered (_(" at %s:%d\n"),
3377 symtab_to_filename_for_display (symtab
),
3378 SYMBOL_LINE (syms
[i
].symbol
));
3380 else if (is_enumeral
3381 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3383 printf_filtered (("[%d] "), i
+ first_choice
);
3384 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3385 gdb_stdout
, -1, 0, &type_print_raw_options
);
3386 printf_filtered (_("'(%s) (enumeral)\n"),
3387 syms
[i
].symbol
->print_name ());
3391 printf_filtered ("[%d] ", i
+ first_choice
);
3392 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3393 &type_print_raw_options
);
3396 printf_filtered (is_enumeral
3397 ? _(" in %s (enumeral)\n")
3399 symtab_to_filename_for_display (symtab
));
3401 printf_filtered (is_enumeral
3402 ? _(" (enumeral)\n")
3408 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3411 for (i
= 0; i
< n_chosen
; i
+= 1)
3412 syms
[i
] = syms
[chosen
[i
]];
3417 /* Resolve the operator of the subexpression beginning at
3418 position *POS of *EXPP. "Resolving" consists of replacing
3419 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3420 with their resolutions, replacing built-in operators with
3421 function calls to user-defined operators, where appropriate, and,
3422 when DEPROCEDURE_P is non-zero, converting function-valued variables
3423 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3424 are as in ada_resolve, above. */
3426 static struct value
*
3427 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3428 struct type
*context_type
, int parse_completion
,
3429 innermost_block_tracker
*tracker
)
3433 struct expression
*exp
; /* Convenience: == *expp. */
3434 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3435 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3436 int nargs
; /* Number of operands. */
3438 /* If we're resolving an expression like ARRAY(ARG...), then we set
3439 this to the type of the array, so we can use the index types as
3440 the expected types for resolution. */
3441 struct type
*array_type
= nullptr;
3442 /* The arity of ARRAY_TYPE. */
3443 int array_arity
= 0;
3449 /* Pass one: resolve operands, saving their types and updating *pos,
3454 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3455 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3460 struct value
*lhs
= resolve_subexp (expp
, pos
, 0, NULL
,
3461 parse_completion
, tracker
);
3462 struct type
*lhstype
= ada_check_typedef (value_type (lhs
));
3463 array_arity
= ada_array_arity (lhstype
);
3464 if (array_arity
> 0)
3465 array_type
= lhstype
;
3467 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3472 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3477 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3478 parse_completion
, tracker
);
3481 case OP_ATR_MODULUS
:
3491 case TERNOP_IN_RANGE
:
3492 case BINOP_IN_BOUNDS
:
3498 case OP_DISCRETE_RANGE
:
3500 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3509 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3511 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3513 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3531 case BINOP_LOGICAL_AND
:
3532 case BINOP_LOGICAL_OR
:
3533 case BINOP_BITWISE_AND
:
3534 case BINOP_BITWISE_IOR
:
3535 case BINOP_BITWISE_XOR
:
3538 case BINOP_NOTEQUAL
:
3545 case BINOP_SUBSCRIPT
:
3553 case UNOP_LOGICAL_NOT
:
3563 case OP_VAR_MSYM_VALUE
:
3570 case OP_INTERNALVAR
:
3580 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3583 case STRUCTOP_STRUCT
:
3584 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3597 error (_("Unexpected operator during name resolution"));
3600 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3601 for (i
= 0; i
< nargs
; i
+= 1)
3603 struct type
*subtype
= nullptr;
3604 if (i
< array_arity
)
3605 subtype
= ada_index_type (array_type
, i
+ 1, "array type");
3606 argvec
[i
] = resolve_subexp (expp
, pos
, 1, subtype
, parse_completion
,
3612 /* Pass two: perform any resolution on principal operator. */
3619 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3621 std::vector
<struct block_symbol
> candidates
3622 = ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3623 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
);
3625 if (std::any_of (candidates
.begin (),
3627 [] (block_symbol
&sym
)
3629 switch (SYMBOL_CLASS (sym
.symbol
))
3634 case LOC_REGPARM_ADDR
:
3643 /* Types tend to get re-introduced locally, so if there
3644 are any local symbols that are not types, first filter
3648 (candidates
.begin (),
3650 [] (block_symbol
&sym
)
3652 return SYMBOL_CLASS (sym
.symbol
) == LOC_TYPEDEF
;
3657 if (candidates
.empty ())
3658 error (_("No definition found for %s"),
3659 exp
->elts
[pc
+ 2].symbol
->print_name ());
3660 else if (candidates
.size () == 1)
3662 else if (deprocedure_p
&& !is_nonfunction (candidates
))
3664 i
= ada_resolve_function
3665 (candidates
, NULL
, 0,
3666 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3667 context_type
, parse_completion
);
3669 error (_("Could not find a match for %s"),
3670 exp
->elts
[pc
+ 2].symbol
->print_name ());
3674 printf_filtered (_("Multiple matches for %s\n"),
3675 exp
->elts
[pc
+ 2].symbol
->print_name ());
3676 user_select_syms (candidates
.data (), candidates
.size (), 1);
3680 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3681 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3682 tracker
->update (candidates
[i
]);
3686 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3689 replace_operator_with_call (expp
, pc
, 0, 4,
3690 exp
->elts
[pc
+ 2].symbol
,
3691 exp
->elts
[pc
+ 1].block
);
3698 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3699 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3701 std::vector
<struct block_symbol
> candidates
3702 = ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3703 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
);
3705 if (candidates
.size () == 1)
3709 i
= ada_resolve_function
3712 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3713 context_type
, parse_completion
);
3715 error (_("Could not find a match for %s"),
3716 exp
->elts
[pc
+ 5].symbol
->print_name ());
3719 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3720 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3721 tracker
->update (candidates
[i
]);
3732 case BINOP_BITWISE_AND
:
3733 case BINOP_BITWISE_IOR
:
3734 case BINOP_BITWISE_XOR
:
3736 case BINOP_NOTEQUAL
:
3744 case UNOP_LOGICAL_NOT
:
3746 if (possible_user_operator_p (op
, argvec
))
3748 std::vector
<struct block_symbol
> candidates
3749 = ada_lookup_symbol_list (ada_decoded_op_name (op
),
3752 i
= ada_resolve_function (candidates
, argvec
,
3753 nargs
, ada_decoded_op_name (op
), NULL
,
3758 replace_operator_with_call (expp
, pc
, nargs
, 1,
3759 candidates
[i
].symbol
,
3760 candidates
[i
].block
);
3771 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3772 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3773 exp
->elts
[pc
+ 1].objfile
,
3774 exp
->elts
[pc
+ 2].msymbol
);
3776 return evaluate_subexp_type (exp
, pos
);
3779 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3780 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3782 /* The term "match" here is rather loose. The match is heuristic and
3786 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3788 ftype
= ada_check_typedef (ftype
);
3789 atype
= ada_check_typedef (atype
);
3791 if (ftype
->code () == TYPE_CODE_REF
)
3792 ftype
= TYPE_TARGET_TYPE (ftype
);
3793 if (atype
->code () == TYPE_CODE_REF
)
3794 atype
= TYPE_TARGET_TYPE (atype
);
3796 switch (ftype
->code ())
3799 return ftype
->code () == atype
->code ();
3801 if (atype
->code () == TYPE_CODE_PTR
)
3802 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3803 TYPE_TARGET_TYPE (atype
), 0);
3806 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3808 case TYPE_CODE_ENUM
:
3809 case TYPE_CODE_RANGE
:
3810 switch (atype
->code ())
3813 case TYPE_CODE_ENUM
:
3814 case TYPE_CODE_RANGE
:
3820 case TYPE_CODE_ARRAY
:
3821 return (atype
->code () == TYPE_CODE_ARRAY
3822 || ada_is_array_descriptor_type (atype
));
3824 case TYPE_CODE_STRUCT
:
3825 if (ada_is_array_descriptor_type (ftype
))
3826 return (atype
->code () == TYPE_CODE_ARRAY
3827 || ada_is_array_descriptor_type (atype
));
3829 return (atype
->code () == TYPE_CODE_STRUCT
3830 && !ada_is_array_descriptor_type (atype
));
3832 case TYPE_CODE_UNION
:
3834 return (atype
->code () == ftype
->code ());
3838 /* Return non-zero if the formals of FUNC "sufficiently match" the
3839 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3840 may also be an enumeral, in which case it is treated as a 0-
3841 argument function. */
3844 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3847 struct type
*func_type
= SYMBOL_TYPE (func
);
3849 if (SYMBOL_CLASS (func
) == LOC_CONST
3850 && func_type
->code () == TYPE_CODE_ENUM
)
3851 return (n_actuals
== 0);
3852 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3855 if (func_type
->num_fields () != n_actuals
)
3858 for (i
= 0; i
< n_actuals
; i
+= 1)
3860 if (actuals
[i
] == NULL
)
3864 struct type
*ftype
= ada_check_typedef (func_type
->field (i
).type ());
3865 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3867 if (!ada_type_match (ftype
, atype
, 1))
3874 /* False iff function type FUNC_TYPE definitely does not produce a value
3875 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3876 FUNC_TYPE is not a valid function type with a non-null return type
3877 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3880 return_match (struct type
*func_type
, struct type
*context_type
)
3882 struct type
*return_type
;
3884 if (func_type
== NULL
)
3887 if (func_type
->code () == TYPE_CODE_FUNC
)
3888 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3890 return_type
= get_base_type (func_type
);
3891 if (return_type
== NULL
)
3894 context_type
= get_base_type (context_type
);
3896 if (return_type
->code () == TYPE_CODE_ENUM
)
3897 return context_type
== NULL
|| return_type
== context_type
;
3898 else if (context_type
== NULL
)
3899 return return_type
->code () != TYPE_CODE_VOID
;
3901 return return_type
->code () == context_type
->code ();
3905 /* Returns the index in SYMS that contains the symbol for the
3906 function (if any) that matches the types of the NARGS arguments in
3907 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3908 that returns that type, then eliminate matches that don't. If
3909 CONTEXT_TYPE is void and there is at least one match that does not
3910 return void, eliminate all matches that do.
3912 Asks the user if there is more than one match remaining. Returns -1
3913 if there is no such symbol or none is selected. NAME is used
3914 solely for messages. May re-arrange and modify SYMS in
3915 the process; the index returned is for the modified vector. */
3918 ada_resolve_function (std::vector
<struct block_symbol
> &syms
,
3919 struct value
**args
, int nargs
,
3920 const char *name
, struct type
*context_type
,
3921 int parse_completion
)
3925 int m
; /* Number of hits */
3928 /* In the first pass of the loop, we only accept functions matching
3929 context_type. If none are found, we add a second pass of the loop
3930 where every function is accepted. */
3931 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3933 for (k
= 0; k
< syms
.size (); k
+= 1)
3935 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3937 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3938 && (fallback
|| return_match (type
, context_type
)))
3946 /* If we got multiple matches, ask the user which one to use. Don't do this
3947 interactive thing during completion, though, as the purpose of the
3948 completion is providing a list of all possible matches. Prompting the
3949 user to filter it down would be completely unexpected in this case. */
3952 else if (m
> 1 && !parse_completion
)
3954 printf_filtered (_("Multiple matches for %s\n"), name
);
3955 user_select_syms (syms
.data (), m
, 1);
3961 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3962 on the function identified by SYM and BLOCK, and taking NARGS
3963 arguments. Update *EXPP as needed to hold more space. */
3966 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
3967 int oplen
, struct symbol
*sym
,
3968 const struct block
*block
)
3970 /* We want to add 6 more elements (3 for funcall, 4 for function
3971 symbol, -OPLEN for operator being replaced) to the
3973 struct expression
*exp
= expp
->get ();
3974 int save_nelts
= exp
->nelts
;
3975 int extra_elts
= 7 - oplen
;
3976 exp
->nelts
+= extra_elts
;
3979 exp
->resize (exp
->nelts
);
3980 memmove (exp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3981 EXP_ELEM_TO_BYTES (save_nelts
- pc
- oplen
));
3983 exp
->resize (exp
->nelts
);
3985 exp
->elts
[pc
].opcode
= exp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3986 exp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3988 exp
->elts
[pc
+ 3].opcode
= exp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3989 exp
->elts
[pc
+ 4].block
= block
;
3990 exp
->elts
[pc
+ 5].symbol
= sym
;
3993 /* Type-class predicates */
3995 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3999 numeric_type_p (struct type
*type
)
4005 switch (type
->code ())
4010 case TYPE_CODE_RANGE
:
4011 return (type
== TYPE_TARGET_TYPE (type
)
4012 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4019 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4022 integer_type_p (struct type
*type
)
4028 switch (type
->code ())
4032 case TYPE_CODE_RANGE
:
4033 return (type
== TYPE_TARGET_TYPE (type
)
4034 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4041 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4044 scalar_type_p (struct type
*type
)
4050 switch (type
->code ())
4053 case TYPE_CODE_RANGE
:
4054 case TYPE_CODE_ENUM
:
4063 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4066 discrete_type_p (struct type
*type
)
4072 switch (type
->code ())
4075 case TYPE_CODE_RANGE
:
4076 case TYPE_CODE_ENUM
:
4077 case TYPE_CODE_BOOL
:
4085 /* Returns non-zero if OP with operands in the vector ARGS could be
4086 a user-defined function. Errs on the side of pre-defined operators
4087 (i.e., result 0). */
4090 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4092 struct type
*type0
=
4093 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4094 struct type
*type1
=
4095 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4109 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4113 case BINOP_BITWISE_AND
:
4114 case BINOP_BITWISE_IOR
:
4115 case BINOP_BITWISE_XOR
:
4116 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4119 case BINOP_NOTEQUAL
:
4124 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4127 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4130 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4134 case UNOP_LOGICAL_NOT
:
4136 return (!numeric_type_p (type0
));
4145 1. In the following, we assume that a renaming type's name may
4146 have an ___XD suffix. It would be nice if this went away at some
4148 2. We handle both the (old) purely type-based representation of
4149 renamings and the (new) variable-based encoding. At some point,
4150 it is devoutly to be hoped that the former goes away
4151 (FIXME: hilfinger-2007-07-09).
4152 3. Subprogram renamings are not implemented, although the XRS
4153 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4155 /* If SYM encodes a renaming,
4157 <renaming> renames <renamed entity>,
4159 sets *LEN to the length of the renamed entity's name,
4160 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4161 the string describing the subcomponent selected from the renamed
4162 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4163 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4164 are undefined). Otherwise, returns a value indicating the category
4165 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4166 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4167 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4168 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4169 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4170 may be NULL, in which case they are not assigned.
4172 [Currently, however, GCC does not generate subprogram renamings.] */
4174 enum ada_renaming_category
4175 ada_parse_renaming (struct symbol
*sym
,
4176 const char **renamed_entity
, int *len
,
4177 const char **renaming_expr
)
4179 enum ada_renaming_category kind
;
4184 return ADA_NOT_RENAMING
;
4185 switch (SYMBOL_CLASS (sym
))
4188 return ADA_NOT_RENAMING
;
4192 case LOC_OPTIMIZED_OUT
:
4193 info
= strstr (sym
->linkage_name (), "___XR");
4195 return ADA_NOT_RENAMING
;
4199 kind
= ADA_OBJECT_RENAMING
;
4203 kind
= ADA_EXCEPTION_RENAMING
;
4207 kind
= ADA_PACKAGE_RENAMING
;
4211 kind
= ADA_SUBPROGRAM_RENAMING
;
4215 return ADA_NOT_RENAMING
;
4219 if (renamed_entity
!= NULL
)
4220 *renamed_entity
= info
;
4221 suffix
= strstr (info
, "___XE");
4222 if (suffix
== NULL
|| suffix
== info
)
4223 return ADA_NOT_RENAMING
;
4225 *len
= strlen (info
) - strlen (suffix
);
4227 if (renaming_expr
!= NULL
)
4228 *renaming_expr
= suffix
;
4232 /* Compute the value of the given RENAMING_SYM, which is expected to
4233 be a symbol encoding a renaming expression. BLOCK is the block
4234 used to evaluate the renaming. */
4236 static struct value
*
4237 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4238 const struct block
*block
)
4240 const char *sym_name
;
4242 sym_name
= renaming_sym
->linkage_name ();
4243 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4244 return evaluate_expression (expr
.get ());
4248 /* Evaluation: Function Calls */
4250 /* Return an lvalue containing the value VAL. This is the identity on
4251 lvalues, and otherwise has the side-effect of allocating memory
4252 in the inferior where a copy of the value contents is copied. */
4254 static struct value
*
4255 ensure_lval (struct value
*val
)
4257 if (VALUE_LVAL (val
) == not_lval
4258 || VALUE_LVAL (val
) == lval_internalvar
)
4260 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4261 const CORE_ADDR addr
=
4262 value_as_long (value_allocate_space_in_inferior (len
));
4264 VALUE_LVAL (val
) = lval_memory
;
4265 set_value_address (val
, addr
);
4266 write_memory (addr
, value_contents (val
), len
);
4272 /* Given ARG, a value of type (pointer or reference to a)*
4273 structure/union, extract the component named NAME from the ultimate
4274 target structure/union and return it as a value with its
4277 The routine searches for NAME among all members of the structure itself
4278 and (recursively) among all members of any wrapper members
4281 If NO_ERR, then simply return NULL in case of error, rather than
4284 static struct value
*
4285 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4287 struct type
*t
, *t1
;
4292 t1
= t
= ada_check_typedef (value_type (arg
));
4293 if (t
->code () == TYPE_CODE_REF
)
4295 t1
= TYPE_TARGET_TYPE (t
);
4298 t1
= ada_check_typedef (t1
);
4299 if (t1
->code () == TYPE_CODE_PTR
)
4301 arg
= coerce_ref (arg
);
4306 while (t
->code () == TYPE_CODE_PTR
)
4308 t1
= TYPE_TARGET_TYPE (t
);
4311 t1
= ada_check_typedef (t1
);
4312 if (t1
->code () == TYPE_CODE_PTR
)
4314 arg
= value_ind (arg
);
4321 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4325 v
= ada_search_struct_field (name
, arg
, 0, t
);
4328 int bit_offset
, bit_size
, byte_offset
;
4329 struct type
*field_type
;
4332 if (t
->code () == TYPE_CODE_PTR
)
4333 address
= value_address (ada_value_ind (arg
));
4335 address
= value_address (ada_coerce_ref (arg
));
4337 /* Check to see if this is a tagged type. We also need to handle
4338 the case where the type is a reference to a tagged type, but
4339 we have to be careful to exclude pointers to tagged types.
4340 The latter should be shown as usual (as a pointer), whereas
4341 a reference should mostly be transparent to the user. */
4343 if (ada_is_tagged_type (t1
, 0)
4344 || (t1
->code () == TYPE_CODE_REF
4345 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4347 /* We first try to find the searched field in the current type.
4348 If not found then let's look in the fixed type. */
4350 if (!find_struct_field (name
, t1
, 0,
4351 &field_type
, &byte_offset
, &bit_offset
,
4360 /* Convert to fixed type in all cases, so that we have proper
4361 offsets to each field in unconstrained record types. */
4362 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4363 address
, NULL
, check_tag
);
4365 /* Resolve the dynamic type as well. */
4366 arg
= value_from_contents_and_address (t1
, nullptr, address
);
4367 t1
= value_type (arg
);
4369 if (find_struct_field (name
, t1
, 0,
4370 &field_type
, &byte_offset
, &bit_offset
,
4375 if (t
->code () == TYPE_CODE_REF
)
4376 arg
= ada_coerce_ref (arg
);
4378 arg
= ada_value_ind (arg
);
4379 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4380 bit_offset
, bit_size
,
4384 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4388 if (v
!= NULL
|| no_err
)
4391 error (_("There is no member named %s."), name
);
4397 error (_("Attempt to extract a component of "
4398 "a value that is not a record."));
4401 /* Return the value ACTUAL, converted to be an appropriate value for a
4402 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4403 allocating any necessary descriptors (fat pointers), or copies of
4404 values not residing in memory, updating it as needed. */
4407 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4409 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4410 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4411 struct type
*formal_target
=
4412 formal_type
->code () == TYPE_CODE_PTR
4413 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4414 struct type
*actual_target
=
4415 actual_type
->code () == TYPE_CODE_PTR
4416 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4418 if (ada_is_array_descriptor_type (formal_target
)
4419 && actual_target
->code () == TYPE_CODE_ARRAY
)
4420 return make_array_descriptor (formal_type
, actual
);
4421 else if (formal_type
->code () == TYPE_CODE_PTR
4422 || formal_type
->code () == TYPE_CODE_REF
)
4424 struct value
*result
;
4426 if (formal_target
->code () == TYPE_CODE_ARRAY
4427 && ada_is_array_descriptor_type (actual_target
))
4428 result
= desc_data (actual
);
4429 else if (formal_type
->code () != TYPE_CODE_PTR
)
4431 if (VALUE_LVAL (actual
) != lval_memory
)
4435 actual_type
= ada_check_typedef (value_type (actual
));
4436 val
= allocate_value (actual_type
);
4437 memcpy ((char *) value_contents_raw (val
),
4438 (char *) value_contents (actual
),
4439 TYPE_LENGTH (actual_type
));
4440 actual
= ensure_lval (val
);
4442 result
= value_addr (actual
);
4446 return value_cast_pointers (formal_type
, result
, 0);
4448 else if (actual_type
->code () == TYPE_CODE_PTR
)
4449 return ada_value_ind (actual
);
4450 else if (ada_is_aligner_type (formal_type
))
4452 /* We need to turn this parameter into an aligner type
4454 struct value
*aligner
= allocate_value (formal_type
);
4455 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4457 value_assign_to_component (aligner
, component
, actual
);
4464 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4465 type TYPE. This is usually an inefficient no-op except on some targets
4466 (such as AVR) where the representation of a pointer and an address
4470 value_pointer (struct value
*value
, struct type
*type
)
4472 unsigned len
= TYPE_LENGTH (type
);
4473 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4476 addr
= value_address (value
);
4477 gdbarch_address_to_pointer (type
->arch (), type
, buf
, addr
);
4478 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4483 /* Push a descriptor of type TYPE for array value ARR on the stack at
4484 *SP, updating *SP to reflect the new descriptor. Return either
4485 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4486 to-descriptor type rather than a descriptor type), a struct value *
4487 representing a pointer to this descriptor. */
4489 static struct value
*
4490 make_array_descriptor (struct type
*type
, struct value
*arr
)
4492 struct type
*bounds_type
= desc_bounds_type (type
);
4493 struct type
*desc_type
= desc_base_type (type
);
4494 struct value
*descriptor
= allocate_value (desc_type
);
4495 struct value
*bounds
= allocate_value (bounds_type
);
4498 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4501 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4502 ada_array_bound (arr
, i
, 0),
4503 desc_bound_bitpos (bounds_type
, i
, 0),
4504 desc_bound_bitsize (bounds_type
, i
, 0));
4505 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4506 ada_array_bound (arr
, i
, 1),
4507 desc_bound_bitpos (bounds_type
, i
, 1),
4508 desc_bound_bitsize (bounds_type
, i
, 1));
4511 bounds
= ensure_lval (bounds
);
4513 modify_field (value_type (descriptor
),
4514 value_contents_writeable (descriptor
),
4515 value_pointer (ensure_lval (arr
),
4516 desc_type
->field (0).type ()),
4517 fat_pntr_data_bitpos (desc_type
),
4518 fat_pntr_data_bitsize (desc_type
));
4520 modify_field (value_type (descriptor
),
4521 value_contents_writeable (descriptor
),
4522 value_pointer (bounds
,
4523 desc_type
->field (1).type ()),
4524 fat_pntr_bounds_bitpos (desc_type
),
4525 fat_pntr_bounds_bitsize (desc_type
));
4527 descriptor
= ensure_lval (descriptor
);
4529 if (type
->code () == TYPE_CODE_PTR
)
4530 return value_addr (descriptor
);
4535 /* Symbol Cache Module */
4537 /* Performance measurements made as of 2010-01-15 indicate that
4538 this cache does bring some noticeable improvements. Depending
4539 on the type of entity being printed, the cache can make it as much
4540 as an order of magnitude faster than without it.
4542 The descriptive type DWARF extension has significantly reduced
4543 the need for this cache, at least when DWARF is being used. However,
4544 even in this case, some expensive name-based symbol searches are still
4545 sometimes necessary - to find an XVZ variable, mostly. */
4547 /* Return the symbol cache associated to the given program space PSPACE.
4548 If not allocated for this PSPACE yet, allocate and initialize one. */
4550 static struct ada_symbol_cache
*
4551 ada_get_symbol_cache (struct program_space
*pspace
)
4553 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4555 if (pspace_data
->sym_cache
== nullptr)
4556 pspace_data
->sym_cache
.reset (new ada_symbol_cache
);
4558 return pspace_data
->sym_cache
.get ();
4561 /* Clear all entries from the symbol cache. */
4564 ada_clear_symbol_cache ()
4566 struct ada_pspace_data
*pspace_data
4567 = get_ada_pspace_data (current_program_space
);
4569 if (pspace_data
->sym_cache
!= nullptr)
4570 pspace_data
->sym_cache
.reset ();
4573 /* Search our cache for an entry matching NAME and DOMAIN.
4574 Return it if found, or NULL otherwise. */
4576 static struct cache_entry
**
4577 find_entry (const char *name
, domain_enum domain
)
4579 struct ada_symbol_cache
*sym_cache
4580 = ada_get_symbol_cache (current_program_space
);
4581 int h
= msymbol_hash (name
) % HASH_SIZE
;
4582 struct cache_entry
**e
;
4584 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4586 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4592 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4593 Return 1 if found, 0 otherwise.
4595 If an entry was found and SYM is not NULL, set *SYM to the entry's
4596 SYM. Same principle for BLOCK if not NULL. */
4599 lookup_cached_symbol (const char *name
, domain_enum domain
,
4600 struct symbol
**sym
, const struct block
**block
)
4602 struct cache_entry
**e
= find_entry (name
, domain
);
4609 *block
= (*e
)->block
;
4613 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4614 in domain DOMAIN, save this result in our symbol cache. */
4617 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4618 const struct block
*block
)
4620 struct ada_symbol_cache
*sym_cache
4621 = ada_get_symbol_cache (current_program_space
);
4623 struct cache_entry
*e
;
4625 /* Symbols for builtin types don't have a block.
4626 For now don't cache such symbols. */
4627 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4630 /* If the symbol is a local symbol, then do not cache it, as a search
4631 for that symbol depends on the context. To determine whether
4632 the symbol is local or not, we check the block where we found it
4633 against the global and static blocks of its associated symtab. */
4635 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4636 GLOBAL_BLOCK
) != block
4637 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4638 STATIC_BLOCK
) != block
)
4641 h
= msymbol_hash (name
) % HASH_SIZE
;
4642 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4643 e
->next
= sym_cache
->root
[h
];
4644 sym_cache
->root
[h
] = e
;
4645 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4653 /* Return the symbol name match type that should be used used when
4654 searching for all symbols matching LOOKUP_NAME.
4656 LOOKUP_NAME is expected to be a symbol name after transformation
4659 static symbol_name_match_type
4660 name_match_type_from_name (const char *lookup_name
)
4662 return (strstr (lookup_name
, "__") == NULL
4663 ? symbol_name_match_type::WILD
4664 : symbol_name_match_type::FULL
);
4667 /* Return the result of a standard (literal, C-like) lookup of NAME in
4668 given DOMAIN, visible from lexical block BLOCK. */
4670 static struct symbol
*
4671 standard_lookup (const char *name
, const struct block
*block
,
4674 /* Initialize it just to avoid a GCC false warning. */
4675 struct block_symbol sym
= {};
4677 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4679 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4680 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4685 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4686 in the symbol fields of SYMS. We treat enumerals as functions,
4687 since they contend in overloading in the same way. */
4689 is_nonfunction (const std::vector
<struct block_symbol
> &syms
)
4691 for (const block_symbol
&sym
: syms
)
4692 if (SYMBOL_TYPE (sym
.symbol
)->code () != TYPE_CODE_FUNC
4693 && (SYMBOL_TYPE (sym
.symbol
)->code () != TYPE_CODE_ENUM
4694 || SYMBOL_CLASS (sym
.symbol
) != LOC_CONST
))
4700 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4701 struct types. Otherwise, they may not. */
4704 equiv_types (struct type
*type0
, struct type
*type1
)
4708 if (type0
== NULL
|| type1
== NULL
4709 || type0
->code () != type1
->code ())
4711 if ((type0
->code () == TYPE_CODE_STRUCT
4712 || type0
->code () == TYPE_CODE_ENUM
)
4713 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4714 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4720 /* True iff SYM0 represents the same entity as SYM1, or one that is
4721 no more defined than that of SYM1. */
4724 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4728 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4729 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4732 switch (SYMBOL_CLASS (sym0
))
4738 struct type
*type0
= SYMBOL_TYPE (sym0
);
4739 struct type
*type1
= SYMBOL_TYPE (sym1
);
4740 const char *name0
= sym0
->linkage_name ();
4741 const char *name1
= sym1
->linkage_name ();
4742 int len0
= strlen (name0
);
4745 type0
->code () == type1
->code ()
4746 && (equiv_types (type0
, type1
)
4747 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4748 && startswith (name1
+ len0
, "___XV")));
4751 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4752 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4756 const char *name0
= sym0
->linkage_name ();
4757 const char *name1
= sym1
->linkage_name ();
4758 return (strcmp (name0
, name1
) == 0
4759 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4767 /* Append (SYM,BLOCK) to the end of the array of struct block_symbol
4768 records in RESULT. Do nothing if SYM is a duplicate. */
4771 add_defn_to_vec (std::vector
<struct block_symbol
> &result
,
4773 const struct block
*block
)
4775 /* Do not try to complete stub types, as the debugger is probably
4776 already scanning all symbols matching a certain name at the
4777 time when this function is called. Trying to replace the stub
4778 type by its associated full type will cause us to restart a scan
4779 which may lead to an infinite recursion. Instead, the client
4780 collecting the matching symbols will end up collecting several
4781 matches, with at least one of them complete. It can then filter
4782 out the stub ones if needed. */
4784 for (int i
= result
.size () - 1; i
>= 0; i
-= 1)
4786 if (lesseq_defined_than (sym
, result
[i
].symbol
))
4788 else if (lesseq_defined_than (result
[i
].symbol
, sym
))
4790 result
[i
].symbol
= sym
;
4791 result
[i
].block
= block
;
4796 struct block_symbol info
;
4799 result
.push_back (info
);
4802 /* Return a bound minimal symbol matching NAME according to Ada
4803 decoding rules. Returns an invalid symbol if there is no such
4804 minimal symbol. Names prefixed with "standard__" are handled
4805 specially: "standard__" is first stripped off, and only static and
4806 global symbols are searched. */
4808 struct bound_minimal_symbol
4809 ada_lookup_simple_minsym (const char *name
)
4811 struct bound_minimal_symbol result
;
4813 memset (&result
, 0, sizeof (result
));
4815 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4816 lookup_name_info
lookup_name (name
, match_type
);
4818 symbol_name_matcher_ftype
*match_name
4819 = ada_get_symbol_name_matcher (lookup_name
);
4821 for (objfile
*objfile
: current_program_space
->objfiles ())
4823 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4825 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4826 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4828 result
.minsym
= msymbol
;
4829 result
.objfile
= objfile
;
4838 /* For all subprograms that statically enclose the subprogram of the
4839 selected frame, add symbols matching identifier NAME in DOMAIN
4840 and their blocks to the list of data in RESULT, as for
4841 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4842 with a wildcard prefix. */
4845 add_symbols_from_enclosing_procs (std::vector
<struct block_symbol
> &result
,
4846 const lookup_name_info
&lookup_name
,
4851 /* True if TYPE is definitely an artificial type supplied to a symbol
4852 for which no debugging information was given in the symbol file. */
4855 is_nondebugging_type (struct type
*type
)
4857 const char *name
= ada_type_name (type
);
4859 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4862 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4863 that are deemed "identical" for practical purposes.
4865 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4866 types and that their number of enumerals is identical (in other
4867 words, type1->num_fields () == type2->num_fields ()). */
4870 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4874 /* The heuristic we use here is fairly conservative. We consider
4875 that 2 enumerate types are identical if they have the same
4876 number of enumerals and that all enumerals have the same
4877 underlying value and name. */
4879 /* All enums in the type should have an identical underlying value. */
4880 for (i
= 0; i
< type1
->num_fields (); i
++)
4881 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4884 /* All enumerals should also have the same name (modulo any numerical
4886 for (i
= 0; i
< type1
->num_fields (); i
++)
4888 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4889 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4890 int len_1
= strlen (name_1
);
4891 int len_2
= strlen (name_2
);
4893 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4894 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4896 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4897 TYPE_FIELD_NAME (type2
, i
),
4905 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4906 that are deemed "identical" for practical purposes. Sometimes,
4907 enumerals are not strictly identical, but their types are so similar
4908 that they can be considered identical.
4910 For instance, consider the following code:
4912 type Color is (Black, Red, Green, Blue, White);
4913 type RGB_Color is new Color range Red .. Blue;
4915 Type RGB_Color is a subrange of an implicit type which is a copy
4916 of type Color. If we call that implicit type RGB_ColorB ("B" is
4917 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4918 As a result, when an expression references any of the enumeral
4919 by name (Eg. "print green"), the expression is technically
4920 ambiguous and the user should be asked to disambiguate. But
4921 doing so would only hinder the user, since it wouldn't matter
4922 what choice he makes, the outcome would always be the same.
4923 So, for practical purposes, we consider them as the same. */
4926 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
4930 /* Before performing a thorough comparison check of each type,
4931 we perform a series of inexpensive checks. We expect that these
4932 checks will quickly fail in the vast majority of cases, and thus
4933 help prevent the unnecessary use of a more expensive comparison.
4934 Said comparison also expects us to make some of these checks
4935 (see ada_identical_enum_types_p). */
4937 /* Quick check: All symbols should have an enum type. */
4938 for (i
= 0; i
< syms
.size (); i
++)
4939 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
4942 /* Quick check: They should all have the same value. */
4943 for (i
= 1; i
< syms
.size (); i
++)
4944 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
4947 /* Quick check: They should all have the same number of enumerals. */
4948 for (i
= 1; i
< syms
.size (); i
++)
4949 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
4950 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
4953 /* All the sanity checks passed, so we might have a set of
4954 identical enumeration types. Perform a more complete
4955 comparison of the type of each symbol. */
4956 for (i
= 1; i
< syms
.size (); i
++)
4957 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
4958 SYMBOL_TYPE (syms
[0].symbol
)))
4964 /* Remove any non-debugging symbols in SYMS that definitely
4965 duplicate other symbols in the list (The only case I know of where
4966 this happens is when object files containing stabs-in-ecoff are
4967 linked with files containing ordinary ecoff debugging symbols (or no
4968 debugging symbols)). Modifies SYMS to squeeze out deleted entries. */
4971 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
4975 /* We should never be called with less than 2 symbols, as there
4976 cannot be any extra symbol in that case. But it's easy to
4977 handle, since we have nothing to do in that case. */
4978 if (syms
->size () < 2)
4982 while (i
< syms
->size ())
4986 /* If two symbols have the same name and one of them is a stub type,
4987 the get rid of the stub. */
4989 if (SYMBOL_TYPE ((*syms
)[i
].symbol
)->is_stub ()
4990 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
4992 for (j
= 0; j
< syms
->size (); j
++)
4995 && !SYMBOL_TYPE ((*syms
)[j
].symbol
)->is_stub ()
4996 && (*syms
)[j
].symbol
->linkage_name () != NULL
4997 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
4998 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5003 /* Two symbols with the same name, same class and same address
5004 should be identical. */
5006 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5007 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5008 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5010 for (j
= 0; j
< syms
->size (); j
+= 1)
5013 && (*syms
)[j
].symbol
->linkage_name () != NULL
5014 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5015 (*syms
)[j
].symbol
->linkage_name ()) == 0
5016 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5017 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5018 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5019 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5025 syms
->erase (syms
->begin () + i
);
5030 /* If all the remaining symbols are identical enumerals, then
5031 just keep the first one and discard the rest.
5033 Unlike what we did previously, we do not discard any entry
5034 unless they are ALL identical. This is because the symbol
5035 comparison is not a strict comparison, but rather a practical
5036 comparison. If all symbols are considered identical, then
5037 we can just go ahead and use the first one and discard the rest.
5038 But if we cannot reduce the list to a single element, we have
5039 to ask the user to disambiguate anyways. And if we have to
5040 present a multiple-choice menu, it's less confusing if the list
5041 isn't missing some choices that were identical and yet distinct. */
5042 if (symbols_are_identical_enums (*syms
))
5046 /* Given a type that corresponds to a renaming entity, use the type name
5047 to extract the scope (package name or function name, fully qualified,
5048 and following the GNAT encoding convention) where this renaming has been
5052 xget_renaming_scope (struct type
*renaming_type
)
5054 /* The renaming types adhere to the following convention:
5055 <scope>__<rename>___<XR extension>.
5056 So, to extract the scope, we search for the "___XR" extension,
5057 and then backtrack until we find the first "__". */
5059 const char *name
= renaming_type
->name ();
5060 const char *suffix
= strstr (name
, "___XR");
5063 /* Now, backtrack a bit until we find the first "__". Start looking
5064 at suffix - 3, as the <rename> part is at least one character long. */
5066 for (last
= suffix
- 3; last
> name
; last
--)
5067 if (last
[0] == '_' && last
[1] == '_')
5070 /* Make a copy of scope and return it. */
5071 return std::string (name
, last
);
5074 /* Return nonzero if NAME corresponds to a package name. */
5077 is_package_name (const char *name
)
5079 /* Here, We take advantage of the fact that no symbols are generated
5080 for packages, while symbols are generated for each function.
5081 So the condition for NAME represent a package becomes equivalent
5082 to NAME not existing in our list of symbols. There is only one
5083 small complication with library-level functions (see below). */
5085 /* If it is a function that has not been defined at library level,
5086 then we should be able to look it up in the symbols. */
5087 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5090 /* Library-level function names start with "_ada_". See if function
5091 "_ada_" followed by NAME can be found. */
5093 /* Do a quick check that NAME does not contain "__", since library-level
5094 functions names cannot contain "__" in them. */
5095 if (strstr (name
, "__") != NULL
)
5098 std::string fun_name
= string_printf ("_ada_%s", name
);
5100 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5103 /* Return nonzero if SYM corresponds to a renaming entity that is
5104 not visible from FUNCTION_NAME. */
5107 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5109 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5112 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5114 /* If the rename has been defined in a package, then it is visible. */
5115 if (is_package_name (scope
.c_str ()))
5118 /* Check that the rename is in the current function scope by checking
5119 that its name starts with SCOPE. */
5121 /* If the function name starts with "_ada_", it means that it is
5122 a library-level function. Strip this prefix before doing the
5123 comparison, as the encoding for the renaming does not contain
5125 if (startswith (function_name
, "_ada_"))
5128 return !startswith (function_name
, scope
.c_str ());
5131 /* Remove entries from SYMS that corresponds to a renaming entity that
5132 is not visible from the function associated with CURRENT_BLOCK or
5133 that is superfluous due to the presence of more specific renaming
5134 information. Places surviving symbols in the initial entries of
5138 First, in cases where an object renaming is implemented as a
5139 reference variable, GNAT may produce both the actual reference
5140 variable and the renaming encoding. In this case, we discard the
5143 Second, GNAT emits a type following a specified encoding for each renaming
5144 entity. Unfortunately, STABS currently does not support the definition
5145 of types that are local to a given lexical block, so all renamings types
5146 are emitted at library level. As a consequence, if an application
5147 contains two renaming entities using the same name, and a user tries to
5148 print the value of one of these entities, the result of the ada symbol
5149 lookup will also contain the wrong renaming type.
5151 This function partially covers for this limitation by attempting to
5152 remove from the SYMS list renaming symbols that should be visible
5153 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5154 method with the current information available. The implementation
5155 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5157 - When the user tries to print a rename in a function while there
5158 is another rename entity defined in a package: Normally, the
5159 rename in the function has precedence over the rename in the
5160 package, so the latter should be removed from the list. This is
5161 currently not the case.
5163 - This function will incorrectly remove valid renames if
5164 the CURRENT_BLOCK corresponds to a function which symbol name
5165 has been changed by an "Export" pragma. As a consequence,
5166 the user will be unable to print such rename entities. */
5169 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5170 const struct block
*current_block
)
5172 struct symbol
*current_function
;
5173 const char *current_function_name
;
5175 int is_new_style_renaming
;
5177 /* If there is both a renaming foo___XR... encoded as a variable and
5178 a simple variable foo in the same block, discard the latter.
5179 First, zero out such symbols, then compress. */
5180 is_new_style_renaming
= 0;
5181 for (i
= 0; i
< syms
->size (); i
+= 1)
5183 struct symbol
*sym
= (*syms
)[i
].symbol
;
5184 const struct block
*block
= (*syms
)[i
].block
;
5188 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5190 name
= sym
->linkage_name ();
5191 suffix
= strstr (name
, "___XR");
5195 int name_len
= suffix
- name
;
5198 is_new_style_renaming
= 1;
5199 for (j
= 0; j
< syms
->size (); j
+= 1)
5200 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5201 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5203 && block
== (*syms
)[j
].block
)
5204 (*syms
)[j
].symbol
= NULL
;
5207 if (is_new_style_renaming
)
5211 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5212 if ((*syms
)[j
].symbol
!= NULL
)
5214 (*syms
)[k
] = (*syms
)[j
];
5221 /* Extract the function name associated to CURRENT_BLOCK.
5222 Abort if unable to do so. */
5224 if (current_block
== NULL
)
5227 current_function
= block_linkage_function (current_block
);
5228 if (current_function
== NULL
)
5231 current_function_name
= current_function
->linkage_name ();
5232 if (current_function_name
== NULL
)
5235 /* Check each of the symbols, and remove it from the list if it is
5236 a type corresponding to a renaming that is out of the scope of
5237 the current block. */
5240 while (i
< syms
->size ())
5242 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5243 == ADA_OBJECT_RENAMING
5244 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5245 current_function_name
))
5246 syms
->erase (syms
->begin () + i
);
5252 /* Add to RESULT all symbols from BLOCK (and its super-blocks)
5253 whose name and domain match NAME and DOMAIN respectively.
5254 If no match was found, then extend the search to "enclosing"
5255 routines (in other words, if we're inside a nested function,
5256 search the symbols defined inside the enclosing functions).
5257 If WILD_MATCH_P is nonzero, perform the naming matching in
5258 "wild" mode (see function "wild_match" for more info).
5260 Note: This function assumes that RESULT has 0 (zero) element in it. */
5263 ada_add_local_symbols (std::vector
<struct block_symbol
> &result
,
5264 const lookup_name_info
&lookup_name
,
5265 const struct block
*block
, domain_enum domain
)
5267 int block_depth
= 0;
5269 while (block
!= NULL
)
5272 ada_add_block_symbols (result
, block
, lookup_name
, domain
, NULL
);
5274 /* If we found a non-function match, assume that's the one. */
5275 if (is_nonfunction (result
))
5278 block
= BLOCK_SUPERBLOCK (block
);
5281 /* If no luck so far, try to find NAME as a local symbol in some lexically
5282 enclosing subprogram. */
5283 if (result
.empty () && block_depth
> 2)
5284 add_symbols_from_enclosing_procs (result
, lookup_name
, domain
);
5287 /* An object of this type is used as the user_data argument when
5288 calling the map_matching_symbols method. */
5292 explicit match_data (std::vector
<struct block_symbol
> *rp
)
5296 DISABLE_COPY_AND_ASSIGN (match_data
);
5298 struct objfile
*objfile
= nullptr;
5299 std::vector
<struct block_symbol
> *resultp
;
5300 struct symbol
*arg_sym
= nullptr;
5301 bool found_sym
= false;
5304 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5305 to a list of symbols. DATA is a pointer to a struct match_data *
5306 containing the vector that collects the symbol list, the file that SYM
5307 must come from, a flag indicating whether a non-argument symbol has
5308 been found in the current block, and the last argument symbol
5309 passed in SYM within the current block (if any). When SYM is null,
5310 marking the end of a block, the argument symbol is added if no
5311 other has been found. */
5314 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5315 struct match_data
*data
)
5317 const struct block
*block
= bsym
->block
;
5318 struct symbol
*sym
= bsym
->symbol
;
5322 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5323 add_defn_to_vec (*data
->resultp
,
5324 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5326 data
->found_sym
= false;
5327 data
->arg_sym
= NULL
;
5331 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5333 else if (SYMBOL_IS_ARGUMENT (sym
))
5334 data
->arg_sym
= sym
;
5337 data
->found_sym
= true;
5338 add_defn_to_vec (*data
->resultp
,
5339 fixup_symbol_section (sym
, data
->objfile
),
5346 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5347 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5348 symbols to RESULT. Return whether we found such symbols. */
5351 ada_add_block_renamings (std::vector
<struct block_symbol
> &result
,
5352 const struct block
*block
,
5353 const lookup_name_info
&lookup_name
,
5356 struct using_direct
*renaming
;
5357 int defns_mark
= result
.size ();
5359 symbol_name_matcher_ftype
*name_match
5360 = ada_get_symbol_name_matcher (lookup_name
);
5362 for (renaming
= block_using (block
);
5364 renaming
= renaming
->next
)
5368 /* Avoid infinite recursions: skip this renaming if we are actually
5369 already traversing it.
5371 Currently, symbol lookup in Ada don't use the namespace machinery from
5372 C++/Fortran support: skip namespace imports that use them. */
5373 if (renaming
->searched
5374 || (renaming
->import_src
!= NULL
5375 && renaming
->import_src
[0] != '\0')
5376 || (renaming
->import_dest
!= NULL
5377 && renaming
->import_dest
[0] != '\0'))
5379 renaming
->searched
= 1;
5381 /* TODO: here, we perform another name-based symbol lookup, which can
5382 pull its own multiple overloads. In theory, we should be able to do
5383 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5384 not a simple name. But in order to do this, we would need to enhance
5385 the DWARF reader to associate a symbol to this renaming, instead of a
5386 name. So, for now, we do something simpler: re-use the C++/Fortran
5387 namespace machinery. */
5388 r_name
= (renaming
->alias
!= NULL
5390 : renaming
->declaration
);
5391 if (name_match (r_name
, lookup_name
, NULL
))
5393 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5394 lookup_name
.match_type ());
5395 ada_add_all_symbols (result
, block
, decl_lookup_name
, domain
,
5398 renaming
->searched
= 0;
5400 return result
.size () != defns_mark
;
5403 /* Implements compare_names, but only applying the comparision using
5404 the given CASING. */
5407 compare_names_with_case (const char *string1
, const char *string2
,
5408 enum case_sensitivity casing
)
5410 while (*string1
!= '\0' && *string2
!= '\0')
5414 if (isspace (*string1
) || isspace (*string2
))
5415 return strcmp_iw_ordered (string1
, string2
);
5417 if (casing
== case_sensitive_off
)
5419 c1
= tolower (*string1
);
5420 c2
= tolower (*string2
);
5437 return strcmp_iw_ordered (string1
, string2
);
5439 if (*string2
== '\0')
5441 if (is_name_suffix (string1
))
5448 if (*string2
== '(')
5449 return strcmp_iw_ordered (string1
, string2
);
5452 if (casing
== case_sensitive_off
)
5453 return tolower (*string1
) - tolower (*string2
);
5455 return *string1
- *string2
;
5460 /* Compare STRING1 to STRING2, with results as for strcmp.
5461 Compatible with strcmp_iw_ordered in that...
5463 strcmp_iw_ordered (STRING1, STRING2) <= 0
5467 compare_names (STRING1, STRING2) <= 0
5469 (they may differ as to what symbols compare equal). */
5472 compare_names (const char *string1
, const char *string2
)
5476 /* Similar to what strcmp_iw_ordered does, we need to perform
5477 a case-insensitive comparison first, and only resort to
5478 a second, case-sensitive, comparison if the first one was
5479 not sufficient to differentiate the two strings. */
5481 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5483 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5488 /* Convenience function to get at the Ada encoded lookup name for
5489 LOOKUP_NAME, as a C string. */
5492 ada_lookup_name (const lookup_name_info
&lookup_name
)
5494 return lookup_name
.ada ().lookup_name ().c_str ();
5497 /* Add to RESULT all non-local symbols whose name and domain match
5498 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5499 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5500 symbols otherwise. */
5503 add_nonlocal_symbols (std::vector
<struct block_symbol
> &result
,
5504 const lookup_name_info
&lookup_name
,
5505 domain_enum domain
, int global
)
5507 struct match_data
data (&result
);
5509 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5511 auto callback
= [&] (struct block_symbol
*bsym
)
5513 return aux_add_nonlocal_symbols (bsym
, &data
);
5516 for (objfile
*objfile
: current_program_space
->objfiles ())
5518 data
.objfile
= objfile
;
5520 if (objfile
->sf
!= nullptr)
5521 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5522 domain
, global
, callback
,
5524 ? NULL
: compare_names
));
5526 for (compunit_symtab
*cu
: objfile
->compunits ())
5528 const struct block
*global_block
5529 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5531 if (ada_add_block_renamings (result
, global_block
, lookup_name
,
5533 data
.found_sym
= true;
5537 if (result
.empty () && global
&& !is_wild_match
)
5539 const char *name
= ada_lookup_name (lookup_name
);
5540 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5541 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5543 for (objfile
*objfile
: current_program_space
->objfiles ())
5545 data
.objfile
= objfile
;
5546 if (objfile
->sf
!= nullptr)
5547 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5548 domain
, global
, callback
,
5554 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5555 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5556 returning the number of matches. Add these to RESULT.
5558 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5559 symbol match within the nest of blocks whose innermost member is BLOCK,
5560 is the one match returned (no other matches in that or
5561 enclosing blocks is returned). If there are any matches in or
5562 surrounding BLOCK, then these alone are returned.
5564 Names prefixed with "standard__" are handled specially:
5565 "standard__" is first stripped off (by the lookup_name
5566 constructor), and only static and global symbols are searched.
5568 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5569 to lookup global symbols. */
5572 ada_add_all_symbols (std::vector
<struct block_symbol
> &result
,
5573 const struct block
*block
,
5574 const lookup_name_info
&lookup_name
,
5577 int *made_global_lookup_p
)
5581 if (made_global_lookup_p
)
5582 *made_global_lookup_p
= 0;
5584 /* Special case: If the user specifies a symbol name inside package
5585 Standard, do a non-wild matching of the symbol name without
5586 the "standard__" prefix. This was primarily introduced in order
5587 to allow the user to specifically access the standard exceptions
5588 using, for instance, Standard.Constraint_Error when Constraint_Error
5589 is ambiguous (due to the user defining its own Constraint_Error
5590 entity inside its program). */
5591 if (lookup_name
.ada ().standard_p ())
5594 /* Check the non-global symbols. If we have ANY match, then we're done. */
5599 ada_add_local_symbols (result
, lookup_name
, block
, domain
);
5602 /* In the !full_search case we're are being called by
5603 iterate_over_symbols, and we don't want to search
5605 ada_add_block_symbols (result
, block
, lookup_name
, domain
, NULL
);
5607 if (!result
.empty () || !full_search
)
5611 /* No non-global symbols found. Check our cache to see if we have
5612 already performed this search before. If we have, then return
5615 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5616 domain
, &sym
, &block
))
5619 add_defn_to_vec (result
, sym
, block
);
5623 if (made_global_lookup_p
)
5624 *made_global_lookup_p
= 1;
5626 /* Search symbols from all global blocks. */
5628 add_nonlocal_symbols (result
, lookup_name
, domain
, 1);
5630 /* Now add symbols from all per-file blocks if we've gotten no hits
5631 (not strictly correct, but perhaps better than an error). */
5633 if (result
.empty ())
5634 add_nonlocal_symbols (result
, lookup_name
, domain
, 0);
5637 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5638 is non-zero, enclosing scope and in global scopes.
5640 Returns (SYM,BLOCK) tuples, indicating the symbols found and the
5641 blocks and symbol tables (if any) in which they were found.
5643 When full_search is non-zero, any non-function/non-enumeral
5644 symbol match within the nest of blocks whose innermost member is BLOCK,
5645 is the one match returned (no other matches in that or
5646 enclosing blocks is returned). If there are any matches in or
5647 surrounding BLOCK, then these alone are returned.
5649 Names prefixed with "standard__" are handled specially: "standard__"
5650 is first stripped off, and only static and global symbols are searched. */
5652 static std::vector
<struct block_symbol
>
5653 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5654 const struct block
*block
,
5658 int syms_from_global_search
;
5659 std::vector
<struct block_symbol
> results
;
5661 ada_add_all_symbols (results
, block
, lookup_name
,
5662 domain
, full_search
, &syms_from_global_search
);
5664 remove_extra_symbols (&results
);
5666 if (results
.empty () && full_search
&& syms_from_global_search
)
5667 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5669 if (results
.size () == 1 && full_search
&& syms_from_global_search
)
5670 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5671 results
[0].symbol
, results
[0].block
);
5673 remove_irrelevant_renamings (&results
, block
);
5677 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5678 in global scopes, returning (SYM,BLOCK) tuples.
5680 See ada_lookup_symbol_list_worker for further details. */
5682 std::vector
<struct block_symbol
>
5683 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5686 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5687 lookup_name_info
lookup_name (name
, name_match_type
);
5689 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, 1);
5692 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5693 to 1, but choosing the first symbol found if there are multiple
5696 The result is stored in *INFO, which must be non-NULL.
5697 If no match is found, INFO->SYM is set to NULL. */
5700 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5702 struct block_symbol
*info
)
5704 /* Since we already have an encoded name, wrap it in '<>' to force a
5705 verbatim match. Otherwise, if the name happens to not look like
5706 an encoded name (because it doesn't include a "__"),
5707 ada_lookup_name_info would re-encode/fold it again, and that
5708 would e.g., incorrectly lowercase object renaming names like
5709 "R28b" -> "r28b". */
5710 std::string verbatim
= add_angle_brackets (name
);
5712 gdb_assert (info
!= NULL
);
5713 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5716 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5717 scope and in global scopes, or NULL if none. NAME is folded and
5718 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5719 choosing the first symbol if there are multiple choices. */
5722 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5725 std::vector
<struct block_symbol
> candidates
5726 = ada_lookup_symbol_list (name
, block0
, domain
);
5728 if (candidates
.empty ())
5731 block_symbol info
= candidates
[0];
5732 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5737 /* True iff STR is a possible encoded suffix of a normal Ada name
5738 that is to be ignored for matching purposes. Suffixes of parallel
5739 names (e.g., XVE) are not included here. Currently, the possible suffixes
5740 are given by any of the regular expressions:
5742 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5743 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5744 TKB [subprogram suffix for task bodies]
5745 _E[0-9]+[bs]$ [protected object entry suffixes]
5746 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5748 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5749 match is performed. This sequence is used to differentiate homonyms,
5750 is an optional part of a valid name suffix. */
5753 is_name_suffix (const char *str
)
5756 const char *matching
;
5757 const int len
= strlen (str
);
5759 /* Skip optional leading __[0-9]+. */
5761 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5764 while (isdigit (str
[0]))
5770 if (str
[0] == '.' || str
[0] == '$')
5773 while (isdigit (matching
[0]))
5775 if (matching
[0] == '\0')
5781 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5784 while (isdigit (matching
[0]))
5786 if (matching
[0] == '\0')
5790 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5792 if (strcmp (str
, "TKB") == 0)
5796 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5797 with a N at the end. Unfortunately, the compiler uses the same
5798 convention for other internal types it creates. So treating
5799 all entity names that end with an "N" as a name suffix causes
5800 some regressions. For instance, consider the case of an enumerated
5801 type. To support the 'Image attribute, it creates an array whose
5803 Having a single character like this as a suffix carrying some
5804 information is a bit risky. Perhaps we should change the encoding
5805 to be something like "_N" instead. In the meantime, do not do
5806 the following check. */
5807 /* Protected Object Subprograms */
5808 if (len
== 1 && str
[0] == 'N')
5813 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5816 while (isdigit (matching
[0]))
5818 if ((matching
[0] == 'b' || matching
[0] == 's')
5819 && matching
[1] == '\0')
5823 /* ??? We should not modify STR directly, as we are doing below. This
5824 is fine in this case, but may become problematic later if we find
5825 that this alternative did not work, and want to try matching
5826 another one from the begining of STR. Since we modified it, we
5827 won't be able to find the begining of the string anymore! */
5831 while (str
[0] != '_' && str
[0] != '\0')
5833 if (str
[0] != 'n' && str
[0] != 'b')
5839 if (str
[0] == '\000')
5844 if (str
[1] != '_' || str
[2] == '\000')
5848 if (strcmp (str
+ 3, "JM") == 0)
5850 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5851 the LJM suffix in favor of the JM one. But we will
5852 still accept LJM as a valid suffix for a reasonable
5853 amount of time, just to allow ourselves to debug programs
5854 compiled using an older version of GNAT. */
5855 if (strcmp (str
+ 3, "LJM") == 0)
5859 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5860 || str
[4] == 'U' || str
[4] == 'P')
5862 if (str
[4] == 'R' && str
[5] != 'T')
5866 if (!isdigit (str
[2]))
5868 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5869 if (!isdigit (str
[k
]) && str
[k
] != '_')
5873 if (str
[0] == '$' && isdigit (str
[1]))
5875 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5876 if (!isdigit (str
[k
]) && str
[k
] != '_')
5883 /* Return non-zero if the string starting at NAME and ending before
5884 NAME_END contains no capital letters. */
5887 is_valid_name_for_wild_match (const char *name0
)
5889 std::string decoded_name
= ada_decode (name0
);
5892 /* If the decoded name starts with an angle bracket, it means that
5893 NAME0 does not follow the GNAT encoding format. It should then
5894 not be allowed as a possible wild match. */
5895 if (decoded_name
[0] == '<')
5898 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5899 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5905 /* Advance *NAMEP to next occurrence in the string NAME0 of the TARGET0
5906 character which could start a simple name. Assumes that *NAMEP points
5907 somewhere inside the string beginning at NAME0. */
5910 advance_wild_match (const char **namep
, const char *name0
, char target0
)
5912 const char *name
= *namep
;
5922 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5925 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
5930 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5931 || name
[2] == target0
))
5936 else if (t1
== '_' && name
[2] == 'B' && name
[3] == '_')
5938 /* Names like "pkg__B_N__name", where N is a number, are
5939 block-local. We can handle these by simply skipping
5946 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5956 /* Return true iff NAME encodes a name of the form prefix.PATN.
5957 Ignores any informational suffixes of NAME (i.e., for which
5958 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
5962 wild_match (const char *name
, const char *patn
)
5965 const char *name0
= name
;
5969 const char *match
= name
;
5973 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5976 if (*p
== '\0' && is_name_suffix (name
))
5977 return match
== name0
|| is_valid_name_for_wild_match (name0
);
5979 if (name
[-1] == '_')
5982 if (!advance_wild_match (&name
, name0
, *patn
))
5987 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to RESULT (if
5988 necessary). OBJFILE is the section containing BLOCK. */
5991 ada_add_block_symbols (std::vector
<struct block_symbol
> &result
,
5992 const struct block
*block
,
5993 const lookup_name_info
&lookup_name
,
5994 domain_enum domain
, struct objfile
*objfile
)
5996 struct block_iterator iter
;
5997 /* A matching argument symbol, if any. */
5998 struct symbol
*arg_sym
;
5999 /* Set true when we find a matching non-argument symbol. */
6005 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6007 sym
= block_iter_match_next (lookup_name
, &iter
))
6009 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6011 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6013 if (SYMBOL_IS_ARGUMENT (sym
))
6018 add_defn_to_vec (result
,
6019 fixup_symbol_section (sym
, objfile
),
6026 /* Handle renamings. */
6028 if (ada_add_block_renamings (result
, block
, lookup_name
, domain
))
6031 if (!found_sym
&& arg_sym
!= NULL
)
6033 add_defn_to_vec (result
,
6034 fixup_symbol_section (arg_sym
, objfile
),
6038 if (!lookup_name
.ada ().wild_match_p ())
6042 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6043 const char *name
= ada_lookup_name
.c_str ();
6044 size_t name_len
= ada_lookup_name
.size ();
6046 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6048 if (symbol_matches_domain (sym
->language (),
6049 SYMBOL_DOMAIN (sym
), domain
))
6053 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6056 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6058 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6063 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6065 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6067 if (SYMBOL_IS_ARGUMENT (sym
))
6072 add_defn_to_vec (result
,
6073 fixup_symbol_section (sym
, objfile
),
6081 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6082 They aren't parameters, right? */
6083 if (!found_sym
&& arg_sym
!= NULL
)
6085 add_defn_to_vec (result
,
6086 fixup_symbol_section (arg_sym
, objfile
),
6093 /* Symbol Completion */
6098 ada_lookup_name_info::matches
6099 (const char *sym_name
,
6100 symbol_name_match_type match_type
,
6101 completion_match_result
*comp_match_res
) const
6104 const char *text
= m_encoded_name
.c_str ();
6105 size_t text_len
= m_encoded_name
.size ();
6107 /* First, test against the fully qualified name of the symbol. */
6109 if (strncmp (sym_name
, text
, text_len
) == 0)
6112 std::string decoded_name
= ada_decode (sym_name
);
6113 if (match
&& !m_encoded_p
)
6115 /* One needed check before declaring a positive match is to verify
6116 that iff we are doing a verbatim match, the decoded version
6117 of the symbol name starts with '<'. Otherwise, this symbol name
6118 is not a suitable completion. */
6120 bool has_angle_bracket
= (decoded_name
[0] == '<');
6121 match
= (has_angle_bracket
== m_verbatim_p
);
6124 if (match
&& !m_verbatim_p
)
6126 /* When doing non-verbatim match, another check that needs to
6127 be done is to verify that the potentially matching symbol name
6128 does not include capital letters, because the ada-mode would
6129 not be able to understand these symbol names without the
6130 angle bracket notation. */
6133 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6138 /* Second: Try wild matching... */
6140 if (!match
&& m_wild_match_p
)
6142 /* Since we are doing wild matching, this means that TEXT
6143 may represent an unqualified symbol name. We therefore must
6144 also compare TEXT against the unqualified name of the symbol. */
6145 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6147 if (strncmp (sym_name
, text
, text_len
) == 0)
6151 /* Finally: If we found a match, prepare the result to return. */
6156 if (comp_match_res
!= NULL
)
6158 std::string
&match_str
= comp_match_res
->match
.storage ();
6161 match_str
= ada_decode (sym_name
);
6165 match_str
= add_angle_brackets (sym_name
);
6167 match_str
= sym_name
;
6171 comp_match_res
->set_match (match_str
.c_str ());
6179 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6180 for tagged types. */
6183 ada_is_dispatch_table_ptr_type (struct type
*type
)
6187 if (type
->code () != TYPE_CODE_PTR
)
6190 name
= TYPE_TARGET_TYPE (type
)->name ();
6194 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6197 /* Return non-zero if TYPE is an interface tag. */
6200 ada_is_interface_tag (struct type
*type
)
6202 const char *name
= type
->name ();
6207 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6210 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6211 to be invisible to users. */
6214 ada_is_ignored_field (struct type
*type
, int field_num
)
6216 if (field_num
< 0 || field_num
> type
->num_fields ())
6219 /* Check the name of that field. */
6221 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6223 /* Anonymous field names should not be printed.
6224 brobecker/2007-02-20: I don't think this can actually happen
6225 but we don't want to print the value of anonymous fields anyway. */
6229 /* Normally, fields whose name start with an underscore ("_")
6230 are fields that have been internally generated by the compiler,
6231 and thus should not be printed. The "_parent" field is special,
6232 however: This is a field internally generated by the compiler
6233 for tagged types, and it contains the components inherited from
6234 the parent type. This field should not be printed as is, but
6235 should not be ignored either. */
6236 if (name
[0] == '_' && !startswith (name
, "_parent"))
6240 /* If this is the dispatch table of a tagged type or an interface tag,
6242 if (ada_is_tagged_type (type
, 1)
6243 && (ada_is_dispatch_table_ptr_type (type
->field (field_num
).type ())
6244 || ada_is_interface_tag (type
->field (field_num
).type ())))
6247 /* Not a special field, so it should not be ignored. */
6251 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6252 pointer or reference type whose ultimate target has a tag field. */
6255 ada_is_tagged_type (struct type
*type
, int refok
)
6257 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6260 /* True iff TYPE represents the type of X'Tag */
6263 ada_is_tag_type (struct type
*type
)
6265 type
= ada_check_typedef (type
);
6267 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6271 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6273 return (name
!= NULL
6274 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6278 /* The type of the tag on VAL. */
6280 static struct type
*
6281 ada_tag_type (struct value
*val
)
6283 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6286 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6287 retired at Ada 05). */
6290 is_ada95_tag (struct value
*tag
)
6292 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6295 /* The value of the tag on VAL. */
6297 static struct value
*
6298 ada_value_tag (struct value
*val
)
6300 return ada_value_struct_elt (val
, "_tag", 0);
6303 /* The value of the tag on the object of type TYPE whose contents are
6304 saved at VALADDR, if it is non-null, or is at memory address
6307 static struct value
*
6308 value_tag_from_contents_and_address (struct type
*type
,
6309 const gdb_byte
*valaddr
,
6312 int tag_byte_offset
;
6313 struct type
*tag_type
;
6315 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6318 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6320 : valaddr
+ tag_byte_offset
);
6321 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6323 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6328 static struct type
*
6329 type_from_tag (struct value
*tag
)
6331 gdb::unique_xmalloc_ptr
<char> type_name
= ada_tag_name (tag
);
6333 if (type_name
!= NULL
)
6334 return ada_find_any_type (ada_encode (type_name
.get ()).c_str ());
6338 /* Given a value OBJ of a tagged type, return a value of this
6339 type at the base address of the object. The base address, as
6340 defined in Ada.Tags, it is the address of the primary tag of
6341 the object, and therefore where the field values of its full
6342 view can be fetched. */
6345 ada_tag_value_at_base_address (struct value
*obj
)
6348 LONGEST offset_to_top
= 0;
6349 struct type
*ptr_type
, *obj_type
;
6351 CORE_ADDR base_address
;
6353 obj_type
= value_type (obj
);
6355 /* It is the responsability of the caller to deref pointers. */
6357 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6360 tag
= ada_value_tag (obj
);
6364 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6366 if (is_ada95_tag (tag
))
6369 ptr_type
= language_lookup_primitive_type
6370 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6371 ptr_type
= lookup_pointer_type (ptr_type
);
6372 val
= value_cast (ptr_type
, tag
);
6376 /* It is perfectly possible that an exception be raised while
6377 trying to determine the base address, just like for the tag;
6378 see ada_tag_name for more details. We do not print the error
6379 message for the same reason. */
6383 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6386 catch (const gdb_exception_error
&e
)
6391 /* If offset is null, nothing to do. */
6393 if (offset_to_top
== 0)
6396 /* -1 is a special case in Ada.Tags; however, what should be done
6397 is not quite clear from the documentation. So do nothing for
6400 if (offset_to_top
== -1)
6403 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6404 from the base address. This was however incompatible with
6405 C++ dispatch table: C++ uses a *negative* value to *add*
6406 to the base address. Ada's convention has therefore been
6407 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6408 use the same convention. Here, we support both cases by
6409 checking the sign of OFFSET_TO_TOP. */
6411 if (offset_to_top
> 0)
6412 offset_to_top
= -offset_to_top
;
6414 base_address
= value_address (obj
) + offset_to_top
;
6415 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6417 /* Make sure that we have a proper tag at the new address.
6418 Otherwise, offset_to_top is bogus (which can happen when
6419 the object is not initialized yet). */
6424 obj_type
= type_from_tag (tag
);
6429 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6432 /* Return the "ada__tags__type_specific_data" type. */
6434 static struct type
*
6435 ada_get_tsd_type (struct inferior
*inf
)
6437 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6439 if (data
->tsd_type
== 0)
6440 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6441 return data
->tsd_type
;
6444 /* Return the TSD (type-specific data) associated to the given TAG.
6445 TAG is assumed to be the tag of a tagged-type entity.
6447 May return NULL if we are unable to get the TSD. */
6449 static struct value
*
6450 ada_get_tsd_from_tag (struct value
*tag
)
6455 /* First option: The TSD is simply stored as a field of our TAG.
6456 Only older versions of GNAT would use this format, but we have
6457 to test it first, because there are no visible markers for
6458 the current approach except the absence of that field. */
6460 val
= ada_value_struct_elt (tag
, "tsd", 1);
6464 /* Try the second representation for the dispatch table (in which
6465 there is no explicit 'tsd' field in the referent of the tag pointer,
6466 and instead the tsd pointer is stored just before the dispatch
6469 type
= ada_get_tsd_type (current_inferior());
6472 type
= lookup_pointer_type (lookup_pointer_type (type
));
6473 val
= value_cast (type
, tag
);
6476 return value_ind (value_ptradd (val
, -1));
6479 /* Given the TSD of a tag (type-specific data), return a string
6480 containing the name of the associated type.
6482 May return NULL if we are unable to determine the tag name. */
6484 static gdb::unique_xmalloc_ptr
<char>
6485 ada_tag_name_from_tsd (struct value
*tsd
)
6490 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6493 gdb::unique_xmalloc_ptr
<char> buffer
6494 = target_read_string (value_as_address (val
), INT_MAX
);
6495 if (buffer
== nullptr)
6498 for (p
= buffer
.get (); *p
!= '\0'; ++p
)
6507 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6510 Return NULL if the TAG is not an Ada tag, or if we were unable to
6511 determine the name of that tag. */
6513 gdb::unique_xmalloc_ptr
<char>
6514 ada_tag_name (struct value
*tag
)
6516 gdb::unique_xmalloc_ptr
<char> name
;
6518 if (!ada_is_tag_type (value_type (tag
)))
6521 /* It is perfectly possible that an exception be raised while trying
6522 to determine the TAG's name, even under normal circumstances:
6523 The associated variable may be uninitialized or corrupted, for
6524 instance. We do not let any exception propagate past this point.
6525 instead we return NULL.
6527 We also do not print the error message either (which often is very
6528 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6529 the caller print a more meaningful message if necessary. */
6532 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6535 name
= ada_tag_name_from_tsd (tsd
);
6537 catch (const gdb_exception_error
&e
)
6544 /* The parent type of TYPE, or NULL if none. */
6547 ada_parent_type (struct type
*type
)
6551 type
= ada_check_typedef (type
);
6553 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6556 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6557 if (ada_is_parent_field (type
, i
))
6559 struct type
*parent_type
= type
->field (i
).type ();
6561 /* If the _parent field is a pointer, then dereference it. */
6562 if (parent_type
->code () == TYPE_CODE_PTR
)
6563 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6564 /* If there is a parallel XVS type, get the actual base type. */
6565 parent_type
= ada_get_base_type (parent_type
);
6567 return ada_check_typedef (parent_type
);
6573 /* True iff field number FIELD_NUM of structure type TYPE contains the
6574 parent-type (inherited) fields of a derived type. Assumes TYPE is
6575 a structure type with at least FIELD_NUM+1 fields. */
6578 ada_is_parent_field (struct type
*type
, int field_num
)
6580 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6582 return (name
!= NULL
6583 && (startswith (name
, "PARENT")
6584 || startswith (name
, "_parent")));
6587 /* True iff field number FIELD_NUM of structure type TYPE is a
6588 transparent wrapper field (which should be silently traversed when doing
6589 field selection and flattened when printing). Assumes TYPE is a
6590 structure type with at least FIELD_NUM+1 fields. Such fields are always
6594 ada_is_wrapper_field (struct type
*type
, int field_num
)
6596 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6598 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6600 /* This happens in functions with "out" or "in out" parameters
6601 which are passed by copy. For such functions, GNAT describes
6602 the function's return type as being a struct where the return
6603 value is in a field called RETVAL, and where the other "out"
6604 or "in out" parameters are fields of that struct. This is not
6609 return (name
!= NULL
6610 && (startswith (name
, "PARENT")
6611 || strcmp (name
, "REP") == 0
6612 || startswith (name
, "_parent")
6613 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6616 /* True iff field number FIELD_NUM of structure or union type TYPE
6617 is a variant wrapper. Assumes TYPE is a structure type with at least
6618 FIELD_NUM+1 fields. */
6621 ada_is_variant_part (struct type
*type
, int field_num
)
6623 /* Only Ada types are eligible. */
6624 if (!ADA_TYPE_P (type
))
6627 struct type
*field_type
= type
->field (field_num
).type ();
6629 return (field_type
->code () == TYPE_CODE_UNION
6630 || (is_dynamic_field (type
, field_num
)
6631 && (TYPE_TARGET_TYPE (field_type
)->code ()
6632 == TYPE_CODE_UNION
)));
6635 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6636 whose discriminants are contained in the record type OUTER_TYPE,
6637 returns the type of the controlling discriminant for the variant.
6638 May return NULL if the type could not be found. */
6641 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6643 const char *name
= ada_variant_discrim_name (var_type
);
6645 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6648 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6649 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6650 represents a 'when others' clause; otherwise 0. */
6653 ada_is_others_clause (struct type
*type
, int field_num
)
6655 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6657 return (name
!= NULL
&& name
[0] == 'O');
6660 /* Assuming that TYPE0 is the type of the variant part of a record,
6661 returns the name of the discriminant controlling the variant.
6662 The value is valid until the next call to ada_variant_discrim_name. */
6665 ada_variant_discrim_name (struct type
*type0
)
6667 static std::string result
;
6670 const char *discrim_end
;
6671 const char *discrim_start
;
6673 if (type0
->code () == TYPE_CODE_PTR
)
6674 type
= TYPE_TARGET_TYPE (type0
);
6678 name
= ada_type_name (type
);
6680 if (name
== NULL
|| name
[0] == '\000')
6683 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6686 if (startswith (discrim_end
, "___XVN"))
6689 if (discrim_end
== name
)
6692 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6695 if (discrim_start
== name
+ 1)
6697 if ((discrim_start
> name
+ 3
6698 && startswith (discrim_start
- 3, "___"))
6699 || discrim_start
[-1] == '.')
6703 result
= std::string (discrim_start
, discrim_end
- discrim_start
);
6704 return result
.c_str ();
6707 /* Scan STR for a subtype-encoded number, beginning at position K.
6708 Put the position of the character just past the number scanned in
6709 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6710 Return 1 if there was a valid number at the given position, and 0
6711 otherwise. A "subtype-encoded" number consists of the absolute value
6712 in decimal, followed by the letter 'm' to indicate a negative number.
6713 Assumes 0m does not occur. */
6716 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6720 if (!isdigit (str
[k
]))
6723 /* Do it the hard way so as not to make any assumption about
6724 the relationship of unsigned long (%lu scan format code) and
6727 while (isdigit (str
[k
]))
6729 RU
= RU
* 10 + (str
[k
] - '0');
6736 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6742 /* NOTE on the above: Technically, C does not say what the results of
6743 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6744 number representable as a LONGEST (although either would probably work
6745 in most implementations). When RU>0, the locution in the then branch
6746 above is always equivalent to the negative of RU. */
6753 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6754 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6755 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6758 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6760 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6774 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6784 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6785 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6787 if (val
>= L
&& val
<= U
)
6799 /* FIXME: Lots of redundancy below. Try to consolidate. */
6801 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6802 ARG_TYPE, extract and return the value of one of its (non-static)
6803 fields. FIELDNO says which field. Differs from value_primitive_field
6804 only in that it can handle packed values of arbitrary type. */
6807 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6808 struct type
*arg_type
)
6812 arg_type
= ada_check_typedef (arg_type
);
6813 type
= arg_type
->field (fieldno
).type ();
6815 /* Handle packed fields. It might be that the field is not packed
6816 relative to its containing structure, but the structure itself is
6817 packed; in this case we must take the bit-field path. */
6818 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
6820 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6821 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6823 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6824 offset
+ bit_pos
/ 8,
6825 bit_pos
% 8, bit_size
, type
);
6828 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6831 /* Find field with name NAME in object of type TYPE. If found,
6832 set the following for each argument that is non-null:
6833 - *FIELD_TYPE_P to the field's type;
6834 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6835 an object of that type;
6836 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6837 - *BIT_SIZE_P to its size in bits if the field is packed, and
6839 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6840 fields up to but not including the desired field, or by the total
6841 number of fields if not found. A NULL value of NAME never
6842 matches; the function just counts visible fields in this case.
6844 Notice that we need to handle when a tagged record hierarchy
6845 has some components with the same name, like in this scenario:
6847 type Top_T is tagged record
6853 type Middle_T is new Top.Top_T with record
6854 N : Character := 'a';
6858 type Bottom_T is new Middle.Middle_T with record
6860 C : Character := '5';
6862 A : Character := 'J';
6865 Let's say we now have a variable declared and initialized as follow:
6867 TC : Top_A := new Bottom_T;
6869 And then we use this variable to call this function
6871 procedure Assign (Obj: in out Top_T; TV : Integer);
6875 Assign (Top_T (B), 12);
6877 Now, we're in the debugger, and we're inside that procedure
6878 then and we want to print the value of obj.c:
6880 Usually, the tagged record or one of the parent type owns the
6881 component to print and there's no issue but in this particular
6882 case, what does it mean to ask for Obj.C? Since the actual
6883 type for object is type Bottom_T, it could mean two things: type
6884 component C from the Middle_T view, but also component C from
6885 Bottom_T. So in that "undefined" case, when the component is
6886 not found in the non-resolved type (which includes all the
6887 components of the parent type), then resolve it and see if we
6888 get better luck once expanded.
6890 In the case of homonyms in the derived tagged type, we don't
6891 guaranty anything, and pick the one that's easiest for us
6894 Returns 1 if found, 0 otherwise. */
6897 find_struct_field (const char *name
, struct type
*type
, int offset
,
6898 struct type
**field_type_p
,
6899 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6903 int parent_offset
= -1;
6905 type
= ada_check_typedef (type
);
6907 if (field_type_p
!= NULL
)
6908 *field_type_p
= NULL
;
6909 if (byte_offset_p
!= NULL
)
6911 if (bit_offset_p
!= NULL
)
6913 if (bit_size_p
!= NULL
)
6916 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6918 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6919 int fld_offset
= offset
+ bit_pos
/ 8;
6920 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6922 if (t_field_name
== NULL
)
6925 else if (ada_is_parent_field (type
, i
))
6927 /* This is a field pointing us to the parent type of a tagged
6928 type. As hinted in this function's documentation, we give
6929 preference to fields in the current record first, so what
6930 we do here is just record the index of this field before
6931 we skip it. If it turns out we couldn't find our field
6932 in the current record, then we'll get back to it and search
6933 inside it whether the field might exist in the parent. */
6939 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6941 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6943 if (field_type_p
!= NULL
)
6944 *field_type_p
= type
->field (i
).type ();
6945 if (byte_offset_p
!= NULL
)
6946 *byte_offset_p
= fld_offset
;
6947 if (bit_offset_p
!= NULL
)
6948 *bit_offset_p
= bit_pos
% 8;
6949 if (bit_size_p
!= NULL
)
6950 *bit_size_p
= bit_size
;
6953 else if (ada_is_wrapper_field (type
, i
))
6955 if (find_struct_field (name
, type
->field (i
).type (), fld_offset
,
6956 field_type_p
, byte_offset_p
, bit_offset_p
,
6957 bit_size_p
, index_p
))
6960 else if (ada_is_variant_part (type
, i
))
6962 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6965 struct type
*field_type
6966 = ada_check_typedef (type
->field (i
).type ());
6968 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
6970 if (find_struct_field (name
, field_type
->field (j
).type (),
6972 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6973 field_type_p
, byte_offset_p
,
6974 bit_offset_p
, bit_size_p
, index_p
))
6978 else if (index_p
!= NULL
)
6982 /* Field not found so far. If this is a tagged type which
6983 has a parent, try finding that field in the parent now. */
6985 if (parent_offset
!= -1)
6987 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
6988 int fld_offset
= offset
+ bit_pos
/ 8;
6990 if (find_struct_field (name
, type
->field (parent_offset
).type (),
6991 fld_offset
, field_type_p
, byte_offset_p
,
6992 bit_offset_p
, bit_size_p
, index_p
))
6999 /* Number of user-visible fields in record type TYPE. */
7002 num_visible_fields (struct type
*type
)
7007 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7011 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7012 and search in it assuming it has (class) type TYPE.
7013 If found, return value, else return NULL.
7015 Searches recursively through wrapper fields (e.g., '_parent').
7017 In the case of homonyms in the tagged types, please refer to the
7018 long explanation in find_struct_field's function documentation. */
7020 static struct value
*
7021 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7025 int parent_offset
= -1;
7027 type
= ada_check_typedef (type
);
7028 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7030 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7032 if (t_field_name
== NULL
)
7035 else if (ada_is_parent_field (type
, i
))
7037 /* This is a field pointing us to the parent type of a tagged
7038 type. As hinted in this function's documentation, we give
7039 preference to fields in the current record first, so what
7040 we do here is just record the index of this field before
7041 we skip it. If it turns out we couldn't find our field
7042 in the current record, then we'll get back to it and search
7043 inside it whether the field might exist in the parent. */
7049 else if (field_name_match (t_field_name
, name
))
7050 return ada_value_primitive_field (arg
, offset
, i
, type
);
7052 else if (ada_is_wrapper_field (type
, i
))
7054 struct value
*v
= /* Do not let indent join lines here. */
7055 ada_search_struct_field (name
, arg
,
7056 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7057 type
->field (i
).type ());
7063 else if (ada_is_variant_part (type
, i
))
7065 /* PNH: Do we ever get here? See find_struct_field. */
7067 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7068 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7070 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7072 struct value
*v
= ada_search_struct_field
/* Force line
7075 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7076 field_type
->field (j
).type ());
7084 /* Field not found so far. If this is a tagged type which
7085 has a parent, try finding that field in the parent now. */
7087 if (parent_offset
!= -1)
7089 struct value
*v
= ada_search_struct_field (
7090 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7091 type
->field (parent_offset
).type ());
7100 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7101 int, struct type
*);
7104 /* Return field #INDEX in ARG, where the index is that returned by
7105 * find_struct_field through its INDEX_P argument. Adjust the address
7106 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7107 * If found, return value, else return NULL. */
7109 static struct value
*
7110 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7113 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7117 /* Auxiliary function for ada_index_struct_field. Like
7118 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7121 static struct value
*
7122 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7126 type
= ada_check_typedef (type
);
7128 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7130 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7132 else if (ada_is_wrapper_field (type
, i
))
7134 struct value
*v
= /* Do not let indent join lines here. */
7135 ada_index_struct_field_1 (index_p
, arg
,
7136 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7137 type
->field (i
).type ());
7143 else if (ada_is_variant_part (type
, i
))
7145 /* PNH: Do we ever get here? See ada_search_struct_field,
7146 find_struct_field. */
7147 error (_("Cannot assign this kind of variant record"));
7149 else if (*index_p
== 0)
7150 return ada_value_primitive_field (arg
, offset
, i
, type
);
7157 /* Return a string representation of type TYPE. */
7160 type_as_string (struct type
*type
)
7162 string_file tmp_stream
;
7164 type_print (type
, "", &tmp_stream
, -1);
7166 return std::move (tmp_stream
.string ());
7169 /* Given a type TYPE, look up the type of the component of type named NAME.
7170 If DISPP is non-null, add its byte displacement from the beginning of a
7171 structure (pointed to by a value) of type TYPE to *DISPP (does not
7172 work for packed fields).
7174 Matches any field whose name has NAME as a prefix, possibly
7177 TYPE can be either a struct or union. If REFOK, TYPE may also
7178 be a (pointer or reference)+ to a struct or union, and the
7179 ultimate target type will be searched.
7181 Looks recursively into variant clauses and parent types.
7183 In the case of homonyms in the tagged types, please refer to the
7184 long explanation in find_struct_field's function documentation.
7186 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7187 TYPE is not a type of the right kind. */
7189 static struct type
*
7190 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7194 int parent_offset
= -1;
7199 if (refok
&& type
!= NULL
)
7202 type
= ada_check_typedef (type
);
7203 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7205 type
= TYPE_TARGET_TYPE (type
);
7209 || (type
->code () != TYPE_CODE_STRUCT
7210 && type
->code () != TYPE_CODE_UNION
))
7215 error (_("Type %s is not a structure or union type"),
7216 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7219 type
= to_static_fixed_type (type
);
7221 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7223 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7226 if (t_field_name
== NULL
)
7229 else if (ada_is_parent_field (type
, i
))
7231 /* This is a field pointing us to the parent type of a tagged
7232 type. As hinted in this function's documentation, we give
7233 preference to fields in the current record first, so what
7234 we do here is just record the index of this field before
7235 we skip it. If it turns out we couldn't find our field
7236 in the current record, then we'll get back to it and search
7237 inside it whether the field might exist in the parent. */
7243 else if (field_name_match (t_field_name
, name
))
7244 return type
->field (i
).type ();
7246 else if (ada_is_wrapper_field (type
, i
))
7248 t
= ada_lookup_struct_elt_type (type
->field (i
).type (), name
,
7254 else if (ada_is_variant_part (type
, i
))
7257 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7259 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
7261 /* FIXME pnh 2008/01/26: We check for a field that is
7262 NOT wrapped in a struct, since the compiler sometimes
7263 generates these for unchecked variant types. Revisit
7264 if the compiler changes this practice. */
7265 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7267 if (v_field_name
!= NULL
7268 && field_name_match (v_field_name
, name
))
7269 t
= field_type
->field (j
).type ();
7271 t
= ada_lookup_struct_elt_type (field_type
->field (j
).type (),
7281 /* Field not found so far. If this is a tagged type which
7282 has a parent, try finding that field in the parent now. */
7284 if (parent_offset
!= -1)
7288 t
= ada_lookup_struct_elt_type (type
->field (parent_offset
).type (),
7297 const char *name_str
= name
!= NULL
? name
: _("<null>");
7299 error (_("Type %s has no component named %s"),
7300 type_as_string (type
).c_str (), name_str
);
7306 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7307 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7308 represents an unchecked union (that is, the variant part of a
7309 record that is named in an Unchecked_Union pragma). */
7312 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7314 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7316 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7320 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7321 within OUTER, determine which variant clause (field number in VAR_TYPE,
7322 numbering from 0) is applicable. Returns -1 if none are. */
7325 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7329 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7330 struct value
*discrim
;
7331 LONGEST discrim_val
;
7333 /* Using plain value_from_contents_and_address here causes problems
7334 because we will end up trying to resolve a type that is currently
7335 being constructed. */
7336 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7337 if (discrim
== NULL
)
7339 discrim_val
= value_as_long (discrim
);
7342 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7344 if (ada_is_others_clause (var_type
, i
))
7346 else if (ada_in_variant (discrim_val
, var_type
, i
))
7350 return others_clause
;
7355 /* Dynamic-Sized Records */
7357 /* Strategy: The type ostensibly attached to a value with dynamic size
7358 (i.e., a size that is not statically recorded in the debugging
7359 data) does not accurately reflect the size or layout of the value.
7360 Our strategy is to convert these values to values with accurate,
7361 conventional types that are constructed on the fly. */
7363 /* There is a subtle and tricky problem here. In general, we cannot
7364 determine the size of dynamic records without its data. However,
7365 the 'struct value' data structure, which GDB uses to represent
7366 quantities in the inferior process (the target), requires the size
7367 of the type at the time of its allocation in order to reserve space
7368 for GDB's internal copy of the data. That's why the
7369 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7370 rather than struct value*s.
7372 However, GDB's internal history variables ($1, $2, etc.) are
7373 struct value*s containing internal copies of the data that are not, in
7374 general, the same as the data at their corresponding addresses in
7375 the target. Fortunately, the types we give to these values are all
7376 conventional, fixed-size types (as per the strategy described
7377 above), so that we don't usually have to perform the
7378 'to_fixed_xxx_type' conversions to look at their values.
7379 Unfortunately, there is one exception: if one of the internal
7380 history variables is an array whose elements are unconstrained
7381 records, then we will need to create distinct fixed types for each
7382 element selected. */
7384 /* The upshot of all of this is that many routines take a (type, host
7385 address, target address) triple as arguments to represent a value.
7386 The host address, if non-null, is supposed to contain an internal
7387 copy of the relevant data; otherwise, the program is to consult the
7388 target at the target address. */
7390 /* Assuming that VAL0 represents a pointer value, the result of
7391 dereferencing it. Differs from value_ind in its treatment of
7392 dynamic-sized types. */
7395 ada_value_ind (struct value
*val0
)
7397 struct value
*val
= value_ind (val0
);
7399 if (ada_is_tagged_type (value_type (val
), 0))
7400 val
= ada_tag_value_at_base_address (val
);
7402 return ada_to_fixed_value (val
);
7405 /* The value resulting from dereferencing any "reference to"
7406 qualifiers on VAL0. */
7408 static struct value
*
7409 ada_coerce_ref (struct value
*val0
)
7411 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7413 struct value
*val
= val0
;
7415 val
= coerce_ref (val
);
7417 if (ada_is_tagged_type (value_type (val
), 0))
7418 val
= ada_tag_value_at_base_address (val
);
7420 return ada_to_fixed_value (val
);
7426 /* Return the bit alignment required for field #F of template type TYPE. */
7429 field_alignment (struct type
*type
, int f
)
7431 const char *name
= TYPE_FIELD_NAME (type
, f
);
7435 /* The field name should never be null, unless the debugging information
7436 is somehow malformed. In this case, we assume the field does not
7437 require any alignment. */
7441 len
= strlen (name
);
7443 if (!isdigit (name
[len
- 1]))
7446 if (isdigit (name
[len
- 2]))
7447 align_offset
= len
- 2;
7449 align_offset
= len
- 1;
7451 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7452 return TARGET_CHAR_BIT
;
7454 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7457 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7459 static struct symbol
*
7460 ada_find_any_type_symbol (const char *name
)
7464 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7465 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7468 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7472 /* Find a type named NAME. Ignores ambiguity. This routine will look
7473 solely for types defined by debug info, it will not search the GDB
7476 static struct type
*
7477 ada_find_any_type (const char *name
)
7479 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7482 return SYMBOL_TYPE (sym
);
7487 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7488 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7489 symbol, in which case it is returned. Otherwise, this looks for
7490 symbols whose name is that of NAME_SYM suffixed with "___XR".
7491 Return symbol if found, and NULL otherwise. */
7494 ada_is_renaming_symbol (struct symbol
*name_sym
)
7496 const char *name
= name_sym
->linkage_name ();
7497 return strstr (name
, "___XR") != NULL
;
7500 /* Because of GNAT encoding conventions, several GDB symbols may match a
7501 given type name. If the type denoted by TYPE0 is to be preferred to
7502 that of TYPE1 for purposes of type printing, return non-zero;
7503 otherwise return 0. */
7506 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7510 else if (type0
== NULL
)
7512 else if (type1
->code () == TYPE_CODE_VOID
)
7514 else if (type0
->code () == TYPE_CODE_VOID
)
7516 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7518 else if (ada_is_constrained_packed_array_type (type0
))
7520 else if (ada_is_array_descriptor_type (type0
)
7521 && !ada_is_array_descriptor_type (type1
))
7525 const char *type0_name
= type0
->name ();
7526 const char *type1_name
= type1
->name ();
7528 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7529 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7535 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7539 ada_type_name (struct type
*type
)
7543 return type
->name ();
7546 /* Search the list of "descriptive" types associated to TYPE for a type
7547 whose name is NAME. */
7549 static struct type
*
7550 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7552 struct type
*result
, *tmp
;
7554 if (ada_ignore_descriptive_types_p
)
7557 /* If there no descriptive-type info, then there is no parallel type
7559 if (!HAVE_GNAT_AUX_INFO (type
))
7562 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7563 while (result
!= NULL
)
7565 const char *result_name
= ada_type_name (result
);
7567 if (result_name
== NULL
)
7569 warning (_("unexpected null name on descriptive type"));
7573 /* If the names match, stop. */
7574 if (strcmp (result_name
, name
) == 0)
7577 /* Otherwise, look at the next item on the list, if any. */
7578 if (HAVE_GNAT_AUX_INFO (result
))
7579 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7583 /* If not found either, try after having resolved the typedef. */
7588 result
= check_typedef (result
);
7589 if (HAVE_GNAT_AUX_INFO (result
))
7590 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7596 /* If we didn't find a match, see whether this is a packed array. With
7597 older compilers, the descriptive type information is either absent or
7598 irrelevant when it comes to packed arrays so the above lookup fails.
7599 Fall back to using a parallel lookup by name in this case. */
7600 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7601 return ada_find_any_type (name
);
7606 /* Find a parallel type to TYPE with the specified NAME, using the
7607 descriptive type taken from the debugging information, if available,
7608 and otherwise using the (slower) name-based method. */
7610 static struct type
*
7611 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7613 struct type
*result
= NULL
;
7615 if (HAVE_GNAT_AUX_INFO (type
))
7616 result
= find_parallel_type_by_descriptive_type (type
, name
);
7618 result
= ada_find_any_type (name
);
7623 /* Same as above, but specify the name of the parallel type by appending
7624 SUFFIX to the name of TYPE. */
7627 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7630 const char *type_name
= ada_type_name (type
);
7633 if (type_name
== NULL
)
7636 len
= strlen (type_name
);
7638 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7640 strcpy (name
, type_name
);
7641 strcpy (name
+ len
, suffix
);
7643 return ada_find_parallel_type_with_name (type
, name
);
7646 /* If TYPE is a variable-size record type, return the corresponding template
7647 type describing its fields. Otherwise, return NULL. */
7649 static struct type
*
7650 dynamic_template_type (struct type
*type
)
7652 type
= ada_check_typedef (type
);
7654 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7655 || ada_type_name (type
) == NULL
)
7659 int len
= strlen (ada_type_name (type
));
7661 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7664 return ada_find_parallel_type (type
, "___XVE");
7668 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7669 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7672 is_dynamic_field (struct type
*templ_type
, int field_num
)
7674 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7677 && templ_type
->field (field_num
).type ()->code () == TYPE_CODE_PTR
7678 && strstr (name
, "___XVL") != NULL
;
7681 /* The index of the variant field of TYPE, or -1 if TYPE does not
7682 represent a variant record type. */
7685 variant_field_index (struct type
*type
)
7689 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
7692 for (f
= 0; f
< type
->num_fields (); f
+= 1)
7694 if (ada_is_variant_part (type
, f
))
7700 /* A record type with no fields. */
7702 static struct type
*
7703 empty_record (struct type
*templ
)
7705 struct type
*type
= alloc_type_copy (templ
);
7707 type
->set_code (TYPE_CODE_STRUCT
);
7708 INIT_NONE_SPECIFIC (type
);
7709 type
->set_name ("<empty>");
7710 TYPE_LENGTH (type
) = 0;
7714 /* An ordinary record type (with fixed-length fields) that describes
7715 the value of type TYPE at VALADDR or ADDRESS (see comments at
7716 the beginning of this section) VAL according to GNAT conventions.
7717 DVAL0 should describe the (portion of a) record that contains any
7718 necessary discriminants. It should be NULL if value_type (VAL) is
7719 an outer-level type (i.e., as opposed to a branch of a variant.) A
7720 variant field (unless unchecked) is replaced by a particular branch
7723 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7724 length are not statically known are discarded. As a consequence,
7725 VALADDR, ADDRESS and DVAL0 are ignored.
7727 NOTE: Limitations: For now, we assume that dynamic fields and
7728 variants occupy whole numbers of bytes. However, they need not be
7732 ada_template_to_fixed_record_type_1 (struct type
*type
,
7733 const gdb_byte
*valaddr
,
7734 CORE_ADDR address
, struct value
*dval0
,
7735 int keep_dynamic_fields
)
7737 struct value
*mark
= value_mark ();
7740 int nfields
, bit_len
;
7746 /* Compute the number of fields in this record type that are going
7747 to be processed: unless keep_dynamic_fields, this includes only
7748 fields whose position and length are static will be processed. */
7749 if (keep_dynamic_fields
)
7750 nfields
= type
->num_fields ();
7754 while (nfields
< type
->num_fields ()
7755 && !ada_is_variant_part (type
, nfields
)
7756 && !is_dynamic_field (type
, nfields
))
7760 rtype
= alloc_type_copy (type
);
7761 rtype
->set_code (TYPE_CODE_STRUCT
);
7762 INIT_NONE_SPECIFIC (rtype
);
7763 rtype
->set_num_fields (nfields
);
7765 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
7766 rtype
->set_name (ada_type_name (type
));
7767 rtype
->set_is_fixed_instance (true);
7773 for (f
= 0; f
< nfields
; f
+= 1)
7775 off
= align_up (off
, field_alignment (type
, f
))
7776 + TYPE_FIELD_BITPOS (type
, f
);
7777 SET_FIELD_BITPOS (rtype
->field (f
), off
);
7778 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7780 if (ada_is_variant_part (type
, f
))
7785 else if (is_dynamic_field (type
, f
))
7787 const gdb_byte
*field_valaddr
= valaddr
;
7788 CORE_ADDR field_address
= address
;
7789 struct type
*field_type
=
7790 TYPE_TARGET_TYPE (type
->field (f
).type ());
7794 /* rtype's length is computed based on the run-time
7795 value of discriminants. If the discriminants are not
7796 initialized, the type size may be completely bogus and
7797 GDB may fail to allocate a value for it. So check the
7798 size first before creating the value. */
7799 ada_ensure_varsize_limit (rtype
);
7800 /* Using plain value_from_contents_and_address here
7801 causes problems because we will end up trying to
7802 resolve a type that is currently being
7804 dval
= value_from_contents_and_address_unresolved (rtype
,
7807 rtype
= value_type (dval
);
7812 /* If the type referenced by this field is an aligner type, we need
7813 to unwrap that aligner type, because its size might not be set.
7814 Keeping the aligner type would cause us to compute the wrong
7815 size for this field, impacting the offset of the all the fields
7816 that follow this one. */
7817 if (ada_is_aligner_type (field_type
))
7819 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7821 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7822 field_address
= cond_offset_target (field_address
, field_offset
);
7823 field_type
= ada_aligned_type (field_type
);
7826 field_valaddr
= cond_offset_host (field_valaddr
,
7827 off
/ TARGET_CHAR_BIT
);
7828 field_address
= cond_offset_target (field_address
,
7829 off
/ TARGET_CHAR_BIT
);
7831 /* Get the fixed type of the field. Note that, in this case,
7832 we do not want to get the real type out of the tag: if
7833 the current field is the parent part of a tagged record,
7834 we will get the tag of the object. Clearly wrong: the real
7835 type of the parent is not the real type of the child. We
7836 would end up in an infinite loop. */
7837 field_type
= ada_get_base_type (field_type
);
7838 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7839 field_address
, dval
, 0);
7840 /* If the field size is already larger than the maximum
7841 object size, then the record itself will necessarily
7842 be larger than the maximum object size. We need to make
7843 this check now, because the size might be so ridiculously
7844 large (due to an uninitialized variable in the inferior)
7845 that it would cause an overflow when adding it to the
7847 ada_ensure_varsize_limit (field_type
);
7849 rtype
->field (f
).set_type (field_type
);
7850 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7851 /* The multiplication can potentially overflow. But because
7852 the field length has been size-checked just above, and
7853 assuming that the maximum size is a reasonable value,
7854 an overflow should not happen in practice. So rather than
7855 adding overflow recovery code to this already complex code,
7856 we just assume that it's not going to happen. */
7858 TYPE_LENGTH (rtype
->field (f
).type ()) * TARGET_CHAR_BIT
;
7862 /* Note: If this field's type is a typedef, it is important
7863 to preserve the typedef layer.
7865 Otherwise, we might be transforming a typedef to a fat
7866 pointer (encoding a pointer to an unconstrained array),
7867 into a basic fat pointer (encoding an unconstrained
7868 array). As both types are implemented using the same
7869 structure, the typedef is the only clue which allows us
7870 to distinguish between the two options. Stripping it
7871 would prevent us from printing this field appropriately. */
7872 rtype
->field (f
).set_type (type
->field (f
).type ());
7873 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7874 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7876 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7879 struct type
*field_type
= type
->field (f
).type ();
7881 /* We need to be careful of typedefs when computing
7882 the length of our field. If this is a typedef,
7883 get the length of the target type, not the length
7885 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
7886 field_type
= ada_typedef_target_type (field_type
);
7889 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7892 if (off
+ fld_bit_len
> bit_len
)
7893 bit_len
= off
+ fld_bit_len
;
7895 TYPE_LENGTH (rtype
) =
7896 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7899 /* We handle the variant part, if any, at the end because of certain
7900 odd cases in which it is re-ordered so as NOT to be the last field of
7901 the record. This can happen in the presence of representation
7903 if (variant_field
>= 0)
7905 struct type
*branch_type
;
7907 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7911 /* Using plain value_from_contents_and_address here causes
7912 problems because we will end up trying to resolve a type
7913 that is currently being constructed. */
7914 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
7916 rtype
= value_type (dval
);
7922 to_fixed_variant_branch_type
7923 (type
->field (variant_field
).type (),
7924 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7925 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7926 if (branch_type
== NULL
)
7928 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
7929 rtype
->field (f
- 1) = rtype
->field (f
);
7930 rtype
->set_num_fields (rtype
->num_fields () - 1);
7934 rtype
->field (variant_field
).set_type (branch_type
);
7935 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7937 TYPE_LENGTH (rtype
->field (variant_field
).type ()) *
7939 if (off
+ fld_bit_len
> bit_len
)
7940 bit_len
= off
+ fld_bit_len
;
7941 TYPE_LENGTH (rtype
) =
7942 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7946 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7947 should contain the alignment of that record, which should be a strictly
7948 positive value. If null or negative, then something is wrong, most
7949 probably in the debug info. In that case, we don't round up the size
7950 of the resulting type. If this record is not part of another structure,
7951 the current RTYPE length might be good enough for our purposes. */
7952 if (TYPE_LENGTH (type
) <= 0)
7955 warning (_("Invalid type size for `%s' detected: %s."),
7956 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
7958 warning (_("Invalid type size for <unnamed> detected: %s."),
7959 pulongest (TYPE_LENGTH (type
)));
7963 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
7964 TYPE_LENGTH (type
));
7967 value_free_to_mark (mark
);
7968 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7969 error (_("record type with dynamic size is larger than varsize-limit"));
7973 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7976 static struct type
*
7977 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7978 CORE_ADDR address
, struct value
*dval0
)
7980 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7984 /* An ordinary record type in which ___XVL-convention fields and
7985 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7986 static approximations, containing all possible fields. Uses
7987 no runtime values. Useless for use in values, but that's OK,
7988 since the results are used only for type determinations. Works on both
7989 structs and unions. Representation note: to save space, we memorize
7990 the result of this function in the TYPE_TARGET_TYPE of the
7993 static struct type
*
7994 template_to_static_fixed_type (struct type
*type0
)
8000 /* No need no do anything if the input type is already fixed. */
8001 if (type0
->is_fixed_instance ())
8004 /* Likewise if we already have computed the static approximation. */
8005 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8006 return TYPE_TARGET_TYPE (type0
);
8008 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8010 nfields
= type0
->num_fields ();
8012 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8013 recompute all over next time. */
8014 TYPE_TARGET_TYPE (type0
) = type
;
8016 for (f
= 0; f
< nfields
; f
+= 1)
8018 struct type
*field_type
= type0
->field (f
).type ();
8019 struct type
*new_type
;
8021 if (is_dynamic_field (type0
, f
))
8023 field_type
= ada_check_typedef (field_type
);
8024 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8027 new_type
= static_unwrap_type (field_type
);
8029 if (new_type
!= field_type
)
8031 /* Clone TYPE0 only the first time we get a new field type. */
8034 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8035 type
->set_code (type0
->code ());
8036 INIT_NONE_SPECIFIC (type
);
8037 type
->set_num_fields (nfields
);
8041 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
8042 memcpy (fields
, type0
->fields (),
8043 sizeof (struct field
) * nfields
);
8044 type
->set_fields (fields
);
8046 type
->set_name (ada_type_name (type0
));
8047 type
->set_is_fixed_instance (true);
8048 TYPE_LENGTH (type
) = 0;
8050 type
->field (f
).set_type (new_type
);
8051 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8058 /* Given an object of type TYPE whose contents are at VALADDR and
8059 whose address in memory is ADDRESS, returns a revision of TYPE,
8060 which should be a non-dynamic-sized record, in which the variant
8061 part, if any, is replaced with the appropriate branch. Looks
8062 for discriminant values in DVAL0, which can be NULL if the record
8063 contains the necessary discriminant values. */
8065 static struct type
*
8066 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8067 CORE_ADDR address
, struct value
*dval0
)
8069 struct value
*mark
= value_mark ();
8072 struct type
*branch_type
;
8073 int nfields
= type
->num_fields ();
8074 int variant_field
= variant_field_index (type
);
8076 if (variant_field
== -1)
8081 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8082 type
= value_type (dval
);
8087 rtype
= alloc_type_copy (type
);
8088 rtype
->set_code (TYPE_CODE_STRUCT
);
8089 INIT_NONE_SPECIFIC (rtype
);
8090 rtype
->set_num_fields (nfields
);
8093 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8094 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
8095 rtype
->set_fields (fields
);
8097 rtype
->set_name (ada_type_name (type
));
8098 rtype
->set_is_fixed_instance (true);
8099 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8101 branch_type
= to_fixed_variant_branch_type
8102 (type
->field (variant_field
).type (),
8103 cond_offset_host (valaddr
,
8104 TYPE_FIELD_BITPOS (type
, variant_field
)
8106 cond_offset_target (address
,
8107 TYPE_FIELD_BITPOS (type
, variant_field
)
8108 / TARGET_CHAR_BIT
), dval
);
8109 if (branch_type
== NULL
)
8113 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8114 rtype
->field (f
- 1) = rtype
->field (f
);
8115 rtype
->set_num_fields (rtype
->num_fields () - 1);
8119 rtype
->field (variant_field
).set_type (branch_type
);
8120 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8121 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8122 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8124 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (type
->field (variant_field
).type ());
8126 value_free_to_mark (mark
);
8130 /* An ordinary record type (with fixed-length fields) that describes
8131 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8132 beginning of this section]. Any necessary discriminants' values
8133 should be in DVAL, a record value; it may be NULL if the object
8134 at ADDR itself contains any necessary discriminant values.
8135 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8136 values from the record are needed. Except in the case that DVAL,
8137 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8138 unchecked) is replaced by a particular branch of the variant.
8140 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8141 is questionable and may be removed. It can arise during the
8142 processing of an unconstrained-array-of-record type where all the
8143 variant branches have exactly the same size. This is because in
8144 such cases, the compiler does not bother to use the XVS convention
8145 when encoding the record. I am currently dubious of this
8146 shortcut and suspect the compiler should be altered. FIXME. */
8148 static struct type
*
8149 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8150 CORE_ADDR address
, struct value
*dval
)
8152 struct type
*templ_type
;
8154 if (type0
->is_fixed_instance ())
8157 templ_type
= dynamic_template_type (type0
);
8159 if (templ_type
!= NULL
)
8160 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8161 else if (variant_field_index (type0
) >= 0)
8163 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8165 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8170 type0
->set_is_fixed_instance (true);
8176 /* An ordinary record type (with fixed-length fields) that describes
8177 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8178 union type. Any necessary discriminants' values should be in DVAL,
8179 a record value. That is, this routine selects the appropriate
8180 branch of the union at ADDR according to the discriminant value
8181 indicated in the union's type name. Returns VAR_TYPE0 itself if
8182 it represents a variant subject to a pragma Unchecked_Union. */
8184 static struct type
*
8185 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8186 CORE_ADDR address
, struct value
*dval
)
8189 struct type
*templ_type
;
8190 struct type
*var_type
;
8192 if (var_type0
->code () == TYPE_CODE_PTR
)
8193 var_type
= TYPE_TARGET_TYPE (var_type0
);
8195 var_type
= var_type0
;
8197 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8199 if (templ_type
!= NULL
)
8200 var_type
= templ_type
;
8202 if (is_unchecked_variant (var_type
, value_type (dval
)))
8204 which
= ada_which_variant_applies (var_type
, dval
);
8207 return empty_record (var_type
);
8208 else if (is_dynamic_field (var_type
, which
))
8209 return to_fixed_record_type
8210 (TYPE_TARGET_TYPE (var_type
->field (which
).type ()),
8211 valaddr
, address
, dval
);
8212 else if (variant_field_index (var_type
->field (which
).type ()) >= 0)
8214 to_fixed_record_type
8215 (var_type
->field (which
).type (), valaddr
, address
, dval
);
8217 return var_type
->field (which
).type ();
8220 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8221 ENCODING_TYPE, a type following the GNAT conventions for discrete
8222 type encodings, only carries redundant information. */
8225 ada_is_redundant_range_encoding (struct type
*range_type
,
8226 struct type
*encoding_type
)
8228 const char *bounds_str
;
8232 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8234 if (get_base_type (range_type
)->code ()
8235 != get_base_type (encoding_type
)->code ())
8237 /* The compiler probably used a simple base type to describe
8238 the range type instead of the range's actual base type,
8239 expecting us to get the real base type from the encoding
8240 anyway. In this situation, the encoding cannot be ignored
8245 if (is_dynamic_type (range_type
))
8248 if (encoding_type
->name () == NULL
)
8251 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8252 if (bounds_str
== NULL
)
8255 n
= 8; /* Skip "___XDLU_". */
8256 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8258 if (range_type
->bounds ()->low
.const_val () != lo
)
8261 n
+= 2; /* Skip the "__" separator between the two bounds. */
8262 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8264 if (range_type
->bounds ()->high
.const_val () != hi
)
8270 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8271 a type following the GNAT encoding for describing array type
8272 indices, only carries redundant information. */
8275 ada_is_redundant_index_type_desc (struct type
*array_type
,
8276 struct type
*desc_type
)
8278 struct type
*this_layer
= check_typedef (array_type
);
8281 for (i
= 0; i
< desc_type
->num_fields (); i
++)
8283 if (!ada_is_redundant_range_encoding (this_layer
->index_type (),
8284 desc_type
->field (i
).type ()))
8286 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8292 /* Assuming that TYPE0 is an array type describing the type of a value
8293 at ADDR, and that DVAL describes a record containing any
8294 discriminants used in TYPE0, returns a type for the value that
8295 contains no dynamic components (that is, no components whose sizes
8296 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8297 true, gives an error message if the resulting type's size is over
8300 static struct type
*
8301 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8304 struct type
*index_type_desc
;
8305 struct type
*result
;
8306 int constrained_packed_array_p
;
8307 static const char *xa_suffix
= "___XA";
8309 type0
= ada_check_typedef (type0
);
8310 if (type0
->is_fixed_instance ())
8313 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8314 if (constrained_packed_array_p
)
8316 type0
= decode_constrained_packed_array_type (type0
);
8317 if (type0
== nullptr)
8318 error (_("could not decode constrained packed array type"));
8321 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8323 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8324 encoding suffixed with 'P' may still be generated. If so,
8325 it should be used to find the XA type. */
8327 if (index_type_desc
== NULL
)
8329 const char *type_name
= ada_type_name (type0
);
8331 if (type_name
!= NULL
)
8333 const int len
= strlen (type_name
);
8334 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8336 if (type_name
[len
- 1] == 'P')
8338 strcpy (name
, type_name
);
8339 strcpy (name
+ len
- 1, xa_suffix
);
8340 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8345 ada_fixup_array_indexes_type (index_type_desc
);
8346 if (index_type_desc
!= NULL
8347 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8349 /* Ignore this ___XA parallel type, as it does not bring any
8350 useful information. This allows us to avoid creating fixed
8351 versions of the array's index types, which would be identical
8352 to the original ones. This, in turn, can also help avoid
8353 the creation of fixed versions of the array itself. */
8354 index_type_desc
= NULL
;
8357 if (index_type_desc
== NULL
)
8359 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8361 /* NOTE: elt_type---the fixed version of elt_type0---should never
8362 depend on the contents of the array in properly constructed
8364 /* Create a fixed version of the array element type.
8365 We're not providing the address of an element here,
8366 and thus the actual object value cannot be inspected to do
8367 the conversion. This should not be a problem, since arrays of
8368 unconstrained objects are not allowed. In particular, all
8369 the elements of an array of a tagged type should all be of
8370 the same type specified in the debugging info. No need to
8371 consult the object tag. */
8372 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8374 /* Make sure we always create a new array type when dealing with
8375 packed array types, since we're going to fix-up the array
8376 type length and element bitsize a little further down. */
8377 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8380 result
= create_array_type (alloc_type_copy (type0
),
8381 elt_type
, type0
->index_type ());
8386 struct type
*elt_type0
;
8389 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8390 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8392 /* NOTE: result---the fixed version of elt_type0---should never
8393 depend on the contents of the array in properly constructed
8395 /* Create a fixed version of the array element type.
8396 We're not providing the address of an element here,
8397 and thus the actual object value cannot be inspected to do
8398 the conversion. This should not be a problem, since arrays of
8399 unconstrained objects are not allowed. In particular, all
8400 the elements of an array of a tagged type should all be of
8401 the same type specified in the debugging info. No need to
8402 consult the object tag. */
8404 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8407 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8409 struct type
*range_type
=
8410 to_fixed_range_type (index_type_desc
->field (i
).type (), dval
);
8412 result
= create_array_type (alloc_type_copy (elt_type0
),
8413 result
, range_type
);
8414 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8416 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8417 error (_("array type with dynamic size is larger than varsize-limit"));
8420 /* We want to preserve the type name. This can be useful when
8421 trying to get the type name of a value that has already been
8422 printed (for instance, if the user did "print VAR; whatis $". */
8423 result
->set_name (type0
->name ());
8425 if (constrained_packed_array_p
)
8427 /* So far, the resulting type has been created as if the original
8428 type was a regular (non-packed) array type. As a result, the
8429 bitsize of the array elements needs to be set again, and the array
8430 length needs to be recomputed based on that bitsize. */
8431 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8432 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8434 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8435 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8436 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8437 TYPE_LENGTH (result
)++;
8440 result
->set_is_fixed_instance (true);
8445 /* A standard type (containing no dynamically sized components)
8446 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8447 DVAL describes a record containing any discriminants used in TYPE0,
8448 and may be NULL if there are none, or if the object of type TYPE at
8449 ADDRESS or in VALADDR contains these discriminants.
8451 If CHECK_TAG is not null, in the case of tagged types, this function
8452 attempts to locate the object's tag and use it to compute the actual
8453 type. However, when ADDRESS is null, we cannot use it to determine the
8454 location of the tag, and therefore compute the tagged type's actual type.
8455 So we return the tagged type without consulting the tag. */
8457 static struct type
*
8458 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8459 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8461 type
= ada_check_typedef (type
);
8463 /* Only un-fixed types need to be handled here. */
8464 if (!HAVE_GNAT_AUX_INFO (type
))
8467 switch (type
->code ())
8471 case TYPE_CODE_STRUCT
:
8473 struct type
*static_type
= to_static_fixed_type (type
);
8474 struct type
*fixed_record_type
=
8475 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8477 /* If STATIC_TYPE is a tagged type and we know the object's address,
8478 then we can determine its tag, and compute the object's actual
8479 type from there. Note that we have to use the fixed record
8480 type (the parent part of the record may have dynamic fields
8481 and the way the location of _tag is expressed may depend on
8484 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8487 value_tag_from_contents_and_address
8491 struct type
*real_type
= type_from_tag (tag
);
8493 value_from_contents_and_address (fixed_record_type
,
8496 fixed_record_type
= value_type (obj
);
8497 if (real_type
!= NULL
)
8498 return to_fixed_record_type
8500 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8503 /* Check to see if there is a parallel ___XVZ variable.
8504 If there is, then it provides the actual size of our type. */
8505 else if (ada_type_name (fixed_record_type
) != NULL
)
8507 const char *name
= ada_type_name (fixed_record_type
);
8509 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8510 bool xvz_found
= false;
8513 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8516 xvz_found
= get_int_var_value (xvz_name
, size
);
8518 catch (const gdb_exception_error
&except
)
8520 /* We found the variable, but somehow failed to read
8521 its value. Rethrow the same error, but with a little
8522 bit more information, to help the user understand
8523 what went wrong (Eg: the variable might have been
8525 throw_error (except
.error
,
8526 _("unable to read value of %s (%s)"),
8527 xvz_name
, except
.what ());
8530 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8532 fixed_record_type
= copy_type (fixed_record_type
);
8533 TYPE_LENGTH (fixed_record_type
) = size
;
8535 /* The FIXED_RECORD_TYPE may have be a stub. We have
8536 observed this when the debugging info is STABS, and
8537 apparently it is something that is hard to fix.
8539 In practice, we don't need the actual type definition
8540 at all, because the presence of the XVZ variable allows us
8541 to assume that there must be a XVS type as well, which we
8542 should be able to use later, when we need the actual type
8545 In the meantime, pretend that the "fixed" type we are
8546 returning is NOT a stub, because this can cause trouble
8547 when using this type to create new types targeting it.
8548 Indeed, the associated creation routines often check
8549 whether the target type is a stub and will try to replace
8550 it, thus using a type with the wrong size. This, in turn,
8551 might cause the new type to have the wrong size too.
8552 Consider the case of an array, for instance, where the size
8553 of the array is computed from the number of elements in
8554 our array multiplied by the size of its element. */
8555 fixed_record_type
->set_is_stub (false);
8558 return fixed_record_type
;
8560 case TYPE_CODE_ARRAY
:
8561 return to_fixed_array_type (type
, dval
, 1);
8562 case TYPE_CODE_UNION
:
8566 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8570 /* The same as ada_to_fixed_type_1, except that it preserves the type
8571 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8573 The typedef layer needs be preserved in order to differentiate between
8574 arrays and array pointers when both types are implemented using the same
8575 fat pointer. In the array pointer case, the pointer is encoded as
8576 a typedef of the pointer type. For instance, considering:
8578 type String_Access is access String;
8579 S1 : String_Access := null;
8581 To the debugger, S1 is defined as a typedef of type String. But
8582 to the user, it is a pointer. So if the user tries to print S1,
8583 we should not dereference the array, but print the array address
8586 If we didn't preserve the typedef layer, we would lose the fact that
8587 the type is to be presented as a pointer (needs de-reference before
8588 being printed). And we would also use the source-level type name. */
8591 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8592 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8595 struct type
*fixed_type
=
8596 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8598 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8599 then preserve the typedef layer.
8601 Implementation note: We can only check the main-type portion of
8602 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8603 from TYPE now returns a type that has the same instance flags
8604 as TYPE. For instance, if TYPE is a "typedef const", and its
8605 target type is a "struct", then the typedef elimination will return
8606 a "const" version of the target type. See check_typedef for more
8607 details about how the typedef layer elimination is done.
8609 brobecker/2010-11-19: It seems to me that the only case where it is
8610 useful to preserve the typedef layer is when dealing with fat pointers.
8611 Perhaps, we could add a check for that and preserve the typedef layer
8612 only in that situation. But this seems unnecessary so far, probably
8613 because we call check_typedef/ada_check_typedef pretty much everywhere.
8615 if (type
->code () == TYPE_CODE_TYPEDEF
8616 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8617 == TYPE_MAIN_TYPE (fixed_type
)))
8623 /* A standard (static-sized) type corresponding as well as possible to
8624 TYPE0, but based on no runtime data. */
8626 static struct type
*
8627 to_static_fixed_type (struct type
*type0
)
8634 if (type0
->is_fixed_instance ())
8637 type0
= ada_check_typedef (type0
);
8639 switch (type0
->code ())
8643 case TYPE_CODE_STRUCT
:
8644 type
= dynamic_template_type (type0
);
8646 return template_to_static_fixed_type (type
);
8648 return template_to_static_fixed_type (type0
);
8649 case TYPE_CODE_UNION
:
8650 type
= ada_find_parallel_type (type0
, "___XVU");
8652 return template_to_static_fixed_type (type
);
8654 return template_to_static_fixed_type (type0
);
8658 /* A static approximation of TYPE with all type wrappers removed. */
8660 static struct type
*
8661 static_unwrap_type (struct type
*type
)
8663 if (ada_is_aligner_type (type
))
8665 struct type
*type1
= ada_check_typedef (type
)->field (0).type ();
8666 if (ada_type_name (type1
) == NULL
)
8667 type1
->set_name (ada_type_name (type
));
8669 return static_unwrap_type (type1
);
8673 struct type
*raw_real_type
= ada_get_base_type (type
);
8675 if (raw_real_type
== type
)
8678 return to_static_fixed_type (raw_real_type
);
8682 /* In some cases, incomplete and private types require
8683 cross-references that are not resolved as records (for example,
8685 type FooP is access Foo;
8687 type Foo is array ...;
8688 ). In these cases, since there is no mechanism for producing
8689 cross-references to such types, we instead substitute for FooP a
8690 stub enumeration type that is nowhere resolved, and whose tag is
8691 the name of the actual type. Call these types "non-record stubs". */
8693 /* A type equivalent to TYPE that is not a non-record stub, if one
8694 exists, otherwise TYPE. */
8697 ada_check_typedef (struct type
*type
)
8702 /* If our type is an access to an unconstrained array, which is encoded
8703 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
8704 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8705 what allows us to distinguish between fat pointers that represent
8706 array types, and fat pointers that represent array access types
8707 (in both cases, the compiler implements them as fat pointers). */
8708 if (ada_is_access_to_unconstrained_array (type
))
8711 type
= check_typedef (type
);
8712 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
8713 || !type
->is_stub ()
8714 || type
->name () == NULL
)
8718 const char *name
= type
->name ();
8719 struct type
*type1
= ada_find_any_type (name
);
8724 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8725 stubs pointing to arrays, as we don't create symbols for array
8726 types, only for the typedef-to-array types). If that's the case,
8727 strip the typedef layer. */
8728 if (type1
->code () == TYPE_CODE_TYPEDEF
)
8729 type1
= ada_check_typedef (type1
);
8735 /* A value representing the data at VALADDR/ADDRESS as described by
8736 type TYPE0, but with a standard (static-sized) type that correctly
8737 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8738 type, then return VAL0 [this feature is simply to avoid redundant
8739 creation of struct values]. */
8741 static struct value
*
8742 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8745 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8747 if (type
== type0
&& val0
!= NULL
)
8750 if (VALUE_LVAL (val0
) != lval_memory
)
8752 /* Our value does not live in memory; it could be a convenience
8753 variable, for instance. Create a not_lval value using val0's
8755 return value_from_contents (type
, value_contents (val0
));
8758 return value_from_contents_and_address (type
, 0, address
);
8761 /* A value representing VAL, but with a standard (static-sized) type
8762 that correctly describes it. Does not necessarily create a new
8766 ada_to_fixed_value (struct value
*val
)
8768 val
= unwrap_value (val
);
8769 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
8776 /* Table mapping attribute numbers to names.
8777 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8779 static const char * const attribute_names
[] = {
8797 ada_attribute_name (enum exp_opcode n
)
8799 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8800 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8802 return attribute_names
[0];
8805 /* Evaluate the 'POS attribute applied to ARG. */
8808 pos_atr (struct value
*arg
)
8810 struct value
*val
= coerce_ref (arg
);
8811 struct type
*type
= value_type (val
);
8813 if (!discrete_type_p (type
))
8814 error (_("'POS only defined on discrete types"));
8816 gdb::optional
<LONGEST
> result
= discrete_position (type
, value_as_long (val
));
8817 if (!result
.has_value ())
8818 error (_("enumeration value is invalid: can't find 'POS"));
8823 static struct value
*
8824 value_pos_atr (struct type
*type
, struct value
*arg
)
8826 return value_from_longest (type
, pos_atr (arg
));
8829 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8831 static struct value
*
8832 val_atr (struct type
*type
, LONGEST val
)
8834 gdb_assert (discrete_type_p (type
));
8835 if (type
->code () == TYPE_CODE_RANGE
)
8836 type
= TYPE_TARGET_TYPE (type
);
8837 if (type
->code () == TYPE_CODE_ENUM
)
8839 if (val
< 0 || val
>= type
->num_fields ())
8840 error (_("argument to 'VAL out of range"));
8841 val
= TYPE_FIELD_ENUMVAL (type
, val
);
8843 return value_from_longest (type
, val
);
8846 static struct value
*
8847 ada_val_atr (enum noside noside
, struct type
*type
, struct value
*arg
)
8849 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8850 return value_zero (type
, not_lval
);
8852 if (!discrete_type_p (type
))
8853 error (_("'VAL only defined on discrete types"));
8854 if (!integer_type_p (value_type (arg
)))
8855 error (_("'VAL requires integral argument"));
8857 return val_atr (type
, value_as_long (arg
));
8863 /* True if TYPE appears to be an Ada character type.
8864 [At the moment, this is true only for Character and Wide_Character;
8865 It is a heuristic test that could stand improvement]. */
8868 ada_is_character_type (struct type
*type
)
8872 /* If the type code says it's a character, then assume it really is,
8873 and don't check any further. */
8874 if (type
->code () == TYPE_CODE_CHAR
)
8877 /* Otherwise, assume it's a character type iff it is a discrete type
8878 with a known character type name. */
8879 name
= ada_type_name (type
);
8880 return (name
!= NULL
8881 && (type
->code () == TYPE_CODE_INT
8882 || type
->code () == TYPE_CODE_RANGE
)
8883 && (strcmp (name
, "character") == 0
8884 || strcmp (name
, "wide_character") == 0
8885 || strcmp (name
, "wide_wide_character") == 0
8886 || strcmp (name
, "unsigned char") == 0));
8889 /* True if TYPE appears to be an Ada string type. */
8892 ada_is_string_type (struct type
*type
)
8894 type
= ada_check_typedef (type
);
8896 && type
->code () != TYPE_CODE_PTR
8897 && (ada_is_simple_array_type (type
)
8898 || ada_is_array_descriptor_type (type
))
8899 && ada_array_arity (type
) == 1)
8901 struct type
*elttype
= ada_array_element_type (type
, 1);
8903 return ada_is_character_type (elttype
);
8909 /* The compiler sometimes provides a parallel XVS type for a given
8910 PAD type. Normally, it is safe to follow the PAD type directly,
8911 but older versions of the compiler have a bug that causes the offset
8912 of its "F" field to be wrong. Following that field in that case
8913 would lead to incorrect results, but this can be worked around
8914 by ignoring the PAD type and using the associated XVS type instead.
8916 Set to True if the debugger should trust the contents of PAD types.
8917 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8918 static bool trust_pad_over_xvs
= true;
8920 /* True if TYPE is a struct type introduced by the compiler to force the
8921 alignment of a value. Such types have a single field with a
8922 distinctive name. */
8925 ada_is_aligner_type (struct type
*type
)
8927 type
= ada_check_typedef (type
);
8929 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8932 return (type
->code () == TYPE_CODE_STRUCT
8933 && type
->num_fields () == 1
8934 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8937 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8938 the parallel type. */
8941 ada_get_base_type (struct type
*raw_type
)
8943 struct type
*real_type_namer
;
8944 struct type
*raw_real_type
;
8946 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
8949 if (ada_is_aligner_type (raw_type
))
8950 /* The encoding specifies that we should always use the aligner type.
8951 So, even if this aligner type has an associated XVS type, we should
8954 According to the compiler gurus, an XVS type parallel to an aligner
8955 type may exist because of a stabs limitation. In stabs, aligner
8956 types are empty because the field has a variable-sized type, and
8957 thus cannot actually be used as an aligner type. As a result,
8958 we need the associated parallel XVS type to decode the type.
8959 Since the policy in the compiler is to not change the internal
8960 representation based on the debugging info format, we sometimes
8961 end up having a redundant XVS type parallel to the aligner type. */
8964 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8965 if (real_type_namer
== NULL
8966 || real_type_namer
->code () != TYPE_CODE_STRUCT
8967 || real_type_namer
->num_fields () != 1)
8970 if (real_type_namer
->field (0).type ()->code () != TYPE_CODE_REF
)
8972 /* This is an older encoding form where the base type needs to be
8973 looked up by name. We prefer the newer encoding because it is
8975 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8976 if (raw_real_type
== NULL
)
8979 return raw_real_type
;
8982 /* The field in our XVS type is a reference to the base type. */
8983 return TYPE_TARGET_TYPE (real_type_namer
->field (0).type ());
8986 /* The type of value designated by TYPE, with all aligners removed. */
8989 ada_aligned_type (struct type
*type
)
8991 if (ada_is_aligner_type (type
))
8992 return ada_aligned_type (type
->field (0).type ());
8994 return ada_get_base_type (type
);
8998 /* The address of the aligned value in an object at address VALADDR
8999 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9002 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9004 if (ada_is_aligner_type (type
))
9005 return ada_aligned_value_addr (type
->field (0).type (),
9007 TYPE_FIELD_BITPOS (type
,
9008 0) / TARGET_CHAR_BIT
);
9015 /* The printed representation of an enumeration literal with encoded
9016 name NAME. The value is good to the next call of ada_enum_name. */
9018 ada_enum_name (const char *name
)
9020 static std::string storage
;
9023 /* First, unqualify the enumeration name:
9024 1. Search for the last '.' character. If we find one, then skip
9025 all the preceding characters, the unqualified name starts
9026 right after that dot.
9027 2. Otherwise, we may be debugging on a target where the compiler
9028 translates dots into "__". Search forward for double underscores,
9029 but stop searching when we hit an overloading suffix, which is
9030 of the form "__" followed by digits. */
9032 tmp
= strrchr (name
, '.');
9037 while ((tmp
= strstr (name
, "__")) != NULL
)
9039 if (isdigit (tmp
[2]))
9050 if (name
[1] == 'U' || name
[1] == 'W')
9052 if (sscanf (name
+ 2, "%x", &v
) != 1)
9055 else if (((name
[1] >= '0' && name
[1] <= '9')
9056 || (name
[1] >= 'a' && name
[1] <= 'z'))
9059 storage
= string_printf ("'%c'", name
[1]);
9060 return storage
.c_str ();
9065 if (isascii (v
) && isprint (v
))
9066 storage
= string_printf ("'%c'", v
);
9067 else if (name
[1] == 'U')
9068 storage
= string_printf ("[\"%02x\"]", v
);
9070 storage
= string_printf ("[\"%04x\"]", v
);
9072 return storage
.c_str ();
9076 tmp
= strstr (name
, "__");
9078 tmp
= strstr (name
, "$");
9081 storage
= std::string (name
, tmp
- name
);
9082 return storage
.c_str ();
9089 /* Evaluate the subexpression of EXP starting at *POS as for
9090 evaluate_type, updating *POS to point just past the evaluated
9093 static struct value
*
9094 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9096 return evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9099 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9102 static struct value
*
9103 unwrap_value (struct value
*val
)
9105 struct type
*type
= ada_check_typedef (value_type (val
));
9107 if (ada_is_aligner_type (type
))
9109 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9110 struct type
*val_type
= ada_check_typedef (value_type (v
));
9112 if (ada_type_name (val_type
) == NULL
)
9113 val_type
->set_name (ada_type_name (type
));
9115 return unwrap_value (v
);
9119 struct type
*raw_real_type
=
9120 ada_check_typedef (ada_get_base_type (type
));
9122 /* If there is no parallel XVS or XVE type, then the value is
9123 already unwrapped. Return it without further modification. */
9124 if ((type
== raw_real_type
)
9125 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9129 coerce_unspec_val_to_type
9130 (val
, ada_to_fixed_type (raw_real_type
, 0,
9131 value_address (val
),
9136 /* Given two array types T1 and T2, return nonzero iff both arrays
9137 contain the same number of elements. */
9140 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9142 LONGEST lo1
, hi1
, lo2
, hi2
;
9144 /* Get the array bounds in order to verify that the size of
9145 the two arrays match. */
9146 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9147 || !get_array_bounds (t2
, &lo2
, &hi2
))
9148 error (_("unable to determine array bounds"));
9150 /* To make things easier for size comparison, normalize a bit
9151 the case of empty arrays by making sure that the difference
9152 between upper bound and lower bound is always -1. */
9158 return (hi1
- lo1
== hi2
- lo2
);
9161 /* Assuming that VAL is an array of integrals, and TYPE represents
9162 an array with the same number of elements, but with wider integral
9163 elements, return an array "casted" to TYPE. In practice, this
9164 means that the returned array is built by casting each element
9165 of the original array into TYPE's (wider) element type. */
9167 static struct value
*
9168 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9170 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9175 /* Verify that both val and type are arrays of scalars, and
9176 that the size of val's elements is smaller than the size
9177 of type's element. */
9178 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9179 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9180 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9181 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9182 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9183 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9185 if (!get_array_bounds (type
, &lo
, &hi
))
9186 error (_("unable to determine array bounds"));
9188 res
= allocate_value (type
);
9190 /* Promote each array element. */
9191 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9193 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9195 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9196 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9202 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9203 return the converted value. */
9205 static struct value
*
9206 coerce_for_assign (struct type
*type
, struct value
*val
)
9208 struct type
*type2
= value_type (val
);
9213 type2
= ada_check_typedef (type2
);
9214 type
= ada_check_typedef (type
);
9216 if (type2
->code () == TYPE_CODE_PTR
9217 && type
->code () == TYPE_CODE_ARRAY
)
9219 val
= ada_value_ind (val
);
9220 type2
= value_type (val
);
9223 if (type2
->code () == TYPE_CODE_ARRAY
9224 && type
->code () == TYPE_CODE_ARRAY
)
9226 if (!ada_same_array_size_p (type
, type2
))
9227 error (_("cannot assign arrays of different length"));
9229 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9230 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9231 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9232 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9234 /* Allow implicit promotion of the array elements to
9236 return ada_promote_array_of_integrals (type
, val
);
9239 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9240 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9241 error (_("Incompatible types in assignment"));
9242 deprecated_set_value_type (val
, type
);
9247 static struct value
*
9248 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9251 struct type
*type1
, *type2
;
9254 arg1
= coerce_ref (arg1
);
9255 arg2
= coerce_ref (arg2
);
9256 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9257 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9259 if (type1
->code () != TYPE_CODE_INT
9260 || type2
->code () != TYPE_CODE_INT
)
9261 return value_binop (arg1
, arg2
, op
);
9270 return value_binop (arg1
, arg2
, op
);
9273 v2
= value_as_long (arg2
);
9275 error (_("second operand of %s must not be zero."), op_string (op
));
9277 if (type1
->is_unsigned () || op
== BINOP_MOD
)
9278 return value_binop (arg1
, arg2
, op
);
9280 v1
= value_as_long (arg1
);
9285 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9286 v
+= v
> 0 ? -1 : 1;
9294 /* Should not reach this point. */
9298 val
= allocate_value (type1
);
9299 store_unsigned_integer (value_contents_raw (val
),
9300 TYPE_LENGTH (value_type (val
)),
9301 type_byte_order (type1
), v
);
9306 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9308 if (ada_is_direct_array_type (value_type (arg1
))
9309 || ada_is_direct_array_type (value_type (arg2
)))
9311 struct type
*arg1_type
, *arg2_type
;
9313 /* Automatically dereference any array reference before
9314 we attempt to perform the comparison. */
9315 arg1
= ada_coerce_ref (arg1
);
9316 arg2
= ada_coerce_ref (arg2
);
9318 arg1
= ada_coerce_to_simple_array (arg1
);
9319 arg2
= ada_coerce_to_simple_array (arg2
);
9321 arg1_type
= ada_check_typedef (value_type (arg1
));
9322 arg2_type
= ada_check_typedef (value_type (arg2
));
9324 if (arg1_type
->code () != TYPE_CODE_ARRAY
9325 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9326 error (_("Attempt to compare array with non-array"));
9327 /* FIXME: The following works only for types whose
9328 representations use all bits (no padding or undefined bits)
9329 and do not have user-defined equality. */
9330 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9331 && memcmp (value_contents (arg1
), value_contents (arg2
),
9332 TYPE_LENGTH (arg1_type
)) == 0);
9334 return value_equal (arg1
, arg2
);
9337 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9338 component of LHS (a simple array or a record), updating *POS past
9339 the expression, assuming that LHS is contained in CONTAINER. Does
9340 not modify the inferior's memory, nor does it modify LHS (unless
9341 LHS == CONTAINER). */
9344 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9345 struct expression
*exp
, int *pos
)
9347 struct value
*mark
= value_mark ();
9349 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9351 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9353 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9354 struct value
*index_val
= value_from_longest (index_type
, index
);
9356 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9360 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9361 elt
= ada_to_fixed_value (elt
);
9364 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9365 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9367 value_assign_to_component (container
, elt
,
9368 ada_evaluate_subexp (NULL
, exp
, pos
,
9371 value_free_to_mark (mark
);
9374 /* Assuming that LHS represents an lvalue having a record or array
9375 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9376 of that aggregate's value to LHS, advancing *POS past the
9377 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9378 lvalue containing LHS (possibly LHS itself). Does not modify
9379 the inferior's memory, nor does it modify the contents of
9380 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9382 static struct value
*
9383 assign_aggregate (struct value
*container
,
9384 struct value
*lhs
, struct expression
*exp
,
9385 int *pos
, enum noside noside
)
9387 struct type
*lhs_type
;
9388 int n
= exp
->elts
[*pos
+1].longconst
;
9389 LONGEST low_index
, high_index
;
9393 if (noside
!= EVAL_NORMAL
)
9395 for (i
= 0; i
< n
; i
+= 1)
9396 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9400 container
= ada_coerce_ref (container
);
9401 if (ada_is_direct_array_type (value_type (container
)))
9402 container
= ada_coerce_to_simple_array (container
);
9403 lhs
= ada_coerce_ref (lhs
);
9404 if (!deprecated_value_modifiable (lhs
))
9405 error (_("Left operand of assignment is not a modifiable lvalue."));
9407 lhs_type
= check_typedef (value_type (lhs
));
9408 if (ada_is_direct_array_type (lhs_type
))
9410 lhs
= ada_coerce_to_simple_array (lhs
);
9411 lhs_type
= check_typedef (value_type (lhs
));
9412 low_index
= lhs_type
->bounds ()->low
.const_val ();
9413 high_index
= lhs_type
->bounds ()->high
.const_val ();
9415 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9418 high_index
= num_visible_fields (lhs_type
) - 1;
9421 error (_("Left-hand side must be array or record."));
9423 std::vector
<LONGEST
> indices (4);
9424 indices
[0] = indices
[1] = low_index
- 1;
9425 indices
[2] = indices
[3] = high_index
+ 1;
9427 for (i
= 0; i
< n
; i
+= 1)
9429 switch (exp
->elts
[*pos
].opcode
)
9432 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9433 low_index
, high_index
);
9436 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9437 low_index
, high_index
);
9441 error (_("Misplaced 'others' clause"));
9442 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9443 low_index
, high_index
);
9446 error (_("Internal error: bad aggregate clause"));
9453 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9454 construct at *POS, updating *POS past the construct, given that
9455 the positions are relative to lower bound LOW, where HIGH is the
9456 upper bound. Record the position in INDICES. CONTAINER is as for
9457 assign_aggregate. */
9459 aggregate_assign_positional (struct value
*container
,
9460 struct value
*lhs
, struct expression
*exp
,
9461 int *pos
, std::vector
<LONGEST
> &indices
,
9462 LONGEST low
, LONGEST high
)
9464 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9466 if (ind
- 1 == high
)
9467 warning (_("Extra components in aggregate ignored."));
9470 add_component_interval (ind
, ind
, indices
);
9472 assign_component (container
, lhs
, ind
, exp
, pos
);
9475 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9478 /* Assign into the components of LHS indexed by the OP_CHOICES
9479 construct at *POS, updating *POS past the construct, given that
9480 the allowable indices are LOW..HIGH. Record the indices assigned
9481 to in INDICES. CONTAINER is as for assign_aggregate. */
9483 aggregate_assign_from_choices (struct value
*container
,
9484 struct value
*lhs
, struct expression
*exp
,
9485 int *pos
, std::vector
<LONGEST
> &indices
,
9486 LONGEST low
, LONGEST high
)
9489 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9490 int choice_pos
, expr_pc
;
9491 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9493 choice_pos
= *pos
+= 3;
9495 for (j
= 0; j
< n_choices
; j
+= 1)
9496 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9498 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9500 for (j
= 0; j
< n_choices
; j
+= 1)
9502 LONGEST lower
, upper
;
9503 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9505 if (op
== OP_DISCRETE_RANGE
)
9508 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9510 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9515 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9527 name
= &exp
->elts
[choice_pos
+ 2].string
;
9530 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9533 error (_("Invalid record component association."));
9535 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9537 if (! find_struct_field (name
, value_type (lhs
), 0,
9538 NULL
, NULL
, NULL
, NULL
, &ind
))
9539 error (_("Unknown component name: %s."), name
);
9540 lower
= upper
= ind
;
9543 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9544 error (_("Index in component association out of bounds."));
9546 add_component_interval (lower
, upper
, indices
);
9547 while (lower
<= upper
)
9552 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9558 /* Assign the value of the expression in the OP_OTHERS construct in
9559 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9560 have not been previously assigned. The index intervals already assigned
9561 are in INDICES. Updates *POS to after the OP_OTHERS clause.
9562 CONTAINER is as for assign_aggregate. */
9564 aggregate_assign_others (struct value
*container
,
9565 struct value
*lhs
, struct expression
*exp
,
9566 int *pos
, std::vector
<LONGEST
> &indices
,
9567 LONGEST low
, LONGEST high
)
9570 int expr_pc
= *pos
+ 1;
9572 int num_indices
= indices
.size ();
9573 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9577 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9582 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9585 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9588 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9589 [ INDICES[0] .. INDICES[1] ],... The resulting intervals do not
9592 add_component_interval (LONGEST low
, LONGEST high
,
9593 std::vector
<LONGEST
> &indices
)
9597 int size
= indices
.size ();
9598 for (i
= 0; i
< size
; i
+= 2) {
9599 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9603 for (kh
= i
+ 2; kh
< size
; kh
+= 2)
9604 if (high
< indices
[kh
])
9606 if (low
< indices
[i
])
9608 indices
[i
+ 1] = indices
[kh
- 1];
9609 if (high
> indices
[i
+ 1])
9610 indices
[i
+ 1] = high
;
9611 memcpy (indices
.data () + i
+ 2, indices
.data () + kh
, size
- kh
);
9612 indices
.resize (kh
- i
- 2);
9615 else if (high
< indices
[i
])
9619 indices
.resize (indices
.size () + 2);
9620 for (j
= indices
.size () - 1; j
>= i
+ 2; j
-= 1)
9621 indices
[j
] = indices
[j
- 2];
9623 indices
[i
+ 1] = high
;
9626 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9629 static struct value
*
9630 ada_value_cast (struct type
*type
, struct value
*arg2
)
9632 if (type
== ada_check_typedef (value_type (arg2
)))
9635 return value_cast (type
, arg2
);
9638 /* Evaluating Ada expressions, and printing their result.
9639 ------------------------------------------------------
9644 We usually evaluate an Ada expression in order to print its value.
9645 We also evaluate an expression in order to print its type, which
9646 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9647 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9648 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9649 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9652 Evaluating expressions is a little more complicated for Ada entities
9653 than it is for entities in languages such as C. The main reason for
9654 this is that Ada provides types whose definition might be dynamic.
9655 One example of such types is variant records. Or another example
9656 would be an array whose bounds can only be known at run time.
9658 The following description is a general guide as to what should be
9659 done (and what should NOT be done) in order to evaluate an expression
9660 involving such types, and when. This does not cover how the semantic
9661 information is encoded by GNAT as this is covered separatly. For the
9662 document used as the reference for the GNAT encoding, see exp_dbug.ads
9663 in the GNAT sources.
9665 Ideally, we should embed each part of this description next to its
9666 associated code. Unfortunately, the amount of code is so vast right
9667 now that it's hard to see whether the code handling a particular
9668 situation might be duplicated or not. One day, when the code is
9669 cleaned up, this guide might become redundant with the comments
9670 inserted in the code, and we might want to remove it.
9672 2. ``Fixing'' an Entity, the Simple Case:
9673 -----------------------------------------
9675 When evaluating Ada expressions, the tricky issue is that they may
9676 reference entities whose type contents and size are not statically
9677 known. Consider for instance a variant record:
9679 type Rec (Empty : Boolean := True) is record
9682 when False => Value : Integer;
9685 Yes : Rec := (Empty => False, Value => 1);
9686 No : Rec := (empty => True);
9688 The size and contents of that record depends on the value of the
9689 descriminant (Rec.Empty). At this point, neither the debugging
9690 information nor the associated type structure in GDB are able to
9691 express such dynamic types. So what the debugger does is to create
9692 "fixed" versions of the type that applies to the specific object.
9693 We also informally refer to this operation as "fixing" an object,
9694 which means creating its associated fixed type.
9696 Example: when printing the value of variable "Yes" above, its fixed
9697 type would look like this:
9704 On the other hand, if we printed the value of "No", its fixed type
9711 Things become a little more complicated when trying to fix an entity
9712 with a dynamic type that directly contains another dynamic type,
9713 such as an array of variant records, for instance. There are
9714 two possible cases: Arrays, and records.
9716 3. ``Fixing'' Arrays:
9717 ---------------------
9719 The type structure in GDB describes an array in terms of its bounds,
9720 and the type of its elements. By design, all elements in the array
9721 have the same type and we cannot represent an array of variant elements
9722 using the current type structure in GDB. When fixing an array,
9723 we cannot fix the array element, as we would potentially need one
9724 fixed type per element of the array. As a result, the best we can do
9725 when fixing an array is to produce an array whose bounds and size
9726 are correct (allowing us to read it from memory), but without having
9727 touched its element type. Fixing each element will be done later,
9728 when (if) necessary.
9730 Arrays are a little simpler to handle than records, because the same
9731 amount of memory is allocated for each element of the array, even if
9732 the amount of space actually used by each element differs from element
9733 to element. Consider for instance the following array of type Rec:
9735 type Rec_Array is array (1 .. 2) of Rec;
9737 The actual amount of memory occupied by each element might be different
9738 from element to element, depending on the value of their discriminant.
9739 But the amount of space reserved for each element in the array remains
9740 fixed regardless. So we simply need to compute that size using
9741 the debugging information available, from which we can then determine
9742 the array size (we multiply the number of elements of the array by
9743 the size of each element).
9745 The simplest case is when we have an array of a constrained element
9746 type. For instance, consider the following type declarations:
9748 type Bounded_String (Max_Size : Integer) is
9750 Buffer : String (1 .. Max_Size);
9752 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9754 In this case, the compiler describes the array as an array of
9755 variable-size elements (identified by its XVS suffix) for which
9756 the size can be read in the parallel XVZ variable.
9758 In the case of an array of an unconstrained element type, the compiler
9759 wraps the array element inside a private PAD type. This type should not
9760 be shown to the user, and must be "unwrap"'ed before printing. Note
9761 that we also use the adjective "aligner" in our code to designate
9762 these wrapper types.
9764 In some cases, the size allocated for each element is statically
9765 known. In that case, the PAD type already has the correct size,
9766 and the array element should remain unfixed.
9768 But there are cases when this size is not statically known.
9769 For instance, assuming that "Five" is an integer variable:
9771 type Dynamic is array (1 .. Five) of Integer;
9772 type Wrapper (Has_Length : Boolean := False) is record
9775 when True => Length : Integer;
9779 type Wrapper_Array is array (1 .. 2) of Wrapper;
9781 Hello : Wrapper_Array := (others => (Has_Length => True,
9782 Data => (others => 17),
9786 The debugging info would describe variable Hello as being an
9787 array of a PAD type. The size of that PAD type is not statically
9788 known, but can be determined using a parallel XVZ variable.
9789 In that case, a copy of the PAD type with the correct size should
9790 be used for the fixed array.
9792 3. ``Fixing'' record type objects:
9793 ----------------------------------
9795 Things are slightly different from arrays in the case of dynamic
9796 record types. In this case, in order to compute the associated
9797 fixed type, we need to determine the size and offset of each of
9798 its components. This, in turn, requires us to compute the fixed
9799 type of each of these components.
9801 Consider for instance the example:
9803 type Bounded_String (Max_Size : Natural) is record
9804 Str : String (1 .. Max_Size);
9807 My_String : Bounded_String (Max_Size => 10);
9809 In that case, the position of field "Length" depends on the size
9810 of field Str, which itself depends on the value of the Max_Size
9811 discriminant. In order to fix the type of variable My_String,
9812 we need to fix the type of field Str. Therefore, fixing a variant
9813 record requires us to fix each of its components.
9815 However, if a component does not have a dynamic size, the component
9816 should not be fixed. In particular, fields that use a PAD type
9817 should not fixed. Here is an example where this might happen
9818 (assuming type Rec above):
9820 type Container (Big : Boolean) is record
9824 when True => Another : Integer;
9828 My_Container : Container := (Big => False,
9829 First => (Empty => True),
9832 In that example, the compiler creates a PAD type for component First,
9833 whose size is constant, and then positions the component After just
9834 right after it. The offset of component After is therefore constant
9837 The debugger computes the position of each field based on an algorithm
9838 that uses, among other things, the actual position and size of the field
9839 preceding it. Let's now imagine that the user is trying to print
9840 the value of My_Container. If the type fixing was recursive, we would
9841 end up computing the offset of field After based on the size of the
9842 fixed version of field First. And since in our example First has
9843 only one actual field, the size of the fixed type is actually smaller
9844 than the amount of space allocated to that field, and thus we would
9845 compute the wrong offset of field After.
9847 To make things more complicated, we need to watch out for dynamic
9848 components of variant records (identified by the ___XVL suffix in
9849 the component name). Even if the target type is a PAD type, the size
9850 of that type might not be statically known. So the PAD type needs
9851 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9852 we might end up with the wrong size for our component. This can be
9853 observed with the following type declarations:
9855 type Octal is new Integer range 0 .. 7;
9856 type Octal_Array is array (Positive range <>) of Octal;
9857 pragma Pack (Octal_Array);
9859 type Octal_Buffer (Size : Positive) is record
9860 Buffer : Octal_Array (1 .. Size);
9864 In that case, Buffer is a PAD type whose size is unset and needs
9865 to be computed by fixing the unwrapped type.
9867 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9868 ----------------------------------------------------------
9870 Lastly, when should the sub-elements of an entity that remained unfixed
9871 thus far, be actually fixed?
9873 The answer is: Only when referencing that element. For instance
9874 when selecting one component of a record, this specific component
9875 should be fixed at that point in time. Or when printing the value
9876 of a record, each component should be fixed before its value gets
9877 printed. Similarly for arrays, the element of the array should be
9878 fixed when printing each element of the array, or when extracting
9879 one element out of that array. On the other hand, fixing should
9880 not be performed on the elements when taking a slice of an array!
9882 Note that one of the side effects of miscomputing the offset and
9883 size of each field is that we end up also miscomputing the size
9884 of the containing type. This can have adverse results when computing
9885 the value of an entity. GDB fetches the value of an entity based
9886 on the size of its type, and thus a wrong size causes GDB to fetch
9887 the wrong amount of memory. In the case where the computed size is
9888 too small, GDB fetches too little data to print the value of our
9889 entity. Results in this case are unpredictable, as we usually read
9890 past the buffer containing the data =:-o. */
9892 /* Evaluate a subexpression of EXP, at index *POS, and return a value
9893 for that subexpression cast to TO_TYPE. Advance *POS over the
9897 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
9898 enum noside noside
, struct type
*to_type
)
9902 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
9903 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
9908 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
9910 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9911 return value_zero (to_type
, not_lval
);
9913 val
= evaluate_var_msym_value (noside
,
9914 exp
->elts
[pc
+ 1].objfile
,
9915 exp
->elts
[pc
+ 2].msymbol
);
9918 val
= evaluate_var_value (noside
,
9919 exp
->elts
[pc
+ 1].block
,
9920 exp
->elts
[pc
+ 2].symbol
);
9922 if (noside
== EVAL_SKIP
)
9923 return eval_skip_value (exp
);
9925 val
= ada_value_cast (to_type
, val
);
9927 /* Follow the Ada language semantics that do not allow taking
9928 an address of the result of a cast (view conversion in Ada). */
9929 if (VALUE_LVAL (val
) == lval_memory
)
9931 if (value_lazy (val
))
9932 value_fetch_lazy (val
);
9933 VALUE_LVAL (val
) = not_lval
;
9938 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
9939 if (noside
== EVAL_SKIP
)
9940 return eval_skip_value (exp
);
9941 return ada_value_cast (to_type
, val
);
9944 /* A helper function for TERNOP_IN_RANGE. */
9947 eval_ternop_in_range (struct type
*expect_type
, struct expression
*exp
,
9949 value
*arg1
, value
*arg2
, value
*arg3
)
9951 if (noside
== EVAL_SKIP
)
9952 return eval_skip_value (exp
);
9954 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9955 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9956 struct type
*type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9958 value_from_longest (type
,
9959 (value_less (arg1
, arg3
)
9960 || value_equal (arg1
, arg3
))
9961 && (value_less (arg2
, arg1
)
9962 || value_equal (arg2
, arg1
)));
9965 /* A helper function for UNOP_NEG. */
9968 ada_unop_neg (struct type
*expect_type
,
9969 struct expression
*exp
,
9970 enum noside noside
, enum exp_opcode op
,
9973 if (noside
== EVAL_SKIP
)
9974 return eval_skip_value (exp
);
9975 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9976 return value_neg (arg1
);
9979 /* A helper function for UNOP_IN_RANGE. */
9982 ada_unop_in_range (struct type
*expect_type
,
9983 struct expression
*exp
,
9984 enum noside noside
, enum exp_opcode op
,
9985 struct value
*arg1
, struct type
*type
)
9987 if (noside
== EVAL_SKIP
)
9988 return eval_skip_value (exp
);
9990 struct value
*arg2
, *arg3
;
9991 switch (type
->code ())
9994 lim_warning (_("Membership test incompletely implemented; "
9995 "always returns true"));
9996 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9997 return value_from_longest (type
, (LONGEST
) 1);
9999 case TYPE_CODE_RANGE
:
10000 arg2
= value_from_longest (type
,
10001 type
->bounds ()->low
.const_val ());
10002 arg3
= value_from_longest (type
,
10003 type
->bounds ()->high
.const_val ());
10004 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10005 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10006 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10008 value_from_longest (type
,
10009 (value_less (arg1
, arg3
)
10010 || value_equal (arg1
, arg3
))
10011 && (value_less (arg2
, arg1
)
10012 || value_equal (arg2
, arg1
)));
10016 /* A helper function for OP_ATR_TAG. */
10019 ada_atr_tag (struct type
*expect_type
,
10020 struct expression
*exp
,
10021 enum noside noside
, enum exp_opcode op
,
10022 struct value
*arg1
)
10024 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10025 return value_zero (ada_tag_type (arg1
), not_lval
);
10027 return ada_value_tag (arg1
);
10030 /* A helper function for OP_ATR_SIZE. */
10033 ada_atr_size (struct type
*expect_type
,
10034 struct expression
*exp
,
10035 enum noside noside
, enum exp_opcode op
,
10036 struct value
*arg1
)
10038 struct type
*type
= value_type (arg1
);
10040 /* If the argument is a reference, then dereference its type, since
10041 the user is really asking for the size of the actual object,
10042 not the size of the pointer. */
10043 if (type
->code () == TYPE_CODE_REF
)
10044 type
= TYPE_TARGET_TYPE (type
);
10046 if (noside
== EVAL_SKIP
)
10047 return eval_skip_value (exp
);
10048 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10049 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10051 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10052 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10055 /* A helper function for UNOP_ABS. */
10058 ada_abs (struct type
*expect_type
,
10059 struct expression
*exp
,
10060 enum noside noside
, enum exp_opcode op
,
10061 struct value
*arg1
)
10063 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10064 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10065 return value_neg (arg1
);
10070 /* A helper function for BINOP_MUL. */
10073 ada_mult_binop (struct type
*expect_type
,
10074 struct expression
*exp
,
10075 enum noside noside
, enum exp_opcode op
,
10076 struct value
*arg1
, struct value
*arg2
)
10078 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10080 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10081 return value_zero (value_type (arg1
), not_lval
);
10085 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10086 return ada_value_binop (arg1
, arg2
, op
);
10090 /* A helper function for BINOP_EQUAL and BINOP_NOTEQUAL. */
10093 ada_equal_binop (struct type
*expect_type
,
10094 struct expression
*exp
,
10095 enum noside noside
, enum exp_opcode op
,
10096 struct value
*arg1
, struct value
*arg2
)
10099 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10103 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10104 tem
= ada_value_equal (arg1
, arg2
);
10106 if (op
== BINOP_NOTEQUAL
)
10108 struct type
*type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10109 return value_from_longest (type
, (LONGEST
) tem
);
10112 /* A helper function for TERNOP_SLICE. */
10115 ada_ternop_slice (struct expression
*exp
,
10116 enum noside noside
,
10117 struct value
*array
, struct value
*low_bound_val
,
10118 struct value
*high_bound_val
)
10121 LONGEST high_bound
;
10123 low_bound_val
= coerce_ref (low_bound_val
);
10124 high_bound_val
= coerce_ref (high_bound_val
);
10125 low_bound
= value_as_long (low_bound_val
);
10126 high_bound
= value_as_long (high_bound_val
);
10128 /* If this is a reference to an aligner type, then remove all
10130 if (value_type (array
)->code () == TYPE_CODE_REF
10131 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10132 TYPE_TARGET_TYPE (value_type (array
)) =
10133 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10135 if (ada_is_any_packed_array_type (value_type (array
)))
10136 error (_("cannot slice a packed array"));
10138 /* If this is a reference to an array or an array lvalue,
10139 convert to a pointer. */
10140 if (value_type (array
)->code () == TYPE_CODE_REF
10141 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10142 && VALUE_LVAL (array
) == lval_memory
))
10143 array
= value_addr (array
);
10145 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10146 && ada_is_array_descriptor_type (ada_check_typedef
10147 (value_type (array
))))
10148 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10151 array
= ada_coerce_to_simple_array_ptr (array
);
10153 /* If we have more than one level of pointer indirection,
10154 dereference the value until we get only one level. */
10155 while (value_type (array
)->code () == TYPE_CODE_PTR
10156 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10158 array
= value_ind (array
);
10160 /* Make sure we really do have an array type before going further,
10161 to avoid a SEGV when trying to get the index type or the target
10162 type later down the road if the debug info generated by
10163 the compiler is incorrect or incomplete. */
10164 if (!ada_is_simple_array_type (value_type (array
)))
10165 error (_("cannot take slice of non-array"));
10167 if (ada_check_typedef (value_type (array
))->code ()
10170 struct type
*type0
= ada_check_typedef (value_type (array
));
10172 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10173 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10176 struct type
*arr_type0
=
10177 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10179 return ada_value_slice_from_ptr (array
, arr_type0
,
10180 longest_to_int (low_bound
),
10181 longest_to_int (high_bound
));
10184 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10186 else if (high_bound
< low_bound
)
10187 return empty_array (value_type (array
), low_bound
, high_bound
);
10189 return ada_value_slice (array
, longest_to_int (low_bound
),
10190 longest_to_int (high_bound
));
10193 /* A helper function for BINOP_IN_BOUNDS. */
10196 ada_binop_in_bounds (struct expression
*exp
, enum noside noside
,
10197 struct value
*arg1
, struct value
*arg2
, int n
)
10199 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10201 struct type
*type
= language_bool_type (exp
->language_defn
,
10203 return value_zero (type
, not_lval
);
10206 struct type
*type
= ada_index_type (value_type (arg2
), n
, "range");
10208 type
= value_type (arg1
);
10210 value
*arg3
= value_from_longest (type
, ada_array_bound (arg2
, n
, 1));
10211 arg2
= value_from_longest (type
, ada_array_bound (arg2
, n
, 0));
10213 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10214 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10215 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10216 return value_from_longest (type
,
10217 (value_less (arg1
, arg3
)
10218 || value_equal (arg1
, arg3
))
10219 && (value_less (arg2
, arg1
)
10220 || value_equal (arg2
, arg1
)));
10223 /* A helper function for some attribute operations. */
10226 ada_unop_atr (struct expression
*exp
, enum noside noside
, enum exp_opcode op
,
10227 struct value
*arg1
, struct type
*type_arg
, int tem
)
10229 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10231 if (type_arg
== NULL
)
10232 type_arg
= value_type (arg1
);
10234 if (ada_is_constrained_packed_array_type (type_arg
))
10235 type_arg
= decode_constrained_packed_array_type (type_arg
);
10237 if (!discrete_type_p (type_arg
))
10241 default: /* Should never happen. */
10242 error (_("unexpected attribute encountered"));
10245 type_arg
= ada_index_type (type_arg
, tem
,
10246 ada_attribute_name (op
));
10248 case OP_ATR_LENGTH
:
10249 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
10254 return value_zero (type_arg
, not_lval
);
10256 else if (type_arg
== NULL
)
10258 arg1
= ada_coerce_ref (arg1
);
10260 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10261 arg1
= ada_coerce_to_simple_array (arg1
);
10264 if (op
== OP_ATR_LENGTH
)
10265 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10268 type
= ada_index_type (value_type (arg1
), tem
,
10269 ada_attribute_name (op
));
10271 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10276 default: /* Should never happen. */
10277 error (_("unexpected attribute encountered"));
10279 return value_from_longest
10280 (type
, ada_array_bound (arg1
, tem
, 0));
10282 return value_from_longest
10283 (type
, ada_array_bound (arg1
, tem
, 1));
10284 case OP_ATR_LENGTH
:
10285 return value_from_longest
10286 (type
, ada_array_length (arg1
, tem
));
10289 else if (discrete_type_p (type_arg
))
10291 struct type
*range_type
;
10292 const char *name
= ada_type_name (type_arg
);
10295 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
10296 range_type
= to_fixed_range_type (type_arg
, NULL
);
10297 if (range_type
== NULL
)
10298 range_type
= type_arg
;
10302 error (_("unexpected attribute encountered"));
10304 return value_from_longest
10305 (range_type
, ada_discrete_type_low_bound (range_type
));
10307 return value_from_longest
10308 (range_type
, ada_discrete_type_high_bound (range_type
));
10309 case OP_ATR_LENGTH
:
10310 error (_("the 'length attribute applies only to array types"));
10313 else if (type_arg
->code () == TYPE_CODE_FLT
)
10314 error (_("unimplemented type attribute"));
10319 if (ada_is_constrained_packed_array_type (type_arg
))
10320 type_arg
= decode_constrained_packed_array_type (type_arg
);
10323 if (op
== OP_ATR_LENGTH
)
10324 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10327 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10329 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10335 error (_("unexpected attribute encountered"));
10337 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10338 return value_from_longest (type
, low
);
10340 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10341 return value_from_longest (type
, high
);
10342 case OP_ATR_LENGTH
:
10343 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10344 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10345 return value_from_longest (type
, high
- low
+ 1);
10350 /* A helper function for OP_ATR_MIN and OP_ATR_MAX. */
10352 static struct value
*
10353 ada_binop_minmax (struct type
*expect_type
,
10354 struct expression
*exp
,
10355 enum noside noside
, enum exp_opcode op
,
10356 struct value
*arg1
, struct value
*arg2
)
10358 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10359 return value_zero (value_type (arg1
), not_lval
);
10362 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10363 return value_binop (arg1
, arg2
,
10364 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10368 /* A helper function for BINOP_EXP. */
10370 static struct value
*
10371 ada_binop_exp (struct type
*expect_type
,
10372 struct expression
*exp
,
10373 enum noside noside
, enum exp_opcode op
,
10374 struct value
*arg1
, struct value
*arg2
)
10376 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10377 return value_zero (value_type (arg1
), not_lval
);
10380 /* For integer exponentiation operations,
10381 only promote the first argument. */
10382 if (is_integral_type (value_type (arg2
)))
10383 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10385 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10387 return value_binop (arg1
, arg2
, op
);
10395 ada_wrapped_operation::evaluate (struct type
*expect_type
,
10396 struct expression
*exp
,
10397 enum noside noside
)
10399 value
*result
= std::get
<0> (m_storage
)->evaluate (expect_type
, exp
, noside
);
10400 if (noside
== EVAL_NORMAL
)
10401 result
= unwrap_value (result
);
10403 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10404 then we need to perform the conversion manually, because
10405 evaluate_subexp_standard doesn't do it. This conversion is
10406 necessary in Ada because the different kinds of float/fixed
10407 types in Ada have different representations.
10409 Similarly, we need to perform the conversion from OP_LONG
10411 if ((opcode () == OP_FLOAT
|| opcode () == OP_LONG
) && expect_type
!= NULL
)
10412 result
= ada_value_cast (expect_type
, result
);
10418 ada_string_operation::evaluate (struct type
*expect_type
,
10419 struct expression
*exp
,
10420 enum noside noside
)
10422 value
*result
= string_operation::evaluate (expect_type
, exp
, noside
);
10423 /* The result type will have code OP_STRING, bashed there from
10424 OP_ARRAY. Bash it back. */
10425 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10426 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10431 ada_qual_operation::evaluate (struct type
*expect_type
,
10432 struct expression
*exp
,
10433 enum noside noside
)
10435 struct type
*type
= std::get
<1> (m_storage
);
10436 return std::get
<0> (m_storage
)->evaluate (type
, exp
, noside
);
10440 ada_ternop_range_operation::evaluate (struct type
*expect_type
,
10441 struct expression
*exp
,
10442 enum noside noside
)
10444 value
*arg0
= std::get
<0> (m_storage
)->evaluate (nullptr, exp
, noside
);
10445 value
*arg1
= std::get
<1> (m_storage
)->evaluate (nullptr, exp
, noside
);
10446 value
*arg2
= std::get
<2> (m_storage
)->evaluate (nullptr, exp
, noside
);
10447 return eval_ternop_in_range (expect_type
, exp
, noside
, arg0
, arg1
, arg2
);
10452 /* Implement the evaluate_exp routine in the exp_descriptor structure
10453 for the Ada language. */
10455 static struct value
*
10456 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10457 int *pos
, enum noside noside
)
10459 enum exp_opcode op
;
10463 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10466 struct value
**argvec
;
10470 op
= exp
->elts
[pc
].opcode
;
10476 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10478 if (noside
== EVAL_NORMAL
)
10479 arg1
= unwrap_value (arg1
);
10481 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10482 then we need to perform the conversion manually, because
10483 evaluate_subexp_standard doesn't do it. This conversion is
10484 necessary in Ada because the different kinds of float/fixed
10485 types in Ada have different representations.
10487 Similarly, we need to perform the conversion from OP_LONG
10489 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10490 arg1
= ada_value_cast (expect_type
, arg1
);
10496 struct value
*result
;
10499 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10500 /* The result type will have code OP_STRING, bashed there from
10501 OP_ARRAY. Bash it back. */
10502 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10503 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10509 type
= exp
->elts
[pc
+ 1].type
;
10510 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10514 type
= exp
->elts
[pc
+ 1].type
;
10515 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10518 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10519 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10521 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10522 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10524 return ada_value_assign (arg1
, arg1
);
10526 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10527 except if the lhs of our assignment is a convenience variable.
10528 In the case of assigning to a convenience variable, the lhs
10529 should be exactly the result of the evaluation of the rhs. */
10530 type
= value_type (arg1
);
10531 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10533 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10534 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10536 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10541 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10542 return ada_value_assign (arg1
, arg2
);
10545 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10546 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10547 if (noside
== EVAL_SKIP
)
10549 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10550 return (value_from_longest
10551 (value_type (arg1
),
10552 value_as_long (arg1
) + value_as_long (arg2
)));
10553 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10554 return (value_from_longest
10555 (value_type (arg2
),
10556 value_as_long (arg1
) + value_as_long (arg2
)));
10557 /* Preserve the original type for use by the range case below.
10558 We cannot cast the result to a reference type, so if ARG1 is
10559 a reference type, find its underlying type. */
10560 type
= value_type (arg1
);
10561 while (type
->code () == TYPE_CODE_REF
)
10562 type
= TYPE_TARGET_TYPE (type
);
10563 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10564 arg1
= value_binop (arg1
, arg2
, BINOP_ADD
);
10565 /* We need to special-case the result of adding to a range.
10566 This is done for the benefit of "ptype". gdb's Ada support
10567 historically used the LHS to set the result type here, so
10568 preserve this behavior. */
10569 if (type
->code () == TYPE_CODE_RANGE
)
10570 arg1
= value_cast (type
, arg1
);
10574 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10575 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10576 if (noside
== EVAL_SKIP
)
10578 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10579 return (value_from_longest
10580 (value_type (arg1
),
10581 value_as_long (arg1
) - value_as_long (arg2
)));
10582 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10583 return (value_from_longest
10584 (value_type (arg2
),
10585 value_as_long (arg1
) - value_as_long (arg2
)));
10586 /* Preserve the original type for use by the range case below.
10587 We cannot cast the result to a reference type, so if ARG1 is
10588 a reference type, find its underlying type. */
10589 type
= value_type (arg1
);
10590 while (type
->code () == TYPE_CODE_REF
)
10591 type
= TYPE_TARGET_TYPE (type
);
10592 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10593 arg1
= value_binop (arg1
, arg2
, BINOP_SUB
);
10594 /* We need to special-case the result of adding to a range.
10595 This is done for the benefit of "ptype". gdb's Ada support
10596 historically used the LHS to set the result type here, so
10597 preserve this behavior. */
10598 if (type
->code () == TYPE_CODE_RANGE
)
10599 arg1
= value_cast (type
, arg1
);
10606 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10607 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10608 if (noside
== EVAL_SKIP
)
10610 return ada_mult_binop (expect_type
, exp
, noside
, op
,
10614 case BINOP_NOTEQUAL
:
10615 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10616 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10617 if (noside
== EVAL_SKIP
)
10619 return ada_equal_binop (expect_type
, exp
, noside
, op
, arg1
, arg2
);
10622 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10623 return ada_unop_neg (expect_type
, exp
, noside
, op
, arg1
);
10625 case BINOP_LOGICAL_AND
:
10626 case BINOP_LOGICAL_OR
:
10627 case UNOP_LOGICAL_NOT
:
10632 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10633 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10634 return value_cast (type
, val
);
10637 case BINOP_BITWISE_AND
:
10638 case BINOP_BITWISE_IOR
:
10639 case BINOP_BITWISE_XOR
:
10643 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10645 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10647 return value_cast (value_type (arg1
), val
);
10653 if (noside
== EVAL_SKIP
)
10659 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10660 /* Only encountered when an unresolved symbol occurs in a
10661 context other than a function call, in which case, it is
10663 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10664 exp
->elts
[pc
+ 2].symbol
->print_name ());
10666 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10668 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10669 /* Check to see if this is a tagged type. We also need to handle
10670 the case where the type is a reference to a tagged type, but
10671 we have to be careful to exclude pointers to tagged types.
10672 The latter should be shown as usual (as a pointer), whereas
10673 a reference should mostly be transparent to the user. */
10674 if (ada_is_tagged_type (type
, 0)
10675 || (type
->code () == TYPE_CODE_REF
10676 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10678 /* Tagged types are a little special in the fact that the real
10679 type is dynamic and can only be determined by inspecting the
10680 object's tag. This means that we need to get the object's
10681 value first (EVAL_NORMAL) and then extract the actual object
10684 Note that we cannot skip the final step where we extract
10685 the object type from its tag, because the EVAL_NORMAL phase
10686 results in dynamic components being resolved into fixed ones.
10687 This can cause problems when trying to print the type
10688 description of tagged types whose parent has a dynamic size:
10689 We use the type name of the "_parent" component in order
10690 to print the name of the ancestor type in the type description.
10691 If that component had a dynamic size, the resolution into
10692 a fixed type would result in the loss of that type name,
10693 thus preventing us from printing the name of the ancestor
10694 type in the type description. */
10695 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_NORMAL
);
10697 if (type
->code () != TYPE_CODE_REF
)
10699 struct type
*actual_type
;
10701 actual_type
= type_from_tag (ada_value_tag (arg1
));
10702 if (actual_type
== NULL
)
10703 /* If, for some reason, we were unable to determine
10704 the actual type from the tag, then use the static
10705 approximation that we just computed as a fallback.
10706 This can happen if the debugging information is
10707 incomplete, for instance. */
10708 actual_type
= type
;
10709 return value_zero (actual_type
, not_lval
);
10713 /* In the case of a ref, ada_coerce_ref takes care
10714 of determining the actual type. But the evaluation
10715 should return a ref as it should be valid to ask
10716 for its address; so rebuild a ref after coerce. */
10717 arg1
= ada_coerce_ref (arg1
);
10718 return value_ref (arg1
, TYPE_CODE_REF
);
10722 /* Records and unions for which GNAT encodings have been
10723 generated need to be statically fixed as well.
10724 Otherwise, non-static fixing produces a type where
10725 all dynamic properties are removed, which prevents "ptype"
10726 from being able to completely describe the type.
10727 For instance, a case statement in a variant record would be
10728 replaced by the relevant components based on the actual
10729 value of the discriminants. */
10730 if ((type
->code () == TYPE_CODE_STRUCT
10731 && dynamic_template_type (type
) != NULL
)
10732 || (type
->code () == TYPE_CODE_UNION
10733 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10736 return value_zero (to_static_fixed_type (type
), not_lval
);
10740 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10741 return ada_to_fixed_value (arg1
);
10746 /* Allocate arg vector, including space for the function to be
10747 called in argvec[0] and a terminating NULL. */
10748 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10749 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10751 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10752 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10753 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10754 exp
->elts
[pc
+ 5].symbol
->print_name ());
10757 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10758 argvec
[tem
] = evaluate_subexp (nullptr, exp
, pos
, noside
);
10761 if (noside
== EVAL_SKIP
)
10765 if (ada_is_constrained_packed_array_type
10766 (desc_base_type (value_type (argvec
[0]))))
10767 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10768 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10769 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10770 /* This is a packed array that has already been fixed, and
10771 therefore already coerced to a simple array. Nothing further
10774 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10776 /* Make sure we dereference references so that all the code below
10777 feels like it's really handling the referenced value. Wrapping
10778 types (for alignment) may be there, so make sure we strip them as
10780 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10782 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10783 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10784 argvec
[0] = value_addr (argvec
[0]);
10786 type
= ada_check_typedef (value_type (argvec
[0]));
10788 /* Ada allows us to implicitly dereference arrays when subscripting
10789 them. So, if this is an array typedef (encoding use for array
10790 access types encoded as fat pointers), strip it now. */
10791 if (type
->code () == TYPE_CODE_TYPEDEF
)
10792 type
= ada_typedef_target_type (type
);
10794 if (type
->code () == TYPE_CODE_PTR
)
10796 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10798 case TYPE_CODE_FUNC
:
10799 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10801 case TYPE_CODE_ARRAY
:
10803 case TYPE_CODE_STRUCT
:
10804 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10805 argvec
[0] = ada_value_ind (argvec
[0]);
10806 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10809 error (_("cannot subscript or call something of type `%s'"),
10810 ada_type_name (value_type (argvec
[0])));
10815 switch (type
->code ())
10817 case TYPE_CODE_FUNC
:
10818 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10820 if (TYPE_TARGET_TYPE (type
) == NULL
)
10821 error_call_unknown_return_type (NULL
);
10822 return allocate_value (TYPE_TARGET_TYPE (type
));
10824 return call_function_by_hand (argvec
[0], NULL
,
10825 gdb::make_array_view (argvec
+ 1,
10827 case TYPE_CODE_INTERNAL_FUNCTION
:
10828 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10829 /* We don't know anything about what the internal
10830 function might return, but we have to return
10832 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10835 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10836 argvec
[0], nargs
, argvec
+ 1);
10838 case TYPE_CODE_STRUCT
:
10842 arity
= ada_array_arity (type
);
10843 type
= ada_array_element_type (type
, nargs
);
10845 error (_("cannot subscript or call a record"));
10846 if (arity
!= nargs
)
10847 error (_("wrong number of subscripts; expecting %d"), arity
);
10848 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10849 return value_zero (ada_aligned_type (type
), lval_memory
);
10851 unwrap_value (ada_value_subscript
10852 (argvec
[0], nargs
, argvec
+ 1));
10854 case TYPE_CODE_ARRAY
:
10855 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10857 type
= ada_array_element_type (type
, nargs
);
10859 error (_("element type of array unknown"));
10861 return value_zero (ada_aligned_type (type
), lval_memory
);
10864 unwrap_value (ada_value_subscript
10865 (ada_coerce_to_simple_array (argvec
[0]),
10866 nargs
, argvec
+ 1));
10867 case TYPE_CODE_PTR
: /* Pointer to array */
10868 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10870 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10871 type
= ada_array_element_type (type
, nargs
);
10873 error (_("element type of array unknown"));
10875 return value_zero (ada_aligned_type (type
), lval_memory
);
10878 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10879 nargs
, argvec
+ 1));
10882 error (_("Attempt to index or call something other than an "
10883 "array or function"));
10888 struct value
*array
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10889 struct value
*low_bound_val
10890 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10891 struct value
*high_bound_val
10892 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10894 if (noside
== EVAL_SKIP
)
10897 return ada_ternop_slice (exp
, noside
, array
, low_bound_val
,
10901 case UNOP_IN_RANGE
:
10903 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10904 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10905 return ada_unop_in_range (expect_type
, exp
, noside
, op
, arg1
, type
);
10907 case BINOP_IN_BOUNDS
:
10909 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10910 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10912 if (noside
== EVAL_SKIP
)
10915 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10917 return ada_binop_in_bounds (exp
, noside
, arg1
, arg2
, tem
);
10919 case TERNOP_IN_RANGE
:
10920 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10921 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10922 arg3
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10924 return eval_ternop_in_range (expect_type
, exp
, noside
, arg1
, arg2
, arg3
);
10928 case OP_ATR_LENGTH
:
10930 struct type
*type_arg
;
10932 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10934 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10936 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10940 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10944 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10945 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10946 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10949 if (noside
== EVAL_SKIP
)
10952 return ada_unop_atr (exp
, noside
, op
, arg1
, type_arg
, tem
);
10956 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10957 if (noside
== EVAL_SKIP
)
10959 return ada_atr_tag (expect_type
, exp
, noside
, op
, arg1
);
10963 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10964 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10965 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10966 if (noside
== EVAL_SKIP
)
10968 return ada_binop_minmax (expect_type
, exp
, noside
, op
, arg1
, arg2
);
10970 case OP_ATR_MODULUS
:
10972 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10974 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10975 if (noside
== EVAL_SKIP
)
10978 if (!ada_is_modular_type (type_arg
))
10979 error (_("'modulus must be applied to modular type"));
10981 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10982 ada_modulus (type_arg
));
10987 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10988 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10989 if (noside
== EVAL_SKIP
)
10991 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10992 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10993 return value_zero (type
, not_lval
);
10995 return value_pos_atr (type
, arg1
);
10998 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10999 return ada_atr_size (expect_type
, exp
, noside
, op
, arg1
);
11002 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
11003 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11004 type
= exp
->elts
[pc
+ 2].type
;
11005 if (noside
== EVAL_SKIP
)
11007 return ada_val_atr (noside
, type
, arg1
);
11010 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11011 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11012 if (noside
== EVAL_SKIP
)
11014 return ada_binop_exp (expect_type
, exp
, noside
, op
, arg1
, arg2
);
11017 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11018 if (noside
== EVAL_SKIP
)
11024 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11025 if (noside
== EVAL_SKIP
)
11027 return ada_abs (expect_type
, exp
, noside
, op
, arg1
);
11030 preeval_pos
= *pos
;
11031 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11032 if (noside
== EVAL_SKIP
)
11034 type
= ada_check_typedef (value_type (arg1
));
11035 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11037 if (ada_is_array_descriptor_type (type
))
11038 /* GDB allows dereferencing GNAT array descriptors. */
11040 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11042 if (arrType
== NULL
)
11043 error (_("Attempt to dereference null array pointer."));
11044 return value_at_lazy (arrType
, 0);
11046 else if (type
->code () == TYPE_CODE_PTR
11047 || type
->code () == TYPE_CODE_REF
11048 /* In C you can dereference an array to get the 1st elt. */
11049 || type
->code () == TYPE_CODE_ARRAY
)
11051 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11052 only be determined by inspecting the object's tag.
11053 This means that we need to evaluate completely the
11054 expression in order to get its type. */
11056 if ((type
->code () == TYPE_CODE_REF
11057 || type
->code () == TYPE_CODE_PTR
)
11058 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11061 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11062 type
= value_type (ada_value_ind (arg1
));
11066 type
= to_static_fixed_type
11068 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11070 ada_ensure_varsize_limit (type
);
11071 return value_zero (type
, lval_memory
);
11073 else if (type
->code () == TYPE_CODE_INT
)
11075 /* GDB allows dereferencing an int. */
11076 if (expect_type
== NULL
)
11077 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11082 to_static_fixed_type (ada_aligned_type (expect_type
));
11083 return value_zero (expect_type
, lval_memory
);
11087 error (_("Attempt to take contents of a non-pointer value."));
11089 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11090 type
= ada_check_typedef (value_type (arg1
));
11092 if (type
->code () == TYPE_CODE_INT
)
11093 /* GDB allows dereferencing an int. If we were given
11094 the expect_type, then use that as the target type.
11095 Otherwise, assume that the target type is an int. */
11097 if (expect_type
!= NULL
)
11098 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11101 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11102 (CORE_ADDR
) value_as_address (arg1
));
11105 if (ada_is_array_descriptor_type (type
))
11106 /* GDB allows dereferencing GNAT array descriptors. */
11107 return ada_coerce_to_simple_array (arg1
);
11109 return ada_value_ind (arg1
);
11111 case STRUCTOP_STRUCT
:
11112 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11113 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11114 preeval_pos
= *pos
;
11115 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11116 if (noside
== EVAL_SKIP
)
11118 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11120 struct type
*type1
= value_type (arg1
);
11122 if (ada_is_tagged_type (type1
, 1))
11124 type
= ada_lookup_struct_elt_type (type1
,
11125 &exp
->elts
[pc
+ 2].string
,
11128 /* If the field is not found, check if it exists in the
11129 extension of this object's type. This means that we
11130 need to evaluate completely the expression. */
11135 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11136 arg1
= ada_value_struct_elt (arg1
,
11137 &exp
->elts
[pc
+ 2].string
,
11139 arg1
= unwrap_value (arg1
);
11140 type
= value_type (ada_to_fixed_value (arg1
));
11145 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11148 return value_zero (ada_aligned_type (type
), lval_memory
);
11152 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11153 arg1
= unwrap_value (arg1
);
11154 return ada_to_fixed_value (arg1
);
11158 /* The value is not supposed to be used. This is here to make it
11159 easier to accommodate expressions that contain types. */
11161 if (noside
== EVAL_SKIP
)
11163 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11164 return allocate_value (exp
->elts
[pc
+ 1].type
);
11166 error (_("Attempt to use a type name as an expression"));
11171 case OP_DISCRETE_RANGE
:
11172 case OP_POSITIONAL
:
11174 if (noside
== EVAL_NORMAL
)
11178 error (_("Undefined name, ambiguous name, or renaming used in "
11179 "component association: %s."), &exp
->elts
[pc
+2].string
);
11181 error (_("Aggregates only allowed on the right of an assignment"));
11183 internal_error (__FILE__
, __LINE__
,
11184 _("aggregate apparently mangled"));
11187 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11189 for (tem
= 0; tem
< nargs
; tem
+= 1)
11190 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11195 return eval_skip_value (exp
);
11199 /* Return non-zero iff TYPE represents a System.Address type. */
11202 ada_is_system_address_type (struct type
*type
)
11204 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11211 /* Scan STR beginning at position K for a discriminant name, and
11212 return the value of that discriminant field of DVAL in *PX. If
11213 PNEW_K is not null, put the position of the character beyond the
11214 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11215 not alter *PX and *PNEW_K if unsuccessful. */
11218 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11221 static std::string storage
;
11222 const char *pstart
, *pend
, *bound
;
11223 struct value
*bound_val
;
11225 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11229 pend
= strstr (pstart
, "__");
11233 k
+= strlen (bound
);
11237 int len
= pend
- pstart
;
11239 /* Strip __ and beyond. */
11240 storage
= std::string (pstart
, len
);
11241 bound
= storage
.c_str ();
11245 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11246 if (bound_val
== NULL
)
11249 *px
= value_as_long (bound_val
);
11250 if (pnew_k
!= NULL
)
11255 /* Value of variable named NAME. Only exact matches are considered.
11256 If no such variable found, then if ERR_MSG is null, returns 0, and
11257 otherwise causes an error with message ERR_MSG. */
11259 static struct value
*
11260 get_var_value (const char *name
, const char *err_msg
)
11262 std::string quoted_name
= add_angle_brackets (name
);
11264 lookup_name_info
lookup_name (quoted_name
, symbol_name_match_type::FULL
);
11266 std::vector
<struct block_symbol
> syms
11267 = ada_lookup_symbol_list_worker (lookup_name
,
11268 get_selected_block (0),
11271 if (syms
.size () != 1)
11273 if (err_msg
== NULL
)
11276 error (("%s"), err_msg
);
11279 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11282 /* Value of integer variable named NAME in the current environment.
11283 If no such variable is found, returns false. Otherwise, sets VALUE
11284 to the variable's value and returns true. */
11287 get_int_var_value (const char *name
, LONGEST
&value
)
11289 struct value
*var_val
= get_var_value (name
, 0);
11294 value
= value_as_long (var_val
);
11299 /* Return a range type whose base type is that of the range type named
11300 NAME in the current environment, and whose bounds are calculated
11301 from NAME according to the GNAT range encoding conventions.
11302 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11303 corresponding range type from debug information; fall back to using it
11304 if symbol lookup fails. If a new type must be created, allocate it
11305 like ORIG_TYPE was. The bounds information, in general, is encoded
11306 in NAME, the base type given in the named range type. */
11308 static struct type
*
11309 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11312 struct type
*base_type
;
11313 const char *subtype_info
;
11315 gdb_assert (raw_type
!= NULL
);
11316 gdb_assert (raw_type
->name () != NULL
);
11318 if (raw_type
->code () == TYPE_CODE_RANGE
)
11319 base_type
= TYPE_TARGET_TYPE (raw_type
);
11321 base_type
= raw_type
;
11323 name
= raw_type
->name ();
11324 subtype_info
= strstr (name
, "___XD");
11325 if (subtype_info
== NULL
)
11327 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11328 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11330 if (L
< INT_MIN
|| U
> INT_MAX
)
11333 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11338 int prefix_len
= subtype_info
- name
;
11341 const char *bounds_str
;
11345 bounds_str
= strchr (subtype_info
, '_');
11348 if (*subtype_info
== 'L')
11350 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11351 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11353 if (bounds_str
[n
] == '_')
11355 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11361 std::string name_buf
= std::string (name
, prefix_len
) + "___L";
11362 if (!get_int_var_value (name_buf
.c_str (), L
))
11364 lim_warning (_("Unknown lower bound, using 1."));
11369 if (*subtype_info
== 'U')
11371 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11372 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11377 std::string name_buf
= std::string (name
, prefix_len
) + "___U";
11378 if (!get_int_var_value (name_buf
.c_str (), U
))
11380 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11385 type
= create_static_range_type (alloc_type_copy (raw_type
),
11387 /* create_static_range_type alters the resulting type's length
11388 to match the size of the base_type, which is not what we want.
11389 Set it back to the original range type's length. */
11390 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11391 type
->set_name (name
);
11396 /* True iff NAME is the name of a range type. */
11399 ada_is_range_type_name (const char *name
)
11401 return (name
!= NULL
&& strstr (name
, "___XD"));
11405 /* Modular types */
11407 /* True iff TYPE is an Ada modular type. */
11410 ada_is_modular_type (struct type
*type
)
11412 struct type
*subranged_type
= get_base_type (type
);
11414 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11415 && subranged_type
->code () == TYPE_CODE_INT
11416 && subranged_type
->is_unsigned ());
11419 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11422 ada_modulus (struct type
*type
)
11424 const dynamic_prop
&high
= type
->bounds ()->high
;
11426 if (high
.kind () == PROP_CONST
)
11427 return (ULONGEST
) high
.const_val () + 1;
11429 /* If TYPE is unresolved, the high bound might be a location list. Return
11430 0, for lack of a better value to return. */
11435 /* Ada exception catchpoint support:
11436 ---------------------------------
11438 We support 3 kinds of exception catchpoints:
11439 . catchpoints on Ada exceptions
11440 . catchpoints on unhandled Ada exceptions
11441 . catchpoints on failed assertions
11443 Exceptions raised during failed assertions, or unhandled exceptions
11444 could perfectly be caught with the general catchpoint on Ada exceptions.
11445 However, we can easily differentiate these two special cases, and having
11446 the option to distinguish these two cases from the rest can be useful
11447 to zero-in on certain situations.
11449 Exception catchpoints are a specialized form of breakpoint,
11450 since they rely on inserting breakpoints inside known routines
11451 of the GNAT runtime. The implementation therefore uses a standard
11452 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11455 Support in the runtime for exception catchpoints have been changed
11456 a few times already, and these changes affect the implementation
11457 of these catchpoints. In order to be able to support several
11458 variants of the runtime, we use a sniffer that will determine
11459 the runtime variant used by the program being debugged. */
11461 /* Ada's standard exceptions.
11463 The Ada 83 standard also defined Numeric_Error. But there so many
11464 situations where it was unclear from the Ada 83 Reference Manual
11465 (RM) whether Constraint_Error or Numeric_Error should be raised,
11466 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11467 Interpretation saying that anytime the RM says that Numeric_Error
11468 should be raised, the implementation may raise Constraint_Error.
11469 Ada 95 went one step further and pretty much removed Numeric_Error
11470 from the list of standard exceptions (it made it a renaming of
11471 Constraint_Error, to help preserve compatibility when compiling
11472 an Ada83 compiler). As such, we do not include Numeric_Error from
11473 this list of standard exceptions. */
11475 static const char * const standard_exc
[] = {
11476 "constraint_error",
11482 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11484 /* A structure that describes how to support exception catchpoints
11485 for a given executable. */
11487 struct exception_support_info
11489 /* The name of the symbol to break on in order to insert
11490 a catchpoint on exceptions. */
11491 const char *catch_exception_sym
;
11493 /* The name of the symbol to break on in order to insert
11494 a catchpoint on unhandled exceptions. */
11495 const char *catch_exception_unhandled_sym
;
11497 /* The name of the symbol to break on in order to insert
11498 a catchpoint on failed assertions. */
11499 const char *catch_assert_sym
;
11501 /* The name of the symbol to break on in order to insert
11502 a catchpoint on exception handling. */
11503 const char *catch_handlers_sym
;
11505 /* Assuming that the inferior just triggered an unhandled exception
11506 catchpoint, this function is responsible for returning the address
11507 in inferior memory where the name of that exception is stored.
11508 Return zero if the address could not be computed. */
11509 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11512 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11513 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11515 /* The following exception support info structure describes how to
11516 implement exception catchpoints with the latest version of the
11517 Ada runtime (as of 2019-08-??). */
11519 static const struct exception_support_info default_exception_support_info
=
11521 "__gnat_debug_raise_exception", /* catch_exception_sym */
11522 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11523 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11524 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11525 ada_unhandled_exception_name_addr
11528 /* The following exception support info structure describes how to
11529 implement exception catchpoints with an earlier version of the
11530 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11532 static const struct exception_support_info exception_support_info_v0
=
11534 "__gnat_debug_raise_exception", /* catch_exception_sym */
11535 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11536 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11537 "__gnat_begin_handler", /* catch_handlers_sym */
11538 ada_unhandled_exception_name_addr
11541 /* The following exception support info structure describes how to
11542 implement exception catchpoints with a slightly older version
11543 of the Ada runtime. */
11545 static const struct exception_support_info exception_support_info_fallback
=
11547 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11548 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11549 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11550 "__gnat_begin_handler", /* catch_handlers_sym */
11551 ada_unhandled_exception_name_addr_from_raise
11554 /* Return nonzero if we can detect the exception support routines
11555 described in EINFO.
11557 This function errors out if an abnormal situation is detected
11558 (for instance, if we find the exception support routines, but
11559 that support is found to be incomplete). */
11562 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11564 struct symbol
*sym
;
11566 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11567 that should be compiled with debugging information. As a result, we
11568 expect to find that symbol in the symtabs. */
11570 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11573 /* Perhaps we did not find our symbol because the Ada runtime was
11574 compiled without debugging info, or simply stripped of it.
11575 It happens on some GNU/Linux distributions for instance, where
11576 users have to install a separate debug package in order to get
11577 the runtime's debugging info. In that situation, let the user
11578 know why we cannot insert an Ada exception catchpoint.
11580 Note: Just for the purpose of inserting our Ada exception
11581 catchpoint, we could rely purely on the associated minimal symbol.
11582 But we would be operating in degraded mode anyway, since we are
11583 still lacking the debugging info needed later on to extract
11584 the name of the exception being raised (this name is printed in
11585 the catchpoint message, and is also used when trying to catch
11586 a specific exception). We do not handle this case for now. */
11587 struct bound_minimal_symbol msym
11588 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11590 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11591 error (_("Your Ada runtime appears to be missing some debugging "
11592 "information.\nCannot insert Ada exception catchpoint "
11593 "in this configuration."));
11598 /* Make sure that the symbol we found corresponds to a function. */
11600 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11602 error (_("Symbol \"%s\" is not a function (class = %d)"),
11603 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11607 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11610 struct bound_minimal_symbol msym
11611 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11613 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11614 error (_("Your Ada runtime appears to be missing some debugging "
11615 "information.\nCannot insert Ada exception catchpoint "
11616 "in this configuration."));
11621 /* Make sure that the symbol we found corresponds to a function. */
11623 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11625 error (_("Symbol \"%s\" is not a function (class = %d)"),
11626 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11633 /* Inspect the Ada runtime and determine which exception info structure
11634 should be used to provide support for exception catchpoints.
11636 This function will always set the per-inferior exception_info,
11637 or raise an error. */
11640 ada_exception_support_info_sniffer (void)
11642 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11644 /* If the exception info is already known, then no need to recompute it. */
11645 if (data
->exception_info
!= NULL
)
11648 /* Check the latest (default) exception support info. */
11649 if (ada_has_this_exception_support (&default_exception_support_info
))
11651 data
->exception_info
= &default_exception_support_info
;
11655 /* Try the v0 exception suport info. */
11656 if (ada_has_this_exception_support (&exception_support_info_v0
))
11658 data
->exception_info
= &exception_support_info_v0
;
11662 /* Try our fallback exception suport info. */
11663 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11665 data
->exception_info
= &exception_support_info_fallback
;
11669 /* Sometimes, it is normal for us to not be able to find the routine
11670 we are looking for. This happens when the program is linked with
11671 the shared version of the GNAT runtime, and the program has not been
11672 started yet. Inform the user of these two possible causes if
11675 if (ada_update_initial_language (language_unknown
) != language_ada
)
11676 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11678 /* If the symbol does not exist, then check that the program is
11679 already started, to make sure that shared libraries have been
11680 loaded. If it is not started, this may mean that the symbol is
11681 in a shared library. */
11683 if (inferior_ptid
.pid () == 0)
11684 error (_("Unable to insert catchpoint. Try to start the program first."));
11686 /* At this point, we know that we are debugging an Ada program and
11687 that the inferior has been started, but we still are not able to
11688 find the run-time symbols. That can mean that we are in
11689 configurable run time mode, or that a-except as been optimized
11690 out by the linker... In any case, at this point it is not worth
11691 supporting this feature. */
11693 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11696 /* True iff FRAME is very likely to be that of a function that is
11697 part of the runtime system. This is all very heuristic, but is
11698 intended to be used as advice as to what frames are uninteresting
11702 is_known_support_routine (struct frame_info
*frame
)
11704 enum language func_lang
;
11706 const char *fullname
;
11708 /* If this code does not have any debugging information (no symtab),
11709 This cannot be any user code. */
11711 symtab_and_line sal
= find_frame_sal (frame
);
11712 if (sal
.symtab
== NULL
)
11715 /* If there is a symtab, but the associated source file cannot be
11716 located, then assume this is not user code: Selecting a frame
11717 for which we cannot display the code would not be very helpful
11718 for the user. This should also take care of case such as VxWorks
11719 where the kernel has some debugging info provided for a few units. */
11721 fullname
= symtab_to_fullname (sal
.symtab
);
11722 if (access (fullname
, R_OK
) != 0)
11725 /* Check the unit filename against the Ada runtime file naming.
11726 We also check the name of the objfile against the name of some
11727 known system libraries that sometimes come with debugging info
11730 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11732 re_comp (known_runtime_file_name_patterns
[i
]);
11733 if (re_exec (lbasename (sal
.symtab
->filename
)))
11735 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11736 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11740 /* Check whether the function is a GNAT-generated entity. */
11742 gdb::unique_xmalloc_ptr
<char> func_name
11743 = find_frame_funname (frame
, &func_lang
, NULL
);
11744 if (func_name
== NULL
)
11747 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11749 re_comp (known_auxiliary_function_name_patterns
[i
]);
11750 if (re_exec (func_name
.get ()))
11757 /* Find the first frame that contains debugging information and that is not
11758 part of the Ada run-time, starting from FI and moving upward. */
11761 ada_find_printable_frame (struct frame_info
*fi
)
11763 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11765 if (!is_known_support_routine (fi
))
11774 /* Assuming that the inferior just triggered an unhandled exception
11775 catchpoint, return the address in inferior memory where the name
11776 of the exception is stored.
11778 Return zero if the address could not be computed. */
11781 ada_unhandled_exception_name_addr (void)
11783 return parse_and_eval_address ("e.full_name");
11786 /* Same as ada_unhandled_exception_name_addr, except that this function
11787 should be used when the inferior uses an older version of the runtime,
11788 where the exception name needs to be extracted from a specific frame
11789 several frames up in the callstack. */
11792 ada_unhandled_exception_name_addr_from_raise (void)
11795 struct frame_info
*fi
;
11796 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11798 /* To determine the name of this exception, we need to select
11799 the frame corresponding to RAISE_SYM_NAME. This frame is
11800 at least 3 levels up, so we simply skip the first 3 frames
11801 without checking the name of their associated function. */
11802 fi
= get_current_frame ();
11803 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11805 fi
= get_prev_frame (fi
);
11809 enum language func_lang
;
11811 gdb::unique_xmalloc_ptr
<char> func_name
11812 = find_frame_funname (fi
, &func_lang
, NULL
);
11813 if (func_name
!= NULL
)
11815 if (strcmp (func_name
.get (),
11816 data
->exception_info
->catch_exception_sym
) == 0)
11817 break; /* We found the frame we were looking for... */
11819 fi
= get_prev_frame (fi
);
11826 return parse_and_eval_address ("id.full_name");
11829 /* Assuming the inferior just triggered an Ada exception catchpoint
11830 (of any type), return the address in inferior memory where the name
11831 of the exception is stored, if applicable.
11833 Assumes the selected frame is the current frame.
11835 Return zero if the address could not be computed, or if not relevant. */
11838 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11839 struct breakpoint
*b
)
11841 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11845 case ada_catch_exception
:
11846 return (parse_and_eval_address ("e.full_name"));
11849 case ada_catch_exception_unhandled
:
11850 return data
->exception_info
->unhandled_exception_name_addr ();
11853 case ada_catch_handlers
:
11854 return 0; /* The runtimes does not provide access to the exception
11858 case ada_catch_assert
:
11859 return 0; /* Exception name is not relevant in this case. */
11863 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11867 return 0; /* Should never be reached. */
11870 /* Assuming the inferior is stopped at an exception catchpoint,
11871 return the message which was associated to the exception, if
11872 available. Return NULL if the message could not be retrieved.
11874 Note: The exception message can be associated to an exception
11875 either through the use of the Raise_Exception function, or
11876 more simply (Ada 2005 and later), via:
11878 raise Exception_Name with "exception message";
11882 static gdb::unique_xmalloc_ptr
<char>
11883 ada_exception_message_1 (void)
11885 struct value
*e_msg_val
;
11888 /* For runtimes that support this feature, the exception message
11889 is passed as an unbounded string argument called "message". */
11890 e_msg_val
= parse_and_eval ("message");
11891 if (e_msg_val
== NULL
)
11892 return NULL
; /* Exception message not supported. */
11894 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
11895 gdb_assert (e_msg_val
!= NULL
);
11896 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
11898 /* If the message string is empty, then treat it as if there was
11899 no exception message. */
11900 if (e_msg_len
<= 0)
11903 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
11904 read_memory (value_address (e_msg_val
), (gdb_byte
*) e_msg
.get (),
11906 e_msg
.get ()[e_msg_len
] = '\0';
11911 /* Same as ada_exception_message_1, except that all exceptions are
11912 contained here (returning NULL instead). */
11914 static gdb::unique_xmalloc_ptr
<char>
11915 ada_exception_message (void)
11917 gdb::unique_xmalloc_ptr
<char> e_msg
;
11921 e_msg
= ada_exception_message_1 ();
11923 catch (const gdb_exception_error
&e
)
11925 e_msg
.reset (nullptr);
11931 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11932 any error that ada_exception_name_addr_1 might cause to be thrown.
11933 When an error is intercepted, a warning with the error message is printed,
11934 and zero is returned. */
11937 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11938 struct breakpoint
*b
)
11940 CORE_ADDR result
= 0;
11944 result
= ada_exception_name_addr_1 (ex
, b
);
11947 catch (const gdb_exception_error
&e
)
11949 warning (_("failed to get exception name: %s"), e
.what ());
11956 static std::string ada_exception_catchpoint_cond_string
11957 (const char *excep_string
,
11958 enum ada_exception_catchpoint_kind ex
);
11960 /* Ada catchpoints.
11962 In the case of catchpoints on Ada exceptions, the catchpoint will
11963 stop the target on every exception the program throws. When a user
11964 specifies the name of a specific exception, we translate this
11965 request into a condition expression (in text form), and then parse
11966 it into an expression stored in each of the catchpoint's locations.
11967 We then use this condition to check whether the exception that was
11968 raised is the one the user is interested in. If not, then the
11969 target is resumed again. We store the name of the requested
11970 exception, in order to be able to re-set the condition expression
11971 when symbols change. */
11973 /* An instance of this type is used to represent an Ada catchpoint
11974 breakpoint location. */
11976 class ada_catchpoint_location
: public bp_location
11979 ada_catchpoint_location (breakpoint
*owner
)
11980 : bp_location (owner
, bp_loc_software_breakpoint
)
11983 /* The condition that checks whether the exception that was raised
11984 is the specific exception the user specified on catchpoint
11986 expression_up excep_cond_expr
;
11989 /* An instance of this type is used to represent an Ada catchpoint. */
11991 struct ada_catchpoint
: public breakpoint
11993 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
11998 /* The name of the specific exception the user specified. */
11999 std::string excep_string
;
12001 /* What kind of catchpoint this is. */
12002 enum ada_exception_catchpoint_kind m_kind
;
12005 /* Parse the exception condition string in the context of each of the
12006 catchpoint's locations, and store them for later evaluation. */
12009 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12010 enum ada_exception_catchpoint_kind ex
)
12012 struct bp_location
*bl
;
12014 /* Nothing to do if there's no specific exception to catch. */
12015 if (c
->excep_string
.empty ())
12018 /* Same if there are no locations... */
12019 if (c
->loc
== NULL
)
12022 /* Compute the condition expression in text form, from the specific
12023 expection we want to catch. */
12024 std::string cond_string
12025 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12027 /* Iterate over all the catchpoint's locations, and parse an
12028 expression for each. */
12029 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12031 struct ada_catchpoint_location
*ada_loc
12032 = (struct ada_catchpoint_location
*) bl
;
12035 if (!bl
->shlib_disabled
)
12039 s
= cond_string
.c_str ();
12042 exp
= parse_exp_1 (&s
, bl
->address
,
12043 block_for_pc (bl
->address
),
12046 catch (const gdb_exception_error
&e
)
12048 warning (_("failed to reevaluate internal exception condition "
12049 "for catchpoint %d: %s"),
12050 c
->number
, e
.what ());
12054 ada_loc
->excep_cond_expr
= std::move (exp
);
12058 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12059 structure for all exception catchpoint kinds. */
12061 static struct bp_location
*
12062 allocate_location_exception (struct breakpoint
*self
)
12064 return new ada_catchpoint_location (self
);
12067 /* Implement the RE_SET method in the breakpoint_ops structure for all
12068 exception catchpoint kinds. */
12071 re_set_exception (struct breakpoint
*b
)
12073 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12075 /* Call the base class's method. This updates the catchpoint's
12077 bkpt_breakpoint_ops
.re_set (b
);
12079 /* Reparse the exception conditional expressions. One for each
12081 create_excep_cond_exprs (c
, c
->m_kind
);
12084 /* Returns true if we should stop for this breakpoint hit. If the
12085 user specified a specific exception, we only want to cause a stop
12086 if the program thrown that exception. */
12089 should_stop_exception (const struct bp_location
*bl
)
12091 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12092 const struct ada_catchpoint_location
*ada_loc
12093 = (const struct ada_catchpoint_location
*) bl
;
12096 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12097 if (c
->m_kind
== ada_catch_assert
)
12098 clear_internalvar (var
);
12105 if (c
->m_kind
== ada_catch_handlers
)
12106 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12107 ".all.occurrence.id");
12111 struct value
*exc
= parse_and_eval (expr
);
12112 set_internalvar (var
, exc
);
12114 catch (const gdb_exception_error
&ex
)
12116 clear_internalvar (var
);
12120 /* With no specific exception, should always stop. */
12121 if (c
->excep_string
.empty ())
12124 if (ada_loc
->excep_cond_expr
== NULL
)
12126 /* We will have a NULL expression if back when we were creating
12127 the expressions, this location's had failed to parse. */
12134 struct value
*mark
;
12136 mark
= value_mark ();
12137 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12138 value_free_to_mark (mark
);
12140 catch (const gdb_exception
&ex
)
12142 exception_fprintf (gdb_stderr
, ex
,
12143 _("Error in testing exception condition:\n"));
12149 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12150 for all exception catchpoint kinds. */
12153 check_status_exception (bpstat bs
)
12155 bs
->stop
= should_stop_exception (bs
->bp_location_at
.get ());
12158 /* Implement the PRINT_IT method in the breakpoint_ops structure
12159 for all exception catchpoint kinds. */
12161 static enum print_stop_action
12162 print_it_exception (bpstat bs
)
12164 struct ui_out
*uiout
= current_uiout
;
12165 struct breakpoint
*b
= bs
->breakpoint_at
;
12167 annotate_catchpoint (b
->number
);
12169 if (uiout
->is_mi_like_p ())
12171 uiout
->field_string ("reason",
12172 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12173 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12176 uiout
->text (b
->disposition
== disp_del
12177 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12178 uiout
->field_signed ("bkptno", b
->number
);
12179 uiout
->text (", ");
12181 /* ada_exception_name_addr relies on the selected frame being the
12182 current frame. Need to do this here because this function may be
12183 called more than once when printing a stop, and below, we'll
12184 select the first frame past the Ada run-time (see
12185 ada_find_printable_frame). */
12186 select_frame (get_current_frame ());
12188 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12191 case ada_catch_exception
:
12192 case ada_catch_exception_unhandled
:
12193 case ada_catch_handlers
:
12195 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12196 char exception_name
[256];
12200 read_memory (addr
, (gdb_byte
*) exception_name
,
12201 sizeof (exception_name
) - 1);
12202 exception_name
[sizeof (exception_name
) - 1] = '\0';
12206 /* For some reason, we were unable to read the exception
12207 name. This could happen if the Runtime was compiled
12208 without debugging info, for instance. In that case,
12209 just replace the exception name by the generic string
12210 "exception" - it will read as "an exception" in the
12211 notification we are about to print. */
12212 memcpy (exception_name
, "exception", sizeof ("exception"));
12214 /* In the case of unhandled exception breakpoints, we print
12215 the exception name as "unhandled EXCEPTION_NAME", to make
12216 it clearer to the user which kind of catchpoint just got
12217 hit. We used ui_out_text to make sure that this extra
12218 info does not pollute the exception name in the MI case. */
12219 if (c
->m_kind
== ada_catch_exception_unhandled
)
12220 uiout
->text ("unhandled ");
12221 uiout
->field_string ("exception-name", exception_name
);
12224 case ada_catch_assert
:
12225 /* In this case, the name of the exception is not really
12226 important. Just print "failed assertion" to make it clearer
12227 that his program just hit an assertion-failure catchpoint.
12228 We used ui_out_text because this info does not belong in
12230 uiout
->text ("failed assertion");
12234 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12235 if (exception_message
!= NULL
)
12237 uiout
->text (" (");
12238 uiout
->field_string ("exception-message", exception_message
.get ());
12242 uiout
->text (" at ");
12243 ada_find_printable_frame (get_current_frame ());
12245 return PRINT_SRC_AND_LOC
;
12248 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12249 for all exception catchpoint kinds. */
12252 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12254 struct ui_out
*uiout
= current_uiout
;
12255 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12256 struct value_print_options opts
;
12258 get_user_print_options (&opts
);
12260 if (opts
.addressprint
)
12261 uiout
->field_skip ("addr");
12263 annotate_field (5);
12266 case ada_catch_exception
:
12267 if (!c
->excep_string
.empty ())
12269 std::string msg
= string_printf (_("`%s' Ada exception"),
12270 c
->excep_string
.c_str ());
12272 uiout
->field_string ("what", msg
);
12275 uiout
->field_string ("what", "all Ada exceptions");
12279 case ada_catch_exception_unhandled
:
12280 uiout
->field_string ("what", "unhandled Ada exceptions");
12283 case ada_catch_handlers
:
12284 if (!c
->excep_string
.empty ())
12286 uiout
->field_fmt ("what",
12287 _("`%s' Ada exception handlers"),
12288 c
->excep_string
.c_str ());
12291 uiout
->field_string ("what", "all Ada exceptions handlers");
12294 case ada_catch_assert
:
12295 uiout
->field_string ("what", "failed Ada assertions");
12299 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12304 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12305 for all exception catchpoint kinds. */
12308 print_mention_exception (struct breakpoint
*b
)
12310 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12311 struct ui_out
*uiout
= current_uiout
;
12313 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12314 : _("Catchpoint "));
12315 uiout
->field_signed ("bkptno", b
->number
);
12316 uiout
->text (": ");
12320 case ada_catch_exception
:
12321 if (!c
->excep_string
.empty ())
12323 std::string info
= string_printf (_("`%s' Ada exception"),
12324 c
->excep_string
.c_str ());
12325 uiout
->text (info
.c_str ());
12328 uiout
->text (_("all Ada exceptions"));
12331 case ada_catch_exception_unhandled
:
12332 uiout
->text (_("unhandled Ada exceptions"));
12335 case ada_catch_handlers
:
12336 if (!c
->excep_string
.empty ())
12339 = string_printf (_("`%s' Ada exception handlers"),
12340 c
->excep_string
.c_str ());
12341 uiout
->text (info
.c_str ());
12344 uiout
->text (_("all Ada exceptions handlers"));
12347 case ada_catch_assert
:
12348 uiout
->text (_("failed Ada assertions"));
12352 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12357 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12358 for all exception catchpoint kinds. */
12361 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12363 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12367 case ada_catch_exception
:
12368 fprintf_filtered (fp
, "catch exception");
12369 if (!c
->excep_string
.empty ())
12370 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12373 case ada_catch_exception_unhandled
:
12374 fprintf_filtered (fp
, "catch exception unhandled");
12377 case ada_catch_handlers
:
12378 fprintf_filtered (fp
, "catch handlers");
12381 case ada_catch_assert
:
12382 fprintf_filtered (fp
, "catch assert");
12386 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12388 print_recreate_thread (b
, fp
);
12391 /* Virtual tables for various breakpoint types. */
12392 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12393 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12394 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12395 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12397 /* See ada-lang.h. */
12400 is_ada_exception_catchpoint (breakpoint
*bp
)
12402 return (bp
->ops
== &catch_exception_breakpoint_ops
12403 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12404 || bp
->ops
== &catch_assert_breakpoint_ops
12405 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12408 /* Split the arguments specified in a "catch exception" command.
12409 Set EX to the appropriate catchpoint type.
12410 Set EXCEP_STRING to the name of the specific exception if
12411 specified by the user.
12412 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12413 "catch handlers" command. False otherwise.
12414 If a condition is found at the end of the arguments, the condition
12415 expression is stored in COND_STRING (memory must be deallocated
12416 after use). Otherwise COND_STRING is set to NULL. */
12419 catch_ada_exception_command_split (const char *args
,
12420 bool is_catch_handlers_cmd
,
12421 enum ada_exception_catchpoint_kind
*ex
,
12422 std::string
*excep_string
,
12423 std::string
*cond_string
)
12425 std::string exception_name
;
12427 exception_name
= extract_arg (&args
);
12428 if (exception_name
== "if")
12430 /* This is not an exception name; this is the start of a condition
12431 expression for a catchpoint on all exceptions. So, "un-get"
12432 this token, and set exception_name to NULL. */
12433 exception_name
.clear ();
12437 /* Check to see if we have a condition. */
12439 args
= skip_spaces (args
);
12440 if (startswith (args
, "if")
12441 && (isspace (args
[2]) || args
[2] == '\0'))
12444 args
= skip_spaces (args
);
12446 if (args
[0] == '\0')
12447 error (_("Condition missing after `if' keyword"));
12448 *cond_string
= args
;
12450 args
+= strlen (args
);
12453 /* Check that we do not have any more arguments. Anything else
12456 if (args
[0] != '\0')
12457 error (_("Junk at end of expression"));
12459 if (is_catch_handlers_cmd
)
12461 /* Catch handling of exceptions. */
12462 *ex
= ada_catch_handlers
;
12463 *excep_string
= exception_name
;
12465 else if (exception_name
.empty ())
12467 /* Catch all exceptions. */
12468 *ex
= ada_catch_exception
;
12469 excep_string
->clear ();
12471 else if (exception_name
== "unhandled")
12473 /* Catch unhandled exceptions. */
12474 *ex
= ada_catch_exception_unhandled
;
12475 excep_string
->clear ();
12479 /* Catch a specific exception. */
12480 *ex
= ada_catch_exception
;
12481 *excep_string
= exception_name
;
12485 /* Return the name of the symbol on which we should break in order to
12486 implement a catchpoint of the EX kind. */
12488 static const char *
12489 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12491 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12493 gdb_assert (data
->exception_info
!= NULL
);
12497 case ada_catch_exception
:
12498 return (data
->exception_info
->catch_exception_sym
);
12500 case ada_catch_exception_unhandled
:
12501 return (data
->exception_info
->catch_exception_unhandled_sym
);
12503 case ada_catch_assert
:
12504 return (data
->exception_info
->catch_assert_sym
);
12506 case ada_catch_handlers
:
12507 return (data
->exception_info
->catch_handlers_sym
);
12510 internal_error (__FILE__
, __LINE__
,
12511 _("unexpected catchpoint kind (%d)"), ex
);
12515 /* Return the breakpoint ops "virtual table" used for catchpoints
12518 static const struct breakpoint_ops
*
12519 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12523 case ada_catch_exception
:
12524 return (&catch_exception_breakpoint_ops
);
12526 case ada_catch_exception_unhandled
:
12527 return (&catch_exception_unhandled_breakpoint_ops
);
12529 case ada_catch_assert
:
12530 return (&catch_assert_breakpoint_ops
);
12532 case ada_catch_handlers
:
12533 return (&catch_handlers_breakpoint_ops
);
12536 internal_error (__FILE__
, __LINE__
,
12537 _("unexpected catchpoint kind (%d)"), ex
);
12541 /* Return the condition that will be used to match the current exception
12542 being raised with the exception that the user wants to catch. This
12543 assumes that this condition is used when the inferior just triggered
12544 an exception catchpoint.
12545 EX: the type of catchpoints used for catching Ada exceptions. */
12548 ada_exception_catchpoint_cond_string (const char *excep_string
,
12549 enum ada_exception_catchpoint_kind ex
)
12552 bool is_standard_exc
= false;
12553 std::string result
;
12555 if (ex
== ada_catch_handlers
)
12557 /* For exception handlers catchpoints, the condition string does
12558 not use the same parameter as for the other exceptions. */
12559 result
= ("long_integer (GNAT_GCC_exception_Access"
12560 "(gcc_exception).all.occurrence.id)");
12563 result
= "long_integer (e)";
12565 /* The standard exceptions are a special case. They are defined in
12566 runtime units that have been compiled without debugging info; if
12567 EXCEP_STRING is the not-fully-qualified name of a standard
12568 exception (e.g. "constraint_error") then, during the evaluation
12569 of the condition expression, the symbol lookup on this name would
12570 *not* return this standard exception. The catchpoint condition
12571 may then be set only on user-defined exceptions which have the
12572 same not-fully-qualified name (e.g. my_package.constraint_error).
12574 To avoid this unexcepted behavior, these standard exceptions are
12575 systematically prefixed by "standard". This means that "catch
12576 exception constraint_error" is rewritten into "catch exception
12577 standard.constraint_error".
12579 If an exception named constraint_error is defined in another package of
12580 the inferior program, then the only way to specify this exception as a
12581 breakpoint condition is to use its fully-qualified named:
12582 e.g. my_package.constraint_error. */
12584 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12586 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12588 is_standard_exc
= true;
12595 if (is_standard_exc
)
12596 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12598 string_appendf (result
, "long_integer (&%s)", excep_string
);
12603 /* Return the symtab_and_line that should be used to insert an exception
12604 catchpoint of the TYPE kind.
12606 ADDR_STRING returns the name of the function where the real
12607 breakpoint that implements the catchpoints is set, depending on the
12608 type of catchpoint we need to create. */
12610 static struct symtab_and_line
12611 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12612 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12614 const char *sym_name
;
12615 struct symbol
*sym
;
12617 /* First, find out which exception support info to use. */
12618 ada_exception_support_info_sniffer ();
12620 /* Then lookup the function on which we will break in order to catch
12621 the Ada exceptions requested by the user. */
12622 sym_name
= ada_exception_sym_name (ex
);
12623 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12626 error (_("Catchpoint symbol not found: %s"), sym_name
);
12628 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12629 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12631 /* Set ADDR_STRING. */
12632 *addr_string
= sym_name
;
12635 *ops
= ada_exception_breakpoint_ops (ex
);
12637 return find_function_start_sal (sym
, 1);
12640 /* Create an Ada exception catchpoint.
12642 EX_KIND is the kind of exception catchpoint to be created.
12644 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12645 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12646 of the exception to which this catchpoint applies.
12648 COND_STRING, if not empty, is the catchpoint condition.
12650 TEMPFLAG, if nonzero, means that the underlying breakpoint
12651 should be temporary.
12653 FROM_TTY is the usual argument passed to all commands implementations. */
12656 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12657 enum ada_exception_catchpoint_kind ex_kind
,
12658 const std::string
&excep_string
,
12659 const std::string
&cond_string
,
12664 std::string addr_string
;
12665 const struct breakpoint_ops
*ops
= NULL
;
12666 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12668 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12669 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12670 ops
, tempflag
, disabled
, from_tty
);
12671 c
->excep_string
= excep_string
;
12672 create_excep_cond_exprs (c
.get (), ex_kind
);
12673 if (!cond_string
.empty ())
12674 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
, false);
12675 install_breakpoint (0, std::move (c
), 1);
12678 /* Implement the "catch exception" command. */
12681 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12682 struct cmd_list_element
*command
)
12684 const char *arg
= arg_entry
;
12685 struct gdbarch
*gdbarch
= get_current_arch ();
12687 enum ada_exception_catchpoint_kind ex_kind
;
12688 std::string excep_string
;
12689 std::string cond_string
;
12691 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12695 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12697 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12698 excep_string
, cond_string
,
12699 tempflag
, 1 /* enabled */,
12703 /* Implement the "catch handlers" command. */
12706 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12707 struct cmd_list_element
*command
)
12709 const char *arg
= arg_entry
;
12710 struct gdbarch
*gdbarch
= get_current_arch ();
12712 enum ada_exception_catchpoint_kind ex_kind
;
12713 std::string excep_string
;
12714 std::string cond_string
;
12716 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12720 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
12722 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12723 excep_string
, cond_string
,
12724 tempflag
, 1 /* enabled */,
12728 /* Completion function for the Ada "catch" commands. */
12731 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
12732 const char *text
, const char *word
)
12734 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
12736 for (const ada_exc_info
&info
: exceptions
)
12738 if (startswith (info
.name
, word
))
12739 tracker
.add_completion (make_unique_xstrdup (info
.name
));
12743 /* Split the arguments specified in a "catch assert" command.
12745 ARGS contains the command's arguments (or the empty string if
12746 no arguments were passed).
12748 If ARGS contains a condition, set COND_STRING to that condition
12749 (the memory needs to be deallocated after use). */
12752 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
12754 args
= skip_spaces (args
);
12756 /* Check whether a condition was provided. */
12757 if (startswith (args
, "if")
12758 && (isspace (args
[2]) || args
[2] == '\0'))
12761 args
= skip_spaces (args
);
12762 if (args
[0] == '\0')
12763 error (_("condition missing after `if' keyword"));
12764 cond_string
.assign (args
);
12767 /* Otherwise, there should be no other argument at the end of
12769 else if (args
[0] != '\0')
12770 error (_("Junk at end of arguments."));
12773 /* Implement the "catch assert" command. */
12776 catch_assert_command (const char *arg_entry
, int from_tty
,
12777 struct cmd_list_element
*command
)
12779 const char *arg
= arg_entry
;
12780 struct gdbarch
*gdbarch
= get_current_arch ();
12782 std::string cond_string
;
12784 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12788 catch_ada_assert_command_split (arg
, cond_string
);
12789 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12791 tempflag
, 1 /* enabled */,
12795 /* Return non-zero if the symbol SYM is an Ada exception object. */
12798 ada_is_exception_sym (struct symbol
*sym
)
12800 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
12802 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12803 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12804 && SYMBOL_CLASS (sym
) != LOC_CONST
12805 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12806 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12809 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12810 Ada exception object. This matches all exceptions except the ones
12811 defined by the Ada language. */
12814 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12818 if (!ada_is_exception_sym (sym
))
12821 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12822 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
12823 return 0; /* A standard exception. */
12825 /* Numeric_Error is also a standard exception, so exclude it.
12826 See the STANDARD_EXC description for more details as to why
12827 this exception is not listed in that array. */
12828 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
12834 /* A helper function for std::sort, comparing two struct ada_exc_info
12837 The comparison is determined first by exception name, and then
12838 by exception address. */
12841 ada_exc_info::operator< (const ada_exc_info
&other
) const
12845 result
= strcmp (name
, other
.name
);
12848 if (result
== 0 && addr
< other
.addr
)
12854 ada_exc_info::operator== (const ada_exc_info
&other
) const
12856 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
12859 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12860 routine, but keeping the first SKIP elements untouched.
12862 All duplicates are also removed. */
12865 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
12868 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
12869 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
12870 exceptions
->end ());
12873 /* Add all exceptions defined by the Ada standard whose name match
12874 a regular expression.
12876 If PREG is not NULL, then this regexp_t object is used to
12877 perform the symbol name matching. Otherwise, no name-based
12878 filtering is performed.
12880 EXCEPTIONS is a vector of exceptions to which matching exceptions
12884 ada_add_standard_exceptions (compiled_regex
*preg
,
12885 std::vector
<ada_exc_info
> *exceptions
)
12889 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12892 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
12894 struct bound_minimal_symbol msymbol
12895 = ada_lookup_simple_minsym (standard_exc
[i
]);
12897 if (msymbol
.minsym
!= NULL
)
12899 struct ada_exc_info info
12900 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12902 exceptions
->push_back (info
);
12908 /* Add all Ada exceptions defined locally and accessible from the given
12911 If PREG is not NULL, then this regexp_t object is used to
12912 perform the symbol name matching. Otherwise, no name-based
12913 filtering is performed.
12915 EXCEPTIONS is a vector of exceptions to which matching exceptions
12919 ada_add_exceptions_from_frame (compiled_regex
*preg
,
12920 struct frame_info
*frame
,
12921 std::vector
<ada_exc_info
> *exceptions
)
12923 const struct block
*block
= get_frame_block (frame
, 0);
12927 struct block_iterator iter
;
12928 struct symbol
*sym
;
12930 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12932 switch (SYMBOL_CLASS (sym
))
12939 if (ada_is_exception_sym (sym
))
12941 struct ada_exc_info info
= {sym
->print_name (),
12942 SYMBOL_VALUE_ADDRESS (sym
)};
12944 exceptions
->push_back (info
);
12948 if (BLOCK_FUNCTION (block
) != NULL
)
12950 block
= BLOCK_SUPERBLOCK (block
);
12954 /* Return true if NAME matches PREG or if PREG is NULL. */
12957 name_matches_regex (const char *name
, compiled_regex
*preg
)
12959 return (preg
== NULL
12960 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
12963 /* Add all exceptions defined globally whose name name match
12964 a regular expression, excluding standard exceptions.
12966 The reason we exclude standard exceptions is that they need
12967 to be handled separately: Standard exceptions are defined inside
12968 a runtime unit which is normally not compiled with debugging info,
12969 and thus usually do not show up in our symbol search. However,
12970 if the unit was in fact built with debugging info, we need to
12971 exclude them because they would duplicate the entry we found
12972 during the special loop that specifically searches for those
12973 standard exceptions.
12975 If PREG is not NULL, then this regexp_t object is used to
12976 perform the symbol name matching. Otherwise, no name-based
12977 filtering is performed.
12979 EXCEPTIONS is a vector of exceptions to which matching exceptions
12983 ada_add_global_exceptions (compiled_regex
*preg
,
12984 std::vector
<ada_exc_info
> *exceptions
)
12986 /* In Ada, the symbol "search name" is a linkage name, whereas the
12987 regular expression used to do the matching refers to the natural
12988 name. So match against the decoded name. */
12989 expand_symtabs_matching (NULL
,
12990 lookup_name_info::match_any (),
12991 [&] (const char *search_name
)
12993 std::string decoded
= ada_decode (search_name
);
12994 return name_matches_regex (decoded
.c_str (), preg
);
12999 for (objfile
*objfile
: current_program_space
->objfiles ())
13001 for (compunit_symtab
*s
: objfile
->compunits ())
13003 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13006 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13008 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13009 struct block_iterator iter
;
13010 struct symbol
*sym
;
13012 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13013 if (ada_is_non_standard_exception_sym (sym
)
13014 && name_matches_regex (sym
->natural_name (), preg
))
13016 struct ada_exc_info info
13017 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13019 exceptions
->push_back (info
);
13026 /* Implements ada_exceptions_list with the regular expression passed
13027 as a regex_t, rather than a string.
13029 If not NULL, PREG is used to filter out exceptions whose names
13030 do not match. Otherwise, all exceptions are listed. */
13032 static std::vector
<ada_exc_info
>
13033 ada_exceptions_list_1 (compiled_regex
*preg
)
13035 std::vector
<ada_exc_info
> result
;
13038 /* First, list the known standard exceptions. These exceptions
13039 need to be handled separately, as they are usually defined in
13040 runtime units that have been compiled without debugging info. */
13042 ada_add_standard_exceptions (preg
, &result
);
13044 /* Next, find all exceptions whose scope is local and accessible
13045 from the currently selected frame. */
13047 if (has_stack_frames ())
13049 prev_len
= result
.size ();
13050 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13052 if (result
.size () > prev_len
)
13053 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13056 /* Add all exceptions whose scope is global. */
13058 prev_len
= result
.size ();
13059 ada_add_global_exceptions (preg
, &result
);
13060 if (result
.size () > prev_len
)
13061 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13066 /* Return a vector of ada_exc_info.
13068 If REGEXP is NULL, all exceptions are included in the result.
13069 Otherwise, it should contain a valid regular expression,
13070 and only the exceptions whose names match that regular expression
13071 are included in the result.
13073 The exceptions are sorted in the following order:
13074 - Standard exceptions (defined by the Ada language), in
13075 alphabetical order;
13076 - Exceptions only visible from the current frame, in
13077 alphabetical order;
13078 - Exceptions whose scope is global, in alphabetical order. */
13080 std::vector
<ada_exc_info
>
13081 ada_exceptions_list (const char *regexp
)
13083 if (regexp
== NULL
)
13084 return ada_exceptions_list_1 (NULL
);
13086 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13087 return ada_exceptions_list_1 (®
);
13090 /* Implement the "info exceptions" command. */
13093 info_exceptions_command (const char *regexp
, int from_tty
)
13095 struct gdbarch
*gdbarch
= get_current_arch ();
13097 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13099 if (regexp
!= NULL
)
13101 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13103 printf_filtered (_("All defined Ada exceptions:\n"));
13105 for (const ada_exc_info
&info
: exceptions
)
13106 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13110 /* Information about operators given special treatment in functions
13112 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13114 #define ADA_OPERATORS \
13115 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13116 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13117 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13118 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13119 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13120 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13121 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13122 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13123 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13124 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13125 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13126 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13127 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13128 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13129 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13130 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13131 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13132 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13133 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13136 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13139 switch (exp
->elts
[pc
- 1].opcode
)
13142 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13145 #define OP_DEFN(op, len, args, binop) \
13146 case op: *oplenp = len; *argsp = args; break;
13152 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13157 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13162 /* Implementation of the exp_descriptor method operator_check. */
13165 ada_operator_check (struct expression
*exp
, int pos
,
13166 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13169 const union exp_element
*const elts
= exp
->elts
;
13170 struct type
*type
= NULL
;
13172 switch (elts
[pos
].opcode
)
13174 case UNOP_IN_RANGE
:
13176 type
= elts
[pos
+ 1].type
;
13180 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13183 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13185 if (type
!= nullptr && type
->objfile_owner () != nullptr
13186 && objfile_func (type
->objfile_owner (), data
))
13192 /* As for operator_length, but assumes PC is pointing at the first
13193 element of the operator, and gives meaningful results only for the
13194 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13197 ada_forward_operator_length (struct expression
*exp
, int pc
,
13198 int *oplenp
, int *argsp
)
13200 switch (exp
->elts
[pc
].opcode
)
13203 *oplenp
= *argsp
= 0;
13206 #define OP_DEFN(op, len, args, binop) \
13207 case op: *oplenp = len; *argsp = args; break;
13213 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13218 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13224 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13226 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13234 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13236 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13241 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13245 /* Ada attributes ('Foo). */
13248 case OP_ATR_LENGTH
:
13252 case OP_ATR_MODULUS
:
13259 case UNOP_IN_RANGE
:
13261 /* XXX: gdb_sprint_host_address, type_sprint */
13262 fprintf_filtered (stream
, _("Type @"));
13263 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13264 fprintf_filtered (stream
, " (");
13265 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13266 fprintf_filtered (stream
, ")");
13268 case BINOP_IN_BOUNDS
:
13269 fprintf_filtered (stream
, " (%d)",
13270 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13272 case TERNOP_IN_RANGE
:
13277 case OP_DISCRETE_RANGE
:
13278 case OP_POSITIONAL
:
13285 char *name
= &exp
->elts
[elt
+ 2].string
;
13286 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13288 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13293 return dump_subexp_body_standard (exp
, stream
, elt
);
13297 for (i
= 0; i
< nargs
; i
+= 1)
13298 elt
= dump_subexp (exp
, stream
, elt
);
13303 /* The Ada extension of print_subexp (q.v.). */
13306 ada_print_subexp (struct expression
*exp
, int *pos
,
13307 struct ui_file
*stream
, enum precedence prec
)
13309 int oplen
, nargs
, i
;
13311 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13313 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13320 print_subexp_standard (exp
, pos
, stream
, prec
);
13324 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13327 case BINOP_IN_BOUNDS
:
13328 /* XXX: sprint_subexp */
13329 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13330 fputs_filtered (" in ", stream
);
13331 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13332 fputs_filtered ("'range", stream
);
13333 if (exp
->elts
[pc
+ 1].longconst
> 1)
13334 fprintf_filtered (stream
, "(%ld)",
13335 (long) exp
->elts
[pc
+ 1].longconst
);
13338 case TERNOP_IN_RANGE
:
13339 if (prec
>= PREC_EQUAL
)
13340 fputs_filtered ("(", stream
);
13341 /* XXX: sprint_subexp */
13342 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13343 fputs_filtered (" in ", stream
);
13344 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13345 fputs_filtered (" .. ", stream
);
13346 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13347 if (prec
>= PREC_EQUAL
)
13348 fputs_filtered (")", stream
);
13353 case OP_ATR_LENGTH
:
13357 case OP_ATR_MODULUS
:
13362 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13364 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13365 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13366 &type_print_raw_options
);
13370 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13371 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13376 for (tem
= 1; tem
< nargs
; tem
+= 1)
13378 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13379 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13381 fputs_filtered (")", stream
);
13386 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13387 fputs_filtered ("'(", stream
);
13388 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13389 fputs_filtered (")", stream
);
13392 case UNOP_IN_RANGE
:
13393 /* XXX: sprint_subexp */
13394 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13395 fputs_filtered (" in ", stream
);
13396 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13397 &type_print_raw_options
);
13400 case OP_DISCRETE_RANGE
:
13401 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13402 fputs_filtered ("..", stream
);
13403 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13407 fputs_filtered ("others => ", stream
);
13408 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13412 for (i
= 0; i
< nargs
-1; i
+= 1)
13415 fputs_filtered ("|", stream
);
13416 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13418 fputs_filtered (" => ", stream
);
13419 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13422 case OP_POSITIONAL
:
13423 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13427 fputs_filtered ("(", stream
);
13428 for (i
= 0; i
< nargs
; i
+= 1)
13431 fputs_filtered (", ", stream
);
13432 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13434 fputs_filtered (")", stream
);
13439 /* Table mapping opcodes into strings for printing operators
13440 and precedences of the operators. */
13442 static const struct op_print ada_op_print_tab
[] = {
13443 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13444 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13445 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13446 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13447 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13448 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13449 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13450 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13451 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13452 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13453 {">", BINOP_GTR
, PREC_ORDER
, 0},
13454 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13455 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13456 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13457 {"+", BINOP_ADD
, PREC_ADD
, 0},
13458 {"-", BINOP_SUB
, PREC_ADD
, 0},
13459 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13460 {"*", BINOP_MUL
, PREC_MUL
, 0},
13461 {"/", BINOP_DIV
, PREC_MUL
, 0},
13462 {"rem", BINOP_REM
, PREC_MUL
, 0},
13463 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13464 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13465 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13466 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13467 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13468 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13469 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13470 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13471 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13472 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13473 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13474 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13477 /* Language vector */
13479 static const struct exp_descriptor ada_exp_descriptor
= {
13481 ada_operator_length
,
13482 ada_operator_check
,
13483 ada_dump_subexp_body
,
13484 ada_evaluate_subexp
13487 /* symbol_name_matcher_ftype adapter for wild_match. */
13490 do_wild_match (const char *symbol_search_name
,
13491 const lookup_name_info
&lookup_name
,
13492 completion_match_result
*comp_match_res
)
13494 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13497 /* symbol_name_matcher_ftype adapter for full_match. */
13500 do_full_match (const char *symbol_search_name
,
13501 const lookup_name_info
&lookup_name
,
13502 completion_match_result
*comp_match_res
)
13504 const char *lname
= lookup_name
.ada ().lookup_name ().c_str ();
13506 /* If both symbols start with "_ada_", just let the loop below
13507 handle the comparison. However, if only the symbol name starts
13508 with "_ada_", skip the prefix and let the match proceed as
13510 if (startswith (symbol_search_name
, "_ada_")
13511 && !startswith (lname
, "_ada"))
13512 symbol_search_name
+= 5;
13514 int uscore_count
= 0;
13515 while (*lname
!= '\0')
13517 if (*symbol_search_name
!= *lname
)
13519 if (*symbol_search_name
== 'B' && uscore_count
== 2
13520 && symbol_search_name
[1] == '_')
13522 symbol_search_name
+= 2;
13523 while (isdigit (*symbol_search_name
))
13524 ++symbol_search_name
;
13525 if (symbol_search_name
[0] == '_'
13526 && symbol_search_name
[1] == '_')
13528 symbol_search_name
+= 2;
13535 if (*symbol_search_name
== '_')
13540 ++symbol_search_name
;
13544 return is_name_suffix (symbol_search_name
);
13547 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13550 do_exact_match (const char *symbol_search_name
,
13551 const lookup_name_info
&lookup_name
,
13552 completion_match_result
*comp_match_res
)
13554 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13557 /* Build the Ada lookup name for LOOKUP_NAME. */
13559 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13561 gdb::string_view user_name
= lookup_name
.name ();
13563 if (!user_name
.empty () && user_name
[0] == '<')
13565 if (user_name
.back () == '>')
13567 = gdb::to_string (user_name
.substr (1, user_name
.size () - 2));
13570 = gdb::to_string (user_name
.substr (1, user_name
.size () - 1));
13571 m_encoded_p
= true;
13572 m_verbatim_p
= true;
13573 m_wild_match_p
= false;
13574 m_standard_p
= false;
13578 m_verbatim_p
= false;
13580 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13584 const char *folded
= ada_fold_name (user_name
);
13585 m_encoded_name
= ada_encode_1 (folded
, false);
13586 if (m_encoded_name
.empty ())
13587 m_encoded_name
= gdb::to_string (user_name
);
13590 m_encoded_name
= gdb::to_string (user_name
);
13592 /* Handle the 'package Standard' special case. See description
13593 of m_standard_p. */
13594 if (startswith (m_encoded_name
.c_str (), "standard__"))
13596 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13597 m_standard_p
= true;
13600 m_standard_p
= false;
13602 /* If the name contains a ".", then the user is entering a fully
13603 qualified entity name, and the match must not be done in wild
13604 mode. Similarly, if the user wants to complete what looks
13605 like an encoded name, the match must not be done in wild
13606 mode. Also, in the standard__ special case always do
13607 non-wild matching. */
13609 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13612 && user_name
.find ('.') == std::string::npos
);
13616 /* symbol_name_matcher_ftype method for Ada. This only handles
13617 completion mode. */
13620 ada_symbol_name_matches (const char *symbol_search_name
,
13621 const lookup_name_info
&lookup_name
,
13622 completion_match_result
*comp_match_res
)
13624 return lookup_name
.ada ().matches (symbol_search_name
,
13625 lookup_name
.match_type (),
13629 /* A name matcher that matches the symbol name exactly, with
13633 literal_symbol_name_matcher (const char *symbol_search_name
,
13634 const lookup_name_info
&lookup_name
,
13635 completion_match_result
*comp_match_res
)
13637 gdb::string_view name_view
= lookup_name
.name ();
13639 if (lookup_name
.completion_mode ()
13640 ? (strncmp (symbol_search_name
, name_view
.data (),
13641 name_view
.size ()) == 0)
13642 : symbol_search_name
== name_view
)
13644 if (comp_match_res
!= NULL
)
13645 comp_match_res
->set_match (symbol_search_name
);
13652 /* Implement the "get_symbol_name_matcher" language_defn method for
13655 static symbol_name_matcher_ftype
*
13656 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
13658 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
13659 return literal_symbol_name_matcher
;
13661 if (lookup_name
.completion_mode ())
13662 return ada_symbol_name_matches
;
13665 if (lookup_name
.ada ().wild_match_p ())
13666 return do_wild_match
;
13667 else if (lookup_name
.ada ().verbatim_p ())
13668 return do_exact_match
;
13670 return do_full_match
;
13674 /* Class representing the Ada language. */
13676 class ada_language
: public language_defn
13680 : language_defn (language_ada
)
13683 /* See language.h. */
13685 const char *name () const override
13688 /* See language.h. */
13690 const char *natural_name () const override
13693 /* See language.h. */
13695 const std::vector
<const char *> &filename_extensions () const override
13697 static const std::vector
<const char *> extensions
13698 = { ".adb", ".ads", ".a", ".ada", ".dg" };
13702 /* Print an array element index using the Ada syntax. */
13704 void print_array_index (struct type
*index_type
,
13706 struct ui_file
*stream
,
13707 const value_print_options
*options
) const override
13709 struct value
*index_value
= val_atr (index_type
, index
);
13711 value_print (index_value
, stream
, options
);
13712 fprintf_filtered (stream
, " => ");
13715 /* Implement the "read_var_value" language_defn method for Ada. */
13717 struct value
*read_var_value (struct symbol
*var
,
13718 const struct block
*var_block
,
13719 struct frame_info
*frame
) const override
13721 /* The only case where default_read_var_value is not sufficient
13722 is when VAR is a renaming... */
13723 if (frame
!= nullptr)
13725 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
13726 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
13727 return ada_read_renaming_var_value (var
, frame_block
);
13730 /* This is a typical case where we expect the default_read_var_value
13731 function to work. */
13732 return language_defn::read_var_value (var
, var_block
, frame
);
13735 /* See language.h. */
13736 void language_arch_info (struct gdbarch
*gdbarch
,
13737 struct language_arch_info
*lai
) const override
13739 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13741 /* Helper function to allow shorter lines below. */
13742 auto add
= [&] (struct type
*t
)
13744 lai
->add_primitive_type (t
);
13747 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13749 add (arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13750 0, "long_integer"));
13751 add (arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13752 0, "short_integer"));
13753 struct type
*char_type
= arch_character_type (gdbarch
, TARGET_CHAR_BIT
,
13755 lai
->set_string_char_type (char_type
);
13757 add (arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13758 "float", gdbarch_float_format (gdbarch
)));
13759 add (arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13760 "long_float", gdbarch_double_format (gdbarch
)));
13761 add (arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13762 0, "long_long_integer"));
13763 add (arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13765 gdbarch_long_double_format (gdbarch
)));
13766 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13768 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13770 add (builtin
->builtin_void
);
13772 struct type
*system_addr_ptr
13773 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13775 system_addr_ptr
->set_name ("system__address");
13776 add (system_addr_ptr
);
13778 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13779 type. This is a signed integral type whose size is the same as
13780 the size of addresses. */
13781 unsigned int addr_length
= TYPE_LENGTH (system_addr_ptr
);
13782 add (arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13783 "storage_offset"));
13785 lai
->set_bool_type (builtin
->builtin_bool
);
13788 /* See language.h. */
13790 bool iterate_over_symbols
13791 (const struct block
*block
, const lookup_name_info
&name
,
13792 domain_enum domain
,
13793 gdb::function_view
<symbol_found_callback_ftype
> callback
) const override
13795 std::vector
<struct block_symbol
> results
13796 = ada_lookup_symbol_list_worker (name
, block
, domain
, 0);
13797 for (block_symbol
&sym
: results
)
13799 if (!callback (&sym
))
13806 /* See language.h. */
13807 bool sniff_from_mangled_name (const char *mangled
,
13808 char **out
) const override
13810 std::string demangled
= ada_decode (mangled
);
13814 if (demangled
!= mangled
&& demangled
[0] != '<')
13816 /* Set the gsymbol language to Ada, but still return 0.
13817 Two reasons for that:
13819 1. For Ada, we prefer computing the symbol's decoded name
13820 on the fly rather than pre-compute it, in order to save
13821 memory (Ada projects are typically very large).
13823 2. There are some areas in the definition of the GNAT
13824 encoding where, with a bit of bad luck, we might be able
13825 to decode a non-Ada symbol, generating an incorrect
13826 demangled name (Eg: names ending with "TB" for instance
13827 are identified as task bodies and so stripped from
13828 the decoded name returned).
13830 Returning true, here, but not setting *DEMANGLED, helps us get
13831 a little bit of the best of both worlds. Because we're last,
13832 we should not affect any of the other languages that were
13833 able to demangle the symbol before us; we get to correctly
13834 tag Ada symbols as such; and even if we incorrectly tagged a
13835 non-Ada symbol, which should be rare, any routing through the
13836 Ada language should be transparent (Ada tries to behave much
13837 like C/C++ with non-Ada symbols). */
13844 /* See language.h. */
13846 char *demangle_symbol (const char *mangled
, int options
) const override
13848 return ada_la_decode (mangled
, options
);
13851 /* See language.h. */
13853 void print_type (struct type
*type
, const char *varstring
,
13854 struct ui_file
*stream
, int show
, int level
,
13855 const struct type_print_options
*flags
) const override
13857 ada_print_type (type
, varstring
, stream
, show
, level
, flags
);
13860 /* See language.h. */
13862 const char *word_break_characters (void) const override
13864 return ada_completer_word_break_characters
;
13867 /* See language.h. */
13869 void collect_symbol_completion_matches (completion_tracker
&tracker
,
13870 complete_symbol_mode mode
,
13871 symbol_name_match_type name_match_type
,
13872 const char *text
, const char *word
,
13873 enum type_code code
) const override
13875 struct symbol
*sym
;
13876 const struct block
*b
, *surrounding_static_block
= 0;
13877 struct block_iterator iter
;
13879 gdb_assert (code
== TYPE_CODE_UNDEF
);
13881 lookup_name_info
lookup_name (text
, name_match_type
, true);
13883 /* First, look at the partial symtab symbols. */
13884 expand_symtabs_matching (NULL
,
13890 /* At this point scan through the misc symbol vectors and add each
13891 symbol you find to the list. Eventually we want to ignore
13892 anything that isn't a text symbol (everything else will be
13893 handled by the psymtab code above). */
13895 for (objfile
*objfile
: current_program_space
->objfiles ())
13897 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
13901 if (completion_skip_symbol (mode
, msymbol
))
13904 language symbol_language
= msymbol
->language ();
13906 /* Ada minimal symbols won't have their language set to Ada. If
13907 we let completion_list_add_name compare using the
13908 default/C-like matcher, then when completing e.g., symbols in a
13909 package named "pck", we'd match internal Ada symbols like
13910 "pckS", which are invalid in an Ada expression, unless you wrap
13911 them in '<' '>' to request a verbatim match.
13913 Unfortunately, some Ada encoded names successfully demangle as
13914 C++ symbols (using an old mangling scheme), such as "name__2Xn"
13915 -> "Xn::name(void)" and thus some Ada minimal symbols end up
13916 with the wrong language set. Paper over that issue here. */
13917 if (symbol_language
== language_auto
13918 || symbol_language
== language_cplus
)
13919 symbol_language
= language_ada
;
13921 completion_list_add_name (tracker
,
13923 msymbol
->linkage_name (),
13924 lookup_name
, text
, word
);
13928 /* Search upwards from currently selected frame (so that we can
13929 complete on local vars. */
13931 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
13933 if (!BLOCK_SUPERBLOCK (b
))
13934 surrounding_static_block
= b
; /* For elmin of dups */
13936 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13938 if (completion_skip_symbol (mode
, sym
))
13941 completion_list_add_name (tracker
,
13943 sym
->linkage_name (),
13944 lookup_name
, text
, word
);
13948 /* Go through the symtabs and check the externs and statics for
13949 symbols which match. */
13951 for (objfile
*objfile
: current_program_space
->objfiles ())
13953 for (compunit_symtab
*s
: objfile
->compunits ())
13956 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
13957 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13959 if (completion_skip_symbol (mode
, sym
))
13962 completion_list_add_name (tracker
,
13964 sym
->linkage_name (),
13965 lookup_name
, text
, word
);
13970 for (objfile
*objfile
: current_program_space
->objfiles ())
13972 for (compunit_symtab
*s
: objfile
->compunits ())
13975 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
13976 /* Don't do this block twice. */
13977 if (b
== surrounding_static_block
)
13979 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13981 if (completion_skip_symbol (mode
, sym
))
13984 completion_list_add_name (tracker
,
13986 sym
->linkage_name (),
13987 lookup_name
, text
, word
);
13993 /* See language.h. */
13995 gdb::unique_xmalloc_ptr
<char> watch_location_expression
13996 (struct type
*type
, CORE_ADDR addr
) const override
13998 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
13999 std::string name
= type_to_string (type
);
14000 return gdb::unique_xmalloc_ptr
<char>
14001 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
14004 /* See language.h. */
14006 void value_print (struct value
*val
, struct ui_file
*stream
,
14007 const struct value_print_options
*options
) const override
14009 return ada_value_print (val
, stream
, options
);
14012 /* See language.h. */
14014 void value_print_inner
14015 (struct value
*val
, struct ui_file
*stream
, int recurse
,
14016 const struct value_print_options
*options
) const override
14018 return ada_value_print_inner (val
, stream
, recurse
, options
);
14021 /* See language.h. */
14023 struct block_symbol lookup_symbol_nonlocal
14024 (const char *name
, const struct block
*block
,
14025 const domain_enum domain
) const override
14027 struct block_symbol sym
;
14029 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
14030 if (sym
.symbol
!= NULL
)
14033 /* If we haven't found a match at this point, try the primitive
14034 types. In other languages, this search is performed before
14035 searching for global symbols in order to short-circuit that
14036 global-symbol search if it happens that the name corresponds
14037 to a primitive type. But we cannot do the same in Ada, because
14038 it is perfectly legitimate for a program to declare a type which
14039 has the same name as a standard type. If looking up a type in
14040 that situation, we have traditionally ignored the primitive type
14041 in favor of user-defined types. This is why, unlike most other
14042 languages, we search the primitive types this late and only after
14043 having searched the global symbols without success. */
14045 if (domain
== VAR_DOMAIN
)
14047 struct gdbarch
*gdbarch
;
14050 gdbarch
= target_gdbarch ();
14052 gdbarch
= block_gdbarch (block
);
14054 = language_lookup_primitive_type_as_symbol (this, gdbarch
, name
);
14055 if (sym
.symbol
!= NULL
)
14062 /* See language.h. */
14064 int parser (struct parser_state
*ps
) const override
14066 warnings_issued
= 0;
14067 return ada_parse (ps
);
14072 Same as evaluate_type (*EXP), but resolves ambiguous symbol references
14073 (marked by OP_VAR_VALUE nodes in which the symbol has an undefined
14074 namespace) and converts operators that are user-defined into
14075 appropriate function calls. If CONTEXT_TYPE is non-null, it provides
14076 a preferred result type [at the moment, only type void has any
14077 effect---causing procedures to be preferred over functions in calls].
14078 A null CONTEXT_TYPE indicates that a non-void return type is
14079 preferred. May change (expand) *EXP. */
14081 void post_parser (expression_up
*expp
, struct parser_state
*ps
)
14084 struct type
*context_type
= NULL
;
14087 if (ps
->void_context_p
)
14088 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
14090 resolve_subexp (expp
, &pc
, 1, context_type
, ps
->parse_completion
,
14091 ps
->block_tracker
);
14094 /* See language.h. */
14096 void emitchar (int ch
, struct type
*chtype
,
14097 struct ui_file
*stream
, int quoter
) const override
14099 ada_emit_char (ch
, chtype
, stream
, quoter
, 1);
14102 /* See language.h. */
14104 void printchar (int ch
, struct type
*chtype
,
14105 struct ui_file
*stream
) const override
14107 ada_printchar (ch
, chtype
, stream
);
14110 /* See language.h. */
14112 void printstr (struct ui_file
*stream
, struct type
*elttype
,
14113 const gdb_byte
*string
, unsigned int length
,
14114 const char *encoding
, int force_ellipses
,
14115 const struct value_print_options
*options
) const override
14117 ada_printstr (stream
, elttype
, string
, length
, encoding
,
14118 force_ellipses
, options
);
14121 /* See language.h. */
14123 void print_typedef (struct type
*type
, struct symbol
*new_symbol
,
14124 struct ui_file
*stream
) const override
14126 ada_print_typedef (type
, new_symbol
, stream
);
14129 /* See language.h. */
14131 bool is_string_type_p (struct type
*type
) const override
14133 return ada_is_string_type (type
);
14136 /* See language.h. */
14138 const char *struct_too_deep_ellipsis () const override
14139 { return "(...)"; }
14141 /* See language.h. */
14143 bool c_style_arrays_p () const override
14146 /* See language.h. */
14148 bool store_sym_names_in_linkage_form_p () const override
14151 /* See language.h. */
14153 const struct lang_varobj_ops
*varobj_ops () const override
14154 { return &ada_varobj_ops
; }
14156 /* See language.h. */
14158 const struct exp_descriptor
*expression_ops () const override
14159 { return &ada_exp_descriptor
; }
14161 /* See language.h. */
14163 const struct op_print
*opcode_print_table () const override
14164 { return ada_op_print_tab
; }
14167 /* See language.h. */
14169 symbol_name_matcher_ftype
*get_symbol_name_matcher_inner
14170 (const lookup_name_info
&lookup_name
) const override
14172 return ada_get_symbol_name_matcher (lookup_name
);
14176 /* Single instance of the Ada language class. */
14178 static ada_language ada_language_defn
;
14180 /* Command-list for the "set/show ada" prefix command. */
14181 static struct cmd_list_element
*set_ada_list
;
14182 static struct cmd_list_element
*show_ada_list
;
14185 initialize_ada_catchpoint_ops (void)
14187 struct breakpoint_ops
*ops
;
14189 initialize_breakpoint_ops ();
14191 ops
= &catch_exception_breakpoint_ops
;
14192 *ops
= bkpt_breakpoint_ops
;
14193 ops
->allocate_location
= allocate_location_exception
;
14194 ops
->re_set
= re_set_exception
;
14195 ops
->check_status
= check_status_exception
;
14196 ops
->print_it
= print_it_exception
;
14197 ops
->print_one
= print_one_exception
;
14198 ops
->print_mention
= print_mention_exception
;
14199 ops
->print_recreate
= print_recreate_exception
;
14201 ops
= &catch_exception_unhandled_breakpoint_ops
;
14202 *ops
= bkpt_breakpoint_ops
;
14203 ops
->allocate_location
= allocate_location_exception
;
14204 ops
->re_set
= re_set_exception
;
14205 ops
->check_status
= check_status_exception
;
14206 ops
->print_it
= print_it_exception
;
14207 ops
->print_one
= print_one_exception
;
14208 ops
->print_mention
= print_mention_exception
;
14209 ops
->print_recreate
= print_recreate_exception
;
14211 ops
= &catch_assert_breakpoint_ops
;
14212 *ops
= bkpt_breakpoint_ops
;
14213 ops
->allocate_location
= allocate_location_exception
;
14214 ops
->re_set
= re_set_exception
;
14215 ops
->check_status
= check_status_exception
;
14216 ops
->print_it
= print_it_exception
;
14217 ops
->print_one
= print_one_exception
;
14218 ops
->print_mention
= print_mention_exception
;
14219 ops
->print_recreate
= print_recreate_exception
;
14221 ops
= &catch_handlers_breakpoint_ops
;
14222 *ops
= bkpt_breakpoint_ops
;
14223 ops
->allocate_location
= allocate_location_exception
;
14224 ops
->re_set
= re_set_exception
;
14225 ops
->check_status
= check_status_exception
;
14226 ops
->print_it
= print_it_exception
;
14227 ops
->print_one
= print_one_exception
;
14228 ops
->print_mention
= print_mention_exception
;
14229 ops
->print_recreate
= print_recreate_exception
;
14232 /* This module's 'new_objfile' observer. */
14235 ada_new_objfile_observer (struct objfile
*objfile
)
14237 ada_clear_symbol_cache ();
14240 /* This module's 'free_objfile' observer. */
14243 ada_free_objfile_observer (struct objfile
*objfile
)
14245 ada_clear_symbol_cache ();
14248 void _initialize_ada_language ();
14250 _initialize_ada_language ()
14252 initialize_ada_catchpoint_ops ();
14254 add_basic_prefix_cmd ("ada", no_class
,
14255 _("Prefix command for changing Ada-specific settings."),
14256 &set_ada_list
, "set ada ", 0, &setlist
);
14258 add_show_prefix_cmd ("ada", no_class
,
14259 _("Generic command for showing Ada-specific settings."),
14260 &show_ada_list
, "show ada ", 0, &showlist
);
14262 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14263 &trust_pad_over_xvs
, _("\
14264 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14265 Show whether an optimization trusting PAD types over XVS types is activated."),
14267 This is related to the encoding used by the GNAT compiler. The debugger\n\
14268 should normally trust the contents of PAD types, but certain older versions\n\
14269 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14270 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14271 work around this bug. It is always safe to turn this option \"off\", but\n\
14272 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14273 this option to \"off\" unless necessary."),
14274 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14276 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14277 &print_signatures
, _("\
14278 Enable or disable the output of formal and return types for functions in the \
14279 overloads selection menu."), _("\
14280 Show whether the output of formal and return types for functions in the \
14281 overloads selection menu is activated."),
14282 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14284 add_catch_command ("exception", _("\
14285 Catch Ada exceptions, when raised.\n\
14286 Usage: catch exception [ARG] [if CONDITION]\n\
14287 Without any argument, stop when any Ada exception is raised.\n\
14288 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14289 being raised does not have a handler (and will therefore lead to the task's\n\
14291 Otherwise, the catchpoint only stops when the name of the exception being\n\
14292 raised is the same as ARG.\n\
14293 CONDITION is a boolean expression that is evaluated to see whether the\n\
14294 exception should cause a stop."),
14295 catch_ada_exception_command
,
14296 catch_ada_completer
,
14300 add_catch_command ("handlers", _("\
14301 Catch Ada exceptions, when handled.\n\
14302 Usage: catch handlers [ARG] [if CONDITION]\n\
14303 Without any argument, stop when any Ada exception is handled.\n\
14304 With an argument, catch only exceptions with the given name.\n\
14305 CONDITION is a boolean expression that is evaluated to see whether the\n\
14306 exception should cause a stop."),
14307 catch_ada_handlers_command
,
14308 catch_ada_completer
,
14311 add_catch_command ("assert", _("\
14312 Catch failed Ada assertions, when raised.\n\
14313 Usage: catch assert [if CONDITION]\n\
14314 CONDITION is a boolean expression that is evaluated to see whether the\n\
14315 exception should cause a stop."),
14316 catch_assert_command
,
14321 varsize_limit
= 65536;
14322 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14323 &varsize_limit
, _("\
14324 Set the maximum number of bytes allowed in a variable-size object."), _("\
14325 Show the maximum number of bytes allowed in a variable-size object."), _("\
14326 Attempts to access an object whose size is not a compile-time constant\n\
14327 and exceeds this limit will cause an error."),
14328 NULL
, NULL
, &setlist
, &showlist
);
14330 add_info ("exceptions", info_exceptions_command
,
14332 List all Ada exception names.\n\
14333 Usage: info exceptions [REGEXP]\n\
14334 If a regular expression is passed as an argument, only those matching\n\
14335 the regular expression are listed."));
14337 add_basic_prefix_cmd ("ada", class_maintenance
,
14338 _("Set Ada maintenance-related variables."),
14339 &maint_set_ada_cmdlist
, "maintenance set ada ",
14340 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14342 add_show_prefix_cmd ("ada", class_maintenance
,
14343 _("Show Ada maintenance-related variables."),
14344 &maint_show_ada_cmdlist
, "maintenance show ada ",
14345 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14347 add_setshow_boolean_cmd
14348 ("ignore-descriptive-types", class_maintenance
,
14349 &ada_ignore_descriptive_types_p
,
14350 _("Set whether descriptive types generated by GNAT should be ignored."),
14351 _("Show whether descriptive types generated by GNAT should be ignored."),
14353 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14354 DWARF attribute."),
14355 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14357 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14358 NULL
, xcalloc
, xfree
);
14360 /* The ada-lang observers. */
14361 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14362 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14363 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);