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 /* See ada-lang.h. */
3420 ada_find_operator_symbol (enum exp_opcode op
, int parse_completion
,
3421 int nargs
, value
*argvec
[])
3423 if (possible_user_operator_p (op
, argvec
))
3425 std::vector
<struct block_symbol
> candidates
3426 = ada_lookup_symbol_list (ada_decoded_op_name (op
),
3429 int i
= ada_resolve_function (candidates
, argvec
,
3430 nargs
, ada_decoded_op_name (op
), NULL
,
3433 return candidates
[i
];
3438 /* See ada-lang.h. */
3441 ada_resolve_funcall (struct symbol
*sym
, const struct block
*block
,
3442 struct type
*context_type
,
3443 int parse_completion
,
3444 int nargs
, value
*argvec
[],
3445 innermost_block_tracker
*tracker
)
3447 std::vector
<struct block_symbol
> candidates
3448 = ada_lookup_symbol_list (sym
->linkage_name (), block
, VAR_DOMAIN
);
3451 if (candidates
.size () == 1)
3455 i
= ada_resolve_function
3458 sym
->linkage_name (),
3459 context_type
, parse_completion
);
3461 error (_("Could not find a match for %s"), sym
->print_name ());
3464 tracker
->update (candidates
[i
]);
3465 return candidates
[i
];
3468 /* See ada-lang.h. */
3471 ada_resolve_variable (struct symbol
*sym
, const struct block
*block
,
3472 struct type
*context_type
,
3473 int parse_completion
,
3475 innermost_block_tracker
*tracker
)
3477 std::vector
<struct block_symbol
> candidates
3478 = ada_lookup_symbol_list (sym
->linkage_name (), block
, VAR_DOMAIN
);
3480 if (std::any_of (candidates
.begin (),
3482 [] (block_symbol
&bsym
)
3484 switch (SYMBOL_CLASS (bsym
.symbol
))
3489 case LOC_REGPARM_ADDR
:
3498 /* Types tend to get re-introduced locally, so if there
3499 are any local symbols that are not types, first filter
3503 (candidates
.begin (),
3505 [] (block_symbol
&bsym
)
3507 return SYMBOL_CLASS (bsym
.symbol
) == LOC_TYPEDEF
;
3513 if (candidates
.empty ())
3514 error (_("No definition found for %s"), sym
->print_name ());
3515 else if (candidates
.size () == 1)
3517 else if (deprocedure_p
&& !is_nonfunction (candidates
))
3519 i
= ada_resolve_function
3520 (candidates
, NULL
, 0,
3521 sym
->linkage_name (),
3522 context_type
, parse_completion
);
3524 error (_("Could not find a match for %s"), sym
->print_name ());
3528 printf_filtered (_("Multiple matches for %s\n"), sym
->print_name ());
3529 user_select_syms (candidates
.data (), candidates
.size (), 1);
3533 tracker
->update (candidates
[i
]);
3534 return candidates
[i
];
3537 /* Resolve the operator of the subexpression beginning at
3538 position *POS of *EXPP. "Resolving" consists of replacing
3539 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3540 with their resolutions, replacing built-in operators with
3541 function calls to user-defined operators, where appropriate, and,
3542 when DEPROCEDURE_P is non-zero, converting function-valued variables
3543 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3544 are as in ada_resolve, above. */
3546 static struct value
*
3547 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3548 struct type
*context_type
, int parse_completion
,
3549 innermost_block_tracker
*tracker
)
3553 struct expression
*exp
; /* Convenience: == *expp. */
3554 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3555 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3556 int nargs
; /* Number of operands. */
3558 /* If we're resolving an expression like ARRAY(ARG...), then we set
3559 this to the type of the array, so we can use the index types as
3560 the expected types for resolution. */
3561 struct type
*array_type
= nullptr;
3562 /* The arity of ARRAY_TYPE. */
3563 int array_arity
= 0;
3569 /* Pass one: resolve operands, saving their types and updating *pos,
3574 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3575 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3580 struct value
*lhs
= resolve_subexp (expp
, pos
, 0, NULL
,
3581 parse_completion
, tracker
);
3582 struct type
*lhstype
= ada_check_typedef (value_type (lhs
));
3583 array_arity
= ada_array_arity (lhstype
);
3584 if (array_arity
> 0)
3585 array_type
= lhstype
;
3587 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3592 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3597 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3598 parse_completion
, tracker
);
3601 case OP_ATR_MODULUS
:
3611 case TERNOP_IN_RANGE
:
3612 case BINOP_IN_BOUNDS
:
3618 case OP_DISCRETE_RANGE
:
3620 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3629 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3631 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3633 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3651 case BINOP_LOGICAL_AND
:
3652 case BINOP_LOGICAL_OR
:
3653 case BINOP_BITWISE_AND
:
3654 case BINOP_BITWISE_IOR
:
3655 case BINOP_BITWISE_XOR
:
3658 case BINOP_NOTEQUAL
:
3665 case BINOP_SUBSCRIPT
:
3673 case UNOP_LOGICAL_NOT
:
3683 case OP_VAR_MSYM_VALUE
:
3690 case OP_INTERNALVAR
:
3700 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3703 case STRUCTOP_STRUCT
:
3704 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3717 error (_("Unexpected operator during name resolution"));
3720 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3721 for (i
= 0; i
< nargs
; i
+= 1)
3723 struct type
*subtype
= nullptr;
3724 if (i
< array_arity
)
3725 subtype
= ada_index_type (array_type
, i
+ 1, "array type");
3726 argvec
[i
] = resolve_subexp (expp
, pos
, 1, subtype
, parse_completion
,
3732 /* Pass two: perform any resolution on principal operator. */
3739 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3741 block_symbol resolved
3742 = ada_resolve_variable (exp
->elts
[pc
+ 2].symbol
,
3743 exp
->elts
[pc
+ 1].block
,
3744 context_type
, parse_completion
,
3745 deprocedure_p
, tracker
);
3746 exp
->elts
[pc
+ 1].block
= resolved
.block
;
3747 exp
->elts
[pc
+ 2].symbol
= resolved
.symbol
;
3751 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3754 replace_operator_with_call (expp
, pc
, 0, 4,
3755 exp
->elts
[pc
+ 2].symbol
,
3756 exp
->elts
[pc
+ 1].block
);
3763 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3764 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3766 block_symbol resolved
3767 = ada_resolve_funcall (exp
->elts
[pc
+ 5].symbol
,
3768 exp
->elts
[pc
+ 4].block
,
3769 context_type
, parse_completion
,
3772 exp
->elts
[pc
+ 4].block
= resolved
.block
;
3773 exp
->elts
[pc
+ 5].symbol
= resolved
.symbol
;
3784 case BINOP_BITWISE_AND
:
3785 case BINOP_BITWISE_IOR
:
3786 case BINOP_BITWISE_XOR
:
3788 case BINOP_NOTEQUAL
:
3796 case UNOP_LOGICAL_NOT
:
3799 block_symbol found
= ada_find_operator_symbol (op
, parse_completion
,
3801 if (found
.symbol
== nullptr)
3804 replace_operator_with_call (expp
, pc
, nargs
, 1,
3805 found
.symbol
, found
.block
);
3816 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3817 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3818 exp
->elts
[pc
+ 1].objfile
,
3819 exp
->elts
[pc
+ 2].msymbol
);
3821 return evaluate_subexp_type (exp
, pos
);
3824 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3825 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3827 /* The term "match" here is rather loose. The match is heuristic and
3831 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3833 ftype
= ada_check_typedef (ftype
);
3834 atype
= ada_check_typedef (atype
);
3836 if (ftype
->code () == TYPE_CODE_REF
)
3837 ftype
= TYPE_TARGET_TYPE (ftype
);
3838 if (atype
->code () == TYPE_CODE_REF
)
3839 atype
= TYPE_TARGET_TYPE (atype
);
3841 switch (ftype
->code ())
3844 return ftype
->code () == atype
->code ();
3846 if (atype
->code () == TYPE_CODE_PTR
)
3847 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3848 TYPE_TARGET_TYPE (atype
), 0);
3851 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3853 case TYPE_CODE_ENUM
:
3854 case TYPE_CODE_RANGE
:
3855 switch (atype
->code ())
3858 case TYPE_CODE_ENUM
:
3859 case TYPE_CODE_RANGE
:
3865 case TYPE_CODE_ARRAY
:
3866 return (atype
->code () == TYPE_CODE_ARRAY
3867 || ada_is_array_descriptor_type (atype
));
3869 case TYPE_CODE_STRUCT
:
3870 if (ada_is_array_descriptor_type (ftype
))
3871 return (atype
->code () == TYPE_CODE_ARRAY
3872 || ada_is_array_descriptor_type (atype
));
3874 return (atype
->code () == TYPE_CODE_STRUCT
3875 && !ada_is_array_descriptor_type (atype
));
3877 case TYPE_CODE_UNION
:
3879 return (atype
->code () == ftype
->code ());
3883 /* Return non-zero if the formals of FUNC "sufficiently match" the
3884 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3885 may also be an enumeral, in which case it is treated as a 0-
3886 argument function. */
3889 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3892 struct type
*func_type
= SYMBOL_TYPE (func
);
3894 if (SYMBOL_CLASS (func
) == LOC_CONST
3895 && func_type
->code () == TYPE_CODE_ENUM
)
3896 return (n_actuals
== 0);
3897 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3900 if (func_type
->num_fields () != n_actuals
)
3903 for (i
= 0; i
< n_actuals
; i
+= 1)
3905 if (actuals
[i
] == NULL
)
3909 struct type
*ftype
= ada_check_typedef (func_type
->field (i
).type ());
3910 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3912 if (!ada_type_match (ftype
, atype
, 1))
3919 /* False iff function type FUNC_TYPE definitely does not produce a value
3920 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3921 FUNC_TYPE is not a valid function type with a non-null return type
3922 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3925 return_match (struct type
*func_type
, struct type
*context_type
)
3927 struct type
*return_type
;
3929 if (func_type
== NULL
)
3932 if (func_type
->code () == TYPE_CODE_FUNC
)
3933 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3935 return_type
= get_base_type (func_type
);
3936 if (return_type
== NULL
)
3939 context_type
= get_base_type (context_type
);
3941 if (return_type
->code () == TYPE_CODE_ENUM
)
3942 return context_type
== NULL
|| return_type
== context_type
;
3943 else if (context_type
== NULL
)
3944 return return_type
->code () != TYPE_CODE_VOID
;
3946 return return_type
->code () == context_type
->code ();
3950 /* Returns the index in SYMS that contains the symbol for the
3951 function (if any) that matches the types of the NARGS arguments in
3952 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3953 that returns that type, then eliminate matches that don't. If
3954 CONTEXT_TYPE is void and there is at least one match that does not
3955 return void, eliminate all matches that do.
3957 Asks the user if there is more than one match remaining. Returns -1
3958 if there is no such symbol or none is selected. NAME is used
3959 solely for messages. May re-arrange and modify SYMS in
3960 the process; the index returned is for the modified vector. */
3963 ada_resolve_function (std::vector
<struct block_symbol
> &syms
,
3964 struct value
**args
, int nargs
,
3965 const char *name
, struct type
*context_type
,
3966 int parse_completion
)
3970 int m
; /* Number of hits */
3973 /* In the first pass of the loop, we only accept functions matching
3974 context_type. If none are found, we add a second pass of the loop
3975 where every function is accepted. */
3976 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3978 for (k
= 0; k
< syms
.size (); k
+= 1)
3980 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3982 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3983 && (fallback
|| return_match (type
, context_type
)))
3991 /* If we got multiple matches, ask the user which one to use. Don't do this
3992 interactive thing during completion, though, as the purpose of the
3993 completion is providing a list of all possible matches. Prompting the
3994 user to filter it down would be completely unexpected in this case. */
3997 else if (m
> 1 && !parse_completion
)
3999 printf_filtered (_("Multiple matches for %s\n"), name
);
4000 user_select_syms (syms
.data (), m
, 1);
4006 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4007 on the function identified by SYM and BLOCK, and taking NARGS
4008 arguments. Update *EXPP as needed to hold more space. */
4011 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4012 int oplen
, struct symbol
*sym
,
4013 const struct block
*block
)
4015 /* We want to add 6 more elements (3 for funcall, 4 for function
4016 symbol, -OPLEN for operator being replaced) to the
4018 struct expression
*exp
= expp
->get ();
4019 int save_nelts
= exp
->nelts
;
4020 int extra_elts
= 7 - oplen
;
4021 exp
->nelts
+= extra_elts
;
4024 exp
->resize (exp
->nelts
);
4025 memmove (exp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4026 EXP_ELEM_TO_BYTES (save_nelts
- pc
- oplen
));
4028 exp
->resize (exp
->nelts
);
4030 exp
->elts
[pc
].opcode
= exp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4031 exp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4033 exp
->elts
[pc
+ 3].opcode
= exp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4034 exp
->elts
[pc
+ 4].block
= block
;
4035 exp
->elts
[pc
+ 5].symbol
= sym
;
4038 /* Type-class predicates */
4040 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4044 numeric_type_p (struct type
*type
)
4050 switch (type
->code ())
4055 case TYPE_CODE_RANGE
:
4056 return (type
== TYPE_TARGET_TYPE (type
)
4057 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4064 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4067 integer_type_p (struct type
*type
)
4073 switch (type
->code ())
4077 case TYPE_CODE_RANGE
:
4078 return (type
== TYPE_TARGET_TYPE (type
)
4079 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4086 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4089 scalar_type_p (struct type
*type
)
4095 switch (type
->code ())
4098 case TYPE_CODE_RANGE
:
4099 case TYPE_CODE_ENUM
:
4108 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4111 discrete_type_p (struct type
*type
)
4117 switch (type
->code ())
4120 case TYPE_CODE_RANGE
:
4121 case TYPE_CODE_ENUM
:
4122 case TYPE_CODE_BOOL
:
4130 /* Returns non-zero if OP with operands in the vector ARGS could be
4131 a user-defined function. Errs on the side of pre-defined operators
4132 (i.e., result 0). */
4135 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4137 struct type
*type0
=
4138 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4139 struct type
*type1
=
4140 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4154 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4158 case BINOP_BITWISE_AND
:
4159 case BINOP_BITWISE_IOR
:
4160 case BINOP_BITWISE_XOR
:
4161 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4164 case BINOP_NOTEQUAL
:
4169 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4172 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4175 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4179 case UNOP_LOGICAL_NOT
:
4181 return (!numeric_type_p (type0
));
4190 1. In the following, we assume that a renaming type's name may
4191 have an ___XD suffix. It would be nice if this went away at some
4193 2. We handle both the (old) purely type-based representation of
4194 renamings and the (new) variable-based encoding. At some point,
4195 it is devoutly to be hoped that the former goes away
4196 (FIXME: hilfinger-2007-07-09).
4197 3. Subprogram renamings are not implemented, although the XRS
4198 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4200 /* If SYM encodes a renaming,
4202 <renaming> renames <renamed entity>,
4204 sets *LEN to the length of the renamed entity's name,
4205 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4206 the string describing the subcomponent selected from the renamed
4207 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4208 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4209 are undefined). Otherwise, returns a value indicating the category
4210 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4211 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4212 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4213 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4214 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4215 may be NULL, in which case they are not assigned.
4217 [Currently, however, GCC does not generate subprogram renamings.] */
4219 enum ada_renaming_category
4220 ada_parse_renaming (struct symbol
*sym
,
4221 const char **renamed_entity
, int *len
,
4222 const char **renaming_expr
)
4224 enum ada_renaming_category kind
;
4229 return ADA_NOT_RENAMING
;
4230 switch (SYMBOL_CLASS (sym
))
4233 return ADA_NOT_RENAMING
;
4237 case LOC_OPTIMIZED_OUT
:
4238 info
= strstr (sym
->linkage_name (), "___XR");
4240 return ADA_NOT_RENAMING
;
4244 kind
= ADA_OBJECT_RENAMING
;
4248 kind
= ADA_EXCEPTION_RENAMING
;
4252 kind
= ADA_PACKAGE_RENAMING
;
4256 kind
= ADA_SUBPROGRAM_RENAMING
;
4260 return ADA_NOT_RENAMING
;
4264 if (renamed_entity
!= NULL
)
4265 *renamed_entity
= info
;
4266 suffix
= strstr (info
, "___XE");
4267 if (suffix
== NULL
|| suffix
== info
)
4268 return ADA_NOT_RENAMING
;
4270 *len
= strlen (info
) - strlen (suffix
);
4272 if (renaming_expr
!= NULL
)
4273 *renaming_expr
= suffix
;
4277 /* Compute the value of the given RENAMING_SYM, which is expected to
4278 be a symbol encoding a renaming expression. BLOCK is the block
4279 used to evaluate the renaming. */
4281 static struct value
*
4282 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4283 const struct block
*block
)
4285 const char *sym_name
;
4287 sym_name
= renaming_sym
->linkage_name ();
4288 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4289 return evaluate_expression (expr
.get ());
4293 /* Evaluation: Function Calls */
4295 /* Return an lvalue containing the value VAL. This is the identity on
4296 lvalues, and otherwise has the side-effect of allocating memory
4297 in the inferior where a copy of the value contents is copied. */
4299 static struct value
*
4300 ensure_lval (struct value
*val
)
4302 if (VALUE_LVAL (val
) == not_lval
4303 || VALUE_LVAL (val
) == lval_internalvar
)
4305 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4306 const CORE_ADDR addr
=
4307 value_as_long (value_allocate_space_in_inferior (len
));
4309 VALUE_LVAL (val
) = lval_memory
;
4310 set_value_address (val
, addr
);
4311 write_memory (addr
, value_contents (val
), len
);
4317 /* Given ARG, a value of type (pointer or reference to a)*
4318 structure/union, extract the component named NAME from the ultimate
4319 target structure/union and return it as a value with its
4322 The routine searches for NAME among all members of the structure itself
4323 and (recursively) among all members of any wrapper members
4326 If NO_ERR, then simply return NULL in case of error, rather than
4329 static struct value
*
4330 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4332 struct type
*t
, *t1
;
4337 t1
= t
= ada_check_typedef (value_type (arg
));
4338 if (t
->code () == TYPE_CODE_REF
)
4340 t1
= TYPE_TARGET_TYPE (t
);
4343 t1
= ada_check_typedef (t1
);
4344 if (t1
->code () == TYPE_CODE_PTR
)
4346 arg
= coerce_ref (arg
);
4351 while (t
->code () == TYPE_CODE_PTR
)
4353 t1
= TYPE_TARGET_TYPE (t
);
4356 t1
= ada_check_typedef (t1
);
4357 if (t1
->code () == TYPE_CODE_PTR
)
4359 arg
= value_ind (arg
);
4366 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4370 v
= ada_search_struct_field (name
, arg
, 0, t
);
4373 int bit_offset
, bit_size
, byte_offset
;
4374 struct type
*field_type
;
4377 if (t
->code () == TYPE_CODE_PTR
)
4378 address
= value_address (ada_value_ind (arg
));
4380 address
= value_address (ada_coerce_ref (arg
));
4382 /* Check to see if this is a tagged type. We also need to handle
4383 the case where the type is a reference to a tagged type, but
4384 we have to be careful to exclude pointers to tagged types.
4385 The latter should be shown as usual (as a pointer), whereas
4386 a reference should mostly be transparent to the user. */
4388 if (ada_is_tagged_type (t1
, 0)
4389 || (t1
->code () == TYPE_CODE_REF
4390 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4392 /* We first try to find the searched field in the current type.
4393 If not found then let's look in the fixed type. */
4395 if (!find_struct_field (name
, t1
, 0,
4396 &field_type
, &byte_offset
, &bit_offset
,
4405 /* Convert to fixed type in all cases, so that we have proper
4406 offsets to each field in unconstrained record types. */
4407 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4408 address
, NULL
, check_tag
);
4410 /* Resolve the dynamic type as well. */
4411 arg
= value_from_contents_and_address (t1
, nullptr, address
);
4412 t1
= value_type (arg
);
4414 if (find_struct_field (name
, t1
, 0,
4415 &field_type
, &byte_offset
, &bit_offset
,
4420 if (t
->code () == TYPE_CODE_REF
)
4421 arg
= ada_coerce_ref (arg
);
4423 arg
= ada_value_ind (arg
);
4424 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4425 bit_offset
, bit_size
,
4429 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4433 if (v
!= NULL
|| no_err
)
4436 error (_("There is no member named %s."), name
);
4442 error (_("Attempt to extract a component of "
4443 "a value that is not a record."));
4446 /* Return the value ACTUAL, converted to be an appropriate value for a
4447 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4448 allocating any necessary descriptors (fat pointers), or copies of
4449 values not residing in memory, updating it as needed. */
4452 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4454 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4455 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4456 struct type
*formal_target
=
4457 formal_type
->code () == TYPE_CODE_PTR
4458 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4459 struct type
*actual_target
=
4460 actual_type
->code () == TYPE_CODE_PTR
4461 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4463 if (ada_is_array_descriptor_type (formal_target
)
4464 && actual_target
->code () == TYPE_CODE_ARRAY
)
4465 return make_array_descriptor (formal_type
, actual
);
4466 else if (formal_type
->code () == TYPE_CODE_PTR
4467 || formal_type
->code () == TYPE_CODE_REF
)
4469 struct value
*result
;
4471 if (formal_target
->code () == TYPE_CODE_ARRAY
4472 && ada_is_array_descriptor_type (actual_target
))
4473 result
= desc_data (actual
);
4474 else if (formal_type
->code () != TYPE_CODE_PTR
)
4476 if (VALUE_LVAL (actual
) != lval_memory
)
4480 actual_type
= ada_check_typedef (value_type (actual
));
4481 val
= allocate_value (actual_type
);
4482 memcpy ((char *) value_contents_raw (val
),
4483 (char *) value_contents (actual
),
4484 TYPE_LENGTH (actual_type
));
4485 actual
= ensure_lval (val
);
4487 result
= value_addr (actual
);
4491 return value_cast_pointers (formal_type
, result
, 0);
4493 else if (actual_type
->code () == TYPE_CODE_PTR
)
4494 return ada_value_ind (actual
);
4495 else if (ada_is_aligner_type (formal_type
))
4497 /* We need to turn this parameter into an aligner type
4499 struct value
*aligner
= allocate_value (formal_type
);
4500 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4502 value_assign_to_component (aligner
, component
, actual
);
4509 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4510 type TYPE. This is usually an inefficient no-op except on some targets
4511 (such as AVR) where the representation of a pointer and an address
4515 value_pointer (struct value
*value
, struct type
*type
)
4517 unsigned len
= TYPE_LENGTH (type
);
4518 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4521 addr
= value_address (value
);
4522 gdbarch_address_to_pointer (type
->arch (), type
, buf
, addr
);
4523 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4528 /* Push a descriptor of type TYPE for array value ARR on the stack at
4529 *SP, updating *SP to reflect the new descriptor. Return either
4530 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4531 to-descriptor type rather than a descriptor type), a struct value *
4532 representing a pointer to this descriptor. */
4534 static struct value
*
4535 make_array_descriptor (struct type
*type
, struct value
*arr
)
4537 struct type
*bounds_type
= desc_bounds_type (type
);
4538 struct type
*desc_type
= desc_base_type (type
);
4539 struct value
*descriptor
= allocate_value (desc_type
);
4540 struct value
*bounds
= allocate_value (bounds_type
);
4543 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4546 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4547 ada_array_bound (arr
, i
, 0),
4548 desc_bound_bitpos (bounds_type
, i
, 0),
4549 desc_bound_bitsize (bounds_type
, i
, 0));
4550 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4551 ada_array_bound (arr
, i
, 1),
4552 desc_bound_bitpos (bounds_type
, i
, 1),
4553 desc_bound_bitsize (bounds_type
, i
, 1));
4556 bounds
= ensure_lval (bounds
);
4558 modify_field (value_type (descriptor
),
4559 value_contents_writeable (descriptor
),
4560 value_pointer (ensure_lval (arr
),
4561 desc_type
->field (0).type ()),
4562 fat_pntr_data_bitpos (desc_type
),
4563 fat_pntr_data_bitsize (desc_type
));
4565 modify_field (value_type (descriptor
),
4566 value_contents_writeable (descriptor
),
4567 value_pointer (bounds
,
4568 desc_type
->field (1).type ()),
4569 fat_pntr_bounds_bitpos (desc_type
),
4570 fat_pntr_bounds_bitsize (desc_type
));
4572 descriptor
= ensure_lval (descriptor
);
4574 if (type
->code () == TYPE_CODE_PTR
)
4575 return value_addr (descriptor
);
4580 /* Symbol Cache Module */
4582 /* Performance measurements made as of 2010-01-15 indicate that
4583 this cache does bring some noticeable improvements. Depending
4584 on the type of entity being printed, the cache can make it as much
4585 as an order of magnitude faster than without it.
4587 The descriptive type DWARF extension has significantly reduced
4588 the need for this cache, at least when DWARF is being used. However,
4589 even in this case, some expensive name-based symbol searches are still
4590 sometimes necessary - to find an XVZ variable, mostly. */
4592 /* Return the symbol cache associated to the given program space PSPACE.
4593 If not allocated for this PSPACE yet, allocate and initialize one. */
4595 static struct ada_symbol_cache
*
4596 ada_get_symbol_cache (struct program_space
*pspace
)
4598 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4600 if (pspace_data
->sym_cache
== nullptr)
4601 pspace_data
->sym_cache
.reset (new ada_symbol_cache
);
4603 return pspace_data
->sym_cache
.get ();
4606 /* Clear all entries from the symbol cache. */
4609 ada_clear_symbol_cache ()
4611 struct ada_pspace_data
*pspace_data
4612 = get_ada_pspace_data (current_program_space
);
4614 if (pspace_data
->sym_cache
!= nullptr)
4615 pspace_data
->sym_cache
.reset ();
4618 /* Search our cache for an entry matching NAME and DOMAIN.
4619 Return it if found, or NULL otherwise. */
4621 static struct cache_entry
**
4622 find_entry (const char *name
, domain_enum domain
)
4624 struct ada_symbol_cache
*sym_cache
4625 = ada_get_symbol_cache (current_program_space
);
4626 int h
= msymbol_hash (name
) % HASH_SIZE
;
4627 struct cache_entry
**e
;
4629 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4631 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4637 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4638 Return 1 if found, 0 otherwise.
4640 If an entry was found and SYM is not NULL, set *SYM to the entry's
4641 SYM. Same principle for BLOCK if not NULL. */
4644 lookup_cached_symbol (const char *name
, domain_enum domain
,
4645 struct symbol
**sym
, const struct block
**block
)
4647 struct cache_entry
**e
= find_entry (name
, domain
);
4654 *block
= (*e
)->block
;
4658 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4659 in domain DOMAIN, save this result in our symbol cache. */
4662 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4663 const struct block
*block
)
4665 struct ada_symbol_cache
*sym_cache
4666 = ada_get_symbol_cache (current_program_space
);
4668 struct cache_entry
*e
;
4670 /* Symbols for builtin types don't have a block.
4671 For now don't cache such symbols. */
4672 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4675 /* If the symbol is a local symbol, then do not cache it, as a search
4676 for that symbol depends on the context. To determine whether
4677 the symbol is local or not, we check the block where we found it
4678 against the global and static blocks of its associated symtab. */
4680 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4681 GLOBAL_BLOCK
) != block
4682 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4683 STATIC_BLOCK
) != block
)
4686 h
= msymbol_hash (name
) % HASH_SIZE
;
4687 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4688 e
->next
= sym_cache
->root
[h
];
4689 sym_cache
->root
[h
] = e
;
4690 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4698 /* Return the symbol name match type that should be used used when
4699 searching for all symbols matching LOOKUP_NAME.
4701 LOOKUP_NAME is expected to be a symbol name after transformation
4704 static symbol_name_match_type
4705 name_match_type_from_name (const char *lookup_name
)
4707 return (strstr (lookup_name
, "__") == NULL
4708 ? symbol_name_match_type::WILD
4709 : symbol_name_match_type::FULL
);
4712 /* Return the result of a standard (literal, C-like) lookup of NAME in
4713 given DOMAIN, visible from lexical block BLOCK. */
4715 static struct symbol
*
4716 standard_lookup (const char *name
, const struct block
*block
,
4719 /* Initialize it just to avoid a GCC false warning. */
4720 struct block_symbol sym
= {};
4722 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4724 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4725 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4730 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4731 in the symbol fields of SYMS. We treat enumerals as functions,
4732 since they contend in overloading in the same way. */
4734 is_nonfunction (const std::vector
<struct block_symbol
> &syms
)
4736 for (const block_symbol
&sym
: syms
)
4737 if (SYMBOL_TYPE (sym
.symbol
)->code () != TYPE_CODE_FUNC
4738 && (SYMBOL_TYPE (sym
.symbol
)->code () != TYPE_CODE_ENUM
4739 || SYMBOL_CLASS (sym
.symbol
) != LOC_CONST
))
4745 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4746 struct types. Otherwise, they may not. */
4749 equiv_types (struct type
*type0
, struct type
*type1
)
4753 if (type0
== NULL
|| type1
== NULL
4754 || type0
->code () != type1
->code ())
4756 if ((type0
->code () == TYPE_CODE_STRUCT
4757 || type0
->code () == TYPE_CODE_ENUM
)
4758 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4759 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4765 /* True iff SYM0 represents the same entity as SYM1, or one that is
4766 no more defined than that of SYM1. */
4769 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4773 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4774 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4777 switch (SYMBOL_CLASS (sym0
))
4783 struct type
*type0
= SYMBOL_TYPE (sym0
);
4784 struct type
*type1
= SYMBOL_TYPE (sym1
);
4785 const char *name0
= sym0
->linkage_name ();
4786 const char *name1
= sym1
->linkage_name ();
4787 int len0
= strlen (name0
);
4790 type0
->code () == type1
->code ()
4791 && (equiv_types (type0
, type1
)
4792 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4793 && startswith (name1
+ len0
, "___XV")));
4796 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4797 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4801 const char *name0
= sym0
->linkage_name ();
4802 const char *name1
= sym1
->linkage_name ();
4803 return (strcmp (name0
, name1
) == 0
4804 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4812 /* Append (SYM,BLOCK) to the end of the array of struct block_symbol
4813 records in RESULT. Do nothing if SYM is a duplicate. */
4816 add_defn_to_vec (std::vector
<struct block_symbol
> &result
,
4818 const struct block
*block
)
4820 /* Do not try to complete stub types, as the debugger is probably
4821 already scanning all symbols matching a certain name at the
4822 time when this function is called. Trying to replace the stub
4823 type by its associated full type will cause us to restart a scan
4824 which may lead to an infinite recursion. Instead, the client
4825 collecting the matching symbols will end up collecting several
4826 matches, with at least one of them complete. It can then filter
4827 out the stub ones if needed. */
4829 for (int i
= result
.size () - 1; i
>= 0; i
-= 1)
4831 if (lesseq_defined_than (sym
, result
[i
].symbol
))
4833 else if (lesseq_defined_than (result
[i
].symbol
, sym
))
4835 result
[i
].symbol
= sym
;
4836 result
[i
].block
= block
;
4841 struct block_symbol info
;
4844 result
.push_back (info
);
4847 /* Return a bound minimal symbol matching NAME according to Ada
4848 decoding rules. Returns an invalid symbol if there is no such
4849 minimal symbol. Names prefixed with "standard__" are handled
4850 specially: "standard__" is first stripped off, and only static and
4851 global symbols are searched. */
4853 struct bound_minimal_symbol
4854 ada_lookup_simple_minsym (const char *name
)
4856 struct bound_minimal_symbol result
;
4858 memset (&result
, 0, sizeof (result
));
4860 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4861 lookup_name_info
lookup_name (name
, match_type
);
4863 symbol_name_matcher_ftype
*match_name
4864 = ada_get_symbol_name_matcher (lookup_name
);
4866 for (objfile
*objfile
: current_program_space
->objfiles ())
4868 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4870 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4871 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4873 result
.minsym
= msymbol
;
4874 result
.objfile
= objfile
;
4883 /* For all subprograms that statically enclose the subprogram of the
4884 selected frame, add symbols matching identifier NAME in DOMAIN
4885 and their blocks to the list of data in RESULT, as for
4886 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4887 with a wildcard prefix. */
4890 add_symbols_from_enclosing_procs (std::vector
<struct block_symbol
> &result
,
4891 const lookup_name_info
&lookup_name
,
4896 /* True if TYPE is definitely an artificial type supplied to a symbol
4897 for which no debugging information was given in the symbol file. */
4900 is_nondebugging_type (struct type
*type
)
4902 const char *name
= ada_type_name (type
);
4904 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4907 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4908 that are deemed "identical" for practical purposes.
4910 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4911 types and that their number of enumerals is identical (in other
4912 words, type1->num_fields () == type2->num_fields ()). */
4915 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4919 /* The heuristic we use here is fairly conservative. We consider
4920 that 2 enumerate types are identical if they have the same
4921 number of enumerals and that all enumerals have the same
4922 underlying value and name. */
4924 /* All enums in the type should have an identical underlying value. */
4925 for (i
= 0; i
< type1
->num_fields (); i
++)
4926 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4929 /* All enumerals should also have the same name (modulo any numerical
4931 for (i
= 0; i
< type1
->num_fields (); i
++)
4933 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4934 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4935 int len_1
= strlen (name_1
);
4936 int len_2
= strlen (name_2
);
4938 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4939 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4941 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4942 TYPE_FIELD_NAME (type2
, i
),
4950 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4951 that are deemed "identical" for practical purposes. Sometimes,
4952 enumerals are not strictly identical, but their types are so similar
4953 that they can be considered identical.
4955 For instance, consider the following code:
4957 type Color is (Black, Red, Green, Blue, White);
4958 type RGB_Color is new Color range Red .. Blue;
4960 Type RGB_Color is a subrange of an implicit type which is a copy
4961 of type Color. If we call that implicit type RGB_ColorB ("B" is
4962 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4963 As a result, when an expression references any of the enumeral
4964 by name (Eg. "print green"), the expression is technically
4965 ambiguous and the user should be asked to disambiguate. But
4966 doing so would only hinder the user, since it wouldn't matter
4967 what choice he makes, the outcome would always be the same.
4968 So, for practical purposes, we consider them as the same. */
4971 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
4975 /* Before performing a thorough comparison check of each type,
4976 we perform a series of inexpensive checks. We expect that these
4977 checks will quickly fail in the vast majority of cases, and thus
4978 help prevent the unnecessary use of a more expensive comparison.
4979 Said comparison also expects us to make some of these checks
4980 (see ada_identical_enum_types_p). */
4982 /* Quick check: All symbols should have an enum type. */
4983 for (i
= 0; i
< syms
.size (); i
++)
4984 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
4987 /* Quick check: They should all have the same value. */
4988 for (i
= 1; i
< syms
.size (); i
++)
4989 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
4992 /* Quick check: They should all have the same number of enumerals. */
4993 for (i
= 1; i
< syms
.size (); i
++)
4994 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
4995 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
4998 /* All the sanity checks passed, so we might have a set of
4999 identical enumeration types. Perform a more complete
5000 comparison of the type of each symbol. */
5001 for (i
= 1; i
< syms
.size (); i
++)
5002 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5003 SYMBOL_TYPE (syms
[0].symbol
)))
5009 /* Remove any non-debugging symbols in SYMS that definitely
5010 duplicate other symbols in the list (The only case I know of where
5011 this happens is when object files containing stabs-in-ecoff are
5012 linked with files containing ordinary ecoff debugging symbols (or no
5013 debugging symbols)). Modifies SYMS to squeeze out deleted entries. */
5016 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5020 /* We should never be called with less than 2 symbols, as there
5021 cannot be any extra symbol in that case. But it's easy to
5022 handle, since we have nothing to do in that case. */
5023 if (syms
->size () < 2)
5027 while (i
< syms
->size ())
5031 /* If two symbols have the same name and one of them is a stub type,
5032 the get rid of the stub. */
5034 if (SYMBOL_TYPE ((*syms
)[i
].symbol
)->is_stub ()
5035 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5037 for (j
= 0; j
< syms
->size (); j
++)
5040 && !SYMBOL_TYPE ((*syms
)[j
].symbol
)->is_stub ()
5041 && (*syms
)[j
].symbol
->linkage_name () != NULL
5042 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5043 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5048 /* Two symbols with the same name, same class and same address
5049 should be identical. */
5051 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5052 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5053 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5055 for (j
= 0; j
< syms
->size (); j
+= 1)
5058 && (*syms
)[j
].symbol
->linkage_name () != NULL
5059 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5060 (*syms
)[j
].symbol
->linkage_name ()) == 0
5061 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5062 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5063 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5064 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5070 syms
->erase (syms
->begin () + i
);
5075 /* If all the remaining symbols are identical enumerals, then
5076 just keep the first one and discard the rest.
5078 Unlike what we did previously, we do not discard any entry
5079 unless they are ALL identical. This is because the symbol
5080 comparison is not a strict comparison, but rather a practical
5081 comparison. If all symbols are considered identical, then
5082 we can just go ahead and use the first one and discard the rest.
5083 But if we cannot reduce the list to a single element, we have
5084 to ask the user to disambiguate anyways. And if we have to
5085 present a multiple-choice menu, it's less confusing if the list
5086 isn't missing some choices that were identical and yet distinct. */
5087 if (symbols_are_identical_enums (*syms
))
5091 /* Given a type that corresponds to a renaming entity, use the type name
5092 to extract the scope (package name or function name, fully qualified,
5093 and following the GNAT encoding convention) where this renaming has been
5097 xget_renaming_scope (struct type
*renaming_type
)
5099 /* The renaming types adhere to the following convention:
5100 <scope>__<rename>___<XR extension>.
5101 So, to extract the scope, we search for the "___XR" extension,
5102 and then backtrack until we find the first "__". */
5104 const char *name
= renaming_type
->name ();
5105 const char *suffix
= strstr (name
, "___XR");
5108 /* Now, backtrack a bit until we find the first "__". Start looking
5109 at suffix - 3, as the <rename> part is at least one character long. */
5111 for (last
= suffix
- 3; last
> name
; last
--)
5112 if (last
[0] == '_' && last
[1] == '_')
5115 /* Make a copy of scope and return it. */
5116 return std::string (name
, last
);
5119 /* Return nonzero if NAME corresponds to a package name. */
5122 is_package_name (const char *name
)
5124 /* Here, We take advantage of the fact that no symbols are generated
5125 for packages, while symbols are generated for each function.
5126 So the condition for NAME represent a package becomes equivalent
5127 to NAME not existing in our list of symbols. There is only one
5128 small complication with library-level functions (see below). */
5130 /* If it is a function that has not been defined at library level,
5131 then we should be able to look it up in the symbols. */
5132 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5135 /* Library-level function names start with "_ada_". See if function
5136 "_ada_" followed by NAME can be found. */
5138 /* Do a quick check that NAME does not contain "__", since library-level
5139 functions names cannot contain "__" in them. */
5140 if (strstr (name
, "__") != NULL
)
5143 std::string fun_name
= string_printf ("_ada_%s", name
);
5145 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5148 /* Return nonzero if SYM corresponds to a renaming entity that is
5149 not visible from FUNCTION_NAME. */
5152 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5154 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5157 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5159 /* If the rename has been defined in a package, then it is visible. */
5160 if (is_package_name (scope
.c_str ()))
5163 /* Check that the rename is in the current function scope by checking
5164 that its name starts with SCOPE. */
5166 /* If the function name starts with "_ada_", it means that it is
5167 a library-level function. Strip this prefix before doing the
5168 comparison, as the encoding for the renaming does not contain
5170 if (startswith (function_name
, "_ada_"))
5173 return !startswith (function_name
, scope
.c_str ());
5176 /* Remove entries from SYMS that corresponds to a renaming entity that
5177 is not visible from the function associated with CURRENT_BLOCK or
5178 that is superfluous due to the presence of more specific renaming
5179 information. Places surviving symbols in the initial entries of
5183 First, in cases where an object renaming is implemented as a
5184 reference variable, GNAT may produce both the actual reference
5185 variable and the renaming encoding. In this case, we discard the
5188 Second, GNAT emits a type following a specified encoding for each renaming
5189 entity. Unfortunately, STABS currently does not support the definition
5190 of types that are local to a given lexical block, so all renamings types
5191 are emitted at library level. As a consequence, if an application
5192 contains two renaming entities using the same name, and a user tries to
5193 print the value of one of these entities, the result of the ada symbol
5194 lookup will also contain the wrong renaming type.
5196 This function partially covers for this limitation by attempting to
5197 remove from the SYMS list renaming symbols that should be visible
5198 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5199 method with the current information available. The implementation
5200 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5202 - When the user tries to print a rename in a function while there
5203 is another rename entity defined in a package: Normally, the
5204 rename in the function has precedence over the rename in the
5205 package, so the latter should be removed from the list. This is
5206 currently not the case.
5208 - This function will incorrectly remove valid renames if
5209 the CURRENT_BLOCK corresponds to a function which symbol name
5210 has been changed by an "Export" pragma. As a consequence,
5211 the user will be unable to print such rename entities. */
5214 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5215 const struct block
*current_block
)
5217 struct symbol
*current_function
;
5218 const char *current_function_name
;
5220 int is_new_style_renaming
;
5222 /* If there is both a renaming foo___XR... encoded as a variable and
5223 a simple variable foo in the same block, discard the latter.
5224 First, zero out such symbols, then compress. */
5225 is_new_style_renaming
= 0;
5226 for (i
= 0; i
< syms
->size (); i
+= 1)
5228 struct symbol
*sym
= (*syms
)[i
].symbol
;
5229 const struct block
*block
= (*syms
)[i
].block
;
5233 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5235 name
= sym
->linkage_name ();
5236 suffix
= strstr (name
, "___XR");
5240 int name_len
= suffix
- name
;
5243 is_new_style_renaming
= 1;
5244 for (j
= 0; j
< syms
->size (); j
+= 1)
5245 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5246 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5248 && block
== (*syms
)[j
].block
)
5249 (*syms
)[j
].symbol
= NULL
;
5252 if (is_new_style_renaming
)
5256 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5257 if ((*syms
)[j
].symbol
!= NULL
)
5259 (*syms
)[k
] = (*syms
)[j
];
5266 /* Extract the function name associated to CURRENT_BLOCK.
5267 Abort if unable to do so. */
5269 if (current_block
== NULL
)
5272 current_function
= block_linkage_function (current_block
);
5273 if (current_function
== NULL
)
5276 current_function_name
= current_function
->linkage_name ();
5277 if (current_function_name
== NULL
)
5280 /* Check each of the symbols, and remove it from the list if it is
5281 a type corresponding to a renaming that is out of the scope of
5282 the current block. */
5285 while (i
< syms
->size ())
5287 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5288 == ADA_OBJECT_RENAMING
5289 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5290 current_function_name
))
5291 syms
->erase (syms
->begin () + i
);
5297 /* Add to RESULT all symbols from BLOCK (and its super-blocks)
5298 whose name and domain match NAME and DOMAIN respectively.
5299 If no match was found, then extend the search to "enclosing"
5300 routines (in other words, if we're inside a nested function,
5301 search the symbols defined inside the enclosing functions).
5302 If WILD_MATCH_P is nonzero, perform the naming matching in
5303 "wild" mode (see function "wild_match" for more info).
5305 Note: This function assumes that RESULT has 0 (zero) element in it. */
5308 ada_add_local_symbols (std::vector
<struct block_symbol
> &result
,
5309 const lookup_name_info
&lookup_name
,
5310 const struct block
*block
, domain_enum domain
)
5312 int block_depth
= 0;
5314 while (block
!= NULL
)
5317 ada_add_block_symbols (result
, block
, lookup_name
, domain
, NULL
);
5319 /* If we found a non-function match, assume that's the one. */
5320 if (is_nonfunction (result
))
5323 block
= BLOCK_SUPERBLOCK (block
);
5326 /* If no luck so far, try to find NAME as a local symbol in some lexically
5327 enclosing subprogram. */
5328 if (result
.empty () && block_depth
> 2)
5329 add_symbols_from_enclosing_procs (result
, lookup_name
, domain
);
5332 /* An object of this type is used as the user_data argument when
5333 calling the map_matching_symbols method. */
5337 explicit match_data (std::vector
<struct block_symbol
> *rp
)
5341 DISABLE_COPY_AND_ASSIGN (match_data
);
5343 struct objfile
*objfile
= nullptr;
5344 std::vector
<struct block_symbol
> *resultp
;
5345 struct symbol
*arg_sym
= nullptr;
5346 bool found_sym
= false;
5349 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5350 to a list of symbols. DATA is a pointer to a struct match_data *
5351 containing the vector that collects the symbol list, the file that SYM
5352 must come from, a flag indicating whether a non-argument symbol has
5353 been found in the current block, and the last argument symbol
5354 passed in SYM within the current block (if any). When SYM is null,
5355 marking the end of a block, the argument symbol is added if no
5356 other has been found. */
5359 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5360 struct match_data
*data
)
5362 const struct block
*block
= bsym
->block
;
5363 struct symbol
*sym
= bsym
->symbol
;
5367 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5368 add_defn_to_vec (*data
->resultp
,
5369 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5371 data
->found_sym
= false;
5372 data
->arg_sym
= NULL
;
5376 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5378 else if (SYMBOL_IS_ARGUMENT (sym
))
5379 data
->arg_sym
= sym
;
5382 data
->found_sym
= true;
5383 add_defn_to_vec (*data
->resultp
,
5384 fixup_symbol_section (sym
, data
->objfile
),
5391 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5392 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5393 symbols to RESULT. Return whether we found such symbols. */
5396 ada_add_block_renamings (std::vector
<struct block_symbol
> &result
,
5397 const struct block
*block
,
5398 const lookup_name_info
&lookup_name
,
5401 struct using_direct
*renaming
;
5402 int defns_mark
= result
.size ();
5404 symbol_name_matcher_ftype
*name_match
5405 = ada_get_symbol_name_matcher (lookup_name
);
5407 for (renaming
= block_using (block
);
5409 renaming
= renaming
->next
)
5413 /* Avoid infinite recursions: skip this renaming if we are actually
5414 already traversing it.
5416 Currently, symbol lookup in Ada don't use the namespace machinery from
5417 C++/Fortran support: skip namespace imports that use them. */
5418 if (renaming
->searched
5419 || (renaming
->import_src
!= NULL
5420 && renaming
->import_src
[0] != '\0')
5421 || (renaming
->import_dest
!= NULL
5422 && renaming
->import_dest
[0] != '\0'))
5424 renaming
->searched
= 1;
5426 /* TODO: here, we perform another name-based symbol lookup, which can
5427 pull its own multiple overloads. In theory, we should be able to do
5428 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5429 not a simple name. But in order to do this, we would need to enhance
5430 the DWARF reader to associate a symbol to this renaming, instead of a
5431 name. So, for now, we do something simpler: re-use the C++/Fortran
5432 namespace machinery. */
5433 r_name
= (renaming
->alias
!= NULL
5435 : renaming
->declaration
);
5436 if (name_match (r_name
, lookup_name
, NULL
))
5438 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5439 lookup_name
.match_type ());
5440 ada_add_all_symbols (result
, block
, decl_lookup_name
, domain
,
5443 renaming
->searched
= 0;
5445 return result
.size () != defns_mark
;
5448 /* Implements compare_names, but only applying the comparision using
5449 the given CASING. */
5452 compare_names_with_case (const char *string1
, const char *string2
,
5453 enum case_sensitivity casing
)
5455 while (*string1
!= '\0' && *string2
!= '\0')
5459 if (isspace (*string1
) || isspace (*string2
))
5460 return strcmp_iw_ordered (string1
, string2
);
5462 if (casing
== case_sensitive_off
)
5464 c1
= tolower (*string1
);
5465 c2
= tolower (*string2
);
5482 return strcmp_iw_ordered (string1
, string2
);
5484 if (*string2
== '\0')
5486 if (is_name_suffix (string1
))
5493 if (*string2
== '(')
5494 return strcmp_iw_ordered (string1
, string2
);
5497 if (casing
== case_sensitive_off
)
5498 return tolower (*string1
) - tolower (*string2
);
5500 return *string1
- *string2
;
5505 /* Compare STRING1 to STRING2, with results as for strcmp.
5506 Compatible with strcmp_iw_ordered in that...
5508 strcmp_iw_ordered (STRING1, STRING2) <= 0
5512 compare_names (STRING1, STRING2) <= 0
5514 (they may differ as to what symbols compare equal). */
5517 compare_names (const char *string1
, const char *string2
)
5521 /* Similar to what strcmp_iw_ordered does, we need to perform
5522 a case-insensitive comparison first, and only resort to
5523 a second, case-sensitive, comparison if the first one was
5524 not sufficient to differentiate the two strings. */
5526 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5528 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5533 /* Convenience function to get at the Ada encoded lookup name for
5534 LOOKUP_NAME, as a C string. */
5537 ada_lookup_name (const lookup_name_info
&lookup_name
)
5539 return lookup_name
.ada ().lookup_name ().c_str ();
5542 /* Add to RESULT all non-local symbols whose name and domain match
5543 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5544 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5545 symbols otherwise. */
5548 add_nonlocal_symbols (std::vector
<struct block_symbol
> &result
,
5549 const lookup_name_info
&lookup_name
,
5550 domain_enum domain
, int global
)
5552 struct match_data
data (&result
);
5554 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5556 auto callback
= [&] (struct block_symbol
*bsym
)
5558 return aux_add_nonlocal_symbols (bsym
, &data
);
5561 for (objfile
*objfile
: current_program_space
->objfiles ())
5563 data
.objfile
= objfile
;
5565 if (objfile
->sf
!= nullptr)
5566 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5567 domain
, global
, callback
,
5569 ? NULL
: compare_names
));
5571 for (compunit_symtab
*cu
: objfile
->compunits ())
5573 const struct block
*global_block
5574 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5576 if (ada_add_block_renamings (result
, global_block
, lookup_name
,
5578 data
.found_sym
= true;
5582 if (result
.empty () && global
&& !is_wild_match
)
5584 const char *name
= ada_lookup_name (lookup_name
);
5585 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5586 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5588 for (objfile
*objfile
: current_program_space
->objfiles ())
5590 data
.objfile
= objfile
;
5591 if (objfile
->sf
!= nullptr)
5592 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5593 domain
, global
, callback
,
5599 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5600 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5601 returning the number of matches. Add these to RESULT.
5603 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5604 symbol match within the nest of blocks whose innermost member is BLOCK,
5605 is the one match returned (no other matches in that or
5606 enclosing blocks is returned). If there are any matches in or
5607 surrounding BLOCK, then these alone are returned.
5609 Names prefixed with "standard__" are handled specially:
5610 "standard__" is first stripped off (by the lookup_name
5611 constructor), and only static and global symbols are searched.
5613 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5614 to lookup global symbols. */
5617 ada_add_all_symbols (std::vector
<struct block_symbol
> &result
,
5618 const struct block
*block
,
5619 const lookup_name_info
&lookup_name
,
5622 int *made_global_lookup_p
)
5626 if (made_global_lookup_p
)
5627 *made_global_lookup_p
= 0;
5629 /* Special case: If the user specifies a symbol name inside package
5630 Standard, do a non-wild matching of the symbol name without
5631 the "standard__" prefix. This was primarily introduced in order
5632 to allow the user to specifically access the standard exceptions
5633 using, for instance, Standard.Constraint_Error when Constraint_Error
5634 is ambiguous (due to the user defining its own Constraint_Error
5635 entity inside its program). */
5636 if (lookup_name
.ada ().standard_p ())
5639 /* Check the non-global symbols. If we have ANY match, then we're done. */
5644 ada_add_local_symbols (result
, lookup_name
, block
, domain
);
5647 /* In the !full_search case we're are being called by
5648 iterate_over_symbols, and we don't want to search
5650 ada_add_block_symbols (result
, block
, lookup_name
, domain
, NULL
);
5652 if (!result
.empty () || !full_search
)
5656 /* No non-global symbols found. Check our cache to see if we have
5657 already performed this search before. If we have, then return
5660 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5661 domain
, &sym
, &block
))
5664 add_defn_to_vec (result
, sym
, block
);
5668 if (made_global_lookup_p
)
5669 *made_global_lookup_p
= 1;
5671 /* Search symbols from all global blocks. */
5673 add_nonlocal_symbols (result
, lookup_name
, domain
, 1);
5675 /* Now add symbols from all per-file blocks if we've gotten no hits
5676 (not strictly correct, but perhaps better than an error). */
5678 if (result
.empty ())
5679 add_nonlocal_symbols (result
, lookup_name
, domain
, 0);
5682 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5683 is non-zero, enclosing scope and in global scopes.
5685 Returns (SYM,BLOCK) tuples, indicating the symbols found and the
5686 blocks and symbol tables (if any) in which they were found.
5688 When full_search is non-zero, any non-function/non-enumeral
5689 symbol match within the nest of blocks whose innermost member is BLOCK,
5690 is the one match returned (no other matches in that or
5691 enclosing blocks is returned). If there are any matches in or
5692 surrounding BLOCK, then these alone are returned.
5694 Names prefixed with "standard__" are handled specially: "standard__"
5695 is first stripped off, and only static and global symbols are searched. */
5697 static std::vector
<struct block_symbol
>
5698 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5699 const struct block
*block
,
5703 int syms_from_global_search
;
5704 std::vector
<struct block_symbol
> results
;
5706 ada_add_all_symbols (results
, block
, lookup_name
,
5707 domain
, full_search
, &syms_from_global_search
);
5709 remove_extra_symbols (&results
);
5711 if (results
.empty () && full_search
&& syms_from_global_search
)
5712 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5714 if (results
.size () == 1 && full_search
&& syms_from_global_search
)
5715 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5716 results
[0].symbol
, results
[0].block
);
5718 remove_irrelevant_renamings (&results
, block
);
5722 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5723 in global scopes, returning (SYM,BLOCK) tuples.
5725 See ada_lookup_symbol_list_worker for further details. */
5727 std::vector
<struct block_symbol
>
5728 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5731 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5732 lookup_name_info
lookup_name (name
, name_match_type
);
5734 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, 1);
5737 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5738 to 1, but choosing the first symbol found if there are multiple
5741 The result is stored in *INFO, which must be non-NULL.
5742 If no match is found, INFO->SYM is set to NULL. */
5745 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5747 struct block_symbol
*info
)
5749 /* Since we already have an encoded name, wrap it in '<>' to force a
5750 verbatim match. Otherwise, if the name happens to not look like
5751 an encoded name (because it doesn't include a "__"),
5752 ada_lookup_name_info would re-encode/fold it again, and that
5753 would e.g., incorrectly lowercase object renaming names like
5754 "R28b" -> "r28b". */
5755 std::string verbatim
= add_angle_brackets (name
);
5757 gdb_assert (info
!= NULL
);
5758 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5761 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5762 scope and in global scopes, or NULL if none. NAME is folded and
5763 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5764 choosing the first symbol if there are multiple choices. */
5767 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5770 std::vector
<struct block_symbol
> candidates
5771 = ada_lookup_symbol_list (name
, block0
, domain
);
5773 if (candidates
.empty ())
5776 block_symbol info
= candidates
[0];
5777 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5782 /* True iff STR is a possible encoded suffix of a normal Ada name
5783 that is to be ignored for matching purposes. Suffixes of parallel
5784 names (e.g., XVE) are not included here. Currently, the possible suffixes
5785 are given by any of the regular expressions:
5787 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5788 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5789 TKB [subprogram suffix for task bodies]
5790 _E[0-9]+[bs]$ [protected object entry suffixes]
5791 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5793 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5794 match is performed. This sequence is used to differentiate homonyms,
5795 is an optional part of a valid name suffix. */
5798 is_name_suffix (const char *str
)
5801 const char *matching
;
5802 const int len
= strlen (str
);
5804 /* Skip optional leading __[0-9]+. */
5806 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5809 while (isdigit (str
[0]))
5815 if (str
[0] == '.' || str
[0] == '$')
5818 while (isdigit (matching
[0]))
5820 if (matching
[0] == '\0')
5826 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5829 while (isdigit (matching
[0]))
5831 if (matching
[0] == '\0')
5835 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5837 if (strcmp (str
, "TKB") == 0)
5841 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5842 with a N at the end. Unfortunately, the compiler uses the same
5843 convention for other internal types it creates. So treating
5844 all entity names that end with an "N" as a name suffix causes
5845 some regressions. For instance, consider the case of an enumerated
5846 type. To support the 'Image attribute, it creates an array whose
5848 Having a single character like this as a suffix carrying some
5849 information is a bit risky. Perhaps we should change the encoding
5850 to be something like "_N" instead. In the meantime, do not do
5851 the following check. */
5852 /* Protected Object Subprograms */
5853 if (len
== 1 && str
[0] == 'N')
5858 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5861 while (isdigit (matching
[0]))
5863 if ((matching
[0] == 'b' || matching
[0] == 's')
5864 && matching
[1] == '\0')
5868 /* ??? We should not modify STR directly, as we are doing below. This
5869 is fine in this case, but may become problematic later if we find
5870 that this alternative did not work, and want to try matching
5871 another one from the begining of STR. Since we modified it, we
5872 won't be able to find the begining of the string anymore! */
5876 while (str
[0] != '_' && str
[0] != '\0')
5878 if (str
[0] != 'n' && str
[0] != 'b')
5884 if (str
[0] == '\000')
5889 if (str
[1] != '_' || str
[2] == '\000')
5893 if (strcmp (str
+ 3, "JM") == 0)
5895 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5896 the LJM suffix in favor of the JM one. But we will
5897 still accept LJM as a valid suffix for a reasonable
5898 amount of time, just to allow ourselves to debug programs
5899 compiled using an older version of GNAT. */
5900 if (strcmp (str
+ 3, "LJM") == 0)
5904 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5905 || str
[4] == 'U' || str
[4] == 'P')
5907 if (str
[4] == 'R' && str
[5] != 'T')
5911 if (!isdigit (str
[2]))
5913 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5914 if (!isdigit (str
[k
]) && str
[k
] != '_')
5918 if (str
[0] == '$' && isdigit (str
[1]))
5920 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5921 if (!isdigit (str
[k
]) && str
[k
] != '_')
5928 /* Return non-zero if the string starting at NAME and ending before
5929 NAME_END contains no capital letters. */
5932 is_valid_name_for_wild_match (const char *name0
)
5934 std::string decoded_name
= ada_decode (name0
);
5937 /* If the decoded name starts with an angle bracket, it means that
5938 NAME0 does not follow the GNAT encoding format. It should then
5939 not be allowed as a possible wild match. */
5940 if (decoded_name
[0] == '<')
5943 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5944 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5950 /* Advance *NAMEP to next occurrence in the string NAME0 of the TARGET0
5951 character which could start a simple name. Assumes that *NAMEP points
5952 somewhere inside the string beginning at NAME0. */
5955 advance_wild_match (const char **namep
, const char *name0
, char target0
)
5957 const char *name
= *namep
;
5967 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5970 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
5975 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5976 || name
[2] == target0
))
5981 else if (t1
== '_' && name
[2] == 'B' && name
[3] == '_')
5983 /* Names like "pkg__B_N__name", where N is a number, are
5984 block-local. We can handle these by simply skipping
5991 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6001 /* Return true iff NAME encodes a name of the form prefix.PATN.
6002 Ignores any informational suffixes of NAME (i.e., for which
6003 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6007 wild_match (const char *name
, const char *patn
)
6010 const char *name0
= name
;
6014 const char *match
= name
;
6018 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6021 if (*p
== '\0' && is_name_suffix (name
))
6022 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6024 if (name
[-1] == '_')
6027 if (!advance_wild_match (&name
, name0
, *patn
))
6032 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to RESULT (if
6033 necessary). OBJFILE is the section containing BLOCK. */
6036 ada_add_block_symbols (std::vector
<struct block_symbol
> &result
,
6037 const struct block
*block
,
6038 const lookup_name_info
&lookup_name
,
6039 domain_enum domain
, struct objfile
*objfile
)
6041 struct block_iterator iter
;
6042 /* A matching argument symbol, if any. */
6043 struct symbol
*arg_sym
;
6044 /* Set true when we find a matching non-argument symbol. */
6050 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6052 sym
= block_iter_match_next (lookup_name
, &iter
))
6054 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6056 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6058 if (SYMBOL_IS_ARGUMENT (sym
))
6063 add_defn_to_vec (result
,
6064 fixup_symbol_section (sym
, objfile
),
6071 /* Handle renamings. */
6073 if (ada_add_block_renamings (result
, block
, lookup_name
, domain
))
6076 if (!found_sym
&& arg_sym
!= NULL
)
6078 add_defn_to_vec (result
,
6079 fixup_symbol_section (arg_sym
, objfile
),
6083 if (!lookup_name
.ada ().wild_match_p ())
6087 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6088 const char *name
= ada_lookup_name
.c_str ();
6089 size_t name_len
= ada_lookup_name
.size ();
6091 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6093 if (symbol_matches_domain (sym
->language (),
6094 SYMBOL_DOMAIN (sym
), domain
))
6098 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6101 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6103 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6108 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6110 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6112 if (SYMBOL_IS_ARGUMENT (sym
))
6117 add_defn_to_vec (result
,
6118 fixup_symbol_section (sym
, objfile
),
6126 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6127 They aren't parameters, right? */
6128 if (!found_sym
&& arg_sym
!= NULL
)
6130 add_defn_to_vec (result
,
6131 fixup_symbol_section (arg_sym
, objfile
),
6138 /* Symbol Completion */
6143 ada_lookup_name_info::matches
6144 (const char *sym_name
,
6145 symbol_name_match_type match_type
,
6146 completion_match_result
*comp_match_res
) const
6149 const char *text
= m_encoded_name
.c_str ();
6150 size_t text_len
= m_encoded_name
.size ();
6152 /* First, test against the fully qualified name of the symbol. */
6154 if (strncmp (sym_name
, text
, text_len
) == 0)
6157 std::string decoded_name
= ada_decode (sym_name
);
6158 if (match
&& !m_encoded_p
)
6160 /* One needed check before declaring a positive match is to verify
6161 that iff we are doing a verbatim match, the decoded version
6162 of the symbol name starts with '<'. Otherwise, this symbol name
6163 is not a suitable completion. */
6165 bool has_angle_bracket
= (decoded_name
[0] == '<');
6166 match
= (has_angle_bracket
== m_verbatim_p
);
6169 if (match
&& !m_verbatim_p
)
6171 /* When doing non-verbatim match, another check that needs to
6172 be done is to verify that the potentially matching symbol name
6173 does not include capital letters, because the ada-mode would
6174 not be able to understand these symbol names without the
6175 angle bracket notation. */
6178 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6183 /* Second: Try wild matching... */
6185 if (!match
&& m_wild_match_p
)
6187 /* Since we are doing wild matching, this means that TEXT
6188 may represent an unqualified symbol name. We therefore must
6189 also compare TEXT against the unqualified name of the symbol. */
6190 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6192 if (strncmp (sym_name
, text
, text_len
) == 0)
6196 /* Finally: If we found a match, prepare the result to return. */
6201 if (comp_match_res
!= NULL
)
6203 std::string
&match_str
= comp_match_res
->match
.storage ();
6206 match_str
= ada_decode (sym_name
);
6210 match_str
= add_angle_brackets (sym_name
);
6212 match_str
= sym_name
;
6216 comp_match_res
->set_match (match_str
.c_str ());
6224 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6225 for tagged types. */
6228 ada_is_dispatch_table_ptr_type (struct type
*type
)
6232 if (type
->code () != TYPE_CODE_PTR
)
6235 name
= TYPE_TARGET_TYPE (type
)->name ();
6239 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6242 /* Return non-zero if TYPE is an interface tag. */
6245 ada_is_interface_tag (struct type
*type
)
6247 const char *name
= type
->name ();
6252 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6255 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6256 to be invisible to users. */
6259 ada_is_ignored_field (struct type
*type
, int field_num
)
6261 if (field_num
< 0 || field_num
> type
->num_fields ())
6264 /* Check the name of that field. */
6266 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6268 /* Anonymous field names should not be printed.
6269 brobecker/2007-02-20: I don't think this can actually happen
6270 but we don't want to print the value of anonymous fields anyway. */
6274 /* Normally, fields whose name start with an underscore ("_")
6275 are fields that have been internally generated by the compiler,
6276 and thus should not be printed. The "_parent" field is special,
6277 however: This is a field internally generated by the compiler
6278 for tagged types, and it contains the components inherited from
6279 the parent type. This field should not be printed as is, but
6280 should not be ignored either. */
6281 if (name
[0] == '_' && !startswith (name
, "_parent"))
6285 /* If this is the dispatch table of a tagged type or an interface tag,
6287 if (ada_is_tagged_type (type
, 1)
6288 && (ada_is_dispatch_table_ptr_type (type
->field (field_num
).type ())
6289 || ada_is_interface_tag (type
->field (field_num
).type ())))
6292 /* Not a special field, so it should not be ignored. */
6296 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6297 pointer or reference type whose ultimate target has a tag field. */
6300 ada_is_tagged_type (struct type
*type
, int refok
)
6302 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6305 /* True iff TYPE represents the type of X'Tag */
6308 ada_is_tag_type (struct type
*type
)
6310 type
= ada_check_typedef (type
);
6312 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6316 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6318 return (name
!= NULL
6319 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6323 /* The type of the tag on VAL. */
6325 static struct type
*
6326 ada_tag_type (struct value
*val
)
6328 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6331 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6332 retired at Ada 05). */
6335 is_ada95_tag (struct value
*tag
)
6337 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6340 /* The value of the tag on VAL. */
6342 static struct value
*
6343 ada_value_tag (struct value
*val
)
6345 return ada_value_struct_elt (val
, "_tag", 0);
6348 /* The value of the tag on the object of type TYPE whose contents are
6349 saved at VALADDR, if it is non-null, or is at memory address
6352 static struct value
*
6353 value_tag_from_contents_and_address (struct type
*type
,
6354 const gdb_byte
*valaddr
,
6357 int tag_byte_offset
;
6358 struct type
*tag_type
;
6360 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6363 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6365 : valaddr
+ tag_byte_offset
);
6366 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6368 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6373 static struct type
*
6374 type_from_tag (struct value
*tag
)
6376 gdb::unique_xmalloc_ptr
<char> type_name
= ada_tag_name (tag
);
6378 if (type_name
!= NULL
)
6379 return ada_find_any_type (ada_encode (type_name
.get ()).c_str ());
6383 /* Given a value OBJ of a tagged type, return a value of this
6384 type at the base address of the object. The base address, as
6385 defined in Ada.Tags, it is the address of the primary tag of
6386 the object, and therefore where the field values of its full
6387 view can be fetched. */
6390 ada_tag_value_at_base_address (struct value
*obj
)
6393 LONGEST offset_to_top
= 0;
6394 struct type
*ptr_type
, *obj_type
;
6396 CORE_ADDR base_address
;
6398 obj_type
= value_type (obj
);
6400 /* It is the responsability of the caller to deref pointers. */
6402 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6405 tag
= ada_value_tag (obj
);
6409 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6411 if (is_ada95_tag (tag
))
6414 ptr_type
= language_lookup_primitive_type
6415 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6416 ptr_type
= lookup_pointer_type (ptr_type
);
6417 val
= value_cast (ptr_type
, tag
);
6421 /* It is perfectly possible that an exception be raised while
6422 trying to determine the base address, just like for the tag;
6423 see ada_tag_name for more details. We do not print the error
6424 message for the same reason. */
6428 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6431 catch (const gdb_exception_error
&e
)
6436 /* If offset is null, nothing to do. */
6438 if (offset_to_top
== 0)
6441 /* -1 is a special case in Ada.Tags; however, what should be done
6442 is not quite clear from the documentation. So do nothing for
6445 if (offset_to_top
== -1)
6448 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6449 from the base address. This was however incompatible with
6450 C++ dispatch table: C++ uses a *negative* value to *add*
6451 to the base address. Ada's convention has therefore been
6452 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6453 use the same convention. Here, we support both cases by
6454 checking the sign of OFFSET_TO_TOP. */
6456 if (offset_to_top
> 0)
6457 offset_to_top
= -offset_to_top
;
6459 base_address
= value_address (obj
) + offset_to_top
;
6460 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6462 /* Make sure that we have a proper tag at the new address.
6463 Otherwise, offset_to_top is bogus (which can happen when
6464 the object is not initialized yet). */
6469 obj_type
= type_from_tag (tag
);
6474 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6477 /* Return the "ada__tags__type_specific_data" type. */
6479 static struct type
*
6480 ada_get_tsd_type (struct inferior
*inf
)
6482 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6484 if (data
->tsd_type
== 0)
6485 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6486 return data
->tsd_type
;
6489 /* Return the TSD (type-specific data) associated to the given TAG.
6490 TAG is assumed to be the tag of a tagged-type entity.
6492 May return NULL if we are unable to get the TSD. */
6494 static struct value
*
6495 ada_get_tsd_from_tag (struct value
*tag
)
6500 /* First option: The TSD is simply stored as a field of our TAG.
6501 Only older versions of GNAT would use this format, but we have
6502 to test it first, because there are no visible markers for
6503 the current approach except the absence of that field. */
6505 val
= ada_value_struct_elt (tag
, "tsd", 1);
6509 /* Try the second representation for the dispatch table (in which
6510 there is no explicit 'tsd' field in the referent of the tag pointer,
6511 and instead the tsd pointer is stored just before the dispatch
6514 type
= ada_get_tsd_type (current_inferior());
6517 type
= lookup_pointer_type (lookup_pointer_type (type
));
6518 val
= value_cast (type
, tag
);
6521 return value_ind (value_ptradd (val
, -1));
6524 /* Given the TSD of a tag (type-specific data), return a string
6525 containing the name of the associated type.
6527 May return NULL if we are unable to determine the tag name. */
6529 static gdb::unique_xmalloc_ptr
<char>
6530 ada_tag_name_from_tsd (struct value
*tsd
)
6535 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6538 gdb::unique_xmalloc_ptr
<char> buffer
6539 = target_read_string (value_as_address (val
), INT_MAX
);
6540 if (buffer
== nullptr)
6543 for (p
= buffer
.get (); *p
!= '\0'; ++p
)
6552 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6555 Return NULL if the TAG is not an Ada tag, or if we were unable to
6556 determine the name of that tag. */
6558 gdb::unique_xmalloc_ptr
<char>
6559 ada_tag_name (struct value
*tag
)
6561 gdb::unique_xmalloc_ptr
<char> name
;
6563 if (!ada_is_tag_type (value_type (tag
)))
6566 /* It is perfectly possible that an exception be raised while trying
6567 to determine the TAG's name, even under normal circumstances:
6568 The associated variable may be uninitialized or corrupted, for
6569 instance. We do not let any exception propagate past this point.
6570 instead we return NULL.
6572 We also do not print the error message either (which often is very
6573 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6574 the caller print a more meaningful message if necessary. */
6577 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6580 name
= ada_tag_name_from_tsd (tsd
);
6582 catch (const gdb_exception_error
&e
)
6589 /* The parent type of TYPE, or NULL if none. */
6592 ada_parent_type (struct type
*type
)
6596 type
= ada_check_typedef (type
);
6598 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6601 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6602 if (ada_is_parent_field (type
, i
))
6604 struct type
*parent_type
= type
->field (i
).type ();
6606 /* If the _parent field is a pointer, then dereference it. */
6607 if (parent_type
->code () == TYPE_CODE_PTR
)
6608 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6609 /* If there is a parallel XVS type, get the actual base type. */
6610 parent_type
= ada_get_base_type (parent_type
);
6612 return ada_check_typedef (parent_type
);
6618 /* True iff field number FIELD_NUM of structure type TYPE contains the
6619 parent-type (inherited) fields of a derived type. Assumes TYPE is
6620 a structure type with at least FIELD_NUM+1 fields. */
6623 ada_is_parent_field (struct type
*type
, int field_num
)
6625 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6627 return (name
!= NULL
6628 && (startswith (name
, "PARENT")
6629 || startswith (name
, "_parent")));
6632 /* True iff field number FIELD_NUM of structure type TYPE is a
6633 transparent wrapper field (which should be silently traversed when doing
6634 field selection and flattened when printing). Assumes TYPE is a
6635 structure type with at least FIELD_NUM+1 fields. Such fields are always
6639 ada_is_wrapper_field (struct type
*type
, int field_num
)
6641 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6643 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6645 /* This happens in functions with "out" or "in out" parameters
6646 which are passed by copy. For such functions, GNAT describes
6647 the function's return type as being a struct where the return
6648 value is in a field called RETVAL, and where the other "out"
6649 or "in out" parameters are fields of that struct. This is not
6654 return (name
!= NULL
6655 && (startswith (name
, "PARENT")
6656 || strcmp (name
, "REP") == 0
6657 || startswith (name
, "_parent")
6658 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6661 /* True iff field number FIELD_NUM of structure or union type TYPE
6662 is a variant wrapper. Assumes TYPE is a structure type with at least
6663 FIELD_NUM+1 fields. */
6666 ada_is_variant_part (struct type
*type
, int field_num
)
6668 /* Only Ada types are eligible. */
6669 if (!ADA_TYPE_P (type
))
6672 struct type
*field_type
= type
->field (field_num
).type ();
6674 return (field_type
->code () == TYPE_CODE_UNION
6675 || (is_dynamic_field (type
, field_num
)
6676 && (TYPE_TARGET_TYPE (field_type
)->code ()
6677 == TYPE_CODE_UNION
)));
6680 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6681 whose discriminants are contained in the record type OUTER_TYPE,
6682 returns the type of the controlling discriminant for the variant.
6683 May return NULL if the type could not be found. */
6686 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6688 const char *name
= ada_variant_discrim_name (var_type
);
6690 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6693 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6694 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6695 represents a 'when others' clause; otherwise 0. */
6698 ada_is_others_clause (struct type
*type
, int field_num
)
6700 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6702 return (name
!= NULL
&& name
[0] == 'O');
6705 /* Assuming that TYPE0 is the type of the variant part of a record,
6706 returns the name of the discriminant controlling the variant.
6707 The value is valid until the next call to ada_variant_discrim_name. */
6710 ada_variant_discrim_name (struct type
*type0
)
6712 static std::string result
;
6715 const char *discrim_end
;
6716 const char *discrim_start
;
6718 if (type0
->code () == TYPE_CODE_PTR
)
6719 type
= TYPE_TARGET_TYPE (type0
);
6723 name
= ada_type_name (type
);
6725 if (name
== NULL
|| name
[0] == '\000')
6728 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6731 if (startswith (discrim_end
, "___XVN"))
6734 if (discrim_end
== name
)
6737 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6740 if (discrim_start
== name
+ 1)
6742 if ((discrim_start
> name
+ 3
6743 && startswith (discrim_start
- 3, "___"))
6744 || discrim_start
[-1] == '.')
6748 result
= std::string (discrim_start
, discrim_end
- discrim_start
);
6749 return result
.c_str ();
6752 /* Scan STR for a subtype-encoded number, beginning at position K.
6753 Put the position of the character just past the number scanned in
6754 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6755 Return 1 if there was a valid number at the given position, and 0
6756 otherwise. A "subtype-encoded" number consists of the absolute value
6757 in decimal, followed by the letter 'm' to indicate a negative number.
6758 Assumes 0m does not occur. */
6761 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6765 if (!isdigit (str
[k
]))
6768 /* Do it the hard way so as not to make any assumption about
6769 the relationship of unsigned long (%lu scan format code) and
6772 while (isdigit (str
[k
]))
6774 RU
= RU
* 10 + (str
[k
] - '0');
6781 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6787 /* NOTE on the above: Technically, C does not say what the results of
6788 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6789 number representable as a LONGEST (although either would probably work
6790 in most implementations). When RU>0, the locution in the then branch
6791 above is always equivalent to the negative of RU. */
6798 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6799 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6800 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6803 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6805 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6819 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6829 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6830 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6832 if (val
>= L
&& val
<= U
)
6844 /* FIXME: Lots of redundancy below. Try to consolidate. */
6846 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6847 ARG_TYPE, extract and return the value of one of its (non-static)
6848 fields. FIELDNO says which field. Differs from value_primitive_field
6849 only in that it can handle packed values of arbitrary type. */
6852 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6853 struct type
*arg_type
)
6857 arg_type
= ada_check_typedef (arg_type
);
6858 type
= arg_type
->field (fieldno
).type ();
6860 /* Handle packed fields. It might be that the field is not packed
6861 relative to its containing structure, but the structure itself is
6862 packed; in this case we must take the bit-field path. */
6863 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
6865 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6866 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6868 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6869 offset
+ bit_pos
/ 8,
6870 bit_pos
% 8, bit_size
, type
);
6873 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6876 /* Find field with name NAME in object of type TYPE. If found,
6877 set the following for each argument that is non-null:
6878 - *FIELD_TYPE_P to the field's type;
6879 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6880 an object of that type;
6881 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6882 - *BIT_SIZE_P to its size in bits if the field is packed, and
6884 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6885 fields up to but not including the desired field, or by the total
6886 number of fields if not found. A NULL value of NAME never
6887 matches; the function just counts visible fields in this case.
6889 Notice that we need to handle when a tagged record hierarchy
6890 has some components with the same name, like in this scenario:
6892 type Top_T is tagged record
6898 type Middle_T is new Top.Top_T with record
6899 N : Character := 'a';
6903 type Bottom_T is new Middle.Middle_T with record
6905 C : Character := '5';
6907 A : Character := 'J';
6910 Let's say we now have a variable declared and initialized as follow:
6912 TC : Top_A := new Bottom_T;
6914 And then we use this variable to call this function
6916 procedure Assign (Obj: in out Top_T; TV : Integer);
6920 Assign (Top_T (B), 12);
6922 Now, we're in the debugger, and we're inside that procedure
6923 then and we want to print the value of obj.c:
6925 Usually, the tagged record or one of the parent type owns the
6926 component to print and there's no issue but in this particular
6927 case, what does it mean to ask for Obj.C? Since the actual
6928 type for object is type Bottom_T, it could mean two things: type
6929 component C from the Middle_T view, but also component C from
6930 Bottom_T. So in that "undefined" case, when the component is
6931 not found in the non-resolved type (which includes all the
6932 components of the parent type), then resolve it and see if we
6933 get better luck once expanded.
6935 In the case of homonyms in the derived tagged type, we don't
6936 guaranty anything, and pick the one that's easiest for us
6939 Returns 1 if found, 0 otherwise. */
6942 find_struct_field (const char *name
, struct type
*type
, int offset
,
6943 struct type
**field_type_p
,
6944 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6948 int parent_offset
= -1;
6950 type
= ada_check_typedef (type
);
6952 if (field_type_p
!= NULL
)
6953 *field_type_p
= NULL
;
6954 if (byte_offset_p
!= NULL
)
6956 if (bit_offset_p
!= NULL
)
6958 if (bit_size_p
!= NULL
)
6961 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6963 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6964 int fld_offset
= offset
+ bit_pos
/ 8;
6965 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6967 if (t_field_name
== NULL
)
6970 else if (ada_is_parent_field (type
, i
))
6972 /* This is a field pointing us to the parent type of a tagged
6973 type. As hinted in this function's documentation, we give
6974 preference to fields in the current record first, so what
6975 we do here is just record the index of this field before
6976 we skip it. If it turns out we couldn't find our field
6977 in the current record, then we'll get back to it and search
6978 inside it whether the field might exist in the parent. */
6984 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6986 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6988 if (field_type_p
!= NULL
)
6989 *field_type_p
= type
->field (i
).type ();
6990 if (byte_offset_p
!= NULL
)
6991 *byte_offset_p
= fld_offset
;
6992 if (bit_offset_p
!= NULL
)
6993 *bit_offset_p
= bit_pos
% 8;
6994 if (bit_size_p
!= NULL
)
6995 *bit_size_p
= bit_size
;
6998 else if (ada_is_wrapper_field (type
, i
))
7000 if (find_struct_field (name
, type
->field (i
).type (), fld_offset
,
7001 field_type_p
, byte_offset_p
, bit_offset_p
,
7002 bit_size_p
, index_p
))
7005 else if (ada_is_variant_part (type
, i
))
7007 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7010 struct type
*field_type
7011 = ada_check_typedef (type
->field (i
).type ());
7013 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7015 if (find_struct_field (name
, field_type
->field (j
).type (),
7017 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7018 field_type_p
, byte_offset_p
,
7019 bit_offset_p
, bit_size_p
, index_p
))
7023 else if (index_p
!= NULL
)
7027 /* Field not found so far. If this is a tagged type which
7028 has a parent, try finding that field in the parent now. */
7030 if (parent_offset
!= -1)
7032 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7033 int fld_offset
= offset
+ bit_pos
/ 8;
7035 if (find_struct_field (name
, type
->field (parent_offset
).type (),
7036 fld_offset
, field_type_p
, byte_offset_p
,
7037 bit_offset_p
, bit_size_p
, index_p
))
7044 /* Number of user-visible fields in record type TYPE. */
7047 num_visible_fields (struct type
*type
)
7052 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7056 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7057 and search in it assuming it has (class) type TYPE.
7058 If found, return value, else return NULL.
7060 Searches recursively through wrapper fields (e.g., '_parent').
7062 In the case of homonyms in the tagged types, please refer to the
7063 long explanation in find_struct_field's function documentation. */
7065 static struct value
*
7066 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7070 int parent_offset
= -1;
7072 type
= ada_check_typedef (type
);
7073 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7075 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7077 if (t_field_name
== NULL
)
7080 else if (ada_is_parent_field (type
, i
))
7082 /* This is a field pointing us to the parent type of a tagged
7083 type. As hinted in this function's documentation, we give
7084 preference to fields in the current record first, so what
7085 we do here is just record the index of this field before
7086 we skip it. If it turns out we couldn't find our field
7087 in the current record, then we'll get back to it and search
7088 inside it whether the field might exist in the parent. */
7094 else if (field_name_match (t_field_name
, name
))
7095 return ada_value_primitive_field (arg
, offset
, i
, type
);
7097 else if (ada_is_wrapper_field (type
, i
))
7099 struct value
*v
= /* Do not let indent join lines here. */
7100 ada_search_struct_field (name
, arg
,
7101 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7102 type
->field (i
).type ());
7108 else if (ada_is_variant_part (type
, i
))
7110 /* PNH: Do we ever get here? See find_struct_field. */
7112 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7113 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7115 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7117 struct value
*v
= ada_search_struct_field
/* Force line
7120 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7121 field_type
->field (j
).type ());
7129 /* Field not found so far. If this is a tagged type which
7130 has a parent, try finding that field in the parent now. */
7132 if (parent_offset
!= -1)
7134 struct value
*v
= ada_search_struct_field (
7135 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7136 type
->field (parent_offset
).type ());
7145 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7146 int, struct type
*);
7149 /* Return field #INDEX in ARG, where the index is that returned by
7150 * find_struct_field through its INDEX_P argument. Adjust the address
7151 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7152 * If found, return value, else return NULL. */
7154 static struct value
*
7155 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7158 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7162 /* Auxiliary function for ada_index_struct_field. Like
7163 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7166 static struct value
*
7167 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7171 type
= ada_check_typedef (type
);
7173 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7175 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7177 else if (ada_is_wrapper_field (type
, i
))
7179 struct value
*v
= /* Do not let indent join lines here. */
7180 ada_index_struct_field_1 (index_p
, arg
,
7181 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7182 type
->field (i
).type ());
7188 else if (ada_is_variant_part (type
, i
))
7190 /* PNH: Do we ever get here? See ada_search_struct_field,
7191 find_struct_field. */
7192 error (_("Cannot assign this kind of variant record"));
7194 else if (*index_p
== 0)
7195 return ada_value_primitive_field (arg
, offset
, i
, type
);
7202 /* Return a string representation of type TYPE. */
7205 type_as_string (struct type
*type
)
7207 string_file tmp_stream
;
7209 type_print (type
, "", &tmp_stream
, -1);
7211 return std::move (tmp_stream
.string ());
7214 /* Given a type TYPE, look up the type of the component of type named NAME.
7215 If DISPP is non-null, add its byte displacement from the beginning of a
7216 structure (pointed to by a value) of type TYPE to *DISPP (does not
7217 work for packed fields).
7219 Matches any field whose name has NAME as a prefix, possibly
7222 TYPE can be either a struct or union. If REFOK, TYPE may also
7223 be a (pointer or reference)+ to a struct or union, and the
7224 ultimate target type will be searched.
7226 Looks recursively into variant clauses and parent types.
7228 In the case of homonyms in the tagged types, please refer to the
7229 long explanation in find_struct_field's function documentation.
7231 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7232 TYPE is not a type of the right kind. */
7234 static struct type
*
7235 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7239 int parent_offset
= -1;
7244 if (refok
&& type
!= NULL
)
7247 type
= ada_check_typedef (type
);
7248 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7250 type
= TYPE_TARGET_TYPE (type
);
7254 || (type
->code () != TYPE_CODE_STRUCT
7255 && type
->code () != TYPE_CODE_UNION
))
7260 error (_("Type %s is not a structure or union type"),
7261 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7264 type
= to_static_fixed_type (type
);
7266 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7268 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7271 if (t_field_name
== NULL
)
7274 else if (ada_is_parent_field (type
, i
))
7276 /* This is a field pointing us to the parent type of a tagged
7277 type. As hinted in this function's documentation, we give
7278 preference to fields in the current record first, so what
7279 we do here is just record the index of this field before
7280 we skip it. If it turns out we couldn't find our field
7281 in the current record, then we'll get back to it and search
7282 inside it whether the field might exist in the parent. */
7288 else if (field_name_match (t_field_name
, name
))
7289 return type
->field (i
).type ();
7291 else if (ada_is_wrapper_field (type
, i
))
7293 t
= ada_lookup_struct_elt_type (type
->field (i
).type (), name
,
7299 else if (ada_is_variant_part (type
, i
))
7302 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7304 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
7306 /* FIXME pnh 2008/01/26: We check for a field that is
7307 NOT wrapped in a struct, since the compiler sometimes
7308 generates these for unchecked variant types. Revisit
7309 if the compiler changes this practice. */
7310 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7312 if (v_field_name
!= NULL
7313 && field_name_match (v_field_name
, name
))
7314 t
= field_type
->field (j
).type ();
7316 t
= ada_lookup_struct_elt_type (field_type
->field (j
).type (),
7326 /* Field not found so far. If this is a tagged type which
7327 has a parent, try finding that field in the parent now. */
7329 if (parent_offset
!= -1)
7333 t
= ada_lookup_struct_elt_type (type
->field (parent_offset
).type (),
7342 const char *name_str
= name
!= NULL
? name
: _("<null>");
7344 error (_("Type %s has no component named %s"),
7345 type_as_string (type
).c_str (), name_str
);
7351 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7352 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7353 represents an unchecked union (that is, the variant part of a
7354 record that is named in an Unchecked_Union pragma). */
7357 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7359 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7361 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7365 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7366 within OUTER, determine which variant clause (field number in VAR_TYPE,
7367 numbering from 0) is applicable. Returns -1 if none are. */
7370 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7374 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7375 struct value
*discrim
;
7376 LONGEST discrim_val
;
7378 /* Using plain value_from_contents_and_address here causes problems
7379 because we will end up trying to resolve a type that is currently
7380 being constructed. */
7381 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7382 if (discrim
== NULL
)
7384 discrim_val
= value_as_long (discrim
);
7387 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7389 if (ada_is_others_clause (var_type
, i
))
7391 else if (ada_in_variant (discrim_val
, var_type
, i
))
7395 return others_clause
;
7400 /* Dynamic-Sized Records */
7402 /* Strategy: The type ostensibly attached to a value with dynamic size
7403 (i.e., a size that is not statically recorded in the debugging
7404 data) does not accurately reflect the size or layout of the value.
7405 Our strategy is to convert these values to values with accurate,
7406 conventional types that are constructed on the fly. */
7408 /* There is a subtle and tricky problem here. In general, we cannot
7409 determine the size of dynamic records without its data. However,
7410 the 'struct value' data structure, which GDB uses to represent
7411 quantities in the inferior process (the target), requires the size
7412 of the type at the time of its allocation in order to reserve space
7413 for GDB's internal copy of the data. That's why the
7414 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7415 rather than struct value*s.
7417 However, GDB's internal history variables ($1, $2, etc.) are
7418 struct value*s containing internal copies of the data that are not, in
7419 general, the same as the data at their corresponding addresses in
7420 the target. Fortunately, the types we give to these values are all
7421 conventional, fixed-size types (as per the strategy described
7422 above), so that we don't usually have to perform the
7423 'to_fixed_xxx_type' conversions to look at their values.
7424 Unfortunately, there is one exception: if one of the internal
7425 history variables is an array whose elements are unconstrained
7426 records, then we will need to create distinct fixed types for each
7427 element selected. */
7429 /* The upshot of all of this is that many routines take a (type, host
7430 address, target address) triple as arguments to represent a value.
7431 The host address, if non-null, is supposed to contain an internal
7432 copy of the relevant data; otherwise, the program is to consult the
7433 target at the target address. */
7435 /* Assuming that VAL0 represents a pointer value, the result of
7436 dereferencing it. Differs from value_ind in its treatment of
7437 dynamic-sized types. */
7440 ada_value_ind (struct value
*val0
)
7442 struct value
*val
= value_ind (val0
);
7444 if (ada_is_tagged_type (value_type (val
), 0))
7445 val
= ada_tag_value_at_base_address (val
);
7447 return ada_to_fixed_value (val
);
7450 /* The value resulting from dereferencing any "reference to"
7451 qualifiers on VAL0. */
7453 static struct value
*
7454 ada_coerce_ref (struct value
*val0
)
7456 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7458 struct value
*val
= val0
;
7460 val
= coerce_ref (val
);
7462 if (ada_is_tagged_type (value_type (val
), 0))
7463 val
= ada_tag_value_at_base_address (val
);
7465 return ada_to_fixed_value (val
);
7471 /* Return the bit alignment required for field #F of template type TYPE. */
7474 field_alignment (struct type
*type
, int f
)
7476 const char *name
= TYPE_FIELD_NAME (type
, f
);
7480 /* The field name should never be null, unless the debugging information
7481 is somehow malformed. In this case, we assume the field does not
7482 require any alignment. */
7486 len
= strlen (name
);
7488 if (!isdigit (name
[len
- 1]))
7491 if (isdigit (name
[len
- 2]))
7492 align_offset
= len
- 2;
7494 align_offset
= len
- 1;
7496 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7497 return TARGET_CHAR_BIT
;
7499 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7502 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7504 static struct symbol
*
7505 ada_find_any_type_symbol (const char *name
)
7509 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7510 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7513 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7517 /* Find a type named NAME. Ignores ambiguity. This routine will look
7518 solely for types defined by debug info, it will not search the GDB
7521 static struct type
*
7522 ada_find_any_type (const char *name
)
7524 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7527 return SYMBOL_TYPE (sym
);
7532 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7533 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7534 symbol, in which case it is returned. Otherwise, this looks for
7535 symbols whose name is that of NAME_SYM suffixed with "___XR".
7536 Return symbol if found, and NULL otherwise. */
7539 ada_is_renaming_symbol (struct symbol
*name_sym
)
7541 const char *name
= name_sym
->linkage_name ();
7542 return strstr (name
, "___XR") != NULL
;
7545 /* Because of GNAT encoding conventions, several GDB symbols may match a
7546 given type name. If the type denoted by TYPE0 is to be preferred to
7547 that of TYPE1 for purposes of type printing, return non-zero;
7548 otherwise return 0. */
7551 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7555 else if (type0
== NULL
)
7557 else if (type1
->code () == TYPE_CODE_VOID
)
7559 else if (type0
->code () == TYPE_CODE_VOID
)
7561 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7563 else if (ada_is_constrained_packed_array_type (type0
))
7565 else if (ada_is_array_descriptor_type (type0
)
7566 && !ada_is_array_descriptor_type (type1
))
7570 const char *type0_name
= type0
->name ();
7571 const char *type1_name
= type1
->name ();
7573 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7574 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7580 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7584 ada_type_name (struct type
*type
)
7588 return type
->name ();
7591 /* Search the list of "descriptive" types associated to TYPE for a type
7592 whose name is NAME. */
7594 static struct type
*
7595 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7597 struct type
*result
, *tmp
;
7599 if (ada_ignore_descriptive_types_p
)
7602 /* If there no descriptive-type info, then there is no parallel type
7604 if (!HAVE_GNAT_AUX_INFO (type
))
7607 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7608 while (result
!= NULL
)
7610 const char *result_name
= ada_type_name (result
);
7612 if (result_name
== NULL
)
7614 warning (_("unexpected null name on descriptive type"));
7618 /* If the names match, stop. */
7619 if (strcmp (result_name
, name
) == 0)
7622 /* Otherwise, look at the next item on the list, if any. */
7623 if (HAVE_GNAT_AUX_INFO (result
))
7624 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7628 /* If not found either, try after having resolved the typedef. */
7633 result
= check_typedef (result
);
7634 if (HAVE_GNAT_AUX_INFO (result
))
7635 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7641 /* If we didn't find a match, see whether this is a packed array. With
7642 older compilers, the descriptive type information is either absent or
7643 irrelevant when it comes to packed arrays so the above lookup fails.
7644 Fall back to using a parallel lookup by name in this case. */
7645 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7646 return ada_find_any_type (name
);
7651 /* Find a parallel type to TYPE with the specified NAME, using the
7652 descriptive type taken from the debugging information, if available,
7653 and otherwise using the (slower) name-based method. */
7655 static struct type
*
7656 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7658 struct type
*result
= NULL
;
7660 if (HAVE_GNAT_AUX_INFO (type
))
7661 result
= find_parallel_type_by_descriptive_type (type
, name
);
7663 result
= ada_find_any_type (name
);
7668 /* Same as above, but specify the name of the parallel type by appending
7669 SUFFIX to the name of TYPE. */
7672 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7675 const char *type_name
= ada_type_name (type
);
7678 if (type_name
== NULL
)
7681 len
= strlen (type_name
);
7683 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7685 strcpy (name
, type_name
);
7686 strcpy (name
+ len
, suffix
);
7688 return ada_find_parallel_type_with_name (type
, name
);
7691 /* If TYPE is a variable-size record type, return the corresponding template
7692 type describing its fields. Otherwise, return NULL. */
7694 static struct type
*
7695 dynamic_template_type (struct type
*type
)
7697 type
= ada_check_typedef (type
);
7699 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7700 || ada_type_name (type
) == NULL
)
7704 int len
= strlen (ada_type_name (type
));
7706 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7709 return ada_find_parallel_type (type
, "___XVE");
7713 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7714 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7717 is_dynamic_field (struct type
*templ_type
, int field_num
)
7719 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7722 && templ_type
->field (field_num
).type ()->code () == TYPE_CODE_PTR
7723 && strstr (name
, "___XVL") != NULL
;
7726 /* The index of the variant field of TYPE, or -1 if TYPE does not
7727 represent a variant record type. */
7730 variant_field_index (struct type
*type
)
7734 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
7737 for (f
= 0; f
< type
->num_fields (); f
+= 1)
7739 if (ada_is_variant_part (type
, f
))
7745 /* A record type with no fields. */
7747 static struct type
*
7748 empty_record (struct type
*templ
)
7750 struct type
*type
= alloc_type_copy (templ
);
7752 type
->set_code (TYPE_CODE_STRUCT
);
7753 INIT_NONE_SPECIFIC (type
);
7754 type
->set_name ("<empty>");
7755 TYPE_LENGTH (type
) = 0;
7759 /* An ordinary record type (with fixed-length fields) that describes
7760 the value of type TYPE at VALADDR or ADDRESS (see comments at
7761 the beginning of this section) VAL according to GNAT conventions.
7762 DVAL0 should describe the (portion of a) record that contains any
7763 necessary discriminants. It should be NULL if value_type (VAL) is
7764 an outer-level type (i.e., as opposed to a branch of a variant.) A
7765 variant field (unless unchecked) is replaced by a particular branch
7768 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7769 length are not statically known are discarded. As a consequence,
7770 VALADDR, ADDRESS and DVAL0 are ignored.
7772 NOTE: Limitations: For now, we assume that dynamic fields and
7773 variants occupy whole numbers of bytes. However, they need not be
7777 ada_template_to_fixed_record_type_1 (struct type
*type
,
7778 const gdb_byte
*valaddr
,
7779 CORE_ADDR address
, struct value
*dval0
,
7780 int keep_dynamic_fields
)
7782 struct value
*mark
= value_mark ();
7785 int nfields
, bit_len
;
7791 /* Compute the number of fields in this record type that are going
7792 to be processed: unless keep_dynamic_fields, this includes only
7793 fields whose position and length are static will be processed. */
7794 if (keep_dynamic_fields
)
7795 nfields
= type
->num_fields ();
7799 while (nfields
< type
->num_fields ()
7800 && !ada_is_variant_part (type
, nfields
)
7801 && !is_dynamic_field (type
, nfields
))
7805 rtype
= alloc_type_copy (type
);
7806 rtype
->set_code (TYPE_CODE_STRUCT
);
7807 INIT_NONE_SPECIFIC (rtype
);
7808 rtype
->set_num_fields (nfields
);
7810 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
7811 rtype
->set_name (ada_type_name (type
));
7812 rtype
->set_is_fixed_instance (true);
7818 for (f
= 0; f
< nfields
; f
+= 1)
7820 off
= align_up (off
, field_alignment (type
, f
))
7821 + TYPE_FIELD_BITPOS (type
, f
);
7822 SET_FIELD_BITPOS (rtype
->field (f
), off
);
7823 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7825 if (ada_is_variant_part (type
, f
))
7830 else if (is_dynamic_field (type
, f
))
7832 const gdb_byte
*field_valaddr
= valaddr
;
7833 CORE_ADDR field_address
= address
;
7834 struct type
*field_type
=
7835 TYPE_TARGET_TYPE (type
->field (f
).type ());
7839 /* rtype's length is computed based on the run-time
7840 value of discriminants. If the discriminants are not
7841 initialized, the type size may be completely bogus and
7842 GDB may fail to allocate a value for it. So check the
7843 size first before creating the value. */
7844 ada_ensure_varsize_limit (rtype
);
7845 /* Using plain value_from_contents_and_address here
7846 causes problems because we will end up trying to
7847 resolve a type that is currently being
7849 dval
= value_from_contents_and_address_unresolved (rtype
,
7852 rtype
= value_type (dval
);
7857 /* If the type referenced by this field is an aligner type, we need
7858 to unwrap that aligner type, because its size might not be set.
7859 Keeping the aligner type would cause us to compute the wrong
7860 size for this field, impacting the offset of the all the fields
7861 that follow this one. */
7862 if (ada_is_aligner_type (field_type
))
7864 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7866 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7867 field_address
= cond_offset_target (field_address
, field_offset
);
7868 field_type
= ada_aligned_type (field_type
);
7871 field_valaddr
= cond_offset_host (field_valaddr
,
7872 off
/ TARGET_CHAR_BIT
);
7873 field_address
= cond_offset_target (field_address
,
7874 off
/ TARGET_CHAR_BIT
);
7876 /* Get the fixed type of the field. Note that, in this case,
7877 we do not want to get the real type out of the tag: if
7878 the current field is the parent part of a tagged record,
7879 we will get the tag of the object. Clearly wrong: the real
7880 type of the parent is not the real type of the child. We
7881 would end up in an infinite loop. */
7882 field_type
= ada_get_base_type (field_type
);
7883 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7884 field_address
, dval
, 0);
7885 /* If the field size is already larger than the maximum
7886 object size, then the record itself will necessarily
7887 be larger than the maximum object size. We need to make
7888 this check now, because the size might be so ridiculously
7889 large (due to an uninitialized variable in the inferior)
7890 that it would cause an overflow when adding it to the
7892 ada_ensure_varsize_limit (field_type
);
7894 rtype
->field (f
).set_type (field_type
);
7895 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7896 /* The multiplication can potentially overflow. But because
7897 the field length has been size-checked just above, and
7898 assuming that the maximum size is a reasonable value,
7899 an overflow should not happen in practice. So rather than
7900 adding overflow recovery code to this already complex code,
7901 we just assume that it's not going to happen. */
7903 TYPE_LENGTH (rtype
->field (f
).type ()) * TARGET_CHAR_BIT
;
7907 /* Note: If this field's type is a typedef, it is important
7908 to preserve the typedef layer.
7910 Otherwise, we might be transforming a typedef to a fat
7911 pointer (encoding a pointer to an unconstrained array),
7912 into a basic fat pointer (encoding an unconstrained
7913 array). As both types are implemented using the same
7914 structure, the typedef is the only clue which allows us
7915 to distinguish between the two options. Stripping it
7916 would prevent us from printing this field appropriately. */
7917 rtype
->field (f
).set_type (type
->field (f
).type ());
7918 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7919 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7921 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7924 struct type
*field_type
= type
->field (f
).type ();
7926 /* We need to be careful of typedefs when computing
7927 the length of our field. If this is a typedef,
7928 get the length of the target type, not the length
7930 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
7931 field_type
= ada_typedef_target_type (field_type
);
7934 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7937 if (off
+ fld_bit_len
> bit_len
)
7938 bit_len
= off
+ fld_bit_len
;
7940 TYPE_LENGTH (rtype
) =
7941 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7944 /* We handle the variant part, if any, at the end because of certain
7945 odd cases in which it is re-ordered so as NOT to be the last field of
7946 the record. This can happen in the presence of representation
7948 if (variant_field
>= 0)
7950 struct type
*branch_type
;
7952 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7956 /* Using plain value_from_contents_and_address here causes
7957 problems because we will end up trying to resolve a type
7958 that is currently being constructed. */
7959 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
7961 rtype
= value_type (dval
);
7967 to_fixed_variant_branch_type
7968 (type
->field (variant_field
).type (),
7969 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7970 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7971 if (branch_type
== NULL
)
7973 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
7974 rtype
->field (f
- 1) = rtype
->field (f
);
7975 rtype
->set_num_fields (rtype
->num_fields () - 1);
7979 rtype
->field (variant_field
).set_type (branch_type
);
7980 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7982 TYPE_LENGTH (rtype
->field (variant_field
).type ()) *
7984 if (off
+ fld_bit_len
> bit_len
)
7985 bit_len
= off
+ fld_bit_len
;
7986 TYPE_LENGTH (rtype
) =
7987 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7991 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7992 should contain the alignment of that record, which should be a strictly
7993 positive value. If null or negative, then something is wrong, most
7994 probably in the debug info. In that case, we don't round up the size
7995 of the resulting type. If this record is not part of another structure,
7996 the current RTYPE length might be good enough for our purposes. */
7997 if (TYPE_LENGTH (type
) <= 0)
8000 warning (_("Invalid type size for `%s' detected: %s."),
8001 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
8003 warning (_("Invalid type size for <unnamed> detected: %s."),
8004 pulongest (TYPE_LENGTH (type
)));
8008 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
8009 TYPE_LENGTH (type
));
8012 value_free_to_mark (mark
);
8013 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8014 error (_("record type with dynamic size is larger than varsize-limit"));
8018 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8021 static struct type
*
8022 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8023 CORE_ADDR address
, struct value
*dval0
)
8025 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8029 /* An ordinary record type in which ___XVL-convention fields and
8030 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8031 static approximations, containing all possible fields. Uses
8032 no runtime values. Useless for use in values, but that's OK,
8033 since the results are used only for type determinations. Works on both
8034 structs and unions. Representation note: to save space, we memorize
8035 the result of this function in the TYPE_TARGET_TYPE of the
8038 static struct type
*
8039 template_to_static_fixed_type (struct type
*type0
)
8045 /* No need no do anything if the input type is already fixed. */
8046 if (type0
->is_fixed_instance ())
8049 /* Likewise if we already have computed the static approximation. */
8050 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8051 return TYPE_TARGET_TYPE (type0
);
8053 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8055 nfields
= type0
->num_fields ();
8057 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8058 recompute all over next time. */
8059 TYPE_TARGET_TYPE (type0
) = type
;
8061 for (f
= 0; f
< nfields
; f
+= 1)
8063 struct type
*field_type
= type0
->field (f
).type ();
8064 struct type
*new_type
;
8066 if (is_dynamic_field (type0
, f
))
8068 field_type
= ada_check_typedef (field_type
);
8069 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8072 new_type
= static_unwrap_type (field_type
);
8074 if (new_type
!= field_type
)
8076 /* Clone TYPE0 only the first time we get a new field type. */
8079 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8080 type
->set_code (type0
->code ());
8081 INIT_NONE_SPECIFIC (type
);
8082 type
->set_num_fields (nfields
);
8086 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
8087 memcpy (fields
, type0
->fields (),
8088 sizeof (struct field
) * nfields
);
8089 type
->set_fields (fields
);
8091 type
->set_name (ada_type_name (type0
));
8092 type
->set_is_fixed_instance (true);
8093 TYPE_LENGTH (type
) = 0;
8095 type
->field (f
).set_type (new_type
);
8096 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8103 /* Given an object of type TYPE whose contents are at VALADDR and
8104 whose address in memory is ADDRESS, returns a revision of TYPE,
8105 which should be a non-dynamic-sized record, in which the variant
8106 part, if any, is replaced with the appropriate branch. Looks
8107 for discriminant values in DVAL0, which can be NULL if the record
8108 contains the necessary discriminant values. */
8110 static struct type
*
8111 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8112 CORE_ADDR address
, struct value
*dval0
)
8114 struct value
*mark
= value_mark ();
8117 struct type
*branch_type
;
8118 int nfields
= type
->num_fields ();
8119 int variant_field
= variant_field_index (type
);
8121 if (variant_field
== -1)
8126 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8127 type
= value_type (dval
);
8132 rtype
= alloc_type_copy (type
);
8133 rtype
->set_code (TYPE_CODE_STRUCT
);
8134 INIT_NONE_SPECIFIC (rtype
);
8135 rtype
->set_num_fields (nfields
);
8138 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8139 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
8140 rtype
->set_fields (fields
);
8142 rtype
->set_name (ada_type_name (type
));
8143 rtype
->set_is_fixed_instance (true);
8144 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8146 branch_type
= to_fixed_variant_branch_type
8147 (type
->field (variant_field
).type (),
8148 cond_offset_host (valaddr
,
8149 TYPE_FIELD_BITPOS (type
, variant_field
)
8151 cond_offset_target (address
,
8152 TYPE_FIELD_BITPOS (type
, variant_field
)
8153 / TARGET_CHAR_BIT
), dval
);
8154 if (branch_type
== NULL
)
8158 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8159 rtype
->field (f
- 1) = rtype
->field (f
);
8160 rtype
->set_num_fields (rtype
->num_fields () - 1);
8164 rtype
->field (variant_field
).set_type (branch_type
);
8165 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8166 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8167 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8169 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (type
->field (variant_field
).type ());
8171 value_free_to_mark (mark
);
8175 /* An ordinary record type (with fixed-length fields) that describes
8176 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8177 beginning of this section]. Any necessary discriminants' values
8178 should be in DVAL, a record value; it may be NULL if the object
8179 at ADDR itself contains any necessary discriminant values.
8180 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8181 values from the record are needed. Except in the case that DVAL,
8182 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8183 unchecked) is replaced by a particular branch of the variant.
8185 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8186 is questionable and may be removed. It can arise during the
8187 processing of an unconstrained-array-of-record type where all the
8188 variant branches have exactly the same size. This is because in
8189 such cases, the compiler does not bother to use the XVS convention
8190 when encoding the record. I am currently dubious of this
8191 shortcut and suspect the compiler should be altered. FIXME. */
8193 static struct type
*
8194 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8195 CORE_ADDR address
, struct value
*dval
)
8197 struct type
*templ_type
;
8199 if (type0
->is_fixed_instance ())
8202 templ_type
= dynamic_template_type (type0
);
8204 if (templ_type
!= NULL
)
8205 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8206 else if (variant_field_index (type0
) >= 0)
8208 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8210 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8215 type0
->set_is_fixed_instance (true);
8221 /* An ordinary record type (with fixed-length fields) that describes
8222 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8223 union type. Any necessary discriminants' values should be in DVAL,
8224 a record value. That is, this routine selects the appropriate
8225 branch of the union at ADDR according to the discriminant value
8226 indicated in the union's type name. Returns VAR_TYPE0 itself if
8227 it represents a variant subject to a pragma Unchecked_Union. */
8229 static struct type
*
8230 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8231 CORE_ADDR address
, struct value
*dval
)
8234 struct type
*templ_type
;
8235 struct type
*var_type
;
8237 if (var_type0
->code () == TYPE_CODE_PTR
)
8238 var_type
= TYPE_TARGET_TYPE (var_type0
);
8240 var_type
= var_type0
;
8242 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8244 if (templ_type
!= NULL
)
8245 var_type
= templ_type
;
8247 if (is_unchecked_variant (var_type
, value_type (dval
)))
8249 which
= ada_which_variant_applies (var_type
, dval
);
8252 return empty_record (var_type
);
8253 else if (is_dynamic_field (var_type
, which
))
8254 return to_fixed_record_type
8255 (TYPE_TARGET_TYPE (var_type
->field (which
).type ()),
8256 valaddr
, address
, dval
);
8257 else if (variant_field_index (var_type
->field (which
).type ()) >= 0)
8259 to_fixed_record_type
8260 (var_type
->field (which
).type (), valaddr
, address
, dval
);
8262 return var_type
->field (which
).type ();
8265 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8266 ENCODING_TYPE, a type following the GNAT conventions for discrete
8267 type encodings, only carries redundant information. */
8270 ada_is_redundant_range_encoding (struct type
*range_type
,
8271 struct type
*encoding_type
)
8273 const char *bounds_str
;
8277 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8279 if (get_base_type (range_type
)->code ()
8280 != get_base_type (encoding_type
)->code ())
8282 /* The compiler probably used a simple base type to describe
8283 the range type instead of the range's actual base type,
8284 expecting us to get the real base type from the encoding
8285 anyway. In this situation, the encoding cannot be ignored
8290 if (is_dynamic_type (range_type
))
8293 if (encoding_type
->name () == NULL
)
8296 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8297 if (bounds_str
== NULL
)
8300 n
= 8; /* Skip "___XDLU_". */
8301 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8303 if (range_type
->bounds ()->low
.const_val () != lo
)
8306 n
+= 2; /* Skip the "__" separator between the two bounds. */
8307 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8309 if (range_type
->bounds ()->high
.const_val () != hi
)
8315 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8316 a type following the GNAT encoding for describing array type
8317 indices, only carries redundant information. */
8320 ada_is_redundant_index_type_desc (struct type
*array_type
,
8321 struct type
*desc_type
)
8323 struct type
*this_layer
= check_typedef (array_type
);
8326 for (i
= 0; i
< desc_type
->num_fields (); i
++)
8328 if (!ada_is_redundant_range_encoding (this_layer
->index_type (),
8329 desc_type
->field (i
).type ()))
8331 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8337 /* Assuming that TYPE0 is an array type describing the type of a value
8338 at ADDR, and that DVAL describes a record containing any
8339 discriminants used in TYPE0, returns a type for the value that
8340 contains no dynamic components (that is, no components whose sizes
8341 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8342 true, gives an error message if the resulting type's size is over
8345 static struct type
*
8346 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8349 struct type
*index_type_desc
;
8350 struct type
*result
;
8351 int constrained_packed_array_p
;
8352 static const char *xa_suffix
= "___XA";
8354 type0
= ada_check_typedef (type0
);
8355 if (type0
->is_fixed_instance ())
8358 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8359 if (constrained_packed_array_p
)
8361 type0
= decode_constrained_packed_array_type (type0
);
8362 if (type0
== nullptr)
8363 error (_("could not decode constrained packed array type"));
8366 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8368 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8369 encoding suffixed with 'P' may still be generated. If so,
8370 it should be used to find the XA type. */
8372 if (index_type_desc
== NULL
)
8374 const char *type_name
= ada_type_name (type0
);
8376 if (type_name
!= NULL
)
8378 const int len
= strlen (type_name
);
8379 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8381 if (type_name
[len
- 1] == 'P')
8383 strcpy (name
, type_name
);
8384 strcpy (name
+ len
- 1, xa_suffix
);
8385 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8390 ada_fixup_array_indexes_type (index_type_desc
);
8391 if (index_type_desc
!= NULL
8392 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8394 /* Ignore this ___XA parallel type, as it does not bring any
8395 useful information. This allows us to avoid creating fixed
8396 versions of the array's index types, which would be identical
8397 to the original ones. This, in turn, can also help avoid
8398 the creation of fixed versions of the array itself. */
8399 index_type_desc
= NULL
;
8402 if (index_type_desc
== NULL
)
8404 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8406 /* NOTE: elt_type---the fixed version of elt_type0---should never
8407 depend on the contents of the array in properly constructed
8409 /* Create a fixed version of the array element type.
8410 We're not providing the address of an element here,
8411 and thus the actual object value cannot be inspected to do
8412 the conversion. This should not be a problem, since arrays of
8413 unconstrained objects are not allowed. In particular, all
8414 the elements of an array of a tagged type should all be of
8415 the same type specified in the debugging info. No need to
8416 consult the object tag. */
8417 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8419 /* Make sure we always create a new array type when dealing with
8420 packed array types, since we're going to fix-up the array
8421 type length and element bitsize a little further down. */
8422 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8425 result
= create_array_type (alloc_type_copy (type0
),
8426 elt_type
, type0
->index_type ());
8431 struct type
*elt_type0
;
8434 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8435 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8437 /* NOTE: result---the fixed version of elt_type0---should never
8438 depend on the contents of the array in properly constructed
8440 /* Create a fixed version of the array element type.
8441 We're not providing the address of an element here,
8442 and thus the actual object value cannot be inspected to do
8443 the conversion. This should not be a problem, since arrays of
8444 unconstrained objects are not allowed. In particular, all
8445 the elements of an array of a tagged type should all be of
8446 the same type specified in the debugging info. No need to
8447 consult the object tag. */
8449 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8452 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8454 struct type
*range_type
=
8455 to_fixed_range_type (index_type_desc
->field (i
).type (), dval
);
8457 result
= create_array_type (alloc_type_copy (elt_type0
),
8458 result
, range_type
);
8459 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8461 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8462 error (_("array type with dynamic size is larger than varsize-limit"));
8465 /* We want to preserve the type name. This can be useful when
8466 trying to get the type name of a value that has already been
8467 printed (for instance, if the user did "print VAR; whatis $". */
8468 result
->set_name (type0
->name ());
8470 if (constrained_packed_array_p
)
8472 /* So far, the resulting type has been created as if the original
8473 type was a regular (non-packed) array type. As a result, the
8474 bitsize of the array elements needs to be set again, and the array
8475 length needs to be recomputed based on that bitsize. */
8476 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8477 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8479 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8480 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8481 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8482 TYPE_LENGTH (result
)++;
8485 result
->set_is_fixed_instance (true);
8490 /* A standard type (containing no dynamically sized components)
8491 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8492 DVAL describes a record containing any discriminants used in TYPE0,
8493 and may be NULL if there are none, or if the object of type TYPE at
8494 ADDRESS or in VALADDR contains these discriminants.
8496 If CHECK_TAG is not null, in the case of tagged types, this function
8497 attempts to locate the object's tag and use it to compute the actual
8498 type. However, when ADDRESS is null, we cannot use it to determine the
8499 location of the tag, and therefore compute the tagged type's actual type.
8500 So we return the tagged type without consulting the tag. */
8502 static struct type
*
8503 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8504 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8506 type
= ada_check_typedef (type
);
8508 /* Only un-fixed types need to be handled here. */
8509 if (!HAVE_GNAT_AUX_INFO (type
))
8512 switch (type
->code ())
8516 case TYPE_CODE_STRUCT
:
8518 struct type
*static_type
= to_static_fixed_type (type
);
8519 struct type
*fixed_record_type
=
8520 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8522 /* If STATIC_TYPE is a tagged type and we know the object's address,
8523 then we can determine its tag, and compute the object's actual
8524 type from there. Note that we have to use the fixed record
8525 type (the parent part of the record may have dynamic fields
8526 and the way the location of _tag is expressed may depend on
8529 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8532 value_tag_from_contents_and_address
8536 struct type
*real_type
= type_from_tag (tag
);
8538 value_from_contents_and_address (fixed_record_type
,
8541 fixed_record_type
= value_type (obj
);
8542 if (real_type
!= NULL
)
8543 return to_fixed_record_type
8545 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8548 /* Check to see if there is a parallel ___XVZ variable.
8549 If there is, then it provides the actual size of our type. */
8550 else if (ada_type_name (fixed_record_type
) != NULL
)
8552 const char *name
= ada_type_name (fixed_record_type
);
8554 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8555 bool xvz_found
= false;
8558 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8561 xvz_found
= get_int_var_value (xvz_name
, size
);
8563 catch (const gdb_exception_error
&except
)
8565 /* We found the variable, but somehow failed to read
8566 its value. Rethrow the same error, but with a little
8567 bit more information, to help the user understand
8568 what went wrong (Eg: the variable might have been
8570 throw_error (except
.error
,
8571 _("unable to read value of %s (%s)"),
8572 xvz_name
, except
.what ());
8575 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8577 fixed_record_type
= copy_type (fixed_record_type
);
8578 TYPE_LENGTH (fixed_record_type
) = size
;
8580 /* The FIXED_RECORD_TYPE may have be a stub. We have
8581 observed this when the debugging info is STABS, and
8582 apparently it is something that is hard to fix.
8584 In practice, we don't need the actual type definition
8585 at all, because the presence of the XVZ variable allows us
8586 to assume that there must be a XVS type as well, which we
8587 should be able to use later, when we need the actual type
8590 In the meantime, pretend that the "fixed" type we are
8591 returning is NOT a stub, because this can cause trouble
8592 when using this type to create new types targeting it.
8593 Indeed, the associated creation routines often check
8594 whether the target type is a stub and will try to replace
8595 it, thus using a type with the wrong size. This, in turn,
8596 might cause the new type to have the wrong size too.
8597 Consider the case of an array, for instance, where the size
8598 of the array is computed from the number of elements in
8599 our array multiplied by the size of its element. */
8600 fixed_record_type
->set_is_stub (false);
8603 return fixed_record_type
;
8605 case TYPE_CODE_ARRAY
:
8606 return to_fixed_array_type (type
, dval
, 1);
8607 case TYPE_CODE_UNION
:
8611 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8615 /* The same as ada_to_fixed_type_1, except that it preserves the type
8616 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8618 The typedef layer needs be preserved in order to differentiate between
8619 arrays and array pointers when both types are implemented using the same
8620 fat pointer. In the array pointer case, the pointer is encoded as
8621 a typedef of the pointer type. For instance, considering:
8623 type String_Access is access String;
8624 S1 : String_Access := null;
8626 To the debugger, S1 is defined as a typedef of type String. But
8627 to the user, it is a pointer. So if the user tries to print S1,
8628 we should not dereference the array, but print the array address
8631 If we didn't preserve the typedef layer, we would lose the fact that
8632 the type is to be presented as a pointer (needs de-reference before
8633 being printed). And we would also use the source-level type name. */
8636 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8637 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8640 struct type
*fixed_type
=
8641 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8643 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8644 then preserve the typedef layer.
8646 Implementation note: We can only check the main-type portion of
8647 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8648 from TYPE now returns a type that has the same instance flags
8649 as TYPE. For instance, if TYPE is a "typedef const", and its
8650 target type is a "struct", then the typedef elimination will return
8651 a "const" version of the target type. See check_typedef for more
8652 details about how the typedef layer elimination is done.
8654 brobecker/2010-11-19: It seems to me that the only case where it is
8655 useful to preserve the typedef layer is when dealing with fat pointers.
8656 Perhaps, we could add a check for that and preserve the typedef layer
8657 only in that situation. But this seems unnecessary so far, probably
8658 because we call check_typedef/ada_check_typedef pretty much everywhere.
8660 if (type
->code () == TYPE_CODE_TYPEDEF
8661 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8662 == TYPE_MAIN_TYPE (fixed_type
)))
8668 /* A standard (static-sized) type corresponding as well as possible to
8669 TYPE0, but based on no runtime data. */
8671 static struct type
*
8672 to_static_fixed_type (struct type
*type0
)
8679 if (type0
->is_fixed_instance ())
8682 type0
= ada_check_typedef (type0
);
8684 switch (type0
->code ())
8688 case TYPE_CODE_STRUCT
:
8689 type
= dynamic_template_type (type0
);
8691 return template_to_static_fixed_type (type
);
8693 return template_to_static_fixed_type (type0
);
8694 case TYPE_CODE_UNION
:
8695 type
= ada_find_parallel_type (type0
, "___XVU");
8697 return template_to_static_fixed_type (type
);
8699 return template_to_static_fixed_type (type0
);
8703 /* A static approximation of TYPE with all type wrappers removed. */
8705 static struct type
*
8706 static_unwrap_type (struct type
*type
)
8708 if (ada_is_aligner_type (type
))
8710 struct type
*type1
= ada_check_typedef (type
)->field (0).type ();
8711 if (ada_type_name (type1
) == NULL
)
8712 type1
->set_name (ada_type_name (type
));
8714 return static_unwrap_type (type1
);
8718 struct type
*raw_real_type
= ada_get_base_type (type
);
8720 if (raw_real_type
== type
)
8723 return to_static_fixed_type (raw_real_type
);
8727 /* In some cases, incomplete and private types require
8728 cross-references that are not resolved as records (for example,
8730 type FooP is access Foo;
8732 type Foo is array ...;
8733 ). In these cases, since there is no mechanism for producing
8734 cross-references to such types, we instead substitute for FooP a
8735 stub enumeration type that is nowhere resolved, and whose tag is
8736 the name of the actual type. Call these types "non-record stubs". */
8738 /* A type equivalent to TYPE that is not a non-record stub, if one
8739 exists, otherwise TYPE. */
8742 ada_check_typedef (struct type
*type
)
8747 /* If our type is an access to an unconstrained array, which is encoded
8748 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
8749 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8750 what allows us to distinguish between fat pointers that represent
8751 array types, and fat pointers that represent array access types
8752 (in both cases, the compiler implements them as fat pointers). */
8753 if (ada_is_access_to_unconstrained_array (type
))
8756 type
= check_typedef (type
);
8757 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
8758 || !type
->is_stub ()
8759 || type
->name () == NULL
)
8763 const char *name
= type
->name ();
8764 struct type
*type1
= ada_find_any_type (name
);
8769 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8770 stubs pointing to arrays, as we don't create symbols for array
8771 types, only for the typedef-to-array types). If that's the case,
8772 strip the typedef layer. */
8773 if (type1
->code () == TYPE_CODE_TYPEDEF
)
8774 type1
= ada_check_typedef (type1
);
8780 /* A value representing the data at VALADDR/ADDRESS as described by
8781 type TYPE0, but with a standard (static-sized) type that correctly
8782 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8783 type, then return VAL0 [this feature is simply to avoid redundant
8784 creation of struct values]. */
8786 static struct value
*
8787 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8790 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8792 if (type
== type0
&& val0
!= NULL
)
8795 if (VALUE_LVAL (val0
) != lval_memory
)
8797 /* Our value does not live in memory; it could be a convenience
8798 variable, for instance. Create a not_lval value using val0's
8800 return value_from_contents (type
, value_contents (val0
));
8803 return value_from_contents_and_address (type
, 0, address
);
8806 /* A value representing VAL, but with a standard (static-sized) type
8807 that correctly describes it. Does not necessarily create a new
8811 ada_to_fixed_value (struct value
*val
)
8813 val
= unwrap_value (val
);
8814 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
8821 /* Table mapping attribute numbers to names.
8822 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8824 static const char * const attribute_names
[] = {
8842 ada_attribute_name (enum exp_opcode n
)
8844 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8845 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8847 return attribute_names
[0];
8850 /* Evaluate the 'POS attribute applied to ARG. */
8853 pos_atr (struct value
*arg
)
8855 struct value
*val
= coerce_ref (arg
);
8856 struct type
*type
= value_type (val
);
8858 if (!discrete_type_p (type
))
8859 error (_("'POS only defined on discrete types"));
8861 gdb::optional
<LONGEST
> result
= discrete_position (type
, value_as_long (val
));
8862 if (!result
.has_value ())
8863 error (_("enumeration value is invalid: can't find 'POS"));
8868 static struct value
*
8869 value_pos_atr (struct type
*type
, struct value
*arg
)
8871 return value_from_longest (type
, pos_atr (arg
));
8874 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8876 static struct value
*
8877 val_atr (struct type
*type
, LONGEST val
)
8879 gdb_assert (discrete_type_p (type
));
8880 if (type
->code () == TYPE_CODE_RANGE
)
8881 type
= TYPE_TARGET_TYPE (type
);
8882 if (type
->code () == TYPE_CODE_ENUM
)
8884 if (val
< 0 || val
>= type
->num_fields ())
8885 error (_("argument to 'VAL out of range"));
8886 val
= TYPE_FIELD_ENUMVAL (type
, val
);
8888 return value_from_longest (type
, val
);
8891 static struct value
*
8892 ada_val_atr (enum noside noside
, struct type
*type
, struct value
*arg
)
8894 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8895 return value_zero (type
, not_lval
);
8897 if (!discrete_type_p (type
))
8898 error (_("'VAL only defined on discrete types"));
8899 if (!integer_type_p (value_type (arg
)))
8900 error (_("'VAL requires integral argument"));
8902 return val_atr (type
, value_as_long (arg
));
8908 /* True if TYPE appears to be an Ada character type.
8909 [At the moment, this is true only for Character and Wide_Character;
8910 It is a heuristic test that could stand improvement]. */
8913 ada_is_character_type (struct type
*type
)
8917 /* If the type code says it's a character, then assume it really is,
8918 and don't check any further. */
8919 if (type
->code () == TYPE_CODE_CHAR
)
8922 /* Otherwise, assume it's a character type iff it is a discrete type
8923 with a known character type name. */
8924 name
= ada_type_name (type
);
8925 return (name
!= NULL
8926 && (type
->code () == TYPE_CODE_INT
8927 || type
->code () == TYPE_CODE_RANGE
)
8928 && (strcmp (name
, "character") == 0
8929 || strcmp (name
, "wide_character") == 0
8930 || strcmp (name
, "wide_wide_character") == 0
8931 || strcmp (name
, "unsigned char") == 0));
8934 /* True if TYPE appears to be an Ada string type. */
8937 ada_is_string_type (struct type
*type
)
8939 type
= ada_check_typedef (type
);
8941 && type
->code () != TYPE_CODE_PTR
8942 && (ada_is_simple_array_type (type
)
8943 || ada_is_array_descriptor_type (type
))
8944 && ada_array_arity (type
) == 1)
8946 struct type
*elttype
= ada_array_element_type (type
, 1);
8948 return ada_is_character_type (elttype
);
8954 /* The compiler sometimes provides a parallel XVS type for a given
8955 PAD type. Normally, it is safe to follow the PAD type directly,
8956 but older versions of the compiler have a bug that causes the offset
8957 of its "F" field to be wrong. Following that field in that case
8958 would lead to incorrect results, but this can be worked around
8959 by ignoring the PAD type and using the associated XVS type instead.
8961 Set to True if the debugger should trust the contents of PAD types.
8962 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8963 static bool trust_pad_over_xvs
= true;
8965 /* True if TYPE is a struct type introduced by the compiler to force the
8966 alignment of a value. Such types have a single field with a
8967 distinctive name. */
8970 ada_is_aligner_type (struct type
*type
)
8972 type
= ada_check_typedef (type
);
8974 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8977 return (type
->code () == TYPE_CODE_STRUCT
8978 && type
->num_fields () == 1
8979 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8982 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8983 the parallel type. */
8986 ada_get_base_type (struct type
*raw_type
)
8988 struct type
*real_type_namer
;
8989 struct type
*raw_real_type
;
8991 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
8994 if (ada_is_aligner_type (raw_type
))
8995 /* The encoding specifies that we should always use the aligner type.
8996 So, even if this aligner type has an associated XVS type, we should
8999 According to the compiler gurus, an XVS type parallel to an aligner
9000 type may exist because of a stabs limitation. In stabs, aligner
9001 types are empty because the field has a variable-sized type, and
9002 thus cannot actually be used as an aligner type. As a result,
9003 we need the associated parallel XVS type to decode the type.
9004 Since the policy in the compiler is to not change the internal
9005 representation based on the debugging info format, we sometimes
9006 end up having a redundant XVS type parallel to the aligner type. */
9009 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9010 if (real_type_namer
== NULL
9011 || real_type_namer
->code () != TYPE_CODE_STRUCT
9012 || real_type_namer
->num_fields () != 1)
9015 if (real_type_namer
->field (0).type ()->code () != TYPE_CODE_REF
)
9017 /* This is an older encoding form where the base type needs to be
9018 looked up by name. We prefer the newer encoding because it is
9020 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9021 if (raw_real_type
== NULL
)
9024 return raw_real_type
;
9027 /* The field in our XVS type is a reference to the base type. */
9028 return TYPE_TARGET_TYPE (real_type_namer
->field (0).type ());
9031 /* The type of value designated by TYPE, with all aligners removed. */
9034 ada_aligned_type (struct type
*type
)
9036 if (ada_is_aligner_type (type
))
9037 return ada_aligned_type (type
->field (0).type ());
9039 return ada_get_base_type (type
);
9043 /* The address of the aligned value in an object at address VALADDR
9044 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9047 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9049 if (ada_is_aligner_type (type
))
9050 return ada_aligned_value_addr (type
->field (0).type (),
9052 TYPE_FIELD_BITPOS (type
,
9053 0) / TARGET_CHAR_BIT
);
9060 /* The printed representation of an enumeration literal with encoded
9061 name NAME. The value is good to the next call of ada_enum_name. */
9063 ada_enum_name (const char *name
)
9065 static std::string storage
;
9068 /* First, unqualify the enumeration name:
9069 1. Search for the last '.' character. If we find one, then skip
9070 all the preceding characters, the unqualified name starts
9071 right after that dot.
9072 2. Otherwise, we may be debugging on a target where the compiler
9073 translates dots into "__". Search forward for double underscores,
9074 but stop searching when we hit an overloading suffix, which is
9075 of the form "__" followed by digits. */
9077 tmp
= strrchr (name
, '.');
9082 while ((tmp
= strstr (name
, "__")) != NULL
)
9084 if (isdigit (tmp
[2]))
9095 if (name
[1] == 'U' || name
[1] == 'W')
9097 if (sscanf (name
+ 2, "%x", &v
) != 1)
9100 else if (((name
[1] >= '0' && name
[1] <= '9')
9101 || (name
[1] >= 'a' && name
[1] <= 'z'))
9104 storage
= string_printf ("'%c'", name
[1]);
9105 return storage
.c_str ();
9110 if (isascii (v
) && isprint (v
))
9111 storage
= string_printf ("'%c'", v
);
9112 else if (name
[1] == 'U')
9113 storage
= string_printf ("[\"%02x\"]", v
);
9115 storage
= string_printf ("[\"%04x\"]", v
);
9117 return storage
.c_str ();
9121 tmp
= strstr (name
, "__");
9123 tmp
= strstr (name
, "$");
9126 storage
= std::string (name
, tmp
- name
);
9127 return storage
.c_str ();
9134 /* Evaluate the subexpression of EXP starting at *POS as for
9135 evaluate_type, updating *POS to point just past the evaluated
9138 static struct value
*
9139 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9141 return evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9144 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9147 static struct value
*
9148 unwrap_value (struct value
*val
)
9150 struct type
*type
= ada_check_typedef (value_type (val
));
9152 if (ada_is_aligner_type (type
))
9154 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9155 struct type
*val_type
= ada_check_typedef (value_type (v
));
9157 if (ada_type_name (val_type
) == NULL
)
9158 val_type
->set_name (ada_type_name (type
));
9160 return unwrap_value (v
);
9164 struct type
*raw_real_type
=
9165 ada_check_typedef (ada_get_base_type (type
));
9167 /* If there is no parallel XVS or XVE type, then the value is
9168 already unwrapped. Return it without further modification. */
9169 if ((type
== raw_real_type
)
9170 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9174 coerce_unspec_val_to_type
9175 (val
, ada_to_fixed_type (raw_real_type
, 0,
9176 value_address (val
),
9181 /* Given two array types T1 and T2, return nonzero iff both arrays
9182 contain the same number of elements. */
9185 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9187 LONGEST lo1
, hi1
, lo2
, hi2
;
9189 /* Get the array bounds in order to verify that the size of
9190 the two arrays match. */
9191 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9192 || !get_array_bounds (t2
, &lo2
, &hi2
))
9193 error (_("unable to determine array bounds"));
9195 /* To make things easier for size comparison, normalize a bit
9196 the case of empty arrays by making sure that the difference
9197 between upper bound and lower bound is always -1. */
9203 return (hi1
- lo1
== hi2
- lo2
);
9206 /* Assuming that VAL is an array of integrals, and TYPE represents
9207 an array with the same number of elements, but with wider integral
9208 elements, return an array "casted" to TYPE. In practice, this
9209 means that the returned array is built by casting each element
9210 of the original array into TYPE's (wider) element type. */
9212 static struct value
*
9213 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9215 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9220 /* Verify that both val and type are arrays of scalars, and
9221 that the size of val's elements is smaller than the size
9222 of type's element. */
9223 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9224 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9225 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9226 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9227 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9228 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9230 if (!get_array_bounds (type
, &lo
, &hi
))
9231 error (_("unable to determine array bounds"));
9233 res
= allocate_value (type
);
9235 /* Promote each array element. */
9236 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9238 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9240 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9241 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9247 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9248 return the converted value. */
9250 static struct value
*
9251 coerce_for_assign (struct type
*type
, struct value
*val
)
9253 struct type
*type2
= value_type (val
);
9258 type2
= ada_check_typedef (type2
);
9259 type
= ada_check_typedef (type
);
9261 if (type2
->code () == TYPE_CODE_PTR
9262 && type
->code () == TYPE_CODE_ARRAY
)
9264 val
= ada_value_ind (val
);
9265 type2
= value_type (val
);
9268 if (type2
->code () == TYPE_CODE_ARRAY
9269 && type
->code () == TYPE_CODE_ARRAY
)
9271 if (!ada_same_array_size_p (type
, type2
))
9272 error (_("cannot assign arrays of different length"));
9274 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9275 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9276 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9277 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9279 /* Allow implicit promotion of the array elements to
9281 return ada_promote_array_of_integrals (type
, val
);
9284 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9285 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9286 error (_("Incompatible types in assignment"));
9287 deprecated_set_value_type (val
, type
);
9292 static struct value
*
9293 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9296 struct type
*type1
, *type2
;
9299 arg1
= coerce_ref (arg1
);
9300 arg2
= coerce_ref (arg2
);
9301 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9302 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9304 if (type1
->code () != TYPE_CODE_INT
9305 || type2
->code () != TYPE_CODE_INT
)
9306 return value_binop (arg1
, arg2
, op
);
9315 return value_binop (arg1
, arg2
, op
);
9318 v2
= value_as_long (arg2
);
9320 error (_("second operand of %s must not be zero."), op_string (op
));
9322 if (type1
->is_unsigned () || op
== BINOP_MOD
)
9323 return value_binop (arg1
, arg2
, op
);
9325 v1
= value_as_long (arg1
);
9330 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9331 v
+= v
> 0 ? -1 : 1;
9339 /* Should not reach this point. */
9343 val
= allocate_value (type1
);
9344 store_unsigned_integer (value_contents_raw (val
),
9345 TYPE_LENGTH (value_type (val
)),
9346 type_byte_order (type1
), v
);
9351 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9353 if (ada_is_direct_array_type (value_type (arg1
))
9354 || ada_is_direct_array_type (value_type (arg2
)))
9356 struct type
*arg1_type
, *arg2_type
;
9358 /* Automatically dereference any array reference before
9359 we attempt to perform the comparison. */
9360 arg1
= ada_coerce_ref (arg1
);
9361 arg2
= ada_coerce_ref (arg2
);
9363 arg1
= ada_coerce_to_simple_array (arg1
);
9364 arg2
= ada_coerce_to_simple_array (arg2
);
9366 arg1_type
= ada_check_typedef (value_type (arg1
));
9367 arg2_type
= ada_check_typedef (value_type (arg2
));
9369 if (arg1_type
->code () != TYPE_CODE_ARRAY
9370 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9371 error (_("Attempt to compare array with non-array"));
9372 /* FIXME: The following works only for types whose
9373 representations use all bits (no padding or undefined bits)
9374 and do not have user-defined equality. */
9375 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9376 && memcmp (value_contents (arg1
), value_contents (arg2
),
9377 TYPE_LENGTH (arg1_type
)) == 0);
9379 return value_equal (arg1
, arg2
);
9382 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9383 component of LHS (a simple array or a record), updating *POS past
9384 the expression, assuming that LHS is contained in CONTAINER. Does
9385 not modify the inferior's memory, nor does it modify LHS (unless
9386 LHS == CONTAINER). */
9389 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9390 struct expression
*exp
, int *pos
)
9392 struct value
*mark
= value_mark ();
9394 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9396 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9398 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9399 struct value
*index_val
= value_from_longest (index_type
, index
);
9401 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9405 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9406 elt
= ada_to_fixed_value (elt
);
9409 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9410 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9412 value_assign_to_component (container
, elt
,
9413 ada_evaluate_subexp (NULL
, exp
, pos
,
9416 value_free_to_mark (mark
);
9419 /* Assuming that LHS represents an lvalue having a record or array
9420 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9421 of that aggregate's value to LHS, advancing *POS past the
9422 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9423 lvalue containing LHS (possibly LHS itself). Does not modify
9424 the inferior's memory, nor does it modify the contents of
9425 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9427 static struct value
*
9428 assign_aggregate (struct value
*container
,
9429 struct value
*lhs
, struct expression
*exp
,
9430 int *pos
, enum noside noside
)
9432 struct type
*lhs_type
;
9433 int n
= exp
->elts
[*pos
+1].longconst
;
9434 LONGEST low_index
, high_index
;
9438 if (noside
!= EVAL_NORMAL
)
9440 for (i
= 0; i
< n
; i
+= 1)
9441 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9445 container
= ada_coerce_ref (container
);
9446 if (ada_is_direct_array_type (value_type (container
)))
9447 container
= ada_coerce_to_simple_array (container
);
9448 lhs
= ada_coerce_ref (lhs
);
9449 if (!deprecated_value_modifiable (lhs
))
9450 error (_("Left operand of assignment is not a modifiable lvalue."));
9452 lhs_type
= check_typedef (value_type (lhs
));
9453 if (ada_is_direct_array_type (lhs_type
))
9455 lhs
= ada_coerce_to_simple_array (lhs
);
9456 lhs_type
= check_typedef (value_type (lhs
));
9457 low_index
= lhs_type
->bounds ()->low
.const_val ();
9458 high_index
= lhs_type
->bounds ()->high
.const_val ();
9460 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9463 high_index
= num_visible_fields (lhs_type
) - 1;
9466 error (_("Left-hand side must be array or record."));
9468 std::vector
<LONGEST
> indices (4);
9469 indices
[0] = indices
[1] = low_index
- 1;
9470 indices
[2] = indices
[3] = high_index
+ 1;
9472 for (i
= 0; i
< n
; i
+= 1)
9474 switch (exp
->elts
[*pos
].opcode
)
9477 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9478 low_index
, high_index
);
9481 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9482 low_index
, high_index
);
9486 error (_("Misplaced 'others' clause"));
9487 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9488 low_index
, high_index
);
9491 error (_("Internal error: bad aggregate clause"));
9498 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9499 construct at *POS, updating *POS past the construct, given that
9500 the positions are relative to lower bound LOW, where HIGH is the
9501 upper bound. Record the position in INDICES. CONTAINER is as for
9502 assign_aggregate. */
9504 aggregate_assign_positional (struct value
*container
,
9505 struct value
*lhs
, struct expression
*exp
,
9506 int *pos
, std::vector
<LONGEST
> &indices
,
9507 LONGEST low
, LONGEST high
)
9509 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9511 if (ind
- 1 == high
)
9512 warning (_("Extra components in aggregate ignored."));
9515 add_component_interval (ind
, ind
, indices
);
9517 assign_component (container
, lhs
, ind
, exp
, pos
);
9520 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9523 /* Assign into the components of LHS indexed by the OP_CHOICES
9524 construct at *POS, updating *POS past the construct, given that
9525 the allowable indices are LOW..HIGH. Record the indices assigned
9526 to in INDICES. CONTAINER is as for assign_aggregate. */
9528 aggregate_assign_from_choices (struct value
*container
,
9529 struct value
*lhs
, struct expression
*exp
,
9530 int *pos
, std::vector
<LONGEST
> &indices
,
9531 LONGEST low
, LONGEST high
)
9534 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9535 int choice_pos
, expr_pc
;
9536 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9538 choice_pos
= *pos
+= 3;
9540 for (j
= 0; j
< n_choices
; j
+= 1)
9541 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9543 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9545 for (j
= 0; j
< n_choices
; j
+= 1)
9547 LONGEST lower
, upper
;
9548 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9550 if (op
== OP_DISCRETE_RANGE
)
9553 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9555 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9560 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9572 name
= &exp
->elts
[choice_pos
+ 2].string
;
9575 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9578 error (_("Invalid record component association."));
9580 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9582 if (! find_struct_field (name
, value_type (lhs
), 0,
9583 NULL
, NULL
, NULL
, NULL
, &ind
))
9584 error (_("Unknown component name: %s."), name
);
9585 lower
= upper
= ind
;
9588 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9589 error (_("Index in component association out of bounds."));
9591 add_component_interval (lower
, upper
, indices
);
9592 while (lower
<= upper
)
9597 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9603 /* Assign the value of the expression in the OP_OTHERS construct in
9604 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9605 have not been previously assigned. The index intervals already assigned
9606 are in INDICES. Updates *POS to after the OP_OTHERS clause.
9607 CONTAINER is as for assign_aggregate. */
9609 aggregate_assign_others (struct value
*container
,
9610 struct value
*lhs
, struct expression
*exp
,
9611 int *pos
, std::vector
<LONGEST
> &indices
,
9612 LONGEST low
, LONGEST high
)
9615 int expr_pc
= *pos
+ 1;
9617 int num_indices
= indices
.size ();
9618 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9622 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9627 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9630 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9633 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9634 [ INDICES[0] .. INDICES[1] ],... The resulting intervals do not
9637 add_component_interval (LONGEST low
, LONGEST high
,
9638 std::vector
<LONGEST
> &indices
)
9642 int size
= indices
.size ();
9643 for (i
= 0; i
< size
; i
+= 2) {
9644 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9648 for (kh
= i
+ 2; kh
< size
; kh
+= 2)
9649 if (high
< indices
[kh
])
9651 if (low
< indices
[i
])
9653 indices
[i
+ 1] = indices
[kh
- 1];
9654 if (high
> indices
[i
+ 1])
9655 indices
[i
+ 1] = high
;
9656 memcpy (indices
.data () + i
+ 2, indices
.data () + kh
, size
- kh
);
9657 indices
.resize (kh
- i
- 2);
9660 else if (high
< indices
[i
])
9664 indices
.resize (indices
.size () + 2);
9665 for (j
= indices
.size () - 1; j
>= i
+ 2; j
-= 1)
9666 indices
[j
] = indices
[j
- 2];
9668 indices
[i
+ 1] = high
;
9671 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9674 static struct value
*
9675 ada_value_cast (struct type
*type
, struct value
*arg2
)
9677 if (type
== ada_check_typedef (value_type (arg2
)))
9680 return value_cast (type
, arg2
);
9683 /* Evaluating Ada expressions, and printing their result.
9684 ------------------------------------------------------
9689 We usually evaluate an Ada expression in order to print its value.
9690 We also evaluate an expression in order to print its type, which
9691 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9692 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9693 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9694 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9697 Evaluating expressions is a little more complicated for Ada entities
9698 than it is for entities in languages such as C. The main reason for
9699 this is that Ada provides types whose definition might be dynamic.
9700 One example of such types is variant records. Or another example
9701 would be an array whose bounds can only be known at run time.
9703 The following description is a general guide as to what should be
9704 done (and what should NOT be done) in order to evaluate an expression
9705 involving such types, and when. This does not cover how the semantic
9706 information is encoded by GNAT as this is covered separatly. For the
9707 document used as the reference for the GNAT encoding, see exp_dbug.ads
9708 in the GNAT sources.
9710 Ideally, we should embed each part of this description next to its
9711 associated code. Unfortunately, the amount of code is so vast right
9712 now that it's hard to see whether the code handling a particular
9713 situation might be duplicated or not. One day, when the code is
9714 cleaned up, this guide might become redundant with the comments
9715 inserted in the code, and we might want to remove it.
9717 2. ``Fixing'' an Entity, the Simple Case:
9718 -----------------------------------------
9720 When evaluating Ada expressions, the tricky issue is that they may
9721 reference entities whose type contents and size are not statically
9722 known. Consider for instance a variant record:
9724 type Rec (Empty : Boolean := True) is record
9727 when False => Value : Integer;
9730 Yes : Rec := (Empty => False, Value => 1);
9731 No : Rec := (empty => True);
9733 The size and contents of that record depends on the value of the
9734 descriminant (Rec.Empty). At this point, neither the debugging
9735 information nor the associated type structure in GDB are able to
9736 express such dynamic types. So what the debugger does is to create
9737 "fixed" versions of the type that applies to the specific object.
9738 We also informally refer to this operation as "fixing" an object,
9739 which means creating its associated fixed type.
9741 Example: when printing the value of variable "Yes" above, its fixed
9742 type would look like this:
9749 On the other hand, if we printed the value of "No", its fixed type
9756 Things become a little more complicated when trying to fix an entity
9757 with a dynamic type that directly contains another dynamic type,
9758 such as an array of variant records, for instance. There are
9759 two possible cases: Arrays, and records.
9761 3. ``Fixing'' Arrays:
9762 ---------------------
9764 The type structure in GDB describes an array in terms of its bounds,
9765 and the type of its elements. By design, all elements in the array
9766 have the same type and we cannot represent an array of variant elements
9767 using the current type structure in GDB. When fixing an array,
9768 we cannot fix the array element, as we would potentially need one
9769 fixed type per element of the array. As a result, the best we can do
9770 when fixing an array is to produce an array whose bounds and size
9771 are correct (allowing us to read it from memory), but without having
9772 touched its element type. Fixing each element will be done later,
9773 when (if) necessary.
9775 Arrays are a little simpler to handle than records, because the same
9776 amount of memory is allocated for each element of the array, even if
9777 the amount of space actually used by each element differs from element
9778 to element. Consider for instance the following array of type Rec:
9780 type Rec_Array is array (1 .. 2) of Rec;
9782 The actual amount of memory occupied by each element might be different
9783 from element to element, depending on the value of their discriminant.
9784 But the amount of space reserved for each element in the array remains
9785 fixed regardless. So we simply need to compute that size using
9786 the debugging information available, from which we can then determine
9787 the array size (we multiply the number of elements of the array by
9788 the size of each element).
9790 The simplest case is when we have an array of a constrained element
9791 type. For instance, consider the following type declarations:
9793 type Bounded_String (Max_Size : Integer) is
9795 Buffer : String (1 .. Max_Size);
9797 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9799 In this case, the compiler describes the array as an array of
9800 variable-size elements (identified by its XVS suffix) for which
9801 the size can be read in the parallel XVZ variable.
9803 In the case of an array of an unconstrained element type, the compiler
9804 wraps the array element inside a private PAD type. This type should not
9805 be shown to the user, and must be "unwrap"'ed before printing. Note
9806 that we also use the adjective "aligner" in our code to designate
9807 these wrapper types.
9809 In some cases, the size allocated for each element is statically
9810 known. In that case, the PAD type already has the correct size,
9811 and the array element should remain unfixed.
9813 But there are cases when this size is not statically known.
9814 For instance, assuming that "Five" is an integer variable:
9816 type Dynamic is array (1 .. Five) of Integer;
9817 type Wrapper (Has_Length : Boolean := False) is record
9820 when True => Length : Integer;
9824 type Wrapper_Array is array (1 .. 2) of Wrapper;
9826 Hello : Wrapper_Array := (others => (Has_Length => True,
9827 Data => (others => 17),
9831 The debugging info would describe variable Hello as being an
9832 array of a PAD type. The size of that PAD type is not statically
9833 known, but can be determined using a parallel XVZ variable.
9834 In that case, a copy of the PAD type with the correct size should
9835 be used for the fixed array.
9837 3. ``Fixing'' record type objects:
9838 ----------------------------------
9840 Things are slightly different from arrays in the case of dynamic
9841 record types. In this case, in order to compute the associated
9842 fixed type, we need to determine the size and offset of each of
9843 its components. This, in turn, requires us to compute the fixed
9844 type of each of these components.
9846 Consider for instance the example:
9848 type Bounded_String (Max_Size : Natural) is record
9849 Str : String (1 .. Max_Size);
9852 My_String : Bounded_String (Max_Size => 10);
9854 In that case, the position of field "Length" depends on the size
9855 of field Str, which itself depends on the value of the Max_Size
9856 discriminant. In order to fix the type of variable My_String,
9857 we need to fix the type of field Str. Therefore, fixing a variant
9858 record requires us to fix each of its components.
9860 However, if a component does not have a dynamic size, the component
9861 should not be fixed. In particular, fields that use a PAD type
9862 should not fixed. Here is an example where this might happen
9863 (assuming type Rec above):
9865 type Container (Big : Boolean) is record
9869 when True => Another : Integer;
9873 My_Container : Container := (Big => False,
9874 First => (Empty => True),
9877 In that example, the compiler creates a PAD type for component First,
9878 whose size is constant, and then positions the component After just
9879 right after it. The offset of component After is therefore constant
9882 The debugger computes the position of each field based on an algorithm
9883 that uses, among other things, the actual position and size of the field
9884 preceding it. Let's now imagine that the user is trying to print
9885 the value of My_Container. If the type fixing was recursive, we would
9886 end up computing the offset of field After based on the size of the
9887 fixed version of field First. And since in our example First has
9888 only one actual field, the size of the fixed type is actually smaller
9889 than the amount of space allocated to that field, and thus we would
9890 compute the wrong offset of field After.
9892 To make things more complicated, we need to watch out for dynamic
9893 components of variant records (identified by the ___XVL suffix in
9894 the component name). Even if the target type is a PAD type, the size
9895 of that type might not be statically known. So the PAD type needs
9896 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9897 we might end up with the wrong size for our component. This can be
9898 observed with the following type declarations:
9900 type Octal is new Integer range 0 .. 7;
9901 type Octal_Array is array (Positive range <>) of Octal;
9902 pragma Pack (Octal_Array);
9904 type Octal_Buffer (Size : Positive) is record
9905 Buffer : Octal_Array (1 .. Size);
9909 In that case, Buffer is a PAD type whose size is unset and needs
9910 to be computed by fixing the unwrapped type.
9912 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9913 ----------------------------------------------------------
9915 Lastly, when should the sub-elements of an entity that remained unfixed
9916 thus far, be actually fixed?
9918 The answer is: Only when referencing that element. For instance
9919 when selecting one component of a record, this specific component
9920 should be fixed at that point in time. Or when printing the value
9921 of a record, each component should be fixed before its value gets
9922 printed. Similarly for arrays, the element of the array should be
9923 fixed when printing each element of the array, or when extracting
9924 one element out of that array. On the other hand, fixing should
9925 not be performed on the elements when taking a slice of an array!
9927 Note that one of the side effects of miscomputing the offset and
9928 size of each field is that we end up also miscomputing the size
9929 of the containing type. This can have adverse results when computing
9930 the value of an entity. GDB fetches the value of an entity based
9931 on the size of its type, and thus a wrong size causes GDB to fetch
9932 the wrong amount of memory. In the case where the computed size is
9933 too small, GDB fetches too little data to print the value of our
9934 entity. Results in this case are unpredictable, as we usually read
9935 past the buffer containing the data =:-o. */
9937 /* Evaluate a subexpression of EXP, at index *POS, and return a value
9938 for that subexpression cast to TO_TYPE. Advance *POS over the
9942 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
9943 enum noside noside
, struct type
*to_type
)
9947 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
9948 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
9953 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
9955 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9956 return value_zero (to_type
, not_lval
);
9958 val
= evaluate_var_msym_value (noside
,
9959 exp
->elts
[pc
+ 1].objfile
,
9960 exp
->elts
[pc
+ 2].msymbol
);
9963 val
= evaluate_var_value (noside
,
9964 exp
->elts
[pc
+ 1].block
,
9965 exp
->elts
[pc
+ 2].symbol
);
9967 if (noside
== EVAL_SKIP
)
9968 return eval_skip_value (exp
);
9970 val
= ada_value_cast (to_type
, val
);
9972 /* Follow the Ada language semantics that do not allow taking
9973 an address of the result of a cast (view conversion in Ada). */
9974 if (VALUE_LVAL (val
) == lval_memory
)
9976 if (value_lazy (val
))
9977 value_fetch_lazy (val
);
9978 VALUE_LVAL (val
) = not_lval
;
9983 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
9984 if (noside
== EVAL_SKIP
)
9985 return eval_skip_value (exp
);
9986 return ada_value_cast (to_type
, val
);
9989 /* A helper function for TERNOP_IN_RANGE. */
9992 eval_ternop_in_range (struct type
*expect_type
, struct expression
*exp
,
9994 value
*arg1
, value
*arg2
, value
*arg3
)
9996 if (noside
== EVAL_SKIP
)
9997 return eval_skip_value (exp
);
9999 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10000 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10001 struct type
*type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10003 value_from_longest (type
,
10004 (value_less (arg1
, arg3
)
10005 || value_equal (arg1
, arg3
))
10006 && (value_less (arg2
, arg1
)
10007 || value_equal (arg2
, arg1
)));
10010 /* A helper function for UNOP_NEG. */
10013 ada_unop_neg (struct type
*expect_type
,
10014 struct expression
*exp
,
10015 enum noside noside
, enum exp_opcode op
,
10016 struct value
*arg1
)
10018 if (noside
== EVAL_SKIP
)
10019 return eval_skip_value (exp
);
10020 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10021 return value_neg (arg1
);
10024 /* A helper function for UNOP_IN_RANGE. */
10027 ada_unop_in_range (struct type
*expect_type
,
10028 struct expression
*exp
,
10029 enum noside noside
, enum exp_opcode op
,
10030 struct value
*arg1
, struct type
*type
)
10032 if (noside
== EVAL_SKIP
)
10033 return eval_skip_value (exp
);
10035 struct value
*arg2
, *arg3
;
10036 switch (type
->code ())
10039 lim_warning (_("Membership test incompletely implemented; "
10040 "always returns true"));
10041 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10042 return value_from_longest (type
, (LONGEST
) 1);
10044 case TYPE_CODE_RANGE
:
10045 arg2
= value_from_longest (type
,
10046 type
->bounds ()->low
.const_val ());
10047 arg3
= value_from_longest (type
,
10048 type
->bounds ()->high
.const_val ());
10049 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10050 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10051 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10053 value_from_longest (type
,
10054 (value_less (arg1
, arg3
)
10055 || value_equal (arg1
, arg3
))
10056 && (value_less (arg2
, arg1
)
10057 || value_equal (arg2
, arg1
)));
10061 /* A helper function for OP_ATR_TAG. */
10064 ada_atr_tag (struct type
*expect_type
,
10065 struct expression
*exp
,
10066 enum noside noside
, enum exp_opcode op
,
10067 struct value
*arg1
)
10069 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10070 return value_zero (ada_tag_type (arg1
), not_lval
);
10072 return ada_value_tag (arg1
);
10075 /* A helper function for OP_ATR_SIZE. */
10078 ada_atr_size (struct type
*expect_type
,
10079 struct expression
*exp
,
10080 enum noside noside
, enum exp_opcode op
,
10081 struct value
*arg1
)
10083 struct type
*type
= value_type (arg1
);
10085 /* If the argument is a reference, then dereference its type, since
10086 the user is really asking for the size of the actual object,
10087 not the size of the pointer. */
10088 if (type
->code () == TYPE_CODE_REF
)
10089 type
= TYPE_TARGET_TYPE (type
);
10091 if (noside
== EVAL_SKIP
)
10092 return eval_skip_value (exp
);
10093 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10094 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10096 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10097 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10100 /* A helper function for UNOP_ABS. */
10103 ada_abs (struct type
*expect_type
,
10104 struct expression
*exp
,
10105 enum noside noside
, enum exp_opcode op
,
10106 struct value
*arg1
)
10108 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10109 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10110 return value_neg (arg1
);
10115 /* A helper function for BINOP_MUL. */
10118 ada_mult_binop (struct type
*expect_type
,
10119 struct expression
*exp
,
10120 enum noside noside
, enum exp_opcode op
,
10121 struct value
*arg1
, struct value
*arg2
)
10123 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10125 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10126 return value_zero (value_type (arg1
), not_lval
);
10130 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10131 return ada_value_binop (arg1
, arg2
, op
);
10135 /* A helper function for BINOP_EQUAL and BINOP_NOTEQUAL. */
10138 ada_equal_binop (struct type
*expect_type
,
10139 struct expression
*exp
,
10140 enum noside noside
, enum exp_opcode op
,
10141 struct value
*arg1
, struct value
*arg2
)
10144 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10148 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10149 tem
= ada_value_equal (arg1
, arg2
);
10151 if (op
== BINOP_NOTEQUAL
)
10153 struct type
*type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10154 return value_from_longest (type
, (LONGEST
) tem
);
10157 /* A helper function for TERNOP_SLICE. */
10160 ada_ternop_slice (struct expression
*exp
,
10161 enum noside noside
,
10162 struct value
*array
, struct value
*low_bound_val
,
10163 struct value
*high_bound_val
)
10166 LONGEST high_bound
;
10168 low_bound_val
= coerce_ref (low_bound_val
);
10169 high_bound_val
= coerce_ref (high_bound_val
);
10170 low_bound
= value_as_long (low_bound_val
);
10171 high_bound
= value_as_long (high_bound_val
);
10173 /* If this is a reference to an aligner type, then remove all
10175 if (value_type (array
)->code () == TYPE_CODE_REF
10176 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10177 TYPE_TARGET_TYPE (value_type (array
)) =
10178 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10180 if (ada_is_any_packed_array_type (value_type (array
)))
10181 error (_("cannot slice a packed array"));
10183 /* If this is a reference to an array or an array lvalue,
10184 convert to a pointer. */
10185 if (value_type (array
)->code () == TYPE_CODE_REF
10186 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10187 && VALUE_LVAL (array
) == lval_memory
))
10188 array
= value_addr (array
);
10190 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10191 && ada_is_array_descriptor_type (ada_check_typedef
10192 (value_type (array
))))
10193 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10196 array
= ada_coerce_to_simple_array_ptr (array
);
10198 /* If we have more than one level of pointer indirection,
10199 dereference the value until we get only one level. */
10200 while (value_type (array
)->code () == TYPE_CODE_PTR
10201 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10203 array
= value_ind (array
);
10205 /* Make sure we really do have an array type before going further,
10206 to avoid a SEGV when trying to get the index type or the target
10207 type later down the road if the debug info generated by
10208 the compiler is incorrect or incomplete. */
10209 if (!ada_is_simple_array_type (value_type (array
)))
10210 error (_("cannot take slice of non-array"));
10212 if (ada_check_typedef (value_type (array
))->code ()
10215 struct type
*type0
= ada_check_typedef (value_type (array
));
10217 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10218 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10221 struct type
*arr_type0
=
10222 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10224 return ada_value_slice_from_ptr (array
, arr_type0
,
10225 longest_to_int (low_bound
),
10226 longest_to_int (high_bound
));
10229 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10231 else if (high_bound
< low_bound
)
10232 return empty_array (value_type (array
), low_bound
, high_bound
);
10234 return ada_value_slice (array
, longest_to_int (low_bound
),
10235 longest_to_int (high_bound
));
10238 /* A helper function for BINOP_IN_BOUNDS. */
10241 ada_binop_in_bounds (struct expression
*exp
, enum noside noside
,
10242 struct value
*arg1
, struct value
*arg2
, int n
)
10244 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10246 struct type
*type
= language_bool_type (exp
->language_defn
,
10248 return value_zero (type
, not_lval
);
10251 struct type
*type
= ada_index_type (value_type (arg2
), n
, "range");
10253 type
= value_type (arg1
);
10255 value
*arg3
= value_from_longest (type
, ada_array_bound (arg2
, n
, 1));
10256 arg2
= value_from_longest (type
, ada_array_bound (arg2
, n
, 0));
10258 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10259 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10260 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10261 return value_from_longest (type
,
10262 (value_less (arg1
, arg3
)
10263 || value_equal (arg1
, arg3
))
10264 && (value_less (arg2
, arg1
)
10265 || value_equal (arg2
, arg1
)));
10268 /* A helper function for some attribute operations. */
10271 ada_unop_atr (struct expression
*exp
, enum noside noside
, enum exp_opcode op
,
10272 struct value
*arg1
, struct type
*type_arg
, int tem
)
10274 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10276 if (type_arg
== NULL
)
10277 type_arg
= value_type (arg1
);
10279 if (ada_is_constrained_packed_array_type (type_arg
))
10280 type_arg
= decode_constrained_packed_array_type (type_arg
);
10282 if (!discrete_type_p (type_arg
))
10286 default: /* Should never happen. */
10287 error (_("unexpected attribute encountered"));
10290 type_arg
= ada_index_type (type_arg
, tem
,
10291 ada_attribute_name (op
));
10293 case OP_ATR_LENGTH
:
10294 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
10299 return value_zero (type_arg
, not_lval
);
10301 else if (type_arg
== NULL
)
10303 arg1
= ada_coerce_ref (arg1
);
10305 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10306 arg1
= ada_coerce_to_simple_array (arg1
);
10309 if (op
== OP_ATR_LENGTH
)
10310 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10313 type
= ada_index_type (value_type (arg1
), tem
,
10314 ada_attribute_name (op
));
10316 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10321 default: /* Should never happen. */
10322 error (_("unexpected attribute encountered"));
10324 return value_from_longest
10325 (type
, ada_array_bound (arg1
, tem
, 0));
10327 return value_from_longest
10328 (type
, ada_array_bound (arg1
, tem
, 1));
10329 case OP_ATR_LENGTH
:
10330 return value_from_longest
10331 (type
, ada_array_length (arg1
, tem
));
10334 else if (discrete_type_p (type_arg
))
10336 struct type
*range_type
;
10337 const char *name
= ada_type_name (type_arg
);
10340 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
10341 range_type
= to_fixed_range_type (type_arg
, NULL
);
10342 if (range_type
== NULL
)
10343 range_type
= type_arg
;
10347 error (_("unexpected attribute encountered"));
10349 return value_from_longest
10350 (range_type
, ada_discrete_type_low_bound (range_type
));
10352 return value_from_longest
10353 (range_type
, ada_discrete_type_high_bound (range_type
));
10354 case OP_ATR_LENGTH
:
10355 error (_("the 'length attribute applies only to array types"));
10358 else if (type_arg
->code () == TYPE_CODE_FLT
)
10359 error (_("unimplemented type attribute"));
10364 if (ada_is_constrained_packed_array_type (type_arg
))
10365 type_arg
= decode_constrained_packed_array_type (type_arg
);
10368 if (op
== OP_ATR_LENGTH
)
10369 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10372 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10374 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10380 error (_("unexpected attribute encountered"));
10382 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10383 return value_from_longest (type
, low
);
10385 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10386 return value_from_longest (type
, high
);
10387 case OP_ATR_LENGTH
:
10388 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10389 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10390 return value_from_longest (type
, high
- low
+ 1);
10395 /* A helper function for OP_ATR_MIN and OP_ATR_MAX. */
10397 static struct value
*
10398 ada_binop_minmax (struct type
*expect_type
,
10399 struct expression
*exp
,
10400 enum noside noside
, enum exp_opcode op
,
10401 struct value
*arg1
, struct value
*arg2
)
10403 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10404 return value_zero (value_type (arg1
), not_lval
);
10407 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10408 return value_binop (arg1
, arg2
,
10409 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10413 /* A helper function for BINOP_EXP. */
10415 static struct value
*
10416 ada_binop_exp (struct type
*expect_type
,
10417 struct expression
*exp
,
10418 enum noside noside
, enum exp_opcode op
,
10419 struct value
*arg1
, struct value
*arg2
)
10421 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10422 return value_zero (value_type (arg1
), not_lval
);
10425 /* For integer exponentiation operations,
10426 only promote the first argument. */
10427 if (is_integral_type (value_type (arg2
)))
10428 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10430 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10432 return value_binop (arg1
, arg2
, op
);
10440 ada_wrapped_operation::evaluate (struct type
*expect_type
,
10441 struct expression
*exp
,
10442 enum noside noside
)
10444 value
*result
= std::get
<0> (m_storage
)->evaluate (expect_type
, exp
, noside
);
10445 if (noside
== EVAL_NORMAL
)
10446 result
= unwrap_value (result
);
10448 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10449 then we need to perform the conversion manually, because
10450 evaluate_subexp_standard doesn't do it. This conversion is
10451 necessary in Ada because the different kinds of float/fixed
10452 types in Ada have different representations.
10454 Similarly, we need to perform the conversion from OP_LONG
10456 if ((opcode () == OP_FLOAT
|| opcode () == OP_LONG
) && expect_type
!= NULL
)
10457 result
= ada_value_cast (expect_type
, result
);
10463 ada_string_operation::evaluate (struct type
*expect_type
,
10464 struct expression
*exp
,
10465 enum noside noside
)
10467 value
*result
= string_operation::evaluate (expect_type
, exp
, noside
);
10468 /* The result type will have code OP_STRING, bashed there from
10469 OP_ARRAY. Bash it back. */
10470 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10471 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10476 ada_qual_operation::evaluate (struct type
*expect_type
,
10477 struct expression
*exp
,
10478 enum noside noside
)
10480 struct type
*type
= std::get
<1> (m_storage
);
10481 return std::get
<0> (m_storage
)->evaluate (type
, exp
, noside
);
10485 ada_ternop_range_operation::evaluate (struct type
*expect_type
,
10486 struct expression
*exp
,
10487 enum noside noside
)
10489 value
*arg0
= std::get
<0> (m_storage
)->evaluate (nullptr, exp
, noside
);
10490 value
*arg1
= std::get
<1> (m_storage
)->evaluate (nullptr, exp
, noside
);
10491 value
*arg2
= std::get
<2> (m_storage
)->evaluate (nullptr, exp
, noside
);
10492 return eval_ternop_in_range (expect_type
, exp
, noside
, arg0
, arg1
, arg2
);
10497 /* Implement the evaluate_exp routine in the exp_descriptor structure
10498 for the Ada language. */
10500 static struct value
*
10501 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10502 int *pos
, enum noside noside
)
10504 enum exp_opcode op
;
10508 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10511 struct value
**argvec
;
10515 op
= exp
->elts
[pc
].opcode
;
10521 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10523 if (noside
== EVAL_NORMAL
)
10524 arg1
= unwrap_value (arg1
);
10526 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10527 then we need to perform the conversion manually, because
10528 evaluate_subexp_standard doesn't do it. This conversion is
10529 necessary in Ada because the different kinds of float/fixed
10530 types in Ada have different representations.
10532 Similarly, we need to perform the conversion from OP_LONG
10534 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10535 arg1
= ada_value_cast (expect_type
, arg1
);
10541 struct value
*result
;
10544 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10545 /* The result type will have code OP_STRING, bashed there from
10546 OP_ARRAY. Bash it back. */
10547 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10548 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10554 type
= exp
->elts
[pc
+ 1].type
;
10555 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10559 type
= exp
->elts
[pc
+ 1].type
;
10560 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10563 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10564 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10566 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10567 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10569 return ada_value_assign (arg1
, arg1
);
10571 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10572 except if the lhs of our assignment is a convenience variable.
10573 In the case of assigning to a convenience variable, the lhs
10574 should be exactly the result of the evaluation of the rhs. */
10575 type
= value_type (arg1
);
10576 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10578 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10579 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10581 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10586 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10587 return ada_value_assign (arg1
, arg2
);
10590 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10591 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10592 if (noside
== EVAL_SKIP
)
10594 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10595 return (value_from_longest
10596 (value_type (arg1
),
10597 value_as_long (arg1
) + value_as_long (arg2
)));
10598 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10599 return (value_from_longest
10600 (value_type (arg2
),
10601 value_as_long (arg1
) + value_as_long (arg2
)));
10602 /* Preserve the original type for use by the range case below.
10603 We cannot cast the result to a reference type, so if ARG1 is
10604 a reference type, find its underlying type. */
10605 type
= value_type (arg1
);
10606 while (type
->code () == TYPE_CODE_REF
)
10607 type
= TYPE_TARGET_TYPE (type
);
10608 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10609 arg1
= value_binop (arg1
, arg2
, BINOP_ADD
);
10610 /* We need to special-case the result of adding to a range.
10611 This is done for the benefit of "ptype". gdb's Ada support
10612 historically used the LHS to set the result type here, so
10613 preserve this behavior. */
10614 if (type
->code () == TYPE_CODE_RANGE
)
10615 arg1
= value_cast (type
, arg1
);
10619 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10620 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10621 if (noside
== EVAL_SKIP
)
10623 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10624 return (value_from_longest
10625 (value_type (arg1
),
10626 value_as_long (arg1
) - value_as_long (arg2
)));
10627 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10628 return (value_from_longest
10629 (value_type (arg2
),
10630 value_as_long (arg1
) - value_as_long (arg2
)));
10631 /* Preserve the original type for use by the range case below.
10632 We cannot cast the result to a reference type, so if ARG1 is
10633 a reference type, find its underlying type. */
10634 type
= value_type (arg1
);
10635 while (type
->code () == TYPE_CODE_REF
)
10636 type
= TYPE_TARGET_TYPE (type
);
10637 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10638 arg1
= value_binop (arg1
, arg2
, BINOP_SUB
);
10639 /* We need to special-case the result of adding to a range.
10640 This is done for the benefit of "ptype". gdb's Ada support
10641 historically used the LHS to set the result type here, so
10642 preserve this behavior. */
10643 if (type
->code () == TYPE_CODE_RANGE
)
10644 arg1
= value_cast (type
, arg1
);
10651 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10652 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10653 if (noside
== EVAL_SKIP
)
10655 return ada_mult_binop (expect_type
, exp
, noside
, op
,
10659 case BINOP_NOTEQUAL
:
10660 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10661 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10662 if (noside
== EVAL_SKIP
)
10664 return ada_equal_binop (expect_type
, exp
, noside
, op
, arg1
, arg2
);
10667 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10668 return ada_unop_neg (expect_type
, exp
, noside
, op
, arg1
);
10670 case BINOP_LOGICAL_AND
:
10671 case BINOP_LOGICAL_OR
:
10672 case UNOP_LOGICAL_NOT
:
10677 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10678 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10679 return value_cast (type
, val
);
10682 case BINOP_BITWISE_AND
:
10683 case BINOP_BITWISE_IOR
:
10684 case BINOP_BITWISE_XOR
:
10688 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10690 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10692 return value_cast (value_type (arg1
), val
);
10698 if (noside
== EVAL_SKIP
)
10704 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10705 /* Only encountered when an unresolved symbol occurs in a
10706 context other than a function call, in which case, it is
10708 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10709 exp
->elts
[pc
+ 2].symbol
->print_name ());
10711 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10713 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10714 /* Check to see if this is a tagged type. We also need to handle
10715 the case where the type is a reference to a tagged type, but
10716 we have to be careful to exclude pointers to tagged types.
10717 The latter should be shown as usual (as a pointer), whereas
10718 a reference should mostly be transparent to the user. */
10719 if (ada_is_tagged_type (type
, 0)
10720 || (type
->code () == TYPE_CODE_REF
10721 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10723 /* Tagged types are a little special in the fact that the real
10724 type is dynamic and can only be determined by inspecting the
10725 object's tag. This means that we need to get the object's
10726 value first (EVAL_NORMAL) and then extract the actual object
10729 Note that we cannot skip the final step where we extract
10730 the object type from its tag, because the EVAL_NORMAL phase
10731 results in dynamic components being resolved into fixed ones.
10732 This can cause problems when trying to print the type
10733 description of tagged types whose parent has a dynamic size:
10734 We use the type name of the "_parent" component in order
10735 to print the name of the ancestor type in the type description.
10736 If that component had a dynamic size, the resolution into
10737 a fixed type would result in the loss of that type name,
10738 thus preventing us from printing the name of the ancestor
10739 type in the type description. */
10740 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_NORMAL
);
10742 if (type
->code () != TYPE_CODE_REF
)
10744 struct type
*actual_type
;
10746 actual_type
= type_from_tag (ada_value_tag (arg1
));
10747 if (actual_type
== NULL
)
10748 /* If, for some reason, we were unable to determine
10749 the actual type from the tag, then use the static
10750 approximation that we just computed as a fallback.
10751 This can happen if the debugging information is
10752 incomplete, for instance. */
10753 actual_type
= type
;
10754 return value_zero (actual_type
, not_lval
);
10758 /* In the case of a ref, ada_coerce_ref takes care
10759 of determining the actual type. But the evaluation
10760 should return a ref as it should be valid to ask
10761 for its address; so rebuild a ref after coerce. */
10762 arg1
= ada_coerce_ref (arg1
);
10763 return value_ref (arg1
, TYPE_CODE_REF
);
10767 /* Records and unions for which GNAT encodings have been
10768 generated need to be statically fixed as well.
10769 Otherwise, non-static fixing produces a type where
10770 all dynamic properties are removed, which prevents "ptype"
10771 from being able to completely describe the type.
10772 For instance, a case statement in a variant record would be
10773 replaced by the relevant components based on the actual
10774 value of the discriminants. */
10775 if ((type
->code () == TYPE_CODE_STRUCT
10776 && dynamic_template_type (type
) != NULL
)
10777 || (type
->code () == TYPE_CODE_UNION
10778 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10781 return value_zero (to_static_fixed_type (type
), not_lval
);
10785 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10786 return ada_to_fixed_value (arg1
);
10791 /* Allocate arg vector, including space for the function to be
10792 called in argvec[0] and a terminating NULL. */
10793 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10794 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10796 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10797 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10798 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10799 exp
->elts
[pc
+ 5].symbol
->print_name ());
10802 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10803 argvec
[tem
] = evaluate_subexp (nullptr, exp
, pos
, noside
);
10806 if (noside
== EVAL_SKIP
)
10810 if (ada_is_constrained_packed_array_type
10811 (desc_base_type (value_type (argvec
[0]))))
10812 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10813 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10814 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10815 /* This is a packed array that has already been fixed, and
10816 therefore already coerced to a simple array. Nothing further
10819 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10821 /* Make sure we dereference references so that all the code below
10822 feels like it's really handling the referenced value. Wrapping
10823 types (for alignment) may be there, so make sure we strip them as
10825 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10827 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10828 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10829 argvec
[0] = value_addr (argvec
[0]);
10831 type
= ada_check_typedef (value_type (argvec
[0]));
10833 /* Ada allows us to implicitly dereference arrays when subscripting
10834 them. So, if this is an array typedef (encoding use for array
10835 access types encoded as fat pointers), strip it now. */
10836 if (type
->code () == TYPE_CODE_TYPEDEF
)
10837 type
= ada_typedef_target_type (type
);
10839 if (type
->code () == TYPE_CODE_PTR
)
10841 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10843 case TYPE_CODE_FUNC
:
10844 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10846 case TYPE_CODE_ARRAY
:
10848 case TYPE_CODE_STRUCT
:
10849 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10850 argvec
[0] = ada_value_ind (argvec
[0]);
10851 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10854 error (_("cannot subscript or call something of type `%s'"),
10855 ada_type_name (value_type (argvec
[0])));
10860 switch (type
->code ())
10862 case TYPE_CODE_FUNC
:
10863 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10865 if (TYPE_TARGET_TYPE (type
) == NULL
)
10866 error_call_unknown_return_type (NULL
);
10867 return allocate_value (TYPE_TARGET_TYPE (type
));
10869 return call_function_by_hand (argvec
[0], NULL
,
10870 gdb::make_array_view (argvec
+ 1,
10872 case TYPE_CODE_INTERNAL_FUNCTION
:
10873 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10874 /* We don't know anything about what the internal
10875 function might return, but we have to return
10877 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10880 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10881 argvec
[0], nargs
, argvec
+ 1);
10883 case TYPE_CODE_STRUCT
:
10887 arity
= ada_array_arity (type
);
10888 type
= ada_array_element_type (type
, nargs
);
10890 error (_("cannot subscript or call a record"));
10891 if (arity
!= nargs
)
10892 error (_("wrong number of subscripts; expecting %d"), arity
);
10893 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10894 return value_zero (ada_aligned_type (type
), lval_memory
);
10896 unwrap_value (ada_value_subscript
10897 (argvec
[0], nargs
, argvec
+ 1));
10899 case TYPE_CODE_ARRAY
:
10900 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10902 type
= ada_array_element_type (type
, nargs
);
10904 error (_("element type of array unknown"));
10906 return value_zero (ada_aligned_type (type
), lval_memory
);
10909 unwrap_value (ada_value_subscript
10910 (ada_coerce_to_simple_array (argvec
[0]),
10911 nargs
, argvec
+ 1));
10912 case TYPE_CODE_PTR
: /* Pointer to array */
10913 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10915 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10916 type
= ada_array_element_type (type
, nargs
);
10918 error (_("element type of array unknown"));
10920 return value_zero (ada_aligned_type (type
), lval_memory
);
10923 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10924 nargs
, argvec
+ 1));
10927 error (_("Attempt to index or call something other than an "
10928 "array or function"));
10933 struct value
*array
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10934 struct value
*low_bound_val
10935 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10936 struct value
*high_bound_val
10937 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10939 if (noside
== EVAL_SKIP
)
10942 return ada_ternop_slice (exp
, noside
, array
, low_bound_val
,
10946 case UNOP_IN_RANGE
:
10948 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10949 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10950 return ada_unop_in_range (expect_type
, exp
, noside
, op
, arg1
, type
);
10952 case BINOP_IN_BOUNDS
:
10954 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10955 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10957 if (noside
== EVAL_SKIP
)
10960 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10962 return ada_binop_in_bounds (exp
, noside
, arg1
, arg2
, tem
);
10964 case TERNOP_IN_RANGE
:
10965 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10966 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10967 arg3
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10969 return eval_ternop_in_range (expect_type
, exp
, noside
, arg1
, arg2
, arg3
);
10973 case OP_ATR_LENGTH
:
10975 struct type
*type_arg
;
10977 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10979 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10981 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10985 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10989 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10990 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10991 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10994 if (noside
== EVAL_SKIP
)
10997 return ada_unop_atr (exp
, noside
, op
, arg1
, type_arg
, tem
);
11001 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11002 if (noside
== EVAL_SKIP
)
11004 return ada_atr_tag (expect_type
, exp
, noside
, op
, arg1
);
11008 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
11009 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11010 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11011 if (noside
== EVAL_SKIP
)
11013 return ada_binop_minmax (expect_type
, exp
, noside
, op
, arg1
, arg2
);
11015 case OP_ATR_MODULUS
:
11017 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11019 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
11020 if (noside
== EVAL_SKIP
)
11023 if (!ada_is_modular_type (type_arg
))
11024 error (_("'modulus must be applied to modular type"));
11026 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11027 ada_modulus (type_arg
));
11032 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
11033 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11034 if (noside
== EVAL_SKIP
)
11036 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11037 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11038 return value_zero (type
, not_lval
);
11040 return value_pos_atr (type
, arg1
);
11043 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11044 return ada_atr_size (expect_type
, exp
, noside
, op
, arg1
);
11047 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
11048 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11049 type
= exp
->elts
[pc
+ 2].type
;
11050 if (noside
== EVAL_SKIP
)
11052 return ada_val_atr (noside
, type
, arg1
);
11055 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11056 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11057 if (noside
== EVAL_SKIP
)
11059 return ada_binop_exp (expect_type
, exp
, noside
, op
, arg1
, arg2
);
11062 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11063 if (noside
== EVAL_SKIP
)
11069 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11070 if (noside
== EVAL_SKIP
)
11072 return ada_abs (expect_type
, exp
, noside
, op
, arg1
);
11075 preeval_pos
= *pos
;
11076 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11077 if (noside
== EVAL_SKIP
)
11079 type
= ada_check_typedef (value_type (arg1
));
11080 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11082 if (ada_is_array_descriptor_type (type
))
11083 /* GDB allows dereferencing GNAT array descriptors. */
11085 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11087 if (arrType
== NULL
)
11088 error (_("Attempt to dereference null array pointer."));
11089 return value_at_lazy (arrType
, 0);
11091 else if (type
->code () == TYPE_CODE_PTR
11092 || type
->code () == TYPE_CODE_REF
11093 /* In C you can dereference an array to get the 1st elt. */
11094 || type
->code () == TYPE_CODE_ARRAY
)
11096 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11097 only be determined by inspecting the object's tag.
11098 This means that we need to evaluate completely the
11099 expression in order to get its type. */
11101 if ((type
->code () == TYPE_CODE_REF
11102 || type
->code () == TYPE_CODE_PTR
)
11103 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11106 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11107 type
= value_type (ada_value_ind (arg1
));
11111 type
= to_static_fixed_type
11113 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11115 ada_ensure_varsize_limit (type
);
11116 return value_zero (type
, lval_memory
);
11118 else if (type
->code () == TYPE_CODE_INT
)
11120 /* GDB allows dereferencing an int. */
11121 if (expect_type
== NULL
)
11122 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11127 to_static_fixed_type (ada_aligned_type (expect_type
));
11128 return value_zero (expect_type
, lval_memory
);
11132 error (_("Attempt to take contents of a non-pointer value."));
11134 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11135 type
= ada_check_typedef (value_type (arg1
));
11137 if (type
->code () == TYPE_CODE_INT
)
11138 /* GDB allows dereferencing an int. If we were given
11139 the expect_type, then use that as the target type.
11140 Otherwise, assume that the target type is an int. */
11142 if (expect_type
!= NULL
)
11143 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11146 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11147 (CORE_ADDR
) value_as_address (arg1
));
11150 if (ada_is_array_descriptor_type (type
))
11151 /* GDB allows dereferencing GNAT array descriptors. */
11152 return ada_coerce_to_simple_array (arg1
);
11154 return ada_value_ind (arg1
);
11156 case STRUCTOP_STRUCT
:
11157 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11158 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11159 preeval_pos
= *pos
;
11160 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11161 if (noside
== EVAL_SKIP
)
11163 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11165 struct type
*type1
= value_type (arg1
);
11167 if (ada_is_tagged_type (type1
, 1))
11169 type
= ada_lookup_struct_elt_type (type1
,
11170 &exp
->elts
[pc
+ 2].string
,
11173 /* If the field is not found, check if it exists in the
11174 extension of this object's type. This means that we
11175 need to evaluate completely the expression. */
11180 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11181 arg1
= ada_value_struct_elt (arg1
,
11182 &exp
->elts
[pc
+ 2].string
,
11184 arg1
= unwrap_value (arg1
);
11185 type
= value_type (ada_to_fixed_value (arg1
));
11190 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11193 return value_zero (ada_aligned_type (type
), lval_memory
);
11197 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11198 arg1
= unwrap_value (arg1
);
11199 return ada_to_fixed_value (arg1
);
11203 /* The value is not supposed to be used. This is here to make it
11204 easier to accommodate expressions that contain types. */
11206 if (noside
== EVAL_SKIP
)
11208 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11209 return allocate_value (exp
->elts
[pc
+ 1].type
);
11211 error (_("Attempt to use a type name as an expression"));
11216 case OP_DISCRETE_RANGE
:
11217 case OP_POSITIONAL
:
11219 if (noside
== EVAL_NORMAL
)
11223 error (_("Undefined name, ambiguous name, or renaming used in "
11224 "component association: %s."), &exp
->elts
[pc
+2].string
);
11226 error (_("Aggregates only allowed on the right of an assignment"));
11228 internal_error (__FILE__
, __LINE__
,
11229 _("aggregate apparently mangled"));
11232 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11234 for (tem
= 0; tem
< nargs
; tem
+= 1)
11235 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11240 return eval_skip_value (exp
);
11244 /* Return non-zero iff TYPE represents a System.Address type. */
11247 ada_is_system_address_type (struct type
*type
)
11249 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11256 /* Scan STR beginning at position K for a discriminant name, and
11257 return the value of that discriminant field of DVAL in *PX. If
11258 PNEW_K is not null, put the position of the character beyond the
11259 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11260 not alter *PX and *PNEW_K if unsuccessful. */
11263 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11266 static std::string storage
;
11267 const char *pstart
, *pend
, *bound
;
11268 struct value
*bound_val
;
11270 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11274 pend
= strstr (pstart
, "__");
11278 k
+= strlen (bound
);
11282 int len
= pend
- pstart
;
11284 /* Strip __ and beyond. */
11285 storage
= std::string (pstart
, len
);
11286 bound
= storage
.c_str ();
11290 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11291 if (bound_val
== NULL
)
11294 *px
= value_as_long (bound_val
);
11295 if (pnew_k
!= NULL
)
11300 /* Value of variable named NAME. Only exact matches are considered.
11301 If no such variable found, then if ERR_MSG is null, returns 0, and
11302 otherwise causes an error with message ERR_MSG. */
11304 static struct value
*
11305 get_var_value (const char *name
, const char *err_msg
)
11307 std::string quoted_name
= add_angle_brackets (name
);
11309 lookup_name_info
lookup_name (quoted_name
, symbol_name_match_type::FULL
);
11311 std::vector
<struct block_symbol
> syms
11312 = ada_lookup_symbol_list_worker (lookup_name
,
11313 get_selected_block (0),
11316 if (syms
.size () != 1)
11318 if (err_msg
== NULL
)
11321 error (("%s"), err_msg
);
11324 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11327 /* Value of integer variable named NAME in the current environment.
11328 If no such variable is found, returns false. Otherwise, sets VALUE
11329 to the variable's value and returns true. */
11332 get_int_var_value (const char *name
, LONGEST
&value
)
11334 struct value
*var_val
= get_var_value (name
, 0);
11339 value
= value_as_long (var_val
);
11344 /* Return a range type whose base type is that of the range type named
11345 NAME in the current environment, and whose bounds are calculated
11346 from NAME according to the GNAT range encoding conventions.
11347 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11348 corresponding range type from debug information; fall back to using it
11349 if symbol lookup fails. If a new type must be created, allocate it
11350 like ORIG_TYPE was. The bounds information, in general, is encoded
11351 in NAME, the base type given in the named range type. */
11353 static struct type
*
11354 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11357 struct type
*base_type
;
11358 const char *subtype_info
;
11360 gdb_assert (raw_type
!= NULL
);
11361 gdb_assert (raw_type
->name () != NULL
);
11363 if (raw_type
->code () == TYPE_CODE_RANGE
)
11364 base_type
= TYPE_TARGET_TYPE (raw_type
);
11366 base_type
= raw_type
;
11368 name
= raw_type
->name ();
11369 subtype_info
= strstr (name
, "___XD");
11370 if (subtype_info
== NULL
)
11372 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11373 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11375 if (L
< INT_MIN
|| U
> INT_MAX
)
11378 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11383 int prefix_len
= subtype_info
- name
;
11386 const char *bounds_str
;
11390 bounds_str
= strchr (subtype_info
, '_');
11393 if (*subtype_info
== 'L')
11395 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11396 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11398 if (bounds_str
[n
] == '_')
11400 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11406 std::string name_buf
= std::string (name
, prefix_len
) + "___L";
11407 if (!get_int_var_value (name_buf
.c_str (), L
))
11409 lim_warning (_("Unknown lower bound, using 1."));
11414 if (*subtype_info
== 'U')
11416 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11417 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11422 std::string name_buf
= std::string (name
, prefix_len
) + "___U";
11423 if (!get_int_var_value (name_buf
.c_str (), U
))
11425 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11430 type
= create_static_range_type (alloc_type_copy (raw_type
),
11432 /* create_static_range_type alters the resulting type's length
11433 to match the size of the base_type, which is not what we want.
11434 Set it back to the original range type's length. */
11435 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11436 type
->set_name (name
);
11441 /* True iff NAME is the name of a range type. */
11444 ada_is_range_type_name (const char *name
)
11446 return (name
!= NULL
&& strstr (name
, "___XD"));
11450 /* Modular types */
11452 /* True iff TYPE is an Ada modular type. */
11455 ada_is_modular_type (struct type
*type
)
11457 struct type
*subranged_type
= get_base_type (type
);
11459 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11460 && subranged_type
->code () == TYPE_CODE_INT
11461 && subranged_type
->is_unsigned ());
11464 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11467 ada_modulus (struct type
*type
)
11469 const dynamic_prop
&high
= type
->bounds ()->high
;
11471 if (high
.kind () == PROP_CONST
)
11472 return (ULONGEST
) high
.const_val () + 1;
11474 /* If TYPE is unresolved, the high bound might be a location list. Return
11475 0, for lack of a better value to return. */
11480 /* Ada exception catchpoint support:
11481 ---------------------------------
11483 We support 3 kinds of exception catchpoints:
11484 . catchpoints on Ada exceptions
11485 . catchpoints on unhandled Ada exceptions
11486 . catchpoints on failed assertions
11488 Exceptions raised during failed assertions, or unhandled exceptions
11489 could perfectly be caught with the general catchpoint on Ada exceptions.
11490 However, we can easily differentiate these two special cases, and having
11491 the option to distinguish these two cases from the rest can be useful
11492 to zero-in on certain situations.
11494 Exception catchpoints are a specialized form of breakpoint,
11495 since they rely on inserting breakpoints inside known routines
11496 of the GNAT runtime. The implementation therefore uses a standard
11497 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11500 Support in the runtime for exception catchpoints have been changed
11501 a few times already, and these changes affect the implementation
11502 of these catchpoints. In order to be able to support several
11503 variants of the runtime, we use a sniffer that will determine
11504 the runtime variant used by the program being debugged. */
11506 /* Ada's standard exceptions.
11508 The Ada 83 standard also defined Numeric_Error. But there so many
11509 situations where it was unclear from the Ada 83 Reference Manual
11510 (RM) whether Constraint_Error or Numeric_Error should be raised,
11511 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11512 Interpretation saying that anytime the RM says that Numeric_Error
11513 should be raised, the implementation may raise Constraint_Error.
11514 Ada 95 went one step further and pretty much removed Numeric_Error
11515 from the list of standard exceptions (it made it a renaming of
11516 Constraint_Error, to help preserve compatibility when compiling
11517 an Ada83 compiler). As such, we do not include Numeric_Error from
11518 this list of standard exceptions. */
11520 static const char * const standard_exc
[] = {
11521 "constraint_error",
11527 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11529 /* A structure that describes how to support exception catchpoints
11530 for a given executable. */
11532 struct exception_support_info
11534 /* The name of the symbol to break on in order to insert
11535 a catchpoint on exceptions. */
11536 const char *catch_exception_sym
;
11538 /* The name of the symbol to break on in order to insert
11539 a catchpoint on unhandled exceptions. */
11540 const char *catch_exception_unhandled_sym
;
11542 /* The name of the symbol to break on in order to insert
11543 a catchpoint on failed assertions. */
11544 const char *catch_assert_sym
;
11546 /* The name of the symbol to break on in order to insert
11547 a catchpoint on exception handling. */
11548 const char *catch_handlers_sym
;
11550 /* Assuming that the inferior just triggered an unhandled exception
11551 catchpoint, this function is responsible for returning the address
11552 in inferior memory where the name of that exception is stored.
11553 Return zero if the address could not be computed. */
11554 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11557 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11558 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11560 /* The following exception support info structure describes how to
11561 implement exception catchpoints with the latest version of the
11562 Ada runtime (as of 2019-08-??). */
11564 static const struct exception_support_info default_exception_support_info
=
11566 "__gnat_debug_raise_exception", /* catch_exception_sym */
11567 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11568 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11569 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11570 ada_unhandled_exception_name_addr
11573 /* The following exception support info structure describes how to
11574 implement exception catchpoints with an earlier version of the
11575 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11577 static const struct exception_support_info exception_support_info_v0
=
11579 "__gnat_debug_raise_exception", /* catch_exception_sym */
11580 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11581 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11582 "__gnat_begin_handler", /* catch_handlers_sym */
11583 ada_unhandled_exception_name_addr
11586 /* The following exception support info structure describes how to
11587 implement exception catchpoints with a slightly older version
11588 of the Ada runtime. */
11590 static const struct exception_support_info exception_support_info_fallback
=
11592 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11593 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11594 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11595 "__gnat_begin_handler", /* catch_handlers_sym */
11596 ada_unhandled_exception_name_addr_from_raise
11599 /* Return nonzero if we can detect the exception support routines
11600 described in EINFO.
11602 This function errors out if an abnormal situation is detected
11603 (for instance, if we find the exception support routines, but
11604 that support is found to be incomplete). */
11607 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11609 struct symbol
*sym
;
11611 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11612 that should be compiled with debugging information. As a result, we
11613 expect to find that symbol in the symtabs. */
11615 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11618 /* Perhaps we did not find our symbol because the Ada runtime was
11619 compiled without debugging info, or simply stripped of it.
11620 It happens on some GNU/Linux distributions for instance, where
11621 users have to install a separate debug package in order to get
11622 the runtime's debugging info. In that situation, let the user
11623 know why we cannot insert an Ada exception catchpoint.
11625 Note: Just for the purpose of inserting our Ada exception
11626 catchpoint, we could rely purely on the associated minimal symbol.
11627 But we would be operating in degraded mode anyway, since we are
11628 still lacking the debugging info needed later on to extract
11629 the name of the exception being raised (this name is printed in
11630 the catchpoint message, and is also used when trying to catch
11631 a specific exception). We do not handle this case for now. */
11632 struct bound_minimal_symbol msym
11633 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11635 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11636 error (_("Your Ada runtime appears to be missing some debugging "
11637 "information.\nCannot insert Ada exception catchpoint "
11638 "in this configuration."));
11643 /* Make sure that the symbol we found corresponds to a function. */
11645 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11647 error (_("Symbol \"%s\" is not a function (class = %d)"),
11648 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11652 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11655 struct bound_minimal_symbol msym
11656 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11658 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11659 error (_("Your Ada runtime appears to be missing some debugging "
11660 "information.\nCannot insert Ada exception catchpoint "
11661 "in this configuration."));
11666 /* Make sure that the symbol we found corresponds to a function. */
11668 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11670 error (_("Symbol \"%s\" is not a function (class = %d)"),
11671 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11678 /* Inspect the Ada runtime and determine which exception info structure
11679 should be used to provide support for exception catchpoints.
11681 This function will always set the per-inferior exception_info,
11682 or raise an error. */
11685 ada_exception_support_info_sniffer (void)
11687 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11689 /* If the exception info is already known, then no need to recompute it. */
11690 if (data
->exception_info
!= NULL
)
11693 /* Check the latest (default) exception support info. */
11694 if (ada_has_this_exception_support (&default_exception_support_info
))
11696 data
->exception_info
= &default_exception_support_info
;
11700 /* Try the v0 exception suport info. */
11701 if (ada_has_this_exception_support (&exception_support_info_v0
))
11703 data
->exception_info
= &exception_support_info_v0
;
11707 /* Try our fallback exception suport info. */
11708 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11710 data
->exception_info
= &exception_support_info_fallback
;
11714 /* Sometimes, it is normal for us to not be able to find the routine
11715 we are looking for. This happens when the program is linked with
11716 the shared version of the GNAT runtime, and the program has not been
11717 started yet. Inform the user of these two possible causes if
11720 if (ada_update_initial_language (language_unknown
) != language_ada
)
11721 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11723 /* If the symbol does not exist, then check that the program is
11724 already started, to make sure that shared libraries have been
11725 loaded. If it is not started, this may mean that the symbol is
11726 in a shared library. */
11728 if (inferior_ptid
.pid () == 0)
11729 error (_("Unable to insert catchpoint. Try to start the program first."));
11731 /* At this point, we know that we are debugging an Ada program and
11732 that the inferior has been started, but we still are not able to
11733 find the run-time symbols. That can mean that we are in
11734 configurable run time mode, or that a-except as been optimized
11735 out by the linker... In any case, at this point it is not worth
11736 supporting this feature. */
11738 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11741 /* True iff FRAME is very likely to be that of a function that is
11742 part of the runtime system. This is all very heuristic, but is
11743 intended to be used as advice as to what frames are uninteresting
11747 is_known_support_routine (struct frame_info
*frame
)
11749 enum language func_lang
;
11751 const char *fullname
;
11753 /* If this code does not have any debugging information (no symtab),
11754 This cannot be any user code. */
11756 symtab_and_line sal
= find_frame_sal (frame
);
11757 if (sal
.symtab
== NULL
)
11760 /* If there is a symtab, but the associated source file cannot be
11761 located, then assume this is not user code: Selecting a frame
11762 for which we cannot display the code would not be very helpful
11763 for the user. This should also take care of case such as VxWorks
11764 where the kernel has some debugging info provided for a few units. */
11766 fullname
= symtab_to_fullname (sal
.symtab
);
11767 if (access (fullname
, R_OK
) != 0)
11770 /* Check the unit filename against the Ada runtime file naming.
11771 We also check the name of the objfile against the name of some
11772 known system libraries that sometimes come with debugging info
11775 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11777 re_comp (known_runtime_file_name_patterns
[i
]);
11778 if (re_exec (lbasename (sal
.symtab
->filename
)))
11780 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11781 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11785 /* Check whether the function is a GNAT-generated entity. */
11787 gdb::unique_xmalloc_ptr
<char> func_name
11788 = find_frame_funname (frame
, &func_lang
, NULL
);
11789 if (func_name
== NULL
)
11792 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11794 re_comp (known_auxiliary_function_name_patterns
[i
]);
11795 if (re_exec (func_name
.get ()))
11802 /* Find the first frame that contains debugging information and that is not
11803 part of the Ada run-time, starting from FI and moving upward. */
11806 ada_find_printable_frame (struct frame_info
*fi
)
11808 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11810 if (!is_known_support_routine (fi
))
11819 /* Assuming that the inferior just triggered an unhandled exception
11820 catchpoint, return the address in inferior memory where the name
11821 of the exception is stored.
11823 Return zero if the address could not be computed. */
11826 ada_unhandled_exception_name_addr (void)
11828 return parse_and_eval_address ("e.full_name");
11831 /* Same as ada_unhandled_exception_name_addr, except that this function
11832 should be used when the inferior uses an older version of the runtime,
11833 where the exception name needs to be extracted from a specific frame
11834 several frames up in the callstack. */
11837 ada_unhandled_exception_name_addr_from_raise (void)
11840 struct frame_info
*fi
;
11841 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11843 /* To determine the name of this exception, we need to select
11844 the frame corresponding to RAISE_SYM_NAME. This frame is
11845 at least 3 levels up, so we simply skip the first 3 frames
11846 without checking the name of their associated function. */
11847 fi
= get_current_frame ();
11848 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11850 fi
= get_prev_frame (fi
);
11854 enum language func_lang
;
11856 gdb::unique_xmalloc_ptr
<char> func_name
11857 = find_frame_funname (fi
, &func_lang
, NULL
);
11858 if (func_name
!= NULL
)
11860 if (strcmp (func_name
.get (),
11861 data
->exception_info
->catch_exception_sym
) == 0)
11862 break; /* We found the frame we were looking for... */
11864 fi
= get_prev_frame (fi
);
11871 return parse_and_eval_address ("id.full_name");
11874 /* Assuming the inferior just triggered an Ada exception catchpoint
11875 (of any type), return the address in inferior memory where the name
11876 of the exception is stored, if applicable.
11878 Assumes the selected frame is the current frame.
11880 Return zero if the address could not be computed, or if not relevant. */
11883 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11884 struct breakpoint
*b
)
11886 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11890 case ada_catch_exception
:
11891 return (parse_and_eval_address ("e.full_name"));
11894 case ada_catch_exception_unhandled
:
11895 return data
->exception_info
->unhandled_exception_name_addr ();
11898 case ada_catch_handlers
:
11899 return 0; /* The runtimes does not provide access to the exception
11903 case ada_catch_assert
:
11904 return 0; /* Exception name is not relevant in this case. */
11908 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11912 return 0; /* Should never be reached. */
11915 /* Assuming the inferior is stopped at an exception catchpoint,
11916 return the message which was associated to the exception, if
11917 available. Return NULL if the message could not be retrieved.
11919 Note: The exception message can be associated to an exception
11920 either through the use of the Raise_Exception function, or
11921 more simply (Ada 2005 and later), via:
11923 raise Exception_Name with "exception message";
11927 static gdb::unique_xmalloc_ptr
<char>
11928 ada_exception_message_1 (void)
11930 struct value
*e_msg_val
;
11933 /* For runtimes that support this feature, the exception message
11934 is passed as an unbounded string argument called "message". */
11935 e_msg_val
= parse_and_eval ("message");
11936 if (e_msg_val
== NULL
)
11937 return NULL
; /* Exception message not supported. */
11939 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
11940 gdb_assert (e_msg_val
!= NULL
);
11941 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
11943 /* If the message string is empty, then treat it as if there was
11944 no exception message. */
11945 if (e_msg_len
<= 0)
11948 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
11949 read_memory (value_address (e_msg_val
), (gdb_byte
*) e_msg
.get (),
11951 e_msg
.get ()[e_msg_len
] = '\0';
11956 /* Same as ada_exception_message_1, except that all exceptions are
11957 contained here (returning NULL instead). */
11959 static gdb::unique_xmalloc_ptr
<char>
11960 ada_exception_message (void)
11962 gdb::unique_xmalloc_ptr
<char> e_msg
;
11966 e_msg
= ada_exception_message_1 ();
11968 catch (const gdb_exception_error
&e
)
11970 e_msg
.reset (nullptr);
11976 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11977 any error that ada_exception_name_addr_1 might cause to be thrown.
11978 When an error is intercepted, a warning with the error message is printed,
11979 and zero is returned. */
11982 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11983 struct breakpoint
*b
)
11985 CORE_ADDR result
= 0;
11989 result
= ada_exception_name_addr_1 (ex
, b
);
11992 catch (const gdb_exception_error
&e
)
11994 warning (_("failed to get exception name: %s"), e
.what ());
12001 static std::string ada_exception_catchpoint_cond_string
12002 (const char *excep_string
,
12003 enum ada_exception_catchpoint_kind ex
);
12005 /* Ada catchpoints.
12007 In the case of catchpoints on Ada exceptions, the catchpoint will
12008 stop the target on every exception the program throws. When a user
12009 specifies the name of a specific exception, we translate this
12010 request into a condition expression (in text form), and then parse
12011 it into an expression stored in each of the catchpoint's locations.
12012 We then use this condition to check whether the exception that was
12013 raised is the one the user is interested in. If not, then the
12014 target is resumed again. We store the name of the requested
12015 exception, in order to be able to re-set the condition expression
12016 when symbols change. */
12018 /* An instance of this type is used to represent an Ada catchpoint
12019 breakpoint location. */
12021 class ada_catchpoint_location
: public bp_location
12024 ada_catchpoint_location (breakpoint
*owner
)
12025 : bp_location (owner
, bp_loc_software_breakpoint
)
12028 /* The condition that checks whether the exception that was raised
12029 is the specific exception the user specified on catchpoint
12031 expression_up excep_cond_expr
;
12034 /* An instance of this type is used to represent an Ada catchpoint. */
12036 struct ada_catchpoint
: public breakpoint
12038 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12043 /* The name of the specific exception the user specified. */
12044 std::string excep_string
;
12046 /* What kind of catchpoint this is. */
12047 enum ada_exception_catchpoint_kind m_kind
;
12050 /* Parse the exception condition string in the context of each of the
12051 catchpoint's locations, and store them for later evaluation. */
12054 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12055 enum ada_exception_catchpoint_kind ex
)
12057 struct bp_location
*bl
;
12059 /* Nothing to do if there's no specific exception to catch. */
12060 if (c
->excep_string
.empty ())
12063 /* Same if there are no locations... */
12064 if (c
->loc
== NULL
)
12067 /* Compute the condition expression in text form, from the specific
12068 expection we want to catch. */
12069 std::string cond_string
12070 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12072 /* Iterate over all the catchpoint's locations, and parse an
12073 expression for each. */
12074 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12076 struct ada_catchpoint_location
*ada_loc
12077 = (struct ada_catchpoint_location
*) bl
;
12080 if (!bl
->shlib_disabled
)
12084 s
= cond_string
.c_str ();
12087 exp
= parse_exp_1 (&s
, bl
->address
,
12088 block_for_pc (bl
->address
),
12091 catch (const gdb_exception_error
&e
)
12093 warning (_("failed to reevaluate internal exception condition "
12094 "for catchpoint %d: %s"),
12095 c
->number
, e
.what ());
12099 ada_loc
->excep_cond_expr
= std::move (exp
);
12103 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12104 structure for all exception catchpoint kinds. */
12106 static struct bp_location
*
12107 allocate_location_exception (struct breakpoint
*self
)
12109 return new ada_catchpoint_location (self
);
12112 /* Implement the RE_SET method in the breakpoint_ops structure for all
12113 exception catchpoint kinds. */
12116 re_set_exception (struct breakpoint
*b
)
12118 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12120 /* Call the base class's method. This updates the catchpoint's
12122 bkpt_breakpoint_ops
.re_set (b
);
12124 /* Reparse the exception conditional expressions. One for each
12126 create_excep_cond_exprs (c
, c
->m_kind
);
12129 /* Returns true if we should stop for this breakpoint hit. If the
12130 user specified a specific exception, we only want to cause a stop
12131 if the program thrown that exception. */
12134 should_stop_exception (const struct bp_location
*bl
)
12136 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12137 const struct ada_catchpoint_location
*ada_loc
12138 = (const struct ada_catchpoint_location
*) bl
;
12141 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12142 if (c
->m_kind
== ada_catch_assert
)
12143 clear_internalvar (var
);
12150 if (c
->m_kind
== ada_catch_handlers
)
12151 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12152 ".all.occurrence.id");
12156 struct value
*exc
= parse_and_eval (expr
);
12157 set_internalvar (var
, exc
);
12159 catch (const gdb_exception_error
&ex
)
12161 clear_internalvar (var
);
12165 /* With no specific exception, should always stop. */
12166 if (c
->excep_string
.empty ())
12169 if (ada_loc
->excep_cond_expr
== NULL
)
12171 /* We will have a NULL expression if back when we were creating
12172 the expressions, this location's had failed to parse. */
12179 struct value
*mark
;
12181 mark
= value_mark ();
12182 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12183 value_free_to_mark (mark
);
12185 catch (const gdb_exception
&ex
)
12187 exception_fprintf (gdb_stderr
, ex
,
12188 _("Error in testing exception condition:\n"));
12194 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12195 for all exception catchpoint kinds. */
12198 check_status_exception (bpstat bs
)
12200 bs
->stop
= should_stop_exception (bs
->bp_location_at
.get ());
12203 /* Implement the PRINT_IT method in the breakpoint_ops structure
12204 for all exception catchpoint kinds. */
12206 static enum print_stop_action
12207 print_it_exception (bpstat bs
)
12209 struct ui_out
*uiout
= current_uiout
;
12210 struct breakpoint
*b
= bs
->breakpoint_at
;
12212 annotate_catchpoint (b
->number
);
12214 if (uiout
->is_mi_like_p ())
12216 uiout
->field_string ("reason",
12217 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12218 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12221 uiout
->text (b
->disposition
== disp_del
12222 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12223 uiout
->field_signed ("bkptno", b
->number
);
12224 uiout
->text (", ");
12226 /* ada_exception_name_addr relies on the selected frame being the
12227 current frame. Need to do this here because this function may be
12228 called more than once when printing a stop, and below, we'll
12229 select the first frame past the Ada run-time (see
12230 ada_find_printable_frame). */
12231 select_frame (get_current_frame ());
12233 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12236 case ada_catch_exception
:
12237 case ada_catch_exception_unhandled
:
12238 case ada_catch_handlers
:
12240 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12241 char exception_name
[256];
12245 read_memory (addr
, (gdb_byte
*) exception_name
,
12246 sizeof (exception_name
) - 1);
12247 exception_name
[sizeof (exception_name
) - 1] = '\0';
12251 /* For some reason, we were unable to read the exception
12252 name. This could happen if the Runtime was compiled
12253 without debugging info, for instance. In that case,
12254 just replace the exception name by the generic string
12255 "exception" - it will read as "an exception" in the
12256 notification we are about to print. */
12257 memcpy (exception_name
, "exception", sizeof ("exception"));
12259 /* In the case of unhandled exception breakpoints, we print
12260 the exception name as "unhandled EXCEPTION_NAME", to make
12261 it clearer to the user which kind of catchpoint just got
12262 hit. We used ui_out_text to make sure that this extra
12263 info does not pollute the exception name in the MI case. */
12264 if (c
->m_kind
== ada_catch_exception_unhandled
)
12265 uiout
->text ("unhandled ");
12266 uiout
->field_string ("exception-name", exception_name
);
12269 case ada_catch_assert
:
12270 /* In this case, the name of the exception is not really
12271 important. Just print "failed assertion" to make it clearer
12272 that his program just hit an assertion-failure catchpoint.
12273 We used ui_out_text because this info does not belong in
12275 uiout
->text ("failed assertion");
12279 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12280 if (exception_message
!= NULL
)
12282 uiout
->text (" (");
12283 uiout
->field_string ("exception-message", exception_message
.get ());
12287 uiout
->text (" at ");
12288 ada_find_printable_frame (get_current_frame ());
12290 return PRINT_SRC_AND_LOC
;
12293 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12294 for all exception catchpoint kinds. */
12297 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12299 struct ui_out
*uiout
= current_uiout
;
12300 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12301 struct value_print_options opts
;
12303 get_user_print_options (&opts
);
12305 if (opts
.addressprint
)
12306 uiout
->field_skip ("addr");
12308 annotate_field (5);
12311 case ada_catch_exception
:
12312 if (!c
->excep_string
.empty ())
12314 std::string msg
= string_printf (_("`%s' Ada exception"),
12315 c
->excep_string
.c_str ());
12317 uiout
->field_string ("what", msg
);
12320 uiout
->field_string ("what", "all Ada exceptions");
12324 case ada_catch_exception_unhandled
:
12325 uiout
->field_string ("what", "unhandled Ada exceptions");
12328 case ada_catch_handlers
:
12329 if (!c
->excep_string
.empty ())
12331 uiout
->field_fmt ("what",
12332 _("`%s' Ada exception handlers"),
12333 c
->excep_string
.c_str ());
12336 uiout
->field_string ("what", "all Ada exceptions handlers");
12339 case ada_catch_assert
:
12340 uiout
->field_string ("what", "failed Ada assertions");
12344 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12349 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12350 for all exception catchpoint kinds. */
12353 print_mention_exception (struct breakpoint
*b
)
12355 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12356 struct ui_out
*uiout
= current_uiout
;
12358 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12359 : _("Catchpoint "));
12360 uiout
->field_signed ("bkptno", b
->number
);
12361 uiout
->text (": ");
12365 case ada_catch_exception
:
12366 if (!c
->excep_string
.empty ())
12368 std::string info
= string_printf (_("`%s' Ada exception"),
12369 c
->excep_string
.c_str ());
12370 uiout
->text (info
.c_str ());
12373 uiout
->text (_("all Ada exceptions"));
12376 case ada_catch_exception_unhandled
:
12377 uiout
->text (_("unhandled Ada exceptions"));
12380 case ada_catch_handlers
:
12381 if (!c
->excep_string
.empty ())
12384 = string_printf (_("`%s' Ada exception handlers"),
12385 c
->excep_string
.c_str ());
12386 uiout
->text (info
.c_str ());
12389 uiout
->text (_("all Ada exceptions handlers"));
12392 case ada_catch_assert
:
12393 uiout
->text (_("failed Ada assertions"));
12397 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12402 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12403 for all exception catchpoint kinds. */
12406 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12408 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12412 case ada_catch_exception
:
12413 fprintf_filtered (fp
, "catch exception");
12414 if (!c
->excep_string
.empty ())
12415 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12418 case ada_catch_exception_unhandled
:
12419 fprintf_filtered (fp
, "catch exception unhandled");
12422 case ada_catch_handlers
:
12423 fprintf_filtered (fp
, "catch handlers");
12426 case ada_catch_assert
:
12427 fprintf_filtered (fp
, "catch assert");
12431 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12433 print_recreate_thread (b
, fp
);
12436 /* Virtual tables for various breakpoint types. */
12437 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12438 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12439 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12440 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12442 /* See ada-lang.h. */
12445 is_ada_exception_catchpoint (breakpoint
*bp
)
12447 return (bp
->ops
== &catch_exception_breakpoint_ops
12448 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12449 || bp
->ops
== &catch_assert_breakpoint_ops
12450 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12453 /* Split the arguments specified in a "catch exception" command.
12454 Set EX to the appropriate catchpoint type.
12455 Set EXCEP_STRING to the name of the specific exception if
12456 specified by the user.
12457 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12458 "catch handlers" command. False otherwise.
12459 If a condition is found at the end of the arguments, the condition
12460 expression is stored in COND_STRING (memory must be deallocated
12461 after use). Otherwise COND_STRING is set to NULL. */
12464 catch_ada_exception_command_split (const char *args
,
12465 bool is_catch_handlers_cmd
,
12466 enum ada_exception_catchpoint_kind
*ex
,
12467 std::string
*excep_string
,
12468 std::string
*cond_string
)
12470 std::string exception_name
;
12472 exception_name
= extract_arg (&args
);
12473 if (exception_name
== "if")
12475 /* This is not an exception name; this is the start of a condition
12476 expression for a catchpoint on all exceptions. So, "un-get"
12477 this token, and set exception_name to NULL. */
12478 exception_name
.clear ();
12482 /* Check to see if we have a condition. */
12484 args
= skip_spaces (args
);
12485 if (startswith (args
, "if")
12486 && (isspace (args
[2]) || args
[2] == '\0'))
12489 args
= skip_spaces (args
);
12491 if (args
[0] == '\0')
12492 error (_("Condition missing after `if' keyword"));
12493 *cond_string
= args
;
12495 args
+= strlen (args
);
12498 /* Check that we do not have any more arguments. Anything else
12501 if (args
[0] != '\0')
12502 error (_("Junk at end of expression"));
12504 if (is_catch_handlers_cmd
)
12506 /* Catch handling of exceptions. */
12507 *ex
= ada_catch_handlers
;
12508 *excep_string
= exception_name
;
12510 else if (exception_name
.empty ())
12512 /* Catch all exceptions. */
12513 *ex
= ada_catch_exception
;
12514 excep_string
->clear ();
12516 else if (exception_name
== "unhandled")
12518 /* Catch unhandled exceptions. */
12519 *ex
= ada_catch_exception_unhandled
;
12520 excep_string
->clear ();
12524 /* Catch a specific exception. */
12525 *ex
= ada_catch_exception
;
12526 *excep_string
= exception_name
;
12530 /* Return the name of the symbol on which we should break in order to
12531 implement a catchpoint of the EX kind. */
12533 static const char *
12534 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12536 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12538 gdb_assert (data
->exception_info
!= NULL
);
12542 case ada_catch_exception
:
12543 return (data
->exception_info
->catch_exception_sym
);
12545 case ada_catch_exception_unhandled
:
12546 return (data
->exception_info
->catch_exception_unhandled_sym
);
12548 case ada_catch_assert
:
12549 return (data
->exception_info
->catch_assert_sym
);
12551 case ada_catch_handlers
:
12552 return (data
->exception_info
->catch_handlers_sym
);
12555 internal_error (__FILE__
, __LINE__
,
12556 _("unexpected catchpoint kind (%d)"), ex
);
12560 /* Return the breakpoint ops "virtual table" used for catchpoints
12563 static const struct breakpoint_ops
*
12564 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12568 case ada_catch_exception
:
12569 return (&catch_exception_breakpoint_ops
);
12571 case ada_catch_exception_unhandled
:
12572 return (&catch_exception_unhandled_breakpoint_ops
);
12574 case ada_catch_assert
:
12575 return (&catch_assert_breakpoint_ops
);
12577 case ada_catch_handlers
:
12578 return (&catch_handlers_breakpoint_ops
);
12581 internal_error (__FILE__
, __LINE__
,
12582 _("unexpected catchpoint kind (%d)"), ex
);
12586 /* Return the condition that will be used to match the current exception
12587 being raised with the exception that the user wants to catch. This
12588 assumes that this condition is used when the inferior just triggered
12589 an exception catchpoint.
12590 EX: the type of catchpoints used for catching Ada exceptions. */
12593 ada_exception_catchpoint_cond_string (const char *excep_string
,
12594 enum ada_exception_catchpoint_kind ex
)
12597 bool is_standard_exc
= false;
12598 std::string result
;
12600 if (ex
== ada_catch_handlers
)
12602 /* For exception handlers catchpoints, the condition string does
12603 not use the same parameter as for the other exceptions. */
12604 result
= ("long_integer (GNAT_GCC_exception_Access"
12605 "(gcc_exception).all.occurrence.id)");
12608 result
= "long_integer (e)";
12610 /* The standard exceptions are a special case. They are defined in
12611 runtime units that have been compiled without debugging info; if
12612 EXCEP_STRING is the not-fully-qualified name of a standard
12613 exception (e.g. "constraint_error") then, during the evaluation
12614 of the condition expression, the symbol lookup on this name would
12615 *not* return this standard exception. The catchpoint condition
12616 may then be set only on user-defined exceptions which have the
12617 same not-fully-qualified name (e.g. my_package.constraint_error).
12619 To avoid this unexcepted behavior, these standard exceptions are
12620 systematically prefixed by "standard". This means that "catch
12621 exception constraint_error" is rewritten into "catch exception
12622 standard.constraint_error".
12624 If an exception named constraint_error is defined in another package of
12625 the inferior program, then the only way to specify this exception as a
12626 breakpoint condition is to use its fully-qualified named:
12627 e.g. my_package.constraint_error. */
12629 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12631 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12633 is_standard_exc
= true;
12640 if (is_standard_exc
)
12641 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12643 string_appendf (result
, "long_integer (&%s)", excep_string
);
12648 /* Return the symtab_and_line that should be used to insert an exception
12649 catchpoint of the TYPE kind.
12651 ADDR_STRING returns the name of the function where the real
12652 breakpoint that implements the catchpoints is set, depending on the
12653 type of catchpoint we need to create. */
12655 static struct symtab_and_line
12656 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12657 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12659 const char *sym_name
;
12660 struct symbol
*sym
;
12662 /* First, find out which exception support info to use. */
12663 ada_exception_support_info_sniffer ();
12665 /* Then lookup the function on which we will break in order to catch
12666 the Ada exceptions requested by the user. */
12667 sym_name
= ada_exception_sym_name (ex
);
12668 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12671 error (_("Catchpoint symbol not found: %s"), sym_name
);
12673 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12674 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12676 /* Set ADDR_STRING. */
12677 *addr_string
= sym_name
;
12680 *ops
= ada_exception_breakpoint_ops (ex
);
12682 return find_function_start_sal (sym
, 1);
12685 /* Create an Ada exception catchpoint.
12687 EX_KIND is the kind of exception catchpoint to be created.
12689 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12690 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12691 of the exception to which this catchpoint applies.
12693 COND_STRING, if not empty, is the catchpoint condition.
12695 TEMPFLAG, if nonzero, means that the underlying breakpoint
12696 should be temporary.
12698 FROM_TTY is the usual argument passed to all commands implementations. */
12701 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12702 enum ada_exception_catchpoint_kind ex_kind
,
12703 const std::string
&excep_string
,
12704 const std::string
&cond_string
,
12709 std::string addr_string
;
12710 const struct breakpoint_ops
*ops
= NULL
;
12711 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12713 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12714 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12715 ops
, tempflag
, disabled
, from_tty
);
12716 c
->excep_string
= excep_string
;
12717 create_excep_cond_exprs (c
.get (), ex_kind
);
12718 if (!cond_string
.empty ())
12719 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
, false);
12720 install_breakpoint (0, std::move (c
), 1);
12723 /* Implement the "catch exception" command. */
12726 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12727 struct cmd_list_element
*command
)
12729 const char *arg
= arg_entry
;
12730 struct gdbarch
*gdbarch
= get_current_arch ();
12732 enum ada_exception_catchpoint_kind ex_kind
;
12733 std::string excep_string
;
12734 std::string cond_string
;
12736 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12740 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12742 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12743 excep_string
, cond_string
,
12744 tempflag
, 1 /* enabled */,
12748 /* Implement the "catch handlers" command. */
12751 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12752 struct cmd_list_element
*command
)
12754 const char *arg
= arg_entry
;
12755 struct gdbarch
*gdbarch
= get_current_arch ();
12757 enum ada_exception_catchpoint_kind ex_kind
;
12758 std::string excep_string
;
12759 std::string cond_string
;
12761 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12765 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
12767 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12768 excep_string
, cond_string
,
12769 tempflag
, 1 /* enabled */,
12773 /* Completion function for the Ada "catch" commands. */
12776 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
12777 const char *text
, const char *word
)
12779 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
12781 for (const ada_exc_info
&info
: exceptions
)
12783 if (startswith (info
.name
, word
))
12784 tracker
.add_completion (make_unique_xstrdup (info
.name
));
12788 /* Split the arguments specified in a "catch assert" command.
12790 ARGS contains the command's arguments (or the empty string if
12791 no arguments were passed).
12793 If ARGS contains a condition, set COND_STRING to that condition
12794 (the memory needs to be deallocated after use). */
12797 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
12799 args
= skip_spaces (args
);
12801 /* Check whether a condition was provided. */
12802 if (startswith (args
, "if")
12803 && (isspace (args
[2]) || args
[2] == '\0'))
12806 args
= skip_spaces (args
);
12807 if (args
[0] == '\0')
12808 error (_("condition missing after `if' keyword"));
12809 cond_string
.assign (args
);
12812 /* Otherwise, there should be no other argument at the end of
12814 else if (args
[0] != '\0')
12815 error (_("Junk at end of arguments."));
12818 /* Implement the "catch assert" command. */
12821 catch_assert_command (const char *arg_entry
, int from_tty
,
12822 struct cmd_list_element
*command
)
12824 const char *arg
= arg_entry
;
12825 struct gdbarch
*gdbarch
= get_current_arch ();
12827 std::string cond_string
;
12829 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12833 catch_ada_assert_command_split (arg
, cond_string
);
12834 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12836 tempflag
, 1 /* enabled */,
12840 /* Return non-zero if the symbol SYM is an Ada exception object. */
12843 ada_is_exception_sym (struct symbol
*sym
)
12845 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
12847 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12848 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12849 && SYMBOL_CLASS (sym
) != LOC_CONST
12850 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12851 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12854 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12855 Ada exception object. This matches all exceptions except the ones
12856 defined by the Ada language. */
12859 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12863 if (!ada_is_exception_sym (sym
))
12866 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12867 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
12868 return 0; /* A standard exception. */
12870 /* Numeric_Error is also a standard exception, so exclude it.
12871 See the STANDARD_EXC description for more details as to why
12872 this exception is not listed in that array. */
12873 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
12879 /* A helper function for std::sort, comparing two struct ada_exc_info
12882 The comparison is determined first by exception name, and then
12883 by exception address. */
12886 ada_exc_info::operator< (const ada_exc_info
&other
) const
12890 result
= strcmp (name
, other
.name
);
12893 if (result
== 0 && addr
< other
.addr
)
12899 ada_exc_info::operator== (const ada_exc_info
&other
) const
12901 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
12904 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12905 routine, but keeping the first SKIP elements untouched.
12907 All duplicates are also removed. */
12910 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
12913 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
12914 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
12915 exceptions
->end ());
12918 /* Add all exceptions defined by the Ada standard whose name match
12919 a regular expression.
12921 If PREG is not NULL, then this regexp_t object is used to
12922 perform the symbol name matching. Otherwise, no name-based
12923 filtering is performed.
12925 EXCEPTIONS is a vector of exceptions to which matching exceptions
12929 ada_add_standard_exceptions (compiled_regex
*preg
,
12930 std::vector
<ada_exc_info
> *exceptions
)
12934 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12937 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
12939 struct bound_minimal_symbol msymbol
12940 = ada_lookup_simple_minsym (standard_exc
[i
]);
12942 if (msymbol
.minsym
!= NULL
)
12944 struct ada_exc_info info
12945 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12947 exceptions
->push_back (info
);
12953 /* Add all Ada exceptions defined locally and accessible from the given
12956 If PREG is not NULL, then this regexp_t object is used to
12957 perform the symbol name matching. Otherwise, no name-based
12958 filtering is performed.
12960 EXCEPTIONS is a vector of exceptions to which matching exceptions
12964 ada_add_exceptions_from_frame (compiled_regex
*preg
,
12965 struct frame_info
*frame
,
12966 std::vector
<ada_exc_info
> *exceptions
)
12968 const struct block
*block
= get_frame_block (frame
, 0);
12972 struct block_iterator iter
;
12973 struct symbol
*sym
;
12975 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12977 switch (SYMBOL_CLASS (sym
))
12984 if (ada_is_exception_sym (sym
))
12986 struct ada_exc_info info
= {sym
->print_name (),
12987 SYMBOL_VALUE_ADDRESS (sym
)};
12989 exceptions
->push_back (info
);
12993 if (BLOCK_FUNCTION (block
) != NULL
)
12995 block
= BLOCK_SUPERBLOCK (block
);
12999 /* Return true if NAME matches PREG or if PREG is NULL. */
13002 name_matches_regex (const char *name
, compiled_regex
*preg
)
13004 return (preg
== NULL
13005 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13008 /* Add all exceptions defined globally whose name name match
13009 a regular expression, excluding standard exceptions.
13011 The reason we exclude standard exceptions is that they need
13012 to be handled separately: Standard exceptions are defined inside
13013 a runtime unit which is normally not compiled with debugging info,
13014 and thus usually do not show up in our symbol search. However,
13015 if the unit was in fact built with debugging info, we need to
13016 exclude them because they would duplicate the entry we found
13017 during the special loop that specifically searches for those
13018 standard exceptions.
13020 If PREG is not NULL, then this regexp_t object is used to
13021 perform the symbol name matching. Otherwise, no name-based
13022 filtering is performed.
13024 EXCEPTIONS is a vector of exceptions to which matching exceptions
13028 ada_add_global_exceptions (compiled_regex
*preg
,
13029 std::vector
<ada_exc_info
> *exceptions
)
13031 /* In Ada, the symbol "search name" is a linkage name, whereas the
13032 regular expression used to do the matching refers to the natural
13033 name. So match against the decoded name. */
13034 expand_symtabs_matching (NULL
,
13035 lookup_name_info::match_any (),
13036 [&] (const char *search_name
)
13038 std::string decoded
= ada_decode (search_name
);
13039 return name_matches_regex (decoded
.c_str (), preg
);
13044 for (objfile
*objfile
: current_program_space
->objfiles ())
13046 for (compunit_symtab
*s
: objfile
->compunits ())
13048 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13051 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13053 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13054 struct block_iterator iter
;
13055 struct symbol
*sym
;
13057 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13058 if (ada_is_non_standard_exception_sym (sym
)
13059 && name_matches_regex (sym
->natural_name (), preg
))
13061 struct ada_exc_info info
13062 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13064 exceptions
->push_back (info
);
13071 /* Implements ada_exceptions_list with the regular expression passed
13072 as a regex_t, rather than a string.
13074 If not NULL, PREG is used to filter out exceptions whose names
13075 do not match. Otherwise, all exceptions are listed. */
13077 static std::vector
<ada_exc_info
>
13078 ada_exceptions_list_1 (compiled_regex
*preg
)
13080 std::vector
<ada_exc_info
> result
;
13083 /* First, list the known standard exceptions. These exceptions
13084 need to be handled separately, as they are usually defined in
13085 runtime units that have been compiled without debugging info. */
13087 ada_add_standard_exceptions (preg
, &result
);
13089 /* Next, find all exceptions whose scope is local and accessible
13090 from the currently selected frame. */
13092 if (has_stack_frames ())
13094 prev_len
= result
.size ();
13095 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13097 if (result
.size () > prev_len
)
13098 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13101 /* Add all exceptions whose scope is global. */
13103 prev_len
= result
.size ();
13104 ada_add_global_exceptions (preg
, &result
);
13105 if (result
.size () > prev_len
)
13106 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13111 /* Return a vector of ada_exc_info.
13113 If REGEXP is NULL, all exceptions are included in the result.
13114 Otherwise, it should contain a valid regular expression,
13115 and only the exceptions whose names match that regular expression
13116 are included in the result.
13118 The exceptions are sorted in the following order:
13119 - Standard exceptions (defined by the Ada language), in
13120 alphabetical order;
13121 - Exceptions only visible from the current frame, in
13122 alphabetical order;
13123 - Exceptions whose scope is global, in alphabetical order. */
13125 std::vector
<ada_exc_info
>
13126 ada_exceptions_list (const char *regexp
)
13128 if (regexp
== NULL
)
13129 return ada_exceptions_list_1 (NULL
);
13131 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13132 return ada_exceptions_list_1 (®
);
13135 /* Implement the "info exceptions" command. */
13138 info_exceptions_command (const char *regexp
, int from_tty
)
13140 struct gdbarch
*gdbarch
= get_current_arch ();
13142 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13144 if (regexp
!= NULL
)
13146 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13148 printf_filtered (_("All defined Ada exceptions:\n"));
13150 for (const ada_exc_info
&info
: exceptions
)
13151 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13155 /* Information about operators given special treatment in functions
13157 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13159 #define ADA_OPERATORS \
13160 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13161 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13162 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13163 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13164 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13165 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13166 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13167 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13168 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13169 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13170 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13171 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13172 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13173 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13174 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13175 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13176 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13177 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13178 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13181 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13184 switch (exp
->elts
[pc
- 1].opcode
)
13187 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13190 #define OP_DEFN(op, len, args, binop) \
13191 case op: *oplenp = len; *argsp = args; break;
13197 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13202 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13207 /* Implementation of the exp_descriptor method operator_check. */
13210 ada_operator_check (struct expression
*exp
, int pos
,
13211 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13214 const union exp_element
*const elts
= exp
->elts
;
13215 struct type
*type
= NULL
;
13217 switch (elts
[pos
].opcode
)
13219 case UNOP_IN_RANGE
:
13221 type
= elts
[pos
+ 1].type
;
13225 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13228 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13230 if (type
!= nullptr && type
->objfile_owner () != nullptr
13231 && objfile_func (type
->objfile_owner (), data
))
13237 /* As for operator_length, but assumes PC is pointing at the first
13238 element of the operator, and gives meaningful results only for the
13239 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13242 ada_forward_operator_length (struct expression
*exp
, int pc
,
13243 int *oplenp
, int *argsp
)
13245 switch (exp
->elts
[pc
].opcode
)
13248 *oplenp
= *argsp
= 0;
13251 #define OP_DEFN(op, len, args, binop) \
13252 case op: *oplenp = len; *argsp = args; break;
13258 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13263 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13269 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13271 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13279 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13281 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13286 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13290 /* Ada attributes ('Foo). */
13293 case OP_ATR_LENGTH
:
13297 case OP_ATR_MODULUS
:
13304 case UNOP_IN_RANGE
:
13306 /* XXX: gdb_sprint_host_address, type_sprint */
13307 fprintf_filtered (stream
, _("Type @"));
13308 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13309 fprintf_filtered (stream
, " (");
13310 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13311 fprintf_filtered (stream
, ")");
13313 case BINOP_IN_BOUNDS
:
13314 fprintf_filtered (stream
, " (%d)",
13315 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13317 case TERNOP_IN_RANGE
:
13322 case OP_DISCRETE_RANGE
:
13323 case OP_POSITIONAL
:
13330 char *name
= &exp
->elts
[elt
+ 2].string
;
13331 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13333 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13338 return dump_subexp_body_standard (exp
, stream
, elt
);
13342 for (i
= 0; i
< nargs
; i
+= 1)
13343 elt
= dump_subexp (exp
, stream
, elt
);
13348 /* The Ada extension of print_subexp (q.v.). */
13351 ada_print_subexp (struct expression
*exp
, int *pos
,
13352 struct ui_file
*stream
, enum precedence prec
)
13354 int oplen
, nargs
, i
;
13356 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13358 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13365 print_subexp_standard (exp
, pos
, stream
, prec
);
13369 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13372 case BINOP_IN_BOUNDS
:
13373 /* XXX: sprint_subexp */
13374 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13375 fputs_filtered (" in ", stream
);
13376 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13377 fputs_filtered ("'range", stream
);
13378 if (exp
->elts
[pc
+ 1].longconst
> 1)
13379 fprintf_filtered (stream
, "(%ld)",
13380 (long) exp
->elts
[pc
+ 1].longconst
);
13383 case TERNOP_IN_RANGE
:
13384 if (prec
>= PREC_EQUAL
)
13385 fputs_filtered ("(", stream
);
13386 /* XXX: sprint_subexp */
13387 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13388 fputs_filtered (" in ", stream
);
13389 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13390 fputs_filtered (" .. ", stream
);
13391 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13392 if (prec
>= PREC_EQUAL
)
13393 fputs_filtered (")", stream
);
13398 case OP_ATR_LENGTH
:
13402 case OP_ATR_MODULUS
:
13407 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13409 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13410 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13411 &type_print_raw_options
);
13415 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13416 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13421 for (tem
= 1; tem
< nargs
; tem
+= 1)
13423 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13424 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13426 fputs_filtered (")", stream
);
13431 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13432 fputs_filtered ("'(", stream
);
13433 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13434 fputs_filtered (")", stream
);
13437 case UNOP_IN_RANGE
:
13438 /* XXX: sprint_subexp */
13439 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13440 fputs_filtered (" in ", stream
);
13441 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13442 &type_print_raw_options
);
13445 case OP_DISCRETE_RANGE
:
13446 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13447 fputs_filtered ("..", stream
);
13448 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13452 fputs_filtered ("others => ", stream
);
13453 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13457 for (i
= 0; i
< nargs
-1; i
+= 1)
13460 fputs_filtered ("|", stream
);
13461 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13463 fputs_filtered (" => ", stream
);
13464 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13467 case OP_POSITIONAL
:
13468 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13472 fputs_filtered ("(", stream
);
13473 for (i
= 0; i
< nargs
; i
+= 1)
13476 fputs_filtered (", ", stream
);
13477 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13479 fputs_filtered (")", stream
);
13484 /* Table mapping opcodes into strings for printing operators
13485 and precedences of the operators. */
13487 static const struct op_print ada_op_print_tab
[] = {
13488 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13489 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13490 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13491 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13492 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13493 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13494 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13495 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13496 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13497 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13498 {">", BINOP_GTR
, PREC_ORDER
, 0},
13499 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13500 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13501 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13502 {"+", BINOP_ADD
, PREC_ADD
, 0},
13503 {"-", BINOP_SUB
, PREC_ADD
, 0},
13504 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13505 {"*", BINOP_MUL
, PREC_MUL
, 0},
13506 {"/", BINOP_DIV
, PREC_MUL
, 0},
13507 {"rem", BINOP_REM
, PREC_MUL
, 0},
13508 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13509 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13510 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13511 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13512 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13513 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13514 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13515 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13516 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13517 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13518 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13519 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13522 /* Language vector */
13524 static const struct exp_descriptor ada_exp_descriptor
= {
13526 ada_operator_length
,
13527 ada_operator_check
,
13528 ada_dump_subexp_body
,
13529 ada_evaluate_subexp
13532 /* symbol_name_matcher_ftype adapter for wild_match. */
13535 do_wild_match (const char *symbol_search_name
,
13536 const lookup_name_info
&lookup_name
,
13537 completion_match_result
*comp_match_res
)
13539 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13542 /* symbol_name_matcher_ftype adapter for full_match. */
13545 do_full_match (const char *symbol_search_name
,
13546 const lookup_name_info
&lookup_name
,
13547 completion_match_result
*comp_match_res
)
13549 const char *lname
= lookup_name
.ada ().lookup_name ().c_str ();
13551 /* If both symbols start with "_ada_", just let the loop below
13552 handle the comparison. However, if only the symbol name starts
13553 with "_ada_", skip the prefix and let the match proceed as
13555 if (startswith (symbol_search_name
, "_ada_")
13556 && !startswith (lname
, "_ada"))
13557 symbol_search_name
+= 5;
13559 int uscore_count
= 0;
13560 while (*lname
!= '\0')
13562 if (*symbol_search_name
!= *lname
)
13564 if (*symbol_search_name
== 'B' && uscore_count
== 2
13565 && symbol_search_name
[1] == '_')
13567 symbol_search_name
+= 2;
13568 while (isdigit (*symbol_search_name
))
13569 ++symbol_search_name
;
13570 if (symbol_search_name
[0] == '_'
13571 && symbol_search_name
[1] == '_')
13573 symbol_search_name
+= 2;
13580 if (*symbol_search_name
== '_')
13585 ++symbol_search_name
;
13589 return is_name_suffix (symbol_search_name
);
13592 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13595 do_exact_match (const char *symbol_search_name
,
13596 const lookup_name_info
&lookup_name
,
13597 completion_match_result
*comp_match_res
)
13599 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13602 /* Build the Ada lookup name for LOOKUP_NAME. */
13604 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13606 gdb::string_view user_name
= lookup_name
.name ();
13608 if (!user_name
.empty () && user_name
[0] == '<')
13610 if (user_name
.back () == '>')
13612 = gdb::to_string (user_name
.substr (1, user_name
.size () - 2));
13615 = gdb::to_string (user_name
.substr (1, user_name
.size () - 1));
13616 m_encoded_p
= true;
13617 m_verbatim_p
= true;
13618 m_wild_match_p
= false;
13619 m_standard_p
= false;
13623 m_verbatim_p
= false;
13625 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13629 const char *folded
= ada_fold_name (user_name
);
13630 m_encoded_name
= ada_encode_1 (folded
, false);
13631 if (m_encoded_name
.empty ())
13632 m_encoded_name
= gdb::to_string (user_name
);
13635 m_encoded_name
= gdb::to_string (user_name
);
13637 /* Handle the 'package Standard' special case. See description
13638 of m_standard_p. */
13639 if (startswith (m_encoded_name
.c_str (), "standard__"))
13641 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13642 m_standard_p
= true;
13645 m_standard_p
= false;
13647 /* If the name contains a ".", then the user is entering a fully
13648 qualified entity name, and the match must not be done in wild
13649 mode. Similarly, if the user wants to complete what looks
13650 like an encoded name, the match must not be done in wild
13651 mode. Also, in the standard__ special case always do
13652 non-wild matching. */
13654 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13657 && user_name
.find ('.') == std::string::npos
);
13661 /* symbol_name_matcher_ftype method for Ada. This only handles
13662 completion mode. */
13665 ada_symbol_name_matches (const char *symbol_search_name
,
13666 const lookup_name_info
&lookup_name
,
13667 completion_match_result
*comp_match_res
)
13669 return lookup_name
.ada ().matches (symbol_search_name
,
13670 lookup_name
.match_type (),
13674 /* A name matcher that matches the symbol name exactly, with
13678 literal_symbol_name_matcher (const char *symbol_search_name
,
13679 const lookup_name_info
&lookup_name
,
13680 completion_match_result
*comp_match_res
)
13682 gdb::string_view name_view
= lookup_name
.name ();
13684 if (lookup_name
.completion_mode ()
13685 ? (strncmp (symbol_search_name
, name_view
.data (),
13686 name_view
.size ()) == 0)
13687 : symbol_search_name
== name_view
)
13689 if (comp_match_res
!= NULL
)
13690 comp_match_res
->set_match (symbol_search_name
);
13697 /* Implement the "get_symbol_name_matcher" language_defn method for
13700 static symbol_name_matcher_ftype
*
13701 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
13703 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
13704 return literal_symbol_name_matcher
;
13706 if (lookup_name
.completion_mode ())
13707 return ada_symbol_name_matches
;
13710 if (lookup_name
.ada ().wild_match_p ())
13711 return do_wild_match
;
13712 else if (lookup_name
.ada ().verbatim_p ())
13713 return do_exact_match
;
13715 return do_full_match
;
13719 /* Class representing the Ada language. */
13721 class ada_language
: public language_defn
13725 : language_defn (language_ada
)
13728 /* See language.h. */
13730 const char *name () const override
13733 /* See language.h. */
13735 const char *natural_name () const override
13738 /* See language.h. */
13740 const std::vector
<const char *> &filename_extensions () const override
13742 static const std::vector
<const char *> extensions
13743 = { ".adb", ".ads", ".a", ".ada", ".dg" };
13747 /* Print an array element index using the Ada syntax. */
13749 void print_array_index (struct type
*index_type
,
13751 struct ui_file
*stream
,
13752 const value_print_options
*options
) const override
13754 struct value
*index_value
= val_atr (index_type
, index
);
13756 value_print (index_value
, stream
, options
);
13757 fprintf_filtered (stream
, " => ");
13760 /* Implement the "read_var_value" language_defn method for Ada. */
13762 struct value
*read_var_value (struct symbol
*var
,
13763 const struct block
*var_block
,
13764 struct frame_info
*frame
) const override
13766 /* The only case where default_read_var_value is not sufficient
13767 is when VAR is a renaming... */
13768 if (frame
!= nullptr)
13770 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
13771 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
13772 return ada_read_renaming_var_value (var
, frame_block
);
13775 /* This is a typical case where we expect the default_read_var_value
13776 function to work. */
13777 return language_defn::read_var_value (var
, var_block
, frame
);
13780 /* See language.h. */
13781 void language_arch_info (struct gdbarch
*gdbarch
,
13782 struct language_arch_info
*lai
) const override
13784 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13786 /* Helper function to allow shorter lines below. */
13787 auto add
= [&] (struct type
*t
)
13789 lai
->add_primitive_type (t
);
13792 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13794 add (arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13795 0, "long_integer"));
13796 add (arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13797 0, "short_integer"));
13798 struct type
*char_type
= arch_character_type (gdbarch
, TARGET_CHAR_BIT
,
13800 lai
->set_string_char_type (char_type
);
13802 add (arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13803 "float", gdbarch_float_format (gdbarch
)));
13804 add (arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13805 "long_float", gdbarch_double_format (gdbarch
)));
13806 add (arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13807 0, "long_long_integer"));
13808 add (arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13810 gdbarch_long_double_format (gdbarch
)));
13811 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13813 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13815 add (builtin
->builtin_void
);
13817 struct type
*system_addr_ptr
13818 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13820 system_addr_ptr
->set_name ("system__address");
13821 add (system_addr_ptr
);
13823 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13824 type. This is a signed integral type whose size is the same as
13825 the size of addresses. */
13826 unsigned int addr_length
= TYPE_LENGTH (system_addr_ptr
);
13827 add (arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13828 "storage_offset"));
13830 lai
->set_bool_type (builtin
->builtin_bool
);
13833 /* See language.h. */
13835 bool iterate_over_symbols
13836 (const struct block
*block
, const lookup_name_info
&name
,
13837 domain_enum domain
,
13838 gdb::function_view
<symbol_found_callback_ftype
> callback
) const override
13840 std::vector
<struct block_symbol
> results
13841 = ada_lookup_symbol_list_worker (name
, block
, domain
, 0);
13842 for (block_symbol
&sym
: results
)
13844 if (!callback (&sym
))
13851 /* See language.h. */
13852 bool sniff_from_mangled_name (const char *mangled
,
13853 char **out
) const override
13855 std::string demangled
= ada_decode (mangled
);
13859 if (demangled
!= mangled
&& demangled
[0] != '<')
13861 /* Set the gsymbol language to Ada, but still return 0.
13862 Two reasons for that:
13864 1. For Ada, we prefer computing the symbol's decoded name
13865 on the fly rather than pre-compute it, in order to save
13866 memory (Ada projects are typically very large).
13868 2. There are some areas in the definition of the GNAT
13869 encoding where, with a bit of bad luck, we might be able
13870 to decode a non-Ada symbol, generating an incorrect
13871 demangled name (Eg: names ending with "TB" for instance
13872 are identified as task bodies and so stripped from
13873 the decoded name returned).
13875 Returning true, here, but not setting *DEMANGLED, helps us get
13876 a little bit of the best of both worlds. Because we're last,
13877 we should not affect any of the other languages that were
13878 able to demangle the symbol before us; we get to correctly
13879 tag Ada symbols as such; and even if we incorrectly tagged a
13880 non-Ada symbol, which should be rare, any routing through the
13881 Ada language should be transparent (Ada tries to behave much
13882 like C/C++ with non-Ada symbols). */
13889 /* See language.h. */
13891 char *demangle_symbol (const char *mangled
, int options
) const override
13893 return ada_la_decode (mangled
, options
);
13896 /* See language.h. */
13898 void print_type (struct type
*type
, const char *varstring
,
13899 struct ui_file
*stream
, int show
, int level
,
13900 const struct type_print_options
*flags
) const override
13902 ada_print_type (type
, varstring
, stream
, show
, level
, flags
);
13905 /* See language.h. */
13907 const char *word_break_characters (void) const override
13909 return ada_completer_word_break_characters
;
13912 /* See language.h. */
13914 void collect_symbol_completion_matches (completion_tracker
&tracker
,
13915 complete_symbol_mode mode
,
13916 symbol_name_match_type name_match_type
,
13917 const char *text
, const char *word
,
13918 enum type_code code
) const override
13920 struct symbol
*sym
;
13921 const struct block
*b
, *surrounding_static_block
= 0;
13922 struct block_iterator iter
;
13924 gdb_assert (code
== TYPE_CODE_UNDEF
);
13926 lookup_name_info
lookup_name (text
, name_match_type
, true);
13928 /* First, look at the partial symtab symbols. */
13929 expand_symtabs_matching (NULL
,
13935 /* At this point scan through the misc symbol vectors and add each
13936 symbol you find to the list. Eventually we want to ignore
13937 anything that isn't a text symbol (everything else will be
13938 handled by the psymtab code above). */
13940 for (objfile
*objfile
: current_program_space
->objfiles ())
13942 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
13946 if (completion_skip_symbol (mode
, msymbol
))
13949 language symbol_language
= msymbol
->language ();
13951 /* Ada minimal symbols won't have their language set to Ada. If
13952 we let completion_list_add_name compare using the
13953 default/C-like matcher, then when completing e.g., symbols in a
13954 package named "pck", we'd match internal Ada symbols like
13955 "pckS", which are invalid in an Ada expression, unless you wrap
13956 them in '<' '>' to request a verbatim match.
13958 Unfortunately, some Ada encoded names successfully demangle as
13959 C++ symbols (using an old mangling scheme), such as "name__2Xn"
13960 -> "Xn::name(void)" and thus some Ada minimal symbols end up
13961 with the wrong language set. Paper over that issue here. */
13962 if (symbol_language
== language_auto
13963 || symbol_language
== language_cplus
)
13964 symbol_language
= language_ada
;
13966 completion_list_add_name (tracker
,
13968 msymbol
->linkage_name (),
13969 lookup_name
, text
, word
);
13973 /* Search upwards from currently selected frame (so that we can
13974 complete on local vars. */
13976 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
13978 if (!BLOCK_SUPERBLOCK (b
))
13979 surrounding_static_block
= b
; /* For elmin of dups */
13981 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13983 if (completion_skip_symbol (mode
, sym
))
13986 completion_list_add_name (tracker
,
13988 sym
->linkage_name (),
13989 lookup_name
, text
, word
);
13993 /* Go through the symtabs and check the externs and statics for
13994 symbols which match. */
13996 for (objfile
*objfile
: current_program_space
->objfiles ())
13998 for (compunit_symtab
*s
: objfile
->compunits ())
14001 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
14002 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14004 if (completion_skip_symbol (mode
, sym
))
14007 completion_list_add_name (tracker
,
14009 sym
->linkage_name (),
14010 lookup_name
, text
, word
);
14015 for (objfile
*objfile
: current_program_space
->objfiles ())
14017 for (compunit_symtab
*s
: objfile
->compunits ())
14020 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
14021 /* Don't do this block twice. */
14022 if (b
== surrounding_static_block
)
14024 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14026 if (completion_skip_symbol (mode
, sym
))
14029 completion_list_add_name (tracker
,
14031 sym
->linkage_name (),
14032 lookup_name
, text
, word
);
14038 /* See language.h. */
14040 gdb::unique_xmalloc_ptr
<char> watch_location_expression
14041 (struct type
*type
, CORE_ADDR addr
) const override
14043 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
14044 std::string name
= type_to_string (type
);
14045 return gdb::unique_xmalloc_ptr
<char>
14046 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
14049 /* See language.h. */
14051 void value_print (struct value
*val
, struct ui_file
*stream
,
14052 const struct value_print_options
*options
) const override
14054 return ada_value_print (val
, stream
, options
);
14057 /* See language.h. */
14059 void value_print_inner
14060 (struct value
*val
, struct ui_file
*stream
, int recurse
,
14061 const struct value_print_options
*options
) const override
14063 return ada_value_print_inner (val
, stream
, recurse
, options
);
14066 /* See language.h. */
14068 struct block_symbol lookup_symbol_nonlocal
14069 (const char *name
, const struct block
*block
,
14070 const domain_enum domain
) const override
14072 struct block_symbol sym
;
14074 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
14075 if (sym
.symbol
!= NULL
)
14078 /* If we haven't found a match at this point, try the primitive
14079 types. In other languages, this search is performed before
14080 searching for global symbols in order to short-circuit that
14081 global-symbol search if it happens that the name corresponds
14082 to a primitive type. But we cannot do the same in Ada, because
14083 it is perfectly legitimate for a program to declare a type which
14084 has the same name as a standard type. If looking up a type in
14085 that situation, we have traditionally ignored the primitive type
14086 in favor of user-defined types. This is why, unlike most other
14087 languages, we search the primitive types this late and only after
14088 having searched the global symbols without success. */
14090 if (domain
== VAR_DOMAIN
)
14092 struct gdbarch
*gdbarch
;
14095 gdbarch
= target_gdbarch ();
14097 gdbarch
= block_gdbarch (block
);
14099 = language_lookup_primitive_type_as_symbol (this, gdbarch
, name
);
14100 if (sym
.symbol
!= NULL
)
14107 /* See language.h. */
14109 int parser (struct parser_state
*ps
) const override
14111 warnings_issued
= 0;
14112 return ada_parse (ps
);
14117 Same as evaluate_type (*EXP), but resolves ambiguous symbol references
14118 (marked by OP_VAR_VALUE nodes in which the symbol has an undefined
14119 namespace) and converts operators that are user-defined into
14120 appropriate function calls. If CONTEXT_TYPE is non-null, it provides
14121 a preferred result type [at the moment, only type void has any
14122 effect---causing procedures to be preferred over functions in calls].
14123 A null CONTEXT_TYPE indicates that a non-void return type is
14124 preferred. May change (expand) *EXP. */
14126 void post_parser (expression_up
*expp
, struct parser_state
*ps
)
14129 struct type
*context_type
= NULL
;
14132 if (ps
->void_context_p
)
14133 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
14135 resolve_subexp (expp
, &pc
, 1, context_type
, ps
->parse_completion
,
14136 ps
->block_tracker
);
14139 /* See language.h. */
14141 void emitchar (int ch
, struct type
*chtype
,
14142 struct ui_file
*stream
, int quoter
) const override
14144 ada_emit_char (ch
, chtype
, stream
, quoter
, 1);
14147 /* See language.h. */
14149 void printchar (int ch
, struct type
*chtype
,
14150 struct ui_file
*stream
) const override
14152 ada_printchar (ch
, chtype
, stream
);
14155 /* See language.h. */
14157 void printstr (struct ui_file
*stream
, struct type
*elttype
,
14158 const gdb_byte
*string
, unsigned int length
,
14159 const char *encoding
, int force_ellipses
,
14160 const struct value_print_options
*options
) const override
14162 ada_printstr (stream
, elttype
, string
, length
, encoding
,
14163 force_ellipses
, options
);
14166 /* See language.h. */
14168 void print_typedef (struct type
*type
, struct symbol
*new_symbol
,
14169 struct ui_file
*stream
) const override
14171 ada_print_typedef (type
, new_symbol
, stream
);
14174 /* See language.h. */
14176 bool is_string_type_p (struct type
*type
) const override
14178 return ada_is_string_type (type
);
14181 /* See language.h. */
14183 const char *struct_too_deep_ellipsis () const override
14184 { return "(...)"; }
14186 /* See language.h. */
14188 bool c_style_arrays_p () const override
14191 /* See language.h. */
14193 bool store_sym_names_in_linkage_form_p () const override
14196 /* See language.h. */
14198 const struct lang_varobj_ops
*varobj_ops () const override
14199 { return &ada_varobj_ops
; }
14201 /* See language.h. */
14203 const struct exp_descriptor
*expression_ops () const override
14204 { return &ada_exp_descriptor
; }
14206 /* See language.h. */
14208 const struct op_print
*opcode_print_table () const override
14209 { return ada_op_print_tab
; }
14212 /* See language.h. */
14214 symbol_name_matcher_ftype
*get_symbol_name_matcher_inner
14215 (const lookup_name_info
&lookup_name
) const override
14217 return ada_get_symbol_name_matcher (lookup_name
);
14221 /* Single instance of the Ada language class. */
14223 static ada_language ada_language_defn
;
14225 /* Command-list for the "set/show ada" prefix command. */
14226 static struct cmd_list_element
*set_ada_list
;
14227 static struct cmd_list_element
*show_ada_list
;
14230 initialize_ada_catchpoint_ops (void)
14232 struct breakpoint_ops
*ops
;
14234 initialize_breakpoint_ops ();
14236 ops
= &catch_exception_breakpoint_ops
;
14237 *ops
= bkpt_breakpoint_ops
;
14238 ops
->allocate_location
= allocate_location_exception
;
14239 ops
->re_set
= re_set_exception
;
14240 ops
->check_status
= check_status_exception
;
14241 ops
->print_it
= print_it_exception
;
14242 ops
->print_one
= print_one_exception
;
14243 ops
->print_mention
= print_mention_exception
;
14244 ops
->print_recreate
= print_recreate_exception
;
14246 ops
= &catch_exception_unhandled_breakpoint_ops
;
14247 *ops
= bkpt_breakpoint_ops
;
14248 ops
->allocate_location
= allocate_location_exception
;
14249 ops
->re_set
= re_set_exception
;
14250 ops
->check_status
= check_status_exception
;
14251 ops
->print_it
= print_it_exception
;
14252 ops
->print_one
= print_one_exception
;
14253 ops
->print_mention
= print_mention_exception
;
14254 ops
->print_recreate
= print_recreate_exception
;
14256 ops
= &catch_assert_breakpoint_ops
;
14257 *ops
= bkpt_breakpoint_ops
;
14258 ops
->allocate_location
= allocate_location_exception
;
14259 ops
->re_set
= re_set_exception
;
14260 ops
->check_status
= check_status_exception
;
14261 ops
->print_it
= print_it_exception
;
14262 ops
->print_one
= print_one_exception
;
14263 ops
->print_mention
= print_mention_exception
;
14264 ops
->print_recreate
= print_recreate_exception
;
14266 ops
= &catch_handlers_breakpoint_ops
;
14267 *ops
= bkpt_breakpoint_ops
;
14268 ops
->allocate_location
= allocate_location_exception
;
14269 ops
->re_set
= re_set_exception
;
14270 ops
->check_status
= check_status_exception
;
14271 ops
->print_it
= print_it_exception
;
14272 ops
->print_one
= print_one_exception
;
14273 ops
->print_mention
= print_mention_exception
;
14274 ops
->print_recreate
= print_recreate_exception
;
14277 /* This module's 'new_objfile' observer. */
14280 ada_new_objfile_observer (struct objfile
*objfile
)
14282 ada_clear_symbol_cache ();
14285 /* This module's 'free_objfile' observer. */
14288 ada_free_objfile_observer (struct objfile
*objfile
)
14290 ada_clear_symbol_cache ();
14293 void _initialize_ada_language ();
14295 _initialize_ada_language ()
14297 initialize_ada_catchpoint_ops ();
14299 add_basic_prefix_cmd ("ada", no_class
,
14300 _("Prefix command for changing Ada-specific settings."),
14301 &set_ada_list
, "set ada ", 0, &setlist
);
14303 add_show_prefix_cmd ("ada", no_class
,
14304 _("Generic command for showing Ada-specific settings."),
14305 &show_ada_list
, "show ada ", 0, &showlist
);
14307 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14308 &trust_pad_over_xvs
, _("\
14309 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14310 Show whether an optimization trusting PAD types over XVS types is activated."),
14312 This is related to the encoding used by the GNAT compiler. The debugger\n\
14313 should normally trust the contents of PAD types, but certain older versions\n\
14314 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14315 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14316 work around this bug. It is always safe to turn this option \"off\", but\n\
14317 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14318 this option to \"off\" unless necessary."),
14319 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14321 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14322 &print_signatures
, _("\
14323 Enable or disable the output of formal and return types for functions in the \
14324 overloads selection menu."), _("\
14325 Show whether the output of formal and return types for functions in the \
14326 overloads selection menu is activated."),
14327 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14329 add_catch_command ("exception", _("\
14330 Catch Ada exceptions, when raised.\n\
14331 Usage: catch exception [ARG] [if CONDITION]\n\
14332 Without any argument, stop when any Ada exception is raised.\n\
14333 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14334 being raised does not have a handler (and will therefore lead to the task's\n\
14336 Otherwise, the catchpoint only stops when the name of the exception being\n\
14337 raised is the same as ARG.\n\
14338 CONDITION is a boolean expression that is evaluated to see whether the\n\
14339 exception should cause a stop."),
14340 catch_ada_exception_command
,
14341 catch_ada_completer
,
14345 add_catch_command ("handlers", _("\
14346 Catch Ada exceptions, when handled.\n\
14347 Usage: catch handlers [ARG] [if CONDITION]\n\
14348 Without any argument, stop when any Ada exception is handled.\n\
14349 With an argument, catch only exceptions with the given name.\n\
14350 CONDITION is a boolean expression that is evaluated to see whether the\n\
14351 exception should cause a stop."),
14352 catch_ada_handlers_command
,
14353 catch_ada_completer
,
14356 add_catch_command ("assert", _("\
14357 Catch failed Ada assertions, when raised.\n\
14358 Usage: catch assert [if CONDITION]\n\
14359 CONDITION is a boolean expression that is evaluated to see whether the\n\
14360 exception should cause a stop."),
14361 catch_assert_command
,
14366 varsize_limit
= 65536;
14367 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14368 &varsize_limit
, _("\
14369 Set the maximum number of bytes allowed in a variable-size object."), _("\
14370 Show the maximum number of bytes allowed in a variable-size object."), _("\
14371 Attempts to access an object whose size is not a compile-time constant\n\
14372 and exceeds this limit will cause an error."),
14373 NULL
, NULL
, &setlist
, &showlist
);
14375 add_info ("exceptions", info_exceptions_command
,
14377 List all Ada exception names.\n\
14378 Usage: info exceptions [REGEXP]\n\
14379 If a regular expression is passed as an argument, only those matching\n\
14380 the regular expression are listed."));
14382 add_basic_prefix_cmd ("ada", class_maintenance
,
14383 _("Set Ada maintenance-related variables."),
14384 &maint_set_ada_cmdlist
, "maintenance set ada ",
14385 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14387 add_show_prefix_cmd ("ada", class_maintenance
,
14388 _("Show Ada maintenance-related variables."),
14389 &maint_show_ada_cmdlist
, "maintenance show ada ",
14390 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14392 add_setshow_boolean_cmd
14393 ("ignore-descriptive-types", class_maintenance
,
14394 &ada_ignore_descriptive_types_p
,
14395 _("Set whether descriptive types generated by GNAT should be ignored."),
14396 _("Show whether descriptive types generated by GNAT should be ignored."),
14398 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14399 DWARF attribute."),
14400 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14402 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14403 NULL
, xcalloc
, xfree
);
14405 /* The ada-lang observers. */
14406 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14407 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14408 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);