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 (struct obstack
*,
104 const struct block
*,
105 const lookup_name_info
&lookup_name
,
106 domain_enum
, struct objfile
*);
108 static void ada_add_all_symbols (struct obstack
*, const struct block
*,
109 const lookup_name_info
&lookup_name
,
110 domain_enum
, int, int *);
112 static int is_nonfunction (struct block_symbol
*, int);
114 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
115 const struct block
*);
117 static int num_defns_collected (struct obstack
*);
119 static struct block_symbol
*defns_collected (struct obstack
*, int);
121 static struct value
*resolve_subexp (expression_up
*, int *, int,
123 innermost_block_tracker
*);
125 static void replace_operator_with_call (expression_up
*, int, int, int,
126 struct symbol
*, const struct block
*);
128 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
130 static const char *ada_decoded_op_name (enum exp_opcode
);
132 static int numeric_type_p (struct type
*);
134 static int integer_type_p (struct type
*);
136 static int scalar_type_p (struct type
*);
138 static int discrete_type_p (struct type
*);
140 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
143 static struct value
*evaluate_subexp_type (struct expression
*, int *);
145 static struct type
*ada_find_parallel_type_with_name (struct type
*,
148 static int is_dynamic_field (struct type
*, int);
150 static struct type
*to_fixed_variant_branch_type (struct type
*,
152 CORE_ADDR
, struct value
*);
154 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
156 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
158 static struct type
*to_static_fixed_type (struct type
*);
159 static struct type
*static_unwrap_type (struct type
*type
);
161 static struct value
*unwrap_value (struct value
*);
163 static struct type
*constrained_packed_array_type (struct type
*, long *);
165 static struct type
*decode_constrained_packed_array_type (struct type
*);
167 static long decode_packed_array_bitsize (struct type
*);
169 static struct value
*decode_constrained_packed_array (struct value
*);
171 static int ada_is_unconstrained_packed_array_type (struct type
*);
173 static struct value
*value_subscript_packed (struct value
*, int,
176 static struct value
*coerce_unspec_val_to_type (struct value
*,
179 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
181 static int equiv_types (struct type
*, struct type
*);
183 static int is_name_suffix (const char *);
185 static int advance_wild_match (const char **, const char *, char);
187 static bool wild_match (const char *name
, const char *patn
);
189 static struct value
*ada_coerce_ref (struct value
*);
191 static LONGEST
pos_atr (struct value
*);
193 static struct value
*value_pos_atr (struct type
*, struct value
*);
195 static struct value
*val_atr (struct type
*, LONGEST
);
197 static struct value
*value_val_atr (struct type
*, struct value
*);
199 static struct symbol
*standard_lookup (const char *, const struct block
*,
202 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
205 static int find_struct_field (const char *, struct type
*, int,
206 struct type
**, int *, int *, int *, int *);
208 static int ada_resolve_function (struct block_symbol
*, int,
209 struct value
**, int, const char *,
212 static int ada_is_direct_array_type (struct type
*);
214 static struct value
*ada_index_struct_field (int, struct value
*, int,
217 static struct value
*assign_aggregate (struct value
*, struct value
*,
221 static void aggregate_assign_from_choices (struct value
*, struct value
*,
223 int *, std::vector
<LONGEST
> &,
226 static void aggregate_assign_positional (struct value
*, struct value
*,
228 int *, std::vector
<LONGEST
> &,
232 static void aggregate_assign_others (struct value
*, struct value
*,
234 int *, std::vector
<LONGEST
> &,
238 static void add_component_interval (LONGEST
, LONGEST
, std::vector
<LONGEST
> &);
241 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
244 static void ada_forward_operator_length (struct expression
*, int, int *,
247 static struct type
*ada_find_any_type (const char *name
);
249 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
250 (const lookup_name_info
&lookup_name
);
254 /* The result of a symbol lookup to be stored in our symbol cache. */
258 /* The name used to perform the lookup. */
260 /* The namespace used during the lookup. */
262 /* The symbol returned by the lookup, or NULL if no matching symbol
265 /* The block where the symbol was found, or NULL if no matching
267 const struct block
*block
;
268 /* A pointer to the next entry with the same hash. */
269 struct cache_entry
*next
;
272 /* The Ada symbol cache, used to store the result of Ada-mode symbol
273 lookups in the course of executing the user's commands.
275 The cache is implemented using a simple, fixed-sized hash.
276 The size is fixed on the grounds that there are not likely to be
277 all that many symbols looked up during any given session, regardless
278 of the size of the symbol table. If we decide to go to a resizable
279 table, let's just use the stuff from libiberty instead. */
281 #define HASH_SIZE 1009
283 struct ada_symbol_cache
285 /* An obstack used to store the entries in our cache. */
286 struct auto_obstack cache_space
;
288 /* The root of the hash table used to implement our symbol cache. */
289 struct cache_entry
*root
[HASH_SIZE
] {};
292 /* Maximum-sized dynamic type. */
293 static unsigned int varsize_limit
;
295 static const char ada_completer_word_break_characters
[] =
297 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
299 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
302 /* The name of the symbol to use to get the name of the main subprogram. */
303 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
304 = "__gnat_ada_main_program_name";
306 /* Limit on the number of warnings to raise per expression evaluation. */
307 static int warning_limit
= 2;
309 /* Number of warning messages issued; reset to 0 by cleanups after
310 expression evaluation. */
311 static int warnings_issued
= 0;
313 static const char * const known_runtime_file_name_patterns
[] = {
314 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
317 static const char * const known_auxiliary_function_name_patterns
[] = {
318 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
321 /* Maintenance-related settings for this module. */
323 static struct cmd_list_element
*maint_set_ada_cmdlist
;
324 static struct cmd_list_element
*maint_show_ada_cmdlist
;
326 /* The "maintenance ada set/show ignore-descriptive-type" value. */
328 static bool ada_ignore_descriptive_types_p
= false;
330 /* Inferior-specific data. */
332 /* Per-inferior data for this module. */
334 struct ada_inferior_data
336 /* The ada__tags__type_specific_data type, which is used when decoding
337 tagged types. With older versions of GNAT, this type was directly
338 accessible through a component ("tsd") in the object tag. But this
339 is no longer the case, so we cache it for each inferior. */
340 struct type
*tsd_type
= nullptr;
342 /* The exception_support_info data. This data is used to determine
343 how to implement support for Ada exception catchpoints in a given
345 const struct exception_support_info
*exception_info
= nullptr;
348 /* Our key to this module's inferior data. */
349 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
351 /* Return our inferior data for the given inferior (INF).
353 This function always returns a valid pointer to an allocated
354 ada_inferior_data structure. If INF's inferior data has not
355 been previously set, this functions creates a new one with all
356 fields set to zero, sets INF's inferior to it, and then returns
357 a pointer to that newly allocated ada_inferior_data. */
359 static struct ada_inferior_data
*
360 get_ada_inferior_data (struct inferior
*inf
)
362 struct ada_inferior_data
*data
;
364 data
= ada_inferior_data
.get (inf
);
366 data
= ada_inferior_data
.emplace (inf
);
371 /* Perform all necessary cleanups regarding our module's inferior data
372 that is required after the inferior INF just exited. */
375 ada_inferior_exit (struct inferior
*inf
)
377 ada_inferior_data
.clear (inf
);
381 /* program-space-specific data. */
383 /* This module's per-program-space data. */
384 struct ada_pspace_data
386 /* The Ada symbol cache. */
387 std::unique_ptr
<ada_symbol_cache
> sym_cache
;
390 /* Key to our per-program-space data. */
391 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
393 /* Return this module's data for the given program space (PSPACE).
394 If not is found, add a zero'ed one now.
396 This function always returns a valid object. */
398 static struct ada_pspace_data
*
399 get_ada_pspace_data (struct program_space
*pspace
)
401 struct ada_pspace_data
*data
;
403 data
= ada_pspace_data_handle
.get (pspace
);
405 data
= ada_pspace_data_handle
.emplace (pspace
);
412 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
413 all typedef layers have been peeled. Otherwise, return TYPE.
415 Normally, we really expect a typedef type to only have 1 typedef layer.
416 In other words, we really expect the target type of a typedef type to be
417 a non-typedef type. This is particularly true for Ada units, because
418 the language does not have a typedef vs not-typedef distinction.
419 In that respect, the Ada compiler has been trying to eliminate as many
420 typedef definitions in the debugging information, since they generally
421 do not bring any extra information (we still use typedef under certain
422 circumstances related mostly to the GNAT encoding).
424 Unfortunately, we have seen situations where the debugging information
425 generated by the compiler leads to such multiple typedef layers. For
426 instance, consider the following example with stabs:
428 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
429 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
431 This is an error in the debugging information which causes type
432 pck__float_array___XUP to be defined twice, and the second time,
433 it is defined as a typedef of a typedef.
435 This is on the fringe of legality as far as debugging information is
436 concerned, and certainly unexpected. But it is easy to handle these
437 situations correctly, so we can afford to be lenient in this case. */
440 ada_typedef_target_type (struct type
*type
)
442 while (type
->code () == TYPE_CODE_TYPEDEF
)
443 type
= TYPE_TARGET_TYPE (type
);
447 /* Given DECODED_NAME a string holding a symbol name in its
448 decoded form (ie using the Ada dotted notation), returns
449 its unqualified name. */
452 ada_unqualified_name (const char *decoded_name
)
456 /* If the decoded name starts with '<', it means that the encoded
457 name does not follow standard naming conventions, and thus that
458 it is not your typical Ada symbol name. Trying to unqualify it
459 is therefore pointless and possibly erroneous. */
460 if (decoded_name
[0] == '<')
463 result
= strrchr (decoded_name
, '.');
465 result
++; /* Skip the dot... */
467 result
= decoded_name
;
472 /* Return a string starting with '<', followed by STR, and '>'. */
475 add_angle_brackets (const char *str
)
477 return string_printf ("<%s>", str
);
480 /* Assuming V points to an array of S objects, make sure that it contains at
481 least M objects, updating V and S as necessary. */
483 #define GROW_VECT(v, s, m) \
484 if ((s) < (m)) (v) = (char *) grow_vect (v, &(s), m, sizeof *(v));
486 /* Assuming VECT points to an array of *SIZE objects of size
487 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
488 updating *SIZE as necessary and returning the (new) array. */
491 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
493 if (*size
< min_size
)
496 if (*size
< min_size
)
498 vect
= xrealloc (vect
, *size
* element_size
);
503 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
504 suffix of FIELD_NAME beginning "___". */
507 field_name_match (const char *field_name
, const char *target
)
509 int len
= strlen (target
);
512 (strncmp (field_name
, target
, len
) == 0
513 && (field_name
[len
] == '\0'
514 || (startswith (field_name
+ len
, "___")
515 && strcmp (field_name
+ strlen (field_name
) - 6,
520 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
521 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
522 and return its index. This function also handles fields whose name
523 have ___ suffixes because the compiler sometimes alters their name
524 by adding such a suffix to represent fields with certain constraints.
525 If the field could not be found, return a negative number if
526 MAYBE_MISSING is set. Otherwise raise an error. */
529 ada_get_field_index (const struct type
*type
, const char *field_name
,
533 struct type
*struct_type
= check_typedef ((struct type
*) type
);
535 for (fieldno
= 0; fieldno
< struct_type
->num_fields (); fieldno
++)
536 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
540 error (_("Unable to find field %s in struct %s. Aborting"),
541 field_name
, struct_type
->name ());
546 /* The length of the prefix of NAME prior to any "___" suffix. */
549 ada_name_prefix_len (const char *name
)
555 const char *p
= strstr (name
, "___");
558 return strlen (name
);
564 /* Return non-zero if SUFFIX is a suffix of STR.
565 Return zero if STR is null. */
568 is_suffix (const char *str
, const char *suffix
)
575 len2
= strlen (suffix
);
576 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
579 /* The contents of value VAL, treated as a value of type TYPE. The
580 result is an lval in memory if VAL is. */
582 static struct value
*
583 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
585 type
= ada_check_typedef (type
);
586 if (value_type (val
) == type
)
590 struct value
*result
;
592 /* Make sure that the object size is not unreasonable before
593 trying to allocate some memory for it. */
594 ada_ensure_varsize_limit (type
);
596 if (value_optimized_out (val
))
597 result
= allocate_optimized_out_value (type
);
598 else if (value_lazy (val
)
599 /* Be careful not to make a lazy not_lval value. */
600 || (VALUE_LVAL (val
) != not_lval
601 && TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
))))
602 result
= allocate_value_lazy (type
);
605 result
= allocate_value (type
);
606 value_contents_copy (result
, 0, val
, 0, TYPE_LENGTH (type
));
608 set_value_component_location (result
, val
);
609 set_value_bitsize (result
, value_bitsize (val
));
610 set_value_bitpos (result
, value_bitpos (val
));
611 if (VALUE_LVAL (result
) == lval_memory
)
612 set_value_address (result
, value_address (val
));
617 static const gdb_byte
*
618 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
623 return valaddr
+ offset
;
627 cond_offset_target (CORE_ADDR address
, long offset
)
632 return address
+ offset
;
635 /* Issue a warning (as for the definition of warning in utils.c, but
636 with exactly one argument rather than ...), unless the limit on the
637 number of warnings has passed during the evaluation of the current
640 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
641 provided by "complaint". */
642 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
645 lim_warning (const char *format
, ...)
649 va_start (args
, format
);
650 warnings_issued
+= 1;
651 if (warnings_issued
<= warning_limit
)
652 vwarning (format
, args
);
657 /* Issue an error if the size of an object of type T is unreasonable,
658 i.e. if it would be a bad idea to allocate a value of this type in
662 ada_ensure_varsize_limit (const struct type
*type
)
664 if (TYPE_LENGTH (type
) > varsize_limit
)
665 error (_("object size is larger than varsize-limit"));
668 /* Maximum value of a SIZE-byte signed integer type. */
670 max_of_size (int size
)
672 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
674 return top_bit
| (top_bit
- 1);
677 /* Minimum value of a SIZE-byte signed integer type. */
679 min_of_size (int size
)
681 return -max_of_size (size
) - 1;
684 /* Maximum value of a SIZE-byte unsigned integer type. */
686 umax_of_size (int size
)
688 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
690 return top_bit
| (top_bit
- 1);
693 /* Maximum value of integral type T, as a signed quantity. */
695 max_of_type (struct type
*t
)
697 if (t
->is_unsigned ())
698 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
700 return max_of_size (TYPE_LENGTH (t
));
703 /* Minimum value of integral type T, as a signed quantity. */
705 min_of_type (struct type
*t
)
707 if (t
->is_unsigned ())
710 return min_of_size (TYPE_LENGTH (t
));
713 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
715 ada_discrete_type_high_bound (struct type
*type
)
717 type
= resolve_dynamic_type (type
, {}, 0);
718 switch (type
->code ())
720 case TYPE_CODE_RANGE
:
722 const dynamic_prop
&high
= type
->bounds ()->high
;
724 if (high
.kind () == PROP_CONST
)
725 return high
.const_val ();
728 gdb_assert (high
.kind () == PROP_UNDEFINED
);
730 /* This happens when trying to evaluate a type's dynamic bound
731 without a live target. There is nothing relevant for us to
732 return here, so return 0. */
737 return TYPE_FIELD_ENUMVAL (type
, type
->num_fields () - 1);
742 return max_of_type (type
);
744 error (_("Unexpected type in ada_discrete_type_high_bound."));
748 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
750 ada_discrete_type_low_bound (struct type
*type
)
752 type
= resolve_dynamic_type (type
, {}, 0);
753 switch (type
->code ())
755 case TYPE_CODE_RANGE
:
757 const dynamic_prop
&low
= type
->bounds ()->low
;
759 if (low
.kind () == PROP_CONST
)
760 return low
.const_val ();
763 gdb_assert (low
.kind () == PROP_UNDEFINED
);
765 /* This happens when trying to evaluate a type's dynamic bound
766 without a live target. There is nothing relevant for us to
767 return here, so return 0. */
772 return TYPE_FIELD_ENUMVAL (type
, 0);
777 return min_of_type (type
);
779 error (_("Unexpected type in ada_discrete_type_low_bound."));
783 /* The identity on non-range types. For range types, the underlying
784 non-range scalar type. */
787 get_base_type (struct type
*type
)
789 while (type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
)
791 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
793 type
= TYPE_TARGET_TYPE (type
);
798 /* Return a decoded version of the given VALUE. This means returning
799 a value whose type is obtained by applying all the GNAT-specific
800 encodings, making the resulting type a static but standard description
801 of the initial type. */
804 ada_get_decoded_value (struct value
*value
)
806 struct type
*type
= ada_check_typedef (value_type (value
));
808 if (ada_is_array_descriptor_type (type
)
809 || (ada_is_constrained_packed_array_type (type
)
810 && type
->code () != TYPE_CODE_PTR
))
812 if (type
->code () == TYPE_CODE_TYPEDEF
) /* array access type. */
813 value
= ada_coerce_to_simple_array_ptr (value
);
815 value
= ada_coerce_to_simple_array (value
);
818 value
= ada_to_fixed_value (value
);
823 /* Same as ada_get_decoded_value, but with the given TYPE.
824 Because there is no associated actual value for this type,
825 the resulting type might be a best-effort approximation in
826 the case of dynamic types. */
829 ada_get_decoded_type (struct type
*type
)
831 type
= to_static_fixed_type (type
);
832 if (ada_is_constrained_packed_array_type (type
))
833 type
= ada_coerce_to_simple_array_type (type
);
839 /* Language Selection */
841 /* If the main program is in Ada, return language_ada, otherwise return LANG
842 (the main program is in Ada iif the adainit symbol is found). */
845 ada_update_initial_language (enum language lang
)
847 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
853 /* If the main procedure is written in Ada, then return its name.
854 The result is good until the next call. Return NULL if the main
855 procedure doesn't appear to be in Ada. */
860 struct bound_minimal_symbol msym
;
861 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
863 /* For Ada, the name of the main procedure is stored in a specific
864 string constant, generated by the binder. Look for that symbol,
865 extract its address, and then read that string. If we didn't find
866 that string, then most probably the main procedure is not written
868 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
870 if (msym
.minsym
!= NULL
)
872 CORE_ADDR main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
873 if (main_program_name_addr
== 0)
874 error (_("Invalid address for Ada main program name."));
876 main_program_name
= target_read_string (main_program_name_addr
, 1024);
877 return main_program_name
.get ();
880 /* The main procedure doesn't seem to be in Ada. */
886 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
889 const struct ada_opname_map ada_opname_table
[] = {
890 {"Oadd", "\"+\"", BINOP_ADD
},
891 {"Osubtract", "\"-\"", BINOP_SUB
},
892 {"Omultiply", "\"*\"", BINOP_MUL
},
893 {"Odivide", "\"/\"", BINOP_DIV
},
894 {"Omod", "\"mod\"", BINOP_MOD
},
895 {"Orem", "\"rem\"", BINOP_REM
},
896 {"Oexpon", "\"**\"", BINOP_EXP
},
897 {"Olt", "\"<\"", BINOP_LESS
},
898 {"Ole", "\"<=\"", BINOP_LEQ
},
899 {"Ogt", "\">\"", BINOP_GTR
},
900 {"Oge", "\">=\"", BINOP_GEQ
},
901 {"Oeq", "\"=\"", BINOP_EQUAL
},
902 {"One", "\"/=\"", BINOP_NOTEQUAL
},
903 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
904 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
905 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
906 {"Oconcat", "\"&\"", BINOP_CONCAT
},
907 {"Oabs", "\"abs\"", UNOP_ABS
},
908 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
909 {"Oadd", "\"+\"", UNOP_PLUS
},
910 {"Osubtract", "\"-\"", UNOP_NEG
},
914 /* The "encoded" form of DECODED, according to GNAT conventions. If
915 THROW_ERRORS, throw an error if invalid operator name is found.
916 Otherwise, return the empty string in that case. */
919 ada_encode_1 (const char *decoded
, bool throw_errors
)
924 std::string encoding_buffer
;
925 for (const char *p
= decoded
; *p
!= '\0'; p
+= 1)
928 encoding_buffer
.append ("__");
931 const struct ada_opname_map
*mapping
;
933 for (mapping
= ada_opname_table
;
934 mapping
->encoded
!= NULL
935 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
937 if (mapping
->encoded
== NULL
)
940 error (_("invalid Ada operator name: %s"), p
);
944 encoding_buffer
.append (mapping
->encoded
);
948 encoding_buffer
.push_back (*p
);
951 return encoding_buffer
;
954 /* The "encoded" form of DECODED, according to GNAT conventions. */
957 ada_encode (const char *decoded
)
959 return ada_encode_1 (decoded
, true);
962 /* Return NAME folded to lower case, or, if surrounded by single
963 quotes, unfolded, but with the quotes stripped away. Result good
967 ada_fold_name (gdb::string_view name
)
969 static char *fold_buffer
= NULL
;
970 static size_t fold_buffer_size
= 0;
972 int len
= name
.size ();
973 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
975 if (!name
.empty () && name
[0] == '\'')
977 strncpy (fold_buffer
, name
.data () + 1, len
- 2);
978 fold_buffer
[len
- 2] = '\000';
984 for (i
= 0; i
< len
; i
+= 1)
985 fold_buffer
[i
] = tolower (name
[i
]);
986 fold_buffer
[i
] = '\0';
992 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
995 is_lower_alphanum (const char c
)
997 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1000 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1001 This function saves in LEN the length of that same symbol name but
1002 without either of these suffixes:
1008 These are suffixes introduced by the compiler for entities such as
1009 nested subprogram for instance, in order to avoid name clashes.
1010 They do not serve any purpose for the debugger. */
1013 ada_remove_trailing_digits (const char *encoded
, int *len
)
1015 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1019 while (i
> 0 && isdigit (encoded
[i
]))
1021 if (i
>= 0 && encoded
[i
] == '.')
1023 else if (i
>= 0 && encoded
[i
] == '$')
1025 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1027 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1032 /* Remove the suffix introduced by the compiler for protected object
1036 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1038 /* Remove trailing N. */
1040 /* Protected entry subprograms are broken into two
1041 separate subprograms: The first one is unprotected, and has
1042 a 'N' suffix; the second is the protected version, and has
1043 the 'P' suffix. The second calls the first one after handling
1044 the protection. Since the P subprograms are internally generated,
1045 we leave these names undecoded, giving the user a clue that this
1046 entity is internal. */
1049 && encoded
[*len
- 1] == 'N'
1050 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1054 /* If ENCODED follows the GNAT entity encoding conventions, then return
1055 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1056 replaced by ENCODED. */
1059 ada_decode (const char *encoded
)
1065 std::string decoded
;
1067 /* With function descriptors on PPC64, the value of a symbol named
1068 ".FN", if it exists, is the entry point of the function "FN". */
1069 if (encoded
[0] == '.')
1072 /* The name of the Ada main procedure starts with "_ada_".
1073 This prefix is not part of the decoded name, so skip this part
1074 if we see this prefix. */
1075 if (startswith (encoded
, "_ada_"))
1078 /* If the name starts with '_', then it is not a properly encoded
1079 name, so do not attempt to decode it. Similarly, if the name
1080 starts with '<', the name should not be decoded. */
1081 if (encoded
[0] == '_' || encoded
[0] == '<')
1084 len0
= strlen (encoded
);
1086 ada_remove_trailing_digits (encoded
, &len0
);
1087 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1089 /* Remove the ___X.* suffix if present. Do not forget to verify that
1090 the suffix is located before the current "end" of ENCODED. We want
1091 to avoid re-matching parts of ENCODED that have previously been
1092 marked as discarded (by decrementing LEN0). */
1093 p
= strstr (encoded
, "___");
1094 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1102 /* Remove any trailing TKB suffix. It tells us that this symbol
1103 is for the body of a task, but that information does not actually
1104 appear in the decoded name. */
1106 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1109 /* Remove any trailing TB suffix. The TB suffix is slightly different
1110 from the TKB suffix because it is used for non-anonymous task
1113 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1116 /* Remove trailing "B" suffixes. */
1117 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1119 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1122 /* Make decoded big enough for possible expansion by operator name. */
1124 decoded
.resize (2 * len0
+ 1, 'X');
1126 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1128 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1131 while ((i
>= 0 && isdigit (encoded
[i
]))
1132 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1134 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1136 else if (encoded
[i
] == '$')
1140 /* The first few characters that are not alphabetic are not part
1141 of any encoding we use, so we can copy them over verbatim. */
1143 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1144 decoded
[j
] = encoded
[i
];
1149 /* Is this a symbol function? */
1150 if (at_start_name
&& encoded
[i
] == 'O')
1154 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1156 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1157 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1159 && !isalnum (encoded
[i
+ op_len
]))
1161 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1164 j
+= strlen (ada_opname_table
[k
].decoded
);
1168 if (ada_opname_table
[k
].encoded
!= NULL
)
1173 /* Replace "TK__" with "__", which will eventually be translated
1174 into "." (just below). */
1176 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1179 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1180 be translated into "." (just below). These are internal names
1181 generated for anonymous blocks inside which our symbol is nested. */
1183 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1184 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1185 && isdigit (encoded
[i
+4]))
1189 while (k
< len0
&& isdigit (encoded
[k
]))
1190 k
++; /* Skip any extra digit. */
1192 /* Double-check that the "__B_{DIGITS}+" sequence we found
1193 is indeed followed by "__". */
1194 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1198 /* Remove _E{DIGITS}+[sb] */
1200 /* Just as for protected object subprograms, there are 2 categories
1201 of subprograms created by the compiler for each entry. The first
1202 one implements the actual entry code, and has a suffix following
1203 the convention above; the second one implements the barrier and
1204 uses the same convention as above, except that the 'E' is replaced
1207 Just as above, we do not decode the name of barrier functions
1208 to give the user a clue that the code he is debugging has been
1209 internally generated. */
1211 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1212 && isdigit (encoded
[i
+2]))
1216 while (k
< len0
&& isdigit (encoded
[k
]))
1220 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1223 /* Just as an extra precaution, make sure that if this
1224 suffix is followed by anything else, it is a '_'.
1225 Otherwise, we matched this sequence by accident. */
1227 || (k
< len0
&& encoded
[k
] == '_'))
1232 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1233 the GNAT front-end in protected object subprograms. */
1236 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1238 /* Backtrack a bit up until we reach either the begining of
1239 the encoded name, or "__". Make sure that we only find
1240 digits or lowercase characters. */
1241 const char *ptr
= encoded
+ i
- 1;
1243 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1246 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1250 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1252 /* This is a X[bn]* sequence not separated from the previous
1253 part of the name with a non-alpha-numeric character (in other
1254 words, immediately following an alpha-numeric character), then
1255 verify that it is placed at the end of the encoded name. If
1256 not, then the encoding is not valid and we should abort the
1257 decoding. Otherwise, just skip it, it is used in body-nested
1261 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1265 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1267 /* Replace '__' by '.'. */
1275 /* It's a character part of the decoded name, so just copy it
1277 decoded
[j
] = encoded
[i
];
1284 /* Decoded names should never contain any uppercase character.
1285 Double-check this, and abort the decoding if we find one. */
1287 for (i
= 0; i
< decoded
.length(); ++i
)
1288 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1294 if (encoded
[0] == '<')
1297 decoded
= '<' + std::string(encoded
) + '>';
1302 /* Table for keeping permanent unique copies of decoded names. Once
1303 allocated, names in this table are never released. While this is a
1304 storage leak, it should not be significant unless there are massive
1305 changes in the set of decoded names in successive versions of a
1306 symbol table loaded during a single session. */
1307 static struct htab
*decoded_names_store
;
1309 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1310 in the language-specific part of GSYMBOL, if it has not been
1311 previously computed. Tries to save the decoded name in the same
1312 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1313 in any case, the decoded symbol has a lifetime at least that of
1315 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1316 const, but nevertheless modified to a semantically equivalent form
1317 when a decoded name is cached in it. */
1320 ada_decode_symbol (const struct general_symbol_info
*arg
)
1322 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1323 const char **resultp
=
1324 &gsymbol
->language_specific
.demangled_name
;
1326 if (!gsymbol
->ada_mangled
)
1328 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1329 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1331 gsymbol
->ada_mangled
= 1;
1333 if (obstack
!= NULL
)
1334 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1337 /* Sometimes, we can't find a corresponding objfile, in
1338 which case, we put the result on the heap. Since we only
1339 decode when needed, we hope this usually does not cause a
1340 significant memory leak (FIXME). */
1342 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1343 decoded
.c_str (), INSERT
);
1346 *slot
= xstrdup (decoded
.c_str ());
1355 ada_la_decode (const char *encoded
, int options
)
1357 return xstrdup (ada_decode (encoded
).c_str ());
1364 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1365 generated by the GNAT compiler to describe the index type used
1366 for each dimension of an array, check whether it follows the latest
1367 known encoding. If not, fix it up to conform to the latest encoding.
1368 Otherwise, do nothing. This function also does nothing if
1369 INDEX_DESC_TYPE is NULL.
1371 The GNAT encoding used to describe the array index type evolved a bit.
1372 Initially, the information would be provided through the name of each
1373 field of the structure type only, while the type of these fields was
1374 described as unspecified and irrelevant. The debugger was then expected
1375 to perform a global type lookup using the name of that field in order
1376 to get access to the full index type description. Because these global
1377 lookups can be very expensive, the encoding was later enhanced to make
1378 the global lookup unnecessary by defining the field type as being
1379 the full index type description.
1381 The purpose of this routine is to allow us to support older versions
1382 of the compiler by detecting the use of the older encoding, and by
1383 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1384 we essentially replace each field's meaningless type by the associated
1388 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1392 if (index_desc_type
== NULL
)
1394 gdb_assert (index_desc_type
->num_fields () > 0);
1396 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1397 to check one field only, no need to check them all). If not, return
1400 If our INDEX_DESC_TYPE was generated using the older encoding,
1401 the field type should be a meaningless integer type whose name
1402 is not equal to the field name. */
1403 if (index_desc_type
->field (0).type ()->name () != NULL
1404 && strcmp (index_desc_type
->field (0).type ()->name (),
1405 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1408 /* Fixup each field of INDEX_DESC_TYPE. */
1409 for (i
= 0; i
< index_desc_type
->num_fields (); i
++)
1411 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1412 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1415 index_desc_type
->field (i
).set_type (raw_type
);
1419 /* The desc_* routines return primitive portions of array descriptors
1422 /* The descriptor or array type, if any, indicated by TYPE; removes
1423 level of indirection, if needed. */
1425 static struct type
*
1426 desc_base_type (struct type
*type
)
1430 type
= ada_check_typedef (type
);
1431 if (type
->code () == TYPE_CODE_TYPEDEF
)
1432 type
= ada_typedef_target_type (type
);
1435 && (type
->code () == TYPE_CODE_PTR
1436 || type
->code () == TYPE_CODE_REF
))
1437 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1442 /* True iff TYPE indicates a "thin" array pointer type. */
1445 is_thin_pntr (struct type
*type
)
1448 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1449 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1452 /* The descriptor type for thin pointer type TYPE. */
1454 static struct type
*
1455 thin_descriptor_type (struct type
*type
)
1457 struct type
*base_type
= desc_base_type (type
);
1459 if (base_type
== NULL
)
1461 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1465 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1467 if (alt_type
== NULL
)
1474 /* A pointer to the array data for thin-pointer value VAL. */
1476 static struct value
*
1477 thin_data_pntr (struct value
*val
)
1479 struct type
*type
= ada_check_typedef (value_type (val
));
1480 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1482 data_type
= lookup_pointer_type (data_type
);
1484 if (type
->code () == TYPE_CODE_PTR
)
1485 return value_cast (data_type
, value_copy (val
));
1487 return value_from_longest (data_type
, value_address (val
));
1490 /* True iff TYPE indicates a "thick" array pointer type. */
1493 is_thick_pntr (struct type
*type
)
1495 type
= desc_base_type (type
);
1496 return (type
!= NULL
&& type
->code () == TYPE_CODE_STRUCT
1497 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1500 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1501 pointer to one, the type of its bounds data; otherwise, NULL. */
1503 static struct type
*
1504 desc_bounds_type (struct type
*type
)
1508 type
= desc_base_type (type
);
1512 else if (is_thin_pntr (type
))
1514 type
= thin_descriptor_type (type
);
1517 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1519 return ada_check_typedef (r
);
1521 else if (type
->code () == TYPE_CODE_STRUCT
)
1523 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1525 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1530 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1531 one, a pointer to its bounds data. Otherwise NULL. */
1533 static struct value
*
1534 desc_bounds (struct value
*arr
)
1536 struct type
*type
= ada_check_typedef (value_type (arr
));
1538 if (is_thin_pntr (type
))
1540 struct type
*bounds_type
=
1541 desc_bounds_type (thin_descriptor_type (type
));
1544 if (bounds_type
== NULL
)
1545 error (_("Bad GNAT array descriptor"));
1547 /* NOTE: The following calculation is not really kosher, but
1548 since desc_type is an XVE-encoded type (and shouldn't be),
1549 the correct calculation is a real pain. FIXME (and fix GCC). */
1550 if (type
->code () == TYPE_CODE_PTR
)
1551 addr
= value_as_long (arr
);
1553 addr
= value_address (arr
);
1556 value_from_longest (lookup_pointer_type (bounds_type
),
1557 addr
- TYPE_LENGTH (bounds_type
));
1560 else if (is_thick_pntr (type
))
1562 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1563 _("Bad GNAT array descriptor"));
1564 struct type
*p_bounds_type
= value_type (p_bounds
);
1567 && p_bounds_type
->code () == TYPE_CODE_PTR
)
1569 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1571 if (target_type
->is_stub ())
1572 p_bounds
= value_cast (lookup_pointer_type
1573 (ada_check_typedef (target_type
)),
1577 error (_("Bad GNAT array descriptor"));
1585 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1586 position of the field containing the address of the bounds data. */
1589 fat_pntr_bounds_bitpos (struct type
*type
)
1591 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1594 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1595 size of the field containing the address of the bounds data. */
1598 fat_pntr_bounds_bitsize (struct type
*type
)
1600 type
= desc_base_type (type
);
1602 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1603 return TYPE_FIELD_BITSIZE (type
, 1);
1605 return 8 * TYPE_LENGTH (ada_check_typedef (type
->field (1).type ()));
1608 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1609 pointer to one, the type of its array data (a array-with-no-bounds type);
1610 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1613 static struct type
*
1614 desc_data_target_type (struct type
*type
)
1616 type
= desc_base_type (type
);
1618 /* NOTE: The following is bogus; see comment in desc_bounds. */
1619 if (is_thin_pntr (type
))
1620 return desc_base_type (thin_descriptor_type (type
)->field (1).type ());
1621 else if (is_thick_pntr (type
))
1623 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1626 && ada_check_typedef (data_type
)->code () == TYPE_CODE_PTR
)
1627 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1633 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1636 static struct value
*
1637 desc_data (struct value
*arr
)
1639 struct type
*type
= value_type (arr
);
1641 if (is_thin_pntr (type
))
1642 return thin_data_pntr (arr
);
1643 else if (is_thick_pntr (type
))
1644 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1645 _("Bad GNAT array descriptor"));
1651 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1652 position of the field containing the address of the data. */
1655 fat_pntr_data_bitpos (struct type
*type
)
1657 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1660 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1661 size of the field containing the address of the data. */
1664 fat_pntr_data_bitsize (struct type
*type
)
1666 type
= desc_base_type (type
);
1668 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1669 return TYPE_FIELD_BITSIZE (type
, 0);
1671 return TARGET_CHAR_BIT
* TYPE_LENGTH (type
->field (0).type ());
1674 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1675 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1676 bound, if WHICH is 1. The first bound is I=1. */
1678 static struct value
*
1679 desc_one_bound (struct value
*bounds
, int i
, int which
)
1681 char bound_name
[20];
1682 xsnprintf (bound_name
, sizeof (bound_name
), "%cB%d",
1683 which
? 'U' : 'L', i
- 1);
1684 return value_struct_elt (&bounds
, NULL
, bound_name
, NULL
,
1685 _("Bad GNAT array descriptor bounds"));
1688 /* If BOUNDS is an array-bounds structure type, return the bit position
1689 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1690 bound, if WHICH is 1. The first bound is I=1. */
1693 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1695 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1698 /* If BOUNDS is an array-bounds structure type, return the bit field size
1699 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1700 bound, if WHICH is 1. The first bound is I=1. */
1703 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1705 type
= desc_base_type (type
);
1707 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1708 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1710 return 8 * TYPE_LENGTH (type
->field (2 * i
+ which
- 2).type ());
1713 /* If TYPE is the type of an array-bounds structure, the type of its
1714 Ith bound (numbering from 1). Otherwise, NULL. */
1716 static struct type
*
1717 desc_index_type (struct type
*type
, int i
)
1719 type
= desc_base_type (type
);
1721 if (type
->code () == TYPE_CODE_STRUCT
)
1723 char bound_name
[20];
1724 xsnprintf (bound_name
, sizeof (bound_name
), "LB%d", i
- 1);
1725 return lookup_struct_elt_type (type
, bound_name
, 1);
1731 /* The number of index positions in the array-bounds type TYPE.
1732 Return 0 if TYPE is NULL. */
1735 desc_arity (struct type
*type
)
1737 type
= desc_base_type (type
);
1740 return type
->num_fields () / 2;
1744 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1745 an array descriptor type (representing an unconstrained array
1749 ada_is_direct_array_type (struct type
*type
)
1753 type
= ada_check_typedef (type
);
1754 return (type
->code () == TYPE_CODE_ARRAY
1755 || ada_is_array_descriptor_type (type
));
1758 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1762 ada_is_array_type (struct type
*type
)
1765 && (type
->code () == TYPE_CODE_PTR
1766 || type
->code () == TYPE_CODE_REF
))
1767 type
= TYPE_TARGET_TYPE (type
);
1768 return ada_is_direct_array_type (type
);
1771 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1774 ada_is_simple_array_type (struct type
*type
)
1778 type
= ada_check_typedef (type
);
1779 return (type
->code () == TYPE_CODE_ARRAY
1780 || (type
->code () == TYPE_CODE_PTR
1781 && (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ()
1782 == TYPE_CODE_ARRAY
)));
1785 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1788 ada_is_array_descriptor_type (struct type
*type
)
1790 struct type
*data_type
= desc_data_target_type (type
);
1794 type
= ada_check_typedef (type
);
1795 return (data_type
!= NULL
1796 && data_type
->code () == TYPE_CODE_ARRAY
1797 && desc_arity (desc_bounds_type (type
)) > 0);
1800 /* Non-zero iff type is a partially mal-formed GNAT array
1801 descriptor. FIXME: This is to compensate for some problems with
1802 debugging output from GNAT. Re-examine periodically to see if it
1806 ada_is_bogus_array_descriptor (struct type
*type
)
1810 && type
->code () == TYPE_CODE_STRUCT
1811 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1812 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1813 && !ada_is_array_descriptor_type (type
);
1817 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1818 (fat pointer) returns the type of the array data described---specifically,
1819 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1820 in from the descriptor; otherwise, they are left unspecified. If
1821 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1822 returns NULL. The result is simply the type of ARR if ARR is not
1825 static struct type
*
1826 ada_type_of_array (struct value
*arr
, int bounds
)
1828 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1829 return decode_constrained_packed_array_type (value_type (arr
));
1831 if (!ada_is_array_descriptor_type (value_type (arr
)))
1832 return value_type (arr
);
1836 struct type
*array_type
=
1837 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1839 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1840 TYPE_FIELD_BITSIZE (array_type
, 0) =
1841 decode_packed_array_bitsize (value_type (arr
));
1847 struct type
*elt_type
;
1849 struct value
*descriptor
;
1851 elt_type
= ada_array_element_type (value_type (arr
), -1);
1852 arity
= ada_array_arity (value_type (arr
));
1854 if (elt_type
== NULL
|| arity
== 0)
1855 return ada_check_typedef (value_type (arr
));
1857 descriptor
= desc_bounds (arr
);
1858 if (value_as_long (descriptor
) == 0)
1862 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1863 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1864 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1865 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1868 create_static_range_type (range_type
, value_type (low
),
1869 longest_to_int (value_as_long (low
)),
1870 longest_to_int (value_as_long (high
)));
1871 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1873 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1875 /* We need to store the element packed bitsize, as well as
1876 recompute the array size, because it was previously
1877 computed based on the unpacked element size. */
1878 LONGEST lo
= value_as_long (low
);
1879 LONGEST hi
= value_as_long (high
);
1881 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1882 decode_packed_array_bitsize (value_type (arr
));
1883 /* If the array has no element, then the size is already
1884 zero, and does not need to be recomputed. */
1888 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1890 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1895 return lookup_pointer_type (elt_type
);
1899 /* If ARR does not represent an array, returns ARR unchanged.
1900 Otherwise, returns either a standard GDB array with bounds set
1901 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1902 GDB array. Returns NULL if ARR is a null fat pointer. */
1905 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1907 if (ada_is_array_descriptor_type (value_type (arr
)))
1909 struct type
*arrType
= ada_type_of_array (arr
, 1);
1911 if (arrType
== NULL
)
1913 return value_cast (arrType
, value_copy (desc_data (arr
)));
1915 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1916 return decode_constrained_packed_array (arr
);
1921 /* If ARR does not represent an array, returns ARR unchanged.
1922 Otherwise, returns a standard GDB array describing ARR (which may
1923 be ARR itself if it already is in the proper form). */
1926 ada_coerce_to_simple_array (struct value
*arr
)
1928 if (ada_is_array_descriptor_type (value_type (arr
)))
1930 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1933 error (_("Bounds unavailable for null array pointer."));
1934 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
1935 return value_ind (arrVal
);
1937 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1938 return decode_constrained_packed_array (arr
);
1943 /* If TYPE represents a GNAT array type, return it translated to an
1944 ordinary GDB array type (possibly with BITSIZE fields indicating
1945 packing). For other types, is the identity. */
1948 ada_coerce_to_simple_array_type (struct type
*type
)
1950 if (ada_is_constrained_packed_array_type (type
))
1951 return decode_constrained_packed_array_type (type
);
1953 if (ada_is_array_descriptor_type (type
))
1954 return ada_check_typedef (desc_data_target_type (type
));
1959 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1962 ada_is_gnat_encoded_packed_array_type (struct type
*type
)
1966 type
= desc_base_type (type
);
1967 type
= ada_check_typedef (type
);
1969 ada_type_name (type
) != NULL
1970 && strstr (ada_type_name (type
), "___XP") != NULL
;
1973 /* Non-zero iff TYPE represents a standard GNAT constrained
1974 packed-array type. */
1977 ada_is_constrained_packed_array_type (struct type
*type
)
1979 return ada_is_gnat_encoded_packed_array_type (type
)
1980 && !ada_is_array_descriptor_type (type
);
1983 /* Non-zero iff TYPE represents an array descriptor for a
1984 unconstrained packed-array type. */
1987 ada_is_unconstrained_packed_array_type (struct type
*type
)
1989 if (!ada_is_array_descriptor_type (type
))
1992 if (ada_is_gnat_encoded_packed_array_type (type
))
1995 /* If we saw GNAT encodings, then the above code is sufficient.
1996 However, with minimal encodings, we will just have a thick
1998 if (is_thick_pntr (type
))
2000 type
= desc_base_type (type
);
2001 /* The structure's first field is a pointer to an array, so this
2002 fetches the array type. */
2003 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
2004 /* Now we can see if the array elements are packed. */
2005 return TYPE_FIELD_BITSIZE (type
, 0) > 0;
2011 /* Return true if TYPE is a (Gnat-encoded) constrained packed array
2012 type, or if it is an ordinary (non-Gnat-encoded) packed array. */
2015 ada_is_any_packed_array_type (struct type
*type
)
2017 return (ada_is_constrained_packed_array_type (type
)
2018 || (type
->code () == TYPE_CODE_ARRAY
2019 && TYPE_FIELD_BITSIZE (type
, 0) % 8 != 0));
2022 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2023 return the size of its elements in bits. */
2026 decode_packed_array_bitsize (struct type
*type
)
2028 const char *raw_name
;
2032 /* Access to arrays implemented as fat pointers are encoded as a typedef
2033 of the fat pointer type. We need the name of the fat pointer type
2034 to do the decoding, so strip the typedef layer. */
2035 if (type
->code () == TYPE_CODE_TYPEDEF
)
2036 type
= ada_typedef_target_type (type
);
2038 raw_name
= ada_type_name (ada_check_typedef (type
));
2040 raw_name
= ada_type_name (desc_base_type (type
));
2045 tail
= strstr (raw_name
, "___XP");
2046 if (tail
== nullptr)
2048 gdb_assert (is_thick_pntr (type
));
2049 /* The structure's first field is a pointer to an array, so this
2050 fetches the array type. */
2051 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
2052 /* Now we can see if the array elements are packed. */
2053 return TYPE_FIELD_BITSIZE (type
, 0);
2056 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2059 (_("could not understand bit size information on packed array"));
2066 /* Given that TYPE is a standard GDB array type with all bounds filled
2067 in, and that the element size of its ultimate scalar constituents
2068 (that is, either its elements, or, if it is an array of arrays, its
2069 elements' elements, etc.) is *ELT_BITS, return an identical type,
2070 but with the bit sizes of its elements (and those of any
2071 constituent arrays) recorded in the BITSIZE components of its
2072 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2075 Note that, for arrays whose index type has an XA encoding where
2076 a bound references a record discriminant, getting that discriminant,
2077 and therefore the actual value of that bound, is not possible
2078 because none of the given parameters gives us access to the record.
2079 This function assumes that it is OK in the context where it is being
2080 used to return an array whose bounds are still dynamic and where
2081 the length is arbitrary. */
2083 static struct type
*
2084 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2086 struct type
*new_elt_type
;
2087 struct type
*new_type
;
2088 struct type
*index_type_desc
;
2089 struct type
*index_type
;
2090 LONGEST low_bound
, high_bound
;
2092 type
= ada_check_typedef (type
);
2093 if (type
->code () != TYPE_CODE_ARRAY
)
2096 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2097 if (index_type_desc
)
2098 index_type
= to_fixed_range_type (index_type_desc
->field (0).type (),
2101 index_type
= type
->index_type ();
2103 new_type
= alloc_type_copy (type
);
2105 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2107 create_array_type (new_type
, new_elt_type
, index_type
);
2108 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2109 new_type
->set_name (ada_type_name (type
));
2111 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2112 && is_dynamic_type (check_typedef (index_type
)))
2113 || !get_discrete_bounds (index_type
, &low_bound
, &high_bound
))
2114 low_bound
= high_bound
= 0;
2115 if (high_bound
< low_bound
)
2116 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2119 *elt_bits
*= (high_bound
- low_bound
+ 1);
2120 TYPE_LENGTH (new_type
) =
2121 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2124 new_type
->set_is_fixed_instance (true);
2128 /* The array type encoded by TYPE, where
2129 ada_is_constrained_packed_array_type (TYPE). */
2131 static struct type
*
2132 decode_constrained_packed_array_type (struct type
*type
)
2134 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2137 struct type
*shadow_type
;
2141 raw_name
= ada_type_name (desc_base_type (type
));
2146 name
= (char *) alloca (strlen (raw_name
) + 1);
2147 tail
= strstr (raw_name
, "___XP");
2148 type
= desc_base_type (type
);
2150 memcpy (name
, raw_name
, tail
- raw_name
);
2151 name
[tail
- raw_name
] = '\000';
2153 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2155 if (shadow_type
== NULL
)
2157 lim_warning (_("could not find bounds information on packed array"));
2160 shadow_type
= check_typedef (shadow_type
);
2162 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2164 lim_warning (_("could not understand bounds "
2165 "information on packed array"));
2169 bits
= decode_packed_array_bitsize (type
);
2170 return constrained_packed_array_type (shadow_type
, &bits
);
2173 /* Helper function for decode_constrained_packed_array. Set the field
2174 bitsize on a series of packed arrays. Returns the number of
2175 elements in TYPE. */
2178 recursively_update_array_bitsize (struct type
*type
)
2180 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
2183 if (!get_discrete_bounds (type
->index_type (), &low
, &high
)
2186 LONGEST our_len
= high
- low
+ 1;
2188 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
2189 if (elt_type
->code () == TYPE_CODE_ARRAY
)
2191 LONGEST elt_len
= recursively_update_array_bitsize (elt_type
);
2192 LONGEST elt_bitsize
= elt_len
* TYPE_FIELD_BITSIZE (elt_type
, 0);
2193 TYPE_FIELD_BITSIZE (type
, 0) = elt_bitsize
;
2195 TYPE_LENGTH (type
) = ((our_len
* elt_bitsize
+ HOST_CHAR_BIT
- 1)
2202 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2203 array, returns a simple array that denotes that array. Its type is a
2204 standard GDB array type except that the BITSIZEs of the array
2205 target types are set to the number of bits in each element, and the
2206 type length is set appropriately. */
2208 static struct value
*
2209 decode_constrained_packed_array (struct value
*arr
)
2213 /* If our value is a pointer, then dereference it. Likewise if
2214 the value is a reference. Make sure that this operation does not
2215 cause the target type to be fixed, as this would indirectly cause
2216 this array to be decoded. The rest of the routine assumes that
2217 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2218 and "value_ind" routines to perform the dereferencing, as opposed
2219 to using "ada_coerce_ref" or "ada_value_ind". */
2220 arr
= coerce_ref (arr
);
2221 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2222 arr
= value_ind (arr
);
2224 type
= decode_constrained_packed_array_type (value_type (arr
));
2227 error (_("can't unpack array"));
2231 /* Decoding the packed array type could not correctly set the field
2232 bitsizes for any dimension except the innermost, because the
2233 bounds may be variable and were not passed to that function. So,
2234 we further resolve the array bounds here and then update the
2236 const gdb_byte
*valaddr
= value_contents_for_printing (arr
);
2237 CORE_ADDR address
= value_address (arr
);
2238 gdb::array_view
<const gdb_byte
> view
2239 = gdb::make_array_view (valaddr
, TYPE_LENGTH (type
));
2240 type
= resolve_dynamic_type (type
, view
, address
);
2241 recursively_update_array_bitsize (type
);
2243 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2244 && ada_is_modular_type (value_type (arr
)))
2246 /* This is a (right-justified) modular type representing a packed
2247 array with no wrapper. In order to interpret the value through
2248 the (left-justified) packed array type we just built, we must
2249 first left-justify it. */
2250 int bit_size
, bit_pos
;
2253 mod
= ada_modulus (value_type (arr
)) - 1;
2260 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2261 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2262 bit_pos
/ HOST_CHAR_BIT
,
2263 bit_pos
% HOST_CHAR_BIT
,
2268 return coerce_unspec_val_to_type (arr
, type
);
2272 /* The value of the element of packed array ARR at the ARITY indices
2273 given in IND. ARR must be a simple array. */
2275 static struct value
*
2276 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2279 int bits
, elt_off
, bit_off
;
2280 long elt_total_bit_offset
;
2281 struct type
*elt_type
;
2285 elt_total_bit_offset
= 0;
2286 elt_type
= ada_check_typedef (value_type (arr
));
2287 for (i
= 0; i
< arity
; i
+= 1)
2289 if (elt_type
->code () != TYPE_CODE_ARRAY
2290 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2292 (_("attempt to do packed indexing of "
2293 "something other than a packed array"));
2296 struct type
*range_type
= elt_type
->index_type ();
2297 LONGEST lowerbound
, upperbound
;
2300 if (!get_discrete_bounds (range_type
, &lowerbound
, &upperbound
))
2302 lim_warning (_("don't know bounds of array"));
2303 lowerbound
= upperbound
= 0;
2306 idx
= pos_atr (ind
[i
]);
2307 if (idx
< lowerbound
|| idx
> upperbound
)
2308 lim_warning (_("packed array index %ld out of bounds"),
2310 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2311 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2312 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2315 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2316 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2318 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2323 /* Non-zero iff TYPE includes negative integer values. */
2326 has_negatives (struct type
*type
)
2328 switch (type
->code ())
2333 return !type
->is_unsigned ();
2334 case TYPE_CODE_RANGE
:
2335 return type
->bounds ()->low
.const_val () - type
->bounds ()->bias
< 0;
2339 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2340 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2341 the unpacked buffer.
2343 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2344 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2346 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2349 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2351 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2354 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2355 gdb_byte
*unpacked
, int unpacked_len
,
2356 int is_big_endian
, int is_signed_type
,
2359 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2360 int src_idx
; /* Index into the source area */
2361 int src_bytes_left
; /* Number of source bytes left to process. */
2362 int srcBitsLeft
; /* Number of source bits left to move */
2363 int unusedLS
; /* Number of bits in next significant
2364 byte of source that are unused */
2366 int unpacked_idx
; /* Index into the unpacked buffer */
2367 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2369 unsigned long accum
; /* Staging area for bits being transferred */
2370 int accumSize
; /* Number of meaningful bits in accum */
2373 /* Transmit bytes from least to most significant; delta is the direction
2374 the indices move. */
2375 int delta
= is_big_endian
? -1 : 1;
2377 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2379 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2380 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2381 bit_size
, unpacked_len
);
2383 srcBitsLeft
= bit_size
;
2384 src_bytes_left
= src_len
;
2385 unpacked_bytes_left
= unpacked_len
;
2390 src_idx
= src_len
- 1;
2392 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2396 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2402 unpacked_idx
= unpacked_len
- 1;
2406 /* Non-scalar values must be aligned at a byte boundary... */
2408 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2409 /* ... And are placed at the beginning (most-significant) bytes
2411 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2412 unpacked_bytes_left
= unpacked_idx
+ 1;
2417 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2419 src_idx
= unpacked_idx
= 0;
2420 unusedLS
= bit_offset
;
2423 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2428 while (src_bytes_left
> 0)
2430 /* Mask for removing bits of the next source byte that are not
2431 part of the value. */
2432 unsigned int unusedMSMask
=
2433 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2435 /* Sign-extend bits for this byte. */
2436 unsigned int signMask
= sign
& ~unusedMSMask
;
2439 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2440 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2441 if (accumSize
>= HOST_CHAR_BIT
)
2443 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2444 accumSize
-= HOST_CHAR_BIT
;
2445 accum
>>= HOST_CHAR_BIT
;
2446 unpacked_bytes_left
-= 1;
2447 unpacked_idx
+= delta
;
2449 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2451 src_bytes_left
-= 1;
2454 while (unpacked_bytes_left
> 0)
2456 accum
|= sign
<< accumSize
;
2457 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2458 accumSize
-= HOST_CHAR_BIT
;
2461 accum
>>= HOST_CHAR_BIT
;
2462 unpacked_bytes_left
-= 1;
2463 unpacked_idx
+= delta
;
2467 /* Create a new value of type TYPE from the contents of OBJ starting
2468 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2469 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2470 assigning through the result will set the field fetched from.
2471 VALADDR is ignored unless OBJ is NULL, in which case,
2472 VALADDR+OFFSET must address the start of storage containing the
2473 packed value. The value returned in this case is never an lval.
2474 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2477 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2478 long offset
, int bit_offset
, int bit_size
,
2482 const gdb_byte
*src
; /* First byte containing data to unpack */
2484 const int is_scalar
= is_scalar_type (type
);
2485 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2486 gdb::byte_vector staging
;
2488 type
= ada_check_typedef (type
);
2491 src
= valaddr
+ offset
;
2493 src
= value_contents (obj
) + offset
;
2495 if (is_dynamic_type (type
))
2497 /* The length of TYPE might by dynamic, so we need to resolve
2498 TYPE in order to know its actual size, which we then use
2499 to create the contents buffer of the value we return.
2500 The difficulty is that the data containing our object is
2501 packed, and therefore maybe not at a byte boundary. So, what
2502 we do, is unpack the data into a byte-aligned buffer, and then
2503 use that buffer as our object's value for resolving the type. */
2504 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2505 staging
.resize (staging_len
);
2507 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2508 staging
.data (), staging
.size (),
2509 is_big_endian
, has_negatives (type
),
2511 type
= resolve_dynamic_type (type
, staging
, 0);
2512 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2514 /* This happens when the length of the object is dynamic,
2515 and is actually smaller than the space reserved for it.
2516 For instance, in an array of variant records, the bit_size
2517 we're given is the array stride, which is constant and
2518 normally equal to the maximum size of its element.
2519 But, in reality, each element only actually spans a portion
2521 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2527 v
= allocate_value (type
);
2528 src
= valaddr
+ offset
;
2530 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2532 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2535 v
= value_at (type
, value_address (obj
) + offset
);
2536 buf
= (gdb_byte
*) alloca (src_len
);
2537 read_memory (value_address (v
), buf
, src_len
);
2542 v
= allocate_value (type
);
2543 src
= value_contents (obj
) + offset
;
2548 long new_offset
= offset
;
2550 set_value_component_location (v
, obj
);
2551 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2552 set_value_bitsize (v
, bit_size
);
2553 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2556 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2558 set_value_offset (v
, new_offset
);
2560 /* Also set the parent value. This is needed when trying to
2561 assign a new value (in inferior memory). */
2562 set_value_parent (v
, obj
);
2565 set_value_bitsize (v
, bit_size
);
2566 unpacked
= value_contents_writeable (v
);
2570 memset (unpacked
, 0, TYPE_LENGTH (type
));
2574 if (staging
.size () == TYPE_LENGTH (type
))
2576 /* Small short-cut: If we've unpacked the data into a buffer
2577 of the same size as TYPE's length, then we can reuse that,
2578 instead of doing the unpacking again. */
2579 memcpy (unpacked
, staging
.data (), staging
.size ());
2582 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2583 unpacked
, TYPE_LENGTH (type
),
2584 is_big_endian
, has_negatives (type
), is_scalar
);
2589 /* Store the contents of FROMVAL into the location of TOVAL.
2590 Return a new value with the location of TOVAL and contents of
2591 FROMVAL. Handles assignment into packed fields that have
2592 floating-point or non-scalar types. */
2594 static struct value
*
2595 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2597 struct type
*type
= value_type (toval
);
2598 int bits
= value_bitsize (toval
);
2600 toval
= ada_coerce_ref (toval
);
2601 fromval
= ada_coerce_ref (fromval
);
2603 if (ada_is_direct_array_type (value_type (toval
)))
2604 toval
= ada_coerce_to_simple_array (toval
);
2605 if (ada_is_direct_array_type (value_type (fromval
)))
2606 fromval
= ada_coerce_to_simple_array (fromval
);
2608 if (!deprecated_value_modifiable (toval
))
2609 error (_("Left operand of assignment is not a modifiable lvalue."));
2611 if (VALUE_LVAL (toval
) == lval_memory
2613 && (type
->code () == TYPE_CODE_FLT
2614 || type
->code () == TYPE_CODE_STRUCT
))
2616 int len
= (value_bitpos (toval
)
2617 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2619 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2621 CORE_ADDR to_addr
= value_address (toval
);
2623 if (type
->code () == TYPE_CODE_FLT
)
2624 fromval
= value_cast (type
, fromval
);
2626 read_memory (to_addr
, buffer
, len
);
2627 from_size
= value_bitsize (fromval
);
2629 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2631 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2632 ULONGEST from_offset
= 0;
2633 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2634 from_offset
= from_size
- bits
;
2635 copy_bitwise (buffer
, value_bitpos (toval
),
2636 value_contents (fromval
), from_offset
,
2637 bits
, is_big_endian
);
2638 write_memory_with_notification (to_addr
, buffer
, len
);
2640 val
= value_copy (toval
);
2641 memcpy (value_contents_raw (val
), value_contents (fromval
),
2642 TYPE_LENGTH (type
));
2643 deprecated_set_value_type (val
, type
);
2648 return value_assign (toval
, fromval
);
2652 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2653 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2654 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2655 COMPONENT, and not the inferior's memory. The current contents
2656 of COMPONENT are ignored.
2658 Although not part of the initial design, this function also works
2659 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2660 had a null address, and COMPONENT had an address which is equal to
2661 its offset inside CONTAINER. */
2664 value_assign_to_component (struct value
*container
, struct value
*component
,
2667 LONGEST offset_in_container
=
2668 (LONGEST
) (value_address (component
) - value_address (container
));
2669 int bit_offset_in_container
=
2670 value_bitpos (component
) - value_bitpos (container
);
2673 val
= value_cast (value_type (component
), val
);
2675 if (value_bitsize (component
) == 0)
2676 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2678 bits
= value_bitsize (component
);
2680 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2684 if (is_scalar_type (check_typedef (value_type (component
))))
2686 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2689 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2690 value_bitpos (container
) + bit_offset_in_container
,
2691 value_contents (val
), src_offset
, bits
, 1);
2694 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2695 value_bitpos (container
) + bit_offset_in_container
,
2696 value_contents (val
), 0, bits
, 0);
2699 /* Determine if TYPE is an access to an unconstrained array. */
2702 ada_is_access_to_unconstrained_array (struct type
*type
)
2704 return (type
->code () == TYPE_CODE_TYPEDEF
2705 && is_thick_pntr (ada_typedef_target_type (type
)));
2708 /* The value of the element of array ARR at the ARITY indices given in IND.
2709 ARR may be either a simple array, GNAT array descriptor, or pointer
2713 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2717 struct type
*elt_type
;
2719 elt
= ada_coerce_to_simple_array (arr
);
2721 elt_type
= ada_check_typedef (value_type (elt
));
2722 if (elt_type
->code () == TYPE_CODE_ARRAY
2723 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2724 return value_subscript_packed (elt
, arity
, ind
);
2726 for (k
= 0; k
< arity
; k
+= 1)
2728 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2730 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2731 error (_("too many subscripts (%d expected)"), k
);
2733 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2735 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2736 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2738 /* The element is a typedef to an unconstrained array,
2739 except that the value_subscript call stripped the
2740 typedef layer. The typedef layer is GNAT's way to
2741 specify that the element is, at the source level, an
2742 access to the unconstrained array, rather than the
2743 unconstrained array. So, we need to restore that
2744 typedef layer, which we can do by forcing the element's
2745 type back to its original type. Otherwise, the returned
2746 value is going to be printed as the array, rather
2747 than as an access. Another symptom of the same issue
2748 would be that an expression trying to dereference the
2749 element would also be improperly rejected. */
2750 deprecated_set_value_type (elt
, saved_elt_type
);
2753 elt_type
= ada_check_typedef (value_type (elt
));
2759 /* Assuming ARR is a pointer to a GDB array, the value of the element
2760 of *ARR at the ARITY indices given in IND.
2761 Does not read the entire array into memory.
2763 Note: Unlike what one would expect, this function is used instead of
2764 ada_value_subscript for basically all non-packed array types. The reason
2765 for this is that a side effect of doing our own pointer arithmetics instead
2766 of relying on value_subscript is that there is no implicit typedef peeling.
2767 This is important for arrays of array accesses, where it allows us to
2768 preserve the fact that the array's element is an array access, where the
2769 access part os encoded in a typedef layer. */
2771 static struct value
*
2772 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2775 struct value
*array_ind
= ada_value_ind (arr
);
2777 = check_typedef (value_enclosing_type (array_ind
));
2779 if (type
->code () == TYPE_CODE_ARRAY
2780 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2781 return value_subscript_packed (array_ind
, arity
, ind
);
2783 for (k
= 0; k
< arity
; k
+= 1)
2787 if (type
->code () != TYPE_CODE_ARRAY
)
2788 error (_("too many subscripts (%d expected)"), k
);
2789 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2791 get_discrete_bounds (type
->index_type (), &lwb
, &upb
);
2792 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2793 type
= TYPE_TARGET_TYPE (type
);
2796 return value_ind (arr
);
2799 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2800 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2801 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2802 this array is LOW, as per Ada rules. */
2803 static struct value
*
2804 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2807 struct type
*type0
= ada_check_typedef (type
);
2808 struct type
*base_index_type
= TYPE_TARGET_TYPE (type0
->index_type ());
2809 struct type
*index_type
2810 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2811 struct type
*slice_type
= create_array_type_with_stride
2812 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2813 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2814 TYPE_FIELD_BITSIZE (type0
, 0));
2815 int base_low
= ada_discrete_type_low_bound (type0
->index_type ());
2816 gdb::optional
<LONGEST
> base_low_pos
, low_pos
;
2819 low_pos
= discrete_position (base_index_type
, low
);
2820 base_low_pos
= discrete_position (base_index_type
, base_low
);
2822 if (!low_pos
.has_value () || !base_low_pos
.has_value ())
2824 warning (_("unable to get positions in slice, use bounds instead"));
2826 base_low_pos
= base_low
;
2829 ULONGEST stride
= TYPE_FIELD_BITSIZE (slice_type
, 0) / 8;
2831 stride
= TYPE_LENGTH (TYPE_TARGET_TYPE (type0
));
2833 base
= value_as_address (array_ptr
) + (*low_pos
- *base_low_pos
) * stride
;
2834 return value_at_lazy (slice_type
, base
);
2838 static struct value
*
2839 ada_value_slice (struct value
*array
, int low
, int high
)
2841 struct type
*type
= ada_check_typedef (value_type (array
));
2842 struct type
*base_index_type
= TYPE_TARGET_TYPE (type
->index_type ());
2843 struct type
*index_type
2844 = create_static_range_type (NULL
, type
->index_type (), low
, high
);
2845 struct type
*slice_type
= create_array_type_with_stride
2846 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2847 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2848 TYPE_FIELD_BITSIZE (type
, 0));
2849 gdb::optional
<LONGEST
> low_pos
, high_pos
;
2852 low_pos
= discrete_position (base_index_type
, low
);
2853 high_pos
= discrete_position (base_index_type
, high
);
2855 if (!low_pos
.has_value () || !high_pos
.has_value ())
2857 warning (_("unable to get positions in slice, use bounds instead"));
2862 return value_cast (slice_type
,
2863 value_slice (array
, low
, *high_pos
- *low_pos
+ 1));
2866 /* If type is a record type in the form of a standard GNAT array
2867 descriptor, returns the number of dimensions for type. If arr is a
2868 simple array, returns the number of "array of"s that prefix its
2869 type designation. Otherwise, returns 0. */
2872 ada_array_arity (struct type
*type
)
2879 type
= desc_base_type (type
);
2882 if (type
->code () == TYPE_CODE_STRUCT
)
2883 return desc_arity (desc_bounds_type (type
));
2885 while (type
->code () == TYPE_CODE_ARRAY
)
2888 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2894 /* If TYPE is a record type in the form of a standard GNAT array
2895 descriptor or a simple array type, returns the element type for
2896 TYPE after indexing by NINDICES indices, or by all indices if
2897 NINDICES is -1. Otherwise, returns NULL. */
2900 ada_array_element_type (struct type
*type
, int nindices
)
2902 type
= desc_base_type (type
);
2904 if (type
->code () == TYPE_CODE_STRUCT
)
2907 struct type
*p_array_type
;
2909 p_array_type
= desc_data_target_type (type
);
2911 k
= ada_array_arity (type
);
2915 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2916 if (nindices
>= 0 && k
> nindices
)
2918 while (k
> 0 && p_array_type
!= NULL
)
2920 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2923 return p_array_type
;
2925 else if (type
->code () == TYPE_CODE_ARRAY
)
2927 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2929 type
= TYPE_TARGET_TYPE (type
);
2938 /* The type of nth index in arrays of given type (n numbering from 1).
2939 Does not examine memory. Throws an error if N is invalid or TYPE
2940 is not an array type. NAME is the name of the Ada attribute being
2941 evaluated ('range, 'first, 'last, or 'length); it is used in building
2942 the error message. */
2944 static struct type
*
2945 ada_index_type (struct type
*type
, int n
, const char *name
)
2947 struct type
*result_type
;
2949 type
= desc_base_type (type
);
2951 if (n
< 0 || n
> ada_array_arity (type
))
2952 error (_("invalid dimension number to '%s"), name
);
2954 if (ada_is_simple_array_type (type
))
2958 for (i
= 1; i
< n
; i
+= 1)
2959 type
= TYPE_TARGET_TYPE (type
);
2960 result_type
= TYPE_TARGET_TYPE (type
->index_type ());
2961 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2962 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2963 perhaps stabsread.c would make more sense. */
2964 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2969 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2970 if (result_type
== NULL
)
2971 error (_("attempt to take bound of something that is not an array"));
2977 /* Given that arr is an array type, returns the lower bound of the
2978 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2979 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2980 array-descriptor type. It works for other arrays with bounds supplied
2981 by run-time quantities other than discriminants. */
2984 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2986 struct type
*type
, *index_type_desc
, *index_type
;
2989 gdb_assert (which
== 0 || which
== 1);
2991 if (ada_is_constrained_packed_array_type (arr_type
))
2992 arr_type
= decode_constrained_packed_array_type (arr_type
);
2994 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2995 return (LONGEST
) - which
;
2997 if (arr_type
->code () == TYPE_CODE_PTR
)
2998 type
= TYPE_TARGET_TYPE (arr_type
);
3002 if (type
->is_fixed_instance ())
3004 /* The array has already been fixed, so we do not need to
3005 check the parallel ___XA type again. That encoding has
3006 already been applied, so ignore it now. */
3007 index_type_desc
= NULL
;
3011 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3012 ada_fixup_array_indexes_type (index_type_desc
);
3015 if (index_type_desc
!= NULL
)
3016 index_type
= to_fixed_range_type (index_type_desc
->field (n
- 1).type (),
3020 struct type
*elt_type
= check_typedef (type
);
3022 for (i
= 1; i
< n
; i
++)
3023 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3025 index_type
= elt_type
->index_type ();
3029 (LONGEST
) (which
== 0
3030 ? ada_discrete_type_low_bound (index_type
)
3031 : ada_discrete_type_high_bound (index_type
));
3034 /* Given that arr is an array value, returns the lower bound of the
3035 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3036 WHICH is 1. This routine will also work for arrays with bounds
3037 supplied by run-time quantities other than discriminants. */
3040 ada_array_bound (struct value
*arr
, int n
, int which
)
3042 struct type
*arr_type
;
3044 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3045 arr
= value_ind (arr
);
3046 arr_type
= value_enclosing_type (arr
);
3048 if (ada_is_constrained_packed_array_type (arr_type
))
3049 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3050 else if (ada_is_simple_array_type (arr_type
))
3051 return ada_array_bound_from_type (arr_type
, n
, which
);
3053 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3056 /* Given that arr is an array value, returns the length of the
3057 nth index. This routine will also work for arrays with bounds
3058 supplied by run-time quantities other than discriminants.
3059 Does not work for arrays indexed by enumeration types with representation
3060 clauses at the moment. */
3063 ada_array_length (struct value
*arr
, int n
)
3065 struct type
*arr_type
, *index_type
;
3068 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3069 arr
= value_ind (arr
);
3070 arr_type
= value_enclosing_type (arr
);
3072 if (ada_is_constrained_packed_array_type (arr_type
))
3073 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3075 if (ada_is_simple_array_type (arr_type
))
3077 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3078 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3082 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3083 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3086 arr_type
= check_typedef (arr_type
);
3087 index_type
= ada_index_type (arr_type
, n
, "length");
3088 if (index_type
!= NULL
)
3090 struct type
*base_type
;
3091 if (index_type
->code () == TYPE_CODE_RANGE
)
3092 base_type
= TYPE_TARGET_TYPE (index_type
);
3094 base_type
= index_type
;
3096 low
= pos_atr (value_from_longest (base_type
, low
));
3097 high
= pos_atr (value_from_longest (base_type
, high
));
3099 return high
- low
+ 1;
3102 /* An array whose type is that of ARR_TYPE (an array type), with
3103 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3104 less than LOW, then LOW-1 is used. */
3106 static struct value
*
3107 empty_array (struct type
*arr_type
, int low
, int high
)
3109 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3110 struct type
*index_type
3111 = create_static_range_type
3112 (NULL
, TYPE_TARGET_TYPE (arr_type0
->index_type ()), low
,
3113 high
< low
? low
- 1 : high
);
3114 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3116 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3120 /* Name resolution */
3122 /* The "decoded" name for the user-definable Ada operator corresponding
3126 ada_decoded_op_name (enum exp_opcode op
)
3130 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3132 if (ada_opname_table
[i
].op
== op
)
3133 return ada_opname_table
[i
].decoded
;
3135 error (_("Could not find operator name for opcode"));
3138 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3139 in a listing of choices during disambiguation (see sort_choices, below).
3140 The idea is that overloadings of a subprogram name from the
3141 same package should sort in their source order. We settle for ordering
3142 such symbols by their trailing number (__N or $N). */
3145 encoded_ordered_before (const char *N0
, const char *N1
)
3149 else if (N0
== NULL
)
3155 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3157 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3159 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3160 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3165 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3168 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3170 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3171 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3173 return (strcmp (N0
, N1
) < 0);
3177 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3181 sort_choices (struct block_symbol syms
[], int nsyms
)
3185 for (i
= 1; i
< nsyms
; i
+= 1)
3187 struct block_symbol sym
= syms
[i
];
3190 for (j
= i
- 1; j
>= 0; j
-= 1)
3192 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3193 sym
.symbol
->linkage_name ()))
3195 syms
[j
+ 1] = syms
[j
];
3201 /* Whether GDB should display formals and return types for functions in the
3202 overloads selection menu. */
3203 static bool print_signatures
= true;
3205 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3206 all but functions, the signature is just the name of the symbol. For
3207 functions, this is the name of the function, the list of types for formals
3208 and the return type (if any). */
3211 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3212 const struct type_print_options
*flags
)
3214 struct type
*type
= SYMBOL_TYPE (sym
);
3216 fprintf_filtered (stream
, "%s", sym
->print_name ());
3217 if (!print_signatures
3219 || type
->code () != TYPE_CODE_FUNC
)
3222 if (type
->num_fields () > 0)
3226 fprintf_filtered (stream
, " (");
3227 for (i
= 0; i
< type
->num_fields (); ++i
)
3230 fprintf_filtered (stream
, "; ");
3231 ada_print_type (type
->field (i
).type (), NULL
, stream
, -1, 0,
3234 fprintf_filtered (stream
, ")");
3236 if (TYPE_TARGET_TYPE (type
) != NULL
3237 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3239 fprintf_filtered (stream
, " return ");
3240 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3244 /* Read and validate a set of numeric choices from the user in the
3245 range 0 .. N_CHOICES-1. Place the results in increasing
3246 order in CHOICES[0 .. N-1], and return N.
3248 The user types choices as a sequence of numbers on one line
3249 separated by blanks, encoding them as follows:
3251 + A choice of 0 means to cancel the selection, throwing an error.
3252 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3253 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3255 The user is not allowed to choose more than MAX_RESULTS values.
3257 ANNOTATION_SUFFIX, if present, is used to annotate the input
3258 prompts (for use with the -f switch). */
3261 get_selections (int *choices
, int n_choices
, int max_results
,
3262 int is_all_choice
, const char *annotation_suffix
)
3267 int first_choice
= is_all_choice
? 2 : 1;
3269 prompt
= getenv ("PS2");
3273 args
= command_line_input (prompt
, annotation_suffix
);
3276 error_no_arg (_("one or more choice numbers"));
3280 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3281 order, as given in args. Choices are validated. */
3287 args
= skip_spaces (args
);
3288 if (*args
== '\0' && n_chosen
== 0)
3289 error_no_arg (_("one or more choice numbers"));
3290 else if (*args
== '\0')
3293 choice
= strtol (args
, &args2
, 10);
3294 if (args
== args2
|| choice
< 0
3295 || choice
> n_choices
+ first_choice
- 1)
3296 error (_("Argument must be choice number"));
3300 error (_("cancelled"));
3302 if (choice
< first_choice
)
3304 n_chosen
= n_choices
;
3305 for (j
= 0; j
< n_choices
; j
+= 1)
3309 choice
-= first_choice
;
3311 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3315 if (j
< 0 || choice
!= choices
[j
])
3319 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3320 choices
[k
+ 1] = choices
[k
];
3321 choices
[j
+ 1] = choice
;
3326 if (n_chosen
> max_results
)
3327 error (_("Select no more than %d of the above"), max_results
);
3332 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3333 by asking the user (if necessary), returning the number selected,
3334 and setting the first elements of SYMS items. Error if no symbols
3337 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3338 to be re-integrated one of these days. */
3341 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3344 int *chosen
= XALLOCAVEC (int , nsyms
);
3346 int first_choice
= (max_results
== 1) ? 1 : 2;
3347 const char *select_mode
= multiple_symbols_select_mode ();
3349 if (max_results
< 1)
3350 error (_("Request to select 0 symbols!"));
3354 if (select_mode
== multiple_symbols_cancel
)
3356 canceled because the command is ambiguous\n\
3357 See set/show multiple-symbol."));
3359 /* If select_mode is "all", then return all possible symbols.
3360 Only do that if more than one symbol can be selected, of course.
3361 Otherwise, display the menu as usual. */
3362 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3365 printf_filtered (_("[0] cancel\n"));
3366 if (max_results
> 1)
3367 printf_filtered (_("[1] all\n"));
3369 sort_choices (syms
, nsyms
);
3371 for (i
= 0; i
< nsyms
; i
+= 1)
3373 if (syms
[i
].symbol
== NULL
)
3376 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3378 struct symtab_and_line sal
=
3379 find_function_start_sal (syms
[i
].symbol
, 1);
3381 printf_filtered ("[%d] ", i
+ first_choice
);
3382 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3383 &type_print_raw_options
);
3384 if (sal
.symtab
== NULL
)
3385 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3386 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3390 styled_string (file_name_style
.style (),
3391 symtab_to_filename_for_display (sal
.symtab
)),
3398 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3399 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3400 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3401 struct symtab
*symtab
= NULL
;
3403 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3404 symtab
= symbol_symtab (syms
[i
].symbol
);
3406 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3408 printf_filtered ("[%d] ", i
+ first_choice
);
3409 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3410 &type_print_raw_options
);
3411 printf_filtered (_(" at %s:%d\n"),
3412 symtab_to_filename_for_display (symtab
),
3413 SYMBOL_LINE (syms
[i
].symbol
));
3415 else if (is_enumeral
3416 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3418 printf_filtered (("[%d] "), i
+ first_choice
);
3419 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3420 gdb_stdout
, -1, 0, &type_print_raw_options
);
3421 printf_filtered (_("'(%s) (enumeral)\n"),
3422 syms
[i
].symbol
->print_name ());
3426 printf_filtered ("[%d] ", i
+ first_choice
);
3427 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3428 &type_print_raw_options
);
3431 printf_filtered (is_enumeral
3432 ? _(" in %s (enumeral)\n")
3434 symtab_to_filename_for_display (symtab
));
3436 printf_filtered (is_enumeral
3437 ? _(" (enumeral)\n")
3443 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3446 for (i
= 0; i
< n_chosen
; i
+= 1)
3447 syms
[i
] = syms
[chosen
[i
]];
3452 /* Resolve the operator of the subexpression beginning at
3453 position *POS of *EXPP. "Resolving" consists of replacing
3454 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3455 with their resolutions, replacing built-in operators with
3456 function calls to user-defined operators, where appropriate, and,
3457 when DEPROCEDURE_P is non-zero, converting function-valued variables
3458 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3459 are as in ada_resolve, above. */
3461 static struct value
*
3462 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3463 struct type
*context_type
, int parse_completion
,
3464 innermost_block_tracker
*tracker
)
3468 struct expression
*exp
; /* Convenience: == *expp. */
3469 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3470 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3471 int nargs
; /* Number of operands. */
3473 /* If we're resolving an expression like ARRAY(ARG...), then we set
3474 this to the type of the array, so we can use the index types as
3475 the expected types for resolution. */
3476 struct type
*array_type
= nullptr;
3477 /* The arity of ARRAY_TYPE. */
3478 int array_arity
= 0;
3484 /* Pass one: resolve operands, saving their types and updating *pos,
3489 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3490 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3495 struct value
*lhs
= resolve_subexp (expp
, pos
, 0, NULL
,
3496 parse_completion
, tracker
);
3497 struct type
*lhstype
= ada_check_typedef (value_type (lhs
));
3498 array_arity
= ada_array_arity (lhstype
);
3499 if (array_arity
> 0)
3500 array_type
= lhstype
;
3502 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3507 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3512 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3513 parse_completion
, tracker
);
3516 case OP_ATR_MODULUS
:
3526 case TERNOP_IN_RANGE
:
3527 case BINOP_IN_BOUNDS
:
3533 case OP_DISCRETE_RANGE
:
3535 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3544 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3546 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3548 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3566 case BINOP_LOGICAL_AND
:
3567 case BINOP_LOGICAL_OR
:
3568 case BINOP_BITWISE_AND
:
3569 case BINOP_BITWISE_IOR
:
3570 case BINOP_BITWISE_XOR
:
3573 case BINOP_NOTEQUAL
:
3580 case BINOP_SUBSCRIPT
:
3588 case UNOP_LOGICAL_NOT
:
3598 case OP_VAR_MSYM_VALUE
:
3605 case OP_INTERNALVAR
:
3615 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3618 case STRUCTOP_STRUCT
:
3619 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3632 error (_("Unexpected operator during name resolution"));
3635 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3636 for (i
= 0; i
< nargs
; i
+= 1)
3638 struct type
*subtype
= nullptr;
3639 if (i
< array_arity
)
3640 subtype
= ada_index_type (array_type
, i
+ 1, "array type");
3641 argvec
[i
] = resolve_subexp (expp
, pos
, 1, subtype
, parse_completion
,
3647 /* Pass two: perform any resolution on principal operator. */
3654 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3656 std::vector
<struct block_symbol
> candidates
;
3660 ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3661 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3664 candidates
.resize (n_candidates
);
3666 if (std::any_of (candidates
.begin (),
3668 [] (block_symbol
&sym
)
3670 switch (SYMBOL_CLASS (sym
.symbol
))
3675 case LOC_REGPARM_ADDR
:
3684 /* Types tend to get re-introduced locally, so if there
3685 are any local symbols that are not types, first filter
3689 (candidates
.begin (),
3691 [] (block_symbol
&sym
)
3693 return SYMBOL_CLASS (sym
.symbol
) == LOC_TYPEDEF
;
3696 n_candidates
= candidates
.size ();
3699 if (n_candidates
== 0)
3700 error (_("No definition found for %s"),
3701 exp
->elts
[pc
+ 2].symbol
->print_name ());
3702 else if (n_candidates
== 1)
3704 else if (deprocedure_p
3705 && !is_nonfunction (candidates
.data (), n_candidates
))
3707 i
= ada_resolve_function
3708 (candidates
.data (), n_candidates
, NULL
, 0,
3709 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3710 context_type
, parse_completion
);
3712 error (_("Could not find a match for %s"),
3713 exp
->elts
[pc
+ 2].symbol
->print_name ());
3717 printf_filtered (_("Multiple matches for %s\n"),
3718 exp
->elts
[pc
+ 2].symbol
->print_name ());
3719 user_select_syms (candidates
.data (), n_candidates
, 1);
3723 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3724 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3725 tracker
->update (candidates
[i
]);
3729 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3732 replace_operator_with_call (expp
, pc
, 0, 4,
3733 exp
->elts
[pc
+ 2].symbol
,
3734 exp
->elts
[pc
+ 1].block
);
3741 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3742 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3744 std::vector
<struct block_symbol
> candidates
;
3748 ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3749 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3752 if (n_candidates
== 1)
3756 i
= ada_resolve_function
3757 (candidates
.data (), n_candidates
,
3759 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3760 context_type
, parse_completion
);
3762 error (_("Could not find a match for %s"),
3763 exp
->elts
[pc
+ 5].symbol
->print_name ());
3766 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3767 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3768 tracker
->update (candidates
[i
]);
3779 case BINOP_BITWISE_AND
:
3780 case BINOP_BITWISE_IOR
:
3781 case BINOP_BITWISE_XOR
:
3783 case BINOP_NOTEQUAL
:
3791 case UNOP_LOGICAL_NOT
:
3793 if (possible_user_operator_p (op
, argvec
))
3795 std::vector
<struct block_symbol
> candidates
;
3799 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3803 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3804 nargs
, ada_decoded_op_name (op
), NULL
,
3809 replace_operator_with_call (expp
, pc
, nargs
, 1,
3810 candidates
[i
].symbol
,
3811 candidates
[i
].block
);
3822 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3823 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3824 exp
->elts
[pc
+ 1].objfile
,
3825 exp
->elts
[pc
+ 2].msymbol
);
3827 return evaluate_subexp_type (exp
, pos
);
3830 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3831 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3833 /* The term "match" here is rather loose. The match is heuristic and
3837 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3839 ftype
= ada_check_typedef (ftype
);
3840 atype
= ada_check_typedef (atype
);
3842 if (ftype
->code () == TYPE_CODE_REF
)
3843 ftype
= TYPE_TARGET_TYPE (ftype
);
3844 if (atype
->code () == TYPE_CODE_REF
)
3845 atype
= TYPE_TARGET_TYPE (atype
);
3847 switch (ftype
->code ())
3850 return ftype
->code () == atype
->code ();
3852 if (atype
->code () == TYPE_CODE_PTR
)
3853 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3854 TYPE_TARGET_TYPE (atype
), 0);
3857 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3859 case TYPE_CODE_ENUM
:
3860 case TYPE_CODE_RANGE
:
3861 switch (atype
->code ())
3864 case TYPE_CODE_ENUM
:
3865 case TYPE_CODE_RANGE
:
3871 case TYPE_CODE_ARRAY
:
3872 return (atype
->code () == TYPE_CODE_ARRAY
3873 || ada_is_array_descriptor_type (atype
));
3875 case TYPE_CODE_STRUCT
:
3876 if (ada_is_array_descriptor_type (ftype
))
3877 return (atype
->code () == TYPE_CODE_ARRAY
3878 || ada_is_array_descriptor_type (atype
));
3880 return (atype
->code () == TYPE_CODE_STRUCT
3881 && !ada_is_array_descriptor_type (atype
));
3883 case TYPE_CODE_UNION
:
3885 return (atype
->code () == ftype
->code ());
3889 /* Return non-zero if the formals of FUNC "sufficiently match" the
3890 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3891 may also be an enumeral, in which case it is treated as a 0-
3892 argument function. */
3895 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3898 struct type
*func_type
= SYMBOL_TYPE (func
);
3900 if (SYMBOL_CLASS (func
) == LOC_CONST
3901 && func_type
->code () == TYPE_CODE_ENUM
)
3902 return (n_actuals
== 0);
3903 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3906 if (func_type
->num_fields () != n_actuals
)
3909 for (i
= 0; i
< n_actuals
; i
+= 1)
3911 if (actuals
[i
] == NULL
)
3915 struct type
*ftype
= ada_check_typedef (func_type
->field (i
).type ());
3916 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3918 if (!ada_type_match (ftype
, atype
, 1))
3925 /* False iff function type FUNC_TYPE definitely does not produce a value
3926 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3927 FUNC_TYPE is not a valid function type with a non-null return type
3928 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3931 return_match (struct type
*func_type
, struct type
*context_type
)
3933 struct type
*return_type
;
3935 if (func_type
== NULL
)
3938 if (func_type
->code () == TYPE_CODE_FUNC
)
3939 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3941 return_type
= get_base_type (func_type
);
3942 if (return_type
== NULL
)
3945 context_type
= get_base_type (context_type
);
3947 if (return_type
->code () == TYPE_CODE_ENUM
)
3948 return context_type
== NULL
|| return_type
== context_type
;
3949 else if (context_type
== NULL
)
3950 return return_type
->code () != TYPE_CODE_VOID
;
3952 return return_type
->code () == context_type
->code ();
3956 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3957 function (if any) that matches the types of the NARGS arguments in
3958 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3959 that returns that type, then eliminate matches that don't. If
3960 CONTEXT_TYPE is void and there is at least one match that does not
3961 return void, eliminate all matches that do.
3963 Asks the user if there is more than one match remaining. Returns -1
3964 if there is no such symbol or none is selected. NAME is used
3965 solely for messages. May re-arrange and modify SYMS in
3966 the process; the index returned is for the modified vector. */
3969 ada_resolve_function (struct block_symbol syms
[],
3970 int nsyms
, struct value
**args
, int nargs
,
3971 const char *name
, struct type
*context_type
,
3972 int parse_completion
)
3976 int m
; /* Number of hits */
3979 /* In the first pass of the loop, we only accept functions matching
3980 context_type. If none are found, we add a second pass of the loop
3981 where every function is accepted. */
3982 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3984 for (k
= 0; k
< nsyms
; k
+= 1)
3986 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3988 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3989 && (fallback
|| return_match (type
, context_type
)))
3997 /* If we got multiple matches, ask the user which one to use. Don't do this
3998 interactive thing during completion, though, as the purpose of the
3999 completion is providing a list of all possible matches. Prompting the
4000 user to filter it down would be completely unexpected in this case. */
4003 else if (m
> 1 && !parse_completion
)
4005 printf_filtered (_("Multiple matches for %s\n"), name
);
4006 user_select_syms (syms
, m
, 1);
4012 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4013 on the function identified by SYM and BLOCK, and taking NARGS
4014 arguments. Update *EXPP as needed to hold more space. */
4017 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4018 int oplen
, struct symbol
*sym
,
4019 const struct block
*block
)
4021 /* We want to add 6 more elements (3 for funcall, 4 for function
4022 symbol, -OPLEN for operator being replaced) to the
4024 struct expression
*exp
= expp
->get ();
4025 int save_nelts
= exp
->nelts
;
4026 int extra_elts
= 7 - oplen
;
4027 exp
->nelts
+= extra_elts
;
4030 exp
->resize (exp
->nelts
);
4031 memmove (exp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4032 EXP_ELEM_TO_BYTES (save_nelts
- pc
- oplen
));
4034 exp
->resize (exp
->nelts
);
4036 exp
->elts
[pc
].opcode
= exp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4037 exp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4039 exp
->elts
[pc
+ 3].opcode
= exp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4040 exp
->elts
[pc
+ 4].block
= block
;
4041 exp
->elts
[pc
+ 5].symbol
= sym
;
4044 /* Type-class predicates */
4046 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4050 numeric_type_p (struct type
*type
)
4056 switch (type
->code ())
4061 case TYPE_CODE_RANGE
:
4062 return (type
== TYPE_TARGET_TYPE (type
)
4063 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4070 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4073 integer_type_p (struct type
*type
)
4079 switch (type
->code ())
4083 case TYPE_CODE_RANGE
:
4084 return (type
== TYPE_TARGET_TYPE (type
)
4085 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4092 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4095 scalar_type_p (struct type
*type
)
4101 switch (type
->code ())
4104 case TYPE_CODE_RANGE
:
4105 case TYPE_CODE_ENUM
:
4114 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4117 discrete_type_p (struct type
*type
)
4123 switch (type
->code ())
4126 case TYPE_CODE_RANGE
:
4127 case TYPE_CODE_ENUM
:
4128 case TYPE_CODE_BOOL
:
4136 /* Returns non-zero if OP with operands in the vector ARGS could be
4137 a user-defined function. Errs on the side of pre-defined operators
4138 (i.e., result 0). */
4141 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4143 struct type
*type0
=
4144 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4145 struct type
*type1
=
4146 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4160 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4164 case BINOP_BITWISE_AND
:
4165 case BINOP_BITWISE_IOR
:
4166 case BINOP_BITWISE_XOR
:
4167 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4170 case BINOP_NOTEQUAL
:
4175 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4178 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4181 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4185 case UNOP_LOGICAL_NOT
:
4187 return (!numeric_type_p (type0
));
4196 1. In the following, we assume that a renaming type's name may
4197 have an ___XD suffix. It would be nice if this went away at some
4199 2. We handle both the (old) purely type-based representation of
4200 renamings and the (new) variable-based encoding. At some point,
4201 it is devoutly to be hoped that the former goes away
4202 (FIXME: hilfinger-2007-07-09).
4203 3. Subprogram renamings are not implemented, although the XRS
4204 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4206 /* If SYM encodes a renaming,
4208 <renaming> renames <renamed entity>,
4210 sets *LEN to the length of the renamed entity's name,
4211 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4212 the string describing the subcomponent selected from the renamed
4213 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4214 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4215 are undefined). Otherwise, returns a value indicating the category
4216 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4217 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4218 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4219 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4220 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4221 may be NULL, in which case they are not assigned.
4223 [Currently, however, GCC does not generate subprogram renamings.] */
4225 enum ada_renaming_category
4226 ada_parse_renaming (struct symbol
*sym
,
4227 const char **renamed_entity
, int *len
,
4228 const char **renaming_expr
)
4230 enum ada_renaming_category kind
;
4235 return ADA_NOT_RENAMING
;
4236 switch (SYMBOL_CLASS (sym
))
4239 return ADA_NOT_RENAMING
;
4243 case LOC_OPTIMIZED_OUT
:
4244 info
= strstr (sym
->linkage_name (), "___XR");
4246 return ADA_NOT_RENAMING
;
4250 kind
= ADA_OBJECT_RENAMING
;
4254 kind
= ADA_EXCEPTION_RENAMING
;
4258 kind
= ADA_PACKAGE_RENAMING
;
4262 kind
= ADA_SUBPROGRAM_RENAMING
;
4266 return ADA_NOT_RENAMING
;
4270 if (renamed_entity
!= NULL
)
4271 *renamed_entity
= info
;
4272 suffix
= strstr (info
, "___XE");
4273 if (suffix
== NULL
|| suffix
== info
)
4274 return ADA_NOT_RENAMING
;
4276 *len
= strlen (info
) - strlen (suffix
);
4278 if (renaming_expr
!= NULL
)
4279 *renaming_expr
= suffix
;
4283 /* Compute the value of the given RENAMING_SYM, which is expected to
4284 be a symbol encoding a renaming expression. BLOCK is the block
4285 used to evaluate the renaming. */
4287 static struct value
*
4288 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4289 const struct block
*block
)
4291 const char *sym_name
;
4293 sym_name
= renaming_sym
->linkage_name ();
4294 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4295 return evaluate_expression (expr
.get ());
4299 /* Evaluation: Function Calls */
4301 /* Return an lvalue containing the value VAL. This is the identity on
4302 lvalues, and otherwise has the side-effect of allocating memory
4303 in the inferior where a copy of the value contents is copied. */
4305 static struct value
*
4306 ensure_lval (struct value
*val
)
4308 if (VALUE_LVAL (val
) == not_lval
4309 || VALUE_LVAL (val
) == lval_internalvar
)
4311 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4312 const CORE_ADDR addr
=
4313 value_as_long (value_allocate_space_in_inferior (len
));
4315 VALUE_LVAL (val
) = lval_memory
;
4316 set_value_address (val
, addr
);
4317 write_memory (addr
, value_contents (val
), len
);
4323 /* Given ARG, a value of type (pointer or reference to a)*
4324 structure/union, extract the component named NAME from the ultimate
4325 target structure/union and return it as a value with its
4328 The routine searches for NAME among all members of the structure itself
4329 and (recursively) among all members of any wrapper members
4332 If NO_ERR, then simply return NULL in case of error, rather than
4335 static struct value
*
4336 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4338 struct type
*t
, *t1
;
4343 t1
= t
= ada_check_typedef (value_type (arg
));
4344 if (t
->code () == TYPE_CODE_REF
)
4346 t1
= TYPE_TARGET_TYPE (t
);
4349 t1
= ada_check_typedef (t1
);
4350 if (t1
->code () == TYPE_CODE_PTR
)
4352 arg
= coerce_ref (arg
);
4357 while (t
->code () == TYPE_CODE_PTR
)
4359 t1
= TYPE_TARGET_TYPE (t
);
4362 t1
= ada_check_typedef (t1
);
4363 if (t1
->code () == TYPE_CODE_PTR
)
4365 arg
= value_ind (arg
);
4372 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4376 v
= ada_search_struct_field (name
, arg
, 0, t
);
4379 int bit_offset
, bit_size
, byte_offset
;
4380 struct type
*field_type
;
4383 if (t
->code () == TYPE_CODE_PTR
)
4384 address
= value_address (ada_value_ind (arg
));
4386 address
= value_address (ada_coerce_ref (arg
));
4388 /* Check to see if this is a tagged type. We also need to handle
4389 the case where the type is a reference to a tagged type, but
4390 we have to be careful to exclude pointers to tagged types.
4391 The latter should be shown as usual (as a pointer), whereas
4392 a reference should mostly be transparent to the user. */
4394 if (ada_is_tagged_type (t1
, 0)
4395 || (t1
->code () == TYPE_CODE_REF
4396 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4398 /* We first try to find the searched field in the current type.
4399 If not found then let's look in the fixed type. */
4401 if (!find_struct_field (name
, t1
, 0,
4402 &field_type
, &byte_offset
, &bit_offset
,
4411 /* Convert to fixed type in all cases, so that we have proper
4412 offsets to each field in unconstrained record types. */
4413 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4414 address
, NULL
, check_tag
);
4416 /* Resolve the dynamic type as well. */
4417 arg
= value_from_contents_and_address (t1
, nullptr, address
);
4418 t1
= value_type (arg
);
4420 if (find_struct_field (name
, t1
, 0,
4421 &field_type
, &byte_offset
, &bit_offset
,
4426 if (t
->code () == TYPE_CODE_REF
)
4427 arg
= ada_coerce_ref (arg
);
4429 arg
= ada_value_ind (arg
);
4430 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4431 bit_offset
, bit_size
,
4435 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4439 if (v
!= NULL
|| no_err
)
4442 error (_("There is no member named %s."), name
);
4448 error (_("Attempt to extract a component of "
4449 "a value that is not a record."));
4452 /* Return the value ACTUAL, converted to be an appropriate value for a
4453 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4454 allocating any necessary descriptors (fat pointers), or copies of
4455 values not residing in memory, updating it as needed. */
4458 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4460 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4461 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4462 struct type
*formal_target
=
4463 formal_type
->code () == TYPE_CODE_PTR
4464 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4465 struct type
*actual_target
=
4466 actual_type
->code () == TYPE_CODE_PTR
4467 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4469 if (ada_is_array_descriptor_type (formal_target
)
4470 && actual_target
->code () == TYPE_CODE_ARRAY
)
4471 return make_array_descriptor (formal_type
, actual
);
4472 else if (formal_type
->code () == TYPE_CODE_PTR
4473 || formal_type
->code () == TYPE_CODE_REF
)
4475 struct value
*result
;
4477 if (formal_target
->code () == TYPE_CODE_ARRAY
4478 && ada_is_array_descriptor_type (actual_target
))
4479 result
= desc_data (actual
);
4480 else if (formal_type
->code () != TYPE_CODE_PTR
)
4482 if (VALUE_LVAL (actual
) != lval_memory
)
4486 actual_type
= ada_check_typedef (value_type (actual
));
4487 val
= allocate_value (actual_type
);
4488 memcpy ((char *) value_contents_raw (val
),
4489 (char *) value_contents (actual
),
4490 TYPE_LENGTH (actual_type
));
4491 actual
= ensure_lval (val
);
4493 result
= value_addr (actual
);
4497 return value_cast_pointers (formal_type
, result
, 0);
4499 else if (actual_type
->code () == TYPE_CODE_PTR
)
4500 return ada_value_ind (actual
);
4501 else if (ada_is_aligner_type (formal_type
))
4503 /* We need to turn this parameter into an aligner type
4505 struct value
*aligner
= allocate_value (formal_type
);
4506 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4508 value_assign_to_component (aligner
, component
, actual
);
4515 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4516 type TYPE. This is usually an inefficient no-op except on some targets
4517 (such as AVR) where the representation of a pointer and an address
4521 value_pointer (struct value
*value
, struct type
*type
)
4523 unsigned len
= TYPE_LENGTH (type
);
4524 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4527 addr
= value_address (value
);
4528 gdbarch_address_to_pointer (type
->arch (), type
, buf
, addr
);
4529 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4534 /* Push a descriptor of type TYPE for array value ARR on the stack at
4535 *SP, updating *SP to reflect the new descriptor. Return either
4536 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4537 to-descriptor type rather than a descriptor type), a struct value *
4538 representing a pointer to this descriptor. */
4540 static struct value
*
4541 make_array_descriptor (struct type
*type
, struct value
*arr
)
4543 struct type
*bounds_type
= desc_bounds_type (type
);
4544 struct type
*desc_type
= desc_base_type (type
);
4545 struct value
*descriptor
= allocate_value (desc_type
);
4546 struct value
*bounds
= allocate_value (bounds_type
);
4549 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4552 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4553 ada_array_bound (arr
, i
, 0),
4554 desc_bound_bitpos (bounds_type
, i
, 0),
4555 desc_bound_bitsize (bounds_type
, i
, 0));
4556 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4557 ada_array_bound (arr
, i
, 1),
4558 desc_bound_bitpos (bounds_type
, i
, 1),
4559 desc_bound_bitsize (bounds_type
, i
, 1));
4562 bounds
= ensure_lval (bounds
);
4564 modify_field (value_type (descriptor
),
4565 value_contents_writeable (descriptor
),
4566 value_pointer (ensure_lval (arr
),
4567 desc_type
->field (0).type ()),
4568 fat_pntr_data_bitpos (desc_type
),
4569 fat_pntr_data_bitsize (desc_type
));
4571 modify_field (value_type (descriptor
),
4572 value_contents_writeable (descriptor
),
4573 value_pointer (bounds
,
4574 desc_type
->field (1).type ()),
4575 fat_pntr_bounds_bitpos (desc_type
),
4576 fat_pntr_bounds_bitsize (desc_type
));
4578 descriptor
= ensure_lval (descriptor
);
4580 if (type
->code () == TYPE_CODE_PTR
)
4581 return value_addr (descriptor
);
4586 /* Symbol Cache Module */
4588 /* Performance measurements made as of 2010-01-15 indicate that
4589 this cache does bring some noticeable improvements. Depending
4590 on the type of entity being printed, the cache can make it as much
4591 as an order of magnitude faster than without it.
4593 The descriptive type DWARF extension has significantly reduced
4594 the need for this cache, at least when DWARF is being used. However,
4595 even in this case, some expensive name-based symbol searches are still
4596 sometimes necessary - to find an XVZ variable, mostly. */
4598 /* Return the symbol cache associated to the given program space PSPACE.
4599 If not allocated for this PSPACE yet, allocate and initialize one. */
4601 static struct ada_symbol_cache
*
4602 ada_get_symbol_cache (struct program_space
*pspace
)
4604 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4606 if (pspace_data
->sym_cache
== nullptr)
4607 pspace_data
->sym_cache
.reset (new ada_symbol_cache
);
4609 return pspace_data
->sym_cache
.get ();
4612 /* Clear all entries from the symbol cache. */
4615 ada_clear_symbol_cache ()
4617 struct ada_pspace_data
*pspace_data
4618 = get_ada_pspace_data (current_program_space
);
4620 if (pspace_data
->sym_cache
!= nullptr)
4621 pspace_data
->sym_cache
.reset ();
4624 /* Search our cache for an entry matching NAME and DOMAIN.
4625 Return it if found, or NULL otherwise. */
4627 static struct cache_entry
**
4628 find_entry (const char *name
, domain_enum domain
)
4630 struct ada_symbol_cache
*sym_cache
4631 = ada_get_symbol_cache (current_program_space
);
4632 int h
= msymbol_hash (name
) % HASH_SIZE
;
4633 struct cache_entry
**e
;
4635 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4637 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4643 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4644 Return 1 if found, 0 otherwise.
4646 If an entry was found and SYM is not NULL, set *SYM to the entry's
4647 SYM. Same principle for BLOCK if not NULL. */
4650 lookup_cached_symbol (const char *name
, domain_enum domain
,
4651 struct symbol
**sym
, const struct block
**block
)
4653 struct cache_entry
**e
= find_entry (name
, domain
);
4660 *block
= (*e
)->block
;
4664 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4665 in domain DOMAIN, save this result in our symbol cache. */
4668 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4669 const struct block
*block
)
4671 struct ada_symbol_cache
*sym_cache
4672 = ada_get_symbol_cache (current_program_space
);
4674 struct cache_entry
*e
;
4676 /* Symbols for builtin types don't have a block.
4677 For now don't cache such symbols. */
4678 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4681 /* If the symbol is a local symbol, then do not cache it, as a search
4682 for that symbol depends on the context. To determine whether
4683 the symbol is local or not, we check the block where we found it
4684 against the global and static blocks of its associated symtab. */
4686 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4687 GLOBAL_BLOCK
) != block
4688 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4689 STATIC_BLOCK
) != block
)
4692 h
= msymbol_hash (name
) % HASH_SIZE
;
4693 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4694 e
->next
= sym_cache
->root
[h
];
4695 sym_cache
->root
[h
] = e
;
4696 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4704 /* Return the symbol name match type that should be used used when
4705 searching for all symbols matching LOOKUP_NAME.
4707 LOOKUP_NAME is expected to be a symbol name after transformation
4710 static symbol_name_match_type
4711 name_match_type_from_name (const char *lookup_name
)
4713 return (strstr (lookup_name
, "__") == NULL
4714 ? symbol_name_match_type::WILD
4715 : symbol_name_match_type::FULL
);
4718 /* Return the result of a standard (literal, C-like) lookup of NAME in
4719 given DOMAIN, visible from lexical block BLOCK. */
4721 static struct symbol
*
4722 standard_lookup (const char *name
, const struct block
*block
,
4725 /* Initialize it just to avoid a GCC false warning. */
4726 struct block_symbol sym
= {};
4728 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4730 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4731 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4736 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4737 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4738 since they contend in overloading in the same way. */
4740 is_nonfunction (struct block_symbol syms
[], int n
)
4744 for (i
= 0; i
< n
; i
+= 1)
4745 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_FUNC
4746 && (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
4747 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4753 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4754 struct types. Otherwise, they may not. */
4757 equiv_types (struct type
*type0
, struct type
*type1
)
4761 if (type0
== NULL
|| type1
== NULL
4762 || type0
->code () != type1
->code ())
4764 if ((type0
->code () == TYPE_CODE_STRUCT
4765 || type0
->code () == TYPE_CODE_ENUM
)
4766 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4767 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4773 /* True iff SYM0 represents the same entity as SYM1, or one that is
4774 no more defined than that of SYM1. */
4777 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4781 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4782 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4785 switch (SYMBOL_CLASS (sym0
))
4791 struct type
*type0
= SYMBOL_TYPE (sym0
);
4792 struct type
*type1
= SYMBOL_TYPE (sym1
);
4793 const char *name0
= sym0
->linkage_name ();
4794 const char *name1
= sym1
->linkage_name ();
4795 int len0
= strlen (name0
);
4798 type0
->code () == type1
->code ()
4799 && (equiv_types (type0
, type1
)
4800 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4801 && startswith (name1
+ len0
, "___XV")));
4804 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4805 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4809 const char *name0
= sym0
->linkage_name ();
4810 const char *name1
= sym1
->linkage_name ();
4811 return (strcmp (name0
, name1
) == 0
4812 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4820 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4821 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4824 add_defn_to_vec (struct obstack
*obstackp
,
4826 const struct block
*block
)
4829 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4831 /* Do not try to complete stub types, as the debugger is probably
4832 already scanning all symbols matching a certain name at the
4833 time when this function is called. Trying to replace the stub
4834 type by its associated full type will cause us to restart a scan
4835 which may lead to an infinite recursion. Instead, the client
4836 collecting the matching symbols will end up collecting several
4837 matches, with at least one of them complete. It can then filter
4838 out the stub ones if needed. */
4840 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4842 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4844 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4846 prevDefns
[i
].symbol
= sym
;
4847 prevDefns
[i
].block
= block
;
4853 struct block_symbol info
;
4857 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4861 /* Number of block_symbol structures currently collected in current vector in
4865 num_defns_collected (struct obstack
*obstackp
)
4867 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4870 /* Vector of block_symbol structures currently collected in current vector in
4871 OBSTACKP. If FINISH, close off the vector and return its final address. */
4873 static struct block_symbol
*
4874 defns_collected (struct obstack
*obstackp
, int finish
)
4877 return (struct block_symbol
*) obstack_finish (obstackp
);
4879 return (struct block_symbol
*) obstack_base (obstackp
);
4882 /* Return a bound minimal symbol matching NAME according to Ada
4883 decoding rules. Returns an invalid symbol if there is no such
4884 minimal symbol. Names prefixed with "standard__" are handled
4885 specially: "standard__" is first stripped off, and only static and
4886 global symbols are searched. */
4888 struct bound_minimal_symbol
4889 ada_lookup_simple_minsym (const char *name
)
4891 struct bound_minimal_symbol result
;
4893 memset (&result
, 0, sizeof (result
));
4895 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4896 lookup_name_info
lookup_name (name
, match_type
);
4898 symbol_name_matcher_ftype
*match_name
4899 = ada_get_symbol_name_matcher (lookup_name
);
4901 for (objfile
*objfile
: current_program_space
->objfiles ())
4903 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4905 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4906 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4908 result
.minsym
= msymbol
;
4909 result
.objfile
= objfile
;
4918 /* For all subprograms that statically enclose the subprogram of the
4919 selected frame, add symbols matching identifier NAME in DOMAIN
4920 and their blocks to the list of data in OBSTACKP, as for
4921 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4922 with a wildcard prefix. */
4925 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4926 const lookup_name_info
&lookup_name
,
4931 /* True if TYPE is definitely an artificial type supplied to a symbol
4932 for which no debugging information was given in the symbol file. */
4935 is_nondebugging_type (struct type
*type
)
4937 const char *name
= ada_type_name (type
);
4939 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4942 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4943 that are deemed "identical" for practical purposes.
4945 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4946 types and that their number of enumerals is identical (in other
4947 words, type1->num_fields () == type2->num_fields ()). */
4950 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4954 /* The heuristic we use here is fairly conservative. We consider
4955 that 2 enumerate types are identical if they have the same
4956 number of enumerals and that all enumerals have the same
4957 underlying value and name. */
4959 /* All enums in the type should have an identical underlying value. */
4960 for (i
= 0; i
< type1
->num_fields (); i
++)
4961 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4964 /* All enumerals should also have the same name (modulo any numerical
4966 for (i
= 0; i
< type1
->num_fields (); i
++)
4968 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4969 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4970 int len_1
= strlen (name_1
);
4971 int len_2
= strlen (name_2
);
4973 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4974 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4976 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4977 TYPE_FIELD_NAME (type2
, i
),
4985 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4986 that are deemed "identical" for practical purposes. Sometimes,
4987 enumerals are not strictly identical, but their types are so similar
4988 that they can be considered identical.
4990 For instance, consider the following code:
4992 type Color is (Black, Red, Green, Blue, White);
4993 type RGB_Color is new Color range Red .. Blue;
4995 Type RGB_Color is a subrange of an implicit type which is a copy
4996 of type Color. If we call that implicit type RGB_ColorB ("B" is
4997 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4998 As a result, when an expression references any of the enumeral
4999 by name (Eg. "print green"), the expression is technically
5000 ambiguous and the user should be asked to disambiguate. But
5001 doing so would only hinder the user, since it wouldn't matter
5002 what choice he makes, the outcome would always be the same.
5003 So, for practical purposes, we consider them as the same. */
5006 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
5010 /* Before performing a thorough comparison check of each type,
5011 we perform a series of inexpensive checks. We expect that these
5012 checks will quickly fail in the vast majority of cases, and thus
5013 help prevent the unnecessary use of a more expensive comparison.
5014 Said comparison also expects us to make some of these checks
5015 (see ada_identical_enum_types_p). */
5017 /* Quick check: All symbols should have an enum type. */
5018 for (i
= 0; i
< syms
.size (); i
++)
5019 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
5022 /* Quick check: They should all have the same value. */
5023 for (i
= 1; i
< syms
.size (); i
++)
5024 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5027 /* Quick check: They should all have the same number of enumerals. */
5028 for (i
= 1; i
< syms
.size (); i
++)
5029 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
5030 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
5033 /* All the sanity checks passed, so we might have a set of
5034 identical enumeration types. Perform a more complete
5035 comparison of the type of each symbol. */
5036 for (i
= 1; i
< syms
.size (); i
++)
5037 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5038 SYMBOL_TYPE (syms
[0].symbol
)))
5044 /* Remove any non-debugging symbols in SYMS that definitely
5045 duplicate other symbols in the list (The only case I know of where
5046 this happens is when object files containing stabs-in-ecoff are
5047 linked with files containing ordinary ecoff debugging symbols (or no
5048 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5049 Returns the number of items in the modified list. */
5052 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5056 /* We should never be called with less than 2 symbols, as there
5057 cannot be any extra symbol in that case. But it's easy to
5058 handle, since we have nothing to do in that case. */
5059 if (syms
->size () < 2)
5060 return syms
->size ();
5063 while (i
< syms
->size ())
5067 /* If two symbols have the same name and one of them is a stub type,
5068 the get rid of the stub. */
5070 if (SYMBOL_TYPE ((*syms
)[i
].symbol
)->is_stub ()
5071 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5073 for (j
= 0; j
< syms
->size (); j
++)
5076 && !SYMBOL_TYPE ((*syms
)[j
].symbol
)->is_stub ()
5077 && (*syms
)[j
].symbol
->linkage_name () != NULL
5078 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5079 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5084 /* Two symbols with the same name, same class and same address
5085 should be identical. */
5087 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5088 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5089 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5091 for (j
= 0; j
< syms
->size (); j
+= 1)
5094 && (*syms
)[j
].symbol
->linkage_name () != NULL
5095 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5096 (*syms
)[j
].symbol
->linkage_name ()) == 0
5097 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5098 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5099 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5100 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5106 syms
->erase (syms
->begin () + i
);
5111 /* If all the remaining symbols are identical enumerals, then
5112 just keep the first one and discard the rest.
5114 Unlike what we did previously, we do not discard any entry
5115 unless they are ALL identical. This is because the symbol
5116 comparison is not a strict comparison, but rather a practical
5117 comparison. If all symbols are considered identical, then
5118 we can just go ahead and use the first one and discard the rest.
5119 But if we cannot reduce the list to a single element, we have
5120 to ask the user to disambiguate anyways. And if we have to
5121 present a multiple-choice menu, it's less confusing if the list
5122 isn't missing some choices that were identical and yet distinct. */
5123 if (symbols_are_identical_enums (*syms
))
5126 return syms
->size ();
5129 /* Given a type that corresponds to a renaming entity, use the type name
5130 to extract the scope (package name or function name, fully qualified,
5131 and following the GNAT encoding convention) where this renaming has been
5135 xget_renaming_scope (struct type
*renaming_type
)
5137 /* The renaming types adhere to the following convention:
5138 <scope>__<rename>___<XR extension>.
5139 So, to extract the scope, we search for the "___XR" extension,
5140 and then backtrack until we find the first "__". */
5142 const char *name
= renaming_type
->name ();
5143 const char *suffix
= strstr (name
, "___XR");
5146 /* Now, backtrack a bit until we find the first "__". Start looking
5147 at suffix - 3, as the <rename> part is at least one character long. */
5149 for (last
= suffix
- 3; last
> name
; last
--)
5150 if (last
[0] == '_' && last
[1] == '_')
5153 /* Make a copy of scope and return it. */
5154 return std::string (name
, last
);
5157 /* Return nonzero if NAME corresponds to a package name. */
5160 is_package_name (const char *name
)
5162 /* Here, We take advantage of the fact that no symbols are generated
5163 for packages, while symbols are generated for each function.
5164 So the condition for NAME represent a package becomes equivalent
5165 to NAME not existing in our list of symbols. There is only one
5166 small complication with library-level functions (see below). */
5168 /* If it is a function that has not been defined at library level,
5169 then we should be able to look it up in the symbols. */
5170 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5173 /* Library-level function names start with "_ada_". See if function
5174 "_ada_" followed by NAME can be found. */
5176 /* Do a quick check that NAME does not contain "__", since library-level
5177 functions names cannot contain "__" in them. */
5178 if (strstr (name
, "__") != NULL
)
5181 std::string fun_name
= string_printf ("_ada_%s", name
);
5183 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5186 /* Return nonzero if SYM corresponds to a renaming entity that is
5187 not visible from FUNCTION_NAME. */
5190 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5192 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5195 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5197 /* If the rename has been defined in a package, then it is visible. */
5198 if (is_package_name (scope
.c_str ()))
5201 /* Check that the rename is in the current function scope by checking
5202 that its name starts with SCOPE. */
5204 /* If the function name starts with "_ada_", it means that it is
5205 a library-level function. Strip this prefix before doing the
5206 comparison, as the encoding for the renaming does not contain
5208 if (startswith (function_name
, "_ada_"))
5211 return !startswith (function_name
, scope
.c_str ());
5214 /* Remove entries from SYMS that corresponds to a renaming entity that
5215 is not visible from the function associated with CURRENT_BLOCK or
5216 that is superfluous due to the presence of more specific renaming
5217 information. Places surviving symbols in the initial entries of
5218 SYMS and returns the number of surviving symbols.
5221 First, in cases where an object renaming is implemented as a
5222 reference variable, GNAT may produce both the actual reference
5223 variable and the renaming encoding. In this case, we discard the
5226 Second, GNAT emits a type following a specified encoding for each renaming
5227 entity. Unfortunately, STABS currently does not support the definition
5228 of types that are local to a given lexical block, so all renamings types
5229 are emitted at library level. As a consequence, if an application
5230 contains two renaming entities using the same name, and a user tries to
5231 print the value of one of these entities, the result of the ada symbol
5232 lookup will also contain the wrong renaming type.
5234 This function partially covers for this limitation by attempting to
5235 remove from the SYMS list renaming symbols that should be visible
5236 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5237 method with the current information available. The implementation
5238 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5240 - When the user tries to print a rename in a function while there
5241 is another rename entity defined in a package: Normally, the
5242 rename in the function has precedence over the rename in the
5243 package, so the latter should be removed from the list. This is
5244 currently not the case.
5246 - This function will incorrectly remove valid renames if
5247 the CURRENT_BLOCK corresponds to a function which symbol name
5248 has been changed by an "Export" pragma. As a consequence,
5249 the user will be unable to print such rename entities. */
5252 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5253 const struct block
*current_block
)
5255 struct symbol
*current_function
;
5256 const char *current_function_name
;
5258 int is_new_style_renaming
;
5260 /* If there is both a renaming foo___XR... encoded as a variable and
5261 a simple variable foo in the same block, discard the latter.
5262 First, zero out such symbols, then compress. */
5263 is_new_style_renaming
= 0;
5264 for (i
= 0; i
< syms
->size (); i
+= 1)
5266 struct symbol
*sym
= (*syms
)[i
].symbol
;
5267 const struct block
*block
= (*syms
)[i
].block
;
5271 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5273 name
= sym
->linkage_name ();
5274 suffix
= strstr (name
, "___XR");
5278 int name_len
= suffix
- name
;
5281 is_new_style_renaming
= 1;
5282 for (j
= 0; j
< syms
->size (); j
+= 1)
5283 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5284 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5286 && block
== (*syms
)[j
].block
)
5287 (*syms
)[j
].symbol
= NULL
;
5290 if (is_new_style_renaming
)
5294 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5295 if ((*syms
)[j
].symbol
!= NULL
)
5297 (*syms
)[k
] = (*syms
)[j
];
5303 /* Extract the function name associated to CURRENT_BLOCK.
5304 Abort if unable to do so. */
5306 if (current_block
== NULL
)
5307 return syms
->size ();
5309 current_function
= block_linkage_function (current_block
);
5310 if (current_function
== NULL
)
5311 return syms
->size ();
5313 current_function_name
= current_function
->linkage_name ();
5314 if (current_function_name
== NULL
)
5315 return syms
->size ();
5317 /* Check each of the symbols, and remove it from the list if it is
5318 a type corresponding to a renaming that is out of the scope of
5319 the current block. */
5322 while (i
< syms
->size ())
5324 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5325 == ADA_OBJECT_RENAMING
5326 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5327 current_function_name
))
5328 syms
->erase (syms
->begin () + i
);
5333 return syms
->size ();
5336 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5337 whose name and domain match NAME and DOMAIN respectively.
5338 If no match was found, then extend the search to "enclosing"
5339 routines (in other words, if we're inside a nested function,
5340 search the symbols defined inside the enclosing functions).
5341 If WILD_MATCH_P is nonzero, perform the naming matching in
5342 "wild" mode (see function "wild_match" for more info).
5344 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5347 ada_add_local_symbols (struct obstack
*obstackp
,
5348 const lookup_name_info
&lookup_name
,
5349 const struct block
*block
, domain_enum domain
)
5351 int block_depth
= 0;
5353 while (block
!= NULL
)
5356 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5358 /* If we found a non-function match, assume that's the one. */
5359 if (is_nonfunction (defns_collected (obstackp
, 0),
5360 num_defns_collected (obstackp
)))
5363 block
= BLOCK_SUPERBLOCK (block
);
5366 /* If no luck so far, try to find NAME as a local symbol in some lexically
5367 enclosing subprogram. */
5368 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5369 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5372 /* An object of this type is used as the user_data argument when
5373 calling the map_matching_symbols method. */
5377 struct objfile
*objfile
;
5378 struct obstack
*obstackp
;
5379 struct symbol
*arg_sym
;
5383 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5384 to a list of symbols. DATA is a pointer to a struct match_data *
5385 containing the obstack that collects the symbol list, the file that SYM
5386 must come from, a flag indicating whether a non-argument symbol has
5387 been found in the current block, and the last argument symbol
5388 passed in SYM within the current block (if any). When SYM is null,
5389 marking the end of a block, the argument symbol is added if no
5390 other has been found. */
5393 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5394 struct match_data
*data
)
5396 const struct block
*block
= bsym
->block
;
5397 struct symbol
*sym
= bsym
->symbol
;
5401 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5402 add_defn_to_vec (data
->obstackp
,
5403 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5405 data
->found_sym
= 0;
5406 data
->arg_sym
= NULL
;
5410 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5412 else if (SYMBOL_IS_ARGUMENT (sym
))
5413 data
->arg_sym
= sym
;
5416 data
->found_sym
= 1;
5417 add_defn_to_vec (data
->obstackp
,
5418 fixup_symbol_section (sym
, data
->objfile
),
5425 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5426 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5427 symbols to OBSTACKP. Return whether we found such symbols. */
5430 ada_add_block_renamings (struct obstack
*obstackp
,
5431 const struct block
*block
,
5432 const lookup_name_info
&lookup_name
,
5435 struct using_direct
*renaming
;
5436 int defns_mark
= num_defns_collected (obstackp
);
5438 symbol_name_matcher_ftype
*name_match
5439 = ada_get_symbol_name_matcher (lookup_name
);
5441 for (renaming
= block_using (block
);
5443 renaming
= renaming
->next
)
5447 /* Avoid infinite recursions: skip this renaming if we are actually
5448 already traversing it.
5450 Currently, symbol lookup in Ada don't use the namespace machinery from
5451 C++/Fortran support: skip namespace imports that use them. */
5452 if (renaming
->searched
5453 || (renaming
->import_src
!= NULL
5454 && renaming
->import_src
[0] != '\0')
5455 || (renaming
->import_dest
!= NULL
5456 && renaming
->import_dest
[0] != '\0'))
5458 renaming
->searched
= 1;
5460 /* TODO: here, we perform another name-based symbol lookup, which can
5461 pull its own multiple overloads. In theory, we should be able to do
5462 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5463 not a simple name. But in order to do this, we would need to enhance
5464 the DWARF reader to associate a symbol to this renaming, instead of a
5465 name. So, for now, we do something simpler: re-use the C++/Fortran
5466 namespace machinery. */
5467 r_name
= (renaming
->alias
!= NULL
5469 : renaming
->declaration
);
5470 if (name_match (r_name
, lookup_name
, NULL
))
5472 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5473 lookup_name
.match_type ());
5474 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5477 renaming
->searched
= 0;
5479 return num_defns_collected (obstackp
) != defns_mark
;
5482 /* Implements compare_names, but only applying the comparision using
5483 the given CASING. */
5486 compare_names_with_case (const char *string1
, const char *string2
,
5487 enum case_sensitivity casing
)
5489 while (*string1
!= '\0' && *string2
!= '\0')
5493 if (isspace (*string1
) || isspace (*string2
))
5494 return strcmp_iw_ordered (string1
, string2
);
5496 if (casing
== case_sensitive_off
)
5498 c1
= tolower (*string1
);
5499 c2
= tolower (*string2
);
5516 return strcmp_iw_ordered (string1
, string2
);
5518 if (*string2
== '\0')
5520 if (is_name_suffix (string1
))
5527 if (*string2
== '(')
5528 return strcmp_iw_ordered (string1
, string2
);
5531 if (casing
== case_sensitive_off
)
5532 return tolower (*string1
) - tolower (*string2
);
5534 return *string1
- *string2
;
5539 /* Compare STRING1 to STRING2, with results as for strcmp.
5540 Compatible with strcmp_iw_ordered in that...
5542 strcmp_iw_ordered (STRING1, STRING2) <= 0
5546 compare_names (STRING1, STRING2) <= 0
5548 (they may differ as to what symbols compare equal). */
5551 compare_names (const char *string1
, const char *string2
)
5555 /* Similar to what strcmp_iw_ordered does, we need to perform
5556 a case-insensitive comparison first, and only resort to
5557 a second, case-sensitive, comparison if the first one was
5558 not sufficient to differentiate the two strings. */
5560 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5562 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5567 /* Convenience function to get at the Ada encoded lookup name for
5568 LOOKUP_NAME, as a C string. */
5571 ada_lookup_name (const lookup_name_info
&lookup_name
)
5573 return lookup_name
.ada ().lookup_name ().c_str ();
5576 /* Add to OBSTACKP all non-local symbols whose name and domain match
5577 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5578 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5579 symbols otherwise. */
5582 add_nonlocal_symbols (struct obstack
*obstackp
,
5583 const lookup_name_info
&lookup_name
,
5584 domain_enum domain
, int global
)
5586 struct match_data data
;
5588 memset (&data
, 0, sizeof data
);
5589 data
.obstackp
= obstackp
;
5591 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5593 auto callback
= [&] (struct block_symbol
*bsym
)
5595 return aux_add_nonlocal_symbols (bsym
, &data
);
5598 for (objfile
*objfile
: current_program_space
->objfiles ())
5600 data
.objfile
= objfile
;
5602 if (objfile
->sf
!= nullptr)
5603 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5604 domain
, global
, callback
,
5606 ? NULL
: compare_names
));
5608 for (compunit_symtab
*cu
: objfile
->compunits ())
5610 const struct block
*global_block
5611 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5613 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5619 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5621 const char *name
= ada_lookup_name (lookup_name
);
5622 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5623 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5625 for (objfile
*objfile
: current_program_space
->objfiles ())
5627 data
.objfile
= objfile
;
5628 if (objfile
->sf
!= nullptr)
5629 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5630 domain
, global
, callback
,
5636 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5637 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5638 returning the number of matches. Add these to OBSTACKP.
5640 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5641 symbol match within the nest of blocks whose innermost member is BLOCK,
5642 is the one match returned (no other matches in that or
5643 enclosing blocks is returned). If there are any matches in or
5644 surrounding BLOCK, then these alone are returned.
5646 Names prefixed with "standard__" are handled specially:
5647 "standard__" is first stripped off (by the lookup_name
5648 constructor), and only static and global symbols are searched.
5650 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5651 to lookup global symbols. */
5654 ada_add_all_symbols (struct obstack
*obstackp
,
5655 const struct block
*block
,
5656 const lookup_name_info
&lookup_name
,
5659 int *made_global_lookup_p
)
5663 if (made_global_lookup_p
)
5664 *made_global_lookup_p
= 0;
5666 /* Special case: If the user specifies a symbol name inside package
5667 Standard, do a non-wild matching of the symbol name without
5668 the "standard__" prefix. This was primarily introduced in order
5669 to allow the user to specifically access the standard exceptions
5670 using, for instance, Standard.Constraint_Error when Constraint_Error
5671 is ambiguous (due to the user defining its own Constraint_Error
5672 entity inside its program). */
5673 if (lookup_name
.ada ().standard_p ())
5676 /* Check the non-global symbols. If we have ANY match, then we're done. */
5681 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5684 /* In the !full_search case we're are being called by
5685 iterate_over_symbols, and we don't want to search
5687 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5689 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5693 /* No non-global symbols found. Check our cache to see if we have
5694 already performed this search before. If we have, then return
5697 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5698 domain
, &sym
, &block
))
5701 add_defn_to_vec (obstackp
, sym
, block
);
5705 if (made_global_lookup_p
)
5706 *made_global_lookup_p
= 1;
5708 /* Search symbols from all global blocks. */
5710 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5712 /* Now add symbols from all per-file blocks if we've gotten no hits
5713 (not strictly correct, but perhaps better than an error). */
5715 if (num_defns_collected (obstackp
) == 0)
5716 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5719 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5720 is non-zero, enclosing scope and in global scopes, returning the number of
5722 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5723 found and the blocks and symbol tables (if any) in which they were
5726 When full_search is non-zero, any non-function/non-enumeral
5727 symbol match within the nest of blocks whose innermost member is BLOCK,
5728 is the one match returned (no other matches in that or
5729 enclosing blocks is returned). If there are any matches in or
5730 surrounding BLOCK, then these alone are returned.
5732 Names prefixed with "standard__" are handled specially: "standard__"
5733 is first stripped off, and only static and global symbols are searched. */
5736 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5737 const struct block
*block
,
5739 std::vector
<struct block_symbol
> *results
,
5742 int syms_from_global_search
;
5744 auto_obstack obstack
;
5746 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5747 domain
, full_search
, &syms_from_global_search
);
5749 ndefns
= num_defns_collected (&obstack
);
5751 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5752 for (int i
= 0; i
< ndefns
; ++i
)
5753 results
->push_back (base
[i
]);
5755 ndefns
= remove_extra_symbols (results
);
5757 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5758 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5760 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5761 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5762 (*results
)[0].symbol
, (*results
)[0].block
);
5764 ndefns
= remove_irrelevant_renamings (results
, block
);
5769 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5770 in global scopes, returning the number of matches, and filling *RESULTS
5771 with (SYM,BLOCK) tuples.
5773 See ada_lookup_symbol_list_worker for further details. */
5776 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5778 std::vector
<struct block_symbol
> *results
)
5780 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5781 lookup_name_info
lookup_name (name
, name_match_type
);
5783 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5786 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5787 to 1, but choosing the first symbol found if there are multiple
5790 The result is stored in *INFO, which must be non-NULL.
5791 If no match is found, INFO->SYM is set to NULL. */
5794 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5796 struct block_symbol
*info
)
5798 /* Since we already have an encoded name, wrap it in '<>' to force a
5799 verbatim match. Otherwise, if the name happens to not look like
5800 an encoded name (because it doesn't include a "__"),
5801 ada_lookup_name_info would re-encode/fold it again, and that
5802 would e.g., incorrectly lowercase object renaming names like
5803 "R28b" -> "r28b". */
5804 std::string verbatim
= add_angle_brackets (name
);
5806 gdb_assert (info
!= NULL
);
5807 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5810 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5811 scope and in global scopes, or NULL if none. NAME is folded and
5812 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5813 choosing the first symbol if there are multiple choices. */
5816 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5819 std::vector
<struct block_symbol
> candidates
;
5822 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5824 if (n_candidates
== 0)
5827 block_symbol info
= candidates
[0];
5828 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5833 /* True iff STR is a possible encoded suffix of a normal Ada name
5834 that is to be ignored for matching purposes. Suffixes of parallel
5835 names (e.g., XVE) are not included here. Currently, the possible suffixes
5836 are given by any of the regular expressions:
5838 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5839 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5840 TKB [subprogram suffix for task bodies]
5841 _E[0-9]+[bs]$ [protected object entry suffixes]
5842 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5844 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5845 match is performed. This sequence is used to differentiate homonyms,
5846 is an optional part of a valid name suffix. */
5849 is_name_suffix (const char *str
)
5852 const char *matching
;
5853 const int len
= strlen (str
);
5855 /* Skip optional leading __[0-9]+. */
5857 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5860 while (isdigit (str
[0]))
5866 if (str
[0] == '.' || str
[0] == '$')
5869 while (isdigit (matching
[0]))
5871 if (matching
[0] == '\0')
5877 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5880 while (isdigit (matching
[0]))
5882 if (matching
[0] == '\0')
5886 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5888 if (strcmp (str
, "TKB") == 0)
5892 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5893 with a N at the end. Unfortunately, the compiler uses the same
5894 convention for other internal types it creates. So treating
5895 all entity names that end with an "N" as a name suffix causes
5896 some regressions. For instance, consider the case of an enumerated
5897 type. To support the 'Image attribute, it creates an array whose
5899 Having a single character like this as a suffix carrying some
5900 information is a bit risky. Perhaps we should change the encoding
5901 to be something like "_N" instead. In the meantime, do not do
5902 the following check. */
5903 /* Protected Object Subprograms */
5904 if (len
== 1 && str
[0] == 'N')
5909 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5912 while (isdigit (matching
[0]))
5914 if ((matching
[0] == 'b' || matching
[0] == 's')
5915 && matching
[1] == '\0')
5919 /* ??? We should not modify STR directly, as we are doing below. This
5920 is fine in this case, but may become problematic later if we find
5921 that this alternative did not work, and want to try matching
5922 another one from the begining of STR. Since we modified it, we
5923 won't be able to find the begining of the string anymore! */
5927 while (str
[0] != '_' && str
[0] != '\0')
5929 if (str
[0] != 'n' && str
[0] != 'b')
5935 if (str
[0] == '\000')
5940 if (str
[1] != '_' || str
[2] == '\000')
5944 if (strcmp (str
+ 3, "JM") == 0)
5946 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5947 the LJM suffix in favor of the JM one. But we will
5948 still accept LJM as a valid suffix for a reasonable
5949 amount of time, just to allow ourselves to debug programs
5950 compiled using an older version of GNAT. */
5951 if (strcmp (str
+ 3, "LJM") == 0)
5955 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5956 || str
[4] == 'U' || str
[4] == 'P')
5958 if (str
[4] == 'R' && str
[5] != 'T')
5962 if (!isdigit (str
[2]))
5964 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5965 if (!isdigit (str
[k
]) && str
[k
] != '_')
5969 if (str
[0] == '$' && isdigit (str
[1]))
5971 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5972 if (!isdigit (str
[k
]) && str
[k
] != '_')
5979 /* Return non-zero if the string starting at NAME and ending before
5980 NAME_END contains no capital letters. */
5983 is_valid_name_for_wild_match (const char *name0
)
5985 std::string decoded_name
= ada_decode (name0
);
5988 /* If the decoded name starts with an angle bracket, it means that
5989 NAME0 does not follow the GNAT encoding format. It should then
5990 not be allowed as a possible wild match. */
5991 if (decoded_name
[0] == '<')
5994 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5995 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6001 /* Advance *NAMEP to next occurrence in the string NAME0 of the TARGET0
6002 character which could start a simple name. Assumes that *NAMEP points
6003 somewhere inside the string beginning at NAME0. */
6006 advance_wild_match (const char **namep
, const char *name0
, char target0
)
6008 const char *name
= *namep
;
6018 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6021 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6026 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6027 || name
[2] == target0
))
6032 else if (t1
== '_' && name
[2] == 'B' && name
[3] == '_')
6034 /* Names like "pkg__B_N__name", where N is a number, are
6035 block-local. We can handle these by simply skipping
6042 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6052 /* Return true iff NAME encodes a name of the form prefix.PATN.
6053 Ignores any informational suffixes of NAME (i.e., for which
6054 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6058 wild_match (const char *name
, const char *patn
)
6061 const char *name0
= name
;
6065 const char *match
= name
;
6069 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6072 if (*p
== '\0' && is_name_suffix (name
))
6073 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6075 if (name
[-1] == '_')
6078 if (!advance_wild_match (&name
, name0
, *patn
))
6083 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6084 *defn_symbols, updating the list of symbols in OBSTACKP (if
6085 necessary). OBJFILE is the section containing BLOCK. */
6088 ada_add_block_symbols (struct obstack
*obstackp
,
6089 const struct block
*block
,
6090 const lookup_name_info
&lookup_name
,
6091 domain_enum domain
, struct objfile
*objfile
)
6093 struct block_iterator iter
;
6094 /* A matching argument symbol, if any. */
6095 struct symbol
*arg_sym
;
6096 /* Set true when we find a matching non-argument symbol. */
6102 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6104 sym
= block_iter_match_next (lookup_name
, &iter
))
6106 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6108 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6110 if (SYMBOL_IS_ARGUMENT (sym
))
6115 add_defn_to_vec (obstackp
,
6116 fixup_symbol_section (sym
, objfile
),
6123 /* Handle renamings. */
6125 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6128 if (!found_sym
&& arg_sym
!= NULL
)
6130 add_defn_to_vec (obstackp
,
6131 fixup_symbol_section (arg_sym
, objfile
),
6135 if (!lookup_name
.ada ().wild_match_p ())
6139 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6140 const char *name
= ada_lookup_name
.c_str ();
6141 size_t name_len
= ada_lookup_name
.size ();
6143 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6145 if (symbol_matches_domain (sym
->language (),
6146 SYMBOL_DOMAIN (sym
), domain
))
6150 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6153 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6155 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6160 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6162 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6164 if (SYMBOL_IS_ARGUMENT (sym
))
6169 add_defn_to_vec (obstackp
,
6170 fixup_symbol_section (sym
, objfile
),
6178 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6179 They aren't parameters, right? */
6180 if (!found_sym
&& arg_sym
!= NULL
)
6182 add_defn_to_vec (obstackp
,
6183 fixup_symbol_section (arg_sym
, objfile
),
6190 /* Symbol Completion */
6195 ada_lookup_name_info::matches
6196 (const char *sym_name
,
6197 symbol_name_match_type match_type
,
6198 completion_match_result
*comp_match_res
) const
6201 const char *text
= m_encoded_name
.c_str ();
6202 size_t text_len
= m_encoded_name
.size ();
6204 /* First, test against the fully qualified name of the symbol. */
6206 if (strncmp (sym_name
, text
, text_len
) == 0)
6209 std::string decoded_name
= ada_decode (sym_name
);
6210 if (match
&& !m_encoded_p
)
6212 /* One needed check before declaring a positive match is to verify
6213 that iff we are doing a verbatim match, the decoded version
6214 of the symbol name starts with '<'. Otherwise, this symbol name
6215 is not a suitable completion. */
6217 bool has_angle_bracket
= (decoded_name
[0] == '<');
6218 match
= (has_angle_bracket
== m_verbatim_p
);
6221 if (match
&& !m_verbatim_p
)
6223 /* When doing non-verbatim match, another check that needs to
6224 be done is to verify that the potentially matching symbol name
6225 does not include capital letters, because the ada-mode would
6226 not be able to understand these symbol names without the
6227 angle bracket notation. */
6230 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6235 /* Second: Try wild matching... */
6237 if (!match
&& m_wild_match_p
)
6239 /* Since we are doing wild matching, this means that TEXT
6240 may represent an unqualified symbol name. We therefore must
6241 also compare TEXT against the unqualified name of the symbol. */
6242 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6244 if (strncmp (sym_name
, text
, text_len
) == 0)
6248 /* Finally: If we found a match, prepare the result to return. */
6253 if (comp_match_res
!= NULL
)
6255 std::string
&match_str
= comp_match_res
->match
.storage ();
6258 match_str
= ada_decode (sym_name
);
6262 match_str
= add_angle_brackets (sym_name
);
6264 match_str
= sym_name
;
6268 comp_match_res
->set_match (match_str
.c_str ());
6276 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6277 for tagged types. */
6280 ada_is_dispatch_table_ptr_type (struct type
*type
)
6284 if (type
->code () != TYPE_CODE_PTR
)
6287 name
= TYPE_TARGET_TYPE (type
)->name ();
6291 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6294 /* Return non-zero if TYPE is an interface tag. */
6297 ada_is_interface_tag (struct type
*type
)
6299 const char *name
= type
->name ();
6304 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6307 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6308 to be invisible to users. */
6311 ada_is_ignored_field (struct type
*type
, int field_num
)
6313 if (field_num
< 0 || field_num
> type
->num_fields ())
6316 /* Check the name of that field. */
6318 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6320 /* Anonymous field names should not be printed.
6321 brobecker/2007-02-20: I don't think this can actually happen
6322 but we don't want to print the value of anonymous fields anyway. */
6326 /* Normally, fields whose name start with an underscore ("_")
6327 are fields that have been internally generated by the compiler,
6328 and thus should not be printed. The "_parent" field is special,
6329 however: This is a field internally generated by the compiler
6330 for tagged types, and it contains the components inherited from
6331 the parent type. This field should not be printed as is, but
6332 should not be ignored either. */
6333 if (name
[0] == '_' && !startswith (name
, "_parent"))
6337 /* If this is the dispatch table of a tagged type or an interface tag,
6339 if (ada_is_tagged_type (type
, 1)
6340 && (ada_is_dispatch_table_ptr_type (type
->field (field_num
).type ())
6341 || ada_is_interface_tag (type
->field (field_num
).type ())))
6344 /* Not a special field, so it should not be ignored. */
6348 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6349 pointer or reference type whose ultimate target has a tag field. */
6352 ada_is_tagged_type (struct type
*type
, int refok
)
6354 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6357 /* True iff TYPE represents the type of X'Tag */
6360 ada_is_tag_type (struct type
*type
)
6362 type
= ada_check_typedef (type
);
6364 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6368 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6370 return (name
!= NULL
6371 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6375 /* The type of the tag on VAL. */
6377 static struct type
*
6378 ada_tag_type (struct value
*val
)
6380 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6383 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6384 retired at Ada 05). */
6387 is_ada95_tag (struct value
*tag
)
6389 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6392 /* The value of the tag on VAL. */
6394 static struct value
*
6395 ada_value_tag (struct value
*val
)
6397 return ada_value_struct_elt (val
, "_tag", 0);
6400 /* The value of the tag on the object of type TYPE whose contents are
6401 saved at VALADDR, if it is non-null, or is at memory address
6404 static struct value
*
6405 value_tag_from_contents_and_address (struct type
*type
,
6406 const gdb_byte
*valaddr
,
6409 int tag_byte_offset
;
6410 struct type
*tag_type
;
6412 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6415 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6417 : valaddr
+ tag_byte_offset
);
6418 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6420 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6425 static struct type
*
6426 type_from_tag (struct value
*tag
)
6428 gdb::unique_xmalloc_ptr
<char> type_name
= ada_tag_name (tag
);
6430 if (type_name
!= NULL
)
6431 return ada_find_any_type (ada_encode (type_name
.get ()).c_str ());
6435 /* Given a value OBJ of a tagged type, return a value of this
6436 type at the base address of the object. The base address, as
6437 defined in Ada.Tags, it is the address of the primary tag of
6438 the object, and therefore where the field values of its full
6439 view can be fetched. */
6442 ada_tag_value_at_base_address (struct value
*obj
)
6445 LONGEST offset_to_top
= 0;
6446 struct type
*ptr_type
, *obj_type
;
6448 CORE_ADDR base_address
;
6450 obj_type
= value_type (obj
);
6452 /* It is the responsability of the caller to deref pointers. */
6454 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6457 tag
= ada_value_tag (obj
);
6461 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6463 if (is_ada95_tag (tag
))
6466 ptr_type
= language_lookup_primitive_type
6467 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6468 ptr_type
= lookup_pointer_type (ptr_type
);
6469 val
= value_cast (ptr_type
, tag
);
6473 /* It is perfectly possible that an exception be raised while
6474 trying to determine the base address, just like for the tag;
6475 see ada_tag_name for more details. We do not print the error
6476 message for the same reason. */
6480 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6483 catch (const gdb_exception_error
&e
)
6488 /* If offset is null, nothing to do. */
6490 if (offset_to_top
== 0)
6493 /* -1 is a special case in Ada.Tags; however, what should be done
6494 is not quite clear from the documentation. So do nothing for
6497 if (offset_to_top
== -1)
6500 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6501 from the base address. This was however incompatible with
6502 C++ dispatch table: C++ uses a *negative* value to *add*
6503 to the base address. Ada's convention has therefore been
6504 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6505 use the same convention. Here, we support both cases by
6506 checking the sign of OFFSET_TO_TOP. */
6508 if (offset_to_top
> 0)
6509 offset_to_top
= -offset_to_top
;
6511 base_address
= value_address (obj
) + offset_to_top
;
6512 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6514 /* Make sure that we have a proper tag at the new address.
6515 Otherwise, offset_to_top is bogus (which can happen when
6516 the object is not initialized yet). */
6521 obj_type
= type_from_tag (tag
);
6526 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6529 /* Return the "ada__tags__type_specific_data" type. */
6531 static struct type
*
6532 ada_get_tsd_type (struct inferior
*inf
)
6534 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6536 if (data
->tsd_type
== 0)
6537 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6538 return data
->tsd_type
;
6541 /* Return the TSD (type-specific data) associated to the given TAG.
6542 TAG is assumed to be the tag of a tagged-type entity.
6544 May return NULL if we are unable to get the TSD. */
6546 static struct value
*
6547 ada_get_tsd_from_tag (struct value
*tag
)
6552 /* First option: The TSD is simply stored as a field of our TAG.
6553 Only older versions of GNAT would use this format, but we have
6554 to test it first, because there are no visible markers for
6555 the current approach except the absence of that field. */
6557 val
= ada_value_struct_elt (tag
, "tsd", 1);
6561 /* Try the second representation for the dispatch table (in which
6562 there is no explicit 'tsd' field in the referent of the tag pointer,
6563 and instead the tsd pointer is stored just before the dispatch
6566 type
= ada_get_tsd_type (current_inferior());
6569 type
= lookup_pointer_type (lookup_pointer_type (type
));
6570 val
= value_cast (type
, tag
);
6573 return value_ind (value_ptradd (val
, -1));
6576 /* Given the TSD of a tag (type-specific data), return a string
6577 containing the name of the associated type.
6579 May return NULL if we are unable to determine the tag name. */
6581 static gdb::unique_xmalloc_ptr
<char>
6582 ada_tag_name_from_tsd (struct value
*tsd
)
6587 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6590 gdb::unique_xmalloc_ptr
<char> buffer
6591 = target_read_string (value_as_address (val
), INT_MAX
);
6592 if (buffer
== nullptr)
6595 for (p
= buffer
.get (); *p
!= '\0'; ++p
)
6604 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6607 Return NULL if the TAG is not an Ada tag, or if we were unable to
6608 determine the name of that tag. */
6610 gdb::unique_xmalloc_ptr
<char>
6611 ada_tag_name (struct value
*tag
)
6613 gdb::unique_xmalloc_ptr
<char> name
;
6615 if (!ada_is_tag_type (value_type (tag
)))
6618 /* It is perfectly possible that an exception be raised while trying
6619 to determine the TAG's name, even under normal circumstances:
6620 The associated variable may be uninitialized or corrupted, for
6621 instance. We do not let any exception propagate past this point.
6622 instead we return NULL.
6624 We also do not print the error message either (which often is very
6625 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6626 the caller print a more meaningful message if necessary. */
6629 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6632 name
= ada_tag_name_from_tsd (tsd
);
6634 catch (const gdb_exception_error
&e
)
6641 /* The parent type of TYPE, or NULL if none. */
6644 ada_parent_type (struct type
*type
)
6648 type
= ada_check_typedef (type
);
6650 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6653 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6654 if (ada_is_parent_field (type
, i
))
6656 struct type
*parent_type
= type
->field (i
).type ();
6658 /* If the _parent field is a pointer, then dereference it. */
6659 if (parent_type
->code () == TYPE_CODE_PTR
)
6660 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6661 /* If there is a parallel XVS type, get the actual base type. */
6662 parent_type
= ada_get_base_type (parent_type
);
6664 return ada_check_typedef (parent_type
);
6670 /* True iff field number FIELD_NUM of structure type TYPE contains the
6671 parent-type (inherited) fields of a derived type. Assumes TYPE is
6672 a structure type with at least FIELD_NUM+1 fields. */
6675 ada_is_parent_field (struct type
*type
, int field_num
)
6677 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6679 return (name
!= NULL
6680 && (startswith (name
, "PARENT")
6681 || startswith (name
, "_parent")));
6684 /* True iff field number FIELD_NUM of structure type TYPE is a
6685 transparent wrapper field (which should be silently traversed when doing
6686 field selection and flattened when printing). Assumes TYPE is a
6687 structure type with at least FIELD_NUM+1 fields. Such fields are always
6691 ada_is_wrapper_field (struct type
*type
, int field_num
)
6693 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6695 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6697 /* This happens in functions with "out" or "in out" parameters
6698 which are passed by copy. For such functions, GNAT describes
6699 the function's return type as being a struct where the return
6700 value is in a field called RETVAL, and where the other "out"
6701 or "in out" parameters are fields of that struct. This is not
6706 return (name
!= NULL
6707 && (startswith (name
, "PARENT")
6708 || strcmp (name
, "REP") == 0
6709 || startswith (name
, "_parent")
6710 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6713 /* True iff field number FIELD_NUM of structure or union type TYPE
6714 is a variant wrapper. Assumes TYPE is a structure type with at least
6715 FIELD_NUM+1 fields. */
6718 ada_is_variant_part (struct type
*type
, int field_num
)
6720 /* Only Ada types are eligible. */
6721 if (!ADA_TYPE_P (type
))
6724 struct type
*field_type
= type
->field (field_num
).type ();
6726 return (field_type
->code () == TYPE_CODE_UNION
6727 || (is_dynamic_field (type
, field_num
)
6728 && (TYPE_TARGET_TYPE (field_type
)->code ()
6729 == TYPE_CODE_UNION
)));
6732 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6733 whose discriminants are contained in the record type OUTER_TYPE,
6734 returns the type of the controlling discriminant for the variant.
6735 May return NULL if the type could not be found. */
6738 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6740 const char *name
= ada_variant_discrim_name (var_type
);
6742 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6745 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6746 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6747 represents a 'when others' clause; otherwise 0. */
6750 ada_is_others_clause (struct type
*type
, int field_num
)
6752 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6754 return (name
!= NULL
&& name
[0] == 'O');
6757 /* Assuming that TYPE0 is the type of the variant part of a record,
6758 returns the name of the discriminant controlling the variant.
6759 The value is valid until the next call to ada_variant_discrim_name. */
6762 ada_variant_discrim_name (struct type
*type0
)
6764 static char *result
= NULL
;
6765 static size_t result_len
= 0;
6768 const char *discrim_end
;
6769 const char *discrim_start
;
6771 if (type0
->code () == TYPE_CODE_PTR
)
6772 type
= TYPE_TARGET_TYPE (type0
);
6776 name
= ada_type_name (type
);
6778 if (name
== NULL
|| name
[0] == '\000')
6781 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6784 if (startswith (discrim_end
, "___XVN"))
6787 if (discrim_end
== name
)
6790 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6793 if (discrim_start
== name
+ 1)
6795 if ((discrim_start
> name
+ 3
6796 && startswith (discrim_start
- 3, "___"))
6797 || discrim_start
[-1] == '.')
6801 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6802 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6803 result
[discrim_end
- discrim_start
] = '\0';
6807 /* Scan STR for a subtype-encoded number, beginning at position K.
6808 Put the position of the character just past the number scanned in
6809 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6810 Return 1 if there was a valid number at the given position, and 0
6811 otherwise. A "subtype-encoded" number consists of the absolute value
6812 in decimal, followed by the letter 'm' to indicate a negative number.
6813 Assumes 0m does not occur. */
6816 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6820 if (!isdigit (str
[k
]))
6823 /* Do it the hard way so as not to make any assumption about
6824 the relationship of unsigned long (%lu scan format code) and
6827 while (isdigit (str
[k
]))
6829 RU
= RU
* 10 + (str
[k
] - '0');
6836 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6842 /* NOTE on the above: Technically, C does not say what the results of
6843 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6844 number representable as a LONGEST (although either would probably work
6845 in most implementations). When RU>0, the locution in the then branch
6846 above is always equivalent to the negative of RU. */
6853 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6854 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6855 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6858 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6860 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6874 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6884 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6885 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6887 if (val
>= L
&& val
<= U
)
6899 /* FIXME: Lots of redundancy below. Try to consolidate. */
6901 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6902 ARG_TYPE, extract and return the value of one of its (non-static)
6903 fields. FIELDNO says which field. Differs from value_primitive_field
6904 only in that it can handle packed values of arbitrary type. */
6907 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6908 struct type
*arg_type
)
6912 arg_type
= ada_check_typedef (arg_type
);
6913 type
= arg_type
->field (fieldno
).type ();
6915 /* Handle packed fields. It might be that the field is not packed
6916 relative to its containing structure, but the structure itself is
6917 packed; in this case we must take the bit-field path. */
6918 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
6920 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6921 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6923 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6924 offset
+ bit_pos
/ 8,
6925 bit_pos
% 8, bit_size
, type
);
6928 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6931 /* Find field with name NAME in object of type TYPE. If found,
6932 set the following for each argument that is non-null:
6933 - *FIELD_TYPE_P to the field's type;
6934 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6935 an object of that type;
6936 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6937 - *BIT_SIZE_P to its size in bits if the field is packed, and
6939 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6940 fields up to but not including the desired field, or by the total
6941 number of fields if not found. A NULL value of NAME never
6942 matches; the function just counts visible fields in this case.
6944 Notice that we need to handle when a tagged record hierarchy
6945 has some components with the same name, like in this scenario:
6947 type Top_T is tagged record
6953 type Middle_T is new Top.Top_T with record
6954 N : Character := 'a';
6958 type Bottom_T is new Middle.Middle_T with record
6960 C : Character := '5';
6962 A : Character := 'J';
6965 Let's say we now have a variable declared and initialized as follow:
6967 TC : Top_A := new Bottom_T;
6969 And then we use this variable to call this function
6971 procedure Assign (Obj: in out Top_T; TV : Integer);
6975 Assign (Top_T (B), 12);
6977 Now, we're in the debugger, and we're inside that procedure
6978 then and we want to print the value of obj.c:
6980 Usually, the tagged record or one of the parent type owns the
6981 component to print and there's no issue but in this particular
6982 case, what does it mean to ask for Obj.C? Since the actual
6983 type for object is type Bottom_T, it could mean two things: type
6984 component C from the Middle_T view, but also component C from
6985 Bottom_T. So in that "undefined" case, when the component is
6986 not found in the non-resolved type (which includes all the
6987 components of the parent type), then resolve it and see if we
6988 get better luck once expanded.
6990 In the case of homonyms in the derived tagged type, we don't
6991 guaranty anything, and pick the one that's easiest for us
6994 Returns 1 if found, 0 otherwise. */
6997 find_struct_field (const char *name
, struct type
*type
, int offset
,
6998 struct type
**field_type_p
,
6999 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7003 int parent_offset
= -1;
7005 type
= ada_check_typedef (type
);
7007 if (field_type_p
!= NULL
)
7008 *field_type_p
= NULL
;
7009 if (byte_offset_p
!= NULL
)
7011 if (bit_offset_p
!= NULL
)
7013 if (bit_size_p
!= NULL
)
7016 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7018 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7019 int fld_offset
= offset
+ bit_pos
/ 8;
7020 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7022 if (t_field_name
== NULL
)
7025 else if (ada_is_parent_field (type
, i
))
7027 /* This is a field pointing us to the parent type of a tagged
7028 type. As hinted in this function's documentation, we give
7029 preference to fields in the current record first, so what
7030 we do here is just record the index of this field before
7031 we skip it. If it turns out we couldn't find our field
7032 in the current record, then we'll get back to it and search
7033 inside it whether the field might exist in the parent. */
7039 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7041 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7043 if (field_type_p
!= NULL
)
7044 *field_type_p
= type
->field (i
).type ();
7045 if (byte_offset_p
!= NULL
)
7046 *byte_offset_p
= fld_offset
;
7047 if (bit_offset_p
!= NULL
)
7048 *bit_offset_p
= bit_pos
% 8;
7049 if (bit_size_p
!= NULL
)
7050 *bit_size_p
= bit_size
;
7053 else if (ada_is_wrapper_field (type
, i
))
7055 if (find_struct_field (name
, type
->field (i
).type (), fld_offset
,
7056 field_type_p
, byte_offset_p
, bit_offset_p
,
7057 bit_size_p
, index_p
))
7060 else if (ada_is_variant_part (type
, i
))
7062 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7065 struct type
*field_type
7066 = ada_check_typedef (type
->field (i
).type ());
7068 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7070 if (find_struct_field (name
, field_type
->field (j
).type (),
7072 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7073 field_type_p
, byte_offset_p
,
7074 bit_offset_p
, bit_size_p
, index_p
))
7078 else if (index_p
!= NULL
)
7082 /* Field not found so far. If this is a tagged type which
7083 has a parent, try finding that field in the parent now. */
7085 if (parent_offset
!= -1)
7087 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7088 int fld_offset
= offset
+ bit_pos
/ 8;
7090 if (find_struct_field (name
, type
->field (parent_offset
).type (),
7091 fld_offset
, field_type_p
, byte_offset_p
,
7092 bit_offset_p
, bit_size_p
, index_p
))
7099 /* Number of user-visible fields in record type TYPE. */
7102 num_visible_fields (struct type
*type
)
7107 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7111 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7112 and search in it assuming it has (class) type TYPE.
7113 If found, return value, else return NULL.
7115 Searches recursively through wrapper fields (e.g., '_parent').
7117 In the case of homonyms in the tagged types, please refer to the
7118 long explanation in find_struct_field's function documentation. */
7120 static struct value
*
7121 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7125 int parent_offset
= -1;
7127 type
= ada_check_typedef (type
);
7128 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7130 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7132 if (t_field_name
== NULL
)
7135 else if (ada_is_parent_field (type
, i
))
7137 /* This is a field pointing us to the parent type of a tagged
7138 type. As hinted in this function's documentation, we give
7139 preference to fields in the current record first, so what
7140 we do here is just record the index of this field before
7141 we skip it. If it turns out we couldn't find our field
7142 in the current record, then we'll get back to it and search
7143 inside it whether the field might exist in the parent. */
7149 else if (field_name_match (t_field_name
, name
))
7150 return ada_value_primitive_field (arg
, offset
, i
, type
);
7152 else if (ada_is_wrapper_field (type
, i
))
7154 struct value
*v
= /* Do not let indent join lines here. */
7155 ada_search_struct_field (name
, arg
,
7156 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7157 type
->field (i
).type ());
7163 else if (ada_is_variant_part (type
, i
))
7165 /* PNH: Do we ever get here? See find_struct_field. */
7167 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7168 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7170 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7172 struct value
*v
= ada_search_struct_field
/* Force line
7175 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7176 field_type
->field (j
).type ());
7184 /* Field not found so far. If this is a tagged type which
7185 has a parent, try finding that field in the parent now. */
7187 if (parent_offset
!= -1)
7189 struct value
*v
= ada_search_struct_field (
7190 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7191 type
->field (parent_offset
).type ());
7200 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7201 int, struct type
*);
7204 /* Return field #INDEX in ARG, where the index is that returned by
7205 * find_struct_field through its INDEX_P argument. Adjust the address
7206 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7207 * If found, return value, else return NULL. */
7209 static struct value
*
7210 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7213 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7217 /* Auxiliary function for ada_index_struct_field. Like
7218 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7221 static struct value
*
7222 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7226 type
= ada_check_typedef (type
);
7228 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7230 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7232 else if (ada_is_wrapper_field (type
, i
))
7234 struct value
*v
= /* Do not let indent join lines here. */
7235 ada_index_struct_field_1 (index_p
, arg
,
7236 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7237 type
->field (i
).type ());
7243 else if (ada_is_variant_part (type
, i
))
7245 /* PNH: Do we ever get here? See ada_search_struct_field,
7246 find_struct_field. */
7247 error (_("Cannot assign this kind of variant record"));
7249 else if (*index_p
== 0)
7250 return ada_value_primitive_field (arg
, offset
, i
, type
);
7257 /* Return a string representation of type TYPE. */
7260 type_as_string (struct type
*type
)
7262 string_file tmp_stream
;
7264 type_print (type
, "", &tmp_stream
, -1);
7266 return std::move (tmp_stream
.string ());
7269 /* Given a type TYPE, look up the type of the component of type named NAME.
7270 If DISPP is non-null, add its byte displacement from the beginning of a
7271 structure (pointed to by a value) of type TYPE to *DISPP (does not
7272 work for packed fields).
7274 Matches any field whose name has NAME as a prefix, possibly
7277 TYPE can be either a struct or union. If REFOK, TYPE may also
7278 be a (pointer or reference)+ to a struct or union, and the
7279 ultimate target type will be searched.
7281 Looks recursively into variant clauses and parent types.
7283 In the case of homonyms in the tagged types, please refer to the
7284 long explanation in find_struct_field's function documentation.
7286 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7287 TYPE is not a type of the right kind. */
7289 static struct type
*
7290 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7294 int parent_offset
= -1;
7299 if (refok
&& type
!= NULL
)
7302 type
= ada_check_typedef (type
);
7303 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7305 type
= TYPE_TARGET_TYPE (type
);
7309 || (type
->code () != TYPE_CODE_STRUCT
7310 && type
->code () != TYPE_CODE_UNION
))
7315 error (_("Type %s is not a structure or union type"),
7316 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7319 type
= to_static_fixed_type (type
);
7321 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7323 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7326 if (t_field_name
== NULL
)
7329 else if (ada_is_parent_field (type
, i
))
7331 /* This is a field pointing us to the parent type of a tagged
7332 type. As hinted in this function's documentation, we give
7333 preference to fields in the current record first, so what
7334 we do here is just record the index of this field before
7335 we skip it. If it turns out we couldn't find our field
7336 in the current record, then we'll get back to it and search
7337 inside it whether the field might exist in the parent. */
7343 else if (field_name_match (t_field_name
, name
))
7344 return type
->field (i
).type ();
7346 else if (ada_is_wrapper_field (type
, i
))
7348 t
= ada_lookup_struct_elt_type (type
->field (i
).type (), name
,
7354 else if (ada_is_variant_part (type
, i
))
7357 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7359 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
7361 /* FIXME pnh 2008/01/26: We check for a field that is
7362 NOT wrapped in a struct, since the compiler sometimes
7363 generates these for unchecked variant types. Revisit
7364 if the compiler changes this practice. */
7365 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7367 if (v_field_name
!= NULL
7368 && field_name_match (v_field_name
, name
))
7369 t
= field_type
->field (j
).type ();
7371 t
= ada_lookup_struct_elt_type (field_type
->field (j
).type (),
7381 /* Field not found so far. If this is a tagged type which
7382 has a parent, try finding that field in the parent now. */
7384 if (parent_offset
!= -1)
7388 t
= ada_lookup_struct_elt_type (type
->field (parent_offset
).type (),
7397 const char *name_str
= name
!= NULL
? name
: _("<null>");
7399 error (_("Type %s has no component named %s"),
7400 type_as_string (type
).c_str (), name_str
);
7406 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7407 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7408 represents an unchecked union (that is, the variant part of a
7409 record that is named in an Unchecked_Union pragma). */
7412 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7414 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7416 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7420 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7421 within OUTER, determine which variant clause (field number in VAR_TYPE,
7422 numbering from 0) is applicable. Returns -1 if none are. */
7425 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7429 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7430 struct value
*discrim
;
7431 LONGEST discrim_val
;
7433 /* Using plain value_from_contents_and_address here causes problems
7434 because we will end up trying to resolve a type that is currently
7435 being constructed. */
7436 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7437 if (discrim
== NULL
)
7439 discrim_val
= value_as_long (discrim
);
7442 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7444 if (ada_is_others_clause (var_type
, i
))
7446 else if (ada_in_variant (discrim_val
, var_type
, i
))
7450 return others_clause
;
7455 /* Dynamic-Sized Records */
7457 /* Strategy: The type ostensibly attached to a value with dynamic size
7458 (i.e., a size that is not statically recorded in the debugging
7459 data) does not accurately reflect the size or layout of the value.
7460 Our strategy is to convert these values to values with accurate,
7461 conventional types that are constructed on the fly. */
7463 /* There is a subtle and tricky problem here. In general, we cannot
7464 determine the size of dynamic records without its data. However,
7465 the 'struct value' data structure, which GDB uses to represent
7466 quantities in the inferior process (the target), requires the size
7467 of the type at the time of its allocation in order to reserve space
7468 for GDB's internal copy of the data. That's why the
7469 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7470 rather than struct value*s.
7472 However, GDB's internal history variables ($1, $2, etc.) are
7473 struct value*s containing internal copies of the data that are not, in
7474 general, the same as the data at their corresponding addresses in
7475 the target. Fortunately, the types we give to these values are all
7476 conventional, fixed-size types (as per the strategy described
7477 above), so that we don't usually have to perform the
7478 'to_fixed_xxx_type' conversions to look at their values.
7479 Unfortunately, there is one exception: if one of the internal
7480 history variables is an array whose elements are unconstrained
7481 records, then we will need to create distinct fixed types for each
7482 element selected. */
7484 /* The upshot of all of this is that many routines take a (type, host
7485 address, target address) triple as arguments to represent a value.
7486 The host address, if non-null, is supposed to contain an internal
7487 copy of the relevant data; otherwise, the program is to consult the
7488 target at the target address. */
7490 /* Assuming that VAL0 represents a pointer value, the result of
7491 dereferencing it. Differs from value_ind in its treatment of
7492 dynamic-sized types. */
7495 ada_value_ind (struct value
*val0
)
7497 struct value
*val
= value_ind (val0
);
7499 if (ada_is_tagged_type (value_type (val
), 0))
7500 val
= ada_tag_value_at_base_address (val
);
7502 return ada_to_fixed_value (val
);
7505 /* The value resulting from dereferencing any "reference to"
7506 qualifiers on VAL0. */
7508 static struct value
*
7509 ada_coerce_ref (struct value
*val0
)
7511 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7513 struct value
*val
= val0
;
7515 val
= coerce_ref (val
);
7517 if (ada_is_tagged_type (value_type (val
), 0))
7518 val
= ada_tag_value_at_base_address (val
);
7520 return ada_to_fixed_value (val
);
7526 /* Return the bit alignment required for field #F of template type TYPE. */
7529 field_alignment (struct type
*type
, int f
)
7531 const char *name
= TYPE_FIELD_NAME (type
, f
);
7535 /* The field name should never be null, unless the debugging information
7536 is somehow malformed. In this case, we assume the field does not
7537 require any alignment. */
7541 len
= strlen (name
);
7543 if (!isdigit (name
[len
- 1]))
7546 if (isdigit (name
[len
- 2]))
7547 align_offset
= len
- 2;
7549 align_offset
= len
- 1;
7551 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7552 return TARGET_CHAR_BIT
;
7554 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7557 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7559 static struct symbol
*
7560 ada_find_any_type_symbol (const char *name
)
7564 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7565 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7568 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7572 /* Find a type named NAME. Ignores ambiguity. This routine will look
7573 solely for types defined by debug info, it will not search the GDB
7576 static struct type
*
7577 ada_find_any_type (const char *name
)
7579 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7582 return SYMBOL_TYPE (sym
);
7587 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7588 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7589 symbol, in which case it is returned. Otherwise, this looks for
7590 symbols whose name is that of NAME_SYM suffixed with "___XR".
7591 Return symbol if found, and NULL otherwise. */
7594 ada_is_renaming_symbol (struct symbol
*name_sym
)
7596 const char *name
= name_sym
->linkage_name ();
7597 return strstr (name
, "___XR") != NULL
;
7600 /* Because of GNAT encoding conventions, several GDB symbols may match a
7601 given type name. If the type denoted by TYPE0 is to be preferred to
7602 that of TYPE1 for purposes of type printing, return non-zero;
7603 otherwise return 0. */
7606 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7610 else if (type0
== NULL
)
7612 else if (type1
->code () == TYPE_CODE_VOID
)
7614 else if (type0
->code () == TYPE_CODE_VOID
)
7616 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7618 else if (ada_is_constrained_packed_array_type (type0
))
7620 else if (ada_is_array_descriptor_type (type0
)
7621 && !ada_is_array_descriptor_type (type1
))
7625 const char *type0_name
= type0
->name ();
7626 const char *type1_name
= type1
->name ();
7628 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7629 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7635 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7639 ada_type_name (struct type
*type
)
7643 return type
->name ();
7646 /* Search the list of "descriptive" types associated to TYPE for a type
7647 whose name is NAME. */
7649 static struct type
*
7650 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7652 struct type
*result
, *tmp
;
7654 if (ada_ignore_descriptive_types_p
)
7657 /* If there no descriptive-type info, then there is no parallel type
7659 if (!HAVE_GNAT_AUX_INFO (type
))
7662 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7663 while (result
!= NULL
)
7665 const char *result_name
= ada_type_name (result
);
7667 if (result_name
== NULL
)
7669 warning (_("unexpected null name on descriptive type"));
7673 /* If the names match, stop. */
7674 if (strcmp (result_name
, name
) == 0)
7677 /* Otherwise, look at the next item on the list, if any. */
7678 if (HAVE_GNAT_AUX_INFO (result
))
7679 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7683 /* If not found either, try after having resolved the typedef. */
7688 result
= check_typedef (result
);
7689 if (HAVE_GNAT_AUX_INFO (result
))
7690 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7696 /* If we didn't find a match, see whether this is a packed array. With
7697 older compilers, the descriptive type information is either absent or
7698 irrelevant when it comes to packed arrays so the above lookup fails.
7699 Fall back to using a parallel lookup by name in this case. */
7700 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7701 return ada_find_any_type (name
);
7706 /* Find a parallel type to TYPE with the specified NAME, using the
7707 descriptive type taken from the debugging information, if available,
7708 and otherwise using the (slower) name-based method. */
7710 static struct type
*
7711 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7713 struct type
*result
= NULL
;
7715 if (HAVE_GNAT_AUX_INFO (type
))
7716 result
= find_parallel_type_by_descriptive_type (type
, name
);
7718 result
= ada_find_any_type (name
);
7723 /* Same as above, but specify the name of the parallel type by appending
7724 SUFFIX to the name of TYPE. */
7727 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7730 const char *type_name
= ada_type_name (type
);
7733 if (type_name
== NULL
)
7736 len
= strlen (type_name
);
7738 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7740 strcpy (name
, type_name
);
7741 strcpy (name
+ len
, suffix
);
7743 return ada_find_parallel_type_with_name (type
, name
);
7746 /* If TYPE is a variable-size record type, return the corresponding template
7747 type describing its fields. Otherwise, return NULL. */
7749 static struct type
*
7750 dynamic_template_type (struct type
*type
)
7752 type
= ada_check_typedef (type
);
7754 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7755 || ada_type_name (type
) == NULL
)
7759 int len
= strlen (ada_type_name (type
));
7761 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7764 return ada_find_parallel_type (type
, "___XVE");
7768 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7769 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7772 is_dynamic_field (struct type
*templ_type
, int field_num
)
7774 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7777 && templ_type
->field (field_num
).type ()->code () == TYPE_CODE_PTR
7778 && strstr (name
, "___XVL") != NULL
;
7781 /* The index of the variant field of TYPE, or -1 if TYPE does not
7782 represent a variant record type. */
7785 variant_field_index (struct type
*type
)
7789 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
7792 for (f
= 0; f
< type
->num_fields (); f
+= 1)
7794 if (ada_is_variant_part (type
, f
))
7800 /* A record type with no fields. */
7802 static struct type
*
7803 empty_record (struct type
*templ
)
7805 struct type
*type
= alloc_type_copy (templ
);
7807 type
->set_code (TYPE_CODE_STRUCT
);
7808 INIT_NONE_SPECIFIC (type
);
7809 type
->set_name ("<empty>");
7810 TYPE_LENGTH (type
) = 0;
7814 /* An ordinary record type (with fixed-length fields) that describes
7815 the value of type TYPE at VALADDR or ADDRESS (see comments at
7816 the beginning of this section) VAL according to GNAT conventions.
7817 DVAL0 should describe the (portion of a) record that contains any
7818 necessary discriminants. It should be NULL if value_type (VAL) is
7819 an outer-level type (i.e., as opposed to a branch of a variant.) A
7820 variant field (unless unchecked) is replaced by a particular branch
7823 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7824 length are not statically known are discarded. As a consequence,
7825 VALADDR, ADDRESS and DVAL0 are ignored.
7827 NOTE: Limitations: For now, we assume that dynamic fields and
7828 variants occupy whole numbers of bytes. However, they need not be
7832 ada_template_to_fixed_record_type_1 (struct type
*type
,
7833 const gdb_byte
*valaddr
,
7834 CORE_ADDR address
, struct value
*dval0
,
7835 int keep_dynamic_fields
)
7837 struct value
*mark
= value_mark ();
7840 int nfields
, bit_len
;
7846 /* Compute the number of fields in this record type that are going
7847 to be processed: unless keep_dynamic_fields, this includes only
7848 fields whose position and length are static will be processed. */
7849 if (keep_dynamic_fields
)
7850 nfields
= type
->num_fields ();
7854 while (nfields
< type
->num_fields ()
7855 && !ada_is_variant_part (type
, nfields
)
7856 && !is_dynamic_field (type
, nfields
))
7860 rtype
= alloc_type_copy (type
);
7861 rtype
->set_code (TYPE_CODE_STRUCT
);
7862 INIT_NONE_SPECIFIC (rtype
);
7863 rtype
->set_num_fields (nfields
);
7865 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
7866 rtype
->set_name (ada_type_name (type
));
7867 rtype
->set_is_fixed_instance (true);
7873 for (f
= 0; f
< nfields
; f
+= 1)
7875 off
= align_up (off
, field_alignment (type
, f
))
7876 + TYPE_FIELD_BITPOS (type
, f
);
7877 SET_FIELD_BITPOS (rtype
->field (f
), off
);
7878 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7880 if (ada_is_variant_part (type
, f
))
7885 else if (is_dynamic_field (type
, f
))
7887 const gdb_byte
*field_valaddr
= valaddr
;
7888 CORE_ADDR field_address
= address
;
7889 struct type
*field_type
=
7890 TYPE_TARGET_TYPE (type
->field (f
).type ());
7894 /* rtype's length is computed based on the run-time
7895 value of discriminants. If the discriminants are not
7896 initialized, the type size may be completely bogus and
7897 GDB may fail to allocate a value for it. So check the
7898 size first before creating the value. */
7899 ada_ensure_varsize_limit (rtype
);
7900 /* Using plain value_from_contents_and_address here
7901 causes problems because we will end up trying to
7902 resolve a type that is currently being
7904 dval
= value_from_contents_and_address_unresolved (rtype
,
7907 rtype
= value_type (dval
);
7912 /* If the type referenced by this field is an aligner type, we need
7913 to unwrap that aligner type, because its size might not be set.
7914 Keeping the aligner type would cause us to compute the wrong
7915 size for this field, impacting the offset of the all the fields
7916 that follow this one. */
7917 if (ada_is_aligner_type (field_type
))
7919 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7921 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7922 field_address
= cond_offset_target (field_address
, field_offset
);
7923 field_type
= ada_aligned_type (field_type
);
7926 field_valaddr
= cond_offset_host (field_valaddr
,
7927 off
/ TARGET_CHAR_BIT
);
7928 field_address
= cond_offset_target (field_address
,
7929 off
/ TARGET_CHAR_BIT
);
7931 /* Get the fixed type of the field. Note that, in this case,
7932 we do not want to get the real type out of the tag: if
7933 the current field is the parent part of a tagged record,
7934 we will get the tag of the object. Clearly wrong: the real
7935 type of the parent is not the real type of the child. We
7936 would end up in an infinite loop. */
7937 field_type
= ada_get_base_type (field_type
);
7938 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7939 field_address
, dval
, 0);
7940 /* If the field size is already larger than the maximum
7941 object size, then the record itself will necessarily
7942 be larger than the maximum object size. We need to make
7943 this check now, because the size might be so ridiculously
7944 large (due to an uninitialized variable in the inferior)
7945 that it would cause an overflow when adding it to the
7947 ada_ensure_varsize_limit (field_type
);
7949 rtype
->field (f
).set_type (field_type
);
7950 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7951 /* The multiplication can potentially overflow. But because
7952 the field length has been size-checked just above, and
7953 assuming that the maximum size is a reasonable value,
7954 an overflow should not happen in practice. So rather than
7955 adding overflow recovery code to this already complex code,
7956 we just assume that it's not going to happen. */
7958 TYPE_LENGTH (rtype
->field (f
).type ()) * TARGET_CHAR_BIT
;
7962 /* Note: If this field's type is a typedef, it is important
7963 to preserve the typedef layer.
7965 Otherwise, we might be transforming a typedef to a fat
7966 pointer (encoding a pointer to an unconstrained array),
7967 into a basic fat pointer (encoding an unconstrained
7968 array). As both types are implemented using the same
7969 structure, the typedef is the only clue which allows us
7970 to distinguish between the two options. Stripping it
7971 would prevent us from printing this field appropriately. */
7972 rtype
->field (f
).set_type (type
->field (f
).type ());
7973 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7974 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7976 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7979 struct type
*field_type
= type
->field (f
).type ();
7981 /* We need to be careful of typedefs when computing
7982 the length of our field. If this is a typedef,
7983 get the length of the target type, not the length
7985 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
7986 field_type
= ada_typedef_target_type (field_type
);
7989 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7992 if (off
+ fld_bit_len
> bit_len
)
7993 bit_len
= off
+ fld_bit_len
;
7995 TYPE_LENGTH (rtype
) =
7996 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7999 /* We handle the variant part, if any, at the end because of certain
8000 odd cases in which it is re-ordered so as NOT to be the last field of
8001 the record. This can happen in the presence of representation
8003 if (variant_field
>= 0)
8005 struct type
*branch_type
;
8007 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8011 /* Using plain value_from_contents_and_address here causes
8012 problems because we will end up trying to resolve a type
8013 that is currently being constructed. */
8014 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8016 rtype
= value_type (dval
);
8022 to_fixed_variant_branch_type
8023 (type
->field (variant_field
).type (),
8024 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8025 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8026 if (branch_type
== NULL
)
8028 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
8029 rtype
->field (f
- 1) = rtype
->field (f
);
8030 rtype
->set_num_fields (rtype
->num_fields () - 1);
8034 rtype
->field (variant_field
).set_type (branch_type
);
8035 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8037 TYPE_LENGTH (rtype
->field (variant_field
).type ()) *
8039 if (off
+ fld_bit_len
> bit_len
)
8040 bit_len
= off
+ fld_bit_len
;
8041 TYPE_LENGTH (rtype
) =
8042 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8046 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8047 should contain the alignment of that record, which should be a strictly
8048 positive value. If null or negative, then something is wrong, most
8049 probably in the debug info. In that case, we don't round up the size
8050 of the resulting type. If this record is not part of another structure,
8051 the current RTYPE length might be good enough for our purposes. */
8052 if (TYPE_LENGTH (type
) <= 0)
8055 warning (_("Invalid type size for `%s' detected: %s."),
8056 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
8058 warning (_("Invalid type size for <unnamed> detected: %s."),
8059 pulongest (TYPE_LENGTH (type
)));
8063 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
8064 TYPE_LENGTH (type
));
8067 value_free_to_mark (mark
);
8068 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8069 error (_("record type with dynamic size is larger than varsize-limit"));
8073 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8076 static struct type
*
8077 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8078 CORE_ADDR address
, struct value
*dval0
)
8080 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8084 /* An ordinary record type in which ___XVL-convention fields and
8085 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8086 static approximations, containing all possible fields. Uses
8087 no runtime values. Useless for use in values, but that's OK,
8088 since the results are used only for type determinations. Works on both
8089 structs and unions. Representation note: to save space, we memorize
8090 the result of this function in the TYPE_TARGET_TYPE of the
8093 static struct type
*
8094 template_to_static_fixed_type (struct type
*type0
)
8100 /* No need no do anything if the input type is already fixed. */
8101 if (type0
->is_fixed_instance ())
8104 /* Likewise if we already have computed the static approximation. */
8105 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8106 return TYPE_TARGET_TYPE (type0
);
8108 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8110 nfields
= type0
->num_fields ();
8112 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8113 recompute all over next time. */
8114 TYPE_TARGET_TYPE (type0
) = type
;
8116 for (f
= 0; f
< nfields
; f
+= 1)
8118 struct type
*field_type
= type0
->field (f
).type ();
8119 struct type
*new_type
;
8121 if (is_dynamic_field (type0
, f
))
8123 field_type
= ada_check_typedef (field_type
);
8124 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8127 new_type
= static_unwrap_type (field_type
);
8129 if (new_type
!= field_type
)
8131 /* Clone TYPE0 only the first time we get a new field type. */
8134 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8135 type
->set_code (type0
->code ());
8136 INIT_NONE_SPECIFIC (type
);
8137 type
->set_num_fields (nfields
);
8141 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
8142 memcpy (fields
, type0
->fields (),
8143 sizeof (struct field
) * nfields
);
8144 type
->set_fields (fields
);
8146 type
->set_name (ada_type_name (type0
));
8147 type
->set_is_fixed_instance (true);
8148 TYPE_LENGTH (type
) = 0;
8150 type
->field (f
).set_type (new_type
);
8151 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8158 /* Given an object of type TYPE whose contents are at VALADDR and
8159 whose address in memory is ADDRESS, returns a revision of TYPE,
8160 which should be a non-dynamic-sized record, in which the variant
8161 part, if any, is replaced with the appropriate branch. Looks
8162 for discriminant values in DVAL0, which can be NULL if the record
8163 contains the necessary discriminant values. */
8165 static struct type
*
8166 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8167 CORE_ADDR address
, struct value
*dval0
)
8169 struct value
*mark
= value_mark ();
8172 struct type
*branch_type
;
8173 int nfields
= type
->num_fields ();
8174 int variant_field
= variant_field_index (type
);
8176 if (variant_field
== -1)
8181 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8182 type
= value_type (dval
);
8187 rtype
= alloc_type_copy (type
);
8188 rtype
->set_code (TYPE_CODE_STRUCT
);
8189 INIT_NONE_SPECIFIC (rtype
);
8190 rtype
->set_num_fields (nfields
);
8193 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8194 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
8195 rtype
->set_fields (fields
);
8197 rtype
->set_name (ada_type_name (type
));
8198 rtype
->set_is_fixed_instance (true);
8199 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8201 branch_type
= to_fixed_variant_branch_type
8202 (type
->field (variant_field
).type (),
8203 cond_offset_host (valaddr
,
8204 TYPE_FIELD_BITPOS (type
, variant_field
)
8206 cond_offset_target (address
,
8207 TYPE_FIELD_BITPOS (type
, variant_field
)
8208 / TARGET_CHAR_BIT
), dval
);
8209 if (branch_type
== NULL
)
8213 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8214 rtype
->field (f
- 1) = rtype
->field (f
);
8215 rtype
->set_num_fields (rtype
->num_fields () - 1);
8219 rtype
->field (variant_field
).set_type (branch_type
);
8220 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8221 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8222 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8224 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (type
->field (variant_field
).type ());
8226 value_free_to_mark (mark
);
8230 /* An ordinary record type (with fixed-length fields) that describes
8231 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8232 beginning of this section]. Any necessary discriminants' values
8233 should be in DVAL, a record value; it may be NULL if the object
8234 at ADDR itself contains any necessary discriminant values.
8235 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8236 values from the record are needed. Except in the case that DVAL,
8237 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8238 unchecked) is replaced by a particular branch of the variant.
8240 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8241 is questionable and may be removed. It can arise during the
8242 processing of an unconstrained-array-of-record type where all the
8243 variant branches have exactly the same size. This is because in
8244 such cases, the compiler does not bother to use the XVS convention
8245 when encoding the record. I am currently dubious of this
8246 shortcut and suspect the compiler should be altered. FIXME. */
8248 static struct type
*
8249 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8250 CORE_ADDR address
, struct value
*dval
)
8252 struct type
*templ_type
;
8254 if (type0
->is_fixed_instance ())
8257 templ_type
= dynamic_template_type (type0
);
8259 if (templ_type
!= NULL
)
8260 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8261 else if (variant_field_index (type0
) >= 0)
8263 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8265 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8270 type0
->set_is_fixed_instance (true);
8276 /* An ordinary record type (with fixed-length fields) that describes
8277 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8278 union type. Any necessary discriminants' values should be in DVAL,
8279 a record value. That is, this routine selects the appropriate
8280 branch of the union at ADDR according to the discriminant value
8281 indicated in the union's type name. Returns VAR_TYPE0 itself if
8282 it represents a variant subject to a pragma Unchecked_Union. */
8284 static struct type
*
8285 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8286 CORE_ADDR address
, struct value
*dval
)
8289 struct type
*templ_type
;
8290 struct type
*var_type
;
8292 if (var_type0
->code () == TYPE_CODE_PTR
)
8293 var_type
= TYPE_TARGET_TYPE (var_type0
);
8295 var_type
= var_type0
;
8297 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8299 if (templ_type
!= NULL
)
8300 var_type
= templ_type
;
8302 if (is_unchecked_variant (var_type
, value_type (dval
)))
8304 which
= ada_which_variant_applies (var_type
, dval
);
8307 return empty_record (var_type
);
8308 else if (is_dynamic_field (var_type
, which
))
8309 return to_fixed_record_type
8310 (TYPE_TARGET_TYPE (var_type
->field (which
).type ()),
8311 valaddr
, address
, dval
);
8312 else if (variant_field_index (var_type
->field (which
).type ()) >= 0)
8314 to_fixed_record_type
8315 (var_type
->field (which
).type (), valaddr
, address
, dval
);
8317 return var_type
->field (which
).type ();
8320 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8321 ENCODING_TYPE, a type following the GNAT conventions for discrete
8322 type encodings, only carries redundant information. */
8325 ada_is_redundant_range_encoding (struct type
*range_type
,
8326 struct type
*encoding_type
)
8328 const char *bounds_str
;
8332 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8334 if (get_base_type (range_type
)->code ()
8335 != get_base_type (encoding_type
)->code ())
8337 /* The compiler probably used a simple base type to describe
8338 the range type instead of the range's actual base type,
8339 expecting us to get the real base type from the encoding
8340 anyway. In this situation, the encoding cannot be ignored
8345 if (is_dynamic_type (range_type
))
8348 if (encoding_type
->name () == NULL
)
8351 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8352 if (bounds_str
== NULL
)
8355 n
= 8; /* Skip "___XDLU_". */
8356 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8358 if (range_type
->bounds ()->low
.const_val () != lo
)
8361 n
+= 2; /* Skip the "__" separator between the two bounds. */
8362 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8364 if (range_type
->bounds ()->high
.const_val () != hi
)
8370 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8371 a type following the GNAT encoding for describing array type
8372 indices, only carries redundant information. */
8375 ada_is_redundant_index_type_desc (struct type
*array_type
,
8376 struct type
*desc_type
)
8378 struct type
*this_layer
= check_typedef (array_type
);
8381 for (i
= 0; i
< desc_type
->num_fields (); i
++)
8383 if (!ada_is_redundant_range_encoding (this_layer
->index_type (),
8384 desc_type
->field (i
).type ()))
8386 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8392 /* Assuming that TYPE0 is an array type describing the type of a value
8393 at ADDR, and that DVAL describes a record containing any
8394 discriminants used in TYPE0, returns a type for the value that
8395 contains no dynamic components (that is, no components whose sizes
8396 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8397 true, gives an error message if the resulting type's size is over
8400 static struct type
*
8401 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8404 struct type
*index_type_desc
;
8405 struct type
*result
;
8406 int constrained_packed_array_p
;
8407 static const char *xa_suffix
= "___XA";
8409 type0
= ada_check_typedef (type0
);
8410 if (type0
->is_fixed_instance ())
8413 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8414 if (constrained_packed_array_p
)
8416 type0
= decode_constrained_packed_array_type (type0
);
8417 if (type0
== nullptr)
8418 error (_("could not decode constrained packed array type"));
8421 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8423 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8424 encoding suffixed with 'P' may still be generated. If so,
8425 it should be used to find the XA type. */
8427 if (index_type_desc
== NULL
)
8429 const char *type_name
= ada_type_name (type0
);
8431 if (type_name
!= NULL
)
8433 const int len
= strlen (type_name
);
8434 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8436 if (type_name
[len
- 1] == 'P')
8438 strcpy (name
, type_name
);
8439 strcpy (name
+ len
- 1, xa_suffix
);
8440 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8445 ada_fixup_array_indexes_type (index_type_desc
);
8446 if (index_type_desc
!= NULL
8447 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8449 /* Ignore this ___XA parallel type, as it does not bring any
8450 useful information. This allows us to avoid creating fixed
8451 versions of the array's index types, which would be identical
8452 to the original ones. This, in turn, can also help avoid
8453 the creation of fixed versions of the array itself. */
8454 index_type_desc
= NULL
;
8457 if (index_type_desc
== NULL
)
8459 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8461 /* NOTE: elt_type---the fixed version of elt_type0---should never
8462 depend on the contents of the array in properly constructed
8464 /* Create a fixed version of the array element type.
8465 We're not providing the address of an element here,
8466 and thus the actual object value cannot be inspected to do
8467 the conversion. This should not be a problem, since arrays of
8468 unconstrained objects are not allowed. In particular, all
8469 the elements of an array of a tagged type should all be of
8470 the same type specified in the debugging info. No need to
8471 consult the object tag. */
8472 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8474 /* Make sure we always create a new array type when dealing with
8475 packed array types, since we're going to fix-up the array
8476 type length and element bitsize a little further down. */
8477 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8480 result
= create_array_type (alloc_type_copy (type0
),
8481 elt_type
, type0
->index_type ());
8486 struct type
*elt_type0
;
8489 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8490 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8492 /* NOTE: result---the fixed version of elt_type0---should never
8493 depend on the contents of the array in properly constructed
8495 /* Create a fixed version of the array element type.
8496 We're not providing the address of an element here,
8497 and thus the actual object value cannot be inspected to do
8498 the conversion. This should not be a problem, since arrays of
8499 unconstrained objects are not allowed. In particular, all
8500 the elements of an array of a tagged type should all be of
8501 the same type specified in the debugging info. No need to
8502 consult the object tag. */
8504 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8507 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8509 struct type
*range_type
=
8510 to_fixed_range_type (index_type_desc
->field (i
).type (), dval
);
8512 result
= create_array_type (alloc_type_copy (elt_type0
),
8513 result
, range_type
);
8514 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8516 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8517 error (_("array type with dynamic size is larger than varsize-limit"));
8520 /* We want to preserve the type name. This can be useful when
8521 trying to get the type name of a value that has already been
8522 printed (for instance, if the user did "print VAR; whatis $". */
8523 result
->set_name (type0
->name ());
8525 if (constrained_packed_array_p
)
8527 /* So far, the resulting type has been created as if the original
8528 type was a regular (non-packed) array type. As a result, the
8529 bitsize of the array elements needs to be set again, and the array
8530 length needs to be recomputed based on that bitsize. */
8531 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8532 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8534 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8535 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8536 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8537 TYPE_LENGTH (result
)++;
8540 result
->set_is_fixed_instance (true);
8545 /* A standard type (containing no dynamically sized components)
8546 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8547 DVAL describes a record containing any discriminants used in TYPE0,
8548 and may be NULL if there are none, or if the object of type TYPE at
8549 ADDRESS or in VALADDR contains these discriminants.
8551 If CHECK_TAG is not null, in the case of tagged types, this function
8552 attempts to locate the object's tag and use it to compute the actual
8553 type. However, when ADDRESS is null, we cannot use it to determine the
8554 location of the tag, and therefore compute the tagged type's actual type.
8555 So we return the tagged type without consulting the tag. */
8557 static struct type
*
8558 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8559 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8561 type
= ada_check_typedef (type
);
8563 /* Only un-fixed types need to be handled here. */
8564 if (!HAVE_GNAT_AUX_INFO (type
))
8567 switch (type
->code ())
8571 case TYPE_CODE_STRUCT
:
8573 struct type
*static_type
= to_static_fixed_type (type
);
8574 struct type
*fixed_record_type
=
8575 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8577 /* If STATIC_TYPE is a tagged type and we know the object's address,
8578 then we can determine its tag, and compute the object's actual
8579 type from there. Note that we have to use the fixed record
8580 type (the parent part of the record may have dynamic fields
8581 and the way the location of _tag is expressed may depend on
8584 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8587 value_tag_from_contents_and_address
8591 struct type
*real_type
= type_from_tag (tag
);
8593 value_from_contents_and_address (fixed_record_type
,
8596 fixed_record_type
= value_type (obj
);
8597 if (real_type
!= NULL
)
8598 return to_fixed_record_type
8600 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8603 /* Check to see if there is a parallel ___XVZ variable.
8604 If there is, then it provides the actual size of our type. */
8605 else if (ada_type_name (fixed_record_type
) != NULL
)
8607 const char *name
= ada_type_name (fixed_record_type
);
8609 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8610 bool xvz_found
= false;
8613 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8616 xvz_found
= get_int_var_value (xvz_name
, size
);
8618 catch (const gdb_exception_error
&except
)
8620 /* We found the variable, but somehow failed to read
8621 its value. Rethrow the same error, but with a little
8622 bit more information, to help the user understand
8623 what went wrong (Eg: the variable might have been
8625 throw_error (except
.error
,
8626 _("unable to read value of %s (%s)"),
8627 xvz_name
, except
.what ());
8630 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8632 fixed_record_type
= copy_type (fixed_record_type
);
8633 TYPE_LENGTH (fixed_record_type
) = size
;
8635 /* The FIXED_RECORD_TYPE may have be a stub. We have
8636 observed this when the debugging info is STABS, and
8637 apparently it is something that is hard to fix.
8639 In practice, we don't need the actual type definition
8640 at all, because the presence of the XVZ variable allows us
8641 to assume that there must be a XVS type as well, which we
8642 should be able to use later, when we need the actual type
8645 In the meantime, pretend that the "fixed" type we are
8646 returning is NOT a stub, because this can cause trouble
8647 when using this type to create new types targeting it.
8648 Indeed, the associated creation routines often check
8649 whether the target type is a stub and will try to replace
8650 it, thus using a type with the wrong size. This, in turn,
8651 might cause the new type to have the wrong size too.
8652 Consider the case of an array, for instance, where the size
8653 of the array is computed from the number of elements in
8654 our array multiplied by the size of its element. */
8655 fixed_record_type
->set_is_stub (false);
8658 return fixed_record_type
;
8660 case TYPE_CODE_ARRAY
:
8661 return to_fixed_array_type (type
, dval
, 1);
8662 case TYPE_CODE_UNION
:
8666 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8670 /* The same as ada_to_fixed_type_1, except that it preserves the type
8671 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8673 The typedef layer needs be preserved in order to differentiate between
8674 arrays and array pointers when both types are implemented using the same
8675 fat pointer. In the array pointer case, the pointer is encoded as
8676 a typedef of the pointer type. For instance, considering:
8678 type String_Access is access String;
8679 S1 : String_Access := null;
8681 To the debugger, S1 is defined as a typedef of type String. But
8682 to the user, it is a pointer. So if the user tries to print S1,
8683 we should not dereference the array, but print the array address
8686 If we didn't preserve the typedef layer, we would lose the fact that
8687 the type is to be presented as a pointer (needs de-reference before
8688 being printed). And we would also use the source-level type name. */
8691 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8692 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8695 struct type
*fixed_type
=
8696 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8698 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8699 then preserve the typedef layer.
8701 Implementation note: We can only check the main-type portion of
8702 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8703 from TYPE now returns a type that has the same instance flags
8704 as TYPE. For instance, if TYPE is a "typedef const", and its
8705 target type is a "struct", then the typedef elimination will return
8706 a "const" version of the target type. See check_typedef for more
8707 details about how the typedef layer elimination is done.
8709 brobecker/2010-11-19: It seems to me that the only case where it is
8710 useful to preserve the typedef layer is when dealing with fat pointers.
8711 Perhaps, we could add a check for that and preserve the typedef layer
8712 only in that situation. But this seems unnecessary so far, probably
8713 because we call check_typedef/ada_check_typedef pretty much everywhere.
8715 if (type
->code () == TYPE_CODE_TYPEDEF
8716 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8717 == TYPE_MAIN_TYPE (fixed_type
)))
8723 /* A standard (static-sized) type corresponding as well as possible to
8724 TYPE0, but based on no runtime data. */
8726 static struct type
*
8727 to_static_fixed_type (struct type
*type0
)
8734 if (type0
->is_fixed_instance ())
8737 type0
= ada_check_typedef (type0
);
8739 switch (type0
->code ())
8743 case TYPE_CODE_STRUCT
:
8744 type
= dynamic_template_type (type0
);
8746 return template_to_static_fixed_type (type
);
8748 return template_to_static_fixed_type (type0
);
8749 case TYPE_CODE_UNION
:
8750 type
= ada_find_parallel_type (type0
, "___XVU");
8752 return template_to_static_fixed_type (type
);
8754 return template_to_static_fixed_type (type0
);
8758 /* A static approximation of TYPE with all type wrappers removed. */
8760 static struct type
*
8761 static_unwrap_type (struct type
*type
)
8763 if (ada_is_aligner_type (type
))
8765 struct type
*type1
= ada_check_typedef (type
)->field (0).type ();
8766 if (ada_type_name (type1
) == NULL
)
8767 type1
->set_name (ada_type_name (type
));
8769 return static_unwrap_type (type1
);
8773 struct type
*raw_real_type
= ada_get_base_type (type
);
8775 if (raw_real_type
== type
)
8778 return to_static_fixed_type (raw_real_type
);
8782 /* In some cases, incomplete and private types require
8783 cross-references that are not resolved as records (for example,
8785 type FooP is access Foo;
8787 type Foo is array ...;
8788 ). In these cases, since there is no mechanism for producing
8789 cross-references to such types, we instead substitute for FooP a
8790 stub enumeration type that is nowhere resolved, and whose tag is
8791 the name of the actual type. Call these types "non-record stubs". */
8793 /* A type equivalent to TYPE that is not a non-record stub, if one
8794 exists, otherwise TYPE. */
8797 ada_check_typedef (struct type
*type
)
8802 /* If our type is an access to an unconstrained array, which is encoded
8803 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
8804 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8805 what allows us to distinguish between fat pointers that represent
8806 array types, and fat pointers that represent array access types
8807 (in both cases, the compiler implements them as fat pointers). */
8808 if (ada_is_access_to_unconstrained_array (type
))
8811 type
= check_typedef (type
);
8812 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
8813 || !type
->is_stub ()
8814 || type
->name () == NULL
)
8818 const char *name
= type
->name ();
8819 struct type
*type1
= ada_find_any_type (name
);
8824 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8825 stubs pointing to arrays, as we don't create symbols for array
8826 types, only for the typedef-to-array types). If that's the case,
8827 strip the typedef layer. */
8828 if (type1
->code () == TYPE_CODE_TYPEDEF
)
8829 type1
= ada_check_typedef (type1
);
8835 /* A value representing the data at VALADDR/ADDRESS as described by
8836 type TYPE0, but with a standard (static-sized) type that correctly
8837 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8838 type, then return VAL0 [this feature is simply to avoid redundant
8839 creation of struct values]. */
8841 static struct value
*
8842 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8845 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8847 if (type
== type0
&& val0
!= NULL
)
8850 if (VALUE_LVAL (val0
) != lval_memory
)
8852 /* Our value does not live in memory; it could be a convenience
8853 variable, for instance. Create a not_lval value using val0's
8855 return value_from_contents (type
, value_contents (val0
));
8858 return value_from_contents_and_address (type
, 0, address
);
8861 /* A value representing VAL, but with a standard (static-sized) type
8862 that correctly describes it. Does not necessarily create a new
8866 ada_to_fixed_value (struct value
*val
)
8868 val
= unwrap_value (val
);
8869 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
8876 /* Table mapping attribute numbers to names.
8877 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8879 static const char * const attribute_names
[] = {
8897 ada_attribute_name (enum exp_opcode n
)
8899 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8900 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8902 return attribute_names
[0];
8905 /* Evaluate the 'POS attribute applied to ARG. */
8908 pos_atr (struct value
*arg
)
8910 struct value
*val
= coerce_ref (arg
);
8911 struct type
*type
= value_type (val
);
8913 if (!discrete_type_p (type
))
8914 error (_("'POS only defined on discrete types"));
8916 gdb::optional
<LONGEST
> result
= discrete_position (type
, value_as_long (val
));
8917 if (!result
.has_value ())
8918 error (_("enumeration value is invalid: can't find 'POS"));
8923 static struct value
*
8924 value_pos_atr (struct type
*type
, struct value
*arg
)
8926 return value_from_longest (type
, pos_atr (arg
));
8929 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8931 static struct value
*
8932 val_atr (struct type
*type
, LONGEST val
)
8934 gdb_assert (discrete_type_p (type
));
8935 if (type
->code () == TYPE_CODE_RANGE
)
8936 type
= TYPE_TARGET_TYPE (type
);
8937 if (type
->code () == TYPE_CODE_ENUM
)
8939 if (val
< 0 || val
>= type
->num_fields ())
8940 error (_("argument to 'VAL out of range"));
8941 val
= TYPE_FIELD_ENUMVAL (type
, val
);
8943 return value_from_longest (type
, val
);
8946 static struct value
*
8947 value_val_atr (struct type
*type
, struct value
*arg
)
8949 if (!discrete_type_p (type
))
8950 error (_("'VAL only defined on discrete types"));
8951 if (!integer_type_p (value_type (arg
)))
8952 error (_("'VAL requires integral argument"));
8954 return val_atr (type
, value_as_long (arg
));
8960 /* True if TYPE appears to be an Ada character type.
8961 [At the moment, this is true only for Character and Wide_Character;
8962 It is a heuristic test that could stand improvement]. */
8965 ada_is_character_type (struct type
*type
)
8969 /* If the type code says it's a character, then assume it really is,
8970 and don't check any further. */
8971 if (type
->code () == TYPE_CODE_CHAR
)
8974 /* Otherwise, assume it's a character type iff it is a discrete type
8975 with a known character type name. */
8976 name
= ada_type_name (type
);
8977 return (name
!= NULL
8978 && (type
->code () == TYPE_CODE_INT
8979 || type
->code () == TYPE_CODE_RANGE
)
8980 && (strcmp (name
, "character") == 0
8981 || strcmp (name
, "wide_character") == 0
8982 || strcmp (name
, "wide_wide_character") == 0
8983 || strcmp (name
, "unsigned char") == 0));
8986 /* True if TYPE appears to be an Ada string type. */
8989 ada_is_string_type (struct type
*type
)
8991 type
= ada_check_typedef (type
);
8993 && type
->code () != TYPE_CODE_PTR
8994 && (ada_is_simple_array_type (type
)
8995 || ada_is_array_descriptor_type (type
))
8996 && ada_array_arity (type
) == 1)
8998 struct type
*elttype
= ada_array_element_type (type
, 1);
9000 return ada_is_character_type (elttype
);
9006 /* The compiler sometimes provides a parallel XVS type for a given
9007 PAD type. Normally, it is safe to follow the PAD type directly,
9008 but older versions of the compiler have a bug that causes the offset
9009 of its "F" field to be wrong. Following that field in that case
9010 would lead to incorrect results, but this can be worked around
9011 by ignoring the PAD type and using the associated XVS type instead.
9013 Set to True if the debugger should trust the contents of PAD types.
9014 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9015 static bool trust_pad_over_xvs
= true;
9017 /* True if TYPE is a struct type introduced by the compiler to force the
9018 alignment of a value. Such types have a single field with a
9019 distinctive name. */
9022 ada_is_aligner_type (struct type
*type
)
9024 type
= ada_check_typedef (type
);
9026 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9029 return (type
->code () == TYPE_CODE_STRUCT
9030 && type
->num_fields () == 1
9031 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9034 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9035 the parallel type. */
9038 ada_get_base_type (struct type
*raw_type
)
9040 struct type
*real_type_namer
;
9041 struct type
*raw_real_type
;
9043 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
9046 if (ada_is_aligner_type (raw_type
))
9047 /* The encoding specifies that we should always use the aligner type.
9048 So, even if this aligner type has an associated XVS type, we should
9051 According to the compiler gurus, an XVS type parallel to an aligner
9052 type may exist because of a stabs limitation. In stabs, aligner
9053 types are empty because the field has a variable-sized type, and
9054 thus cannot actually be used as an aligner type. As a result,
9055 we need the associated parallel XVS type to decode the type.
9056 Since the policy in the compiler is to not change the internal
9057 representation based on the debugging info format, we sometimes
9058 end up having a redundant XVS type parallel to the aligner type. */
9061 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9062 if (real_type_namer
== NULL
9063 || real_type_namer
->code () != TYPE_CODE_STRUCT
9064 || real_type_namer
->num_fields () != 1)
9067 if (real_type_namer
->field (0).type ()->code () != TYPE_CODE_REF
)
9069 /* This is an older encoding form where the base type needs to be
9070 looked up by name. We prefer the newer encoding because it is
9072 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9073 if (raw_real_type
== NULL
)
9076 return raw_real_type
;
9079 /* The field in our XVS type is a reference to the base type. */
9080 return TYPE_TARGET_TYPE (real_type_namer
->field (0).type ());
9083 /* The type of value designated by TYPE, with all aligners removed. */
9086 ada_aligned_type (struct type
*type
)
9088 if (ada_is_aligner_type (type
))
9089 return ada_aligned_type (type
->field (0).type ());
9091 return ada_get_base_type (type
);
9095 /* The address of the aligned value in an object at address VALADDR
9096 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9099 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9101 if (ada_is_aligner_type (type
))
9102 return ada_aligned_value_addr (type
->field (0).type (),
9104 TYPE_FIELD_BITPOS (type
,
9105 0) / TARGET_CHAR_BIT
);
9112 /* The printed representation of an enumeration literal with encoded
9113 name NAME. The value is good to the next call of ada_enum_name. */
9115 ada_enum_name (const char *name
)
9117 static char *result
;
9118 static size_t result_len
= 0;
9121 /* First, unqualify the enumeration name:
9122 1. Search for the last '.' character. If we find one, then skip
9123 all the preceding characters, the unqualified name starts
9124 right after that dot.
9125 2. Otherwise, we may be debugging on a target where the compiler
9126 translates dots into "__". Search forward for double underscores,
9127 but stop searching when we hit an overloading suffix, which is
9128 of the form "__" followed by digits. */
9130 tmp
= strrchr (name
, '.');
9135 while ((tmp
= strstr (name
, "__")) != NULL
)
9137 if (isdigit (tmp
[2]))
9148 if (name
[1] == 'U' || name
[1] == 'W')
9150 if (sscanf (name
+ 2, "%x", &v
) != 1)
9153 else if (((name
[1] >= '0' && name
[1] <= '9')
9154 || (name
[1] >= 'a' && name
[1] <= 'z'))
9157 GROW_VECT (result
, result_len
, 4);
9158 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9164 GROW_VECT (result
, result_len
, 16);
9165 if (isascii (v
) && isprint (v
))
9166 xsnprintf (result
, result_len
, "'%c'", v
);
9167 else if (name
[1] == 'U')
9168 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9170 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9176 tmp
= strstr (name
, "__");
9178 tmp
= strstr (name
, "$");
9181 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9182 strncpy (result
, name
, tmp
- name
);
9183 result
[tmp
- name
] = '\0';
9191 /* Evaluate the subexpression of EXP starting at *POS as for
9192 evaluate_type, updating *POS to point just past the evaluated
9195 static struct value
*
9196 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9198 return evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9201 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9204 static struct value
*
9205 unwrap_value (struct value
*val
)
9207 struct type
*type
= ada_check_typedef (value_type (val
));
9209 if (ada_is_aligner_type (type
))
9211 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9212 struct type
*val_type
= ada_check_typedef (value_type (v
));
9214 if (ada_type_name (val_type
) == NULL
)
9215 val_type
->set_name (ada_type_name (type
));
9217 return unwrap_value (v
);
9221 struct type
*raw_real_type
=
9222 ada_check_typedef (ada_get_base_type (type
));
9224 /* If there is no parallel XVS or XVE type, then the value is
9225 already unwrapped. Return it without further modification. */
9226 if ((type
== raw_real_type
)
9227 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9231 coerce_unspec_val_to_type
9232 (val
, ada_to_fixed_type (raw_real_type
, 0,
9233 value_address (val
),
9238 static struct value
*
9239 cast_from_gnat_encoded_fixed_point_type (struct type
*type
, struct value
*arg
)
9242 = gnat_encoded_fixed_point_scaling_factor (value_type (arg
));
9243 arg
= value_cast (value_type (scale
), arg
);
9245 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9246 return value_cast (type
, arg
);
9249 static struct value
*
9250 cast_to_gnat_encoded_fixed_point_type (struct type
*type
, struct value
*arg
)
9252 if (type
== value_type (arg
))
9255 struct value
*scale
= gnat_encoded_fixed_point_scaling_factor (type
);
9256 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg
)))
9257 arg
= cast_from_gnat_encoded_fixed_point_type (value_type (scale
), arg
);
9259 arg
= value_cast (value_type (scale
), arg
);
9261 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9262 return value_cast (type
, arg
);
9265 /* Given two array types T1 and T2, return nonzero iff both arrays
9266 contain the same number of elements. */
9269 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9271 LONGEST lo1
, hi1
, lo2
, hi2
;
9273 /* Get the array bounds in order to verify that the size of
9274 the two arrays match. */
9275 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9276 || !get_array_bounds (t2
, &lo2
, &hi2
))
9277 error (_("unable to determine array bounds"));
9279 /* To make things easier for size comparison, normalize a bit
9280 the case of empty arrays by making sure that the difference
9281 between upper bound and lower bound is always -1. */
9287 return (hi1
- lo1
== hi2
- lo2
);
9290 /* Assuming that VAL is an array of integrals, and TYPE represents
9291 an array with the same number of elements, but with wider integral
9292 elements, return an array "casted" to TYPE. In practice, this
9293 means that the returned array is built by casting each element
9294 of the original array into TYPE's (wider) element type. */
9296 static struct value
*
9297 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9299 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9304 /* Verify that both val and type are arrays of scalars, and
9305 that the size of val's elements is smaller than the size
9306 of type's element. */
9307 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9308 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9309 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9310 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9311 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9312 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9314 if (!get_array_bounds (type
, &lo
, &hi
))
9315 error (_("unable to determine array bounds"));
9317 res
= allocate_value (type
);
9319 /* Promote each array element. */
9320 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9322 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9324 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9325 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9331 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9332 return the converted value. */
9334 static struct value
*
9335 coerce_for_assign (struct type
*type
, struct value
*val
)
9337 struct type
*type2
= value_type (val
);
9342 type2
= ada_check_typedef (type2
);
9343 type
= ada_check_typedef (type
);
9345 if (type2
->code () == TYPE_CODE_PTR
9346 && type
->code () == TYPE_CODE_ARRAY
)
9348 val
= ada_value_ind (val
);
9349 type2
= value_type (val
);
9352 if (type2
->code () == TYPE_CODE_ARRAY
9353 && type
->code () == TYPE_CODE_ARRAY
)
9355 if (!ada_same_array_size_p (type
, type2
))
9356 error (_("cannot assign arrays of different length"));
9358 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9359 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9360 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9361 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9363 /* Allow implicit promotion of the array elements to
9365 return ada_promote_array_of_integrals (type
, val
);
9368 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9369 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9370 error (_("Incompatible types in assignment"));
9371 deprecated_set_value_type (val
, type
);
9376 static struct value
*
9377 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9380 struct type
*type1
, *type2
;
9383 arg1
= coerce_ref (arg1
);
9384 arg2
= coerce_ref (arg2
);
9385 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9386 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9388 if (type1
->code () != TYPE_CODE_INT
9389 || type2
->code () != TYPE_CODE_INT
)
9390 return value_binop (arg1
, arg2
, op
);
9399 return value_binop (arg1
, arg2
, op
);
9402 v2
= value_as_long (arg2
);
9404 error (_("second operand of %s must not be zero."), op_string (op
));
9406 if (type1
->is_unsigned () || op
== BINOP_MOD
)
9407 return value_binop (arg1
, arg2
, op
);
9409 v1
= value_as_long (arg1
);
9414 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9415 v
+= v
> 0 ? -1 : 1;
9423 /* Should not reach this point. */
9427 val
= allocate_value (type1
);
9428 store_unsigned_integer (value_contents_raw (val
),
9429 TYPE_LENGTH (value_type (val
)),
9430 type_byte_order (type1
), v
);
9435 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9437 if (ada_is_direct_array_type (value_type (arg1
))
9438 || ada_is_direct_array_type (value_type (arg2
)))
9440 struct type
*arg1_type
, *arg2_type
;
9442 /* Automatically dereference any array reference before
9443 we attempt to perform the comparison. */
9444 arg1
= ada_coerce_ref (arg1
);
9445 arg2
= ada_coerce_ref (arg2
);
9447 arg1
= ada_coerce_to_simple_array (arg1
);
9448 arg2
= ada_coerce_to_simple_array (arg2
);
9450 arg1_type
= ada_check_typedef (value_type (arg1
));
9451 arg2_type
= ada_check_typedef (value_type (arg2
));
9453 if (arg1_type
->code () != TYPE_CODE_ARRAY
9454 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9455 error (_("Attempt to compare array with non-array"));
9456 /* FIXME: The following works only for types whose
9457 representations use all bits (no padding or undefined bits)
9458 and do not have user-defined equality. */
9459 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9460 && memcmp (value_contents (arg1
), value_contents (arg2
),
9461 TYPE_LENGTH (arg1_type
)) == 0);
9463 return value_equal (arg1
, arg2
);
9466 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9467 component of LHS (a simple array or a record), updating *POS past
9468 the expression, assuming that LHS is contained in CONTAINER. Does
9469 not modify the inferior's memory, nor does it modify LHS (unless
9470 LHS == CONTAINER). */
9473 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9474 struct expression
*exp
, int *pos
)
9476 struct value
*mark
= value_mark ();
9478 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9480 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9482 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9483 struct value
*index_val
= value_from_longest (index_type
, index
);
9485 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9489 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9490 elt
= ada_to_fixed_value (elt
);
9493 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9494 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9496 value_assign_to_component (container
, elt
,
9497 ada_evaluate_subexp (NULL
, exp
, pos
,
9500 value_free_to_mark (mark
);
9503 /* Assuming that LHS represents an lvalue having a record or array
9504 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9505 of that aggregate's value to LHS, advancing *POS past the
9506 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9507 lvalue containing LHS (possibly LHS itself). Does not modify
9508 the inferior's memory, nor does it modify the contents of
9509 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9511 static struct value
*
9512 assign_aggregate (struct value
*container
,
9513 struct value
*lhs
, struct expression
*exp
,
9514 int *pos
, enum noside noside
)
9516 struct type
*lhs_type
;
9517 int n
= exp
->elts
[*pos
+1].longconst
;
9518 LONGEST low_index
, high_index
;
9522 if (noside
!= EVAL_NORMAL
)
9524 for (i
= 0; i
< n
; i
+= 1)
9525 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9529 container
= ada_coerce_ref (container
);
9530 if (ada_is_direct_array_type (value_type (container
)))
9531 container
= ada_coerce_to_simple_array (container
);
9532 lhs
= ada_coerce_ref (lhs
);
9533 if (!deprecated_value_modifiable (lhs
))
9534 error (_("Left operand of assignment is not a modifiable lvalue."));
9536 lhs_type
= check_typedef (value_type (lhs
));
9537 if (ada_is_direct_array_type (lhs_type
))
9539 lhs
= ada_coerce_to_simple_array (lhs
);
9540 lhs_type
= check_typedef (value_type (lhs
));
9541 low_index
= lhs_type
->bounds ()->low
.const_val ();
9542 high_index
= lhs_type
->bounds ()->high
.const_val ();
9544 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9547 high_index
= num_visible_fields (lhs_type
) - 1;
9550 error (_("Left-hand side must be array or record."));
9552 std::vector
<LONGEST
> indices (4);
9553 indices
[0] = indices
[1] = low_index
- 1;
9554 indices
[2] = indices
[3] = high_index
+ 1;
9556 for (i
= 0; i
< n
; i
+= 1)
9558 switch (exp
->elts
[*pos
].opcode
)
9561 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9562 low_index
, high_index
);
9565 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9566 low_index
, high_index
);
9570 error (_("Misplaced 'others' clause"));
9571 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9572 low_index
, high_index
);
9575 error (_("Internal error: bad aggregate clause"));
9582 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9583 construct at *POS, updating *POS past the construct, given that
9584 the positions are relative to lower bound LOW, where HIGH is the
9585 upper bound. Record the position in INDICES. CONTAINER is as for
9586 assign_aggregate. */
9588 aggregate_assign_positional (struct value
*container
,
9589 struct value
*lhs
, struct expression
*exp
,
9590 int *pos
, std::vector
<LONGEST
> &indices
,
9591 LONGEST low
, LONGEST high
)
9593 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9595 if (ind
- 1 == high
)
9596 warning (_("Extra components in aggregate ignored."));
9599 add_component_interval (ind
, ind
, indices
);
9601 assign_component (container
, lhs
, ind
, exp
, pos
);
9604 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9607 /* Assign into the components of LHS indexed by the OP_CHOICES
9608 construct at *POS, updating *POS past the construct, given that
9609 the allowable indices are LOW..HIGH. Record the indices assigned
9610 to in INDICES. CONTAINER is as for assign_aggregate. */
9612 aggregate_assign_from_choices (struct value
*container
,
9613 struct value
*lhs
, struct expression
*exp
,
9614 int *pos
, std::vector
<LONGEST
> &indices
,
9615 LONGEST low
, LONGEST high
)
9618 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9619 int choice_pos
, expr_pc
;
9620 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9622 choice_pos
= *pos
+= 3;
9624 for (j
= 0; j
< n_choices
; j
+= 1)
9625 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9627 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9629 for (j
= 0; j
< n_choices
; j
+= 1)
9631 LONGEST lower
, upper
;
9632 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9634 if (op
== OP_DISCRETE_RANGE
)
9637 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9639 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9644 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9656 name
= &exp
->elts
[choice_pos
+ 2].string
;
9659 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9662 error (_("Invalid record component association."));
9664 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9666 if (! find_struct_field (name
, value_type (lhs
), 0,
9667 NULL
, NULL
, NULL
, NULL
, &ind
))
9668 error (_("Unknown component name: %s."), name
);
9669 lower
= upper
= ind
;
9672 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9673 error (_("Index in component association out of bounds."));
9675 add_component_interval (lower
, upper
, indices
);
9676 while (lower
<= upper
)
9681 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9687 /* Assign the value of the expression in the OP_OTHERS construct in
9688 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9689 have not been previously assigned. The index intervals already assigned
9690 are in INDICES. Updates *POS to after the OP_OTHERS clause.
9691 CONTAINER is as for assign_aggregate. */
9693 aggregate_assign_others (struct value
*container
,
9694 struct value
*lhs
, struct expression
*exp
,
9695 int *pos
, std::vector
<LONGEST
> &indices
,
9696 LONGEST low
, LONGEST high
)
9699 int expr_pc
= *pos
+ 1;
9701 int num_indices
= indices
.size ();
9702 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9706 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9711 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9714 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9717 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9718 [ INDICES[0] .. INDICES[1] ],... The resulting intervals do not
9721 add_component_interval (LONGEST low
, LONGEST high
,
9722 std::vector
<LONGEST
> &indices
)
9726 int size
= indices
.size ();
9727 for (i
= 0; i
< size
; i
+= 2) {
9728 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9732 for (kh
= i
+ 2; kh
< size
; kh
+= 2)
9733 if (high
< indices
[kh
])
9735 if (low
< indices
[i
])
9737 indices
[i
+ 1] = indices
[kh
- 1];
9738 if (high
> indices
[i
+ 1])
9739 indices
[i
+ 1] = high
;
9740 memcpy (indices
.data () + i
+ 2, indices
.data () + kh
, size
- kh
);
9741 indices
.resize (kh
- i
- 2);
9744 else if (high
< indices
[i
])
9748 indices
.resize (indices
.size () + 2);
9749 for (j
= indices
.size () - 1; j
>= i
+ 2; j
-= 1)
9750 indices
[j
] = indices
[j
- 2];
9752 indices
[i
+ 1] = high
;
9755 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9758 static struct value
*
9759 ada_value_cast (struct type
*type
, struct value
*arg2
)
9761 if (type
== ada_check_typedef (value_type (arg2
)))
9764 if (ada_is_gnat_encoded_fixed_point_type (type
))
9765 return cast_to_gnat_encoded_fixed_point_type (type
, arg2
);
9767 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
9768 return cast_from_gnat_encoded_fixed_point_type (type
, arg2
);
9770 return value_cast (type
, arg2
);
9773 /* Evaluating Ada expressions, and printing their result.
9774 ------------------------------------------------------
9779 We usually evaluate an Ada expression in order to print its value.
9780 We also evaluate an expression in order to print its type, which
9781 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9782 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9783 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9784 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9787 Evaluating expressions is a little more complicated for Ada entities
9788 than it is for entities in languages such as C. The main reason for
9789 this is that Ada provides types whose definition might be dynamic.
9790 One example of such types is variant records. Or another example
9791 would be an array whose bounds can only be known at run time.
9793 The following description is a general guide as to what should be
9794 done (and what should NOT be done) in order to evaluate an expression
9795 involving such types, and when. This does not cover how the semantic
9796 information is encoded by GNAT as this is covered separatly. For the
9797 document used as the reference for the GNAT encoding, see exp_dbug.ads
9798 in the GNAT sources.
9800 Ideally, we should embed each part of this description next to its
9801 associated code. Unfortunately, the amount of code is so vast right
9802 now that it's hard to see whether the code handling a particular
9803 situation might be duplicated or not. One day, when the code is
9804 cleaned up, this guide might become redundant with the comments
9805 inserted in the code, and we might want to remove it.
9807 2. ``Fixing'' an Entity, the Simple Case:
9808 -----------------------------------------
9810 When evaluating Ada expressions, the tricky issue is that they may
9811 reference entities whose type contents and size are not statically
9812 known. Consider for instance a variant record:
9814 type Rec (Empty : Boolean := True) is record
9817 when False => Value : Integer;
9820 Yes : Rec := (Empty => False, Value => 1);
9821 No : Rec := (empty => True);
9823 The size and contents of that record depends on the value of the
9824 descriminant (Rec.Empty). At this point, neither the debugging
9825 information nor the associated type structure in GDB are able to
9826 express such dynamic types. So what the debugger does is to create
9827 "fixed" versions of the type that applies to the specific object.
9828 We also informally refer to this operation as "fixing" an object,
9829 which means creating its associated fixed type.
9831 Example: when printing the value of variable "Yes" above, its fixed
9832 type would look like this:
9839 On the other hand, if we printed the value of "No", its fixed type
9846 Things become a little more complicated when trying to fix an entity
9847 with a dynamic type that directly contains another dynamic type,
9848 such as an array of variant records, for instance. There are
9849 two possible cases: Arrays, and records.
9851 3. ``Fixing'' Arrays:
9852 ---------------------
9854 The type structure in GDB describes an array in terms of its bounds,
9855 and the type of its elements. By design, all elements in the array
9856 have the same type and we cannot represent an array of variant elements
9857 using the current type structure in GDB. When fixing an array,
9858 we cannot fix the array element, as we would potentially need one
9859 fixed type per element of the array. As a result, the best we can do
9860 when fixing an array is to produce an array whose bounds and size
9861 are correct (allowing us to read it from memory), but without having
9862 touched its element type. Fixing each element will be done later,
9863 when (if) necessary.
9865 Arrays are a little simpler to handle than records, because the same
9866 amount of memory is allocated for each element of the array, even if
9867 the amount of space actually used by each element differs from element
9868 to element. Consider for instance the following array of type Rec:
9870 type Rec_Array is array (1 .. 2) of Rec;
9872 The actual amount of memory occupied by each element might be different
9873 from element to element, depending on the value of their discriminant.
9874 But the amount of space reserved for each element in the array remains
9875 fixed regardless. So we simply need to compute that size using
9876 the debugging information available, from which we can then determine
9877 the array size (we multiply the number of elements of the array by
9878 the size of each element).
9880 The simplest case is when we have an array of a constrained element
9881 type. For instance, consider the following type declarations:
9883 type Bounded_String (Max_Size : Integer) is
9885 Buffer : String (1 .. Max_Size);
9887 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9889 In this case, the compiler describes the array as an array of
9890 variable-size elements (identified by its XVS suffix) for which
9891 the size can be read in the parallel XVZ variable.
9893 In the case of an array of an unconstrained element type, the compiler
9894 wraps the array element inside a private PAD type. This type should not
9895 be shown to the user, and must be "unwrap"'ed before printing. Note
9896 that we also use the adjective "aligner" in our code to designate
9897 these wrapper types.
9899 In some cases, the size allocated for each element is statically
9900 known. In that case, the PAD type already has the correct size,
9901 and the array element should remain unfixed.
9903 But there are cases when this size is not statically known.
9904 For instance, assuming that "Five" is an integer variable:
9906 type Dynamic is array (1 .. Five) of Integer;
9907 type Wrapper (Has_Length : Boolean := False) is record
9910 when True => Length : Integer;
9914 type Wrapper_Array is array (1 .. 2) of Wrapper;
9916 Hello : Wrapper_Array := (others => (Has_Length => True,
9917 Data => (others => 17),
9921 The debugging info would describe variable Hello as being an
9922 array of a PAD type. The size of that PAD type is not statically
9923 known, but can be determined using a parallel XVZ variable.
9924 In that case, a copy of the PAD type with the correct size should
9925 be used for the fixed array.
9927 3. ``Fixing'' record type objects:
9928 ----------------------------------
9930 Things are slightly different from arrays in the case of dynamic
9931 record types. In this case, in order to compute the associated
9932 fixed type, we need to determine the size and offset of each of
9933 its components. This, in turn, requires us to compute the fixed
9934 type of each of these components.
9936 Consider for instance the example:
9938 type Bounded_String (Max_Size : Natural) is record
9939 Str : String (1 .. Max_Size);
9942 My_String : Bounded_String (Max_Size => 10);
9944 In that case, the position of field "Length" depends on the size
9945 of field Str, which itself depends on the value of the Max_Size
9946 discriminant. In order to fix the type of variable My_String,
9947 we need to fix the type of field Str. Therefore, fixing a variant
9948 record requires us to fix each of its components.
9950 However, if a component does not have a dynamic size, the component
9951 should not be fixed. In particular, fields that use a PAD type
9952 should not fixed. Here is an example where this might happen
9953 (assuming type Rec above):
9955 type Container (Big : Boolean) is record
9959 when True => Another : Integer;
9963 My_Container : Container := (Big => False,
9964 First => (Empty => True),
9967 In that example, the compiler creates a PAD type for component First,
9968 whose size is constant, and then positions the component After just
9969 right after it. The offset of component After is therefore constant
9972 The debugger computes the position of each field based on an algorithm
9973 that uses, among other things, the actual position and size of the field
9974 preceding it. Let's now imagine that the user is trying to print
9975 the value of My_Container. If the type fixing was recursive, we would
9976 end up computing the offset of field After based on the size of the
9977 fixed version of field First. And since in our example First has
9978 only one actual field, the size of the fixed type is actually smaller
9979 than the amount of space allocated to that field, and thus we would
9980 compute the wrong offset of field After.
9982 To make things more complicated, we need to watch out for dynamic
9983 components of variant records (identified by the ___XVL suffix in
9984 the component name). Even if the target type is a PAD type, the size
9985 of that type might not be statically known. So the PAD type needs
9986 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9987 we might end up with the wrong size for our component. This can be
9988 observed with the following type declarations:
9990 type Octal is new Integer range 0 .. 7;
9991 type Octal_Array is array (Positive range <>) of Octal;
9992 pragma Pack (Octal_Array);
9994 type Octal_Buffer (Size : Positive) is record
9995 Buffer : Octal_Array (1 .. Size);
9999 In that case, Buffer is a PAD type whose size is unset and needs
10000 to be computed by fixing the unwrapped type.
10002 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10003 ----------------------------------------------------------
10005 Lastly, when should the sub-elements of an entity that remained unfixed
10006 thus far, be actually fixed?
10008 The answer is: Only when referencing that element. For instance
10009 when selecting one component of a record, this specific component
10010 should be fixed at that point in time. Or when printing the value
10011 of a record, each component should be fixed before its value gets
10012 printed. Similarly for arrays, the element of the array should be
10013 fixed when printing each element of the array, or when extracting
10014 one element out of that array. On the other hand, fixing should
10015 not be performed on the elements when taking a slice of an array!
10017 Note that one of the side effects of miscomputing the offset and
10018 size of each field is that we end up also miscomputing the size
10019 of the containing type. This can have adverse results when computing
10020 the value of an entity. GDB fetches the value of an entity based
10021 on the size of its type, and thus a wrong size causes GDB to fetch
10022 the wrong amount of memory. In the case where the computed size is
10023 too small, GDB fetches too little data to print the value of our
10024 entity. Results in this case are unpredictable, as we usually read
10025 past the buffer containing the data =:-o. */
10027 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10028 for that subexpression cast to TO_TYPE. Advance *POS over the
10032 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10033 enum noside noside
, struct type
*to_type
)
10037 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10038 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10043 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10045 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10046 return value_zero (to_type
, not_lval
);
10048 val
= evaluate_var_msym_value (noside
,
10049 exp
->elts
[pc
+ 1].objfile
,
10050 exp
->elts
[pc
+ 2].msymbol
);
10053 val
= evaluate_var_value (noside
,
10054 exp
->elts
[pc
+ 1].block
,
10055 exp
->elts
[pc
+ 2].symbol
);
10057 if (noside
== EVAL_SKIP
)
10058 return eval_skip_value (exp
);
10060 val
= ada_value_cast (to_type
, val
);
10062 /* Follow the Ada language semantics that do not allow taking
10063 an address of the result of a cast (view conversion in Ada). */
10064 if (VALUE_LVAL (val
) == lval_memory
)
10066 if (value_lazy (val
))
10067 value_fetch_lazy (val
);
10068 VALUE_LVAL (val
) = not_lval
;
10073 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10074 if (noside
== EVAL_SKIP
)
10075 return eval_skip_value (exp
);
10076 return ada_value_cast (to_type
, val
);
10079 /* Implement the evaluate_exp routine in the exp_descriptor structure
10080 for the Ada language. */
10082 static struct value
*
10083 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10084 int *pos
, enum noside noside
)
10086 enum exp_opcode op
;
10090 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10093 struct value
**argvec
;
10097 op
= exp
->elts
[pc
].opcode
;
10103 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10105 if (noside
== EVAL_NORMAL
)
10106 arg1
= unwrap_value (arg1
);
10108 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10109 then we need to perform the conversion manually, because
10110 evaluate_subexp_standard doesn't do it. This conversion is
10111 necessary in Ada because the different kinds of float/fixed
10112 types in Ada have different representations.
10114 Similarly, we need to perform the conversion from OP_LONG
10116 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10117 arg1
= ada_value_cast (expect_type
, arg1
);
10123 struct value
*result
;
10126 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10127 /* The result type will have code OP_STRING, bashed there from
10128 OP_ARRAY. Bash it back. */
10129 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10130 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10136 type
= exp
->elts
[pc
+ 1].type
;
10137 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10141 type
= exp
->elts
[pc
+ 1].type
;
10142 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10145 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10146 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10148 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10149 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10151 return ada_value_assign (arg1
, arg1
);
10153 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10154 except if the lhs of our assignment is a convenience variable.
10155 In the case of assigning to a convenience variable, the lhs
10156 should be exactly the result of the evaluation of the rhs. */
10157 type
= value_type (arg1
);
10158 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10160 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10161 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10163 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10167 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10168 arg2
= cast_to_gnat_encoded_fixed_point_type (value_type (arg1
), arg2
);
10169 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10171 (_("Fixed-point values must be assigned to fixed-point variables"));
10173 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10174 return ada_value_assign (arg1
, arg2
);
10177 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10178 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10179 if (noside
== EVAL_SKIP
)
10181 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10182 return (value_from_longest
10183 (value_type (arg1
),
10184 value_as_long (arg1
) + value_as_long (arg2
)));
10185 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10186 return (value_from_longest
10187 (value_type (arg2
),
10188 value_as_long (arg1
) + value_as_long (arg2
)));
10189 /* Preserve the original type for use by the range case below.
10190 We cannot cast the result to a reference type, so if ARG1 is
10191 a reference type, find its underlying type. */
10192 type
= value_type (arg1
);
10193 while (type
->code () == TYPE_CODE_REF
)
10194 type
= TYPE_TARGET_TYPE (type
);
10195 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10196 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10198 if (value_type (arg1
) != value_type (arg2
))
10199 error (_("Operands of fixed-point addition must have the same type"));
10202 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10203 arg1
= value_binop (arg1
, arg2
, BINOP_ADD
);
10204 /* We need to special-case the result of adding to a range.
10205 This is done for the benefit of "ptype". gdb's Ada support
10206 historically used the LHS to set the result type here, so
10207 preserve this behavior. */
10208 if (type
->code () == TYPE_CODE_RANGE
)
10209 arg1
= value_cast (type
, arg1
);
10213 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10214 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10215 if (noside
== EVAL_SKIP
)
10217 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10218 return (value_from_longest
10219 (value_type (arg1
),
10220 value_as_long (arg1
) - value_as_long (arg2
)));
10221 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10222 return (value_from_longest
10223 (value_type (arg2
),
10224 value_as_long (arg1
) - value_as_long (arg2
)));
10225 /* Preserve the original type for use by the range case below.
10226 We cannot cast the result to a reference type, so if ARG1 is
10227 a reference type, find its underlying type. */
10228 type
= value_type (arg1
);
10229 while (type
->code () == TYPE_CODE_REF
)
10230 type
= TYPE_TARGET_TYPE (type
);
10231 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10232 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10234 if (value_type (arg1
) != value_type (arg2
))
10235 error (_("Operands of fixed-point subtraction "
10236 "must have the same type"));
10239 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10240 arg1
= value_binop (arg1
, arg2
, BINOP_SUB
);
10241 /* We need to special-case the result of adding to a range.
10242 This is done for the benefit of "ptype". gdb's Ada support
10243 historically used the LHS to set the result type here, so
10244 preserve this behavior. */
10245 if (type
->code () == TYPE_CODE_RANGE
)
10246 arg1
= value_cast (type
, arg1
);
10253 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10254 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10255 if (noside
== EVAL_SKIP
)
10257 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10259 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10260 return value_zero (value_type (arg1
), not_lval
);
10264 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10265 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10266 arg1
= cast_from_gnat_encoded_fixed_point_type (type
, arg1
);
10267 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10268 arg2
= cast_from_gnat_encoded_fixed_point_type (type
, arg2
);
10269 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10270 return ada_value_binop (arg1
, arg2
, op
);
10274 case BINOP_NOTEQUAL
:
10275 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10276 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10277 if (noside
== EVAL_SKIP
)
10279 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10283 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10284 tem
= ada_value_equal (arg1
, arg2
);
10286 if (op
== BINOP_NOTEQUAL
)
10288 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10289 return value_from_longest (type
, (LONGEST
) tem
);
10292 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10293 if (noside
== EVAL_SKIP
)
10295 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10296 return value_cast (value_type (arg1
), value_neg (arg1
));
10299 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10300 return value_neg (arg1
);
10303 case BINOP_LOGICAL_AND
:
10304 case BINOP_LOGICAL_OR
:
10305 case UNOP_LOGICAL_NOT
:
10310 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10311 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10312 return value_cast (type
, val
);
10315 case BINOP_BITWISE_AND
:
10316 case BINOP_BITWISE_IOR
:
10317 case BINOP_BITWISE_XOR
:
10321 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10323 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10325 return value_cast (value_type (arg1
), val
);
10331 if (noside
== EVAL_SKIP
)
10337 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10338 /* Only encountered when an unresolved symbol occurs in a
10339 context other than a function call, in which case, it is
10341 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10342 exp
->elts
[pc
+ 2].symbol
->print_name ());
10344 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10346 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10347 /* Check to see if this is a tagged type. We also need to handle
10348 the case where the type is a reference to a tagged type, but
10349 we have to be careful to exclude pointers to tagged types.
10350 The latter should be shown as usual (as a pointer), whereas
10351 a reference should mostly be transparent to the user. */
10352 if (ada_is_tagged_type (type
, 0)
10353 || (type
->code () == TYPE_CODE_REF
10354 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10356 /* Tagged types are a little special in the fact that the real
10357 type is dynamic and can only be determined by inspecting the
10358 object's tag. This means that we need to get the object's
10359 value first (EVAL_NORMAL) and then extract the actual object
10362 Note that we cannot skip the final step where we extract
10363 the object type from its tag, because the EVAL_NORMAL phase
10364 results in dynamic components being resolved into fixed ones.
10365 This can cause problems when trying to print the type
10366 description of tagged types whose parent has a dynamic size:
10367 We use the type name of the "_parent" component in order
10368 to print the name of the ancestor type in the type description.
10369 If that component had a dynamic size, the resolution into
10370 a fixed type would result in the loss of that type name,
10371 thus preventing us from printing the name of the ancestor
10372 type in the type description. */
10373 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_NORMAL
);
10375 if (type
->code () != TYPE_CODE_REF
)
10377 struct type
*actual_type
;
10379 actual_type
= type_from_tag (ada_value_tag (arg1
));
10380 if (actual_type
== NULL
)
10381 /* If, for some reason, we were unable to determine
10382 the actual type from the tag, then use the static
10383 approximation that we just computed as a fallback.
10384 This can happen if the debugging information is
10385 incomplete, for instance. */
10386 actual_type
= type
;
10387 return value_zero (actual_type
, not_lval
);
10391 /* In the case of a ref, ada_coerce_ref takes care
10392 of determining the actual type. But the evaluation
10393 should return a ref as it should be valid to ask
10394 for its address; so rebuild a ref after coerce. */
10395 arg1
= ada_coerce_ref (arg1
);
10396 return value_ref (arg1
, TYPE_CODE_REF
);
10400 /* Records and unions for which GNAT encodings have been
10401 generated need to be statically fixed as well.
10402 Otherwise, non-static fixing produces a type where
10403 all dynamic properties are removed, which prevents "ptype"
10404 from being able to completely describe the type.
10405 For instance, a case statement in a variant record would be
10406 replaced by the relevant components based on the actual
10407 value of the discriminants. */
10408 if ((type
->code () == TYPE_CODE_STRUCT
10409 && dynamic_template_type (type
) != NULL
)
10410 || (type
->code () == TYPE_CODE_UNION
10411 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10414 return value_zero (to_static_fixed_type (type
), not_lval
);
10418 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10419 return ada_to_fixed_value (arg1
);
10424 /* Allocate arg vector, including space for the function to be
10425 called in argvec[0] and a terminating NULL. */
10426 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10427 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10429 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10430 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10431 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10432 exp
->elts
[pc
+ 5].symbol
->print_name ());
10435 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10436 argvec
[tem
] = evaluate_subexp (nullptr, exp
, pos
, noside
);
10439 if (noside
== EVAL_SKIP
)
10443 if (ada_is_constrained_packed_array_type
10444 (desc_base_type (value_type (argvec
[0]))))
10445 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10446 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10447 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10448 /* This is a packed array that has already been fixed, and
10449 therefore already coerced to a simple array. Nothing further
10452 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10454 /* Make sure we dereference references so that all the code below
10455 feels like it's really handling the referenced value. Wrapping
10456 types (for alignment) may be there, so make sure we strip them as
10458 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10460 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10461 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10462 argvec
[0] = value_addr (argvec
[0]);
10464 type
= ada_check_typedef (value_type (argvec
[0]));
10466 /* Ada allows us to implicitly dereference arrays when subscripting
10467 them. So, if this is an array typedef (encoding use for array
10468 access types encoded as fat pointers), strip it now. */
10469 if (type
->code () == TYPE_CODE_TYPEDEF
)
10470 type
= ada_typedef_target_type (type
);
10472 if (type
->code () == TYPE_CODE_PTR
)
10474 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10476 case TYPE_CODE_FUNC
:
10477 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10479 case TYPE_CODE_ARRAY
:
10481 case TYPE_CODE_STRUCT
:
10482 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10483 argvec
[0] = ada_value_ind (argvec
[0]);
10484 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10487 error (_("cannot subscript or call something of type `%s'"),
10488 ada_type_name (value_type (argvec
[0])));
10493 switch (type
->code ())
10495 case TYPE_CODE_FUNC
:
10496 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10498 if (TYPE_TARGET_TYPE (type
) == NULL
)
10499 error_call_unknown_return_type (NULL
);
10500 return allocate_value (TYPE_TARGET_TYPE (type
));
10502 return call_function_by_hand (argvec
[0], NULL
,
10503 gdb::make_array_view (argvec
+ 1,
10505 case TYPE_CODE_INTERNAL_FUNCTION
:
10506 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10507 /* We don't know anything about what the internal
10508 function might return, but we have to return
10510 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10513 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10514 argvec
[0], nargs
, argvec
+ 1);
10516 case TYPE_CODE_STRUCT
:
10520 arity
= ada_array_arity (type
);
10521 type
= ada_array_element_type (type
, nargs
);
10523 error (_("cannot subscript or call a record"));
10524 if (arity
!= nargs
)
10525 error (_("wrong number of subscripts; expecting %d"), arity
);
10526 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10527 return value_zero (ada_aligned_type (type
), lval_memory
);
10529 unwrap_value (ada_value_subscript
10530 (argvec
[0], nargs
, argvec
+ 1));
10532 case TYPE_CODE_ARRAY
:
10533 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10535 type
= ada_array_element_type (type
, nargs
);
10537 error (_("element type of array unknown"));
10539 return value_zero (ada_aligned_type (type
), lval_memory
);
10542 unwrap_value (ada_value_subscript
10543 (ada_coerce_to_simple_array (argvec
[0]),
10544 nargs
, argvec
+ 1));
10545 case TYPE_CODE_PTR
: /* Pointer to array */
10546 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10548 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10549 type
= ada_array_element_type (type
, nargs
);
10551 error (_("element type of array unknown"));
10553 return value_zero (ada_aligned_type (type
), lval_memory
);
10556 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10557 nargs
, argvec
+ 1));
10560 error (_("Attempt to index or call something other than an "
10561 "array or function"));
10566 struct value
*array
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10567 struct value
*low_bound_val
10568 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10569 struct value
*high_bound_val
10570 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10572 LONGEST high_bound
;
10574 low_bound_val
= coerce_ref (low_bound_val
);
10575 high_bound_val
= coerce_ref (high_bound_val
);
10576 low_bound
= value_as_long (low_bound_val
);
10577 high_bound
= value_as_long (high_bound_val
);
10579 if (noside
== EVAL_SKIP
)
10582 /* If this is a reference to an aligner type, then remove all
10584 if (value_type (array
)->code () == TYPE_CODE_REF
10585 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10586 TYPE_TARGET_TYPE (value_type (array
)) =
10587 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10589 if (ada_is_any_packed_array_type (value_type (array
)))
10590 error (_("cannot slice a packed array"));
10592 /* If this is a reference to an array or an array lvalue,
10593 convert to a pointer. */
10594 if (value_type (array
)->code () == TYPE_CODE_REF
10595 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10596 && VALUE_LVAL (array
) == lval_memory
))
10597 array
= value_addr (array
);
10599 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10600 && ada_is_array_descriptor_type (ada_check_typedef
10601 (value_type (array
))))
10602 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10605 array
= ada_coerce_to_simple_array_ptr (array
);
10607 /* If we have more than one level of pointer indirection,
10608 dereference the value until we get only one level. */
10609 while (value_type (array
)->code () == TYPE_CODE_PTR
10610 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10612 array
= value_ind (array
);
10614 /* Make sure we really do have an array type before going further,
10615 to avoid a SEGV when trying to get the index type or the target
10616 type later down the road if the debug info generated by
10617 the compiler is incorrect or incomplete. */
10618 if (!ada_is_simple_array_type (value_type (array
)))
10619 error (_("cannot take slice of non-array"));
10621 if (ada_check_typedef (value_type (array
))->code ()
10624 struct type
*type0
= ada_check_typedef (value_type (array
));
10626 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10627 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10630 struct type
*arr_type0
=
10631 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10633 return ada_value_slice_from_ptr (array
, arr_type0
,
10634 longest_to_int (low_bound
),
10635 longest_to_int (high_bound
));
10638 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10640 else if (high_bound
< low_bound
)
10641 return empty_array (value_type (array
), low_bound
, high_bound
);
10643 return ada_value_slice (array
, longest_to_int (low_bound
),
10644 longest_to_int (high_bound
));
10647 case UNOP_IN_RANGE
:
10649 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10650 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10652 if (noside
== EVAL_SKIP
)
10655 switch (type
->code ())
10658 lim_warning (_("Membership test incompletely implemented; "
10659 "always returns true"));
10660 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10661 return value_from_longest (type
, (LONGEST
) 1);
10663 case TYPE_CODE_RANGE
:
10664 arg2
= value_from_longest (type
,
10665 type
->bounds ()->low
.const_val ());
10666 arg3
= value_from_longest (type
,
10667 type
->bounds ()->high
.const_val ());
10668 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10669 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10670 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10672 value_from_longest (type
,
10673 (value_less (arg1
, arg3
)
10674 || value_equal (arg1
, arg3
))
10675 && (value_less (arg2
, arg1
)
10676 || value_equal (arg2
, arg1
)));
10679 case BINOP_IN_BOUNDS
:
10681 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10682 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10684 if (noside
== EVAL_SKIP
)
10687 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10689 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10690 return value_zero (type
, not_lval
);
10693 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10695 type
= ada_index_type (value_type (arg2
), tem
, "range");
10697 type
= value_type (arg1
);
10699 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10700 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10702 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10703 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10704 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10706 value_from_longest (type
,
10707 (value_less (arg1
, arg3
)
10708 || value_equal (arg1
, arg3
))
10709 && (value_less (arg2
, arg1
)
10710 || value_equal (arg2
, arg1
)));
10712 case TERNOP_IN_RANGE
:
10713 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10714 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10715 arg3
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10717 if (noside
== EVAL_SKIP
)
10720 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10721 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10722 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10724 value_from_longest (type
,
10725 (value_less (arg1
, arg3
)
10726 || value_equal (arg1
, arg3
))
10727 && (value_less (arg2
, arg1
)
10728 || value_equal (arg2
, arg1
)));
10732 case OP_ATR_LENGTH
:
10734 struct type
*type_arg
;
10736 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10738 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10740 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10744 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10748 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10749 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10750 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10753 if (noside
== EVAL_SKIP
)
10755 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10757 if (type_arg
== NULL
)
10758 type_arg
= value_type (arg1
);
10760 if (ada_is_constrained_packed_array_type (type_arg
))
10761 type_arg
= decode_constrained_packed_array_type (type_arg
);
10763 if (!discrete_type_p (type_arg
))
10767 default: /* Should never happen. */
10768 error (_("unexpected attribute encountered"));
10771 type_arg
= ada_index_type (type_arg
, tem
,
10772 ada_attribute_name (op
));
10774 case OP_ATR_LENGTH
:
10775 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
10780 return value_zero (type_arg
, not_lval
);
10782 else if (type_arg
== NULL
)
10784 arg1
= ada_coerce_ref (arg1
);
10786 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10787 arg1
= ada_coerce_to_simple_array (arg1
);
10789 if (op
== OP_ATR_LENGTH
)
10790 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10793 type
= ada_index_type (value_type (arg1
), tem
,
10794 ada_attribute_name (op
));
10796 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10801 default: /* Should never happen. */
10802 error (_("unexpected attribute encountered"));
10804 return value_from_longest
10805 (type
, ada_array_bound (arg1
, tem
, 0));
10807 return value_from_longest
10808 (type
, ada_array_bound (arg1
, tem
, 1));
10809 case OP_ATR_LENGTH
:
10810 return value_from_longest
10811 (type
, ada_array_length (arg1
, tem
));
10814 else if (discrete_type_p (type_arg
))
10816 struct type
*range_type
;
10817 const char *name
= ada_type_name (type_arg
);
10820 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
10821 range_type
= to_fixed_range_type (type_arg
, NULL
);
10822 if (range_type
== NULL
)
10823 range_type
= type_arg
;
10827 error (_("unexpected attribute encountered"));
10829 return value_from_longest
10830 (range_type
, ada_discrete_type_low_bound (range_type
));
10832 return value_from_longest
10833 (range_type
, ada_discrete_type_high_bound (range_type
));
10834 case OP_ATR_LENGTH
:
10835 error (_("the 'length attribute applies only to array types"));
10838 else if (type_arg
->code () == TYPE_CODE_FLT
)
10839 error (_("unimplemented type attribute"));
10844 if (ada_is_constrained_packed_array_type (type_arg
))
10845 type_arg
= decode_constrained_packed_array_type (type_arg
);
10847 if (op
== OP_ATR_LENGTH
)
10848 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10851 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10853 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10859 error (_("unexpected attribute encountered"));
10861 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10862 return value_from_longest (type
, low
);
10864 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10865 return value_from_longest (type
, high
);
10866 case OP_ATR_LENGTH
:
10867 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10868 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10869 return value_from_longest (type
, high
- low
+ 1);
10875 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10876 if (noside
== EVAL_SKIP
)
10879 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10880 return value_zero (ada_tag_type (arg1
), not_lval
);
10882 return ada_value_tag (arg1
);
10886 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10887 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10888 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10889 if (noside
== EVAL_SKIP
)
10891 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10892 return value_zero (value_type (arg1
), not_lval
);
10895 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10896 return value_binop (arg1
, arg2
,
10897 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10900 case OP_ATR_MODULUS
:
10902 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10904 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10905 if (noside
== EVAL_SKIP
)
10908 if (!ada_is_modular_type (type_arg
))
10909 error (_("'modulus must be applied to modular type"));
10911 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10912 ada_modulus (type_arg
));
10917 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10918 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10919 if (noside
== EVAL_SKIP
)
10921 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10922 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10923 return value_zero (type
, not_lval
);
10925 return value_pos_atr (type
, arg1
);
10928 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10929 type
= value_type (arg1
);
10931 /* If the argument is a reference, then dereference its type, since
10932 the user is really asking for the size of the actual object,
10933 not the size of the pointer. */
10934 if (type
->code () == TYPE_CODE_REF
)
10935 type
= TYPE_TARGET_TYPE (type
);
10937 if (noside
== EVAL_SKIP
)
10939 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10940 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10942 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10943 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10946 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10947 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10948 type
= exp
->elts
[pc
+ 2].type
;
10949 if (noside
== EVAL_SKIP
)
10951 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10952 return value_zero (type
, not_lval
);
10954 return value_val_atr (type
, arg1
);
10957 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10958 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10959 if (noside
== EVAL_SKIP
)
10961 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10962 return value_zero (value_type (arg1
), not_lval
);
10965 /* For integer exponentiation operations,
10966 only promote the first argument. */
10967 if (is_integral_type (value_type (arg2
)))
10968 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10970 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10972 return value_binop (arg1
, arg2
, op
);
10976 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10977 if (noside
== EVAL_SKIP
)
10983 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10984 if (noside
== EVAL_SKIP
)
10986 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10987 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10988 return value_neg (arg1
);
10993 preeval_pos
= *pos
;
10994 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10995 if (noside
== EVAL_SKIP
)
10997 type
= ada_check_typedef (value_type (arg1
));
10998 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11000 if (ada_is_array_descriptor_type (type
))
11001 /* GDB allows dereferencing GNAT array descriptors. */
11003 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11005 if (arrType
== NULL
)
11006 error (_("Attempt to dereference null array pointer."));
11007 return value_at_lazy (arrType
, 0);
11009 else if (type
->code () == TYPE_CODE_PTR
11010 || type
->code () == TYPE_CODE_REF
11011 /* In C you can dereference an array to get the 1st elt. */
11012 || type
->code () == TYPE_CODE_ARRAY
)
11014 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11015 only be determined by inspecting the object's tag.
11016 This means that we need to evaluate completely the
11017 expression in order to get its type. */
11019 if ((type
->code () == TYPE_CODE_REF
11020 || type
->code () == TYPE_CODE_PTR
)
11021 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11024 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11025 type
= value_type (ada_value_ind (arg1
));
11029 type
= to_static_fixed_type
11031 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11033 ada_ensure_varsize_limit (type
);
11034 return value_zero (type
, lval_memory
);
11036 else if (type
->code () == TYPE_CODE_INT
)
11038 /* GDB allows dereferencing an int. */
11039 if (expect_type
== NULL
)
11040 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11045 to_static_fixed_type (ada_aligned_type (expect_type
));
11046 return value_zero (expect_type
, lval_memory
);
11050 error (_("Attempt to take contents of a non-pointer value."));
11052 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11053 type
= ada_check_typedef (value_type (arg1
));
11055 if (type
->code () == TYPE_CODE_INT
)
11056 /* GDB allows dereferencing an int. If we were given
11057 the expect_type, then use that as the target type.
11058 Otherwise, assume that the target type is an int. */
11060 if (expect_type
!= NULL
)
11061 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11064 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11065 (CORE_ADDR
) value_as_address (arg1
));
11068 if (ada_is_array_descriptor_type (type
))
11069 /* GDB allows dereferencing GNAT array descriptors. */
11070 return ada_coerce_to_simple_array (arg1
);
11072 return ada_value_ind (arg1
);
11074 case STRUCTOP_STRUCT
:
11075 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11076 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11077 preeval_pos
= *pos
;
11078 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11079 if (noside
== EVAL_SKIP
)
11081 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11083 struct type
*type1
= value_type (arg1
);
11085 if (ada_is_tagged_type (type1
, 1))
11087 type
= ada_lookup_struct_elt_type (type1
,
11088 &exp
->elts
[pc
+ 2].string
,
11091 /* If the field is not found, check if it exists in the
11092 extension of this object's type. This means that we
11093 need to evaluate completely the expression. */
11098 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11099 arg1
= ada_value_struct_elt (arg1
,
11100 &exp
->elts
[pc
+ 2].string
,
11102 arg1
= unwrap_value (arg1
);
11103 type
= value_type (ada_to_fixed_value (arg1
));
11108 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11111 return value_zero (ada_aligned_type (type
), lval_memory
);
11115 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11116 arg1
= unwrap_value (arg1
);
11117 return ada_to_fixed_value (arg1
);
11121 /* The value is not supposed to be used. This is here to make it
11122 easier to accommodate expressions that contain types. */
11124 if (noside
== EVAL_SKIP
)
11126 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11127 return allocate_value (exp
->elts
[pc
+ 1].type
);
11129 error (_("Attempt to use a type name as an expression"));
11134 case OP_DISCRETE_RANGE
:
11135 case OP_POSITIONAL
:
11137 if (noside
== EVAL_NORMAL
)
11141 error (_("Undefined name, ambiguous name, or renaming used in "
11142 "component association: %s."), &exp
->elts
[pc
+2].string
);
11144 error (_("Aggregates only allowed on the right of an assignment"));
11146 internal_error (__FILE__
, __LINE__
,
11147 _("aggregate apparently mangled"));
11150 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11152 for (tem
= 0; tem
< nargs
; tem
+= 1)
11153 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11158 return eval_skip_value (exp
);
11164 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11165 type name that encodes the 'small and 'delta information.
11166 Otherwise, return NULL. */
11168 static const char *
11169 gnat_encoded_fixed_point_type_info (struct type
*type
)
11171 const char *name
= ada_type_name (type
);
11172 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: type
->code ();
11174 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11176 const char *tail
= strstr (name
, "___XF_");
11183 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11184 return gnat_encoded_fixed_point_type_info (TYPE_TARGET_TYPE (type
));
11189 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11192 ada_is_gnat_encoded_fixed_point_type (struct type
*type
)
11194 return gnat_encoded_fixed_point_type_info (type
) != NULL
;
11197 /* Return non-zero iff TYPE represents a System.Address type. */
11200 ada_is_system_address_type (struct type
*type
)
11202 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11205 /* Assuming that TYPE is the representation of an Ada fixed-point
11206 type, return the target floating-point type to be used to represent
11207 of this type during internal computation. */
11209 static struct type
*
11210 ada_scaling_type (struct type
*type
)
11212 return builtin_type (type
->arch ())->builtin_long_double
;
11215 /* Assuming that TYPE is the representation of an Ada fixed-point
11216 type, return its delta, or NULL if the type is malformed and the
11217 delta cannot be determined. */
11220 gnat_encoded_fixed_point_delta (struct type
*type
)
11222 const char *encoding
= gnat_encoded_fixed_point_type_info (type
);
11223 struct type
*scale_type
= ada_scaling_type (type
);
11225 long long num
, den
;
11227 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11230 return value_binop (value_from_longest (scale_type
, num
),
11231 value_from_longest (scale_type
, den
), BINOP_DIV
);
11234 /* Assuming that ada_is_gnat_encoded_fixed_point_type (TYPE), return
11235 the scaling factor ('SMALL value) associated with the type. */
11238 gnat_encoded_fixed_point_scaling_factor (struct type
*type
)
11240 const char *encoding
= gnat_encoded_fixed_point_type_info (type
);
11241 struct type
*scale_type
= ada_scaling_type (type
);
11243 long long num0
, den0
, num1
, den1
;
11246 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11247 &num0
, &den0
, &num1
, &den1
);
11250 return value_from_longest (scale_type
, 1);
11252 return value_binop (value_from_longest (scale_type
, num1
),
11253 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11255 return value_binop (value_from_longest (scale_type
, num0
),
11256 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11263 /* Scan STR beginning at position K for a discriminant name, and
11264 return the value of that discriminant field of DVAL in *PX. If
11265 PNEW_K is not null, put the position of the character beyond the
11266 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11267 not alter *PX and *PNEW_K if unsuccessful. */
11270 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11273 static char *bound_buffer
= NULL
;
11274 static size_t bound_buffer_len
= 0;
11275 const char *pstart
, *pend
, *bound
;
11276 struct value
*bound_val
;
11278 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11282 pend
= strstr (pstart
, "__");
11286 k
+= strlen (bound
);
11290 int len
= pend
- pstart
;
11292 /* Strip __ and beyond. */
11293 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11294 strncpy (bound_buffer
, pstart
, len
);
11295 bound_buffer
[len
] = '\0';
11297 bound
= bound_buffer
;
11301 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11302 if (bound_val
== NULL
)
11305 *px
= value_as_long (bound_val
);
11306 if (pnew_k
!= NULL
)
11311 /* Value of variable named NAME. Only exact matches are considered.
11312 If no such variable found, then if ERR_MSG is null, returns 0, and
11313 otherwise causes an error with message ERR_MSG. */
11315 static struct value
*
11316 get_var_value (const char *name
, const char *err_msg
)
11318 std::string quoted_name
= add_angle_brackets (name
);
11320 lookup_name_info
lookup_name (quoted_name
, symbol_name_match_type::FULL
);
11322 std::vector
<struct block_symbol
> syms
;
11323 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11324 get_selected_block (0),
11325 VAR_DOMAIN
, &syms
, 1);
11329 if (err_msg
== NULL
)
11332 error (("%s"), err_msg
);
11335 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11338 /* Value of integer variable named NAME in the current environment.
11339 If no such variable is found, returns false. Otherwise, sets VALUE
11340 to the variable's value and returns true. */
11343 get_int_var_value (const char *name
, LONGEST
&value
)
11345 struct value
*var_val
= get_var_value (name
, 0);
11350 value
= value_as_long (var_val
);
11355 /* Return a range type whose base type is that of the range type named
11356 NAME in the current environment, and whose bounds are calculated
11357 from NAME according to the GNAT range encoding conventions.
11358 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11359 corresponding range type from debug information; fall back to using it
11360 if symbol lookup fails. If a new type must be created, allocate it
11361 like ORIG_TYPE was. The bounds information, in general, is encoded
11362 in NAME, the base type given in the named range type. */
11364 static struct type
*
11365 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11368 struct type
*base_type
;
11369 const char *subtype_info
;
11371 gdb_assert (raw_type
!= NULL
);
11372 gdb_assert (raw_type
->name () != NULL
);
11374 if (raw_type
->code () == TYPE_CODE_RANGE
)
11375 base_type
= TYPE_TARGET_TYPE (raw_type
);
11377 base_type
= raw_type
;
11379 name
= raw_type
->name ();
11380 subtype_info
= strstr (name
, "___XD");
11381 if (subtype_info
== NULL
)
11383 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11384 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11386 if (L
< INT_MIN
|| U
> INT_MAX
)
11389 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11394 static char *name_buf
= NULL
;
11395 static size_t name_len
= 0;
11396 int prefix_len
= subtype_info
- name
;
11399 const char *bounds_str
;
11402 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11403 strncpy (name_buf
, name
, prefix_len
);
11404 name_buf
[prefix_len
] = '\0';
11407 bounds_str
= strchr (subtype_info
, '_');
11410 if (*subtype_info
== 'L')
11412 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11413 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11415 if (bounds_str
[n
] == '_')
11417 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11423 strcpy (name_buf
+ prefix_len
, "___L");
11424 if (!get_int_var_value (name_buf
, L
))
11426 lim_warning (_("Unknown lower bound, using 1."));
11431 if (*subtype_info
== 'U')
11433 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11434 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11439 strcpy (name_buf
+ prefix_len
, "___U");
11440 if (!get_int_var_value (name_buf
, U
))
11442 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11447 type
= create_static_range_type (alloc_type_copy (raw_type
),
11449 /* create_static_range_type alters the resulting type's length
11450 to match the size of the base_type, which is not what we want.
11451 Set it back to the original range type's length. */
11452 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11453 type
->set_name (name
);
11458 /* True iff NAME is the name of a range type. */
11461 ada_is_range_type_name (const char *name
)
11463 return (name
!= NULL
&& strstr (name
, "___XD"));
11467 /* Modular types */
11469 /* True iff TYPE is an Ada modular type. */
11472 ada_is_modular_type (struct type
*type
)
11474 struct type
*subranged_type
= get_base_type (type
);
11476 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11477 && subranged_type
->code () == TYPE_CODE_INT
11478 && subranged_type
->is_unsigned ());
11481 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11484 ada_modulus (struct type
*type
)
11486 const dynamic_prop
&high
= type
->bounds ()->high
;
11488 if (high
.kind () == PROP_CONST
)
11489 return (ULONGEST
) high
.const_val () + 1;
11491 /* If TYPE is unresolved, the high bound might be a location list. Return
11492 0, for lack of a better value to return. */
11497 /* Ada exception catchpoint support:
11498 ---------------------------------
11500 We support 3 kinds of exception catchpoints:
11501 . catchpoints on Ada exceptions
11502 . catchpoints on unhandled Ada exceptions
11503 . catchpoints on failed assertions
11505 Exceptions raised during failed assertions, or unhandled exceptions
11506 could perfectly be caught with the general catchpoint on Ada exceptions.
11507 However, we can easily differentiate these two special cases, and having
11508 the option to distinguish these two cases from the rest can be useful
11509 to zero-in on certain situations.
11511 Exception catchpoints are a specialized form of breakpoint,
11512 since they rely on inserting breakpoints inside known routines
11513 of the GNAT runtime. The implementation therefore uses a standard
11514 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11517 Support in the runtime for exception catchpoints have been changed
11518 a few times already, and these changes affect the implementation
11519 of these catchpoints. In order to be able to support several
11520 variants of the runtime, we use a sniffer that will determine
11521 the runtime variant used by the program being debugged. */
11523 /* Ada's standard exceptions.
11525 The Ada 83 standard also defined Numeric_Error. But there so many
11526 situations where it was unclear from the Ada 83 Reference Manual
11527 (RM) whether Constraint_Error or Numeric_Error should be raised,
11528 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11529 Interpretation saying that anytime the RM says that Numeric_Error
11530 should be raised, the implementation may raise Constraint_Error.
11531 Ada 95 went one step further and pretty much removed Numeric_Error
11532 from the list of standard exceptions (it made it a renaming of
11533 Constraint_Error, to help preserve compatibility when compiling
11534 an Ada83 compiler). As such, we do not include Numeric_Error from
11535 this list of standard exceptions. */
11537 static const char * const standard_exc
[] = {
11538 "constraint_error",
11544 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11546 /* A structure that describes how to support exception catchpoints
11547 for a given executable. */
11549 struct exception_support_info
11551 /* The name of the symbol to break on in order to insert
11552 a catchpoint on exceptions. */
11553 const char *catch_exception_sym
;
11555 /* The name of the symbol to break on in order to insert
11556 a catchpoint on unhandled exceptions. */
11557 const char *catch_exception_unhandled_sym
;
11559 /* The name of the symbol to break on in order to insert
11560 a catchpoint on failed assertions. */
11561 const char *catch_assert_sym
;
11563 /* The name of the symbol to break on in order to insert
11564 a catchpoint on exception handling. */
11565 const char *catch_handlers_sym
;
11567 /* Assuming that the inferior just triggered an unhandled exception
11568 catchpoint, this function is responsible for returning the address
11569 in inferior memory where the name of that exception is stored.
11570 Return zero if the address could not be computed. */
11571 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11574 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11575 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11577 /* The following exception support info structure describes how to
11578 implement exception catchpoints with the latest version of the
11579 Ada runtime (as of 2019-08-??). */
11581 static const struct exception_support_info default_exception_support_info
=
11583 "__gnat_debug_raise_exception", /* catch_exception_sym */
11584 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11585 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11586 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11587 ada_unhandled_exception_name_addr
11590 /* The following exception support info structure describes how to
11591 implement exception catchpoints with an earlier version of the
11592 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11594 static const struct exception_support_info exception_support_info_v0
=
11596 "__gnat_debug_raise_exception", /* catch_exception_sym */
11597 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11598 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11599 "__gnat_begin_handler", /* catch_handlers_sym */
11600 ada_unhandled_exception_name_addr
11603 /* The following exception support info structure describes how to
11604 implement exception catchpoints with a slightly older version
11605 of the Ada runtime. */
11607 static const struct exception_support_info exception_support_info_fallback
=
11609 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11610 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11611 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11612 "__gnat_begin_handler", /* catch_handlers_sym */
11613 ada_unhandled_exception_name_addr_from_raise
11616 /* Return nonzero if we can detect the exception support routines
11617 described in EINFO.
11619 This function errors out if an abnormal situation is detected
11620 (for instance, if we find the exception support routines, but
11621 that support is found to be incomplete). */
11624 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11626 struct symbol
*sym
;
11628 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11629 that should be compiled with debugging information. As a result, we
11630 expect to find that symbol in the symtabs. */
11632 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11635 /* Perhaps we did not find our symbol because the Ada runtime was
11636 compiled without debugging info, or simply stripped of it.
11637 It happens on some GNU/Linux distributions for instance, where
11638 users have to install a separate debug package in order to get
11639 the runtime's debugging info. In that situation, let the user
11640 know why we cannot insert an Ada exception catchpoint.
11642 Note: Just for the purpose of inserting our Ada exception
11643 catchpoint, we could rely purely on the associated minimal symbol.
11644 But we would be operating in degraded mode anyway, since we are
11645 still lacking the debugging info needed later on to extract
11646 the name of the exception being raised (this name is printed in
11647 the catchpoint message, and is also used when trying to catch
11648 a specific exception). We do not handle this case for now. */
11649 struct bound_minimal_symbol msym
11650 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11652 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11653 error (_("Your Ada runtime appears to be missing some debugging "
11654 "information.\nCannot insert Ada exception catchpoint "
11655 "in this configuration."));
11660 /* Make sure that the symbol we found corresponds to a function. */
11662 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11664 error (_("Symbol \"%s\" is not a function (class = %d)"),
11665 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11669 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11672 struct bound_minimal_symbol msym
11673 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11675 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11676 error (_("Your Ada runtime appears to be missing some debugging "
11677 "information.\nCannot insert Ada exception catchpoint "
11678 "in this configuration."));
11683 /* Make sure that the symbol we found corresponds to a function. */
11685 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11687 error (_("Symbol \"%s\" is not a function (class = %d)"),
11688 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11695 /* Inspect the Ada runtime and determine which exception info structure
11696 should be used to provide support for exception catchpoints.
11698 This function will always set the per-inferior exception_info,
11699 or raise an error. */
11702 ada_exception_support_info_sniffer (void)
11704 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11706 /* If the exception info is already known, then no need to recompute it. */
11707 if (data
->exception_info
!= NULL
)
11710 /* Check the latest (default) exception support info. */
11711 if (ada_has_this_exception_support (&default_exception_support_info
))
11713 data
->exception_info
= &default_exception_support_info
;
11717 /* Try the v0 exception suport info. */
11718 if (ada_has_this_exception_support (&exception_support_info_v0
))
11720 data
->exception_info
= &exception_support_info_v0
;
11724 /* Try our fallback exception suport info. */
11725 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11727 data
->exception_info
= &exception_support_info_fallback
;
11731 /* Sometimes, it is normal for us to not be able to find the routine
11732 we are looking for. This happens when the program is linked with
11733 the shared version of the GNAT runtime, and the program has not been
11734 started yet. Inform the user of these two possible causes if
11737 if (ada_update_initial_language (language_unknown
) != language_ada
)
11738 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11740 /* If the symbol does not exist, then check that the program is
11741 already started, to make sure that shared libraries have been
11742 loaded. If it is not started, this may mean that the symbol is
11743 in a shared library. */
11745 if (inferior_ptid
.pid () == 0)
11746 error (_("Unable to insert catchpoint. Try to start the program first."));
11748 /* At this point, we know that we are debugging an Ada program and
11749 that the inferior has been started, but we still are not able to
11750 find the run-time symbols. That can mean that we are in
11751 configurable run time mode, or that a-except as been optimized
11752 out by the linker... In any case, at this point it is not worth
11753 supporting this feature. */
11755 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11758 /* True iff FRAME is very likely to be that of a function that is
11759 part of the runtime system. This is all very heuristic, but is
11760 intended to be used as advice as to what frames are uninteresting
11764 is_known_support_routine (struct frame_info
*frame
)
11766 enum language func_lang
;
11768 const char *fullname
;
11770 /* If this code does not have any debugging information (no symtab),
11771 This cannot be any user code. */
11773 symtab_and_line sal
= find_frame_sal (frame
);
11774 if (sal
.symtab
== NULL
)
11777 /* If there is a symtab, but the associated source file cannot be
11778 located, then assume this is not user code: Selecting a frame
11779 for which we cannot display the code would not be very helpful
11780 for the user. This should also take care of case such as VxWorks
11781 where the kernel has some debugging info provided for a few units. */
11783 fullname
= symtab_to_fullname (sal
.symtab
);
11784 if (access (fullname
, R_OK
) != 0)
11787 /* Check the unit filename against the Ada runtime file naming.
11788 We also check the name of the objfile against the name of some
11789 known system libraries that sometimes come with debugging info
11792 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11794 re_comp (known_runtime_file_name_patterns
[i
]);
11795 if (re_exec (lbasename (sal
.symtab
->filename
)))
11797 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11798 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11802 /* Check whether the function is a GNAT-generated entity. */
11804 gdb::unique_xmalloc_ptr
<char> func_name
11805 = find_frame_funname (frame
, &func_lang
, NULL
);
11806 if (func_name
== NULL
)
11809 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11811 re_comp (known_auxiliary_function_name_patterns
[i
]);
11812 if (re_exec (func_name
.get ()))
11819 /* Find the first frame that contains debugging information and that is not
11820 part of the Ada run-time, starting from FI and moving upward. */
11823 ada_find_printable_frame (struct frame_info
*fi
)
11825 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11827 if (!is_known_support_routine (fi
))
11836 /* Assuming that the inferior just triggered an unhandled exception
11837 catchpoint, return the address in inferior memory where the name
11838 of the exception is stored.
11840 Return zero if the address could not be computed. */
11843 ada_unhandled_exception_name_addr (void)
11845 return parse_and_eval_address ("e.full_name");
11848 /* Same as ada_unhandled_exception_name_addr, except that this function
11849 should be used when the inferior uses an older version of the runtime,
11850 where the exception name needs to be extracted from a specific frame
11851 several frames up in the callstack. */
11854 ada_unhandled_exception_name_addr_from_raise (void)
11857 struct frame_info
*fi
;
11858 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11860 /* To determine the name of this exception, we need to select
11861 the frame corresponding to RAISE_SYM_NAME. This frame is
11862 at least 3 levels up, so we simply skip the first 3 frames
11863 without checking the name of their associated function. */
11864 fi
= get_current_frame ();
11865 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11867 fi
= get_prev_frame (fi
);
11871 enum language func_lang
;
11873 gdb::unique_xmalloc_ptr
<char> func_name
11874 = find_frame_funname (fi
, &func_lang
, NULL
);
11875 if (func_name
!= NULL
)
11877 if (strcmp (func_name
.get (),
11878 data
->exception_info
->catch_exception_sym
) == 0)
11879 break; /* We found the frame we were looking for... */
11881 fi
= get_prev_frame (fi
);
11888 return parse_and_eval_address ("id.full_name");
11891 /* Assuming the inferior just triggered an Ada exception catchpoint
11892 (of any type), return the address in inferior memory where the name
11893 of the exception is stored, if applicable.
11895 Assumes the selected frame is the current frame.
11897 Return zero if the address could not be computed, or if not relevant. */
11900 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11901 struct breakpoint
*b
)
11903 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11907 case ada_catch_exception
:
11908 return (parse_and_eval_address ("e.full_name"));
11911 case ada_catch_exception_unhandled
:
11912 return data
->exception_info
->unhandled_exception_name_addr ();
11915 case ada_catch_handlers
:
11916 return 0; /* The runtimes does not provide access to the exception
11920 case ada_catch_assert
:
11921 return 0; /* Exception name is not relevant in this case. */
11925 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11929 return 0; /* Should never be reached. */
11932 /* Assuming the inferior is stopped at an exception catchpoint,
11933 return the message which was associated to the exception, if
11934 available. Return NULL if the message could not be retrieved.
11936 Note: The exception message can be associated to an exception
11937 either through the use of the Raise_Exception function, or
11938 more simply (Ada 2005 and later), via:
11940 raise Exception_Name with "exception message";
11944 static gdb::unique_xmalloc_ptr
<char>
11945 ada_exception_message_1 (void)
11947 struct value
*e_msg_val
;
11950 /* For runtimes that support this feature, the exception message
11951 is passed as an unbounded string argument called "message". */
11952 e_msg_val
= parse_and_eval ("message");
11953 if (e_msg_val
== NULL
)
11954 return NULL
; /* Exception message not supported. */
11956 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
11957 gdb_assert (e_msg_val
!= NULL
);
11958 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
11960 /* If the message string is empty, then treat it as if there was
11961 no exception message. */
11962 if (e_msg_len
<= 0)
11965 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
11966 read_memory (value_address (e_msg_val
), (gdb_byte
*) e_msg
.get (),
11968 e_msg
.get ()[e_msg_len
] = '\0';
11973 /* Same as ada_exception_message_1, except that all exceptions are
11974 contained here (returning NULL instead). */
11976 static gdb::unique_xmalloc_ptr
<char>
11977 ada_exception_message (void)
11979 gdb::unique_xmalloc_ptr
<char> e_msg
;
11983 e_msg
= ada_exception_message_1 ();
11985 catch (const gdb_exception_error
&e
)
11987 e_msg
.reset (nullptr);
11993 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11994 any error that ada_exception_name_addr_1 might cause to be thrown.
11995 When an error is intercepted, a warning with the error message is printed,
11996 and zero is returned. */
11999 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12000 struct breakpoint
*b
)
12002 CORE_ADDR result
= 0;
12006 result
= ada_exception_name_addr_1 (ex
, b
);
12009 catch (const gdb_exception_error
&e
)
12011 warning (_("failed to get exception name: %s"), e
.what ());
12018 static std::string ada_exception_catchpoint_cond_string
12019 (const char *excep_string
,
12020 enum ada_exception_catchpoint_kind ex
);
12022 /* Ada catchpoints.
12024 In the case of catchpoints on Ada exceptions, the catchpoint will
12025 stop the target on every exception the program throws. When a user
12026 specifies the name of a specific exception, we translate this
12027 request into a condition expression (in text form), and then parse
12028 it into an expression stored in each of the catchpoint's locations.
12029 We then use this condition to check whether the exception that was
12030 raised is the one the user is interested in. If not, then the
12031 target is resumed again. We store the name of the requested
12032 exception, in order to be able to re-set the condition expression
12033 when symbols change. */
12035 /* An instance of this type is used to represent an Ada catchpoint
12036 breakpoint location. */
12038 class ada_catchpoint_location
: public bp_location
12041 ada_catchpoint_location (breakpoint
*owner
)
12042 : bp_location (owner
, bp_loc_software_breakpoint
)
12045 /* The condition that checks whether the exception that was raised
12046 is the specific exception the user specified on catchpoint
12048 expression_up excep_cond_expr
;
12051 /* An instance of this type is used to represent an Ada catchpoint. */
12053 struct ada_catchpoint
: public breakpoint
12055 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12060 /* The name of the specific exception the user specified. */
12061 std::string excep_string
;
12063 /* What kind of catchpoint this is. */
12064 enum ada_exception_catchpoint_kind m_kind
;
12067 /* Parse the exception condition string in the context of each of the
12068 catchpoint's locations, and store them for later evaluation. */
12071 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12072 enum ada_exception_catchpoint_kind ex
)
12074 struct bp_location
*bl
;
12076 /* Nothing to do if there's no specific exception to catch. */
12077 if (c
->excep_string
.empty ())
12080 /* Same if there are no locations... */
12081 if (c
->loc
== NULL
)
12084 /* Compute the condition expression in text form, from the specific
12085 expection we want to catch. */
12086 std::string cond_string
12087 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12089 /* Iterate over all the catchpoint's locations, and parse an
12090 expression for each. */
12091 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12093 struct ada_catchpoint_location
*ada_loc
12094 = (struct ada_catchpoint_location
*) bl
;
12097 if (!bl
->shlib_disabled
)
12101 s
= cond_string
.c_str ();
12104 exp
= parse_exp_1 (&s
, bl
->address
,
12105 block_for_pc (bl
->address
),
12108 catch (const gdb_exception_error
&e
)
12110 warning (_("failed to reevaluate internal exception condition "
12111 "for catchpoint %d: %s"),
12112 c
->number
, e
.what ());
12116 ada_loc
->excep_cond_expr
= std::move (exp
);
12120 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12121 structure for all exception catchpoint kinds. */
12123 static struct bp_location
*
12124 allocate_location_exception (struct breakpoint
*self
)
12126 return new ada_catchpoint_location (self
);
12129 /* Implement the RE_SET method in the breakpoint_ops structure for all
12130 exception catchpoint kinds. */
12133 re_set_exception (struct breakpoint
*b
)
12135 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12137 /* Call the base class's method. This updates the catchpoint's
12139 bkpt_breakpoint_ops
.re_set (b
);
12141 /* Reparse the exception conditional expressions. One for each
12143 create_excep_cond_exprs (c
, c
->m_kind
);
12146 /* Returns true if we should stop for this breakpoint hit. If the
12147 user specified a specific exception, we only want to cause a stop
12148 if the program thrown that exception. */
12151 should_stop_exception (const struct bp_location
*bl
)
12153 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12154 const struct ada_catchpoint_location
*ada_loc
12155 = (const struct ada_catchpoint_location
*) bl
;
12158 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12159 if (c
->m_kind
== ada_catch_assert
)
12160 clear_internalvar (var
);
12167 if (c
->m_kind
== ada_catch_handlers
)
12168 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12169 ".all.occurrence.id");
12173 struct value
*exc
= parse_and_eval (expr
);
12174 set_internalvar (var
, exc
);
12176 catch (const gdb_exception_error
&ex
)
12178 clear_internalvar (var
);
12182 /* With no specific exception, should always stop. */
12183 if (c
->excep_string
.empty ())
12186 if (ada_loc
->excep_cond_expr
== NULL
)
12188 /* We will have a NULL expression if back when we were creating
12189 the expressions, this location's had failed to parse. */
12196 struct value
*mark
;
12198 mark
= value_mark ();
12199 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12200 value_free_to_mark (mark
);
12202 catch (const gdb_exception
&ex
)
12204 exception_fprintf (gdb_stderr
, ex
,
12205 _("Error in testing exception condition:\n"));
12211 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12212 for all exception catchpoint kinds. */
12215 check_status_exception (bpstat bs
)
12217 bs
->stop
= should_stop_exception (bs
->bp_location_at
.get ());
12220 /* Implement the PRINT_IT method in the breakpoint_ops structure
12221 for all exception catchpoint kinds. */
12223 static enum print_stop_action
12224 print_it_exception (bpstat bs
)
12226 struct ui_out
*uiout
= current_uiout
;
12227 struct breakpoint
*b
= bs
->breakpoint_at
;
12229 annotate_catchpoint (b
->number
);
12231 if (uiout
->is_mi_like_p ())
12233 uiout
->field_string ("reason",
12234 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12235 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12238 uiout
->text (b
->disposition
== disp_del
12239 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12240 uiout
->field_signed ("bkptno", b
->number
);
12241 uiout
->text (", ");
12243 /* ada_exception_name_addr relies on the selected frame being the
12244 current frame. Need to do this here because this function may be
12245 called more than once when printing a stop, and below, we'll
12246 select the first frame past the Ada run-time (see
12247 ada_find_printable_frame). */
12248 select_frame (get_current_frame ());
12250 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12253 case ada_catch_exception
:
12254 case ada_catch_exception_unhandled
:
12255 case ada_catch_handlers
:
12257 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12258 char exception_name
[256];
12262 read_memory (addr
, (gdb_byte
*) exception_name
,
12263 sizeof (exception_name
) - 1);
12264 exception_name
[sizeof (exception_name
) - 1] = '\0';
12268 /* For some reason, we were unable to read the exception
12269 name. This could happen if the Runtime was compiled
12270 without debugging info, for instance. In that case,
12271 just replace the exception name by the generic string
12272 "exception" - it will read as "an exception" in the
12273 notification we are about to print. */
12274 memcpy (exception_name
, "exception", sizeof ("exception"));
12276 /* In the case of unhandled exception breakpoints, we print
12277 the exception name as "unhandled EXCEPTION_NAME", to make
12278 it clearer to the user which kind of catchpoint just got
12279 hit. We used ui_out_text to make sure that this extra
12280 info does not pollute the exception name in the MI case. */
12281 if (c
->m_kind
== ada_catch_exception_unhandled
)
12282 uiout
->text ("unhandled ");
12283 uiout
->field_string ("exception-name", exception_name
);
12286 case ada_catch_assert
:
12287 /* In this case, the name of the exception is not really
12288 important. Just print "failed assertion" to make it clearer
12289 that his program just hit an assertion-failure catchpoint.
12290 We used ui_out_text because this info does not belong in
12292 uiout
->text ("failed assertion");
12296 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12297 if (exception_message
!= NULL
)
12299 uiout
->text (" (");
12300 uiout
->field_string ("exception-message", exception_message
.get ());
12304 uiout
->text (" at ");
12305 ada_find_printable_frame (get_current_frame ());
12307 return PRINT_SRC_AND_LOC
;
12310 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12311 for all exception catchpoint kinds. */
12314 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12316 struct ui_out
*uiout
= current_uiout
;
12317 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12318 struct value_print_options opts
;
12320 get_user_print_options (&opts
);
12322 if (opts
.addressprint
)
12323 uiout
->field_skip ("addr");
12325 annotate_field (5);
12328 case ada_catch_exception
:
12329 if (!c
->excep_string
.empty ())
12331 std::string msg
= string_printf (_("`%s' Ada exception"),
12332 c
->excep_string
.c_str ());
12334 uiout
->field_string ("what", msg
);
12337 uiout
->field_string ("what", "all Ada exceptions");
12341 case ada_catch_exception_unhandled
:
12342 uiout
->field_string ("what", "unhandled Ada exceptions");
12345 case ada_catch_handlers
:
12346 if (!c
->excep_string
.empty ())
12348 uiout
->field_fmt ("what",
12349 _("`%s' Ada exception handlers"),
12350 c
->excep_string
.c_str ());
12353 uiout
->field_string ("what", "all Ada exceptions handlers");
12356 case ada_catch_assert
:
12357 uiout
->field_string ("what", "failed Ada assertions");
12361 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12366 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12367 for all exception catchpoint kinds. */
12370 print_mention_exception (struct breakpoint
*b
)
12372 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12373 struct ui_out
*uiout
= current_uiout
;
12375 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12376 : _("Catchpoint "));
12377 uiout
->field_signed ("bkptno", b
->number
);
12378 uiout
->text (": ");
12382 case ada_catch_exception
:
12383 if (!c
->excep_string
.empty ())
12385 std::string info
= string_printf (_("`%s' Ada exception"),
12386 c
->excep_string
.c_str ());
12387 uiout
->text (info
.c_str ());
12390 uiout
->text (_("all Ada exceptions"));
12393 case ada_catch_exception_unhandled
:
12394 uiout
->text (_("unhandled Ada exceptions"));
12397 case ada_catch_handlers
:
12398 if (!c
->excep_string
.empty ())
12401 = string_printf (_("`%s' Ada exception handlers"),
12402 c
->excep_string
.c_str ());
12403 uiout
->text (info
.c_str ());
12406 uiout
->text (_("all Ada exceptions handlers"));
12409 case ada_catch_assert
:
12410 uiout
->text (_("failed Ada assertions"));
12414 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12419 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12420 for all exception catchpoint kinds. */
12423 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12425 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12429 case ada_catch_exception
:
12430 fprintf_filtered (fp
, "catch exception");
12431 if (!c
->excep_string
.empty ())
12432 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12435 case ada_catch_exception_unhandled
:
12436 fprintf_filtered (fp
, "catch exception unhandled");
12439 case ada_catch_handlers
:
12440 fprintf_filtered (fp
, "catch handlers");
12443 case ada_catch_assert
:
12444 fprintf_filtered (fp
, "catch assert");
12448 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12450 print_recreate_thread (b
, fp
);
12453 /* Virtual tables for various breakpoint types. */
12454 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12455 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12456 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12457 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12459 /* See ada-lang.h. */
12462 is_ada_exception_catchpoint (breakpoint
*bp
)
12464 return (bp
->ops
== &catch_exception_breakpoint_ops
12465 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12466 || bp
->ops
== &catch_assert_breakpoint_ops
12467 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12470 /* Split the arguments specified in a "catch exception" command.
12471 Set EX to the appropriate catchpoint type.
12472 Set EXCEP_STRING to the name of the specific exception if
12473 specified by the user.
12474 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12475 "catch handlers" command. False otherwise.
12476 If a condition is found at the end of the arguments, the condition
12477 expression is stored in COND_STRING (memory must be deallocated
12478 after use). Otherwise COND_STRING is set to NULL. */
12481 catch_ada_exception_command_split (const char *args
,
12482 bool is_catch_handlers_cmd
,
12483 enum ada_exception_catchpoint_kind
*ex
,
12484 std::string
*excep_string
,
12485 std::string
*cond_string
)
12487 std::string exception_name
;
12489 exception_name
= extract_arg (&args
);
12490 if (exception_name
== "if")
12492 /* This is not an exception name; this is the start of a condition
12493 expression for a catchpoint on all exceptions. So, "un-get"
12494 this token, and set exception_name to NULL. */
12495 exception_name
.clear ();
12499 /* Check to see if we have a condition. */
12501 args
= skip_spaces (args
);
12502 if (startswith (args
, "if")
12503 && (isspace (args
[2]) || args
[2] == '\0'))
12506 args
= skip_spaces (args
);
12508 if (args
[0] == '\0')
12509 error (_("Condition missing after `if' keyword"));
12510 *cond_string
= args
;
12512 args
+= strlen (args
);
12515 /* Check that we do not have any more arguments. Anything else
12518 if (args
[0] != '\0')
12519 error (_("Junk at end of expression"));
12521 if (is_catch_handlers_cmd
)
12523 /* Catch handling of exceptions. */
12524 *ex
= ada_catch_handlers
;
12525 *excep_string
= exception_name
;
12527 else if (exception_name
.empty ())
12529 /* Catch all exceptions. */
12530 *ex
= ada_catch_exception
;
12531 excep_string
->clear ();
12533 else if (exception_name
== "unhandled")
12535 /* Catch unhandled exceptions. */
12536 *ex
= ada_catch_exception_unhandled
;
12537 excep_string
->clear ();
12541 /* Catch a specific exception. */
12542 *ex
= ada_catch_exception
;
12543 *excep_string
= exception_name
;
12547 /* Return the name of the symbol on which we should break in order to
12548 implement a catchpoint of the EX kind. */
12550 static const char *
12551 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12553 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12555 gdb_assert (data
->exception_info
!= NULL
);
12559 case ada_catch_exception
:
12560 return (data
->exception_info
->catch_exception_sym
);
12562 case ada_catch_exception_unhandled
:
12563 return (data
->exception_info
->catch_exception_unhandled_sym
);
12565 case ada_catch_assert
:
12566 return (data
->exception_info
->catch_assert_sym
);
12568 case ada_catch_handlers
:
12569 return (data
->exception_info
->catch_handlers_sym
);
12572 internal_error (__FILE__
, __LINE__
,
12573 _("unexpected catchpoint kind (%d)"), ex
);
12577 /* Return the breakpoint ops "virtual table" used for catchpoints
12580 static const struct breakpoint_ops
*
12581 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12585 case ada_catch_exception
:
12586 return (&catch_exception_breakpoint_ops
);
12588 case ada_catch_exception_unhandled
:
12589 return (&catch_exception_unhandled_breakpoint_ops
);
12591 case ada_catch_assert
:
12592 return (&catch_assert_breakpoint_ops
);
12594 case ada_catch_handlers
:
12595 return (&catch_handlers_breakpoint_ops
);
12598 internal_error (__FILE__
, __LINE__
,
12599 _("unexpected catchpoint kind (%d)"), ex
);
12603 /* Return the condition that will be used to match the current exception
12604 being raised with the exception that the user wants to catch. This
12605 assumes that this condition is used when the inferior just triggered
12606 an exception catchpoint.
12607 EX: the type of catchpoints used for catching Ada exceptions. */
12610 ada_exception_catchpoint_cond_string (const char *excep_string
,
12611 enum ada_exception_catchpoint_kind ex
)
12614 bool is_standard_exc
= false;
12615 std::string result
;
12617 if (ex
== ada_catch_handlers
)
12619 /* For exception handlers catchpoints, the condition string does
12620 not use the same parameter as for the other exceptions. */
12621 result
= ("long_integer (GNAT_GCC_exception_Access"
12622 "(gcc_exception).all.occurrence.id)");
12625 result
= "long_integer (e)";
12627 /* The standard exceptions are a special case. They are defined in
12628 runtime units that have been compiled without debugging info; if
12629 EXCEP_STRING is the not-fully-qualified name of a standard
12630 exception (e.g. "constraint_error") then, during the evaluation
12631 of the condition expression, the symbol lookup on this name would
12632 *not* return this standard exception. The catchpoint condition
12633 may then be set only on user-defined exceptions which have the
12634 same not-fully-qualified name (e.g. my_package.constraint_error).
12636 To avoid this unexcepted behavior, these standard exceptions are
12637 systematically prefixed by "standard". This means that "catch
12638 exception constraint_error" is rewritten into "catch exception
12639 standard.constraint_error".
12641 If an exception named constraint_error is defined in another package of
12642 the inferior program, then the only way to specify this exception as a
12643 breakpoint condition is to use its fully-qualified named:
12644 e.g. my_package.constraint_error. */
12646 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12648 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12650 is_standard_exc
= true;
12657 if (is_standard_exc
)
12658 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12660 string_appendf (result
, "long_integer (&%s)", excep_string
);
12665 /* Return the symtab_and_line that should be used to insert an exception
12666 catchpoint of the TYPE kind.
12668 ADDR_STRING returns the name of the function where the real
12669 breakpoint that implements the catchpoints is set, depending on the
12670 type of catchpoint we need to create. */
12672 static struct symtab_and_line
12673 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12674 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12676 const char *sym_name
;
12677 struct symbol
*sym
;
12679 /* First, find out which exception support info to use. */
12680 ada_exception_support_info_sniffer ();
12682 /* Then lookup the function on which we will break in order to catch
12683 the Ada exceptions requested by the user. */
12684 sym_name
= ada_exception_sym_name (ex
);
12685 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12688 error (_("Catchpoint symbol not found: %s"), sym_name
);
12690 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12691 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12693 /* Set ADDR_STRING. */
12694 *addr_string
= sym_name
;
12697 *ops
= ada_exception_breakpoint_ops (ex
);
12699 return find_function_start_sal (sym
, 1);
12702 /* Create an Ada exception catchpoint.
12704 EX_KIND is the kind of exception catchpoint to be created.
12706 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12707 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12708 of the exception to which this catchpoint applies.
12710 COND_STRING, if not empty, is the catchpoint condition.
12712 TEMPFLAG, if nonzero, means that the underlying breakpoint
12713 should be temporary.
12715 FROM_TTY is the usual argument passed to all commands implementations. */
12718 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12719 enum ada_exception_catchpoint_kind ex_kind
,
12720 const std::string
&excep_string
,
12721 const std::string
&cond_string
,
12726 std::string addr_string
;
12727 const struct breakpoint_ops
*ops
= NULL
;
12728 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12730 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12731 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12732 ops
, tempflag
, disabled
, from_tty
);
12733 c
->excep_string
= excep_string
;
12734 create_excep_cond_exprs (c
.get (), ex_kind
);
12735 if (!cond_string
.empty ())
12736 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
, false);
12737 install_breakpoint (0, std::move (c
), 1);
12740 /* Implement the "catch exception" command. */
12743 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12744 struct cmd_list_element
*command
)
12746 const char *arg
= arg_entry
;
12747 struct gdbarch
*gdbarch
= get_current_arch ();
12749 enum ada_exception_catchpoint_kind ex_kind
;
12750 std::string excep_string
;
12751 std::string cond_string
;
12753 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12757 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12759 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12760 excep_string
, cond_string
,
12761 tempflag
, 1 /* enabled */,
12765 /* Implement the "catch handlers" command. */
12768 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12769 struct cmd_list_element
*command
)
12771 const char *arg
= arg_entry
;
12772 struct gdbarch
*gdbarch
= get_current_arch ();
12774 enum ada_exception_catchpoint_kind ex_kind
;
12775 std::string excep_string
;
12776 std::string cond_string
;
12778 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12782 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
12784 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12785 excep_string
, cond_string
,
12786 tempflag
, 1 /* enabled */,
12790 /* Completion function for the Ada "catch" commands. */
12793 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
12794 const char *text
, const char *word
)
12796 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
12798 for (const ada_exc_info
&info
: exceptions
)
12800 if (startswith (info
.name
, word
))
12801 tracker
.add_completion (make_unique_xstrdup (info
.name
));
12805 /* Split the arguments specified in a "catch assert" command.
12807 ARGS contains the command's arguments (or the empty string if
12808 no arguments were passed).
12810 If ARGS contains a condition, set COND_STRING to that condition
12811 (the memory needs to be deallocated after use). */
12814 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
12816 args
= skip_spaces (args
);
12818 /* Check whether a condition was provided. */
12819 if (startswith (args
, "if")
12820 && (isspace (args
[2]) || args
[2] == '\0'))
12823 args
= skip_spaces (args
);
12824 if (args
[0] == '\0')
12825 error (_("condition missing after `if' keyword"));
12826 cond_string
.assign (args
);
12829 /* Otherwise, there should be no other argument at the end of
12831 else if (args
[0] != '\0')
12832 error (_("Junk at end of arguments."));
12835 /* Implement the "catch assert" command. */
12838 catch_assert_command (const char *arg_entry
, int from_tty
,
12839 struct cmd_list_element
*command
)
12841 const char *arg
= arg_entry
;
12842 struct gdbarch
*gdbarch
= get_current_arch ();
12844 std::string cond_string
;
12846 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12850 catch_ada_assert_command_split (arg
, cond_string
);
12851 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12853 tempflag
, 1 /* enabled */,
12857 /* Return non-zero if the symbol SYM is an Ada exception object. */
12860 ada_is_exception_sym (struct symbol
*sym
)
12862 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
12864 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12865 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12866 && SYMBOL_CLASS (sym
) != LOC_CONST
12867 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12868 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12871 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12872 Ada exception object. This matches all exceptions except the ones
12873 defined by the Ada language. */
12876 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12880 if (!ada_is_exception_sym (sym
))
12883 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12884 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
12885 return 0; /* A standard exception. */
12887 /* Numeric_Error is also a standard exception, so exclude it.
12888 See the STANDARD_EXC description for more details as to why
12889 this exception is not listed in that array. */
12890 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
12896 /* A helper function for std::sort, comparing two struct ada_exc_info
12899 The comparison is determined first by exception name, and then
12900 by exception address. */
12903 ada_exc_info::operator< (const ada_exc_info
&other
) const
12907 result
= strcmp (name
, other
.name
);
12910 if (result
== 0 && addr
< other
.addr
)
12916 ada_exc_info::operator== (const ada_exc_info
&other
) const
12918 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
12921 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12922 routine, but keeping the first SKIP elements untouched.
12924 All duplicates are also removed. */
12927 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
12930 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
12931 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
12932 exceptions
->end ());
12935 /* Add all exceptions defined by the Ada standard whose name match
12936 a regular expression.
12938 If PREG is not NULL, then this regexp_t object is used to
12939 perform the symbol name matching. Otherwise, no name-based
12940 filtering is performed.
12942 EXCEPTIONS is a vector of exceptions to which matching exceptions
12946 ada_add_standard_exceptions (compiled_regex
*preg
,
12947 std::vector
<ada_exc_info
> *exceptions
)
12951 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12954 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
12956 struct bound_minimal_symbol msymbol
12957 = ada_lookup_simple_minsym (standard_exc
[i
]);
12959 if (msymbol
.minsym
!= NULL
)
12961 struct ada_exc_info info
12962 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12964 exceptions
->push_back (info
);
12970 /* Add all Ada exceptions defined locally and accessible from the given
12973 If PREG is not NULL, then this regexp_t object is used to
12974 perform the symbol name matching. Otherwise, no name-based
12975 filtering is performed.
12977 EXCEPTIONS is a vector of exceptions to which matching exceptions
12981 ada_add_exceptions_from_frame (compiled_regex
*preg
,
12982 struct frame_info
*frame
,
12983 std::vector
<ada_exc_info
> *exceptions
)
12985 const struct block
*block
= get_frame_block (frame
, 0);
12989 struct block_iterator iter
;
12990 struct symbol
*sym
;
12992 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12994 switch (SYMBOL_CLASS (sym
))
13001 if (ada_is_exception_sym (sym
))
13003 struct ada_exc_info info
= {sym
->print_name (),
13004 SYMBOL_VALUE_ADDRESS (sym
)};
13006 exceptions
->push_back (info
);
13010 if (BLOCK_FUNCTION (block
) != NULL
)
13012 block
= BLOCK_SUPERBLOCK (block
);
13016 /* Return true if NAME matches PREG or if PREG is NULL. */
13019 name_matches_regex (const char *name
, compiled_regex
*preg
)
13021 return (preg
== NULL
13022 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13025 /* Add all exceptions defined globally whose name name match
13026 a regular expression, excluding standard exceptions.
13028 The reason we exclude standard exceptions is that they need
13029 to be handled separately: Standard exceptions are defined inside
13030 a runtime unit which is normally not compiled with debugging info,
13031 and thus usually do not show up in our symbol search. However,
13032 if the unit was in fact built with debugging info, we need to
13033 exclude them because they would duplicate the entry we found
13034 during the special loop that specifically searches for those
13035 standard exceptions.
13037 If PREG is not NULL, then this regexp_t object is used to
13038 perform the symbol name matching. Otherwise, no name-based
13039 filtering is performed.
13041 EXCEPTIONS is a vector of exceptions to which matching exceptions
13045 ada_add_global_exceptions (compiled_regex
*preg
,
13046 std::vector
<ada_exc_info
> *exceptions
)
13048 /* In Ada, the symbol "search name" is a linkage name, whereas the
13049 regular expression used to do the matching refers to the natural
13050 name. So match against the decoded name. */
13051 expand_symtabs_matching (NULL
,
13052 lookup_name_info::match_any (),
13053 [&] (const char *search_name
)
13055 std::string decoded
= ada_decode (search_name
);
13056 return name_matches_regex (decoded
.c_str (), preg
);
13061 for (objfile
*objfile
: current_program_space
->objfiles ())
13063 for (compunit_symtab
*s
: objfile
->compunits ())
13065 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13068 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13070 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13071 struct block_iterator iter
;
13072 struct symbol
*sym
;
13074 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13075 if (ada_is_non_standard_exception_sym (sym
)
13076 && name_matches_regex (sym
->natural_name (), preg
))
13078 struct ada_exc_info info
13079 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13081 exceptions
->push_back (info
);
13088 /* Implements ada_exceptions_list with the regular expression passed
13089 as a regex_t, rather than a string.
13091 If not NULL, PREG is used to filter out exceptions whose names
13092 do not match. Otherwise, all exceptions are listed. */
13094 static std::vector
<ada_exc_info
>
13095 ada_exceptions_list_1 (compiled_regex
*preg
)
13097 std::vector
<ada_exc_info
> result
;
13100 /* First, list the known standard exceptions. These exceptions
13101 need to be handled separately, as they are usually defined in
13102 runtime units that have been compiled without debugging info. */
13104 ada_add_standard_exceptions (preg
, &result
);
13106 /* Next, find all exceptions whose scope is local and accessible
13107 from the currently selected frame. */
13109 if (has_stack_frames ())
13111 prev_len
= result
.size ();
13112 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13114 if (result
.size () > prev_len
)
13115 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13118 /* Add all exceptions whose scope is global. */
13120 prev_len
= result
.size ();
13121 ada_add_global_exceptions (preg
, &result
);
13122 if (result
.size () > prev_len
)
13123 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13128 /* Return a vector of ada_exc_info.
13130 If REGEXP is NULL, all exceptions are included in the result.
13131 Otherwise, it should contain a valid regular expression,
13132 and only the exceptions whose names match that regular expression
13133 are included in the result.
13135 The exceptions are sorted in the following order:
13136 - Standard exceptions (defined by the Ada language), in
13137 alphabetical order;
13138 - Exceptions only visible from the current frame, in
13139 alphabetical order;
13140 - Exceptions whose scope is global, in alphabetical order. */
13142 std::vector
<ada_exc_info
>
13143 ada_exceptions_list (const char *regexp
)
13145 if (regexp
== NULL
)
13146 return ada_exceptions_list_1 (NULL
);
13148 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13149 return ada_exceptions_list_1 (®
);
13152 /* Implement the "info exceptions" command. */
13155 info_exceptions_command (const char *regexp
, int from_tty
)
13157 struct gdbarch
*gdbarch
= get_current_arch ();
13159 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13161 if (regexp
!= NULL
)
13163 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13165 printf_filtered (_("All defined Ada exceptions:\n"));
13167 for (const ada_exc_info
&info
: exceptions
)
13168 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13172 /* Information about operators given special treatment in functions
13174 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13176 #define ADA_OPERATORS \
13177 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13178 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13179 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13180 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13181 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13182 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13183 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13184 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13185 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13186 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13187 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13188 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13189 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13190 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13191 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13192 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13193 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13194 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13195 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13198 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13201 switch (exp
->elts
[pc
- 1].opcode
)
13204 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13207 #define OP_DEFN(op, len, args, binop) \
13208 case op: *oplenp = len; *argsp = args; break;
13214 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13219 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13224 /* Implementation of the exp_descriptor method operator_check. */
13227 ada_operator_check (struct expression
*exp
, int pos
,
13228 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13231 const union exp_element
*const elts
= exp
->elts
;
13232 struct type
*type
= NULL
;
13234 switch (elts
[pos
].opcode
)
13236 case UNOP_IN_RANGE
:
13238 type
= elts
[pos
+ 1].type
;
13242 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13245 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13247 if (type
!= nullptr && type
->objfile_owner () != nullptr
13248 && objfile_func (type
->objfile_owner (), data
))
13254 /* As for operator_length, but assumes PC is pointing at the first
13255 element of the operator, and gives meaningful results only for the
13256 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13259 ada_forward_operator_length (struct expression
*exp
, int pc
,
13260 int *oplenp
, int *argsp
)
13262 switch (exp
->elts
[pc
].opcode
)
13265 *oplenp
= *argsp
= 0;
13268 #define OP_DEFN(op, len, args, binop) \
13269 case op: *oplenp = len; *argsp = args; break;
13275 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13280 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13286 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13288 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13296 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13298 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13303 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13307 /* Ada attributes ('Foo). */
13310 case OP_ATR_LENGTH
:
13314 case OP_ATR_MODULUS
:
13321 case UNOP_IN_RANGE
:
13323 /* XXX: gdb_sprint_host_address, type_sprint */
13324 fprintf_filtered (stream
, _("Type @"));
13325 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13326 fprintf_filtered (stream
, " (");
13327 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13328 fprintf_filtered (stream
, ")");
13330 case BINOP_IN_BOUNDS
:
13331 fprintf_filtered (stream
, " (%d)",
13332 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13334 case TERNOP_IN_RANGE
:
13339 case OP_DISCRETE_RANGE
:
13340 case OP_POSITIONAL
:
13347 char *name
= &exp
->elts
[elt
+ 2].string
;
13348 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13350 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13355 return dump_subexp_body_standard (exp
, stream
, elt
);
13359 for (i
= 0; i
< nargs
; i
+= 1)
13360 elt
= dump_subexp (exp
, stream
, elt
);
13365 /* The Ada extension of print_subexp (q.v.). */
13368 ada_print_subexp (struct expression
*exp
, int *pos
,
13369 struct ui_file
*stream
, enum precedence prec
)
13371 int oplen
, nargs
, i
;
13373 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13375 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13382 print_subexp_standard (exp
, pos
, stream
, prec
);
13386 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13389 case BINOP_IN_BOUNDS
:
13390 /* XXX: sprint_subexp */
13391 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13392 fputs_filtered (" in ", stream
);
13393 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13394 fputs_filtered ("'range", stream
);
13395 if (exp
->elts
[pc
+ 1].longconst
> 1)
13396 fprintf_filtered (stream
, "(%ld)",
13397 (long) exp
->elts
[pc
+ 1].longconst
);
13400 case TERNOP_IN_RANGE
:
13401 if (prec
>= PREC_EQUAL
)
13402 fputs_filtered ("(", stream
);
13403 /* XXX: sprint_subexp */
13404 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13405 fputs_filtered (" in ", stream
);
13406 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13407 fputs_filtered (" .. ", stream
);
13408 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13409 if (prec
>= PREC_EQUAL
)
13410 fputs_filtered (")", stream
);
13415 case OP_ATR_LENGTH
:
13419 case OP_ATR_MODULUS
:
13424 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13426 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13427 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13428 &type_print_raw_options
);
13432 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13433 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13438 for (tem
= 1; tem
< nargs
; tem
+= 1)
13440 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13441 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13443 fputs_filtered (")", stream
);
13448 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13449 fputs_filtered ("'(", stream
);
13450 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13451 fputs_filtered (")", stream
);
13454 case UNOP_IN_RANGE
:
13455 /* XXX: sprint_subexp */
13456 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13457 fputs_filtered (" in ", stream
);
13458 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13459 &type_print_raw_options
);
13462 case OP_DISCRETE_RANGE
:
13463 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13464 fputs_filtered ("..", stream
);
13465 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13469 fputs_filtered ("others => ", stream
);
13470 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13474 for (i
= 0; i
< nargs
-1; i
+= 1)
13477 fputs_filtered ("|", stream
);
13478 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13480 fputs_filtered (" => ", stream
);
13481 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13484 case OP_POSITIONAL
:
13485 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13489 fputs_filtered ("(", stream
);
13490 for (i
= 0; i
< nargs
; i
+= 1)
13493 fputs_filtered (", ", stream
);
13494 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13496 fputs_filtered (")", stream
);
13501 /* Table mapping opcodes into strings for printing operators
13502 and precedences of the operators. */
13504 static const struct op_print ada_op_print_tab
[] = {
13505 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13506 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13507 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13508 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13509 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13510 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13511 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13512 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13513 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13514 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13515 {">", BINOP_GTR
, PREC_ORDER
, 0},
13516 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13517 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13518 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13519 {"+", BINOP_ADD
, PREC_ADD
, 0},
13520 {"-", BINOP_SUB
, PREC_ADD
, 0},
13521 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13522 {"*", BINOP_MUL
, PREC_MUL
, 0},
13523 {"/", BINOP_DIV
, PREC_MUL
, 0},
13524 {"rem", BINOP_REM
, PREC_MUL
, 0},
13525 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13526 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13527 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13528 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13529 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13530 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13531 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13532 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13533 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13534 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13535 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13536 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13539 /* Language vector */
13541 static const struct exp_descriptor ada_exp_descriptor
= {
13543 ada_operator_length
,
13544 ada_operator_check
,
13545 ada_dump_subexp_body
,
13546 ada_evaluate_subexp
13549 /* symbol_name_matcher_ftype adapter for wild_match. */
13552 do_wild_match (const char *symbol_search_name
,
13553 const lookup_name_info
&lookup_name
,
13554 completion_match_result
*comp_match_res
)
13556 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13559 /* symbol_name_matcher_ftype adapter for full_match. */
13562 do_full_match (const char *symbol_search_name
,
13563 const lookup_name_info
&lookup_name
,
13564 completion_match_result
*comp_match_res
)
13566 const char *lname
= lookup_name
.ada ().lookup_name ().c_str ();
13568 /* If both symbols start with "_ada_", just let the loop below
13569 handle the comparison. However, if only the symbol name starts
13570 with "_ada_", skip the prefix and let the match proceed as
13572 if (startswith (symbol_search_name
, "_ada_")
13573 && !startswith (lname
, "_ada"))
13574 symbol_search_name
+= 5;
13576 int uscore_count
= 0;
13577 while (*lname
!= '\0')
13579 if (*symbol_search_name
!= *lname
)
13581 if (*symbol_search_name
== 'B' && uscore_count
== 2
13582 && symbol_search_name
[1] == '_')
13584 symbol_search_name
+= 2;
13585 while (isdigit (*symbol_search_name
))
13586 ++symbol_search_name
;
13587 if (symbol_search_name
[0] == '_'
13588 && symbol_search_name
[1] == '_')
13590 symbol_search_name
+= 2;
13597 if (*symbol_search_name
== '_')
13602 ++symbol_search_name
;
13606 return is_name_suffix (symbol_search_name
);
13609 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13612 do_exact_match (const char *symbol_search_name
,
13613 const lookup_name_info
&lookup_name
,
13614 completion_match_result
*comp_match_res
)
13616 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13619 /* Build the Ada lookup name for LOOKUP_NAME. */
13621 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13623 gdb::string_view user_name
= lookup_name
.name ();
13625 if (!user_name
.empty () && user_name
[0] == '<')
13627 if (user_name
.back () == '>')
13629 = gdb::to_string (user_name
.substr (1, user_name
.size () - 2));
13632 = gdb::to_string (user_name
.substr (1, user_name
.size () - 1));
13633 m_encoded_p
= true;
13634 m_verbatim_p
= true;
13635 m_wild_match_p
= false;
13636 m_standard_p
= false;
13640 m_verbatim_p
= false;
13642 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13646 const char *folded
= ada_fold_name (user_name
);
13647 m_encoded_name
= ada_encode_1 (folded
, false);
13648 if (m_encoded_name
.empty ())
13649 m_encoded_name
= gdb::to_string (user_name
);
13652 m_encoded_name
= gdb::to_string (user_name
);
13654 /* Handle the 'package Standard' special case. See description
13655 of m_standard_p. */
13656 if (startswith (m_encoded_name
.c_str (), "standard__"))
13658 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13659 m_standard_p
= true;
13662 m_standard_p
= false;
13664 /* If the name contains a ".", then the user is entering a fully
13665 qualified entity name, and the match must not be done in wild
13666 mode. Similarly, if the user wants to complete what looks
13667 like an encoded name, the match must not be done in wild
13668 mode. Also, in the standard__ special case always do
13669 non-wild matching. */
13671 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13674 && user_name
.find ('.') == std::string::npos
);
13678 /* symbol_name_matcher_ftype method for Ada. This only handles
13679 completion mode. */
13682 ada_symbol_name_matches (const char *symbol_search_name
,
13683 const lookup_name_info
&lookup_name
,
13684 completion_match_result
*comp_match_res
)
13686 return lookup_name
.ada ().matches (symbol_search_name
,
13687 lookup_name
.match_type (),
13691 /* A name matcher that matches the symbol name exactly, with
13695 literal_symbol_name_matcher (const char *symbol_search_name
,
13696 const lookup_name_info
&lookup_name
,
13697 completion_match_result
*comp_match_res
)
13699 gdb::string_view name_view
= lookup_name
.name ();
13701 if (lookup_name
.completion_mode ()
13702 ? (strncmp (symbol_search_name
, name_view
.data (),
13703 name_view
.size ()) == 0)
13704 : symbol_search_name
== name_view
)
13706 if (comp_match_res
!= NULL
)
13707 comp_match_res
->set_match (symbol_search_name
);
13714 /* Implement the "get_symbol_name_matcher" language_defn method for
13717 static symbol_name_matcher_ftype
*
13718 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
13720 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
13721 return literal_symbol_name_matcher
;
13723 if (lookup_name
.completion_mode ())
13724 return ada_symbol_name_matches
;
13727 if (lookup_name
.ada ().wild_match_p ())
13728 return do_wild_match
;
13729 else if (lookup_name
.ada ().verbatim_p ())
13730 return do_exact_match
;
13732 return do_full_match
;
13736 /* Class representing the Ada language. */
13738 class ada_language
: public language_defn
13742 : language_defn (language_ada
)
13745 /* See language.h. */
13747 const char *name () const override
13750 /* See language.h. */
13752 const char *natural_name () const override
13755 /* See language.h. */
13757 const std::vector
<const char *> &filename_extensions () const override
13759 static const std::vector
<const char *> extensions
13760 = { ".adb", ".ads", ".a", ".ada", ".dg" };
13764 /* Print an array element index using the Ada syntax. */
13766 void print_array_index (struct type
*index_type
,
13768 struct ui_file
*stream
,
13769 const value_print_options
*options
) const override
13771 struct value
*index_value
= val_atr (index_type
, index
);
13773 value_print (index_value
, stream
, options
);
13774 fprintf_filtered (stream
, " => ");
13777 /* Implement the "read_var_value" language_defn method for Ada. */
13779 struct value
*read_var_value (struct symbol
*var
,
13780 const struct block
*var_block
,
13781 struct frame_info
*frame
) const override
13783 /* The only case where default_read_var_value is not sufficient
13784 is when VAR is a renaming... */
13785 if (frame
!= nullptr)
13787 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
13788 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
13789 return ada_read_renaming_var_value (var
, frame_block
);
13792 /* This is a typical case where we expect the default_read_var_value
13793 function to work. */
13794 return language_defn::read_var_value (var
, var_block
, frame
);
13797 /* See language.h. */
13798 void language_arch_info (struct gdbarch
*gdbarch
,
13799 struct language_arch_info
*lai
) const override
13801 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13803 /* Helper function to allow shorter lines below. */
13804 auto add
= [&] (struct type
*t
)
13806 lai
->add_primitive_type (t
);
13809 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13811 add (arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13812 0, "long_integer"));
13813 add (arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13814 0, "short_integer"));
13815 struct type
*char_type
= arch_character_type (gdbarch
, TARGET_CHAR_BIT
,
13817 lai
->set_string_char_type (char_type
);
13819 add (arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13820 "float", gdbarch_float_format (gdbarch
)));
13821 add (arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13822 "long_float", gdbarch_double_format (gdbarch
)));
13823 add (arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13824 0, "long_long_integer"));
13825 add (arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13827 gdbarch_long_double_format (gdbarch
)));
13828 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13830 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13832 add (builtin
->builtin_void
);
13834 struct type
*system_addr_ptr
13835 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13837 system_addr_ptr
->set_name ("system__address");
13838 add (system_addr_ptr
);
13840 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13841 type. This is a signed integral type whose size is the same as
13842 the size of addresses. */
13843 unsigned int addr_length
= TYPE_LENGTH (system_addr_ptr
);
13844 add (arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13845 "storage_offset"));
13847 lai
->set_bool_type (builtin
->builtin_bool
);
13850 /* See language.h. */
13852 bool iterate_over_symbols
13853 (const struct block
*block
, const lookup_name_info
&name
,
13854 domain_enum domain
,
13855 gdb::function_view
<symbol_found_callback_ftype
> callback
) const override
13857 std::vector
<struct block_symbol
> results
;
13859 ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
13860 for (block_symbol
&sym
: results
)
13862 if (!callback (&sym
))
13869 /* See language.h. */
13870 bool sniff_from_mangled_name (const char *mangled
,
13871 char **out
) const override
13873 std::string demangled
= ada_decode (mangled
);
13877 if (demangled
!= mangled
&& demangled
[0] != '<')
13879 /* Set the gsymbol language to Ada, but still return 0.
13880 Two reasons for that:
13882 1. For Ada, we prefer computing the symbol's decoded name
13883 on the fly rather than pre-compute it, in order to save
13884 memory (Ada projects are typically very large).
13886 2. There are some areas in the definition of the GNAT
13887 encoding where, with a bit of bad luck, we might be able
13888 to decode a non-Ada symbol, generating an incorrect
13889 demangled name (Eg: names ending with "TB" for instance
13890 are identified as task bodies and so stripped from
13891 the decoded name returned).
13893 Returning true, here, but not setting *DEMANGLED, helps us get
13894 a little bit of the best of both worlds. Because we're last,
13895 we should not affect any of the other languages that were
13896 able to demangle the symbol before us; we get to correctly
13897 tag Ada symbols as such; and even if we incorrectly tagged a
13898 non-Ada symbol, which should be rare, any routing through the
13899 Ada language should be transparent (Ada tries to behave much
13900 like C/C++ with non-Ada symbols). */
13907 /* See language.h. */
13909 char *demangle_symbol (const char *mangled
, int options
) const override
13911 return ada_la_decode (mangled
, options
);
13914 /* See language.h. */
13916 void print_type (struct type
*type
, const char *varstring
,
13917 struct ui_file
*stream
, int show
, int level
,
13918 const struct type_print_options
*flags
) const override
13920 ada_print_type (type
, varstring
, stream
, show
, level
, flags
);
13923 /* See language.h. */
13925 const char *word_break_characters (void) const override
13927 return ada_completer_word_break_characters
;
13930 /* See language.h. */
13932 void collect_symbol_completion_matches (completion_tracker
&tracker
,
13933 complete_symbol_mode mode
,
13934 symbol_name_match_type name_match_type
,
13935 const char *text
, const char *word
,
13936 enum type_code code
) const override
13938 struct symbol
*sym
;
13939 const struct block
*b
, *surrounding_static_block
= 0;
13940 struct block_iterator iter
;
13942 gdb_assert (code
== TYPE_CODE_UNDEF
);
13944 lookup_name_info
lookup_name (text
, name_match_type
, true);
13946 /* First, look at the partial symtab symbols. */
13947 expand_symtabs_matching (NULL
,
13953 /* At this point scan through the misc symbol vectors and add each
13954 symbol you find to the list. Eventually we want to ignore
13955 anything that isn't a text symbol (everything else will be
13956 handled by the psymtab code above). */
13958 for (objfile
*objfile
: current_program_space
->objfiles ())
13960 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
13964 if (completion_skip_symbol (mode
, msymbol
))
13967 language symbol_language
= msymbol
->language ();
13969 /* Ada minimal symbols won't have their language set to Ada. If
13970 we let completion_list_add_name compare using the
13971 default/C-like matcher, then when completing e.g., symbols in a
13972 package named "pck", we'd match internal Ada symbols like
13973 "pckS", which are invalid in an Ada expression, unless you wrap
13974 them in '<' '>' to request a verbatim match.
13976 Unfortunately, some Ada encoded names successfully demangle as
13977 C++ symbols (using an old mangling scheme), such as "name__2Xn"
13978 -> "Xn::name(void)" and thus some Ada minimal symbols end up
13979 with the wrong language set. Paper over that issue here. */
13980 if (symbol_language
== language_auto
13981 || symbol_language
== language_cplus
)
13982 symbol_language
= language_ada
;
13984 completion_list_add_name (tracker
,
13986 msymbol
->linkage_name (),
13987 lookup_name
, text
, word
);
13991 /* Search upwards from currently selected frame (so that we can
13992 complete on local vars. */
13994 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
13996 if (!BLOCK_SUPERBLOCK (b
))
13997 surrounding_static_block
= b
; /* For elmin of dups */
13999 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14001 if (completion_skip_symbol (mode
, sym
))
14004 completion_list_add_name (tracker
,
14006 sym
->linkage_name (),
14007 lookup_name
, text
, word
);
14011 /* Go through the symtabs and check the externs and statics for
14012 symbols which match. */
14014 for (objfile
*objfile
: current_program_space
->objfiles ())
14016 for (compunit_symtab
*s
: objfile
->compunits ())
14019 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
14020 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14022 if (completion_skip_symbol (mode
, sym
))
14025 completion_list_add_name (tracker
,
14027 sym
->linkage_name (),
14028 lookup_name
, text
, word
);
14033 for (objfile
*objfile
: current_program_space
->objfiles ())
14035 for (compunit_symtab
*s
: objfile
->compunits ())
14038 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
14039 /* Don't do this block twice. */
14040 if (b
== surrounding_static_block
)
14042 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14044 if (completion_skip_symbol (mode
, sym
))
14047 completion_list_add_name (tracker
,
14049 sym
->linkage_name (),
14050 lookup_name
, text
, word
);
14056 /* See language.h. */
14058 gdb::unique_xmalloc_ptr
<char> watch_location_expression
14059 (struct type
*type
, CORE_ADDR addr
) const override
14061 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
14062 std::string name
= type_to_string (type
);
14063 return gdb::unique_xmalloc_ptr
<char>
14064 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
14067 /* See language.h. */
14069 void value_print (struct value
*val
, struct ui_file
*stream
,
14070 const struct value_print_options
*options
) const override
14072 return ada_value_print (val
, stream
, options
);
14075 /* See language.h. */
14077 void value_print_inner
14078 (struct value
*val
, struct ui_file
*stream
, int recurse
,
14079 const struct value_print_options
*options
) const override
14081 return ada_value_print_inner (val
, stream
, recurse
, options
);
14084 /* See language.h. */
14086 struct block_symbol lookup_symbol_nonlocal
14087 (const char *name
, const struct block
*block
,
14088 const domain_enum domain
) const override
14090 struct block_symbol sym
;
14092 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
14093 if (sym
.symbol
!= NULL
)
14096 /* If we haven't found a match at this point, try the primitive
14097 types. In other languages, this search is performed before
14098 searching for global symbols in order to short-circuit that
14099 global-symbol search if it happens that the name corresponds
14100 to a primitive type. But we cannot do the same in Ada, because
14101 it is perfectly legitimate for a program to declare a type which
14102 has the same name as a standard type. If looking up a type in
14103 that situation, we have traditionally ignored the primitive type
14104 in favor of user-defined types. This is why, unlike most other
14105 languages, we search the primitive types this late and only after
14106 having searched the global symbols without success. */
14108 if (domain
== VAR_DOMAIN
)
14110 struct gdbarch
*gdbarch
;
14113 gdbarch
= target_gdbarch ();
14115 gdbarch
= block_gdbarch (block
);
14117 = language_lookup_primitive_type_as_symbol (this, gdbarch
, name
);
14118 if (sym
.symbol
!= NULL
)
14125 /* See language.h. */
14127 int parser (struct parser_state
*ps
) const override
14129 warnings_issued
= 0;
14130 return ada_parse (ps
);
14135 Same as evaluate_type (*EXP), but resolves ambiguous symbol references
14136 (marked by OP_VAR_VALUE nodes in which the symbol has an undefined
14137 namespace) and converts operators that are user-defined into
14138 appropriate function calls. If CONTEXT_TYPE is non-null, it provides
14139 a preferred result type [at the moment, only type void has any
14140 effect---causing procedures to be preferred over functions in calls].
14141 A null CONTEXT_TYPE indicates that a non-void return type is
14142 preferred. May change (expand) *EXP. */
14144 void post_parser (expression_up
*expp
, struct parser_state
*ps
)
14147 struct type
*context_type
= NULL
;
14150 if (ps
->void_context_p
)
14151 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
14153 resolve_subexp (expp
, &pc
, 1, context_type
, ps
->parse_completion
,
14154 ps
->block_tracker
);
14157 /* See language.h. */
14159 void emitchar (int ch
, struct type
*chtype
,
14160 struct ui_file
*stream
, int quoter
) const override
14162 ada_emit_char (ch
, chtype
, stream
, quoter
, 1);
14165 /* See language.h. */
14167 void printchar (int ch
, struct type
*chtype
,
14168 struct ui_file
*stream
) const override
14170 ada_printchar (ch
, chtype
, stream
);
14173 /* See language.h. */
14175 void printstr (struct ui_file
*stream
, struct type
*elttype
,
14176 const gdb_byte
*string
, unsigned int length
,
14177 const char *encoding
, int force_ellipses
,
14178 const struct value_print_options
*options
) const override
14180 ada_printstr (stream
, elttype
, string
, length
, encoding
,
14181 force_ellipses
, options
);
14184 /* See language.h. */
14186 void print_typedef (struct type
*type
, struct symbol
*new_symbol
,
14187 struct ui_file
*stream
) const override
14189 ada_print_typedef (type
, new_symbol
, stream
);
14192 /* See language.h. */
14194 bool is_string_type_p (struct type
*type
) const override
14196 return ada_is_string_type (type
);
14199 /* See language.h. */
14201 const char *struct_too_deep_ellipsis () const override
14202 { return "(...)"; }
14204 /* See language.h. */
14206 bool c_style_arrays_p () const override
14209 /* See language.h. */
14211 bool store_sym_names_in_linkage_form_p () const override
14214 /* See language.h. */
14216 const struct lang_varobj_ops
*varobj_ops () const override
14217 { return &ada_varobj_ops
; }
14219 /* See language.h. */
14221 const struct exp_descriptor
*expression_ops () const override
14222 { return &ada_exp_descriptor
; }
14224 /* See language.h. */
14226 const struct op_print
*opcode_print_table () const override
14227 { return ada_op_print_tab
; }
14230 /* See language.h. */
14232 symbol_name_matcher_ftype
*get_symbol_name_matcher_inner
14233 (const lookup_name_info
&lookup_name
) const override
14235 return ada_get_symbol_name_matcher (lookup_name
);
14239 /* Single instance of the Ada language class. */
14241 static ada_language ada_language_defn
;
14243 /* Command-list for the "set/show ada" prefix command. */
14244 static struct cmd_list_element
*set_ada_list
;
14245 static struct cmd_list_element
*show_ada_list
;
14248 initialize_ada_catchpoint_ops (void)
14250 struct breakpoint_ops
*ops
;
14252 initialize_breakpoint_ops ();
14254 ops
= &catch_exception_breakpoint_ops
;
14255 *ops
= bkpt_breakpoint_ops
;
14256 ops
->allocate_location
= allocate_location_exception
;
14257 ops
->re_set
= re_set_exception
;
14258 ops
->check_status
= check_status_exception
;
14259 ops
->print_it
= print_it_exception
;
14260 ops
->print_one
= print_one_exception
;
14261 ops
->print_mention
= print_mention_exception
;
14262 ops
->print_recreate
= print_recreate_exception
;
14264 ops
= &catch_exception_unhandled_breakpoint_ops
;
14265 *ops
= bkpt_breakpoint_ops
;
14266 ops
->allocate_location
= allocate_location_exception
;
14267 ops
->re_set
= re_set_exception
;
14268 ops
->check_status
= check_status_exception
;
14269 ops
->print_it
= print_it_exception
;
14270 ops
->print_one
= print_one_exception
;
14271 ops
->print_mention
= print_mention_exception
;
14272 ops
->print_recreate
= print_recreate_exception
;
14274 ops
= &catch_assert_breakpoint_ops
;
14275 *ops
= bkpt_breakpoint_ops
;
14276 ops
->allocate_location
= allocate_location_exception
;
14277 ops
->re_set
= re_set_exception
;
14278 ops
->check_status
= check_status_exception
;
14279 ops
->print_it
= print_it_exception
;
14280 ops
->print_one
= print_one_exception
;
14281 ops
->print_mention
= print_mention_exception
;
14282 ops
->print_recreate
= print_recreate_exception
;
14284 ops
= &catch_handlers_breakpoint_ops
;
14285 *ops
= bkpt_breakpoint_ops
;
14286 ops
->allocate_location
= allocate_location_exception
;
14287 ops
->re_set
= re_set_exception
;
14288 ops
->check_status
= check_status_exception
;
14289 ops
->print_it
= print_it_exception
;
14290 ops
->print_one
= print_one_exception
;
14291 ops
->print_mention
= print_mention_exception
;
14292 ops
->print_recreate
= print_recreate_exception
;
14295 /* This module's 'new_objfile' observer. */
14298 ada_new_objfile_observer (struct objfile
*objfile
)
14300 ada_clear_symbol_cache ();
14303 /* This module's 'free_objfile' observer. */
14306 ada_free_objfile_observer (struct objfile
*objfile
)
14308 ada_clear_symbol_cache ();
14311 void _initialize_ada_language ();
14313 _initialize_ada_language ()
14315 initialize_ada_catchpoint_ops ();
14317 add_basic_prefix_cmd ("ada", no_class
,
14318 _("Prefix command for changing Ada-specific settings."),
14319 &set_ada_list
, "set ada ", 0, &setlist
);
14321 add_show_prefix_cmd ("ada", no_class
,
14322 _("Generic command for showing Ada-specific settings."),
14323 &show_ada_list
, "show ada ", 0, &showlist
);
14325 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14326 &trust_pad_over_xvs
, _("\
14327 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14328 Show whether an optimization trusting PAD types over XVS types is activated."),
14330 This is related to the encoding used by the GNAT compiler. The debugger\n\
14331 should normally trust the contents of PAD types, but certain older versions\n\
14332 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14333 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14334 work around this bug. It is always safe to turn this option \"off\", but\n\
14335 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14336 this option to \"off\" unless necessary."),
14337 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14339 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14340 &print_signatures
, _("\
14341 Enable or disable the output of formal and return types for functions in the \
14342 overloads selection menu."), _("\
14343 Show whether the output of formal and return types for functions in the \
14344 overloads selection menu is activated."),
14345 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14347 add_catch_command ("exception", _("\
14348 Catch Ada exceptions, when raised.\n\
14349 Usage: catch exception [ARG] [if CONDITION]\n\
14350 Without any argument, stop when any Ada exception is raised.\n\
14351 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14352 being raised does not have a handler (and will therefore lead to the task's\n\
14354 Otherwise, the catchpoint only stops when the name of the exception being\n\
14355 raised is the same as ARG.\n\
14356 CONDITION is a boolean expression that is evaluated to see whether the\n\
14357 exception should cause a stop."),
14358 catch_ada_exception_command
,
14359 catch_ada_completer
,
14363 add_catch_command ("handlers", _("\
14364 Catch Ada exceptions, when handled.\n\
14365 Usage: catch handlers [ARG] [if CONDITION]\n\
14366 Without any argument, stop when any Ada exception is handled.\n\
14367 With an argument, catch only exceptions with the given name.\n\
14368 CONDITION is a boolean expression that is evaluated to see whether the\n\
14369 exception should cause a stop."),
14370 catch_ada_handlers_command
,
14371 catch_ada_completer
,
14374 add_catch_command ("assert", _("\
14375 Catch failed Ada assertions, when raised.\n\
14376 Usage: catch assert [if CONDITION]\n\
14377 CONDITION is a boolean expression that is evaluated to see whether the\n\
14378 exception should cause a stop."),
14379 catch_assert_command
,
14384 varsize_limit
= 65536;
14385 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14386 &varsize_limit
, _("\
14387 Set the maximum number of bytes allowed in a variable-size object."), _("\
14388 Show the maximum number of bytes allowed in a variable-size object."), _("\
14389 Attempts to access an object whose size is not a compile-time constant\n\
14390 and exceeds this limit will cause an error."),
14391 NULL
, NULL
, &setlist
, &showlist
);
14393 add_info ("exceptions", info_exceptions_command
,
14395 List all Ada exception names.\n\
14396 Usage: info exceptions [REGEXP]\n\
14397 If a regular expression is passed as an argument, only those matching\n\
14398 the regular expression are listed."));
14400 add_basic_prefix_cmd ("ada", class_maintenance
,
14401 _("Set Ada maintenance-related variables."),
14402 &maint_set_ada_cmdlist
, "maintenance set ada ",
14403 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14405 add_show_prefix_cmd ("ada", class_maintenance
,
14406 _("Show Ada maintenance-related variables."),
14407 &maint_show_ada_cmdlist
, "maintenance show ada ",
14408 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14410 add_setshow_boolean_cmd
14411 ("ignore-descriptive-types", class_maintenance
,
14412 &ada_ignore_descriptive_types_p
,
14413 _("Set whether descriptive types generated by GNAT should be ignored."),
14414 _("Show whether descriptive types generated by GNAT should be ignored."),
14416 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14417 DWARF attribute."),
14418 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14420 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14421 NULL
, xcalloc
, xfree
);
14423 /* The ada-lang observers. */
14424 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14425 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14426 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);