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"
61 /* Define whether or not the C operator '/' truncates towards zero for
62 differently signed operands (truncation direction is undefined in C).
63 Copied from valarith.c. */
65 #ifndef TRUNCATION_TOWARDS_ZERO
66 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
69 static struct type
*desc_base_type (struct type
*);
71 static struct type
*desc_bounds_type (struct type
*);
73 static struct value
*desc_bounds (struct value
*);
75 static int fat_pntr_bounds_bitpos (struct type
*);
77 static int fat_pntr_bounds_bitsize (struct type
*);
79 static struct type
*desc_data_target_type (struct type
*);
81 static struct value
*desc_data (struct value
*);
83 static int fat_pntr_data_bitpos (struct type
*);
85 static int fat_pntr_data_bitsize (struct type
*);
87 static struct value
*desc_one_bound (struct value
*, int, int);
89 static int desc_bound_bitpos (struct type
*, int, int);
91 static int desc_bound_bitsize (struct type
*, int, int);
93 static struct type
*desc_index_type (struct type
*, int);
95 static int desc_arity (struct type
*);
97 static int ada_type_match (struct type
*, struct type
*, int);
99 static int ada_args_match (struct symbol
*, struct value
**, int);
101 static struct value
*make_array_descriptor (struct type
*, struct value
*);
103 static void ada_add_block_symbols (std::vector
<struct block_symbol
> &,
104 const struct block
*,
105 const lookup_name_info
&lookup_name
,
106 domain_enum
, struct objfile
*);
108 static void ada_add_all_symbols (std::vector
<struct block_symbol
> &,
109 const struct block
*,
110 const lookup_name_info
&lookup_name
,
111 domain_enum
, int, int *);
113 static int is_nonfunction (const std::vector
<struct block_symbol
> &);
115 static void add_defn_to_vec (std::vector
<struct block_symbol
> &,
117 const struct block
*);
119 static struct value
*resolve_subexp (expression_up
*, int *, int,
121 innermost_block_tracker
*);
123 static void replace_operator_with_call (expression_up
*, int, int, int,
124 struct symbol
*, const struct block
*);
126 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
128 static const char *ada_decoded_op_name (enum exp_opcode
);
130 static int numeric_type_p (struct type
*);
132 static int integer_type_p (struct type
*);
134 static int scalar_type_p (struct type
*);
136 static int discrete_type_p (struct type
*);
138 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
141 static struct value
*evaluate_subexp_type (struct expression
*, int *);
143 static struct type
*ada_find_parallel_type_with_name (struct type
*,
146 static int is_dynamic_field (struct type
*, int);
148 static struct type
*to_fixed_variant_branch_type (struct type
*,
150 CORE_ADDR
, struct value
*);
152 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
154 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
156 static struct type
*to_static_fixed_type (struct type
*);
157 static struct type
*static_unwrap_type (struct type
*type
);
159 static struct value
*unwrap_value (struct value
*);
161 static struct type
*constrained_packed_array_type (struct type
*, long *);
163 static struct type
*decode_constrained_packed_array_type (struct type
*);
165 static long decode_packed_array_bitsize (struct type
*);
167 static struct value
*decode_constrained_packed_array (struct value
*);
169 static int ada_is_unconstrained_packed_array_type (struct type
*);
171 static struct value
*value_subscript_packed (struct value
*, int,
174 static struct value
*coerce_unspec_val_to_type (struct value
*,
177 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
179 static int equiv_types (struct type
*, struct type
*);
181 static int is_name_suffix (const char *);
183 static int advance_wild_match (const char **, const char *, char);
185 static bool wild_match (const char *name
, const char *patn
);
187 static struct value
*ada_coerce_ref (struct value
*);
189 static LONGEST
pos_atr (struct value
*);
191 static struct value
*value_pos_atr (struct type
*, struct value
*);
193 static struct value
*val_atr (struct type
*, LONGEST
);
195 static struct symbol
*standard_lookup (const char *, const struct block
*,
198 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
201 static int find_struct_field (const char *, struct type
*, int,
202 struct type
**, int *, int *, int *, int *);
204 static int ada_resolve_function (std::vector
<struct block_symbol
> &,
205 struct value
**, int, const char *,
208 static int ada_is_direct_array_type (struct type
*);
210 static struct value
*ada_index_struct_field (int, struct value
*, int,
213 static struct value
*assign_aggregate (struct value
*, struct value
*,
217 static void aggregate_assign_from_choices (struct value
*, struct value
*,
219 int *, std::vector
<LONGEST
> &,
222 static void aggregate_assign_positional (struct value
*, struct value
*,
224 int *, std::vector
<LONGEST
> &,
228 static void aggregate_assign_others (struct value
*, struct value
*,
230 int *, std::vector
<LONGEST
> &,
234 static void add_component_interval (LONGEST
, LONGEST
, std::vector
<LONGEST
> &);
237 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
240 static void ada_forward_operator_length (struct expression
*, int, int *,
243 static struct type
*ada_find_any_type (const char *name
);
245 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
246 (const lookup_name_info
&lookup_name
);
250 /* The result of a symbol lookup to be stored in our symbol cache. */
254 /* The name used to perform the lookup. */
256 /* The namespace used during the lookup. */
258 /* The symbol returned by the lookup, or NULL if no matching symbol
261 /* The block where the symbol was found, or NULL if no matching
263 const struct block
*block
;
264 /* A pointer to the next entry with the same hash. */
265 struct cache_entry
*next
;
268 /* The Ada symbol cache, used to store the result of Ada-mode symbol
269 lookups in the course of executing the user's commands.
271 The cache is implemented using a simple, fixed-sized hash.
272 The size is fixed on the grounds that there are not likely to be
273 all that many symbols looked up during any given session, regardless
274 of the size of the symbol table. If we decide to go to a resizable
275 table, let's just use the stuff from libiberty instead. */
277 #define HASH_SIZE 1009
279 struct ada_symbol_cache
281 /* An obstack used to store the entries in our cache. */
282 struct auto_obstack cache_space
;
284 /* The root of the hash table used to implement our symbol cache. */
285 struct cache_entry
*root
[HASH_SIZE
] {};
288 /* Maximum-sized dynamic type. */
289 static unsigned int varsize_limit
;
291 static const char ada_completer_word_break_characters
[] =
293 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
295 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
298 /* The name of the symbol to use to get the name of the main subprogram. */
299 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
300 = "__gnat_ada_main_program_name";
302 /* Limit on the number of warnings to raise per expression evaluation. */
303 static int warning_limit
= 2;
305 /* Number of warning messages issued; reset to 0 by cleanups after
306 expression evaluation. */
307 static int warnings_issued
= 0;
309 static const char * const known_runtime_file_name_patterns
[] = {
310 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
313 static const char * const known_auxiliary_function_name_patterns
[] = {
314 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
317 /* Maintenance-related settings for this module. */
319 static struct cmd_list_element
*maint_set_ada_cmdlist
;
320 static struct cmd_list_element
*maint_show_ada_cmdlist
;
322 /* The "maintenance ada set/show ignore-descriptive-type" value. */
324 static bool ada_ignore_descriptive_types_p
= false;
326 /* Inferior-specific data. */
328 /* Per-inferior data for this module. */
330 struct ada_inferior_data
332 /* The ada__tags__type_specific_data type, which is used when decoding
333 tagged types. With older versions of GNAT, this type was directly
334 accessible through a component ("tsd") in the object tag. But this
335 is no longer the case, so we cache it for each inferior. */
336 struct type
*tsd_type
= nullptr;
338 /* The exception_support_info data. This data is used to determine
339 how to implement support for Ada exception catchpoints in a given
341 const struct exception_support_info
*exception_info
= nullptr;
344 /* Our key to this module's inferior data. */
345 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
347 /* Return our inferior data for the given inferior (INF).
349 This function always returns a valid pointer to an allocated
350 ada_inferior_data structure. If INF's inferior data has not
351 been previously set, this functions creates a new one with all
352 fields set to zero, sets INF's inferior to it, and then returns
353 a pointer to that newly allocated ada_inferior_data. */
355 static struct ada_inferior_data
*
356 get_ada_inferior_data (struct inferior
*inf
)
358 struct ada_inferior_data
*data
;
360 data
= ada_inferior_data
.get (inf
);
362 data
= ada_inferior_data
.emplace (inf
);
367 /* Perform all necessary cleanups regarding our module's inferior data
368 that is required after the inferior INF just exited. */
371 ada_inferior_exit (struct inferior
*inf
)
373 ada_inferior_data
.clear (inf
);
377 /* program-space-specific data. */
379 /* This module's per-program-space data. */
380 struct ada_pspace_data
382 /* The Ada symbol cache. */
383 std::unique_ptr
<ada_symbol_cache
> sym_cache
;
386 /* Key to our per-program-space data. */
387 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
389 /* Return this module's data for the given program space (PSPACE).
390 If not is found, add a zero'ed one now.
392 This function always returns a valid object. */
394 static struct ada_pspace_data
*
395 get_ada_pspace_data (struct program_space
*pspace
)
397 struct ada_pspace_data
*data
;
399 data
= ada_pspace_data_handle
.get (pspace
);
401 data
= ada_pspace_data_handle
.emplace (pspace
);
408 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
409 all typedef layers have been peeled. Otherwise, return TYPE.
411 Normally, we really expect a typedef type to only have 1 typedef layer.
412 In other words, we really expect the target type of a typedef type to be
413 a non-typedef type. This is particularly true for Ada units, because
414 the language does not have a typedef vs not-typedef distinction.
415 In that respect, the Ada compiler has been trying to eliminate as many
416 typedef definitions in the debugging information, since they generally
417 do not bring any extra information (we still use typedef under certain
418 circumstances related mostly to the GNAT encoding).
420 Unfortunately, we have seen situations where the debugging information
421 generated by the compiler leads to such multiple typedef layers. For
422 instance, consider the following example with stabs:
424 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
425 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
427 This is an error in the debugging information which causes type
428 pck__float_array___XUP to be defined twice, and the second time,
429 it is defined as a typedef of a typedef.
431 This is on the fringe of legality as far as debugging information is
432 concerned, and certainly unexpected. But it is easy to handle these
433 situations correctly, so we can afford to be lenient in this case. */
436 ada_typedef_target_type (struct type
*type
)
438 while (type
->code () == TYPE_CODE_TYPEDEF
)
439 type
= TYPE_TARGET_TYPE (type
);
443 /* Given DECODED_NAME a string holding a symbol name in its
444 decoded form (ie using the Ada dotted notation), returns
445 its unqualified name. */
448 ada_unqualified_name (const char *decoded_name
)
452 /* If the decoded name starts with '<', it means that the encoded
453 name does not follow standard naming conventions, and thus that
454 it is not your typical Ada symbol name. Trying to unqualify it
455 is therefore pointless and possibly erroneous. */
456 if (decoded_name
[0] == '<')
459 result
= strrchr (decoded_name
, '.');
461 result
++; /* Skip the dot... */
463 result
= decoded_name
;
468 /* Return a string starting with '<', followed by STR, and '>'. */
471 add_angle_brackets (const char *str
)
473 return string_printf ("<%s>", str
);
476 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
477 suffix of FIELD_NAME beginning "___". */
480 field_name_match (const char *field_name
, const char *target
)
482 int len
= strlen (target
);
485 (strncmp (field_name
, target
, len
) == 0
486 && (field_name
[len
] == '\0'
487 || (startswith (field_name
+ len
, "___")
488 && strcmp (field_name
+ strlen (field_name
) - 6,
493 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
494 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
495 and return its index. This function also handles fields whose name
496 have ___ suffixes because the compiler sometimes alters their name
497 by adding such a suffix to represent fields with certain constraints.
498 If the field could not be found, return a negative number if
499 MAYBE_MISSING is set. Otherwise raise an error. */
502 ada_get_field_index (const struct type
*type
, const char *field_name
,
506 struct type
*struct_type
= check_typedef ((struct type
*) type
);
508 for (fieldno
= 0; fieldno
< struct_type
->num_fields (); fieldno
++)
509 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
513 error (_("Unable to find field %s in struct %s. Aborting"),
514 field_name
, struct_type
->name ());
519 /* The length of the prefix of NAME prior to any "___" suffix. */
522 ada_name_prefix_len (const char *name
)
528 const char *p
= strstr (name
, "___");
531 return strlen (name
);
537 /* Return non-zero if SUFFIX is a suffix of STR.
538 Return zero if STR is null. */
541 is_suffix (const char *str
, const char *suffix
)
548 len2
= strlen (suffix
);
549 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
552 /* The contents of value VAL, treated as a value of type TYPE. The
553 result is an lval in memory if VAL is. */
555 static struct value
*
556 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
558 type
= ada_check_typedef (type
);
559 if (value_type (val
) == type
)
563 struct value
*result
;
565 /* Make sure that the object size is not unreasonable before
566 trying to allocate some memory for it. */
567 ada_ensure_varsize_limit (type
);
569 if (value_optimized_out (val
))
570 result
= allocate_optimized_out_value (type
);
571 else if (value_lazy (val
)
572 /* Be careful not to make a lazy not_lval value. */
573 || (VALUE_LVAL (val
) != not_lval
574 && TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
))))
575 result
= allocate_value_lazy (type
);
578 result
= allocate_value (type
);
579 value_contents_copy (result
, 0, val
, 0, TYPE_LENGTH (type
));
581 set_value_component_location (result
, val
);
582 set_value_bitsize (result
, value_bitsize (val
));
583 set_value_bitpos (result
, value_bitpos (val
));
584 if (VALUE_LVAL (result
) == lval_memory
)
585 set_value_address (result
, value_address (val
));
590 static const gdb_byte
*
591 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
596 return valaddr
+ offset
;
600 cond_offset_target (CORE_ADDR address
, long offset
)
605 return address
+ offset
;
608 /* Issue a warning (as for the definition of warning in utils.c, but
609 with exactly one argument rather than ...), unless the limit on the
610 number of warnings has passed during the evaluation of the current
613 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
614 provided by "complaint". */
615 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
618 lim_warning (const char *format
, ...)
622 va_start (args
, format
);
623 warnings_issued
+= 1;
624 if (warnings_issued
<= warning_limit
)
625 vwarning (format
, args
);
630 /* Issue an error if the size of an object of type T is unreasonable,
631 i.e. if it would be a bad idea to allocate a value of this type in
635 ada_ensure_varsize_limit (const struct type
*type
)
637 if (TYPE_LENGTH (type
) > varsize_limit
)
638 error (_("object size is larger than varsize-limit"));
641 /* Maximum value of a SIZE-byte signed integer type. */
643 max_of_size (int size
)
645 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
647 return top_bit
| (top_bit
- 1);
650 /* Minimum value of a SIZE-byte signed integer type. */
652 min_of_size (int size
)
654 return -max_of_size (size
) - 1;
657 /* Maximum value of a SIZE-byte unsigned integer type. */
659 umax_of_size (int size
)
661 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
663 return top_bit
| (top_bit
- 1);
666 /* Maximum value of integral type T, as a signed quantity. */
668 max_of_type (struct type
*t
)
670 if (t
->is_unsigned ())
671 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
673 return max_of_size (TYPE_LENGTH (t
));
676 /* Minimum value of integral type T, as a signed quantity. */
678 min_of_type (struct type
*t
)
680 if (t
->is_unsigned ())
683 return min_of_size (TYPE_LENGTH (t
));
686 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
688 ada_discrete_type_high_bound (struct type
*type
)
690 type
= resolve_dynamic_type (type
, {}, 0);
691 switch (type
->code ())
693 case TYPE_CODE_RANGE
:
695 const dynamic_prop
&high
= type
->bounds ()->high
;
697 if (high
.kind () == PROP_CONST
)
698 return high
.const_val ();
701 gdb_assert (high
.kind () == PROP_UNDEFINED
);
703 /* This happens when trying to evaluate a type's dynamic bound
704 without a live target. There is nothing relevant for us to
705 return here, so return 0. */
710 return TYPE_FIELD_ENUMVAL (type
, type
->num_fields () - 1);
715 return max_of_type (type
);
717 error (_("Unexpected type in ada_discrete_type_high_bound."));
721 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
723 ada_discrete_type_low_bound (struct type
*type
)
725 type
= resolve_dynamic_type (type
, {}, 0);
726 switch (type
->code ())
728 case TYPE_CODE_RANGE
:
730 const dynamic_prop
&low
= type
->bounds ()->low
;
732 if (low
.kind () == PROP_CONST
)
733 return low
.const_val ();
736 gdb_assert (low
.kind () == PROP_UNDEFINED
);
738 /* This happens when trying to evaluate a type's dynamic bound
739 without a live target. There is nothing relevant for us to
740 return here, so return 0. */
745 return TYPE_FIELD_ENUMVAL (type
, 0);
750 return min_of_type (type
);
752 error (_("Unexpected type in ada_discrete_type_low_bound."));
756 /* The identity on non-range types. For range types, the underlying
757 non-range scalar type. */
760 get_base_type (struct type
*type
)
762 while (type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
)
764 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
766 type
= TYPE_TARGET_TYPE (type
);
771 /* Return a decoded version of the given VALUE. This means returning
772 a value whose type is obtained by applying all the GNAT-specific
773 encodings, making the resulting type a static but standard description
774 of the initial type. */
777 ada_get_decoded_value (struct value
*value
)
779 struct type
*type
= ada_check_typedef (value_type (value
));
781 if (ada_is_array_descriptor_type (type
)
782 || (ada_is_constrained_packed_array_type (type
)
783 && type
->code () != TYPE_CODE_PTR
))
785 if (type
->code () == TYPE_CODE_TYPEDEF
) /* array access type. */
786 value
= ada_coerce_to_simple_array_ptr (value
);
788 value
= ada_coerce_to_simple_array (value
);
791 value
= ada_to_fixed_value (value
);
796 /* Same as ada_get_decoded_value, but with the given TYPE.
797 Because there is no associated actual value for this type,
798 the resulting type might be a best-effort approximation in
799 the case of dynamic types. */
802 ada_get_decoded_type (struct type
*type
)
804 type
= to_static_fixed_type (type
);
805 if (ada_is_constrained_packed_array_type (type
))
806 type
= ada_coerce_to_simple_array_type (type
);
812 /* Language Selection */
814 /* If the main program is in Ada, return language_ada, otherwise return LANG
815 (the main program is in Ada iif the adainit symbol is found). */
818 ada_update_initial_language (enum language lang
)
820 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
826 /* If the main procedure is written in Ada, then return its name.
827 The result is good until the next call. Return NULL if the main
828 procedure doesn't appear to be in Ada. */
833 struct bound_minimal_symbol msym
;
834 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
836 /* For Ada, the name of the main procedure is stored in a specific
837 string constant, generated by the binder. Look for that symbol,
838 extract its address, and then read that string. If we didn't find
839 that string, then most probably the main procedure is not written
841 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
843 if (msym
.minsym
!= NULL
)
845 CORE_ADDR main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
846 if (main_program_name_addr
== 0)
847 error (_("Invalid address for Ada main program name."));
849 main_program_name
= target_read_string (main_program_name_addr
, 1024);
850 return main_program_name
.get ();
853 /* The main procedure doesn't seem to be in Ada. */
859 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
862 const struct ada_opname_map ada_opname_table
[] = {
863 {"Oadd", "\"+\"", BINOP_ADD
},
864 {"Osubtract", "\"-\"", BINOP_SUB
},
865 {"Omultiply", "\"*\"", BINOP_MUL
},
866 {"Odivide", "\"/\"", BINOP_DIV
},
867 {"Omod", "\"mod\"", BINOP_MOD
},
868 {"Orem", "\"rem\"", BINOP_REM
},
869 {"Oexpon", "\"**\"", BINOP_EXP
},
870 {"Olt", "\"<\"", BINOP_LESS
},
871 {"Ole", "\"<=\"", BINOP_LEQ
},
872 {"Ogt", "\">\"", BINOP_GTR
},
873 {"Oge", "\">=\"", BINOP_GEQ
},
874 {"Oeq", "\"=\"", BINOP_EQUAL
},
875 {"One", "\"/=\"", BINOP_NOTEQUAL
},
876 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
877 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
878 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
879 {"Oconcat", "\"&\"", BINOP_CONCAT
},
880 {"Oabs", "\"abs\"", UNOP_ABS
},
881 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
882 {"Oadd", "\"+\"", UNOP_PLUS
},
883 {"Osubtract", "\"-\"", UNOP_NEG
},
887 /* The "encoded" form of DECODED, according to GNAT conventions. If
888 THROW_ERRORS, throw an error if invalid operator name is found.
889 Otherwise, return the empty string in that case. */
892 ada_encode_1 (const char *decoded
, bool throw_errors
)
897 std::string encoding_buffer
;
898 for (const char *p
= decoded
; *p
!= '\0'; p
+= 1)
901 encoding_buffer
.append ("__");
904 const struct ada_opname_map
*mapping
;
906 for (mapping
= ada_opname_table
;
907 mapping
->encoded
!= NULL
908 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
910 if (mapping
->encoded
== NULL
)
913 error (_("invalid Ada operator name: %s"), p
);
917 encoding_buffer
.append (mapping
->encoded
);
921 encoding_buffer
.push_back (*p
);
924 return encoding_buffer
;
927 /* The "encoded" form of DECODED, according to GNAT conventions. */
930 ada_encode (const char *decoded
)
932 return ada_encode_1 (decoded
, true);
935 /* Return NAME folded to lower case, or, if surrounded by single
936 quotes, unfolded, but with the quotes stripped away. Result good
940 ada_fold_name (gdb::string_view name
)
942 static std::string fold_storage
;
944 if (!name
.empty () && name
[0] == '\'')
945 fold_storage
= gdb::to_string (name
.substr (1, name
.size () - 2));
948 fold_storage
= gdb::to_string (name
);
949 for (int i
= 0; i
< name
.size (); i
+= 1)
950 fold_storage
[i
] = tolower (fold_storage
[i
]);
953 return fold_storage
.c_str ();
956 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
959 is_lower_alphanum (const char c
)
961 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
964 /* ENCODED is the linkage name of a symbol and LEN contains its length.
965 This function saves in LEN the length of that same symbol name but
966 without either of these suffixes:
972 These are suffixes introduced by the compiler for entities such as
973 nested subprogram for instance, in order to avoid name clashes.
974 They do not serve any purpose for the debugger. */
977 ada_remove_trailing_digits (const char *encoded
, int *len
)
979 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
983 while (i
> 0 && isdigit (encoded
[i
]))
985 if (i
>= 0 && encoded
[i
] == '.')
987 else if (i
>= 0 && encoded
[i
] == '$')
989 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
991 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
996 /* Remove the suffix introduced by the compiler for protected object
1000 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1002 /* Remove trailing N. */
1004 /* Protected entry subprograms are broken into two
1005 separate subprograms: The first one is unprotected, and has
1006 a 'N' suffix; the second is the protected version, and has
1007 the 'P' suffix. The second calls the first one after handling
1008 the protection. Since the P subprograms are internally generated,
1009 we leave these names undecoded, giving the user a clue that this
1010 entity is internal. */
1013 && encoded
[*len
- 1] == 'N'
1014 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1018 /* If ENCODED follows the GNAT entity encoding conventions, then return
1019 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1020 replaced by ENCODED. */
1023 ada_decode (const char *encoded
)
1029 std::string decoded
;
1031 /* With function descriptors on PPC64, the value of a symbol named
1032 ".FN", if it exists, is the entry point of the function "FN". */
1033 if (encoded
[0] == '.')
1036 /* The name of the Ada main procedure starts with "_ada_".
1037 This prefix is not part of the decoded name, so skip this part
1038 if we see this prefix. */
1039 if (startswith (encoded
, "_ada_"))
1042 /* If the name starts with '_', then it is not a properly encoded
1043 name, so do not attempt to decode it. Similarly, if the name
1044 starts with '<', the name should not be decoded. */
1045 if (encoded
[0] == '_' || encoded
[0] == '<')
1048 len0
= strlen (encoded
);
1050 ada_remove_trailing_digits (encoded
, &len0
);
1051 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1053 /* Remove the ___X.* suffix if present. Do not forget to verify that
1054 the suffix is located before the current "end" of ENCODED. We want
1055 to avoid re-matching parts of ENCODED that have previously been
1056 marked as discarded (by decrementing LEN0). */
1057 p
= strstr (encoded
, "___");
1058 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1066 /* Remove any trailing TKB suffix. It tells us that this symbol
1067 is for the body of a task, but that information does not actually
1068 appear in the decoded name. */
1070 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1073 /* Remove any trailing TB suffix. The TB suffix is slightly different
1074 from the TKB suffix because it is used for non-anonymous task
1077 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1080 /* Remove trailing "B" suffixes. */
1081 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1083 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1086 /* Make decoded big enough for possible expansion by operator name. */
1088 decoded
.resize (2 * len0
+ 1, 'X');
1090 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1092 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1095 while ((i
>= 0 && isdigit (encoded
[i
]))
1096 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1098 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1100 else if (encoded
[i
] == '$')
1104 /* The first few characters that are not alphabetic are not part
1105 of any encoding we use, so we can copy them over verbatim. */
1107 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1108 decoded
[j
] = encoded
[i
];
1113 /* Is this a symbol function? */
1114 if (at_start_name
&& encoded
[i
] == 'O')
1118 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1120 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1121 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1123 && !isalnum (encoded
[i
+ op_len
]))
1125 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1128 j
+= strlen (ada_opname_table
[k
].decoded
);
1132 if (ada_opname_table
[k
].encoded
!= NULL
)
1137 /* Replace "TK__" with "__", which will eventually be translated
1138 into "." (just below). */
1140 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1143 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1144 be translated into "." (just below). These are internal names
1145 generated for anonymous blocks inside which our symbol is nested. */
1147 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1148 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1149 && isdigit (encoded
[i
+4]))
1153 while (k
< len0
&& isdigit (encoded
[k
]))
1154 k
++; /* Skip any extra digit. */
1156 /* Double-check that the "__B_{DIGITS}+" sequence we found
1157 is indeed followed by "__". */
1158 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1162 /* Remove _E{DIGITS}+[sb] */
1164 /* Just as for protected object subprograms, there are 2 categories
1165 of subprograms created by the compiler for each entry. The first
1166 one implements the actual entry code, and has a suffix following
1167 the convention above; the second one implements the barrier and
1168 uses the same convention as above, except that the 'E' is replaced
1171 Just as above, we do not decode the name of barrier functions
1172 to give the user a clue that the code he is debugging has been
1173 internally generated. */
1175 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1176 && isdigit (encoded
[i
+2]))
1180 while (k
< len0
&& isdigit (encoded
[k
]))
1184 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1187 /* Just as an extra precaution, make sure that if this
1188 suffix is followed by anything else, it is a '_'.
1189 Otherwise, we matched this sequence by accident. */
1191 || (k
< len0
&& encoded
[k
] == '_'))
1196 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1197 the GNAT front-end in protected object subprograms. */
1200 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1202 /* Backtrack a bit up until we reach either the begining of
1203 the encoded name, or "__". Make sure that we only find
1204 digits or lowercase characters. */
1205 const char *ptr
= encoded
+ i
- 1;
1207 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1210 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1214 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1216 /* This is a X[bn]* sequence not separated from the previous
1217 part of the name with a non-alpha-numeric character (in other
1218 words, immediately following an alpha-numeric character), then
1219 verify that it is placed at the end of the encoded name. If
1220 not, then the encoding is not valid and we should abort the
1221 decoding. Otherwise, just skip it, it is used in body-nested
1225 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1229 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1231 /* Replace '__' by '.'. */
1239 /* It's a character part of the decoded name, so just copy it
1241 decoded
[j
] = encoded
[i
];
1248 /* Decoded names should never contain any uppercase character.
1249 Double-check this, and abort the decoding if we find one. */
1251 for (i
= 0; i
< decoded
.length(); ++i
)
1252 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1258 if (encoded
[0] == '<')
1261 decoded
= '<' + std::string(encoded
) + '>';
1266 /* Table for keeping permanent unique copies of decoded names. Once
1267 allocated, names in this table are never released. While this is a
1268 storage leak, it should not be significant unless there are massive
1269 changes in the set of decoded names in successive versions of a
1270 symbol table loaded during a single session. */
1271 static struct htab
*decoded_names_store
;
1273 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1274 in the language-specific part of GSYMBOL, if it has not been
1275 previously computed. Tries to save the decoded name in the same
1276 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1277 in any case, the decoded symbol has a lifetime at least that of
1279 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1280 const, but nevertheless modified to a semantically equivalent form
1281 when a decoded name is cached in it. */
1284 ada_decode_symbol (const struct general_symbol_info
*arg
)
1286 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1287 const char **resultp
=
1288 &gsymbol
->language_specific
.demangled_name
;
1290 if (!gsymbol
->ada_mangled
)
1292 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1293 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1295 gsymbol
->ada_mangled
= 1;
1297 if (obstack
!= NULL
)
1298 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1301 /* Sometimes, we can't find a corresponding objfile, in
1302 which case, we put the result on the heap. Since we only
1303 decode when needed, we hope this usually does not cause a
1304 significant memory leak (FIXME). */
1306 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1307 decoded
.c_str (), INSERT
);
1310 *slot
= xstrdup (decoded
.c_str ());
1319 ada_la_decode (const char *encoded
, int options
)
1321 return xstrdup (ada_decode (encoded
).c_str ());
1328 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1329 generated by the GNAT compiler to describe the index type used
1330 for each dimension of an array, check whether it follows the latest
1331 known encoding. If not, fix it up to conform to the latest encoding.
1332 Otherwise, do nothing. This function also does nothing if
1333 INDEX_DESC_TYPE is NULL.
1335 The GNAT encoding used to describe the array index type evolved a bit.
1336 Initially, the information would be provided through the name of each
1337 field of the structure type only, while the type of these fields was
1338 described as unspecified and irrelevant. The debugger was then expected
1339 to perform a global type lookup using the name of that field in order
1340 to get access to the full index type description. Because these global
1341 lookups can be very expensive, the encoding was later enhanced to make
1342 the global lookup unnecessary by defining the field type as being
1343 the full index type description.
1345 The purpose of this routine is to allow us to support older versions
1346 of the compiler by detecting the use of the older encoding, and by
1347 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1348 we essentially replace each field's meaningless type by the associated
1352 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1356 if (index_desc_type
== NULL
)
1358 gdb_assert (index_desc_type
->num_fields () > 0);
1360 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1361 to check one field only, no need to check them all). If not, return
1364 If our INDEX_DESC_TYPE was generated using the older encoding,
1365 the field type should be a meaningless integer type whose name
1366 is not equal to the field name. */
1367 if (index_desc_type
->field (0).type ()->name () != NULL
1368 && strcmp (index_desc_type
->field (0).type ()->name (),
1369 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1372 /* Fixup each field of INDEX_DESC_TYPE. */
1373 for (i
= 0; i
< index_desc_type
->num_fields (); i
++)
1375 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1376 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1379 index_desc_type
->field (i
).set_type (raw_type
);
1383 /* The desc_* routines return primitive portions of array descriptors
1386 /* The descriptor or array type, if any, indicated by TYPE; removes
1387 level of indirection, if needed. */
1389 static struct type
*
1390 desc_base_type (struct type
*type
)
1394 type
= ada_check_typedef (type
);
1395 if (type
->code () == TYPE_CODE_TYPEDEF
)
1396 type
= ada_typedef_target_type (type
);
1399 && (type
->code () == TYPE_CODE_PTR
1400 || type
->code () == TYPE_CODE_REF
))
1401 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1406 /* True iff TYPE indicates a "thin" array pointer type. */
1409 is_thin_pntr (struct type
*type
)
1412 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1413 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1416 /* The descriptor type for thin pointer type TYPE. */
1418 static struct type
*
1419 thin_descriptor_type (struct type
*type
)
1421 struct type
*base_type
= desc_base_type (type
);
1423 if (base_type
== NULL
)
1425 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1429 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1431 if (alt_type
== NULL
)
1438 /* A pointer to the array data for thin-pointer value VAL. */
1440 static struct value
*
1441 thin_data_pntr (struct value
*val
)
1443 struct type
*type
= ada_check_typedef (value_type (val
));
1444 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1446 data_type
= lookup_pointer_type (data_type
);
1448 if (type
->code () == TYPE_CODE_PTR
)
1449 return value_cast (data_type
, value_copy (val
));
1451 return value_from_longest (data_type
, value_address (val
));
1454 /* True iff TYPE indicates a "thick" array pointer type. */
1457 is_thick_pntr (struct type
*type
)
1459 type
= desc_base_type (type
);
1460 return (type
!= NULL
&& type
->code () == TYPE_CODE_STRUCT
1461 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1464 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1465 pointer to one, the type of its bounds data; otherwise, NULL. */
1467 static struct type
*
1468 desc_bounds_type (struct type
*type
)
1472 type
= desc_base_type (type
);
1476 else if (is_thin_pntr (type
))
1478 type
= thin_descriptor_type (type
);
1481 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1483 return ada_check_typedef (r
);
1485 else if (type
->code () == TYPE_CODE_STRUCT
)
1487 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1489 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1494 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1495 one, a pointer to its bounds data. Otherwise NULL. */
1497 static struct value
*
1498 desc_bounds (struct value
*arr
)
1500 struct type
*type
= ada_check_typedef (value_type (arr
));
1502 if (is_thin_pntr (type
))
1504 struct type
*bounds_type
=
1505 desc_bounds_type (thin_descriptor_type (type
));
1508 if (bounds_type
== NULL
)
1509 error (_("Bad GNAT array descriptor"));
1511 /* NOTE: The following calculation is not really kosher, but
1512 since desc_type is an XVE-encoded type (and shouldn't be),
1513 the correct calculation is a real pain. FIXME (and fix GCC). */
1514 if (type
->code () == TYPE_CODE_PTR
)
1515 addr
= value_as_long (arr
);
1517 addr
= value_address (arr
);
1520 value_from_longest (lookup_pointer_type (bounds_type
),
1521 addr
- TYPE_LENGTH (bounds_type
));
1524 else if (is_thick_pntr (type
))
1526 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1527 _("Bad GNAT array descriptor"));
1528 struct type
*p_bounds_type
= value_type (p_bounds
);
1531 && p_bounds_type
->code () == TYPE_CODE_PTR
)
1533 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1535 if (target_type
->is_stub ())
1536 p_bounds
= value_cast (lookup_pointer_type
1537 (ada_check_typedef (target_type
)),
1541 error (_("Bad GNAT array descriptor"));
1549 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1550 position of the field containing the address of the bounds data. */
1553 fat_pntr_bounds_bitpos (struct type
*type
)
1555 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1558 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1559 size of the field containing the address of the bounds data. */
1562 fat_pntr_bounds_bitsize (struct type
*type
)
1564 type
= desc_base_type (type
);
1566 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1567 return TYPE_FIELD_BITSIZE (type
, 1);
1569 return 8 * TYPE_LENGTH (ada_check_typedef (type
->field (1).type ()));
1572 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1573 pointer to one, the type of its array data (a array-with-no-bounds type);
1574 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1577 static struct type
*
1578 desc_data_target_type (struct type
*type
)
1580 type
= desc_base_type (type
);
1582 /* NOTE: The following is bogus; see comment in desc_bounds. */
1583 if (is_thin_pntr (type
))
1584 return desc_base_type (thin_descriptor_type (type
)->field (1).type ());
1585 else if (is_thick_pntr (type
))
1587 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1590 && ada_check_typedef (data_type
)->code () == TYPE_CODE_PTR
)
1591 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1597 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1600 static struct value
*
1601 desc_data (struct value
*arr
)
1603 struct type
*type
= value_type (arr
);
1605 if (is_thin_pntr (type
))
1606 return thin_data_pntr (arr
);
1607 else if (is_thick_pntr (type
))
1608 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1609 _("Bad GNAT array descriptor"));
1615 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1616 position of the field containing the address of the data. */
1619 fat_pntr_data_bitpos (struct type
*type
)
1621 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1624 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1625 size of the field containing the address of the data. */
1628 fat_pntr_data_bitsize (struct type
*type
)
1630 type
= desc_base_type (type
);
1632 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1633 return TYPE_FIELD_BITSIZE (type
, 0);
1635 return TARGET_CHAR_BIT
* TYPE_LENGTH (type
->field (0).type ());
1638 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1639 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1640 bound, if WHICH is 1. The first bound is I=1. */
1642 static struct value
*
1643 desc_one_bound (struct value
*bounds
, int i
, int which
)
1645 char bound_name
[20];
1646 xsnprintf (bound_name
, sizeof (bound_name
), "%cB%d",
1647 which
? 'U' : 'L', i
- 1);
1648 return value_struct_elt (&bounds
, NULL
, bound_name
, NULL
,
1649 _("Bad GNAT array descriptor bounds"));
1652 /* If BOUNDS is an array-bounds structure type, return the bit position
1653 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1654 bound, if WHICH is 1. The first bound is I=1. */
1657 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1659 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1662 /* If BOUNDS is an array-bounds structure type, return the bit field size
1663 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1664 bound, if WHICH is 1. The first bound is I=1. */
1667 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1669 type
= desc_base_type (type
);
1671 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1672 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1674 return 8 * TYPE_LENGTH (type
->field (2 * i
+ which
- 2).type ());
1677 /* If TYPE is the type of an array-bounds structure, the type of its
1678 Ith bound (numbering from 1). Otherwise, NULL. */
1680 static struct type
*
1681 desc_index_type (struct type
*type
, int i
)
1683 type
= desc_base_type (type
);
1685 if (type
->code () == TYPE_CODE_STRUCT
)
1687 char bound_name
[20];
1688 xsnprintf (bound_name
, sizeof (bound_name
), "LB%d", i
- 1);
1689 return lookup_struct_elt_type (type
, bound_name
, 1);
1695 /* The number of index positions in the array-bounds type TYPE.
1696 Return 0 if TYPE is NULL. */
1699 desc_arity (struct type
*type
)
1701 type
= desc_base_type (type
);
1704 return type
->num_fields () / 2;
1708 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1709 an array descriptor type (representing an unconstrained array
1713 ada_is_direct_array_type (struct type
*type
)
1717 type
= ada_check_typedef (type
);
1718 return (type
->code () == TYPE_CODE_ARRAY
1719 || ada_is_array_descriptor_type (type
));
1722 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1726 ada_is_array_type (struct type
*type
)
1729 && (type
->code () == TYPE_CODE_PTR
1730 || type
->code () == TYPE_CODE_REF
))
1731 type
= TYPE_TARGET_TYPE (type
);
1732 return ada_is_direct_array_type (type
);
1735 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1738 ada_is_simple_array_type (struct type
*type
)
1742 type
= ada_check_typedef (type
);
1743 return (type
->code () == TYPE_CODE_ARRAY
1744 || (type
->code () == TYPE_CODE_PTR
1745 && (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ()
1746 == TYPE_CODE_ARRAY
)));
1749 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1752 ada_is_array_descriptor_type (struct type
*type
)
1754 struct type
*data_type
= desc_data_target_type (type
);
1758 type
= ada_check_typedef (type
);
1759 return (data_type
!= NULL
1760 && data_type
->code () == TYPE_CODE_ARRAY
1761 && desc_arity (desc_bounds_type (type
)) > 0);
1764 /* Non-zero iff type is a partially mal-formed GNAT array
1765 descriptor. FIXME: This is to compensate for some problems with
1766 debugging output from GNAT. Re-examine periodically to see if it
1770 ada_is_bogus_array_descriptor (struct type
*type
)
1774 && type
->code () == TYPE_CODE_STRUCT
1775 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1776 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1777 && !ada_is_array_descriptor_type (type
);
1781 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1782 (fat pointer) returns the type of the array data described---specifically,
1783 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1784 in from the descriptor; otherwise, they are left unspecified. If
1785 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1786 returns NULL. The result is simply the type of ARR if ARR is not
1789 static struct type
*
1790 ada_type_of_array (struct value
*arr
, int bounds
)
1792 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1793 return decode_constrained_packed_array_type (value_type (arr
));
1795 if (!ada_is_array_descriptor_type (value_type (arr
)))
1796 return value_type (arr
);
1800 struct type
*array_type
=
1801 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1803 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1804 TYPE_FIELD_BITSIZE (array_type
, 0) =
1805 decode_packed_array_bitsize (value_type (arr
));
1811 struct type
*elt_type
;
1813 struct value
*descriptor
;
1815 elt_type
= ada_array_element_type (value_type (arr
), -1);
1816 arity
= ada_array_arity (value_type (arr
));
1818 if (elt_type
== NULL
|| arity
== 0)
1819 return ada_check_typedef (value_type (arr
));
1821 descriptor
= desc_bounds (arr
);
1822 if (value_as_long (descriptor
) == 0)
1826 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1827 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1828 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1829 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1832 create_static_range_type (range_type
, value_type (low
),
1833 longest_to_int (value_as_long (low
)),
1834 longest_to_int (value_as_long (high
)));
1835 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1837 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1839 /* We need to store the element packed bitsize, as well as
1840 recompute the array size, because it was previously
1841 computed based on the unpacked element size. */
1842 LONGEST lo
= value_as_long (low
);
1843 LONGEST hi
= value_as_long (high
);
1845 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1846 decode_packed_array_bitsize (value_type (arr
));
1847 /* If the array has no element, then the size is already
1848 zero, and does not need to be recomputed. */
1852 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1854 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1859 return lookup_pointer_type (elt_type
);
1863 /* If ARR does not represent an array, returns ARR unchanged.
1864 Otherwise, returns either a standard GDB array with bounds set
1865 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1866 GDB array. Returns NULL if ARR is a null fat pointer. */
1869 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1871 if (ada_is_array_descriptor_type (value_type (arr
)))
1873 struct type
*arrType
= ada_type_of_array (arr
, 1);
1875 if (arrType
== NULL
)
1877 return value_cast (arrType
, value_copy (desc_data (arr
)));
1879 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1880 return decode_constrained_packed_array (arr
);
1885 /* If ARR does not represent an array, returns ARR unchanged.
1886 Otherwise, returns a standard GDB array describing ARR (which may
1887 be ARR itself if it already is in the proper form). */
1890 ada_coerce_to_simple_array (struct value
*arr
)
1892 if (ada_is_array_descriptor_type (value_type (arr
)))
1894 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1897 error (_("Bounds unavailable for null array pointer."));
1898 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
1899 return value_ind (arrVal
);
1901 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1902 return decode_constrained_packed_array (arr
);
1907 /* If TYPE represents a GNAT array type, return it translated to an
1908 ordinary GDB array type (possibly with BITSIZE fields indicating
1909 packing). For other types, is the identity. */
1912 ada_coerce_to_simple_array_type (struct type
*type
)
1914 if (ada_is_constrained_packed_array_type (type
))
1915 return decode_constrained_packed_array_type (type
);
1917 if (ada_is_array_descriptor_type (type
))
1918 return ada_check_typedef (desc_data_target_type (type
));
1923 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1926 ada_is_gnat_encoded_packed_array_type (struct type
*type
)
1930 type
= desc_base_type (type
);
1931 type
= ada_check_typedef (type
);
1933 ada_type_name (type
) != NULL
1934 && strstr (ada_type_name (type
), "___XP") != NULL
;
1937 /* Non-zero iff TYPE represents a standard GNAT constrained
1938 packed-array type. */
1941 ada_is_constrained_packed_array_type (struct type
*type
)
1943 return ada_is_gnat_encoded_packed_array_type (type
)
1944 && !ada_is_array_descriptor_type (type
);
1947 /* Non-zero iff TYPE represents an array descriptor for a
1948 unconstrained packed-array type. */
1951 ada_is_unconstrained_packed_array_type (struct type
*type
)
1953 if (!ada_is_array_descriptor_type (type
))
1956 if (ada_is_gnat_encoded_packed_array_type (type
))
1959 /* If we saw GNAT encodings, then the above code is sufficient.
1960 However, with minimal encodings, we will just have a thick
1962 if (is_thick_pntr (type
))
1964 type
= desc_base_type (type
);
1965 /* The structure's first field is a pointer to an array, so this
1966 fetches the array type. */
1967 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
1968 /* Now we can see if the array elements are packed. */
1969 return TYPE_FIELD_BITSIZE (type
, 0) > 0;
1975 /* Return true if TYPE is a (Gnat-encoded) constrained packed array
1976 type, or if it is an ordinary (non-Gnat-encoded) packed array. */
1979 ada_is_any_packed_array_type (struct type
*type
)
1981 return (ada_is_constrained_packed_array_type (type
)
1982 || (type
->code () == TYPE_CODE_ARRAY
1983 && TYPE_FIELD_BITSIZE (type
, 0) % 8 != 0));
1986 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1987 return the size of its elements in bits. */
1990 decode_packed_array_bitsize (struct type
*type
)
1992 const char *raw_name
;
1996 /* Access to arrays implemented as fat pointers are encoded as a typedef
1997 of the fat pointer type. We need the name of the fat pointer type
1998 to do the decoding, so strip the typedef layer. */
1999 if (type
->code () == TYPE_CODE_TYPEDEF
)
2000 type
= ada_typedef_target_type (type
);
2002 raw_name
= ada_type_name (ada_check_typedef (type
));
2004 raw_name
= ada_type_name (desc_base_type (type
));
2009 tail
= strstr (raw_name
, "___XP");
2010 if (tail
== nullptr)
2012 gdb_assert (is_thick_pntr (type
));
2013 /* The structure's first field is a pointer to an array, so this
2014 fetches the array type. */
2015 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
2016 /* Now we can see if the array elements are packed. */
2017 return TYPE_FIELD_BITSIZE (type
, 0);
2020 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2023 (_("could not understand bit size information on packed array"));
2030 /* Given that TYPE is a standard GDB array type with all bounds filled
2031 in, and that the element size of its ultimate scalar constituents
2032 (that is, either its elements, or, if it is an array of arrays, its
2033 elements' elements, etc.) is *ELT_BITS, return an identical type,
2034 but with the bit sizes of its elements (and those of any
2035 constituent arrays) recorded in the BITSIZE components of its
2036 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2039 Note that, for arrays whose index type has an XA encoding where
2040 a bound references a record discriminant, getting that discriminant,
2041 and therefore the actual value of that bound, is not possible
2042 because none of the given parameters gives us access to the record.
2043 This function assumes that it is OK in the context where it is being
2044 used to return an array whose bounds are still dynamic and where
2045 the length is arbitrary. */
2047 static struct type
*
2048 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2050 struct type
*new_elt_type
;
2051 struct type
*new_type
;
2052 struct type
*index_type_desc
;
2053 struct type
*index_type
;
2054 LONGEST low_bound
, high_bound
;
2056 type
= ada_check_typedef (type
);
2057 if (type
->code () != TYPE_CODE_ARRAY
)
2060 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2061 if (index_type_desc
)
2062 index_type
= to_fixed_range_type (index_type_desc
->field (0).type (),
2065 index_type
= type
->index_type ();
2067 new_type
= alloc_type_copy (type
);
2069 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2071 create_array_type (new_type
, new_elt_type
, index_type
);
2072 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2073 new_type
->set_name (ada_type_name (type
));
2075 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2076 && is_dynamic_type (check_typedef (index_type
)))
2077 || !get_discrete_bounds (index_type
, &low_bound
, &high_bound
))
2078 low_bound
= high_bound
= 0;
2079 if (high_bound
< low_bound
)
2080 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2083 *elt_bits
*= (high_bound
- low_bound
+ 1);
2084 TYPE_LENGTH (new_type
) =
2085 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2088 new_type
->set_is_fixed_instance (true);
2092 /* The array type encoded by TYPE, where
2093 ada_is_constrained_packed_array_type (TYPE). */
2095 static struct type
*
2096 decode_constrained_packed_array_type (struct type
*type
)
2098 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2101 struct type
*shadow_type
;
2105 raw_name
= ada_type_name (desc_base_type (type
));
2110 name
= (char *) alloca (strlen (raw_name
) + 1);
2111 tail
= strstr (raw_name
, "___XP");
2112 type
= desc_base_type (type
);
2114 memcpy (name
, raw_name
, tail
- raw_name
);
2115 name
[tail
- raw_name
] = '\000';
2117 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2119 if (shadow_type
== NULL
)
2121 lim_warning (_("could not find bounds information on packed array"));
2124 shadow_type
= check_typedef (shadow_type
);
2126 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2128 lim_warning (_("could not understand bounds "
2129 "information on packed array"));
2133 bits
= decode_packed_array_bitsize (type
);
2134 return constrained_packed_array_type (shadow_type
, &bits
);
2137 /* Helper function for decode_constrained_packed_array. Set the field
2138 bitsize on a series of packed arrays. Returns the number of
2139 elements in TYPE. */
2142 recursively_update_array_bitsize (struct type
*type
)
2144 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
2147 if (!get_discrete_bounds (type
->index_type (), &low
, &high
)
2150 LONGEST our_len
= high
- low
+ 1;
2152 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
2153 if (elt_type
->code () == TYPE_CODE_ARRAY
)
2155 LONGEST elt_len
= recursively_update_array_bitsize (elt_type
);
2156 LONGEST elt_bitsize
= elt_len
* TYPE_FIELD_BITSIZE (elt_type
, 0);
2157 TYPE_FIELD_BITSIZE (type
, 0) = elt_bitsize
;
2159 TYPE_LENGTH (type
) = ((our_len
* elt_bitsize
+ HOST_CHAR_BIT
- 1)
2166 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2167 array, returns a simple array that denotes that array. Its type is a
2168 standard GDB array type except that the BITSIZEs of the array
2169 target types are set to the number of bits in each element, and the
2170 type length is set appropriately. */
2172 static struct value
*
2173 decode_constrained_packed_array (struct value
*arr
)
2177 /* If our value is a pointer, then dereference it. Likewise if
2178 the value is a reference. Make sure that this operation does not
2179 cause the target type to be fixed, as this would indirectly cause
2180 this array to be decoded. The rest of the routine assumes that
2181 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2182 and "value_ind" routines to perform the dereferencing, as opposed
2183 to using "ada_coerce_ref" or "ada_value_ind". */
2184 arr
= coerce_ref (arr
);
2185 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2186 arr
= value_ind (arr
);
2188 type
= decode_constrained_packed_array_type (value_type (arr
));
2191 error (_("can't unpack array"));
2195 /* Decoding the packed array type could not correctly set the field
2196 bitsizes for any dimension except the innermost, because the
2197 bounds may be variable and were not passed to that function. So,
2198 we further resolve the array bounds here and then update the
2200 const gdb_byte
*valaddr
= value_contents_for_printing (arr
);
2201 CORE_ADDR address
= value_address (arr
);
2202 gdb::array_view
<const gdb_byte
> view
2203 = gdb::make_array_view (valaddr
, TYPE_LENGTH (type
));
2204 type
= resolve_dynamic_type (type
, view
, address
);
2205 recursively_update_array_bitsize (type
);
2207 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2208 && ada_is_modular_type (value_type (arr
)))
2210 /* This is a (right-justified) modular type representing a packed
2211 array with no wrapper. In order to interpret the value through
2212 the (left-justified) packed array type we just built, we must
2213 first left-justify it. */
2214 int bit_size
, bit_pos
;
2217 mod
= ada_modulus (value_type (arr
)) - 1;
2224 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2225 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2226 bit_pos
/ HOST_CHAR_BIT
,
2227 bit_pos
% HOST_CHAR_BIT
,
2232 return coerce_unspec_val_to_type (arr
, type
);
2236 /* The value of the element of packed array ARR at the ARITY indices
2237 given in IND. ARR must be a simple array. */
2239 static struct value
*
2240 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2243 int bits
, elt_off
, bit_off
;
2244 long elt_total_bit_offset
;
2245 struct type
*elt_type
;
2249 elt_total_bit_offset
= 0;
2250 elt_type
= ada_check_typedef (value_type (arr
));
2251 for (i
= 0; i
< arity
; i
+= 1)
2253 if (elt_type
->code () != TYPE_CODE_ARRAY
2254 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2256 (_("attempt to do packed indexing of "
2257 "something other than a packed array"));
2260 struct type
*range_type
= elt_type
->index_type ();
2261 LONGEST lowerbound
, upperbound
;
2264 if (!get_discrete_bounds (range_type
, &lowerbound
, &upperbound
))
2266 lim_warning (_("don't know bounds of array"));
2267 lowerbound
= upperbound
= 0;
2270 idx
= pos_atr (ind
[i
]);
2271 if (idx
< lowerbound
|| idx
> upperbound
)
2272 lim_warning (_("packed array index %ld out of bounds"),
2274 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2275 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2276 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2279 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2280 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2282 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2287 /* Non-zero iff TYPE includes negative integer values. */
2290 has_negatives (struct type
*type
)
2292 switch (type
->code ())
2297 return !type
->is_unsigned ();
2298 case TYPE_CODE_RANGE
:
2299 return type
->bounds ()->low
.const_val () - type
->bounds ()->bias
< 0;
2303 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2304 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2305 the unpacked buffer.
2307 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2308 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2310 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2313 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2315 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2318 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2319 gdb_byte
*unpacked
, int unpacked_len
,
2320 int is_big_endian
, int is_signed_type
,
2323 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2324 int src_idx
; /* Index into the source area */
2325 int src_bytes_left
; /* Number of source bytes left to process. */
2326 int srcBitsLeft
; /* Number of source bits left to move */
2327 int unusedLS
; /* Number of bits in next significant
2328 byte of source that are unused */
2330 int unpacked_idx
; /* Index into the unpacked buffer */
2331 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2333 unsigned long accum
; /* Staging area for bits being transferred */
2334 int accumSize
; /* Number of meaningful bits in accum */
2337 /* Transmit bytes from least to most significant; delta is the direction
2338 the indices move. */
2339 int delta
= is_big_endian
? -1 : 1;
2341 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2343 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2344 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2345 bit_size
, unpacked_len
);
2347 srcBitsLeft
= bit_size
;
2348 src_bytes_left
= src_len
;
2349 unpacked_bytes_left
= unpacked_len
;
2354 src_idx
= src_len
- 1;
2356 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2360 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2366 unpacked_idx
= unpacked_len
- 1;
2370 /* Non-scalar values must be aligned at a byte boundary... */
2372 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2373 /* ... And are placed at the beginning (most-significant) bytes
2375 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2376 unpacked_bytes_left
= unpacked_idx
+ 1;
2381 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2383 src_idx
= unpacked_idx
= 0;
2384 unusedLS
= bit_offset
;
2387 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2392 while (src_bytes_left
> 0)
2394 /* Mask for removing bits of the next source byte that are not
2395 part of the value. */
2396 unsigned int unusedMSMask
=
2397 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2399 /* Sign-extend bits for this byte. */
2400 unsigned int signMask
= sign
& ~unusedMSMask
;
2403 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2404 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2405 if (accumSize
>= HOST_CHAR_BIT
)
2407 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2408 accumSize
-= HOST_CHAR_BIT
;
2409 accum
>>= HOST_CHAR_BIT
;
2410 unpacked_bytes_left
-= 1;
2411 unpacked_idx
+= delta
;
2413 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2415 src_bytes_left
-= 1;
2418 while (unpacked_bytes_left
> 0)
2420 accum
|= sign
<< accumSize
;
2421 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2422 accumSize
-= HOST_CHAR_BIT
;
2425 accum
>>= HOST_CHAR_BIT
;
2426 unpacked_bytes_left
-= 1;
2427 unpacked_idx
+= delta
;
2431 /* Create a new value of type TYPE from the contents of OBJ starting
2432 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2433 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2434 assigning through the result will set the field fetched from.
2435 VALADDR is ignored unless OBJ is NULL, in which case,
2436 VALADDR+OFFSET must address the start of storage containing the
2437 packed value. The value returned in this case is never an lval.
2438 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2441 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2442 long offset
, int bit_offset
, int bit_size
,
2446 const gdb_byte
*src
; /* First byte containing data to unpack */
2448 const int is_scalar
= is_scalar_type (type
);
2449 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2450 gdb::byte_vector staging
;
2452 type
= ada_check_typedef (type
);
2455 src
= valaddr
+ offset
;
2457 src
= value_contents (obj
) + offset
;
2459 if (is_dynamic_type (type
))
2461 /* The length of TYPE might by dynamic, so we need to resolve
2462 TYPE in order to know its actual size, which we then use
2463 to create the contents buffer of the value we return.
2464 The difficulty is that the data containing our object is
2465 packed, and therefore maybe not at a byte boundary. So, what
2466 we do, is unpack the data into a byte-aligned buffer, and then
2467 use that buffer as our object's value for resolving the type. */
2468 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2469 staging
.resize (staging_len
);
2471 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2472 staging
.data (), staging
.size (),
2473 is_big_endian
, has_negatives (type
),
2475 type
= resolve_dynamic_type (type
, staging
, 0);
2476 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2478 /* This happens when the length of the object is dynamic,
2479 and is actually smaller than the space reserved for it.
2480 For instance, in an array of variant records, the bit_size
2481 we're given is the array stride, which is constant and
2482 normally equal to the maximum size of its element.
2483 But, in reality, each element only actually spans a portion
2485 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2491 v
= allocate_value (type
);
2492 src
= valaddr
+ offset
;
2494 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2496 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2499 v
= value_at (type
, value_address (obj
) + offset
);
2500 buf
= (gdb_byte
*) alloca (src_len
);
2501 read_memory (value_address (v
), buf
, src_len
);
2506 v
= allocate_value (type
);
2507 src
= value_contents (obj
) + offset
;
2512 long new_offset
= offset
;
2514 set_value_component_location (v
, obj
);
2515 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2516 set_value_bitsize (v
, bit_size
);
2517 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2520 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2522 set_value_offset (v
, new_offset
);
2524 /* Also set the parent value. This is needed when trying to
2525 assign a new value (in inferior memory). */
2526 set_value_parent (v
, obj
);
2529 set_value_bitsize (v
, bit_size
);
2530 unpacked
= value_contents_writeable (v
);
2534 memset (unpacked
, 0, TYPE_LENGTH (type
));
2538 if (staging
.size () == TYPE_LENGTH (type
))
2540 /* Small short-cut: If we've unpacked the data into a buffer
2541 of the same size as TYPE's length, then we can reuse that,
2542 instead of doing the unpacking again. */
2543 memcpy (unpacked
, staging
.data (), staging
.size ());
2546 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2547 unpacked
, TYPE_LENGTH (type
),
2548 is_big_endian
, has_negatives (type
), is_scalar
);
2553 /* Store the contents of FROMVAL into the location of TOVAL.
2554 Return a new value with the location of TOVAL and contents of
2555 FROMVAL. Handles assignment into packed fields that have
2556 floating-point or non-scalar types. */
2558 static struct value
*
2559 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2561 struct type
*type
= value_type (toval
);
2562 int bits
= value_bitsize (toval
);
2564 toval
= ada_coerce_ref (toval
);
2565 fromval
= ada_coerce_ref (fromval
);
2567 if (ada_is_direct_array_type (value_type (toval
)))
2568 toval
= ada_coerce_to_simple_array (toval
);
2569 if (ada_is_direct_array_type (value_type (fromval
)))
2570 fromval
= ada_coerce_to_simple_array (fromval
);
2572 if (!deprecated_value_modifiable (toval
))
2573 error (_("Left operand of assignment is not a modifiable lvalue."));
2575 if (VALUE_LVAL (toval
) == lval_memory
2577 && (type
->code () == TYPE_CODE_FLT
2578 || type
->code () == TYPE_CODE_STRUCT
))
2580 int len
= (value_bitpos (toval
)
2581 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2583 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2585 CORE_ADDR to_addr
= value_address (toval
);
2587 if (type
->code () == TYPE_CODE_FLT
)
2588 fromval
= value_cast (type
, fromval
);
2590 read_memory (to_addr
, buffer
, len
);
2591 from_size
= value_bitsize (fromval
);
2593 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2595 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2596 ULONGEST from_offset
= 0;
2597 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2598 from_offset
= from_size
- bits
;
2599 copy_bitwise (buffer
, value_bitpos (toval
),
2600 value_contents (fromval
), from_offset
,
2601 bits
, is_big_endian
);
2602 write_memory_with_notification (to_addr
, buffer
, len
);
2604 val
= value_copy (toval
);
2605 memcpy (value_contents_raw (val
), value_contents (fromval
),
2606 TYPE_LENGTH (type
));
2607 deprecated_set_value_type (val
, type
);
2612 return value_assign (toval
, fromval
);
2616 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2617 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2618 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2619 COMPONENT, and not the inferior's memory. The current contents
2620 of COMPONENT are ignored.
2622 Although not part of the initial design, this function also works
2623 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2624 had a null address, and COMPONENT had an address which is equal to
2625 its offset inside CONTAINER. */
2628 value_assign_to_component (struct value
*container
, struct value
*component
,
2631 LONGEST offset_in_container
=
2632 (LONGEST
) (value_address (component
) - value_address (container
));
2633 int bit_offset_in_container
=
2634 value_bitpos (component
) - value_bitpos (container
);
2637 val
= value_cast (value_type (component
), val
);
2639 if (value_bitsize (component
) == 0)
2640 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2642 bits
= value_bitsize (component
);
2644 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2648 if (is_scalar_type (check_typedef (value_type (component
))))
2650 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2653 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2654 value_bitpos (container
) + bit_offset_in_container
,
2655 value_contents (val
), src_offset
, bits
, 1);
2658 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2659 value_bitpos (container
) + bit_offset_in_container
,
2660 value_contents (val
), 0, bits
, 0);
2663 /* Determine if TYPE is an access to an unconstrained array. */
2666 ada_is_access_to_unconstrained_array (struct type
*type
)
2668 return (type
->code () == TYPE_CODE_TYPEDEF
2669 && is_thick_pntr (ada_typedef_target_type (type
)));
2672 /* The value of the element of array ARR at the ARITY indices given in IND.
2673 ARR may be either a simple array, GNAT array descriptor, or pointer
2677 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2681 struct type
*elt_type
;
2683 elt
= ada_coerce_to_simple_array (arr
);
2685 elt_type
= ada_check_typedef (value_type (elt
));
2686 if (elt_type
->code () == TYPE_CODE_ARRAY
2687 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2688 return value_subscript_packed (elt
, arity
, ind
);
2690 for (k
= 0; k
< arity
; k
+= 1)
2692 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2694 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2695 error (_("too many subscripts (%d expected)"), k
);
2697 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2699 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2700 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2702 /* The element is a typedef to an unconstrained array,
2703 except that the value_subscript call stripped the
2704 typedef layer. The typedef layer is GNAT's way to
2705 specify that the element is, at the source level, an
2706 access to the unconstrained array, rather than the
2707 unconstrained array. So, we need to restore that
2708 typedef layer, which we can do by forcing the element's
2709 type back to its original type. Otherwise, the returned
2710 value is going to be printed as the array, rather
2711 than as an access. Another symptom of the same issue
2712 would be that an expression trying to dereference the
2713 element would also be improperly rejected. */
2714 deprecated_set_value_type (elt
, saved_elt_type
);
2717 elt_type
= ada_check_typedef (value_type (elt
));
2723 /* Assuming ARR is a pointer to a GDB array, the value of the element
2724 of *ARR at the ARITY indices given in IND.
2725 Does not read the entire array into memory.
2727 Note: Unlike what one would expect, this function is used instead of
2728 ada_value_subscript for basically all non-packed array types. The reason
2729 for this is that a side effect of doing our own pointer arithmetics instead
2730 of relying on value_subscript is that there is no implicit typedef peeling.
2731 This is important for arrays of array accesses, where it allows us to
2732 preserve the fact that the array's element is an array access, where the
2733 access part os encoded in a typedef layer. */
2735 static struct value
*
2736 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2739 struct value
*array_ind
= ada_value_ind (arr
);
2741 = check_typedef (value_enclosing_type (array_ind
));
2743 if (type
->code () == TYPE_CODE_ARRAY
2744 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2745 return value_subscript_packed (array_ind
, arity
, ind
);
2747 for (k
= 0; k
< arity
; k
+= 1)
2751 if (type
->code () != TYPE_CODE_ARRAY
)
2752 error (_("too many subscripts (%d expected)"), k
);
2753 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2755 get_discrete_bounds (type
->index_type (), &lwb
, &upb
);
2756 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2757 type
= TYPE_TARGET_TYPE (type
);
2760 return value_ind (arr
);
2763 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2764 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2765 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2766 this array is LOW, as per Ada rules. */
2767 static struct value
*
2768 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2771 struct type
*type0
= ada_check_typedef (type
);
2772 struct type
*base_index_type
= TYPE_TARGET_TYPE (type0
->index_type ());
2773 struct type
*index_type
2774 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2775 struct type
*slice_type
= create_array_type_with_stride
2776 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2777 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2778 TYPE_FIELD_BITSIZE (type0
, 0));
2779 int base_low
= ada_discrete_type_low_bound (type0
->index_type ());
2780 gdb::optional
<LONGEST
> base_low_pos
, low_pos
;
2783 low_pos
= discrete_position (base_index_type
, low
);
2784 base_low_pos
= discrete_position (base_index_type
, base_low
);
2786 if (!low_pos
.has_value () || !base_low_pos
.has_value ())
2788 warning (_("unable to get positions in slice, use bounds instead"));
2790 base_low_pos
= base_low
;
2793 ULONGEST stride
= TYPE_FIELD_BITSIZE (slice_type
, 0) / 8;
2795 stride
= TYPE_LENGTH (TYPE_TARGET_TYPE (type0
));
2797 base
= value_as_address (array_ptr
) + (*low_pos
- *base_low_pos
) * stride
;
2798 return value_at_lazy (slice_type
, base
);
2802 static struct value
*
2803 ada_value_slice (struct value
*array
, int low
, int high
)
2805 struct type
*type
= ada_check_typedef (value_type (array
));
2806 struct type
*base_index_type
= TYPE_TARGET_TYPE (type
->index_type ());
2807 struct type
*index_type
2808 = create_static_range_type (NULL
, type
->index_type (), low
, high
);
2809 struct type
*slice_type
= create_array_type_with_stride
2810 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2811 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2812 TYPE_FIELD_BITSIZE (type
, 0));
2813 gdb::optional
<LONGEST
> low_pos
, high_pos
;
2816 low_pos
= discrete_position (base_index_type
, low
);
2817 high_pos
= discrete_position (base_index_type
, high
);
2819 if (!low_pos
.has_value () || !high_pos
.has_value ())
2821 warning (_("unable to get positions in slice, use bounds instead"));
2826 return value_cast (slice_type
,
2827 value_slice (array
, low
, *high_pos
- *low_pos
+ 1));
2830 /* If type is a record type in the form of a standard GNAT array
2831 descriptor, returns the number of dimensions for type. If arr is a
2832 simple array, returns the number of "array of"s that prefix its
2833 type designation. Otherwise, returns 0. */
2836 ada_array_arity (struct type
*type
)
2843 type
= desc_base_type (type
);
2846 if (type
->code () == TYPE_CODE_STRUCT
)
2847 return desc_arity (desc_bounds_type (type
));
2849 while (type
->code () == TYPE_CODE_ARRAY
)
2852 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2858 /* If TYPE is a record type in the form of a standard GNAT array
2859 descriptor or a simple array type, returns the element type for
2860 TYPE after indexing by NINDICES indices, or by all indices if
2861 NINDICES is -1. Otherwise, returns NULL. */
2864 ada_array_element_type (struct type
*type
, int nindices
)
2866 type
= desc_base_type (type
);
2868 if (type
->code () == TYPE_CODE_STRUCT
)
2871 struct type
*p_array_type
;
2873 p_array_type
= desc_data_target_type (type
);
2875 k
= ada_array_arity (type
);
2879 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2880 if (nindices
>= 0 && k
> nindices
)
2882 while (k
> 0 && p_array_type
!= NULL
)
2884 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2887 return p_array_type
;
2889 else if (type
->code () == TYPE_CODE_ARRAY
)
2891 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2893 type
= TYPE_TARGET_TYPE (type
);
2902 /* The type of nth index in arrays of given type (n numbering from 1).
2903 Does not examine memory. Throws an error if N is invalid or TYPE
2904 is not an array type. NAME is the name of the Ada attribute being
2905 evaluated ('range, 'first, 'last, or 'length); it is used in building
2906 the error message. */
2908 static struct type
*
2909 ada_index_type (struct type
*type
, int n
, const char *name
)
2911 struct type
*result_type
;
2913 type
= desc_base_type (type
);
2915 if (n
< 0 || n
> ada_array_arity (type
))
2916 error (_("invalid dimension number to '%s"), name
);
2918 if (ada_is_simple_array_type (type
))
2922 for (i
= 1; i
< n
; i
+= 1)
2923 type
= TYPE_TARGET_TYPE (type
);
2924 result_type
= TYPE_TARGET_TYPE (type
->index_type ());
2925 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2926 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2927 perhaps stabsread.c would make more sense. */
2928 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2933 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2934 if (result_type
== NULL
)
2935 error (_("attempt to take bound of something that is not an array"));
2941 /* Given that arr is an array type, returns the lower bound of the
2942 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2943 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2944 array-descriptor type. It works for other arrays with bounds supplied
2945 by run-time quantities other than discriminants. */
2948 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2950 struct type
*type
, *index_type_desc
, *index_type
;
2953 gdb_assert (which
== 0 || which
== 1);
2955 if (ada_is_constrained_packed_array_type (arr_type
))
2956 arr_type
= decode_constrained_packed_array_type (arr_type
);
2958 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2959 return (LONGEST
) - which
;
2961 if (arr_type
->code () == TYPE_CODE_PTR
)
2962 type
= TYPE_TARGET_TYPE (arr_type
);
2966 if (type
->is_fixed_instance ())
2968 /* The array has already been fixed, so we do not need to
2969 check the parallel ___XA type again. That encoding has
2970 already been applied, so ignore it now. */
2971 index_type_desc
= NULL
;
2975 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2976 ada_fixup_array_indexes_type (index_type_desc
);
2979 if (index_type_desc
!= NULL
)
2980 index_type
= to_fixed_range_type (index_type_desc
->field (n
- 1).type (),
2984 struct type
*elt_type
= check_typedef (type
);
2986 for (i
= 1; i
< n
; i
++)
2987 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
2989 index_type
= elt_type
->index_type ();
2993 (LONGEST
) (which
== 0
2994 ? ada_discrete_type_low_bound (index_type
)
2995 : ada_discrete_type_high_bound (index_type
));
2998 /* Given that arr is an array value, returns the lower bound of the
2999 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3000 WHICH is 1. This routine will also work for arrays with bounds
3001 supplied by run-time quantities other than discriminants. */
3004 ada_array_bound (struct value
*arr
, int n
, int which
)
3006 struct type
*arr_type
;
3008 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3009 arr
= value_ind (arr
);
3010 arr_type
= value_enclosing_type (arr
);
3012 if (ada_is_constrained_packed_array_type (arr_type
))
3013 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3014 else if (ada_is_simple_array_type (arr_type
))
3015 return ada_array_bound_from_type (arr_type
, n
, which
);
3017 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3020 /* Given that arr is an array value, returns the length of the
3021 nth index. This routine will also work for arrays with bounds
3022 supplied by run-time quantities other than discriminants.
3023 Does not work for arrays indexed by enumeration types with representation
3024 clauses at the moment. */
3027 ada_array_length (struct value
*arr
, int n
)
3029 struct type
*arr_type
, *index_type
;
3032 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3033 arr
= value_ind (arr
);
3034 arr_type
= value_enclosing_type (arr
);
3036 if (ada_is_constrained_packed_array_type (arr_type
))
3037 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3039 if (ada_is_simple_array_type (arr_type
))
3041 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3042 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3046 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3047 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3050 arr_type
= check_typedef (arr_type
);
3051 index_type
= ada_index_type (arr_type
, n
, "length");
3052 if (index_type
!= NULL
)
3054 struct type
*base_type
;
3055 if (index_type
->code () == TYPE_CODE_RANGE
)
3056 base_type
= TYPE_TARGET_TYPE (index_type
);
3058 base_type
= index_type
;
3060 low
= pos_atr (value_from_longest (base_type
, low
));
3061 high
= pos_atr (value_from_longest (base_type
, high
));
3063 return high
- low
+ 1;
3066 /* An array whose type is that of ARR_TYPE (an array type), with
3067 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3068 less than LOW, then LOW-1 is used. */
3070 static struct value
*
3071 empty_array (struct type
*arr_type
, int low
, int high
)
3073 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3074 struct type
*index_type
3075 = create_static_range_type
3076 (NULL
, TYPE_TARGET_TYPE (arr_type0
->index_type ()), low
,
3077 high
< low
? low
- 1 : high
);
3078 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3080 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3084 /* Name resolution */
3086 /* The "decoded" name for the user-definable Ada operator corresponding
3090 ada_decoded_op_name (enum exp_opcode op
)
3094 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3096 if (ada_opname_table
[i
].op
== op
)
3097 return ada_opname_table
[i
].decoded
;
3099 error (_("Could not find operator name for opcode"));
3102 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3103 in a listing of choices during disambiguation (see sort_choices, below).
3104 The idea is that overloadings of a subprogram name from the
3105 same package should sort in their source order. We settle for ordering
3106 such symbols by their trailing number (__N or $N). */
3109 encoded_ordered_before (const char *N0
, const char *N1
)
3113 else if (N0
== NULL
)
3119 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3121 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3123 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3124 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3129 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3132 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3134 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3135 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3137 return (strcmp (N0
, N1
) < 0);
3141 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3145 sort_choices (struct block_symbol syms
[], int nsyms
)
3149 for (i
= 1; i
< nsyms
; i
+= 1)
3151 struct block_symbol sym
= syms
[i
];
3154 for (j
= i
- 1; j
>= 0; j
-= 1)
3156 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3157 sym
.symbol
->linkage_name ()))
3159 syms
[j
+ 1] = syms
[j
];
3165 /* Whether GDB should display formals and return types for functions in the
3166 overloads selection menu. */
3167 static bool print_signatures
= true;
3169 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3170 all but functions, the signature is just the name of the symbol. For
3171 functions, this is the name of the function, the list of types for formals
3172 and the return type (if any). */
3175 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3176 const struct type_print_options
*flags
)
3178 struct type
*type
= SYMBOL_TYPE (sym
);
3180 fprintf_filtered (stream
, "%s", sym
->print_name ());
3181 if (!print_signatures
3183 || type
->code () != TYPE_CODE_FUNC
)
3186 if (type
->num_fields () > 0)
3190 fprintf_filtered (stream
, " (");
3191 for (i
= 0; i
< type
->num_fields (); ++i
)
3194 fprintf_filtered (stream
, "; ");
3195 ada_print_type (type
->field (i
).type (), NULL
, stream
, -1, 0,
3198 fprintf_filtered (stream
, ")");
3200 if (TYPE_TARGET_TYPE (type
) != NULL
3201 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3203 fprintf_filtered (stream
, " return ");
3204 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3208 /* Read and validate a set of numeric choices from the user in the
3209 range 0 .. N_CHOICES-1. Place the results in increasing
3210 order in CHOICES[0 .. N-1], and return N.
3212 The user types choices as a sequence of numbers on one line
3213 separated by blanks, encoding them as follows:
3215 + A choice of 0 means to cancel the selection, throwing an error.
3216 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3217 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3219 The user is not allowed to choose more than MAX_RESULTS values.
3221 ANNOTATION_SUFFIX, if present, is used to annotate the input
3222 prompts (for use with the -f switch). */
3225 get_selections (int *choices
, int n_choices
, int max_results
,
3226 int is_all_choice
, const char *annotation_suffix
)
3231 int first_choice
= is_all_choice
? 2 : 1;
3233 prompt
= getenv ("PS2");
3237 args
= command_line_input (prompt
, annotation_suffix
);
3240 error_no_arg (_("one or more choice numbers"));
3244 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3245 order, as given in args. Choices are validated. */
3251 args
= skip_spaces (args
);
3252 if (*args
== '\0' && n_chosen
== 0)
3253 error_no_arg (_("one or more choice numbers"));
3254 else if (*args
== '\0')
3257 choice
= strtol (args
, &args2
, 10);
3258 if (args
== args2
|| choice
< 0
3259 || choice
> n_choices
+ first_choice
- 1)
3260 error (_("Argument must be choice number"));
3264 error (_("cancelled"));
3266 if (choice
< first_choice
)
3268 n_chosen
= n_choices
;
3269 for (j
= 0; j
< n_choices
; j
+= 1)
3273 choice
-= first_choice
;
3275 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3279 if (j
< 0 || choice
!= choices
[j
])
3283 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3284 choices
[k
+ 1] = choices
[k
];
3285 choices
[j
+ 1] = choice
;
3290 if (n_chosen
> max_results
)
3291 error (_("Select no more than %d of the above"), max_results
);
3296 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3297 by asking the user (if necessary), returning the number selected,
3298 and setting the first elements of SYMS items. Error if no symbols
3301 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3302 to be re-integrated one of these days. */
3305 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3308 int *chosen
= XALLOCAVEC (int , nsyms
);
3310 int first_choice
= (max_results
== 1) ? 1 : 2;
3311 const char *select_mode
= multiple_symbols_select_mode ();
3313 if (max_results
< 1)
3314 error (_("Request to select 0 symbols!"));
3318 if (select_mode
== multiple_symbols_cancel
)
3320 canceled because the command is ambiguous\n\
3321 See set/show multiple-symbol."));
3323 /* If select_mode is "all", then return all possible symbols.
3324 Only do that if more than one symbol can be selected, of course.
3325 Otherwise, display the menu as usual. */
3326 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3329 printf_filtered (_("[0] cancel\n"));
3330 if (max_results
> 1)
3331 printf_filtered (_("[1] all\n"));
3333 sort_choices (syms
, nsyms
);
3335 for (i
= 0; i
< nsyms
; i
+= 1)
3337 if (syms
[i
].symbol
== NULL
)
3340 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3342 struct symtab_and_line sal
=
3343 find_function_start_sal (syms
[i
].symbol
, 1);
3345 printf_filtered ("[%d] ", i
+ first_choice
);
3346 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3347 &type_print_raw_options
);
3348 if (sal
.symtab
== NULL
)
3349 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3350 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3354 styled_string (file_name_style
.style (),
3355 symtab_to_filename_for_display (sal
.symtab
)),
3362 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3363 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3364 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3365 struct symtab
*symtab
= NULL
;
3367 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3368 symtab
= symbol_symtab (syms
[i
].symbol
);
3370 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3372 printf_filtered ("[%d] ", i
+ first_choice
);
3373 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3374 &type_print_raw_options
);
3375 printf_filtered (_(" at %s:%d\n"),
3376 symtab_to_filename_for_display (symtab
),
3377 SYMBOL_LINE (syms
[i
].symbol
));
3379 else if (is_enumeral
3380 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3382 printf_filtered (("[%d] "), i
+ first_choice
);
3383 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3384 gdb_stdout
, -1, 0, &type_print_raw_options
);
3385 printf_filtered (_("'(%s) (enumeral)\n"),
3386 syms
[i
].symbol
->print_name ());
3390 printf_filtered ("[%d] ", i
+ first_choice
);
3391 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3392 &type_print_raw_options
);
3395 printf_filtered (is_enumeral
3396 ? _(" in %s (enumeral)\n")
3398 symtab_to_filename_for_display (symtab
));
3400 printf_filtered (is_enumeral
3401 ? _(" (enumeral)\n")
3407 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3410 for (i
= 0; i
< n_chosen
; i
+= 1)
3411 syms
[i
] = syms
[chosen
[i
]];
3416 /* Resolve the operator of the subexpression beginning at
3417 position *POS of *EXPP. "Resolving" consists of replacing
3418 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3419 with their resolutions, replacing built-in operators with
3420 function calls to user-defined operators, where appropriate, and,
3421 when DEPROCEDURE_P is non-zero, converting function-valued variables
3422 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3423 are as in ada_resolve, above. */
3425 static struct value
*
3426 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3427 struct type
*context_type
, int parse_completion
,
3428 innermost_block_tracker
*tracker
)
3432 struct expression
*exp
; /* Convenience: == *expp. */
3433 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3434 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3435 int nargs
; /* Number of operands. */
3437 /* If we're resolving an expression like ARRAY(ARG...), then we set
3438 this to the type of the array, so we can use the index types as
3439 the expected types for resolution. */
3440 struct type
*array_type
= nullptr;
3441 /* The arity of ARRAY_TYPE. */
3442 int array_arity
= 0;
3448 /* Pass one: resolve operands, saving their types and updating *pos,
3453 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3454 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3459 struct value
*lhs
= resolve_subexp (expp
, pos
, 0, NULL
,
3460 parse_completion
, tracker
);
3461 struct type
*lhstype
= ada_check_typedef (value_type (lhs
));
3462 array_arity
= ada_array_arity (lhstype
);
3463 if (array_arity
> 0)
3464 array_type
= lhstype
;
3466 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3471 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3476 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3477 parse_completion
, tracker
);
3480 case OP_ATR_MODULUS
:
3490 case TERNOP_IN_RANGE
:
3491 case BINOP_IN_BOUNDS
:
3497 case OP_DISCRETE_RANGE
:
3499 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3508 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3510 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3512 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3530 case BINOP_LOGICAL_AND
:
3531 case BINOP_LOGICAL_OR
:
3532 case BINOP_BITWISE_AND
:
3533 case BINOP_BITWISE_IOR
:
3534 case BINOP_BITWISE_XOR
:
3537 case BINOP_NOTEQUAL
:
3544 case BINOP_SUBSCRIPT
:
3552 case UNOP_LOGICAL_NOT
:
3562 case OP_VAR_MSYM_VALUE
:
3569 case OP_INTERNALVAR
:
3579 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3582 case STRUCTOP_STRUCT
:
3583 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3596 error (_("Unexpected operator during name resolution"));
3599 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3600 for (i
= 0; i
< nargs
; i
+= 1)
3602 struct type
*subtype
= nullptr;
3603 if (i
< array_arity
)
3604 subtype
= ada_index_type (array_type
, i
+ 1, "array type");
3605 argvec
[i
] = resolve_subexp (expp
, pos
, 1, subtype
, parse_completion
,
3611 /* Pass two: perform any resolution on principal operator. */
3618 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3620 std::vector
<struct block_symbol
> candidates
3621 = ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3622 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
);
3624 if (std::any_of (candidates
.begin (),
3626 [] (block_symbol
&sym
)
3628 switch (SYMBOL_CLASS (sym
.symbol
))
3633 case LOC_REGPARM_ADDR
:
3642 /* Types tend to get re-introduced locally, so if there
3643 are any local symbols that are not types, first filter
3647 (candidates
.begin (),
3649 [] (block_symbol
&sym
)
3651 return SYMBOL_CLASS (sym
.symbol
) == LOC_TYPEDEF
;
3656 if (candidates
.empty ())
3657 error (_("No definition found for %s"),
3658 exp
->elts
[pc
+ 2].symbol
->print_name ());
3659 else if (candidates
.size () == 1)
3661 else if (deprocedure_p
&& !is_nonfunction (candidates
))
3663 i
= ada_resolve_function
3664 (candidates
, NULL
, 0,
3665 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3666 context_type
, parse_completion
);
3668 error (_("Could not find a match for %s"),
3669 exp
->elts
[pc
+ 2].symbol
->print_name ());
3673 printf_filtered (_("Multiple matches for %s\n"),
3674 exp
->elts
[pc
+ 2].symbol
->print_name ());
3675 user_select_syms (candidates
.data (), candidates
.size (), 1);
3679 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3680 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3681 tracker
->update (candidates
[i
]);
3685 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3688 replace_operator_with_call (expp
, pc
, 0, 4,
3689 exp
->elts
[pc
+ 2].symbol
,
3690 exp
->elts
[pc
+ 1].block
);
3697 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3698 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3700 std::vector
<struct block_symbol
> candidates
3701 = ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3702 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
);
3704 if (candidates
.size () == 1)
3708 i
= ada_resolve_function
3711 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3712 context_type
, parse_completion
);
3714 error (_("Could not find a match for %s"),
3715 exp
->elts
[pc
+ 5].symbol
->print_name ());
3718 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3719 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3720 tracker
->update (candidates
[i
]);
3731 case BINOP_BITWISE_AND
:
3732 case BINOP_BITWISE_IOR
:
3733 case BINOP_BITWISE_XOR
:
3735 case BINOP_NOTEQUAL
:
3743 case UNOP_LOGICAL_NOT
:
3745 if (possible_user_operator_p (op
, argvec
))
3747 std::vector
<struct block_symbol
> candidates
3748 = ada_lookup_symbol_list (ada_decoded_op_name (op
),
3751 i
= ada_resolve_function (candidates
, argvec
,
3752 nargs
, ada_decoded_op_name (op
), NULL
,
3757 replace_operator_with_call (expp
, pc
, nargs
, 1,
3758 candidates
[i
].symbol
,
3759 candidates
[i
].block
);
3770 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3771 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3772 exp
->elts
[pc
+ 1].objfile
,
3773 exp
->elts
[pc
+ 2].msymbol
);
3775 return evaluate_subexp_type (exp
, pos
);
3778 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3779 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3781 /* The term "match" here is rather loose. The match is heuristic and
3785 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3787 ftype
= ada_check_typedef (ftype
);
3788 atype
= ada_check_typedef (atype
);
3790 if (ftype
->code () == TYPE_CODE_REF
)
3791 ftype
= TYPE_TARGET_TYPE (ftype
);
3792 if (atype
->code () == TYPE_CODE_REF
)
3793 atype
= TYPE_TARGET_TYPE (atype
);
3795 switch (ftype
->code ())
3798 return ftype
->code () == atype
->code ();
3800 if (atype
->code () == TYPE_CODE_PTR
)
3801 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3802 TYPE_TARGET_TYPE (atype
), 0);
3805 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3807 case TYPE_CODE_ENUM
:
3808 case TYPE_CODE_RANGE
:
3809 switch (atype
->code ())
3812 case TYPE_CODE_ENUM
:
3813 case TYPE_CODE_RANGE
:
3819 case TYPE_CODE_ARRAY
:
3820 return (atype
->code () == TYPE_CODE_ARRAY
3821 || ada_is_array_descriptor_type (atype
));
3823 case TYPE_CODE_STRUCT
:
3824 if (ada_is_array_descriptor_type (ftype
))
3825 return (atype
->code () == TYPE_CODE_ARRAY
3826 || ada_is_array_descriptor_type (atype
));
3828 return (atype
->code () == TYPE_CODE_STRUCT
3829 && !ada_is_array_descriptor_type (atype
));
3831 case TYPE_CODE_UNION
:
3833 return (atype
->code () == ftype
->code ());
3837 /* Return non-zero if the formals of FUNC "sufficiently match" the
3838 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3839 may also be an enumeral, in which case it is treated as a 0-
3840 argument function. */
3843 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3846 struct type
*func_type
= SYMBOL_TYPE (func
);
3848 if (SYMBOL_CLASS (func
) == LOC_CONST
3849 && func_type
->code () == TYPE_CODE_ENUM
)
3850 return (n_actuals
== 0);
3851 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3854 if (func_type
->num_fields () != n_actuals
)
3857 for (i
= 0; i
< n_actuals
; i
+= 1)
3859 if (actuals
[i
] == NULL
)
3863 struct type
*ftype
= ada_check_typedef (func_type
->field (i
).type ());
3864 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3866 if (!ada_type_match (ftype
, atype
, 1))
3873 /* False iff function type FUNC_TYPE definitely does not produce a value
3874 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3875 FUNC_TYPE is not a valid function type with a non-null return type
3876 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3879 return_match (struct type
*func_type
, struct type
*context_type
)
3881 struct type
*return_type
;
3883 if (func_type
== NULL
)
3886 if (func_type
->code () == TYPE_CODE_FUNC
)
3887 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3889 return_type
= get_base_type (func_type
);
3890 if (return_type
== NULL
)
3893 context_type
= get_base_type (context_type
);
3895 if (return_type
->code () == TYPE_CODE_ENUM
)
3896 return context_type
== NULL
|| return_type
== context_type
;
3897 else if (context_type
== NULL
)
3898 return return_type
->code () != TYPE_CODE_VOID
;
3900 return return_type
->code () == context_type
->code ();
3904 /* Returns the index in SYMS that contains the symbol for the
3905 function (if any) that matches the types of the NARGS arguments in
3906 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3907 that returns that type, then eliminate matches that don't. If
3908 CONTEXT_TYPE is void and there is at least one match that does not
3909 return void, eliminate all matches that do.
3911 Asks the user if there is more than one match remaining. Returns -1
3912 if there is no such symbol or none is selected. NAME is used
3913 solely for messages. May re-arrange and modify SYMS in
3914 the process; the index returned is for the modified vector. */
3917 ada_resolve_function (std::vector
<struct block_symbol
> &syms
,
3918 struct value
**args
, int nargs
,
3919 const char *name
, struct type
*context_type
,
3920 int parse_completion
)
3924 int m
; /* Number of hits */
3927 /* In the first pass of the loop, we only accept functions matching
3928 context_type. If none are found, we add a second pass of the loop
3929 where every function is accepted. */
3930 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3932 for (k
= 0; k
< syms
.size (); k
+= 1)
3934 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3936 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3937 && (fallback
|| return_match (type
, context_type
)))
3945 /* If we got multiple matches, ask the user which one to use. Don't do this
3946 interactive thing during completion, though, as the purpose of the
3947 completion is providing a list of all possible matches. Prompting the
3948 user to filter it down would be completely unexpected in this case. */
3951 else if (m
> 1 && !parse_completion
)
3953 printf_filtered (_("Multiple matches for %s\n"), name
);
3954 user_select_syms (syms
.data (), m
, 1);
3960 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3961 on the function identified by SYM and BLOCK, and taking NARGS
3962 arguments. Update *EXPP as needed to hold more space. */
3965 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
3966 int oplen
, struct symbol
*sym
,
3967 const struct block
*block
)
3969 /* We want to add 6 more elements (3 for funcall, 4 for function
3970 symbol, -OPLEN for operator being replaced) to the
3972 struct expression
*exp
= expp
->get ();
3973 int save_nelts
= exp
->nelts
;
3974 int extra_elts
= 7 - oplen
;
3975 exp
->nelts
+= extra_elts
;
3978 exp
->resize (exp
->nelts
);
3979 memmove (exp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3980 EXP_ELEM_TO_BYTES (save_nelts
- pc
- oplen
));
3982 exp
->resize (exp
->nelts
);
3984 exp
->elts
[pc
].opcode
= exp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3985 exp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3987 exp
->elts
[pc
+ 3].opcode
= exp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3988 exp
->elts
[pc
+ 4].block
= block
;
3989 exp
->elts
[pc
+ 5].symbol
= sym
;
3992 /* Type-class predicates */
3994 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3998 numeric_type_p (struct type
*type
)
4004 switch (type
->code ())
4009 case TYPE_CODE_RANGE
:
4010 return (type
== TYPE_TARGET_TYPE (type
)
4011 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4018 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4021 integer_type_p (struct type
*type
)
4027 switch (type
->code ())
4031 case TYPE_CODE_RANGE
:
4032 return (type
== TYPE_TARGET_TYPE (type
)
4033 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4040 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4043 scalar_type_p (struct type
*type
)
4049 switch (type
->code ())
4052 case TYPE_CODE_RANGE
:
4053 case TYPE_CODE_ENUM
:
4062 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4065 discrete_type_p (struct type
*type
)
4071 switch (type
->code ())
4074 case TYPE_CODE_RANGE
:
4075 case TYPE_CODE_ENUM
:
4076 case TYPE_CODE_BOOL
:
4084 /* Returns non-zero if OP with operands in the vector ARGS could be
4085 a user-defined function. Errs on the side of pre-defined operators
4086 (i.e., result 0). */
4089 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4091 struct type
*type0
=
4092 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4093 struct type
*type1
=
4094 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4108 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4112 case BINOP_BITWISE_AND
:
4113 case BINOP_BITWISE_IOR
:
4114 case BINOP_BITWISE_XOR
:
4115 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4118 case BINOP_NOTEQUAL
:
4123 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4126 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4129 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4133 case UNOP_LOGICAL_NOT
:
4135 return (!numeric_type_p (type0
));
4144 1. In the following, we assume that a renaming type's name may
4145 have an ___XD suffix. It would be nice if this went away at some
4147 2. We handle both the (old) purely type-based representation of
4148 renamings and the (new) variable-based encoding. At some point,
4149 it is devoutly to be hoped that the former goes away
4150 (FIXME: hilfinger-2007-07-09).
4151 3. Subprogram renamings are not implemented, although the XRS
4152 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4154 /* If SYM encodes a renaming,
4156 <renaming> renames <renamed entity>,
4158 sets *LEN to the length of the renamed entity's name,
4159 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4160 the string describing the subcomponent selected from the renamed
4161 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4162 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4163 are undefined). Otherwise, returns a value indicating the category
4164 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4165 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4166 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4167 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4168 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4169 may be NULL, in which case they are not assigned.
4171 [Currently, however, GCC does not generate subprogram renamings.] */
4173 enum ada_renaming_category
4174 ada_parse_renaming (struct symbol
*sym
,
4175 const char **renamed_entity
, int *len
,
4176 const char **renaming_expr
)
4178 enum ada_renaming_category kind
;
4183 return ADA_NOT_RENAMING
;
4184 switch (SYMBOL_CLASS (sym
))
4187 return ADA_NOT_RENAMING
;
4191 case LOC_OPTIMIZED_OUT
:
4192 info
= strstr (sym
->linkage_name (), "___XR");
4194 return ADA_NOT_RENAMING
;
4198 kind
= ADA_OBJECT_RENAMING
;
4202 kind
= ADA_EXCEPTION_RENAMING
;
4206 kind
= ADA_PACKAGE_RENAMING
;
4210 kind
= ADA_SUBPROGRAM_RENAMING
;
4214 return ADA_NOT_RENAMING
;
4218 if (renamed_entity
!= NULL
)
4219 *renamed_entity
= info
;
4220 suffix
= strstr (info
, "___XE");
4221 if (suffix
== NULL
|| suffix
== info
)
4222 return ADA_NOT_RENAMING
;
4224 *len
= strlen (info
) - strlen (suffix
);
4226 if (renaming_expr
!= NULL
)
4227 *renaming_expr
= suffix
;
4231 /* Compute the value of the given RENAMING_SYM, which is expected to
4232 be a symbol encoding a renaming expression. BLOCK is the block
4233 used to evaluate the renaming. */
4235 static struct value
*
4236 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4237 const struct block
*block
)
4239 const char *sym_name
;
4241 sym_name
= renaming_sym
->linkage_name ();
4242 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4243 return evaluate_expression (expr
.get ());
4247 /* Evaluation: Function Calls */
4249 /* Return an lvalue containing the value VAL. This is the identity on
4250 lvalues, and otherwise has the side-effect of allocating memory
4251 in the inferior where a copy of the value contents is copied. */
4253 static struct value
*
4254 ensure_lval (struct value
*val
)
4256 if (VALUE_LVAL (val
) == not_lval
4257 || VALUE_LVAL (val
) == lval_internalvar
)
4259 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4260 const CORE_ADDR addr
=
4261 value_as_long (value_allocate_space_in_inferior (len
));
4263 VALUE_LVAL (val
) = lval_memory
;
4264 set_value_address (val
, addr
);
4265 write_memory (addr
, value_contents (val
), len
);
4271 /* Given ARG, a value of type (pointer or reference to a)*
4272 structure/union, extract the component named NAME from the ultimate
4273 target structure/union and return it as a value with its
4276 The routine searches for NAME among all members of the structure itself
4277 and (recursively) among all members of any wrapper members
4280 If NO_ERR, then simply return NULL in case of error, rather than
4283 static struct value
*
4284 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4286 struct type
*t
, *t1
;
4291 t1
= t
= ada_check_typedef (value_type (arg
));
4292 if (t
->code () == TYPE_CODE_REF
)
4294 t1
= TYPE_TARGET_TYPE (t
);
4297 t1
= ada_check_typedef (t1
);
4298 if (t1
->code () == TYPE_CODE_PTR
)
4300 arg
= coerce_ref (arg
);
4305 while (t
->code () == TYPE_CODE_PTR
)
4307 t1
= TYPE_TARGET_TYPE (t
);
4310 t1
= ada_check_typedef (t1
);
4311 if (t1
->code () == TYPE_CODE_PTR
)
4313 arg
= value_ind (arg
);
4320 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4324 v
= ada_search_struct_field (name
, arg
, 0, t
);
4327 int bit_offset
, bit_size
, byte_offset
;
4328 struct type
*field_type
;
4331 if (t
->code () == TYPE_CODE_PTR
)
4332 address
= value_address (ada_value_ind (arg
));
4334 address
= value_address (ada_coerce_ref (arg
));
4336 /* Check to see if this is a tagged type. We also need to handle
4337 the case where the type is a reference to a tagged type, but
4338 we have to be careful to exclude pointers to tagged types.
4339 The latter should be shown as usual (as a pointer), whereas
4340 a reference should mostly be transparent to the user. */
4342 if (ada_is_tagged_type (t1
, 0)
4343 || (t1
->code () == TYPE_CODE_REF
4344 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4346 /* We first try to find the searched field in the current type.
4347 If not found then let's look in the fixed type. */
4349 if (!find_struct_field (name
, t1
, 0,
4350 &field_type
, &byte_offset
, &bit_offset
,
4359 /* Convert to fixed type in all cases, so that we have proper
4360 offsets to each field in unconstrained record types. */
4361 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4362 address
, NULL
, check_tag
);
4364 /* Resolve the dynamic type as well. */
4365 arg
= value_from_contents_and_address (t1
, nullptr, address
);
4366 t1
= value_type (arg
);
4368 if (find_struct_field (name
, t1
, 0,
4369 &field_type
, &byte_offset
, &bit_offset
,
4374 if (t
->code () == TYPE_CODE_REF
)
4375 arg
= ada_coerce_ref (arg
);
4377 arg
= ada_value_ind (arg
);
4378 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4379 bit_offset
, bit_size
,
4383 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4387 if (v
!= NULL
|| no_err
)
4390 error (_("There is no member named %s."), name
);
4396 error (_("Attempt to extract a component of "
4397 "a value that is not a record."));
4400 /* Return the value ACTUAL, converted to be an appropriate value for a
4401 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4402 allocating any necessary descriptors (fat pointers), or copies of
4403 values not residing in memory, updating it as needed. */
4406 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4408 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4409 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4410 struct type
*formal_target
=
4411 formal_type
->code () == TYPE_CODE_PTR
4412 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4413 struct type
*actual_target
=
4414 actual_type
->code () == TYPE_CODE_PTR
4415 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4417 if (ada_is_array_descriptor_type (formal_target
)
4418 && actual_target
->code () == TYPE_CODE_ARRAY
)
4419 return make_array_descriptor (formal_type
, actual
);
4420 else if (formal_type
->code () == TYPE_CODE_PTR
4421 || formal_type
->code () == TYPE_CODE_REF
)
4423 struct value
*result
;
4425 if (formal_target
->code () == TYPE_CODE_ARRAY
4426 && ada_is_array_descriptor_type (actual_target
))
4427 result
= desc_data (actual
);
4428 else if (formal_type
->code () != TYPE_CODE_PTR
)
4430 if (VALUE_LVAL (actual
) != lval_memory
)
4434 actual_type
= ada_check_typedef (value_type (actual
));
4435 val
= allocate_value (actual_type
);
4436 memcpy ((char *) value_contents_raw (val
),
4437 (char *) value_contents (actual
),
4438 TYPE_LENGTH (actual_type
));
4439 actual
= ensure_lval (val
);
4441 result
= value_addr (actual
);
4445 return value_cast_pointers (formal_type
, result
, 0);
4447 else if (actual_type
->code () == TYPE_CODE_PTR
)
4448 return ada_value_ind (actual
);
4449 else if (ada_is_aligner_type (formal_type
))
4451 /* We need to turn this parameter into an aligner type
4453 struct value
*aligner
= allocate_value (formal_type
);
4454 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4456 value_assign_to_component (aligner
, component
, actual
);
4463 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4464 type TYPE. This is usually an inefficient no-op except on some targets
4465 (such as AVR) where the representation of a pointer and an address
4469 value_pointer (struct value
*value
, struct type
*type
)
4471 unsigned len
= TYPE_LENGTH (type
);
4472 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4475 addr
= value_address (value
);
4476 gdbarch_address_to_pointer (type
->arch (), type
, buf
, addr
);
4477 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4482 /* Push a descriptor of type TYPE for array value ARR on the stack at
4483 *SP, updating *SP to reflect the new descriptor. Return either
4484 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4485 to-descriptor type rather than a descriptor type), a struct value *
4486 representing a pointer to this descriptor. */
4488 static struct value
*
4489 make_array_descriptor (struct type
*type
, struct value
*arr
)
4491 struct type
*bounds_type
= desc_bounds_type (type
);
4492 struct type
*desc_type
= desc_base_type (type
);
4493 struct value
*descriptor
= allocate_value (desc_type
);
4494 struct value
*bounds
= allocate_value (bounds_type
);
4497 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4500 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4501 ada_array_bound (arr
, i
, 0),
4502 desc_bound_bitpos (bounds_type
, i
, 0),
4503 desc_bound_bitsize (bounds_type
, i
, 0));
4504 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4505 ada_array_bound (arr
, i
, 1),
4506 desc_bound_bitpos (bounds_type
, i
, 1),
4507 desc_bound_bitsize (bounds_type
, i
, 1));
4510 bounds
= ensure_lval (bounds
);
4512 modify_field (value_type (descriptor
),
4513 value_contents_writeable (descriptor
),
4514 value_pointer (ensure_lval (arr
),
4515 desc_type
->field (0).type ()),
4516 fat_pntr_data_bitpos (desc_type
),
4517 fat_pntr_data_bitsize (desc_type
));
4519 modify_field (value_type (descriptor
),
4520 value_contents_writeable (descriptor
),
4521 value_pointer (bounds
,
4522 desc_type
->field (1).type ()),
4523 fat_pntr_bounds_bitpos (desc_type
),
4524 fat_pntr_bounds_bitsize (desc_type
));
4526 descriptor
= ensure_lval (descriptor
);
4528 if (type
->code () == TYPE_CODE_PTR
)
4529 return value_addr (descriptor
);
4534 /* Symbol Cache Module */
4536 /* Performance measurements made as of 2010-01-15 indicate that
4537 this cache does bring some noticeable improvements. Depending
4538 on the type of entity being printed, the cache can make it as much
4539 as an order of magnitude faster than without it.
4541 The descriptive type DWARF extension has significantly reduced
4542 the need for this cache, at least when DWARF is being used. However,
4543 even in this case, some expensive name-based symbol searches are still
4544 sometimes necessary - to find an XVZ variable, mostly. */
4546 /* Return the symbol cache associated to the given program space PSPACE.
4547 If not allocated for this PSPACE yet, allocate and initialize one. */
4549 static struct ada_symbol_cache
*
4550 ada_get_symbol_cache (struct program_space
*pspace
)
4552 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4554 if (pspace_data
->sym_cache
== nullptr)
4555 pspace_data
->sym_cache
.reset (new ada_symbol_cache
);
4557 return pspace_data
->sym_cache
.get ();
4560 /* Clear all entries from the symbol cache. */
4563 ada_clear_symbol_cache ()
4565 struct ada_pspace_data
*pspace_data
4566 = get_ada_pspace_data (current_program_space
);
4568 if (pspace_data
->sym_cache
!= nullptr)
4569 pspace_data
->sym_cache
.reset ();
4572 /* Search our cache for an entry matching NAME and DOMAIN.
4573 Return it if found, or NULL otherwise. */
4575 static struct cache_entry
**
4576 find_entry (const char *name
, domain_enum domain
)
4578 struct ada_symbol_cache
*sym_cache
4579 = ada_get_symbol_cache (current_program_space
);
4580 int h
= msymbol_hash (name
) % HASH_SIZE
;
4581 struct cache_entry
**e
;
4583 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4585 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4591 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4592 Return 1 if found, 0 otherwise.
4594 If an entry was found and SYM is not NULL, set *SYM to the entry's
4595 SYM. Same principle for BLOCK if not NULL. */
4598 lookup_cached_symbol (const char *name
, domain_enum domain
,
4599 struct symbol
**sym
, const struct block
**block
)
4601 struct cache_entry
**e
= find_entry (name
, domain
);
4608 *block
= (*e
)->block
;
4612 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4613 in domain DOMAIN, save this result in our symbol cache. */
4616 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4617 const struct block
*block
)
4619 struct ada_symbol_cache
*sym_cache
4620 = ada_get_symbol_cache (current_program_space
);
4622 struct cache_entry
*e
;
4624 /* Symbols for builtin types don't have a block.
4625 For now don't cache such symbols. */
4626 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4629 /* If the symbol is a local symbol, then do not cache it, as a search
4630 for that symbol depends on the context. To determine whether
4631 the symbol is local or not, we check the block where we found it
4632 against the global and static blocks of its associated symtab. */
4634 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4635 GLOBAL_BLOCK
) != block
4636 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4637 STATIC_BLOCK
) != block
)
4640 h
= msymbol_hash (name
) % HASH_SIZE
;
4641 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4642 e
->next
= sym_cache
->root
[h
];
4643 sym_cache
->root
[h
] = e
;
4644 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4652 /* Return the symbol name match type that should be used used when
4653 searching for all symbols matching LOOKUP_NAME.
4655 LOOKUP_NAME is expected to be a symbol name after transformation
4658 static symbol_name_match_type
4659 name_match_type_from_name (const char *lookup_name
)
4661 return (strstr (lookup_name
, "__") == NULL
4662 ? symbol_name_match_type::WILD
4663 : symbol_name_match_type::FULL
);
4666 /* Return the result of a standard (literal, C-like) lookup of NAME in
4667 given DOMAIN, visible from lexical block BLOCK. */
4669 static struct symbol
*
4670 standard_lookup (const char *name
, const struct block
*block
,
4673 /* Initialize it just to avoid a GCC false warning. */
4674 struct block_symbol sym
= {};
4676 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4678 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4679 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4684 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4685 in the symbol fields of SYMS. We treat enumerals as functions,
4686 since they contend in overloading in the same way. */
4688 is_nonfunction (const std::vector
<struct block_symbol
> &syms
)
4690 for (const block_symbol
&sym
: syms
)
4691 if (SYMBOL_TYPE (sym
.symbol
)->code () != TYPE_CODE_FUNC
4692 && (SYMBOL_TYPE (sym
.symbol
)->code () != TYPE_CODE_ENUM
4693 || SYMBOL_CLASS (sym
.symbol
) != LOC_CONST
))
4699 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4700 struct types. Otherwise, they may not. */
4703 equiv_types (struct type
*type0
, struct type
*type1
)
4707 if (type0
== NULL
|| type1
== NULL
4708 || type0
->code () != type1
->code ())
4710 if ((type0
->code () == TYPE_CODE_STRUCT
4711 || type0
->code () == TYPE_CODE_ENUM
)
4712 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4713 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4719 /* True iff SYM0 represents the same entity as SYM1, or one that is
4720 no more defined than that of SYM1. */
4723 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4727 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4728 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4731 switch (SYMBOL_CLASS (sym0
))
4737 struct type
*type0
= SYMBOL_TYPE (sym0
);
4738 struct type
*type1
= SYMBOL_TYPE (sym1
);
4739 const char *name0
= sym0
->linkage_name ();
4740 const char *name1
= sym1
->linkage_name ();
4741 int len0
= strlen (name0
);
4744 type0
->code () == type1
->code ()
4745 && (equiv_types (type0
, type1
)
4746 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4747 && startswith (name1
+ len0
, "___XV")));
4750 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4751 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4755 const char *name0
= sym0
->linkage_name ();
4756 const char *name1
= sym1
->linkage_name ();
4757 return (strcmp (name0
, name1
) == 0
4758 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4766 /* Append (SYM,BLOCK) to the end of the array of struct block_symbol
4767 records in RESULT. Do nothing if SYM is a duplicate. */
4770 add_defn_to_vec (std::vector
<struct block_symbol
> &result
,
4772 const struct block
*block
)
4774 /* Do not try to complete stub types, as the debugger is probably
4775 already scanning all symbols matching a certain name at the
4776 time when this function is called. Trying to replace the stub
4777 type by its associated full type will cause us to restart a scan
4778 which may lead to an infinite recursion. Instead, the client
4779 collecting the matching symbols will end up collecting several
4780 matches, with at least one of them complete. It can then filter
4781 out the stub ones if needed. */
4783 for (int i
= result
.size () - 1; i
>= 0; i
-= 1)
4785 if (lesseq_defined_than (sym
, result
[i
].symbol
))
4787 else if (lesseq_defined_than (result
[i
].symbol
, sym
))
4789 result
[i
].symbol
= sym
;
4790 result
[i
].block
= block
;
4795 struct block_symbol info
;
4798 result
.push_back (info
);
4801 /* Return a bound minimal symbol matching NAME according to Ada
4802 decoding rules. Returns an invalid symbol if there is no such
4803 minimal symbol. Names prefixed with "standard__" are handled
4804 specially: "standard__" is first stripped off, and only static and
4805 global symbols are searched. */
4807 struct bound_minimal_symbol
4808 ada_lookup_simple_minsym (const char *name
)
4810 struct bound_minimal_symbol result
;
4812 memset (&result
, 0, sizeof (result
));
4814 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4815 lookup_name_info
lookup_name (name
, match_type
);
4817 symbol_name_matcher_ftype
*match_name
4818 = ada_get_symbol_name_matcher (lookup_name
);
4820 for (objfile
*objfile
: current_program_space
->objfiles ())
4822 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4824 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4825 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4827 result
.minsym
= msymbol
;
4828 result
.objfile
= objfile
;
4837 /* For all subprograms that statically enclose the subprogram of the
4838 selected frame, add symbols matching identifier NAME in DOMAIN
4839 and their blocks to the list of data in RESULT, as for
4840 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4841 with a wildcard prefix. */
4844 add_symbols_from_enclosing_procs (std::vector
<struct block_symbol
> &result
,
4845 const lookup_name_info
&lookup_name
,
4850 /* True if TYPE is definitely an artificial type supplied to a symbol
4851 for which no debugging information was given in the symbol file. */
4854 is_nondebugging_type (struct type
*type
)
4856 const char *name
= ada_type_name (type
);
4858 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4861 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4862 that are deemed "identical" for practical purposes.
4864 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4865 types and that their number of enumerals is identical (in other
4866 words, type1->num_fields () == type2->num_fields ()). */
4869 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4873 /* The heuristic we use here is fairly conservative. We consider
4874 that 2 enumerate types are identical if they have the same
4875 number of enumerals and that all enumerals have the same
4876 underlying value and name. */
4878 /* All enums in the type should have an identical underlying value. */
4879 for (i
= 0; i
< type1
->num_fields (); i
++)
4880 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4883 /* All enumerals should also have the same name (modulo any numerical
4885 for (i
= 0; i
< type1
->num_fields (); i
++)
4887 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4888 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4889 int len_1
= strlen (name_1
);
4890 int len_2
= strlen (name_2
);
4892 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4893 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4895 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4896 TYPE_FIELD_NAME (type2
, i
),
4904 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4905 that are deemed "identical" for practical purposes. Sometimes,
4906 enumerals are not strictly identical, but their types are so similar
4907 that they can be considered identical.
4909 For instance, consider the following code:
4911 type Color is (Black, Red, Green, Blue, White);
4912 type RGB_Color is new Color range Red .. Blue;
4914 Type RGB_Color is a subrange of an implicit type which is a copy
4915 of type Color. If we call that implicit type RGB_ColorB ("B" is
4916 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4917 As a result, when an expression references any of the enumeral
4918 by name (Eg. "print green"), the expression is technically
4919 ambiguous and the user should be asked to disambiguate. But
4920 doing so would only hinder the user, since it wouldn't matter
4921 what choice he makes, the outcome would always be the same.
4922 So, for practical purposes, we consider them as the same. */
4925 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
4929 /* Before performing a thorough comparison check of each type,
4930 we perform a series of inexpensive checks. We expect that these
4931 checks will quickly fail in the vast majority of cases, and thus
4932 help prevent the unnecessary use of a more expensive comparison.
4933 Said comparison also expects us to make some of these checks
4934 (see ada_identical_enum_types_p). */
4936 /* Quick check: All symbols should have an enum type. */
4937 for (i
= 0; i
< syms
.size (); i
++)
4938 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
4941 /* Quick check: They should all have the same value. */
4942 for (i
= 1; i
< syms
.size (); i
++)
4943 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
4946 /* Quick check: They should all have the same number of enumerals. */
4947 for (i
= 1; i
< syms
.size (); i
++)
4948 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
4949 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
4952 /* All the sanity checks passed, so we might have a set of
4953 identical enumeration types. Perform a more complete
4954 comparison of the type of each symbol. */
4955 for (i
= 1; i
< syms
.size (); i
++)
4956 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
4957 SYMBOL_TYPE (syms
[0].symbol
)))
4963 /* Remove any non-debugging symbols in SYMS that definitely
4964 duplicate other symbols in the list (The only case I know of where
4965 this happens is when object files containing stabs-in-ecoff are
4966 linked with files containing ordinary ecoff debugging symbols (or no
4967 debugging symbols)). Modifies SYMS to squeeze out deleted entries. */
4970 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
4974 /* We should never be called with less than 2 symbols, as there
4975 cannot be any extra symbol in that case. But it's easy to
4976 handle, since we have nothing to do in that case. */
4977 if (syms
->size () < 2)
4981 while (i
< syms
->size ())
4985 /* If two symbols have the same name and one of them is a stub type,
4986 the get rid of the stub. */
4988 if (SYMBOL_TYPE ((*syms
)[i
].symbol
)->is_stub ()
4989 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
4991 for (j
= 0; j
< syms
->size (); j
++)
4994 && !SYMBOL_TYPE ((*syms
)[j
].symbol
)->is_stub ()
4995 && (*syms
)[j
].symbol
->linkage_name () != NULL
4996 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
4997 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5002 /* Two symbols with the same name, same class and same address
5003 should be identical. */
5005 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5006 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5007 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5009 for (j
= 0; j
< syms
->size (); j
+= 1)
5012 && (*syms
)[j
].symbol
->linkage_name () != NULL
5013 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5014 (*syms
)[j
].symbol
->linkage_name ()) == 0
5015 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5016 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5017 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5018 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5024 syms
->erase (syms
->begin () + i
);
5029 /* If all the remaining symbols are identical enumerals, then
5030 just keep the first one and discard the rest.
5032 Unlike what we did previously, we do not discard any entry
5033 unless they are ALL identical. This is because the symbol
5034 comparison is not a strict comparison, but rather a practical
5035 comparison. If all symbols are considered identical, then
5036 we can just go ahead and use the first one and discard the rest.
5037 But if we cannot reduce the list to a single element, we have
5038 to ask the user to disambiguate anyways. And if we have to
5039 present a multiple-choice menu, it's less confusing if the list
5040 isn't missing some choices that were identical and yet distinct. */
5041 if (symbols_are_identical_enums (*syms
))
5045 /* Given a type that corresponds to a renaming entity, use the type name
5046 to extract the scope (package name or function name, fully qualified,
5047 and following the GNAT encoding convention) where this renaming has been
5051 xget_renaming_scope (struct type
*renaming_type
)
5053 /* The renaming types adhere to the following convention:
5054 <scope>__<rename>___<XR extension>.
5055 So, to extract the scope, we search for the "___XR" extension,
5056 and then backtrack until we find the first "__". */
5058 const char *name
= renaming_type
->name ();
5059 const char *suffix
= strstr (name
, "___XR");
5062 /* Now, backtrack a bit until we find the first "__". Start looking
5063 at suffix - 3, as the <rename> part is at least one character long. */
5065 for (last
= suffix
- 3; last
> name
; last
--)
5066 if (last
[0] == '_' && last
[1] == '_')
5069 /* Make a copy of scope and return it. */
5070 return std::string (name
, last
);
5073 /* Return nonzero if NAME corresponds to a package name. */
5076 is_package_name (const char *name
)
5078 /* Here, We take advantage of the fact that no symbols are generated
5079 for packages, while symbols are generated for each function.
5080 So the condition for NAME represent a package becomes equivalent
5081 to NAME not existing in our list of symbols. There is only one
5082 small complication with library-level functions (see below). */
5084 /* If it is a function that has not been defined at library level,
5085 then we should be able to look it up in the symbols. */
5086 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5089 /* Library-level function names start with "_ada_". See if function
5090 "_ada_" followed by NAME can be found. */
5092 /* Do a quick check that NAME does not contain "__", since library-level
5093 functions names cannot contain "__" in them. */
5094 if (strstr (name
, "__") != NULL
)
5097 std::string fun_name
= string_printf ("_ada_%s", name
);
5099 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5102 /* Return nonzero if SYM corresponds to a renaming entity that is
5103 not visible from FUNCTION_NAME. */
5106 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5108 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5111 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5113 /* If the rename has been defined in a package, then it is visible. */
5114 if (is_package_name (scope
.c_str ()))
5117 /* Check that the rename is in the current function scope by checking
5118 that its name starts with SCOPE. */
5120 /* If the function name starts with "_ada_", it means that it is
5121 a library-level function. Strip this prefix before doing the
5122 comparison, as the encoding for the renaming does not contain
5124 if (startswith (function_name
, "_ada_"))
5127 return !startswith (function_name
, scope
.c_str ());
5130 /* Remove entries from SYMS that corresponds to a renaming entity that
5131 is not visible from the function associated with CURRENT_BLOCK or
5132 that is superfluous due to the presence of more specific renaming
5133 information. Places surviving symbols in the initial entries of
5137 First, in cases where an object renaming is implemented as a
5138 reference variable, GNAT may produce both the actual reference
5139 variable and the renaming encoding. In this case, we discard the
5142 Second, GNAT emits a type following a specified encoding for each renaming
5143 entity. Unfortunately, STABS currently does not support the definition
5144 of types that are local to a given lexical block, so all renamings types
5145 are emitted at library level. As a consequence, if an application
5146 contains two renaming entities using the same name, and a user tries to
5147 print the value of one of these entities, the result of the ada symbol
5148 lookup will also contain the wrong renaming type.
5150 This function partially covers for this limitation by attempting to
5151 remove from the SYMS list renaming symbols that should be visible
5152 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5153 method with the current information available. The implementation
5154 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5156 - When the user tries to print a rename in a function while there
5157 is another rename entity defined in a package: Normally, the
5158 rename in the function has precedence over the rename in the
5159 package, so the latter should be removed from the list. This is
5160 currently not the case.
5162 - This function will incorrectly remove valid renames if
5163 the CURRENT_BLOCK corresponds to a function which symbol name
5164 has been changed by an "Export" pragma. As a consequence,
5165 the user will be unable to print such rename entities. */
5168 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5169 const struct block
*current_block
)
5171 struct symbol
*current_function
;
5172 const char *current_function_name
;
5174 int is_new_style_renaming
;
5176 /* If there is both a renaming foo___XR... encoded as a variable and
5177 a simple variable foo in the same block, discard the latter.
5178 First, zero out such symbols, then compress. */
5179 is_new_style_renaming
= 0;
5180 for (i
= 0; i
< syms
->size (); i
+= 1)
5182 struct symbol
*sym
= (*syms
)[i
].symbol
;
5183 const struct block
*block
= (*syms
)[i
].block
;
5187 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5189 name
= sym
->linkage_name ();
5190 suffix
= strstr (name
, "___XR");
5194 int name_len
= suffix
- name
;
5197 is_new_style_renaming
= 1;
5198 for (j
= 0; j
< syms
->size (); j
+= 1)
5199 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5200 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5202 && block
== (*syms
)[j
].block
)
5203 (*syms
)[j
].symbol
= NULL
;
5206 if (is_new_style_renaming
)
5210 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5211 if ((*syms
)[j
].symbol
!= NULL
)
5213 (*syms
)[k
] = (*syms
)[j
];
5220 /* Extract the function name associated to CURRENT_BLOCK.
5221 Abort if unable to do so. */
5223 if (current_block
== NULL
)
5226 current_function
= block_linkage_function (current_block
);
5227 if (current_function
== NULL
)
5230 current_function_name
= current_function
->linkage_name ();
5231 if (current_function_name
== NULL
)
5234 /* Check each of the symbols, and remove it from the list if it is
5235 a type corresponding to a renaming that is out of the scope of
5236 the current block. */
5239 while (i
< syms
->size ())
5241 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5242 == ADA_OBJECT_RENAMING
5243 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5244 current_function_name
))
5245 syms
->erase (syms
->begin () + i
);
5251 /* Add to RESULT all symbols from BLOCK (and its super-blocks)
5252 whose name and domain match NAME and DOMAIN respectively.
5253 If no match was found, then extend the search to "enclosing"
5254 routines (in other words, if we're inside a nested function,
5255 search the symbols defined inside the enclosing functions).
5256 If WILD_MATCH_P is nonzero, perform the naming matching in
5257 "wild" mode (see function "wild_match" for more info).
5259 Note: This function assumes that RESULT has 0 (zero) element in it. */
5262 ada_add_local_symbols (std::vector
<struct block_symbol
> &result
,
5263 const lookup_name_info
&lookup_name
,
5264 const struct block
*block
, domain_enum domain
)
5266 int block_depth
= 0;
5268 while (block
!= NULL
)
5271 ada_add_block_symbols (result
, block
, lookup_name
, domain
, NULL
);
5273 /* If we found a non-function match, assume that's the one. */
5274 if (is_nonfunction (result
))
5277 block
= BLOCK_SUPERBLOCK (block
);
5280 /* If no luck so far, try to find NAME as a local symbol in some lexically
5281 enclosing subprogram. */
5282 if (result
.empty () && block_depth
> 2)
5283 add_symbols_from_enclosing_procs (result
, lookup_name
, domain
);
5286 /* An object of this type is used as the user_data argument when
5287 calling the map_matching_symbols method. */
5291 explicit match_data (std::vector
<struct block_symbol
> *rp
)
5295 DISABLE_COPY_AND_ASSIGN (match_data
);
5297 struct objfile
*objfile
= nullptr;
5298 std::vector
<struct block_symbol
> *resultp
;
5299 struct symbol
*arg_sym
= nullptr;
5300 bool found_sym
= false;
5303 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5304 to a list of symbols. DATA is a pointer to a struct match_data *
5305 containing the vector that collects the symbol list, the file that SYM
5306 must come from, a flag indicating whether a non-argument symbol has
5307 been found in the current block, and the last argument symbol
5308 passed in SYM within the current block (if any). When SYM is null,
5309 marking the end of a block, the argument symbol is added if no
5310 other has been found. */
5313 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5314 struct match_data
*data
)
5316 const struct block
*block
= bsym
->block
;
5317 struct symbol
*sym
= bsym
->symbol
;
5321 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5322 add_defn_to_vec (*data
->resultp
,
5323 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5325 data
->found_sym
= false;
5326 data
->arg_sym
= NULL
;
5330 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5332 else if (SYMBOL_IS_ARGUMENT (sym
))
5333 data
->arg_sym
= sym
;
5336 data
->found_sym
= true;
5337 add_defn_to_vec (*data
->resultp
,
5338 fixup_symbol_section (sym
, data
->objfile
),
5345 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5346 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5347 symbols to RESULT. Return whether we found such symbols. */
5350 ada_add_block_renamings (std::vector
<struct block_symbol
> &result
,
5351 const struct block
*block
,
5352 const lookup_name_info
&lookup_name
,
5355 struct using_direct
*renaming
;
5356 int defns_mark
= result
.size ();
5358 symbol_name_matcher_ftype
*name_match
5359 = ada_get_symbol_name_matcher (lookup_name
);
5361 for (renaming
= block_using (block
);
5363 renaming
= renaming
->next
)
5367 /* Avoid infinite recursions: skip this renaming if we are actually
5368 already traversing it.
5370 Currently, symbol lookup in Ada don't use the namespace machinery from
5371 C++/Fortran support: skip namespace imports that use them. */
5372 if (renaming
->searched
5373 || (renaming
->import_src
!= NULL
5374 && renaming
->import_src
[0] != '\0')
5375 || (renaming
->import_dest
!= NULL
5376 && renaming
->import_dest
[0] != '\0'))
5378 renaming
->searched
= 1;
5380 /* TODO: here, we perform another name-based symbol lookup, which can
5381 pull its own multiple overloads. In theory, we should be able to do
5382 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5383 not a simple name. But in order to do this, we would need to enhance
5384 the DWARF reader to associate a symbol to this renaming, instead of a
5385 name. So, for now, we do something simpler: re-use the C++/Fortran
5386 namespace machinery. */
5387 r_name
= (renaming
->alias
!= NULL
5389 : renaming
->declaration
);
5390 if (name_match (r_name
, lookup_name
, NULL
))
5392 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5393 lookup_name
.match_type ());
5394 ada_add_all_symbols (result
, block
, decl_lookup_name
, domain
,
5397 renaming
->searched
= 0;
5399 return result
.size () != defns_mark
;
5402 /* Implements compare_names, but only applying the comparision using
5403 the given CASING. */
5406 compare_names_with_case (const char *string1
, const char *string2
,
5407 enum case_sensitivity casing
)
5409 while (*string1
!= '\0' && *string2
!= '\0')
5413 if (isspace (*string1
) || isspace (*string2
))
5414 return strcmp_iw_ordered (string1
, string2
);
5416 if (casing
== case_sensitive_off
)
5418 c1
= tolower (*string1
);
5419 c2
= tolower (*string2
);
5436 return strcmp_iw_ordered (string1
, string2
);
5438 if (*string2
== '\0')
5440 if (is_name_suffix (string1
))
5447 if (*string2
== '(')
5448 return strcmp_iw_ordered (string1
, string2
);
5451 if (casing
== case_sensitive_off
)
5452 return tolower (*string1
) - tolower (*string2
);
5454 return *string1
- *string2
;
5459 /* Compare STRING1 to STRING2, with results as for strcmp.
5460 Compatible with strcmp_iw_ordered in that...
5462 strcmp_iw_ordered (STRING1, STRING2) <= 0
5466 compare_names (STRING1, STRING2) <= 0
5468 (they may differ as to what symbols compare equal). */
5471 compare_names (const char *string1
, const char *string2
)
5475 /* Similar to what strcmp_iw_ordered does, we need to perform
5476 a case-insensitive comparison first, and only resort to
5477 a second, case-sensitive, comparison if the first one was
5478 not sufficient to differentiate the two strings. */
5480 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5482 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5487 /* Convenience function to get at the Ada encoded lookup name for
5488 LOOKUP_NAME, as a C string. */
5491 ada_lookup_name (const lookup_name_info
&lookup_name
)
5493 return lookup_name
.ada ().lookup_name ().c_str ();
5496 /* Add to RESULT all non-local symbols whose name and domain match
5497 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5498 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5499 symbols otherwise. */
5502 add_nonlocal_symbols (std::vector
<struct block_symbol
> &result
,
5503 const lookup_name_info
&lookup_name
,
5504 domain_enum domain
, int global
)
5506 struct match_data
data (&result
);
5508 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5510 auto callback
= [&] (struct block_symbol
*bsym
)
5512 return aux_add_nonlocal_symbols (bsym
, &data
);
5515 for (objfile
*objfile
: current_program_space
->objfiles ())
5517 data
.objfile
= objfile
;
5519 if (objfile
->sf
!= nullptr)
5520 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5521 domain
, global
, callback
,
5523 ? NULL
: compare_names
));
5525 for (compunit_symtab
*cu
: objfile
->compunits ())
5527 const struct block
*global_block
5528 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5530 if (ada_add_block_renamings (result
, global_block
, lookup_name
,
5532 data
.found_sym
= true;
5536 if (result
.empty () && global
&& !is_wild_match
)
5538 const char *name
= ada_lookup_name (lookup_name
);
5539 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5540 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5542 for (objfile
*objfile
: current_program_space
->objfiles ())
5544 data
.objfile
= objfile
;
5545 if (objfile
->sf
!= nullptr)
5546 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5547 domain
, global
, callback
,
5553 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5554 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5555 returning the number of matches. Add these to RESULT.
5557 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5558 symbol match within the nest of blocks whose innermost member is BLOCK,
5559 is the one match returned (no other matches in that or
5560 enclosing blocks is returned). If there are any matches in or
5561 surrounding BLOCK, then these alone are returned.
5563 Names prefixed with "standard__" are handled specially:
5564 "standard__" is first stripped off (by the lookup_name
5565 constructor), and only static and global symbols are searched.
5567 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5568 to lookup global symbols. */
5571 ada_add_all_symbols (std::vector
<struct block_symbol
> &result
,
5572 const struct block
*block
,
5573 const lookup_name_info
&lookup_name
,
5576 int *made_global_lookup_p
)
5580 if (made_global_lookup_p
)
5581 *made_global_lookup_p
= 0;
5583 /* Special case: If the user specifies a symbol name inside package
5584 Standard, do a non-wild matching of the symbol name without
5585 the "standard__" prefix. This was primarily introduced in order
5586 to allow the user to specifically access the standard exceptions
5587 using, for instance, Standard.Constraint_Error when Constraint_Error
5588 is ambiguous (due to the user defining its own Constraint_Error
5589 entity inside its program). */
5590 if (lookup_name
.ada ().standard_p ())
5593 /* Check the non-global symbols. If we have ANY match, then we're done. */
5598 ada_add_local_symbols (result
, lookup_name
, block
, domain
);
5601 /* In the !full_search case we're are being called by
5602 iterate_over_symbols, and we don't want to search
5604 ada_add_block_symbols (result
, block
, lookup_name
, domain
, NULL
);
5606 if (!result
.empty () || !full_search
)
5610 /* No non-global symbols found. Check our cache to see if we have
5611 already performed this search before. If we have, then return
5614 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5615 domain
, &sym
, &block
))
5618 add_defn_to_vec (result
, sym
, block
);
5622 if (made_global_lookup_p
)
5623 *made_global_lookup_p
= 1;
5625 /* Search symbols from all global blocks. */
5627 add_nonlocal_symbols (result
, lookup_name
, domain
, 1);
5629 /* Now add symbols from all per-file blocks if we've gotten no hits
5630 (not strictly correct, but perhaps better than an error). */
5632 if (result
.empty ())
5633 add_nonlocal_symbols (result
, lookup_name
, domain
, 0);
5636 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5637 is non-zero, enclosing scope and in global scopes.
5639 Returns (SYM,BLOCK) tuples, indicating the symbols found and the
5640 blocks and symbol tables (if any) in which they were found.
5642 When full_search is non-zero, any non-function/non-enumeral
5643 symbol match within the nest of blocks whose innermost member is BLOCK,
5644 is the one match returned (no other matches in that or
5645 enclosing blocks is returned). If there are any matches in or
5646 surrounding BLOCK, then these alone are returned.
5648 Names prefixed with "standard__" are handled specially: "standard__"
5649 is first stripped off, and only static and global symbols are searched. */
5651 static std::vector
<struct block_symbol
>
5652 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5653 const struct block
*block
,
5657 int syms_from_global_search
;
5658 std::vector
<struct block_symbol
> results
;
5660 ada_add_all_symbols (results
, block
, lookup_name
,
5661 domain
, full_search
, &syms_from_global_search
);
5663 remove_extra_symbols (&results
);
5665 if (results
.empty () && full_search
&& syms_from_global_search
)
5666 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5668 if (results
.size () == 1 && full_search
&& syms_from_global_search
)
5669 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5670 results
[0].symbol
, results
[0].block
);
5672 remove_irrelevant_renamings (&results
, block
);
5676 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5677 in global scopes, returning (SYM,BLOCK) tuples.
5679 See ada_lookup_symbol_list_worker for further details. */
5681 std::vector
<struct block_symbol
>
5682 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5685 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5686 lookup_name_info
lookup_name (name
, name_match_type
);
5688 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, 1);
5691 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5692 to 1, but choosing the first symbol found if there are multiple
5695 The result is stored in *INFO, which must be non-NULL.
5696 If no match is found, INFO->SYM is set to NULL. */
5699 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5701 struct block_symbol
*info
)
5703 /* Since we already have an encoded name, wrap it in '<>' to force a
5704 verbatim match. Otherwise, if the name happens to not look like
5705 an encoded name (because it doesn't include a "__"),
5706 ada_lookup_name_info would re-encode/fold it again, and that
5707 would e.g., incorrectly lowercase object renaming names like
5708 "R28b" -> "r28b". */
5709 std::string verbatim
= add_angle_brackets (name
);
5711 gdb_assert (info
!= NULL
);
5712 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5715 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5716 scope and in global scopes, or NULL if none. NAME is folded and
5717 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5718 choosing the first symbol if there are multiple choices. */
5721 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5724 std::vector
<struct block_symbol
> candidates
5725 = ada_lookup_symbol_list (name
, block0
, domain
);
5727 if (candidates
.empty ())
5730 block_symbol info
= candidates
[0];
5731 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5736 /* True iff STR is a possible encoded suffix of a normal Ada name
5737 that is to be ignored for matching purposes. Suffixes of parallel
5738 names (e.g., XVE) are not included here. Currently, the possible suffixes
5739 are given by any of the regular expressions:
5741 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5742 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5743 TKB [subprogram suffix for task bodies]
5744 _E[0-9]+[bs]$ [protected object entry suffixes]
5745 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5747 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5748 match is performed. This sequence is used to differentiate homonyms,
5749 is an optional part of a valid name suffix. */
5752 is_name_suffix (const char *str
)
5755 const char *matching
;
5756 const int len
= strlen (str
);
5758 /* Skip optional leading __[0-9]+. */
5760 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5763 while (isdigit (str
[0]))
5769 if (str
[0] == '.' || str
[0] == '$')
5772 while (isdigit (matching
[0]))
5774 if (matching
[0] == '\0')
5780 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5783 while (isdigit (matching
[0]))
5785 if (matching
[0] == '\0')
5789 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5791 if (strcmp (str
, "TKB") == 0)
5795 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5796 with a N at the end. Unfortunately, the compiler uses the same
5797 convention for other internal types it creates. So treating
5798 all entity names that end with an "N" as a name suffix causes
5799 some regressions. For instance, consider the case of an enumerated
5800 type. To support the 'Image attribute, it creates an array whose
5802 Having a single character like this as a suffix carrying some
5803 information is a bit risky. Perhaps we should change the encoding
5804 to be something like "_N" instead. In the meantime, do not do
5805 the following check. */
5806 /* Protected Object Subprograms */
5807 if (len
== 1 && str
[0] == 'N')
5812 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5815 while (isdigit (matching
[0]))
5817 if ((matching
[0] == 'b' || matching
[0] == 's')
5818 && matching
[1] == '\0')
5822 /* ??? We should not modify STR directly, as we are doing below. This
5823 is fine in this case, but may become problematic later if we find
5824 that this alternative did not work, and want to try matching
5825 another one from the begining of STR. Since we modified it, we
5826 won't be able to find the begining of the string anymore! */
5830 while (str
[0] != '_' && str
[0] != '\0')
5832 if (str
[0] != 'n' && str
[0] != 'b')
5838 if (str
[0] == '\000')
5843 if (str
[1] != '_' || str
[2] == '\000')
5847 if (strcmp (str
+ 3, "JM") == 0)
5849 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5850 the LJM suffix in favor of the JM one. But we will
5851 still accept LJM as a valid suffix for a reasonable
5852 amount of time, just to allow ourselves to debug programs
5853 compiled using an older version of GNAT. */
5854 if (strcmp (str
+ 3, "LJM") == 0)
5858 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5859 || str
[4] == 'U' || str
[4] == 'P')
5861 if (str
[4] == 'R' && str
[5] != 'T')
5865 if (!isdigit (str
[2]))
5867 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5868 if (!isdigit (str
[k
]) && str
[k
] != '_')
5872 if (str
[0] == '$' && isdigit (str
[1]))
5874 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5875 if (!isdigit (str
[k
]) && str
[k
] != '_')
5882 /* Return non-zero if the string starting at NAME and ending before
5883 NAME_END contains no capital letters. */
5886 is_valid_name_for_wild_match (const char *name0
)
5888 std::string decoded_name
= ada_decode (name0
);
5891 /* If the decoded name starts with an angle bracket, it means that
5892 NAME0 does not follow the GNAT encoding format. It should then
5893 not be allowed as a possible wild match. */
5894 if (decoded_name
[0] == '<')
5897 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5898 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5904 /* Advance *NAMEP to next occurrence in the string NAME0 of the TARGET0
5905 character which could start a simple name. Assumes that *NAMEP points
5906 somewhere inside the string beginning at NAME0. */
5909 advance_wild_match (const char **namep
, const char *name0
, char target0
)
5911 const char *name
= *namep
;
5921 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5924 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
5929 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5930 || name
[2] == target0
))
5935 else if (t1
== '_' && name
[2] == 'B' && name
[3] == '_')
5937 /* Names like "pkg__B_N__name", where N is a number, are
5938 block-local. We can handle these by simply skipping
5945 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5955 /* Return true iff NAME encodes a name of the form prefix.PATN.
5956 Ignores any informational suffixes of NAME (i.e., for which
5957 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
5961 wild_match (const char *name
, const char *patn
)
5964 const char *name0
= name
;
5968 const char *match
= name
;
5972 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5975 if (*p
== '\0' && is_name_suffix (name
))
5976 return match
== name0
|| is_valid_name_for_wild_match (name0
);
5978 if (name
[-1] == '_')
5981 if (!advance_wild_match (&name
, name0
, *patn
))
5986 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to RESULT (if
5987 necessary). OBJFILE is the section containing BLOCK. */
5990 ada_add_block_symbols (std::vector
<struct block_symbol
> &result
,
5991 const struct block
*block
,
5992 const lookup_name_info
&lookup_name
,
5993 domain_enum domain
, struct objfile
*objfile
)
5995 struct block_iterator iter
;
5996 /* A matching argument symbol, if any. */
5997 struct symbol
*arg_sym
;
5998 /* Set true when we find a matching non-argument symbol. */
6004 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6006 sym
= block_iter_match_next (lookup_name
, &iter
))
6008 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6010 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6012 if (SYMBOL_IS_ARGUMENT (sym
))
6017 add_defn_to_vec (result
,
6018 fixup_symbol_section (sym
, objfile
),
6025 /* Handle renamings. */
6027 if (ada_add_block_renamings (result
, block
, lookup_name
, domain
))
6030 if (!found_sym
&& arg_sym
!= NULL
)
6032 add_defn_to_vec (result
,
6033 fixup_symbol_section (arg_sym
, objfile
),
6037 if (!lookup_name
.ada ().wild_match_p ())
6041 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6042 const char *name
= ada_lookup_name
.c_str ();
6043 size_t name_len
= ada_lookup_name
.size ();
6045 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6047 if (symbol_matches_domain (sym
->language (),
6048 SYMBOL_DOMAIN (sym
), domain
))
6052 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6055 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6057 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6062 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6064 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6066 if (SYMBOL_IS_ARGUMENT (sym
))
6071 add_defn_to_vec (result
,
6072 fixup_symbol_section (sym
, objfile
),
6080 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6081 They aren't parameters, right? */
6082 if (!found_sym
&& arg_sym
!= NULL
)
6084 add_defn_to_vec (result
,
6085 fixup_symbol_section (arg_sym
, objfile
),
6092 /* Symbol Completion */
6097 ada_lookup_name_info::matches
6098 (const char *sym_name
,
6099 symbol_name_match_type match_type
,
6100 completion_match_result
*comp_match_res
) const
6103 const char *text
= m_encoded_name
.c_str ();
6104 size_t text_len
= m_encoded_name
.size ();
6106 /* First, test against the fully qualified name of the symbol. */
6108 if (strncmp (sym_name
, text
, text_len
) == 0)
6111 std::string decoded_name
= ada_decode (sym_name
);
6112 if (match
&& !m_encoded_p
)
6114 /* One needed check before declaring a positive match is to verify
6115 that iff we are doing a verbatim match, the decoded version
6116 of the symbol name starts with '<'. Otherwise, this symbol name
6117 is not a suitable completion. */
6119 bool has_angle_bracket
= (decoded_name
[0] == '<');
6120 match
= (has_angle_bracket
== m_verbatim_p
);
6123 if (match
&& !m_verbatim_p
)
6125 /* When doing non-verbatim match, another check that needs to
6126 be done is to verify that the potentially matching symbol name
6127 does not include capital letters, because the ada-mode would
6128 not be able to understand these symbol names without the
6129 angle bracket notation. */
6132 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6137 /* Second: Try wild matching... */
6139 if (!match
&& m_wild_match_p
)
6141 /* Since we are doing wild matching, this means that TEXT
6142 may represent an unqualified symbol name. We therefore must
6143 also compare TEXT against the unqualified name of the symbol. */
6144 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6146 if (strncmp (sym_name
, text
, text_len
) == 0)
6150 /* Finally: If we found a match, prepare the result to return. */
6155 if (comp_match_res
!= NULL
)
6157 std::string
&match_str
= comp_match_res
->match
.storage ();
6160 match_str
= ada_decode (sym_name
);
6164 match_str
= add_angle_brackets (sym_name
);
6166 match_str
= sym_name
;
6170 comp_match_res
->set_match (match_str
.c_str ());
6178 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6179 for tagged types. */
6182 ada_is_dispatch_table_ptr_type (struct type
*type
)
6186 if (type
->code () != TYPE_CODE_PTR
)
6189 name
= TYPE_TARGET_TYPE (type
)->name ();
6193 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6196 /* Return non-zero if TYPE is an interface tag. */
6199 ada_is_interface_tag (struct type
*type
)
6201 const char *name
= type
->name ();
6206 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6209 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6210 to be invisible to users. */
6213 ada_is_ignored_field (struct type
*type
, int field_num
)
6215 if (field_num
< 0 || field_num
> type
->num_fields ())
6218 /* Check the name of that field. */
6220 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6222 /* Anonymous field names should not be printed.
6223 brobecker/2007-02-20: I don't think this can actually happen
6224 but we don't want to print the value of anonymous fields anyway. */
6228 /* Normally, fields whose name start with an underscore ("_")
6229 are fields that have been internally generated by the compiler,
6230 and thus should not be printed. The "_parent" field is special,
6231 however: This is a field internally generated by the compiler
6232 for tagged types, and it contains the components inherited from
6233 the parent type. This field should not be printed as is, but
6234 should not be ignored either. */
6235 if (name
[0] == '_' && !startswith (name
, "_parent"))
6239 /* If this is the dispatch table of a tagged type or an interface tag,
6241 if (ada_is_tagged_type (type
, 1)
6242 && (ada_is_dispatch_table_ptr_type (type
->field (field_num
).type ())
6243 || ada_is_interface_tag (type
->field (field_num
).type ())))
6246 /* Not a special field, so it should not be ignored. */
6250 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6251 pointer or reference type whose ultimate target has a tag field. */
6254 ada_is_tagged_type (struct type
*type
, int refok
)
6256 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6259 /* True iff TYPE represents the type of X'Tag */
6262 ada_is_tag_type (struct type
*type
)
6264 type
= ada_check_typedef (type
);
6266 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6270 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6272 return (name
!= NULL
6273 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6277 /* The type of the tag on VAL. */
6279 static struct type
*
6280 ada_tag_type (struct value
*val
)
6282 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6285 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6286 retired at Ada 05). */
6289 is_ada95_tag (struct value
*tag
)
6291 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6294 /* The value of the tag on VAL. */
6296 static struct value
*
6297 ada_value_tag (struct value
*val
)
6299 return ada_value_struct_elt (val
, "_tag", 0);
6302 /* The value of the tag on the object of type TYPE whose contents are
6303 saved at VALADDR, if it is non-null, or is at memory address
6306 static struct value
*
6307 value_tag_from_contents_and_address (struct type
*type
,
6308 const gdb_byte
*valaddr
,
6311 int tag_byte_offset
;
6312 struct type
*tag_type
;
6314 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6317 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6319 : valaddr
+ tag_byte_offset
);
6320 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6322 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6327 static struct type
*
6328 type_from_tag (struct value
*tag
)
6330 gdb::unique_xmalloc_ptr
<char> type_name
= ada_tag_name (tag
);
6332 if (type_name
!= NULL
)
6333 return ada_find_any_type (ada_encode (type_name
.get ()).c_str ());
6337 /* Given a value OBJ of a tagged type, return a value of this
6338 type at the base address of the object. The base address, as
6339 defined in Ada.Tags, it is the address of the primary tag of
6340 the object, and therefore where the field values of its full
6341 view can be fetched. */
6344 ada_tag_value_at_base_address (struct value
*obj
)
6347 LONGEST offset_to_top
= 0;
6348 struct type
*ptr_type
, *obj_type
;
6350 CORE_ADDR base_address
;
6352 obj_type
= value_type (obj
);
6354 /* It is the responsability of the caller to deref pointers. */
6356 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6359 tag
= ada_value_tag (obj
);
6363 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6365 if (is_ada95_tag (tag
))
6368 ptr_type
= language_lookup_primitive_type
6369 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6370 ptr_type
= lookup_pointer_type (ptr_type
);
6371 val
= value_cast (ptr_type
, tag
);
6375 /* It is perfectly possible that an exception be raised while
6376 trying to determine the base address, just like for the tag;
6377 see ada_tag_name for more details. We do not print the error
6378 message for the same reason. */
6382 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6385 catch (const gdb_exception_error
&e
)
6390 /* If offset is null, nothing to do. */
6392 if (offset_to_top
== 0)
6395 /* -1 is a special case in Ada.Tags; however, what should be done
6396 is not quite clear from the documentation. So do nothing for
6399 if (offset_to_top
== -1)
6402 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6403 from the base address. This was however incompatible with
6404 C++ dispatch table: C++ uses a *negative* value to *add*
6405 to the base address. Ada's convention has therefore been
6406 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6407 use the same convention. Here, we support both cases by
6408 checking the sign of OFFSET_TO_TOP. */
6410 if (offset_to_top
> 0)
6411 offset_to_top
= -offset_to_top
;
6413 base_address
= value_address (obj
) + offset_to_top
;
6414 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6416 /* Make sure that we have a proper tag at the new address.
6417 Otherwise, offset_to_top is bogus (which can happen when
6418 the object is not initialized yet). */
6423 obj_type
= type_from_tag (tag
);
6428 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6431 /* Return the "ada__tags__type_specific_data" type. */
6433 static struct type
*
6434 ada_get_tsd_type (struct inferior
*inf
)
6436 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6438 if (data
->tsd_type
== 0)
6439 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6440 return data
->tsd_type
;
6443 /* Return the TSD (type-specific data) associated to the given TAG.
6444 TAG is assumed to be the tag of a tagged-type entity.
6446 May return NULL if we are unable to get the TSD. */
6448 static struct value
*
6449 ada_get_tsd_from_tag (struct value
*tag
)
6454 /* First option: The TSD is simply stored as a field of our TAG.
6455 Only older versions of GNAT would use this format, but we have
6456 to test it first, because there are no visible markers for
6457 the current approach except the absence of that field. */
6459 val
= ada_value_struct_elt (tag
, "tsd", 1);
6463 /* Try the second representation for the dispatch table (in which
6464 there is no explicit 'tsd' field in the referent of the tag pointer,
6465 and instead the tsd pointer is stored just before the dispatch
6468 type
= ada_get_tsd_type (current_inferior());
6471 type
= lookup_pointer_type (lookup_pointer_type (type
));
6472 val
= value_cast (type
, tag
);
6475 return value_ind (value_ptradd (val
, -1));
6478 /* Given the TSD of a tag (type-specific data), return a string
6479 containing the name of the associated type.
6481 May return NULL if we are unable to determine the tag name. */
6483 static gdb::unique_xmalloc_ptr
<char>
6484 ada_tag_name_from_tsd (struct value
*tsd
)
6489 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6492 gdb::unique_xmalloc_ptr
<char> buffer
6493 = target_read_string (value_as_address (val
), INT_MAX
);
6494 if (buffer
== nullptr)
6497 for (p
= buffer
.get (); *p
!= '\0'; ++p
)
6506 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6509 Return NULL if the TAG is not an Ada tag, or if we were unable to
6510 determine the name of that tag. */
6512 gdb::unique_xmalloc_ptr
<char>
6513 ada_tag_name (struct value
*tag
)
6515 gdb::unique_xmalloc_ptr
<char> name
;
6517 if (!ada_is_tag_type (value_type (tag
)))
6520 /* It is perfectly possible that an exception be raised while trying
6521 to determine the TAG's name, even under normal circumstances:
6522 The associated variable may be uninitialized or corrupted, for
6523 instance. We do not let any exception propagate past this point.
6524 instead we return NULL.
6526 We also do not print the error message either (which often is very
6527 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6528 the caller print a more meaningful message if necessary. */
6531 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6534 name
= ada_tag_name_from_tsd (tsd
);
6536 catch (const gdb_exception_error
&e
)
6543 /* The parent type of TYPE, or NULL if none. */
6546 ada_parent_type (struct type
*type
)
6550 type
= ada_check_typedef (type
);
6552 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6555 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6556 if (ada_is_parent_field (type
, i
))
6558 struct type
*parent_type
= type
->field (i
).type ();
6560 /* If the _parent field is a pointer, then dereference it. */
6561 if (parent_type
->code () == TYPE_CODE_PTR
)
6562 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6563 /* If there is a parallel XVS type, get the actual base type. */
6564 parent_type
= ada_get_base_type (parent_type
);
6566 return ada_check_typedef (parent_type
);
6572 /* True iff field number FIELD_NUM of structure type TYPE contains the
6573 parent-type (inherited) fields of a derived type. Assumes TYPE is
6574 a structure type with at least FIELD_NUM+1 fields. */
6577 ada_is_parent_field (struct type
*type
, int field_num
)
6579 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6581 return (name
!= NULL
6582 && (startswith (name
, "PARENT")
6583 || startswith (name
, "_parent")));
6586 /* True iff field number FIELD_NUM of structure type TYPE is a
6587 transparent wrapper field (which should be silently traversed when doing
6588 field selection and flattened when printing). Assumes TYPE is a
6589 structure type with at least FIELD_NUM+1 fields. Such fields are always
6593 ada_is_wrapper_field (struct type
*type
, int field_num
)
6595 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6597 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6599 /* This happens in functions with "out" or "in out" parameters
6600 which are passed by copy. For such functions, GNAT describes
6601 the function's return type as being a struct where the return
6602 value is in a field called RETVAL, and where the other "out"
6603 or "in out" parameters are fields of that struct. This is not
6608 return (name
!= NULL
6609 && (startswith (name
, "PARENT")
6610 || strcmp (name
, "REP") == 0
6611 || startswith (name
, "_parent")
6612 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6615 /* True iff field number FIELD_NUM of structure or union type TYPE
6616 is a variant wrapper. Assumes TYPE is a structure type with at least
6617 FIELD_NUM+1 fields. */
6620 ada_is_variant_part (struct type
*type
, int field_num
)
6622 /* Only Ada types are eligible. */
6623 if (!ADA_TYPE_P (type
))
6626 struct type
*field_type
= type
->field (field_num
).type ();
6628 return (field_type
->code () == TYPE_CODE_UNION
6629 || (is_dynamic_field (type
, field_num
)
6630 && (TYPE_TARGET_TYPE (field_type
)->code ()
6631 == TYPE_CODE_UNION
)));
6634 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6635 whose discriminants are contained in the record type OUTER_TYPE,
6636 returns the type of the controlling discriminant for the variant.
6637 May return NULL if the type could not be found. */
6640 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6642 const char *name
= ada_variant_discrim_name (var_type
);
6644 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6647 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6648 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6649 represents a 'when others' clause; otherwise 0. */
6652 ada_is_others_clause (struct type
*type
, int field_num
)
6654 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6656 return (name
!= NULL
&& name
[0] == 'O');
6659 /* Assuming that TYPE0 is the type of the variant part of a record,
6660 returns the name of the discriminant controlling the variant.
6661 The value is valid until the next call to ada_variant_discrim_name. */
6664 ada_variant_discrim_name (struct type
*type0
)
6666 static std::string result
;
6669 const char *discrim_end
;
6670 const char *discrim_start
;
6672 if (type0
->code () == TYPE_CODE_PTR
)
6673 type
= TYPE_TARGET_TYPE (type0
);
6677 name
= ada_type_name (type
);
6679 if (name
== NULL
|| name
[0] == '\000')
6682 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6685 if (startswith (discrim_end
, "___XVN"))
6688 if (discrim_end
== name
)
6691 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6694 if (discrim_start
== name
+ 1)
6696 if ((discrim_start
> name
+ 3
6697 && startswith (discrim_start
- 3, "___"))
6698 || discrim_start
[-1] == '.')
6702 result
= std::string (discrim_start
, discrim_end
- discrim_start
);
6703 return result
.c_str ();
6706 /* Scan STR for a subtype-encoded number, beginning at position K.
6707 Put the position of the character just past the number scanned in
6708 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6709 Return 1 if there was a valid number at the given position, and 0
6710 otherwise. A "subtype-encoded" number consists of the absolute value
6711 in decimal, followed by the letter 'm' to indicate a negative number.
6712 Assumes 0m does not occur. */
6715 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6719 if (!isdigit (str
[k
]))
6722 /* Do it the hard way so as not to make any assumption about
6723 the relationship of unsigned long (%lu scan format code) and
6726 while (isdigit (str
[k
]))
6728 RU
= RU
* 10 + (str
[k
] - '0');
6735 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6741 /* NOTE on the above: Technically, C does not say what the results of
6742 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6743 number representable as a LONGEST (although either would probably work
6744 in most implementations). When RU>0, the locution in the then branch
6745 above is always equivalent to the negative of RU. */
6752 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6753 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6754 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6757 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6759 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6773 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6783 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6784 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6786 if (val
>= L
&& val
<= U
)
6798 /* FIXME: Lots of redundancy below. Try to consolidate. */
6800 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6801 ARG_TYPE, extract and return the value of one of its (non-static)
6802 fields. FIELDNO says which field. Differs from value_primitive_field
6803 only in that it can handle packed values of arbitrary type. */
6806 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6807 struct type
*arg_type
)
6811 arg_type
= ada_check_typedef (arg_type
);
6812 type
= arg_type
->field (fieldno
).type ();
6814 /* Handle packed fields. It might be that the field is not packed
6815 relative to its containing structure, but the structure itself is
6816 packed; in this case we must take the bit-field path. */
6817 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
6819 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6820 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6822 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6823 offset
+ bit_pos
/ 8,
6824 bit_pos
% 8, bit_size
, type
);
6827 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6830 /* Find field with name NAME in object of type TYPE. If found,
6831 set the following for each argument that is non-null:
6832 - *FIELD_TYPE_P to the field's type;
6833 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6834 an object of that type;
6835 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6836 - *BIT_SIZE_P to its size in bits if the field is packed, and
6838 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6839 fields up to but not including the desired field, or by the total
6840 number of fields if not found. A NULL value of NAME never
6841 matches; the function just counts visible fields in this case.
6843 Notice that we need to handle when a tagged record hierarchy
6844 has some components with the same name, like in this scenario:
6846 type Top_T is tagged record
6852 type Middle_T is new Top.Top_T with record
6853 N : Character := 'a';
6857 type Bottom_T is new Middle.Middle_T with record
6859 C : Character := '5';
6861 A : Character := 'J';
6864 Let's say we now have a variable declared and initialized as follow:
6866 TC : Top_A := new Bottom_T;
6868 And then we use this variable to call this function
6870 procedure Assign (Obj: in out Top_T; TV : Integer);
6874 Assign (Top_T (B), 12);
6876 Now, we're in the debugger, and we're inside that procedure
6877 then and we want to print the value of obj.c:
6879 Usually, the tagged record or one of the parent type owns the
6880 component to print and there's no issue but in this particular
6881 case, what does it mean to ask for Obj.C? Since the actual
6882 type for object is type Bottom_T, it could mean two things: type
6883 component C from the Middle_T view, but also component C from
6884 Bottom_T. So in that "undefined" case, when the component is
6885 not found in the non-resolved type (which includes all the
6886 components of the parent type), then resolve it and see if we
6887 get better luck once expanded.
6889 In the case of homonyms in the derived tagged type, we don't
6890 guaranty anything, and pick the one that's easiest for us
6893 Returns 1 if found, 0 otherwise. */
6896 find_struct_field (const char *name
, struct type
*type
, int offset
,
6897 struct type
**field_type_p
,
6898 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6902 int parent_offset
= -1;
6904 type
= ada_check_typedef (type
);
6906 if (field_type_p
!= NULL
)
6907 *field_type_p
= NULL
;
6908 if (byte_offset_p
!= NULL
)
6910 if (bit_offset_p
!= NULL
)
6912 if (bit_size_p
!= NULL
)
6915 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6917 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6918 int fld_offset
= offset
+ bit_pos
/ 8;
6919 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6921 if (t_field_name
== NULL
)
6924 else if (ada_is_parent_field (type
, i
))
6926 /* This is a field pointing us to the parent type of a tagged
6927 type. As hinted in this function's documentation, we give
6928 preference to fields in the current record first, so what
6929 we do here is just record the index of this field before
6930 we skip it. If it turns out we couldn't find our field
6931 in the current record, then we'll get back to it and search
6932 inside it whether the field might exist in the parent. */
6938 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6940 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6942 if (field_type_p
!= NULL
)
6943 *field_type_p
= type
->field (i
).type ();
6944 if (byte_offset_p
!= NULL
)
6945 *byte_offset_p
= fld_offset
;
6946 if (bit_offset_p
!= NULL
)
6947 *bit_offset_p
= bit_pos
% 8;
6948 if (bit_size_p
!= NULL
)
6949 *bit_size_p
= bit_size
;
6952 else if (ada_is_wrapper_field (type
, i
))
6954 if (find_struct_field (name
, type
->field (i
).type (), fld_offset
,
6955 field_type_p
, byte_offset_p
, bit_offset_p
,
6956 bit_size_p
, index_p
))
6959 else if (ada_is_variant_part (type
, i
))
6961 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6964 struct type
*field_type
6965 = ada_check_typedef (type
->field (i
).type ());
6967 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
6969 if (find_struct_field (name
, field_type
->field (j
).type (),
6971 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6972 field_type_p
, byte_offset_p
,
6973 bit_offset_p
, bit_size_p
, index_p
))
6977 else if (index_p
!= NULL
)
6981 /* Field not found so far. If this is a tagged type which
6982 has a parent, try finding that field in the parent now. */
6984 if (parent_offset
!= -1)
6986 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
6987 int fld_offset
= offset
+ bit_pos
/ 8;
6989 if (find_struct_field (name
, type
->field (parent_offset
).type (),
6990 fld_offset
, field_type_p
, byte_offset_p
,
6991 bit_offset_p
, bit_size_p
, index_p
))
6998 /* Number of user-visible fields in record type TYPE. */
7001 num_visible_fields (struct type
*type
)
7006 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7010 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7011 and search in it assuming it has (class) type TYPE.
7012 If found, return value, else return NULL.
7014 Searches recursively through wrapper fields (e.g., '_parent').
7016 In the case of homonyms in the tagged types, please refer to the
7017 long explanation in find_struct_field's function documentation. */
7019 static struct value
*
7020 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7024 int parent_offset
= -1;
7026 type
= ada_check_typedef (type
);
7027 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7029 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7031 if (t_field_name
== NULL
)
7034 else if (ada_is_parent_field (type
, i
))
7036 /* This is a field pointing us to the parent type of a tagged
7037 type. As hinted in this function's documentation, we give
7038 preference to fields in the current record first, so what
7039 we do here is just record the index of this field before
7040 we skip it. If it turns out we couldn't find our field
7041 in the current record, then we'll get back to it and search
7042 inside it whether the field might exist in the parent. */
7048 else if (field_name_match (t_field_name
, name
))
7049 return ada_value_primitive_field (arg
, offset
, i
, type
);
7051 else if (ada_is_wrapper_field (type
, i
))
7053 struct value
*v
= /* Do not let indent join lines here. */
7054 ada_search_struct_field (name
, arg
,
7055 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7056 type
->field (i
).type ());
7062 else if (ada_is_variant_part (type
, i
))
7064 /* PNH: Do we ever get here? See find_struct_field. */
7066 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7067 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7069 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7071 struct value
*v
= ada_search_struct_field
/* Force line
7074 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7075 field_type
->field (j
).type ());
7083 /* Field not found so far. If this is a tagged type which
7084 has a parent, try finding that field in the parent now. */
7086 if (parent_offset
!= -1)
7088 struct value
*v
= ada_search_struct_field (
7089 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7090 type
->field (parent_offset
).type ());
7099 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7100 int, struct type
*);
7103 /* Return field #INDEX in ARG, where the index is that returned by
7104 * find_struct_field through its INDEX_P argument. Adjust the address
7105 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7106 * If found, return value, else return NULL. */
7108 static struct value
*
7109 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7112 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7116 /* Auxiliary function for ada_index_struct_field. Like
7117 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7120 static struct value
*
7121 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7125 type
= ada_check_typedef (type
);
7127 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7129 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7131 else if (ada_is_wrapper_field (type
, i
))
7133 struct value
*v
= /* Do not let indent join lines here. */
7134 ada_index_struct_field_1 (index_p
, arg
,
7135 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7136 type
->field (i
).type ());
7142 else if (ada_is_variant_part (type
, i
))
7144 /* PNH: Do we ever get here? See ada_search_struct_field,
7145 find_struct_field. */
7146 error (_("Cannot assign this kind of variant record"));
7148 else if (*index_p
== 0)
7149 return ada_value_primitive_field (arg
, offset
, i
, type
);
7156 /* Return a string representation of type TYPE. */
7159 type_as_string (struct type
*type
)
7161 string_file tmp_stream
;
7163 type_print (type
, "", &tmp_stream
, -1);
7165 return std::move (tmp_stream
.string ());
7168 /* Given a type TYPE, look up the type of the component of type named NAME.
7169 If DISPP is non-null, add its byte displacement from the beginning of a
7170 structure (pointed to by a value) of type TYPE to *DISPP (does not
7171 work for packed fields).
7173 Matches any field whose name has NAME as a prefix, possibly
7176 TYPE can be either a struct or union. If REFOK, TYPE may also
7177 be a (pointer or reference)+ to a struct or union, and the
7178 ultimate target type will be searched.
7180 Looks recursively into variant clauses and parent types.
7182 In the case of homonyms in the tagged types, please refer to the
7183 long explanation in find_struct_field's function documentation.
7185 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7186 TYPE is not a type of the right kind. */
7188 static struct type
*
7189 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7193 int parent_offset
= -1;
7198 if (refok
&& type
!= NULL
)
7201 type
= ada_check_typedef (type
);
7202 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7204 type
= TYPE_TARGET_TYPE (type
);
7208 || (type
->code () != TYPE_CODE_STRUCT
7209 && type
->code () != TYPE_CODE_UNION
))
7214 error (_("Type %s is not a structure or union type"),
7215 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7218 type
= to_static_fixed_type (type
);
7220 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7222 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7225 if (t_field_name
== NULL
)
7228 else if (ada_is_parent_field (type
, i
))
7230 /* This is a field pointing us to the parent type of a tagged
7231 type. As hinted in this function's documentation, we give
7232 preference to fields in the current record first, so what
7233 we do here is just record the index of this field before
7234 we skip it. If it turns out we couldn't find our field
7235 in the current record, then we'll get back to it and search
7236 inside it whether the field might exist in the parent. */
7242 else if (field_name_match (t_field_name
, name
))
7243 return type
->field (i
).type ();
7245 else if (ada_is_wrapper_field (type
, i
))
7247 t
= ada_lookup_struct_elt_type (type
->field (i
).type (), name
,
7253 else if (ada_is_variant_part (type
, i
))
7256 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7258 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
7260 /* FIXME pnh 2008/01/26: We check for a field that is
7261 NOT wrapped in a struct, since the compiler sometimes
7262 generates these for unchecked variant types. Revisit
7263 if the compiler changes this practice. */
7264 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7266 if (v_field_name
!= NULL
7267 && field_name_match (v_field_name
, name
))
7268 t
= field_type
->field (j
).type ();
7270 t
= ada_lookup_struct_elt_type (field_type
->field (j
).type (),
7280 /* Field not found so far. If this is a tagged type which
7281 has a parent, try finding that field in the parent now. */
7283 if (parent_offset
!= -1)
7287 t
= ada_lookup_struct_elt_type (type
->field (parent_offset
).type (),
7296 const char *name_str
= name
!= NULL
? name
: _("<null>");
7298 error (_("Type %s has no component named %s"),
7299 type_as_string (type
).c_str (), name_str
);
7305 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7306 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7307 represents an unchecked union (that is, the variant part of a
7308 record that is named in an Unchecked_Union pragma). */
7311 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7313 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7315 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7319 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7320 within OUTER, determine which variant clause (field number in VAR_TYPE,
7321 numbering from 0) is applicable. Returns -1 if none are. */
7324 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7328 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7329 struct value
*discrim
;
7330 LONGEST discrim_val
;
7332 /* Using plain value_from_contents_and_address here causes problems
7333 because we will end up trying to resolve a type that is currently
7334 being constructed. */
7335 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7336 if (discrim
== NULL
)
7338 discrim_val
= value_as_long (discrim
);
7341 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7343 if (ada_is_others_clause (var_type
, i
))
7345 else if (ada_in_variant (discrim_val
, var_type
, i
))
7349 return others_clause
;
7354 /* Dynamic-Sized Records */
7356 /* Strategy: The type ostensibly attached to a value with dynamic size
7357 (i.e., a size that is not statically recorded in the debugging
7358 data) does not accurately reflect the size or layout of the value.
7359 Our strategy is to convert these values to values with accurate,
7360 conventional types that are constructed on the fly. */
7362 /* There is a subtle and tricky problem here. In general, we cannot
7363 determine the size of dynamic records without its data. However,
7364 the 'struct value' data structure, which GDB uses to represent
7365 quantities in the inferior process (the target), requires the size
7366 of the type at the time of its allocation in order to reserve space
7367 for GDB's internal copy of the data. That's why the
7368 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7369 rather than struct value*s.
7371 However, GDB's internal history variables ($1, $2, etc.) are
7372 struct value*s containing internal copies of the data that are not, in
7373 general, the same as the data at their corresponding addresses in
7374 the target. Fortunately, the types we give to these values are all
7375 conventional, fixed-size types (as per the strategy described
7376 above), so that we don't usually have to perform the
7377 'to_fixed_xxx_type' conversions to look at their values.
7378 Unfortunately, there is one exception: if one of the internal
7379 history variables is an array whose elements are unconstrained
7380 records, then we will need to create distinct fixed types for each
7381 element selected. */
7383 /* The upshot of all of this is that many routines take a (type, host
7384 address, target address) triple as arguments to represent a value.
7385 The host address, if non-null, is supposed to contain an internal
7386 copy of the relevant data; otherwise, the program is to consult the
7387 target at the target address. */
7389 /* Assuming that VAL0 represents a pointer value, the result of
7390 dereferencing it. Differs from value_ind in its treatment of
7391 dynamic-sized types. */
7394 ada_value_ind (struct value
*val0
)
7396 struct value
*val
= value_ind (val0
);
7398 if (ada_is_tagged_type (value_type (val
), 0))
7399 val
= ada_tag_value_at_base_address (val
);
7401 return ada_to_fixed_value (val
);
7404 /* The value resulting from dereferencing any "reference to"
7405 qualifiers on VAL0. */
7407 static struct value
*
7408 ada_coerce_ref (struct value
*val0
)
7410 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7412 struct value
*val
= val0
;
7414 val
= coerce_ref (val
);
7416 if (ada_is_tagged_type (value_type (val
), 0))
7417 val
= ada_tag_value_at_base_address (val
);
7419 return ada_to_fixed_value (val
);
7425 /* Return the bit alignment required for field #F of template type TYPE. */
7428 field_alignment (struct type
*type
, int f
)
7430 const char *name
= TYPE_FIELD_NAME (type
, f
);
7434 /* The field name should never be null, unless the debugging information
7435 is somehow malformed. In this case, we assume the field does not
7436 require any alignment. */
7440 len
= strlen (name
);
7442 if (!isdigit (name
[len
- 1]))
7445 if (isdigit (name
[len
- 2]))
7446 align_offset
= len
- 2;
7448 align_offset
= len
- 1;
7450 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7451 return TARGET_CHAR_BIT
;
7453 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7456 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7458 static struct symbol
*
7459 ada_find_any_type_symbol (const char *name
)
7463 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7464 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7467 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7471 /* Find a type named NAME. Ignores ambiguity. This routine will look
7472 solely for types defined by debug info, it will not search the GDB
7475 static struct type
*
7476 ada_find_any_type (const char *name
)
7478 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7481 return SYMBOL_TYPE (sym
);
7486 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7487 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7488 symbol, in which case it is returned. Otherwise, this looks for
7489 symbols whose name is that of NAME_SYM suffixed with "___XR".
7490 Return symbol if found, and NULL otherwise. */
7493 ada_is_renaming_symbol (struct symbol
*name_sym
)
7495 const char *name
= name_sym
->linkage_name ();
7496 return strstr (name
, "___XR") != NULL
;
7499 /* Because of GNAT encoding conventions, several GDB symbols may match a
7500 given type name. If the type denoted by TYPE0 is to be preferred to
7501 that of TYPE1 for purposes of type printing, return non-zero;
7502 otherwise return 0. */
7505 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7509 else if (type0
== NULL
)
7511 else if (type1
->code () == TYPE_CODE_VOID
)
7513 else if (type0
->code () == TYPE_CODE_VOID
)
7515 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7517 else if (ada_is_constrained_packed_array_type (type0
))
7519 else if (ada_is_array_descriptor_type (type0
)
7520 && !ada_is_array_descriptor_type (type1
))
7524 const char *type0_name
= type0
->name ();
7525 const char *type1_name
= type1
->name ();
7527 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7528 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7534 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7538 ada_type_name (struct type
*type
)
7542 return type
->name ();
7545 /* Search the list of "descriptive" types associated to TYPE for a type
7546 whose name is NAME. */
7548 static struct type
*
7549 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7551 struct type
*result
, *tmp
;
7553 if (ada_ignore_descriptive_types_p
)
7556 /* If there no descriptive-type info, then there is no parallel type
7558 if (!HAVE_GNAT_AUX_INFO (type
))
7561 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7562 while (result
!= NULL
)
7564 const char *result_name
= ada_type_name (result
);
7566 if (result_name
== NULL
)
7568 warning (_("unexpected null name on descriptive type"));
7572 /* If the names match, stop. */
7573 if (strcmp (result_name
, name
) == 0)
7576 /* Otherwise, look at the next item on the list, if any. */
7577 if (HAVE_GNAT_AUX_INFO (result
))
7578 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7582 /* If not found either, try after having resolved the typedef. */
7587 result
= check_typedef (result
);
7588 if (HAVE_GNAT_AUX_INFO (result
))
7589 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7595 /* If we didn't find a match, see whether this is a packed array. With
7596 older compilers, the descriptive type information is either absent or
7597 irrelevant when it comes to packed arrays so the above lookup fails.
7598 Fall back to using a parallel lookup by name in this case. */
7599 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7600 return ada_find_any_type (name
);
7605 /* Find a parallel type to TYPE with the specified NAME, using the
7606 descriptive type taken from the debugging information, if available,
7607 and otherwise using the (slower) name-based method. */
7609 static struct type
*
7610 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7612 struct type
*result
= NULL
;
7614 if (HAVE_GNAT_AUX_INFO (type
))
7615 result
= find_parallel_type_by_descriptive_type (type
, name
);
7617 result
= ada_find_any_type (name
);
7622 /* Same as above, but specify the name of the parallel type by appending
7623 SUFFIX to the name of TYPE. */
7626 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7629 const char *type_name
= ada_type_name (type
);
7632 if (type_name
== NULL
)
7635 len
= strlen (type_name
);
7637 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7639 strcpy (name
, type_name
);
7640 strcpy (name
+ len
, suffix
);
7642 return ada_find_parallel_type_with_name (type
, name
);
7645 /* If TYPE is a variable-size record type, return the corresponding template
7646 type describing its fields. Otherwise, return NULL. */
7648 static struct type
*
7649 dynamic_template_type (struct type
*type
)
7651 type
= ada_check_typedef (type
);
7653 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7654 || ada_type_name (type
) == NULL
)
7658 int len
= strlen (ada_type_name (type
));
7660 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7663 return ada_find_parallel_type (type
, "___XVE");
7667 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7668 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7671 is_dynamic_field (struct type
*templ_type
, int field_num
)
7673 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7676 && templ_type
->field (field_num
).type ()->code () == TYPE_CODE_PTR
7677 && strstr (name
, "___XVL") != NULL
;
7680 /* The index of the variant field of TYPE, or -1 if TYPE does not
7681 represent a variant record type. */
7684 variant_field_index (struct type
*type
)
7688 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
7691 for (f
= 0; f
< type
->num_fields (); f
+= 1)
7693 if (ada_is_variant_part (type
, f
))
7699 /* A record type with no fields. */
7701 static struct type
*
7702 empty_record (struct type
*templ
)
7704 struct type
*type
= alloc_type_copy (templ
);
7706 type
->set_code (TYPE_CODE_STRUCT
);
7707 INIT_NONE_SPECIFIC (type
);
7708 type
->set_name ("<empty>");
7709 TYPE_LENGTH (type
) = 0;
7713 /* An ordinary record type (with fixed-length fields) that describes
7714 the value of type TYPE at VALADDR or ADDRESS (see comments at
7715 the beginning of this section) VAL according to GNAT conventions.
7716 DVAL0 should describe the (portion of a) record that contains any
7717 necessary discriminants. It should be NULL if value_type (VAL) is
7718 an outer-level type (i.e., as opposed to a branch of a variant.) A
7719 variant field (unless unchecked) is replaced by a particular branch
7722 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7723 length are not statically known are discarded. As a consequence,
7724 VALADDR, ADDRESS and DVAL0 are ignored.
7726 NOTE: Limitations: For now, we assume that dynamic fields and
7727 variants occupy whole numbers of bytes. However, they need not be
7731 ada_template_to_fixed_record_type_1 (struct type
*type
,
7732 const gdb_byte
*valaddr
,
7733 CORE_ADDR address
, struct value
*dval0
,
7734 int keep_dynamic_fields
)
7736 struct value
*mark
= value_mark ();
7739 int nfields
, bit_len
;
7745 /* Compute the number of fields in this record type that are going
7746 to be processed: unless keep_dynamic_fields, this includes only
7747 fields whose position and length are static will be processed. */
7748 if (keep_dynamic_fields
)
7749 nfields
= type
->num_fields ();
7753 while (nfields
< type
->num_fields ()
7754 && !ada_is_variant_part (type
, nfields
)
7755 && !is_dynamic_field (type
, nfields
))
7759 rtype
= alloc_type_copy (type
);
7760 rtype
->set_code (TYPE_CODE_STRUCT
);
7761 INIT_NONE_SPECIFIC (rtype
);
7762 rtype
->set_num_fields (nfields
);
7764 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
7765 rtype
->set_name (ada_type_name (type
));
7766 rtype
->set_is_fixed_instance (true);
7772 for (f
= 0; f
< nfields
; f
+= 1)
7774 off
= align_up (off
, field_alignment (type
, f
))
7775 + TYPE_FIELD_BITPOS (type
, f
);
7776 SET_FIELD_BITPOS (rtype
->field (f
), off
);
7777 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7779 if (ada_is_variant_part (type
, f
))
7784 else if (is_dynamic_field (type
, f
))
7786 const gdb_byte
*field_valaddr
= valaddr
;
7787 CORE_ADDR field_address
= address
;
7788 struct type
*field_type
=
7789 TYPE_TARGET_TYPE (type
->field (f
).type ());
7793 /* rtype's length is computed based on the run-time
7794 value of discriminants. If the discriminants are not
7795 initialized, the type size may be completely bogus and
7796 GDB may fail to allocate a value for it. So check the
7797 size first before creating the value. */
7798 ada_ensure_varsize_limit (rtype
);
7799 /* Using plain value_from_contents_and_address here
7800 causes problems because we will end up trying to
7801 resolve a type that is currently being
7803 dval
= value_from_contents_and_address_unresolved (rtype
,
7806 rtype
= value_type (dval
);
7811 /* If the type referenced by this field is an aligner type, we need
7812 to unwrap that aligner type, because its size might not be set.
7813 Keeping the aligner type would cause us to compute the wrong
7814 size for this field, impacting the offset of the all the fields
7815 that follow this one. */
7816 if (ada_is_aligner_type (field_type
))
7818 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7820 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7821 field_address
= cond_offset_target (field_address
, field_offset
);
7822 field_type
= ada_aligned_type (field_type
);
7825 field_valaddr
= cond_offset_host (field_valaddr
,
7826 off
/ TARGET_CHAR_BIT
);
7827 field_address
= cond_offset_target (field_address
,
7828 off
/ TARGET_CHAR_BIT
);
7830 /* Get the fixed type of the field. Note that, in this case,
7831 we do not want to get the real type out of the tag: if
7832 the current field is the parent part of a tagged record,
7833 we will get the tag of the object. Clearly wrong: the real
7834 type of the parent is not the real type of the child. We
7835 would end up in an infinite loop. */
7836 field_type
= ada_get_base_type (field_type
);
7837 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7838 field_address
, dval
, 0);
7839 /* If the field size is already larger than the maximum
7840 object size, then the record itself will necessarily
7841 be larger than the maximum object size. We need to make
7842 this check now, because the size might be so ridiculously
7843 large (due to an uninitialized variable in the inferior)
7844 that it would cause an overflow when adding it to the
7846 ada_ensure_varsize_limit (field_type
);
7848 rtype
->field (f
).set_type (field_type
);
7849 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7850 /* The multiplication can potentially overflow. But because
7851 the field length has been size-checked just above, and
7852 assuming that the maximum size is a reasonable value,
7853 an overflow should not happen in practice. So rather than
7854 adding overflow recovery code to this already complex code,
7855 we just assume that it's not going to happen. */
7857 TYPE_LENGTH (rtype
->field (f
).type ()) * TARGET_CHAR_BIT
;
7861 /* Note: If this field's type is a typedef, it is important
7862 to preserve the typedef layer.
7864 Otherwise, we might be transforming a typedef to a fat
7865 pointer (encoding a pointer to an unconstrained array),
7866 into a basic fat pointer (encoding an unconstrained
7867 array). As both types are implemented using the same
7868 structure, the typedef is the only clue which allows us
7869 to distinguish between the two options. Stripping it
7870 would prevent us from printing this field appropriately. */
7871 rtype
->field (f
).set_type (type
->field (f
).type ());
7872 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7873 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7875 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7878 struct type
*field_type
= type
->field (f
).type ();
7880 /* We need to be careful of typedefs when computing
7881 the length of our field. If this is a typedef,
7882 get the length of the target type, not the length
7884 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
7885 field_type
= ada_typedef_target_type (field_type
);
7888 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7891 if (off
+ fld_bit_len
> bit_len
)
7892 bit_len
= off
+ fld_bit_len
;
7894 TYPE_LENGTH (rtype
) =
7895 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7898 /* We handle the variant part, if any, at the end because of certain
7899 odd cases in which it is re-ordered so as NOT to be the last field of
7900 the record. This can happen in the presence of representation
7902 if (variant_field
>= 0)
7904 struct type
*branch_type
;
7906 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7910 /* Using plain value_from_contents_and_address here causes
7911 problems because we will end up trying to resolve a type
7912 that is currently being constructed. */
7913 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
7915 rtype
= value_type (dval
);
7921 to_fixed_variant_branch_type
7922 (type
->field (variant_field
).type (),
7923 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7924 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7925 if (branch_type
== NULL
)
7927 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
7928 rtype
->field (f
- 1) = rtype
->field (f
);
7929 rtype
->set_num_fields (rtype
->num_fields () - 1);
7933 rtype
->field (variant_field
).set_type (branch_type
);
7934 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7936 TYPE_LENGTH (rtype
->field (variant_field
).type ()) *
7938 if (off
+ fld_bit_len
> bit_len
)
7939 bit_len
= off
+ fld_bit_len
;
7940 TYPE_LENGTH (rtype
) =
7941 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7945 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7946 should contain the alignment of that record, which should be a strictly
7947 positive value. If null or negative, then something is wrong, most
7948 probably in the debug info. In that case, we don't round up the size
7949 of the resulting type. If this record is not part of another structure,
7950 the current RTYPE length might be good enough for our purposes. */
7951 if (TYPE_LENGTH (type
) <= 0)
7954 warning (_("Invalid type size for `%s' detected: %s."),
7955 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
7957 warning (_("Invalid type size for <unnamed> detected: %s."),
7958 pulongest (TYPE_LENGTH (type
)));
7962 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
7963 TYPE_LENGTH (type
));
7966 value_free_to_mark (mark
);
7967 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7968 error (_("record type with dynamic size is larger than varsize-limit"));
7972 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7975 static struct type
*
7976 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7977 CORE_ADDR address
, struct value
*dval0
)
7979 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7983 /* An ordinary record type in which ___XVL-convention fields and
7984 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7985 static approximations, containing all possible fields. Uses
7986 no runtime values. Useless for use in values, but that's OK,
7987 since the results are used only for type determinations. Works on both
7988 structs and unions. Representation note: to save space, we memorize
7989 the result of this function in the TYPE_TARGET_TYPE of the
7992 static struct type
*
7993 template_to_static_fixed_type (struct type
*type0
)
7999 /* No need no do anything if the input type is already fixed. */
8000 if (type0
->is_fixed_instance ())
8003 /* Likewise if we already have computed the static approximation. */
8004 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8005 return TYPE_TARGET_TYPE (type0
);
8007 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8009 nfields
= type0
->num_fields ();
8011 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8012 recompute all over next time. */
8013 TYPE_TARGET_TYPE (type0
) = type
;
8015 for (f
= 0; f
< nfields
; f
+= 1)
8017 struct type
*field_type
= type0
->field (f
).type ();
8018 struct type
*new_type
;
8020 if (is_dynamic_field (type0
, f
))
8022 field_type
= ada_check_typedef (field_type
);
8023 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8026 new_type
= static_unwrap_type (field_type
);
8028 if (new_type
!= field_type
)
8030 /* Clone TYPE0 only the first time we get a new field type. */
8033 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8034 type
->set_code (type0
->code ());
8035 INIT_NONE_SPECIFIC (type
);
8036 type
->set_num_fields (nfields
);
8040 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
8041 memcpy (fields
, type0
->fields (),
8042 sizeof (struct field
) * nfields
);
8043 type
->set_fields (fields
);
8045 type
->set_name (ada_type_name (type0
));
8046 type
->set_is_fixed_instance (true);
8047 TYPE_LENGTH (type
) = 0;
8049 type
->field (f
).set_type (new_type
);
8050 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8057 /* Given an object of type TYPE whose contents are at VALADDR and
8058 whose address in memory is ADDRESS, returns a revision of TYPE,
8059 which should be a non-dynamic-sized record, in which the variant
8060 part, if any, is replaced with the appropriate branch. Looks
8061 for discriminant values in DVAL0, which can be NULL if the record
8062 contains the necessary discriminant values. */
8064 static struct type
*
8065 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8066 CORE_ADDR address
, struct value
*dval0
)
8068 struct value
*mark
= value_mark ();
8071 struct type
*branch_type
;
8072 int nfields
= type
->num_fields ();
8073 int variant_field
= variant_field_index (type
);
8075 if (variant_field
== -1)
8080 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8081 type
= value_type (dval
);
8086 rtype
= alloc_type_copy (type
);
8087 rtype
->set_code (TYPE_CODE_STRUCT
);
8088 INIT_NONE_SPECIFIC (rtype
);
8089 rtype
->set_num_fields (nfields
);
8092 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8093 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
8094 rtype
->set_fields (fields
);
8096 rtype
->set_name (ada_type_name (type
));
8097 rtype
->set_is_fixed_instance (true);
8098 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8100 branch_type
= to_fixed_variant_branch_type
8101 (type
->field (variant_field
).type (),
8102 cond_offset_host (valaddr
,
8103 TYPE_FIELD_BITPOS (type
, variant_field
)
8105 cond_offset_target (address
,
8106 TYPE_FIELD_BITPOS (type
, variant_field
)
8107 / TARGET_CHAR_BIT
), dval
);
8108 if (branch_type
== NULL
)
8112 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8113 rtype
->field (f
- 1) = rtype
->field (f
);
8114 rtype
->set_num_fields (rtype
->num_fields () - 1);
8118 rtype
->field (variant_field
).set_type (branch_type
);
8119 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8120 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8121 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8123 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (type
->field (variant_field
).type ());
8125 value_free_to_mark (mark
);
8129 /* An ordinary record type (with fixed-length fields) that describes
8130 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8131 beginning of this section]. Any necessary discriminants' values
8132 should be in DVAL, a record value; it may be NULL if the object
8133 at ADDR itself contains any necessary discriminant values.
8134 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8135 values from the record are needed. Except in the case that DVAL,
8136 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8137 unchecked) is replaced by a particular branch of the variant.
8139 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8140 is questionable and may be removed. It can arise during the
8141 processing of an unconstrained-array-of-record type where all the
8142 variant branches have exactly the same size. This is because in
8143 such cases, the compiler does not bother to use the XVS convention
8144 when encoding the record. I am currently dubious of this
8145 shortcut and suspect the compiler should be altered. FIXME. */
8147 static struct type
*
8148 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8149 CORE_ADDR address
, struct value
*dval
)
8151 struct type
*templ_type
;
8153 if (type0
->is_fixed_instance ())
8156 templ_type
= dynamic_template_type (type0
);
8158 if (templ_type
!= NULL
)
8159 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8160 else if (variant_field_index (type0
) >= 0)
8162 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8164 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8169 type0
->set_is_fixed_instance (true);
8175 /* An ordinary record type (with fixed-length fields) that describes
8176 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8177 union type. Any necessary discriminants' values should be in DVAL,
8178 a record value. That is, this routine selects the appropriate
8179 branch of the union at ADDR according to the discriminant value
8180 indicated in the union's type name. Returns VAR_TYPE0 itself if
8181 it represents a variant subject to a pragma Unchecked_Union. */
8183 static struct type
*
8184 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8185 CORE_ADDR address
, struct value
*dval
)
8188 struct type
*templ_type
;
8189 struct type
*var_type
;
8191 if (var_type0
->code () == TYPE_CODE_PTR
)
8192 var_type
= TYPE_TARGET_TYPE (var_type0
);
8194 var_type
= var_type0
;
8196 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8198 if (templ_type
!= NULL
)
8199 var_type
= templ_type
;
8201 if (is_unchecked_variant (var_type
, value_type (dval
)))
8203 which
= ada_which_variant_applies (var_type
, dval
);
8206 return empty_record (var_type
);
8207 else if (is_dynamic_field (var_type
, which
))
8208 return to_fixed_record_type
8209 (TYPE_TARGET_TYPE (var_type
->field (which
).type ()),
8210 valaddr
, address
, dval
);
8211 else if (variant_field_index (var_type
->field (which
).type ()) >= 0)
8213 to_fixed_record_type
8214 (var_type
->field (which
).type (), valaddr
, address
, dval
);
8216 return var_type
->field (which
).type ();
8219 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8220 ENCODING_TYPE, a type following the GNAT conventions for discrete
8221 type encodings, only carries redundant information. */
8224 ada_is_redundant_range_encoding (struct type
*range_type
,
8225 struct type
*encoding_type
)
8227 const char *bounds_str
;
8231 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8233 if (get_base_type (range_type
)->code ()
8234 != get_base_type (encoding_type
)->code ())
8236 /* The compiler probably used a simple base type to describe
8237 the range type instead of the range's actual base type,
8238 expecting us to get the real base type from the encoding
8239 anyway. In this situation, the encoding cannot be ignored
8244 if (is_dynamic_type (range_type
))
8247 if (encoding_type
->name () == NULL
)
8250 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8251 if (bounds_str
== NULL
)
8254 n
= 8; /* Skip "___XDLU_". */
8255 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8257 if (range_type
->bounds ()->low
.const_val () != lo
)
8260 n
+= 2; /* Skip the "__" separator between the two bounds. */
8261 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8263 if (range_type
->bounds ()->high
.const_val () != hi
)
8269 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8270 a type following the GNAT encoding for describing array type
8271 indices, only carries redundant information. */
8274 ada_is_redundant_index_type_desc (struct type
*array_type
,
8275 struct type
*desc_type
)
8277 struct type
*this_layer
= check_typedef (array_type
);
8280 for (i
= 0; i
< desc_type
->num_fields (); i
++)
8282 if (!ada_is_redundant_range_encoding (this_layer
->index_type (),
8283 desc_type
->field (i
).type ()))
8285 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8291 /* Assuming that TYPE0 is an array type describing the type of a value
8292 at ADDR, and that DVAL describes a record containing any
8293 discriminants used in TYPE0, returns a type for the value that
8294 contains no dynamic components (that is, no components whose sizes
8295 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8296 true, gives an error message if the resulting type's size is over
8299 static struct type
*
8300 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8303 struct type
*index_type_desc
;
8304 struct type
*result
;
8305 int constrained_packed_array_p
;
8306 static const char *xa_suffix
= "___XA";
8308 type0
= ada_check_typedef (type0
);
8309 if (type0
->is_fixed_instance ())
8312 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8313 if (constrained_packed_array_p
)
8315 type0
= decode_constrained_packed_array_type (type0
);
8316 if (type0
== nullptr)
8317 error (_("could not decode constrained packed array type"));
8320 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8322 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8323 encoding suffixed with 'P' may still be generated. If so,
8324 it should be used to find the XA type. */
8326 if (index_type_desc
== NULL
)
8328 const char *type_name
= ada_type_name (type0
);
8330 if (type_name
!= NULL
)
8332 const int len
= strlen (type_name
);
8333 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8335 if (type_name
[len
- 1] == 'P')
8337 strcpy (name
, type_name
);
8338 strcpy (name
+ len
- 1, xa_suffix
);
8339 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8344 ada_fixup_array_indexes_type (index_type_desc
);
8345 if (index_type_desc
!= NULL
8346 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8348 /* Ignore this ___XA parallel type, as it does not bring any
8349 useful information. This allows us to avoid creating fixed
8350 versions of the array's index types, which would be identical
8351 to the original ones. This, in turn, can also help avoid
8352 the creation of fixed versions of the array itself. */
8353 index_type_desc
= NULL
;
8356 if (index_type_desc
== NULL
)
8358 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8360 /* NOTE: elt_type---the fixed version of elt_type0---should never
8361 depend on the contents of the array in properly constructed
8363 /* Create a fixed version of the array element type.
8364 We're not providing the address of an element here,
8365 and thus the actual object value cannot be inspected to do
8366 the conversion. This should not be a problem, since arrays of
8367 unconstrained objects are not allowed. In particular, all
8368 the elements of an array of a tagged type should all be of
8369 the same type specified in the debugging info. No need to
8370 consult the object tag. */
8371 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8373 /* Make sure we always create a new array type when dealing with
8374 packed array types, since we're going to fix-up the array
8375 type length and element bitsize a little further down. */
8376 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8379 result
= create_array_type (alloc_type_copy (type0
),
8380 elt_type
, type0
->index_type ());
8385 struct type
*elt_type0
;
8388 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8389 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8391 /* NOTE: result---the fixed version of elt_type0---should never
8392 depend on the contents of the array in properly constructed
8394 /* Create a fixed version of the array element type.
8395 We're not providing the address of an element here,
8396 and thus the actual object value cannot be inspected to do
8397 the conversion. This should not be a problem, since arrays of
8398 unconstrained objects are not allowed. In particular, all
8399 the elements of an array of a tagged type should all be of
8400 the same type specified in the debugging info. No need to
8401 consult the object tag. */
8403 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8406 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8408 struct type
*range_type
=
8409 to_fixed_range_type (index_type_desc
->field (i
).type (), dval
);
8411 result
= create_array_type (alloc_type_copy (elt_type0
),
8412 result
, range_type
);
8413 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8415 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8416 error (_("array type with dynamic size is larger than varsize-limit"));
8419 /* We want to preserve the type name. This can be useful when
8420 trying to get the type name of a value that has already been
8421 printed (for instance, if the user did "print VAR; whatis $". */
8422 result
->set_name (type0
->name ());
8424 if (constrained_packed_array_p
)
8426 /* So far, the resulting type has been created as if the original
8427 type was a regular (non-packed) array type. As a result, the
8428 bitsize of the array elements needs to be set again, and the array
8429 length needs to be recomputed based on that bitsize. */
8430 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8431 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8433 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8434 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8435 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8436 TYPE_LENGTH (result
)++;
8439 result
->set_is_fixed_instance (true);
8444 /* A standard type (containing no dynamically sized components)
8445 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8446 DVAL describes a record containing any discriminants used in TYPE0,
8447 and may be NULL if there are none, or if the object of type TYPE at
8448 ADDRESS or in VALADDR contains these discriminants.
8450 If CHECK_TAG is not null, in the case of tagged types, this function
8451 attempts to locate the object's tag and use it to compute the actual
8452 type. However, when ADDRESS is null, we cannot use it to determine the
8453 location of the tag, and therefore compute the tagged type's actual type.
8454 So we return the tagged type without consulting the tag. */
8456 static struct type
*
8457 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8458 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8460 type
= ada_check_typedef (type
);
8462 /* Only un-fixed types need to be handled here. */
8463 if (!HAVE_GNAT_AUX_INFO (type
))
8466 switch (type
->code ())
8470 case TYPE_CODE_STRUCT
:
8472 struct type
*static_type
= to_static_fixed_type (type
);
8473 struct type
*fixed_record_type
=
8474 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8476 /* If STATIC_TYPE is a tagged type and we know the object's address,
8477 then we can determine its tag, and compute the object's actual
8478 type from there. Note that we have to use the fixed record
8479 type (the parent part of the record may have dynamic fields
8480 and the way the location of _tag is expressed may depend on
8483 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8486 value_tag_from_contents_and_address
8490 struct type
*real_type
= type_from_tag (tag
);
8492 value_from_contents_and_address (fixed_record_type
,
8495 fixed_record_type
= value_type (obj
);
8496 if (real_type
!= NULL
)
8497 return to_fixed_record_type
8499 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8502 /* Check to see if there is a parallel ___XVZ variable.
8503 If there is, then it provides the actual size of our type. */
8504 else if (ada_type_name (fixed_record_type
) != NULL
)
8506 const char *name
= ada_type_name (fixed_record_type
);
8508 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8509 bool xvz_found
= false;
8512 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8515 xvz_found
= get_int_var_value (xvz_name
, size
);
8517 catch (const gdb_exception_error
&except
)
8519 /* We found the variable, but somehow failed to read
8520 its value. Rethrow the same error, but with a little
8521 bit more information, to help the user understand
8522 what went wrong (Eg: the variable might have been
8524 throw_error (except
.error
,
8525 _("unable to read value of %s (%s)"),
8526 xvz_name
, except
.what ());
8529 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8531 fixed_record_type
= copy_type (fixed_record_type
);
8532 TYPE_LENGTH (fixed_record_type
) = size
;
8534 /* The FIXED_RECORD_TYPE may have be a stub. We have
8535 observed this when the debugging info is STABS, and
8536 apparently it is something that is hard to fix.
8538 In practice, we don't need the actual type definition
8539 at all, because the presence of the XVZ variable allows us
8540 to assume that there must be a XVS type as well, which we
8541 should be able to use later, when we need the actual type
8544 In the meantime, pretend that the "fixed" type we are
8545 returning is NOT a stub, because this can cause trouble
8546 when using this type to create new types targeting it.
8547 Indeed, the associated creation routines often check
8548 whether the target type is a stub and will try to replace
8549 it, thus using a type with the wrong size. This, in turn,
8550 might cause the new type to have the wrong size too.
8551 Consider the case of an array, for instance, where the size
8552 of the array is computed from the number of elements in
8553 our array multiplied by the size of its element. */
8554 fixed_record_type
->set_is_stub (false);
8557 return fixed_record_type
;
8559 case TYPE_CODE_ARRAY
:
8560 return to_fixed_array_type (type
, dval
, 1);
8561 case TYPE_CODE_UNION
:
8565 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8569 /* The same as ada_to_fixed_type_1, except that it preserves the type
8570 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8572 The typedef layer needs be preserved in order to differentiate between
8573 arrays and array pointers when both types are implemented using the same
8574 fat pointer. In the array pointer case, the pointer is encoded as
8575 a typedef of the pointer type. For instance, considering:
8577 type String_Access is access String;
8578 S1 : String_Access := null;
8580 To the debugger, S1 is defined as a typedef of type String. But
8581 to the user, it is a pointer. So if the user tries to print S1,
8582 we should not dereference the array, but print the array address
8585 If we didn't preserve the typedef layer, we would lose the fact that
8586 the type is to be presented as a pointer (needs de-reference before
8587 being printed). And we would also use the source-level type name. */
8590 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8591 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8594 struct type
*fixed_type
=
8595 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8597 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8598 then preserve the typedef layer.
8600 Implementation note: We can only check the main-type portion of
8601 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8602 from TYPE now returns a type that has the same instance flags
8603 as TYPE. For instance, if TYPE is a "typedef const", and its
8604 target type is a "struct", then the typedef elimination will return
8605 a "const" version of the target type. See check_typedef for more
8606 details about how the typedef layer elimination is done.
8608 brobecker/2010-11-19: It seems to me that the only case where it is
8609 useful to preserve the typedef layer is when dealing with fat pointers.
8610 Perhaps, we could add a check for that and preserve the typedef layer
8611 only in that situation. But this seems unnecessary so far, probably
8612 because we call check_typedef/ada_check_typedef pretty much everywhere.
8614 if (type
->code () == TYPE_CODE_TYPEDEF
8615 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8616 == TYPE_MAIN_TYPE (fixed_type
)))
8622 /* A standard (static-sized) type corresponding as well as possible to
8623 TYPE0, but based on no runtime data. */
8625 static struct type
*
8626 to_static_fixed_type (struct type
*type0
)
8633 if (type0
->is_fixed_instance ())
8636 type0
= ada_check_typedef (type0
);
8638 switch (type0
->code ())
8642 case TYPE_CODE_STRUCT
:
8643 type
= dynamic_template_type (type0
);
8645 return template_to_static_fixed_type (type
);
8647 return template_to_static_fixed_type (type0
);
8648 case TYPE_CODE_UNION
:
8649 type
= ada_find_parallel_type (type0
, "___XVU");
8651 return template_to_static_fixed_type (type
);
8653 return template_to_static_fixed_type (type0
);
8657 /* A static approximation of TYPE with all type wrappers removed. */
8659 static struct type
*
8660 static_unwrap_type (struct type
*type
)
8662 if (ada_is_aligner_type (type
))
8664 struct type
*type1
= ada_check_typedef (type
)->field (0).type ();
8665 if (ada_type_name (type1
) == NULL
)
8666 type1
->set_name (ada_type_name (type
));
8668 return static_unwrap_type (type1
);
8672 struct type
*raw_real_type
= ada_get_base_type (type
);
8674 if (raw_real_type
== type
)
8677 return to_static_fixed_type (raw_real_type
);
8681 /* In some cases, incomplete and private types require
8682 cross-references that are not resolved as records (for example,
8684 type FooP is access Foo;
8686 type Foo is array ...;
8687 ). In these cases, since there is no mechanism for producing
8688 cross-references to such types, we instead substitute for FooP a
8689 stub enumeration type that is nowhere resolved, and whose tag is
8690 the name of the actual type. Call these types "non-record stubs". */
8692 /* A type equivalent to TYPE that is not a non-record stub, if one
8693 exists, otherwise TYPE. */
8696 ada_check_typedef (struct type
*type
)
8701 /* If our type is an access to an unconstrained array, which is encoded
8702 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
8703 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8704 what allows us to distinguish between fat pointers that represent
8705 array types, and fat pointers that represent array access types
8706 (in both cases, the compiler implements them as fat pointers). */
8707 if (ada_is_access_to_unconstrained_array (type
))
8710 type
= check_typedef (type
);
8711 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
8712 || !type
->is_stub ()
8713 || type
->name () == NULL
)
8717 const char *name
= type
->name ();
8718 struct type
*type1
= ada_find_any_type (name
);
8723 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8724 stubs pointing to arrays, as we don't create symbols for array
8725 types, only for the typedef-to-array types). If that's the case,
8726 strip the typedef layer. */
8727 if (type1
->code () == TYPE_CODE_TYPEDEF
)
8728 type1
= ada_check_typedef (type1
);
8734 /* A value representing the data at VALADDR/ADDRESS as described by
8735 type TYPE0, but with a standard (static-sized) type that correctly
8736 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8737 type, then return VAL0 [this feature is simply to avoid redundant
8738 creation of struct values]. */
8740 static struct value
*
8741 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8744 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8746 if (type
== type0
&& val0
!= NULL
)
8749 if (VALUE_LVAL (val0
) != lval_memory
)
8751 /* Our value does not live in memory; it could be a convenience
8752 variable, for instance. Create a not_lval value using val0's
8754 return value_from_contents (type
, value_contents (val0
));
8757 return value_from_contents_and_address (type
, 0, address
);
8760 /* A value representing VAL, but with a standard (static-sized) type
8761 that correctly describes it. Does not necessarily create a new
8765 ada_to_fixed_value (struct value
*val
)
8767 val
= unwrap_value (val
);
8768 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
8775 /* Table mapping attribute numbers to names.
8776 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8778 static const char * const attribute_names
[] = {
8796 ada_attribute_name (enum exp_opcode n
)
8798 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8799 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8801 return attribute_names
[0];
8804 /* Evaluate the 'POS attribute applied to ARG. */
8807 pos_atr (struct value
*arg
)
8809 struct value
*val
= coerce_ref (arg
);
8810 struct type
*type
= value_type (val
);
8812 if (!discrete_type_p (type
))
8813 error (_("'POS only defined on discrete types"));
8815 gdb::optional
<LONGEST
> result
= discrete_position (type
, value_as_long (val
));
8816 if (!result
.has_value ())
8817 error (_("enumeration value is invalid: can't find 'POS"));
8822 static struct value
*
8823 value_pos_atr (struct type
*type
, struct value
*arg
)
8825 return value_from_longest (type
, pos_atr (arg
));
8828 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8830 static struct value
*
8831 val_atr (struct type
*type
, LONGEST val
)
8833 gdb_assert (discrete_type_p (type
));
8834 if (type
->code () == TYPE_CODE_RANGE
)
8835 type
= TYPE_TARGET_TYPE (type
);
8836 if (type
->code () == TYPE_CODE_ENUM
)
8838 if (val
< 0 || val
>= type
->num_fields ())
8839 error (_("argument to 'VAL out of range"));
8840 val
= TYPE_FIELD_ENUMVAL (type
, val
);
8842 return value_from_longest (type
, val
);
8845 static struct value
*
8846 ada_val_atr (enum noside noside
, struct type
*type
, struct value
*arg
)
8848 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8849 return value_zero (type
, not_lval
);
8851 if (!discrete_type_p (type
))
8852 error (_("'VAL only defined on discrete types"));
8853 if (!integer_type_p (value_type (arg
)))
8854 error (_("'VAL requires integral argument"));
8856 return val_atr (type
, value_as_long (arg
));
8862 /* True if TYPE appears to be an Ada character type.
8863 [At the moment, this is true only for Character and Wide_Character;
8864 It is a heuristic test that could stand improvement]. */
8867 ada_is_character_type (struct type
*type
)
8871 /* If the type code says it's a character, then assume it really is,
8872 and don't check any further. */
8873 if (type
->code () == TYPE_CODE_CHAR
)
8876 /* Otherwise, assume it's a character type iff it is a discrete type
8877 with a known character type name. */
8878 name
= ada_type_name (type
);
8879 return (name
!= NULL
8880 && (type
->code () == TYPE_CODE_INT
8881 || type
->code () == TYPE_CODE_RANGE
)
8882 && (strcmp (name
, "character") == 0
8883 || strcmp (name
, "wide_character") == 0
8884 || strcmp (name
, "wide_wide_character") == 0
8885 || strcmp (name
, "unsigned char") == 0));
8888 /* True if TYPE appears to be an Ada string type. */
8891 ada_is_string_type (struct type
*type
)
8893 type
= ada_check_typedef (type
);
8895 && type
->code () != TYPE_CODE_PTR
8896 && (ada_is_simple_array_type (type
)
8897 || ada_is_array_descriptor_type (type
))
8898 && ada_array_arity (type
) == 1)
8900 struct type
*elttype
= ada_array_element_type (type
, 1);
8902 return ada_is_character_type (elttype
);
8908 /* The compiler sometimes provides a parallel XVS type for a given
8909 PAD type. Normally, it is safe to follow the PAD type directly,
8910 but older versions of the compiler have a bug that causes the offset
8911 of its "F" field to be wrong. Following that field in that case
8912 would lead to incorrect results, but this can be worked around
8913 by ignoring the PAD type and using the associated XVS type instead.
8915 Set to True if the debugger should trust the contents of PAD types.
8916 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8917 static bool trust_pad_over_xvs
= true;
8919 /* True if TYPE is a struct type introduced by the compiler to force the
8920 alignment of a value. Such types have a single field with a
8921 distinctive name. */
8924 ada_is_aligner_type (struct type
*type
)
8926 type
= ada_check_typedef (type
);
8928 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8931 return (type
->code () == TYPE_CODE_STRUCT
8932 && type
->num_fields () == 1
8933 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8936 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8937 the parallel type. */
8940 ada_get_base_type (struct type
*raw_type
)
8942 struct type
*real_type_namer
;
8943 struct type
*raw_real_type
;
8945 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
8948 if (ada_is_aligner_type (raw_type
))
8949 /* The encoding specifies that we should always use the aligner type.
8950 So, even if this aligner type has an associated XVS type, we should
8953 According to the compiler gurus, an XVS type parallel to an aligner
8954 type may exist because of a stabs limitation. In stabs, aligner
8955 types are empty because the field has a variable-sized type, and
8956 thus cannot actually be used as an aligner type. As a result,
8957 we need the associated parallel XVS type to decode the type.
8958 Since the policy in the compiler is to not change the internal
8959 representation based on the debugging info format, we sometimes
8960 end up having a redundant XVS type parallel to the aligner type. */
8963 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8964 if (real_type_namer
== NULL
8965 || real_type_namer
->code () != TYPE_CODE_STRUCT
8966 || real_type_namer
->num_fields () != 1)
8969 if (real_type_namer
->field (0).type ()->code () != TYPE_CODE_REF
)
8971 /* This is an older encoding form where the base type needs to be
8972 looked up by name. We prefer the newer encoding because it is
8974 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8975 if (raw_real_type
== NULL
)
8978 return raw_real_type
;
8981 /* The field in our XVS type is a reference to the base type. */
8982 return TYPE_TARGET_TYPE (real_type_namer
->field (0).type ());
8985 /* The type of value designated by TYPE, with all aligners removed. */
8988 ada_aligned_type (struct type
*type
)
8990 if (ada_is_aligner_type (type
))
8991 return ada_aligned_type (type
->field (0).type ());
8993 return ada_get_base_type (type
);
8997 /* The address of the aligned value in an object at address VALADDR
8998 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9001 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9003 if (ada_is_aligner_type (type
))
9004 return ada_aligned_value_addr (type
->field (0).type (),
9006 TYPE_FIELD_BITPOS (type
,
9007 0) / TARGET_CHAR_BIT
);
9014 /* The printed representation of an enumeration literal with encoded
9015 name NAME. The value is good to the next call of ada_enum_name. */
9017 ada_enum_name (const char *name
)
9019 static std::string storage
;
9022 /* First, unqualify the enumeration name:
9023 1. Search for the last '.' character. If we find one, then skip
9024 all the preceding characters, the unqualified name starts
9025 right after that dot.
9026 2. Otherwise, we may be debugging on a target where the compiler
9027 translates dots into "__". Search forward for double underscores,
9028 but stop searching when we hit an overloading suffix, which is
9029 of the form "__" followed by digits. */
9031 tmp
= strrchr (name
, '.');
9036 while ((tmp
= strstr (name
, "__")) != NULL
)
9038 if (isdigit (tmp
[2]))
9049 if (name
[1] == 'U' || name
[1] == 'W')
9051 if (sscanf (name
+ 2, "%x", &v
) != 1)
9054 else if (((name
[1] >= '0' && name
[1] <= '9')
9055 || (name
[1] >= 'a' && name
[1] <= 'z'))
9058 storage
= string_printf ("'%c'", name
[1]);
9059 return storage
.c_str ();
9064 if (isascii (v
) && isprint (v
))
9065 storage
= string_printf ("'%c'", v
);
9066 else if (name
[1] == 'U')
9067 storage
= string_printf ("[\"%02x\"]", v
);
9069 storage
= string_printf ("[\"%04x\"]", v
);
9071 return storage
.c_str ();
9075 tmp
= strstr (name
, "__");
9077 tmp
= strstr (name
, "$");
9080 storage
= std::string (name
, tmp
- name
);
9081 return storage
.c_str ();
9088 /* Evaluate the subexpression of EXP starting at *POS as for
9089 evaluate_type, updating *POS to point just past the evaluated
9092 static struct value
*
9093 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9095 return evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9098 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9101 static struct value
*
9102 unwrap_value (struct value
*val
)
9104 struct type
*type
= ada_check_typedef (value_type (val
));
9106 if (ada_is_aligner_type (type
))
9108 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9109 struct type
*val_type
= ada_check_typedef (value_type (v
));
9111 if (ada_type_name (val_type
) == NULL
)
9112 val_type
->set_name (ada_type_name (type
));
9114 return unwrap_value (v
);
9118 struct type
*raw_real_type
=
9119 ada_check_typedef (ada_get_base_type (type
));
9121 /* If there is no parallel XVS or XVE type, then the value is
9122 already unwrapped. Return it without further modification. */
9123 if ((type
== raw_real_type
)
9124 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9128 coerce_unspec_val_to_type
9129 (val
, ada_to_fixed_type (raw_real_type
, 0,
9130 value_address (val
),
9135 /* Given two array types T1 and T2, return nonzero iff both arrays
9136 contain the same number of elements. */
9139 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9141 LONGEST lo1
, hi1
, lo2
, hi2
;
9143 /* Get the array bounds in order to verify that the size of
9144 the two arrays match. */
9145 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9146 || !get_array_bounds (t2
, &lo2
, &hi2
))
9147 error (_("unable to determine array bounds"));
9149 /* To make things easier for size comparison, normalize a bit
9150 the case of empty arrays by making sure that the difference
9151 between upper bound and lower bound is always -1. */
9157 return (hi1
- lo1
== hi2
- lo2
);
9160 /* Assuming that VAL is an array of integrals, and TYPE represents
9161 an array with the same number of elements, but with wider integral
9162 elements, return an array "casted" to TYPE. In practice, this
9163 means that the returned array is built by casting each element
9164 of the original array into TYPE's (wider) element type. */
9166 static struct value
*
9167 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9169 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9174 /* Verify that both val and type are arrays of scalars, and
9175 that the size of val's elements is smaller than the size
9176 of type's element. */
9177 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9178 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9179 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9180 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9181 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9182 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9184 if (!get_array_bounds (type
, &lo
, &hi
))
9185 error (_("unable to determine array bounds"));
9187 res
= allocate_value (type
);
9189 /* Promote each array element. */
9190 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9192 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9194 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9195 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9201 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9202 return the converted value. */
9204 static struct value
*
9205 coerce_for_assign (struct type
*type
, struct value
*val
)
9207 struct type
*type2
= value_type (val
);
9212 type2
= ada_check_typedef (type2
);
9213 type
= ada_check_typedef (type
);
9215 if (type2
->code () == TYPE_CODE_PTR
9216 && type
->code () == TYPE_CODE_ARRAY
)
9218 val
= ada_value_ind (val
);
9219 type2
= value_type (val
);
9222 if (type2
->code () == TYPE_CODE_ARRAY
9223 && type
->code () == TYPE_CODE_ARRAY
)
9225 if (!ada_same_array_size_p (type
, type2
))
9226 error (_("cannot assign arrays of different length"));
9228 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9229 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9230 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9231 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9233 /* Allow implicit promotion of the array elements to
9235 return ada_promote_array_of_integrals (type
, val
);
9238 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9239 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9240 error (_("Incompatible types in assignment"));
9241 deprecated_set_value_type (val
, type
);
9246 static struct value
*
9247 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9250 struct type
*type1
, *type2
;
9253 arg1
= coerce_ref (arg1
);
9254 arg2
= coerce_ref (arg2
);
9255 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9256 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9258 if (type1
->code () != TYPE_CODE_INT
9259 || type2
->code () != TYPE_CODE_INT
)
9260 return value_binop (arg1
, arg2
, op
);
9269 return value_binop (arg1
, arg2
, op
);
9272 v2
= value_as_long (arg2
);
9274 error (_("second operand of %s must not be zero."), op_string (op
));
9276 if (type1
->is_unsigned () || op
== BINOP_MOD
)
9277 return value_binop (arg1
, arg2
, op
);
9279 v1
= value_as_long (arg1
);
9284 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9285 v
+= v
> 0 ? -1 : 1;
9293 /* Should not reach this point. */
9297 val
= allocate_value (type1
);
9298 store_unsigned_integer (value_contents_raw (val
),
9299 TYPE_LENGTH (value_type (val
)),
9300 type_byte_order (type1
), v
);
9305 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9307 if (ada_is_direct_array_type (value_type (arg1
))
9308 || ada_is_direct_array_type (value_type (arg2
)))
9310 struct type
*arg1_type
, *arg2_type
;
9312 /* Automatically dereference any array reference before
9313 we attempt to perform the comparison. */
9314 arg1
= ada_coerce_ref (arg1
);
9315 arg2
= ada_coerce_ref (arg2
);
9317 arg1
= ada_coerce_to_simple_array (arg1
);
9318 arg2
= ada_coerce_to_simple_array (arg2
);
9320 arg1_type
= ada_check_typedef (value_type (arg1
));
9321 arg2_type
= ada_check_typedef (value_type (arg2
));
9323 if (arg1_type
->code () != TYPE_CODE_ARRAY
9324 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9325 error (_("Attempt to compare array with non-array"));
9326 /* FIXME: The following works only for types whose
9327 representations use all bits (no padding or undefined bits)
9328 and do not have user-defined equality. */
9329 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9330 && memcmp (value_contents (arg1
), value_contents (arg2
),
9331 TYPE_LENGTH (arg1_type
)) == 0);
9333 return value_equal (arg1
, arg2
);
9336 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9337 component of LHS (a simple array or a record), updating *POS past
9338 the expression, assuming that LHS is contained in CONTAINER. Does
9339 not modify the inferior's memory, nor does it modify LHS (unless
9340 LHS == CONTAINER). */
9343 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9344 struct expression
*exp
, int *pos
)
9346 struct value
*mark
= value_mark ();
9348 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9350 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9352 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9353 struct value
*index_val
= value_from_longest (index_type
, index
);
9355 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9359 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9360 elt
= ada_to_fixed_value (elt
);
9363 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9364 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9366 value_assign_to_component (container
, elt
,
9367 ada_evaluate_subexp (NULL
, exp
, pos
,
9370 value_free_to_mark (mark
);
9373 /* Assuming that LHS represents an lvalue having a record or array
9374 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9375 of that aggregate's value to LHS, advancing *POS past the
9376 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9377 lvalue containing LHS (possibly LHS itself). Does not modify
9378 the inferior's memory, nor does it modify the contents of
9379 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9381 static struct value
*
9382 assign_aggregate (struct value
*container
,
9383 struct value
*lhs
, struct expression
*exp
,
9384 int *pos
, enum noside noside
)
9386 struct type
*lhs_type
;
9387 int n
= exp
->elts
[*pos
+1].longconst
;
9388 LONGEST low_index
, high_index
;
9392 if (noside
!= EVAL_NORMAL
)
9394 for (i
= 0; i
< n
; i
+= 1)
9395 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9399 container
= ada_coerce_ref (container
);
9400 if (ada_is_direct_array_type (value_type (container
)))
9401 container
= ada_coerce_to_simple_array (container
);
9402 lhs
= ada_coerce_ref (lhs
);
9403 if (!deprecated_value_modifiable (lhs
))
9404 error (_("Left operand of assignment is not a modifiable lvalue."));
9406 lhs_type
= check_typedef (value_type (lhs
));
9407 if (ada_is_direct_array_type (lhs_type
))
9409 lhs
= ada_coerce_to_simple_array (lhs
);
9410 lhs_type
= check_typedef (value_type (lhs
));
9411 low_index
= lhs_type
->bounds ()->low
.const_val ();
9412 high_index
= lhs_type
->bounds ()->high
.const_val ();
9414 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9417 high_index
= num_visible_fields (lhs_type
) - 1;
9420 error (_("Left-hand side must be array or record."));
9422 std::vector
<LONGEST
> indices (4);
9423 indices
[0] = indices
[1] = low_index
- 1;
9424 indices
[2] = indices
[3] = high_index
+ 1;
9426 for (i
= 0; i
< n
; i
+= 1)
9428 switch (exp
->elts
[*pos
].opcode
)
9431 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9432 low_index
, high_index
);
9435 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9436 low_index
, high_index
);
9440 error (_("Misplaced 'others' clause"));
9441 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9442 low_index
, high_index
);
9445 error (_("Internal error: bad aggregate clause"));
9452 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9453 construct at *POS, updating *POS past the construct, given that
9454 the positions are relative to lower bound LOW, where HIGH is the
9455 upper bound. Record the position in INDICES. CONTAINER is as for
9456 assign_aggregate. */
9458 aggregate_assign_positional (struct value
*container
,
9459 struct value
*lhs
, struct expression
*exp
,
9460 int *pos
, std::vector
<LONGEST
> &indices
,
9461 LONGEST low
, LONGEST high
)
9463 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9465 if (ind
- 1 == high
)
9466 warning (_("Extra components in aggregate ignored."));
9469 add_component_interval (ind
, ind
, indices
);
9471 assign_component (container
, lhs
, ind
, exp
, pos
);
9474 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9477 /* Assign into the components of LHS indexed by the OP_CHOICES
9478 construct at *POS, updating *POS past the construct, given that
9479 the allowable indices are LOW..HIGH. Record the indices assigned
9480 to in INDICES. CONTAINER is as for assign_aggregate. */
9482 aggregate_assign_from_choices (struct value
*container
,
9483 struct value
*lhs
, struct expression
*exp
,
9484 int *pos
, std::vector
<LONGEST
> &indices
,
9485 LONGEST low
, LONGEST high
)
9488 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9489 int choice_pos
, expr_pc
;
9490 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9492 choice_pos
= *pos
+= 3;
9494 for (j
= 0; j
< n_choices
; j
+= 1)
9495 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9497 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9499 for (j
= 0; j
< n_choices
; j
+= 1)
9501 LONGEST lower
, upper
;
9502 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9504 if (op
== OP_DISCRETE_RANGE
)
9507 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9509 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9514 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9526 name
= &exp
->elts
[choice_pos
+ 2].string
;
9529 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9532 error (_("Invalid record component association."));
9534 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9536 if (! find_struct_field (name
, value_type (lhs
), 0,
9537 NULL
, NULL
, NULL
, NULL
, &ind
))
9538 error (_("Unknown component name: %s."), name
);
9539 lower
= upper
= ind
;
9542 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9543 error (_("Index in component association out of bounds."));
9545 add_component_interval (lower
, upper
, indices
);
9546 while (lower
<= upper
)
9551 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9557 /* Assign the value of the expression in the OP_OTHERS construct in
9558 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9559 have not been previously assigned. The index intervals already assigned
9560 are in INDICES. Updates *POS to after the OP_OTHERS clause.
9561 CONTAINER is as for assign_aggregate. */
9563 aggregate_assign_others (struct value
*container
,
9564 struct value
*lhs
, struct expression
*exp
,
9565 int *pos
, std::vector
<LONGEST
> &indices
,
9566 LONGEST low
, LONGEST high
)
9569 int expr_pc
= *pos
+ 1;
9571 int num_indices
= indices
.size ();
9572 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9576 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9581 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9584 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9587 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9588 [ INDICES[0] .. INDICES[1] ],... The resulting intervals do not
9591 add_component_interval (LONGEST low
, LONGEST high
,
9592 std::vector
<LONGEST
> &indices
)
9596 int size
= indices
.size ();
9597 for (i
= 0; i
< size
; i
+= 2) {
9598 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9602 for (kh
= i
+ 2; kh
< size
; kh
+= 2)
9603 if (high
< indices
[kh
])
9605 if (low
< indices
[i
])
9607 indices
[i
+ 1] = indices
[kh
- 1];
9608 if (high
> indices
[i
+ 1])
9609 indices
[i
+ 1] = high
;
9610 memcpy (indices
.data () + i
+ 2, indices
.data () + kh
, size
- kh
);
9611 indices
.resize (kh
- i
- 2);
9614 else if (high
< indices
[i
])
9618 indices
.resize (indices
.size () + 2);
9619 for (j
= indices
.size () - 1; j
>= i
+ 2; j
-= 1)
9620 indices
[j
] = indices
[j
- 2];
9622 indices
[i
+ 1] = high
;
9625 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9628 static struct value
*
9629 ada_value_cast (struct type
*type
, struct value
*arg2
)
9631 if (type
== ada_check_typedef (value_type (arg2
)))
9634 return value_cast (type
, arg2
);
9637 /* Evaluating Ada expressions, and printing their result.
9638 ------------------------------------------------------
9643 We usually evaluate an Ada expression in order to print its value.
9644 We also evaluate an expression in order to print its type, which
9645 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9646 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9647 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9648 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9651 Evaluating expressions is a little more complicated for Ada entities
9652 than it is for entities in languages such as C. The main reason for
9653 this is that Ada provides types whose definition might be dynamic.
9654 One example of such types is variant records. Or another example
9655 would be an array whose bounds can only be known at run time.
9657 The following description is a general guide as to what should be
9658 done (and what should NOT be done) in order to evaluate an expression
9659 involving such types, and when. This does not cover how the semantic
9660 information is encoded by GNAT as this is covered separatly. For the
9661 document used as the reference for the GNAT encoding, see exp_dbug.ads
9662 in the GNAT sources.
9664 Ideally, we should embed each part of this description next to its
9665 associated code. Unfortunately, the amount of code is so vast right
9666 now that it's hard to see whether the code handling a particular
9667 situation might be duplicated or not. One day, when the code is
9668 cleaned up, this guide might become redundant with the comments
9669 inserted in the code, and we might want to remove it.
9671 2. ``Fixing'' an Entity, the Simple Case:
9672 -----------------------------------------
9674 When evaluating Ada expressions, the tricky issue is that they may
9675 reference entities whose type contents and size are not statically
9676 known. Consider for instance a variant record:
9678 type Rec (Empty : Boolean := True) is record
9681 when False => Value : Integer;
9684 Yes : Rec := (Empty => False, Value => 1);
9685 No : Rec := (empty => True);
9687 The size and contents of that record depends on the value of the
9688 descriminant (Rec.Empty). At this point, neither the debugging
9689 information nor the associated type structure in GDB are able to
9690 express such dynamic types. So what the debugger does is to create
9691 "fixed" versions of the type that applies to the specific object.
9692 We also informally refer to this operation as "fixing" an object,
9693 which means creating its associated fixed type.
9695 Example: when printing the value of variable "Yes" above, its fixed
9696 type would look like this:
9703 On the other hand, if we printed the value of "No", its fixed type
9710 Things become a little more complicated when trying to fix an entity
9711 with a dynamic type that directly contains another dynamic type,
9712 such as an array of variant records, for instance. There are
9713 two possible cases: Arrays, and records.
9715 3. ``Fixing'' Arrays:
9716 ---------------------
9718 The type structure in GDB describes an array in terms of its bounds,
9719 and the type of its elements. By design, all elements in the array
9720 have the same type and we cannot represent an array of variant elements
9721 using the current type structure in GDB. When fixing an array,
9722 we cannot fix the array element, as we would potentially need one
9723 fixed type per element of the array. As a result, the best we can do
9724 when fixing an array is to produce an array whose bounds and size
9725 are correct (allowing us to read it from memory), but without having
9726 touched its element type. Fixing each element will be done later,
9727 when (if) necessary.
9729 Arrays are a little simpler to handle than records, because the same
9730 amount of memory is allocated for each element of the array, even if
9731 the amount of space actually used by each element differs from element
9732 to element. Consider for instance the following array of type Rec:
9734 type Rec_Array is array (1 .. 2) of Rec;
9736 The actual amount of memory occupied by each element might be different
9737 from element to element, depending on the value of their discriminant.
9738 But the amount of space reserved for each element in the array remains
9739 fixed regardless. So we simply need to compute that size using
9740 the debugging information available, from which we can then determine
9741 the array size (we multiply the number of elements of the array by
9742 the size of each element).
9744 The simplest case is when we have an array of a constrained element
9745 type. For instance, consider the following type declarations:
9747 type Bounded_String (Max_Size : Integer) is
9749 Buffer : String (1 .. Max_Size);
9751 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9753 In this case, the compiler describes the array as an array of
9754 variable-size elements (identified by its XVS suffix) for which
9755 the size can be read in the parallel XVZ variable.
9757 In the case of an array of an unconstrained element type, the compiler
9758 wraps the array element inside a private PAD type. This type should not
9759 be shown to the user, and must be "unwrap"'ed before printing. Note
9760 that we also use the adjective "aligner" in our code to designate
9761 these wrapper types.
9763 In some cases, the size allocated for each element is statically
9764 known. In that case, the PAD type already has the correct size,
9765 and the array element should remain unfixed.
9767 But there are cases when this size is not statically known.
9768 For instance, assuming that "Five" is an integer variable:
9770 type Dynamic is array (1 .. Five) of Integer;
9771 type Wrapper (Has_Length : Boolean := False) is record
9774 when True => Length : Integer;
9778 type Wrapper_Array is array (1 .. 2) of Wrapper;
9780 Hello : Wrapper_Array := (others => (Has_Length => True,
9781 Data => (others => 17),
9785 The debugging info would describe variable Hello as being an
9786 array of a PAD type. The size of that PAD type is not statically
9787 known, but can be determined using a parallel XVZ variable.
9788 In that case, a copy of the PAD type with the correct size should
9789 be used for the fixed array.
9791 3. ``Fixing'' record type objects:
9792 ----------------------------------
9794 Things are slightly different from arrays in the case of dynamic
9795 record types. In this case, in order to compute the associated
9796 fixed type, we need to determine the size and offset of each of
9797 its components. This, in turn, requires us to compute the fixed
9798 type of each of these components.
9800 Consider for instance the example:
9802 type Bounded_String (Max_Size : Natural) is record
9803 Str : String (1 .. Max_Size);
9806 My_String : Bounded_String (Max_Size => 10);
9808 In that case, the position of field "Length" depends on the size
9809 of field Str, which itself depends on the value of the Max_Size
9810 discriminant. In order to fix the type of variable My_String,
9811 we need to fix the type of field Str. Therefore, fixing a variant
9812 record requires us to fix each of its components.
9814 However, if a component does not have a dynamic size, the component
9815 should not be fixed. In particular, fields that use a PAD type
9816 should not fixed. Here is an example where this might happen
9817 (assuming type Rec above):
9819 type Container (Big : Boolean) is record
9823 when True => Another : Integer;
9827 My_Container : Container := (Big => False,
9828 First => (Empty => True),
9831 In that example, the compiler creates a PAD type for component First,
9832 whose size is constant, and then positions the component After just
9833 right after it. The offset of component After is therefore constant
9836 The debugger computes the position of each field based on an algorithm
9837 that uses, among other things, the actual position and size of the field
9838 preceding it. Let's now imagine that the user is trying to print
9839 the value of My_Container. If the type fixing was recursive, we would
9840 end up computing the offset of field After based on the size of the
9841 fixed version of field First. And since in our example First has
9842 only one actual field, the size of the fixed type is actually smaller
9843 than the amount of space allocated to that field, and thus we would
9844 compute the wrong offset of field After.
9846 To make things more complicated, we need to watch out for dynamic
9847 components of variant records (identified by the ___XVL suffix in
9848 the component name). Even if the target type is a PAD type, the size
9849 of that type might not be statically known. So the PAD type needs
9850 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9851 we might end up with the wrong size for our component. This can be
9852 observed with the following type declarations:
9854 type Octal is new Integer range 0 .. 7;
9855 type Octal_Array is array (Positive range <>) of Octal;
9856 pragma Pack (Octal_Array);
9858 type Octal_Buffer (Size : Positive) is record
9859 Buffer : Octal_Array (1 .. Size);
9863 In that case, Buffer is a PAD type whose size is unset and needs
9864 to be computed by fixing the unwrapped type.
9866 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9867 ----------------------------------------------------------
9869 Lastly, when should the sub-elements of an entity that remained unfixed
9870 thus far, be actually fixed?
9872 The answer is: Only when referencing that element. For instance
9873 when selecting one component of a record, this specific component
9874 should be fixed at that point in time. Or when printing the value
9875 of a record, each component should be fixed before its value gets
9876 printed. Similarly for arrays, the element of the array should be
9877 fixed when printing each element of the array, or when extracting
9878 one element out of that array. On the other hand, fixing should
9879 not be performed on the elements when taking a slice of an array!
9881 Note that one of the side effects of miscomputing the offset and
9882 size of each field is that we end up also miscomputing the size
9883 of the containing type. This can have adverse results when computing
9884 the value of an entity. GDB fetches the value of an entity based
9885 on the size of its type, and thus a wrong size causes GDB to fetch
9886 the wrong amount of memory. In the case where the computed size is
9887 too small, GDB fetches too little data to print the value of our
9888 entity. Results in this case are unpredictable, as we usually read
9889 past the buffer containing the data =:-o. */
9891 /* Evaluate a subexpression of EXP, at index *POS, and return a value
9892 for that subexpression cast to TO_TYPE. Advance *POS over the
9896 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
9897 enum noside noside
, struct type
*to_type
)
9901 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
9902 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
9907 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
9909 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9910 return value_zero (to_type
, not_lval
);
9912 val
= evaluate_var_msym_value (noside
,
9913 exp
->elts
[pc
+ 1].objfile
,
9914 exp
->elts
[pc
+ 2].msymbol
);
9917 val
= evaluate_var_value (noside
,
9918 exp
->elts
[pc
+ 1].block
,
9919 exp
->elts
[pc
+ 2].symbol
);
9921 if (noside
== EVAL_SKIP
)
9922 return eval_skip_value (exp
);
9924 val
= ada_value_cast (to_type
, val
);
9926 /* Follow the Ada language semantics that do not allow taking
9927 an address of the result of a cast (view conversion in Ada). */
9928 if (VALUE_LVAL (val
) == lval_memory
)
9930 if (value_lazy (val
))
9931 value_fetch_lazy (val
);
9932 VALUE_LVAL (val
) = not_lval
;
9937 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
9938 if (noside
== EVAL_SKIP
)
9939 return eval_skip_value (exp
);
9940 return ada_value_cast (to_type
, val
);
9943 /* A helper function for TERNOP_IN_RANGE. */
9946 eval_ternop_in_range (struct type
*expect_type
, struct expression
*exp
,
9948 value
*arg1
, value
*arg2
, value
*arg3
)
9950 if (noside
== EVAL_SKIP
)
9951 return eval_skip_value (exp
);
9953 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9954 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9955 struct type
*type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9957 value_from_longest (type
,
9958 (value_less (arg1
, arg3
)
9959 || value_equal (arg1
, arg3
))
9960 && (value_less (arg2
, arg1
)
9961 || value_equal (arg2
, arg1
)));
9964 /* A helper function for UNOP_NEG. */
9967 ada_unop_neg (struct type
*expect_type
,
9968 struct expression
*exp
,
9969 enum noside noside
, enum exp_opcode op
,
9972 if (noside
== EVAL_SKIP
)
9973 return eval_skip_value (exp
);
9974 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9975 return value_neg (arg1
);
9978 /* A helper function for UNOP_IN_RANGE. */
9981 ada_unop_in_range (struct type
*expect_type
,
9982 struct expression
*exp
,
9983 enum noside noside
, enum exp_opcode op
,
9984 struct value
*arg1
, struct type
*type
)
9986 if (noside
== EVAL_SKIP
)
9987 return eval_skip_value (exp
);
9989 struct value
*arg2
, *arg3
;
9990 switch (type
->code ())
9993 lim_warning (_("Membership test incompletely implemented; "
9994 "always returns true"));
9995 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9996 return value_from_longest (type
, (LONGEST
) 1);
9998 case TYPE_CODE_RANGE
:
9999 arg2
= value_from_longest (type
,
10000 type
->bounds ()->low
.const_val ());
10001 arg3
= value_from_longest (type
,
10002 type
->bounds ()->high
.const_val ());
10003 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10004 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10005 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10007 value_from_longest (type
,
10008 (value_less (arg1
, arg3
)
10009 || value_equal (arg1
, arg3
))
10010 && (value_less (arg2
, arg1
)
10011 || value_equal (arg2
, arg1
)));
10015 /* A helper function for OP_ATR_TAG. */
10018 ada_atr_tag (struct type
*expect_type
,
10019 struct expression
*exp
,
10020 enum noside noside
, enum exp_opcode op
,
10021 struct value
*arg1
)
10023 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10024 return value_zero (ada_tag_type (arg1
), not_lval
);
10026 return ada_value_tag (arg1
);
10029 /* A helper function for OP_ATR_SIZE. */
10032 ada_atr_size (struct type
*expect_type
,
10033 struct expression
*exp
,
10034 enum noside noside
, enum exp_opcode op
,
10035 struct value
*arg1
)
10037 struct type
*type
= value_type (arg1
);
10039 /* If the argument is a reference, then dereference its type, since
10040 the user is really asking for the size of the actual object,
10041 not the size of the pointer. */
10042 if (type
->code () == TYPE_CODE_REF
)
10043 type
= TYPE_TARGET_TYPE (type
);
10045 if (noside
== EVAL_SKIP
)
10046 return eval_skip_value (exp
);
10047 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10048 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10050 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10051 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10054 /* A helper function for UNOP_ABS. */
10057 ada_abs (struct type
*expect_type
,
10058 struct expression
*exp
,
10059 enum noside noside
, enum exp_opcode op
,
10060 struct value
*arg1
)
10062 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10063 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10064 return value_neg (arg1
);
10069 /* A helper function for BINOP_MUL. */
10072 ada_mult_binop (struct type
*expect_type
,
10073 struct expression
*exp
,
10074 enum noside noside
, enum exp_opcode op
,
10075 struct value
*arg1
, struct value
*arg2
)
10077 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10079 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10080 return value_zero (value_type (arg1
), not_lval
);
10084 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10085 return ada_value_binop (arg1
, arg2
, op
);
10089 /* A helper function for BINOP_EQUAL and BINOP_NOTEQUAL. */
10092 ada_equal_binop (struct type
*expect_type
,
10093 struct expression
*exp
,
10094 enum noside noside
, enum exp_opcode op
,
10095 struct value
*arg1
, struct value
*arg2
)
10098 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10102 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10103 tem
= ada_value_equal (arg1
, arg2
);
10105 if (op
== BINOP_NOTEQUAL
)
10107 struct type
*type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10108 return value_from_longest (type
, (LONGEST
) tem
);
10111 /* A helper function for TERNOP_SLICE. */
10114 ada_ternop_slice (struct expression
*exp
,
10115 enum noside noside
,
10116 struct value
*array
, struct value
*low_bound_val
,
10117 struct value
*high_bound_val
)
10120 LONGEST high_bound
;
10122 low_bound_val
= coerce_ref (low_bound_val
);
10123 high_bound_val
= coerce_ref (high_bound_val
);
10124 low_bound
= value_as_long (low_bound_val
);
10125 high_bound
= value_as_long (high_bound_val
);
10127 /* If this is a reference to an aligner type, then remove all
10129 if (value_type (array
)->code () == TYPE_CODE_REF
10130 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10131 TYPE_TARGET_TYPE (value_type (array
)) =
10132 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10134 if (ada_is_any_packed_array_type (value_type (array
)))
10135 error (_("cannot slice a packed array"));
10137 /* If this is a reference to an array or an array lvalue,
10138 convert to a pointer. */
10139 if (value_type (array
)->code () == TYPE_CODE_REF
10140 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10141 && VALUE_LVAL (array
) == lval_memory
))
10142 array
= value_addr (array
);
10144 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10145 && ada_is_array_descriptor_type (ada_check_typedef
10146 (value_type (array
))))
10147 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10150 array
= ada_coerce_to_simple_array_ptr (array
);
10152 /* If we have more than one level of pointer indirection,
10153 dereference the value until we get only one level. */
10154 while (value_type (array
)->code () == TYPE_CODE_PTR
10155 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10157 array
= value_ind (array
);
10159 /* Make sure we really do have an array type before going further,
10160 to avoid a SEGV when trying to get the index type or the target
10161 type later down the road if the debug info generated by
10162 the compiler is incorrect or incomplete. */
10163 if (!ada_is_simple_array_type (value_type (array
)))
10164 error (_("cannot take slice of non-array"));
10166 if (ada_check_typedef (value_type (array
))->code ()
10169 struct type
*type0
= ada_check_typedef (value_type (array
));
10171 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10172 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10175 struct type
*arr_type0
=
10176 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10178 return ada_value_slice_from_ptr (array
, arr_type0
,
10179 longest_to_int (low_bound
),
10180 longest_to_int (high_bound
));
10183 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10185 else if (high_bound
< low_bound
)
10186 return empty_array (value_type (array
), low_bound
, high_bound
);
10188 return ada_value_slice (array
, longest_to_int (low_bound
),
10189 longest_to_int (high_bound
));
10192 /* A helper function for BINOP_IN_BOUNDS. */
10195 ada_binop_in_bounds (struct expression
*exp
, enum noside noside
,
10196 struct value
*arg1
, struct value
*arg2
, int n
)
10198 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10200 struct type
*type
= language_bool_type (exp
->language_defn
,
10202 return value_zero (type
, not_lval
);
10205 struct type
*type
= ada_index_type (value_type (arg2
), n
, "range");
10207 type
= value_type (arg1
);
10209 value
*arg3
= value_from_longest (type
, ada_array_bound (arg2
, n
, 1));
10210 arg2
= value_from_longest (type
, ada_array_bound (arg2
, n
, 0));
10212 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10213 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10214 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10215 return value_from_longest (type
,
10216 (value_less (arg1
, arg3
)
10217 || value_equal (arg1
, arg3
))
10218 && (value_less (arg2
, arg1
)
10219 || value_equal (arg2
, arg1
)));
10222 /* A helper function for some attribute operations. */
10225 ada_unop_atr (struct expression
*exp
, enum noside noside
, enum exp_opcode op
,
10226 struct value
*arg1
, struct type
*type_arg
, int tem
)
10228 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10230 if (type_arg
== NULL
)
10231 type_arg
= value_type (arg1
);
10233 if (ada_is_constrained_packed_array_type (type_arg
))
10234 type_arg
= decode_constrained_packed_array_type (type_arg
);
10236 if (!discrete_type_p (type_arg
))
10240 default: /* Should never happen. */
10241 error (_("unexpected attribute encountered"));
10244 type_arg
= ada_index_type (type_arg
, tem
,
10245 ada_attribute_name (op
));
10247 case OP_ATR_LENGTH
:
10248 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
10253 return value_zero (type_arg
, not_lval
);
10255 else if (type_arg
== NULL
)
10257 arg1
= ada_coerce_ref (arg1
);
10259 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10260 arg1
= ada_coerce_to_simple_array (arg1
);
10263 if (op
== OP_ATR_LENGTH
)
10264 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10267 type
= ada_index_type (value_type (arg1
), tem
,
10268 ada_attribute_name (op
));
10270 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10275 default: /* Should never happen. */
10276 error (_("unexpected attribute encountered"));
10278 return value_from_longest
10279 (type
, ada_array_bound (arg1
, tem
, 0));
10281 return value_from_longest
10282 (type
, ada_array_bound (arg1
, tem
, 1));
10283 case OP_ATR_LENGTH
:
10284 return value_from_longest
10285 (type
, ada_array_length (arg1
, tem
));
10288 else if (discrete_type_p (type_arg
))
10290 struct type
*range_type
;
10291 const char *name
= ada_type_name (type_arg
);
10294 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
10295 range_type
= to_fixed_range_type (type_arg
, NULL
);
10296 if (range_type
== NULL
)
10297 range_type
= type_arg
;
10301 error (_("unexpected attribute encountered"));
10303 return value_from_longest
10304 (range_type
, ada_discrete_type_low_bound (range_type
));
10306 return value_from_longest
10307 (range_type
, ada_discrete_type_high_bound (range_type
));
10308 case OP_ATR_LENGTH
:
10309 error (_("the 'length attribute applies only to array types"));
10312 else if (type_arg
->code () == TYPE_CODE_FLT
)
10313 error (_("unimplemented type attribute"));
10318 if (ada_is_constrained_packed_array_type (type_arg
))
10319 type_arg
= decode_constrained_packed_array_type (type_arg
);
10322 if (op
== OP_ATR_LENGTH
)
10323 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10326 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10328 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10334 error (_("unexpected attribute encountered"));
10336 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10337 return value_from_longest (type
, low
);
10339 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10340 return value_from_longest (type
, high
);
10341 case OP_ATR_LENGTH
:
10342 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10343 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10344 return value_from_longest (type
, high
- low
+ 1);
10349 /* A helper function for OP_ATR_MIN and OP_ATR_MAX. */
10351 static struct value
*
10352 ada_binop_minmax (struct type
*expect_type
,
10353 struct expression
*exp
,
10354 enum noside noside
, enum exp_opcode op
,
10355 struct value
*arg1
, struct value
*arg2
)
10357 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10358 return value_zero (value_type (arg1
), not_lval
);
10361 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10362 return value_binop (arg1
, arg2
,
10363 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10367 /* A helper function for BINOP_EXP. */
10369 static struct value
*
10370 ada_binop_exp (struct type
*expect_type
,
10371 struct expression
*exp
,
10372 enum noside noside
, enum exp_opcode op
,
10373 struct value
*arg1
, struct value
*arg2
)
10375 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10376 return value_zero (value_type (arg1
), not_lval
);
10379 /* For integer exponentiation operations,
10380 only promote the first argument. */
10381 if (is_integral_type (value_type (arg2
)))
10382 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10384 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10386 return value_binop (arg1
, arg2
, op
);
10390 /* Implement the evaluate_exp routine in the exp_descriptor structure
10391 for the Ada language. */
10393 static struct value
*
10394 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10395 int *pos
, enum noside noside
)
10397 enum exp_opcode op
;
10401 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10404 struct value
**argvec
;
10408 op
= exp
->elts
[pc
].opcode
;
10414 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10416 if (noside
== EVAL_NORMAL
)
10417 arg1
= unwrap_value (arg1
);
10419 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10420 then we need to perform the conversion manually, because
10421 evaluate_subexp_standard doesn't do it. This conversion is
10422 necessary in Ada because the different kinds of float/fixed
10423 types in Ada have different representations.
10425 Similarly, we need to perform the conversion from OP_LONG
10427 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10428 arg1
= ada_value_cast (expect_type
, arg1
);
10434 struct value
*result
;
10437 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10438 /* The result type will have code OP_STRING, bashed there from
10439 OP_ARRAY. Bash it back. */
10440 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10441 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10447 type
= exp
->elts
[pc
+ 1].type
;
10448 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10452 type
= exp
->elts
[pc
+ 1].type
;
10453 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10456 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10457 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10459 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10460 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10462 return ada_value_assign (arg1
, arg1
);
10464 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10465 except if the lhs of our assignment is a convenience variable.
10466 In the case of assigning to a convenience variable, the lhs
10467 should be exactly the result of the evaluation of the rhs. */
10468 type
= value_type (arg1
);
10469 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10471 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10472 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10474 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10479 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10480 return ada_value_assign (arg1
, arg2
);
10483 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10484 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10485 if (noside
== EVAL_SKIP
)
10487 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10488 return (value_from_longest
10489 (value_type (arg1
),
10490 value_as_long (arg1
) + value_as_long (arg2
)));
10491 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10492 return (value_from_longest
10493 (value_type (arg2
),
10494 value_as_long (arg1
) + value_as_long (arg2
)));
10495 /* Preserve the original type for use by the range case below.
10496 We cannot cast the result to a reference type, so if ARG1 is
10497 a reference type, find its underlying type. */
10498 type
= value_type (arg1
);
10499 while (type
->code () == TYPE_CODE_REF
)
10500 type
= TYPE_TARGET_TYPE (type
);
10501 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10502 arg1
= value_binop (arg1
, arg2
, BINOP_ADD
);
10503 /* We need to special-case the result of adding to a range.
10504 This is done for the benefit of "ptype". gdb's Ada support
10505 historically used the LHS to set the result type here, so
10506 preserve this behavior. */
10507 if (type
->code () == TYPE_CODE_RANGE
)
10508 arg1
= value_cast (type
, arg1
);
10512 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10513 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10514 if (noside
== EVAL_SKIP
)
10516 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10517 return (value_from_longest
10518 (value_type (arg1
),
10519 value_as_long (arg1
) - value_as_long (arg2
)));
10520 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10521 return (value_from_longest
10522 (value_type (arg2
),
10523 value_as_long (arg1
) - value_as_long (arg2
)));
10524 /* Preserve the original type for use by the range case below.
10525 We cannot cast the result to a reference type, so if ARG1 is
10526 a reference type, find its underlying type. */
10527 type
= value_type (arg1
);
10528 while (type
->code () == TYPE_CODE_REF
)
10529 type
= TYPE_TARGET_TYPE (type
);
10530 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10531 arg1
= value_binop (arg1
, arg2
, BINOP_SUB
);
10532 /* We need to special-case the result of adding to a range.
10533 This is done for the benefit of "ptype". gdb's Ada support
10534 historically used the LHS to set the result type here, so
10535 preserve this behavior. */
10536 if (type
->code () == TYPE_CODE_RANGE
)
10537 arg1
= value_cast (type
, arg1
);
10544 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10545 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10546 if (noside
== EVAL_SKIP
)
10548 return ada_mult_binop (expect_type
, exp
, noside
, op
,
10552 case BINOP_NOTEQUAL
:
10553 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10554 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10555 if (noside
== EVAL_SKIP
)
10557 return ada_equal_binop (expect_type
, exp
, noside
, op
, arg1
, arg2
);
10560 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10561 return ada_unop_neg (expect_type
, exp
, noside
, op
, arg1
);
10563 case BINOP_LOGICAL_AND
:
10564 case BINOP_LOGICAL_OR
:
10565 case UNOP_LOGICAL_NOT
:
10570 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10571 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10572 return value_cast (type
, val
);
10575 case BINOP_BITWISE_AND
:
10576 case BINOP_BITWISE_IOR
:
10577 case BINOP_BITWISE_XOR
:
10581 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10583 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10585 return value_cast (value_type (arg1
), val
);
10591 if (noside
== EVAL_SKIP
)
10597 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10598 /* Only encountered when an unresolved symbol occurs in a
10599 context other than a function call, in which case, it is
10601 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10602 exp
->elts
[pc
+ 2].symbol
->print_name ());
10604 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10606 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10607 /* Check to see if this is a tagged type. We also need to handle
10608 the case where the type is a reference to a tagged type, but
10609 we have to be careful to exclude pointers to tagged types.
10610 The latter should be shown as usual (as a pointer), whereas
10611 a reference should mostly be transparent to the user. */
10612 if (ada_is_tagged_type (type
, 0)
10613 || (type
->code () == TYPE_CODE_REF
10614 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10616 /* Tagged types are a little special in the fact that the real
10617 type is dynamic and can only be determined by inspecting the
10618 object's tag. This means that we need to get the object's
10619 value first (EVAL_NORMAL) and then extract the actual object
10622 Note that we cannot skip the final step where we extract
10623 the object type from its tag, because the EVAL_NORMAL phase
10624 results in dynamic components being resolved into fixed ones.
10625 This can cause problems when trying to print the type
10626 description of tagged types whose parent has a dynamic size:
10627 We use the type name of the "_parent" component in order
10628 to print the name of the ancestor type in the type description.
10629 If that component had a dynamic size, the resolution into
10630 a fixed type would result in the loss of that type name,
10631 thus preventing us from printing the name of the ancestor
10632 type in the type description. */
10633 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_NORMAL
);
10635 if (type
->code () != TYPE_CODE_REF
)
10637 struct type
*actual_type
;
10639 actual_type
= type_from_tag (ada_value_tag (arg1
));
10640 if (actual_type
== NULL
)
10641 /* If, for some reason, we were unable to determine
10642 the actual type from the tag, then use the static
10643 approximation that we just computed as a fallback.
10644 This can happen if the debugging information is
10645 incomplete, for instance. */
10646 actual_type
= type
;
10647 return value_zero (actual_type
, not_lval
);
10651 /* In the case of a ref, ada_coerce_ref takes care
10652 of determining the actual type. But the evaluation
10653 should return a ref as it should be valid to ask
10654 for its address; so rebuild a ref after coerce. */
10655 arg1
= ada_coerce_ref (arg1
);
10656 return value_ref (arg1
, TYPE_CODE_REF
);
10660 /* Records and unions for which GNAT encodings have been
10661 generated need to be statically fixed as well.
10662 Otherwise, non-static fixing produces a type where
10663 all dynamic properties are removed, which prevents "ptype"
10664 from being able to completely describe the type.
10665 For instance, a case statement in a variant record would be
10666 replaced by the relevant components based on the actual
10667 value of the discriminants. */
10668 if ((type
->code () == TYPE_CODE_STRUCT
10669 && dynamic_template_type (type
) != NULL
)
10670 || (type
->code () == TYPE_CODE_UNION
10671 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10674 return value_zero (to_static_fixed_type (type
), not_lval
);
10678 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10679 return ada_to_fixed_value (arg1
);
10684 /* Allocate arg vector, including space for the function to be
10685 called in argvec[0] and a terminating NULL. */
10686 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10687 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10689 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10690 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10691 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10692 exp
->elts
[pc
+ 5].symbol
->print_name ());
10695 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10696 argvec
[tem
] = evaluate_subexp (nullptr, exp
, pos
, noside
);
10699 if (noside
== EVAL_SKIP
)
10703 if (ada_is_constrained_packed_array_type
10704 (desc_base_type (value_type (argvec
[0]))))
10705 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10706 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10707 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10708 /* This is a packed array that has already been fixed, and
10709 therefore already coerced to a simple array. Nothing further
10712 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10714 /* Make sure we dereference references so that all the code below
10715 feels like it's really handling the referenced value. Wrapping
10716 types (for alignment) may be there, so make sure we strip them as
10718 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10720 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10721 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10722 argvec
[0] = value_addr (argvec
[0]);
10724 type
= ada_check_typedef (value_type (argvec
[0]));
10726 /* Ada allows us to implicitly dereference arrays when subscripting
10727 them. So, if this is an array typedef (encoding use for array
10728 access types encoded as fat pointers), strip it now. */
10729 if (type
->code () == TYPE_CODE_TYPEDEF
)
10730 type
= ada_typedef_target_type (type
);
10732 if (type
->code () == TYPE_CODE_PTR
)
10734 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10736 case TYPE_CODE_FUNC
:
10737 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10739 case TYPE_CODE_ARRAY
:
10741 case TYPE_CODE_STRUCT
:
10742 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10743 argvec
[0] = ada_value_ind (argvec
[0]);
10744 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10747 error (_("cannot subscript or call something of type `%s'"),
10748 ada_type_name (value_type (argvec
[0])));
10753 switch (type
->code ())
10755 case TYPE_CODE_FUNC
:
10756 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10758 if (TYPE_TARGET_TYPE (type
) == NULL
)
10759 error_call_unknown_return_type (NULL
);
10760 return allocate_value (TYPE_TARGET_TYPE (type
));
10762 return call_function_by_hand (argvec
[0], NULL
,
10763 gdb::make_array_view (argvec
+ 1,
10765 case TYPE_CODE_INTERNAL_FUNCTION
:
10766 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10767 /* We don't know anything about what the internal
10768 function might return, but we have to return
10770 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10773 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10774 argvec
[0], nargs
, argvec
+ 1);
10776 case TYPE_CODE_STRUCT
:
10780 arity
= ada_array_arity (type
);
10781 type
= ada_array_element_type (type
, nargs
);
10783 error (_("cannot subscript or call a record"));
10784 if (arity
!= nargs
)
10785 error (_("wrong number of subscripts; expecting %d"), arity
);
10786 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10787 return value_zero (ada_aligned_type (type
), lval_memory
);
10789 unwrap_value (ada_value_subscript
10790 (argvec
[0], nargs
, argvec
+ 1));
10792 case TYPE_CODE_ARRAY
:
10793 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10795 type
= ada_array_element_type (type
, nargs
);
10797 error (_("element type of array unknown"));
10799 return value_zero (ada_aligned_type (type
), lval_memory
);
10802 unwrap_value (ada_value_subscript
10803 (ada_coerce_to_simple_array (argvec
[0]),
10804 nargs
, argvec
+ 1));
10805 case TYPE_CODE_PTR
: /* Pointer to array */
10806 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10808 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10809 type
= ada_array_element_type (type
, nargs
);
10811 error (_("element type of array unknown"));
10813 return value_zero (ada_aligned_type (type
), lval_memory
);
10816 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10817 nargs
, argvec
+ 1));
10820 error (_("Attempt to index or call something other than an "
10821 "array or function"));
10826 struct value
*array
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10827 struct value
*low_bound_val
10828 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10829 struct value
*high_bound_val
10830 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10832 if (noside
== EVAL_SKIP
)
10835 return ada_ternop_slice (exp
, noside
, array
, low_bound_val
,
10839 case UNOP_IN_RANGE
:
10841 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10842 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10843 return ada_unop_in_range (expect_type
, exp
, noside
, op
, arg1
, type
);
10845 case BINOP_IN_BOUNDS
:
10847 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10848 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10850 if (noside
== EVAL_SKIP
)
10853 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10855 return ada_binop_in_bounds (exp
, noside
, arg1
, arg2
, tem
);
10857 case TERNOP_IN_RANGE
:
10858 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10859 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10860 arg3
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10862 return eval_ternop_in_range (expect_type
, exp
, noside
, arg1
, arg2
, arg3
);
10866 case OP_ATR_LENGTH
:
10868 struct type
*type_arg
;
10870 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10872 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10874 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10878 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10882 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10883 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10884 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10887 if (noside
== EVAL_SKIP
)
10890 return ada_unop_atr (exp
, noside
, op
, arg1
, type_arg
, tem
);
10894 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10895 if (noside
== EVAL_SKIP
)
10897 return ada_atr_tag (expect_type
, exp
, noside
, op
, arg1
);
10901 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10902 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10903 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10904 if (noside
== EVAL_SKIP
)
10906 return ada_binop_minmax (expect_type
, exp
, noside
, op
, arg1
, arg2
);
10908 case OP_ATR_MODULUS
:
10910 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10912 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10913 if (noside
== EVAL_SKIP
)
10916 if (!ada_is_modular_type (type_arg
))
10917 error (_("'modulus must be applied to modular type"));
10919 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10920 ada_modulus (type_arg
));
10925 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10926 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10927 if (noside
== EVAL_SKIP
)
10929 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10930 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10931 return value_zero (type
, not_lval
);
10933 return value_pos_atr (type
, arg1
);
10936 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10937 return ada_atr_size (expect_type
, exp
, noside
, op
, arg1
);
10940 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10941 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10942 type
= exp
->elts
[pc
+ 2].type
;
10943 if (noside
== EVAL_SKIP
)
10945 return ada_val_atr (noside
, type
, arg1
);
10948 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10949 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10950 if (noside
== EVAL_SKIP
)
10952 return ada_binop_exp (expect_type
, exp
, noside
, op
, arg1
, arg2
);
10955 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10956 if (noside
== EVAL_SKIP
)
10962 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10963 if (noside
== EVAL_SKIP
)
10965 return ada_abs (expect_type
, exp
, noside
, op
, arg1
);
10968 preeval_pos
= *pos
;
10969 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10970 if (noside
== EVAL_SKIP
)
10972 type
= ada_check_typedef (value_type (arg1
));
10973 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10975 if (ada_is_array_descriptor_type (type
))
10976 /* GDB allows dereferencing GNAT array descriptors. */
10978 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10980 if (arrType
== NULL
)
10981 error (_("Attempt to dereference null array pointer."));
10982 return value_at_lazy (arrType
, 0);
10984 else if (type
->code () == TYPE_CODE_PTR
10985 || type
->code () == TYPE_CODE_REF
10986 /* In C you can dereference an array to get the 1st elt. */
10987 || type
->code () == TYPE_CODE_ARRAY
)
10989 /* As mentioned in the OP_VAR_VALUE case, tagged types can
10990 only be determined by inspecting the object's tag.
10991 This means that we need to evaluate completely the
10992 expression in order to get its type. */
10994 if ((type
->code () == TYPE_CODE_REF
10995 || type
->code () == TYPE_CODE_PTR
)
10996 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
10999 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11000 type
= value_type (ada_value_ind (arg1
));
11004 type
= to_static_fixed_type
11006 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11008 ada_ensure_varsize_limit (type
);
11009 return value_zero (type
, lval_memory
);
11011 else if (type
->code () == TYPE_CODE_INT
)
11013 /* GDB allows dereferencing an int. */
11014 if (expect_type
== NULL
)
11015 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11020 to_static_fixed_type (ada_aligned_type (expect_type
));
11021 return value_zero (expect_type
, lval_memory
);
11025 error (_("Attempt to take contents of a non-pointer value."));
11027 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11028 type
= ada_check_typedef (value_type (arg1
));
11030 if (type
->code () == TYPE_CODE_INT
)
11031 /* GDB allows dereferencing an int. If we were given
11032 the expect_type, then use that as the target type.
11033 Otherwise, assume that the target type is an int. */
11035 if (expect_type
!= NULL
)
11036 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11039 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11040 (CORE_ADDR
) value_as_address (arg1
));
11043 if (ada_is_array_descriptor_type (type
))
11044 /* GDB allows dereferencing GNAT array descriptors. */
11045 return ada_coerce_to_simple_array (arg1
);
11047 return ada_value_ind (arg1
);
11049 case STRUCTOP_STRUCT
:
11050 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11051 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11052 preeval_pos
= *pos
;
11053 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11054 if (noside
== EVAL_SKIP
)
11056 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11058 struct type
*type1
= value_type (arg1
);
11060 if (ada_is_tagged_type (type1
, 1))
11062 type
= ada_lookup_struct_elt_type (type1
,
11063 &exp
->elts
[pc
+ 2].string
,
11066 /* If the field is not found, check if it exists in the
11067 extension of this object's type. This means that we
11068 need to evaluate completely the expression. */
11073 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11074 arg1
= ada_value_struct_elt (arg1
,
11075 &exp
->elts
[pc
+ 2].string
,
11077 arg1
= unwrap_value (arg1
);
11078 type
= value_type (ada_to_fixed_value (arg1
));
11083 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11086 return value_zero (ada_aligned_type (type
), lval_memory
);
11090 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11091 arg1
= unwrap_value (arg1
);
11092 return ada_to_fixed_value (arg1
);
11096 /* The value is not supposed to be used. This is here to make it
11097 easier to accommodate expressions that contain types. */
11099 if (noside
== EVAL_SKIP
)
11101 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11102 return allocate_value (exp
->elts
[pc
+ 1].type
);
11104 error (_("Attempt to use a type name as an expression"));
11109 case OP_DISCRETE_RANGE
:
11110 case OP_POSITIONAL
:
11112 if (noside
== EVAL_NORMAL
)
11116 error (_("Undefined name, ambiguous name, or renaming used in "
11117 "component association: %s."), &exp
->elts
[pc
+2].string
);
11119 error (_("Aggregates only allowed on the right of an assignment"));
11121 internal_error (__FILE__
, __LINE__
,
11122 _("aggregate apparently mangled"));
11125 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11127 for (tem
= 0; tem
< nargs
; tem
+= 1)
11128 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11133 return eval_skip_value (exp
);
11137 /* Return non-zero iff TYPE represents a System.Address type. */
11140 ada_is_system_address_type (struct type
*type
)
11142 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11149 /* Scan STR beginning at position K for a discriminant name, and
11150 return the value of that discriminant field of DVAL in *PX. If
11151 PNEW_K is not null, put the position of the character beyond the
11152 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11153 not alter *PX and *PNEW_K if unsuccessful. */
11156 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11159 static std::string storage
;
11160 const char *pstart
, *pend
, *bound
;
11161 struct value
*bound_val
;
11163 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11167 pend
= strstr (pstart
, "__");
11171 k
+= strlen (bound
);
11175 int len
= pend
- pstart
;
11177 /* Strip __ and beyond. */
11178 storage
= std::string (pstart
, len
);
11179 bound
= storage
.c_str ();
11183 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11184 if (bound_val
== NULL
)
11187 *px
= value_as_long (bound_val
);
11188 if (pnew_k
!= NULL
)
11193 /* Value of variable named NAME. Only exact matches are considered.
11194 If no such variable found, then if ERR_MSG is null, returns 0, and
11195 otherwise causes an error with message ERR_MSG. */
11197 static struct value
*
11198 get_var_value (const char *name
, const char *err_msg
)
11200 std::string quoted_name
= add_angle_brackets (name
);
11202 lookup_name_info
lookup_name (quoted_name
, symbol_name_match_type::FULL
);
11204 std::vector
<struct block_symbol
> syms
11205 = ada_lookup_symbol_list_worker (lookup_name
,
11206 get_selected_block (0),
11209 if (syms
.size () != 1)
11211 if (err_msg
== NULL
)
11214 error (("%s"), err_msg
);
11217 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11220 /* Value of integer variable named NAME in the current environment.
11221 If no such variable is found, returns false. Otherwise, sets VALUE
11222 to the variable's value and returns true. */
11225 get_int_var_value (const char *name
, LONGEST
&value
)
11227 struct value
*var_val
= get_var_value (name
, 0);
11232 value
= value_as_long (var_val
);
11237 /* Return a range type whose base type is that of the range type named
11238 NAME in the current environment, and whose bounds are calculated
11239 from NAME according to the GNAT range encoding conventions.
11240 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11241 corresponding range type from debug information; fall back to using it
11242 if symbol lookup fails. If a new type must be created, allocate it
11243 like ORIG_TYPE was. The bounds information, in general, is encoded
11244 in NAME, the base type given in the named range type. */
11246 static struct type
*
11247 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11250 struct type
*base_type
;
11251 const char *subtype_info
;
11253 gdb_assert (raw_type
!= NULL
);
11254 gdb_assert (raw_type
->name () != NULL
);
11256 if (raw_type
->code () == TYPE_CODE_RANGE
)
11257 base_type
= TYPE_TARGET_TYPE (raw_type
);
11259 base_type
= raw_type
;
11261 name
= raw_type
->name ();
11262 subtype_info
= strstr (name
, "___XD");
11263 if (subtype_info
== NULL
)
11265 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11266 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11268 if (L
< INT_MIN
|| U
> INT_MAX
)
11271 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11276 int prefix_len
= subtype_info
- name
;
11279 const char *bounds_str
;
11283 bounds_str
= strchr (subtype_info
, '_');
11286 if (*subtype_info
== 'L')
11288 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11289 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11291 if (bounds_str
[n
] == '_')
11293 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11299 std::string name_buf
= std::string (name
, prefix_len
) + "___L";
11300 if (!get_int_var_value (name_buf
.c_str (), L
))
11302 lim_warning (_("Unknown lower bound, using 1."));
11307 if (*subtype_info
== 'U')
11309 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11310 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11315 std::string name_buf
= std::string (name
, prefix_len
) + "___U";
11316 if (!get_int_var_value (name_buf
.c_str (), U
))
11318 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11323 type
= create_static_range_type (alloc_type_copy (raw_type
),
11325 /* create_static_range_type alters the resulting type's length
11326 to match the size of the base_type, which is not what we want.
11327 Set it back to the original range type's length. */
11328 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11329 type
->set_name (name
);
11334 /* True iff NAME is the name of a range type. */
11337 ada_is_range_type_name (const char *name
)
11339 return (name
!= NULL
&& strstr (name
, "___XD"));
11343 /* Modular types */
11345 /* True iff TYPE is an Ada modular type. */
11348 ada_is_modular_type (struct type
*type
)
11350 struct type
*subranged_type
= get_base_type (type
);
11352 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11353 && subranged_type
->code () == TYPE_CODE_INT
11354 && subranged_type
->is_unsigned ());
11357 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11360 ada_modulus (struct type
*type
)
11362 const dynamic_prop
&high
= type
->bounds ()->high
;
11364 if (high
.kind () == PROP_CONST
)
11365 return (ULONGEST
) high
.const_val () + 1;
11367 /* If TYPE is unresolved, the high bound might be a location list. Return
11368 0, for lack of a better value to return. */
11373 /* Ada exception catchpoint support:
11374 ---------------------------------
11376 We support 3 kinds of exception catchpoints:
11377 . catchpoints on Ada exceptions
11378 . catchpoints on unhandled Ada exceptions
11379 . catchpoints on failed assertions
11381 Exceptions raised during failed assertions, or unhandled exceptions
11382 could perfectly be caught with the general catchpoint on Ada exceptions.
11383 However, we can easily differentiate these two special cases, and having
11384 the option to distinguish these two cases from the rest can be useful
11385 to zero-in on certain situations.
11387 Exception catchpoints are a specialized form of breakpoint,
11388 since they rely on inserting breakpoints inside known routines
11389 of the GNAT runtime. The implementation therefore uses a standard
11390 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11393 Support in the runtime for exception catchpoints have been changed
11394 a few times already, and these changes affect the implementation
11395 of these catchpoints. In order to be able to support several
11396 variants of the runtime, we use a sniffer that will determine
11397 the runtime variant used by the program being debugged. */
11399 /* Ada's standard exceptions.
11401 The Ada 83 standard also defined Numeric_Error. But there so many
11402 situations where it was unclear from the Ada 83 Reference Manual
11403 (RM) whether Constraint_Error or Numeric_Error should be raised,
11404 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11405 Interpretation saying that anytime the RM says that Numeric_Error
11406 should be raised, the implementation may raise Constraint_Error.
11407 Ada 95 went one step further and pretty much removed Numeric_Error
11408 from the list of standard exceptions (it made it a renaming of
11409 Constraint_Error, to help preserve compatibility when compiling
11410 an Ada83 compiler). As such, we do not include Numeric_Error from
11411 this list of standard exceptions. */
11413 static const char * const standard_exc
[] = {
11414 "constraint_error",
11420 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11422 /* A structure that describes how to support exception catchpoints
11423 for a given executable. */
11425 struct exception_support_info
11427 /* The name of the symbol to break on in order to insert
11428 a catchpoint on exceptions. */
11429 const char *catch_exception_sym
;
11431 /* The name of the symbol to break on in order to insert
11432 a catchpoint on unhandled exceptions. */
11433 const char *catch_exception_unhandled_sym
;
11435 /* The name of the symbol to break on in order to insert
11436 a catchpoint on failed assertions. */
11437 const char *catch_assert_sym
;
11439 /* The name of the symbol to break on in order to insert
11440 a catchpoint on exception handling. */
11441 const char *catch_handlers_sym
;
11443 /* Assuming that the inferior just triggered an unhandled exception
11444 catchpoint, this function is responsible for returning the address
11445 in inferior memory where the name of that exception is stored.
11446 Return zero if the address could not be computed. */
11447 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11450 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11451 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11453 /* The following exception support info structure describes how to
11454 implement exception catchpoints with the latest version of the
11455 Ada runtime (as of 2019-08-??). */
11457 static const struct exception_support_info default_exception_support_info
=
11459 "__gnat_debug_raise_exception", /* catch_exception_sym */
11460 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11461 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11462 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11463 ada_unhandled_exception_name_addr
11466 /* The following exception support info structure describes how to
11467 implement exception catchpoints with an earlier version of the
11468 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11470 static const struct exception_support_info exception_support_info_v0
=
11472 "__gnat_debug_raise_exception", /* catch_exception_sym */
11473 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11474 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11475 "__gnat_begin_handler", /* catch_handlers_sym */
11476 ada_unhandled_exception_name_addr
11479 /* The following exception support info structure describes how to
11480 implement exception catchpoints with a slightly older version
11481 of the Ada runtime. */
11483 static const struct exception_support_info exception_support_info_fallback
=
11485 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11486 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11487 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11488 "__gnat_begin_handler", /* catch_handlers_sym */
11489 ada_unhandled_exception_name_addr_from_raise
11492 /* Return nonzero if we can detect the exception support routines
11493 described in EINFO.
11495 This function errors out if an abnormal situation is detected
11496 (for instance, if we find the exception support routines, but
11497 that support is found to be incomplete). */
11500 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11502 struct symbol
*sym
;
11504 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11505 that should be compiled with debugging information. As a result, we
11506 expect to find that symbol in the symtabs. */
11508 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11511 /* Perhaps we did not find our symbol because the Ada runtime was
11512 compiled without debugging info, or simply stripped of it.
11513 It happens on some GNU/Linux distributions for instance, where
11514 users have to install a separate debug package in order to get
11515 the runtime's debugging info. In that situation, let the user
11516 know why we cannot insert an Ada exception catchpoint.
11518 Note: Just for the purpose of inserting our Ada exception
11519 catchpoint, we could rely purely on the associated minimal symbol.
11520 But we would be operating in degraded mode anyway, since we are
11521 still lacking the debugging info needed later on to extract
11522 the name of the exception being raised (this name is printed in
11523 the catchpoint message, and is also used when trying to catch
11524 a specific exception). We do not handle this case for now. */
11525 struct bound_minimal_symbol msym
11526 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11528 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11529 error (_("Your Ada runtime appears to be missing some debugging "
11530 "information.\nCannot insert Ada exception catchpoint "
11531 "in this configuration."));
11536 /* Make sure that the symbol we found corresponds to a function. */
11538 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11540 error (_("Symbol \"%s\" is not a function (class = %d)"),
11541 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11545 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11548 struct bound_minimal_symbol msym
11549 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11551 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11552 error (_("Your Ada runtime appears to be missing some debugging "
11553 "information.\nCannot insert Ada exception catchpoint "
11554 "in this configuration."));
11559 /* Make sure that the symbol we found corresponds to a function. */
11561 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11563 error (_("Symbol \"%s\" is not a function (class = %d)"),
11564 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11571 /* Inspect the Ada runtime and determine which exception info structure
11572 should be used to provide support for exception catchpoints.
11574 This function will always set the per-inferior exception_info,
11575 or raise an error. */
11578 ada_exception_support_info_sniffer (void)
11580 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11582 /* If the exception info is already known, then no need to recompute it. */
11583 if (data
->exception_info
!= NULL
)
11586 /* Check the latest (default) exception support info. */
11587 if (ada_has_this_exception_support (&default_exception_support_info
))
11589 data
->exception_info
= &default_exception_support_info
;
11593 /* Try the v0 exception suport info. */
11594 if (ada_has_this_exception_support (&exception_support_info_v0
))
11596 data
->exception_info
= &exception_support_info_v0
;
11600 /* Try our fallback exception suport info. */
11601 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11603 data
->exception_info
= &exception_support_info_fallback
;
11607 /* Sometimes, it is normal for us to not be able to find the routine
11608 we are looking for. This happens when the program is linked with
11609 the shared version of the GNAT runtime, and the program has not been
11610 started yet. Inform the user of these two possible causes if
11613 if (ada_update_initial_language (language_unknown
) != language_ada
)
11614 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11616 /* If the symbol does not exist, then check that the program is
11617 already started, to make sure that shared libraries have been
11618 loaded. If it is not started, this may mean that the symbol is
11619 in a shared library. */
11621 if (inferior_ptid
.pid () == 0)
11622 error (_("Unable to insert catchpoint. Try to start the program first."));
11624 /* At this point, we know that we are debugging an Ada program and
11625 that the inferior has been started, but we still are not able to
11626 find the run-time symbols. That can mean that we are in
11627 configurable run time mode, or that a-except as been optimized
11628 out by the linker... In any case, at this point it is not worth
11629 supporting this feature. */
11631 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11634 /* True iff FRAME is very likely to be that of a function that is
11635 part of the runtime system. This is all very heuristic, but is
11636 intended to be used as advice as to what frames are uninteresting
11640 is_known_support_routine (struct frame_info
*frame
)
11642 enum language func_lang
;
11644 const char *fullname
;
11646 /* If this code does not have any debugging information (no symtab),
11647 This cannot be any user code. */
11649 symtab_and_line sal
= find_frame_sal (frame
);
11650 if (sal
.symtab
== NULL
)
11653 /* If there is a symtab, but the associated source file cannot be
11654 located, then assume this is not user code: Selecting a frame
11655 for which we cannot display the code would not be very helpful
11656 for the user. This should also take care of case such as VxWorks
11657 where the kernel has some debugging info provided for a few units. */
11659 fullname
= symtab_to_fullname (sal
.symtab
);
11660 if (access (fullname
, R_OK
) != 0)
11663 /* Check the unit filename against the Ada runtime file naming.
11664 We also check the name of the objfile against the name of some
11665 known system libraries that sometimes come with debugging info
11668 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11670 re_comp (known_runtime_file_name_patterns
[i
]);
11671 if (re_exec (lbasename (sal
.symtab
->filename
)))
11673 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11674 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11678 /* Check whether the function is a GNAT-generated entity. */
11680 gdb::unique_xmalloc_ptr
<char> func_name
11681 = find_frame_funname (frame
, &func_lang
, NULL
);
11682 if (func_name
== NULL
)
11685 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11687 re_comp (known_auxiliary_function_name_patterns
[i
]);
11688 if (re_exec (func_name
.get ()))
11695 /* Find the first frame that contains debugging information and that is not
11696 part of the Ada run-time, starting from FI and moving upward. */
11699 ada_find_printable_frame (struct frame_info
*fi
)
11701 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11703 if (!is_known_support_routine (fi
))
11712 /* Assuming that the inferior just triggered an unhandled exception
11713 catchpoint, return the address in inferior memory where the name
11714 of the exception is stored.
11716 Return zero if the address could not be computed. */
11719 ada_unhandled_exception_name_addr (void)
11721 return parse_and_eval_address ("e.full_name");
11724 /* Same as ada_unhandled_exception_name_addr, except that this function
11725 should be used when the inferior uses an older version of the runtime,
11726 where the exception name needs to be extracted from a specific frame
11727 several frames up in the callstack. */
11730 ada_unhandled_exception_name_addr_from_raise (void)
11733 struct frame_info
*fi
;
11734 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11736 /* To determine the name of this exception, we need to select
11737 the frame corresponding to RAISE_SYM_NAME. This frame is
11738 at least 3 levels up, so we simply skip the first 3 frames
11739 without checking the name of their associated function. */
11740 fi
= get_current_frame ();
11741 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11743 fi
= get_prev_frame (fi
);
11747 enum language func_lang
;
11749 gdb::unique_xmalloc_ptr
<char> func_name
11750 = find_frame_funname (fi
, &func_lang
, NULL
);
11751 if (func_name
!= NULL
)
11753 if (strcmp (func_name
.get (),
11754 data
->exception_info
->catch_exception_sym
) == 0)
11755 break; /* We found the frame we were looking for... */
11757 fi
= get_prev_frame (fi
);
11764 return parse_and_eval_address ("id.full_name");
11767 /* Assuming the inferior just triggered an Ada exception catchpoint
11768 (of any type), return the address in inferior memory where the name
11769 of the exception is stored, if applicable.
11771 Assumes the selected frame is the current frame.
11773 Return zero if the address could not be computed, or if not relevant. */
11776 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11777 struct breakpoint
*b
)
11779 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11783 case ada_catch_exception
:
11784 return (parse_and_eval_address ("e.full_name"));
11787 case ada_catch_exception_unhandled
:
11788 return data
->exception_info
->unhandled_exception_name_addr ();
11791 case ada_catch_handlers
:
11792 return 0; /* The runtimes does not provide access to the exception
11796 case ada_catch_assert
:
11797 return 0; /* Exception name is not relevant in this case. */
11801 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11805 return 0; /* Should never be reached. */
11808 /* Assuming the inferior is stopped at an exception catchpoint,
11809 return the message which was associated to the exception, if
11810 available. Return NULL if the message could not be retrieved.
11812 Note: The exception message can be associated to an exception
11813 either through the use of the Raise_Exception function, or
11814 more simply (Ada 2005 and later), via:
11816 raise Exception_Name with "exception message";
11820 static gdb::unique_xmalloc_ptr
<char>
11821 ada_exception_message_1 (void)
11823 struct value
*e_msg_val
;
11826 /* For runtimes that support this feature, the exception message
11827 is passed as an unbounded string argument called "message". */
11828 e_msg_val
= parse_and_eval ("message");
11829 if (e_msg_val
== NULL
)
11830 return NULL
; /* Exception message not supported. */
11832 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
11833 gdb_assert (e_msg_val
!= NULL
);
11834 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
11836 /* If the message string is empty, then treat it as if there was
11837 no exception message. */
11838 if (e_msg_len
<= 0)
11841 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
11842 read_memory (value_address (e_msg_val
), (gdb_byte
*) e_msg
.get (),
11844 e_msg
.get ()[e_msg_len
] = '\0';
11849 /* Same as ada_exception_message_1, except that all exceptions are
11850 contained here (returning NULL instead). */
11852 static gdb::unique_xmalloc_ptr
<char>
11853 ada_exception_message (void)
11855 gdb::unique_xmalloc_ptr
<char> e_msg
;
11859 e_msg
= ada_exception_message_1 ();
11861 catch (const gdb_exception_error
&e
)
11863 e_msg
.reset (nullptr);
11869 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11870 any error that ada_exception_name_addr_1 might cause to be thrown.
11871 When an error is intercepted, a warning with the error message is printed,
11872 and zero is returned. */
11875 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11876 struct breakpoint
*b
)
11878 CORE_ADDR result
= 0;
11882 result
= ada_exception_name_addr_1 (ex
, b
);
11885 catch (const gdb_exception_error
&e
)
11887 warning (_("failed to get exception name: %s"), e
.what ());
11894 static std::string ada_exception_catchpoint_cond_string
11895 (const char *excep_string
,
11896 enum ada_exception_catchpoint_kind ex
);
11898 /* Ada catchpoints.
11900 In the case of catchpoints on Ada exceptions, the catchpoint will
11901 stop the target on every exception the program throws. When a user
11902 specifies the name of a specific exception, we translate this
11903 request into a condition expression (in text form), and then parse
11904 it into an expression stored in each of the catchpoint's locations.
11905 We then use this condition to check whether the exception that was
11906 raised is the one the user is interested in. If not, then the
11907 target is resumed again. We store the name of the requested
11908 exception, in order to be able to re-set the condition expression
11909 when symbols change. */
11911 /* An instance of this type is used to represent an Ada catchpoint
11912 breakpoint location. */
11914 class ada_catchpoint_location
: public bp_location
11917 ada_catchpoint_location (breakpoint
*owner
)
11918 : bp_location (owner
, bp_loc_software_breakpoint
)
11921 /* The condition that checks whether the exception that was raised
11922 is the specific exception the user specified on catchpoint
11924 expression_up excep_cond_expr
;
11927 /* An instance of this type is used to represent an Ada catchpoint. */
11929 struct ada_catchpoint
: public breakpoint
11931 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
11936 /* The name of the specific exception the user specified. */
11937 std::string excep_string
;
11939 /* What kind of catchpoint this is. */
11940 enum ada_exception_catchpoint_kind m_kind
;
11943 /* Parse the exception condition string in the context of each of the
11944 catchpoint's locations, and store them for later evaluation. */
11947 create_excep_cond_exprs (struct ada_catchpoint
*c
,
11948 enum ada_exception_catchpoint_kind ex
)
11950 struct bp_location
*bl
;
11952 /* Nothing to do if there's no specific exception to catch. */
11953 if (c
->excep_string
.empty ())
11956 /* Same if there are no locations... */
11957 if (c
->loc
== NULL
)
11960 /* Compute the condition expression in text form, from the specific
11961 expection we want to catch. */
11962 std::string cond_string
11963 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
11965 /* Iterate over all the catchpoint's locations, and parse an
11966 expression for each. */
11967 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
11969 struct ada_catchpoint_location
*ada_loc
11970 = (struct ada_catchpoint_location
*) bl
;
11973 if (!bl
->shlib_disabled
)
11977 s
= cond_string
.c_str ();
11980 exp
= parse_exp_1 (&s
, bl
->address
,
11981 block_for_pc (bl
->address
),
11984 catch (const gdb_exception_error
&e
)
11986 warning (_("failed to reevaluate internal exception condition "
11987 "for catchpoint %d: %s"),
11988 c
->number
, e
.what ());
11992 ada_loc
->excep_cond_expr
= std::move (exp
);
11996 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11997 structure for all exception catchpoint kinds. */
11999 static struct bp_location
*
12000 allocate_location_exception (struct breakpoint
*self
)
12002 return new ada_catchpoint_location (self
);
12005 /* Implement the RE_SET method in the breakpoint_ops structure for all
12006 exception catchpoint kinds. */
12009 re_set_exception (struct breakpoint
*b
)
12011 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12013 /* Call the base class's method. This updates the catchpoint's
12015 bkpt_breakpoint_ops
.re_set (b
);
12017 /* Reparse the exception conditional expressions. One for each
12019 create_excep_cond_exprs (c
, c
->m_kind
);
12022 /* Returns true if we should stop for this breakpoint hit. If the
12023 user specified a specific exception, we only want to cause a stop
12024 if the program thrown that exception. */
12027 should_stop_exception (const struct bp_location
*bl
)
12029 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12030 const struct ada_catchpoint_location
*ada_loc
12031 = (const struct ada_catchpoint_location
*) bl
;
12034 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12035 if (c
->m_kind
== ada_catch_assert
)
12036 clear_internalvar (var
);
12043 if (c
->m_kind
== ada_catch_handlers
)
12044 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12045 ".all.occurrence.id");
12049 struct value
*exc
= parse_and_eval (expr
);
12050 set_internalvar (var
, exc
);
12052 catch (const gdb_exception_error
&ex
)
12054 clear_internalvar (var
);
12058 /* With no specific exception, should always stop. */
12059 if (c
->excep_string
.empty ())
12062 if (ada_loc
->excep_cond_expr
== NULL
)
12064 /* We will have a NULL expression if back when we were creating
12065 the expressions, this location's had failed to parse. */
12072 struct value
*mark
;
12074 mark
= value_mark ();
12075 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12076 value_free_to_mark (mark
);
12078 catch (const gdb_exception
&ex
)
12080 exception_fprintf (gdb_stderr
, ex
,
12081 _("Error in testing exception condition:\n"));
12087 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12088 for all exception catchpoint kinds. */
12091 check_status_exception (bpstat bs
)
12093 bs
->stop
= should_stop_exception (bs
->bp_location_at
.get ());
12096 /* Implement the PRINT_IT method in the breakpoint_ops structure
12097 for all exception catchpoint kinds. */
12099 static enum print_stop_action
12100 print_it_exception (bpstat bs
)
12102 struct ui_out
*uiout
= current_uiout
;
12103 struct breakpoint
*b
= bs
->breakpoint_at
;
12105 annotate_catchpoint (b
->number
);
12107 if (uiout
->is_mi_like_p ())
12109 uiout
->field_string ("reason",
12110 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12111 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12114 uiout
->text (b
->disposition
== disp_del
12115 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12116 uiout
->field_signed ("bkptno", b
->number
);
12117 uiout
->text (", ");
12119 /* ada_exception_name_addr relies on the selected frame being the
12120 current frame. Need to do this here because this function may be
12121 called more than once when printing a stop, and below, we'll
12122 select the first frame past the Ada run-time (see
12123 ada_find_printable_frame). */
12124 select_frame (get_current_frame ());
12126 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12129 case ada_catch_exception
:
12130 case ada_catch_exception_unhandled
:
12131 case ada_catch_handlers
:
12133 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12134 char exception_name
[256];
12138 read_memory (addr
, (gdb_byte
*) exception_name
,
12139 sizeof (exception_name
) - 1);
12140 exception_name
[sizeof (exception_name
) - 1] = '\0';
12144 /* For some reason, we were unable to read the exception
12145 name. This could happen if the Runtime was compiled
12146 without debugging info, for instance. In that case,
12147 just replace the exception name by the generic string
12148 "exception" - it will read as "an exception" in the
12149 notification we are about to print. */
12150 memcpy (exception_name
, "exception", sizeof ("exception"));
12152 /* In the case of unhandled exception breakpoints, we print
12153 the exception name as "unhandled EXCEPTION_NAME", to make
12154 it clearer to the user which kind of catchpoint just got
12155 hit. We used ui_out_text to make sure that this extra
12156 info does not pollute the exception name in the MI case. */
12157 if (c
->m_kind
== ada_catch_exception_unhandled
)
12158 uiout
->text ("unhandled ");
12159 uiout
->field_string ("exception-name", exception_name
);
12162 case ada_catch_assert
:
12163 /* In this case, the name of the exception is not really
12164 important. Just print "failed assertion" to make it clearer
12165 that his program just hit an assertion-failure catchpoint.
12166 We used ui_out_text because this info does not belong in
12168 uiout
->text ("failed assertion");
12172 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12173 if (exception_message
!= NULL
)
12175 uiout
->text (" (");
12176 uiout
->field_string ("exception-message", exception_message
.get ());
12180 uiout
->text (" at ");
12181 ada_find_printable_frame (get_current_frame ());
12183 return PRINT_SRC_AND_LOC
;
12186 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12187 for all exception catchpoint kinds. */
12190 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12192 struct ui_out
*uiout
= current_uiout
;
12193 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12194 struct value_print_options opts
;
12196 get_user_print_options (&opts
);
12198 if (opts
.addressprint
)
12199 uiout
->field_skip ("addr");
12201 annotate_field (5);
12204 case ada_catch_exception
:
12205 if (!c
->excep_string
.empty ())
12207 std::string msg
= string_printf (_("`%s' Ada exception"),
12208 c
->excep_string
.c_str ());
12210 uiout
->field_string ("what", msg
);
12213 uiout
->field_string ("what", "all Ada exceptions");
12217 case ada_catch_exception_unhandled
:
12218 uiout
->field_string ("what", "unhandled Ada exceptions");
12221 case ada_catch_handlers
:
12222 if (!c
->excep_string
.empty ())
12224 uiout
->field_fmt ("what",
12225 _("`%s' Ada exception handlers"),
12226 c
->excep_string
.c_str ());
12229 uiout
->field_string ("what", "all Ada exceptions handlers");
12232 case ada_catch_assert
:
12233 uiout
->field_string ("what", "failed Ada assertions");
12237 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12242 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12243 for all exception catchpoint kinds. */
12246 print_mention_exception (struct breakpoint
*b
)
12248 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12249 struct ui_out
*uiout
= current_uiout
;
12251 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12252 : _("Catchpoint "));
12253 uiout
->field_signed ("bkptno", b
->number
);
12254 uiout
->text (": ");
12258 case ada_catch_exception
:
12259 if (!c
->excep_string
.empty ())
12261 std::string info
= string_printf (_("`%s' Ada exception"),
12262 c
->excep_string
.c_str ());
12263 uiout
->text (info
.c_str ());
12266 uiout
->text (_("all Ada exceptions"));
12269 case ada_catch_exception_unhandled
:
12270 uiout
->text (_("unhandled Ada exceptions"));
12273 case ada_catch_handlers
:
12274 if (!c
->excep_string
.empty ())
12277 = string_printf (_("`%s' Ada exception handlers"),
12278 c
->excep_string
.c_str ());
12279 uiout
->text (info
.c_str ());
12282 uiout
->text (_("all Ada exceptions handlers"));
12285 case ada_catch_assert
:
12286 uiout
->text (_("failed Ada assertions"));
12290 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12295 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12296 for all exception catchpoint kinds. */
12299 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12301 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12305 case ada_catch_exception
:
12306 fprintf_filtered (fp
, "catch exception");
12307 if (!c
->excep_string
.empty ())
12308 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12311 case ada_catch_exception_unhandled
:
12312 fprintf_filtered (fp
, "catch exception unhandled");
12315 case ada_catch_handlers
:
12316 fprintf_filtered (fp
, "catch handlers");
12319 case ada_catch_assert
:
12320 fprintf_filtered (fp
, "catch assert");
12324 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12326 print_recreate_thread (b
, fp
);
12329 /* Virtual tables for various breakpoint types. */
12330 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12331 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12332 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12333 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12335 /* See ada-lang.h. */
12338 is_ada_exception_catchpoint (breakpoint
*bp
)
12340 return (bp
->ops
== &catch_exception_breakpoint_ops
12341 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12342 || bp
->ops
== &catch_assert_breakpoint_ops
12343 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12346 /* Split the arguments specified in a "catch exception" command.
12347 Set EX to the appropriate catchpoint type.
12348 Set EXCEP_STRING to the name of the specific exception if
12349 specified by the user.
12350 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12351 "catch handlers" command. False otherwise.
12352 If a condition is found at the end of the arguments, the condition
12353 expression is stored in COND_STRING (memory must be deallocated
12354 after use). Otherwise COND_STRING is set to NULL. */
12357 catch_ada_exception_command_split (const char *args
,
12358 bool is_catch_handlers_cmd
,
12359 enum ada_exception_catchpoint_kind
*ex
,
12360 std::string
*excep_string
,
12361 std::string
*cond_string
)
12363 std::string exception_name
;
12365 exception_name
= extract_arg (&args
);
12366 if (exception_name
== "if")
12368 /* This is not an exception name; this is the start of a condition
12369 expression for a catchpoint on all exceptions. So, "un-get"
12370 this token, and set exception_name to NULL. */
12371 exception_name
.clear ();
12375 /* Check to see if we have a condition. */
12377 args
= skip_spaces (args
);
12378 if (startswith (args
, "if")
12379 && (isspace (args
[2]) || args
[2] == '\0'))
12382 args
= skip_spaces (args
);
12384 if (args
[0] == '\0')
12385 error (_("Condition missing after `if' keyword"));
12386 *cond_string
= args
;
12388 args
+= strlen (args
);
12391 /* Check that we do not have any more arguments. Anything else
12394 if (args
[0] != '\0')
12395 error (_("Junk at end of expression"));
12397 if (is_catch_handlers_cmd
)
12399 /* Catch handling of exceptions. */
12400 *ex
= ada_catch_handlers
;
12401 *excep_string
= exception_name
;
12403 else if (exception_name
.empty ())
12405 /* Catch all exceptions. */
12406 *ex
= ada_catch_exception
;
12407 excep_string
->clear ();
12409 else if (exception_name
== "unhandled")
12411 /* Catch unhandled exceptions. */
12412 *ex
= ada_catch_exception_unhandled
;
12413 excep_string
->clear ();
12417 /* Catch a specific exception. */
12418 *ex
= ada_catch_exception
;
12419 *excep_string
= exception_name
;
12423 /* Return the name of the symbol on which we should break in order to
12424 implement a catchpoint of the EX kind. */
12426 static const char *
12427 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12429 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12431 gdb_assert (data
->exception_info
!= NULL
);
12435 case ada_catch_exception
:
12436 return (data
->exception_info
->catch_exception_sym
);
12438 case ada_catch_exception_unhandled
:
12439 return (data
->exception_info
->catch_exception_unhandled_sym
);
12441 case ada_catch_assert
:
12442 return (data
->exception_info
->catch_assert_sym
);
12444 case ada_catch_handlers
:
12445 return (data
->exception_info
->catch_handlers_sym
);
12448 internal_error (__FILE__
, __LINE__
,
12449 _("unexpected catchpoint kind (%d)"), ex
);
12453 /* Return the breakpoint ops "virtual table" used for catchpoints
12456 static const struct breakpoint_ops
*
12457 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12461 case ada_catch_exception
:
12462 return (&catch_exception_breakpoint_ops
);
12464 case ada_catch_exception_unhandled
:
12465 return (&catch_exception_unhandled_breakpoint_ops
);
12467 case ada_catch_assert
:
12468 return (&catch_assert_breakpoint_ops
);
12470 case ada_catch_handlers
:
12471 return (&catch_handlers_breakpoint_ops
);
12474 internal_error (__FILE__
, __LINE__
,
12475 _("unexpected catchpoint kind (%d)"), ex
);
12479 /* Return the condition that will be used to match the current exception
12480 being raised with the exception that the user wants to catch. This
12481 assumes that this condition is used when the inferior just triggered
12482 an exception catchpoint.
12483 EX: the type of catchpoints used for catching Ada exceptions. */
12486 ada_exception_catchpoint_cond_string (const char *excep_string
,
12487 enum ada_exception_catchpoint_kind ex
)
12490 bool is_standard_exc
= false;
12491 std::string result
;
12493 if (ex
== ada_catch_handlers
)
12495 /* For exception handlers catchpoints, the condition string does
12496 not use the same parameter as for the other exceptions. */
12497 result
= ("long_integer (GNAT_GCC_exception_Access"
12498 "(gcc_exception).all.occurrence.id)");
12501 result
= "long_integer (e)";
12503 /* The standard exceptions are a special case. They are defined in
12504 runtime units that have been compiled without debugging info; if
12505 EXCEP_STRING is the not-fully-qualified name of a standard
12506 exception (e.g. "constraint_error") then, during the evaluation
12507 of the condition expression, the symbol lookup on this name would
12508 *not* return this standard exception. The catchpoint condition
12509 may then be set only on user-defined exceptions which have the
12510 same not-fully-qualified name (e.g. my_package.constraint_error).
12512 To avoid this unexcepted behavior, these standard exceptions are
12513 systematically prefixed by "standard". This means that "catch
12514 exception constraint_error" is rewritten into "catch exception
12515 standard.constraint_error".
12517 If an exception named constraint_error is defined in another package of
12518 the inferior program, then the only way to specify this exception as a
12519 breakpoint condition is to use its fully-qualified named:
12520 e.g. my_package.constraint_error. */
12522 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12524 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12526 is_standard_exc
= true;
12533 if (is_standard_exc
)
12534 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12536 string_appendf (result
, "long_integer (&%s)", excep_string
);
12541 /* Return the symtab_and_line that should be used to insert an exception
12542 catchpoint of the TYPE kind.
12544 ADDR_STRING returns the name of the function where the real
12545 breakpoint that implements the catchpoints is set, depending on the
12546 type of catchpoint we need to create. */
12548 static struct symtab_and_line
12549 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12550 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12552 const char *sym_name
;
12553 struct symbol
*sym
;
12555 /* First, find out which exception support info to use. */
12556 ada_exception_support_info_sniffer ();
12558 /* Then lookup the function on which we will break in order to catch
12559 the Ada exceptions requested by the user. */
12560 sym_name
= ada_exception_sym_name (ex
);
12561 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12564 error (_("Catchpoint symbol not found: %s"), sym_name
);
12566 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12567 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12569 /* Set ADDR_STRING. */
12570 *addr_string
= sym_name
;
12573 *ops
= ada_exception_breakpoint_ops (ex
);
12575 return find_function_start_sal (sym
, 1);
12578 /* Create an Ada exception catchpoint.
12580 EX_KIND is the kind of exception catchpoint to be created.
12582 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12583 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12584 of the exception to which this catchpoint applies.
12586 COND_STRING, if not empty, is the catchpoint condition.
12588 TEMPFLAG, if nonzero, means that the underlying breakpoint
12589 should be temporary.
12591 FROM_TTY is the usual argument passed to all commands implementations. */
12594 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12595 enum ada_exception_catchpoint_kind ex_kind
,
12596 const std::string
&excep_string
,
12597 const std::string
&cond_string
,
12602 std::string addr_string
;
12603 const struct breakpoint_ops
*ops
= NULL
;
12604 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12606 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12607 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12608 ops
, tempflag
, disabled
, from_tty
);
12609 c
->excep_string
= excep_string
;
12610 create_excep_cond_exprs (c
.get (), ex_kind
);
12611 if (!cond_string
.empty ())
12612 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
, false);
12613 install_breakpoint (0, std::move (c
), 1);
12616 /* Implement the "catch exception" command. */
12619 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12620 struct cmd_list_element
*command
)
12622 const char *arg
= arg_entry
;
12623 struct gdbarch
*gdbarch
= get_current_arch ();
12625 enum ada_exception_catchpoint_kind ex_kind
;
12626 std::string excep_string
;
12627 std::string cond_string
;
12629 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12633 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12635 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12636 excep_string
, cond_string
,
12637 tempflag
, 1 /* enabled */,
12641 /* Implement the "catch handlers" command. */
12644 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12645 struct cmd_list_element
*command
)
12647 const char *arg
= arg_entry
;
12648 struct gdbarch
*gdbarch
= get_current_arch ();
12650 enum ada_exception_catchpoint_kind ex_kind
;
12651 std::string excep_string
;
12652 std::string cond_string
;
12654 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12658 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
12660 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12661 excep_string
, cond_string
,
12662 tempflag
, 1 /* enabled */,
12666 /* Completion function for the Ada "catch" commands. */
12669 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
12670 const char *text
, const char *word
)
12672 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
12674 for (const ada_exc_info
&info
: exceptions
)
12676 if (startswith (info
.name
, word
))
12677 tracker
.add_completion (make_unique_xstrdup (info
.name
));
12681 /* Split the arguments specified in a "catch assert" command.
12683 ARGS contains the command's arguments (or the empty string if
12684 no arguments were passed).
12686 If ARGS contains a condition, set COND_STRING to that condition
12687 (the memory needs to be deallocated after use). */
12690 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
12692 args
= skip_spaces (args
);
12694 /* Check whether a condition was provided. */
12695 if (startswith (args
, "if")
12696 && (isspace (args
[2]) || args
[2] == '\0'))
12699 args
= skip_spaces (args
);
12700 if (args
[0] == '\0')
12701 error (_("condition missing after `if' keyword"));
12702 cond_string
.assign (args
);
12705 /* Otherwise, there should be no other argument at the end of
12707 else if (args
[0] != '\0')
12708 error (_("Junk at end of arguments."));
12711 /* Implement the "catch assert" command. */
12714 catch_assert_command (const char *arg_entry
, int from_tty
,
12715 struct cmd_list_element
*command
)
12717 const char *arg
= arg_entry
;
12718 struct gdbarch
*gdbarch
= get_current_arch ();
12720 std::string cond_string
;
12722 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12726 catch_ada_assert_command_split (arg
, cond_string
);
12727 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12729 tempflag
, 1 /* enabled */,
12733 /* Return non-zero if the symbol SYM is an Ada exception object. */
12736 ada_is_exception_sym (struct symbol
*sym
)
12738 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
12740 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12741 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12742 && SYMBOL_CLASS (sym
) != LOC_CONST
12743 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12744 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12747 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12748 Ada exception object. This matches all exceptions except the ones
12749 defined by the Ada language. */
12752 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12756 if (!ada_is_exception_sym (sym
))
12759 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12760 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
12761 return 0; /* A standard exception. */
12763 /* Numeric_Error is also a standard exception, so exclude it.
12764 See the STANDARD_EXC description for more details as to why
12765 this exception is not listed in that array. */
12766 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
12772 /* A helper function for std::sort, comparing two struct ada_exc_info
12775 The comparison is determined first by exception name, and then
12776 by exception address. */
12779 ada_exc_info::operator< (const ada_exc_info
&other
) const
12783 result
= strcmp (name
, other
.name
);
12786 if (result
== 0 && addr
< other
.addr
)
12792 ada_exc_info::operator== (const ada_exc_info
&other
) const
12794 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
12797 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12798 routine, but keeping the first SKIP elements untouched.
12800 All duplicates are also removed. */
12803 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
12806 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
12807 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
12808 exceptions
->end ());
12811 /* Add all exceptions defined by the Ada standard whose name match
12812 a regular expression.
12814 If PREG is not NULL, then this regexp_t object is used to
12815 perform the symbol name matching. Otherwise, no name-based
12816 filtering is performed.
12818 EXCEPTIONS is a vector of exceptions to which matching exceptions
12822 ada_add_standard_exceptions (compiled_regex
*preg
,
12823 std::vector
<ada_exc_info
> *exceptions
)
12827 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12830 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
12832 struct bound_minimal_symbol msymbol
12833 = ada_lookup_simple_minsym (standard_exc
[i
]);
12835 if (msymbol
.minsym
!= NULL
)
12837 struct ada_exc_info info
12838 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12840 exceptions
->push_back (info
);
12846 /* Add all Ada exceptions defined locally and accessible from the given
12849 If PREG is not NULL, then this regexp_t object is used to
12850 perform the symbol name matching. Otherwise, no name-based
12851 filtering is performed.
12853 EXCEPTIONS is a vector of exceptions to which matching exceptions
12857 ada_add_exceptions_from_frame (compiled_regex
*preg
,
12858 struct frame_info
*frame
,
12859 std::vector
<ada_exc_info
> *exceptions
)
12861 const struct block
*block
= get_frame_block (frame
, 0);
12865 struct block_iterator iter
;
12866 struct symbol
*sym
;
12868 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12870 switch (SYMBOL_CLASS (sym
))
12877 if (ada_is_exception_sym (sym
))
12879 struct ada_exc_info info
= {sym
->print_name (),
12880 SYMBOL_VALUE_ADDRESS (sym
)};
12882 exceptions
->push_back (info
);
12886 if (BLOCK_FUNCTION (block
) != NULL
)
12888 block
= BLOCK_SUPERBLOCK (block
);
12892 /* Return true if NAME matches PREG or if PREG is NULL. */
12895 name_matches_regex (const char *name
, compiled_regex
*preg
)
12897 return (preg
== NULL
12898 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
12901 /* Add all exceptions defined globally whose name name match
12902 a regular expression, excluding standard exceptions.
12904 The reason we exclude standard exceptions is that they need
12905 to be handled separately: Standard exceptions are defined inside
12906 a runtime unit which is normally not compiled with debugging info,
12907 and thus usually do not show up in our symbol search. However,
12908 if the unit was in fact built with debugging info, we need to
12909 exclude them because they would duplicate the entry we found
12910 during the special loop that specifically searches for those
12911 standard exceptions.
12913 If PREG is not NULL, then this regexp_t object is used to
12914 perform the symbol name matching. Otherwise, no name-based
12915 filtering is performed.
12917 EXCEPTIONS is a vector of exceptions to which matching exceptions
12921 ada_add_global_exceptions (compiled_regex
*preg
,
12922 std::vector
<ada_exc_info
> *exceptions
)
12924 /* In Ada, the symbol "search name" is a linkage name, whereas the
12925 regular expression used to do the matching refers to the natural
12926 name. So match against the decoded name. */
12927 expand_symtabs_matching (NULL
,
12928 lookup_name_info::match_any (),
12929 [&] (const char *search_name
)
12931 std::string decoded
= ada_decode (search_name
);
12932 return name_matches_regex (decoded
.c_str (), preg
);
12937 for (objfile
*objfile
: current_program_space
->objfiles ())
12939 for (compunit_symtab
*s
: objfile
->compunits ())
12941 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
12944 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
12946 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
12947 struct block_iterator iter
;
12948 struct symbol
*sym
;
12950 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
12951 if (ada_is_non_standard_exception_sym (sym
)
12952 && name_matches_regex (sym
->natural_name (), preg
))
12954 struct ada_exc_info info
12955 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
12957 exceptions
->push_back (info
);
12964 /* Implements ada_exceptions_list with the regular expression passed
12965 as a regex_t, rather than a string.
12967 If not NULL, PREG is used to filter out exceptions whose names
12968 do not match. Otherwise, all exceptions are listed. */
12970 static std::vector
<ada_exc_info
>
12971 ada_exceptions_list_1 (compiled_regex
*preg
)
12973 std::vector
<ada_exc_info
> result
;
12976 /* First, list the known standard exceptions. These exceptions
12977 need to be handled separately, as they are usually defined in
12978 runtime units that have been compiled without debugging info. */
12980 ada_add_standard_exceptions (preg
, &result
);
12982 /* Next, find all exceptions whose scope is local and accessible
12983 from the currently selected frame. */
12985 if (has_stack_frames ())
12987 prev_len
= result
.size ();
12988 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
12990 if (result
.size () > prev_len
)
12991 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12994 /* Add all exceptions whose scope is global. */
12996 prev_len
= result
.size ();
12997 ada_add_global_exceptions (preg
, &result
);
12998 if (result
.size () > prev_len
)
12999 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13004 /* Return a vector of ada_exc_info.
13006 If REGEXP is NULL, all exceptions are included in the result.
13007 Otherwise, it should contain a valid regular expression,
13008 and only the exceptions whose names match that regular expression
13009 are included in the result.
13011 The exceptions are sorted in the following order:
13012 - Standard exceptions (defined by the Ada language), in
13013 alphabetical order;
13014 - Exceptions only visible from the current frame, in
13015 alphabetical order;
13016 - Exceptions whose scope is global, in alphabetical order. */
13018 std::vector
<ada_exc_info
>
13019 ada_exceptions_list (const char *regexp
)
13021 if (regexp
== NULL
)
13022 return ada_exceptions_list_1 (NULL
);
13024 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13025 return ada_exceptions_list_1 (®
);
13028 /* Implement the "info exceptions" command. */
13031 info_exceptions_command (const char *regexp
, int from_tty
)
13033 struct gdbarch
*gdbarch
= get_current_arch ();
13035 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13037 if (regexp
!= NULL
)
13039 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13041 printf_filtered (_("All defined Ada exceptions:\n"));
13043 for (const ada_exc_info
&info
: exceptions
)
13044 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13048 /* Information about operators given special treatment in functions
13050 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13052 #define ADA_OPERATORS \
13053 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13054 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13055 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13056 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13057 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13058 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13059 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13060 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13061 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13062 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13063 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13064 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13065 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13066 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13067 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13068 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13069 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13070 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13071 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13074 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13077 switch (exp
->elts
[pc
- 1].opcode
)
13080 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13083 #define OP_DEFN(op, len, args, binop) \
13084 case op: *oplenp = len; *argsp = args; break;
13090 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13095 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13100 /* Implementation of the exp_descriptor method operator_check. */
13103 ada_operator_check (struct expression
*exp
, int pos
,
13104 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13107 const union exp_element
*const elts
= exp
->elts
;
13108 struct type
*type
= NULL
;
13110 switch (elts
[pos
].opcode
)
13112 case UNOP_IN_RANGE
:
13114 type
= elts
[pos
+ 1].type
;
13118 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13121 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13123 if (type
!= nullptr && type
->objfile_owner () != nullptr
13124 && objfile_func (type
->objfile_owner (), data
))
13130 /* As for operator_length, but assumes PC is pointing at the first
13131 element of the operator, and gives meaningful results only for the
13132 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13135 ada_forward_operator_length (struct expression
*exp
, int pc
,
13136 int *oplenp
, int *argsp
)
13138 switch (exp
->elts
[pc
].opcode
)
13141 *oplenp
= *argsp
= 0;
13144 #define OP_DEFN(op, len, args, binop) \
13145 case op: *oplenp = len; *argsp = args; break;
13151 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13156 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13162 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13164 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13172 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13174 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13179 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13183 /* Ada attributes ('Foo). */
13186 case OP_ATR_LENGTH
:
13190 case OP_ATR_MODULUS
:
13197 case UNOP_IN_RANGE
:
13199 /* XXX: gdb_sprint_host_address, type_sprint */
13200 fprintf_filtered (stream
, _("Type @"));
13201 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13202 fprintf_filtered (stream
, " (");
13203 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13204 fprintf_filtered (stream
, ")");
13206 case BINOP_IN_BOUNDS
:
13207 fprintf_filtered (stream
, " (%d)",
13208 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13210 case TERNOP_IN_RANGE
:
13215 case OP_DISCRETE_RANGE
:
13216 case OP_POSITIONAL
:
13223 char *name
= &exp
->elts
[elt
+ 2].string
;
13224 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13226 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13231 return dump_subexp_body_standard (exp
, stream
, elt
);
13235 for (i
= 0; i
< nargs
; i
+= 1)
13236 elt
= dump_subexp (exp
, stream
, elt
);
13241 /* The Ada extension of print_subexp (q.v.). */
13244 ada_print_subexp (struct expression
*exp
, int *pos
,
13245 struct ui_file
*stream
, enum precedence prec
)
13247 int oplen
, nargs
, i
;
13249 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13251 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13258 print_subexp_standard (exp
, pos
, stream
, prec
);
13262 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13265 case BINOP_IN_BOUNDS
:
13266 /* XXX: sprint_subexp */
13267 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13268 fputs_filtered (" in ", stream
);
13269 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13270 fputs_filtered ("'range", stream
);
13271 if (exp
->elts
[pc
+ 1].longconst
> 1)
13272 fprintf_filtered (stream
, "(%ld)",
13273 (long) exp
->elts
[pc
+ 1].longconst
);
13276 case TERNOP_IN_RANGE
:
13277 if (prec
>= PREC_EQUAL
)
13278 fputs_filtered ("(", stream
);
13279 /* XXX: sprint_subexp */
13280 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13281 fputs_filtered (" in ", stream
);
13282 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13283 fputs_filtered (" .. ", stream
);
13284 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13285 if (prec
>= PREC_EQUAL
)
13286 fputs_filtered (")", stream
);
13291 case OP_ATR_LENGTH
:
13295 case OP_ATR_MODULUS
:
13300 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13302 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13303 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13304 &type_print_raw_options
);
13308 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13309 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13314 for (tem
= 1; tem
< nargs
; tem
+= 1)
13316 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13317 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13319 fputs_filtered (")", stream
);
13324 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13325 fputs_filtered ("'(", stream
);
13326 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13327 fputs_filtered (")", stream
);
13330 case UNOP_IN_RANGE
:
13331 /* XXX: sprint_subexp */
13332 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13333 fputs_filtered (" in ", stream
);
13334 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13335 &type_print_raw_options
);
13338 case OP_DISCRETE_RANGE
:
13339 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13340 fputs_filtered ("..", stream
);
13341 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13345 fputs_filtered ("others => ", stream
);
13346 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13350 for (i
= 0; i
< nargs
-1; i
+= 1)
13353 fputs_filtered ("|", stream
);
13354 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13356 fputs_filtered (" => ", stream
);
13357 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13360 case OP_POSITIONAL
:
13361 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13365 fputs_filtered ("(", stream
);
13366 for (i
= 0; i
< nargs
; i
+= 1)
13369 fputs_filtered (", ", stream
);
13370 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13372 fputs_filtered (")", stream
);
13377 /* Table mapping opcodes into strings for printing operators
13378 and precedences of the operators. */
13380 static const struct op_print ada_op_print_tab
[] = {
13381 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13382 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13383 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13384 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13385 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13386 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13387 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13388 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13389 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13390 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13391 {">", BINOP_GTR
, PREC_ORDER
, 0},
13392 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13393 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13394 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13395 {"+", BINOP_ADD
, PREC_ADD
, 0},
13396 {"-", BINOP_SUB
, PREC_ADD
, 0},
13397 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13398 {"*", BINOP_MUL
, PREC_MUL
, 0},
13399 {"/", BINOP_DIV
, PREC_MUL
, 0},
13400 {"rem", BINOP_REM
, PREC_MUL
, 0},
13401 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13402 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13403 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13404 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13405 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13406 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13407 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13408 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13409 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13410 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13411 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13412 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13415 /* Language vector */
13417 static const struct exp_descriptor ada_exp_descriptor
= {
13419 ada_operator_length
,
13420 ada_operator_check
,
13421 ada_dump_subexp_body
,
13422 ada_evaluate_subexp
13425 /* symbol_name_matcher_ftype adapter for wild_match. */
13428 do_wild_match (const char *symbol_search_name
,
13429 const lookup_name_info
&lookup_name
,
13430 completion_match_result
*comp_match_res
)
13432 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13435 /* symbol_name_matcher_ftype adapter for full_match. */
13438 do_full_match (const char *symbol_search_name
,
13439 const lookup_name_info
&lookup_name
,
13440 completion_match_result
*comp_match_res
)
13442 const char *lname
= lookup_name
.ada ().lookup_name ().c_str ();
13444 /* If both symbols start with "_ada_", just let the loop below
13445 handle the comparison. However, if only the symbol name starts
13446 with "_ada_", skip the prefix and let the match proceed as
13448 if (startswith (symbol_search_name
, "_ada_")
13449 && !startswith (lname
, "_ada"))
13450 symbol_search_name
+= 5;
13452 int uscore_count
= 0;
13453 while (*lname
!= '\0')
13455 if (*symbol_search_name
!= *lname
)
13457 if (*symbol_search_name
== 'B' && uscore_count
== 2
13458 && symbol_search_name
[1] == '_')
13460 symbol_search_name
+= 2;
13461 while (isdigit (*symbol_search_name
))
13462 ++symbol_search_name
;
13463 if (symbol_search_name
[0] == '_'
13464 && symbol_search_name
[1] == '_')
13466 symbol_search_name
+= 2;
13473 if (*symbol_search_name
== '_')
13478 ++symbol_search_name
;
13482 return is_name_suffix (symbol_search_name
);
13485 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13488 do_exact_match (const char *symbol_search_name
,
13489 const lookup_name_info
&lookup_name
,
13490 completion_match_result
*comp_match_res
)
13492 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13495 /* Build the Ada lookup name for LOOKUP_NAME. */
13497 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13499 gdb::string_view user_name
= lookup_name
.name ();
13501 if (!user_name
.empty () && user_name
[0] == '<')
13503 if (user_name
.back () == '>')
13505 = gdb::to_string (user_name
.substr (1, user_name
.size () - 2));
13508 = gdb::to_string (user_name
.substr (1, user_name
.size () - 1));
13509 m_encoded_p
= true;
13510 m_verbatim_p
= true;
13511 m_wild_match_p
= false;
13512 m_standard_p
= false;
13516 m_verbatim_p
= false;
13518 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13522 const char *folded
= ada_fold_name (user_name
);
13523 m_encoded_name
= ada_encode_1 (folded
, false);
13524 if (m_encoded_name
.empty ())
13525 m_encoded_name
= gdb::to_string (user_name
);
13528 m_encoded_name
= gdb::to_string (user_name
);
13530 /* Handle the 'package Standard' special case. See description
13531 of m_standard_p. */
13532 if (startswith (m_encoded_name
.c_str (), "standard__"))
13534 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13535 m_standard_p
= true;
13538 m_standard_p
= false;
13540 /* If the name contains a ".", then the user is entering a fully
13541 qualified entity name, and the match must not be done in wild
13542 mode. Similarly, if the user wants to complete what looks
13543 like an encoded name, the match must not be done in wild
13544 mode. Also, in the standard__ special case always do
13545 non-wild matching. */
13547 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13550 && user_name
.find ('.') == std::string::npos
);
13554 /* symbol_name_matcher_ftype method for Ada. This only handles
13555 completion mode. */
13558 ada_symbol_name_matches (const char *symbol_search_name
,
13559 const lookup_name_info
&lookup_name
,
13560 completion_match_result
*comp_match_res
)
13562 return lookup_name
.ada ().matches (symbol_search_name
,
13563 lookup_name
.match_type (),
13567 /* A name matcher that matches the symbol name exactly, with
13571 literal_symbol_name_matcher (const char *symbol_search_name
,
13572 const lookup_name_info
&lookup_name
,
13573 completion_match_result
*comp_match_res
)
13575 gdb::string_view name_view
= lookup_name
.name ();
13577 if (lookup_name
.completion_mode ()
13578 ? (strncmp (symbol_search_name
, name_view
.data (),
13579 name_view
.size ()) == 0)
13580 : symbol_search_name
== name_view
)
13582 if (comp_match_res
!= NULL
)
13583 comp_match_res
->set_match (symbol_search_name
);
13590 /* Implement the "get_symbol_name_matcher" language_defn method for
13593 static symbol_name_matcher_ftype
*
13594 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
13596 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
13597 return literal_symbol_name_matcher
;
13599 if (lookup_name
.completion_mode ())
13600 return ada_symbol_name_matches
;
13603 if (lookup_name
.ada ().wild_match_p ())
13604 return do_wild_match
;
13605 else if (lookup_name
.ada ().verbatim_p ())
13606 return do_exact_match
;
13608 return do_full_match
;
13612 /* Class representing the Ada language. */
13614 class ada_language
: public language_defn
13618 : language_defn (language_ada
)
13621 /* See language.h. */
13623 const char *name () const override
13626 /* See language.h. */
13628 const char *natural_name () const override
13631 /* See language.h. */
13633 const std::vector
<const char *> &filename_extensions () const override
13635 static const std::vector
<const char *> extensions
13636 = { ".adb", ".ads", ".a", ".ada", ".dg" };
13640 /* Print an array element index using the Ada syntax. */
13642 void print_array_index (struct type
*index_type
,
13644 struct ui_file
*stream
,
13645 const value_print_options
*options
) const override
13647 struct value
*index_value
= val_atr (index_type
, index
);
13649 value_print (index_value
, stream
, options
);
13650 fprintf_filtered (stream
, " => ");
13653 /* Implement the "read_var_value" language_defn method for Ada. */
13655 struct value
*read_var_value (struct symbol
*var
,
13656 const struct block
*var_block
,
13657 struct frame_info
*frame
) const override
13659 /* The only case where default_read_var_value is not sufficient
13660 is when VAR is a renaming... */
13661 if (frame
!= nullptr)
13663 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
13664 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
13665 return ada_read_renaming_var_value (var
, frame_block
);
13668 /* This is a typical case where we expect the default_read_var_value
13669 function to work. */
13670 return language_defn::read_var_value (var
, var_block
, frame
);
13673 /* See language.h. */
13674 void language_arch_info (struct gdbarch
*gdbarch
,
13675 struct language_arch_info
*lai
) const override
13677 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13679 /* Helper function to allow shorter lines below. */
13680 auto add
= [&] (struct type
*t
)
13682 lai
->add_primitive_type (t
);
13685 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13687 add (arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13688 0, "long_integer"));
13689 add (arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13690 0, "short_integer"));
13691 struct type
*char_type
= arch_character_type (gdbarch
, TARGET_CHAR_BIT
,
13693 lai
->set_string_char_type (char_type
);
13695 add (arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13696 "float", gdbarch_float_format (gdbarch
)));
13697 add (arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13698 "long_float", gdbarch_double_format (gdbarch
)));
13699 add (arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13700 0, "long_long_integer"));
13701 add (arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13703 gdbarch_long_double_format (gdbarch
)));
13704 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13706 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13708 add (builtin
->builtin_void
);
13710 struct type
*system_addr_ptr
13711 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13713 system_addr_ptr
->set_name ("system__address");
13714 add (system_addr_ptr
);
13716 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13717 type. This is a signed integral type whose size is the same as
13718 the size of addresses. */
13719 unsigned int addr_length
= TYPE_LENGTH (system_addr_ptr
);
13720 add (arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13721 "storage_offset"));
13723 lai
->set_bool_type (builtin
->builtin_bool
);
13726 /* See language.h. */
13728 bool iterate_over_symbols
13729 (const struct block
*block
, const lookup_name_info
&name
,
13730 domain_enum domain
,
13731 gdb::function_view
<symbol_found_callback_ftype
> callback
) const override
13733 std::vector
<struct block_symbol
> results
13734 = ada_lookup_symbol_list_worker (name
, block
, domain
, 0);
13735 for (block_symbol
&sym
: results
)
13737 if (!callback (&sym
))
13744 /* See language.h. */
13745 bool sniff_from_mangled_name (const char *mangled
,
13746 char **out
) const override
13748 std::string demangled
= ada_decode (mangled
);
13752 if (demangled
!= mangled
&& demangled
[0] != '<')
13754 /* Set the gsymbol language to Ada, but still return 0.
13755 Two reasons for that:
13757 1. For Ada, we prefer computing the symbol's decoded name
13758 on the fly rather than pre-compute it, in order to save
13759 memory (Ada projects are typically very large).
13761 2. There are some areas in the definition of the GNAT
13762 encoding where, with a bit of bad luck, we might be able
13763 to decode a non-Ada symbol, generating an incorrect
13764 demangled name (Eg: names ending with "TB" for instance
13765 are identified as task bodies and so stripped from
13766 the decoded name returned).
13768 Returning true, here, but not setting *DEMANGLED, helps us get
13769 a little bit of the best of both worlds. Because we're last,
13770 we should not affect any of the other languages that were
13771 able to demangle the symbol before us; we get to correctly
13772 tag Ada symbols as such; and even if we incorrectly tagged a
13773 non-Ada symbol, which should be rare, any routing through the
13774 Ada language should be transparent (Ada tries to behave much
13775 like C/C++ with non-Ada symbols). */
13782 /* See language.h. */
13784 char *demangle_symbol (const char *mangled
, int options
) const override
13786 return ada_la_decode (mangled
, options
);
13789 /* See language.h. */
13791 void print_type (struct type
*type
, const char *varstring
,
13792 struct ui_file
*stream
, int show
, int level
,
13793 const struct type_print_options
*flags
) const override
13795 ada_print_type (type
, varstring
, stream
, show
, level
, flags
);
13798 /* See language.h. */
13800 const char *word_break_characters (void) const override
13802 return ada_completer_word_break_characters
;
13805 /* See language.h. */
13807 void collect_symbol_completion_matches (completion_tracker
&tracker
,
13808 complete_symbol_mode mode
,
13809 symbol_name_match_type name_match_type
,
13810 const char *text
, const char *word
,
13811 enum type_code code
) const override
13813 struct symbol
*sym
;
13814 const struct block
*b
, *surrounding_static_block
= 0;
13815 struct block_iterator iter
;
13817 gdb_assert (code
== TYPE_CODE_UNDEF
);
13819 lookup_name_info
lookup_name (text
, name_match_type
, true);
13821 /* First, look at the partial symtab symbols. */
13822 expand_symtabs_matching (NULL
,
13828 /* At this point scan through the misc symbol vectors and add each
13829 symbol you find to the list. Eventually we want to ignore
13830 anything that isn't a text symbol (everything else will be
13831 handled by the psymtab code above). */
13833 for (objfile
*objfile
: current_program_space
->objfiles ())
13835 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
13839 if (completion_skip_symbol (mode
, msymbol
))
13842 language symbol_language
= msymbol
->language ();
13844 /* Ada minimal symbols won't have their language set to Ada. If
13845 we let completion_list_add_name compare using the
13846 default/C-like matcher, then when completing e.g., symbols in a
13847 package named "pck", we'd match internal Ada symbols like
13848 "pckS", which are invalid in an Ada expression, unless you wrap
13849 them in '<' '>' to request a verbatim match.
13851 Unfortunately, some Ada encoded names successfully demangle as
13852 C++ symbols (using an old mangling scheme), such as "name__2Xn"
13853 -> "Xn::name(void)" and thus some Ada minimal symbols end up
13854 with the wrong language set. Paper over that issue here. */
13855 if (symbol_language
== language_auto
13856 || symbol_language
== language_cplus
)
13857 symbol_language
= language_ada
;
13859 completion_list_add_name (tracker
,
13861 msymbol
->linkage_name (),
13862 lookup_name
, text
, word
);
13866 /* Search upwards from currently selected frame (so that we can
13867 complete on local vars. */
13869 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
13871 if (!BLOCK_SUPERBLOCK (b
))
13872 surrounding_static_block
= b
; /* For elmin of dups */
13874 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13876 if (completion_skip_symbol (mode
, sym
))
13879 completion_list_add_name (tracker
,
13881 sym
->linkage_name (),
13882 lookup_name
, text
, word
);
13886 /* Go through the symtabs and check the externs and statics for
13887 symbols which match. */
13889 for (objfile
*objfile
: current_program_space
->objfiles ())
13891 for (compunit_symtab
*s
: objfile
->compunits ())
13894 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
13895 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13897 if (completion_skip_symbol (mode
, sym
))
13900 completion_list_add_name (tracker
,
13902 sym
->linkage_name (),
13903 lookup_name
, text
, word
);
13908 for (objfile
*objfile
: current_program_space
->objfiles ())
13910 for (compunit_symtab
*s
: objfile
->compunits ())
13913 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
13914 /* Don't do this block twice. */
13915 if (b
== surrounding_static_block
)
13917 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13919 if (completion_skip_symbol (mode
, sym
))
13922 completion_list_add_name (tracker
,
13924 sym
->linkage_name (),
13925 lookup_name
, text
, word
);
13931 /* See language.h. */
13933 gdb::unique_xmalloc_ptr
<char> watch_location_expression
13934 (struct type
*type
, CORE_ADDR addr
) const override
13936 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
13937 std::string name
= type_to_string (type
);
13938 return gdb::unique_xmalloc_ptr
<char>
13939 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
13942 /* See language.h. */
13944 void value_print (struct value
*val
, struct ui_file
*stream
,
13945 const struct value_print_options
*options
) const override
13947 return ada_value_print (val
, stream
, options
);
13950 /* See language.h. */
13952 void value_print_inner
13953 (struct value
*val
, struct ui_file
*stream
, int recurse
,
13954 const struct value_print_options
*options
) const override
13956 return ada_value_print_inner (val
, stream
, recurse
, options
);
13959 /* See language.h. */
13961 struct block_symbol lookup_symbol_nonlocal
13962 (const char *name
, const struct block
*block
,
13963 const domain_enum domain
) const override
13965 struct block_symbol sym
;
13967 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
13968 if (sym
.symbol
!= NULL
)
13971 /* If we haven't found a match at this point, try the primitive
13972 types. In other languages, this search is performed before
13973 searching for global symbols in order to short-circuit that
13974 global-symbol search if it happens that the name corresponds
13975 to a primitive type. But we cannot do the same in Ada, because
13976 it is perfectly legitimate for a program to declare a type which
13977 has the same name as a standard type. If looking up a type in
13978 that situation, we have traditionally ignored the primitive type
13979 in favor of user-defined types. This is why, unlike most other
13980 languages, we search the primitive types this late and only after
13981 having searched the global symbols without success. */
13983 if (domain
== VAR_DOMAIN
)
13985 struct gdbarch
*gdbarch
;
13988 gdbarch
= target_gdbarch ();
13990 gdbarch
= block_gdbarch (block
);
13992 = language_lookup_primitive_type_as_symbol (this, gdbarch
, name
);
13993 if (sym
.symbol
!= NULL
)
14000 /* See language.h. */
14002 int parser (struct parser_state
*ps
) const override
14004 warnings_issued
= 0;
14005 return ada_parse (ps
);
14010 Same as evaluate_type (*EXP), but resolves ambiguous symbol references
14011 (marked by OP_VAR_VALUE nodes in which the symbol has an undefined
14012 namespace) and converts operators that are user-defined into
14013 appropriate function calls. If CONTEXT_TYPE is non-null, it provides
14014 a preferred result type [at the moment, only type void has any
14015 effect---causing procedures to be preferred over functions in calls].
14016 A null CONTEXT_TYPE indicates that a non-void return type is
14017 preferred. May change (expand) *EXP. */
14019 void post_parser (expression_up
*expp
, struct parser_state
*ps
)
14022 struct type
*context_type
= NULL
;
14025 if (ps
->void_context_p
)
14026 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
14028 resolve_subexp (expp
, &pc
, 1, context_type
, ps
->parse_completion
,
14029 ps
->block_tracker
);
14032 /* See language.h. */
14034 void emitchar (int ch
, struct type
*chtype
,
14035 struct ui_file
*stream
, int quoter
) const override
14037 ada_emit_char (ch
, chtype
, stream
, quoter
, 1);
14040 /* See language.h. */
14042 void printchar (int ch
, struct type
*chtype
,
14043 struct ui_file
*stream
) const override
14045 ada_printchar (ch
, chtype
, stream
);
14048 /* See language.h. */
14050 void printstr (struct ui_file
*stream
, struct type
*elttype
,
14051 const gdb_byte
*string
, unsigned int length
,
14052 const char *encoding
, int force_ellipses
,
14053 const struct value_print_options
*options
) const override
14055 ada_printstr (stream
, elttype
, string
, length
, encoding
,
14056 force_ellipses
, options
);
14059 /* See language.h. */
14061 void print_typedef (struct type
*type
, struct symbol
*new_symbol
,
14062 struct ui_file
*stream
) const override
14064 ada_print_typedef (type
, new_symbol
, stream
);
14067 /* See language.h. */
14069 bool is_string_type_p (struct type
*type
) const override
14071 return ada_is_string_type (type
);
14074 /* See language.h. */
14076 const char *struct_too_deep_ellipsis () const override
14077 { return "(...)"; }
14079 /* See language.h. */
14081 bool c_style_arrays_p () const override
14084 /* See language.h. */
14086 bool store_sym_names_in_linkage_form_p () const override
14089 /* See language.h. */
14091 const struct lang_varobj_ops
*varobj_ops () const override
14092 { return &ada_varobj_ops
; }
14094 /* See language.h. */
14096 const struct exp_descriptor
*expression_ops () const override
14097 { return &ada_exp_descriptor
; }
14099 /* See language.h. */
14101 const struct op_print
*opcode_print_table () const override
14102 { return ada_op_print_tab
; }
14105 /* See language.h. */
14107 symbol_name_matcher_ftype
*get_symbol_name_matcher_inner
14108 (const lookup_name_info
&lookup_name
) const override
14110 return ada_get_symbol_name_matcher (lookup_name
);
14114 /* Single instance of the Ada language class. */
14116 static ada_language ada_language_defn
;
14118 /* Command-list for the "set/show ada" prefix command. */
14119 static struct cmd_list_element
*set_ada_list
;
14120 static struct cmd_list_element
*show_ada_list
;
14123 initialize_ada_catchpoint_ops (void)
14125 struct breakpoint_ops
*ops
;
14127 initialize_breakpoint_ops ();
14129 ops
= &catch_exception_breakpoint_ops
;
14130 *ops
= bkpt_breakpoint_ops
;
14131 ops
->allocate_location
= allocate_location_exception
;
14132 ops
->re_set
= re_set_exception
;
14133 ops
->check_status
= check_status_exception
;
14134 ops
->print_it
= print_it_exception
;
14135 ops
->print_one
= print_one_exception
;
14136 ops
->print_mention
= print_mention_exception
;
14137 ops
->print_recreate
= print_recreate_exception
;
14139 ops
= &catch_exception_unhandled_breakpoint_ops
;
14140 *ops
= bkpt_breakpoint_ops
;
14141 ops
->allocate_location
= allocate_location_exception
;
14142 ops
->re_set
= re_set_exception
;
14143 ops
->check_status
= check_status_exception
;
14144 ops
->print_it
= print_it_exception
;
14145 ops
->print_one
= print_one_exception
;
14146 ops
->print_mention
= print_mention_exception
;
14147 ops
->print_recreate
= print_recreate_exception
;
14149 ops
= &catch_assert_breakpoint_ops
;
14150 *ops
= bkpt_breakpoint_ops
;
14151 ops
->allocate_location
= allocate_location_exception
;
14152 ops
->re_set
= re_set_exception
;
14153 ops
->check_status
= check_status_exception
;
14154 ops
->print_it
= print_it_exception
;
14155 ops
->print_one
= print_one_exception
;
14156 ops
->print_mention
= print_mention_exception
;
14157 ops
->print_recreate
= print_recreate_exception
;
14159 ops
= &catch_handlers_breakpoint_ops
;
14160 *ops
= bkpt_breakpoint_ops
;
14161 ops
->allocate_location
= allocate_location_exception
;
14162 ops
->re_set
= re_set_exception
;
14163 ops
->check_status
= check_status_exception
;
14164 ops
->print_it
= print_it_exception
;
14165 ops
->print_one
= print_one_exception
;
14166 ops
->print_mention
= print_mention_exception
;
14167 ops
->print_recreate
= print_recreate_exception
;
14170 /* This module's 'new_objfile' observer. */
14173 ada_new_objfile_observer (struct objfile
*objfile
)
14175 ada_clear_symbol_cache ();
14178 /* This module's 'free_objfile' observer. */
14181 ada_free_objfile_observer (struct objfile
*objfile
)
14183 ada_clear_symbol_cache ();
14186 void _initialize_ada_language ();
14188 _initialize_ada_language ()
14190 initialize_ada_catchpoint_ops ();
14192 add_basic_prefix_cmd ("ada", no_class
,
14193 _("Prefix command for changing Ada-specific settings."),
14194 &set_ada_list
, "set ada ", 0, &setlist
);
14196 add_show_prefix_cmd ("ada", no_class
,
14197 _("Generic command for showing Ada-specific settings."),
14198 &show_ada_list
, "show ada ", 0, &showlist
);
14200 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14201 &trust_pad_over_xvs
, _("\
14202 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14203 Show whether an optimization trusting PAD types over XVS types is activated."),
14205 This is related to the encoding used by the GNAT compiler. The debugger\n\
14206 should normally trust the contents of PAD types, but certain older versions\n\
14207 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14208 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14209 work around this bug. It is always safe to turn this option \"off\", but\n\
14210 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14211 this option to \"off\" unless necessary."),
14212 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14214 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14215 &print_signatures
, _("\
14216 Enable or disable the output of formal and return types for functions in the \
14217 overloads selection menu."), _("\
14218 Show whether the output of formal and return types for functions in the \
14219 overloads selection menu is activated."),
14220 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14222 add_catch_command ("exception", _("\
14223 Catch Ada exceptions, when raised.\n\
14224 Usage: catch exception [ARG] [if CONDITION]\n\
14225 Without any argument, stop when any Ada exception is raised.\n\
14226 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14227 being raised does not have a handler (and will therefore lead to the task's\n\
14229 Otherwise, the catchpoint only stops when the name of the exception being\n\
14230 raised is the same as ARG.\n\
14231 CONDITION is a boolean expression that is evaluated to see whether the\n\
14232 exception should cause a stop."),
14233 catch_ada_exception_command
,
14234 catch_ada_completer
,
14238 add_catch_command ("handlers", _("\
14239 Catch Ada exceptions, when handled.\n\
14240 Usage: catch handlers [ARG] [if CONDITION]\n\
14241 Without any argument, stop when any Ada exception is handled.\n\
14242 With an argument, catch only exceptions with the given name.\n\
14243 CONDITION is a boolean expression that is evaluated to see whether the\n\
14244 exception should cause a stop."),
14245 catch_ada_handlers_command
,
14246 catch_ada_completer
,
14249 add_catch_command ("assert", _("\
14250 Catch failed Ada assertions, when raised.\n\
14251 Usage: catch assert [if CONDITION]\n\
14252 CONDITION is a boolean expression that is evaluated to see whether the\n\
14253 exception should cause a stop."),
14254 catch_assert_command
,
14259 varsize_limit
= 65536;
14260 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14261 &varsize_limit
, _("\
14262 Set the maximum number of bytes allowed in a variable-size object."), _("\
14263 Show the maximum number of bytes allowed in a variable-size object."), _("\
14264 Attempts to access an object whose size is not a compile-time constant\n\
14265 and exceeds this limit will cause an error."),
14266 NULL
, NULL
, &setlist
, &showlist
);
14268 add_info ("exceptions", info_exceptions_command
,
14270 List all Ada exception names.\n\
14271 Usage: info exceptions [REGEXP]\n\
14272 If a regular expression is passed as an argument, only those matching\n\
14273 the regular expression are listed."));
14275 add_basic_prefix_cmd ("ada", class_maintenance
,
14276 _("Set Ada maintenance-related variables."),
14277 &maint_set_ada_cmdlist
, "maintenance set ada ",
14278 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14280 add_show_prefix_cmd ("ada", class_maintenance
,
14281 _("Show Ada maintenance-related variables."),
14282 &maint_show_ada_cmdlist
, "maintenance show ada ",
14283 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14285 add_setshow_boolean_cmd
14286 ("ignore-descriptive-types", class_maintenance
,
14287 &ada_ignore_descriptive_types_p
,
14288 _("Set whether descriptive types generated by GNAT should be ignored."),
14289 _("Show whether descriptive types generated by GNAT should be ignored."),
14291 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14292 DWARF attribute."),
14293 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14295 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14296 NULL
, xcalloc
, xfree
);
14298 /* The ada-lang observers. */
14299 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14300 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14301 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);