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 obstack cache_space
;
288 /* The root of the hash table used to implement our symbol cache. */
289 struct cache_entry
*root
[HASH_SIZE
];
292 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
294 /* Maximum-sized dynamic type. */
295 static unsigned int varsize_limit
;
297 static const char ada_completer_word_break_characters
[] =
299 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
301 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
304 /* The name of the symbol to use to get the name of the main subprogram. */
305 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
306 = "__gnat_ada_main_program_name";
308 /* Limit on the number of warnings to raise per expression evaluation. */
309 static int warning_limit
= 2;
311 /* Number of warning messages issued; reset to 0 by cleanups after
312 expression evaluation. */
313 static int warnings_issued
= 0;
315 static const char * const known_runtime_file_name_patterns
[] = {
316 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
319 static const char * const known_auxiliary_function_name_patterns
[] = {
320 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
323 /* Maintenance-related settings for this module. */
325 static struct cmd_list_element
*maint_set_ada_cmdlist
;
326 static struct cmd_list_element
*maint_show_ada_cmdlist
;
328 /* The "maintenance ada set/show ignore-descriptive-type" value. */
330 static bool ada_ignore_descriptive_types_p
= false;
332 /* Inferior-specific data. */
334 /* Per-inferior data for this module. */
336 struct ada_inferior_data
338 /* The ada__tags__type_specific_data type, which is used when decoding
339 tagged types. With older versions of GNAT, this type was directly
340 accessible through a component ("tsd") in the object tag. But this
341 is no longer the case, so we cache it for each inferior. */
342 struct type
*tsd_type
= nullptr;
344 /* The exception_support_info data. This data is used to determine
345 how to implement support for Ada exception catchpoints in a given
347 const struct exception_support_info
*exception_info
= nullptr;
350 /* Our key to this module's inferior data. */
351 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
353 /* Return our inferior data for the given inferior (INF).
355 This function always returns a valid pointer to an allocated
356 ada_inferior_data structure. If INF's inferior data has not
357 been previously set, this functions creates a new one with all
358 fields set to zero, sets INF's inferior to it, and then returns
359 a pointer to that newly allocated ada_inferior_data. */
361 static struct ada_inferior_data
*
362 get_ada_inferior_data (struct inferior
*inf
)
364 struct ada_inferior_data
*data
;
366 data
= ada_inferior_data
.get (inf
);
368 data
= ada_inferior_data
.emplace (inf
);
373 /* Perform all necessary cleanups regarding our module's inferior data
374 that is required after the inferior INF just exited. */
377 ada_inferior_exit (struct inferior
*inf
)
379 ada_inferior_data
.clear (inf
);
383 /* program-space-specific data. */
385 /* This module's per-program-space data. */
386 struct ada_pspace_data
390 if (sym_cache
!= NULL
)
391 ada_free_symbol_cache (sym_cache
);
394 /* The Ada symbol cache. */
395 struct ada_symbol_cache
*sym_cache
= nullptr;
398 /* Key to our per-program-space data. */
399 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
401 /* Return this module's data for the given program space (PSPACE).
402 If not is found, add a zero'ed one now.
404 This function always returns a valid object. */
406 static struct ada_pspace_data
*
407 get_ada_pspace_data (struct program_space
*pspace
)
409 struct ada_pspace_data
*data
;
411 data
= ada_pspace_data_handle
.get (pspace
);
413 data
= ada_pspace_data_handle
.emplace (pspace
);
420 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
421 all typedef layers have been peeled. Otherwise, return TYPE.
423 Normally, we really expect a typedef type to only have 1 typedef layer.
424 In other words, we really expect the target type of a typedef type to be
425 a non-typedef type. This is particularly true for Ada units, because
426 the language does not have a typedef vs not-typedef distinction.
427 In that respect, the Ada compiler has been trying to eliminate as many
428 typedef definitions in the debugging information, since they generally
429 do not bring any extra information (we still use typedef under certain
430 circumstances related mostly to the GNAT encoding).
432 Unfortunately, we have seen situations where the debugging information
433 generated by the compiler leads to such multiple typedef layers. For
434 instance, consider the following example with stabs:
436 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
437 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
439 This is an error in the debugging information which causes type
440 pck__float_array___XUP to be defined twice, and the second time,
441 it is defined as a typedef of a typedef.
443 This is on the fringe of legality as far as debugging information is
444 concerned, and certainly unexpected. But it is easy to handle these
445 situations correctly, so we can afford to be lenient in this case. */
448 ada_typedef_target_type (struct type
*type
)
450 while (type
->code () == TYPE_CODE_TYPEDEF
)
451 type
= TYPE_TARGET_TYPE (type
);
455 /* Given DECODED_NAME a string holding a symbol name in its
456 decoded form (ie using the Ada dotted notation), returns
457 its unqualified name. */
460 ada_unqualified_name (const char *decoded_name
)
464 /* If the decoded name starts with '<', it means that the encoded
465 name does not follow standard naming conventions, and thus that
466 it is not your typical Ada symbol name. Trying to unqualify it
467 is therefore pointless and possibly erroneous. */
468 if (decoded_name
[0] == '<')
471 result
= strrchr (decoded_name
, '.');
473 result
++; /* Skip the dot... */
475 result
= decoded_name
;
480 /* Return a string starting with '<', followed by STR, and '>'. */
483 add_angle_brackets (const char *str
)
485 return string_printf ("<%s>", str
);
488 /* Assuming V points to an array of S objects, make sure that it contains at
489 least M objects, updating V and S as necessary. */
491 #define GROW_VECT(v, s, m) \
492 if ((s) < (m)) (v) = (char *) grow_vect (v, &(s), m, sizeof *(v));
494 /* Assuming VECT points to an array of *SIZE objects of size
495 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
496 updating *SIZE as necessary and returning the (new) array. */
499 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
501 if (*size
< min_size
)
504 if (*size
< min_size
)
506 vect
= xrealloc (vect
, *size
* element_size
);
511 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
512 suffix of FIELD_NAME beginning "___". */
515 field_name_match (const char *field_name
, const char *target
)
517 int len
= strlen (target
);
520 (strncmp (field_name
, target
, len
) == 0
521 && (field_name
[len
] == '\0'
522 || (startswith (field_name
+ len
, "___")
523 && strcmp (field_name
+ strlen (field_name
) - 6,
528 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
529 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
530 and return its index. This function also handles fields whose name
531 have ___ suffixes because the compiler sometimes alters their name
532 by adding such a suffix to represent fields with certain constraints.
533 If the field could not be found, return a negative number if
534 MAYBE_MISSING is set. Otherwise raise an error. */
537 ada_get_field_index (const struct type
*type
, const char *field_name
,
541 struct type
*struct_type
= check_typedef ((struct type
*) type
);
543 for (fieldno
= 0; fieldno
< struct_type
->num_fields (); fieldno
++)
544 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
548 error (_("Unable to find field %s in struct %s. Aborting"),
549 field_name
, struct_type
->name ());
554 /* The length of the prefix of NAME prior to any "___" suffix. */
557 ada_name_prefix_len (const char *name
)
563 const char *p
= strstr (name
, "___");
566 return strlen (name
);
572 /* Return non-zero if SUFFIX is a suffix of STR.
573 Return zero if STR is null. */
576 is_suffix (const char *str
, const char *suffix
)
583 len2
= strlen (suffix
);
584 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
587 /* The contents of value VAL, treated as a value of type TYPE. The
588 result is an lval in memory if VAL is. */
590 static struct value
*
591 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
593 type
= ada_check_typedef (type
);
594 if (value_type (val
) == type
)
598 struct value
*result
;
600 /* Make sure that the object size is not unreasonable before
601 trying to allocate some memory for it. */
602 ada_ensure_varsize_limit (type
);
604 if (value_optimized_out (val
))
605 result
= allocate_optimized_out_value (type
);
606 else if (value_lazy (val
)
607 /* Be careful not to make a lazy not_lval value. */
608 || (VALUE_LVAL (val
) != not_lval
609 && TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
))))
610 result
= allocate_value_lazy (type
);
613 result
= allocate_value (type
);
614 value_contents_copy (result
, 0, val
, 0, TYPE_LENGTH (type
));
616 set_value_component_location (result
, val
);
617 set_value_bitsize (result
, value_bitsize (val
));
618 set_value_bitpos (result
, value_bitpos (val
));
619 if (VALUE_LVAL (result
) == lval_memory
)
620 set_value_address (result
, value_address (val
));
625 static const gdb_byte
*
626 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
631 return valaddr
+ offset
;
635 cond_offset_target (CORE_ADDR address
, long offset
)
640 return address
+ offset
;
643 /* Issue a warning (as for the definition of warning in utils.c, but
644 with exactly one argument rather than ...), unless the limit on the
645 number of warnings has passed during the evaluation of the current
648 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
649 provided by "complaint". */
650 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
653 lim_warning (const char *format
, ...)
657 va_start (args
, format
);
658 warnings_issued
+= 1;
659 if (warnings_issued
<= warning_limit
)
660 vwarning (format
, args
);
665 /* Issue an error if the size of an object of type T is unreasonable,
666 i.e. if it would be a bad idea to allocate a value of this type in
670 ada_ensure_varsize_limit (const struct type
*type
)
672 if (TYPE_LENGTH (type
) > varsize_limit
)
673 error (_("object size is larger than varsize-limit"));
676 /* Maximum value of a SIZE-byte signed integer type. */
678 max_of_size (int size
)
680 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
682 return top_bit
| (top_bit
- 1);
685 /* Minimum value of a SIZE-byte signed integer type. */
687 min_of_size (int size
)
689 return -max_of_size (size
) - 1;
692 /* Maximum value of a SIZE-byte unsigned integer type. */
694 umax_of_size (int size
)
696 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
698 return top_bit
| (top_bit
- 1);
701 /* Maximum value of integral type T, as a signed quantity. */
703 max_of_type (struct type
*t
)
705 if (t
->is_unsigned ())
706 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
708 return max_of_size (TYPE_LENGTH (t
));
711 /* Minimum value of integral type T, as a signed quantity. */
713 min_of_type (struct type
*t
)
715 if (t
->is_unsigned ())
718 return min_of_size (TYPE_LENGTH (t
));
721 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
723 ada_discrete_type_high_bound (struct type
*type
)
725 type
= resolve_dynamic_type (type
, {}, 0);
726 switch (type
->code ())
728 case TYPE_CODE_RANGE
:
730 const dynamic_prop
&high
= type
->bounds ()->high
;
732 if (high
.kind () == PROP_CONST
)
733 return high
.const_val ();
736 gdb_assert (high
.kind () == PROP_UNDEFINED
);
738 /* This happens when trying to evaluate a type's dynamic bound
739 without a live target. There is nothing relevant for us to
740 return here, so return 0. */
745 return TYPE_FIELD_ENUMVAL (type
, type
->num_fields () - 1);
750 return max_of_type (type
);
752 error (_("Unexpected type in ada_discrete_type_high_bound."));
756 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
758 ada_discrete_type_low_bound (struct type
*type
)
760 type
= resolve_dynamic_type (type
, {}, 0);
761 switch (type
->code ())
763 case TYPE_CODE_RANGE
:
765 const dynamic_prop
&low
= type
->bounds ()->low
;
767 if (low
.kind () == PROP_CONST
)
768 return low
.const_val ();
771 gdb_assert (low
.kind () == PROP_UNDEFINED
);
773 /* This happens when trying to evaluate a type's dynamic bound
774 without a live target. There is nothing relevant for us to
775 return here, so return 0. */
780 return TYPE_FIELD_ENUMVAL (type
, 0);
785 return min_of_type (type
);
787 error (_("Unexpected type in ada_discrete_type_low_bound."));
791 /* The identity on non-range types. For range types, the underlying
792 non-range scalar type. */
795 get_base_type (struct type
*type
)
797 while (type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
)
799 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
801 type
= TYPE_TARGET_TYPE (type
);
806 /* Return a decoded version of the given VALUE. This means returning
807 a value whose type is obtained by applying all the GNAT-specific
808 encodings, making the resulting type a static but standard description
809 of the initial type. */
812 ada_get_decoded_value (struct value
*value
)
814 struct type
*type
= ada_check_typedef (value_type (value
));
816 if (ada_is_array_descriptor_type (type
)
817 || (ada_is_constrained_packed_array_type (type
)
818 && type
->code () != TYPE_CODE_PTR
))
820 if (type
->code () == TYPE_CODE_TYPEDEF
) /* array access type. */
821 value
= ada_coerce_to_simple_array_ptr (value
);
823 value
= ada_coerce_to_simple_array (value
);
826 value
= ada_to_fixed_value (value
);
831 /* Same as ada_get_decoded_value, but with the given TYPE.
832 Because there is no associated actual value for this type,
833 the resulting type might be a best-effort approximation in
834 the case of dynamic types. */
837 ada_get_decoded_type (struct type
*type
)
839 type
= to_static_fixed_type (type
);
840 if (ada_is_constrained_packed_array_type (type
))
841 type
= ada_coerce_to_simple_array_type (type
);
847 /* Language Selection */
849 /* If the main program is in Ada, return language_ada, otherwise return LANG
850 (the main program is in Ada iif the adainit symbol is found). */
853 ada_update_initial_language (enum language lang
)
855 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
861 /* If the main procedure is written in Ada, then return its name.
862 The result is good until the next call. Return NULL if the main
863 procedure doesn't appear to be in Ada. */
868 struct bound_minimal_symbol msym
;
869 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
871 /* For Ada, the name of the main procedure is stored in a specific
872 string constant, generated by the binder. Look for that symbol,
873 extract its address, and then read that string. If we didn't find
874 that string, then most probably the main procedure is not written
876 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
878 if (msym
.minsym
!= NULL
)
880 CORE_ADDR main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
881 if (main_program_name_addr
== 0)
882 error (_("Invalid address for Ada main program name."));
884 main_program_name
= target_read_string (main_program_name_addr
, 1024);
885 return main_program_name
.get ();
888 /* The main procedure doesn't seem to be in Ada. */
894 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
897 const struct ada_opname_map ada_opname_table
[] = {
898 {"Oadd", "\"+\"", BINOP_ADD
},
899 {"Osubtract", "\"-\"", BINOP_SUB
},
900 {"Omultiply", "\"*\"", BINOP_MUL
},
901 {"Odivide", "\"/\"", BINOP_DIV
},
902 {"Omod", "\"mod\"", BINOP_MOD
},
903 {"Orem", "\"rem\"", BINOP_REM
},
904 {"Oexpon", "\"**\"", BINOP_EXP
},
905 {"Olt", "\"<\"", BINOP_LESS
},
906 {"Ole", "\"<=\"", BINOP_LEQ
},
907 {"Ogt", "\">\"", BINOP_GTR
},
908 {"Oge", "\">=\"", BINOP_GEQ
},
909 {"Oeq", "\"=\"", BINOP_EQUAL
},
910 {"One", "\"/=\"", BINOP_NOTEQUAL
},
911 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
912 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
913 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
914 {"Oconcat", "\"&\"", BINOP_CONCAT
},
915 {"Oabs", "\"abs\"", UNOP_ABS
},
916 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
917 {"Oadd", "\"+\"", UNOP_PLUS
},
918 {"Osubtract", "\"-\"", UNOP_NEG
},
922 /* The "encoded" form of DECODED, according to GNAT conventions. If
923 THROW_ERRORS, throw an error if invalid operator name is found.
924 Otherwise, return the empty string in that case. */
927 ada_encode_1 (const char *decoded
, bool throw_errors
)
932 std::string encoding_buffer
;
933 for (const char *p
= decoded
; *p
!= '\0'; p
+= 1)
936 encoding_buffer
.append ("__");
939 const struct ada_opname_map
*mapping
;
941 for (mapping
= ada_opname_table
;
942 mapping
->encoded
!= NULL
943 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
945 if (mapping
->encoded
== NULL
)
948 error (_("invalid Ada operator name: %s"), p
);
952 encoding_buffer
.append (mapping
->encoded
);
956 encoding_buffer
.push_back (*p
);
959 return encoding_buffer
;
962 /* The "encoded" form of DECODED, according to GNAT conventions. */
965 ada_encode (const char *decoded
)
967 return ada_encode_1 (decoded
, true);
970 /* Return NAME folded to lower case, or, if surrounded by single
971 quotes, unfolded, but with the quotes stripped away. Result good
975 ada_fold_name (gdb::string_view name
)
977 static char *fold_buffer
= NULL
;
978 static size_t fold_buffer_size
= 0;
980 int len
= name
.size ();
981 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
983 if (!name
.empty () && name
[0] == '\'')
985 strncpy (fold_buffer
, name
.data () + 1, len
- 2);
986 fold_buffer
[len
- 2] = '\000';
992 for (i
= 0; i
< len
; i
+= 1)
993 fold_buffer
[i
] = tolower (name
[i
]);
994 fold_buffer
[i
] = '\0';
1000 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1003 is_lower_alphanum (const char c
)
1005 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1008 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1009 This function saves in LEN the length of that same symbol name but
1010 without either of these suffixes:
1016 These are suffixes introduced by the compiler for entities such as
1017 nested subprogram for instance, in order to avoid name clashes.
1018 They do not serve any purpose for the debugger. */
1021 ada_remove_trailing_digits (const char *encoded
, int *len
)
1023 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1027 while (i
> 0 && isdigit (encoded
[i
]))
1029 if (i
>= 0 && encoded
[i
] == '.')
1031 else if (i
>= 0 && encoded
[i
] == '$')
1033 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1035 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1040 /* Remove the suffix introduced by the compiler for protected object
1044 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1046 /* Remove trailing N. */
1048 /* Protected entry subprograms are broken into two
1049 separate subprograms: The first one is unprotected, and has
1050 a 'N' suffix; the second is the protected version, and has
1051 the 'P' suffix. The second calls the first one after handling
1052 the protection. Since the P subprograms are internally generated,
1053 we leave these names undecoded, giving the user a clue that this
1054 entity is internal. */
1057 && encoded
[*len
- 1] == 'N'
1058 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1062 /* If ENCODED follows the GNAT entity encoding conventions, then return
1063 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1064 replaced by ENCODED. */
1067 ada_decode (const char *encoded
)
1073 std::string decoded
;
1075 /* With function descriptors on PPC64, the value of a symbol named
1076 ".FN", if it exists, is the entry point of the function "FN". */
1077 if (encoded
[0] == '.')
1080 /* The name of the Ada main procedure starts with "_ada_".
1081 This prefix is not part of the decoded name, so skip this part
1082 if we see this prefix. */
1083 if (startswith (encoded
, "_ada_"))
1086 /* If the name starts with '_', then it is not a properly encoded
1087 name, so do not attempt to decode it. Similarly, if the name
1088 starts with '<', the name should not be decoded. */
1089 if (encoded
[0] == '_' || encoded
[0] == '<')
1092 len0
= strlen (encoded
);
1094 ada_remove_trailing_digits (encoded
, &len0
);
1095 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1097 /* Remove the ___X.* suffix if present. Do not forget to verify that
1098 the suffix is located before the current "end" of ENCODED. We want
1099 to avoid re-matching parts of ENCODED that have previously been
1100 marked as discarded (by decrementing LEN0). */
1101 p
= strstr (encoded
, "___");
1102 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1110 /* Remove any trailing TKB suffix. It tells us that this symbol
1111 is for the body of a task, but that information does not actually
1112 appear in the decoded name. */
1114 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1117 /* Remove any trailing TB suffix. The TB suffix is slightly different
1118 from the TKB suffix because it is used for non-anonymous task
1121 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1124 /* Remove trailing "B" suffixes. */
1125 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1127 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1130 /* Make decoded big enough for possible expansion by operator name. */
1132 decoded
.resize (2 * len0
+ 1, 'X');
1134 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1136 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1139 while ((i
>= 0 && isdigit (encoded
[i
]))
1140 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1142 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1144 else if (encoded
[i
] == '$')
1148 /* The first few characters that are not alphabetic are not part
1149 of any encoding we use, so we can copy them over verbatim. */
1151 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1152 decoded
[j
] = encoded
[i
];
1157 /* Is this a symbol function? */
1158 if (at_start_name
&& encoded
[i
] == 'O')
1162 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1164 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1165 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1167 && !isalnum (encoded
[i
+ op_len
]))
1169 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1172 j
+= strlen (ada_opname_table
[k
].decoded
);
1176 if (ada_opname_table
[k
].encoded
!= NULL
)
1181 /* Replace "TK__" with "__", which will eventually be translated
1182 into "." (just below). */
1184 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1187 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1188 be translated into "." (just below). These are internal names
1189 generated for anonymous blocks inside which our symbol is nested. */
1191 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1192 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1193 && isdigit (encoded
[i
+4]))
1197 while (k
< len0
&& isdigit (encoded
[k
]))
1198 k
++; /* Skip any extra digit. */
1200 /* Double-check that the "__B_{DIGITS}+" sequence we found
1201 is indeed followed by "__". */
1202 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1206 /* Remove _E{DIGITS}+[sb] */
1208 /* Just as for protected object subprograms, there are 2 categories
1209 of subprograms created by the compiler for each entry. The first
1210 one implements the actual entry code, and has a suffix following
1211 the convention above; the second one implements the barrier and
1212 uses the same convention as above, except that the 'E' is replaced
1215 Just as above, we do not decode the name of barrier functions
1216 to give the user a clue that the code he is debugging has been
1217 internally generated. */
1219 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1220 && isdigit (encoded
[i
+2]))
1224 while (k
< len0
&& isdigit (encoded
[k
]))
1228 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1231 /* Just as an extra precaution, make sure that if this
1232 suffix is followed by anything else, it is a '_'.
1233 Otherwise, we matched this sequence by accident. */
1235 || (k
< len0
&& encoded
[k
] == '_'))
1240 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1241 the GNAT front-end in protected object subprograms. */
1244 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1246 /* Backtrack a bit up until we reach either the begining of
1247 the encoded name, or "__". Make sure that we only find
1248 digits or lowercase characters. */
1249 const char *ptr
= encoded
+ i
- 1;
1251 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1254 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1258 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1260 /* This is a X[bn]* sequence not separated from the previous
1261 part of the name with a non-alpha-numeric character (in other
1262 words, immediately following an alpha-numeric character), then
1263 verify that it is placed at the end of the encoded name. If
1264 not, then the encoding is not valid and we should abort the
1265 decoding. Otherwise, just skip it, it is used in body-nested
1269 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1273 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1275 /* Replace '__' by '.'. */
1283 /* It's a character part of the decoded name, so just copy it
1285 decoded
[j
] = encoded
[i
];
1292 /* Decoded names should never contain any uppercase character.
1293 Double-check this, and abort the decoding if we find one. */
1295 for (i
= 0; i
< decoded
.length(); ++i
)
1296 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1302 if (encoded
[0] == '<')
1305 decoded
= '<' + std::string(encoded
) + '>';
1310 /* Table for keeping permanent unique copies of decoded names. Once
1311 allocated, names in this table are never released. While this is a
1312 storage leak, it should not be significant unless there are massive
1313 changes in the set of decoded names in successive versions of a
1314 symbol table loaded during a single session. */
1315 static struct htab
*decoded_names_store
;
1317 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1318 in the language-specific part of GSYMBOL, if it has not been
1319 previously computed. Tries to save the decoded name in the same
1320 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1321 in any case, the decoded symbol has a lifetime at least that of
1323 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1324 const, but nevertheless modified to a semantically equivalent form
1325 when a decoded name is cached in it. */
1328 ada_decode_symbol (const struct general_symbol_info
*arg
)
1330 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1331 const char **resultp
=
1332 &gsymbol
->language_specific
.demangled_name
;
1334 if (!gsymbol
->ada_mangled
)
1336 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1337 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1339 gsymbol
->ada_mangled
= 1;
1341 if (obstack
!= NULL
)
1342 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1345 /* Sometimes, we can't find a corresponding objfile, in
1346 which case, we put the result on the heap. Since we only
1347 decode when needed, we hope this usually does not cause a
1348 significant memory leak (FIXME). */
1350 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1351 decoded
.c_str (), INSERT
);
1354 *slot
= xstrdup (decoded
.c_str ());
1363 ada_la_decode (const char *encoded
, int options
)
1365 return xstrdup (ada_decode (encoded
).c_str ());
1372 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1373 generated by the GNAT compiler to describe the index type used
1374 for each dimension of an array, check whether it follows the latest
1375 known encoding. If not, fix it up to conform to the latest encoding.
1376 Otherwise, do nothing. This function also does nothing if
1377 INDEX_DESC_TYPE is NULL.
1379 The GNAT encoding used to describe the array index type evolved a bit.
1380 Initially, the information would be provided through the name of each
1381 field of the structure type only, while the type of these fields was
1382 described as unspecified and irrelevant. The debugger was then expected
1383 to perform a global type lookup using the name of that field in order
1384 to get access to the full index type description. Because these global
1385 lookups can be very expensive, the encoding was later enhanced to make
1386 the global lookup unnecessary by defining the field type as being
1387 the full index type description.
1389 The purpose of this routine is to allow us to support older versions
1390 of the compiler by detecting the use of the older encoding, and by
1391 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1392 we essentially replace each field's meaningless type by the associated
1396 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1400 if (index_desc_type
== NULL
)
1402 gdb_assert (index_desc_type
->num_fields () > 0);
1404 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1405 to check one field only, no need to check them all). If not, return
1408 If our INDEX_DESC_TYPE was generated using the older encoding,
1409 the field type should be a meaningless integer type whose name
1410 is not equal to the field name. */
1411 if (index_desc_type
->field (0).type ()->name () != NULL
1412 && strcmp (index_desc_type
->field (0).type ()->name (),
1413 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1416 /* Fixup each field of INDEX_DESC_TYPE. */
1417 for (i
= 0; i
< index_desc_type
->num_fields (); i
++)
1419 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1420 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1423 index_desc_type
->field (i
).set_type (raw_type
);
1427 /* The desc_* routines return primitive portions of array descriptors
1430 /* The descriptor or array type, if any, indicated by TYPE; removes
1431 level of indirection, if needed. */
1433 static struct type
*
1434 desc_base_type (struct type
*type
)
1438 type
= ada_check_typedef (type
);
1439 if (type
->code () == TYPE_CODE_TYPEDEF
)
1440 type
= ada_typedef_target_type (type
);
1443 && (type
->code () == TYPE_CODE_PTR
1444 || type
->code () == TYPE_CODE_REF
))
1445 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1450 /* True iff TYPE indicates a "thin" array pointer type. */
1453 is_thin_pntr (struct type
*type
)
1456 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1457 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1460 /* The descriptor type for thin pointer type TYPE. */
1462 static struct type
*
1463 thin_descriptor_type (struct type
*type
)
1465 struct type
*base_type
= desc_base_type (type
);
1467 if (base_type
== NULL
)
1469 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1473 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1475 if (alt_type
== NULL
)
1482 /* A pointer to the array data for thin-pointer value VAL. */
1484 static struct value
*
1485 thin_data_pntr (struct value
*val
)
1487 struct type
*type
= ada_check_typedef (value_type (val
));
1488 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1490 data_type
= lookup_pointer_type (data_type
);
1492 if (type
->code () == TYPE_CODE_PTR
)
1493 return value_cast (data_type
, value_copy (val
));
1495 return value_from_longest (data_type
, value_address (val
));
1498 /* True iff TYPE indicates a "thick" array pointer type. */
1501 is_thick_pntr (struct type
*type
)
1503 type
= desc_base_type (type
);
1504 return (type
!= NULL
&& type
->code () == TYPE_CODE_STRUCT
1505 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1508 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1509 pointer to one, the type of its bounds data; otherwise, NULL. */
1511 static struct type
*
1512 desc_bounds_type (struct type
*type
)
1516 type
= desc_base_type (type
);
1520 else if (is_thin_pntr (type
))
1522 type
= thin_descriptor_type (type
);
1525 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1527 return ada_check_typedef (r
);
1529 else if (type
->code () == TYPE_CODE_STRUCT
)
1531 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1533 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1538 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1539 one, a pointer to its bounds data. Otherwise NULL. */
1541 static struct value
*
1542 desc_bounds (struct value
*arr
)
1544 struct type
*type
= ada_check_typedef (value_type (arr
));
1546 if (is_thin_pntr (type
))
1548 struct type
*bounds_type
=
1549 desc_bounds_type (thin_descriptor_type (type
));
1552 if (bounds_type
== NULL
)
1553 error (_("Bad GNAT array descriptor"));
1555 /* NOTE: The following calculation is not really kosher, but
1556 since desc_type is an XVE-encoded type (and shouldn't be),
1557 the correct calculation is a real pain. FIXME (and fix GCC). */
1558 if (type
->code () == TYPE_CODE_PTR
)
1559 addr
= value_as_long (arr
);
1561 addr
= value_address (arr
);
1564 value_from_longest (lookup_pointer_type (bounds_type
),
1565 addr
- TYPE_LENGTH (bounds_type
));
1568 else if (is_thick_pntr (type
))
1570 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1571 _("Bad GNAT array descriptor"));
1572 struct type
*p_bounds_type
= value_type (p_bounds
);
1575 && p_bounds_type
->code () == TYPE_CODE_PTR
)
1577 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1579 if (target_type
->is_stub ())
1580 p_bounds
= value_cast (lookup_pointer_type
1581 (ada_check_typedef (target_type
)),
1585 error (_("Bad GNAT array descriptor"));
1593 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1594 position of the field containing the address of the bounds data. */
1597 fat_pntr_bounds_bitpos (struct type
*type
)
1599 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1602 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1603 size of the field containing the address of the bounds data. */
1606 fat_pntr_bounds_bitsize (struct type
*type
)
1608 type
= desc_base_type (type
);
1610 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1611 return TYPE_FIELD_BITSIZE (type
, 1);
1613 return 8 * TYPE_LENGTH (ada_check_typedef (type
->field (1).type ()));
1616 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1617 pointer to one, the type of its array data (a array-with-no-bounds type);
1618 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1621 static struct type
*
1622 desc_data_target_type (struct type
*type
)
1624 type
= desc_base_type (type
);
1626 /* NOTE: The following is bogus; see comment in desc_bounds. */
1627 if (is_thin_pntr (type
))
1628 return desc_base_type (thin_descriptor_type (type
)->field (1).type ());
1629 else if (is_thick_pntr (type
))
1631 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1634 && ada_check_typedef (data_type
)->code () == TYPE_CODE_PTR
)
1635 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1641 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1644 static struct value
*
1645 desc_data (struct value
*arr
)
1647 struct type
*type
= value_type (arr
);
1649 if (is_thin_pntr (type
))
1650 return thin_data_pntr (arr
);
1651 else if (is_thick_pntr (type
))
1652 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1653 _("Bad GNAT array descriptor"));
1659 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1660 position of the field containing the address of the data. */
1663 fat_pntr_data_bitpos (struct type
*type
)
1665 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1668 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1669 size of the field containing the address of the data. */
1672 fat_pntr_data_bitsize (struct type
*type
)
1674 type
= desc_base_type (type
);
1676 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1677 return TYPE_FIELD_BITSIZE (type
, 0);
1679 return TARGET_CHAR_BIT
* TYPE_LENGTH (type
->field (0).type ());
1682 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1683 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1684 bound, if WHICH is 1. The first bound is I=1. */
1686 static struct value
*
1687 desc_one_bound (struct value
*bounds
, int i
, int which
)
1689 char bound_name
[20];
1690 xsnprintf (bound_name
, sizeof (bound_name
), "%cB%d",
1691 which
? 'U' : 'L', i
- 1);
1692 return value_struct_elt (&bounds
, NULL
, bound_name
, NULL
,
1693 _("Bad GNAT array descriptor bounds"));
1696 /* If BOUNDS is an array-bounds structure type, return the bit position
1697 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1698 bound, if WHICH is 1. The first bound is I=1. */
1701 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1703 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1706 /* If BOUNDS is an array-bounds structure type, return the bit field size
1707 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1708 bound, if WHICH is 1. The first bound is I=1. */
1711 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1713 type
= desc_base_type (type
);
1715 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1716 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1718 return 8 * TYPE_LENGTH (type
->field (2 * i
+ which
- 2).type ());
1721 /* If TYPE is the type of an array-bounds structure, the type of its
1722 Ith bound (numbering from 1). Otherwise, NULL. */
1724 static struct type
*
1725 desc_index_type (struct type
*type
, int i
)
1727 type
= desc_base_type (type
);
1729 if (type
->code () == TYPE_CODE_STRUCT
)
1731 char bound_name
[20];
1732 xsnprintf (bound_name
, sizeof (bound_name
), "LB%d", i
- 1);
1733 return lookup_struct_elt_type (type
, bound_name
, 1);
1739 /* The number of index positions in the array-bounds type TYPE.
1740 Return 0 if TYPE is NULL. */
1743 desc_arity (struct type
*type
)
1745 type
= desc_base_type (type
);
1748 return type
->num_fields () / 2;
1752 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1753 an array descriptor type (representing an unconstrained array
1757 ada_is_direct_array_type (struct type
*type
)
1761 type
= ada_check_typedef (type
);
1762 return (type
->code () == TYPE_CODE_ARRAY
1763 || ada_is_array_descriptor_type (type
));
1766 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1770 ada_is_array_type (struct type
*type
)
1773 && (type
->code () == TYPE_CODE_PTR
1774 || type
->code () == TYPE_CODE_REF
))
1775 type
= TYPE_TARGET_TYPE (type
);
1776 return ada_is_direct_array_type (type
);
1779 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1782 ada_is_simple_array_type (struct type
*type
)
1786 type
= ada_check_typedef (type
);
1787 return (type
->code () == TYPE_CODE_ARRAY
1788 || (type
->code () == TYPE_CODE_PTR
1789 && (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ()
1790 == TYPE_CODE_ARRAY
)));
1793 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1796 ada_is_array_descriptor_type (struct type
*type
)
1798 struct type
*data_type
= desc_data_target_type (type
);
1802 type
= ada_check_typedef (type
);
1803 return (data_type
!= NULL
1804 && data_type
->code () == TYPE_CODE_ARRAY
1805 && desc_arity (desc_bounds_type (type
)) > 0);
1808 /* Non-zero iff type is a partially mal-formed GNAT array
1809 descriptor. FIXME: This is to compensate for some problems with
1810 debugging output from GNAT. Re-examine periodically to see if it
1814 ada_is_bogus_array_descriptor (struct type
*type
)
1818 && type
->code () == TYPE_CODE_STRUCT
1819 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1820 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1821 && !ada_is_array_descriptor_type (type
);
1825 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1826 (fat pointer) returns the type of the array data described---specifically,
1827 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1828 in from the descriptor; otherwise, they are left unspecified. If
1829 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1830 returns NULL. The result is simply the type of ARR if ARR is not
1833 static struct type
*
1834 ada_type_of_array (struct value
*arr
, int bounds
)
1836 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1837 return decode_constrained_packed_array_type (value_type (arr
));
1839 if (!ada_is_array_descriptor_type (value_type (arr
)))
1840 return value_type (arr
);
1844 struct type
*array_type
=
1845 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1847 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1848 TYPE_FIELD_BITSIZE (array_type
, 0) =
1849 decode_packed_array_bitsize (value_type (arr
));
1855 struct type
*elt_type
;
1857 struct value
*descriptor
;
1859 elt_type
= ada_array_element_type (value_type (arr
), -1);
1860 arity
= ada_array_arity (value_type (arr
));
1862 if (elt_type
== NULL
|| arity
== 0)
1863 return ada_check_typedef (value_type (arr
));
1865 descriptor
= desc_bounds (arr
);
1866 if (value_as_long (descriptor
) == 0)
1870 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1871 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1872 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1873 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1876 create_static_range_type (range_type
, value_type (low
),
1877 longest_to_int (value_as_long (low
)),
1878 longest_to_int (value_as_long (high
)));
1879 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1881 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1883 /* We need to store the element packed bitsize, as well as
1884 recompute the array size, because it was previously
1885 computed based on the unpacked element size. */
1886 LONGEST lo
= value_as_long (low
);
1887 LONGEST hi
= value_as_long (high
);
1889 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1890 decode_packed_array_bitsize (value_type (arr
));
1891 /* If the array has no element, then the size is already
1892 zero, and does not need to be recomputed. */
1896 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1898 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1903 return lookup_pointer_type (elt_type
);
1907 /* If ARR does not represent an array, returns ARR unchanged.
1908 Otherwise, returns either a standard GDB array with bounds set
1909 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1910 GDB array. Returns NULL if ARR is a null fat pointer. */
1913 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1915 if (ada_is_array_descriptor_type (value_type (arr
)))
1917 struct type
*arrType
= ada_type_of_array (arr
, 1);
1919 if (arrType
== NULL
)
1921 return value_cast (arrType
, value_copy (desc_data (arr
)));
1923 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1924 return decode_constrained_packed_array (arr
);
1929 /* If ARR does not represent an array, returns ARR unchanged.
1930 Otherwise, returns a standard GDB array describing ARR (which may
1931 be ARR itself if it already is in the proper form). */
1934 ada_coerce_to_simple_array (struct value
*arr
)
1936 if (ada_is_array_descriptor_type (value_type (arr
)))
1938 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1941 error (_("Bounds unavailable for null array pointer."));
1942 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
1943 return value_ind (arrVal
);
1945 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1946 return decode_constrained_packed_array (arr
);
1951 /* If TYPE represents a GNAT array type, return it translated to an
1952 ordinary GDB array type (possibly with BITSIZE fields indicating
1953 packing). For other types, is the identity. */
1956 ada_coerce_to_simple_array_type (struct type
*type
)
1958 if (ada_is_constrained_packed_array_type (type
))
1959 return decode_constrained_packed_array_type (type
);
1961 if (ada_is_array_descriptor_type (type
))
1962 return ada_check_typedef (desc_data_target_type (type
));
1967 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1970 ada_is_gnat_encoded_packed_array_type (struct type
*type
)
1974 type
= desc_base_type (type
);
1975 type
= ada_check_typedef (type
);
1977 ada_type_name (type
) != NULL
1978 && strstr (ada_type_name (type
), "___XP") != NULL
;
1981 /* Non-zero iff TYPE represents a standard GNAT constrained
1982 packed-array type. */
1985 ada_is_constrained_packed_array_type (struct type
*type
)
1987 return ada_is_gnat_encoded_packed_array_type (type
)
1988 && !ada_is_array_descriptor_type (type
);
1991 /* Non-zero iff TYPE represents an array descriptor for a
1992 unconstrained packed-array type. */
1995 ada_is_unconstrained_packed_array_type (struct type
*type
)
1997 if (!ada_is_array_descriptor_type (type
))
2000 if (ada_is_gnat_encoded_packed_array_type (type
))
2003 /* If we saw GNAT encodings, then the above code is sufficient.
2004 However, with minimal encodings, we will just have a thick
2006 if (is_thick_pntr (type
))
2008 type
= desc_base_type (type
);
2009 /* The structure's first field is a pointer to an array, so this
2010 fetches the array type. */
2011 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
2012 /* Now we can see if the array elements are packed. */
2013 return TYPE_FIELD_BITSIZE (type
, 0) > 0;
2019 /* Return true if TYPE is a (Gnat-encoded) constrained packed array
2020 type, or if it is an ordinary (non-Gnat-encoded) packed array. */
2023 ada_is_any_packed_array_type (struct type
*type
)
2025 return (ada_is_constrained_packed_array_type (type
)
2026 || (type
->code () == TYPE_CODE_ARRAY
2027 && TYPE_FIELD_BITSIZE (type
, 0) % 8 != 0));
2030 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2031 return the size of its elements in bits. */
2034 decode_packed_array_bitsize (struct type
*type
)
2036 const char *raw_name
;
2040 /* Access to arrays implemented as fat pointers are encoded as a typedef
2041 of the fat pointer type. We need the name of the fat pointer type
2042 to do the decoding, so strip the typedef layer. */
2043 if (type
->code () == TYPE_CODE_TYPEDEF
)
2044 type
= ada_typedef_target_type (type
);
2046 raw_name
= ada_type_name (ada_check_typedef (type
));
2048 raw_name
= ada_type_name (desc_base_type (type
));
2053 tail
= strstr (raw_name
, "___XP");
2054 if (tail
== nullptr)
2056 gdb_assert (is_thick_pntr (type
));
2057 /* The structure's first field is a pointer to an array, so this
2058 fetches the array type. */
2059 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
2060 /* Now we can see if the array elements are packed. */
2061 return TYPE_FIELD_BITSIZE (type
, 0);
2064 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2067 (_("could not understand bit size information on packed array"));
2074 /* Given that TYPE is a standard GDB array type with all bounds filled
2075 in, and that the element size of its ultimate scalar constituents
2076 (that is, either its elements, or, if it is an array of arrays, its
2077 elements' elements, etc.) is *ELT_BITS, return an identical type,
2078 but with the bit sizes of its elements (and those of any
2079 constituent arrays) recorded in the BITSIZE components of its
2080 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2083 Note that, for arrays whose index type has an XA encoding where
2084 a bound references a record discriminant, getting that discriminant,
2085 and therefore the actual value of that bound, is not possible
2086 because none of the given parameters gives us access to the record.
2087 This function assumes that it is OK in the context where it is being
2088 used to return an array whose bounds are still dynamic and where
2089 the length is arbitrary. */
2091 static struct type
*
2092 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2094 struct type
*new_elt_type
;
2095 struct type
*new_type
;
2096 struct type
*index_type_desc
;
2097 struct type
*index_type
;
2098 LONGEST low_bound
, high_bound
;
2100 type
= ada_check_typedef (type
);
2101 if (type
->code () != TYPE_CODE_ARRAY
)
2104 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2105 if (index_type_desc
)
2106 index_type
= to_fixed_range_type (index_type_desc
->field (0).type (),
2109 index_type
= type
->index_type ();
2111 new_type
= alloc_type_copy (type
);
2113 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2115 create_array_type (new_type
, new_elt_type
, index_type
);
2116 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2117 new_type
->set_name (ada_type_name (type
));
2119 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2120 && is_dynamic_type (check_typedef (index_type
)))
2121 || !get_discrete_bounds (index_type
, &low_bound
, &high_bound
))
2122 low_bound
= high_bound
= 0;
2123 if (high_bound
< low_bound
)
2124 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2127 *elt_bits
*= (high_bound
- low_bound
+ 1);
2128 TYPE_LENGTH (new_type
) =
2129 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2132 new_type
->set_is_fixed_instance (true);
2136 /* The array type encoded by TYPE, where
2137 ada_is_constrained_packed_array_type (TYPE). */
2139 static struct type
*
2140 decode_constrained_packed_array_type (struct type
*type
)
2142 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2145 struct type
*shadow_type
;
2149 raw_name
= ada_type_name (desc_base_type (type
));
2154 name
= (char *) alloca (strlen (raw_name
) + 1);
2155 tail
= strstr (raw_name
, "___XP");
2156 type
= desc_base_type (type
);
2158 memcpy (name
, raw_name
, tail
- raw_name
);
2159 name
[tail
- raw_name
] = '\000';
2161 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2163 if (shadow_type
== NULL
)
2165 lim_warning (_("could not find bounds information on packed array"));
2168 shadow_type
= check_typedef (shadow_type
);
2170 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2172 lim_warning (_("could not understand bounds "
2173 "information on packed array"));
2177 bits
= decode_packed_array_bitsize (type
);
2178 return constrained_packed_array_type (shadow_type
, &bits
);
2181 /* Helper function for decode_constrained_packed_array. Set the field
2182 bitsize on a series of packed arrays. Returns the number of
2183 elements in TYPE. */
2186 recursively_update_array_bitsize (struct type
*type
)
2188 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
2191 if (!get_discrete_bounds (type
->index_type (), &low
, &high
)
2194 LONGEST our_len
= high
- low
+ 1;
2196 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
2197 if (elt_type
->code () == TYPE_CODE_ARRAY
)
2199 LONGEST elt_len
= recursively_update_array_bitsize (elt_type
);
2200 LONGEST elt_bitsize
= elt_len
* TYPE_FIELD_BITSIZE (elt_type
, 0);
2201 TYPE_FIELD_BITSIZE (type
, 0) = elt_bitsize
;
2203 TYPE_LENGTH (type
) = ((our_len
* elt_bitsize
+ HOST_CHAR_BIT
- 1)
2210 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2211 array, returns a simple array that denotes that array. Its type is a
2212 standard GDB array type except that the BITSIZEs of the array
2213 target types are set to the number of bits in each element, and the
2214 type length is set appropriately. */
2216 static struct value
*
2217 decode_constrained_packed_array (struct value
*arr
)
2221 /* If our value is a pointer, then dereference it. Likewise if
2222 the value is a reference. Make sure that this operation does not
2223 cause the target type to be fixed, as this would indirectly cause
2224 this array to be decoded. The rest of the routine assumes that
2225 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2226 and "value_ind" routines to perform the dereferencing, as opposed
2227 to using "ada_coerce_ref" or "ada_value_ind". */
2228 arr
= coerce_ref (arr
);
2229 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2230 arr
= value_ind (arr
);
2232 type
= decode_constrained_packed_array_type (value_type (arr
));
2235 error (_("can't unpack array"));
2239 /* Decoding the packed array type could not correctly set the field
2240 bitsizes for any dimension except the innermost, because the
2241 bounds may be variable and were not passed to that function. So,
2242 we further resolve the array bounds here and then update the
2244 const gdb_byte
*valaddr
= value_contents_for_printing (arr
);
2245 CORE_ADDR address
= value_address (arr
);
2246 gdb::array_view
<const gdb_byte
> view
2247 = gdb::make_array_view (valaddr
, TYPE_LENGTH (type
));
2248 type
= resolve_dynamic_type (type
, view
, address
);
2249 recursively_update_array_bitsize (type
);
2251 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2252 && ada_is_modular_type (value_type (arr
)))
2254 /* This is a (right-justified) modular type representing a packed
2255 array with no wrapper. In order to interpret the value through
2256 the (left-justified) packed array type we just built, we must
2257 first left-justify it. */
2258 int bit_size
, bit_pos
;
2261 mod
= ada_modulus (value_type (arr
)) - 1;
2268 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2269 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2270 bit_pos
/ HOST_CHAR_BIT
,
2271 bit_pos
% HOST_CHAR_BIT
,
2276 return coerce_unspec_val_to_type (arr
, type
);
2280 /* The value of the element of packed array ARR at the ARITY indices
2281 given in IND. ARR must be a simple array. */
2283 static struct value
*
2284 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2287 int bits
, elt_off
, bit_off
;
2288 long elt_total_bit_offset
;
2289 struct type
*elt_type
;
2293 elt_total_bit_offset
= 0;
2294 elt_type
= ada_check_typedef (value_type (arr
));
2295 for (i
= 0; i
< arity
; i
+= 1)
2297 if (elt_type
->code () != TYPE_CODE_ARRAY
2298 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2300 (_("attempt to do packed indexing of "
2301 "something other than a packed array"));
2304 struct type
*range_type
= elt_type
->index_type ();
2305 LONGEST lowerbound
, upperbound
;
2308 if (!get_discrete_bounds (range_type
, &lowerbound
, &upperbound
))
2310 lim_warning (_("don't know bounds of array"));
2311 lowerbound
= upperbound
= 0;
2314 idx
= pos_atr (ind
[i
]);
2315 if (idx
< lowerbound
|| idx
> upperbound
)
2316 lim_warning (_("packed array index %ld out of bounds"),
2318 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2319 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2320 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2323 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2324 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2326 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2331 /* Non-zero iff TYPE includes negative integer values. */
2334 has_negatives (struct type
*type
)
2336 switch (type
->code ())
2341 return !type
->is_unsigned ();
2342 case TYPE_CODE_RANGE
:
2343 return type
->bounds ()->low
.const_val () - type
->bounds ()->bias
< 0;
2347 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2348 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2349 the unpacked buffer.
2351 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2352 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2354 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2357 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2359 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2362 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2363 gdb_byte
*unpacked
, int unpacked_len
,
2364 int is_big_endian
, int is_signed_type
,
2367 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2368 int src_idx
; /* Index into the source area */
2369 int src_bytes_left
; /* Number of source bytes left to process. */
2370 int srcBitsLeft
; /* Number of source bits left to move */
2371 int unusedLS
; /* Number of bits in next significant
2372 byte of source that are unused */
2374 int unpacked_idx
; /* Index into the unpacked buffer */
2375 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2377 unsigned long accum
; /* Staging area for bits being transferred */
2378 int accumSize
; /* Number of meaningful bits in accum */
2381 /* Transmit bytes from least to most significant; delta is the direction
2382 the indices move. */
2383 int delta
= is_big_endian
? -1 : 1;
2385 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2387 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2388 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2389 bit_size
, unpacked_len
);
2391 srcBitsLeft
= bit_size
;
2392 src_bytes_left
= src_len
;
2393 unpacked_bytes_left
= unpacked_len
;
2398 src_idx
= src_len
- 1;
2400 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2404 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2410 unpacked_idx
= unpacked_len
- 1;
2414 /* Non-scalar values must be aligned at a byte boundary... */
2416 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2417 /* ... And are placed at the beginning (most-significant) bytes
2419 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2420 unpacked_bytes_left
= unpacked_idx
+ 1;
2425 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2427 src_idx
= unpacked_idx
= 0;
2428 unusedLS
= bit_offset
;
2431 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2436 while (src_bytes_left
> 0)
2438 /* Mask for removing bits of the next source byte that are not
2439 part of the value. */
2440 unsigned int unusedMSMask
=
2441 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2443 /* Sign-extend bits for this byte. */
2444 unsigned int signMask
= sign
& ~unusedMSMask
;
2447 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2448 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2449 if (accumSize
>= HOST_CHAR_BIT
)
2451 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2452 accumSize
-= HOST_CHAR_BIT
;
2453 accum
>>= HOST_CHAR_BIT
;
2454 unpacked_bytes_left
-= 1;
2455 unpacked_idx
+= delta
;
2457 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2459 src_bytes_left
-= 1;
2462 while (unpacked_bytes_left
> 0)
2464 accum
|= sign
<< accumSize
;
2465 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2466 accumSize
-= HOST_CHAR_BIT
;
2469 accum
>>= HOST_CHAR_BIT
;
2470 unpacked_bytes_left
-= 1;
2471 unpacked_idx
+= delta
;
2475 /* Create a new value of type TYPE from the contents of OBJ starting
2476 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2477 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2478 assigning through the result will set the field fetched from.
2479 VALADDR is ignored unless OBJ is NULL, in which case,
2480 VALADDR+OFFSET must address the start of storage containing the
2481 packed value. The value returned in this case is never an lval.
2482 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2485 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2486 long offset
, int bit_offset
, int bit_size
,
2490 const gdb_byte
*src
; /* First byte containing data to unpack */
2492 const int is_scalar
= is_scalar_type (type
);
2493 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2494 gdb::byte_vector staging
;
2496 type
= ada_check_typedef (type
);
2499 src
= valaddr
+ offset
;
2501 src
= value_contents (obj
) + offset
;
2503 if (is_dynamic_type (type
))
2505 /* The length of TYPE might by dynamic, so we need to resolve
2506 TYPE in order to know its actual size, which we then use
2507 to create the contents buffer of the value we return.
2508 The difficulty is that the data containing our object is
2509 packed, and therefore maybe not at a byte boundary. So, what
2510 we do, is unpack the data into a byte-aligned buffer, and then
2511 use that buffer as our object's value for resolving the type. */
2512 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2513 staging
.resize (staging_len
);
2515 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2516 staging
.data (), staging
.size (),
2517 is_big_endian
, has_negatives (type
),
2519 type
= resolve_dynamic_type (type
, staging
, 0);
2520 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2522 /* This happens when the length of the object is dynamic,
2523 and is actually smaller than the space reserved for it.
2524 For instance, in an array of variant records, the bit_size
2525 we're given is the array stride, which is constant and
2526 normally equal to the maximum size of its element.
2527 But, in reality, each element only actually spans a portion
2529 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2535 v
= allocate_value (type
);
2536 src
= valaddr
+ offset
;
2538 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2540 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2543 v
= value_at (type
, value_address (obj
) + offset
);
2544 buf
= (gdb_byte
*) alloca (src_len
);
2545 read_memory (value_address (v
), buf
, src_len
);
2550 v
= allocate_value (type
);
2551 src
= value_contents (obj
) + offset
;
2556 long new_offset
= offset
;
2558 set_value_component_location (v
, obj
);
2559 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2560 set_value_bitsize (v
, bit_size
);
2561 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2564 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2566 set_value_offset (v
, new_offset
);
2568 /* Also set the parent value. This is needed when trying to
2569 assign a new value (in inferior memory). */
2570 set_value_parent (v
, obj
);
2573 set_value_bitsize (v
, bit_size
);
2574 unpacked
= value_contents_writeable (v
);
2578 memset (unpacked
, 0, TYPE_LENGTH (type
));
2582 if (staging
.size () == TYPE_LENGTH (type
))
2584 /* Small short-cut: If we've unpacked the data into a buffer
2585 of the same size as TYPE's length, then we can reuse that,
2586 instead of doing the unpacking again. */
2587 memcpy (unpacked
, staging
.data (), staging
.size ());
2590 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2591 unpacked
, TYPE_LENGTH (type
),
2592 is_big_endian
, has_negatives (type
), is_scalar
);
2597 /* Store the contents of FROMVAL into the location of TOVAL.
2598 Return a new value with the location of TOVAL and contents of
2599 FROMVAL. Handles assignment into packed fields that have
2600 floating-point or non-scalar types. */
2602 static struct value
*
2603 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2605 struct type
*type
= value_type (toval
);
2606 int bits
= value_bitsize (toval
);
2608 toval
= ada_coerce_ref (toval
);
2609 fromval
= ada_coerce_ref (fromval
);
2611 if (ada_is_direct_array_type (value_type (toval
)))
2612 toval
= ada_coerce_to_simple_array (toval
);
2613 if (ada_is_direct_array_type (value_type (fromval
)))
2614 fromval
= ada_coerce_to_simple_array (fromval
);
2616 if (!deprecated_value_modifiable (toval
))
2617 error (_("Left operand of assignment is not a modifiable lvalue."));
2619 if (VALUE_LVAL (toval
) == lval_memory
2621 && (type
->code () == TYPE_CODE_FLT
2622 || type
->code () == TYPE_CODE_STRUCT
))
2624 int len
= (value_bitpos (toval
)
2625 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2627 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2629 CORE_ADDR to_addr
= value_address (toval
);
2631 if (type
->code () == TYPE_CODE_FLT
)
2632 fromval
= value_cast (type
, fromval
);
2634 read_memory (to_addr
, buffer
, len
);
2635 from_size
= value_bitsize (fromval
);
2637 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2639 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2640 ULONGEST from_offset
= 0;
2641 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2642 from_offset
= from_size
- bits
;
2643 copy_bitwise (buffer
, value_bitpos (toval
),
2644 value_contents (fromval
), from_offset
,
2645 bits
, is_big_endian
);
2646 write_memory_with_notification (to_addr
, buffer
, len
);
2648 val
= value_copy (toval
);
2649 memcpy (value_contents_raw (val
), value_contents (fromval
),
2650 TYPE_LENGTH (type
));
2651 deprecated_set_value_type (val
, type
);
2656 return value_assign (toval
, fromval
);
2660 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2661 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2662 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2663 COMPONENT, and not the inferior's memory. The current contents
2664 of COMPONENT are ignored.
2666 Although not part of the initial design, this function also works
2667 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2668 had a null address, and COMPONENT had an address which is equal to
2669 its offset inside CONTAINER. */
2672 value_assign_to_component (struct value
*container
, struct value
*component
,
2675 LONGEST offset_in_container
=
2676 (LONGEST
) (value_address (component
) - value_address (container
));
2677 int bit_offset_in_container
=
2678 value_bitpos (component
) - value_bitpos (container
);
2681 val
= value_cast (value_type (component
), val
);
2683 if (value_bitsize (component
) == 0)
2684 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2686 bits
= value_bitsize (component
);
2688 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2692 if (is_scalar_type (check_typedef (value_type (component
))))
2694 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2697 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2698 value_bitpos (container
) + bit_offset_in_container
,
2699 value_contents (val
), src_offset
, bits
, 1);
2702 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2703 value_bitpos (container
) + bit_offset_in_container
,
2704 value_contents (val
), 0, bits
, 0);
2707 /* Determine if TYPE is an access to an unconstrained array. */
2710 ada_is_access_to_unconstrained_array (struct type
*type
)
2712 return (type
->code () == TYPE_CODE_TYPEDEF
2713 && is_thick_pntr (ada_typedef_target_type (type
)));
2716 /* The value of the element of array ARR at the ARITY indices given in IND.
2717 ARR may be either a simple array, GNAT array descriptor, or pointer
2721 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2725 struct type
*elt_type
;
2727 elt
= ada_coerce_to_simple_array (arr
);
2729 elt_type
= ada_check_typedef (value_type (elt
));
2730 if (elt_type
->code () == TYPE_CODE_ARRAY
2731 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2732 return value_subscript_packed (elt
, arity
, ind
);
2734 for (k
= 0; k
< arity
; k
+= 1)
2736 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2738 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2739 error (_("too many subscripts (%d expected)"), k
);
2741 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2743 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2744 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2746 /* The element is a typedef to an unconstrained array,
2747 except that the value_subscript call stripped the
2748 typedef layer. The typedef layer is GNAT's way to
2749 specify that the element is, at the source level, an
2750 access to the unconstrained array, rather than the
2751 unconstrained array. So, we need to restore that
2752 typedef layer, which we can do by forcing the element's
2753 type back to its original type. Otherwise, the returned
2754 value is going to be printed as the array, rather
2755 than as an access. Another symptom of the same issue
2756 would be that an expression trying to dereference the
2757 element would also be improperly rejected. */
2758 deprecated_set_value_type (elt
, saved_elt_type
);
2761 elt_type
= ada_check_typedef (value_type (elt
));
2767 /* Assuming ARR is a pointer to a GDB array, the value of the element
2768 of *ARR at the ARITY indices given in IND.
2769 Does not read the entire array into memory.
2771 Note: Unlike what one would expect, this function is used instead of
2772 ada_value_subscript for basically all non-packed array types. The reason
2773 for this is that a side effect of doing our own pointer arithmetics instead
2774 of relying on value_subscript is that there is no implicit typedef peeling.
2775 This is important for arrays of array accesses, where it allows us to
2776 preserve the fact that the array's element is an array access, where the
2777 access part os encoded in a typedef layer. */
2779 static struct value
*
2780 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2783 struct value
*array_ind
= ada_value_ind (arr
);
2785 = check_typedef (value_enclosing_type (array_ind
));
2787 if (type
->code () == TYPE_CODE_ARRAY
2788 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2789 return value_subscript_packed (array_ind
, arity
, ind
);
2791 for (k
= 0; k
< arity
; k
+= 1)
2795 if (type
->code () != TYPE_CODE_ARRAY
)
2796 error (_("too many subscripts (%d expected)"), k
);
2797 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2799 get_discrete_bounds (type
->index_type (), &lwb
, &upb
);
2800 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2801 type
= TYPE_TARGET_TYPE (type
);
2804 return value_ind (arr
);
2807 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2808 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2809 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2810 this array is LOW, as per Ada rules. */
2811 static struct value
*
2812 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2815 struct type
*type0
= ada_check_typedef (type
);
2816 struct type
*base_index_type
= TYPE_TARGET_TYPE (type0
->index_type ());
2817 struct type
*index_type
2818 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2819 struct type
*slice_type
= create_array_type_with_stride
2820 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2821 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2822 TYPE_FIELD_BITSIZE (type0
, 0));
2823 int base_low
= ada_discrete_type_low_bound (type0
->index_type ());
2824 gdb::optional
<LONGEST
> base_low_pos
, low_pos
;
2827 low_pos
= discrete_position (base_index_type
, low
);
2828 base_low_pos
= discrete_position (base_index_type
, base_low
);
2830 if (!low_pos
.has_value () || !base_low_pos
.has_value ())
2832 warning (_("unable to get positions in slice, use bounds instead"));
2834 base_low_pos
= base_low
;
2837 ULONGEST stride
= TYPE_FIELD_BITSIZE (slice_type
, 0) / 8;
2839 stride
= TYPE_LENGTH (TYPE_TARGET_TYPE (type0
));
2841 base
= value_as_address (array_ptr
) + (*low_pos
- *base_low_pos
) * stride
;
2842 return value_at_lazy (slice_type
, base
);
2846 static struct value
*
2847 ada_value_slice (struct value
*array
, int low
, int high
)
2849 struct type
*type
= ada_check_typedef (value_type (array
));
2850 struct type
*base_index_type
= TYPE_TARGET_TYPE (type
->index_type ());
2851 struct type
*index_type
2852 = create_static_range_type (NULL
, type
->index_type (), low
, high
);
2853 struct type
*slice_type
= create_array_type_with_stride
2854 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2855 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2856 TYPE_FIELD_BITSIZE (type
, 0));
2857 gdb::optional
<LONGEST
> low_pos
, high_pos
;
2860 low_pos
= discrete_position (base_index_type
, low
);
2861 high_pos
= discrete_position (base_index_type
, high
);
2863 if (!low_pos
.has_value () || !high_pos
.has_value ())
2865 warning (_("unable to get positions in slice, use bounds instead"));
2870 return value_cast (slice_type
,
2871 value_slice (array
, low
, *high_pos
- *low_pos
+ 1));
2874 /* If type is a record type in the form of a standard GNAT array
2875 descriptor, returns the number of dimensions for type. If arr is a
2876 simple array, returns the number of "array of"s that prefix its
2877 type designation. Otherwise, returns 0. */
2880 ada_array_arity (struct type
*type
)
2887 type
= desc_base_type (type
);
2890 if (type
->code () == TYPE_CODE_STRUCT
)
2891 return desc_arity (desc_bounds_type (type
));
2893 while (type
->code () == TYPE_CODE_ARRAY
)
2896 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2902 /* If TYPE is a record type in the form of a standard GNAT array
2903 descriptor or a simple array type, returns the element type for
2904 TYPE after indexing by NINDICES indices, or by all indices if
2905 NINDICES is -1. Otherwise, returns NULL. */
2908 ada_array_element_type (struct type
*type
, int nindices
)
2910 type
= desc_base_type (type
);
2912 if (type
->code () == TYPE_CODE_STRUCT
)
2915 struct type
*p_array_type
;
2917 p_array_type
= desc_data_target_type (type
);
2919 k
= ada_array_arity (type
);
2923 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2924 if (nindices
>= 0 && k
> nindices
)
2926 while (k
> 0 && p_array_type
!= NULL
)
2928 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2931 return p_array_type
;
2933 else if (type
->code () == TYPE_CODE_ARRAY
)
2935 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2937 type
= TYPE_TARGET_TYPE (type
);
2946 /* The type of nth index in arrays of given type (n numbering from 1).
2947 Does not examine memory. Throws an error if N is invalid or TYPE
2948 is not an array type. NAME is the name of the Ada attribute being
2949 evaluated ('range, 'first, 'last, or 'length); it is used in building
2950 the error message. */
2952 static struct type
*
2953 ada_index_type (struct type
*type
, int n
, const char *name
)
2955 struct type
*result_type
;
2957 type
= desc_base_type (type
);
2959 if (n
< 0 || n
> ada_array_arity (type
))
2960 error (_("invalid dimension number to '%s"), name
);
2962 if (ada_is_simple_array_type (type
))
2966 for (i
= 1; i
< n
; i
+= 1)
2967 type
= TYPE_TARGET_TYPE (type
);
2968 result_type
= TYPE_TARGET_TYPE (type
->index_type ());
2969 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2970 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2971 perhaps stabsread.c would make more sense. */
2972 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2977 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2978 if (result_type
== NULL
)
2979 error (_("attempt to take bound of something that is not an array"));
2985 /* Given that arr is an array type, returns the lower bound of the
2986 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2987 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2988 array-descriptor type. It works for other arrays with bounds supplied
2989 by run-time quantities other than discriminants. */
2992 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2994 struct type
*type
, *index_type_desc
, *index_type
;
2997 gdb_assert (which
== 0 || which
== 1);
2999 if (ada_is_constrained_packed_array_type (arr_type
))
3000 arr_type
= decode_constrained_packed_array_type (arr_type
);
3002 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
3003 return (LONGEST
) - which
;
3005 if (arr_type
->code () == TYPE_CODE_PTR
)
3006 type
= TYPE_TARGET_TYPE (arr_type
);
3010 if (type
->is_fixed_instance ())
3012 /* The array has already been fixed, so we do not need to
3013 check the parallel ___XA type again. That encoding has
3014 already been applied, so ignore it now. */
3015 index_type_desc
= NULL
;
3019 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3020 ada_fixup_array_indexes_type (index_type_desc
);
3023 if (index_type_desc
!= NULL
)
3024 index_type
= to_fixed_range_type (index_type_desc
->field (n
- 1).type (),
3028 struct type
*elt_type
= check_typedef (type
);
3030 for (i
= 1; i
< n
; i
++)
3031 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3033 index_type
= elt_type
->index_type ();
3037 (LONGEST
) (which
== 0
3038 ? ada_discrete_type_low_bound (index_type
)
3039 : ada_discrete_type_high_bound (index_type
));
3042 /* Given that arr is an array value, returns the lower bound of the
3043 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3044 WHICH is 1. This routine will also work for arrays with bounds
3045 supplied by run-time quantities other than discriminants. */
3048 ada_array_bound (struct value
*arr
, int n
, int which
)
3050 struct type
*arr_type
;
3052 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3053 arr
= value_ind (arr
);
3054 arr_type
= value_enclosing_type (arr
);
3056 if (ada_is_constrained_packed_array_type (arr_type
))
3057 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3058 else if (ada_is_simple_array_type (arr_type
))
3059 return ada_array_bound_from_type (arr_type
, n
, which
);
3061 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3064 /* Given that arr is an array value, returns the length of the
3065 nth index. This routine will also work for arrays with bounds
3066 supplied by run-time quantities other than discriminants.
3067 Does not work for arrays indexed by enumeration types with representation
3068 clauses at the moment. */
3071 ada_array_length (struct value
*arr
, int n
)
3073 struct type
*arr_type
, *index_type
;
3076 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3077 arr
= value_ind (arr
);
3078 arr_type
= value_enclosing_type (arr
);
3080 if (ada_is_constrained_packed_array_type (arr_type
))
3081 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3083 if (ada_is_simple_array_type (arr_type
))
3085 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3086 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3090 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3091 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3094 arr_type
= check_typedef (arr_type
);
3095 index_type
= ada_index_type (arr_type
, n
, "length");
3096 if (index_type
!= NULL
)
3098 struct type
*base_type
;
3099 if (index_type
->code () == TYPE_CODE_RANGE
)
3100 base_type
= TYPE_TARGET_TYPE (index_type
);
3102 base_type
= index_type
;
3104 low
= pos_atr (value_from_longest (base_type
, low
));
3105 high
= pos_atr (value_from_longest (base_type
, high
));
3107 return high
- low
+ 1;
3110 /* An array whose type is that of ARR_TYPE (an array type), with
3111 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3112 less than LOW, then LOW-1 is used. */
3114 static struct value
*
3115 empty_array (struct type
*arr_type
, int low
, int high
)
3117 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3118 struct type
*index_type
3119 = create_static_range_type
3120 (NULL
, TYPE_TARGET_TYPE (arr_type0
->index_type ()), low
,
3121 high
< low
? low
- 1 : high
);
3122 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3124 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3128 /* Name resolution */
3130 /* The "decoded" name for the user-definable Ada operator corresponding
3134 ada_decoded_op_name (enum exp_opcode op
)
3138 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3140 if (ada_opname_table
[i
].op
== op
)
3141 return ada_opname_table
[i
].decoded
;
3143 error (_("Could not find operator name for opcode"));
3146 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3147 in a listing of choices during disambiguation (see sort_choices, below).
3148 The idea is that overloadings of a subprogram name from the
3149 same package should sort in their source order. We settle for ordering
3150 such symbols by their trailing number (__N or $N). */
3153 encoded_ordered_before (const char *N0
, const char *N1
)
3157 else if (N0
== NULL
)
3163 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3165 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3167 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3168 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3173 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3176 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3178 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3179 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3181 return (strcmp (N0
, N1
) < 0);
3185 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3189 sort_choices (struct block_symbol syms
[], int nsyms
)
3193 for (i
= 1; i
< nsyms
; i
+= 1)
3195 struct block_symbol sym
= syms
[i
];
3198 for (j
= i
- 1; j
>= 0; j
-= 1)
3200 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3201 sym
.symbol
->linkage_name ()))
3203 syms
[j
+ 1] = syms
[j
];
3209 /* Whether GDB should display formals and return types for functions in the
3210 overloads selection menu. */
3211 static bool print_signatures
= true;
3213 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3214 all but functions, the signature is just the name of the symbol. For
3215 functions, this is the name of the function, the list of types for formals
3216 and the return type (if any). */
3219 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3220 const struct type_print_options
*flags
)
3222 struct type
*type
= SYMBOL_TYPE (sym
);
3224 fprintf_filtered (stream
, "%s", sym
->print_name ());
3225 if (!print_signatures
3227 || type
->code () != TYPE_CODE_FUNC
)
3230 if (type
->num_fields () > 0)
3234 fprintf_filtered (stream
, " (");
3235 for (i
= 0; i
< type
->num_fields (); ++i
)
3238 fprintf_filtered (stream
, "; ");
3239 ada_print_type (type
->field (i
).type (), NULL
, stream
, -1, 0,
3242 fprintf_filtered (stream
, ")");
3244 if (TYPE_TARGET_TYPE (type
) != NULL
3245 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3247 fprintf_filtered (stream
, " return ");
3248 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3252 /* Read and validate a set of numeric choices from the user in the
3253 range 0 .. N_CHOICES-1. Place the results in increasing
3254 order in CHOICES[0 .. N-1], and return N.
3256 The user types choices as a sequence of numbers on one line
3257 separated by blanks, encoding them as follows:
3259 + A choice of 0 means to cancel the selection, throwing an error.
3260 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3261 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3263 The user is not allowed to choose more than MAX_RESULTS values.
3265 ANNOTATION_SUFFIX, if present, is used to annotate the input
3266 prompts (for use with the -f switch). */
3269 get_selections (int *choices
, int n_choices
, int max_results
,
3270 int is_all_choice
, const char *annotation_suffix
)
3275 int first_choice
= is_all_choice
? 2 : 1;
3277 prompt
= getenv ("PS2");
3281 args
= command_line_input (prompt
, annotation_suffix
);
3284 error_no_arg (_("one or more choice numbers"));
3288 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3289 order, as given in args. Choices are validated. */
3295 args
= skip_spaces (args
);
3296 if (*args
== '\0' && n_chosen
== 0)
3297 error_no_arg (_("one or more choice numbers"));
3298 else if (*args
== '\0')
3301 choice
= strtol (args
, &args2
, 10);
3302 if (args
== args2
|| choice
< 0
3303 || choice
> n_choices
+ first_choice
- 1)
3304 error (_("Argument must be choice number"));
3308 error (_("cancelled"));
3310 if (choice
< first_choice
)
3312 n_chosen
= n_choices
;
3313 for (j
= 0; j
< n_choices
; j
+= 1)
3317 choice
-= first_choice
;
3319 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3323 if (j
< 0 || choice
!= choices
[j
])
3327 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3328 choices
[k
+ 1] = choices
[k
];
3329 choices
[j
+ 1] = choice
;
3334 if (n_chosen
> max_results
)
3335 error (_("Select no more than %d of the above"), max_results
);
3340 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3341 by asking the user (if necessary), returning the number selected,
3342 and setting the first elements of SYMS items. Error if no symbols
3345 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3346 to be re-integrated one of these days. */
3349 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3352 int *chosen
= XALLOCAVEC (int , nsyms
);
3354 int first_choice
= (max_results
== 1) ? 1 : 2;
3355 const char *select_mode
= multiple_symbols_select_mode ();
3357 if (max_results
< 1)
3358 error (_("Request to select 0 symbols!"));
3362 if (select_mode
== multiple_symbols_cancel
)
3364 canceled because the command is ambiguous\n\
3365 See set/show multiple-symbol."));
3367 /* If select_mode is "all", then return all possible symbols.
3368 Only do that if more than one symbol can be selected, of course.
3369 Otherwise, display the menu as usual. */
3370 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3373 printf_filtered (_("[0] cancel\n"));
3374 if (max_results
> 1)
3375 printf_filtered (_("[1] all\n"));
3377 sort_choices (syms
, nsyms
);
3379 for (i
= 0; i
< nsyms
; i
+= 1)
3381 if (syms
[i
].symbol
== NULL
)
3384 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3386 struct symtab_and_line sal
=
3387 find_function_start_sal (syms
[i
].symbol
, 1);
3389 printf_filtered ("[%d] ", i
+ first_choice
);
3390 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3391 &type_print_raw_options
);
3392 if (sal
.symtab
== NULL
)
3393 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3394 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3398 styled_string (file_name_style
.style (),
3399 symtab_to_filename_for_display (sal
.symtab
)),
3406 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3407 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3408 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3409 struct symtab
*symtab
= NULL
;
3411 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3412 symtab
= symbol_symtab (syms
[i
].symbol
);
3414 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3416 printf_filtered ("[%d] ", i
+ first_choice
);
3417 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3418 &type_print_raw_options
);
3419 printf_filtered (_(" at %s:%d\n"),
3420 symtab_to_filename_for_display (symtab
),
3421 SYMBOL_LINE (syms
[i
].symbol
));
3423 else if (is_enumeral
3424 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3426 printf_filtered (("[%d] "), i
+ first_choice
);
3427 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3428 gdb_stdout
, -1, 0, &type_print_raw_options
);
3429 printf_filtered (_("'(%s) (enumeral)\n"),
3430 syms
[i
].symbol
->print_name ());
3434 printf_filtered ("[%d] ", i
+ first_choice
);
3435 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3436 &type_print_raw_options
);
3439 printf_filtered (is_enumeral
3440 ? _(" in %s (enumeral)\n")
3442 symtab_to_filename_for_display (symtab
));
3444 printf_filtered (is_enumeral
3445 ? _(" (enumeral)\n")
3451 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3454 for (i
= 0; i
< n_chosen
; i
+= 1)
3455 syms
[i
] = syms
[chosen
[i
]];
3460 /* Resolve the operator of the subexpression beginning at
3461 position *POS of *EXPP. "Resolving" consists of replacing
3462 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3463 with their resolutions, replacing built-in operators with
3464 function calls to user-defined operators, where appropriate, and,
3465 when DEPROCEDURE_P is non-zero, converting function-valued variables
3466 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3467 are as in ada_resolve, above. */
3469 static struct value
*
3470 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3471 struct type
*context_type
, int parse_completion
,
3472 innermost_block_tracker
*tracker
)
3476 struct expression
*exp
; /* Convenience: == *expp. */
3477 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3478 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3479 int nargs
; /* Number of operands. */
3481 /* If we're resolving an expression like ARRAY(ARG...), then we set
3482 this to the type of the array, so we can use the index types as
3483 the expected types for resolution. */
3484 struct type
*array_type
= nullptr;
3485 /* The arity of ARRAY_TYPE. */
3486 int array_arity
= 0;
3492 /* Pass one: resolve operands, saving their types and updating *pos,
3497 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3498 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3503 struct value
*lhs
= resolve_subexp (expp
, pos
, 0, NULL
,
3504 parse_completion
, tracker
);
3505 struct type
*lhstype
= ada_check_typedef (value_type (lhs
));
3506 array_arity
= ada_array_arity (lhstype
);
3507 if (array_arity
> 0)
3508 array_type
= lhstype
;
3510 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3515 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3520 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3521 parse_completion
, tracker
);
3524 case OP_ATR_MODULUS
:
3534 case TERNOP_IN_RANGE
:
3535 case BINOP_IN_BOUNDS
:
3541 case OP_DISCRETE_RANGE
:
3543 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3552 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3554 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3556 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3574 case BINOP_LOGICAL_AND
:
3575 case BINOP_LOGICAL_OR
:
3576 case BINOP_BITWISE_AND
:
3577 case BINOP_BITWISE_IOR
:
3578 case BINOP_BITWISE_XOR
:
3581 case BINOP_NOTEQUAL
:
3588 case BINOP_SUBSCRIPT
:
3596 case UNOP_LOGICAL_NOT
:
3606 case OP_VAR_MSYM_VALUE
:
3613 case OP_INTERNALVAR
:
3623 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3626 case STRUCTOP_STRUCT
:
3627 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3640 error (_("Unexpected operator during name resolution"));
3643 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3644 for (i
= 0; i
< nargs
; i
+= 1)
3646 struct type
*subtype
= nullptr;
3647 if (i
< array_arity
)
3648 subtype
= ada_index_type (array_type
, i
+ 1, "array type");
3649 argvec
[i
] = resolve_subexp (expp
, pos
, 1, subtype
, parse_completion
,
3655 /* Pass two: perform any resolution on principal operator. */
3662 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3664 std::vector
<struct block_symbol
> candidates
;
3668 ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3669 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3672 if (n_candidates
> 1)
3674 /* Types tend to get re-introduced locally, so if there
3675 are any local symbols that are not types, first filter
3678 for (j
= 0; j
< n_candidates
; j
+= 1)
3679 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3684 case LOC_REGPARM_ADDR
:
3692 if (j
< n_candidates
)
3695 while (j
< n_candidates
)
3697 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3699 candidates
[j
] = candidates
[n_candidates
- 1];
3708 if (n_candidates
== 0)
3709 error (_("No definition found for %s"),
3710 exp
->elts
[pc
+ 2].symbol
->print_name ());
3711 else if (n_candidates
== 1)
3713 else if (deprocedure_p
3714 && !is_nonfunction (candidates
.data (), n_candidates
))
3716 i
= ada_resolve_function
3717 (candidates
.data (), n_candidates
, NULL
, 0,
3718 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3719 context_type
, parse_completion
);
3721 error (_("Could not find a match for %s"),
3722 exp
->elts
[pc
+ 2].symbol
->print_name ());
3726 printf_filtered (_("Multiple matches for %s\n"),
3727 exp
->elts
[pc
+ 2].symbol
->print_name ());
3728 user_select_syms (candidates
.data (), n_candidates
, 1);
3732 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3733 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3734 tracker
->update (candidates
[i
]);
3738 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3741 replace_operator_with_call (expp
, pc
, 0, 4,
3742 exp
->elts
[pc
+ 2].symbol
,
3743 exp
->elts
[pc
+ 1].block
);
3750 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3751 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3753 std::vector
<struct block_symbol
> candidates
;
3757 ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3758 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3761 if (n_candidates
== 1)
3765 i
= ada_resolve_function
3766 (candidates
.data (), n_candidates
,
3768 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3769 context_type
, parse_completion
);
3771 error (_("Could not find a match for %s"),
3772 exp
->elts
[pc
+ 5].symbol
->print_name ());
3775 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3776 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3777 tracker
->update (candidates
[i
]);
3788 case BINOP_BITWISE_AND
:
3789 case BINOP_BITWISE_IOR
:
3790 case BINOP_BITWISE_XOR
:
3792 case BINOP_NOTEQUAL
:
3800 case UNOP_LOGICAL_NOT
:
3802 if (possible_user_operator_p (op
, argvec
))
3804 std::vector
<struct block_symbol
> candidates
;
3808 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3812 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3813 nargs
, ada_decoded_op_name (op
), NULL
,
3818 replace_operator_with_call (expp
, pc
, nargs
, 1,
3819 candidates
[i
].symbol
,
3820 candidates
[i
].block
);
3831 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3832 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3833 exp
->elts
[pc
+ 1].objfile
,
3834 exp
->elts
[pc
+ 2].msymbol
);
3836 return evaluate_subexp_type (exp
, pos
);
3839 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3840 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3842 /* The term "match" here is rather loose. The match is heuristic and
3846 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3848 ftype
= ada_check_typedef (ftype
);
3849 atype
= ada_check_typedef (atype
);
3851 if (ftype
->code () == TYPE_CODE_REF
)
3852 ftype
= TYPE_TARGET_TYPE (ftype
);
3853 if (atype
->code () == TYPE_CODE_REF
)
3854 atype
= TYPE_TARGET_TYPE (atype
);
3856 switch (ftype
->code ())
3859 return ftype
->code () == atype
->code ();
3861 if (atype
->code () == TYPE_CODE_PTR
)
3862 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3863 TYPE_TARGET_TYPE (atype
), 0);
3866 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3868 case TYPE_CODE_ENUM
:
3869 case TYPE_CODE_RANGE
:
3870 switch (atype
->code ())
3873 case TYPE_CODE_ENUM
:
3874 case TYPE_CODE_RANGE
:
3880 case TYPE_CODE_ARRAY
:
3881 return (atype
->code () == TYPE_CODE_ARRAY
3882 || ada_is_array_descriptor_type (atype
));
3884 case TYPE_CODE_STRUCT
:
3885 if (ada_is_array_descriptor_type (ftype
))
3886 return (atype
->code () == TYPE_CODE_ARRAY
3887 || ada_is_array_descriptor_type (atype
));
3889 return (atype
->code () == TYPE_CODE_STRUCT
3890 && !ada_is_array_descriptor_type (atype
));
3892 case TYPE_CODE_UNION
:
3894 return (atype
->code () == ftype
->code ());
3898 /* Return non-zero if the formals of FUNC "sufficiently match" the
3899 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3900 may also be an enumeral, in which case it is treated as a 0-
3901 argument function. */
3904 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3907 struct type
*func_type
= SYMBOL_TYPE (func
);
3909 if (SYMBOL_CLASS (func
) == LOC_CONST
3910 && func_type
->code () == TYPE_CODE_ENUM
)
3911 return (n_actuals
== 0);
3912 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3915 if (func_type
->num_fields () != n_actuals
)
3918 for (i
= 0; i
< n_actuals
; i
+= 1)
3920 if (actuals
[i
] == NULL
)
3924 struct type
*ftype
= ada_check_typedef (func_type
->field (i
).type ());
3925 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3927 if (!ada_type_match (ftype
, atype
, 1))
3934 /* False iff function type FUNC_TYPE definitely does not produce a value
3935 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3936 FUNC_TYPE is not a valid function type with a non-null return type
3937 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3940 return_match (struct type
*func_type
, struct type
*context_type
)
3942 struct type
*return_type
;
3944 if (func_type
== NULL
)
3947 if (func_type
->code () == TYPE_CODE_FUNC
)
3948 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3950 return_type
= get_base_type (func_type
);
3951 if (return_type
== NULL
)
3954 context_type
= get_base_type (context_type
);
3956 if (return_type
->code () == TYPE_CODE_ENUM
)
3957 return context_type
== NULL
|| return_type
== context_type
;
3958 else if (context_type
== NULL
)
3959 return return_type
->code () != TYPE_CODE_VOID
;
3961 return return_type
->code () == context_type
->code ();
3965 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3966 function (if any) that matches the types of the NARGS arguments in
3967 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3968 that returns that type, then eliminate matches that don't. If
3969 CONTEXT_TYPE is void and there is at least one match that does not
3970 return void, eliminate all matches that do.
3972 Asks the user if there is more than one match remaining. Returns -1
3973 if there is no such symbol or none is selected. NAME is used
3974 solely for messages. May re-arrange and modify SYMS in
3975 the process; the index returned is for the modified vector. */
3978 ada_resolve_function (struct block_symbol syms
[],
3979 int nsyms
, struct value
**args
, int nargs
,
3980 const char *name
, struct type
*context_type
,
3981 int parse_completion
)
3985 int m
; /* Number of hits */
3988 /* In the first pass of the loop, we only accept functions matching
3989 context_type. If none are found, we add a second pass of the loop
3990 where every function is accepted. */
3991 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3993 for (k
= 0; k
< nsyms
; k
+= 1)
3995 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3997 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3998 && (fallback
|| return_match (type
, context_type
)))
4006 /* If we got multiple matches, ask the user which one to use. Don't do this
4007 interactive thing during completion, though, as the purpose of the
4008 completion is providing a list of all possible matches. Prompting the
4009 user to filter it down would be completely unexpected in this case. */
4012 else if (m
> 1 && !parse_completion
)
4014 printf_filtered (_("Multiple matches for %s\n"), name
);
4015 user_select_syms (syms
, m
, 1);
4021 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4022 on the function identified by SYM and BLOCK, and taking NARGS
4023 arguments. Update *EXPP as needed to hold more space. */
4026 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4027 int oplen
, struct symbol
*sym
,
4028 const struct block
*block
)
4030 /* We want to add 6 more elements (3 for funcall, 4 for function
4031 symbol, -OPLEN for operator being replaced) to the
4033 struct expression
*exp
= expp
->get ();
4034 int save_nelts
= exp
->nelts
;
4035 int extra_elts
= 7 - oplen
;
4036 exp
->nelts
+= extra_elts
;
4039 exp
->resize (exp
->nelts
);
4040 memmove (exp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4041 EXP_ELEM_TO_BYTES (save_nelts
- pc
- oplen
));
4043 exp
->resize (exp
->nelts
);
4045 exp
->elts
[pc
].opcode
= exp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4046 exp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4048 exp
->elts
[pc
+ 3].opcode
= exp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4049 exp
->elts
[pc
+ 4].block
= block
;
4050 exp
->elts
[pc
+ 5].symbol
= sym
;
4053 /* Type-class predicates */
4055 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4059 numeric_type_p (struct type
*type
)
4065 switch (type
->code ())
4070 case TYPE_CODE_RANGE
:
4071 return (type
== TYPE_TARGET_TYPE (type
)
4072 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4079 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4082 integer_type_p (struct type
*type
)
4088 switch (type
->code ())
4092 case TYPE_CODE_RANGE
:
4093 return (type
== TYPE_TARGET_TYPE (type
)
4094 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4101 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4104 scalar_type_p (struct type
*type
)
4110 switch (type
->code ())
4113 case TYPE_CODE_RANGE
:
4114 case TYPE_CODE_ENUM
:
4123 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4126 discrete_type_p (struct type
*type
)
4132 switch (type
->code ())
4135 case TYPE_CODE_RANGE
:
4136 case TYPE_CODE_ENUM
:
4137 case TYPE_CODE_BOOL
:
4145 /* Returns non-zero if OP with operands in the vector ARGS could be
4146 a user-defined function. Errs on the side of pre-defined operators
4147 (i.e., result 0). */
4150 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4152 struct type
*type0
=
4153 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4154 struct type
*type1
=
4155 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4169 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4173 case BINOP_BITWISE_AND
:
4174 case BINOP_BITWISE_IOR
:
4175 case BINOP_BITWISE_XOR
:
4176 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4179 case BINOP_NOTEQUAL
:
4184 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4187 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4190 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4194 case UNOP_LOGICAL_NOT
:
4196 return (!numeric_type_p (type0
));
4205 1. In the following, we assume that a renaming type's name may
4206 have an ___XD suffix. It would be nice if this went away at some
4208 2. We handle both the (old) purely type-based representation of
4209 renamings and the (new) variable-based encoding. At some point,
4210 it is devoutly to be hoped that the former goes away
4211 (FIXME: hilfinger-2007-07-09).
4212 3. Subprogram renamings are not implemented, although the XRS
4213 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4215 /* If SYM encodes a renaming,
4217 <renaming> renames <renamed entity>,
4219 sets *LEN to the length of the renamed entity's name,
4220 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4221 the string describing the subcomponent selected from the renamed
4222 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4223 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4224 are undefined). Otherwise, returns a value indicating the category
4225 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4226 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4227 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4228 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4229 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4230 may be NULL, in which case they are not assigned.
4232 [Currently, however, GCC does not generate subprogram renamings.] */
4234 enum ada_renaming_category
4235 ada_parse_renaming (struct symbol
*sym
,
4236 const char **renamed_entity
, int *len
,
4237 const char **renaming_expr
)
4239 enum ada_renaming_category kind
;
4244 return ADA_NOT_RENAMING
;
4245 switch (SYMBOL_CLASS (sym
))
4248 return ADA_NOT_RENAMING
;
4252 case LOC_OPTIMIZED_OUT
:
4253 info
= strstr (sym
->linkage_name (), "___XR");
4255 return ADA_NOT_RENAMING
;
4259 kind
= ADA_OBJECT_RENAMING
;
4263 kind
= ADA_EXCEPTION_RENAMING
;
4267 kind
= ADA_PACKAGE_RENAMING
;
4271 kind
= ADA_SUBPROGRAM_RENAMING
;
4275 return ADA_NOT_RENAMING
;
4279 if (renamed_entity
!= NULL
)
4280 *renamed_entity
= info
;
4281 suffix
= strstr (info
, "___XE");
4282 if (suffix
== NULL
|| suffix
== info
)
4283 return ADA_NOT_RENAMING
;
4285 *len
= strlen (info
) - strlen (suffix
);
4287 if (renaming_expr
!= NULL
)
4288 *renaming_expr
= suffix
;
4292 /* Compute the value of the given RENAMING_SYM, which is expected to
4293 be a symbol encoding a renaming expression. BLOCK is the block
4294 used to evaluate the renaming. */
4296 static struct value
*
4297 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4298 const struct block
*block
)
4300 const char *sym_name
;
4302 sym_name
= renaming_sym
->linkage_name ();
4303 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4304 return evaluate_expression (expr
.get ());
4308 /* Evaluation: Function Calls */
4310 /* Return an lvalue containing the value VAL. This is the identity on
4311 lvalues, and otherwise has the side-effect of allocating memory
4312 in the inferior where a copy of the value contents is copied. */
4314 static struct value
*
4315 ensure_lval (struct value
*val
)
4317 if (VALUE_LVAL (val
) == not_lval
4318 || VALUE_LVAL (val
) == lval_internalvar
)
4320 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4321 const CORE_ADDR addr
=
4322 value_as_long (value_allocate_space_in_inferior (len
));
4324 VALUE_LVAL (val
) = lval_memory
;
4325 set_value_address (val
, addr
);
4326 write_memory (addr
, value_contents (val
), len
);
4332 /* Given ARG, a value of type (pointer or reference to a)*
4333 structure/union, extract the component named NAME from the ultimate
4334 target structure/union and return it as a value with its
4337 The routine searches for NAME among all members of the structure itself
4338 and (recursively) among all members of any wrapper members
4341 If NO_ERR, then simply return NULL in case of error, rather than
4344 static struct value
*
4345 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4347 struct type
*t
, *t1
;
4352 t1
= t
= ada_check_typedef (value_type (arg
));
4353 if (t
->code () == TYPE_CODE_REF
)
4355 t1
= TYPE_TARGET_TYPE (t
);
4358 t1
= ada_check_typedef (t1
);
4359 if (t1
->code () == TYPE_CODE_PTR
)
4361 arg
= coerce_ref (arg
);
4366 while (t
->code () == TYPE_CODE_PTR
)
4368 t1
= TYPE_TARGET_TYPE (t
);
4371 t1
= ada_check_typedef (t1
);
4372 if (t1
->code () == TYPE_CODE_PTR
)
4374 arg
= value_ind (arg
);
4381 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4385 v
= ada_search_struct_field (name
, arg
, 0, t
);
4388 int bit_offset
, bit_size
, byte_offset
;
4389 struct type
*field_type
;
4392 if (t
->code () == TYPE_CODE_PTR
)
4393 address
= value_address (ada_value_ind (arg
));
4395 address
= value_address (ada_coerce_ref (arg
));
4397 /* Check to see if this is a tagged type. We also need to handle
4398 the case where the type is a reference to a tagged type, but
4399 we have to be careful to exclude pointers to tagged types.
4400 The latter should be shown as usual (as a pointer), whereas
4401 a reference should mostly be transparent to the user. */
4403 if (ada_is_tagged_type (t1
, 0)
4404 || (t1
->code () == TYPE_CODE_REF
4405 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4407 /* We first try to find the searched field in the current type.
4408 If not found then let's look in the fixed type. */
4410 if (!find_struct_field (name
, t1
, 0,
4411 &field_type
, &byte_offset
, &bit_offset
,
4420 /* Convert to fixed type in all cases, so that we have proper
4421 offsets to each field in unconstrained record types. */
4422 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4423 address
, NULL
, check_tag
);
4425 /* Resolve the dynamic type as well. */
4426 arg
= value_from_contents_and_address (t1
, nullptr, address
);
4427 t1
= value_type (arg
);
4429 if (find_struct_field (name
, t1
, 0,
4430 &field_type
, &byte_offset
, &bit_offset
,
4435 if (t
->code () == TYPE_CODE_REF
)
4436 arg
= ada_coerce_ref (arg
);
4438 arg
= ada_value_ind (arg
);
4439 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4440 bit_offset
, bit_size
,
4444 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4448 if (v
!= NULL
|| no_err
)
4451 error (_("There is no member named %s."), name
);
4457 error (_("Attempt to extract a component of "
4458 "a value that is not a record."));
4461 /* Return the value ACTUAL, converted to be an appropriate value for a
4462 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4463 allocating any necessary descriptors (fat pointers), or copies of
4464 values not residing in memory, updating it as needed. */
4467 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4469 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4470 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4471 struct type
*formal_target
=
4472 formal_type
->code () == TYPE_CODE_PTR
4473 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4474 struct type
*actual_target
=
4475 actual_type
->code () == TYPE_CODE_PTR
4476 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4478 if (ada_is_array_descriptor_type (formal_target
)
4479 && actual_target
->code () == TYPE_CODE_ARRAY
)
4480 return make_array_descriptor (formal_type
, actual
);
4481 else if (formal_type
->code () == TYPE_CODE_PTR
4482 || formal_type
->code () == TYPE_CODE_REF
)
4484 struct value
*result
;
4486 if (formal_target
->code () == TYPE_CODE_ARRAY
4487 && ada_is_array_descriptor_type (actual_target
))
4488 result
= desc_data (actual
);
4489 else if (formal_type
->code () != TYPE_CODE_PTR
)
4491 if (VALUE_LVAL (actual
) != lval_memory
)
4495 actual_type
= ada_check_typedef (value_type (actual
));
4496 val
= allocate_value (actual_type
);
4497 memcpy ((char *) value_contents_raw (val
),
4498 (char *) value_contents (actual
),
4499 TYPE_LENGTH (actual_type
));
4500 actual
= ensure_lval (val
);
4502 result
= value_addr (actual
);
4506 return value_cast_pointers (formal_type
, result
, 0);
4508 else if (actual_type
->code () == TYPE_CODE_PTR
)
4509 return ada_value_ind (actual
);
4510 else if (ada_is_aligner_type (formal_type
))
4512 /* We need to turn this parameter into an aligner type
4514 struct value
*aligner
= allocate_value (formal_type
);
4515 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4517 value_assign_to_component (aligner
, component
, actual
);
4524 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4525 type TYPE. This is usually an inefficient no-op except on some targets
4526 (such as AVR) where the representation of a pointer and an address
4530 value_pointer (struct value
*value
, struct type
*type
)
4532 unsigned len
= TYPE_LENGTH (type
);
4533 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4536 addr
= value_address (value
);
4537 gdbarch_address_to_pointer (type
->arch (), type
, buf
, addr
);
4538 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4543 /* Push a descriptor of type TYPE for array value ARR on the stack at
4544 *SP, updating *SP to reflect the new descriptor. Return either
4545 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4546 to-descriptor type rather than a descriptor type), a struct value *
4547 representing a pointer to this descriptor. */
4549 static struct value
*
4550 make_array_descriptor (struct type
*type
, struct value
*arr
)
4552 struct type
*bounds_type
= desc_bounds_type (type
);
4553 struct type
*desc_type
= desc_base_type (type
);
4554 struct value
*descriptor
= allocate_value (desc_type
);
4555 struct value
*bounds
= allocate_value (bounds_type
);
4558 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4561 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4562 ada_array_bound (arr
, i
, 0),
4563 desc_bound_bitpos (bounds_type
, i
, 0),
4564 desc_bound_bitsize (bounds_type
, i
, 0));
4565 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4566 ada_array_bound (arr
, i
, 1),
4567 desc_bound_bitpos (bounds_type
, i
, 1),
4568 desc_bound_bitsize (bounds_type
, i
, 1));
4571 bounds
= ensure_lval (bounds
);
4573 modify_field (value_type (descriptor
),
4574 value_contents_writeable (descriptor
),
4575 value_pointer (ensure_lval (arr
),
4576 desc_type
->field (0).type ()),
4577 fat_pntr_data_bitpos (desc_type
),
4578 fat_pntr_data_bitsize (desc_type
));
4580 modify_field (value_type (descriptor
),
4581 value_contents_writeable (descriptor
),
4582 value_pointer (bounds
,
4583 desc_type
->field (1).type ()),
4584 fat_pntr_bounds_bitpos (desc_type
),
4585 fat_pntr_bounds_bitsize (desc_type
));
4587 descriptor
= ensure_lval (descriptor
);
4589 if (type
->code () == TYPE_CODE_PTR
)
4590 return value_addr (descriptor
);
4595 /* Symbol Cache Module */
4597 /* Performance measurements made as of 2010-01-15 indicate that
4598 this cache does bring some noticeable improvements. Depending
4599 on the type of entity being printed, the cache can make it as much
4600 as an order of magnitude faster than without it.
4602 The descriptive type DWARF extension has significantly reduced
4603 the need for this cache, at least when DWARF is being used. However,
4604 even in this case, some expensive name-based symbol searches are still
4605 sometimes necessary - to find an XVZ variable, mostly. */
4607 /* Initialize the contents of SYM_CACHE. */
4610 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4612 obstack_init (&sym_cache
->cache_space
);
4613 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4616 /* Free the memory used by SYM_CACHE. */
4619 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4621 obstack_free (&sym_cache
->cache_space
, NULL
);
4625 /* Return the symbol cache associated to the given program space PSPACE.
4626 If not allocated for this PSPACE yet, allocate and initialize one. */
4628 static struct ada_symbol_cache
*
4629 ada_get_symbol_cache (struct program_space
*pspace
)
4631 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4633 if (pspace_data
->sym_cache
== NULL
)
4635 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4636 ada_init_symbol_cache (pspace_data
->sym_cache
);
4639 return pspace_data
->sym_cache
;
4642 /* Clear all entries from the symbol cache. */
4645 ada_clear_symbol_cache (void)
4647 struct ada_symbol_cache
*sym_cache
4648 = ada_get_symbol_cache (current_program_space
);
4650 obstack_free (&sym_cache
->cache_space
, NULL
);
4651 ada_init_symbol_cache (sym_cache
);
4654 /* Search our cache for an entry matching NAME and DOMAIN.
4655 Return it if found, or NULL otherwise. */
4657 static struct cache_entry
**
4658 find_entry (const char *name
, domain_enum domain
)
4660 struct ada_symbol_cache
*sym_cache
4661 = ada_get_symbol_cache (current_program_space
);
4662 int h
= msymbol_hash (name
) % HASH_SIZE
;
4663 struct cache_entry
**e
;
4665 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4667 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4673 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4674 Return 1 if found, 0 otherwise.
4676 If an entry was found and SYM is not NULL, set *SYM to the entry's
4677 SYM. Same principle for BLOCK if not NULL. */
4680 lookup_cached_symbol (const char *name
, domain_enum domain
,
4681 struct symbol
**sym
, const struct block
**block
)
4683 struct cache_entry
**e
= find_entry (name
, domain
);
4690 *block
= (*e
)->block
;
4694 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4695 in domain DOMAIN, save this result in our symbol cache. */
4698 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4699 const struct block
*block
)
4701 struct ada_symbol_cache
*sym_cache
4702 = ada_get_symbol_cache (current_program_space
);
4704 struct cache_entry
*e
;
4706 /* Symbols for builtin types don't have a block.
4707 For now don't cache such symbols. */
4708 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4711 /* If the symbol is a local symbol, then do not cache it, as a search
4712 for that symbol depends on the context. To determine whether
4713 the symbol is local or not, we check the block where we found it
4714 against the global and static blocks of its associated symtab. */
4716 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4717 GLOBAL_BLOCK
) != block
4718 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4719 STATIC_BLOCK
) != block
)
4722 h
= msymbol_hash (name
) % HASH_SIZE
;
4723 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4724 e
->next
= sym_cache
->root
[h
];
4725 sym_cache
->root
[h
] = e
;
4726 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4734 /* Return the symbol name match type that should be used used when
4735 searching for all symbols matching LOOKUP_NAME.
4737 LOOKUP_NAME is expected to be a symbol name after transformation
4740 static symbol_name_match_type
4741 name_match_type_from_name (const char *lookup_name
)
4743 return (strstr (lookup_name
, "__") == NULL
4744 ? symbol_name_match_type::WILD
4745 : symbol_name_match_type::FULL
);
4748 /* Return the result of a standard (literal, C-like) lookup of NAME in
4749 given DOMAIN, visible from lexical block BLOCK. */
4751 static struct symbol
*
4752 standard_lookup (const char *name
, const struct block
*block
,
4755 /* Initialize it just to avoid a GCC false warning. */
4756 struct block_symbol sym
= {};
4758 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4760 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4761 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4766 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4767 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4768 since they contend in overloading in the same way. */
4770 is_nonfunction (struct block_symbol syms
[], int n
)
4774 for (i
= 0; i
< n
; i
+= 1)
4775 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_FUNC
4776 && (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
4777 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4783 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4784 struct types. Otherwise, they may not. */
4787 equiv_types (struct type
*type0
, struct type
*type1
)
4791 if (type0
== NULL
|| type1
== NULL
4792 || type0
->code () != type1
->code ())
4794 if ((type0
->code () == TYPE_CODE_STRUCT
4795 || type0
->code () == TYPE_CODE_ENUM
)
4796 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4797 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4803 /* True iff SYM0 represents the same entity as SYM1, or one that is
4804 no more defined than that of SYM1. */
4807 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4811 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4812 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4815 switch (SYMBOL_CLASS (sym0
))
4821 struct type
*type0
= SYMBOL_TYPE (sym0
);
4822 struct type
*type1
= SYMBOL_TYPE (sym1
);
4823 const char *name0
= sym0
->linkage_name ();
4824 const char *name1
= sym1
->linkage_name ();
4825 int len0
= strlen (name0
);
4828 type0
->code () == type1
->code ()
4829 && (equiv_types (type0
, type1
)
4830 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4831 && startswith (name1
+ len0
, "___XV")));
4834 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4835 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4839 const char *name0
= sym0
->linkage_name ();
4840 const char *name1
= sym1
->linkage_name ();
4841 return (strcmp (name0
, name1
) == 0
4842 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4850 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4851 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4854 add_defn_to_vec (struct obstack
*obstackp
,
4856 const struct block
*block
)
4859 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4861 /* Do not try to complete stub types, as the debugger is probably
4862 already scanning all symbols matching a certain name at the
4863 time when this function is called. Trying to replace the stub
4864 type by its associated full type will cause us to restart a scan
4865 which may lead to an infinite recursion. Instead, the client
4866 collecting the matching symbols will end up collecting several
4867 matches, with at least one of them complete. It can then filter
4868 out the stub ones if needed. */
4870 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4872 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4874 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4876 prevDefns
[i
].symbol
= sym
;
4877 prevDefns
[i
].block
= block
;
4883 struct block_symbol info
;
4887 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4891 /* Number of block_symbol structures currently collected in current vector in
4895 num_defns_collected (struct obstack
*obstackp
)
4897 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4900 /* Vector of block_symbol structures currently collected in current vector in
4901 OBSTACKP. If FINISH, close off the vector and return its final address. */
4903 static struct block_symbol
*
4904 defns_collected (struct obstack
*obstackp
, int finish
)
4907 return (struct block_symbol
*) obstack_finish (obstackp
);
4909 return (struct block_symbol
*) obstack_base (obstackp
);
4912 /* Return a bound minimal symbol matching NAME according to Ada
4913 decoding rules. Returns an invalid symbol if there is no such
4914 minimal symbol. Names prefixed with "standard__" are handled
4915 specially: "standard__" is first stripped off, and only static and
4916 global symbols are searched. */
4918 struct bound_minimal_symbol
4919 ada_lookup_simple_minsym (const char *name
)
4921 struct bound_minimal_symbol result
;
4923 memset (&result
, 0, sizeof (result
));
4925 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4926 lookup_name_info
lookup_name (name
, match_type
);
4928 symbol_name_matcher_ftype
*match_name
4929 = ada_get_symbol_name_matcher (lookup_name
);
4931 for (objfile
*objfile
: current_program_space
->objfiles ())
4933 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4935 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4936 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4938 result
.minsym
= msymbol
;
4939 result
.objfile
= objfile
;
4948 /* For all subprograms that statically enclose the subprogram of the
4949 selected frame, add symbols matching identifier NAME in DOMAIN
4950 and their blocks to the list of data in OBSTACKP, as for
4951 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4952 with a wildcard prefix. */
4955 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4956 const lookup_name_info
&lookup_name
,
4961 /* True if TYPE is definitely an artificial type supplied to a symbol
4962 for which no debugging information was given in the symbol file. */
4965 is_nondebugging_type (struct type
*type
)
4967 const char *name
= ada_type_name (type
);
4969 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4972 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4973 that are deemed "identical" for practical purposes.
4975 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4976 types and that their number of enumerals is identical (in other
4977 words, type1->num_fields () == type2->num_fields ()). */
4980 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4984 /* The heuristic we use here is fairly conservative. We consider
4985 that 2 enumerate types are identical if they have the same
4986 number of enumerals and that all enumerals have the same
4987 underlying value and name. */
4989 /* All enums in the type should have an identical underlying value. */
4990 for (i
= 0; i
< type1
->num_fields (); i
++)
4991 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4994 /* All enumerals should also have the same name (modulo any numerical
4996 for (i
= 0; i
< type1
->num_fields (); i
++)
4998 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4999 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
5000 int len_1
= strlen (name_1
);
5001 int len_2
= strlen (name_2
);
5003 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
5004 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
5006 || strncmp (TYPE_FIELD_NAME (type1
, i
),
5007 TYPE_FIELD_NAME (type2
, i
),
5015 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
5016 that are deemed "identical" for practical purposes. Sometimes,
5017 enumerals are not strictly identical, but their types are so similar
5018 that they can be considered identical.
5020 For instance, consider the following code:
5022 type Color is (Black, Red, Green, Blue, White);
5023 type RGB_Color is new Color range Red .. Blue;
5025 Type RGB_Color is a subrange of an implicit type which is a copy
5026 of type Color. If we call that implicit type RGB_ColorB ("B" is
5027 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5028 As a result, when an expression references any of the enumeral
5029 by name (Eg. "print green"), the expression is technically
5030 ambiguous and the user should be asked to disambiguate. But
5031 doing so would only hinder the user, since it wouldn't matter
5032 what choice he makes, the outcome would always be the same.
5033 So, for practical purposes, we consider them as the same. */
5036 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
5040 /* Before performing a thorough comparison check of each type,
5041 we perform a series of inexpensive checks. We expect that these
5042 checks will quickly fail in the vast majority of cases, and thus
5043 help prevent the unnecessary use of a more expensive comparison.
5044 Said comparison also expects us to make some of these checks
5045 (see ada_identical_enum_types_p). */
5047 /* Quick check: All symbols should have an enum type. */
5048 for (i
= 0; i
< syms
.size (); i
++)
5049 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
5052 /* Quick check: They should all have the same value. */
5053 for (i
= 1; i
< syms
.size (); i
++)
5054 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5057 /* Quick check: They should all have the same number of enumerals. */
5058 for (i
= 1; i
< syms
.size (); i
++)
5059 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
5060 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
5063 /* All the sanity checks passed, so we might have a set of
5064 identical enumeration types. Perform a more complete
5065 comparison of the type of each symbol. */
5066 for (i
= 1; i
< syms
.size (); i
++)
5067 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5068 SYMBOL_TYPE (syms
[0].symbol
)))
5074 /* Remove any non-debugging symbols in SYMS that definitely
5075 duplicate other symbols in the list (The only case I know of where
5076 this happens is when object files containing stabs-in-ecoff are
5077 linked with files containing ordinary ecoff debugging symbols (or no
5078 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5079 Returns the number of items in the modified list. */
5082 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5086 /* We should never be called with less than 2 symbols, as there
5087 cannot be any extra symbol in that case. But it's easy to
5088 handle, since we have nothing to do in that case. */
5089 if (syms
->size () < 2)
5090 return syms
->size ();
5093 while (i
< syms
->size ())
5097 /* If two symbols have the same name and one of them is a stub type,
5098 the get rid of the stub. */
5100 if (SYMBOL_TYPE ((*syms
)[i
].symbol
)->is_stub ()
5101 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5103 for (j
= 0; j
< syms
->size (); j
++)
5106 && !SYMBOL_TYPE ((*syms
)[j
].symbol
)->is_stub ()
5107 && (*syms
)[j
].symbol
->linkage_name () != NULL
5108 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5109 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5114 /* Two symbols with the same name, same class and same address
5115 should be identical. */
5117 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5118 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5119 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5121 for (j
= 0; j
< syms
->size (); j
+= 1)
5124 && (*syms
)[j
].symbol
->linkage_name () != NULL
5125 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5126 (*syms
)[j
].symbol
->linkage_name ()) == 0
5127 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5128 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5129 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5130 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5136 syms
->erase (syms
->begin () + i
);
5141 /* If all the remaining symbols are identical enumerals, then
5142 just keep the first one and discard the rest.
5144 Unlike what we did previously, we do not discard any entry
5145 unless they are ALL identical. This is because the symbol
5146 comparison is not a strict comparison, but rather a practical
5147 comparison. If all symbols are considered identical, then
5148 we can just go ahead and use the first one and discard the rest.
5149 But if we cannot reduce the list to a single element, we have
5150 to ask the user to disambiguate anyways. And if we have to
5151 present a multiple-choice menu, it's less confusing if the list
5152 isn't missing some choices that were identical and yet distinct. */
5153 if (symbols_are_identical_enums (*syms
))
5156 return syms
->size ();
5159 /* Given a type that corresponds to a renaming entity, use the type name
5160 to extract the scope (package name or function name, fully qualified,
5161 and following the GNAT encoding convention) where this renaming has been
5165 xget_renaming_scope (struct type
*renaming_type
)
5167 /* The renaming types adhere to the following convention:
5168 <scope>__<rename>___<XR extension>.
5169 So, to extract the scope, we search for the "___XR" extension,
5170 and then backtrack until we find the first "__". */
5172 const char *name
= renaming_type
->name ();
5173 const char *suffix
= strstr (name
, "___XR");
5176 /* Now, backtrack a bit until we find the first "__". Start looking
5177 at suffix - 3, as the <rename> part is at least one character long. */
5179 for (last
= suffix
- 3; last
> name
; last
--)
5180 if (last
[0] == '_' && last
[1] == '_')
5183 /* Make a copy of scope and return it. */
5184 return std::string (name
, last
);
5187 /* Return nonzero if NAME corresponds to a package name. */
5190 is_package_name (const char *name
)
5192 /* Here, We take advantage of the fact that no symbols are generated
5193 for packages, while symbols are generated for each function.
5194 So the condition for NAME represent a package becomes equivalent
5195 to NAME not existing in our list of symbols. There is only one
5196 small complication with library-level functions (see below). */
5198 /* If it is a function that has not been defined at library level,
5199 then we should be able to look it up in the symbols. */
5200 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5203 /* Library-level function names start with "_ada_". See if function
5204 "_ada_" followed by NAME can be found. */
5206 /* Do a quick check that NAME does not contain "__", since library-level
5207 functions names cannot contain "__" in them. */
5208 if (strstr (name
, "__") != NULL
)
5211 std::string fun_name
= string_printf ("_ada_%s", name
);
5213 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5216 /* Return nonzero if SYM corresponds to a renaming entity that is
5217 not visible from FUNCTION_NAME. */
5220 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5222 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5225 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5227 /* If the rename has been defined in a package, then it is visible. */
5228 if (is_package_name (scope
.c_str ()))
5231 /* Check that the rename is in the current function scope by checking
5232 that its name starts with SCOPE. */
5234 /* If the function name starts with "_ada_", it means that it is
5235 a library-level function. Strip this prefix before doing the
5236 comparison, as the encoding for the renaming does not contain
5238 if (startswith (function_name
, "_ada_"))
5241 return !startswith (function_name
, scope
.c_str ());
5244 /* Remove entries from SYMS that corresponds to a renaming entity that
5245 is not visible from the function associated with CURRENT_BLOCK or
5246 that is superfluous due to the presence of more specific renaming
5247 information. Places surviving symbols in the initial entries of
5248 SYMS and returns the number of surviving symbols.
5251 First, in cases where an object renaming is implemented as a
5252 reference variable, GNAT may produce both the actual reference
5253 variable and the renaming encoding. In this case, we discard the
5256 Second, GNAT emits a type following a specified encoding for each renaming
5257 entity. Unfortunately, STABS currently does not support the definition
5258 of types that are local to a given lexical block, so all renamings types
5259 are emitted at library level. As a consequence, if an application
5260 contains two renaming entities using the same name, and a user tries to
5261 print the value of one of these entities, the result of the ada symbol
5262 lookup will also contain the wrong renaming type.
5264 This function partially covers for this limitation by attempting to
5265 remove from the SYMS list renaming symbols that should be visible
5266 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5267 method with the current information available. The implementation
5268 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5270 - When the user tries to print a rename in a function while there
5271 is another rename entity defined in a package: Normally, the
5272 rename in the function has precedence over the rename in the
5273 package, so the latter should be removed from the list. This is
5274 currently not the case.
5276 - This function will incorrectly remove valid renames if
5277 the CURRENT_BLOCK corresponds to a function which symbol name
5278 has been changed by an "Export" pragma. As a consequence,
5279 the user will be unable to print such rename entities. */
5282 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5283 const struct block
*current_block
)
5285 struct symbol
*current_function
;
5286 const char *current_function_name
;
5288 int is_new_style_renaming
;
5290 /* If there is both a renaming foo___XR... encoded as a variable and
5291 a simple variable foo in the same block, discard the latter.
5292 First, zero out such symbols, then compress. */
5293 is_new_style_renaming
= 0;
5294 for (i
= 0; i
< syms
->size (); i
+= 1)
5296 struct symbol
*sym
= (*syms
)[i
].symbol
;
5297 const struct block
*block
= (*syms
)[i
].block
;
5301 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5303 name
= sym
->linkage_name ();
5304 suffix
= strstr (name
, "___XR");
5308 int name_len
= suffix
- name
;
5311 is_new_style_renaming
= 1;
5312 for (j
= 0; j
< syms
->size (); j
+= 1)
5313 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5314 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5316 && block
== (*syms
)[j
].block
)
5317 (*syms
)[j
].symbol
= NULL
;
5320 if (is_new_style_renaming
)
5324 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5325 if ((*syms
)[j
].symbol
!= NULL
)
5327 (*syms
)[k
] = (*syms
)[j
];
5333 /* Extract the function name associated to CURRENT_BLOCK.
5334 Abort if unable to do so. */
5336 if (current_block
== NULL
)
5337 return syms
->size ();
5339 current_function
= block_linkage_function (current_block
);
5340 if (current_function
== NULL
)
5341 return syms
->size ();
5343 current_function_name
= current_function
->linkage_name ();
5344 if (current_function_name
== NULL
)
5345 return syms
->size ();
5347 /* Check each of the symbols, and remove it from the list if it is
5348 a type corresponding to a renaming that is out of the scope of
5349 the current block. */
5352 while (i
< syms
->size ())
5354 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5355 == ADA_OBJECT_RENAMING
5356 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5357 current_function_name
))
5358 syms
->erase (syms
->begin () + i
);
5363 return syms
->size ();
5366 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5367 whose name and domain match NAME and DOMAIN respectively.
5368 If no match was found, then extend the search to "enclosing"
5369 routines (in other words, if we're inside a nested function,
5370 search the symbols defined inside the enclosing functions).
5371 If WILD_MATCH_P is nonzero, perform the naming matching in
5372 "wild" mode (see function "wild_match" for more info).
5374 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5377 ada_add_local_symbols (struct obstack
*obstackp
,
5378 const lookup_name_info
&lookup_name
,
5379 const struct block
*block
, domain_enum domain
)
5381 int block_depth
= 0;
5383 while (block
!= NULL
)
5386 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5388 /* If we found a non-function match, assume that's the one. */
5389 if (is_nonfunction (defns_collected (obstackp
, 0),
5390 num_defns_collected (obstackp
)))
5393 block
= BLOCK_SUPERBLOCK (block
);
5396 /* If no luck so far, try to find NAME as a local symbol in some lexically
5397 enclosing subprogram. */
5398 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5399 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5402 /* An object of this type is used as the user_data argument when
5403 calling the map_matching_symbols method. */
5407 struct objfile
*objfile
;
5408 struct obstack
*obstackp
;
5409 struct symbol
*arg_sym
;
5413 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5414 to a list of symbols. DATA is a pointer to a struct match_data *
5415 containing the obstack that collects the symbol list, the file that SYM
5416 must come from, a flag indicating whether a non-argument symbol has
5417 been found in the current block, and the last argument symbol
5418 passed in SYM within the current block (if any). When SYM is null,
5419 marking the end of a block, the argument symbol is added if no
5420 other has been found. */
5423 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5424 struct match_data
*data
)
5426 const struct block
*block
= bsym
->block
;
5427 struct symbol
*sym
= bsym
->symbol
;
5431 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5432 add_defn_to_vec (data
->obstackp
,
5433 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5435 data
->found_sym
= 0;
5436 data
->arg_sym
= NULL
;
5440 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5442 else if (SYMBOL_IS_ARGUMENT (sym
))
5443 data
->arg_sym
= sym
;
5446 data
->found_sym
= 1;
5447 add_defn_to_vec (data
->obstackp
,
5448 fixup_symbol_section (sym
, data
->objfile
),
5455 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5456 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5457 symbols to OBSTACKP. Return whether we found such symbols. */
5460 ada_add_block_renamings (struct obstack
*obstackp
,
5461 const struct block
*block
,
5462 const lookup_name_info
&lookup_name
,
5465 struct using_direct
*renaming
;
5466 int defns_mark
= num_defns_collected (obstackp
);
5468 symbol_name_matcher_ftype
*name_match
5469 = ada_get_symbol_name_matcher (lookup_name
);
5471 for (renaming
= block_using (block
);
5473 renaming
= renaming
->next
)
5477 /* Avoid infinite recursions: skip this renaming if we are actually
5478 already traversing it.
5480 Currently, symbol lookup in Ada don't use the namespace machinery from
5481 C++/Fortran support: skip namespace imports that use them. */
5482 if (renaming
->searched
5483 || (renaming
->import_src
!= NULL
5484 && renaming
->import_src
[0] != '\0')
5485 || (renaming
->import_dest
!= NULL
5486 && renaming
->import_dest
[0] != '\0'))
5488 renaming
->searched
= 1;
5490 /* TODO: here, we perform another name-based symbol lookup, which can
5491 pull its own multiple overloads. In theory, we should be able to do
5492 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5493 not a simple name. But in order to do this, we would need to enhance
5494 the DWARF reader to associate a symbol to this renaming, instead of a
5495 name. So, for now, we do something simpler: re-use the C++/Fortran
5496 namespace machinery. */
5497 r_name
= (renaming
->alias
!= NULL
5499 : renaming
->declaration
);
5500 if (name_match (r_name
, lookup_name
, NULL
))
5502 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5503 lookup_name
.match_type ());
5504 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5507 renaming
->searched
= 0;
5509 return num_defns_collected (obstackp
) != defns_mark
;
5512 /* Implements compare_names, but only applying the comparision using
5513 the given CASING. */
5516 compare_names_with_case (const char *string1
, const char *string2
,
5517 enum case_sensitivity casing
)
5519 while (*string1
!= '\0' && *string2
!= '\0')
5523 if (isspace (*string1
) || isspace (*string2
))
5524 return strcmp_iw_ordered (string1
, string2
);
5526 if (casing
== case_sensitive_off
)
5528 c1
= tolower (*string1
);
5529 c2
= tolower (*string2
);
5546 return strcmp_iw_ordered (string1
, string2
);
5548 if (*string2
== '\0')
5550 if (is_name_suffix (string1
))
5557 if (*string2
== '(')
5558 return strcmp_iw_ordered (string1
, string2
);
5561 if (casing
== case_sensitive_off
)
5562 return tolower (*string1
) - tolower (*string2
);
5564 return *string1
- *string2
;
5569 /* Compare STRING1 to STRING2, with results as for strcmp.
5570 Compatible with strcmp_iw_ordered in that...
5572 strcmp_iw_ordered (STRING1, STRING2) <= 0
5576 compare_names (STRING1, STRING2) <= 0
5578 (they may differ as to what symbols compare equal). */
5581 compare_names (const char *string1
, const char *string2
)
5585 /* Similar to what strcmp_iw_ordered does, we need to perform
5586 a case-insensitive comparison first, and only resort to
5587 a second, case-sensitive, comparison if the first one was
5588 not sufficient to differentiate the two strings. */
5590 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5592 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5597 /* Convenience function to get at the Ada encoded lookup name for
5598 LOOKUP_NAME, as a C string. */
5601 ada_lookup_name (const lookup_name_info
&lookup_name
)
5603 return lookup_name
.ada ().lookup_name ().c_str ();
5606 /* Add to OBSTACKP all non-local symbols whose name and domain match
5607 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5608 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5609 symbols otherwise. */
5612 add_nonlocal_symbols (struct obstack
*obstackp
,
5613 const lookup_name_info
&lookup_name
,
5614 domain_enum domain
, int global
)
5616 struct match_data data
;
5618 memset (&data
, 0, sizeof data
);
5619 data
.obstackp
= obstackp
;
5621 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5623 auto callback
= [&] (struct block_symbol
*bsym
)
5625 return aux_add_nonlocal_symbols (bsym
, &data
);
5628 for (objfile
*objfile
: current_program_space
->objfiles ())
5630 data
.objfile
= objfile
;
5632 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5633 domain
, global
, callback
,
5635 ? NULL
: compare_names
));
5637 for (compunit_symtab
*cu
: objfile
->compunits ())
5639 const struct block
*global_block
5640 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5642 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5648 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5650 const char *name
= ada_lookup_name (lookup_name
);
5651 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5652 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5654 for (objfile
*objfile
: current_program_space
->objfiles ())
5656 data
.objfile
= objfile
;
5657 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5658 domain
, global
, callback
,
5664 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5665 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5666 returning the number of matches. Add these to OBSTACKP.
5668 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5669 symbol match within the nest of blocks whose innermost member is BLOCK,
5670 is the one match returned (no other matches in that or
5671 enclosing blocks is returned). If there are any matches in or
5672 surrounding BLOCK, then these alone are returned.
5674 Names prefixed with "standard__" are handled specially:
5675 "standard__" is first stripped off (by the lookup_name
5676 constructor), and only static and global symbols are searched.
5678 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5679 to lookup global symbols. */
5682 ada_add_all_symbols (struct obstack
*obstackp
,
5683 const struct block
*block
,
5684 const lookup_name_info
&lookup_name
,
5687 int *made_global_lookup_p
)
5691 if (made_global_lookup_p
)
5692 *made_global_lookup_p
= 0;
5694 /* Special case: If the user specifies a symbol name inside package
5695 Standard, do a non-wild matching of the symbol name without
5696 the "standard__" prefix. This was primarily introduced in order
5697 to allow the user to specifically access the standard exceptions
5698 using, for instance, Standard.Constraint_Error when Constraint_Error
5699 is ambiguous (due to the user defining its own Constraint_Error
5700 entity inside its program). */
5701 if (lookup_name
.ada ().standard_p ())
5704 /* Check the non-global symbols. If we have ANY match, then we're done. */
5709 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5712 /* In the !full_search case we're are being called by
5713 iterate_over_symbols, and we don't want to search
5715 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5717 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5721 /* No non-global symbols found. Check our cache to see if we have
5722 already performed this search before. If we have, then return
5725 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5726 domain
, &sym
, &block
))
5729 add_defn_to_vec (obstackp
, sym
, block
);
5733 if (made_global_lookup_p
)
5734 *made_global_lookup_p
= 1;
5736 /* Search symbols from all global blocks. */
5738 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5740 /* Now add symbols from all per-file blocks if we've gotten no hits
5741 (not strictly correct, but perhaps better than an error). */
5743 if (num_defns_collected (obstackp
) == 0)
5744 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5747 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5748 is non-zero, enclosing scope and in global scopes, returning the number of
5750 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5751 found and the blocks and symbol tables (if any) in which they were
5754 When full_search is non-zero, any non-function/non-enumeral
5755 symbol match within the nest of blocks whose innermost member is BLOCK,
5756 is the one match returned (no other matches in that or
5757 enclosing blocks is returned). If there are any matches in or
5758 surrounding BLOCK, then these alone are returned.
5760 Names prefixed with "standard__" are handled specially: "standard__"
5761 is first stripped off, and only static and global symbols are searched. */
5764 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5765 const struct block
*block
,
5767 std::vector
<struct block_symbol
> *results
,
5770 int syms_from_global_search
;
5772 auto_obstack obstack
;
5774 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5775 domain
, full_search
, &syms_from_global_search
);
5777 ndefns
= num_defns_collected (&obstack
);
5779 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5780 for (int i
= 0; i
< ndefns
; ++i
)
5781 results
->push_back (base
[i
]);
5783 ndefns
= remove_extra_symbols (results
);
5785 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5786 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5788 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5789 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5790 (*results
)[0].symbol
, (*results
)[0].block
);
5792 ndefns
= remove_irrelevant_renamings (results
, block
);
5797 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5798 in global scopes, returning the number of matches, and filling *RESULTS
5799 with (SYM,BLOCK) tuples.
5801 See ada_lookup_symbol_list_worker for further details. */
5804 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5806 std::vector
<struct block_symbol
> *results
)
5808 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5809 lookup_name_info
lookup_name (name
, name_match_type
);
5811 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5814 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5815 to 1, but choosing the first symbol found if there are multiple
5818 The result is stored in *INFO, which must be non-NULL.
5819 If no match is found, INFO->SYM is set to NULL. */
5822 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5824 struct block_symbol
*info
)
5826 /* Since we already have an encoded name, wrap it in '<>' to force a
5827 verbatim match. Otherwise, if the name happens to not look like
5828 an encoded name (because it doesn't include a "__"),
5829 ada_lookup_name_info would re-encode/fold it again, and that
5830 would e.g., incorrectly lowercase object renaming names like
5831 "R28b" -> "r28b". */
5832 std::string verbatim
= add_angle_brackets (name
);
5834 gdb_assert (info
!= NULL
);
5835 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5838 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5839 scope and in global scopes, or NULL if none. NAME is folded and
5840 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5841 choosing the first symbol if there are multiple choices. */
5844 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5847 std::vector
<struct block_symbol
> candidates
;
5850 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5852 if (n_candidates
== 0)
5855 block_symbol info
= candidates
[0];
5856 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5861 /* True iff STR is a possible encoded suffix of a normal Ada name
5862 that is to be ignored for matching purposes. Suffixes of parallel
5863 names (e.g., XVE) are not included here. Currently, the possible suffixes
5864 are given by any of the regular expressions:
5866 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5867 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5868 TKB [subprogram suffix for task bodies]
5869 _E[0-9]+[bs]$ [protected object entry suffixes]
5870 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5872 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5873 match is performed. This sequence is used to differentiate homonyms,
5874 is an optional part of a valid name suffix. */
5877 is_name_suffix (const char *str
)
5880 const char *matching
;
5881 const int len
= strlen (str
);
5883 /* Skip optional leading __[0-9]+. */
5885 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5888 while (isdigit (str
[0]))
5894 if (str
[0] == '.' || str
[0] == '$')
5897 while (isdigit (matching
[0]))
5899 if (matching
[0] == '\0')
5905 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5908 while (isdigit (matching
[0]))
5910 if (matching
[0] == '\0')
5914 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5916 if (strcmp (str
, "TKB") == 0)
5920 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5921 with a N at the end. Unfortunately, the compiler uses the same
5922 convention for other internal types it creates. So treating
5923 all entity names that end with an "N" as a name suffix causes
5924 some regressions. For instance, consider the case of an enumerated
5925 type. To support the 'Image attribute, it creates an array whose
5927 Having a single character like this as a suffix carrying some
5928 information is a bit risky. Perhaps we should change the encoding
5929 to be something like "_N" instead. In the meantime, do not do
5930 the following check. */
5931 /* Protected Object Subprograms */
5932 if (len
== 1 && str
[0] == 'N')
5937 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5940 while (isdigit (matching
[0]))
5942 if ((matching
[0] == 'b' || matching
[0] == 's')
5943 && matching
[1] == '\0')
5947 /* ??? We should not modify STR directly, as we are doing below. This
5948 is fine in this case, but may become problematic later if we find
5949 that this alternative did not work, and want to try matching
5950 another one from the begining of STR. Since we modified it, we
5951 won't be able to find the begining of the string anymore! */
5955 while (str
[0] != '_' && str
[0] != '\0')
5957 if (str
[0] != 'n' && str
[0] != 'b')
5963 if (str
[0] == '\000')
5968 if (str
[1] != '_' || str
[2] == '\000')
5972 if (strcmp (str
+ 3, "JM") == 0)
5974 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5975 the LJM suffix in favor of the JM one. But we will
5976 still accept LJM as a valid suffix for a reasonable
5977 amount of time, just to allow ourselves to debug programs
5978 compiled using an older version of GNAT. */
5979 if (strcmp (str
+ 3, "LJM") == 0)
5983 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5984 || str
[4] == 'U' || str
[4] == 'P')
5986 if (str
[4] == 'R' && str
[5] != 'T')
5990 if (!isdigit (str
[2]))
5992 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5993 if (!isdigit (str
[k
]) && str
[k
] != '_')
5997 if (str
[0] == '$' && isdigit (str
[1]))
5999 for (k
= 2; str
[k
] != '\0'; k
+= 1)
6000 if (!isdigit (str
[k
]) && str
[k
] != '_')
6007 /* Return non-zero if the string starting at NAME and ending before
6008 NAME_END contains no capital letters. */
6011 is_valid_name_for_wild_match (const char *name0
)
6013 std::string decoded_name
= ada_decode (name0
);
6016 /* If the decoded name starts with an angle bracket, it means that
6017 NAME0 does not follow the GNAT encoding format. It should then
6018 not be allowed as a possible wild match. */
6019 if (decoded_name
[0] == '<')
6022 for (i
=0; decoded_name
[i
] != '\0'; i
++)
6023 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6029 /* Advance *NAMEP to next occurrence in the string NAME0 of the TARGET0
6030 character which could start a simple name. Assumes that *NAMEP points
6031 somewhere inside the string beginning at NAME0. */
6034 advance_wild_match (const char **namep
, const char *name0
, char target0
)
6036 const char *name
= *namep
;
6046 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6049 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6054 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6055 || name
[2] == target0
))
6060 else if (t1
== '_' && name
[2] == 'B' && name
[3] == '_')
6062 /* Names like "pkg__B_N__name", where N is a number, are
6063 block-local. We can handle these by simply skipping
6070 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6080 /* Return true iff NAME encodes a name of the form prefix.PATN.
6081 Ignores any informational suffixes of NAME (i.e., for which
6082 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6086 wild_match (const char *name
, const char *patn
)
6089 const char *name0
= name
;
6093 const char *match
= name
;
6097 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6100 if (*p
== '\0' && is_name_suffix (name
))
6101 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6103 if (name
[-1] == '_')
6106 if (!advance_wild_match (&name
, name0
, *patn
))
6111 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6112 *defn_symbols, updating the list of symbols in OBSTACKP (if
6113 necessary). OBJFILE is the section containing BLOCK. */
6116 ada_add_block_symbols (struct obstack
*obstackp
,
6117 const struct block
*block
,
6118 const lookup_name_info
&lookup_name
,
6119 domain_enum domain
, struct objfile
*objfile
)
6121 struct block_iterator iter
;
6122 /* A matching argument symbol, if any. */
6123 struct symbol
*arg_sym
;
6124 /* Set true when we find a matching non-argument symbol. */
6130 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6132 sym
= block_iter_match_next (lookup_name
, &iter
))
6134 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6136 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6138 if (SYMBOL_IS_ARGUMENT (sym
))
6143 add_defn_to_vec (obstackp
,
6144 fixup_symbol_section (sym
, objfile
),
6151 /* Handle renamings. */
6153 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6156 if (!found_sym
&& arg_sym
!= NULL
)
6158 add_defn_to_vec (obstackp
,
6159 fixup_symbol_section (arg_sym
, objfile
),
6163 if (!lookup_name
.ada ().wild_match_p ())
6167 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6168 const char *name
= ada_lookup_name
.c_str ();
6169 size_t name_len
= ada_lookup_name
.size ();
6171 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6173 if (symbol_matches_domain (sym
->language (),
6174 SYMBOL_DOMAIN (sym
), domain
))
6178 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6181 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6183 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6188 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6190 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6192 if (SYMBOL_IS_ARGUMENT (sym
))
6197 add_defn_to_vec (obstackp
,
6198 fixup_symbol_section (sym
, objfile
),
6206 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6207 They aren't parameters, right? */
6208 if (!found_sym
&& arg_sym
!= NULL
)
6210 add_defn_to_vec (obstackp
,
6211 fixup_symbol_section (arg_sym
, objfile
),
6218 /* Symbol Completion */
6223 ada_lookup_name_info::matches
6224 (const char *sym_name
,
6225 symbol_name_match_type match_type
,
6226 completion_match_result
*comp_match_res
) const
6229 const char *text
= m_encoded_name
.c_str ();
6230 size_t text_len
= m_encoded_name
.size ();
6232 /* First, test against the fully qualified name of the symbol. */
6234 if (strncmp (sym_name
, text
, text_len
) == 0)
6237 std::string decoded_name
= ada_decode (sym_name
);
6238 if (match
&& !m_encoded_p
)
6240 /* One needed check before declaring a positive match is to verify
6241 that iff we are doing a verbatim match, the decoded version
6242 of the symbol name starts with '<'. Otherwise, this symbol name
6243 is not a suitable completion. */
6245 bool has_angle_bracket
= (decoded_name
[0] == '<');
6246 match
= (has_angle_bracket
== m_verbatim_p
);
6249 if (match
&& !m_verbatim_p
)
6251 /* When doing non-verbatim match, another check that needs to
6252 be done is to verify that the potentially matching symbol name
6253 does not include capital letters, because the ada-mode would
6254 not be able to understand these symbol names without the
6255 angle bracket notation. */
6258 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6263 /* Second: Try wild matching... */
6265 if (!match
&& m_wild_match_p
)
6267 /* Since we are doing wild matching, this means that TEXT
6268 may represent an unqualified symbol name. We therefore must
6269 also compare TEXT against the unqualified name of the symbol. */
6270 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6272 if (strncmp (sym_name
, text
, text_len
) == 0)
6276 /* Finally: If we found a match, prepare the result to return. */
6281 if (comp_match_res
!= NULL
)
6283 std::string
&match_str
= comp_match_res
->match
.storage ();
6286 match_str
= ada_decode (sym_name
);
6290 match_str
= add_angle_brackets (sym_name
);
6292 match_str
= sym_name
;
6296 comp_match_res
->set_match (match_str
.c_str ());
6304 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6305 for tagged types. */
6308 ada_is_dispatch_table_ptr_type (struct type
*type
)
6312 if (type
->code () != TYPE_CODE_PTR
)
6315 name
= TYPE_TARGET_TYPE (type
)->name ();
6319 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6322 /* Return non-zero if TYPE is an interface tag. */
6325 ada_is_interface_tag (struct type
*type
)
6327 const char *name
= type
->name ();
6332 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6335 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6336 to be invisible to users. */
6339 ada_is_ignored_field (struct type
*type
, int field_num
)
6341 if (field_num
< 0 || field_num
> type
->num_fields ())
6344 /* Check the name of that field. */
6346 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6348 /* Anonymous field names should not be printed.
6349 brobecker/2007-02-20: I don't think this can actually happen
6350 but we don't want to print the value of anonymous fields anyway. */
6354 /* Normally, fields whose name start with an underscore ("_")
6355 are fields that have been internally generated by the compiler,
6356 and thus should not be printed. The "_parent" field is special,
6357 however: This is a field internally generated by the compiler
6358 for tagged types, and it contains the components inherited from
6359 the parent type. This field should not be printed as is, but
6360 should not be ignored either. */
6361 if (name
[0] == '_' && !startswith (name
, "_parent"))
6365 /* If this is the dispatch table of a tagged type or an interface tag,
6367 if (ada_is_tagged_type (type
, 1)
6368 && (ada_is_dispatch_table_ptr_type (type
->field (field_num
).type ())
6369 || ada_is_interface_tag (type
->field (field_num
).type ())))
6372 /* Not a special field, so it should not be ignored. */
6376 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6377 pointer or reference type whose ultimate target has a tag field. */
6380 ada_is_tagged_type (struct type
*type
, int refok
)
6382 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6385 /* True iff TYPE represents the type of X'Tag */
6388 ada_is_tag_type (struct type
*type
)
6390 type
= ada_check_typedef (type
);
6392 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6396 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6398 return (name
!= NULL
6399 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6403 /* The type of the tag on VAL. */
6405 static struct type
*
6406 ada_tag_type (struct value
*val
)
6408 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6411 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6412 retired at Ada 05). */
6415 is_ada95_tag (struct value
*tag
)
6417 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6420 /* The value of the tag on VAL. */
6422 static struct value
*
6423 ada_value_tag (struct value
*val
)
6425 return ada_value_struct_elt (val
, "_tag", 0);
6428 /* The value of the tag on the object of type TYPE whose contents are
6429 saved at VALADDR, if it is non-null, or is at memory address
6432 static struct value
*
6433 value_tag_from_contents_and_address (struct type
*type
,
6434 const gdb_byte
*valaddr
,
6437 int tag_byte_offset
;
6438 struct type
*tag_type
;
6440 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6443 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6445 : valaddr
+ tag_byte_offset
);
6446 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6448 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6453 static struct type
*
6454 type_from_tag (struct value
*tag
)
6456 gdb::unique_xmalloc_ptr
<char> type_name
= ada_tag_name (tag
);
6458 if (type_name
!= NULL
)
6459 return ada_find_any_type (ada_encode (type_name
.get ()).c_str ());
6463 /* Given a value OBJ of a tagged type, return a value of this
6464 type at the base address of the object. The base address, as
6465 defined in Ada.Tags, it is the address of the primary tag of
6466 the object, and therefore where the field values of its full
6467 view can be fetched. */
6470 ada_tag_value_at_base_address (struct value
*obj
)
6473 LONGEST offset_to_top
= 0;
6474 struct type
*ptr_type
, *obj_type
;
6476 CORE_ADDR base_address
;
6478 obj_type
= value_type (obj
);
6480 /* It is the responsability of the caller to deref pointers. */
6482 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6485 tag
= ada_value_tag (obj
);
6489 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6491 if (is_ada95_tag (tag
))
6494 ptr_type
= language_lookup_primitive_type
6495 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6496 ptr_type
= lookup_pointer_type (ptr_type
);
6497 val
= value_cast (ptr_type
, tag
);
6501 /* It is perfectly possible that an exception be raised while
6502 trying to determine the base address, just like for the tag;
6503 see ada_tag_name for more details. We do not print the error
6504 message for the same reason. */
6508 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6511 catch (const gdb_exception_error
&e
)
6516 /* If offset is null, nothing to do. */
6518 if (offset_to_top
== 0)
6521 /* -1 is a special case in Ada.Tags; however, what should be done
6522 is not quite clear from the documentation. So do nothing for
6525 if (offset_to_top
== -1)
6528 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6529 from the base address. This was however incompatible with
6530 C++ dispatch table: C++ uses a *negative* value to *add*
6531 to the base address. Ada's convention has therefore been
6532 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6533 use the same convention. Here, we support both cases by
6534 checking the sign of OFFSET_TO_TOP. */
6536 if (offset_to_top
> 0)
6537 offset_to_top
= -offset_to_top
;
6539 base_address
= value_address (obj
) + offset_to_top
;
6540 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6542 /* Make sure that we have a proper tag at the new address.
6543 Otherwise, offset_to_top is bogus (which can happen when
6544 the object is not initialized yet). */
6549 obj_type
= type_from_tag (tag
);
6554 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6557 /* Return the "ada__tags__type_specific_data" type. */
6559 static struct type
*
6560 ada_get_tsd_type (struct inferior
*inf
)
6562 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6564 if (data
->tsd_type
== 0)
6565 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6566 return data
->tsd_type
;
6569 /* Return the TSD (type-specific data) associated to the given TAG.
6570 TAG is assumed to be the tag of a tagged-type entity.
6572 May return NULL if we are unable to get the TSD. */
6574 static struct value
*
6575 ada_get_tsd_from_tag (struct value
*tag
)
6580 /* First option: The TSD is simply stored as a field of our TAG.
6581 Only older versions of GNAT would use this format, but we have
6582 to test it first, because there are no visible markers for
6583 the current approach except the absence of that field. */
6585 val
= ada_value_struct_elt (tag
, "tsd", 1);
6589 /* Try the second representation for the dispatch table (in which
6590 there is no explicit 'tsd' field in the referent of the tag pointer,
6591 and instead the tsd pointer is stored just before the dispatch
6594 type
= ada_get_tsd_type (current_inferior());
6597 type
= lookup_pointer_type (lookup_pointer_type (type
));
6598 val
= value_cast (type
, tag
);
6601 return value_ind (value_ptradd (val
, -1));
6604 /* Given the TSD of a tag (type-specific data), return a string
6605 containing the name of the associated type.
6607 May return NULL if we are unable to determine the tag name. */
6609 static gdb::unique_xmalloc_ptr
<char>
6610 ada_tag_name_from_tsd (struct value
*tsd
)
6615 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6618 gdb::unique_xmalloc_ptr
<char> buffer
6619 = target_read_string (value_as_address (val
), INT_MAX
);
6620 if (buffer
== nullptr)
6623 for (p
= buffer
.get (); *p
!= '\0'; ++p
)
6632 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6635 Return NULL if the TAG is not an Ada tag, or if we were unable to
6636 determine the name of that tag. */
6638 gdb::unique_xmalloc_ptr
<char>
6639 ada_tag_name (struct value
*tag
)
6641 gdb::unique_xmalloc_ptr
<char> name
;
6643 if (!ada_is_tag_type (value_type (tag
)))
6646 /* It is perfectly possible that an exception be raised while trying
6647 to determine the TAG's name, even under normal circumstances:
6648 The associated variable may be uninitialized or corrupted, for
6649 instance. We do not let any exception propagate past this point.
6650 instead we return NULL.
6652 We also do not print the error message either (which often is very
6653 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6654 the caller print a more meaningful message if necessary. */
6657 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6660 name
= ada_tag_name_from_tsd (tsd
);
6662 catch (const gdb_exception_error
&e
)
6669 /* The parent type of TYPE, or NULL if none. */
6672 ada_parent_type (struct type
*type
)
6676 type
= ada_check_typedef (type
);
6678 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6681 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6682 if (ada_is_parent_field (type
, i
))
6684 struct type
*parent_type
= type
->field (i
).type ();
6686 /* If the _parent field is a pointer, then dereference it. */
6687 if (parent_type
->code () == TYPE_CODE_PTR
)
6688 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6689 /* If there is a parallel XVS type, get the actual base type. */
6690 parent_type
= ada_get_base_type (parent_type
);
6692 return ada_check_typedef (parent_type
);
6698 /* True iff field number FIELD_NUM of structure type TYPE contains the
6699 parent-type (inherited) fields of a derived type. Assumes TYPE is
6700 a structure type with at least FIELD_NUM+1 fields. */
6703 ada_is_parent_field (struct type
*type
, int field_num
)
6705 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6707 return (name
!= NULL
6708 && (startswith (name
, "PARENT")
6709 || startswith (name
, "_parent")));
6712 /* True iff field number FIELD_NUM of structure type TYPE is a
6713 transparent wrapper field (which should be silently traversed when doing
6714 field selection and flattened when printing). Assumes TYPE is a
6715 structure type with at least FIELD_NUM+1 fields. Such fields are always
6719 ada_is_wrapper_field (struct type
*type
, int field_num
)
6721 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6723 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6725 /* This happens in functions with "out" or "in out" parameters
6726 which are passed by copy. For such functions, GNAT describes
6727 the function's return type as being a struct where the return
6728 value is in a field called RETVAL, and where the other "out"
6729 or "in out" parameters are fields of that struct. This is not
6734 return (name
!= NULL
6735 && (startswith (name
, "PARENT")
6736 || strcmp (name
, "REP") == 0
6737 || startswith (name
, "_parent")
6738 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6741 /* True iff field number FIELD_NUM of structure or union type TYPE
6742 is a variant wrapper. Assumes TYPE is a structure type with at least
6743 FIELD_NUM+1 fields. */
6746 ada_is_variant_part (struct type
*type
, int field_num
)
6748 /* Only Ada types are eligible. */
6749 if (!ADA_TYPE_P (type
))
6752 struct type
*field_type
= type
->field (field_num
).type ();
6754 return (field_type
->code () == TYPE_CODE_UNION
6755 || (is_dynamic_field (type
, field_num
)
6756 && (TYPE_TARGET_TYPE (field_type
)->code ()
6757 == TYPE_CODE_UNION
)));
6760 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6761 whose discriminants are contained in the record type OUTER_TYPE,
6762 returns the type of the controlling discriminant for the variant.
6763 May return NULL if the type could not be found. */
6766 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6768 const char *name
= ada_variant_discrim_name (var_type
);
6770 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6773 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6774 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6775 represents a 'when others' clause; otherwise 0. */
6778 ada_is_others_clause (struct type
*type
, int field_num
)
6780 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6782 return (name
!= NULL
&& name
[0] == 'O');
6785 /* Assuming that TYPE0 is the type of the variant part of a record,
6786 returns the name of the discriminant controlling the variant.
6787 The value is valid until the next call to ada_variant_discrim_name. */
6790 ada_variant_discrim_name (struct type
*type0
)
6792 static char *result
= NULL
;
6793 static size_t result_len
= 0;
6796 const char *discrim_end
;
6797 const char *discrim_start
;
6799 if (type0
->code () == TYPE_CODE_PTR
)
6800 type
= TYPE_TARGET_TYPE (type0
);
6804 name
= ada_type_name (type
);
6806 if (name
== NULL
|| name
[0] == '\000')
6809 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6812 if (startswith (discrim_end
, "___XVN"))
6815 if (discrim_end
== name
)
6818 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6821 if (discrim_start
== name
+ 1)
6823 if ((discrim_start
> name
+ 3
6824 && startswith (discrim_start
- 3, "___"))
6825 || discrim_start
[-1] == '.')
6829 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6830 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6831 result
[discrim_end
- discrim_start
] = '\0';
6835 /* Scan STR for a subtype-encoded number, beginning at position K.
6836 Put the position of the character just past the number scanned in
6837 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6838 Return 1 if there was a valid number at the given position, and 0
6839 otherwise. A "subtype-encoded" number consists of the absolute value
6840 in decimal, followed by the letter 'm' to indicate a negative number.
6841 Assumes 0m does not occur. */
6844 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6848 if (!isdigit (str
[k
]))
6851 /* Do it the hard way so as not to make any assumption about
6852 the relationship of unsigned long (%lu scan format code) and
6855 while (isdigit (str
[k
]))
6857 RU
= RU
* 10 + (str
[k
] - '0');
6864 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6870 /* NOTE on the above: Technically, C does not say what the results of
6871 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6872 number representable as a LONGEST (although either would probably work
6873 in most implementations). When RU>0, the locution in the then branch
6874 above is always equivalent to the negative of RU. */
6881 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6882 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6883 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6886 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6888 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6902 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6912 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6913 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6915 if (val
>= L
&& val
<= U
)
6927 /* FIXME: Lots of redundancy below. Try to consolidate. */
6929 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6930 ARG_TYPE, extract and return the value of one of its (non-static)
6931 fields. FIELDNO says which field. Differs from value_primitive_field
6932 only in that it can handle packed values of arbitrary type. */
6935 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6936 struct type
*arg_type
)
6940 arg_type
= ada_check_typedef (arg_type
);
6941 type
= arg_type
->field (fieldno
).type ();
6943 /* Handle packed fields. It might be that the field is not packed
6944 relative to its containing structure, but the structure itself is
6945 packed; in this case we must take the bit-field path. */
6946 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
6948 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6949 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6951 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6952 offset
+ bit_pos
/ 8,
6953 bit_pos
% 8, bit_size
, type
);
6956 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6959 /* Find field with name NAME in object of type TYPE. If found,
6960 set the following for each argument that is non-null:
6961 - *FIELD_TYPE_P to the field's type;
6962 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6963 an object of that type;
6964 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6965 - *BIT_SIZE_P to its size in bits if the field is packed, and
6967 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6968 fields up to but not including the desired field, or by the total
6969 number of fields if not found. A NULL value of NAME never
6970 matches; the function just counts visible fields in this case.
6972 Notice that we need to handle when a tagged record hierarchy
6973 has some components with the same name, like in this scenario:
6975 type Top_T is tagged record
6981 type Middle_T is new Top.Top_T with record
6982 N : Character := 'a';
6986 type Bottom_T is new Middle.Middle_T with record
6988 C : Character := '5';
6990 A : Character := 'J';
6993 Let's say we now have a variable declared and initialized as follow:
6995 TC : Top_A := new Bottom_T;
6997 And then we use this variable to call this function
6999 procedure Assign (Obj: in out Top_T; TV : Integer);
7003 Assign (Top_T (B), 12);
7005 Now, we're in the debugger, and we're inside that procedure
7006 then and we want to print the value of obj.c:
7008 Usually, the tagged record or one of the parent type owns the
7009 component to print and there's no issue but in this particular
7010 case, what does it mean to ask for Obj.C? Since the actual
7011 type for object is type Bottom_T, it could mean two things: type
7012 component C from the Middle_T view, but also component C from
7013 Bottom_T. So in that "undefined" case, when the component is
7014 not found in the non-resolved type (which includes all the
7015 components of the parent type), then resolve it and see if we
7016 get better luck once expanded.
7018 In the case of homonyms in the derived tagged type, we don't
7019 guaranty anything, and pick the one that's easiest for us
7022 Returns 1 if found, 0 otherwise. */
7025 find_struct_field (const char *name
, struct type
*type
, int offset
,
7026 struct type
**field_type_p
,
7027 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7031 int parent_offset
= -1;
7033 type
= ada_check_typedef (type
);
7035 if (field_type_p
!= NULL
)
7036 *field_type_p
= NULL
;
7037 if (byte_offset_p
!= NULL
)
7039 if (bit_offset_p
!= NULL
)
7041 if (bit_size_p
!= NULL
)
7044 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7046 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7047 int fld_offset
= offset
+ bit_pos
/ 8;
7048 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7050 if (t_field_name
== NULL
)
7053 else if (ada_is_parent_field (type
, i
))
7055 /* This is a field pointing us to the parent type of a tagged
7056 type. As hinted in this function's documentation, we give
7057 preference to fields in the current record first, so what
7058 we do here is just record the index of this field before
7059 we skip it. If it turns out we couldn't find our field
7060 in the current record, then we'll get back to it and search
7061 inside it whether the field might exist in the parent. */
7067 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7069 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7071 if (field_type_p
!= NULL
)
7072 *field_type_p
= type
->field (i
).type ();
7073 if (byte_offset_p
!= NULL
)
7074 *byte_offset_p
= fld_offset
;
7075 if (bit_offset_p
!= NULL
)
7076 *bit_offset_p
= bit_pos
% 8;
7077 if (bit_size_p
!= NULL
)
7078 *bit_size_p
= bit_size
;
7081 else if (ada_is_wrapper_field (type
, i
))
7083 if (find_struct_field (name
, type
->field (i
).type (), fld_offset
,
7084 field_type_p
, byte_offset_p
, bit_offset_p
,
7085 bit_size_p
, index_p
))
7088 else if (ada_is_variant_part (type
, i
))
7090 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7093 struct type
*field_type
7094 = ada_check_typedef (type
->field (i
).type ());
7096 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7098 if (find_struct_field (name
, field_type
->field (j
).type (),
7100 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7101 field_type_p
, byte_offset_p
,
7102 bit_offset_p
, bit_size_p
, index_p
))
7106 else if (index_p
!= NULL
)
7110 /* Field not found so far. If this is a tagged type which
7111 has a parent, try finding that field in the parent now. */
7113 if (parent_offset
!= -1)
7115 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7116 int fld_offset
= offset
+ bit_pos
/ 8;
7118 if (find_struct_field (name
, type
->field (parent_offset
).type (),
7119 fld_offset
, field_type_p
, byte_offset_p
,
7120 bit_offset_p
, bit_size_p
, index_p
))
7127 /* Number of user-visible fields in record type TYPE. */
7130 num_visible_fields (struct type
*type
)
7135 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7139 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7140 and search in it assuming it has (class) type TYPE.
7141 If found, return value, else return NULL.
7143 Searches recursively through wrapper fields (e.g., '_parent').
7145 In the case of homonyms in the tagged types, please refer to the
7146 long explanation in find_struct_field's function documentation. */
7148 static struct value
*
7149 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7153 int parent_offset
= -1;
7155 type
= ada_check_typedef (type
);
7156 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7158 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7160 if (t_field_name
== NULL
)
7163 else if (ada_is_parent_field (type
, i
))
7165 /* This is a field pointing us to the parent type of a tagged
7166 type. As hinted in this function's documentation, we give
7167 preference to fields in the current record first, so what
7168 we do here is just record the index of this field before
7169 we skip it. If it turns out we couldn't find our field
7170 in the current record, then we'll get back to it and search
7171 inside it whether the field might exist in the parent. */
7177 else if (field_name_match (t_field_name
, name
))
7178 return ada_value_primitive_field (arg
, offset
, i
, type
);
7180 else if (ada_is_wrapper_field (type
, i
))
7182 struct value
*v
= /* Do not let indent join lines here. */
7183 ada_search_struct_field (name
, arg
,
7184 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7185 type
->field (i
).type ());
7191 else if (ada_is_variant_part (type
, i
))
7193 /* PNH: Do we ever get here? See find_struct_field. */
7195 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7196 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7198 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7200 struct value
*v
= ada_search_struct_field
/* Force line
7203 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7204 field_type
->field (j
).type ());
7212 /* Field not found so far. If this is a tagged type which
7213 has a parent, try finding that field in the parent now. */
7215 if (parent_offset
!= -1)
7217 struct value
*v
= ada_search_struct_field (
7218 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7219 type
->field (parent_offset
).type ());
7228 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7229 int, struct type
*);
7232 /* Return field #INDEX in ARG, where the index is that returned by
7233 * find_struct_field through its INDEX_P argument. Adjust the address
7234 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7235 * If found, return value, else return NULL. */
7237 static struct value
*
7238 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7241 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7245 /* Auxiliary function for ada_index_struct_field. Like
7246 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7249 static struct value
*
7250 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7254 type
= ada_check_typedef (type
);
7256 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7258 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7260 else if (ada_is_wrapper_field (type
, i
))
7262 struct value
*v
= /* Do not let indent join lines here. */
7263 ada_index_struct_field_1 (index_p
, arg
,
7264 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7265 type
->field (i
).type ());
7271 else if (ada_is_variant_part (type
, i
))
7273 /* PNH: Do we ever get here? See ada_search_struct_field,
7274 find_struct_field. */
7275 error (_("Cannot assign this kind of variant record"));
7277 else if (*index_p
== 0)
7278 return ada_value_primitive_field (arg
, offset
, i
, type
);
7285 /* Return a string representation of type TYPE. */
7288 type_as_string (struct type
*type
)
7290 string_file tmp_stream
;
7292 type_print (type
, "", &tmp_stream
, -1);
7294 return std::move (tmp_stream
.string ());
7297 /* Given a type TYPE, look up the type of the component of type named NAME.
7298 If DISPP is non-null, add its byte displacement from the beginning of a
7299 structure (pointed to by a value) of type TYPE to *DISPP (does not
7300 work for packed fields).
7302 Matches any field whose name has NAME as a prefix, possibly
7305 TYPE can be either a struct or union. If REFOK, TYPE may also
7306 be a (pointer or reference)+ to a struct or union, and the
7307 ultimate target type will be searched.
7309 Looks recursively into variant clauses and parent types.
7311 In the case of homonyms in the tagged types, please refer to the
7312 long explanation in find_struct_field's function documentation.
7314 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7315 TYPE is not a type of the right kind. */
7317 static struct type
*
7318 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7322 int parent_offset
= -1;
7327 if (refok
&& type
!= NULL
)
7330 type
= ada_check_typedef (type
);
7331 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7333 type
= TYPE_TARGET_TYPE (type
);
7337 || (type
->code () != TYPE_CODE_STRUCT
7338 && type
->code () != TYPE_CODE_UNION
))
7343 error (_("Type %s is not a structure or union type"),
7344 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7347 type
= to_static_fixed_type (type
);
7349 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7351 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7354 if (t_field_name
== NULL
)
7357 else if (ada_is_parent_field (type
, i
))
7359 /* This is a field pointing us to the parent type of a tagged
7360 type. As hinted in this function's documentation, we give
7361 preference to fields in the current record first, so what
7362 we do here is just record the index of this field before
7363 we skip it. If it turns out we couldn't find our field
7364 in the current record, then we'll get back to it and search
7365 inside it whether the field might exist in the parent. */
7371 else if (field_name_match (t_field_name
, name
))
7372 return type
->field (i
).type ();
7374 else if (ada_is_wrapper_field (type
, i
))
7376 t
= ada_lookup_struct_elt_type (type
->field (i
).type (), name
,
7382 else if (ada_is_variant_part (type
, i
))
7385 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7387 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
7389 /* FIXME pnh 2008/01/26: We check for a field that is
7390 NOT wrapped in a struct, since the compiler sometimes
7391 generates these for unchecked variant types. Revisit
7392 if the compiler changes this practice. */
7393 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7395 if (v_field_name
!= NULL
7396 && field_name_match (v_field_name
, name
))
7397 t
= field_type
->field (j
).type ();
7399 t
= ada_lookup_struct_elt_type (field_type
->field (j
).type (),
7409 /* Field not found so far. If this is a tagged type which
7410 has a parent, try finding that field in the parent now. */
7412 if (parent_offset
!= -1)
7416 t
= ada_lookup_struct_elt_type (type
->field (parent_offset
).type (),
7425 const char *name_str
= name
!= NULL
? name
: _("<null>");
7427 error (_("Type %s has no component named %s"),
7428 type_as_string (type
).c_str (), name_str
);
7434 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7435 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7436 represents an unchecked union (that is, the variant part of a
7437 record that is named in an Unchecked_Union pragma). */
7440 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7442 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7444 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7448 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7449 within OUTER, determine which variant clause (field number in VAR_TYPE,
7450 numbering from 0) is applicable. Returns -1 if none are. */
7453 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7457 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7458 struct value
*discrim
;
7459 LONGEST discrim_val
;
7461 /* Using plain value_from_contents_and_address here causes problems
7462 because we will end up trying to resolve a type that is currently
7463 being constructed. */
7464 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7465 if (discrim
== NULL
)
7467 discrim_val
= value_as_long (discrim
);
7470 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7472 if (ada_is_others_clause (var_type
, i
))
7474 else if (ada_in_variant (discrim_val
, var_type
, i
))
7478 return others_clause
;
7483 /* Dynamic-Sized Records */
7485 /* Strategy: The type ostensibly attached to a value with dynamic size
7486 (i.e., a size that is not statically recorded in the debugging
7487 data) does not accurately reflect the size or layout of the value.
7488 Our strategy is to convert these values to values with accurate,
7489 conventional types that are constructed on the fly. */
7491 /* There is a subtle and tricky problem here. In general, we cannot
7492 determine the size of dynamic records without its data. However,
7493 the 'struct value' data structure, which GDB uses to represent
7494 quantities in the inferior process (the target), requires the size
7495 of the type at the time of its allocation in order to reserve space
7496 for GDB's internal copy of the data. That's why the
7497 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7498 rather than struct value*s.
7500 However, GDB's internal history variables ($1, $2, etc.) are
7501 struct value*s containing internal copies of the data that are not, in
7502 general, the same as the data at their corresponding addresses in
7503 the target. Fortunately, the types we give to these values are all
7504 conventional, fixed-size types (as per the strategy described
7505 above), so that we don't usually have to perform the
7506 'to_fixed_xxx_type' conversions to look at their values.
7507 Unfortunately, there is one exception: if one of the internal
7508 history variables is an array whose elements are unconstrained
7509 records, then we will need to create distinct fixed types for each
7510 element selected. */
7512 /* The upshot of all of this is that many routines take a (type, host
7513 address, target address) triple as arguments to represent a value.
7514 The host address, if non-null, is supposed to contain an internal
7515 copy of the relevant data; otherwise, the program is to consult the
7516 target at the target address. */
7518 /* Assuming that VAL0 represents a pointer value, the result of
7519 dereferencing it. Differs from value_ind in its treatment of
7520 dynamic-sized types. */
7523 ada_value_ind (struct value
*val0
)
7525 struct value
*val
= value_ind (val0
);
7527 if (ada_is_tagged_type (value_type (val
), 0))
7528 val
= ada_tag_value_at_base_address (val
);
7530 return ada_to_fixed_value (val
);
7533 /* The value resulting from dereferencing any "reference to"
7534 qualifiers on VAL0. */
7536 static struct value
*
7537 ada_coerce_ref (struct value
*val0
)
7539 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7541 struct value
*val
= val0
;
7543 val
= coerce_ref (val
);
7545 if (ada_is_tagged_type (value_type (val
), 0))
7546 val
= ada_tag_value_at_base_address (val
);
7548 return ada_to_fixed_value (val
);
7554 /* Return the bit alignment required for field #F of template type TYPE. */
7557 field_alignment (struct type
*type
, int f
)
7559 const char *name
= TYPE_FIELD_NAME (type
, f
);
7563 /* The field name should never be null, unless the debugging information
7564 is somehow malformed. In this case, we assume the field does not
7565 require any alignment. */
7569 len
= strlen (name
);
7571 if (!isdigit (name
[len
- 1]))
7574 if (isdigit (name
[len
- 2]))
7575 align_offset
= len
- 2;
7577 align_offset
= len
- 1;
7579 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7580 return TARGET_CHAR_BIT
;
7582 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7585 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7587 static struct symbol
*
7588 ada_find_any_type_symbol (const char *name
)
7592 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7593 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7596 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7600 /* Find a type named NAME. Ignores ambiguity. This routine will look
7601 solely for types defined by debug info, it will not search the GDB
7604 static struct type
*
7605 ada_find_any_type (const char *name
)
7607 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7610 return SYMBOL_TYPE (sym
);
7615 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7616 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7617 symbol, in which case it is returned. Otherwise, this looks for
7618 symbols whose name is that of NAME_SYM suffixed with "___XR".
7619 Return symbol if found, and NULL otherwise. */
7622 ada_is_renaming_symbol (struct symbol
*name_sym
)
7624 const char *name
= name_sym
->linkage_name ();
7625 return strstr (name
, "___XR") != NULL
;
7628 /* Because of GNAT encoding conventions, several GDB symbols may match a
7629 given type name. If the type denoted by TYPE0 is to be preferred to
7630 that of TYPE1 for purposes of type printing, return non-zero;
7631 otherwise return 0. */
7634 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7638 else if (type0
== NULL
)
7640 else if (type1
->code () == TYPE_CODE_VOID
)
7642 else if (type0
->code () == TYPE_CODE_VOID
)
7644 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7646 else if (ada_is_constrained_packed_array_type (type0
))
7648 else if (ada_is_array_descriptor_type (type0
)
7649 && !ada_is_array_descriptor_type (type1
))
7653 const char *type0_name
= type0
->name ();
7654 const char *type1_name
= type1
->name ();
7656 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7657 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7663 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7667 ada_type_name (struct type
*type
)
7671 return type
->name ();
7674 /* Search the list of "descriptive" types associated to TYPE for a type
7675 whose name is NAME. */
7677 static struct type
*
7678 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7680 struct type
*result
, *tmp
;
7682 if (ada_ignore_descriptive_types_p
)
7685 /* If there no descriptive-type info, then there is no parallel type
7687 if (!HAVE_GNAT_AUX_INFO (type
))
7690 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7691 while (result
!= NULL
)
7693 const char *result_name
= ada_type_name (result
);
7695 if (result_name
== NULL
)
7697 warning (_("unexpected null name on descriptive type"));
7701 /* If the names match, stop. */
7702 if (strcmp (result_name
, name
) == 0)
7705 /* Otherwise, look at the next item on the list, if any. */
7706 if (HAVE_GNAT_AUX_INFO (result
))
7707 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7711 /* If not found either, try after having resolved the typedef. */
7716 result
= check_typedef (result
);
7717 if (HAVE_GNAT_AUX_INFO (result
))
7718 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7724 /* If we didn't find a match, see whether this is a packed array. With
7725 older compilers, the descriptive type information is either absent or
7726 irrelevant when it comes to packed arrays so the above lookup fails.
7727 Fall back to using a parallel lookup by name in this case. */
7728 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7729 return ada_find_any_type (name
);
7734 /* Find a parallel type to TYPE with the specified NAME, using the
7735 descriptive type taken from the debugging information, if available,
7736 and otherwise using the (slower) name-based method. */
7738 static struct type
*
7739 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7741 struct type
*result
= NULL
;
7743 if (HAVE_GNAT_AUX_INFO (type
))
7744 result
= find_parallel_type_by_descriptive_type (type
, name
);
7746 result
= ada_find_any_type (name
);
7751 /* Same as above, but specify the name of the parallel type by appending
7752 SUFFIX to the name of TYPE. */
7755 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7758 const char *type_name
= ada_type_name (type
);
7761 if (type_name
== NULL
)
7764 len
= strlen (type_name
);
7766 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7768 strcpy (name
, type_name
);
7769 strcpy (name
+ len
, suffix
);
7771 return ada_find_parallel_type_with_name (type
, name
);
7774 /* If TYPE is a variable-size record type, return the corresponding template
7775 type describing its fields. Otherwise, return NULL. */
7777 static struct type
*
7778 dynamic_template_type (struct type
*type
)
7780 type
= ada_check_typedef (type
);
7782 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7783 || ada_type_name (type
) == NULL
)
7787 int len
= strlen (ada_type_name (type
));
7789 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7792 return ada_find_parallel_type (type
, "___XVE");
7796 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7797 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7800 is_dynamic_field (struct type
*templ_type
, int field_num
)
7802 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7805 && templ_type
->field (field_num
).type ()->code () == TYPE_CODE_PTR
7806 && strstr (name
, "___XVL") != NULL
;
7809 /* The index of the variant field of TYPE, or -1 if TYPE does not
7810 represent a variant record type. */
7813 variant_field_index (struct type
*type
)
7817 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
7820 for (f
= 0; f
< type
->num_fields (); f
+= 1)
7822 if (ada_is_variant_part (type
, f
))
7828 /* A record type with no fields. */
7830 static struct type
*
7831 empty_record (struct type
*templ
)
7833 struct type
*type
= alloc_type_copy (templ
);
7835 type
->set_code (TYPE_CODE_STRUCT
);
7836 INIT_NONE_SPECIFIC (type
);
7837 type
->set_name ("<empty>");
7838 TYPE_LENGTH (type
) = 0;
7842 /* An ordinary record type (with fixed-length fields) that describes
7843 the value of type TYPE at VALADDR or ADDRESS (see comments at
7844 the beginning of this section) VAL according to GNAT conventions.
7845 DVAL0 should describe the (portion of a) record that contains any
7846 necessary discriminants. It should be NULL if value_type (VAL) is
7847 an outer-level type (i.e., as opposed to a branch of a variant.) A
7848 variant field (unless unchecked) is replaced by a particular branch
7851 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7852 length are not statically known are discarded. As a consequence,
7853 VALADDR, ADDRESS and DVAL0 are ignored.
7855 NOTE: Limitations: For now, we assume that dynamic fields and
7856 variants occupy whole numbers of bytes. However, they need not be
7860 ada_template_to_fixed_record_type_1 (struct type
*type
,
7861 const gdb_byte
*valaddr
,
7862 CORE_ADDR address
, struct value
*dval0
,
7863 int keep_dynamic_fields
)
7865 struct value
*mark
= value_mark ();
7868 int nfields
, bit_len
;
7874 /* Compute the number of fields in this record type that are going
7875 to be processed: unless keep_dynamic_fields, this includes only
7876 fields whose position and length are static will be processed. */
7877 if (keep_dynamic_fields
)
7878 nfields
= type
->num_fields ();
7882 while (nfields
< type
->num_fields ()
7883 && !ada_is_variant_part (type
, nfields
)
7884 && !is_dynamic_field (type
, nfields
))
7888 rtype
= alloc_type_copy (type
);
7889 rtype
->set_code (TYPE_CODE_STRUCT
);
7890 INIT_NONE_SPECIFIC (rtype
);
7891 rtype
->set_num_fields (nfields
);
7893 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
7894 rtype
->set_name (ada_type_name (type
));
7895 rtype
->set_is_fixed_instance (true);
7901 for (f
= 0; f
< nfields
; f
+= 1)
7903 off
= align_up (off
, field_alignment (type
, f
))
7904 + TYPE_FIELD_BITPOS (type
, f
);
7905 SET_FIELD_BITPOS (rtype
->field (f
), off
);
7906 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7908 if (ada_is_variant_part (type
, f
))
7913 else if (is_dynamic_field (type
, f
))
7915 const gdb_byte
*field_valaddr
= valaddr
;
7916 CORE_ADDR field_address
= address
;
7917 struct type
*field_type
=
7918 TYPE_TARGET_TYPE (type
->field (f
).type ());
7922 /* rtype's length is computed based on the run-time
7923 value of discriminants. If the discriminants are not
7924 initialized, the type size may be completely bogus and
7925 GDB may fail to allocate a value for it. So check the
7926 size first before creating the value. */
7927 ada_ensure_varsize_limit (rtype
);
7928 /* Using plain value_from_contents_and_address here
7929 causes problems because we will end up trying to
7930 resolve a type that is currently being
7932 dval
= value_from_contents_and_address_unresolved (rtype
,
7935 rtype
= value_type (dval
);
7940 /* If the type referenced by this field is an aligner type, we need
7941 to unwrap that aligner type, because its size might not be set.
7942 Keeping the aligner type would cause us to compute the wrong
7943 size for this field, impacting the offset of the all the fields
7944 that follow this one. */
7945 if (ada_is_aligner_type (field_type
))
7947 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7949 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7950 field_address
= cond_offset_target (field_address
, field_offset
);
7951 field_type
= ada_aligned_type (field_type
);
7954 field_valaddr
= cond_offset_host (field_valaddr
,
7955 off
/ TARGET_CHAR_BIT
);
7956 field_address
= cond_offset_target (field_address
,
7957 off
/ TARGET_CHAR_BIT
);
7959 /* Get the fixed type of the field. Note that, in this case,
7960 we do not want to get the real type out of the tag: if
7961 the current field is the parent part of a tagged record,
7962 we will get the tag of the object. Clearly wrong: the real
7963 type of the parent is not the real type of the child. We
7964 would end up in an infinite loop. */
7965 field_type
= ada_get_base_type (field_type
);
7966 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7967 field_address
, dval
, 0);
7968 /* If the field size is already larger than the maximum
7969 object size, then the record itself will necessarily
7970 be larger than the maximum object size. We need to make
7971 this check now, because the size might be so ridiculously
7972 large (due to an uninitialized variable in the inferior)
7973 that it would cause an overflow when adding it to the
7975 ada_ensure_varsize_limit (field_type
);
7977 rtype
->field (f
).set_type (field_type
);
7978 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7979 /* The multiplication can potentially overflow. But because
7980 the field length has been size-checked just above, and
7981 assuming that the maximum size is a reasonable value,
7982 an overflow should not happen in practice. So rather than
7983 adding overflow recovery code to this already complex code,
7984 we just assume that it's not going to happen. */
7986 TYPE_LENGTH (rtype
->field (f
).type ()) * TARGET_CHAR_BIT
;
7990 /* Note: If this field's type is a typedef, it is important
7991 to preserve the typedef layer.
7993 Otherwise, we might be transforming a typedef to a fat
7994 pointer (encoding a pointer to an unconstrained array),
7995 into a basic fat pointer (encoding an unconstrained
7996 array). As both types are implemented using the same
7997 structure, the typedef is the only clue which allows us
7998 to distinguish between the two options. Stripping it
7999 would prevent us from printing this field appropriately. */
8000 rtype
->field (f
).set_type (type
->field (f
).type ());
8001 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8002 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8004 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8007 struct type
*field_type
= type
->field (f
).type ();
8009 /* We need to be careful of typedefs when computing
8010 the length of our field. If this is a typedef,
8011 get the length of the target type, not the length
8013 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
8014 field_type
= ada_typedef_target_type (field_type
);
8017 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8020 if (off
+ fld_bit_len
> bit_len
)
8021 bit_len
= off
+ fld_bit_len
;
8023 TYPE_LENGTH (rtype
) =
8024 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8027 /* We handle the variant part, if any, at the end because of certain
8028 odd cases in which it is re-ordered so as NOT to be the last field of
8029 the record. This can happen in the presence of representation
8031 if (variant_field
>= 0)
8033 struct type
*branch_type
;
8035 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8039 /* Using plain value_from_contents_and_address here causes
8040 problems because we will end up trying to resolve a type
8041 that is currently being constructed. */
8042 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8044 rtype
= value_type (dval
);
8050 to_fixed_variant_branch_type
8051 (type
->field (variant_field
).type (),
8052 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8053 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8054 if (branch_type
== NULL
)
8056 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
8057 rtype
->field (f
- 1) = rtype
->field (f
);
8058 rtype
->set_num_fields (rtype
->num_fields () - 1);
8062 rtype
->field (variant_field
).set_type (branch_type
);
8063 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8065 TYPE_LENGTH (rtype
->field (variant_field
).type ()) *
8067 if (off
+ fld_bit_len
> bit_len
)
8068 bit_len
= off
+ fld_bit_len
;
8069 TYPE_LENGTH (rtype
) =
8070 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8074 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8075 should contain the alignment of that record, which should be a strictly
8076 positive value. If null or negative, then something is wrong, most
8077 probably in the debug info. In that case, we don't round up the size
8078 of the resulting type. If this record is not part of another structure,
8079 the current RTYPE length might be good enough for our purposes. */
8080 if (TYPE_LENGTH (type
) <= 0)
8083 warning (_("Invalid type size for `%s' detected: %s."),
8084 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
8086 warning (_("Invalid type size for <unnamed> detected: %s."),
8087 pulongest (TYPE_LENGTH (type
)));
8091 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
8092 TYPE_LENGTH (type
));
8095 value_free_to_mark (mark
);
8096 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8097 error (_("record type with dynamic size is larger than varsize-limit"));
8101 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8104 static struct type
*
8105 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8106 CORE_ADDR address
, struct value
*dval0
)
8108 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8112 /* An ordinary record type in which ___XVL-convention fields and
8113 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8114 static approximations, containing all possible fields. Uses
8115 no runtime values. Useless for use in values, but that's OK,
8116 since the results are used only for type determinations. Works on both
8117 structs and unions. Representation note: to save space, we memorize
8118 the result of this function in the TYPE_TARGET_TYPE of the
8121 static struct type
*
8122 template_to_static_fixed_type (struct type
*type0
)
8128 /* No need no do anything if the input type is already fixed. */
8129 if (type0
->is_fixed_instance ())
8132 /* Likewise if we already have computed the static approximation. */
8133 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8134 return TYPE_TARGET_TYPE (type0
);
8136 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8138 nfields
= type0
->num_fields ();
8140 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8141 recompute all over next time. */
8142 TYPE_TARGET_TYPE (type0
) = type
;
8144 for (f
= 0; f
< nfields
; f
+= 1)
8146 struct type
*field_type
= type0
->field (f
).type ();
8147 struct type
*new_type
;
8149 if (is_dynamic_field (type0
, f
))
8151 field_type
= ada_check_typedef (field_type
);
8152 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8155 new_type
= static_unwrap_type (field_type
);
8157 if (new_type
!= field_type
)
8159 /* Clone TYPE0 only the first time we get a new field type. */
8162 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8163 type
->set_code (type0
->code ());
8164 INIT_NONE_SPECIFIC (type
);
8165 type
->set_num_fields (nfields
);
8169 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
8170 memcpy (fields
, type0
->fields (),
8171 sizeof (struct field
) * nfields
);
8172 type
->set_fields (fields
);
8174 type
->set_name (ada_type_name (type0
));
8175 type
->set_is_fixed_instance (true);
8176 TYPE_LENGTH (type
) = 0;
8178 type
->field (f
).set_type (new_type
);
8179 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8186 /* Given an object of type TYPE whose contents are at VALADDR and
8187 whose address in memory is ADDRESS, returns a revision of TYPE,
8188 which should be a non-dynamic-sized record, in which the variant
8189 part, if any, is replaced with the appropriate branch. Looks
8190 for discriminant values in DVAL0, which can be NULL if the record
8191 contains the necessary discriminant values. */
8193 static struct type
*
8194 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8195 CORE_ADDR address
, struct value
*dval0
)
8197 struct value
*mark
= value_mark ();
8200 struct type
*branch_type
;
8201 int nfields
= type
->num_fields ();
8202 int variant_field
= variant_field_index (type
);
8204 if (variant_field
== -1)
8209 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8210 type
= value_type (dval
);
8215 rtype
= alloc_type_copy (type
);
8216 rtype
->set_code (TYPE_CODE_STRUCT
);
8217 INIT_NONE_SPECIFIC (rtype
);
8218 rtype
->set_num_fields (nfields
);
8221 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8222 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
8223 rtype
->set_fields (fields
);
8225 rtype
->set_name (ada_type_name (type
));
8226 rtype
->set_is_fixed_instance (true);
8227 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8229 branch_type
= to_fixed_variant_branch_type
8230 (type
->field (variant_field
).type (),
8231 cond_offset_host (valaddr
,
8232 TYPE_FIELD_BITPOS (type
, variant_field
)
8234 cond_offset_target (address
,
8235 TYPE_FIELD_BITPOS (type
, variant_field
)
8236 / TARGET_CHAR_BIT
), dval
);
8237 if (branch_type
== NULL
)
8241 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8242 rtype
->field (f
- 1) = rtype
->field (f
);
8243 rtype
->set_num_fields (rtype
->num_fields () - 1);
8247 rtype
->field (variant_field
).set_type (branch_type
);
8248 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8249 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8250 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8252 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (type
->field (variant_field
).type ());
8254 value_free_to_mark (mark
);
8258 /* An ordinary record type (with fixed-length fields) that describes
8259 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8260 beginning of this section]. Any necessary discriminants' values
8261 should be in DVAL, a record value; it may be NULL if the object
8262 at ADDR itself contains any necessary discriminant values.
8263 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8264 values from the record are needed. Except in the case that DVAL,
8265 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8266 unchecked) is replaced by a particular branch of the variant.
8268 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8269 is questionable and may be removed. It can arise during the
8270 processing of an unconstrained-array-of-record type where all the
8271 variant branches have exactly the same size. This is because in
8272 such cases, the compiler does not bother to use the XVS convention
8273 when encoding the record. I am currently dubious of this
8274 shortcut and suspect the compiler should be altered. FIXME. */
8276 static struct type
*
8277 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8278 CORE_ADDR address
, struct value
*dval
)
8280 struct type
*templ_type
;
8282 if (type0
->is_fixed_instance ())
8285 templ_type
= dynamic_template_type (type0
);
8287 if (templ_type
!= NULL
)
8288 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8289 else if (variant_field_index (type0
) >= 0)
8291 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8293 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8298 type0
->set_is_fixed_instance (true);
8304 /* An ordinary record type (with fixed-length fields) that describes
8305 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8306 union type. Any necessary discriminants' values should be in DVAL,
8307 a record value. That is, this routine selects the appropriate
8308 branch of the union at ADDR according to the discriminant value
8309 indicated in the union's type name. Returns VAR_TYPE0 itself if
8310 it represents a variant subject to a pragma Unchecked_Union. */
8312 static struct type
*
8313 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8314 CORE_ADDR address
, struct value
*dval
)
8317 struct type
*templ_type
;
8318 struct type
*var_type
;
8320 if (var_type0
->code () == TYPE_CODE_PTR
)
8321 var_type
= TYPE_TARGET_TYPE (var_type0
);
8323 var_type
= var_type0
;
8325 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8327 if (templ_type
!= NULL
)
8328 var_type
= templ_type
;
8330 if (is_unchecked_variant (var_type
, value_type (dval
)))
8332 which
= ada_which_variant_applies (var_type
, dval
);
8335 return empty_record (var_type
);
8336 else if (is_dynamic_field (var_type
, which
))
8337 return to_fixed_record_type
8338 (TYPE_TARGET_TYPE (var_type
->field (which
).type ()),
8339 valaddr
, address
, dval
);
8340 else if (variant_field_index (var_type
->field (which
).type ()) >= 0)
8342 to_fixed_record_type
8343 (var_type
->field (which
).type (), valaddr
, address
, dval
);
8345 return var_type
->field (which
).type ();
8348 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8349 ENCODING_TYPE, a type following the GNAT conventions for discrete
8350 type encodings, only carries redundant information. */
8353 ada_is_redundant_range_encoding (struct type
*range_type
,
8354 struct type
*encoding_type
)
8356 const char *bounds_str
;
8360 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8362 if (get_base_type (range_type
)->code ()
8363 != get_base_type (encoding_type
)->code ())
8365 /* The compiler probably used a simple base type to describe
8366 the range type instead of the range's actual base type,
8367 expecting us to get the real base type from the encoding
8368 anyway. In this situation, the encoding cannot be ignored
8373 if (is_dynamic_type (range_type
))
8376 if (encoding_type
->name () == NULL
)
8379 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8380 if (bounds_str
== NULL
)
8383 n
= 8; /* Skip "___XDLU_". */
8384 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8386 if (range_type
->bounds ()->low
.const_val () != lo
)
8389 n
+= 2; /* Skip the "__" separator between the two bounds. */
8390 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8392 if (range_type
->bounds ()->high
.const_val () != hi
)
8398 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8399 a type following the GNAT encoding for describing array type
8400 indices, only carries redundant information. */
8403 ada_is_redundant_index_type_desc (struct type
*array_type
,
8404 struct type
*desc_type
)
8406 struct type
*this_layer
= check_typedef (array_type
);
8409 for (i
= 0; i
< desc_type
->num_fields (); i
++)
8411 if (!ada_is_redundant_range_encoding (this_layer
->index_type (),
8412 desc_type
->field (i
).type ()))
8414 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8420 /* Assuming that TYPE0 is an array type describing the type of a value
8421 at ADDR, and that DVAL describes a record containing any
8422 discriminants used in TYPE0, returns a type for the value that
8423 contains no dynamic components (that is, no components whose sizes
8424 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8425 true, gives an error message if the resulting type's size is over
8428 static struct type
*
8429 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8432 struct type
*index_type_desc
;
8433 struct type
*result
;
8434 int constrained_packed_array_p
;
8435 static const char *xa_suffix
= "___XA";
8437 type0
= ada_check_typedef (type0
);
8438 if (type0
->is_fixed_instance ())
8441 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8442 if (constrained_packed_array_p
)
8444 type0
= decode_constrained_packed_array_type (type0
);
8445 if (type0
== nullptr)
8446 error (_("could not decode constrained packed array type"));
8449 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8451 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8452 encoding suffixed with 'P' may still be generated. If so,
8453 it should be used to find the XA type. */
8455 if (index_type_desc
== NULL
)
8457 const char *type_name
= ada_type_name (type0
);
8459 if (type_name
!= NULL
)
8461 const int len
= strlen (type_name
);
8462 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8464 if (type_name
[len
- 1] == 'P')
8466 strcpy (name
, type_name
);
8467 strcpy (name
+ len
- 1, xa_suffix
);
8468 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8473 ada_fixup_array_indexes_type (index_type_desc
);
8474 if (index_type_desc
!= NULL
8475 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8477 /* Ignore this ___XA parallel type, as it does not bring any
8478 useful information. This allows us to avoid creating fixed
8479 versions of the array's index types, which would be identical
8480 to the original ones. This, in turn, can also help avoid
8481 the creation of fixed versions of the array itself. */
8482 index_type_desc
= NULL
;
8485 if (index_type_desc
== NULL
)
8487 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8489 /* NOTE: elt_type---the fixed version of elt_type0---should never
8490 depend on the contents of the array in properly constructed
8492 /* Create a fixed version of the array element type.
8493 We're not providing the address of an element here,
8494 and thus the actual object value cannot be inspected to do
8495 the conversion. This should not be a problem, since arrays of
8496 unconstrained objects are not allowed. In particular, all
8497 the elements of an array of a tagged type should all be of
8498 the same type specified in the debugging info. No need to
8499 consult the object tag. */
8500 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8502 /* Make sure we always create a new array type when dealing with
8503 packed array types, since we're going to fix-up the array
8504 type length and element bitsize a little further down. */
8505 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8508 result
= create_array_type (alloc_type_copy (type0
),
8509 elt_type
, type0
->index_type ());
8514 struct type
*elt_type0
;
8517 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8518 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8520 /* NOTE: result---the fixed version of elt_type0---should never
8521 depend on the contents of the array in properly constructed
8523 /* Create a fixed version of the array element type.
8524 We're not providing the address of an element here,
8525 and thus the actual object value cannot be inspected to do
8526 the conversion. This should not be a problem, since arrays of
8527 unconstrained objects are not allowed. In particular, all
8528 the elements of an array of a tagged type should all be of
8529 the same type specified in the debugging info. No need to
8530 consult the object tag. */
8532 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8535 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8537 struct type
*range_type
=
8538 to_fixed_range_type (index_type_desc
->field (i
).type (), dval
);
8540 result
= create_array_type (alloc_type_copy (elt_type0
),
8541 result
, range_type
);
8542 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8544 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8545 error (_("array type with dynamic size is larger than varsize-limit"));
8548 /* We want to preserve the type name. This can be useful when
8549 trying to get the type name of a value that has already been
8550 printed (for instance, if the user did "print VAR; whatis $". */
8551 result
->set_name (type0
->name ());
8553 if (constrained_packed_array_p
)
8555 /* So far, the resulting type has been created as if the original
8556 type was a regular (non-packed) array type. As a result, the
8557 bitsize of the array elements needs to be set again, and the array
8558 length needs to be recomputed based on that bitsize. */
8559 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8560 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8562 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8563 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8564 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8565 TYPE_LENGTH (result
)++;
8568 result
->set_is_fixed_instance (true);
8573 /* A standard type (containing no dynamically sized components)
8574 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8575 DVAL describes a record containing any discriminants used in TYPE0,
8576 and may be NULL if there are none, or if the object of type TYPE at
8577 ADDRESS or in VALADDR contains these discriminants.
8579 If CHECK_TAG is not null, in the case of tagged types, this function
8580 attempts to locate the object's tag and use it to compute the actual
8581 type. However, when ADDRESS is null, we cannot use it to determine the
8582 location of the tag, and therefore compute the tagged type's actual type.
8583 So we return the tagged type without consulting the tag. */
8585 static struct type
*
8586 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8587 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8589 type
= ada_check_typedef (type
);
8591 /* Only un-fixed types need to be handled here. */
8592 if (!HAVE_GNAT_AUX_INFO (type
))
8595 switch (type
->code ())
8599 case TYPE_CODE_STRUCT
:
8601 struct type
*static_type
= to_static_fixed_type (type
);
8602 struct type
*fixed_record_type
=
8603 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8605 /* If STATIC_TYPE is a tagged type and we know the object's address,
8606 then we can determine its tag, and compute the object's actual
8607 type from there. Note that we have to use the fixed record
8608 type (the parent part of the record may have dynamic fields
8609 and the way the location of _tag is expressed may depend on
8612 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8615 value_tag_from_contents_and_address
8619 struct type
*real_type
= type_from_tag (tag
);
8621 value_from_contents_and_address (fixed_record_type
,
8624 fixed_record_type
= value_type (obj
);
8625 if (real_type
!= NULL
)
8626 return to_fixed_record_type
8628 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8631 /* Check to see if there is a parallel ___XVZ variable.
8632 If there is, then it provides the actual size of our type. */
8633 else if (ada_type_name (fixed_record_type
) != NULL
)
8635 const char *name
= ada_type_name (fixed_record_type
);
8637 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8638 bool xvz_found
= false;
8641 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8644 xvz_found
= get_int_var_value (xvz_name
, size
);
8646 catch (const gdb_exception_error
&except
)
8648 /* We found the variable, but somehow failed to read
8649 its value. Rethrow the same error, but with a little
8650 bit more information, to help the user understand
8651 what went wrong (Eg: the variable might have been
8653 throw_error (except
.error
,
8654 _("unable to read value of %s (%s)"),
8655 xvz_name
, except
.what ());
8658 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8660 fixed_record_type
= copy_type (fixed_record_type
);
8661 TYPE_LENGTH (fixed_record_type
) = size
;
8663 /* The FIXED_RECORD_TYPE may have be a stub. We have
8664 observed this when the debugging info is STABS, and
8665 apparently it is something that is hard to fix.
8667 In practice, we don't need the actual type definition
8668 at all, because the presence of the XVZ variable allows us
8669 to assume that there must be a XVS type as well, which we
8670 should be able to use later, when we need the actual type
8673 In the meantime, pretend that the "fixed" type we are
8674 returning is NOT a stub, because this can cause trouble
8675 when using this type to create new types targeting it.
8676 Indeed, the associated creation routines often check
8677 whether the target type is a stub and will try to replace
8678 it, thus using a type with the wrong size. This, in turn,
8679 might cause the new type to have the wrong size too.
8680 Consider the case of an array, for instance, where the size
8681 of the array is computed from the number of elements in
8682 our array multiplied by the size of its element. */
8683 fixed_record_type
->set_is_stub (false);
8686 return fixed_record_type
;
8688 case TYPE_CODE_ARRAY
:
8689 return to_fixed_array_type (type
, dval
, 1);
8690 case TYPE_CODE_UNION
:
8694 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8698 /* The same as ada_to_fixed_type_1, except that it preserves the type
8699 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8701 The typedef layer needs be preserved in order to differentiate between
8702 arrays and array pointers when both types are implemented using the same
8703 fat pointer. In the array pointer case, the pointer is encoded as
8704 a typedef of the pointer type. For instance, considering:
8706 type String_Access is access String;
8707 S1 : String_Access := null;
8709 To the debugger, S1 is defined as a typedef of type String. But
8710 to the user, it is a pointer. So if the user tries to print S1,
8711 we should not dereference the array, but print the array address
8714 If we didn't preserve the typedef layer, we would lose the fact that
8715 the type is to be presented as a pointer (needs de-reference before
8716 being printed). And we would also use the source-level type name. */
8719 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8720 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8723 struct type
*fixed_type
=
8724 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8726 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8727 then preserve the typedef layer.
8729 Implementation note: We can only check the main-type portion of
8730 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8731 from TYPE now returns a type that has the same instance flags
8732 as TYPE. For instance, if TYPE is a "typedef const", and its
8733 target type is a "struct", then the typedef elimination will return
8734 a "const" version of the target type. See check_typedef for more
8735 details about how the typedef layer elimination is done.
8737 brobecker/2010-11-19: It seems to me that the only case where it is
8738 useful to preserve the typedef layer is when dealing with fat pointers.
8739 Perhaps, we could add a check for that and preserve the typedef layer
8740 only in that situation. But this seems unnecessary so far, probably
8741 because we call check_typedef/ada_check_typedef pretty much everywhere.
8743 if (type
->code () == TYPE_CODE_TYPEDEF
8744 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8745 == TYPE_MAIN_TYPE (fixed_type
)))
8751 /* A standard (static-sized) type corresponding as well as possible to
8752 TYPE0, but based on no runtime data. */
8754 static struct type
*
8755 to_static_fixed_type (struct type
*type0
)
8762 if (type0
->is_fixed_instance ())
8765 type0
= ada_check_typedef (type0
);
8767 switch (type0
->code ())
8771 case TYPE_CODE_STRUCT
:
8772 type
= dynamic_template_type (type0
);
8774 return template_to_static_fixed_type (type
);
8776 return template_to_static_fixed_type (type0
);
8777 case TYPE_CODE_UNION
:
8778 type
= ada_find_parallel_type (type0
, "___XVU");
8780 return template_to_static_fixed_type (type
);
8782 return template_to_static_fixed_type (type0
);
8786 /* A static approximation of TYPE with all type wrappers removed. */
8788 static struct type
*
8789 static_unwrap_type (struct type
*type
)
8791 if (ada_is_aligner_type (type
))
8793 struct type
*type1
= ada_check_typedef (type
)->field (0).type ();
8794 if (ada_type_name (type1
) == NULL
)
8795 type1
->set_name (ada_type_name (type
));
8797 return static_unwrap_type (type1
);
8801 struct type
*raw_real_type
= ada_get_base_type (type
);
8803 if (raw_real_type
== type
)
8806 return to_static_fixed_type (raw_real_type
);
8810 /* In some cases, incomplete and private types require
8811 cross-references that are not resolved as records (for example,
8813 type FooP is access Foo;
8815 type Foo is array ...;
8816 ). In these cases, since there is no mechanism for producing
8817 cross-references to such types, we instead substitute for FooP a
8818 stub enumeration type that is nowhere resolved, and whose tag is
8819 the name of the actual type. Call these types "non-record stubs". */
8821 /* A type equivalent to TYPE that is not a non-record stub, if one
8822 exists, otherwise TYPE. */
8825 ada_check_typedef (struct type
*type
)
8830 /* If our type is an access to an unconstrained array, which is encoded
8831 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
8832 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8833 what allows us to distinguish between fat pointers that represent
8834 array types, and fat pointers that represent array access types
8835 (in both cases, the compiler implements them as fat pointers). */
8836 if (ada_is_access_to_unconstrained_array (type
))
8839 type
= check_typedef (type
);
8840 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
8841 || !type
->is_stub ()
8842 || type
->name () == NULL
)
8846 const char *name
= type
->name ();
8847 struct type
*type1
= ada_find_any_type (name
);
8852 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8853 stubs pointing to arrays, as we don't create symbols for array
8854 types, only for the typedef-to-array types). If that's the case,
8855 strip the typedef layer. */
8856 if (type1
->code () == TYPE_CODE_TYPEDEF
)
8857 type1
= ada_check_typedef (type1
);
8863 /* A value representing the data at VALADDR/ADDRESS as described by
8864 type TYPE0, but with a standard (static-sized) type that correctly
8865 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8866 type, then return VAL0 [this feature is simply to avoid redundant
8867 creation of struct values]. */
8869 static struct value
*
8870 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8873 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8875 if (type
== type0
&& val0
!= NULL
)
8878 if (VALUE_LVAL (val0
) != lval_memory
)
8880 /* Our value does not live in memory; it could be a convenience
8881 variable, for instance. Create a not_lval value using val0's
8883 return value_from_contents (type
, value_contents (val0
));
8886 return value_from_contents_and_address (type
, 0, address
);
8889 /* A value representing VAL, but with a standard (static-sized) type
8890 that correctly describes it. Does not necessarily create a new
8894 ada_to_fixed_value (struct value
*val
)
8896 val
= unwrap_value (val
);
8897 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
8904 /* Table mapping attribute numbers to names.
8905 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8907 static const char * const attribute_names
[] = {
8925 ada_attribute_name (enum exp_opcode n
)
8927 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8928 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8930 return attribute_names
[0];
8933 /* Evaluate the 'POS attribute applied to ARG. */
8936 pos_atr (struct value
*arg
)
8938 struct value
*val
= coerce_ref (arg
);
8939 struct type
*type
= value_type (val
);
8941 if (!discrete_type_p (type
))
8942 error (_("'POS only defined on discrete types"));
8944 gdb::optional
<LONGEST
> result
= discrete_position (type
, value_as_long (val
));
8945 if (!result
.has_value ())
8946 error (_("enumeration value is invalid: can't find 'POS"));
8951 static struct value
*
8952 value_pos_atr (struct type
*type
, struct value
*arg
)
8954 return value_from_longest (type
, pos_atr (arg
));
8957 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8959 static struct value
*
8960 val_atr (struct type
*type
, LONGEST val
)
8962 gdb_assert (discrete_type_p (type
));
8963 if (type
->code () == TYPE_CODE_RANGE
)
8964 type
= TYPE_TARGET_TYPE (type
);
8965 if (type
->code () == TYPE_CODE_ENUM
)
8967 if (val
< 0 || val
>= type
->num_fields ())
8968 error (_("argument to 'VAL out of range"));
8969 val
= TYPE_FIELD_ENUMVAL (type
, val
);
8971 return value_from_longest (type
, val
);
8974 static struct value
*
8975 value_val_atr (struct type
*type
, struct value
*arg
)
8977 if (!discrete_type_p (type
))
8978 error (_("'VAL only defined on discrete types"));
8979 if (!integer_type_p (value_type (arg
)))
8980 error (_("'VAL requires integral argument"));
8982 return val_atr (type
, value_as_long (arg
));
8988 /* True if TYPE appears to be an Ada character type.
8989 [At the moment, this is true only for Character and Wide_Character;
8990 It is a heuristic test that could stand improvement]. */
8993 ada_is_character_type (struct type
*type
)
8997 /* If the type code says it's a character, then assume it really is,
8998 and don't check any further. */
8999 if (type
->code () == TYPE_CODE_CHAR
)
9002 /* Otherwise, assume it's a character type iff it is a discrete type
9003 with a known character type name. */
9004 name
= ada_type_name (type
);
9005 return (name
!= NULL
9006 && (type
->code () == TYPE_CODE_INT
9007 || type
->code () == TYPE_CODE_RANGE
)
9008 && (strcmp (name
, "character") == 0
9009 || strcmp (name
, "wide_character") == 0
9010 || strcmp (name
, "wide_wide_character") == 0
9011 || strcmp (name
, "unsigned char") == 0));
9014 /* True if TYPE appears to be an Ada string type. */
9017 ada_is_string_type (struct type
*type
)
9019 type
= ada_check_typedef (type
);
9021 && type
->code () != TYPE_CODE_PTR
9022 && (ada_is_simple_array_type (type
)
9023 || ada_is_array_descriptor_type (type
))
9024 && ada_array_arity (type
) == 1)
9026 struct type
*elttype
= ada_array_element_type (type
, 1);
9028 return ada_is_character_type (elttype
);
9034 /* The compiler sometimes provides a parallel XVS type for a given
9035 PAD type. Normally, it is safe to follow the PAD type directly,
9036 but older versions of the compiler have a bug that causes the offset
9037 of its "F" field to be wrong. Following that field in that case
9038 would lead to incorrect results, but this can be worked around
9039 by ignoring the PAD type and using the associated XVS type instead.
9041 Set to True if the debugger should trust the contents of PAD types.
9042 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9043 static bool trust_pad_over_xvs
= true;
9045 /* True if TYPE is a struct type introduced by the compiler to force the
9046 alignment of a value. Such types have a single field with a
9047 distinctive name. */
9050 ada_is_aligner_type (struct type
*type
)
9052 type
= ada_check_typedef (type
);
9054 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9057 return (type
->code () == TYPE_CODE_STRUCT
9058 && type
->num_fields () == 1
9059 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9062 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9063 the parallel type. */
9066 ada_get_base_type (struct type
*raw_type
)
9068 struct type
*real_type_namer
;
9069 struct type
*raw_real_type
;
9071 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
9074 if (ada_is_aligner_type (raw_type
))
9075 /* The encoding specifies that we should always use the aligner type.
9076 So, even if this aligner type has an associated XVS type, we should
9079 According to the compiler gurus, an XVS type parallel to an aligner
9080 type may exist because of a stabs limitation. In stabs, aligner
9081 types are empty because the field has a variable-sized type, and
9082 thus cannot actually be used as an aligner type. As a result,
9083 we need the associated parallel XVS type to decode the type.
9084 Since the policy in the compiler is to not change the internal
9085 representation based on the debugging info format, we sometimes
9086 end up having a redundant XVS type parallel to the aligner type. */
9089 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9090 if (real_type_namer
== NULL
9091 || real_type_namer
->code () != TYPE_CODE_STRUCT
9092 || real_type_namer
->num_fields () != 1)
9095 if (real_type_namer
->field (0).type ()->code () != TYPE_CODE_REF
)
9097 /* This is an older encoding form where the base type needs to be
9098 looked up by name. We prefer the newer encoding because it is
9100 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9101 if (raw_real_type
== NULL
)
9104 return raw_real_type
;
9107 /* The field in our XVS type is a reference to the base type. */
9108 return TYPE_TARGET_TYPE (real_type_namer
->field (0).type ());
9111 /* The type of value designated by TYPE, with all aligners removed. */
9114 ada_aligned_type (struct type
*type
)
9116 if (ada_is_aligner_type (type
))
9117 return ada_aligned_type (type
->field (0).type ());
9119 return ada_get_base_type (type
);
9123 /* The address of the aligned value in an object at address VALADDR
9124 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9127 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9129 if (ada_is_aligner_type (type
))
9130 return ada_aligned_value_addr (type
->field (0).type (),
9132 TYPE_FIELD_BITPOS (type
,
9133 0) / TARGET_CHAR_BIT
);
9140 /* The printed representation of an enumeration literal with encoded
9141 name NAME. The value is good to the next call of ada_enum_name. */
9143 ada_enum_name (const char *name
)
9145 static char *result
;
9146 static size_t result_len
= 0;
9149 /* First, unqualify the enumeration name:
9150 1. Search for the last '.' character. If we find one, then skip
9151 all the preceding characters, the unqualified name starts
9152 right after that dot.
9153 2. Otherwise, we may be debugging on a target where the compiler
9154 translates dots into "__". Search forward for double underscores,
9155 but stop searching when we hit an overloading suffix, which is
9156 of the form "__" followed by digits. */
9158 tmp
= strrchr (name
, '.');
9163 while ((tmp
= strstr (name
, "__")) != NULL
)
9165 if (isdigit (tmp
[2]))
9176 if (name
[1] == 'U' || name
[1] == 'W')
9178 if (sscanf (name
+ 2, "%x", &v
) != 1)
9181 else if (((name
[1] >= '0' && name
[1] <= '9')
9182 || (name
[1] >= 'a' && name
[1] <= 'z'))
9185 GROW_VECT (result
, result_len
, 4);
9186 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9192 GROW_VECT (result
, result_len
, 16);
9193 if (isascii (v
) && isprint (v
))
9194 xsnprintf (result
, result_len
, "'%c'", v
);
9195 else if (name
[1] == 'U')
9196 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9198 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9204 tmp
= strstr (name
, "__");
9206 tmp
= strstr (name
, "$");
9209 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9210 strncpy (result
, name
, tmp
- name
);
9211 result
[tmp
- name
] = '\0';
9219 /* Evaluate the subexpression of EXP starting at *POS as for
9220 evaluate_type, updating *POS to point just past the evaluated
9223 static struct value
*
9224 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9226 return evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9229 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9232 static struct value
*
9233 unwrap_value (struct value
*val
)
9235 struct type
*type
= ada_check_typedef (value_type (val
));
9237 if (ada_is_aligner_type (type
))
9239 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9240 struct type
*val_type
= ada_check_typedef (value_type (v
));
9242 if (ada_type_name (val_type
) == NULL
)
9243 val_type
->set_name (ada_type_name (type
));
9245 return unwrap_value (v
);
9249 struct type
*raw_real_type
=
9250 ada_check_typedef (ada_get_base_type (type
));
9252 /* If there is no parallel XVS or XVE type, then the value is
9253 already unwrapped. Return it without further modification. */
9254 if ((type
== raw_real_type
)
9255 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9259 coerce_unspec_val_to_type
9260 (val
, ada_to_fixed_type (raw_real_type
, 0,
9261 value_address (val
),
9266 static struct value
*
9267 cast_from_gnat_encoded_fixed_point_type (struct type
*type
, struct value
*arg
)
9270 = gnat_encoded_fixed_point_scaling_factor (value_type (arg
));
9271 arg
= value_cast (value_type (scale
), arg
);
9273 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9274 return value_cast (type
, arg
);
9277 static struct value
*
9278 cast_to_gnat_encoded_fixed_point_type (struct type
*type
, struct value
*arg
)
9280 if (type
== value_type (arg
))
9283 struct value
*scale
= gnat_encoded_fixed_point_scaling_factor (type
);
9284 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg
)))
9285 arg
= cast_from_gnat_encoded_fixed_point_type (value_type (scale
), arg
);
9287 arg
= value_cast (value_type (scale
), arg
);
9289 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9290 return value_cast (type
, arg
);
9293 /* Given two array types T1 and T2, return nonzero iff both arrays
9294 contain the same number of elements. */
9297 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9299 LONGEST lo1
, hi1
, lo2
, hi2
;
9301 /* Get the array bounds in order to verify that the size of
9302 the two arrays match. */
9303 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9304 || !get_array_bounds (t2
, &lo2
, &hi2
))
9305 error (_("unable to determine array bounds"));
9307 /* To make things easier for size comparison, normalize a bit
9308 the case of empty arrays by making sure that the difference
9309 between upper bound and lower bound is always -1. */
9315 return (hi1
- lo1
== hi2
- lo2
);
9318 /* Assuming that VAL is an array of integrals, and TYPE represents
9319 an array with the same number of elements, but with wider integral
9320 elements, return an array "casted" to TYPE. In practice, this
9321 means that the returned array is built by casting each element
9322 of the original array into TYPE's (wider) element type. */
9324 static struct value
*
9325 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9327 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9332 /* Verify that both val and type are arrays of scalars, and
9333 that the size of val's elements is smaller than the size
9334 of type's element. */
9335 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9336 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9337 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9338 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9339 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9340 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9342 if (!get_array_bounds (type
, &lo
, &hi
))
9343 error (_("unable to determine array bounds"));
9345 res
= allocate_value (type
);
9347 /* Promote each array element. */
9348 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9350 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9352 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9353 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9359 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9360 return the converted value. */
9362 static struct value
*
9363 coerce_for_assign (struct type
*type
, struct value
*val
)
9365 struct type
*type2
= value_type (val
);
9370 type2
= ada_check_typedef (type2
);
9371 type
= ada_check_typedef (type
);
9373 if (type2
->code () == TYPE_CODE_PTR
9374 && type
->code () == TYPE_CODE_ARRAY
)
9376 val
= ada_value_ind (val
);
9377 type2
= value_type (val
);
9380 if (type2
->code () == TYPE_CODE_ARRAY
9381 && type
->code () == TYPE_CODE_ARRAY
)
9383 if (!ada_same_array_size_p (type
, type2
))
9384 error (_("cannot assign arrays of different length"));
9386 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9387 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9388 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9389 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9391 /* Allow implicit promotion of the array elements to
9393 return ada_promote_array_of_integrals (type
, val
);
9396 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9397 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9398 error (_("Incompatible types in assignment"));
9399 deprecated_set_value_type (val
, type
);
9404 static struct value
*
9405 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9408 struct type
*type1
, *type2
;
9411 arg1
= coerce_ref (arg1
);
9412 arg2
= coerce_ref (arg2
);
9413 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9414 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9416 if (type1
->code () != TYPE_CODE_INT
9417 || type2
->code () != TYPE_CODE_INT
)
9418 return value_binop (arg1
, arg2
, op
);
9427 return value_binop (arg1
, arg2
, op
);
9430 v2
= value_as_long (arg2
);
9432 error (_("second operand of %s must not be zero."), op_string (op
));
9434 if (type1
->is_unsigned () || op
== BINOP_MOD
)
9435 return value_binop (arg1
, arg2
, op
);
9437 v1
= value_as_long (arg1
);
9442 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9443 v
+= v
> 0 ? -1 : 1;
9451 /* Should not reach this point. */
9455 val
= allocate_value (type1
);
9456 store_unsigned_integer (value_contents_raw (val
),
9457 TYPE_LENGTH (value_type (val
)),
9458 type_byte_order (type1
), v
);
9463 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9465 if (ada_is_direct_array_type (value_type (arg1
))
9466 || ada_is_direct_array_type (value_type (arg2
)))
9468 struct type
*arg1_type
, *arg2_type
;
9470 /* Automatically dereference any array reference before
9471 we attempt to perform the comparison. */
9472 arg1
= ada_coerce_ref (arg1
);
9473 arg2
= ada_coerce_ref (arg2
);
9475 arg1
= ada_coerce_to_simple_array (arg1
);
9476 arg2
= ada_coerce_to_simple_array (arg2
);
9478 arg1_type
= ada_check_typedef (value_type (arg1
));
9479 arg2_type
= ada_check_typedef (value_type (arg2
));
9481 if (arg1_type
->code () != TYPE_CODE_ARRAY
9482 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9483 error (_("Attempt to compare array with non-array"));
9484 /* FIXME: The following works only for types whose
9485 representations use all bits (no padding or undefined bits)
9486 and do not have user-defined equality. */
9487 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9488 && memcmp (value_contents (arg1
), value_contents (arg2
),
9489 TYPE_LENGTH (arg1_type
)) == 0);
9491 return value_equal (arg1
, arg2
);
9494 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9495 component of LHS (a simple array or a record), updating *POS past
9496 the expression, assuming that LHS is contained in CONTAINER. Does
9497 not modify the inferior's memory, nor does it modify LHS (unless
9498 LHS == CONTAINER). */
9501 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9502 struct expression
*exp
, int *pos
)
9504 struct value
*mark
= value_mark ();
9506 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9508 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9510 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9511 struct value
*index_val
= value_from_longest (index_type
, index
);
9513 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9517 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9518 elt
= ada_to_fixed_value (elt
);
9521 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9522 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9524 value_assign_to_component (container
, elt
,
9525 ada_evaluate_subexp (NULL
, exp
, pos
,
9528 value_free_to_mark (mark
);
9531 /* Assuming that LHS represents an lvalue having a record or array
9532 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9533 of that aggregate's value to LHS, advancing *POS past the
9534 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9535 lvalue containing LHS (possibly LHS itself). Does not modify
9536 the inferior's memory, nor does it modify the contents of
9537 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9539 static struct value
*
9540 assign_aggregate (struct value
*container
,
9541 struct value
*lhs
, struct expression
*exp
,
9542 int *pos
, enum noside noside
)
9544 struct type
*lhs_type
;
9545 int n
= exp
->elts
[*pos
+1].longconst
;
9546 LONGEST low_index
, high_index
;
9550 if (noside
!= EVAL_NORMAL
)
9552 for (i
= 0; i
< n
; i
+= 1)
9553 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9557 container
= ada_coerce_ref (container
);
9558 if (ada_is_direct_array_type (value_type (container
)))
9559 container
= ada_coerce_to_simple_array (container
);
9560 lhs
= ada_coerce_ref (lhs
);
9561 if (!deprecated_value_modifiable (lhs
))
9562 error (_("Left operand of assignment is not a modifiable lvalue."));
9564 lhs_type
= check_typedef (value_type (lhs
));
9565 if (ada_is_direct_array_type (lhs_type
))
9567 lhs
= ada_coerce_to_simple_array (lhs
);
9568 lhs_type
= check_typedef (value_type (lhs
));
9569 low_index
= lhs_type
->bounds ()->low
.const_val ();
9570 high_index
= lhs_type
->bounds ()->high
.const_val ();
9572 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9575 high_index
= num_visible_fields (lhs_type
) - 1;
9578 error (_("Left-hand side must be array or record."));
9580 std::vector
<LONGEST
> indices (4);
9581 indices
[0] = indices
[1] = low_index
- 1;
9582 indices
[2] = indices
[3] = high_index
+ 1;
9584 for (i
= 0; i
< n
; i
+= 1)
9586 switch (exp
->elts
[*pos
].opcode
)
9589 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9590 low_index
, high_index
);
9593 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9594 low_index
, high_index
);
9598 error (_("Misplaced 'others' clause"));
9599 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9600 low_index
, high_index
);
9603 error (_("Internal error: bad aggregate clause"));
9610 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9611 construct at *POS, updating *POS past the construct, given that
9612 the positions are relative to lower bound LOW, where HIGH is the
9613 upper bound. Record the position in INDICES. CONTAINER is as for
9614 assign_aggregate. */
9616 aggregate_assign_positional (struct value
*container
,
9617 struct value
*lhs
, struct expression
*exp
,
9618 int *pos
, std::vector
<LONGEST
> &indices
,
9619 LONGEST low
, LONGEST high
)
9621 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9623 if (ind
- 1 == high
)
9624 warning (_("Extra components in aggregate ignored."));
9627 add_component_interval (ind
, ind
, indices
);
9629 assign_component (container
, lhs
, ind
, exp
, pos
);
9632 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9635 /* Assign into the components of LHS indexed by the OP_CHOICES
9636 construct at *POS, updating *POS past the construct, given that
9637 the allowable indices are LOW..HIGH. Record the indices assigned
9638 to in INDICES. CONTAINER is as for assign_aggregate. */
9640 aggregate_assign_from_choices (struct value
*container
,
9641 struct value
*lhs
, struct expression
*exp
,
9642 int *pos
, std::vector
<LONGEST
> &indices
,
9643 LONGEST low
, LONGEST high
)
9646 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9647 int choice_pos
, expr_pc
;
9648 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9650 choice_pos
= *pos
+= 3;
9652 for (j
= 0; j
< n_choices
; j
+= 1)
9653 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9655 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9657 for (j
= 0; j
< n_choices
; j
+= 1)
9659 LONGEST lower
, upper
;
9660 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9662 if (op
== OP_DISCRETE_RANGE
)
9665 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9667 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9672 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9684 name
= &exp
->elts
[choice_pos
+ 2].string
;
9687 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9690 error (_("Invalid record component association."));
9692 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9694 if (! find_struct_field (name
, value_type (lhs
), 0,
9695 NULL
, NULL
, NULL
, NULL
, &ind
))
9696 error (_("Unknown component name: %s."), name
);
9697 lower
= upper
= ind
;
9700 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9701 error (_("Index in component association out of bounds."));
9703 add_component_interval (lower
, upper
, indices
);
9704 while (lower
<= upper
)
9709 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9715 /* Assign the value of the expression in the OP_OTHERS construct in
9716 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9717 have not been previously assigned. The index intervals already assigned
9718 are in INDICES. Updates *POS to after the OP_OTHERS clause.
9719 CONTAINER is as for assign_aggregate. */
9721 aggregate_assign_others (struct value
*container
,
9722 struct value
*lhs
, struct expression
*exp
,
9723 int *pos
, std::vector
<LONGEST
> &indices
,
9724 LONGEST low
, LONGEST high
)
9727 int expr_pc
= *pos
+ 1;
9729 int num_indices
= indices
.size ();
9730 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9734 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9739 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9742 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9745 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9746 [ INDICES[0] .. INDICES[1] ],... The resulting intervals do not
9749 add_component_interval (LONGEST low
, LONGEST high
,
9750 std::vector
<LONGEST
> &indices
)
9754 int size
= indices
.size ();
9755 for (i
= 0; i
< size
; i
+= 2) {
9756 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9760 for (kh
= i
+ 2; kh
< size
; kh
+= 2)
9761 if (high
< indices
[kh
])
9763 if (low
< indices
[i
])
9765 indices
[i
+ 1] = indices
[kh
- 1];
9766 if (high
> indices
[i
+ 1])
9767 indices
[i
+ 1] = high
;
9768 memcpy (indices
.data () + i
+ 2, indices
.data () + kh
, size
- kh
);
9769 indices
.resize (kh
- i
- 2);
9772 else if (high
< indices
[i
])
9776 indices
.resize (indices
.size () + 2);
9777 for (j
= indices
.size () - 1; j
>= i
+ 2; j
-= 1)
9778 indices
[j
] = indices
[j
- 2];
9780 indices
[i
+ 1] = high
;
9783 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9786 static struct value
*
9787 ada_value_cast (struct type
*type
, struct value
*arg2
)
9789 if (type
== ada_check_typedef (value_type (arg2
)))
9792 if (ada_is_gnat_encoded_fixed_point_type (type
))
9793 return cast_to_gnat_encoded_fixed_point_type (type
, arg2
);
9795 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
9796 return cast_from_gnat_encoded_fixed_point_type (type
, arg2
);
9798 return value_cast (type
, arg2
);
9801 /* Evaluating Ada expressions, and printing their result.
9802 ------------------------------------------------------
9807 We usually evaluate an Ada expression in order to print its value.
9808 We also evaluate an expression in order to print its type, which
9809 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9810 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9811 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9812 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9815 Evaluating expressions is a little more complicated for Ada entities
9816 than it is for entities in languages such as C. The main reason for
9817 this is that Ada provides types whose definition might be dynamic.
9818 One example of such types is variant records. Or another example
9819 would be an array whose bounds can only be known at run time.
9821 The following description is a general guide as to what should be
9822 done (and what should NOT be done) in order to evaluate an expression
9823 involving such types, and when. This does not cover how the semantic
9824 information is encoded by GNAT as this is covered separatly. For the
9825 document used as the reference for the GNAT encoding, see exp_dbug.ads
9826 in the GNAT sources.
9828 Ideally, we should embed each part of this description next to its
9829 associated code. Unfortunately, the amount of code is so vast right
9830 now that it's hard to see whether the code handling a particular
9831 situation might be duplicated or not. One day, when the code is
9832 cleaned up, this guide might become redundant with the comments
9833 inserted in the code, and we might want to remove it.
9835 2. ``Fixing'' an Entity, the Simple Case:
9836 -----------------------------------------
9838 When evaluating Ada expressions, the tricky issue is that they may
9839 reference entities whose type contents and size are not statically
9840 known. Consider for instance a variant record:
9842 type Rec (Empty : Boolean := True) is record
9845 when False => Value : Integer;
9848 Yes : Rec := (Empty => False, Value => 1);
9849 No : Rec := (empty => True);
9851 The size and contents of that record depends on the value of the
9852 descriminant (Rec.Empty). At this point, neither the debugging
9853 information nor the associated type structure in GDB are able to
9854 express such dynamic types. So what the debugger does is to create
9855 "fixed" versions of the type that applies to the specific object.
9856 We also informally refer to this operation as "fixing" an object,
9857 which means creating its associated fixed type.
9859 Example: when printing the value of variable "Yes" above, its fixed
9860 type would look like this:
9867 On the other hand, if we printed the value of "No", its fixed type
9874 Things become a little more complicated when trying to fix an entity
9875 with a dynamic type that directly contains another dynamic type,
9876 such as an array of variant records, for instance. There are
9877 two possible cases: Arrays, and records.
9879 3. ``Fixing'' Arrays:
9880 ---------------------
9882 The type structure in GDB describes an array in terms of its bounds,
9883 and the type of its elements. By design, all elements in the array
9884 have the same type and we cannot represent an array of variant elements
9885 using the current type structure in GDB. When fixing an array,
9886 we cannot fix the array element, as we would potentially need one
9887 fixed type per element of the array. As a result, the best we can do
9888 when fixing an array is to produce an array whose bounds and size
9889 are correct (allowing us to read it from memory), but without having
9890 touched its element type. Fixing each element will be done later,
9891 when (if) necessary.
9893 Arrays are a little simpler to handle than records, because the same
9894 amount of memory is allocated for each element of the array, even if
9895 the amount of space actually used by each element differs from element
9896 to element. Consider for instance the following array of type Rec:
9898 type Rec_Array is array (1 .. 2) of Rec;
9900 The actual amount of memory occupied by each element might be different
9901 from element to element, depending on the value of their discriminant.
9902 But the amount of space reserved for each element in the array remains
9903 fixed regardless. So we simply need to compute that size using
9904 the debugging information available, from which we can then determine
9905 the array size (we multiply the number of elements of the array by
9906 the size of each element).
9908 The simplest case is when we have an array of a constrained element
9909 type. For instance, consider the following type declarations:
9911 type Bounded_String (Max_Size : Integer) is
9913 Buffer : String (1 .. Max_Size);
9915 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9917 In this case, the compiler describes the array as an array of
9918 variable-size elements (identified by its XVS suffix) for which
9919 the size can be read in the parallel XVZ variable.
9921 In the case of an array of an unconstrained element type, the compiler
9922 wraps the array element inside a private PAD type. This type should not
9923 be shown to the user, and must be "unwrap"'ed before printing. Note
9924 that we also use the adjective "aligner" in our code to designate
9925 these wrapper types.
9927 In some cases, the size allocated for each element is statically
9928 known. In that case, the PAD type already has the correct size,
9929 and the array element should remain unfixed.
9931 But there are cases when this size is not statically known.
9932 For instance, assuming that "Five" is an integer variable:
9934 type Dynamic is array (1 .. Five) of Integer;
9935 type Wrapper (Has_Length : Boolean := False) is record
9938 when True => Length : Integer;
9942 type Wrapper_Array is array (1 .. 2) of Wrapper;
9944 Hello : Wrapper_Array := (others => (Has_Length => True,
9945 Data => (others => 17),
9949 The debugging info would describe variable Hello as being an
9950 array of a PAD type. The size of that PAD type is not statically
9951 known, but can be determined using a parallel XVZ variable.
9952 In that case, a copy of the PAD type with the correct size should
9953 be used for the fixed array.
9955 3. ``Fixing'' record type objects:
9956 ----------------------------------
9958 Things are slightly different from arrays in the case of dynamic
9959 record types. In this case, in order to compute the associated
9960 fixed type, we need to determine the size and offset of each of
9961 its components. This, in turn, requires us to compute the fixed
9962 type of each of these components.
9964 Consider for instance the example:
9966 type Bounded_String (Max_Size : Natural) is record
9967 Str : String (1 .. Max_Size);
9970 My_String : Bounded_String (Max_Size => 10);
9972 In that case, the position of field "Length" depends on the size
9973 of field Str, which itself depends on the value of the Max_Size
9974 discriminant. In order to fix the type of variable My_String,
9975 we need to fix the type of field Str. Therefore, fixing a variant
9976 record requires us to fix each of its components.
9978 However, if a component does not have a dynamic size, the component
9979 should not be fixed. In particular, fields that use a PAD type
9980 should not fixed. Here is an example where this might happen
9981 (assuming type Rec above):
9983 type Container (Big : Boolean) is record
9987 when True => Another : Integer;
9991 My_Container : Container := (Big => False,
9992 First => (Empty => True),
9995 In that example, the compiler creates a PAD type for component First,
9996 whose size is constant, and then positions the component After just
9997 right after it. The offset of component After is therefore constant
10000 The debugger computes the position of each field based on an algorithm
10001 that uses, among other things, the actual position and size of the field
10002 preceding it. Let's now imagine that the user is trying to print
10003 the value of My_Container. If the type fixing was recursive, we would
10004 end up computing the offset of field After based on the size of the
10005 fixed version of field First. And since in our example First has
10006 only one actual field, the size of the fixed type is actually smaller
10007 than the amount of space allocated to that field, and thus we would
10008 compute the wrong offset of field After.
10010 To make things more complicated, we need to watch out for dynamic
10011 components of variant records (identified by the ___XVL suffix in
10012 the component name). Even if the target type is a PAD type, the size
10013 of that type might not be statically known. So the PAD type needs
10014 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10015 we might end up with the wrong size for our component. This can be
10016 observed with the following type declarations:
10018 type Octal is new Integer range 0 .. 7;
10019 type Octal_Array is array (Positive range <>) of Octal;
10020 pragma Pack (Octal_Array);
10022 type Octal_Buffer (Size : Positive) is record
10023 Buffer : Octal_Array (1 .. Size);
10027 In that case, Buffer is a PAD type whose size is unset and needs
10028 to be computed by fixing the unwrapped type.
10030 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10031 ----------------------------------------------------------
10033 Lastly, when should the sub-elements of an entity that remained unfixed
10034 thus far, be actually fixed?
10036 The answer is: Only when referencing that element. For instance
10037 when selecting one component of a record, this specific component
10038 should be fixed at that point in time. Or when printing the value
10039 of a record, each component should be fixed before its value gets
10040 printed. Similarly for arrays, the element of the array should be
10041 fixed when printing each element of the array, or when extracting
10042 one element out of that array. On the other hand, fixing should
10043 not be performed on the elements when taking a slice of an array!
10045 Note that one of the side effects of miscomputing the offset and
10046 size of each field is that we end up also miscomputing the size
10047 of the containing type. This can have adverse results when computing
10048 the value of an entity. GDB fetches the value of an entity based
10049 on the size of its type, and thus a wrong size causes GDB to fetch
10050 the wrong amount of memory. In the case where the computed size is
10051 too small, GDB fetches too little data to print the value of our
10052 entity. Results in this case are unpredictable, as we usually read
10053 past the buffer containing the data =:-o. */
10055 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10056 for that subexpression cast to TO_TYPE. Advance *POS over the
10060 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10061 enum noside noside
, struct type
*to_type
)
10065 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10066 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10071 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10073 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10074 return value_zero (to_type
, not_lval
);
10076 val
= evaluate_var_msym_value (noside
,
10077 exp
->elts
[pc
+ 1].objfile
,
10078 exp
->elts
[pc
+ 2].msymbol
);
10081 val
= evaluate_var_value (noside
,
10082 exp
->elts
[pc
+ 1].block
,
10083 exp
->elts
[pc
+ 2].symbol
);
10085 if (noside
== EVAL_SKIP
)
10086 return eval_skip_value (exp
);
10088 val
= ada_value_cast (to_type
, val
);
10090 /* Follow the Ada language semantics that do not allow taking
10091 an address of the result of a cast (view conversion in Ada). */
10092 if (VALUE_LVAL (val
) == lval_memory
)
10094 if (value_lazy (val
))
10095 value_fetch_lazy (val
);
10096 VALUE_LVAL (val
) = not_lval
;
10101 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10102 if (noside
== EVAL_SKIP
)
10103 return eval_skip_value (exp
);
10104 return ada_value_cast (to_type
, val
);
10107 /* Implement the evaluate_exp routine in the exp_descriptor structure
10108 for the Ada language. */
10110 static struct value
*
10111 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10112 int *pos
, enum noside noside
)
10114 enum exp_opcode op
;
10118 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10121 struct value
**argvec
;
10125 op
= exp
->elts
[pc
].opcode
;
10131 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10133 if (noside
== EVAL_NORMAL
)
10134 arg1
= unwrap_value (arg1
);
10136 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10137 then we need to perform the conversion manually, because
10138 evaluate_subexp_standard doesn't do it. This conversion is
10139 necessary in Ada because the different kinds of float/fixed
10140 types in Ada have different representations.
10142 Similarly, we need to perform the conversion from OP_LONG
10144 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10145 arg1
= ada_value_cast (expect_type
, arg1
);
10151 struct value
*result
;
10154 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10155 /* The result type will have code OP_STRING, bashed there from
10156 OP_ARRAY. Bash it back. */
10157 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10158 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10164 type
= exp
->elts
[pc
+ 1].type
;
10165 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10169 type
= exp
->elts
[pc
+ 1].type
;
10170 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10173 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10174 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10176 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10177 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10179 return ada_value_assign (arg1
, arg1
);
10181 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10182 except if the lhs of our assignment is a convenience variable.
10183 In the case of assigning to a convenience variable, the lhs
10184 should be exactly the result of the evaluation of the rhs. */
10185 type
= value_type (arg1
);
10186 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10188 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10189 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10191 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10195 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10196 arg2
= cast_to_gnat_encoded_fixed_point_type (value_type (arg1
), arg2
);
10197 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10199 (_("Fixed-point values must be assigned to fixed-point variables"));
10201 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10202 return ada_value_assign (arg1
, arg2
);
10205 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10206 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10207 if (noside
== EVAL_SKIP
)
10209 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10210 return (value_from_longest
10211 (value_type (arg1
),
10212 value_as_long (arg1
) + value_as_long (arg2
)));
10213 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10214 return (value_from_longest
10215 (value_type (arg2
),
10216 value_as_long (arg1
) + value_as_long (arg2
)));
10217 /* Preserve the original type for use by the range case below.
10218 We cannot cast the result to a reference type, so if ARG1 is
10219 a reference type, find its underlying type. */
10220 type
= value_type (arg1
);
10221 while (type
->code () == TYPE_CODE_REF
)
10222 type
= TYPE_TARGET_TYPE (type
);
10223 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10224 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10226 if (value_type (arg1
) != value_type (arg2
))
10227 error (_("Operands of fixed-point addition must have the same type"));
10230 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10231 arg1
= value_binop (arg1
, arg2
, BINOP_ADD
);
10232 /* We need to special-case the result of adding to a range.
10233 This is done for the benefit of "ptype". gdb's Ada support
10234 historically used the LHS to set the result type here, so
10235 preserve this behavior. */
10236 if (type
->code () == TYPE_CODE_RANGE
)
10237 arg1
= value_cast (type
, arg1
);
10241 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10242 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10243 if (noside
== EVAL_SKIP
)
10245 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10246 return (value_from_longest
10247 (value_type (arg1
),
10248 value_as_long (arg1
) - value_as_long (arg2
)));
10249 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10250 return (value_from_longest
10251 (value_type (arg2
),
10252 value_as_long (arg1
) - value_as_long (arg2
)));
10253 /* Preserve the original type for use by the range case below.
10254 We cannot cast the result to a reference type, so if ARG1 is
10255 a reference type, find its underlying type. */
10256 type
= value_type (arg1
);
10257 while (type
->code () == TYPE_CODE_REF
)
10258 type
= TYPE_TARGET_TYPE (type
);
10259 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10260 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10262 if (value_type (arg1
) != value_type (arg2
))
10263 error (_("Operands of fixed-point subtraction "
10264 "must have the same type"));
10267 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10268 arg1
= value_binop (arg1
, arg2
, BINOP_SUB
);
10269 /* We need to special-case the result of adding to a range.
10270 This is done for the benefit of "ptype". gdb's Ada support
10271 historically used the LHS to set the result type here, so
10272 preserve this behavior. */
10273 if (type
->code () == TYPE_CODE_RANGE
)
10274 arg1
= value_cast (type
, arg1
);
10281 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10282 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10283 if (noside
== EVAL_SKIP
)
10285 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10287 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10288 return value_zero (value_type (arg1
), not_lval
);
10292 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10293 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10294 arg1
= cast_from_gnat_encoded_fixed_point_type (type
, arg1
);
10295 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10296 arg2
= cast_from_gnat_encoded_fixed_point_type (type
, arg2
);
10297 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10298 return ada_value_binop (arg1
, arg2
, op
);
10302 case BINOP_NOTEQUAL
:
10303 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10304 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10305 if (noside
== EVAL_SKIP
)
10307 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10311 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10312 tem
= ada_value_equal (arg1
, arg2
);
10314 if (op
== BINOP_NOTEQUAL
)
10316 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10317 return value_from_longest (type
, (LONGEST
) tem
);
10320 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10321 if (noside
== EVAL_SKIP
)
10323 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10324 return value_cast (value_type (arg1
), value_neg (arg1
));
10327 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10328 return value_neg (arg1
);
10331 case BINOP_LOGICAL_AND
:
10332 case BINOP_LOGICAL_OR
:
10333 case UNOP_LOGICAL_NOT
:
10338 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10339 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10340 return value_cast (type
, val
);
10343 case BINOP_BITWISE_AND
:
10344 case BINOP_BITWISE_IOR
:
10345 case BINOP_BITWISE_XOR
:
10349 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10351 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10353 return value_cast (value_type (arg1
), val
);
10359 if (noside
== EVAL_SKIP
)
10365 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10366 /* Only encountered when an unresolved symbol occurs in a
10367 context other than a function call, in which case, it is
10369 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10370 exp
->elts
[pc
+ 2].symbol
->print_name ());
10372 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10374 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10375 /* Check to see if this is a tagged type. We also need to handle
10376 the case where the type is a reference to a tagged type, but
10377 we have to be careful to exclude pointers to tagged types.
10378 The latter should be shown as usual (as a pointer), whereas
10379 a reference should mostly be transparent to the user. */
10380 if (ada_is_tagged_type (type
, 0)
10381 || (type
->code () == TYPE_CODE_REF
10382 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10384 /* Tagged types are a little special in the fact that the real
10385 type is dynamic and can only be determined by inspecting the
10386 object's tag. This means that we need to get the object's
10387 value first (EVAL_NORMAL) and then extract the actual object
10390 Note that we cannot skip the final step where we extract
10391 the object type from its tag, because the EVAL_NORMAL phase
10392 results in dynamic components being resolved into fixed ones.
10393 This can cause problems when trying to print the type
10394 description of tagged types whose parent has a dynamic size:
10395 We use the type name of the "_parent" component in order
10396 to print the name of the ancestor type in the type description.
10397 If that component had a dynamic size, the resolution into
10398 a fixed type would result in the loss of that type name,
10399 thus preventing us from printing the name of the ancestor
10400 type in the type description. */
10401 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_NORMAL
);
10403 if (type
->code () != TYPE_CODE_REF
)
10405 struct type
*actual_type
;
10407 actual_type
= type_from_tag (ada_value_tag (arg1
));
10408 if (actual_type
== NULL
)
10409 /* If, for some reason, we were unable to determine
10410 the actual type from the tag, then use the static
10411 approximation that we just computed as a fallback.
10412 This can happen if the debugging information is
10413 incomplete, for instance. */
10414 actual_type
= type
;
10415 return value_zero (actual_type
, not_lval
);
10419 /* In the case of a ref, ada_coerce_ref takes care
10420 of determining the actual type. But the evaluation
10421 should return a ref as it should be valid to ask
10422 for its address; so rebuild a ref after coerce. */
10423 arg1
= ada_coerce_ref (arg1
);
10424 return value_ref (arg1
, TYPE_CODE_REF
);
10428 /* Records and unions for which GNAT encodings have been
10429 generated need to be statically fixed as well.
10430 Otherwise, non-static fixing produces a type where
10431 all dynamic properties are removed, which prevents "ptype"
10432 from being able to completely describe the type.
10433 For instance, a case statement in a variant record would be
10434 replaced by the relevant components based on the actual
10435 value of the discriminants. */
10436 if ((type
->code () == TYPE_CODE_STRUCT
10437 && dynamic_template_type (type
) != NULL
)
10438 || (type
->code () == TYPE_CODE_UNION
10439 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10442 return value_zero (to_static_fixed_type (type
), not_lval
);
10446 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10447 return ada_to_fixed_value (arg1
);
10452 /* Allocate arg vector, including space for the function to be
10453 called in argvec[0] and a terminating NULL. */
10454 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10455 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10457 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10458 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10459 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10460 exp
->elts
[pc
+ 5].symbol
->print_name ());
10463 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10464 argvec
[tem
] = evaluate_subexp (nullptr, exp
, pos
, noside
);
10467 if (noside
== EVAL_SKIP
)
10471 if (ada_is_constrained_packed_array_type
10472 (desc_base_type (value_type (argvec
[0]))))
10473 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10474 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10475 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10476 /* This is a packed array that has already been fixed, and
10477 therefore already coerced to a simple array. Nothing further
10480 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10482 /* Make sure we dereference references so that all the code below
10483 feels like it's really handling the referenced value. Wrapping
10484 types (for alignment) may be there, so make sure we strip them as
10486 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10488 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10489 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10490 argvec
[0] = value_addr (argvec
[0]);
10492 type
= ada_check_typedef (value_type (argvec
[0]));
10494 /* Ada allows us to implicitly dereference arrays when subscripting
10495 them. So, if this is an array typedef (encoding use for array
10496 access types encoded as fat pointers), strip it now. */
10497 if (type
->code () == TYPE_CODE_TYPEDEF
)
10498 type
= ada_typedef_target_type (type
);
10500 if (type
->code () == TYPE_CODE_PTR
)
10502 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10504 case TYPE_CODE_FUNC
:
10505 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10507 case TYPE_CODE_ARRAY
:
10509 case TYPE_CODE_STRUCT
:
10510 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10511 argvec
[0] = ada_value_ind (argvec
[0]);
10512 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10515 error (_("cannot subscript or call something of type `%s'"),
10516 ada_type_name (value_type (argvec
[0])));
10521 switch (type
->code ())
10523 case TYPE_CODE_FUNC
:
10524 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10526 if (TYPE_TARGET_TYPE (type
) == NULL
)
10527 error_call_unknown_return_type (NULL
);
10528 return allocate_value (TYPE_TARGET_TYPE (type
));
10530 return call_function_by_hand (argvec
[0], NULL
,
10531 gdb::make_array_view (argvec
+ 1,
10533 case TYPE_CODE_INTERNAL_FUNCTION
:
10534 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10535 /* We don't know anything about what the internal
10536 function might return, but we have to return
10538 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10541 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10542 argvec
[0], nargs
, argvec
+ 1);
10544 case TYPE_CODE_STRUCT
:
10548 arity
= ada_array_arity (type
);
10549 type
= ada_array_element_type (type
, nargs
);
10551 error (_("cannot subscript or call a record"));
10552 if (arity
!= nargs
)
10553 error (_("wrong number of subscripts; expecting %d"), arity
);
10554 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10555 return value_zero (ada_aligned_type (type
), lval_memory
);
10557 unwrap_value (ada_value_subscript
10558 (argvec
[0], nargs
, argvec
+ 1));
10560 case TYPE_CODE_ARRAY
:
10561 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10563 type
= ada_array_element_type (type
, nargs
);
10565 error (_("element type of array unknown"));
10567 return value_zero (ada_aligned_type (type
), lval_memory
);
10570 unwrap_value (ada_value_subscript
10571 (ada_coerce_to_simple_array (argvec
[0]),
10572 nargs
, argvec
+ 1));
10573 case TYPE_CODE_PTR
: /* Pointer to array */
10574 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10576 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10577 type
= ada_array_element_type (type
, nargs
);
10579 error (_("element type of array unknown"));
10581 return value_zero (ada_aligned_type (type
), lval_memory
);
10584 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10585 nargs
, argvec
+ 1));
10588 error (_("Attempt to index or call something other than an "
10589 "array or function"));
10594 struct value
*array
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10595 struct value
*low_bound_val
10596 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10597 struct value
*high_bound_val
10598 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10600 LONGEST high_bound
;
10602 low_bound_val
= coerce_ref (low_bound_val
);
10603 high_bound_val
= coerce_ref (high_bound_val
);
10604 low_bound
= value_as_long (low_bound_val
);
10605 high_bound
= value_as_long (high_bound_val
);
10607 if (noside
== EVAL_SKIP
)
10610 /* If this is a reference to an aligner type, then remove all
10612 if (value_type (array
)->code () == TYPE_CODE_REF
10613 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10614 TYPE_TARGET_TYPE (value_type (array
)) =
10615 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10617 if (ada_is_any_packed_array_type (value_type (array
)))
10618 error (_("cannot slice a packed array"));
10620 /* If this is a reference to an array or an array lvalue,
10621 convert to a pointer. */
10622 if (value_type (array
)->code () == TYPE_CODE_REF
10623 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10624 && VALUE_LVAL (array
) == lval_memory
))
10625 array
= value_addr (array
);
10627 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10628 && ada_is_array_descriptor_type (ada_check_typedef
10629 (value_type (array
))))
10630 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10633 array
= ada_coerce_to_simple_array_ptr (array
);
10635 /* If we have more than one level of pointer indirection,
10636 dereference the value until we get only one level. */
10637 while (value_type (array
)->code () == TYPE_CODE_PTR
10638 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10640 array
= value_ind (array
);
10642 /* Make sure we really do have an array type before going further,
10643 to avoid a SEGV when trying to get the index type or the target
10644 type later down the road if the debug info generated by
10645 the compiler is incorrect or incomplete. */
10646 if (!ada_is_simple_array_type (value_type (array
)))
10647 error (_("cannot take slice of non-array"));
10649 if (ada_check_typedef (value_type (array
))->code ()
10652 struct type
*type0
= ada_check_typedef (value_type (array
));
10654 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10655 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10658 struct type
*arr_type0
=
10659 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10661 return ada_value_slice_from_ptr (array
, arr_type0
,
10662 longest_to_int (low_bound
),
10663 longest_to_int (high_bound
));
10666 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10668 else if (high_bound
< low_bound
)
10669 return empty_array (value_type (array
), low_bound
, high_bound
);
10671 return ada_value_slice (array
, longest_to_int (low_bound
),
10672 longest_to_int (high_bound
));
10675 case UNOP_IN_RANGE
:
10677 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10678 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10680 if (noside
== EVAL_SKIP
)
10683 switch (type
->code ())
10686 lim_warning (_("Membership test incompletely implemented; "
10687 "always returns true"));
10688 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10689 return value_from_longest (type
, (LONGEST
) 1);
10691 case TYPE_CODE_RANGE
:
10692 arg2
= value_from_longest (type
,
10693 type
->bounds ()->low
.const_val ());
10694 arg3
= value_from_longest (type
,
10695 type
->bounds ()->high
.const_val ());
10696 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10697 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10698 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10700 value_from_longest (type
,
10701 (value_less (arg1
, arg3
)
10702 || value_equal (arg1
, arg3
))
10703 && (value_less (arg2
, arg1
)
10704 || value_equal (arg2
, arg1
)));
10707 case BINOP_IN_BOUNDS
:
10709 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10710 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10712 if (noside
== EVAL_SKIP
)
10715 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10717 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10718 return value_zero (type
, not_lval
);
10721 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10723 type
= ada_index_type (value_type (arg2
), tem
, "range");
10725 type
= value_type (arg1
);
10727 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10728 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10730 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10731 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10732 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10734 value_from_longest (type
,
10735 (value_less (arg1
, arg3
)
10736 || value_equal (arg1
, arg3
))
10737 && (value_less (arg2
, arg1
)
10738 || value_equal (arg2
, arg1
)));
10740 case TERNOP_IN_RANGE
:
10741 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10742 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10743 arg3
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10745 if (noside
== EVAL_SKIP
)
10748 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10749 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10750 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10752 value_from_longest (type
,
10753 (value_less (arg1
, arg3
)
10754 || value_equal (arg1
, arg3
))
10755 && (value_less (arg2
, arg1
)
10756 || value_equal (arg2
, arg1
)));
10760 case OP_ATR_LENGTH
:
10762 struct type
*type_arg
;
10764 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10766 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10768 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10772 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10776 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10777 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10778 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10781 if (noside
== EVAL_SKIP
)
10783 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10785 if (type_arg
== NULL
)
10786 type_arg
= value_type (arg1
);
10788 if (ada_is_constrained_packed_array_type (type_arg
))
10789 type_arg
= decode_constrained_packed_array_type (type_arg
);
10791 if (!discrete_type_p (type_arg
))
10795 default: /* Should never happen. */
10796 error (_("unexpected attribute encountered"));
10799 type_arg
= ada_index_type (type_arg
, tem
,
10800 ada_attribute_name (op
));
10802 case OP_ATR_LENGTH
:
10803 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
10808 return value_zero (type_arg
, not_lval
);
10810 else if (type_arg
== NULL
)
10812 arg1
= ada_coerce_ref (arg1
);
10814 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10815 arg1
= ada_coerce_to_simple_array (arg1
);
10817 if (op
== OP_ATR_LENGTH
)
10818 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10821 type
= ada_index_type (value_type (arg1
), tem
,
10822 ada_attribute_name (op
));
10824 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10829 default: /* Should never happen. */
10830 error (_("unexpected attribute encountered"));
10832 return value_from_longest
10833 (type
, ada_array_bound (arg1
, tem
, 0));
10835 return value_from_longest
10836 (type
, ada_array_bound (arg1
, tem
, 1));
10837 case OP_ATR_LENGTH
:
10838 return value_from_longest
10839 (type
, ada_array_length (arg1
, tem
));
10842 else if (discrete_type_p (type_arg
))
10844 struct type
*range_type
;
10845 const char *name
= ada_type_name (type_arg
);
10848 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
10849 range_type
= to_fixed_range_type (type_arg
, NULL
);
10850 if (range_type
== NULL
)
10851 range_type
= type_arg
;
10855 error (_("unexpected attribute encountered"));
10857 return value_from_longest
10858 (range_type
, ada_discrete_type_low_bound (range_type
));
10860 return value_from_longest
10861 (range_type
, ada_discrete_type_high_bound (range_type
));
10862 case OP_ATR_LENGTH
:
10863 error (_("the 'length attribute applies only to array types"));
10866 else if (type_arg
->code () == TYPE_CODE_FLT
)
10867 error (_("unimplemented type attribute"));
10872 if (ada_is_constrained_packed_array_type (type_arg
))
10873 type_arg
= decode_constrained_packed_array_type (type_arg
);
10875 if (op
== OP_ATR_LENGTH
)
10876 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10879 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10881 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10887 error (_("unexpected attribute encountered"));
10889 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10890 return value_from_longest (type
, low
);
10892 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10893 return value_from_longest (type
, high
);
10894 case OP_ATR_LENGTH
:
10895 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10896 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10897 return value_from_longest (type
, high
- low
+ 1);
10903 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10904 if (noside
== EVAL_SKIP
)
10907 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10908 return value_zero (ada_tag_type (arg1
), not_lval
);
10910 return ada_value_tag (arg1
);
10914 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10915 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10916 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10917 if (noside
== EVAL_SKIP
)
10919 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10920 return value_zero (value_type (arg1
), not_lval
);
10923 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10924 return value_binop (arg1
, arg2
,
10925 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10928 case OP_ATR_MODULUS
:
10930 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10932 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10933 if (noside
== EVAL_SKIP
)
10936 if (!ada_is_modular_type (type_arg
))
10937 error (_("'modulus must be applied to modular type"));
10939 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10940 ada_modulus (type_arg
));
10945 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10946 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10947 if (noside
== EVAL_SKIP
)
10949 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10950 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10951 return value_zero (type
, not_lval
);
10953 return value_pos_atr (type
, arg1
);
10956 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10957 type
= value_type (arg1
);
10959 /* If the argument is a reference, then dereference its type, since
10960 the user is really asking for the size of the actual object,
10961 not the size of the pointer. */
10962 if (type
->code () == TYPE_CODE_REF
)
10963 type
= TYPE_TARGET_TYPE (type
);
10965 if (noside
== EVAL_SKIP
)
10967 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10968 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10970 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10971 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10974 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10975 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10976 type
= exp
->elts
[pc
+ 2].type
;
10977 if (noside
== EVAL_SKIP
)
10979 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10980 return value_zero (type
, not_lval
);
10982 return value_val_atr (type
, arg1
);
10985 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10986 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10987 if (noside
== EVAL_SKIP
)
10989 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10990 return value_zero (value_type (arg1
), not_lval
);
10993 /* For integer exponentiation operations,
10994 only promote the first argument. */
10995 if (is_integral_type (value_type (arg2
)))
10996 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10998 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11000 return value_binop (arg1
, arg2
, op
);
11004 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11005 if (noside
== EVAL_SKIP
)
11011 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11012 if (noside
== EVAL_SKIP
)
11014 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11015 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11016 return value_neg (arg1
);
11021 preeval_pos
= *pos
;
11022 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11023 if (noside
== EVAL_SKIP
)
11025 type
= ada_check_typedef (value_type (arg1
));
11026 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11028 if (ada_is_array_descriptor_type (type
))
11029 /* GDB allows dereferencing GNAT array descriptors. */
11031 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11033 if (arrType
== NULL
)
11034 error (_("Attempt to dereference null array pointer."));
11035 return value_at_lazy (arrType
, 0);
11037 else if (type
->code () == TYPE_CODE_PTR
11038 || type
->code () == TYPE_CODE_REF
11039 /* In C you can dereference an array to get the 1st elt. */
11040 || type
->code () == TYPE_CODE_ARRAY
)
11042 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11043 only be determined by inspecting the object's tag.
11044 This means that we need to evaluate completely the
11045 expression in order to get its type. */
11047 if ((type
->code () == TYPE_CODE_REF
11048 || type
->code () == TYPE_CODE_PTR
)
11049 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11052 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11053 type
= value_type (ada_value_ind (arg1
));
11057 type
= to_static_fixed_type
11059 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11061 ada_ensure_varsize_limit (type
);
11062 return value_zero (type
, lval_memory
);
11064 else if (type
->code () == TYPE_CODE_INT
)
11066 /* GDB allows dereferencing an int. */
11067 if (expect_type
== NULL
)
11068 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11073 to_static_fixed_type (ada_aligned_type (expect_type
));
11074 return value_zero (expect_type
, lval_memory
);
11078 error (_("Attempt to take contents of a non-pointer value."));
11080 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11081 type
= ada_check_typedef (value_type (arg1
));
11083 if (type
->code () == TYPE_CODE_INT
)
11084 /* GDB allows dereferencing an int. If we were given
11085 the expect_type, then use that as the target type.
11086 Otherwise, assume that the target type is an int. */
11088 if (expect_type
!= NULL
)
11089 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11092 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11093 (CORE_ADDR
) value_as_address (arg1
));
11096 if (ada_is_array_descriptor_type (type
))
11097 /* GDB allows dereferencing GNAT array descriptors. */
11098 return ada_coerce_to_simple_array (arg1
);
11100 return ada_value_ind (arg1
);
11102 case STRUCTOP_STRUCT
:
11103 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11104 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11105 preeval_pos
= *pos
;
11106 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11107 if (noside
== EVAL_SKIP
)
11109 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11111 struct type
*type1
= value_type (arg1
);
11113 if (ada_is_tagged_type (type1
, 1))
11115 type
= ada_lookup_struct_elt_type (type1
,
11116 &exp
->elts
[pc
+ 2].string
,
11119 /* If the field is not found, check if it exists in the
11120 extension of this object's type. This means that we
11121 need to evaluate completely the expression. */
11126 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11127 arg1
= ada_value_struct_elt (arg1
,
11128 &exp
->elts
[pc
+ 2].string
,
11130 arg1
= unwrap_value (arg1
);
11131 type
= value_type (ada_to_fixed_value (arg1
));
11136 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11139 return value_zero (ada_aligned_type (type
), lval_memory
);
11143 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11144 arg1
= unwrap_value (arg1
);
11145 return ada_to_fixed_value (arg1
);
11149 /* The value is not supposed to be used. This is here to make it
11150 easier to accommodate expressions that contain types. */
11152 if (noside
== EVAL_SKIP
)
11154 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11155 return allocate_value (exp
->elts
[pc
+ 1].type
);
11157 error (_("Attempt to use a type name as an expression"));
11162 case OP_DISCRETE_RANGE
:
11163 case OP_POSITIONAL
:
11165 if (noside
== EVAL_NORMAL
)
11169 error (_("Undefined name, ambiguous name, or renaming used in "
11170 "component association: %s."), &exp
->elts
[pc
+2].string
);
11172 error (_("Aggregates only allowed on the right of an assignment"));
11174 internal_error (__FILE__
, __LINE__
,
11175 _("aggregate apparently mangled"));
11178 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11180 for (tem
= 0; tem
< nargs
; tem
+= 1)
11181 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11186 return eval_skip_value (exp
);
11192 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11193 type name that encodes the 'small and 'delta information.
11194 Otherwise, return NULL. */
11196 static const char *
11197 gnat_encoded_fixed_point_type_info (struct type
*type
)
11199 const char *name
= ada_type_name (type
);
11200 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: type
->code ();
11202 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11204 const char *tail
= strstr (name
, "___XF_");
11211 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11212 return gnat_encoded_fixed_point_type_info (TYPE_TARGET_TYPE (type
));
11217 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11220 ada_is_gnat_encoded_fixed_point_type (struct type
*type
)
11222 return gnat_encoded_fixed_point_type_info (type
) != NULL
;
11225 /* Return non-zero iff TYPE represents a System.Address type. */
11228 ada_is_system_address_type (struct type
*type
)
11230 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11233 /* Assuming that TYPE is the representation of an Ada fixed-point
11234 type, return the target floating-point type to be used to represent
11235 of this type during internal computation. */
11237 static struct type
*
11238 ada_scaling_type (struct type
*type
)
11240 return builtin_type (type
->arch ())->builtin_long_double
;
11243 /* Assuming that TYPE is the representation of an Ada fixed-point
11244 type, return its delta, or NULL if the type is malformed and the
11245 delta cannot be determined. */
11248 gnat_encoded_fixed_point_delta (struct type
*type
)
11250 const char *encoding
= gnat_encoded_fixed_point_type_info (type
);
11251 struct type
*scale_type
= ada_scaling_type (type
);
11253 long long num
, den
;
11255 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11258 return value_binop (value_from_longest (scale_type
, num
),
11259 value_from_longest (scale_type
, den
), BINOP_DIV
);
11262 /* Assuming that ada_is_gnat_encoded_fixed_point_type (TYPE), return
11263 the scaling factor ('SMALL value) associated with the type. */
11266 gnat_encoded_fixed_point_scaling_factor (struct type
*type
)
11268 const char *encoding
= gnat_encoded_fixed_point_type_info (type
);
11269 struct type
*scale_type
= ada_scaling_type (type
);
11271 long long num0
, den0
, num1
, den1
;
11274 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11275 &num0
, &den0
, &num1
, &den1
);
11278 return value_from_longest (scale_type
, 1);
11280 return value_binop (value_from_longest (scale_type
, num1
),
11281 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11283 return value_binop (value_from_longest (scale_type
, num0
),
11284 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11291 /* Scan STR beginning at position K for a discriminant name, and
11292 return the value of that discriminant field of DVAL in *PX. If
11293 PNEW_K is not null, put the position of the character beyond the
11294 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11295 not alter *PX and *PNEW_K if unsuccessful. */
11298 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11301 static char *bound_buffer
= NULL
;
11302 static size_t bound_buffer_len
= 0;
11303 const char *pstart
, *pend
, *bound
;
11304 struct value
*bound_val
;
11306 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11310 pend
= strstr (pstart
, "__");
11314 k
+= strlen (bound
);
11318 int len
= pend
- pstart
;
11320 /* Strip __ and beyond. */
11321 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11322 strncpy (bound_buffer
, pstart
, len
);
11323 bound_buffer
[len
] = '\0';
11325 bound
= bound_buffer
;
11329 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11330 if (bound_val
== NULL
)
11333 *px
= value_as_long (bound_val
);
11334 if (pnew_k
!= NULL
)
11339 /* Value of variable named NAME. Only exact matches are considered.
11340 If no such variable found, then if ERR_MSG is null, returns 0, and
11341 otherwise causes an error with message ERR_MSG. */
11343 static struct value
*
11344 get_var_value (const char *name
, const char *err_msg
)
11346 std::string quoted_name
= add_angle_brackets (name
);
11348 lookup_name_info
lookup_name (quoted_name
, symbol_name_match_type::FULL
);
11350 std::vector
<struct block_symbol
> syms
;
11351 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11352 get_selected_block (0),
11353 VAR_DOMAIN
, &syms
, 1);
11357 if (err_msg
== NULL
)
11360 error (("%s"), err_msg
);
11363 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11366 /* Value of integer variable named NAME in the current environment.
11367 If no such variable is found, returns false. Otherwise, sets VALUE
11368 to the variable's value and returns true. */
11371 get_int_var_value (const char *name
, LONGEST
&value
)
11373 struct value
*var_val
= get_var_value (name
, 0);
11378 value
= value_as_long (var_val
);
11383 /* Return a range type whose base type is that of the range type named
11384 NAME in the current environment, and whose bounds are calculated
11385 from NAME according to the GNAT range encoding conventions.
11386 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11387 corresponding range type from debug information; fall back to using it
11388 if symbol lookup fails. If a new type must be created, allocate it
11389 like ORIG_TYPE was. The bounds information, in general, is encoded
11390 in NAME, the base type given in the named range type. */
11392 static struct type
*
11393 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11396 struct type
*base_type
;
11397 const char *subtype_info
;
11399 gdb_assert (raw_type
!= NULL
);
11400 gdb_assert (raw_type
->name () != NULL
);
11402 if (raw_type
->code () == TYPE_CODE_RANGE
)
11403 base_type
= TYPE_TARGET_TYPE (raw_type
);
11405 base_type
= raw_type
;
11407 name
= raw_type
->name ();
11408 subtype_info
= strstr (name
, "___XD");
11409 if (subtype_info
== NULL
)
11411 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11412 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11414 if (L
< INT_MIN
|| U
> INT_MAX
)
11417 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11422 static char *name_buf
= NULL
;
11423 static size_t name_len
= 0;
11424 int prefix_len
= subtype_info
- name
;
11427 const char *bounds_str
;
11430 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11431 strncpy (name_buf
, name
, prefix_len
);
11432 name_buf
[prefix_len
] = '\0';
11435 bounds_str
= strchr (subtype_info
, '_');
11438 if (*subtype_info
== 'L')
11440 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11441 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11443 if (bounds_str
[n
] == '_')
11445 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11451 strcpy (name_buf
+ prefix_len
, "___L");
11452 if (!get_int_var_value (name_buf
, L
))
11454 lim_warning (_("Unknown lower bound, using 1."));
11459 if (*subtype_info
== 'U')
11461 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11462 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11467 strcpy (name_buf
+ prefix_len
, "___U");
11468 if (!get_int_var_value (name_buf
, U
))
11470 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11475 type
= create_static_range_type (alloc_type_copy (raw_type
),
11477 /* create_static_range_type alters the resulting type's length
11478 to match the size of the base_type, which is not what we want.
11479 Set it back to the original range type's length. */
11480 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11481 type
->set_name (name
);
11486 /* True iff NAME is the name of a range type. */
11489 ada_is_range_type_name (const char *name
)
11491 return (name
!= NULL
&& strstr (name
, "___XD"));
11495 /* Modular types */
11497 /* True iff TYPE is an Ada modular type. */
11500 ada_is_modular_type (struct type
*type
)
11502 struct type
*subranged_type
= get_base_type (type
);
11504 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11505 && subranged_type
->code () == TYPE_CODE_INT
11506 && subranged_type
->is_unsigned ());
11509 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11512 ada_modulus (struct type
*type
)
11514 const dynamic_prop
&high
= type
->bounds ()->high
;
11516 if (high
.kind () == PROP_CONST
)
11517 return (ULONGEST
) high
.const_val () + 1;
11519 /* If TYPE is unresolved, the high bound might be a location list. Return
11520 0, for lack of a better value to return. */
11525 /* Ada exception catchpoint support:
11526 ---------------------------------
11528 We support 3 kinds of exception catchpoints:
11529 . catchpoints on Ada exceptions
11530 . catchpoints on unhandled Ada exceptions
11531 . catchpoints on failed assertions
11533 Exceptions raised during failed assertions, or unhandled exceptions
11534 could perfectly be caught with the general catchpoint on Ada exceptions.
11535 However, we can easily differentiate these two special cases, and having
11536 the option to distinguish these two cases from the rest can be useful
11537 to zero-in on certain situations.
11539 Exception catchpoints are a specialized form of breakpoint,
11540 since they rely on inserting breakpoints inside known routines
11541 of the GNAT runtime. The implementation therefore uses a standard
11542 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11545 Support in the runtime for exception catchpoints have been changed
11546 a few times already, and these changes affect the implementation
11547 of these catchpoints. In order to be able to support several
11548 variants of the runtime, we use a sniffer that will determine
11549 the runtime variant used by the program being debugged. */
11551 /* Ada's standard exceptions.
11553 The Ada 83 standard also defined Numeric_Error. But there so many
11554 situations where it was unclear from the Ada 83 Reference Manual
11555 (RM) whether Constraint_Error or Numeric_Error should be raised,
11556 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11557 Interpretation saying that anytime the RM says that Numeric_Error
11558 should be raised, the implementation may raise Constraint_Error.
11559 Ada 95 went one step further and pretty much removed Numeric_Error
11560 from the list of standard exceptions (it made it a renaming of
11561 Constraint_Error, to help preserve compatibility when compiling
11562 an Ada83 compiler). As such, we do not include Numeric_Error from
11563 this list of standard exceptions. */
11565 static const char * const standard_exc
[] = {
11566 "constraint_error",
11572 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11574 /* A structure that describes how to support exception catchpoints
11575 for a given executable. */
11577 struct exception_support_info
11579 /* The name of the symbol to break on in order to insert
11580 a catchpoint on exceptions. */
11581 const char *catch_exception_sym
;
11583 /* The name of the symbol to break on in order to insert
11584 a catchpoint on unhandled exceptions. */
11585 const char *catch_exception_unhandled_sym
;
11587 /* The name of the symbol to break on in order to insert
11588 a catchpoint on failed assertions. */
11589 const char *catch_assert_sym
;
11591 /* The name of the symbol to break on in order to insert
11592 a catchpoint on exception handling. */
11593 const char *catch_handlers_sym
;
11595 /* Assuming that the inferior just triggered an unhandled exception
11596 catchpoint, this function is responsible for returning the address
11597 in inferior memory where the name of that exception is stored.
11598 Return zero if the address could not be computed. */
11599 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11602 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11603 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11605 /* The following exception support info structure describes how to
11606 implement exception catchpoints with the latest version of the
11607 Ada runtime (as of 2019-08-??). */
11609 static const struct exception_support_info default_exception_support_info
=
11611 "__gnat_debug_raise_exception", /* catch_exception_sym */
11612 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11613 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11614 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11615 ada_unhandled_exception_name_addr
11618 /* The following exception support info structure describes how to
11619 implement exception catchpoints with an earlier version of the
11620 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11622 static const struct exception_support_info exception_support_info_v0
=
11624 "__gnat_debug_raise_exception", /* catch_exception_sym */
11625 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11626 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11627 "__gnat_begin_handler", /* catch_handlers_sym */
11628 ada_unhandled_exception_name_addr
11631 /* The following exception support info structure describes how to
11632 implement exception catchpoints with a slightly older version
11633 of the Ada runtime. */
11635 static const struct exception_support_info exception_support_info_fallback
=
11637 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11638 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11639 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11640 "__gnat_begin_handler", /* catch_handlers_sym */
11641 ada_unhandled_exception_name_addr_from_raise
11644 /* Return nonzero if we can detect the exception support routines
11645 described in EINFO.
11647 This function errors out if an abnormal situation is detected
11648 (for instance, if we find the exception support routines, but
11649 that support is found to be incomplete). */
11652 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11654 struct symbol
*sym
;
11656 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11657 that should be compiled with debugging information. As a result, we
11658 expect to find that symbol in the symtabs. */
11660 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11663 /* Perhaps we did not find our symbol because the Ada runtime was
11664 compiled without debugging info, or simply stripped of it.
11665 It happens on some GNU/Linux distributions for instance, where
11666 users have to install a separate debug package in order to get
11667 the runtime's debugging info. In that situation, let the user
11668 know why we cannot insert an Ada exception catchpoint.
11670 Note: Just for the purpose of inserting our Ada exception
11671 catchpoint, we could rely purely on the associated minimal symbol.
11672 But we would be operating in degraded mode anyway, since we are
11673 still lacking the debugging info needed later on to extract
11674 the name of the exception being raised (this name is printed in
11675 the catchpoint message, and is also used when trying to catch
11676 a specific exception). We do not handle this case for now. */
11677 struct bound_minimal_symbol msym
11678 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11680 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11681 error (_("Your Ada runtime appears to be missing some debugging "
11682 "information.\nCannot insert Ada exception catchpoint "
11683 "in this configuration."));
11688 /* Make sure that the symbol we found corresponds to a function. */
11690 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11692 error (_("Symbol \"%s\" is not a function (class = %d)"),
11693 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11697 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11700 struct bound_minimal_symbol msym
11701 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11703 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11704 error (_("Your Ada runtime appears to be missing some debugging "
11705 "information.\nCannot insert Ada exception catchpoint "
11706 "in this configuration."));
11711 /* Make sure that the symbol we found corresponds to a function. */
11713 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11715 error (_("Symbol \"%s\" is not a function (class = %d)"),
11716 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11723 /* Inspect the Ada runtime and determine which exception info structure
11724 should be used to provide support for exception catchpoints.
11726 This function will always set the per-inferior exception_info,
11727 or raise an error. */
11730 ada_exception_support_info_sniffer (void)
11732 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11734 /* If the exception info is already known, then no need to recompute it. */
11735 if (data
->exception_info
!= NULL
)
11738 /* Check the latest (default) exception support info. */
11739 if (ada_has_this_exception_support (&default_exception_support_info
))
11741 data
->exception_info
= &default_exception_support_info
;
11745 /* Try the v0 exception suport info. */
11746 if (ada_has_this_exception_support (&exception_support_info_v0
))
11748 data
->exception_info
= &exception_support_info_v0
;
11752 /* Try our fallback exception suport info. */
11753 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11755 data
->exception_info
= &exception_support_info_fallback
;
11759 /* Sometimes, it is normal for us to not be able to find the routine
11760 we are looking for. This happens when the program is linked with
11761 the shared version of the GNAT runtime, and the program has not been
11762 started yet. Inform the user of these two possible causes if
11765 if (ada_update_initial_language (language_unknown
) != language_ada
)
11766 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11768 /* If the symbol does not exist, then check that the program is
11769 already started, to make sure that shared libraries have been
11770 loaded. If it is not started, this may mean that the symbol is
11771 in a shared library. */
11773 if (inferior_ptid
.pid () == 0)
11774 error (_("Unable to insert catchpoint. Try to start the program first."));
11776 /* At this point, we know that we are debugging an Ada program and
11777 that the inferior has been started, but we still are not able to
11778 find the run-time symbols. That can mean that we are in
11779 configurable run time mode, or that a-except as been optimized
11780 out by the linker... In any case, at this point it is not worth
11781 supporting this feature. */
11783 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11786 /* True iff FRAME is very likely to be that of a function that is
11787 part of the runtime system. This is all very heuristic, but is
11788 intended to be used as advice as to what frames are uninteresting
11792 is_known_support_routine (struct frame_info
*frame
)
11794 enum language func_lang
;
11796 const char *fullname
;
11798 /* If this code does not have any debugging information (no symtab),
11799 This cannot be any user code. */
11801 symtab_and_line sal
= find_frame_sal (frame
);
11802 if (sal
.symtab
== NULL
)
11805 /* If there is a symtab, but the associated source file cannot be
11806 located, then assume this is not user code: Selecting a frame
11807 for which we cannot display the code would not be very helpful
11808 for the user. This should also take care of case such as VxWorks
11809 where the kernel has some debugging info provided for a few units. */
11811 fullname
= symtab_to_fullname (sal
.symtab
);
11812 if (access (fullname
, R_OK
) != 0)
11815 /* Check the unit filename against the Ada runtime file naming.
11816 We also check the name of the objfile against the name of some
11817 known system libraries that sometimes come with debugging info
11820 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11822 re_comp (known_runtime_file_name_patterns
[i
]);
11823 if (re_exec (lbasename (sal
.symtab
->filename
)))
11825 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11826 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11830 /* Check whether the function is a GNAT-generated entity. */
11832 gdb::unique_xmalloc_ptr
<char> func_name
11833 = find_frame_funname (frame
, &func_lang
, NULL
);
11834 if (func_name
== NULL
)
11837 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11839 re_comp (known_auxiliary_function_name_patterns
[i
]);
11840 if (re_exec (func_name
.get ()))
11847 /* Find the first frame that contains debugging information and that is not
11848 part of the Ada run-time, starting from FI and moving upward. */
11851 ada_find_printable_frame (struct frame_info
*fi
)
11853 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11855 if (!is_known_support_routine (fi
))
11864 /* Assuming that the inferior just triggered an unhandled exception
11865 catchpoint, return the address in inferior memory where the name
11866 of the exception is stored.
11868 Return zero if the address could not be computed. */
11871 ada_unhandled_exception_name_addr (void)
11873 return parse_and_eval_address ("e.full_name");
11876 /* Same as ada_unhandled_exception_name_addr, except that this function
11877 should be used when the inferior uses an older version of the runtime,
11878 where the exception name needs to be extracted from a specific frame
11879 several frames up in the callstack. */
11882 ada_unhandled_exception_name_addr_from_raise (void)
11885 struct frame_info
*fi
;
11886 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11888 /* To determine the name of this exception, we need to select
11889 the frame corresponding to RAISE_SYM_NAME. This frame is
11890 at least 3 levels up, so we simply skip the first 3 frames
11891 without checking the name of their associated function. */
11892 fi
= get_current_frame ();
11893 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11895 fi
= get_prev_frame (fi
);
11899 enum language func_lang
;
11901 gdb::unique_xmalloc_ptr
<char> func_name
11902 = find_frame_funname (fi
, &func_lang
, NULL
);
11903 if (func_name
!= NULL
)
11905 if (strcmp (func_name
.get (),
11906 data
->exception_info
->catch_exception_sym
) == 0)
11907 break; /* We found the frame we were looking for... */
11909 fi
= get_prev_frame (fi
);
11916 return parse_and_eval_address ("id.full_name");
11919 /* Assuming the inferior just triggered an Ada exception catchpoint
11920 (of any type), return the address in inferior memory where the name
11921 of the exception is stored, if applicable.
11923 Assumes the selected frame is the current frame.
11925 Return zero if the address could not be computed, or if not relevant. */
11928 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11929 struct breakpoint
*b
)
11931 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11935 case ada_catch_exception
:
11936 return (parse_and_eval_address ("e.full_name"));
11939 case ada_catch_exception_unhandled
:
11940 return data
->exception_info
->unhandled_exception_name_addr ();
11943 case ada_catch_handlers
:
11944 return 0; /* The runtimes does not provide access to the exception
11948 case ada_catch_assert
:
11949 return 0; /* Exception name is not relevant in this case. */
11953 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11957 return 0; /* Should never be reached. */
11960 /* Assuming the inferior is stopped at an exception catchpoint,
11961 return the message which was associated to the exception, if
11962 available. Return NULL if the message could not be retrieved.
11964 Note: The exception message can be associated to an exception
11965 either through the use of the Raise_Exception function, or
11966 more simply (Ada 2005 and later), via:
11968 raise Exception_Name with "exception message";
11972 static gdb::unique_xmalloc_ptr
<char>
11973 ada_exception_message_1 (void)
11975 struct value
*e_msg_val
;
11978 /* For runtimes that support this feature, the exception message
11979 is passed as an unbounded string argument called "message". */
11980 e_msg_val
= parse_and_eval ("message");
11981 if (e_msg_val
== NULL
)
11982 return NULL
; /* Exception message not supported. */
11984 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
11985 gdb_assert (e_msg_val
!= NULL
);
11986 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
11988 /* If the message string is empty, then treat it as if there was
11989 no exception message. */
11990 if (e_msg_len
<= 0)
11993 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
11994 read_memory (value_address (e_msg_val
), (gdb_byte
*) e_msg
.get (),
11996 e_msg
.get ()[e_msg_len
] = '\0';
12001 /* Same as ada_exception_message_1, except that all exceptions are
12002 contained here (returning NULL instead). */
12004 static gdb::unique_xmalloc_ptr
<char>
12005 ada_exception_message (void)
12007 gdb::unique_xmalloc_ptr
<char> e_msg
;
12011 e_msg
= ada_exception_message_1 ();
12013 catch (const gdb_exception_error
&e
)
12015 e_msg
.reset (nullptr);
12021 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12022 any error that ada_exception_name_addr_1 might cause to be thrown.
12023 When an error is intercepted, a warning with the error message is printed,
12024 and zero is returned. */
12027 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12028 struct breakpoint
*b
)
12030 CORE_ADDR result
= 0;
12034 result
= ada_exception_name_addr_1 (ex
, b
);
12037 catch (const gdb_exception_error
&e
)
12039 warning (_("failed to get exception name: %s"), e
.what ());
12046 static std::string ada_exception_catchpoint_cond_string
12047 (const char *excep_string
,
12048 enum ada_exception_catchpoint_kind ex
);
12050 /* Ada catchpoints.
12052 In the case of catchpoints on Ada exceptions, the catchpoint will
12053 stop the target on every exception the program throws. When a user
12054 specifies the name of a specific exception, we translate this
12055 request into a condition expression (in text form), and then parse
12056 it into an expression stored in each of the catchpoint's locations.
12057 We then use this condition to check whether the exception that was
12058 raised is the one the user is interested in. If not, then the
12059 target is resumed again. We store the name of the requested
12060 exception, in order to be able to re-set the condition expression
12061 when symbols change. */
12063 /* An instance of this type is used to represent an Ada catchpoint
12064 breakpoint location. */
12066 class ada_catchpoint_location
: public bp_location
12069 ada_catchpoint_location (breakpoint
*owner
)
12070 : bp_location (owner
, bp_loc_software_breakpoint
)
12073 /* The condition that checks whether the exception that was raised
12074 is the specific exception the user specified on catchpoint
12076 expression_up excep_cond_expr
;
12079 /* An instance of this type is used to represent an Ada catchpoint. */
12081 struct ada_catchpoint
: public breakpoint
12083 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12088 /* The name of the specific exception the user specified. */
12089 std::string excep_string
;
12091 /* What kind of catchpoint this is. */
12092 enum ada_exception_catchpoint_kind m_kind
;
12095 /* Parse the exception condition string in the context of each of the
12096 catchpoint's locations, and store them for later evaluation. */
12099 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12100 enum ada_exception_catchpoint_kind ex
)
12102 struct bp_location
*bl
;
12104 /* Nothing to do if there's no specific exception to catch. */
12105 if (c
->excep_string
.empty ())
12108 /* Same if there are no locations... */
12109 if (c
->loc
== NULL
)
12112 /* Compute the condition expression in text form, from the specific
12113 expection we want to catch. */
12114 std::string cond_string
12115 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12117 /* Iterate over all the catchpoint's locations, and parse an
12118 expression for each. */
12119 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12121 struct ada_catchpoint_location
*ada_loc
12122 = (struct ada_catchpoint_location
*) bl
;
12125 if (!bl
->shlib_disabled
)
12129 s
= cond_string
.c_str ();
12132 exp
= parse_exp_1 (&s
, bl
->address
,
12133 block_for_pc (bl
->address
),
12136 catch (const gdb_exception_error
&e
)
12138 warning (_("failed to reevaluate internal exception condition "
12139 "for catchpoint %d: %s"),
12140 c
->number
, e
.what ());
12144 ada_loc
->excep_cond_expr
= std::move (exp
);
12148 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12149 structure for all exception catchpoint kinds. */
12151 static struct bp_location
*
12152 allocate_location_exception (struct breakpoint
*self
)
12154 return new ada_catchpoint_location (self
);
12157 /* Implement the RE_SET method in the breakpoint_ops structure for all
12158 exception catchpoint kinds. */
12161 re_set_exception (struct breakpoint
*b
)
12163 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12165 /* Call the base class's method. This updates the catchpoint's
12167 bkpt_breakpoint_ops
.re_set (b
);
12169 /* Reparse the exception conditional expressions. One for each
12171 create_excep_cond_exprs (c
, c
->m_kind
);
12174 /* Returns true if we should stop for this breakpoint hit. If the
12175 user specified a specific exception, we only want to cause a stop
12176 if the program thrown that exception. */
12179 should_stop_exception (const struct bp_location
*bl
)
12181 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12182 const struct ada_catchpoint_location
*ada_loc
12183 = (const struct ada_catchpoint_location
*) bl
;
12186 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12187 if (c
->m_kind
== ada_catch_assert
)
12188 clear_internalvar (var
);
12195 if (c
->m_kind
== ada_catch_handlers
)
12196 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12197 ".all.occurrence.id");
12201 struct value
*exc
= parse_and_eval (expr
);
12202 set_internalvar (var
, exc
);
12204 catch (const gdb_exception_error
&ex
)
12206 clear_internalvar (var
);
12210 /* With no specific exception, should always stop. */
12211 if (c
->excep_string
.empty ())
12214 if (ada_loc
->excep_cond_expr
== NULL
)
12216 /* We will have a NULL expression if back when we were creating
12217 the expressions, this location's had failed to parse. */
12224 struct value
*mark
;
12226 mark
= value_mark ();
12227 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12228 value_free_to_mark (mark
);
12230 catch (const gdb_exception
&ex
)
12232 exception_fprintf (gdb_stderr
, ex
,
12233 _("Error in testing exception condition:\n"));
12239 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12240 for all exception catchpoint kinds. */
12243 check_status_exception (bpstat bs
)
12245 bs
->stop
= should_stop_exception (bs
->bp_location_at
.get ());
12248 /* Implement the PRINT_IT method in the breakpoint_ops structure
12249 for all exception catchpoint kinds. */
12251 static enum print_stop_action
12252 print_it_exception (bpstat bs
)
12254 struct ui_out
*uiout
= current_uiout
;
12255 struct breakpoint
*b
= bs
->breakpoint_at
;
12257 annotate_catchpoint (b
->number
);
12259 if (uiout
->is_mi_like_p ())
12261 uiout
->field_string ("reason",
12262 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12263 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12266 uiout
->text (b
->disposition
== disp_del
12267 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12268 uiout
->field_signed ("bkptno", b
->number
);
12269 uiout
->text (", ");
12271 /* ada_exception_name_addr relies on the selected frame being the
12272 current frame. Need to do this here because this function may be
12273 called more than once when printing a stop, and below, we'll
12274 select the first frame past the Ada run-time (see
12275 ada_find_printable_frame). */
12276 select_frame (get_current_frame ());
12278 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12281 case ada_catch_exception
:
12282 case ada_catch_exception_unhandled
:
12283 case ada_catch_handlers
:
12285 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12286 char exception_name
[256];
12290 read_memory (addr
, (gdb_byte
*) exception_name
,
12291 sizeof (exception_name
) - 1);
12292 exception_name
[sizeof (exception_name
) - 1] = '\0';
12296 /* For some reason, we were unable to read the exception
12297 name. This could happen if the Runtime was compiled
12298 without debugging info, for instance. In that case,
12299 just replace the exception name by the generic string
12300 "exception" - it will read as "an exception" in the
12301 notification we are about to print. */
12302 memcpy (exception_name
, "exception", sizeof ("exception"));
12304 /* In the case of unhandled exception breakpoints, we print
12305 the exception name as "unhandled EXCEPTION_NAME", to make
12306 it clearer to the user which kind of catchpoint just got
12307 hit. We used ui_out_text to make sure that this extra
12308 info does not pollute the exception name in the MI case. */
12309 if (c
->m_kind
== ada_catch_exception_unhandled
)
12310 uiout
->text ("unhandled ");
12311 uiout
->field_string ("exception-name", exception_name
);
12314 case ada_catch_assert
:
12315 /* In this case, the name of the exception is not really
12316 important. Just print "failed assertion" to make it clearer
12317 that his program just hit an assertion-failure catchpoint.
12318 We used ui_out_text because this info does not belong in
12320 uiout
->text ("failed assertion");
12324 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12325 if (exception_message
!= NULL
)
12327 uiout
->text (" (");
12328 uiout
->field_string ("exception-message", exception_message
.get ());
12332 uiout
->text (" at ");
12333 ada_find_printable_frame (get_current_frame ());
12335 return PRINT_SRC_AND_LOC
;
12338 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12339 for all exception catchpoint kinds. */
12342 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12344 struct ui_out
*uiout
= current_uiout
;
12345 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12346 struct value_print_options opts
;
12348 get_user_print_options (&opts
);
12350 if (opts
.addressprint
)
12351 uiout
->field_skip ("addr");
12353 annotate_field (5);
12356 case ada_catch_exception
:
12357 if (!c
->excep_string
.empty ())
12359 std::string msg
= string_printf (_("`%s' Ada exception"),
12360 c
->excep_string
.c_str ());
12362 uiout
->field_string ("what", msg
);
12365 uiout
->field_string ("what", "all Ada exceptions");
12369 case ada_catch_exception_unhandled
:
12370 uiout
->field_string ("what", "unhandled Ada exceptions");
12373 case ada_catch_handlers
:
12374 if (!c
->excep_string
.empty ())
12376 uiout
->field_fmt ("what",
12377 _("`%s' Ada exception handlers"),
12378 c
->excep_string
.c_str ());
12381 uiout
->field_string ("what", "all Ada exceptions handlers");
12384 case ada_catch_assert
:
12385 uiout
->field_string ("what", "failed Ada assertions");
12389 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12394 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12395 for all exception catchpoint kinds. */
12398 print_mention_exception (struct breakpoint
*b
)
12400 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12401 struct ui_out
*uiout
= current_uiout
;
12403 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12404 : _("Catchpoint "));
12405 uiout
->field_signed ("bkptno", b
->number
);
12406 uiout
->text (": ");
12410 case ada_catch_exception
:
12411 if (!c
->excep_string
.empty ())
12413 std::string info
= string_printf (_("`%s' Ada exception"),
12414 c
->excep_string
.c_str ());
12415 uiout
->text (info
.c_str ());
12418 uiout
->text (_("all Ada exceptions"));
12421 case ada_catch_exception_unhandled
:
12422 uiout
->text (_("unhandled Ada exceptions"));
12425 case ada_catch_handlers
:
12426 if (!c
->excep_string
.empty ())
12429 = string_printf (_("`%s' Ada exception handlers"),
12430 c
->excep_string
.c_str ());
12431 uiout
->text (info
.c_str ());
12434 uiout
->text (_("all Ada exceptions handlers"));
12437 case ada_catch_assert
:
12438 uiout
->text (_("failed Ada assertions"));
12442 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12447 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12448 for all exception catchpoint kinds. */
12451 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12453 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12457 case ada_catch_exception
:
12458 fprintf_filtered (fp
, "catch exception");
12459 if (!c
->excep_string
.empty ())
12460 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12463 case ada_catch_exception_unhandled
:
12464 fprintf_filtered (fp
, "catch exception unhandled");
12467 case ada_catch_handlers
:
12468 fprintf_filtered (fp
, "catch handlers");
12471 case ada_catch_assert
:
12472 fprintf_filtered (fp
, "catch assert");
12476 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12478 print_recreate_thread (b
, fp
);
12481 /* Virtual tables for various breakpoint types. */
12482 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12483 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12484 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12485 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12487 /* See ada-lang.h. */
12490 is_ada_exception_catchpoint (breakpoint
*bp
)
12492 return (bp
->ops
== &catch_exception_breakpoint_ops
12493 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12494 || bp
->ops
== &catch_assert_breakpoint_ops
12495 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12498 /* Split the arguments specified in a "catch exception" command.
12499 Set EX to the appropriate catchpoint type.
12500 Set EXCEP_STRING to the name of the specific exception if
12501 specified by the user.
12502 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12503 "catch handlers" command. False otherwise.
12504 If a condition is found at the end of the arguments, the condition
12505 expression is stored in COND_STRING (memory must be deallocated
12506 after use). Otherwise COND_STRING is set to NULL. */
12509 catch_ada_exception_command_split (const char *args
,
12510 bool is_catch_handlers_cmd
,
12511 enum ada_exception_catchpoint_kind
*ex
,
12512 std::string
*excep_string
,
12513 std::string
*cond_string
)
12515 std::string exception_name
;
12517 exception_name
= extract_arg (&args
);
12518 if (exception_name
== "if")
12520 /* This is not an exception name; this is the start of a condition
12521 expression for a catchpoint on all exceptions. So, "un-get"
12522 this token, and set exception_name to NULL. */
12523 exception_name
.clear ();
12527 /* Check to see if we have a condition. */
12529 args
= skip_spaces (args
);
12530 if (startswith (args
, "if")
12531 && (isspace (args
[2]) || args
[2] == '\0'))
12534 args
= skip_spaces (args
);
12536 if (args
[0] == '\0')
12537 error (_("Condition missing after `if' keyword"));
12538 *cond_string
= args
;
12540 args
+= strlen (args
);
12543 /* Check that we do not have any more arguments. Anything else
12546 if (args
[0] != '\0')
12547 error (_("Junk at end of expression"));
12549 if (is_catch_handlers_cmd
)
12551 /* Catch handling of exceptions. */
12552 *ex
= ada_catch_handlers
;
12553 *excep_string
= exception_name
;
12555 else if (exception_name
.empty ())
12557 /* Catch all exceptions. */
12558 *ex
= ada_catch_exception
;
12559 excep_string
->clear ();
12561 else if (exception_name
== "unhandled")
12563 /* Catch unhandled exceptions. */
12564 *ex
= ada_catch_exception_unhandled
;
12565 excep_string
->clear ();
12569 /* Catch a specific exception. */
12570 *ex
= ada_catch_exception
;
12571 *excep_string
= exception_name
;
12575 /* Return the name of the symbol on which we should break in order to
12576 implement a catchpoint of the EX kind. */
12578 static const char *
12579 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12581 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12583 gdb_assert (data
->exception_info
!= NULL
);
12587 case ada_catch_exception
:
12588 return (data
->exception_info
->catch_exception_sym
);
12590 case ada_catch_exception_unhandled
:
12591 return (data
->exception_info
->catch_exception_unhandled_sym
);
12593 case ada_catch_assert
:
12594 return (data
->exception_info
->catch_assert_sym
);
12596 case ada_catch_handlers
:
12597 return (data
->exception_info
->catch_handlers_sym
);
12600 internal_error (__FILE__
, __LINE__
,
12601 _("unexpected catchpoint kind (%d)"), ex
);
12605 /* Return the breakpoint ops "virtual table" used for catchpoints
12608 static const struct breakpoint_ops
*
12609 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12613 case ada_catch_exception
:
12614 return (&catch_exception_breakpoint_ops
);
12616 case ada_catch_exception_unhandled
:
12617 return (&catch_exception_unhandled_breakpoint_ops
);
12619 case ada_catch_assert
:
12620 return (&catch_assert_breakpoint_ops
);
12622 case ada_catch_handlers
:
12623 return (&catch_handlers_breakpoint_ops
);
12626 internal_error (__FILE__
, __LINE__
,
12627 _("unexpected catchpoint kind (%d)"), ex
);
12631 /* Return the condition that will be used to match the current exception
12632 being raised with the exception that the user wants to catch. This
12633 assumes that this condition is used when the inferior just triggered
12634 an exception catchpoint.
12635 EX: the type of catchpoints used for catching Ada exceptions. */
12638 ada_exception_catchpoint_cond_string (const char *excep_string
,
12639 enum ada_exception_catchpoint_kind ex
)
12642 bool is_standard_exc
= false;
12643 std::string result
;
12645 if (ex
== ada_catch_handlers
)
12647 /* For exception handlers catchpoints, the condition string does
12648 not use the same parameter as for the other exceptions. */
12649 result
= ("long_integer (GNAT_GCC_exception_Access"
12650 "(gcc_exception).all.occurrence.id)");
12653 result
= "long_integer (e)";
12655 /* The standard exceptions are a special case. They are defined in
12656 runtime units that have been compiled without debugging info; if
12657 EXCEP_STRING is the not-fully-qualified name of a standard
12658 exception (e.g. "constraint_error") then, during the evaluation
12659 of the condition expression, the symbol lookup on this name would
12660 *not* return this standard exception. The catchpoint condition
12661 may then be set only on user-defined exceptions which have the
12662 same not-fully-qualified name (e.g. my_package.constraint_error).
12664 To avoid this unexcepted behavior, these standard exceptions are
12665 systematically prefixed by "standard". This means that "catch
12666 exception constraint_error" is rewritten into "catch exception
12667 standard.constraint_error".
12669 If an exception named constraint_error is defined in another package of
12670 the inferior program, then the only way to specify this exception as a
12671 breakpoint condition is to use its fully-qualified named:
12672 e.g. my_package.constraint_error. */
12674 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12676 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12678 is_standard_exc
= true;
12685 if (is_standard_exc
)
12686 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12688 string_appendf (result
, "long_integer (&%s)", excep_string
);
12693 /* Return the symtab_and_line that should be used to insert an exception
12694 catchpoint of the TYPE kind.
12696 ADDR_STRING returns the name of the function where the real
12697 breakpoint that implements the catchpoints is set, depending on the
12698 type of catchpoint we need to create. */
12700 static struct symtab_and_line
12701 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12702 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12704 const char *sym_name
;
12705 struct symbol
*sym
;
12707 /* First, find out which exception support info to use. */
12708 ada_exception_support_info_sniffer ();
12710 /* Then lookup the function on which we will break in order to catch
12711 the Ada exceptions requested by the user. */
12712 sym_name
= ada_exception_sym_name (ex
);
12713 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12716 error (_("Catchpoint symbol not found: %s"), sym_name
);
12718 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12719 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12721 /* Set ADDR_STRING. */
12722 *addr_string
= sym_name
;
12725 *ops
= ada_exception_breakpoint_ops (ex
);
12727 return find_function_start_sal (sym
, 1);
12730 /* Create an Ada exception catchpoint.
12732 EX_KIND is the kind of exception catchpoint to be created.
12734 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12735 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12736 of the exception to which this catchpoint applies.
12738 COND_STRING, if not empty, is the catchpoint condition.
12740 TEMPFLAG, if nonzero, means that the underlying breakpoint
12741 should be temporary.
12743 FROM_TTY is the usual argument passed to all commands implementations. */
12746 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12747 enum ada_exception_catchpoint_kind ex_kind
,
12748 const std::string
&excep_string
,
12749 const std::string
&cond_string
,
12754 std::string addr_string
;
12755 const struct breakpoint_ops
*ops
= NULL
;
12756 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12758 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12759 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12760 ops
, tempflag
, disabled
, from_tty
);
12761 c
->excep_string
= excep_string
;
12762 create_excep_cond_exprs (c
.get (), ex_kind
);
12763 if (!cond_string
.empty ())
12764 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
, false);
12765 install_breakpoint (0, std::move (c
), 1);
12768 /* Implement the "catch exception" command. */
12771 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12772 struct cmd_list_element
*command
)
12774 const char *arg
= arg_entry
;
12775 struct gdbarch
*gdbarch
= get_current_arch ();
12777 enum ada_exception_catchpoint_kind ex_kind
;
12778 std::string excep_string
;
12779 std::string cond_string
;
12781 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12785 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12787 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12788 excep_string
, cond_string
,
12789 tempflag
, 1 /* enabled */,
12793 /* Implement the "catch handlers" command. */
12796 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12797 struct cmd_list_element
*command
)
12799 const char *arg
= arg_entry
;
12800 struct gdbarch
*gdbarch
= get_current_arch ();
12802 enum ada_exception_catchpoint_kind ex_kind
;
12803 std::string excep_string
;
12804 std::string cond_string
;
12806 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12810 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
12812 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12813 excep_string
, cond_string
,
12814 tempflag
, 1 /* enabled */,
12818 /* Completion function for the Ada "catch" commands. */
12821 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
12822 const char *text
, const char *word
)
12824 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
12826 for (const ada_exc_info
&info
: exceptions
)
12828 if (startswith (info
.name
, word
))
12829 tracker
.add_completion (make_unique_xstrdup (info
.name
));
12833 /* Split the arguments specified in a "catch assert" command.
12835 ARGS contains the command's arguments (or the empty string if
12836 no arguments were passed).
12838 If ARGS contains a condition, set COND_STRING to that condition
12839 (the memory needs to be deallocated after use). */
12842 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
12844 args
= skip_spaces (args
);
12846 /* Check whether a condition was provided. */
12847 if (startswith (args
, "if")
12848 && (isspace (args
[2]) || args
[2] == '\0'))
12851 args
= skip_spaces (args
);
12852 if (args
[0] == '\0')
12853 error (_("condition missing after `if' keyword"));
12854 cond_string
.assign (args
);
12857 /* Otherwise, there should be no other argument at the end of
12859 else if (args
[0] != '\0')
12860 error (_("Junk at end of arguments."));
12863 /* Implement the "catch assert" command. */
12866 catch_assert_command (const char *arg_entry
, int from_tty
,
12867 struct cmd_list_element
*command
)
12869 const char *arg
= arg_entry
;
12870 struct gdbarch
*gdbarch
= get_current_arch ();
12872 std::string cond_string
;
12874 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12878 catch_ada_assert_command_split (arg
, cond_string
);
12879 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12881 tempflag
, 1 /* enabled */,
12885 /* Return non-zero if the symbol SYM is an Ada exception object. */
12888 ada_is_exception_sym (struct symbol
*sym
)
12890 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
12892 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12893 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12894 && SYMBOL_CLASS (sym
) != LOC_CONST
12895 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12896 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12899 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12900 Ada exception object. This matches all exceptions except the ones
12901 defined by the Ada language. */
12904 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12908 if (!ada_is_exception_sym (sym
))
12911 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12912 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
12913 return 0; /* A standard exception. */
12915 /* Numeric_Error is also a standard exception, so exclude it.
12916 See the STANDARD_EXC description for more details as to why
12917 this exception is not listed in that array. */
12918 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
12924 /* A helper function for std::sort, comparing two struct ada_exc_info
12927 The comparison is determined first by exception name, and then
12928 by exception address. */
12931 ada_exc_info::operator< (const ada_exc_info
&other
) const
12935 result
= strcmp (name
, other
.name
);
12938 if (result
== 0 && addr
< other
.addr
)
12944 ada_exc_info::operator== (const ada_exc_info
&other
) const
12946 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
12949 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12950 routine, but keeping the first SKIP elements untouched.
12952 All duplicates are also removed. */
12955 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
12958 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
12959 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
12960 exceptions
->end ());
12963 /* Add all exceptions defined by the Ada standard whose name match
12964 a regular expression.
12966 If PREG is not NULL, then this regexp_t object is used to
12967 perform the symbol name matching. Otherwise, no name-based
12968 filtering is performed.
12970 EXCEPTIONS is a vector of exceptions to which matching exceptions
12974 ada_add_standard_exceptions (compiled_regex
*preg
,
12975 std::vector
<ada_exc_info
> *exceptions
)
12979 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12982 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
12984 struct bound_minimal_symbol msymbol
12985 = ada_lookup_simple_minsym (standard_exc
[i
]);
12987 if (msymbol
.minsym
!= NULL
)
12989 struct ada_exc_info info
12990 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12992 exceptions
->push_back (info
);
12998 /* Add all Ada exceptions defined locally and accessible from the given
13001 If PREG is not NULL, then this regexp_t object is used to
13002 perform the symbol name matching. Otherwise, no name-based
13003 filtering is performed.
13005 EXCEPTIONS is a vector of exceptions to which matching exceptions
13009 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13010 struct frame_info
*frame
,
13011 std::vector
<ada_exc_info
> *exceptions
)
13013 const struct block
*block
= get_frame_block (frame
, 0);
13017 struct block_iterator iter
;
13018 struct symbol
*sym
;
13020 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13022 switch (SYMBOL_CLASS (sym
))
13029 if (ada_is_exception_sym (sym
))
13031 struct ada_exc_info info
= {sym
->print_name (),
13032 SYMBOL_VALUE_ADDRESS (sym
)};
13034 exceptions
->push_back (info
);
13038 if (BLOCK_FUNCTION (block
) != NULL
)
13040 block
= BLOCK_SUPERBLOCK (block
);
13044 /* Return true if NAME matches PREG or if PREG is NULL. */
13047 name_matches_regex (const char *name
, compiled_regex
*preg
)
13049 return (preg
== NULL
13050 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13053 /* Add all exceptions defined globally whose name name match
13054 a regular expression, excluding standard exceptions.
13056 The reason we exclude standard exceptions is that they need
13057 to be handled separately: Standard exceptions are defined inside
13058 a runtime unit which is normally not compiled with debugging info,
13059 and thus usually do not show up in our symbol search. However,
13060 if the unit was in fact built with debugging info, we need to
13061 exclude them because they would duplicate the entry we found
13062 during the special loop that specifically searches for those
13063 standard exceptions.
13065 If PREG is not NULL, then this regexp_t object is used to
13066 perform the symbol name matching. Otherwise, no name-based
13067 filtering is performed.
13069 EXCEPTIONS is a vector of exceptions to which matching exceptions
13073 ada_add_global_exceptions (compiled_regex
*preg
,
13074 std::vector
<ada_exc_info
> *exceptions
)
13076 /* In Ada, the symbol "search name" is a linkage name, whereas the
13077 regular expression used to do the matching refers to the natural
13078 name. So match against the decoded name. */
13079 expand_symtabs_matching (NULL
,
13080 lookup_name_info::match_any (),
13081 [&] (const char *search_name
)
13083 std::string decoded
= ada_decode (search_name
);
13084 return name_matches_regex (decoded
.c_str (), preg
);
13089 for (objfile
*objfile
: current_program_space
->objfiles ())
13091 for (compunit_symtab
*s
: objfile
->compunits ())
13093 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13096 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13098 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13099 struct block_iterator iter
;
13100 struct symbol
*sym
;
13102 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13103 if (ada_is_non_standard_exception_sym (sym
)
13104 && name_matches_regex (sym
->natural_name (), preg
))
13106 struct ada_exc_info info
13107 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13109 exceptions
->push_back (info
);
13116 /* Implements ada_exceptions_list with the regular expression passed
13117 as a regex_t, rather than a string.
13119 If not NULL, PREG is used to filter out exceptions whose names
13120 do not match. Otherwise, all exceptions are listed. */
13122 static std::vector
<ada_exc_info
>
13123 ada_exceptions_list_1 (compiled_regex
*preg
)
13125 std::vector
<ada_exc_info
> result
;
13128 /* First, list the known standard exceptions. These exceptions
13129 need to be handled separately, as they are usually defined in
13130 runtime units that have been compiled without debugging info. */
13132 ada_add_standard_exceptions (preg
, &result
);
13134 /* Next, find all exceptions whose scope is local and accessible
13135 from the currently selected frame. */
13137 if (has_stack_frames ())
13139 prev_len
= result
.size ();
13140 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13142 if (result
.size () > prev_len
)
13143 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13146 /* Add all exceptions whose scope is global. */
13148 prev_len
= result
.size ();
13149 ada_add_global_exceptions (preg
, &result
);
13150 if (result
.size () > prev_len
)
13151 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13156 /* Return a vector of ada_exc_info.
13158 If REGEXP is NULL, all exceptions are included in the result.
13159 Otherwise, it should contain a valid regular expression,
13160 and only the exceptions whose names match that regular expression
13161 are included in the result.
13163 The exceptions are sorted in the following order:
13164 - Standard exceptions (defined by the Ada language), in
13165 alphabetical order;
13166 - Exceptions only visible from the current frame, in
13167 alphabetical order;
13168 - Exceptions whose scope is global, in alphabetical order. */
13170 std::vector
<ada_exc_info
>
13171 ada_exceptions_list (const char *regexp
)
13173 if (regexp
== NULL
)
13174 return ada_exceptions_list_1 (NULL
);
13176 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13177 return ada_exceptions_list_1 (®
);
13180 /* Implement the "info exceptions" command. */
13183 info_exceptions_command (const char *regexp
, int from_tty
)
13185 struct gdbarch
*gdbarch
= get_current_arch ();
13187 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13189 if (regexp
!= NULL
)
13191 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13193 printf_filtered (_("All defined Ada exceptions:\n"));
13195 for (const ada_exc_info
&info
: exceptions
)
13196 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13200 /* Information about operators given special treatment in functions
13202 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13204 #define ADA_OPERATORS \
13205 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13206 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13207 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13208 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13209 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13210 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13211 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13212 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13213 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13214 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13215 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13216 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13217 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13218 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13219 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13220 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13221 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13222 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13223 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13226 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13229 switch (exp
->elts
[pc
- 1].opcode
)
13232 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13235 #define OP_DEFN(op, len, args, binop) \
13236 case op: *oplenp = len; *argsp = args; break;
13242 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13247 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13252 /* Implementation of the exp_descriptor method operator_check. */
13255 ada_operator_check (struct expression
*exp
, int pos
,
13256 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13259 const union exp_element
*const elts
= exp
->elts
;
13260 struct type
*type
= NULL
;
13262 switch (elts
[pos
].opcode
)
13264 case UNOP_IN_RANGE
:
13266 type
= elts
[pos
+ 1].type
;
13270 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13273 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13275 if (type
!= nullptr && type
->objfile_owner () != nullptr
13276 && objfile_func (type
->objfile_owner (), data
))
13282 /* As for operator_length, but assumes PC is pointing at the first
13283 element of the operator, and gives meaningful results only for the
13284 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13287 ada_forward_operator_length (struct expression
*exp
, int pc
,
13288 int *oplenp
, int *argsp
)
13290 switch (exp
->elts
[pc
].opcode
)
13293 *oplenp
= *argsp
= 0;
13296 #define OP_DEFN(op, len, args, binop) \
13297 case op: *oplenp = len; *argsp = args; break;
13303 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13308 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13314 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13316 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13324 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13326 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13331 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13335 /* Ada attributes ('Foo). */
13338 case OP_ATR_LENGTH
:
13342 case OP_ATR_MODULUS
:
13349 case UNOP_IN_RANGE
:
13351 /* XXX: gdb_sprint_host_address, type_sprint */
13352 fprintf_filtered (stream
, _("Type @"));
13353 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13354 fprintf_filtered (stream
, " (");
13355 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13356 fprintf_filtered (stream
, ")");
13358 case BINOP_IN_BOUNDS
:
13359 fprintf_filtered (stream
, " (%d)",
13360 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13362 case TERNOP_IN_RANGE
:
13367 case OP_DISCRETE_RANGE
:
13368 case OP_POSITIONAL
:
13375 char *name
= &exp
->elts
[elt
+ 2].string
;
13376 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13378 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13383 return dump_subexp_body_standard (exp
, stream
, elt
);
13387 for (i
= 0; i
< nargs
; i
+= 1)
13388 elt
= dump_subexp (exp
, stream
, elt
);
13393 /* The Ada extension of print_subexp (q.v.). */
13396 ada_print_subexp (struct expression
*exp
, int *pos
,
13397 struct ui_file
*stream
, enum precedence prec
)
13399 int oplen
, nargs
, i
;
13401 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13403 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13410 print_subexp_standard (exp
, pos
, stream
, prec
);
13414 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13417 case BINOP_IN_BOUNDS
:
13418 /* XXX: sprint_subexp */
13419 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13420 fputs_filtered (" in ", stream
);
13421 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13422 fputs_filtered ("'range", stream
);
13423 if (exp
->elts
[pc
+ 1].longconst
> 1)
13424 fprintf_filtered (stream
, "(%ld)",
13425 (long) exp
->elts
[pc
+ 1].longconst
);
13428 case TERNOP_IN_RANGE
:
13429 if (prec
>= PREC_EQUAL
)
13430 fputs_filtered ("(", stream
);
13431 /* XXX: sprint_subexp */
13432 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13433 fputs_filtered (" in ", stream
);
13434 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13435 fputs_filtered (" .. ", stream
);
13436 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13437 if (prec
>= PREC_EQUAL
)
13438 fputs_filtered (")", stream
);
13443 case OP_ATR_LENGTH
:
13447 case OP_ATR_MODULUS
:
13452 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13454 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13455 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13456 &type_print_raw_options
);
13460 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13461 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13466 for (tem
= 1; tem
< nargs
; tem
+= 1)
13468 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13469 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13471 fputs_filtered (")", stream
);
13476 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13477 fputs_filtered ("'(", stream
);
13478 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13479 fputs_filtered (")", stream
);
13482 case UNOP_IN_RANGE
:
13483 /* XXX: sprint_subexp */
13484 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13485 fputs_filtered (" in ", stream
);
13486 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13487 &type_print_raw_options
);
13490 case OP_DISCRETE_RANGE
:
13491 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13492 fputs_filtered ("..", stream
);
13493 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13497 fputs_filtered ("others => ", stream
);
13498 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13502 for (i
= 0; i
< nargs
-1; i
+= 1)
13505 fputs_filtered ("|", stream
);
13506 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13508 fputs_filtered (" => ", stream
);
13509 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13512 case OP_POSITIONAL
:
13513 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13517 fputs_filtered ("(", stream
);
13518 for (i
= 0; i
< nargs
; i
+= 1)
13521 fputs_filtered (", ", stream
);
13522 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13524 fputs_filtered (")", stream
);
13529 /* Table mapping opcodes into strings for printing operators
13530 and precedences of the operators. */
13532 static const struct op_print ada_op_print_tab
[] = {
13533 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13534 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13535 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13536 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13537 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13538 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13539 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13540 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13541 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13542 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13543 {">", BINOP_GTR
, PREC_ORDER
, 0},
13544 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13545 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13546 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13547 {"+", BINOP_ADD
, PREC_ADD
, 0},
13548 {"-", BINOP_SUB
, PREC_ADD
, 0},
13549 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13550 {"*", BINOP_MUL
, PREC_MUL
, 0},
13551 {"/", BINOP_DIV
, PREC_MUL
, 0},
13552 {"rem", BINOP_REM
, PREC_MUL
, 0},
13553 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13554 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13555 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13556 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13557 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13558 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13559 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13560 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13561 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13562 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13563 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13564 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13567 /* Language vector */
13569 static const struct exp_descriptor ada_exp_descriptor
= {
13571 ada_operator_length
,
13572 ada_operator_check
,
13573 ada_dump_subexp_body
,
13574 ada_evaluate_subexp
13577 /* symbol_name_matcher_ftype adapter for wild_match. */
13580 do_wild_match (const char *symbol_search_name
,
13581 const lookup_name_info
&lookup_name
,
13582 completion_match_result
*comp_match_res
)
13584 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13587 /* symbol_name_matcher_ftype adapter for full_match. */
13590 do_full_match (const char *symbol_search_name
,
13591 const lookup_name_info
&lookup_name
,
13592 completion_match_result
*comp_match_res
)
13594 const char *lname
= lookup_name
.ada ().lookup_name ().c_str ();
13596 /* If both symbols start with "_ada_", just let the loop below
13597 handle the comparison. However, if only the symbol name starts
13598 with "_ada_", skip the prefix and let the match proceed as
13600 if (startswith (symbol_search_name
, "_ada_")
13601 && !startswith (lname
, "_ada"))
13602 symbol_search_name
+= 5;
13604 int uscore_count
= 0;
13605 while (*lname
!= '\0')
13607 if (*symbol_search_name
!= *lname
)
13609 if (*symbol_search_name
== 'B' && uscore_count
== 2
13610 && symbol_search_name
[1] == '_')
13612 symbol_search_name
+= 2;
13613 while (isdigit (*symbol_search_name
))
13614 ++symbol_search_name
;
13615 if (symbol_search_name
[0] == '_'
13616 && symbol_search_name
[1] == '_')
13618 symbol_search_name
+= 2;
13625 if (*symbol_search_name
== '_')
13630 ++symbol_search_name
;
13634 return is_name_suffix (symbol_search_name
);
13637 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13640 do_exact_match (const char *symbol_search_name
,
13641 const lookup_name_info
&lookup_name
,
13642 completion_match_result
*comp_match_res
)
13644 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13647 /* Build the Ada lookup name for LOOKUP_NAME. */
13649 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13651 gdb::string_view user_name
= lookup_name
.name ();
13653 if (!user_name
.empty () && user_name
[0] == '<')
13655 if (user_name
.back () == '>')
13657 = gdb::to_string (user_name
.substr (1, user_name
.size () - 2));
13660 = gdb::to_string (user_name
.substr (1, user_name
.size () - 1));
13661 m_encoded_p
= true;
13662 m_verbatim_p
= true;
13663 m_wild_match_p
= false;
13664 m_standard_p
= false;
13668 m_verbatim_p
= false;
13670 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13674 const char *folded
= ada_fold_name (user_name
);
13675 m_encoded_name
= ada_encode_1 (folded
, false);
13676 if (m_encoded_name
.empty ())
13677 m_encoded_name
= gdb::to_string (user_name
);
13680 m_encoded_name
= gdb::to_string (user_name
);
13682 /* Handle the 'package Standard' special case. See description
13683 of m_standard_p. */
13684 if (startswith (m_encoded_name
.c_str (), "standard__"))
13686 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13687 m_standard_p
= true;
13690 m_standard_p
= false;
13692 /* If the name contains a ".", then the user is entering a fully
13693 qualified entity name, and the match must not be done in wild
13694 mode. Similarly, if the user wants to complete what looks
13695 like an encoded name, the match must not be done in wild
13696 mode. Also, in the standard__ special case always do
13697 non-wild matching. */
13699 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13702 && user_name
.find ('.') == std::string::npos
);
13706 /* symbol_name_matcher_ftype method for Ada. This only handles
13707 completion mode. */
13710 ada_symbol_name_matches (const char *symbol_search_name
,
13711 const lookup_name_info
&lookup_name
,
13712 completion_match_result
*comp_match_res
)
13714 return lookup_name
.ada ().matches (symbol_search_name
,
13715 lookup_name
.match_type (),
13719 /* A name matcher that matches the symbol name exactly, with
13723 literal_symbol_name_matcher (const char *symbol_search_name
,
13724 const lookup_name_info
&lookup_name
,
13725 completion_match_result
*comp_match_res
)
13727 gdb::string_view name_view
= lookup_name
.name ();
13729 if (lookup_name
.completion_mode ()
13730 ? (strncmp (symbol_search_name
, name_view
.data (),
13731 name_view
.size ()) == 0)
13732 : symbol_search_name
== name_view
)
13734 if (comp_match_res
!= NULL
)
13735 comp_match_res
->set_match (symbol_search_name
);
13742 /* Implement the "get_symbol_name_matcher" language_defn method for
13745 static symbol_name_matcher_ftype
*
13746 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
13748 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
13749 return literal_symbol_name_matcher
;
13751 if (lookup_name
.completion_mode ())
13752 return ada_symbol_name_matches
;
13755 if (lookup_name
.ada ().wild_match_p ())
13756 return do_wild_match
;
13757 else if (lookup_name
.ada ().verbatim_p ())
13758 return do_exact_match
;
13760 return do_full_match
;
13764 /* Class representing the Ada language. */
13766 class ada_language
: public language_defn
13770 : language_defn (language_ada
)
13773 /* See language.h. */
13775 const char *name () const override
13778 /* See language.h. */
13780 const char *natural_name () const override
13783 /* See language.h. */
13785 const std::vector
<const char *> &filename_extensions () const override
13787 static const std::vector
<const char *> extensions
13788 = { ".adb", ".ads", ".a", ".ada", ".dg" };
13792 /* Print an array element index using the Ada syntax. */
13794 void print_array_index (struct type
*index_type
,
13796 struct ui_file
*stream
,
13797 const value_print_options
*options
) const override
13799 struct value
*index_value
= val_atr (index_type
, index
);
13801 value_print (index_value
, stream
, options
);
13802 fprintf_filtered (stream
, " => ");
13805 /* Implement the "read_var_value" language_defn method for Ada. */
13807 struct value
*read_var_value (struct symbol
*var
,
13808 const struct block
*var_block
,
13809 struct frame_info
*frame
) const override
13811 /* The only case where default_read_var_value is not sufficient
13812 is when VAR is a renaming... */
13813 if (frame
!= nullptr)
13815 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
13816 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
13817 return ada_read_renaming_var_value (var
, frame_block
);
13820 /* This is a typical case where we expect the default_read_var_value
13821 function to work. */
13822 return language_defn::read_var_value (var
, var_block
, frame
);
13825 /* See language.h. */
13826 void language_arch_info (struct gdbarch
*gdbarch
,
13827 struct language_arch_info
*lai
) const override
13829 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13831 /* Helper function to allow shorter lines below. */
13832 auto add
= [&] (struct type
*t
)
13834 lai
->add_primitive_type (t
);
13837 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13839 add (arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13840 0, "long_integer"));
13841 add (arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13842 0, "short_integer"));
13843 struct type
*char_type
= arch_character_type (gdbarch
, TARGET_CHAR_BIT
,
13845 lai
->set_string_char_type (char_type
);
13847 add (arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13848 "float", gdbarch_float_format (gdbarch
)));
13849 add (arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13850 "long_float", gdbarch_double_format (gdbarch
)));
13851 add (arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13852 0, "long_long_integer"));
13853 add (arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13855 gdbarch_long_double_format (gdbarch
)));
13856 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13858 add (arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13860 add (builtin
->builtin_void
);
13862 struct type
*system_addr_ptr
13863 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13865 system_addr_ptr
->set_name ("system__address");
13866 add (system_addr_ptr
);
13868 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13869 type. This is a signed integral type whose size is the same as
13870 the size of addresses. */
13871 unsigned int addr_length
= TYPE_LENGTH (system_addr_ptr
);
13872 add (arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13873 "storage_offset"));
13875 lai
->set_bool_type (builtin
->builtin_bool
);
13878 /* See language.h. */
13880 bool iterate_over_symbols
13881 (const struct block
*block
, const lookup_name_info
&name
,
13882 domain_enum domain
,
13883 gdb::function_view
<symbol_found_callback_ftype
> callback
) const override
13885 std::vector
<struct block_symbol
> results
;
13887 ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
13888 for (block_symbol
&sym
: results
)
13890 if (!callback (&sym
))
13897 /* See language.h. */
13898 bool sniff_from_mangled_name (const char *mangled
,
13899 char **out
) const override
13901 std::string demangled
= ada_decode (mangled
);
13905 if (demangled
!= mangled
&& demangled
[0] != '<')
13907 /* Set the gsymbol language to Ada, but still return 0.
13908 Two reasons for that:
13910 1. For Ada, we prefer computing the symbol's decoded name
13911 on the fly rather than pre-compute it, in order to save
13912 memory (Ada projects are typically very large).
13914 2. There are some areas in the definition of the GNAT
13915 encoding where, with a bit of bad luck, we might be able
13916 to decode a non-Ada symbol, generating an incorrect
13917 demangled name (Eg: names ending with "TB" for instance
13918 are identified as task bodies and so stripped from
13919 the decoded name returned).
13921 Returning true, here, but not setting *DEMANGLED, helps us get
13922 a little bit of the best of both worlds. Because we're last,
13923 we should not affect any of the other languages that were
13924 able to demangle the symbol before us; we get to correctly
13925 tag Ada symbols as such; and even if we incorrectly tagged a
13926 non-Ada symbol, which should be rare, any routing through the
13927 Ada language should be transparent (Ada tries to behave much
13928 like C/C++ with non-Ada symbols). */
13935 /* See language.h. */
13937 char *demangle_symbol (const char *mangled
, int options
) const override
13939 return ada_la_decode (mangled
, options
);
13942 /* See language.h. */
13944 void print_type (struct type
*type
, const char *varstring
,
13945 struct ui_file
*stream
, int show
, int level
,
13946 const struct type_print_options
*flags
) const override
13948 ada_print_type (type
, varstring
, stream
, show
, level
, flags
);
13951 /* See language.h. */
13953 const char *word_break_characters (void) const override
13955 return ada_completer_word_break_characters
;
13958 /* See language.h. */
13960 void collect_symbol_completion_matches (completion_tracker
&tracker
,
13961 complete_symbol_mode mode
,
13962 symbol_name_match_type name_match_type
,
13963 const char *text
, const char *word
,
13964 enum type_code code
) const override
13966 struct symbol
*sym
;
13967 const struct block
*b
, *surrounding_static_block
= 0;
13968 struct block_iterator iter
;
13970 gdb_assert (code
== TYPE_CODE_UNDEF
);
13972 lookup_name_info
lookup_name (text
, name_match_type
, true);
13974 /* First, look at the partial symtab symbols. */
13975 expand_symtabs_matching (NULL
,
13981 /* At this point scan through the misc symbol vectors and add each
13982 symbol you find to the list. Eventually we want to ignore
13983 anything that isn't a text symbol (everything else will be
13984 handled by the psymtab code above). */
13986 for (objfile
*objfile
: current_program_space
->objfiles ())
13988 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
13992 if (completion_skip_symbol (mode
, msymbol
))
13995 language symbol_language
= msymbol
->language ();
13997 /* Ada minimal symbols won't have their language set to Ada. If
13998 we let completion_list_add_name compare using the
13999 default/C-like matcher, then when completing e.g., symbols in a
14000 package named "pck", we'd match internal Ada symbols like
14001 "pckS", which are invalid in an Ada expression, unless you wrap
14002 them in '<' '>' to request a verbatim match.
14004 Unfortunately, some Ada encoded names successfully demangle as
14005 C++ symbols (using an old mangling scheme), such as "name__2Xn"
14006 -> "Xn::name(void)" and thus some Ada minimal symbols end up
14007 with the wrong language set. Paper over that issue here. */
14008 if (symbol_language
== language_auto
14009 || symbol_language
== language_cplus
)
14010 symbol_language
= language_ada
;
14012 completion_list_add_name (tracker
,
14014 msymbol
->linkage_name (),
14015 lookup_name
, text
, word
);
14019 /* Search upwards from currently selected frame (so that we can
14020 complete on local vars. */
14022 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
14024 if (!BLOCK_SUPERBLOCK (b
))
14025 surrounding_static_block
= b
; /* For elmin of dups */
14027 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14029 if (completion_skip_symbol (mode
, sym
))
14032 completion_list_add_name (tracker
,
14034 sym
->linkage_name (),
14035 lookup_name
, text
, word
);
14039 /* Go through the symtabs and check the externs and statics for
14040 symbols which match. */
14042 for (objfile
*objfile
: current_program_space
->objfiles ())
14044 for (compunit_symtab
*s
: objfile
->compunits ())
14047 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
14048 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14050 if (completion_skip_symbol (mode
, sym
))
14053 completion_list_add_name (tracker
,
14055 sym
->linkage_name (),
14056 lookup_name
, text
, word
);
14061 for (objfile
*objfile
: current_program_space
->objfiles ())
14063 for (compunit_symtab
*s
: objfile
->compunits ())
14066 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
14067 /* Don't do this block twice. */
14068 if (b
== surrounding_static_block
)
14070 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14072 if (completion_skip_symbol (mode
, sym
))
14075 completion_list_add_name (tracker
,
14077 sym
->linkage_name (),
14078 lookup_name
, text
, word
);
14084 /* See language.h. */
14086 gdb::unique_xmalloc_ptr
<char> watch_location_expression
14087 (struct type
*type
, CORE_ADDR addr
) const override
14089 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
14090 std::string name
= type_to_string (type
);
14091 return gdb::unique_xmalloc_ptr
<char>
14092 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
14095 /* See language.h. */
14097 void value_print (struct value
*val
, struct ui_file
*stream
,
14098 const struct value_print_options
*options
) const override
14100 return ada_value_print (val
, stream
, options
);
14103 /* See language.h. */
14105 void value_print_inner
14106 (struct value
*val
, struct ui_file
*stream
, int recurse
,
14107 const struct value_print_options
*options
) const override
14109 return ada_value_print_inner (val
, stream
, recurse
, options
);
14112 /* See language.h. */
14114 struct block_symbol lookup_symbol_nonlocal
14115 (const char *name
, const struct block
*block
,
14116 const domain_enum domain
) const override
14118 struct block_symbol sym
;
14120 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
14121 if (sym
.symbol
!= NULL
)
14124 /* If we haven't found a match at this point, try the primitive
14125 types. In other languages, this search is performed before
14126 searching for global symbols in order to short-circuit that
14127 global-symbol search if it happens that the name corresponds
14128 to a primitive type. But we cannot do the same in Ada, because
14129 it is perfectly legitimate for a program to declare a type which
14130 has the same name as a standard type. If looking up a type in
14131 that situation, we have traditionally ignored the primitive type
14132 in favor of user-defined types. This is why, unlike most other
14133 languages, we search the primitive types this late and only after
14134 having searched the global symbols without success. */
14136 if (domain
== VAR_DOMAIN
)
14138 struct gdbarch
*gdbarch
;
14141 gdbarch
= target_gdbarch ();
14143 gdbarch
= block_gdbarch (block
);
14145 = language_lookup_primitive_type_as_symbol (this, gdbarch
, name
);
14146 if (sym
.symbol
!= NULL
)
14153 /* See language.h. */
14155 int parser (struct parser_state
*ps
) const override
14157 warnings_issued
= 0;
14158 return ada_parse (ps
);
14163 Same as evaluate_type (*EXP), but resolves ambiguous symbol references
14164 (marked by OP_VAR_VALUE nodes in which the symbol has an undefined
14165 namespace) and converts operators that are user-defined into
14166 appropriate function calls. If CONTEXT_TYPE is non-null, it provides
14167 a preferred result type [at the moment, only type void has any
14168 effect---causing procedures to be preferred over functions in calls].
14169 A null CONTEXT_TYPE indicates that a non-void return type is
14170 preferred. May change (expand) *EXP. */
14172 void post_parser (expression_up
*expp
, struct parser_state
*ps
)
14175 struct type
*context_type
= NULL
;
14178 if (ps
->void_context_p
)
14179 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
14181 resolve_subexp (expp
, &pc
, 1, context_type
, ps
->parse_completion
,
14182 ps
->block_tracker
);
14185 /* See language.h. */
14187 void emitchar (int ch
, struct type
*chtype
,
14188 struct ui_file
*stream
, int quoter
) const override
14190 ada_emit_char (ch
, chtype
, stream
, quoter
, 1);
14193 /* See language.h. */
14195 void printchar (int ch
, struct type
*chtype
,
14196 struct ui_file
*stream
) const override
14198 ada_printchar (ch
, chtype
, stream
);
14201 /* See language.h. */
14203 void printstr (struct ui_file
*stream
, struct type
*elttype
,
14204 const gdb_byte
*string
, unsigned int length
,
14205 const char *encoding
, int force_ellipses
,
14206 const struct value_print_options
*options
) const override
14208 ada_printstr (stream
, elttype
, string
, length
, encoding
,
14209 force_ellipses
, options
);
14212 /* See language.h. */
14214 void print_typedef (struct type
*type
, struct symbol
*new_symbol
,
14215 struct ui_file
*stream
) const override
14217 ada_print_typedef (type
, new_symbol
, stream
);
14220 /* See language.h. */
14222 bool is_string_type_p (struct type
*type
) const override
14224 return ada_is_string_type (type
);
14227 /* See language.h. */
14229 const char *struct_too_deep_ellipsis () const override
14230 { return "(...)"; }
14232 /* See language.h. */
14234 bool c_style_arrays_p () const override
14237 /* See language.h. */
14239 bool store_sym_names_in_linkage_form_p () const override
14242 /* See language.h. */
14244 const struct lang_varobj_ops
*varobj_ops () const override
14245 { return &ada_varobj_ops
; }
14247 /* See language.h. */
14249 const struct exp_descriptor
*expression_ops () const override
14250 { return &ada_exp_descriptor
; }
14252 /* See language.h. */
14254 const struct op_print
*opcode_print_table () const override
14255 { return ada_op_print_tab
; }
14258 /* See language.h. */
14260 symbol_name_matcher_ftype
*get_symbol_name_matcher_inner
14261 (const lookup_name_info
&lookup_name
) const override
14263 return ada_get_symbol_name_matcher (lookup_name
);
14267 /* Single instance of the Ada language class. */
14269 static ada_language ada_language_defn
;
14271 /* Command-list for the "set/show ada" prefix command. */
14272 static struct cmd_list_element
*set_ada_list
;
14273 static struct cmd_list_element
*show_ada_list
;
14276 initialize_ada_catchpoint_ops (void)
14278 struct breakpoint_ops
*ops
;
14280 initialize_breakpoint_ops ();
14282 ops
= &catch_exception_breakpoint_ops
;
14283 *ops
= bkpt_breakpoint_ops
;
14284 ops
->allocate_location
= allocate_location_exception
;
14285 ops
->re_set
= re_set_exception
;
14286 ops
->check_status
= check_status_exception
;
14287 ops
->print_it
= print_it_exception
;
14288 ops
->print_one
= print_one_exception
;
14289 ops
->print_mention
= print_mention_exception
;
14290 ops
->print_recreate
= print_recreate_exception
;
14292 ops
= &catch_exception_unhandled_breakpoint_ops
;
14293 *ops
= bkpt_breakpoint_ops
;
14294 ops
->allocate_location
= allocate_location_exception
;
14295 ops
->re_set
= re_set_exception
;
14296 ops
->check_status
= check_status_exception
;
14297 ops
->print_it
= print_it_exception
;
14298 ops
->print_one
= print_one_exception
;
14299 ops
->print_mention
= print_mention_exception
;
14300 ops
->print_recreate
= print_recreate_exception
;
14302 ops
= &catch_assert_breakpoint_ops
;
14303 *ops
= bkpt_breakpoint_ops
;
14304 ops
->allocate_location
= allocate_location_exception
;
14305 ops
->re_set
= re_set_exception
;
14306 ops
->check_status
= check_status_exception
;
14307 ops
->print_it
= print_it_exception
;
14308 ops
->print_one
= print_one_exception
;
14309 ops
->print_mention
= print_mention_exception
;
14310 ops
->print_recreate
= print_recreate_exception
;
14312 ops
= &catch_handlers_breakpoint_ops
;
14313 *ops
= bkpt_breakpoint_ops
;
14314 ops
->allocate_location
= allocate_location_exception
;
14315 ops
->re_set
= re_set_exception
;
14316 ops
->check_status
= check_status_exception
;
14317 ops
->print_it
= print_it_exception
;
14318 ops
->print_one
= print_one_exception
;
14319 ops
->print_mention
= print_mention_exception
;
14320 ops
->print_recreate
= print_recreate_exception
;
14323 /* This module's 'new_objfile' observer. */
14326 ada_new_objfile_observer (struct objfile
*objfile
)
14328 ada_clear_symbol_cache ();
14331 /* This module's 'free_objfile' observer. */
14334 ada_free_objfile_observer (struct objfile
*objfile
)
14336 ada_clear_symbol_cache ();
14339 void _initialize_ada_language ();
14341 _initialize_ada_language ()
14343 initialize_ada_catchpoint_ops ();
14345 add_basic_prefix_cmd ("ada", no_class
,
14346 _("Prefix command for changing Ada-specific settings."),
14347 &set_ada_list
, "set ada ", 0, &setlist
);
14349 add_show_prefix_cmd ("ada", no_class
,
14350 _("Generic command for showing Ada-specific settings."),
14351 &show_ada_list
, "show ada ", 0, &showlist
);
14353 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14354 &trust_pad_over_xvs
, _("\
14355 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14356 Show whether an optimization trusting PAD types over XVS types is activated."),
14358 This is related to the encoding used by the GNAT compiler. The debugger\n\
14359 should normally trust the contents of PAD types, but certain older versions\n\
14360 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14361 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14362 work around this bug. It is always safe to turn this option \"off\", but\n\
14363 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14364 this option to \"off\" unless necessary."),
14365 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14367 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14368 &print_signatures
, _("\
14369 Enable or disable the output of formal and return types for functions in the \
14370 overloads selection menu."), _("\
14371 Show whether the output of formal and return types for functions in the \
14372 overloads selection menu is activated."),
14373 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14375 add_catch_command ("exception", _("\
14376 Catch Ada exceptions, when raised.\n\
14377 Usage: catch exception [ARG] [if CONDITION]\n\
14378 Without any argument, stop when any Ada exception is raised.\n\
14379 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14380 being raised does not have a handler (and will therefore lead to the task's\n\
14382 Otherwise, the catchpoint only stops when the name of the exception being\n\
14383 raised is the same as ARG.\n\
14384 CONDITION is a boolean expression that is evaluated to see whether the\n\
14385 exception should cause a stop."),
14386 catch_ada_exception_command
,
14387 catch_ada_completer
,
14391 add_catch_command ("handlers", _("\
14392 Catch Ada exceptions, when handled.\n\
14393 Usage: catch handlers [ARG] [if CONDITION]\n\
14394 Without any argument, stop when any Ada exception is handled.\n\
14395 With an argument, catch only exceptions with the given name.\n\
14396 CONDITION is a boolean expression that is evaluated to see whether the\n\
14397 exception should cause a stop."),
14398 catch_ada_handlers_command
,
14399 catch_ada_completer
,
14402 add_catch_command ("assert", _("\
14403 Catch failed Ada assertions, when raised.\n\
14404 Usage: catch assert [if CONDITION]\n\
14405 CONDITION is a boolean expression that is evaluated to see whether the\n\
14406 exception should cause a stop."),
14407 catch_assert_command
,
14412 varsize_limit
= 65536;
14413 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14414 &varsize_limit
, _("\
14415 Set the maximum number of bytes allowed in a variable-size object."), _("\
14416 Show the maximum number of bytes allowed in a variable-size object."), _("\
14417 Attempts to access an object whose size is not a compile-time constant\n\
14418 and exceeds this limit will cause an error."),
14419 NULL
, NULL
, &setlist
, &showlist
);
14421 add_info ("exceptions", info_exceptions_command
,
14423 List all Ada exception names.\n\
14424 Usage: info exceptions [REGEXP]\n\
14425 If a regular expression is passed as an argument, only those matching\n\
14426 the regular expression are listed."));
14428 add_basic_prefix_cmd ("ada", class_maintenance
,
14429 _("Set Ada maintenance-related variables."),
14430 &maint_set_ada_cmdlist
, "maintenance set ada ",
14431 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14433 add_show_prefix_cmd ("ada", class_maintenance
,
14434 _("Show Ada maintenance-related variables."),
14435 &maint_show_ada_cmdlist
, "maintenance show ada ",
14436 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14438 add_setshow_boolean_cmd
14439 ("ignore-descriptive-types", class_maintenance
,
14440 &ada_ignore_descriptive_types_p
,
14441 _("Set whether descriptive types generated by GNAT should be ignored."),
14442 _("Show whether descriptive types generated by GNAT should be ignored."),
14444 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14445 DWARF attribute."),
14446 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14448 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14449 NULL
, xcalloc
, xfree
);
14451 /* The ada-lang observers. */
14452 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14453 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14454 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);