1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2020 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_op_name (enum exp_opcode
);
132 static const char *ada_decoded_op_name (enum exp_opcode
);
134 static int numeric_type_p (struct type
*);
136 static int integer_type_p (struct type
*);
138 static int scalar_type_p (struct type
*);
140 static int discrete_type_p (struct type
*);
142 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
145 static struct value
*evaluate_subexp_type (struct expression
*, int *);
147 static struct type
*ada_find_parallel_type_with_name (struct type
*,
150 static int is_dynamic_field (struct type
*, int);
152 static struct type
*to_fixed_variant_branch_type (struct type
*,
154 CORE_ADDR
, struct value
*);
156 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
158 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
160 static struct type
*to_static_fixed_type (struct type
*);
161 static struct type
*static_unwrap_type (struct type
*type
);
163 static struct value
*unwrap_value (struct value
*);
165 static struct type
*constrained_packed_array_type (struct type
*, long *);
167 static struct type
*decode_constrained_packed_array_type (struct type
*);
169 static long decode_packed_array_bitsize (struct type
*);
171 static struct value
*decode_constrained_packed_array (struct value
*);
173 static int ada_is_unconstrained_packed_array_type (struct type
*);
175 static struct value
*value_subscript_packed (struct value
*, int,
178 static struct value
*coerce_unspec_val_to_type (struct value
*,
181 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
183 static int equiv_types (struct type
*, struct type
*);
185 static int is_name_suffix (const char *);
187 static int advance_wild_match (const char **, const char *, char);
189 static bool wild_match (const char *name
, const char *patn
);
191 static struct value
*ada_coerce_ref (struct value
*);
193 static LONGEST
pos_atr (struct value
*);
195 static struct value
*value_pos_atr (struct type
*, struct value
*);
197 static struct value
*val_atr (struct type
*, LONGEST
);
199 static struct value
*value_val_atr (struct type
*, struct value
*);
201 static struct symbol
*standard_lookup (const char *, const struct block
*,
204 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
207 static int find_struct_field (const char *, struct type
*, int,
208 struct type
**, int *, int *, int *, int *);
210 static int ada_resolve_function (struct block_symbol
*, int,
211 struct value
**, int, const char *,
214 static int ada_is_direct_array_type (struct type
*);
216 static struct value
*ada_index_struct_field (int, struct value
*, int,
219 static struct value
*assign_aggregate (struct value
*, struct value
*,
223 static void aggregate_assign_from_choices (struct value
*, struct value
*,
225 int *, LONGEST
*, int *,
226 int, LONGEST
, LONGEST
);
228 static void aggregate_assign_positional (struct value
*, struct value
*,
230 int *, LONGEST
*, int *, int,
234 static void aggregate_assign_others (struct value
*, struct value
*,
236 int *, LONGEST
*, int, LONGEST
, LONGEST
);
239 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
242 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
245 static void ada_forward_operator_length (struct expression
*, int, int *,
248 static struct type
*ada_find_any_type (const char *name
);
250 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
251 (const lookup_name_info
&lookup_name
);
255 /* The result of a symbol lookup to be stored in our symbol cache. */
259 /* The name used to perform the lookup. */
261 /* The namespace used during the lookup. */
263 /* The symbol returned by the lookup, or NULL if no matching symbol
266 /* The block where the symbol was found, or NULL if no matching
268 const struct block
*block
;
269 /* A pointer to the next entry with the same hash. */
270 struct cache_entry
*next
;
273 /* The Ada symbol cache, used to store the result of Ada-mode symbol
274 lookups in the course of executing the user's commands.
276 The cache is implemented using a simple, fixed-sized hash.
277 The size is fixed on the grounds that there are not likely to be
278 all that many symbols looked up during any given session, regardless
279 of the size of the symbol table. If we decide to go to a resizable
280 table, let's just use the stuff from libiberty instead. */
282 #define HASH_SIZE 1009
284 struct ada_symbol_cache
286 /* An obstack used to store the entries in our cache. */
287 struct obstack cache_space
;
289 /* The root of the hash table used to implement our symbol cache. */
290 struct cache_entry
*root
[HASH_SIZE
];
293 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
295 /* Maximum-sized dynamic type. */
296 static unsigned int varsize_limit
;
298 static const char ada_completer_word_break_characters
[] =
300 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
302 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
305 /* The name of the symbol to use to get the name of the main subprogram. */
306 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
307 = "__gnat_ada_main_program_name";
309 /* Limit on the number of warnings to raise per expression evaluation. */
310 static int warning_limit
= 2;
312 /* Number of warning messages issued; reset to 0 by cleanups after
313 expression evaluation. */
314 static int warnings_issued
= 0;
316 static const char * const known_runtime_file_name_patterns
[] = {
317 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
320 static const char * const known_auxiliary_function_name_patterns
[] = {
321 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
324 /* Maintenance-related settings for this module. */
326 static struct cmd_list_element
*maint_set_ada_cmdlist
;
327 static struct cmd_list_element
*maint_show_ada_cmdlist
;
329 /* The "maintenance ada set/show ignore-descriptive-type" value. */
331 static bool ada_ignore_descriptive_types_p
= false;
333 /* Inferior-specific data. */
335 /* Per-inferior data for this module. */
337 struct ada_inferior_data
339 /* The ada__tags__type_specific_data type, which is used when decoding
340 tagged types. With older versions of GNAT, this type was directly
341 accessible through a component ("tsd") in the object tag. But this
342 is no longer the case, so we cache it for each inferior. */
343 struct type
*tsd_type
= nullptr;
345 /* The exception_support_info data. This data is used to determine
346 how to implement support for Ada exception catchpoints in a given
348 const struct exception_support_info
*exception_info
= nullptr;
351 /* Our key to this module's inferior data. */
352 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
354 /* Return our inferior data for the given inferior (INF).
356 This function always returns a valid pointer to an allocated
357 ada_inferior_data structure. If INF's inferior data has not
358 been previously set, this functions creates a new one with all
359 fields set to zero, sets INF's inferior to it, and then returns
360 a pointer to that newly allocated ada_inferior_data. */
362 static struct ada_inferior_data
*
363 get_ada_inferior_data (struct inferior
*inf
)
365 struct ada_inferior_data
*data
;
367 data
= ada_inferior_data
.get (inf
);
369 data
= ada_inferior_data
.emplace (inf
);
374 /* Perform all necessary cleanups regarding our module's inferior data
375 that is required after the inferior INF just exited. */
378 ada_inferior_exit (struct inferior
*inf
)
380 ada_inferior_data
.clear (inf
);
384 /* program-space-specific data. */
386 /* This module's per-program-space data. */
387 struct ada_pspace_data
391 if (sym_cache
!= NULL
)
392 ada_free_symbol_cache (sym_cache
);
395 /* The Ada symbol cache. */
396 struct ada_symbol_cache
*sym_cache
= nullptr;
399 /* Key to our per-program-space data. */
400 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
402 /* Return this module's data for the given program space (PSPACE).
403 If not is found, add a zero'ed one now.
405 This function always returns a valid object. */
407 static struct ada_pspace_data
*
408 get_ada_pspace_data (struct program_space
*pspace
)
410 struct ada_pspace_data
*data
;
412 data
= ada_pspace_data_handle
.get (pspace
);
414 data
= ada_pspace_data_handle
.emplace (pspace
);
421 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
422 all typedef layers have been peeled. Otherwise, return TYPE.
424 Normally, we really expect a typedef type to only have 1 typedef layer.
425 In other words, we really expect the target type of a typedef type to be
426 a non-typedef type. This is particularly true for Ada units, because
427 the language does not have a typedef vs not-typedef distinction.
428 In that respect, the Ada compiler has been trying to eliminate as many
429 typedef definitions in the debugging information, since they generally
430 do not bring any extra information (we still use typedef under certain
431 circumstances related mostly to the GNAT encoding).
433 Unfortunately, we have seen situations where the debugging information
434 generated by the compiler leads to such multiple typedef layers. For
435 instance, consider the following example with stabs:
437 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
438 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
440 This is an error in the debugging information which causes type
441 pck__float_array___XUP to be defined twice, and the second time,
442 it is defined as a typedef of a typedef.
444 This is on the fringe of legality as far as debugging information is
445 concerned, and certainly unexpected. But it is easy to handle these
446 situations correctly, so we can afford to be lenient in this case. */
449 ada_typedef_target_type (struct type
*type
)
451 while (type
->code () == TYPE_CODE_TYPEDEF
)
452 type
= TYPE_TARGET_TYPE (type
);
456 /* Given DECODED_NAME a string holding a symbol name in its
457 decoded form (ie using the Ada dotted notation), returns
458 its unqualified name. */
461 ada_unqualified_name (const char *decoded_name
)
465 /* If the decoded name starts with '<', it means that the encoded
466 name does not follow standard naming conventions, and thus that
467 it is not your typical Ada symbol name. Trying to unqualify it
468 is therefore pointless and possibly erroneous. */
469 if (decoded_name
[0] == '<')
472 result
= strrchr (decoded_name
, '.');
474 result
++; /* Skip the dot... */
476 result
= decoded_name
;
481 /* Return a string starting with '<', followed by STR, and '>'. */
484 add_angle_brackets (const char *str
)
486 return string_printf ("<%s>", str
);
489 /* Assuming V points to an array of S objects, make sure that it contains at
490 least M objects, updating V and S as necessary. */
492 #define GROW_VECT(v, s, m) \
493 if ((s) < (m)) (v) = (char *) grow_vect (v, &(s), m, sizeof *(v));
495 /* Assuming VECT points to an array of *SIZE objects of size
496 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
497 updating *SIZE as necessary and returning the (new) array. */
500 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
502 if (*size
< min_size
)
505 if (*size
< min_size
)
507 vect
= xrealloc (vect
, *size
* element_size
);
512 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
513 suffix of FIELD_NAME beginning "___". */
516 field_name_match (const char *field_name
, const char *target
)
518 int len
= strlen (target
);
521 (strncmp (field_name
, target
, len
) == 0
522 && (field_name
[len
] == '\0'
523 || (startswith (field_name
+ len
, "___")
524 && strcmp (field_name
+ strlen (field_name
) - 6,
529 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
530 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
531 and return its index. This function also handles fields whose name
532 have ___ suffixes because the compiler sometimes alters their name
533 by adding such a suffix to represent fields with certain constraints.
534 If the field could not be found, return a negative number if
535 MAYBE_MISSING is set. Otherwise raise an error. */
538 ada_get_field_index (const struct type
*type
, const char *field_name
,
542 struct type
*struct_type
= check_typedef ((struct type
*) type
);
544 for (fieldno
= 0; fieldno
< struct_type
->num_fields (); fieldno
++)
545 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
549 error (_("Unable to find field %s in struct %s. Aborting"),
550 field_name
, struct_type
->name ());
555 /* The length of the prefix of NAME prior to any "___" suffix. */
558 ada_name_prefix_len (const char *name
)
564 const char *p
= strstr (name
, "___");
567 return strlen (name
);
573 /* Return non-zero if SUFFIX is a suffix of STR.
574 Return zero if STR is null. */
577 is_suffix (const char *str
, const char *suffix
)
584 len2
= strlen (suffix
);
585 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
588 /* The contents of value VAL, treated as a value of type TYPE. The
589 result is an lval in memory if VAL is. */
591 static struct value
*
592 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
594 type
= ada_check_typedef (type
);
595 if (value_type (val
) == type
)
599 struct value
*result
;
601 /* Make sure that the object size is not unreasonable before
602 trying to allocate some memory for it. */
603 ada_ensure_varsize_limit (type
);
606 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
607 result
= allocate_value_lazy (type
);
610 result
= allocate_value (type
);
611 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
613 set_value_component_location (result
, val
);
614 set_value_bitsize (result
, value_bitsize (val
));
615 set_value_bitpos (result
, value_bitpos (val
));
616 if (VALUE_LVAL (result
) == lval_memory
)
617 set_value_address (result
, value_address (val
));
622 static const gdb_byte
*
623 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
628 return valaddr
+ offset
;
632 cond_offset_target (CORE_ADDR address
, long offset
)
637 return address
+ offset
;
640 /* Issue a warning (as for the definition of warning in utils.c, but
641 with exactly one argument rather than ...), unless the limit on the
642 number of warnings has passed during the evaluation of the current
645 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
646 provided by "complaint". */
647 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
650 lim_warning (const char *format
, ...)
654 va_start (args
, format
);
655 warnings_issued
+= 1;
656 if (warnings_issued
<= warning_limit
)
657 vwarning (format
, args
);
662 /* Issue an error if the size of an object of type T is unreasonable,
663 i.e. if it would be a bad idea to allocate a value of this type in
667 ada_ensure_varsize_limit (const struct type
*type
)
669 if (TYPE_LENGTH (type
) > varsize_limit
)
670 error (_("object size is larger than varsize-limit"));
673 /* Maximum value of a SIZE-byte signed integer type. */
675 max_of_size (int size
)
677 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
679 return top_bit
| (top_bit
- 1);
682 /* Minimum value of a SIZE-byte signed integer type. */
684 min_of_size (int size
)
686 return -max_of_size (size
) - 1;
689 /* Maximum value of a SIZE-byte unsigned integer type. */
691 umax_of_size (int size
)
693 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
695 return top_bit
| (top_bit
- 1);
698 /* Maximum value of integral type T, as a signed quantity. */
700 max_of_type (struct type
*t
)
702 if (t
->is_unsigned ())
703 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
705 return max_of_size (TYPE_LENGTH (t
));
708 /* Minimum value of integral type T, as a signed quantity. */
710 min_of_type (struct type
*t
)
712 if (t
->is_unsigned ())
715 return min_of_size (TYPE_LENGTH (t
));
718 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
720 ada_discrete_type_high_bound (struct type
*type
)
722 type
= resolve_dynamic_type (type
, {}, 0);
723 switch (type
->code ())
725 case TYPE_CODE_RANGE
:
727 const dynamic_prop
&high
= type
->bounds ()->high
;
729 if (high
.kind () == PROP_CONST
)
730 return high
.const_val ();
733 gdb_assert (high
.kind () == PROP_UNDEFINED
);
735 /* This happens when trying to evaluate a type's dynamic bound
736 without a live target. There is nothing relevant for us to
737 return here, so return 0. */
742 return TYPE_FIELD_ENUMVAL (type
, type
->num_fields () - 1);
747 return max_of_type (type
);
749 error (_("Unexpected type in ada_discrete_type_high_bound."));
753 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
755 ada_discrete_type_low_bound (struct type
*type
)
757 type
= resolve_dynamic_type (type
, {}, 0);
758 switch (type
->code ())
760 case TYPE_CODE_RANGE
:
762 const dynamic_prop
&low
= type
->bounds ()->low
;
764 if (low
.kind () == PROP_CONST
)
765 return low
.const_val ();
768 gdb_assert (low
.kind () == PROP_UNDEFINED
);
770 /* This happens when trying to evaluate a type's dynamic bound
771 without a live target. There is nothing relevant for us to
772 return here, so return 0. */
777 return TYPE_FIELD_ENUMVAL (type
, 0);
782 return min_of_type (type
);
784 error (_("Unexpected type in ada_discrete_type_low_bound."));
788 /* The identity on non-range types. For range types, the underlying
789 non-range scalar type. */
792 get_base_type (struct type
*type
)
794 while (type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
)
796 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
798 type
= TYPE_TARGET_TYPE (type
);
803 /* Return a decoded version of the given VALUE. This means returning
804 a value whose type is obtained by applying all the GNAT-specific
805 encodings, making the resulting type a static but standard description
806 of the initial type. */
809 ada_get_decoded_value (struct value
*value
)
811 struct type
*type
= ada_check_typedef (value_type (value
));
813 if (ada_is_array_descriptor_type (type
)
814 || (ada_is_constrained_packed_array_type (type
)
815 && type
->code () != TYPE_CODE_PTR
))
817 if (type
->code () == TYPE_CODE_TYPEDEF
) /* array access type. */
818 value
= ada_coerce_to_simple_array_ptr (value
);
820 value
= ada_coerce_to_simple_array (value
);
823 value
= ada_to_fixed_value (value
);
828 /* Same as ada_get_decoded_value, but with the given TYPE.
829 Because there is no associated actual value for this type,
830 the resulting type might be a best-effort approximation in
831 the case of dynamic types. */
834 ada_get_decoded_type (struct type
*type
)
836 type
= to_static_fixed_type (type
);
837 if (ada_is_constrained_packed_array_type (type
))
838 type
= ada_coerce_to_simple_array_type (type
);
844 /* Language Selection */
846 /* If the main program is in Ada, return language_ada, otherwise return LANG
847 (the main program is in Ada iif the adainit symbol is found). */
850 ada_update_initial_language (enum language lang
)
852 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
858 /* If the main procedure is written in Ada, then return its name.
859 The result is good until the next call. Return NULL if the main
860 procedure doesn't appear to be in Ada. */
865 struct bound_minimal_symbol msym
;
866 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
868 /* For Ada, the name of the main procedure is stored in a specific
869 string constant, generated by the binder. Look for that symbol,
870 extract its address, and then read that string. If we didn't find
871 that string, then most probably the main procedure is not written
873 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
875 if (msym
.minsym
!= NULL
)
877 CORE_ADDR main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
878 if (main_program_name_addr
== 0)
879 error (_("Invalid address for Ada main program name."));
881 main_program_name
= target_read_string (main_program_name_addr
, 1024);
882 return main_program_name
.get ();
885 /* The main procedure doesn't seem to be in Ada. */
891 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
894 const struct ada_opname_map ada_opname_table
[] = {
895 {"Oadd", "\"+\"", BINOP_ADD
},
896 {"Osubtract", "\"-\"", BINOP_SUB
},
897 {"Omultiply", "\"*\"", BINOP_MUL
},
898 {"Odivide", "\"/\"", BINOP_DIV
},
899 {"Omod", "\"mod\"", BINOP_MOD
},
900 {"Orem", "\"rem\"", BINOP_REM
},
901 {"Oexpon", "\"**\"", BINOP_EXP
},
902 {"Olt", "\"<\"", BINOP_LESS
},
903 {"Ole", "\"<=\"", BINOP_LEQ
},
904 {"Ogt", "\">\"", BINOP_GTR
},
905 {"Oge", "\">=\"", BINOP_GEQ
},
906 {"Oeq", "\"=\"", BINOP_EQUAL
},
907 {"One", "\"/=\"", BINOP_NOTEQUAL
},
908 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
909 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
910 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
911 {"Oconcat", "\"&\"", BINOP_CONCAT
},
912 {"Oabs", "\"abs\"", UNOP_ABS
},
913 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
914 {"Oadd", "\"+\"", UNOP_PLUS
},
915 {"Osubtract", "\"-\"", UNOP_NEG
},
919 /* The "encoded" form of DECODED, according to GNAT conventions. If
920 THROW_ERRORS, throw an error if invalid operator name is found.
921 Otherwise, return the empty string in that case. */
924 ada_encode_1 (const char *decoded
, bool throw_errors
)
929 std::string encoding_buffer
;
930 for (const char *p
= decoded
; *p
!= '\0'; p
+= 1)
933 encoding_buffer
.append ("__");
936 const struct ada_opname_map
*mapping
;
938 for (mapping
= ada_opname_table
;
939 mapping
->encoded
!= NULL
940 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
942 if (mapping
->encoded
== NULL
)
945 error (_("invalid Ada operator name: %s"), p
);
949 encoding_buffer
.append (mapping
->encoded
);
953 encoding_buffer
.push_back (*p
);
956 return encoding_buffer
;
959 /* The "encoded" form of DECODED, according to GNAT conventions. */
962 ada_encode (const char *decoded
)
964 return ada_encode_1 (decoded
, true);
967 /* Return NAME folded to lower case, or, if surrounded by single
968 quotes, unfolded, but with the quotes stripped away. Result good
972 ada_fold_name (gdb::string_view name
)
974 static char *fold_buffer
= NULL
;
975 static size_t fold_buffer_size
= 0;
977 int len
= name
.size ();
978 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
982 strncpy (fold_buffer
, name
.data () + 1, len
- 2);
983 fold_buffer
[len
- 2] = '\000';
989 for (i
= 0; i
<= len
; i
+= 1)
990 fold_buffer
[i
] = tolower (name
[i
]);
996 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
999 is_lower_alphanum (const char c
)
1001 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1004 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1005 This function saves in LEN the length of that same symbol name but
1006 without either of these suffixes:
1012 These are suffixes introduced by the compiler for entities such as
1013 nested subprogram for instance, in order to avoid name clashes.
1014 They do not serve any purpose for the debugger. */
1017 ada_remove_trailing_digits (const char *encoded
, int *len
)
1019 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1023 while (i
> 0 && isdigit (encoded
[i
]))
1025 if (i
>= 0 && encoded
[i
] == '.')
1027 else if (i
>= 0 && encoded
[i
] == '$')
1029 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1031 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1036 /* Remove the suffix introduced by the compiler for protected object
1040 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1042 /* Remove trailing N. */
1044 /* Protected entry subprograms are broken into two
1045 separate subprograms: The first one is unprotected, and has
1046 a 'N' suffix; the second is the protected version, and has
1047 the 'P' suffix. The second calls the first one after handling
1048 the protection. Since the P subprograms are internally generated,
1049 we leave these names undecoded, giving the user a clue that this
1050 entity is internal. */
1053 && encoded
[*len
- 1] == 'N'
1054 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1058 /* If ENCODED follows the GNAT entity encoding conventions, then return
1059 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1060 replaced by ENCODED. */
1063 ada_decode (const char *encoded
)
1069 std::string decoded
;
1071 /* With function descriptors on PPC64, the value of a symbol named
1072 ".FN", if it exists, is the entry point of the function "FN". */
1073 if (encoded
[0] == '.')
1076 /* The name of the Ada main procedure starts with "_ada_".
1077 This prefix is not part of the decoded name, so skip this part
1078 if we see this prefix. */
1079 if (startswith (encoded
, "_ada_"))
1082 /* If the name starts with '_', then it is not a properly encoded
1083 name, so do not attempt to decode it. Similarly, if the name
1084 starts with '<', the name should not be decoded. */
1085 if (encoded
[0] == '_' || encoded
[0] == '<')
1088 len0
= strlen (encoded
);
1090 ada_remove_trailing_digits (encoded
, &len0
);
1091 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1093 /* Remove the ___X.* suffix if present. Do not forget to verify that
1094 the suffix is located before the current "end" of ENCODED. We want
1095 to avoid re-matching parts of ENCODED that have previously been
1096 marked as discarded (by decrementing LEN0). */
1097 p
= strstr (encoded
, "___");
1098 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1106 /* Remove any trailing TKB suffix. It tells us that this symbol
1107 is for the body of a task, but that information does not actually
1108 appear in the decoded name. */
1110 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1113 /* Remove any trailing TB suffix. The TB suffix is slightly different
1114 from the TKB suffix because it is used for non-anonymous task
1117 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1120 /* Remove trailing "B" suffixes. */
1121 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1123 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1126 /* Make decoded big enough for possible expansion by operator name. */
1128 decoded
.resize (2 * len0
+ 1, 'X');
1130 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1132 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1135 while ((i
>= 0 && isdigit (encoded
[i
]))
1136 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1138 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1140 else if (encoded
[i
] == '$')
1144 /* The first few characters that are not alphabetic are not part
1145 of any encoding we use, so we can copy them over verbatim. */
1147 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1148 decoded
[j
] = encoded
[i
];
1153 /* Is this a symbol function? */
1154 if (at_start_name
&& encoded
[i
] == 'O')
1158 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1160 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1161 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1163 && !isalnum (encoded
[i
+ op_len
]))
1165 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1168 j
+= strlen (ada_opname_table
[k
].decoded
);
1172 if (ada_opname_table
[k
].encoded
!= NULL
)
1177 /* Replace "TK__" with "__", which will eventually be translated
1178 into "." (just below). */
1180 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1183 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1184 be translated into "." (just below). These are internal names
1185 generated for anonymous blocks inside which our symbol is nested. */
1187 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1188 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1189 && isdigit (encoded
[i
+4]))
1193 while (k
< len0
&& isdigit (encoded
[k
]))
1194 k
++; /* Skip any extra digit. */
1196 /* Double-check that the "__B_{DIGITS}+" sequence we found
1197 is indeed followed by "__". */
1198 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1202 /* Remove _E{DIGITS}+[sb] */
1204 /* Just as for protected object subprograms, there are 2 categories
1205 of subprograms created by the compiler for each entry. The first
1206 one implements the actual entry code, and has a suffix following
1207 the convention above; the second one implements the barrier and
1208 uses the same convention as above, except that the 'E' is replaced
1211 Just as above, we do not decode the name of barrier functions
1212 to give the user a clue that the code he is debugging has been
1213 internally generated. */
1215 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1216 && isdigit (encoded
[i
+2]))
1220 while (k
< len0
&& isdigit (encoded
[k
]))
1224 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1227 /* Just as an extra precaution, make sure that if this
1228 suffix is followed by anything else, it is a '_'.
1229 Otherwise, we matched this sequence by accident. */
1231 || (k
< len0
&& encoded
[k
] == '_'))
1236 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1237 the GNAT front-end in protected object subprograms. */
1240 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1242 /* Backtrack a bit up until we reach either the begining of
1243 the encoded name, or "__". Make sure that we only find
1244 digits or lowercase characters. */
1245 const char *ptr
= encoded
+ i
- 1;
1247 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1250 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1254 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1256 /* This is a X[bn]* sequence not separated from the previous
1257 part of the name with a non-alpha-numeric character (in other
1258 words, immediately following an alpha-numeric character), then
1259 verify that it is placed at the end of the encoded name. If
1260 not, then the encoding is not valid and we should abort the
1261 decoding. Otherwise, just skip it, it is used in body-nested
1265 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1269 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1271 /* Replace '__' by '.'. */
1279 /* It's a character part of the decoded name, so just copy it
1281 decoded
[j
] = encoded
[i
];
1288 /* Decoded names should never contain any uppercase character.
1289 Double-check this, and abort the decoding if we find one. */
1291 for (i
= 0; i
< decoded
.length(); ++i
)
1292 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1298 if (encoded
[0] == '<')
1301 decoded
= '<' + std::string(encoded
) + '>';
1306 /* Table for keeping permanent unique copies of decoded names. Once
1307 allocated, names in this table are never released. While this is a
1308 storage leak, it should not be significant unless there are massive
1309 changes in the set of decoded names in successive versions of a
1310 symbol table loaded during a single session. */
1311 static struct htab
*decoded_names_store
;
1313 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1314 in the language-specific part of GSYMBOL, if it has not been
1315 previously computed. Tries to save the decoded name in the same
1316 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1317 in any case, the decoded symbol has a lifetime at least that of
1319 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1320 const, but nevertheless modified to a semantically equivalent form
1321 when a decoded name is cached in it. */
1324 ada_decode_symbol (const struct general_symbol_info
*arg
)
1326 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1327 const char **resultp
=
1328 &gsymbol
->language_specific
.demangled_name
;
1330 if (!gsymbol
->ada_mangled
)
1332 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1333 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1335 gsymbol
->ada_mangled
= 1;
1337 if (obstack
!= NULL
)
1338 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1341 /* Sometimes, we can't find a corresponding objfile, in
1342 which case, we put the result on the heap. Since we only
1343 decode when needed, we hope this usually does not cause a
1344 significant memory leak (FIXME). */
1346 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1347 decoded
.c_str (), INSERT
);
1350 *slot
= xstrdup (decoded
.c_str ());
1359 ada_la_decode (const char *encoded
, int options
)
1361 return xstrdup (ada_decode (encoded
).c_str ());
1368 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1369 generated by the GNAT compiler to describe the index type used
1370 for each dimension of an array, check whether it follows the latest
1371 known encoding. If not, fix it up to conform to the latest encoding.
1372 Otherwise, do nothing. This function also does nothing if
1373 INDEX_DESC_TYPE is NULL.
1375 The GNAT encoding used to describe the array index type evolved a bit.
1376 Initially, the information would be provided through the name of each
1377 field of the structure type only, while the type of these fields was
1378 described as unspecified and irrelevant. The debugger was then expected
1379 to perform a global type lookup using the name of that field in order
1380 to get access to the full index type description. Because these global
1381 lookups can be very expensive, the encoding was later enhanced to make
1382 the global lookup unnecessary by defining the field type as being
1383 the full index type description.
1385 The purpose of this routine is to allow us to support older versions
1386 of the compiler by detecting the use of the older encoding, and by
1387 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1388 we essentially replace each field's meaningless type by the associated
1392 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1396 if (index_desc_type
== NULL
)
1398 gdb_assert (index_desc_type
->num_fields () > 0);
1400 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1401 to check one field only, no need to check them all). If not, return
1404 If our INDEX_DESC_TYPE was generated using the older encoding,
1405 the field type should be a meaningless integer type whose name
1406 is not equal to the field name. */
1407 if (index_desc_type
->field (0).type ()->name () != NULL
1408 && strcmp (index_desc_type
->field (0).type ()->name (),
1409 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1412 /* Fixup each field of INDEX_DESC_TYPE. */
1413 for (i
= 0; i
< index_desc_type
->num_fields (); i
++)
1415 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1416 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1419 index_desc_type
->field (i
).set_type (raw_type
);
1423 /* The desc_* routines return primitive portions of array descriptors
1426 /* The descriptor or array type, if any, indicated by TYPE; removes
1427 level of indirection, if needed. */
1429 static struct type
*
1430 desc_base_type (struct type
*type
)
1434 type
= ada_check_typedef (type
);
1435 if (type
->code () == TYPE_CODE_TYPEDEF
)
1436 type
= ada_typedef_target_type (type
);
1439 && (type
->code () == TYPE_CODE_PTR
1440 || type
->code () == TYPE_CODE_REF
))
1441 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1446 /* True iff TYPE indicates a "thin" array pointer type. */
1449 is_thin_pntr (struct type
*type
)
1452 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1453 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1456 /* The descriptor type for thin pointer type TYPE. */
1458 static struct type
*
1459 thin_descriptor_type (struct type
*type
)
1461 struct type
*base_type
= desc_base_type (type
);
1463 if (base_type
== NULL
)
1465 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1469 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1471 if (alt_type
== NULL
)
1478 /* A pointer to the array data for thin-pointer value VAL. */
1480 static struct value
*
1481 thin_data_pntr (struct value
*val
)
1483 struct type
*type
= ada_check_typedef (value_type (val
));
1484 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1486 data_type
= lookup_pointer_type (data_type
);
1488 if (type
->code () == TYPE_CODE_PTR
)
1489 return value_cast (data_type
, value_copy (val
));
1491 return value_from_longest (data_type
, value_address (val
));
1494 /* True iff TYPE indicates a "thick" array pointer type. */
1497 is_thick_pntr (struct type
*type
)
1499 type
= desc_base_type (type
);
1500 return (type
!= NULL
&& type
->code () == TYPE_CODE_STRUCT
1501 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1504 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1505 pointer to one, the type of its bounds data; otherwise, NULL. */
1507 static struct type
*
1508 desc_bounds_type (struct type
*type
)
1512 type
= desc_base_type (type
);
1516 else if (is_thin_pntr (type
))
1518 type
= thin_descriptor_type (type
);
1521 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1523 return ada_check_typedef (r
);
1525 else if (type
->code () == TYPE_CODE_STRUCT
)
1527 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1529 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1534 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1535 one, a pointer to its bounds data. Otherwise NULL. */
1537 static struct value
*
1538 desc_bounds (struct value
*arr
)
1540 struct type
*type
= ada_check_typedef (value_type (arr
));
1542 if (is_thin_pntr (type
))
1544 struct type
*bounds_type
=
1545 desc_bounds_type (thin_descriptor_type (type
));
1548 if (bounds_type
== NULL
)
1549 error (_("Bad GNAT array descriptor"));
1551 /* NOTE: The following calculation is not really kosher, but
1552 since desc_type is an XVE-encoded type (and shouldn't be),
1553 the correct calculation is a real pain. FIXME (and fix GCC). */
1554 if (type
->code () == TYPE_CODE_PTR
)
1555 addr
= value_as_long (arr
);
1557 addr
= value_address (arr
);
1560 value_from_longest (lookup_pointer_type (bounds_type
),
1561 addr
- TYPE_LENGTH (bounds_type
));
1564 else if (is_thick_pntr (type
))
1566 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1567 _("Bad GNAT array descriptor"));
1568 struct type
*p_bounds_type
= value_type (p_bounds
);
1571 && p_bounds_type
->code () == TYPE_CODE_PTR
)
1573 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1575 if (target_type
->is_stub ())
1576 p_bounds
= value_cast (lookup_pointer_type
1577 (ada_check_typedef (target_type
)),
1581 error (_("Bad GNAT array descriptor"));
1589 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1590 position of the field containing the address of the bounds data. */
1593 fat_pntr_bounds_bitpos (struct type
*type
)
1595 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1598 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1599 size of the field containing the address of the bounds data. */
1602 fat_pntr_bounds_bitsize (struct type
*type
)
1604 type
= desc_base_type (type
);
1606 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1607 return TYPE_FIELD_BITSIZE (type
, 1);
1609 return 8 * TYPE_LENGTH (ada_check_typedef (type
->field (1).type ()));
1612 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1613 pointer to one, the type of its array data (a array-with-no-bounds type);
1614 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1617 static struct type
*
1618 desc_data_target_type (struct type
*type
)
1620 type
= desc_base_type (type
);
1622 /* NOTE: The following is bogus; see comment in desc_bounds. */
1623 if (is_thin_pntr (type
))
1624 return desc_base_type (thin_descriptor_type (type
)->field (1).type ());
1625 else if (is_thick_pntr (type
))
1627 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1630 && ada_check_typedef (data_type
)->code () == TYPE_CODE_PTR
)
1631 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1637 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1640 static struct value
*
1641 desc_data (struct value
*arr
)
1643 struct type
*type
= value_type (arr
);
1645 if (is_thin_pntr (type
))
1646 return thin_data_pntr (arr
);
1647 else if (is_thick_pntr (type
))
1648 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1649 _("Bad GNAT array descriptor"));
1655 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1656 position of the field containing the address of the data. */
1659 fat_pntr_data_bitpos (struct type
*type
)
1661 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1664 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1665 size of the field containing the address of the data. */
1668 fat_pntr_data_bitsize (struct type
*type
)
1670 type
= desc_base_type (type
);
1672 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1673 return TYPE_FIELD_BITSIZE (type
, 0);
1675 return TARGET_CHAR_BIT
* TYPE_LENGTH (type
->field (0).type ());
1678 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1679 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1680 bound, if WHICH is 1. The first bound is I=1. */
1682 static struct value
*
1683 desc_one_bound (struct value
*bounds
, int i
, int which
)
1685 char bound_name
[20];
1686 xsnprintf (bound_name
, sizeof (bound_name
), "%cB%d",
1687 which
? 'U' : 'L', i
- 1);
1688 return value_struct_elt (&bounds
, NULL
, bound_name
, NULL
,
1689 _("Bad GNAT array descriptor bounds"));
1692 /* If BOUNDS is an array-bounds structure type, return the bit position
1693 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1694 bound, if WHICH is 1. The first bound is I=1. */
1697 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1699 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1702 /* If BOUNDS is an array-bounds structure type, return the bit field size
1703 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1704 bound, if WHICH is 1. The first bound is I=1. */
1707 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1709 type
= desc_base_type (type
);
1711 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1712 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1714 return 8 * TYPE_LENGTH (type
->field (2 * i
+ which
- 2).type ());
1717 /* If TYPE is the type of an array-bounds structure, the type of its
1718 Ith bound (numbering from 1). Otherwise, NULL. */
1720 static struct type
*
1721 desc_index_type (struct type
*type
, int i
)
1723 type
= desc_base_type (type
);
1725 if (type
->code () == TYPE_CODE_STRUCT
)
1727 char bound_name
[20];
1728 xsnprintf (bound_name
, sizeof (bound_name
), "LB%d", i
- 1);
1729 return lookup_struct_elt_type (type
, bound_name
, 1);
1735 /* The number of index positions in the array-bounds type TYPE.
1736 Return 0 if TYPE is NULL. */
1739 desc_arity (struct type
*type
)
1741 type
= desc_base_type (type
);
1744 return type
->num_fields () / 2;
1748 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1749 an array descriptor type (representing an unconstrained array
1753 ada_is_direct_array_type (struct type
*type
)
1757 type
= ada_check_typedef (type
);
1758 return (type
->code () == TYPE_CODE_ARRAY
1759 || ada_is_array_descriptor_type (type
));
1762 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1766 ada_is_array_type (struct type
*type
)
1769 && (type
->code () == TYPE_CODE_PTR
1770 || type
->code () == TYPE_CODE_REF
))
1771 type
= TYPE_TARGET_TYPE (type
);
1772 return ada_is_direct_array_type (type
);
1775 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1778 ada_is_simple_array_type (struct type
*type
)
1782 type
= ada_check_typedef (type
);
1783 return (type
->code () == TYPE_CODE_ARRAY
1784 || (type
->code () == TYPE_CODE_PTR
1785 && (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ()
1786 == TYPE_CODE_ARRAY
)));
1789 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1792 ada_is_array_descriptor_type (struct type
*type
)
1794 struct type
*data_type
= desc_data_target_type (type
);
1798 type
= ada_check_typedef (type
);
1799 return (data_type
!= NULL
1800 && data_type
->code () == TYPE_CODE_ARRAY
1801 && desc_arity (desc_bounds_type (type
)) > 0);
1804 /* Non-zero iff type is a partially mal-formed GNAT array
1805 descriptor. FIXME: This is to compensate for some problems with
1806 debugging output from GNAT. Re-examine periodically to see if it
1810 ada_is_bogus_array_descriptor (struct type
*type
)
1814 && type
->code () == TYPE_CODE_STRUCT
1815 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1816 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1817 && !ada_is_array_descriptor_type (type
);
1821 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1822 (fat pointer) returns the type of the array data described---specifically,
1823 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1824 in from the descriptor; otherwise, they are left unspecified. If
1825 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1826 returns NULL. The result is simply the type of ARR if ARR is not
1829 static struct type
*
1830 ada_type_of_array (struct value
*arr
, int bounds
)
1832 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1833 return decode_constrained_packed_array_type (value_type (arr
));
1835 if (!ada_is_array_descriptor_type (value_type (arr
)))
1836 return value_type (arr
);
1840 struct type
*array_type
=
1841 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1843 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1844 TYPE_FIELD_BITSIZE (array_type
, 0) =
1845 decode_packed_array_bitsize (value_type (arr
));
1851 struct type
*elt_type
;
1853 struct value
*descriptor
;
1855 elt_type
= ada_array_element_type (value_type (arr
), -1);
1856 arity
= ada_array_arity (value_type (arr
));
1858 if (elt_type
== NULL
|| arity
== 0)
1859 return ada_check_typedef (value_type (arr
));
1861 descriptor
= desc_bounds (arr
);
1862 if (value_as_long (descriptor
) == 0)
1866 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1867 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1868 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1869 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1872 create_static_range_type (range_type
, value_type (low
),
1873 longest_to_int (value_as_long (low
)),
1874 longest_to_int (value_as_long (high
)));
1875 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1877 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1879 /* We need to store the element packed bitsize, as well as
1880 recompute the array size, because it was previously
1881 computed based on the unpacked element size. */
1882 LONGEST lo
= value_as_long (low
);
1883 LONGEST hi
= value_as_long (high
);
1885 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1886 decode_packed_array_bitsize (value_type (arr
));
1887 /* If the array has no element, then the size is already
1888 zero, and does not need to be recomputed. */
1892 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1894 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1899 return lookup_pointer_type (elt_type
);
1903 /* If ARR does not represent an array, returns ARR unchanged.
1904 Otherwise, returns either a standard GDB array with bounds set
1905 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1906 GDB array. Returns NULL if ARR is a null fat pointer. */
1909 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1911 if (ada_is_array_descriptor_type (value_type (arr
)))
1913 struct type
*arrType
= ada_type_of_array (arr
, 1);
1915 if (arrType
== NULL
)
1917 return value_cast (arrType
, value_copy (desc_data (arr
)));
1919 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1920 return decode_constrained_packed_array (arr
);
1925 /* If ARR does not represent an array, returns ARR unchanged.
1926 Otherwise, returns a standard GDB array describing ARR (which may
1927 be ARR itself if it already is in the proper form). */
1930 ada_coerce_to_simple_array (struct value
*arr
)
1932 if (ada_is_array_descriptor_type (value_type (arr
)))
1934 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1937 error (_("Bounds unavailable for null array pointer."));
1938 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
1939 return value_ind (arrVal
);
1941 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1942 return decode_constrained_packed_array (arr
);
1947 /* If TYPE represents a GNAT array type, return it translated to an
1948 ordinary GDB array type (possibly with BITSIZE fields indicating
1949 packing). For other types, is the identity. */
1952 ada_coerce_to_simple_array_type (struct type
*type
)
1954 if (ada_is_constrained_packed_array_type (type
))
1955 return decode_constrained_packed_array_type (type
);
1957 if (ada_is_array_descriptor_type (type
))
1958 return ada_check_typedef (desc_data_target_type (type
));
1963 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1966 ada_is_gnat_encoded_packed_array_type (struct type
*type
)
1970 type
= desc_base_type (type
);
1971 type
= ada_check_typedef (type
);
1973 ada_type_name (type
) != NULL
1974 && strstr (ada_type_name (type
), "___XP") != NULL
;
1977 /* Non-zero iff TYPE represents a standard GNAT constrained
1978 packed-array type. */
1981 ada_is_constrained_packed_array_type (struct type
*type
)
1983 return ada_is_gnat_encoded_packed_array_type (type
)
1984 && !ada_is_array_descriptor_type (type
);
1987 /* Non-zero iff TYPE represents an array descriptor for a
1988 unconstrained packed-array type. */
1991 ada_is_unconstrained_packed_array_type (struct type
*type
)
1993 if (!ada_is_array_descriptor_type (type
))
1996 if (ada_is_gnat_encoded_packed_array_type (type
))
1999 /* If we saw GNAT encodings, then the above code is sufficient.
2000 However, with minimal encodings, we will just have a thick
2002 if (is_thick_pntr (type
))
2004 type
= desc_base_type (type
);
2005 /* The structure's first field is a pointer to an array, so this
2006 fetches the array type. */
2007 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
2008 /* Now we can see if the array elements are packed. */
2009 return TYPE_FIELD_BITSIZE (type
, 0) > 0;
2015 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2016 return the size of its elements in bits. */
2019 decode_packed_array_bitsize (struct type
*type
)
2021 const char *raw_name
;
2025 /* Access to arrays implemented as fat pointers are encoded as a typedef
2026 of the fat pointer type. We need the name of the fat pointer type
2027 to do the decoding, so strip the typedef layer. */
2028 if (type
->code () == TYPE_CODE_TYPEDEF
)
2029 type
= ada_typedef_target_type (type
);
2031 raw_name
= ada_type_name (ada_check_typedef (type
));
2033 raw_name
= ada_type_name (desc_base_type (type
));
2038 tail
= strstr (raw_name
, "___XP");
2039 if (tail
== nullptr)
2041 gdb_assert (is_thick_pntr (type
));
2042 /* The structure's first field is a pointer to an array, so this
2043 fetches the array type. */
2044 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
2045 /* Now we can see if the array elements are packed. */
2046 return TYPE_FIELD_BITSIZE (type
, 0);
2049 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2052 (_("could not understand bit size information on packed array"));
2059 /* Given that TYPE is a standard GDB array type with all bounds filled
2060 in, and that the element size of its ultimate scalar constituents
2061 (that is, either its elements, or, if it is an array of arrays, its
2062 elements' elements, etc.) is *ELT_BITS, return an identical type,
2063 but with the bit sizes of its elements (and those of any
2064 constituent arrays) recorded in the BITSIZE components of its
2065 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2068 Note that, for arrays whose index type has an XA encoding where
2069 a bound references a record discriminant, getting that discriminant,
2070 and therefore the actual value of that bound, is not possible
2071 because none of the given parameters gives us access to the record.
2072 This function assumes that it is OK in the context where it is being
2073 used to return an array whose bounds are still dynamic and where
2074 the length is arbitrary. */
2076 static struct type
*
2077 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2079 struct type
*new_elt_type
;
2080 struct type
*new_type
;
2081 struct type
*index_type_desc
;
2082 struct type
*index_type
;
2083 LONGEST low_bound
, high_bound
;
2085 type
= ada_check_typedef (type
);
2086 if (type
->code () != TYPE_CODE_ARRAY
)
2089 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2090 if (index_type_desc
)
2091 index_type
= to_fixed_range_type (index_type_desc
->field (0).type (),
2094 index_type
= type
->index_type ();
2096 new_type
= alloc_type_copy (type
);
2098 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2100 create_array_type (new_type
, new_elt_type
, index_type
);
2101 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2102 new_type
->set_name (ada_type_name (type
));
2104 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2105 && is_dynamic_type (check_typedef (index_type
)))
2106 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2107 low_bound
= high_bound
= 0;
2108 if (high_bound
< low_bound
)
2109 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2112 *elt_bits
*= (high_bound
- low_bound
+ 1);
2113 TYPE_LENGTH (new_type
) =
2114 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2117 new_type
->set_is_fixed_instance (true);
2121 /* The array type encoded by TYPE, where
2122 ada_is_constrained_packed_array_type (TYPE). */
2124 static struct type
*
2125 decode_constrained_packed_array_type (struct type
*type
)
2127 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2130 struct type
*shadow_type
;
2134 raw_name
= ada_type_name (desc_base_type (type
));
2139 name
= (char *) alloca (strlen (raw_name
) + 1);
2140 tail
= strstr (raw_name
, "___XP");
2141 type
= desc_base_type (type
);
2143 memcpy (name
, raw_name
, tail
- raw_name
);
2144 name
[tail
- raw_name
] = '\000';
2146 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2148 if (shadow_type
== NULL
)
2150 lim_warning (_("could not find bounds information on packed array"));
2153 shadow_type
= check_typedef (shadow_type
);
2155 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2157 lim_warning (_("could not understand bounds "
2158 "information on packed array"));
2162 bits
= decode_packed_array_bitsize (type
);
2163 return constrained_packed_array_type (shadow_type
, &bits
);
2166 /* Helper function for decode_constrained_packed_array. Set the field
2167 bitsize on a series of packed arrays. Returns the number of
2168 elements in TYPE. */
2171 recursively_update_array_bitsize (struct type
*type
)
2173 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
2176 if (get_discrete_bounds (type
->index_type (), &low
, &high
) < 0
2179 LONGEST our_len
= high
- low
+ 1;
2181 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
2182 if (elt_type
->code () == TYPE_CODE_ARRAY
)
2184 LONGEST elt_len
= recursively_update_array_bitsize (elt_type
);
2185 LONGEST elt_bitsize
= elt_len
* TYPE_FIELD_BITSIZE (elt_type
, 0);
2186 TYPE_FIELD_BITSIZE (type
, 0) = elt_bitsize
;
2188 TYPE_LENGTH (type
) = ((our_len
* elt_bitsize
+ HOST_CHAR_BIT
- 1)
2195 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2196 array, returns a simple array that denotes that array. Its type is a
2197 standard GDB array type except that the BITSIZEs of the array
2198 target types are set to the number of bits in each element, and the
2199 type length is set appropriately. */
2201 static struct value
*
2202 decode_constrained_packed_array (struct value
*arr
)
2206 /* If our value is a pointer, then dereference it. Likewise if
2207 the value is a reference. Make sure that this operation does not
2208 cause the target type to be fixed, as this would indirectly cause
2209 this array to be decoded. The rest of the routine assumes that
2210 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2211 and "value_ind" routines to perform the dereferencing, as opposed
2212 to using "ada_coerce_ref" or "ada_value_ind". */
2213 arr
= coerce_ref (arr
);
2214 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2215 arr
= value_ind (arr
);
2217 type
= decode_constrained_packed_array_type (value_type (arr
));
2220 error (_("can't unpack array"));
2224 /* Decoding the packed array type could not correctly set the field
2225 bitsizes for any dimension except the innermost, because the
2226 bounds may be variable and were not passed to that function. So,
2227 we further resolve the array bounds here and then update the
2229 const gdb_byte
*valaddr
= value_contents_for_printing (arr
);
2230 CORE_ADDR address
= value_address (arr
);
2231 gdb::array_view
<const gdb_byte
> view
2232 = gdb::make_array_view (valaddr
, TYPE_LENGTH (type
));
2233 type
= resolve_dynamic_type (type
, view
, address
);
2234 recursively_update_array_bitsize (type
);
2236 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2237 && ada_is_modular_type (value_type (arr
)))
2239 /* This is a (right-justified) modular type representing a packed
2240 array with no wrapper. In order to interpret the value through
2241 the (left-justified) packed array type we just built, we must
2242 first left-justify it. */
2243 int bit_size
, bit_pos
;
2246 mod
= ada_modulus (value_type (arr
)) - 1;
2253 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2254 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2255 bit_pos
/ HOST_CHAR_BIT
,
2256 bit_pos
% HOST_CHAR_BIT
,
2261 return coerce_unspec_val_to_type (arr
, type
);
2265 /* The value of the element of packed array ARR at the ARITY indices
2266 given in IND. ARR must be a simple array. */
2268 static struct value
*
2269 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2272 int bits
, elt_off
, bit_off
;
2273 long elt_total_bit_offset
;
2274 struct type
*elt_type
;
2278 elt_total_bit_offset
= 0;
2279 elt_type
= ada_check_typedef (value_type (arr
));
2280 for (i
= 0; i
< arity
; i
+= 1)
2282 if (elt_type
->code () != TYPE_CODE_ARRAY
2283 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2285 (_("attempt to do packed indexing of "
2286 "something other than a packed array"));
2289 struct type
*range_type
= elt_type
->index_type ();
2290 LONGEST lowerbound
, upperbound
;
2293 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2295 lim_warning (_("don't know bounds of array"));
2296 lowerbound
= upperbound
= 0;
2299 idx
= pos_atr (ind
[i
]);
2300 if (idx
< lowerbound
|| idx
> upperbound
)
2301 lim_warning (_("packed array index %ld out of bounds"),
2303 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2304 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2305 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2308 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2309 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2311 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2316 /* Non-zero iff TYPE includes negative integer values. */
2319 has_negatives (struct type
*type
)
2321 switch (type
->code ())
2326 return !type
->is_unsigned ();
2327 case TYPE_CODE_RANGE
:
2328 return type
->bounds ()->low
.const_val () - type
->bounds ()->bias
< 0;
2332 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2333 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2334 the unpacked buffer.
2336 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2337 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2339 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2342 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2344 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2347 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2348 gdb_byte
*unpacked
, int unpacked_len
,
2349 int is_big_endian
, int is_signed_type
,
2352 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2353 int src_idx
; /* Index into the source area */
2354 int src_bytes_left
; /* Number of source bytes left to process. */
2355 int srcBitsLeft
; /* Number of source bits left to move */
2356 int unusedLS
; /* Number of bits in next significant
2357 byte of source that are unused */
2359 int unpacked_idx
; /* Index into the unpacked buffer */
2360 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2362 unsigned long accum
; /* Staging area for bits being transferred */
2363 int accumSize
; /* Number of meaningful bits in accum */
2366 /* Transmit bytes from least to most significant; delta is the direction
2367 the indices move. */
2368 int delta
= is_big_endian
? -1 : 1;
2370 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2372 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2373 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2374 bit_size
, unpacked_len
);
2376 srcBitsLeft
= bit_size
;
2377 src_bytes_left
= src_len
;
2378 unpacked_bytes_left
= unpacked_len
;
2383 src_idx
= src_len
- 1;
2385 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2389 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2395 unpacked_idx
= unpacked_len
- 1;
2399 /* Non-scalar values must be aligned at a byte boundary... */
2401 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2402 /* ... And are placed at the beginning (most-significant) bytes
2404 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2405 unpacked_bytes_left
= unpacked_idx
+ 1;
2410 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2412 src_idx
= unpacked_idx
= 0;
2413 unusedLS
= bit_offset
;
2416 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2421 while (src_bytes_left
> 0)
2423 /* Mask for removing bits of the next source byte that are not
2424 part of the value. */
2425 unsigned int unusedMSMask
=
2426 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2428 /* Sign-extend bits for this byte. */
2429 unsigned int signMask
= sign
& ~unusedMSMask
;
2432 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2433 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2434 if (accumSize
>= HOST_CHAR_BIT
)
2436 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2437 accumSize
-= HOST_CHAR_BIT
;
2438 accum
>>= HOST_CHAR_BIT
;
2439 unpacked_bytes_left
-= 1;
2440 unpacked_idx
+= delta
;
2442 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2444 src_bytes_left
-= 1;
2447 while (unpacked_bytes_left
> 0)
2449 accum
|= sign
<< accumSize
;
2450 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2451 accumSize
-= HOST_CHAR_BIT
;
2454 accum
>>= HOST_CHAR_BIT
;
2455 unpacked_bytes_left
-= 1;
2456 unpacked_idx
+= delta
;
2460 /* Create a new value of type TYPE from the contents of OBJ starting
2461 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2462 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2463 assigning through the result will set the field fetched from.
2464 VALADDR is ignored unless OBJ is NULL, in which case,
2465 VALADDR+OFFSET must address the start of storage containing the
2466 packed value. The value returned in this case is never an lval.
2467 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2470 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2471 long offset
, int bit_offset
, int bit_size
,
2475 const gdb_byte
*src
; /* First byte containing data to unpack */
2477 const int is_scalar
= is_scalar_type (type
);
2478 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2479 gdb::byte_vector staging
;
2481 type
= ada_check_typedef (type
);
2484 src
= valaddr
+ offset
;
2486 src
= value_contents (obj
) + offset
;
2488 if (is_dynamic_type (type
))
2490 /* The length of TYPE might by dynamic, so we need to resolve
2491 TYPE in order to know its actual size, which we then use
2492 to create the contents buffer of the value we return.
2493 The difficulty is that the data containing our object is
2494 packed, and therefore maybe not at a byte boundary. So, what
2495 we do, is unpack the data into a byte-aligned buffer, and then
2496 use that buffer as our object's value for resolving the type. */
2497 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2498 staging
.resize (staging_len
);
2500 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2501 staging
.data (), staging
.size (),
2502 is_big_endian
, has_negatives (type
),
2504 type
= resolve_dynamic_type (type
, staging
, 0);
2505 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2507 /* This happens when the length of the object is dynamic,
2508 and is actually smaller than the space reserved for it.
2509 For instance, in an array of variant records, the bit_size
2510 we're given is the array stride, which is constant and
2511 normally equal to the maximum size of its element.
2512 But, in reality, each element only actually spans a portion
2514 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2520 v
= allocate_value (type
);
2521 src
= valaddr
+ offset
;
2523 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2525 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2528 v
= value_at (type
, value_address (obj
) + offset
);
2529 buf
= (gdb_byte
*) alloca (src_len
);
2530 read_memory (value_address (v
), buf
, src_len
);
2535 v
= allocate_value (type
);
2536 src
= value_contents (obj
) + offset
;
2541 long new_offset
= offset
;
2543 set_value_component_location (v
, obj
);
2544 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2545 set_value_bitsize (v
, bit_size
);
2546 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2549 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2551 set_value_offset (v
, new_offset
);
2553 /* Also set the parent value. This is needed when trying to
2554 assign a new value (in inferior memory). */
2555 set_value_parent (v
, obj
);
2558 set_value_bitsize (v
, bit_size
);
2559 unpacked
= value_contents_writeable (v
);
2563 memset (unpacked
, 0, TYPE_LENGTH (type
));
2567 if (staging
.size () == TYPE_LENGTH (type
))
2569 /* Small short-cut: If we've unpacked the data into a buffer
2570 of the same size as TYPE's length, then we can reuse that,
2571 instead of doing the unpacking again. */
2572 memcpy (unpacked
, staging
.data (), staging
.size ());
2575 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2576 unpacked
, TYPE_LENGTH (type
),
2577 is_big_endian
, has_negatives (type
), is_scalar
);
2582 /* Store the contents of FROMVAL into the location of TOVAL.
2583 Return a new value with the location of TOVAL and contents of
2584 FROMVAL. Handles assignment into packed fields that have
2585 floating-point or non-scalar types. */
2587 static struct value
*
2588 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2590 struct type
*type
= value_type (toval
);
2591 int bits
= value_bitsize (toval
);
2593 toval
= ada_coerce_ref (toval
);
2594 fromval
= ada_coerce_ref (fromval
);
2596 if (ada_is_direct_array_type (value_type (toval
)))
2597 toval
= ada_coerce_to_simple_array (toval
);
2598 if (ada_is_direct_array_type (value_type (fromval
)))
2599 fromval
= ada_coerce_to_simple_array (fromval
);
2601 if (!deprecated_value_modifiable (toval
))
2602 error (_("Left operand of assignment is not a modifiable lvalue."));
2604 if (VALUE_LVAL (toval
) == lval_memory
2606 && (type
->code () == TYPE_CODE_FLT
2607 || type
->code () == TYPE_CODE_STRUCT
))
2609 int len
= (value_bitpos (toval
)
2610 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2612 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2614 CORE_ADDR to_addr
= value_address (toval
);
2616 if (type
->code () == TYPE_CODE_FLT
)
2617 fromval
= value_cast (type
, fromval
);
2619 read_memory (to_addr
, buffer
, len
);
2620 from_size
= value_bitsize (fromval
);
2622 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2624 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2625 ULONGEST from_offset
= 0;
2626 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2627 from_offset
= from_size
- bits
;
2628 copy_bitwise (buffer
, value_bitpos (toval
),
2629 value_contents (fromval
), from_offset
,
2630 bits
, is_big_endian
);
2631 write_memory_with_notification (to_addr
, buffer
, len
);
2633 val
= value_copy (toval
);
2634 memcpy (value_contents_raw (val
), value_contents (fromval
),
2635 TYPE_LENGTH (type
));
2636 deprecated_set_value_type (val
, type
);
2641 return value_assign (toval
, fromval
);
2645 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2646 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2647 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2648 COMPONENT, and not the inferior's memory. The current contents
2649 of COMPONENT are ignored.
2651 Although not part of the initial design, this function also works
2652 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2653 had a null address, and COMPONENT had an address which is equal to
2654 its offset inside CONTAINER. */
2657 value_assign_to_component (struct value
*container
, struct value
*component
,
2660 LONGEST offset_in_container
=
2661 (LONGEST
) (value_address (component
) - value_address (container
));
2662 int bit_offset_in_container
=
2663 value_bitpos (component
) - value_bitpos (container
);
2666 val
= value_cast (value_type (component
), val
);
2668 if (value_bitsize (component
) == 0)
2669 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2671 bits
= value_bitsize (component
);
2673 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2677 if (is_scalar_type (check_typedef (value_type (component
))))
2679 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2682 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2683 value_bitpos (container
) + bit_offset_in_container
,
2684 value_contents (val
), src_offset
, bits
, 1);
2687 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2688 value_bitpos (container
) + bit_offset_in_container
,
2689 value_contents (val
), 0, bits
, 0);
2692 /* Determine if TYPE is an access to an unconstrained array. */
2695 ada_is_access_to_unconstrained_array (struct type
*type
)
2697 return (type
->code () == TYPE_CODE_TYPEDEF
2698 && is_thick_pntr (ada_typedef_target_type (type
)));
2701 /* The value of the element of array ARR at the ARITY indices given in IND.
2702 ARR may be either a simple array, GNAT array descriptor, or pointer
2706 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2710 struct type
*elt_type
;
2712 elt
= ada_coerce_to_simple_array (arr
);
2714 elt_type
= ada_check_typedef (value_type (elt
));
2715 if (elt_type
->code () == TYPE_CODE_ARRAY
2716 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2717 return value_subscript_packed (elt
, arity
, ind
);
2719 for (k
= 0; k
< arity
; k
+= 1)
2721 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2723 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2724 error (_("too many subscripts (%d expected)"), k
);
2726 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2728 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2729 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2731 /* The element is a typedef to an unconstrained array,
2732 except that the value_subscript call stripped the
2733 typedef layer. The typedef layer is GNAT's way to
2734 specify that the element is, at the source level, an
2735 access to the unconstrained array, rather than the
2736 unconstrained array. So, we need to restore that
2737 typedef layer, which we can do by forcing the element's
2738 type back to its original type. Otherwise, the returned
2739 value is going to be printed as the array, rather
2740 than as an access. Another symptom of the same issue
2741 would be that an expression trying to dereference the
2742 element would also be improperly rejected. */
2743 deprecated_set_value_type (elt
, saved_elt_type
);
2746 elt_type
= ada_check_typedef (value_type (elt
));
2752 /* Assuming ARR is a pointer to a GDB array, the value of the element
2753 of *ARR at the ARITY indices given in IND.
2754 Does not read the entire array into memory.
2756 Note: Unlike what one would expect, this function is used instead of
2757 ada_value_subscript for basically all non-packed array types. The reason
2758 for this is that a side effect of doing our own pointer arithmetics instead
2759 of relying on value_subscript is that there is no implicit typedef peeling.
2760 This is important for arrays of array accesses, where it allows us to
2761 preserve the fact that the array's element is an array access, where the
2762 access part os encoded in a typedef layer. */
2764 static struct value
*
2765 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2768 struct value
*array_ind
= ada_value_ind (arr
);
2770 = check_typedef (value_enclosing_type (array_ind
));
2772 if (type
->code () == TYPE_CODE_ARRAY
2773 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2774 return value_subscript_packed (array_ind
, arity
, ind
);
2776 for (k
= 0; k
< arity
; k
+= 1)
2780 if (type
->code () != TYPE_CODE_ARRAY
)
2781 error (_("too many subscripts (%d expected)"), k
);
2782 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2784 get_discrete_bounds (type
->index_type (), &lwb
, &upb
);
2785 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2786 type
= TYPE_TARGET_TYPE (type
);
2789 return value_ind (arr
);
2792 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2793 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2794 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2795 this array is LOW, as per Ada rules. */
2796 static struct value
*
2797 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2800 struct type
*type0
= ada_check_typedef (type
);
2801 struct type
*base_index_type
= TYPE_TARGET_TYPE (type0
->index_type ());
2802 struct type
*index_type
2803 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2804 struct type
*slice_type
= create_array_type_with_stride
2805 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2806 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2807 TYPE_FIELD_BITSIZE (type0
, 0));
2808 int base_low
= ada_discrete_type_low_bound (type0
->index_type ());
2809 LONGEST base_low_pos
, low_pos
;
2812 if (!discrete_position (base_index_type
, low
, &low_pos
)
2813 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2815 warning (_("unable to get positions in slice, use bounds instead"));
2817 base_low_pos
= base_low
;
2820 base
= value_as_address (array_ptr
)
2821 + ((low_pos
- base_low_pos
)
2822 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2823 return value_at_lazy (slice_type
, base
);
2827 static struct value
*
2828 ada_value_slice (struct value
*array
, int low
, int high
)
2830 struct type
*type
= ada_check_typedef (value_type (array
));
2831 struct type
*base_index_type
= TYPE_TARGET_TYPE (type
->index_type ());
2832 struct type
*index_type
2833 = create_static_range_type (NULL
, type
->index_type (), low
, high
);
2834 struct type
*slice_type
= create_array_type_with_stride
2835 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2836 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2837 TYPE_FIELD_BITSIZE (type
, 0));
2838 LONGEST low_pos
, high_pos
;
2840 if (!discrete_position (base_index_type
, low
, &low_pos
)
2841 || !discrete_position (base_index_type
, high
, &high_pos
))
2843 warning (_("unable to get positions in slice, use bounds instead"));
2848 return value_cast (slice_type
,
2849 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2852 /* If type is a record type in the form of a standard GNAT array
2853 descriptor, returns the number of dimensions for type. If arr is a
2854 simple array, returns the number of "array of"s that prefix its
2855 type designation. Otherwise, returns 0. */
2858 ada_array_arity (struct type
*type
)
2865 type
= desc_base_type (type
);
2868 if (type
->code () == TYPE_CODE_STRUCT
)
2869 return desc_arity (desc_bounds_type (type
));
2871 while (type
->code () == TYPE_CODE_ARRAY
)
2874 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2880 /* If TYPE is a record type in the form of a standard GNAT array
2881 descriptor or a simple array type, returns the element type for
2882 TYPE after indexing by NINDICES indices, or by all indices if
2883 NINDICES is -1. Otherwise, returns NULL. */
2886 ada_array_element_type (struct type
*type
, int nindices
)
2888 type
= desc_base_type (type
);
2890 if (type
->code () == TYPE_CODE_STRUCT
)
2893 struct type
*p_array_type
;
2895 p_array_type
= desc_data_target_type (type
);
2897 k
= ada_array_arity (type
);
2901 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2902 if (nindices
>= 0 && k
> nindices
)
2904 while (k
> 0 && p_array_type
!= NULL
)
2906 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2909 return p_array_type
;
2911 else if (type
->code () == TYPE_CODE_ARRAY
)
2913 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2915 type
= TYPE_TARGET_TYPE (type
);
2924 /* The type of nth index in arrays of given type (n numbering from 1).
2925 Does not examine memory. Throws an error if N is invalid or TYPE
2926 is not an array type. NAME is the name of the Ada attribute being
2927 evaluated ('range, 'first, 'last, or 'length); it is used in building
2928 the error message. */
2930 static struct type
*
2931 ada_index_type (struct type
*type
, int n
, const char *name
)
2933 struct type
*result_type
;
2935 type
= desc_base_type (type
);
2937 if (n
< 0 || n
> ada_array_arity (type
))
2938 error (_("invalid dimension number to '%s"), name
);
2940 if (ada_is_simple_array_type (type
))
2944 for (i
= 1; i
< n
; i
+= 1)
2945 type
= TYPE_TARGET_TYPE (type
);
2946 result_type
= TYPE_TARGET_TYPE (type
->index_type ());
2947 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2948 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2949 perhaps stabsread.c would make more sense. */
2950 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2955 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2956 if (result_type
== NULL
)
2957 error (_("attempt to take bound of something that is not an array"));
2963 /* Given that arr is an array type, returns the lower bound of the
2964 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2965 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2966 array-descriptor type. It works for other arrays with bounds supplied
2967 by run-time quantities other than discriminants. */
2970 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2972 struct type
*type
, *index_type_desc
, *index_type
;
2975 gdb_assert (which
== 0 || which
== 1);
2977 if (ada_is_constrained_packed_array_type (arr_type
))
2978 arr_type
= decode_constrained_packed_array_type (arr_type
);
2980 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2981 return (LONGEST
) - which
;
2983 if (arr_type
->code () == TYPE_CODE_PTR
)
2984 type
= TYPE_TARGET_TYPE (arr_type
);
2988 if (type
->is_fixed_instance ())
2990 /* The array has already been fixed, so we do not need to
2991 check the parallel ___XA type again. That encoding has
2992 already been applied, so ignore it now. */
2993 index_type_desc
= NULL
;
2997 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2998 ada_fixup_array_indexes_type (index_type_desc
);
3001 if (index_type_desc
!= NULL
)
3002 index_type
= to_fixed_range_type (index_type_desc
->field (n
- 1).type (),
3006 struct type
*elt_type
= check_typedef (type
);
3008 for (i
= 1; i
< n
; i
++)
3009 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3011 index_type
= elt_type
->index_type ();
3015 (LONGEST
) (which
== 0
3016 ? ada_discrete_type_low_bound (index_type
)
3017 : ada_discrete_type_high_bound (index_type
));
3020 /* Given that arr is an array value, returns the lower bound of the
3021 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3022 WHICH is 1. This routine will also work for arrays with bounds
3023 supplied by run-time quantities other than discriminants. */
3026 ada_array_bound (struct value
*arr
, int n
, int which
)
3028 struct type
*arr_type
;
3030 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3031 arr
= value_ind (arr
);
3032 arr_type
= value_enclosing_type (arr
);
3034 if (ada_is_constrained_packed_array_type (arr_type
))
3035 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3036 else if (ada_is_simple_array_type (arr_type
))
3037 return ada_array_bound_from_type (arr_type
, n
, which
);
3039 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3042 /* Given that arr is an array value, returns the length of the
3043 nth index. This routine will also work for arrays with bounds
3044 supplied by run-time quantities other than discriminants.
3045 Does not work for arrays indexed by enumeration types with representation
3046 clauses at the moment. */
3049 ada_array_length (struct value
*arr
, int n
)
3051 struct type
*arr_type
, *index_type
;
3054 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3055 arr
= value_ind (arr
);
3056 arr_type
= value_enclosing_type (arr
);
3058 if (ada_is_constrained_packed_array_type (arr_type
))
3059 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3061 if (ada_is_simple_array_type (arr_type
))
3063 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3064 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3068 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3069 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3072 arr_type
= check_typedef (arr_type
);
3073 index_type
= ada_index_type (arr_type
, n
, "length");
3074 if (index_type
!= NULL
)
3076 struct type
*base_type
;
3077 if (index_type
->code () == TYPE_CODE_RANGE
)
3078 base_type
= TYPE_TARGET_TYPE (index_type
);
3080 base_type
= index_type
;
3082 low
= pos_atr (value_from_longest (base_type
, low
));
3083 high
= pos_atr (value_from_longest (base_type
, high
));
3085 return high
- low
+ 1;
3088 /* An array whose type is that of ARR_TYPE (an array type), with
3089 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3090 less than LOW, then LOW-1 is used. */
3092 static struct value
*
3093 empty_array (struct type
*arr_type
, int low
, int high
)
3095 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3096 struct type
*index_type
3097 = create_static_range_type
3098 (NULL
, TYPE_TARGET_TYPE (arr_type0
->index_type ()), low
,
3099 high
< low
? low
- 1 : high
);
3100 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3102 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3106 /* Name resolution */
3108 /* The "decoded" name for the user-definable Ada operator corresponding
3112 ada_decoded_op_name (enum exp_opcode op
)
3116 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3118 if (ada_opname_table
[i
].op
== op
)
3119 return ada_opname_table
[i
].decoded
;
3121 error (_("Could not find operator name for opcode"));
3124 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3125 in a listing of choices during disambiguation (see sort_choices, below).
3126 The idea is that overloadings of a subprogram name from the
3127 same package should sort in their source order. We settle for ordering
3128 such symbols by their trailing number (__N or $N). */
3131 encoded_ordered_before (const char *N0
, const char *N1
)
3135 else if (N0
== NULL
)
3141 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3143 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3145 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3146 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3151 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3154 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3156 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3157 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3159 return (strcmp (N0
, N1
) < 0);
3163 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3167 sort_choices (struct block_symbol syms
[], int nsyms
)
3171 for (i
= 1; i
< nsyms
; i
+= 1)
3173 struct block_symbol sym
= syms
[i
];
3176 for (j
= i
- 1; j
>= 0; j
-= 1)
3178 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3179 sym
.symbol
->linkage_name ()))
3181 syms
[j
+ 1] = syms
[j
];
3187 /* Whether GDB should display formals and return types for functions in the
3188 overloads selection menu. */
3189 static bool print_signatures
= true;
3191 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3192 all but functions, the signature is just the name of the symbol. For
3193 functions, this is the name of the function, the list of types for formals
3194 and the return type (if any). */
3197 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3198 const struct type_print_options
*flags
)
3200 struct type
*type
= SYMBOL_TYPE (sym
);
3202 fprintf_filtered (stream
, "%s", sym
->print_name ());
3203 if (!print_signatures
3205 || type
->code () != TYPE_CODE_FUNC
)
3208 if (type
->num_fields () > 0)
3212 fprintf_filtered (stream
, " (");
3213 for (i
= 0; i
< type
->num_fields (); ++i
)
3216 fprintf_filtered (stream
, "; ");
3217 ada_print_type (type
->field (i
).type (), NULL
, stream
, -1, 0,
3220 fprintf_filtered (stream
, ")");
3222 if (TYPE_TARGET_TYPE (type
) != NULL
3223 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3225 fprintf_filtered (stream
, " return ");
3226 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3230 /* Read and validate a set of numeric choices from the user in the
3231 range 0 .. N_CHOICES-1. Place the results in increasing
3232 order in CHOICES[0 .. N-1], and return N.
3234 The user types choices as a sequence of numbers on one line
3235 separated by blanks, encoding them as follows:
3237 + A choice of 0 means to cancel the selection, throwing an error.
3238 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3239 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3241 The user is not allowed to choose more than MAX_RESULTS values.
3243 ANNOTATION_SUFFIX, if present, is used to annotate the input
3244 prompts (for use with the -f switch). */
3247 get_selections (int *choices
, int n_choices
, int max_results
,
3248 int is_all_choice
, const char *annotation_suffix
)
3253 int first_choice
= is_all_choice
? 2 : 1;
3255 prompt
= getenv ("PS2");
3259 args
= command_line_input (prompt
, annotation_suffix
);
3262 error_no_arg (_("one or more choice numbers"));
3266 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3267 order, as given in args. Choices are validated. */
3273 args
= skip_spaces (args
);
3274 if (*args
== '\0' && n_chosen
== 0)
3275 error_no_arg (_("one or more choice numbers"));
3276 else if (*args
== '\0')
3279 choice
= strtol (args
, &args2
, 10);
3280 if (args
== args2
|| choice
< 0
3281 || choice
> n_choices
+ first_choice
- 1)
3282 error (_("Argument must be choice number"));
3286 error (_("cancelled"));
3288 if (choice
< first_choice
)
3290 n_chosen
= n_choices
;
3291 for (j
= 0; j
< n_choices
; j
+= 1)
3295 choice
-= first_choice
;
3297 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3301 if (j
< 0 || choice
!= choices
[j
])
3305 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3306 choices
[k
+ 1] = choices
[k
];
3307 choices
[j
+ 1] = choice
;
3312 if (n_chosen
> max_results
)
3313 error (_("Select no more than %d of the above"), max_results
);
3318 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3319 by asking the user (if necessary), returning the number selected,
3320 and setting the first elements of SYMS items. Error if no symbols
3323 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3324 to be re-integrated one of these days. */
3327 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3330 int *chosen
= XALLOCAVEC (int , nsyms
);
3332 int first_choice
= (max_results
== 1) ? 1 : 2;
3333 const char *select_mode
= multiple_symbols_select_mode ();
3335 if (max_results
< 1)
3336 error (_("Request to select 0 symbols!"));
3340 if (select_mode
== multiple_symbols_cancel
)
3342 canceled because the command is ambiguous\n\
3343 See set/show multiple-symbol."));
3345 /* If select_mode is "all", then return all possible symbols.
3346 Only do that if more than one symbol can be selected, of course.
3347 Otherwise, display the menu as usual. */
3348 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3351 printf_filtered (_("[0] cancel\n"));
3352 if (max_results
> 1)
3353 printf_filtered (_("[1] all\n"));
3355 sort_choices (syms
, nsyms
);
3357 for (i
= 0; i
< nsyms
; i
+= 1)
3359 if (syms
[i
].symbol
== NULL
)
3362 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3364 struct symtab_and_line sal
=
3365 find_function_start_sal (syms
[i
].symbol
, 1);
3367 printf_filtered ("[%d] ", i
+ first_choice
);
3368 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3369 &type_print_raw_options
);
3370 if (sal
.symtab
== NULL
)
3371 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3372 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3376 styled_string (file_name_style
.style (),
3377 symtab_to_filename_for_display (sal
.symtab
)),
3384 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3385 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3386 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3387 struct symtab
*symtab
= NULL
;
3389 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3390 symtab
= symbol_symtab (syms
[i
].symbol
);
3392 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3394 printf_filtered ("[%d] ", i
+ first_choice
);
3395 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3396 &type_print_raw_options
);
3397 printf_filtered (_(" at %s:%d\n"),
3398 symtab_to_filename_for_display (symtab
),
3399 SYMBOL_LINE (syms
[i
].symbol
));
3401 else if (is_enumeral
3402 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3404 printf_filtered (("[%d] "), i
+ first_choice
);
3405 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3406 gdb_stdout
, -1, 0, &type_print_raw_options
);
3407 printf_filtered (_("'(%s) (enumeral)\n"),
3408 syms
[i
].symbol
->print_name ());
3412 printf_filtered ("[%d] ", i
+ first_choice
);
3413 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3414 &type_print_raw_options
);
3417 printf_filtered (is_enumeral
3418 ? _(" in %s (enumeral)\n")
3420 symtab_to_filename_for_display (symtab
));
3422 printf_filtered (is_enumeral
3423 ? _(" (enumeral)\n")
3429 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3432 for (i
= 0; i
< n_chosen
; i
+= 1)
3433 syms
[i
] = syms
[chosen
[i
]];
3438 /* Resolve the operator of the subexpression beginning at
3439 position *POS of *EXPP. "Resolving" consists of replacing
3440 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3441 with their resolutions, replacing built-in operators with
3442 function calls to user-defined operators, where appropriate, and,
3443 when DEPROCEDURE_P is non-zero, converting function-valued variables
3444 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3445 are as in ada_resolve, above. */
3447 static struct value
*
3448 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3449 struct type
*context_type
, int parse_completion
,
3450 innermost_block_tracker
*tracker
)
3454 struct expression
*exp
; /* Convenience: == *expp. */
3455 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3456 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3457 int nargs
; /* Number of operands. */
3464 /* Pass one: resolve operands, saving their types and updating *pos,
3469 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3470 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3475 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3477 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3482 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3487 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3488 parse_completion
, tracker
);
3491 case OP_ATR_MODULUS
:
3501 case TERNOP_IN_RANGE
:
3502 case BINOP_IN_BOUNDS
:
3508 case OP_DISCRETE_RANGE
:
3510 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3519 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3521 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3523 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3541 case BINOP_LOGICAL_AND
:
3542 case BINOP_LOGICAL_OR
:
3543 case BINOP_BITWISE_AND
:
3544 case BINOP_BITWISE_IOR
:
3545 case BINOP_BITWISE_XOR
:
3548 case BINOP_NOTEQUAL
:
3555 case BINOP_SUBSCRIPT
:
3563 case UNOP_LOGICAL_NOT
:
3573 case OP_VAR_MSYM_VALUE
:
3580 case OP_INTERNALVAR
:
3590 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3593 case STRUCTOP_STRUCT
:
3594 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3607 error (_("Unexpected operator during name resolution"));
3610 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3611 for (i
= 0; i
< nargs
; i
+= 1)
3612 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
,
3617 /* Pass two: perform any resolution on principal operator. */
3624 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3626 std::vector
<struct block_symbol
> candidates
;
3630 ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3631 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3634 if (n_candidates
> 1)
3636 /* Types tend to get re-introduced locally, so if there
3637 are any local symbols that are not types, first filter
3640 for (j
= 0; j
< n_candidates
; j
+= 1)
3641 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3646 case LOC_REGPARM_ADDR
:
3654 if (j
< n_candidates
)
3657 while (j
< n_candidates
)
3659 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3661 candidates
[j
] = candidates
[n_candidates
- 1];
3670 if (n_candidates
== 0)
3671 error (_("No definition found for %s"),
3672 exp
->elts
[pc
+ 2].symbol
->print_name ());
3673 else if (n_candidates
== 1)
3675 else if (deprocedure_p
3676 && !is_nonfunction (candidates
.data (), n_candidates
))
3678 i
= ada_resolve_function
3679 (candidates
.data (), n_candidates
, NULL
, 0,
3680 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3681 context_type
, parse_completion
);
3683 error (_("Could not find a match for %s"),
3684 exp
->elts
[pc
+ 2].symbol
->print_name ());
3688 printf_filtered (_("Multiple matches for %s\n"),
3689 exp
->elts
[pc
+ 2].symbol
->print_name ());
3690 user_select_syms (candidates
.data (), n_candidates
, 1);
3694 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3695 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3696 tracker
->update (candidates
[i
]);
3700 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3703 replace_operator_with_call (expp
, pc
, 0, 4,
3704 exp
->elts
[pc
+ 2].symbol
,
3705 exp
->elts
[pc
+ 1].block
);
3712 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3713 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3715 std::vector
<struct block_symbol
> candidates
;
3719 ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3720 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3723 if (n_candidates
== 1)
3727 i
= ada_resolve_function
3728 (candidates
.data (), n_candidates
,
3730 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3731 context_type
, parse_completion
);
3733 error (_("Could not find a match for %s"),
3734 exp
->elts
[pc
+ 5].symbol
->print_name ());
3737 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3738 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3739 tracker
->update (candidates
[i
]);
3750 case BINOP_BITWISE_AND
:
3751 case BINOP_BITWISE_IOR
:
3752 case BINOP_BITWISE_XOR
:
3754 case BINOP_NOTEQUAL
:
3762 case UNOP_LOGICAL_NOT
:
3764 if (possible_user_operator_p (op
, argvec
))
3766 std::vector
<struct block_symbol
> candidates
;
3770 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3774 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3775 nargs
, ada_decoded_op_name (op
), NULL
,
3780 replace_operator_with_call (expp
, pc
, nargs
, 1,
3781 candidates
[i
].symbol
,
3782 candidates
[i
].block
);
3793 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3794 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3795 exp
->elts
[pc
+ 1].objfile
,
3796 exp
->elts
[pc
+ 2].msymbol
);
3798 return evaluate_subexp_type (exp
, pos
);
3801 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3802 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3804 /* The term "match" here is rather loose. The match is heuristic and
3808 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3810 ftype
= ada_check_typedef (ftype
);
3811 atype
= ada_check_typedef (atype
);
3813 if (ftype
->code () == TYPE_CODE_REF
)
3814 ftype
= TYPE_TARGET_TYPE (ftype
);
3815 if (atype
->code () == TYPE_CODE_REF
)
3816 atype
= TYPE_TARGET_TYPE (atype
);
3818 switch (ftype
->code ())
3821 return ftype
->code () == atype
->code ();
3823 if (atype
->code () == TYPE_CODE_PTR
)
3824 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3825 TYPE_TARGET_TYPE (atype
), 0);
3828 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3830 case TYPE_CODE_ENUM
:
3831 case TYPE_CODE_RANGE
:
3832 switch (atype
->code ())
3835 case TYPE_CODE_ENUM
:
3836 case TYPE_CODE_RANGE
:
3842 case TYPE_CODE_ARRAY
:
3843 return (atype
->code () == TYPE_CODE_ARRAY
3844 || ada_is_array_descriptor_type (atype
));
3846 case TYPE_CODE_STRUCT
:
3847 if (ada_is_array_descriptor_type (ftype
))
3848 return (atype
->code () == TYPE_CODE_ARRAY
3849 || ada_is_array_descriptor_type (atype
));
3851 return (atype
->code () == TYPE_CODE_STRUCT
3852 && !ada_is_array_descriptor_type (atype
));
3854 case TYPE_CODE_UNION
:
3856 return (atype
->code () == ftype
->code ());
3860 /* Return non-zero if the formals of FUNC "sufficiently match" the
3861 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3862 may also be an enumeral, in which case it is treated as a 0-
3863 argument function. */
3866 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3869 struct type
*func_type
= SYMBOL_TYPE (func
);
3871 if (SYMBOL_CLASS (func
) == LOC_CONST
3872 && func_type
->code () == TYPE_CODE_ENUM
)
3873 return (n_actuals
== 0);
3874 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3877 if (func_type
->num_fields () != n_actuals
)
3880 for (i
= 0; i
< n_actuals
; i
+= 1)
3882 if (actuals
[i
] == NULL
)
3886 struct type
*ftype
= ada_check_typedef (func_type
->field (i
).type ());
3887 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3889 if (!ada_type_match (ftype
, atype
, 1))
3896 /* False iff function type FUNC_TYPE definitely does not produce a value
3897 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3898 FUNC_TYPE is not a valid function type with a non-null return type
3899 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3902 return_match (struct type
*func_type
, struct type
*context_type
)
3904 struct type
*return_type
;
3906 if (func_type
== NULL
)
3909 if (func_type
->code () == TYPE_CODE_FUNC
)
3910 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3912 return_type
= get_base_type (func_type
);
3913 if (return_type
== NULL
)
3916 context_type
= get_base_type (context_type
);
3918 if (return_type
->code () == TYPE_CODE_ENUM
)
3919 return context_type
== NULL
|| return_type
== context_type
;
3920 else if (context_type
== NULL
)
3921 return return_type
->code () != TYPE_CODE_VOID
;
3923 return return_type
->code () == context_type
->code ();
3927 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3928 function (if any) that matches the types of the NARGS arguments in
3929 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3930 that returns that type, then eliminate matches that don't. If
3931 CONTEXT_TYPE is void and there is at least one match that does not
3932 return void, eliminate all matches that do.
3934 Asks the user if there is more than one match remaining. Returns -1
3935 if there is no such symbol or none is selected. NAME is used
3936 solely for messages. May re-arrange and modify SYMS in
3937 the process; the index returned is for the modified vector. */
3940 ada_resolve_function (struct block_symbol syms
[],
3941 int nsyms
, struct value
**args
, int nargs
,
3942 const char *name
, struct type
*context_type
,
3943 int parse_completion
)
3947 int m
; /* Number of hits */
3950 /* In the first pass of the loop, we only accept functions matching
3951 context_type. If none are found, we add a second pass of the loop
3952 where every function is accepted. */
3953 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3955 for (k
= 0; k
< nsyms
; k
+= 1)
3957 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3959 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3960 && (fallback
|| return_match (type
, context_type
)))
3968 /* If we got multiple matches, ask the user which one to use. Don't do this
3969 interactive thing during completion, though, as the purpose of the
3970 completion is providing a list of all possible matches. Prompting the
3971 user to filter it down would be completely unexpected in this case. */
3974 else if (m
> 1 && !parse_completion
)
3976 printf_filtered (_("Multiple matches for %s\n"), name
);
3977 user_select_syms (syms
, m
, 1);
3983 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3984 on the function identified by SYM and BLOCK, and taking NARGS
3985 arguments. Update *EXPP as needed to hold more space. */
3988 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
3989 int oplen
, struct symbol
*sym
,
3990 const struct block
*block
)
3992 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3993 symbol, -oplen for operator being replaced). */
3994 struct expression
*newexp
= (struct expression
*)
3995 xzalloc (sizeof (struct expression
)
3996 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3997 struct expression
*exp
= expp
->get ();
3999 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4000 newexp
->language_defn
= exp
->language_defn
;
4001 newexp
->gdbarch
= exp
->gdbarch
;
4002 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4003 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4004 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4006 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4007 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4009 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4010 newexp
->elts
[pc
+ 4].block
= block
;
4011 newexp
->elts
[pc
+ 5].symbol
= sym
;
4013 expp
->reset (newexp
);
4016 /* Type-class predicates */
4018 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4022 numeric_type_p (struct type
*type
)
4028 switch (type
->code ())
4033 case TYPE_CODE_RANGE
:
4034 return (type
== TYPE_TARGET_TYPE (type
)
4035 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4042 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4045 integer_type_p (struct type
*type
)
4051 switch (type
->code ())
4055 case TYPE_CODE_RANGE
:
4056 return (type
== TYPE_TARGET_TYPE (type
)
4057 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4064 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4067 scalar_type_p (struct type
*type
)
4073 switch (type
->code ())
4076 case TYPE_CODE_RANGE
:
4077 case TYPE_CODE_ENUM
:
4086 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4089 discrete_type_p (struct type
*type
)
4095 switch (type
->code ())
4098 case TYPE_CODE_RANGE
:
4099 case TYPE_CODE_ENUM
:
4100 case TYPE_CODE_BOOL
:
4108 /* Returns non-zero if OP with operands in the vector ARGS could be
4109 a user-defined function. Errs on the side of pre-defined operators
4110 (i.e., result 0). */
4113 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4115 struct type
*type0
=
4116 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4117 struct type
*type1
=
4118 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4132 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4136 case BINOP_BITWISE_AND
:
4137 case BINOP_BITWISE_IOR
:
4138 case BINOP_BITWISE_XOR
:
4139 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4142 case BINOP_NOTEQUAL
:
4147 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4150 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4153 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4157 case UNOP_LOGICAL_NOT
:
4159 return (!numeric_type_p (type0
));
4168 1. In the following, we assume that a renaming type's name may
4169 have an ___XD suffix. It would be nice if this went away at some
4171 2. We handle both the (old) purely type-based representation of
4172 renamings and the (new) variable-based encoding. At some point,
4173 it is devoutly to be hoped that the former goes away
4174 (FIXME: hilfinger-2007-07-09).
4175 3. Subprogram renamings are not implemented, although the XRS
4176 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4178 /* If SYM encodes a renaming,
4180 <renaming> renames <renamed entity>,
4182 sets *LEN to the length of the renamed entity's name,
4183 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4184 the string describing the subcomponent selected from the renamed
4185 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4186 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4187 are undefined). Otherwise, returns a value indicating the category
4188 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4189 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4190 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4191 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4192 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4193 may be NULL, in which case they are not assigned.
4195 [Currently, however, GCC does not generate subprogram renamings.] */
4197 enum ada_renaming_category
4198 ada_parse_renaming (struct symbol
*sym
,
4199 const char **renamed_entity
, int *len
,
4200 const char **renaming_expr
)
4202 enum ada_renaming_category kind
;
4207 return ADA_NOT_RENAMING
;
4208 switch (SYMBOL_CLASS (sym
))
4211 return ADA_NOT_RENAMING
;
4215 case LOC_OPTIMIZED_OUT
:
4216 info
= strstr (sym
->linkage_name (), "___XR");
4218 return ADA_NOT_RENAMING
;
4222 kind
= ADA_OBJECT_RENAMING
;
4226 kind
= ADA_EXCEPTION_RENAMING
;
4230 kind
= ADA_PACKAGE_RENAMING
;
4234 kind
= ADA_SUBPROGRAM_RENAMING
;
4238 return ADA_NOT_RENAMING
;
4242 if (renamed_entity
!= NULL
)
4243 *renamed_entity
= info
;
4244 suffix
= strstr (info
, "___XE");
4245 if (suffix
== NULL
|| suffix
== info
)
4246 return ADA_NOT_RENAMING
;
4248 *len
= strlen (info
) - strlen (suffix
);
4250 if (renaming_expr
!= NULL
)
4251 *renaming_expr
= suffix
;
4255 /* Compute the value of the given RENAMING_SYM, which is expected to
4256 be a symbol encoding a renaming expression. BLOCK is the block
4257 used to evaluate the renaming. */
4259 static struct value
*
4260 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4261 const struct block
*block
)
4263 const char *sym_name
;
4265 sym_name
= renaming_sym
->linkage_name ();
4266 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4267 return evaluate_expression (expr
.get ());
4271 /* Evaluation: Function Calls */
4273 /* Return an lvalue containing the value VAL. This is the identity on
4274 lvalues, and otherwise has the side-effect of allocating memory
4275 in the inferior where a copy of the value contents is copied. */
4277 static struct value
*
4278 ensure_lval (struct value
*val
)
4280 if (VALUE_LVAL (val
) == not_lval
4281 || VALUE_LVAL (val
) == lval_internalvar
)
4283 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4284 const CORE_ADDR addr
=
4285 value_as_long (value_allocate_space_in_inferior (len
));
4287 VALUE_LVAL (val
) = lval_memory
;
4288 set_value_address (val
, addr
);
4289 write_memory (addr
, value_contents (val
), len
);
4295 /* Given ARG, a value of type (pointer or reference to a)*
4296 structure/union, extract the component named NAME from the ultimate
4297 target structure/union and return it as a value with its
4300 The routine searches for NAME among all members of the structure itself
4301 and (recursively) among all members of any wrapper members
4304 If NO_ERR, then simply return NULL in case of error, rather than
4307 static struct value
*
4308 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4310 struct type
*t
, *t1
;
4315 t1
= t
= ada_check_typedef (value_type (arg
));
4316 if (t
->code () == TYPE_CODE_REF
)
4318 t1
= TYPE_TARGET_TYPE (t
);
4321 t1
= ada_check_typedef (t1
);
4322 if (t1
->code () == TYPE_CODE_PTR
)
4324 arg
= coerce_ref (arg
);
4329 while (t
->code () == TYPE_CODE_PTR
)
4331 t1
= TYPE_TARGET_TYPE (t
);
4334 t1
= ada_check_typedef (t1
);
4335 if (t1
->code () == TYPE_CODE_PTR
)
4337 arg
= value_ind (arg
);
4344 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4348 v
= ada_search_struct_field (name
, arg
, 0, t
);
4351 int bit_offset
, bit_size
, byte_offset
;
4352 struct type
*field_type
;
4355 if (t
->code () == TYPE_CODE_PTR
)
4356 address
= value_address (ada_value_ind (arg
));
4358 address
= value_address (ada_coerce_ref (arg
));
4360 /* Check to see if this is a tagged type. We also need to handle
4361 the case where the type is a reference to a tagged type, but
4362 we have to be careful to exclude pointers to tagged types.
4363 The latter should be shown as usual (as a pointer), whereas
4364 a reference should mostly be transparent to the user. */
4366 if (ada_is_tagged_type (t1
, 0)
4367 || (t1
->code () == TYPE_CODE_REF
4368 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4370 /* We first try to find the searched field in the current type.
4371 If not found then let's look in the fixed type. */
4373 if (!find_struct_field (name
, t1
, 0,
4374 &field_type
, &byte_offset
, &bit_offset
,
4383 /* Convert to fixed type in all cases, so that we have proper
4384 offsets to each field in unconstrained record types. */
4385 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4386 address
, NULL
, check_tag
);
4388 if (find_struct_field (name
, t1
, 0,
4389 &field_type
, &byte_offset
, &bit_offset
,
4394 if (t
->code () == TYPE_CODE_REF
)
4395 arg
= ada_coerce_ref (arg
);
4397 arg
= ada_value_ind (arg
);
4398 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4399 bit_offset
, bit_size
,
4403 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4407 if (v
!= NULL
|| no_err
)
4410 error (_("There is no member named %s."), name
);
4416 error (_("Attempt to extract a component of "
4417 "a value that is not a record."));
4420 /* Return the value ACTUAL, converted to be an appropriate value for a
4421 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4422 allocating any necessary descriptors (fat pointers), or copies of
4423 values not residing in memory, updating it as needed. */
4426 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4428 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4429 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4430 struct type
*formal_target
=
4431 formal_type
->code () == TYPE_CODE_PTR
4432 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4433 struct type
*actual_target
=
4434 actual_type
->code () == TYPE_CODE_PTR
4435 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4437 if (ada_is_array_descriptor_type (formal_target
)
4438 && actual_target
->code () == TYPE_CODE_ARRAY
)
4439 return make_array_descriptor (formal_type
, actual
);
4440 else if (formal_type
->code () == TYPE_CODE_PTR
4441 || formal_type
->code () == TYPE_CODE_REF
)
4443 struct value
*result
;
4445 if (formal_target
->code () == TYPE_CODE_ARRAY
4446 && ada_is_array_descriptor_type (actual_target
))
4447 result
= desc_data (actual
);
4448 else if (formal_type
->code () != TYPE_CODE_PTR
)
4450 if (VALUE_LVAL (actual
) != lval_memory
)
4454 actual_type
= ada_check_typedef (value_type (actual
));
4455 val
= allocate_value (actual_type
);
4456 memcpy ((char *) value_contents_raw (val
),
4457 (char *) value_contents (actual
),
4458 TYPE_LENGTH (actual_type
));
4459 actual
= ensure_lval (val
);
4461 result
= value_addr (actual
);
4465 return value_cast_pointers (formal_type
, result
, 0);
4467 else if (actual_type
->code () == TYPE_CODE_PTR
)
4468 return ada_value_ind (actual
);
4469 else if (ada_is_aligner_type (formal_type
))
4471 /* We need to turn this parameter into an aligner type
4473 struct value
*aligner
= allocate_value (formal_type
);
4474 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4476 value_assign_to_component (aligner
, component
, actual
);
4483 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4484 type TYPE. This is usually an inefficient no-op except on some targets
4485 (such as AVR) where the representation of a pointer and an address
4489 value_pointer (struct value
*value
, struct type
*type
)
4491 struct gdbarch
*gdbarch
= get_type_arch (type
);
4492 unsigned len
= TYPE_LENGTH (type
);
4493 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4496 addr
= value_address (value
);
4497 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4498 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4503 /* Push a descriptor of type TYPE for array value ARR on the stack at
4504 *SP, updating *SP to reflect the new descriptor. Return either
4505 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4506 to-descriptor type rather than a descriptor type), a struct value *
4507 representing a pointer to this descriptor. */
4509 static struct value
*
4510 make_array_descriptor (struct type
*type
, struct value
*arr
)
4512 struct type
*bounds_type
= desc_bounds_type (type
);
4513 struct type
*desc_type
= desc_base_type (type
);
4514 struct value
*descriptor
= allocate_value (desc_type
);
4515 struct value
*bounds
= allocate_value (bounds_type
);
4518 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4521 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4522 ada_array_bound (arr
, i
, 0),
4523 desc_bound_bitpos (bounds_type
, i
, 0),
4524 desc_bound_bitsize (bounds_type
, i
, 0));
4525 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4526 ada_array_bound (arr
, i
, 1),
4527 desc_bound_bitpos (bounds_type
, i
, 1),
4528 desc_bound_bitsize (bounds_type
, i
, 1));
4531 bounds
= ensure_lval (bounds
);
4533 modify_field (value_type (descriptor
),
4534 value_contents_writeable (descriptor
),
4535 value_pointer (ensure_lval (arr
),
4536 desc_type
->field (0).type ()),
4537 fat_pntr_data_bitpos (desc_type
),
4538 fat_pntr_data_bitsize (desc_type
));
4540 modify_field (value_type (descriptor
),
4541 value_contents_writeable (descriptor
),
4542 value_pointer (bounds
,
4543 desc_type
->field (1).type ()),
4544 fat_pntr_bounds_bitpos (desc_type
),
4545 fat_pntr_bounds_bitsize (desc_type
));
4547 descriptor
= ensure_lval (descriptor
);
4549 if (type
->code () == TYPE_CODE_PTR
)
4550 return value_addr (descriptor
);
4555 /* Symbol Cache Module */
4557 /* Performance measurements made as of 2010-01-15 indicate that
4558 this cache does bring some noticeable improvements. Depending
4559 on the type of entity being printed, the cache can make it as much
4560 as an order of magnitude faster than without it.
4562 The descriptive type DWARF extension has significantly reduced
4563 the need for this cache, at least when DWARF is being used. However,
4564 even in this case, some expensive name-based symbol searches are still
4565 sometimes necessary - to find an XVZ variable, mostly. */
4567 /* Initialize the contents of SYM_CACHE. */
4570 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4572 obstack_init (&sym_cache
->cache_space
);
4573 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4576 /* Free the memory used by SYM_CACHE. */
4579 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4581 obstack_free (&sym_cache
->cache_space
, NULL
);
4585 /* Return the symbol cache associated to the given program space PSPACE.
4586 If not allocated for this PSPACE yet, allocate and initialize one. */
4588 static struct ada_symbol_cache
*
4589 ada_get_symbol_cache (struct program_space
*pspace
)
4591 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4593 if (pspace_data
->sym_cache
== NULL
)
4595 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4596 ada_init_symbol_cache (pspace_data
->sym_cache
);
4599 return pspace_data
->sym_cache
;
4602 /* Clear all entries from the symbol cache. */
4605 ada_clear_symbol_cache (void)
4607 struct ada_symbol_cache
*sym_cache
4608 = ada_get_symbol_cache (current_program_space
);
4610 obstack_free (&sym_cache
->cache_space
, NULL
);
4611 ada_init_symbol_cache (sym_cache
);
4614 /* Search our cache for an entry matching NAME and DOMAIN.
4615 Return it if found, or NULL otherwise. */
4617 static struct cache_entry
**
4618 find_entry (const char *name
, domain_enum domain
)
4620 struct ada_symbol_cache
*sym_cache
4621 = ada_get_symbol_cache (current_program_space
);
4622 int h
= msymbol_hash (name
) % HASH_SIZE
;
4623 struct cache_entry
**e
;
4625 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4627 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4633 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4634 Return 1 if found, 0 otherwise.
4636 If an entry was found and SYM is not NULL, set *SYM to the entry's
4637 SYM. Same principle for BLOCK if not NULL. */
4640 lookup_cached_symbol (const char *name
, domain_enum domain
,
4641 struct symbol
**sym
, const struct block
**block
)
4643 struct cache_entry
**e
= find_entry (name
, domain
);
4650 *block
= (*e
)->block
;
4654 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4655 in domain DOMAIN, save this result in our symbol cache. */
4658 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4659 const struct block
*block
)
4661 struct ada_symbol_cache
*sym_cache
4662 = ada_get_symbol_cache (current_program_space
);
4664 struct cache_entry
*e
;
4666 /* Symbols for builtin types don't have a block.
4667 For now don't cache such symbols. */
4668 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4671 /* If the symbol is a local symbol, then do not cache it, as a search
4672 for that symbol depends on the context. To determine whether
4673 the symbol is local or not, we check the block where we found it
4674 against the global and static blocks of its associated symtab. */
4676 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4677 GLOBAL_BLOCK
) != block
4678 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4679 STATIC_BLOCK
) != block
)
4682 h
= msymbol_hash (name
) % HASH_SIZE
;
4683 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4684 e
->next
= sym_cache
->root
[h
];
4685 sym_cache
->root
[h
] = e
;
4686 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4694 /* Return the symbol name match type that should be used used when
4695 searching for all symbols matching LOOKUP_NAME.
4697 LOOKUP_NAME is expected to be a symbol name after transformation
4700 static symbol_name_match_type
4701 name_match_type_from_name (const char *lookup_name
)
4703 return (strstr (lookup_name
, "__") == NULL
4704 ? symbol_name_match_type::WILD
4705 : symbol_name_match_type::FULL
);
4708 /* Return the result of a standard (literal, C-like) lookup of NAME in
4709 given DOMAIN, visible from lexical block BLOCK. */
4711 static struct symbol
*
4712 standard_lookup (const char *name
, const struct block
*block
,
4715 /* Initialize it just to avoid a GCC false warning. */
4716 struct block_symbol sym
= {};
4718 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4720 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4721 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4726 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4727 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4728 since they contend in overloading in the same way. */
4730 is_nonfunction (struct block_symbol syms
[], int n
)
4734 for (i
= 0; i
< n
; i
+= 1)
4735 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_FUNC
4736 && (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
4737 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4743 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4744 struct types. Otherwise, they may not. */
4747 equiv_types (struct type
*type0
, struct type
*type1
)
4751 if (type0
== NULL
|| type1
== NULL
4752 || type0
->code () != type1
->code ())
4754 if ((type0
->code () == TYPE_CODE_STRUCT
4755 || type0
->code () == TYPE_CODE_ENUM
)
4756 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4757 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4763 /* True iff SYM0 represents the same entity as SYM1, or one that is
4764 no more defined than that of SYM1. */
4767 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4771 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4772 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4775 switch (SYMBOL_CLASS (sym0
))
4781 struct type
*type0
= SYMBOL_TYPE (sym0
);
4782 struct type
*type1
= SYMBOL_TYPE (sym1
);
4783 const char *name0
= sym0
->linkage_name ();
4784 const char *name1
= sym1
->linkage_name ();
4785 int len0
= strlen (name0
);
4788 type0
->code () == type1
->code ()
4789 && (equiv_types (type0
, type1
)
4790 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4791 && startswith (name1
+ len0
, "___XV")));
4794 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4795 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4799 const char *name0
= sym0
->linkage_name ();
4800 const char *name1
= sym1
->linkage_name ();
4801 return (strcmp (name0
, name1
) == 0
4802 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4810 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4811 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4814 add_defn_to_vec (struct obstack
*obstackp
,
4816 const struct block
*block
)
4819 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4821 /* Do not try to complete stub types, as the debugger is probably
4822 already scanning all symbols matching a certain name at the
4823 time when this function is called. Trying to replace the stub
4824 type by its associated full type will cause us to restart a scan
4825 which may lead to an infinite recursion. Instead, the client
4826 collecting the matching symbols will end up collecting several
4827 matches, with at least one of them complete. It can then filter
4828 out the stub ones if needed. */
4830 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4832 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4834 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4836 prevDefns
[i
].symbol
= sym
;
4837 prevDefns
[i
].block
= block
;
4843 struct block_symbol info
;
4847 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4851 /* Number of block_symbol structures currently collected in current vector in
4855 num_defns_collected (struct obstack
*obstackp
)
4857 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4860 /* Vector of block_symbol structures currently collected in current vector in
4861 OBSTACKP. If FINISH, close off the vector and return its final address. */
4863 static struct block_symbol
*
4864 defns_collected (struct obstack
*obstackp
, int finish
)
4867 return (struct block_symbol
*) obstack_finish (obstackp
);
4869 return (struct block_symbol
*) obstack_base (obstackp
);
4872 /* Return a bound minimal symbol matching NAME according to Ada
4873 decoding rules. Returns an invalid symbol if there is no such
4874 minimal symbol. Names prefixed with "standard__" are handled
4875 specially: "standard__" is first stripped off, and only static and
4876 global symbols are searched. */
4878 struct bound_minimal_symbol
4879 ada_lookup_simple_minsym (const char *name
)
4881 struct bound_minimal_symbol result
;
4883 memset (&result
, 0, sizeof (result
));
4885 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4886 lookup_name_info
lookup_name (name
, match_type
);
4888 symbol_name_matcher_ftype
*match_name
4889 = ada_get_symbol_name_matcher (lookup_name
);
4891 for (objfile
*objfile
: current_program_space
->objfiles ())
4893 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4895 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4896 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4898 result
.minsym
= msymbol
;
4899 result
.objfile
= objfile
;
4908 /* For all subprograms that statically enclose the subprogram of the
4909 selected frame, add symbols matching identifier NAME in DOMAIN
4910 and their blocks to the list of data in OBSTACKP, as for
4911 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4912 with a wildcard prefix. */
4915 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4916 const lookup_name_info
&lookup_name
,
4921 /* True if TYPE is definitely an artificial type supplied to a symbol
4922 for which no debugging information was given in the symbol file. */
4925 is_nondebugging_type (struct type
*type
)
4927 const char *name
= ada_type_name (type
);
4929 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4932 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4933 that are deemed "identical" for practical purposes.
4935 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4936 types and that their number of enumerals is identical (in other
4937 words, type1->num_fields () == type2->num_fields ()). */
4940 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4944 /* The heuristic we use here is fairly conservative. We consider
4945 that 2 enumerate types are identical if they have the same
4946 number of enumerals and that all enumerals have the same
4947 underlying value and name. */
4949 /* All enums in the type should have an identical underlying value. */
4950 for (i
= 0; i
< type1
->num_fields (); i
++)
4951 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4954 /* All enumerals should also have the same name (modulo any numerical
4956 for (i
= 0; i
< type1
->num_fields (); i
++)
4958 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4959 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4960 int len_1
= strlen (name_1
);
4961 int len_2
= strlen (name_2
);
4963 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4964 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4966 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4967 TYPE_FIELD_NAME (type2
, i
),
4975 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4976 that are deemed "identical" for practical purposes. Sometimes,
4977 enumerals are not strictly identical, but their types are so similar
4978 that they can be considered identical.
4980 For instance, consider the following code:
4982 type Color is (Black, Red, Green, Blue, White);
4983 type RGB_Color is new Color range Red .. Blue;
4985 Type RGB_Color is a subrange of an implicit type which is a copy
4986 of type Color. If we call that implicit type RGB_ColorB ("B" is
4987 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4988 As a result, when an expression references any of the enumeral
4989 by name (Eg. "print green"), the expression is technically
4990 ambiguous and the user should be asked to disambiguate. But
4991 doing so would only hinder the user, since it wouldn't matter
4992 what choice he makes, the outcome would always be the same.
4993 So, for practical purposes, we consider them as the same. */
4996 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
5000 /* Before performing a thorough comparison check of each type,
5001 we perform a series of inexpensive checks. We expect that these
5002 checks will quickly fail in the vast majority of cases, and thus
5003 help prevent the unnecessary use of a more expensive comparison.
5004 Said comparison also expects us to make some of these checks
5005 (see ada_identical_enum_types_p). */
5007 /* Quick check: All symbols should have an enum type. */
5008 for (i
= 0; i
< syms
.size (); i
++)
5009 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
5012 /* Quick check: They should all have the same value. */
5013 for (i
= 1; i
< syms
.size (); i
++)
5014 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5017 /* Quick check: They should all have the same number of enumerals. */
5018 for (i
= 1; i
< syms
.size (); i
++)
5019 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
5020 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
5023 /* All the sanity checks passed, so we might have a set of
5024 identical enumeration types. Perform a more complete
5025 comparison of the type of each symbol. */
5026 for (i
= 1; i
< syms
.size (); i
++)
5027 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5028 SYMBOL_TYPE (syms
[0].symbol
)))
5034 /* Remove any non-debugging symbols in SYMS that definitely
5035 duplicate other symbols in the list (The only case I know of where
5036 this happens is when object files containing stabs-in-ecoff are
5037 linked with files containing ordinary ecoff debugging symbols (or no
5038 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5039 Returns the number of items in the modified list. */
5042 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5046 /* We should never be called with less than 2 symbols, as there
5047 cannot be any extra symbol in that case. But it's easy to
5048 handle, since we have nothing to do in that case. */
5049 if (syms
->size () < 2)
5050 return syms
->size ();
5053 while (i
< syms
->size ())
5057 /* If two symbols have the same name and one of them is a stub type,
5058 the get rid of the stub. */
5060 if (SYMBOL_TYPE ((*syms
)[i
].symbol
)->is_stub ()
5061 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5063 for (j
= 0; j
< syms
->size (); j
++)
5066 && !SYMBOL_TYPE ((*syms
)[j
].symbol
)->is_stub ()
5067 && (*syms
)[j
].symbol
->linkage_name () != NULL
5068 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5069 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5074 /* Two symbols with the same name, same class and same address
5075 should be identical. */
5077 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5078 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5079 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5081 for (j
= 0; j
< syms
->size (); j
+= 1)
5084 && (*syms
)[j
].symbol
->linkage_name () != NULL
5085 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5086 (*syms
)[j
].symbol
->linkage_name ()) == 0
5087 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5088 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5089 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5090 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5096 syms
->erase (syms
->begin () + i
);
5101 /* If all the remaining symbols are identical enumerals, then
5102 just keep the first one and discard the rest.
5104 Unlike what we did previously, we do not discard any entry
5105 unless they are ALL identical. This is because the symbol
5106 comparison is not a strict comparison, but rather a practical
5107 comparison. If all symbols are considered identical, then
5108 we can just go ahead and use the first one and discard the rest.
5109 But if we cannot reduce the list to a single element, we have
5110 to ask the user to disambiguate anyways. And if we have to
5111 present a multiple-choice menu, it's less confusing if the list
5112 isn't missing some choices that were identical and yet distinct. */
5113 if (symbols_are_identical_enums (*syms
))
5116 return syms
->size ();
5119 /* Given a type that corresponds to a renaming entity, use the type name
5120 to extract the scope (package name or function name, fully qualified,
5121 and following the GNAT encoding convention) where this renaming has been
5125 xget_renaming_scope (struct type
*renaming_type
)
5127 /* The renaming types adhere to the following convention:
5128 <scope>__<rename>___<XR extension>.
5129 So, to extract the scope, we search for the "___XR" extension,
5130 and then backtrack until we find the first "__". */
5132 const char *name
= renaming_type
->name ();
5133 const char *suffix
= strstr (name
, "___XR");
5136 /* Now, backtrack a bit until we find the first "__". Start looking
5137 at suffix - 3, as the <rename> part is at least one character long. */
5139 for (last
= suffix
- 3; last
> name
; last
--)
5140 if (last
[0] == '_' && last
[1] == '_')
5143 /* Make a copy of scope and return it. */
5144 return std::string (name
, last
);
5147 /* Return nonzero if NAME corresponds to a package name. */
5150 is_package_name (const char *name
)
5152 /* Here, We take advantage of the fact that no symbols are generated
5153 for packages, while symbols are generated for each function.
5154 So the condition for NAME represent a package becomes equivalent
5155 to NAME not existing in our list of symbols. There is only one
5156 small complication with library-level functions (see below). */
5158 /* If it is a function that has not been defined at library level,
5159 then we should be able to look it up in the symbols. */
5160 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5163 /* Library-level function names start with "_ada_". See if function
5164 "_ada_" followed by NAME can be found. */
5166 /* Do a quick check that NAME does not contain "__", since library-level
5167 functions names cannot contain "__" in them. */
5168 if (strstr (name
, "__") != NULL
)
5171 std::string fun_name
= string_printf ("_ada_%s", name
);
5173 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5176 /* Return nonzero if SYM corresponds to a renaming entity that is
5177 not visible from FUNCTION_NAME. */
5180 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5182 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5185 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5187 /* If the rename has been defined in a package, then it is visible. */
5188 if (is_package_name (scope
.c_str ()))
5191 /* Check that the rename is in the current function scope by checking
5192 that its name starts with SCOPE. */
5194 /* If the function name starts with "_ada_", it means that it is
5195 a library-level function. Strip this prefix before doing the
5196 comparison, as the encoding for the renaming does not contain
5198 if (startswith (function_name
, "_ada_"))
5201 return !startswith (function_name
, scope
.c_str ());
5204 /* Remove entries from SYMS that corresponds to a renaming entity that
5205 is not visible from the function associated with CURRENT_BLOCK or
5206 that is superfluous due to the presence of more specific renaming
5207 information. Places surviving symbols in the initial entries of
5208 SYMS and returns the number of surviving symbols.
5211 First, in cases where an object renaming is implemented as a
5212 reference variable, GNAT may produce both the actual reference
5213 variable and the renaming encoding. In this case, we discard the
5216 Second, GNAT emits a type following a specified encoding for each renaming
5217 entity. Unfortunately, STABS currently does not support the definition
5218 of types that are local to a given lexical block, so all renamings types
5219 are emitted at library level. As a consequence, if an application
5220 contains two renaming entities using the same name, and a user tries to
5221 print the value of one of these entities, the result of the ada symbol
5222 lookup will also contain the wrong renaming type.
5224 This function partially covers for this limitation by attempting to
5225 remove from the SYMS list renaming symbols that should be visible
5226 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5227 method with the current information available. The implementation
5228 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5230 - When the user tries to print a rename in a function while there
5231 is another rename entity defined in a package: Normally, the
5232 rename in the function has precedence over the rename in the
5233 package, so the latter should be removed from the list. This is
5234 currently not the case.
5236 - This function will incorrectly remove valid renames if
5237 the CURRENT_BLOCK corresponds to a function which symbol name
5238 has been changed by an "Export" pragma. As a consequence,
5239 the user will be unable to print such rename entities. */
5242 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5243 const struct block
*current_block
)
5245 struct symbol
*current_function
;
5246 const char *current_function_name
;
5248 int is_new_style_renaming
;
5250 /* If there is both a renaming foo___XR... encoded as a variable and
5251 a simple variable foo in the same block, discard the latter.
5252 First, zero out such symbols, then compress. */
5253 is_new_style_renaming
= 0;
5254 for (i
= 0; i
< syms
->size (); i
+= 1)
5256 struct symbol
*sym
= (*syms
)[i
].symbol
;
5257 const struct block
*block
= (*syms
)[i
].block
;
5261 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5263 name
= sym
->linkage_name ();
5264 suffix
= strstr (name
, "___XR");
5268 int name_len
= suffix
- name
;
5271 is_new_style_renaming
= 1;
5272 for (j
= 0; j
< syms
->size (); j
+= 1)
5273 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5274 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5276 && block
== (*syms
)[j
].block
)
5277 (*syms
)[j
].symbol
= NULL
;
5280 if (is_new_style_renaming
)
5284 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5285 if ((*syms
)[j
].symbol
!= NULL
)
5287 (*syms
)[k
] = (*syms
)[j
];
5293 /* Extract the function name associated to CURRENT_BLOCK.
5294 Abort if unable to do so. */
5296 if (current_block
== NULL
)
5297 return syms
->size ();
5299 current_function
= block_linkage_function (current_block
);
5300 if (current_function
== NULL
)
5301 return syms
->size ();
5303 current_function_name
= current_function
->linkage_name ();
5304 if (current_function_name
== NULL
)
5305 return syms
->size ();
5307 /* Check each of the symbols, and remove it from the list if it is
5308 a type corresponding to a renaming that is out of the scope of
5309 the current block. */
5312 while (i
< syms
->size ())
5314 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5315 == ADA_OBJECT_RENAMING
5316 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5317 current_function_name
))
5318 syms
->erase (syms
->begin () + i
);
5323 return syms
->size ();
5326 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5327 whose name and domain match NAME and DOMAIN respectively.
5328 If no match was found, then extend the search to "enclosing"
5329 routines (in other words, if we're inside a nested function,
5330 search the symbols defined inside the enclosing functions).
5331 If WILD_MATCH_P is nonzero, perform the naming matching in
5332 "wild" mode (see function "wild_match" for more info).
5334 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5337 ada_add_local_symbols (struct obstack
*obstackp
,
5338 const lookup_name_info
&lookup_name
,
5339 const struct block
*block
, domain_enum domain
)
5341 int block_depth
= 0;
5343 while (block
!= NULL
)
5346 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5348 /* If we found a non-function match, assume that's the one. */
5349 if (is_nonfunction (defns_collected (obstackp
, 0),
5350 num_defns_collected (obstackp
)))
5353 block
= BLOCK_SUPERBLOCK (block
);
5356 /* If no luck so far, try to find NAME as a local symbol in some lexically
5357 enclosing subprogram. */
5358 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5359 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5362 /* An object of this type is used as the user_data argument when
5363 calling the map_matching_symbols method. */
5367 struct objfile
*objfile
;
5368 struct obstack
*obstackp
;
5369 struct symbol
*arg_sym
;
5373 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5374 to a list of symbols. DATA is a pointer to a struct match_data *
5375 containing the obstack that collects the symbol list, the file that SYM
5376 must come from, a flag indicating whether a non-argument symbol has
5377 been found in the current block, and the last argument symbol
5378 passed in SYM within the current block (if any). When SYM is null,
5379 marking the end of a block, the argument symbol is added if no
5380 other has been found. */
5383 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5384 struct match_data
*data
)
5386 const struct block
*block
= bsym
->block
;
5387 struct symbol
*sym
= bsym
->symbol
;
5391 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5392 add_defn_to_vec (data
->obstackp
,
5393 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5395 data
->found_sym
= 0;
5396 data
->arg_sym
= NULL
;
5400 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5402 else if (SYMBOL_IS_ARGUMENT (sym
))
5403 data
->arg_sym
= sym
;
5406 data
->found_sym
= 1;
5407 add_defn_to_vec (data
->obstackp
,
5408 fixup_symbol_section (sym
, data
->objfile
),
5415 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5416 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5417 symbols to OBSTACKP. Return whether we found such symbols. */
5420 ada_add_block_renamings (struct obstack
*obstackp
,
5421 const struct block
*block
,
5422 const lookup_name_info
&lookup_name
,
5425 struct using_direct
*renaming
;
5426 int defns_mark
= num_defns_collected (obstackp
);
5428 symbol_name_matcher_ftype
*name_match
5429 = ada_get_symbol_name_matcher (lookup_name
);
5431 for (renaming
= block_using (block
);
5433 renaming
= renaming
->next
)
5437 /* Avoid infinite recursions: skip this renaming if we are actually
5438 already traversing it.
5440 Currently, symbol lookup in Ada don't use the namespace machinery from
5441 C++/Fortran support: skip namespace imports that use them. */
5442 if (renaming
->searched
5443 || (renaming
->import_src
!= NULL
5444 && renaming
->import_src
[0] != '\0')
5445 || (renaming
->import_dest
!= NULL
5446 && renaming
->import_dest
[0] != '\0'))
5448 renaming
->searched
= 1;
5450 /* TODO: here, we perform another name-based symbol lookup, which can
5451 pull its own multiple overloads. In theory, we should be able to do
5452 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5453 not a simple name. But in order to do this, we would need to enhance
5454 the DWARF reader to associate a symbol to this renaming, instead of a
5455 name. So, for now, we do something simpler: re-use the C++/Fortran
5456 namespace machinery. */
5457 r_name
= (renaming
->alias
!= NULL
5459 : renaming
->declaration
);
5460 if (name_match (r_name
, lookup_name
, NULL
))
5462 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5463 lookup_name
.match_type ());
5464 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5467 renaming
->searched
= 0;
5469 return num_defns_collected (obstackp
) != defns_mark
;
5472 /* Implements compare_names, but only applying the comparision using
5473 the given CASING. */
5476 compare_names_with_case (const char *string1
, const char *string2
,
5477 enum case_sensitivity casing
)
5479 while (*string1
!= '\0' && *string2
!= '\0')
5483 if (isspace (*string1
) || isspace (*string2
))
5484 return strcmp_iw_ordered (string1
, string2
);
5486 if (casing
== case_sensitive_off
)
5488 c1
= tolower (*string1
);
5489 c2
= tolower (*string2
);
5506 return strcmp_iw_ordered (string1
, string2
);
5508 if (*string2
== '\0')
5510 if (is_name_suffix (string1
))
5517 if (*string2
== '(')
5518 return strcmp_iw_ordered (string1
, string2
);
5521 if (casing
== case_sensitive_off
)
5522 return tolower (*string1
) - tolower (*string2
);
5524 return *string1
- *string2
;
5529 /* Compare STRING1 to STRING2, with results as for strcmp.
5530 Compatible with strcmp_iw_ordered in that...
5532 strcmp_iw_ordered (STRING1, STRING2) <= 0
5536 compare_names (STRING1, STRING2) <= 0
5538 (they may differ as to what symbols compare equal). */
5541 compare_names (const char *string1
, const char *string2
)
5545 /* Similar to what strcmp_iw_ordered does, we need to perform
5546 a case-insensitive comparison first, and only resort to
5547 a second, case-sensitive, comparison if the first one was
5548 not sufficient to differentiate the two strings. */
5550 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5552 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5557 /* Convenience function to get at the Ada encoded lookup name for
5558 LOOKUP_NAME, as a C string. */
5561 ada_lookup_name (const lookup_name_info
&lookup_name
)
5563 return lookup_name
.ada ().lookup_name ().c_str ();
5566 /* Add to OBSTACKP all non-local symbols whose name and domain match
5567 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5568 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5569 symbols otherwise. */
5572 add_nonlocal_symbols (struct obstack
*obstackp
,
5573 const lookup_name_info
&lookup_name
,
5574 domain_enum domain
, int global
)
5576 struct match_data data
;
5578 memset (&data
, 0, sizeof data
);
5579 data
.obstackp
= obstackp
;
5581 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5583 auto callback
= [&] (struct block_symbol
*bsym
)
5585 return aux_add_nonlocal_symbols (bsym
, &data
);
5588 for (objfile
*objfile
: current_program_space
->objfiles ())
5590 data
.objfile
= objfile
;
5592 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5593 domain
, global
, callback
,
5595 ? NULL
: compare_names
));
5597 for (compunit_symtab
*cu
: objfile
->compunits ())
5599 const struct block
*global_block
5600 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5602 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5608 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5610 const char *name
= ada_lookup_name (lookup_name
);
5611 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5612 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5614 for (objfile
*objfile
: current_program_space
->objfiles ())
5616 data
.objfile
= objfile
;
5617 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5618 domain
, global
, callback
,
5624 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5625 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5626 returning the number of matches. Add these to OBSTACKP.
5628 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5629 symbol match within the nest of blocks whose innermost member is BLOCK,
5630 is the one match returned (no other matches in that or
5631 enclosing blocks is returned). If there are any matches in or
5632 surrounding BLOCK, then these alone are returned.
5634 Names prefixed with "standard__" are handled specially:
5635 "standard__" is first stripped off (by the lookup_name
5636 constructor), and only static and global symbols are searched.
5638 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5639 to lookup global symbols. */
5642 ada_add_all_symbols (struct obstack
*obstackp
,
5643 const struct block
*block
,
5644 const lookup_name_info
&lookup_name
,
5647 int *made_global_lookup_p
)
5651 if (made_global_lookup_p
)
5652 *made_global_lookup_p
= 0;
5654 /* Special case: If the user specifies a symbol name inside package
5655 Standard, do a non-wild matching of the symbol name without
5656 the "standard__" prefix. This was primarily introduced in order
5657 to allow the user to specifically access the standard exceptions
5658 using, for instance, Standard.Constraint_Error when Constraint_Error
5659 is ambiguous (due to the user defining its own Constraint_Error
5660 entity inside its program). */
5661 if (lookup_name
.ada ().standard_p ())
5664 /* Check the non-global symbols. If we have ANY match, then we're done. */
5669 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5672 /* In the !full_search case we're are being called by
5673 iterate_over_symbols, and we don't want to search
5675 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5677 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5681 /* No non-global symbols found. Check our cache to see if we have
5682 already performed this search before. If we have, then return
5685 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5686 domain
, &sym
, &block
))
5689 add_defn_to_vec (obstackp
, sym
, block
);
5693 if (made_global_lookup_p
)
5694 *made_global_lookup_p
= 1;
5696 /* Search symbols from all global blocks. */
5698 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5700 /* Now add symbols from all per-file blocks if we've gotten no hits
5701 (not strictly correct, but perhaps better than an error). */
5703 if (num_defns_collected (obstackp
) == 0)
5704 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5707 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5708 is non-zero, enclosing scope and in global scopes, returning the number of
5710 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5711 found and the blocks and symbol tables (if any) in which they were
5714 When full_search is non-zero, any non-function/non-enumeral
5715 symbol match within the nest of blocks whose innermost member is BLOCK,
5716 is the one match returned (no other matches in that or
5717 enclosing blocks is returned). If there are any matches in or
5718 surrounding BLOCK, then these alone are returned.
5720 Names prefixed with "standard__" are handled specially: "standard__"
5721 is first stripped off, and only static and global symbols are searched. */
5724 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5725 const struct block
*block
,
5727 std::vector
<struct block_symbol
> *results
,
5730 int syms_from_global_search
;
5732 auto_obstack obstack
;
5734 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5735 domain
, full_search
, &syms_from_global_search
);
5737 ndefns
= num_defns_collected (&obstack
);
5739 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5740 for (int i
= 0; i
< ndefns
; ++i
)
5741 results
->push_back (base
[i
]);
5743 ndefns
= remove_extra_symbols (results
);
5745 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5746 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5748 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5749 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5750 (*results
)[0].symbol
, (*results
)[0].block
);
5752 ndefns
= remove_irrelevant_renamings (results
, block
);
5757 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5758 in global scopes, returning the number of matches, and filling *RESULTS
5759 with (SYM,BLOCK) tuples.
5761 See ada_lookup_symbol_list_worker for further details. */
5764 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5766 std::vector
<struct block_symbol
> *results
)
5768 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5769 lookup_name_info
lookup_name (name
, name_match_type
);
5771 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5774 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5775 to 1, but choosing the first symbol found if there are multiple
5778 The result is stored in *INFO, which must be non-NULL.
5779 If no match is found, INFO->SYM is set to NULL. */
5782 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5784 struct block_symbol
*info
)
5786 /* Since we already have an encoded name, wrap it in '<>' to force a
5787 verbatim match. Otherwise, if the name happens to not look like
5788 an encoded name (because it doesn't include a "__"),
5789 ada_lookup_name_info would re-encode/fold it again, and that
5790 would e.g., incorrectly lowercase object renaming names like
5791 "R28b" -> "r28b". */
5792 std::string verbatim
= std::string ("<") + name
+ '>';
5794 gdb_assert (info
!= NULL
);
5795 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5798 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5799 scope and in global scopes, or NULL if none. NAME is folded and
5800 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5801 choosing the first symbol if there are multiple choices. */
5804 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5807 std::vector
<struct block_symbol
> candidates
;
5810 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5812 if (n_candidates
== 0)
5815 block_symbol info
= candidates
[0];
5816 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5821 /* True iff STR is a possible encoded suffix of a normal Ada name
5822 that is to be ignored for matching purposes. Suffixes of parallel
5823 names (e.g., XVE) are not included here. Currently, the possible suffixes
5824 are given by any of the regular expressions:
5826 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5827 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5828 TKB [subprogram suffix for task bodies]
5829 _E[0-9]+[bs]$ [protected object entry suffixes]
5830 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5832 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5833 match is performed. This sequence is used to differentiate homonyms,
5834 is an optional part of a valid name suffix. */
5837 is_name_suffix (const char *str
)
5840 const char *matching
;
5841 const int len
= strlen (str
);
5843 /* Skip optional leading __[0-9]+. */
5845 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5848 while (isdigit (str
[0]))
5854 if (str
[0] == '.' || str
[0] == '$')
5857 while (isdigit (matching
[0]))
5859 if (matching
[0] == '\0')
5865 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5868 while (isdigit (matching
[0]))
5870 if (matching
[0] == '\0')
5874 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5876 if (strcmp (str
, "TKB") == 0)
5880 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5881 with a N at the end. Unfortunately, the compiler uses the same
5882 convention for other internal types it creates. So treating
5883 all entity names that end with an "N" as a name suffix causes
5884 some regressions. For instance, consider the case of an enumerated
5885 type. To support the 'Image attribute, it creates an array whose
5887 Having a single character like this as a suffix carrying some
5888 information is a bit risky. Perhaps we should change the encoding
5889 to be something like "_N" instead. In the meantime, do not do
5890 the following check. */
5891 /* Protected Object Subprograms */
5892 if (len
== 1 && str
[0] == 'N')
5897 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5900 while (isdigit (matching
[0]))
5902 if ((matching
[0] == 'b' || matching
[0] == 's')
5903 && matching
[1] == '\0')
5907 /* ??? We should not modify STR directly, as we are doing below. This
5908 is fine in this case, but may become problematic later if we find
5909 that this alternative did not work, and want to try matching
5910 another one from the begining of STR. Since we modified it, we
5911 won't be able to find the begining of the string anymore! */
5915 while (str
[0] != '_' && str
[0] != '\0')
5917 if (str
[0] != 'n' && str
[0] != 'b')
5923 if (str
[0] == '\000')
5928 if (str
[1] != '_' || str
[2] == '\000')
5932 if (strcmp (str
+ 3, "JM") == 0)
5934 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5935 the LJM suffix in favor of the JM one. But we will
5936 still accept LJM as a valid suffix for a reasonable
5937 amount of time, just to allow ourselves to debug programs
5938 compiled using an older version of GNAT. */
5939 if (strcmp (str
+ 3, "LJM") == 0)
5943 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5944 || str
[4] == 'U' || str
[4] == 'P')
5946 if (str
[4] == 'R' && str
[5] != 'T')
5950 if (!isdigit (str
[2]))
5952 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5953 if (!isdigit (str
[k
]) && str
[k
] != '_')
5957 if (str
[0] == '$' && isdigit (str
[1]))
5959 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5960 if (!isdigit (str
[k
]) && str
[k
] != '_')
5967 /* Return non-zero if the string starting at NAME and ending before
5968 NAME_END contains no capital letters. */
5971 is_valid_name_for_wild_match (const char *name0
)
5973 std::string decoded_name
= ada_decode (name0
);
5976 /* If the decoded name starts with an angle bracket, it means that
5977 NAME0 does not follow the GNAT encoding format. It should then
5978 not be allowed as a possible wild match. */
5979 if (decoded_name
[0] == '<')
5982 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5983 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5989 /* Advance *NAMEP to next occurrence in the string NAME0 of the TARGET0
5990 character which could start a simple name. Assumes that *NAMEP points
5991 somewhere inside the string beginning at NAME0. */
5994 advance_wild_match (const char **namep
, const char *name0
, char target0
)
5996 const char *name
= *namep
;
6006 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6009 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6014 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6015 || name
[2] == target0
))
6023 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6033 /* Return true iff NAME encodes a name of the form prefix.PATN.
6034 Ignores any informational suffixes of NAME (i.e., for which
6035 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6039 wild_match (const char *name
, const char *patn
)
6042 const char *name0
= name
;
6046 const char *match
= name
;
6050 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6053 if (*p
== '\0' && is_name_suffix (name
))
6054 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6056 if (name
[-1] == '_')
6059 if (!advance_wild_match (&name
, name0
, *patn
))
6064 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6065 any trailing suffixes that encode debugging information or leading
6066 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6067 information that is ignored). */
6070 full_match (const char *sym_name
, const char *search_name
)
6072 size_t search_name_len
= strlen (search_name
);
6074 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6075 && is_name_suffix (sym_name
+ search_name_len
))
6078 if (startswith (sym_name
, "_ada_")
6079 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6080 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6086 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6087 *defn_symbols, updating the list of symbols in OBSTACKP (if
6088 necessary). OBJFILE is the section containing BLOCK. */
6091 ada_add_block_symbols (struct obstack
*obstackp
,
6092 const struct block
*block
,
6093 const lookup_name_info
&lookup_name
,
6094 domain_enum domain
, struct objfile
*objfile
)
6096 struct block_iterator iter
;
6097 /* A matching argument symbol, if any. */
6098 struct symbol
*arg_sym
;
6099 /* Set true when we find a matching non-argument symbol. */
6105 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6107 sym
= block_iter_match_next (lookup_name
, &iter
))
6109 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6111 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6113 if (SYMBOL_IS_ARGUMENT (sym
))
6118 add_defn_to_vec (obstackp
,
6119 fixup_symbol_section (sym
, objfile
),
6126 /* Handle renamings. */
6128 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6131 if (!found_sym
&& arg_sym
!= NULL
)
6133 add_defn_to_vec (obstackp
,
6134 fixup_symbol_section (arg_sym
, objfile
),
6138 if (!lookup_name
.ada ().wild_match_p ())
6142 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6143 const char *name
= ada_lookup_name
.c_str ();
6144 size_t name_len
= ada_lookup_name
.size ();
6146 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6148 if (symbol_matches_domain (sym
->language (),
6149 SYMBOL_DOMAIN (sym
), domain
))
6153 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6156 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6158 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6163 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6165 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6167 if (SYMBOL_IS_ARGUMENT (sym
))
6172 add_defn_to_vec (obstackp
,
6173 fixup_symbol_section (sym
, objfile
),
6181 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6182 They aren't parameters, right? */
6183 if (!found_sym
&& arg_sym
!= NULL
)
6185 add_defn_to_vec (obstackp
,
6186 fixup_symbol_section (arg_sym
, objfile
),
6193 /* Symbol Completion */
6198 ada_lookup_name_info::matches
6199 (const char *sym_name
,
6200 symbol_name_match_type match_type
,
6201 completion_match_result
*comp_match_res
) const
6204 const char *text
= m_encoded_name
.c_str ();
6205 size_t text_len
= m_encoded_name
.size ();
6207 /* First, test against the fully qualified name of the symbol. */
6209 if (strncmp (sym_name
, text
, text_len
) == 0)
6212 std::string decoded_name
= ada_decode (sym_name
);
6213 if (match
&& !m_encoded_p
)
6215 /* One needed check before declaring a positive match is to verify
6216 that iff we are doing a verbatim match, the decoded version
6217 of the symbol name starts with '<'. Otherwise, this symbol name
6218 is not a suitable completion. */
6220 bool has_angle_bracket
= (decoded_name
[0] == '<');
6221 match
= (has_angle_bracket
== m_verbatim_p
);
6224 if (match
&& !m_verbatim_p
)
6226 /* When doing non-verbatim match, another check that needs to
6227 be done is to verify that the potentially matching symbol name
6228 does not include capital letters, because the ada-mode would
6229 not be able to understand these symbol names without the
6230 angle bracket notation. */
6233 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6238 /* Second: Try wild matching... */
6240 if (!match
&& m_wild_match_p
)
6242 /* Since we are doing wild matching, this means that TEXT
6243 may represent an unqualified symbol name. We therefore must
6244 also compare TEXT against the unqualified name of the symbol. */
6245 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6247 if (strncmp (sym_name
, text
, text_len
) == 0)
6251 /* Finally: If we found a match, prepare the result to return. */
6256 if (comp_match_res
!= NULL
)
6258 std::string
&match_str
= comp_match_res
->match
.storage ();
6261 match_str
= ada_decode (sym_name
);
6265 match_str
= add_angle_brackets (sym_name
);
6267 match_str
= sym_name
;
6271 comp_match_res
->set_match (match_str
.c_str ());
6279 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6280 for tagged types. */
6283 ada_is_dispatch_table_ptr_type (struct type
*type
)
6287 if (type
->code () != TYPE_CODE_PTR
)
6290 name
= TYPE_TARGET_TYPE (type
)->name ();
6294 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6297 /* Return non-zero if TYPE is an interface tag. */
6300 ada_is_interface_tag (struct type
*type
)
6302 const char *name
= type
->name ();
6307 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6310 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6311 to be invisible to users. */
6314 ada_is_ignored_field (struct type
*type
, int field_num
)
6316 if (field_num
< 0 || field_num
> type
->num_fields ())
6319 /* Check the name of that field. */
6321 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6323 /* Anonymous field names should not be printed.
6324 brobecker/2007-02-20: I don't think this can actually happen
6325 but we don't want to print the value of anonymous fields anyway. */
6329 /* Normally, fields whose name start with an underscore ("_")
6330 are fields that have been internally generated by the compiler,
6331 and thus should not be printed. The "_parent" field is special,
6332 however: This is a field internally generated by the compiler
6333 for tagged types, and it contains the components inherited from
6334 the parent type. This field should not be printed as is, but
6335 should not be ignored either. */
6336 if (name
[0] == '_' && !startswith (name
, "_parent"))
6340 /* If this is the dispatch table of a tagged type or an interface tag,
6342 if (ada_is_tagged_type (type
, 1)
6343 && (ada_is_dispatch_table_ptr_type (type
->field (field_num
).type ())
6344 || ada_is_interface_tag (type
->field (field_num
).type ())))
6347 /* Not a special field, so it should not be ignored. */
6351 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6352 pointer or reference type whose ultimate target has a tag field. */
6355 ada_is_tagged_type (struct type
*type
, int refok
)
6357 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6360 /* True iff TYPE represents the type of X'Tag */
6363 ada_is_tag_type (struct type
*type
)
6365 type
= ada_check_typedef (type
);
6367 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6371 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6373 return (name
!= NULL
6374 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6378 /* The type of the tag on VAL. */
6380 static struct type
*
6381 ada_tag_type (struct value
*val
)
6383 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6386 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6387 retired at Ada 05). */
6390 is_ada95_tag (struct value
*tag
)
6392 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6395 /* The value of the tag on VAL. */
6397 static struct value
*
6398 ada_value_tag (struct value
*val
)
6400 return ada_value_struct_elt (val
, "_tag", 0);
6403 /* The value of the tag on the object of type TYPE whose contents are
6404 saved at VALADDR, if it is non-null, or is at memory address
6407 static struct value
*
6408 value_tag_from_contents_and_address (struct type
*type
,
6409 const gdb_byte
*valaddr
,
6412 int tag_byte_offset
;
6413 struct type
*tag_type
;
6415 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6418 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6420 : valaddr
+ tag_byte_offset
);
6421 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6423 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6428 static struct type
*
6429 type_from_tag (struct value
*tag
)
6431 gdb::unique_xmalloc_ptr
<char> type_name
= ada_tag_name (tag
);
6433 if (type_name
!= NULL
)
6434 return ada_find_any_type (ada_encode (type_name
.get ()).c_str ());
6438 /* Given a value OBJ of a tagged type, return a value of this
6439 type at the base address of the object. The base address, as
6440 defined in Ada.Tags, it is the address of the primary tag of
6441 the object, and therefore where the field values of its full
6442 view can be fetched. */
6445 ada_tag_value_at_base_address (struct value
*obj
)
6448 LONGEST offset_to_top
= 0;
6449 struct type
*ptr_type
, *obj_type
;
6451 CORE_ADDR base_address
;
6453 obj_type
= value_type (obj
);
6455 /* It is the responsability of the caller to deref pointers. */
6457 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6460 tag
= ada_value_tag (obj
);
6464 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6466 if (is_ada95_tag (tag
))
6469 ptr_type
= language_lookup_primitive_type
6470 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6471 ptr_type
= lookup_pointer_type (ptr_type
);
6472 val
= value_cast (ptr_type
, tag
);
6476 /* It is perfectly possible that an exception be raised while
6477 trying to determine the base address, just like for the tag;
6478 see ada_tag_name for more details. We do not print the error
6479 message for the same reason. */
6483 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6486 catch (const gdb_exception_error
&e
)
6491 /* If offset is null, nothing to do. */
6493 if (offset_to_top
== 0)
6496 /* -1 is a special case in Ada.Tags; however, what should be done
6497 is not quite clear from the documentation. So do nothing for
6500 if (offset_to_top
== -1)
6503 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6504 from the base address. This was however incompatible with
6505 C++ dispatch table: C++ uses a *negative* value to *add*
6506 to the base address. Ada's convention has therefore been
6507 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6508 use the same convention. Here, we support both cases by
6509 checking the sign of OFFSET_TO_TOP. */
6511 if (offset_to_top
> 0)
6512 offset_to_top
= -offset_to_top
;
6514 base_address
= value_address (obj
) + offset_to_top
;
6515 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6517 /* Make sure that we have a proper tag at the new address.
6518 Otherwise, offset_to_top is bogus (which can happen when
6519 the object is not initialized yet). */
6524 obj_type
= type_from_tag (tag
);
6529 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6532 /* Return the "ada__tags__type_specific_data" type. */
6534 static struct type
*
6535 ada_get_tsd_type (struct inferior
*inf
)
6537 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6539 if (data
->tsd_type
== 0)
6540 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6541 return data
->tsd_type
;
6544 /* Return the TSD (type-specific data) associated to the given TAG.
6545 TAG is assumed to be the tag of a tagged-type entity.
6547 May return NULL if we are unable to get the TSD. */
6549 static struct value
*
6550 ada_get_tsd_from_tag (struct value
*tag
)
6555 /* First option: The TSD is simply stored as a field of our TAG.
6556 Only older versions of GNAT would use this format, but we have
6557 to test it first, because there are no visible markers for
6558 the current approach except the absence of that field. */
6560 val
= ada_value_struct_elt (tag
, "tsd", 1);
6564 /* Try the second representation for the dispatch table (in which
6565 there is no explicit 'tsd' field in the referent of the tag pointer,
6566 and instead the tsd pointer is stored just before the dispatch
6569 type
= ada_get_tsd_type (current_inferior());
6572 type
= lookup_pointer_type (lookup_pointer_type (type
));
6573 val
= value_cast (type
, tag
);
6576 return value_ind (value_ptradd (val
, -1));
6579 /* Given the TSD of a tag (type-specific data), return a string
6580 containing the name of the associated type.
6582 May return NULL if we are unable to determine the tag name. */
6584 static gdb::unique_xmalloc_ptr
<char>
6585 ada_tag_name_from_tsd (struct value
*tsd
)
6590 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6593 gdb::unique_xmalloc_ptr
<char> buffer
6594 = target_read_string (value_as_address (val
), INT_MAX
);
6595 if (buffer
== nullptr)
6598 for (p
= buffer
.get (); *p
!= '\0'; ++p
)
6607 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6610 Return NULL if the TAG is not an Ada tag, or if we were unable to
6611 determine the name of that tag. */
6613 gdb::unique_xmalloc_ptr
<char>
6614 ada_tag_name (struct value
*tag
)
6616 gdb::unique_xmalloc_ptr
<char> name
;
6618 if (!ada_is_tag_type (value_type (tag
)))
6621 /* It is perfectly possible that an exception be raised while trying
6622 to determine the TAG's name, even under normal circumstances:
6623 The associated variable may be uninitialized or corrupted, for
6624 instance. We do not let any exception propagate past this point.
6625 instead we return NULL.
6627 We also do not print the error message either (which often is very
6628 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6629 the caller print a more meaningful message if necessary. */
6632 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6635 name
= ada_tag_name_from_tsd (tsd
);
6637 catch (const gdb_exception_error
&e
)
6644 /* The parent type of TYPE, or NULL if none. */
6647 ada_parent_type (struct type
*type
)
6651 type
= ada_check_typedef (type
);
6653 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6656 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6657 if (ada_is_parent_field (type
, i
))
6659 struct type
*parent_type
= type
->field (i
).type ();
6661 /* If the _parent field is a pointer, then dereference it. */
6662 if (parent_type
->code () == TYPE_CODE_PTR
)
6663 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6664 /* If there is a parallel XVS type, get the actual base type. */
6665 parent_type
= ada_get_base_type (parent_type
);
6667 return ada_check_typedef (parent_type
);
6673 /* True iff field number FIELD_NUM of structure type TYPE contains the
6674 parent-type (inherited) fields of a derived type. Assumes TYPE is
6675 a structure type with at least FIELD_NUM+1 fields. */
6678 ada_is_parent_field (struct type
*type
, int field_num
)
6680 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6682 return (name
!= NULL
6683 && (startswith (name
, "PARENT")
6684 || startswith (name
, "_parent")));
6687 /* True iff field number FIELD_NUM of structure type TYPE is a
6688 transparent wrapper field (which should be silently traversed when doing
6689 field selection and flattened when printing). Assumes TYPE is a
6690 structure type with at least FIELD_NUM+1 fields. Such fields are always
6694 ada_is_wrapper_field (struct type
*type
, int field_num
)
6696 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6698 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6700 /* This happens in functions with "out" or "in out" parameters
6701 which are passed by copy. For such functions, GNAT describes
6702 the function's return type as being a struct where the return
6703 value is in a field called RETVAL, and where the other "out"
6704 or "in out" parameters are fields of that struct. This is not
6709 return (name
!= NULL
6710 && (startswith (name
, "PARENT")
6711 || strcmp (name
, "REP") == 0
6712 || startswith (name
, "_parent")
6713 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6716 /* True iff field number FIELD_NUM of structure or union type TYPE
6717 is a variant wrapper. Assumes TYPE is a structure type with at least
6718 FIELD_NUM+1 fields. */
6721 ada_is_variant_part (struct type
*type
, int field_num
)
6723 /* Only Ada types are eligible. */
6724 if (!ADA_TYPE_P (type
))
6727 struct type
*field_type
= type
->field (field_num
).type ();
6729 return (field_type
->code () == TYPE_CODE_UNION
6730 || (is_dynamic_field (type
, field_num
)
6731 && (TYPE_TARGET_TYPE (field_type
)->code ()
6732 == TYPE_CODE_UNION
)));
6735 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6736 whose discriminants are contained in the record type OUTER_TYPE,
6737 returns the type of the controlling discriminant for the variant.
6738 May return NULL if the type could not be found. */
6741 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6743 const char *name
= ada_variant_discrim_name (var_type
);
6745 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6748 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6749 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6750 represents a 'when others' clause; otherwise 0. */
6753 ada_is_others_clause (struct type
*type
, int field_num
)
6755 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6757 return (name
!= NULL
&& name
[0] == 'O');
6760 /* Assuming that TYPE0 is the type of the variant part of a record,
6761 returns the name of the discriminant controlling the variant.
6762 The value is valid until the next call to ada_variant_discrim_name. */
6765 ada_variant_discrim_name (struct type
*type0
)
6767 static char *result
= NULL
;
6768 static size_t result_len
= 0;
6771 const char *discrim_end
;
6772 const char *discrim_start
;
6774 if (type0
->code () == TYPE_CODE_PTR
)
6775 type
= TYPE_TARGET_TYPE (type0
);
6779 name
= ada_type_name (type
);
6781 if (name
== NULL
|| name
[0] == '\000')
6784 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6787 if (startswith (discrim_end
, "___XVN"))
6790 if (discrim_end
== name
)
6793 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6796 if (discrim_start
== name
+ 1)
6798 if ((discrim_start
> name
+ 3
6799 && startswith (discrim_start
- 3, "___"))
6800 || discrim_start
[-1] == '.')
6804 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6805 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6806 result
[discrim_end
- discrim_start
] = '\0';
6810 /* Scan STR for a subtype-encoded number, beginning at position K.
6811 Put the position of the character just past the number scanned in
6812 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6813 Return 1 if there was a valid number at the given position, and 0
6814 otherwise. A "subtype-encoded" number consists of the absolute value
6815 in decimal, followed by the letter 'm' to indicate a negative number.
6816 Assumes 0m does not occur. */
6819 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6823 if (!isdigit (str
[k
]))
6826 /* Do it the hard way so as not to make any assumption about
6827 the relationship of unsigned long (%lu scan format code) and
6830 while (isdigit (str
[k
]))
6832 RU
= RU
* 10 + (str
[k
] - '0');
6839 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6845 /* NOTE on the above: Technically, C does not say what the results of
6846 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6847 number representable as a LONGEST (although either would probably work
6848 in most implementations). When RU>0, the locution in the then branch
6849 above is always equivalent to the negative of RU. */
6856 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6857 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6858 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6861 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6863 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6877 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6887 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6888 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6890 if (val
>= L
&& val
<= U
)
6902 /* FIXME: Lots of redundancy below. Try to consolidate. */
6904 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6905 ARG_TYPE, extract and return the value of one of its (non-static)
6906 fields. FIELDNO says which field. Differs from value_primitive_field
6907 only in that it can handle packed values of arbitrary type. */
6910 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6911 struct type
*arg_type
)
6915 arg_type
= ada_check_typedef (arg_type
);
6916 type
= arg_type
->field (fieldno
).type ();
6918 /* Handle packed fields. It might be that the field is not packed
6919 relative to its containing structure, but the structure itself is
6920 packed; in this case we must take the bit-field path. */
6921 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
6923 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6924 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6926 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6927 offset
+ bit_pos
/ 8,
6928 bit_pos
% 8, bit_size
, type
);
6931 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6934 /* Find field with name NAME in object of type TYPE. If found,
6935 set the following for each argument that is non-null:
6936 - *FIELD_TYPE_P to the field's type;
6937 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6938 an object of that type;
6939 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6940 - *BIT_SIZE_P to its size in bits if the field is packed, and
6942 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6943 fields up to but not including the desired field, or by the total
6944 number of fields if not found. A NULL value of NAME never
6945 matches; the function just counts visible fields in this case.
6947 Notice that we need to handle when a tagged record hierarchy
6948 has some components with the same name, like in this scenario:
6950 type Top_T is tagged record
6956 type Middle_T is new Top.Top_T with record
6957 N : Character := 'a';
6961 type Bottom_T is new Middle.Middle_T with record
6963 C : Character := '5';
6965 A : Character := 'J';
6968 Let's say we now have a variable declared and initialized as follow:
6970 TC : Top_A := new Bottom_T;
6972 And then we use this variable to call this function
6974 procedure Assign (Obj: in out Top_T; TV : Integer);
6978 Assign (Top_T (B), 12);
6980 Now, we're in the debugger, and we're inside that procedure
6981 then and we want to print the value of obj.c:
6983 Usually, the tagged record or one of the parent type owns the
6984 component to print and there's no issue but in this particular
6985 case, what does it mean to ask for Obj.C? Since the actual
6986 type for object is type Bottom_T, it could mean two things: type
6987 component C from the Middle_T view, but also component C from
6988 Bottom_T. So in that "undefined" case, when the component is
6989 not found in the non-resolved type (which includes all the
6990 components of the parent type), then resolve it and see if we
6991 get better luck once expanded.
6993 In the case of homonyms in the derived tagged type, we don't
6994 guaranty anything, and pick the one that's easiest for us
6997 Returns 1 if found, 0 otherwise. */
7000 find_struct_field (const char *name
, struct type
*type
, int offset
,
7001 struct type
**field_type_p
,
7002 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7006 int parent_offset
= -1;
7008 type
= ada_check_typedef (type
);
7010 if (field_type_p
!= NULL
)
7011 *field_type_p
= NULL
;
7012 if (byte_offset_p
!= NULL
)
7014 if (bit_offset_p
!= NULL
)
7016 if (bit_size_p
!= NULL
)
7019 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7021 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7022 int fld_offset
= offset
+ bit_pos
/ 8;
7023 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7025 if (t_field_name
== NULL
)
7028 else if (ada_is_parent_field (type
, i
))
7030 /* This is a field pointing us to the parent type of a tagged
7031 type. As hinted in this function's documentation, we give
7032 preference to fields in the current record first, so what
7033 we do here is just record the index of this field before
7034 we skip it. If it turns out we couldn't find our field
7035 in the current record, then we'll get back to it and search
7036 inside it whether the field might exist in the parent. */
7042 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7044 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7046 if (field_type_p
!= NULL
)
7047 *field_type_p
= type
->field (i
).type ();
7048 if (byte_offset_p
!= NULL
)
7049 *byte_offset_p
= fld_offset
;
7050 if (bit_offset_p
!= NULL
)
7051 *bit_offset_p
= bit_pos
% 8;
7052 if (bit_size_p
!= NULL
)
7053 *bit_size_p
= bit_size
;
7056 else if (ada_is_wrapper_field (type
, i
))
7058 if (find_struct_field (name
, type
->field (i
).type (), fld_offset
,
7059 field_type_p
, byte_offset_p
, bit_offset_p
,
7060 bit_size_p
, index_p
))
7063 else if (ada_is_variant_part (type
, i
))
7065 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7068 struct type
*field_type
7069 = ada_check_typedef (type
->field (i
).type ());
7071 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7073 if (find_struct_field (name
, field_type
->field (j
).type (),
7075 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7076 field_type_p
, byte_offset_p
,
7077 bit_offset_p
, bit_size_p
, index_p
))
7081 else if (index_p
!= NULL
)
7085 /* Field not found so far. If this is a tagged type which
7086 has a parent, try finding that field in the parent now. */
7088 if (parent_offset
!= -1)
7090 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7091 int fld_offset
= offset
+ bit_pos
/ 8;
7093 if (find_struct_field (name
, type
->field (parent_offset
).type (),
7094 fld_offset
, field_type_p
, byte_offset_p
,
7095 bit_offset_p
, bit_size_p
, index_p
))
7102 /* Number of user-visible fields in record type TYPE. */
7105 num_visible_fields (struct type
*type
)
7110 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7114 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7115 and search in it assuming it has (class) type TYPE.
7116 If found, return value, else return NULL.
7118 Searches recursively through wrapper fields (e.g., '_parent').
7120 In the case of homonyms in the tagged types, please refer to the
7121 long explanation in find_struct_field's function documentation. */
7123 static struct value
*
7124 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7128 int parent_offset
= -1;
7130 type
= ada_check_typedef (type
);
7131 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7133 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7135 if (t_field_name
== NULL
)
7138 else if (ada_is_parent_field (type
, i
))
7140 /* This is a field pointing us to the parent type of a tagged
7141 type. As hinted in this function's documentation, we give
7142 preference to fields in the current record first, so what
7143 we do here is just record the index of this field before
7144 we skip it. If it turns out we couldn't find our field
7145 in the current record, then we'll get back to it and search
7146 inside it whether the field might exist in the parent. */
7152 else if (field_name_match (t_field_name
, name
))
7153 return ada_value_primitive_field (arg
, offset
, i
, type
);
7155 else if (ada_is_wrapper_field (type
, i
))
7157 struct value
*v
= /* Do not let indent join lines here. */
7158 ada_search_struct_field (name
, arg
,
7159 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7160 type
->field (i
).type ());
7166 else if (ada_is_variant_part (type
, i
))
7168 /* PNH: Do we ever get here? See find_struct_field. */
7170 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7171 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7173 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7175 struct value
*v
= ada_search_struct_field
/* Force line
7178 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7179 field_type
->field (j
).type ());
7187 /* Field not found so far. If this is a tagged type which
7188 has a parent, try finding that field in the parent now. */
7190 if (parent_offset
!= -1)
7192 struct value
*v
= ada_search_struct_field (
7193 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7194 type
->field (parent_offset
).type ());
7203 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7204 int, struct type
*);
7207 /* Return field #INDEX in ARG, where the index is that returned by
7208 * find_struct_field through its INDEX_P argument. Adjust the address
7209 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7210 * If found, return value, else return NULL. */
7212 static struct value
*
7213 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7216 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7220 /* Auxiliary function for ada_index_struct_field. Like
7221 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7224 static struct value
*
7225 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7229 type
= ada_check_typedef (type
);
7231 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7233 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7235 else if (ada_is_wrapper_field (type
, i
))
7237 struct value
*v
= /* Do not let indent join lines here. */
7238 ada_index_struct_field_1 (index_p
, arg
,
7239 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7240 type
->field (i
).type ());
7246 else if (ada_is_variant_part (type
, i
))
7248 /* PNH: Do we ever get here? See ada_search_struct_field,
7249 find_struct_field. */
7250 error (_("Cannot assign this kind of variant record"));
7252 else if (*index_p
== 0)
7253 return ada_value_primitive_field (arg
, offset
, i
, type
);
7260 /* Return a string representation of type TYPE. */
7263 type_as_string (struct type
*type
)
7265 string_file tmp_stream
;
7267 type_print (type
, "", &tmp_stream
, -1);
7269 return std::move (tmp_stream
.string ());
7272 /* Given a type TYPE, look up the type of the component of type named NAME.
7273 If DISPP is non-null, add its byte displacement from the beginning of a
7274 structure (pointed to by a value) of type TYPE to *DISPP (does not
7275 work for packed fields).
7277 Matches any field whose name has NAME as a prefix, possibly
7280 TYPE can be either a struct or union. If REFOK, TYPE may also
7281 be a (pointer or reference)+ to a struct or union, and the
7282 ultimate target type will be searched.
7284 Looks recursively into variant clauses and parent types.
7286 In the case of homonyms in the tagged types, please refer to the
7287 long explanation in find_struct_field's function documentation.
7289 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7290 TYPE is not a type of the right kind. */
7292 static struct type
*
7293 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7297 int parent_offset
= -1;
7302 if (refok
&& type
!= NULL
)
7305 type
= ada_check_typedef (type
);
7306 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7308 type
= TYPE_TARGET_TYPE (type
);
7312 || (type
->code () != TYPE_CODE_STRUCT
7313 && type
->code () != TYPE_CODE_UNION
))
7318 error (_("Type %s is not a structure or union type"),
7319 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7322 type
= to_static_fixed_type (type
);
7324 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7326 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7329 if (t_field_name
== NULL
)
7332 else if (ada_is_parent_field (type
, i
))
7334 /* This is a field pointing us to the parent type of a tagged
7335 type. As hinted in this function's documentation, we give
7336 preference to fields in the current record first, so what
7337 we do here is just record the index of this field before
7338 we skip it. If it turns out we couldn't find our field
7339 in the current record, then we'll get back to it and search
7340 inside it whether the field might exist in the parent. */
7346 else if (field_name_match (t_field_name
, name
))
7347 return type
->field (i
).type ();
7349 else if (ada_is_wrapper_field (type
, i
))
7351 t
= ada_lookup_struct_elt_type (type
->field (i
).type (), name
,
7357 else if (ada_is_variant_part (type
, i
))
7360 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7362 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
7364 /* FIXME pnh 2008/01/26: We check for a field that is
7365 NOT wrapped in a struct, since the compiler sometimes
7366 generates these for unchecked variant types. Revisit
7367 if the compiler changes this practice. */
7368 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7370 if (v_field_name
!= NULL
7371 && field_name_match (v_field_name
, name
))
7372 t
= field_type
->field (j
).type ();
7374 t
= ada_lookup_struct_elt_type (field_type
->field (j
).type (),
7384 /* Field not found so far. If this is a tagged type which
7385 has a parent, try finding that field in the parent now. */
7387 if (parent_offset
!= -1)
7391 t
= ada_lookup_struct_elt_type (type
->field (parent_offset
).type (),
7400 const char *name_str
= name
!= NULL
? name
: _("<null>");
7402 error (_("Type %s has no component named %s"),
7403 type_as_string (type
).c_str (), name_str
);
7409 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7410 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7411 represents an unchecked union (that is, the variant part of a
7412 record that is named in an Unchecked_Union pragma). */
7415 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7417 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7419 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7423 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7424 within OUTER, determine which variant clause (field number in VAR_TYPE,
7425 numbering from 0) is applicable. Returns -1 if none are. */
7428 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7432 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7433 struct value
*discrim
;
7434 LONGEST discrim_val
;
7436 /* Using plain value_from_contents_and_address here causes problems
7437 because we will end up trying to resolve a type that is currently
7438 being constructed. */
7439 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7440 if (discrim
== NULL
)
7442 discrim_val
= value_as_long (discrim
);
7445 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7447 if (ada_is_others_clause (var_type
, i
))
7449 else if (ada_in_variant (discrim_val
, var_type
, i
))
7453 return others_clause
;
7458 /* Dynamic-Sized Records */
7460 /* Strategy: The type ostensibly attached to a value with dynamic size
7461 (i.e., a size that is not statically recorded in the debugging
7462 data) does not accurately reflect the size or layout of the value.
7463 Our strategy is to convert these values to values with accurate,
7464 conventional types that are constructed on the fly. */
7466 /* There is a subtle and tricky problem here. In general, we cannot
7467 determine the size of dynamic records without its data. However,
7468 the 'struct value' data structure, which GDB uses to represent
7469 quantities in the inferior process (the target), requires the size
7470 of the type at the time of its allocation in order to reserve space
7471 for GDB's internal copy of the data. That's why the
7472 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7473 rather than struct value*s.
7475 However, GDB's internal history variables ($1, $2, etc.) are
7476 struct value*s containing internal copies of the data that are not, in
7477 general, the same as the data at their corresponding addresses in
7478 the target. Fortunately, the types we give to these values are all
7479 conventional, fixed-size types (as per the strategy described
7480 above), so that we don't usually have to perform the
7481 'to_fixed_xxx_type' conversions to look at their values.
7482 Unfortunately, there is one exception: if one of the internal
7483 history variables is an array whose elements are unconstrained
7484 records, then we will need to create distinct fixed types for each
7485 element selected. */
7487 /* The upshot of all of this is that many routines take a (type, host
7488 address, target address) triple as arguments to represent a value.
7489 The host address, if non-null, is supposed to contain an internal
7490 copy of the relevant data; otherwise, the program is to consult the
7491 target at the target address. */
7493 /* Assuming that VAL0 represents a pointer value, the result of
7494 dereferencing it. Differs from value_ind in its treatment of
7495 dynamic-sized types. */
7498 ada_value_ind (struct value
*val0
)
7500 struct value
*val
= value_ind (val0
);
7502 if (ada_is_tagged_type (value_type (val
), 0))
7503 val
= ada_tag_value_at_base_address (val
);
7505 return ada_to_fixed_value (val
);
7508 /* The value resulting from dereferencing any "reference to"
7509 qualifiers on VAL0. */
7511 static struct value
*
7512 ada_coerce_ref (struct value
*val0
)
7514 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7516 struct value
*val
= val0
;
7518 val
= coerce_ref (val
);
7520 if (ada_is_tagged_type (value_type (val
), 0))
7521 val
= ada_tag_value_at_base_address (val
);
7523 return ada_to_fixed_value (val
);
7529 /* Return the bit alignment required for field #F of template type TYPE. */
7532 field_alignment (struct type
*type
, int f
)
7534 const char *name
= TYPE_FIELD_NAME (type
, f
);
7538 /* The field name should never be null, unless the debugging information
7539 is somehow malformed. In this case, we assume the field does not
7540 require any alignment. */
7544 len
= strlen (name
);
7546 if (!isdigit (name
[len
- 1]))
7549 if (isdigit (name
[len
- 2]))
7550 align_offset
= len
- 2;
7552 align_offset
= len
- 1;
7554 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7555 return TARGET_CHAR_BIT
;
7557 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7560 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7562 static struct symbol
*
7563 ada_find_any_type_symbol (const char *name
)
7567 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7568 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7571 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7575 /* Find a type named NAME. Ignores ambiguity. This routine will look
7576 solely for types defined by debug info, it will not search the GDB
7579 static struct type
*
7580 ada_find_any_type (const char *name
)
7582 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7585 return SYMBOL_TYPE (sym
);
7590 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7591 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7592 symbol, in which case it is returned. Otherwise, this looks for
7593 symbols whose name is that of NAME_SYM suffixed with "___XR".
7594 Return symbol if found, and NULL otherwise. */
7597 ada_is_renaming_symbol (struct symbol
*name_sym
)
7599 const char *name
= name_sym
->linkage_name ();
7600 return strstr (name
, "___XR") != NULL
;
7603 /* Because of GNAT encoding conventions, several GDB symbols may match a
7604 given type name. If the type denoted by TYPE0 is to be preferred to
7605 that of TYPE1 for purposes of type printing, return non-zero;
7606 otherwise return 0. */
7609 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7613 else if (type0
== NULL
)
7615 else if (type1
->code () == TYPE_CODE_VOID
)
7617 else if (type0
->code () == TYPE_CODE_VOID
)
7619 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7621 else if (ada_is_constrained_packed_array_type (type0
))
7623 else if (ada_is_array_descriptor_type (type0
)
7624 && !ada_is_array_descriptor_type (type1
))
7628 const char *type0_name
= type0
->name ();
7629 const char *type1_name
= type1
->name ();
7631 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7632 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7638 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7642 ada_type_name (struct type
*type
)
7646 return type
->name ();
7649 /* Search the list of "descriptive" types associated to TYPE for a type
7650 whose name is NAME. */
7652 static struct type
*
7653 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7655 struct type
*result
, *tmp
;
7657 if (ada_ignore_descriptive_types_p
)
7660 /* If there no descriptive-type info, then there is no parallel type
7662 if (!HAVE_GNAT_AUX_INFO (type
))
7665 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7666 while (result
!= NULL
)
7668 const char *result_name
= ada_type_name (result
);
7670 if (result_name
== NULL
)
7672 warning (_("unexpected null name on descriptive type"));
7676 /* If the names match, stop. */
7677 if (strcmp (result_name
, name
) == 0)
7680 /* Otherwise, look at the next item on the list, if any. */
7681 if (HAVE_GNAT_AUX_INFO (result
))
7682 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7686 /* If not found either, try after having resolved the typedef. */
7691 result
= check_typedef (result
);
7692 if (HAVE_GNAT_AUX_INFO (result
))
7693 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7699 /* If we didn't find a match, see whether this is a packed array. With
7700 older compilers, the descriptive type information is either absent or
7701 irrelevant when it comes to packed arrays so the above lookup fails.
7702 Fall back to using a parallel lookup by name in this case. */
7703 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7704 return ada_find_any_type (name
);
7709 /* Find a parallel type to TYPE with the specified NAME, using the
7710 descriptive type taken from the debugging information, if available,
7711 and otherwise using the (slower) name-based method. */
7713 static struct type
*
7714 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7716 struct type
*result
= NULL
;
7718 if (HAVE_GNAT_AUX_INFO (type
))
7719 result
= find_parallel_type_by_descriptive_type (type
, name
);
7721 result
= ada_find_any_type (name
);
7726 /* Same as above, but specify the name of the parallel type by appending
7727 SUFFIX to the name of TYPE. */
7730 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7733 const char *type_name
= ada_type_name (type
);
7736 if (type_name
== NULL
)
7739 len
= strlen (type_name
);
7741 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7743 strcpy (name
, type_name
);
7744 strcpy (name
+ len
, suffix
);
7746 return ada_find_parallel_type_with_name (type
, name
);
7749 /* If TYPE is a variable-size record type, return the corresponding template
7750 type describing its fields. Otherwise, return NULL. */
7752 static struct type
*
7753 dynamic_template_type (struct type
*type
)
7755 type
= ada_check_typedef (type
);
7757 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7758 || ada_type_name (type
) == NULL
)
7762 int len
= strlen (ada_type_name (type
));
7764 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7767 return ada_find_parallel_type (type
, "___XVE");
7771 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7772 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7775 is_dynamic_field (struct type
*templ_type
, int field_num
)
7777 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7780 && templ_type
->field (field_num
).type ()->code () == TYPE_CODE_PTR
7781 && strstr (name
, "___XVL") != NULL
;
7784 /* The index of the variant field of TYPE, or -1 if TYPE does not
7785 represent a variant record type. */
7788 variant_field_index (struct type
*type
)
7792 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
7795 for (f
= 0; f
< type
->num_fields (); f
+= 1)
7797 if (ada_is_variant_part (type
, f
))
7803 /* A record type with no fields. */
7805 static struct type
*
7806 empty_record (struct type
*templ
)
7808 struct type
*type
= alloc_type_copy (templ
);
7810 type
->set_code (TYPE_CODE_STRUCT
);
7811 INIT_NONE_SPECIFIC (type
);
7812 type
->set_name ("<empty>");
7813 TYPE_LENGTH (type
) = 0;
7817 /* An ordinary record type (with fixed-length fields) that describes
7818 the value of type TYPE at VALADDR or ADDRESS (see comments at
7819 the beginning of this section) VAL according to GNAT conventions.
7820 DVAL0 should describe the (portion of a) record that contains any
7821 necessary discriminants. It should be NULL if value_type (VAL) is
7822 an outer-level type (i.e., as opposed to a branch of a variant.) A
7823 variant field (unless unchecked) is replaced by a particular branch
7826 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7827 length are not statically known are discarded. As a consequence,
7828 VALADDR, ADDRESS and DVAL0 are ignored.
7830 NOTE: Limitations: For now, we assume that dynamic fields and
7831 variants occupy whole numbers of bytes. However, they need not be
7835 ada_template_to_fixed_record_type_1 (struct type
*type
,
7836 const gdb_byte
*valaddr
,
7837 CORE_ADDR address
, struct value
*dval0
,
7838 int keep_dynamic_fields
)
7840 struct value
*mark
= value_mark ();
7843 int nfields
, bit_len
;
7849 /* Compute the number of fields in this record type that are going
7850 to be processed: unless keep_dynamic_fields, this includes only
7851 fields whose position and length are static will be processed. */
7852 if (keep_dynamic_fields
)
7853 nfields
= type
->num_fields ();
7857 while (nfields
< type
->num_fields ()
7858 && !ada_is_variant_part (type
, nfields
)
7859 && !is_dynamic_field (type
, nfields
))
7863 rtype
= alloc_type_copy (type
);
7864 rtype
->set_code (TYPE_CODE_STRUCT
);
7865 INIT_NONE_SPECIFIC (rtype
);
7866 rtype
->set_num_fields (nfields
);
7868 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
7869 rtype
->set_name (ada_type_name (type
));
7870 rtype
->set_is_fixed_instance (true);
7876 for (f
= 0; f
< nfields
; f
+= 1)
7878 off
= align_up (off
, field_alignment (type
, f
))
7879 + TYPE_FIELD_BITPOS (type
, f
);
7880 SET_FIELD_BITPOS (rtype
->field (f
), off
);
7881 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7883 if (ada_is_variant_part (type
, f
))
7888 else if (is_dynamic_field (type
, f
))
7890 const gdb_byte
*field_valaddr
= valaddr
;
7891 CORE_ADDR field_address
= address
;
7892 struct type
*field_type
=
7893 TYPE_TARGET_TYPE (type
->field (f
).type ());
7897 /* rtype's length is computed based on the run-time
7898 value of discriminants. If the discriminants are not
7899 initialized, the type size may be completely bogus and
7900 GDB may fail to allocate a value for it. So check the
7901 size first before creating the value. */
7902 ada_ensure_varsize_limit (rtype
);
7903 /* Using plain value_from_contents_and_address here
7904 causes problems because we will end up trying to
7905 resolve a type that is currently being
7907 dval
= value_from_contents_and_address_unresolved (rtype
,
7910 rtype
= value_type (dval
);
7915 /* If the type referenced by this field is an aligner type, we need
7916 to unwrap that aligner type, because its size might not be set.
7917 Keeping the aligner type would cause us to compute the wrong
7918 size for this field, impacting the offset of the all the fields
7919 that follow this one. */
7920 if (ada_is_aligner_type (field_type
))
7922 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7924 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7925 field_address
= cond_offset_target (field_address
, field_offset
);
7926 field_type
= ada_aligned_type (field_type
);
7929 field_valaddr
= cond_offset_host (field_valaddr
,
7930 off
/ TARGET_CHAR_BIT
);
7931 field_address
= cond_offset_target (field_address
,
7932 off
/ TARGET_CHAR_BIT
);
7934 /* Get the fixed type of the field. Note that, in this case,
7935 we do not want to get the real type out of the tag: if
7936 the current field is the parent part of a tagged record,
7937 we will get the tag of the object. Clearly wrong: the real
7938 type of the parent is not the real type of the child. We
7939 would end up in an infinite loop. */
7940 field_type
= ada_get_base_type (field_type
);
7941 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7942 field_address
, dval
, 0);
7943 /* If the field size is already larger than the maximum
7944 object size, then the record itself will necessarily
7945 be larger than the maximum object size. We need to make
7946 this check now, because the size might be so ridiculously
7947 large (due to an uninitialized variable in the inferior)
7948 that it would cause an overflow when adding it to the
7950 ada_ensure_varsize_limit (field_type
);
7952 rtype
->field (f
).set_type (field_type
);
7953 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7954 /* The multiplication can potentially overflow. But because
7955 the field length has been size-checked just above, and
7956 assuming that the maximum size is a reasonable value,
7957 an overflow should not happen in practice. So rather than
7958 adding overflow recovery code to this already complex code,
7959 we just assume that it's not going to happen. */
7961 TYPE_LENGTH (rtype
->field (f
).type ()) * TARGET_CHAR_BIT
;
7965 /* Note: If this field's type is a typedef, it is important
7966 to preserve the typedef layer.
7968 Otherwise, we might be transforming a typedef to a fat
7969 pointer (encoding a pointer to an unconstrained array),
7970 into a basic fat pointer (encoding an unconstrained
7971 array). As both types are implemented using the same
7972 structure, the typedef is the only clue which allows us
7973 to distinguish between the two options. Stripping it
7974 would prevent us from printing this field appropriately. */
7975 rtype
->field (f
).set_type (type
->field (f
).type ());
7976 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7977 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7979 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7982 struct type
*field_type
= type
->field (f
).type ();
7984 /* We need to be careful of typedefs when computing
7985 the length of our field. If this is a typedef,
7986 get the length of the target type, not the length
7988 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
7989 field_type
= ada_typedef_target_type (field_type
);
7992 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7995 if (off
+ fld_bit_len
> bit_len
)
7996 bit_len
= off
+ fld_bit_len
;
7998 TYPE_LENGTH (rtype
) =
7999 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8002 /* We handle the variant part, if any, at the end because of certain
8003 odd cases in which it is re-ordered so as NOT to be the last field of
8004 the record. This can happen in the presence of representation
8006 if (variant_field
>= 0)
8008 struct type
*branch_type
;
8010 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8014 /* Using plain value_from_contents_and_address here causes
8015 problems because we will end up trying to resolve a type
8016 that is currently being constructed. */
8017 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8019 rtype
= value_type (dval
);
8025 to_fixed_variant_branch_type
8026 (type
->field (variant_field
).type (),
8027 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8028 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8029 if (branch_type
== NULL
)
8031 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
8032 rtype
->field (f
- 1) = rtype
->field (f
);
8033 rtype
->set_num_fields (rtype
->num_fields () - 1);
8037 rtype
->field (variant_field
).set_type (branch_type
);
8038 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8040 TYPE_LENGTH (rtype
->field (variant_field
).type ()) *
8042 if (off
+ fld_bit_len
> bit_len
)
8043 bit_len
= off
+ fld_bit_len
;
8044 TYPE_LENGTH (rtype
) =
8045 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8049 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8050 should contain the alignment of that record, which should be a strictly
8051 positive value. If null or negative, then something is wrong, most
8052 probably in the debug info. In that case, we don't round up the size
8053 of the resulting type. If this record is not part of another structure,
8054 the current RTYPE length might be good enough for our purposes. */
8055 if (TYPE_LENGTH (type
) <= 0)
8058 warning (_("Invalid type size for `%s' detected: %s."),
8059 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
8061 warning (_("Invalid type size for <unnamed> detected: %s."),
8062 pulongest (TYPE_LENGTH (type
)));
8066 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
8067 TYPE_LENGTH (type
));
8070 value_free_to_mark (mark
);
8071 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8072 error (_("record type with dynamic size is larger than varsize-limit"));
8076 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8079 static struct type
*
8080 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8081 CORE_ADDR address
, struct value
*dval0
)
8083 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8087 /* An ordinary record type in which ___XVL-convention fields and
8088 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8089 static approximations, containing all possible fields. Uses
8090 no runtime values. Useless for use in values, but that's OK,
8091 since the results are used only for type determinations. Works on both
8092 structs and unions. Representation note: to save space, we memorize
8093 the result of this function in the TYPE_TARGET_TYPE of the
8096 static struct type
*
8097 template_to_static_fixed_type (struct type
*type0
)
8103 /* No need no do anything if the input type is already fixed. */
8104 if (type0
->is_fixed_instance ())
8107 /* Likewise if we already have computed the static approximation. */
8108 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8109 return TYPE_TARGET_TYPE (type0
);
8111 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8113 nfields
= type0
->num_fields ();
8115 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8116 recompute all over next time. */
8117 TYPE_TARGET_TYPE (type0
) = type
;
8119 for (f
= 0; f
< nfields
; f
+= 1)
8121 struct type
*field_type
= type0
->field (f
).type ();
8122 struct type
*new_type
;
8124 if (is_dynamic_field (type0
, f
))
8126 field_type
= ada_check_typedef (field_type
);
8127 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8130 new_type
= static_unwrap_type (field_type
);
8132 if (new_type
!= field_type
)
8134 /* Clone TYPE0 only the first time we get a new field type. */
8137 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8138 type
->set_code (type0
->code ());
8139 INIT_NONE_SPECIFIC (type
);
8140 type
->set_num_fields (nfields
);
8144 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
8145 memcpy (fields
, type0
->fields (),
8146 sizeof (struct field
) * nfields
);
8147 type
->set_fields (fields
);
8149 type
->set_name (ada_type_name (type0
));
8150 type
->set_is_fixed_instance (true);
8151 TYPE_LENGTH (type
) = 0;
8153 type
->field (f
).set_type (new_type
);
8154 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8161 /* Given an object of type TYPE whose contents are at VALADDR and
8162 whose address in memory is ADDRESS, returns a revision of TYPE,
8163 which should be a non-dynamic-sized record, in which the variant
8164 part, if any, is replaced with the appropriate branch. Looks
8165 for discriminant values in DVAL0, which can be NULL if the record
8166 contains the necessary discriminant values. */
8168 static struct type
*
8169 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8170 CORE_ADDR address
, struct value
*dval0
)
8172 struct value
*mark
= value_mark ();
8175 struct type
*branch_type
;
8176 int nfields
= type
->num_fields ();
8177 int variant_field
= variant_field_index (type
);
8179 if (variant_field
== -1)
8184 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8185 type
= value_type (dval
);
8190 rtype
= alloc_type_copy (type
);
8191 rtype
->set_code (TYPE_CODE_STRUCT
);
8192 INIT_NONE_SPECIFIC (rtype
);
8193 rtype
->set_num_fields (nfields
);
8196 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8197 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
8198 rtype
->set_fields (fields
);
8200 rtype
->set_name (ada_type_name (type
));
8201 rtype
->set_is_fixed_instance (true);
8202 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8204 branch_type
= to_fixed_variant_branch_type
8205 (type
->field (variant_field
).type (),
8206 cond_offset_host (valaddr
,
8207 TYPE_FIELD_BITPOS (type
, variant_field
)
8209 cond_offset_target (address
,
8210 TYPE_FIELD_BITPOS (type
, variant_field
)
8211 / TARGET_CHAR_BIT
), dval
);
8212 if (branch_type
== NULL
)
8216 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8217 rtype
->field (f
- 1) = rtype
->field (f
);
8218 rtype
->set_num_fields (rtype
->num_fields () - 1);
8222 rtype
->field (variant_field
).set_type (branch_type
);
8223 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8224 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8225 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8227 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (type
->field (variant_field
).type ());
8229 value_free_to_mark (mark
);
8233 /* An ordinary record type (with fixed-length fields) that describes
8234 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8235 beginning of this section]. Any necessary discriminants' values
8236 should be in DVAL, a record value; it may be NULL if the object
8237 at ADDR itself contains any necessary discriminant values.
8238 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8239 values from the record are needed. Except in the case that DVAL,
8240 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8241 unchecked) is replaced by a particular branch of the variant.
8243 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8244 is questionable and may be removed. It can arise during the
8245 processing of an unconstrained-array-of-record type where all the
8246 variant branches have exactly the same size. This is because in
8247 such cases, the compiler does not bother to use the XVS convention
8248 when encoding the record. I am currently dubious of this
8249 shortcut and suspect the compiler should be altered. FIXME. */
8251 static struct type
*
8252 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8253 CORE_ADDR address
, struct value
*dval
)
8255 struct type
*templ_type
;
8257 if (type0
->is_fixed_instance ())
8260 templ_type
= dynamic_template_type (type0
);
8262 if (templ_type
!= NULL
)
8263 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8264 else if (variant_field_index (type0
) >= 0)
8266 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8268 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8273 type0
->set_is_fixed_instance (true);
8279 /* An ordinary record type (with fixed-length fields) that describes
8280 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8281 union type. Any necessary discriminants' values should be in DVAL,
8282 a record value. That is, this routine selects the appropriate
8283 branch of the union at ADDR according to the discriminant value
8284 indicated in the union's type name. Returns VAR_TYPE0 itself if
8285 it represents a variant subject to a pragma Unchecked_Union. */
8287 static struct type
*
8288 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8289 CORE_ADDR address
, struct value
*dval
)
8292 struct type
*templ_type
;
8293 struct type
*var_type
;
8295 if (var_type0
->code () == TYPE_CODE_PTR
)
8296 var_type
= TYPE_TARGET_TYPE (var_type0
);
8298 var_type
= var_type0
;
8300 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8302 if (templ_type
!= NULL
)
8303 var_type
= templ_type
;
8305 if (is_unchecked_variant (var_type
, value_type (dval
)))
8307 which
= ada_which_variant_applies (var_type
, dval
);
8310 return empty_record (var_type
);
8311 else if (is_dynamic_field (var_type
, which
))
8312 return to_fixed_record_type
8313 (TYPE_TARGET_TYPE (var_type
->field (which
).type ()),
8314 valaddr
, address
, dval
);
8315 else if (variant_field_index (var_type
->field (which
).type ()) >= 0)
8317 to_fixed_record_type
8318 (var_type
->field (which
).type (), valaddr
, address
, dval
);
8320 return var_type
->field (which
).type ();
8323 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8324 ENCODING_TYPE, a type following the GNAT conventions for discrete
8325 type encodings, only carries redundant information. */
8328 ada_is_redundant_range_encoding (struct type
*range_type
,
8329 struct type
*encoding_type
)
8331 const char *bounds_str
;
8335 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8337 if (get_base_type (range_type
)->code ()
8338 != get_base_type (encoding_type
)->code ())
8340 /* The compiler probably used a simple base type to describe
8341 the range type instead of the range's actual base type,
8342 expecting us to get the real base type from the encoding
8343 anyway. In this situation, the encoding cannot be ignored
8348 if (is_dynamic_type (range_type
))
8351 if (encoding_type
->name () == NULL
)
8354 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8355 if (bounds_str
== NULL
)
8358 n
= 8; /* Skip "___XDLU_". */
8359 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8361 if (range_type
->bounds ()->low
.const_val () != lo
)
8364 n
+= 2; /* Skip the "__" separator between the two bounds. */
8365 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8367 if (range_type
->bounds ()->high
.const_val () != hi
)
8373 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8374 a type following the GNAT encoding for describing array type
8375 indices, only carries redundant information. */
8378 ada_is_redundant_index_type_desc (struct type
*array_type
,
8379 struct type
*desc_type
)
8381 struct type
*this_layer
= check_typedef (array_type
);
8384 for (i
= 0; i
< desc_type
->num_fields (); i
++)
8386 if (!ada_is_redundant_range_encoding (this_layer
->index_type (),
8387 desc_type
->field (i
).type ()))
8389 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8395 /* Assuming that TYPE0 is an array type describing the type of a value
8396 at ADDR, and that DVAL describes a record containing any
8397 discriminants used in TYPE0, returns a type for the value that
8398 contains no dynamic components (that is, no components whose sizes
8399 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8400 true, gives an error message if the resulting type's size is over
8403 static struct type
*
8404 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8407 struct type
*index_type_desc
;
8408 struct type
*result
;
8409 int constrained_packed_array_p
;
8410 static const char *xa_suffix
= "___XA";
8412 type0
= ada_check_typedef (type0
);
8413 if (type0
->is_fixed_instance ())
8416 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8417 if (constrained_packed_array_p
)
8419 type0
= decode_constrained_packed_array_type (type0
);
8420 if (type0
== nullptr)
8421 error (_("could not decode constrained packed array type"));
8424 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8426 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8427 encoding suffixed with 'P' may still be generated. If so,
8428 it should be used to find the XA type. */
8430 if (index_type_desc
== NULL
)
8432 const char *type_name
= ada_type_name (type0
);
8434 if (type_name
!= NULL
)
8436 const int len
= strlen (type_name
);
8437 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8439 if (type_name
[len
- 1] == 'P')
8441 strcpy (name
, type_name
);
8442 strcpy (name
+ len
- 1, xa_suffix
);
8443 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8448 ada_fixup_array_indexes_type (index_type_desc
);
8449 if (index_type_desc
!= NULL
8450 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8452 /* Ignore this ___XA parallel type, as it does not bring any
8453 useful information. This allows us to avoid creating fixed
8454 versions of the array's index types, which would be identical
8455 to the original ones. This, in turn, can also help avoid
8456 the creation of fixed versions of the array itself. */
8457 index_type_desc
= NULL
;
8460 if (index_type_desc
== NULL
)
8462 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8464 /* NOTE: elt_type---the fixed version of elt_type0---should never
8465 depend on the contents of the array in properly constructed
8467 /* Create a fixed version of the array element type.
8468 We're not providing the address of an element here,
8469 and thus the actual object value cannot be inspected to do
8470 the conversion. This should not be a problem, since arrays of
8471 unconstrained objects are not allowed. In particular, all
8472 the elements of an array of a tagged type should all be of
8473 the same type specified in the debugging info. No need to
8474 consult the object tag. */
8475 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8477 /* Make sure we always create a new array type when dealing with
8478 packed array types, since we're going to fix-up the array
8479 type length and element bitsize a little further down. */
8480 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8483 result
= create_array_type (alloc_type_copy (type0
),
8484 elt_type
, type0
->index_type ());
8489 struct type
*elt_type0
;
8492 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8493 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8495 /* NOTE: result---the fixed version of elt_type0---should never
8496 depend on the contents of the array in properly constructed
8498 /* Create a fixed version of the array element type.
8499 We're not providing the address of an element here,
8500 and thus the actual object value cannot be inspected to do
8501 the conversion. This should not be a problem, since arrays of
8502 unconstrained objects are not allowed. In particular, all
8503 the elements of an array of a tagged type should all be of
8504 the same type specified in the debugging info. No need to
8505 consult the object tag. */
8507 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8510 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8512 struct type
*range_type
=
8513 to_fixed_range_type (index_type_desc
->field (i
).type (), dval
);
8515 result
= create_array_type (alloc_type_copy (elt_type0
),
8516 result
, range_type
);
8517 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8519 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8520 error (_("array type with dynamic size is larger than varsize-limit"));
8523 /* We want to preserve the type name. This can be useful when
8524 trying to get the type name of a value that has already been
8525 printed (for instance, if the user did "print VAR; whatis $". */
8526 result
->set_name (type0
->name ());
8528 if (constrained_packed_array_p
)
8530 /* So far, the resulting type has been created as if the original
8531 type was a regular (non-packed) array type. As a result, the
8532 bitsize of the array elements needs to be set again, and the array
8533 length needs to be recomputed based on that bitsize. */
8534 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8535 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8537 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8538 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8539 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8540 TYPE_LENGTH (result
)++;
8543 result
->set_is_fixed_instance (true);
8548 /* A standard type (containing no dynamically sized components)
8549 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8550 DVAL describes a record containing any discriminants used in TYPE0,
8551 and may be NULL if there are none, or if the object of type TYPE at
8552 ADDRESS or in VALADDR contains these discriminants.
8554 If CHECK_TAG is not null, in the case of tagged types, this function
8555 attempts to locate the object's tag and use it to compute the actual
8556 type. However, when ADDRESS is null, we cannot use it to determine the
8557 location of the tag, and therefore compute the tagged type's actual type.
8558 So we return the tagged type without consulting the tag. */
8560 static struct type
*
8561 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8562 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8564 type
= ada_check_typedef (type
);
8566 /* Only un-fixed types need to be handled here. */
8567 if (!HAVE_GNAT_AUX_INFO (type
))
8570 switch (type
->code ())
8574 case TYPE_CODE_STRUCT
:
8576 struct type
*static_type
= to_static_fixed_type (type
);
8577 struct type
*fixed_record_type
=
8578 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8580 /* If STATIC_TYPE is a tagged type and we know the object's address,
8581 then we can determine its tag, and compute the object's actual
8582 type from there. Note that we have to use the fixed record
8583 type (the parent part of the record may have dynamic fields
8584 and the way the location of _tag is expressed may depend on
8587 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8590 value_tag_from_contents_and_address
8594 struct type
*real_type
= type_from_tag (tag
);
8596 value_from_contents_and_address (fixed_record_type
,
8599 fixed_record_type
= value_type (obj
);
8600 if (real_type
!= NULL
)
8601 return to_fixed_record_type
8603 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8606 /* Check to see if there is a parallel ___XVZ variable.
8607 If there is, then it provides the actual size of our type. */
8608 else if (ada_type_name (fixed_record_type
) != NULL
)
8610 const char *name
= ada_type_name (fixed_record_type
);
8612 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8613 bool xvz_found
= false;
8616 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8619 xvz_found
= get_int_var_value (xvz_name
, size
);
8621 catch (const gdb_exception_error
&except
)
8623 /* We found the variable, but somehow failed to read
8624 its value. Rethrow the same error, but with a little
8625 bit more information, to help the user understand
8626 what went wrong (Eg: the variable might have been
8628 throw_error (except
.error
,
8629 _("unable to read value of %s (%s)"),
8630 xvz_name
, except
.what ());
8633 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8635 fixed_record_type
= copy_type (fixed_record_type
);
8636 TYPE_LENGTH (fixed_record_type
) = size
;
8638 /* The FIXED_RECORD_TYPE may have be a stub. We have
8639 observed this when the debugging info is STABS, and
8640 apparently it is something that is hard to fix.
8642 In practice, we don't need the actual type definition
8643 at all, because the presence of the XVZ variable allows us
8644 to assume that there must be a XVS type as well, which we
8645 should be able to use later, when we need the actual type
8648 In the meantime, pretend that the "fixed" type we are
8649 returning is NOT a stub, because this can cause trouble
8650 when using this type to create new types targeting it.
8651 Indeed, the associated creation routines often check
8652 whether the target type is a stub and will try to replace
8653 it, thus using a type with the wrong size. This, in turn,
8654 might cause the new type to have the wrong size too.
8655 Consider the case of an array, for instance, where the size
8656 of the array is computed from the number of elements in
8657 our array multiplied by the size of its element. */
8658 fixed_record_type
->set_is_stub (false);
8661 return fixed_record_type
;
8663 case TYPE_CODE_ARRAY
:
8664 return to_fixed_array_type (type
, dval
, 1);
8665 case TYPE_CODE_UNION
:
8669 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8673 /* The same as ada_to_fixed_type_1, except that it preserves the type
8674 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8676 The typedef layer needs be preserved in order to differentiate between
8677 arrays and array pointers when both types are implemented using the same
8678 fat pointer. In the array pointer case, the pointer is encoded as
8679 a typedef of the pointer type. For instance, considering:
8681 type String_Access is access String;
8682 S1 : String_Access := null;
8684 To the debugger, S1 is defined as a typedef of type String. But
8685 to the user, it is a pointer. So if the user tries to print S1,
8686 we should not dereference the array, but print the array address
8689 If we didn't preserve the typedef layer, we would lose the fact that
8690 the type is to be presented as a pointer (needs de-reference before
8691 being printed). And we would also use the source-level type name. */
8694 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8695 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8698 struct type
*fixed_type
=
8699 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8701 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8702 then preserve the typedef layer.
8704 Implementation note: We can only check the main-type portion of
8705 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8706 from TYPE now returns a type that has the same instance flags
8707 as TYPE. For instance, if TYPE is a "typedef const", and its
8708 target type is a "struct", then the typedef elimination will return
8709 a "const" version of the target type. See check_typedef for more
8710 details about how the typedef layer elimination is done.
8712 brobecker/2010-11-19: It seems to me that the only case where it is
8713 useful to preserve the typedef layer is when dealing with fat pointers.
8714 Perhaps, we could add a check for that and preserve the typedef layer
8715 only in that situation. But this seems unnecessary so far, probably
8716 because we call check_typedef/ada_check_typedef pretty much everywhere.
8718 if (type
->code () == TYPE_CODE_TYPEDEF
8719 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8720 == TYPE_MAIN_TYPE (fixed_type
)))
8726 /* A standard (static-sized) type corresponding as well as possible to
8727 TYPE0, but based on no runtime data. */
8729 static struct type
*
8730 to_static_fixed_type (struct type
*type0
)
8737 if (type0
->is_fixed_instance ())
8740 type0
= ada_check_typedef (type0
);
8742 switch (type0
->code ())
8746 case TYPE_CODE_STRUCT
:
8747 type
= dynamic_template_type (type0
);
8749 return template_to_static_fixed_type (type
);
8751 return template_to_static_fixed_type (type0
);
8752 case TYPE_CODE_UNION
:
8753 type
= ada_find_parallel_type (type0
, "___XVU");
8755 return template_to_static_fixed_type (type
);
8757 return template_to_static_fixed_type (type0
);
8761 /* A static approximation of TYPE with all type wrappers removed. */
8763 static struct type
*
8764 static_unwrap_type (struct type
*type
)
8766 if (ada_is_aligner_type (type
))
8768 struct type
*type1
= ada_check_typedef (type
)->field (0).type ();
8769 if (ada_type_name (type1
) == NULL
)
8770 type1
->set_name (ada_type_name (type
));
8772 return static_unwrap_type (type1
);
8776 struct type
*raw_real_type
= ada_get_base_type (type
);
8778 if (raw_real_type
== type
)
8781 return to_static_fixed_type (raw_real_type
);
8785 /* In some cases, incomplete and private types require
8786 cross-references that are not resolved as records (for example,
8788 type FooP is access Foo;
8790 type Foo is array ...;
8791 ). In these cases, since there is no mechanism for producing
8792 cross-references to such types, we instead substitute for FooP a
8793 stub enumeration type that is nowhere resolved, and whose tag is
8794 the name of the actual type. Call these types "non-record stubs". */
8796 /* A type equivalent to TYPE that is not a non-record stub, if one
8797 exists, otherwise TYPE. */
8800 ada_check_typedef (struct type
*type
)
8805 /* If our type is an access to an unconstrained array, which is encoded
8806 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
8807 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8808 what allows us to distinguish between fat pointers that represent
8809 array types, and fat pointers that represent array access types
8810 (in both cases, the compiler implements them as fat pointers). */
8811 if (ada_is_access_to_unconstrained_array (type
))
8814 type
= check_typedef (type
);
8815 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
8816 || !type
->is_stub ()
8817 || type
->name () == NULL
)
8821 const char *name
= type
->name ();
8822 struct type
*type1
= ada_find_any_type (name
);
8827 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8828 stubs pointing to arrays, as we don't create symbols for array
8829 types, only for the typedef-to-array types). If that's the case,
8830 strip the typedef layer. */
8831 if (type1
->code () == TYPE_CODE_TYPEDEF
)
8832 type1
= ada_check_typedef (type1
);
8838 /* A value representing the data at VALADDR/ADDRESS as described by
8839 type TYPE0, but with a standard (static-sized) type that correctly
8840 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8841 type, then return VAL0 [this feature is simply to avoid redundant
8842 creation of struct values]. */
8844 static struct value
*
8845 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8848 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8850 if (type
== type0
&& val0
!= NULL
)
8853 if (VALUE_LVAL (val0
) != lval_memory
)
8855 /* Our value does not live in memory; it could be a convenience
8856 variable, for instance. Create a not_lval value using val0's
8858 return value_from_contents (type
, value_contents (val0
));
8861 return value_from_contents_and_address (type
, 0, address
);
8864 /* A value representing VAL, but with a standard (static-sized) type
8865 that correctly describes it. Does not necessarily create a new
8869 ada_to_fixed_value (struct value
*val
)
8871 val
= unwrap_value (val
);
8872 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
8879 /* Table mapping attribute numbers to names.
8880 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8882 static const char * const attribute_names
[] = {
8900 ada_attribute_name (enum exp_opcode n
)
8902 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8903 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8905 return attribute_names
[0];
8908 /* Evaluate the 'POS attribute applied to ARG. */
8911 pos_atr (struct value
*arg
)
8913 struct value
*val
= coerce_ref (arg
);
8914 struct type
*type
= value_type (val
);
8917 if (!discrete_type_p (type
))
8918 error (_("'POS only defined on discrete types"));
8920 if (!discrete_position (type
, value_as_long (val
), &result
))
8921 error (_("enumeration value is invalid: can't find 'POS"));
8926 static struct value
*
8927 value_pos_atr (struct type
*type
, struct value
*arg
)
8929 return value_from_longest (type
, pos_atr (arg
));
8932 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8934 static struct value
*
8935 val_atr (struct type
*type
, LONGEST val
)
8937 gdb_assert (discrete_type_p (type
));
8938 if (type
->code () == TYPE_CODE_RANGE
)
8939 type
= TYPE_TARGET_TYPE (type
);
8940 if (type
->code () == TYPE_CODE_ENUM
)
8942 if (val
< 0 || val
>= type
->num_fields ())
8943 error (_("argument to 'VAL out of range"));
8944 val
= TYPE_FIELD_ENUMVAL (type
, val
);
8946 return value_from_longest (type
, val
);
8949 static struct value
*
8950 value_val_atr (struct type
*type
, struct value
*arg
)
8952 if (!discrete_type_p (type
))
8953 error (_("'VAL only defined on discrete types"));
8954 if (!integer_type_p (value_type (arg
)))
8955 error (_("'VAL requires integral argument"));
8957 return val_atr (type
, value_as_long (arg
));
8963 /* True if TYPE appears to be an Ada character type.
8964 [At the moment, this is true only for Character and Wide_Character;
8965 It is a heuristic test that could stand improvement]. */
8968 ada_is_character_type (struct type
*type
)
8972 /* If the type code says it's a character, then assume it really is,
8973 and don't check any further. */
8974 if (type
->code () == TYPE_CODE_CHAR
)
8977 /* Otherwise, assume it's a character type iff it is a discrete type
8978 with a known character type name. */
8979 name
= ada_type_name (type
);
8980 return (name
!= NULL
8981 && (type
->code () == TYPE_CODE_INT
8982 || type
->code () == TYPE_CODE_RANGE
)
8983 && (strcmp (name
, "character") == 0
8984 || strcmp (name
, "wide_character") == 0
8985 || strcmp (name
, "wide_wide_character") == 0
8986 || strcmp (name
, "unsigned char") == 0));
8989 /* True if TYPE appears to be an Ada string type. */
8992 ada_is_string_type (struct type
*type
)
8994 type
= ada_check_typedef (type
);
8996 && type
->code () != TYPE_CODE_PTR
8997 && (ada_is_simple_array_type (type
)
8998 || ada_is_array_descriptor_type (type
))
8999 && ada_array_arity (type
) == 1)
9001 struct type
*elttype
= ada_array_element_type (type
, 1);
9003 return ada_is_character_type (elttype
);
9009 /* The compiler sometimes provides a parallel XVS type for a given
9010 PAD type. Normally, it is safe to follow the PAD type directly,
9011 but older versions of the compiler have a bug that causes the offset
9012 of its "F" field to be wrong. Following that field in that case
9013 would lead to incorrect results, but this can be worked around
9014 by ignoring the PAD type and using the associated XVS type instead.
9016 Set to True if the debugger should trust the contents of PAD types.
9017 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9018 static bool trust_pad_over_xvs
= true;
9020 /* True if TYPE is a struct type introduced by the compiler to force the
9021 alignment of a value. Such types have a single field with a
9022 distinctive name. */
9025 ada_is_aligner_type (struct type
*type
)
9027 type
= ada_check_typedef (type
);
9029 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9032 return (type
->code () == TYPE_CODE_STRUCT
9033 && type
->num_fields () == 1
9034 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9037 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9038 the parallel type. */
9041 ada_get_base_type (struct type
*raw_type
)
9043 struct type
*real_type_namer
;
9044 struct type
*raw_real_type
;
9046 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
9049 if (ada_is_aligner_type (raw_type
))
9050 /* The encoding specifies that we should always use the aligner type.
9051 So, even if this aligner type has an associated XVS type, we should
9054 According to the compiler gurus, an XVS type parallel to an aligner
9055 type may exist because of a stabs limitation. In stabs, aligner
9056 types are empty because the field has a variable-sized type, and
9057 thus cannot actually be used as an aligner type. As a result,
9058 we need the associated parallel XVS type to decode the type.
9059 Since the policy in the compiler is to not change the internal
9060 representation based on the debugging info format, we sometimes
9061 end up having a redundant XVS type parallel to the aligner type. */
9064 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9065 if (real_type_namer
== NULL
9066 || real_type_namer
->code () != TYPE_CODE_STRUCT
9067 || real_type_namer
->num_fields () != 1)
9070 if (real_type_namer
->field (0).type ()->code () != TYPE_CODE_REF
)
9072 /* This is an older encoding form where the base type needs to be
9073 looked up by name. We prefer the newer encoding because it is
9075 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9076 if (raw_real_type
== NULL
)
9079 return raw_real_type
;
9082 /* The field in our XVS type is a reference to the base type. */
9083 return TYPE_TARGET_TYPE (real_type_namer
->field (0).type ());
9086 /* The type of value designated by TYPE, with all aligners removed. */
9089 ada_aligned_type (struct type
*type
)
9091 if (ada_is_aligner_type (type
))
9092 return ada_aligned_type (type
->field (0).type ());
9094 return ada_get_base_type (type
);
9098 /* The address of the aligned value in an object at address VALADDR
9099 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9102 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9104 if (ada_is_aligner_type (type
))
9105 return ada_aligned_value_addr (type
->field (0).type (),
9107 TYPE_FIELD_BITPOS (type
,
9108 0) / TARGET_CHAR_BIT
);
9115 /* The printed representation of an enumeration literal with encoded
9116 name NAME. The value is good to the next call of ada_enum_name. */
9118 ada_enum_name (const char *name
)
9120 static char *result
;
9121 static size_t result_len
= 0;
9124 /* First, unqualify the enumeration name:
9125 1. Search for the last '.' character. If we find one, then skip
9126 all the preceding characters, the unqualified name starts
9127 right after that dot.
9128 2. Otherwise, we may be debugging on a target where the compiler
9129 translates dots into "__". Search forward for double underscores,
9130 but stop searching when we hit an overloading suffix, which is
9131 of the form "__" followed by digits. */
9133 tmp
= strrchr (name
, '.');
9138 while ((tmp
= strstr (name
, "__")) != NULL
)
9140 if (isdigit (tmp
[2]))
9151 if (name
[1] == 'U' || name
[1] == 'W')
9153 if (sscanf (name
+ 2, "%x", &v
) != 1)
9156 else if (((name
[1] >= '0' && name
[1] <= '9')
9157 || (name
[1] >= 'a' && name
[1] <= 'z'))
9160 GROW_VECT (result
, result_len
, 4);
9161 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9167 GROW_VECT (result
, result_len
, 16);
9168 if (isascii (v
) && isprint (v
))
9169 xsnprintf (result
, result_len
, "'%c'", v
);
9170 else if (name
[1] == 'U')
9171 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9173 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9179 tmp
= strstr (name
, "__");
9181 tmp
= strstr (name
, "$");
9184 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9185 strncpy (result
, name
, tmp
- name
);
9186 result
[tmp
- name
] = '\0';
9194 /* Evaluate the subexpression of EXP starting at *POS as for
9195 evaluate_type, updating *POS to point just past the evaluated
9198 static struct value
*
9199 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9201 return evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9204 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9207 static struct value
*
9208 unwrap_value (struct value
*val
)
9210 struct type
*type
= ada_check_typedef (value_type (val
));
9212 if (ada_is_aligner_type (type
))
9214 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9215 struct type
*val_type
= ada_check_typedef (value_type (v
));
9217 if (ada_type_name (val_type
) == NULL
)
9218 val_type
->set_name (ada_type_name (type
));
9220 return unwrap_value (v
);
9224 struct type
*raw_real_type
=
9225 ada_check_typedef (ada_get_base_type (type
));
9227 /* If there is no parallel XVS or XVE type, then the value is
9228 already unwrapped. Return it without further modification. */
9229 if ((type
== raw_real_type
)
9230 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9234 coerce_unspec_val_to_type
9235 (val
, ada_to_fixed_type (raw_real_type
, 0,
9236 value_address (val
),
9241 static struct value
*
9242 cast_from_gnat_encoded_fixed_point_type (struct type
*type
, struct value
*arg
)
9245 = gnat_encoded_fixed_point_scaling_factor (value_type (arg
));
9246 arg
= value_cast (value_type (scale
), arg
);
9248 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9249 return value_cast (type
, arg
);
9252 static struct value
*
9253 cast_to_gnat_encoded_fixed_point_type (struct type
*type
, struct value
*arg
)
9255 if (type
== value_type (arg
))
9258 struct value
*scale
= gnat_encoded_fixed_point_scaling_factor (type
);
9259 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg
)))
9260 arg
= cast_from_gnat_encoded_fixed_point_type (value_type (scale
), arg
);
9262 arg
= value_cast (value_type (scale
), arg
);
9264 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9265 return value_cast (type
, arg
);
9268 /* Given two array types T1 and T2, return nonzero iff both arrays
9269 contain the same number of elements. */
9272 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9274 LONGEST lo1
, hi1
, lo2
, hi2
;
9276 /* Get the array bounds in order to verify that the size of
9277 the two arrays match. */
9278 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9279 || !get_array_bounds (t2
, &lo2
, &hi2
))
9280 error (_("unable to determine array bounds"));
9282 /* To make things easier for size comparison, normalize a bit
9283 the case of empty arrays by making sure that the difference
9284 between upper bound and lower bound is always -1. */
9290 return (hi1
- lo1
== hi2
- lo2
);
9293 /* Assuming that VAL is an array of integrals, and TYPE represents
9294 an array with the same number of elements, but with wider integral
9295 elements, return an array "casted" to TYPE. In practice, this
9296 means that the returned array is built by casting each element
9297 of the original array into TYPE's (wider) element type. */
9299 static struct value
*
9300 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9302 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9307 /* Verify that both val and type are arrays of scalars, and
9308 that the size of val's elements is smaller than the size
9309 of type's element. */
9310 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9311 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9312 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9313 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9314 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9315 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9317 if (!get_array_bounds (type
, &lo
, &hi
))
9318 error (_("unable to determine array bounds"));
9320 res
= allocate_value (type
);
9322 /* Promote each array element. */
9323 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9325 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9327 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9328 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9334 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9335 return the converted value. */
9337 static struct value
*
9338 coerce_for_assign (struct type
*type
, struct value
*val
)
9340 struct type
*type2
= value_type (val
);
9345 type2
= ada_check_typedef (type2
);
9346 type
= ada_check_typedef (type
);
9348 if (type2
->code () == TYPE_CODE_PTR
9349 && type
->code () == TYPE_CODE_ARRAY
)
9351 val
= ada_value_ind (val
);
9352 type2
= value_type (val
);
9355 if (type2
->code () == TYPE_CODE_ARRAY
9356 && type
->code () == TYPE_CODE_ARRAY
)
9358 if (!ada_same_array_size_p (type
, type2
))
9359 error (_("cannot assign arrays of different length"));
9361 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9362 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9363 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9364 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9366 /* Allow implicit promotion of the array elements to
9368 return ada_promote_array_of_integrals (type
, val
);
9371 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9372 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9373 error (_("Incompatible types in assignment"));
9374 deprecated_set_value_type (val
, type
);
9379 static struct value
*
9380 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9383 struct type
*type1
, *type2
;
9386 arg1
= coerce_ref (arg1
);
9387 arg2
= coerce_ref (arg2
);
9388 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9389 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9391 if (type1
->code () != TYPE_CODE_INT
9392 || type2
->code () != TYPE_CODE_INT
)
9393 return value_binop (arg1
, arg2
, op
);
9402 return value_binop (arg1
, arg2
, op
);
9405 v2
= value_as_long (arg2
);
9407 error (_("second operand of %s must not be zero."), op_string (op
));
9409 if (type1
->is_unsigned () || op
== BINOP_MOD
)
9410 return value_binop (arg1
, arg2
, op
);
9412 v1
= value_as_long (arg1
);
9417 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9418 v
+= v
> 0 ? -1 : 1;
9426 /* Should not reach this point. */
9430 val
= allocate_value (type1
);
9431 store_unsigned_integer (value_contents_raw (val
),
9432 TYPE_LENGTH (value_type (val
)),
9433 type_byte_order (type1
), v
);
9438 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9440 if (ada_is_direct_array_type (value_type (arg1
))
9441 || ada_is_direct_array_type (value_type (arg2
)))
9443 struct type
*arg1_type
, *arg2_type
;
9445 /* Automatically dereference any array reference before
9446 we attempt to perform the comparison. */
9447 arg1
= ada_coerce_ref (arg1
);
9448 arg2
= ada_coerce_ref (arg2
);
9450 arg1
= ada_coerce_to_simple_array (arg1
);
9451 arg2
= ada_coerce_to_simple_array (arg2
);
9453 arg1_type
= ada_check_typedef (value_type (arg1
));
9454 arg2_type
= ada_check_typedef (value_type (arg2
));
9456 if (arg1_type
->code () != TYPE_CODE_ARRAY
9457 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9458 error (_("Attempt to compare array with non-array"));
9459 /* FIXME: The following works only for types whose
9460 representations use all bits (no padding or undefined bits)
9461 and do not have user-defined equality. */
9462 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9463 && memcmp (value_contents (arg1
), value_contents (arg2
),
9464 TYPE_LENGTH (arg1_type
)) == 0);
9466 return value_equal (arg1
, arg2
);
9469 /* Total number of component associations in the aggregate starting at
9470 index PC in EXP. Assumes that index PC is the start of an
9474 num_component_specs (struct expression
*exp
, int pc
)
9478 m
= exp
->elts
[pc
+ 1].longconst
;
9481 for (i
= 0; i
< m
; i
+= 1)
9483 switch (exp
->elts
[pc
].opcode
)
9489 n
+= exp
->elts
[pc
+ 1].longconst
;
9492 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9497 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9498 component of LHS (a simple array or a record), updating *POS past
9499 the expression, assuming that LHS is contained in CONTAINER. Does
9500 not modify the inferior's memory, nor does it modify LHS (unless
9501 LHS == CONTAINER). */
9504 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9505 struct expression
*exp
, int *pos
)
9507 struct value
*mark
= value_mark ();
9509 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9511 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9513 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9514 struct value
*index_val
= value_from_longest (index_type
, index
);
9516 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9520 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9521 elt
= ada_to_fixed_value (elt
);
9524 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9525 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9527 value_assign_to_component (container
, elt
,
9528 ada_evaluate_subexp (NULL
, exp
, pos
,
9531 value_free_to_mark (mark
);
9534 /* Assuming that LHS represents an lvalue having a record or array
9535 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9536 of that aggregate's value to LHS, advancing *POS past the
9537 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9538 lvalue containing LHS (possibly LHS itself). Does not modify
9539 the inferior's memory, nor does it modify the contents of
9540 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9542 static struct value
*
9543 assign_aggregate (struct value
*container
,
9544 struct value
*lhs
, struct expression
*exp
,
9545 int *pos
, enum noside noside
)
9547 struct type
*lhs_type
;
9548 int n
= exp
->elts
[*pos
+1].longconst
;
9549 LONGEST low_index
, high_index
;
9552 int max_indices
, num_indices
;
9556 if (noside
!= EVAL_NORMAL
)
9558 for (i
= 0; i
< n
; i
+= 1)
9559 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9563 container
= ada_coerce_ref (container
);
9564 if (ada_is_direct_array_type (value_type (container
)))
9565 container
= ada_coerce_to_simple_array (container
);
9566 lhs
= ada_coerce_ref (lhs
);
9567 if (!deprecated_value_modifiable (lhs
))
9568 error (_("Left operand of assignment is not a modifiable lvalue."));
9570 lhs_type
= check_typedef (value_type (lhs
));
9571 if (ada_is_direct_array_type (lhs_type
))
9573 lhs
= ada_coerce_to_simple_array (lhs
);
9574 lhs_type
= check_typedef (value_type (lhs
));
9575 low_index
= lhs_type
->bounds ()->low
.const_val ();
9576 high_index
= lhs_type
->bounds ()->high
.const_val ();
9578 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9581 high_index
= num_visible_fields (lhs_type
) - 1;
9584 error (_("Left-hand side must be array or record."));
9586 num_specs
= num_component_specs (exp
, *pos
- 3);
9587 max_indices
= 4 * num_specs
+ 4;
9588 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9589 indices
[0] = indices
[1] = low_index
- 1;
9590 indices
[2] = indices
[3] = high_index
+ 1;
9593 for (i
= 0; i
< n
; i
+= 1)
9595 switch (exp
->elts
[*pos
].opcode
)
9598 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9599 &num_indices
, max_indices
,
9600 low_index
, high_index
);
9603 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9604 &num_indices
, max_indices
,
9605 low_index
, high_index
);
9609 error (_("Misplaced 'others' clause"));
9610 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9611 num_indices
, low_index
, high_index
);
9614 error (_("Internal error: bad aggregate clause"));
9621 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9622 construct at *POS, updating *POS past the construct, given that
9623 the positions are relative to lower bound LOW, where HIGH is the
9624 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9625 updating *NUM_INDICES as needed. CONTAINER is as for
9626 assign_aggregate. */
9628 aggregate_assign_positional (struct value
*container
,
9629 struct value
*lhs
, struct expression
*exp
,
9630 int *pos
, LONGEST
*indices
, int *num_indices
,
9631 int max_indices
, LONGEST low
, LONGEST high
)
9633 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9635 if (ind
- 1 == high
)
9636 warning (_("Extra components in aggregate ignored."));
9639 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9641 assign_component (container
, lhs
, ind
, exp
, pos
);
9644 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9647 /* Assign into the components of LHS indexed by the OP_CHOICES
9648 construct at *POS, updating *POS past the construct, given that
9649 the allowable indices are LOW..HIGH. Record the indices assigned
9650 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9651 needed. CONTAINER is as for assign_aggregate. */
9653 aggregate_assign_from_choices (struct value
*container
,
9654 struct value
*lhs
, struct expression
*exp
,
9655 int *pos
, LONGEST
*indices
, int *num_indices
,
9656 int max_indices
, LONGEST low
, LONGEST high
)
9659 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9660 int choice_pos
, expr_pc
;
9661 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9663 choice_pos
= *pos
+= 3;
9665 for (j
= 0; j
< n_choices
; j
+= 1)
9666 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9668 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9670 for (j
= 0; j
< n_choices
; j
+= 1)
9672 LONGEST lower
, upper
;
9673 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9675 if (op
== OP_DISCRETE_RANGE
)
9678 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9680 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9685 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9697 name
= &exp
->elts
[choice_pos
+ 2].string
;
9700 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9703 error (_("Invalid record component association."));
9705 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9707 if (! find_struct_field (name
, value_type (lhs
), 0,
9708 NULL
, NULL
, NULL
, NULL
, &ind
))
9709 error (_("Unknown component name: %s."), name
);
9710 lower
= upper
= ind
;
9713 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9714 error (_("Index in component association out of bounds."));
9716 add_component_interval (lower
, upper
, indices
, num_indices
,
9718 while (lower
<= upper
)
9723 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9729 /* Assign the value of the expression in the OP_OTHERS construct in
9730 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9731 have not been previously assigned. The index intervals already assigned
9732 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9733 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9735 aggregate_assign_others (struct value
*container
,
9736 struct value
*lhs
, struct expression
*exp
,
9737 int *pos
, LONGEST
*indices
, int num_indices
,
9738 LONGEST low
, LONGEST high
)
9741 int expr_pc
= *pos
+ 1;
9743 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9747 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9752 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9755 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9758 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9759 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9760 modifying *SIZE as needed. It is an error if *SIZE exceeds
9761 MAX_SIZE. The resulting intervals do not overlap. */
9763 add_component_interval (LONGEST low
, LONGEST high
,
9764 LONGEST
* indices
, int *size
, int max_size
)
9768 for (i
= 0; i
< *size
; i
+= 2) {
9769 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9773 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9774 if (high
< indices
[kh
])
9776 if (low
< indices
[i
])
9778 indices
[i
+ 1] = indices
[kh
- 1];
9779 if (high
> indices
[i
+ 1])
9780 indices
[i
+ 1] = high
;
9781 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9782 *size
-= kh
- i
- 2;
9785 else if (high
< indices
[i
])
9789 if (*size
== max_size
)
9790 error (_("Internal error: miscounted aggregate components."));
9792 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9793 indices
[j
] = indices
[j
- 2];
9795 indices
[i
+ 1] = high
;
9798 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9801 static struct value
*
9802 ada_value_cast (struct type
*type
, struct value
*arg2
)
9804 if (type
== ada_check_typedef (value_type (arg2
)))
9807 if (ada_is_gnat_encoded_fixed_point_type (type
))
9808 return cast_to_gnat_encoded_fixed_point_type (type
, arg2
);
9810 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
9811 return cast_from_gnat_encoded_fixed_point_type (type
, arg2
);
9813 return value_cast (type
, arg2
);
9816 /* Evaluating Ada expressions, and printing their result.
9817 ------------------------------------------------------
9822 We usually evaluate an Ada expression in order to print its value.
9823 We also evaluate an expression in order to print its type, which
9824 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9825 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9826 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9827 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9830 Evaluating expressions is a little more complicated for Ada entities
9831 than it is for entities in languages such as C. The main reason for
9832 this is that Ada provides types whose definition might be dynamic.
9833 One example of such types is variant records. Or another example
9834 would be an array whose bounds can only be known at run time.
9836 The following description is a general guide as to what should be
9837 done (and what should NOT be done) in order to evaluate an expression
9838 involving such types, and when. This does not cover how the semantic
9839 information is encoded by GNAT as this is covered separatly. For the
9840 document used as the reference for the GNAT encoding, see exp_dbug.ads
9841 in the GNAT sources.
9843 Ideally, we should embed each part of this description next to its
9844 associated code. Unfortunately, the amount of code is so vast right
9845 now that it's hard to see whether the code handling a particular
9846 situation might be duplicated or not. One day, when the code is
9847 cleaned up, this guide might become redundant with the comments
9848 inserted in the code, and we might want to remove it.
9850 2. ``Fixing'' an Entity, the Simple Case:
9851 -----------------------------------------
9853 When evaluating Ada expressions, the tricky issue is that they may
9854 reference entities whose type contents and size are not statically
9855 known. Consider for instance a variant record:
9857 type Rec (Empty : Boolean := True) is record
9860 when False => Value : Integer;
9863 Yes : Rec := (Empty => False, Value => 1);
9864 No : Rec := (empty => True);
9866 The size and contents of that record depends on the value of the
9867 descriminant (Rec.Empty). At this point, neither the debugging
9868 information nor the associated type structure in GDB are able to
9869 express such dynamic types. So what the debugger does is to create
9870 "fixed" versions of the type that applies to the specific object.
9871 We also informally refer to this operation as "fixing" an object,
9872 which means creating its associated fixed type.
9874 Example: when printing the value of variable "Yes" above, its fixed
9875 type would look like this:
9882 On the other hand, if we printed the value of "No", its fixed type
9889 Things become a little more complicated when trying to fix an entity
9890 with a dynamic type that directly contains another dynamic type,
9891 such as an array of variant records, for instance. There are
9892 two possible cases: Arrays, and records.
9894 3. ``Fixing'' Arrays:
9895 ---------------------
9897 The type structure in GDB describes an array in terms of its bounds,
9898 and the type of its elements. By design, all elements in the array
9899 have the same type and we cannot represent an array of variant elements
9900 using the current type structure in GDB. When fixing an array,
9901 we cannot fix the array element, as we would potentially need one
9902 fixed type per element of the array. As a result, the best we can do
9903 when fixing an array is to produce an array whose bounds and size
9904 are correct (allowing us to read it from memory), but without having
9905 touched its element type. Fixing each element will be done later,
9906 when (if) necessary.
9908 Arrays are a little simpler to handle than records, because the same
9909 amount of memory is allocated for each element of the array, even if
9910 the amount of space actually used by each element differs from element
9911 to element. Consider for instance the following array of type Rec:
9913 type Rec_Array is array (1 .. 2) of Rec;
9915 The actual amount of memory occupied by each element might be different
9916 from element to element, depending on the value of their discriminant.
9917 But the amount of space reserved for each element in the array remains
9918 fixed regardless. So we simply need to compute that size using
9919 the debugging information available, from which we can then determine
9920 the array size (we multiply the number of elements of the array by
9921 the size of each element).
9923 The simplest case is when we have an array of a constrained element
9924 type. For instance, consider the following type declarations:
9926 type Bounded_String (Max_Size : Integer) is
9928 Buffer : String (1 .. Max_Size);
9930 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9932 In this case, the compiler describes the array as an array of
9933 variable-size elements (identified by its XVS suffix) for which
9934 the size can be read in the parallel XVZ variable.
9936 In the case of an array of an unconstrained element type, the compiler
9937 wraps the array element inside a private PAD type. This type should not
9938 be shown to the user, and must be "unwrap"'ed before printing. Note
9939 that we also use the adjective "aligner" in our code to designate
9940 these wrapper types.
9942 In some cases, the size allocated for each element is statically
9943 known. In that case, the PAD type already has the correct size,
9944 and the array element should remain unfixed.
9946 But there are cases when this size is not statically known.
9947 For instance, assuming that "Five" is an integer variable:
9949 type Dynamic is array (1 .. Five) of Integer;
9950 type Wrapper (Has_Length : Boolean := False) is record
9953 when True => Length : Integer;
9957 type Wrapper_Array is array (1 .. 2) of Wrapper;
9959 Hello : Wrapper_Array := (others => (Has_Length => True,
9960 Data => (others => 17),
9964 The debugging info would describe variable Hello as being an
9965 array of a PAD type. The size of that PAD type is not statically
9966 known, but can be determined using a parallel XVZ variable.
9967 In that case, a copy of the PAD type with the correct size should
9968 be used for the fixed array.
9970 3. ``Fixing'' record type objects:
9971 ----------------------------------
9973 Things are slightly different from arrays in the case of dynamic
9974 record types. In this case, in order to compute the associated
9975 fixed type, we need to determine the size and offset of each of
9976 its components. This, in turn, requires us to compute the fixed
9977 type of each of these components.
9979 Consider for instance the example:
9981 type Bounded_String (Max_Size : Natural) is record
9982 Str : String (1 .. Max_Size);
9985 My_String : Bounded_String (Max_Size => 10);
9987 In that case, the position of field "Length" depends on the size
9988 of field Str, which itself depends on the value of the Max_Size
9989 discriminant. In order to fix the type of variable My_String,
9990 we need to fix the type of field Str. Therefore, fixing a variant
9991 record requires us to fix each of its components.
9993 However, if a component does not have a dynamic size, the component
9994 should not be fixed. In particular, fields that use a PAD type
9995 should not fixed. Here is an example where this might happen
9996 (assuming type Rec above):
9998 type Container (Big : Boolean) is record
10002 when True => Another : Integer;
10003 when False => null;
10006 My_Container : Container := (Big => False,
10007 First => (Empty => True),
10010 In that example, the compiler creates a PAD type for component First,
10011 whose size is constant, and then positions the component After just
10012 right after it. The offset of component After is therefore constant
10015 The debugger computes the position of each field based on an algorithm
10016 that uses, among other things, the actual position and size of the field
10017 preceding it. Let's now imagine that the user is trying to print
10018 the value of My_Container. If the type fixing was recursive, we would
10019 end up computing the offset of field After based on the size of the
10020 fixed version of field First. And since in our example First has
10021 only one actual field, the size of the fixed type is actually smaller
10022 than the amount of space allocated to that field, and thus we would
10023 compute the wrong offset of field After.
10025 To make things more complicated, we need to watch out for dynamic
10026 components of variant records (identified by the ___XVL suffix in
10027 the component name). Even if the target type is a PAD type, the size
10028 of that type might not be statically known. So the PAD type needs
10029 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10030 we might end up with the wrong size for our component. This can be
10031 observed with the following type declarations:
10033 type Octal is new Integer range 0 .. 7;
10034 type Octal_Array is array (Positive range <>) of Octal;
10035 pragma Pack (Octal_Array);
10037 type Octal_Buffer (Size : Positive) is record
10038 Buffer : Octal_Array (1 .. Size);
10042 In that case, Buffer is a PAD type whose size is unset and needs
10043 to be computed by fixing the unwrapped type.
10045 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10046 ----------------------------------------------------------
10048 Lastly, when should the sub-elements of an entity that remained unfixed
10049 thus far, be actually fixed?
10051 The answer is: Only when referencing that element. For instance
10052 when selecting one component of a record, this specific component
10053 should be fixed at that point in time. Or when printing the value
10054 of a record, each component should be fixed before its value gets
10055 printed. Similarly for arrays, the element of the array should be
10056 fixed when printing each element of the array, or when extracting
10057 one element out of that array. On the other hand, fixing should
10058 not be performed on the elements when taking a slice of an array!
10060 Note that one of the side effects of miscomputing the offset and
10061 size of each field is that we end up also miscomputing the size
10062 of the containing type. This can have adverse results when computing
10063 the value of an entity. GDB fetches the value of an entity based
10064 on the size of its type, and thus a wrong size causes GDB to fetch
10065 the wrong amount of memory. In the case where the computed size is
10066 too small, GDB fetches too little data to print the value of our
10067 entity. Results in this case are unpredictable, as we usually read
10068 past the buffer containing the data =:-o. */
10070 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10071 for that subexpression cast to TO_TYPE. Advance *POS over the
10075 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10076 enum noside noside
, struct type
*to_type
)
10080 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10081 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10086 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10088 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10089 return value_zero (to_type
, not_lval
);
10091 val
= evaluate_var_msym_value (noside
,
10092 exp
->elts
[pc
+ 1].objfile
,
10093 exp
->elts
[pc
+ 2].msymbol
);
10096 val
= evaluate_var_value (noside
,
10097 exp
->elts
[pc
+ 1].block
,
10098 exp
->elts
[pc
+ 2].symbol
);
10100 if (noside
== EVAL_SKIP
)
10101 return eval_skip_value (exp
);
10103 val
= ada_value_cast (to_type
, val
);
10105 /* Follow the Ada language semantics that do not allow taking
10106 an address of the result of a cast (view conversion in Ada). */
10107 if (VALUE_LVAL (val
) == lval_memory
)
10109 if (value_lazy (val
))
10110 value_fetch_lazy (val
);
10111 VALUE_LVAL (val
) = not_lval
;
10116 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10117 if (noside
== EVAL_SKIP
)
10118 return eval_skip_value (exp
);
10119 return ada_value_cast (to_type
, val
);
10122 /* Implement the evaluate_exp routine in the exp_descriptor structure
10123 for the Ada language. */
10125 static struct value
*
10126 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10127 int *pos
, enum noside noside
)
10129 enum exp_opcode op
;
10133 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10136 struct value
**argvec
;
10140 op
= exp
->elts
[pc
].opcode
;
10146 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10148 if (noside
== EVAL_NORMAL
)
10149 arg1
= unwrap_value (arg1
);
10151 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10152 then we need to perform the conversion manually, because
10153 evaluate_subexp_standard doesn't do it. This conversion is
10154 necessary in Ada because the different kinds of float/fixed
10155 types in Ada have different representations.
10157 Similarly, we need to perform the conversion from OP_LONG
10159 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10160 arg1
= ada_value_cast (expect_type
, arg1
);
10166 struct value
*result
;
10169 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10170 /* The result type will have code OP_STRING, bashed there from
10171 OP_ARRAY. Bash it back. */
10172 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10173 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10179 type
= exp
->elts
[pc
+ 1].type
;
10180 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10184 type
= exp
->elts
[pc
+ 1].type
;
10185 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10188 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10189 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10191 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10192 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10194 return ada_value_assign (arg1
, arg1
);
10196 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10197 except if the lhs of our assignment is a convenience variable.
10198 In the case of assigning to a convenience variable, the lhs
10199 should be exactly the result of the evaluation of the rhs. */
10200 type
= value_type (arg1
);
10201 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10203 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10204 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10206 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10210 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10211 arg2
= cast_to_gnat_encoded_fixed_point_type (value_type (arg1
), arg2
);
10212 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10214 (_("Fixed-point values must be assigned to fixed-point variables"));
10216 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10217 return ada_value_assign (arg1
, arg2
);
10220 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10221 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10222 if (noside
== EVAL_SKIP
)
10224 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10225 return (value_from_longest
10226 (value_type (arg1
),
10227 value_as_long (arg1
) + value_as_long (arg2
)));
10228 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10229 return (value_from_longest
10230 (value_type (arg2
),
10231 value_as_long (arg1
) + value_as_long (arg2
)));
10232 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10233 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10234 && value_type (arg1
) != value_type (arg2
))
10235 error (_("Operands of fixed-point addition must have the same type"));
10236 /* Do the addition, and cast the result to the type of the first
10237 argument. We cannot cast the result to a reference type, so if
10238 ARG1 is a reference type, find its underlying type. */
10239 type
= value_type (arg1
);
10240 while (type
->code () == TYPE_CODE_REF
)
10241 type
= TYPE_TARGET_TYPE (type
);
10242 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10243 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10246 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10247 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10248 if (noside
== EVAL_SKIP
)
10250 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10251 return (value_from_longest
10252 (value_type (arg1
),
10253 value_as_long (arg1
) - value_as_long (arg2
)));
10254 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10255 return (value_from_longest
10256 (value_type (arg2
),
10257 value_as_long (arg1
) - value_as_long (arg2
)));
10258 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10259 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10260 && value_type (arg1
) != value_type (arg2
))
10261 error (_("Operands of fixed-point subtraction "
10262 "must have the same type"));
10263 /* Do the substraction, and cast the result to the type of the first
10264 argument. We cannot cast the result to a reference type, so if
10265 ARG1 is a reference type, find its underlying type. */
10266 type
= value_type (arg1
);
10267 while (type
->code () == TYPE_CODE_REF
)
10268 type
= TYPE_TARGET_TYPE (type
);
10269 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10270 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10276 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10277 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10278 if (noside
== EVAL_SKIP
)
10280 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10282 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10283 return value_zero (value_type (arg1
), not_lval
);
10287 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10288 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10289 arg1
= cast_from_gnat_encoded_fixed_point_type (type
, arg1
);
10290 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10291 arg2
= cast_from_gnat_encoded_fixed_point_type (type
, arg2
);
10292 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10293 return ada_value_binop (arg1
, arg2
, op
);
10297 case BINOP_NOTEQUAL
:
10298 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10299 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10300 if (noside
== EVAL_SKIP
)
10302 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10306 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10307 tem
= ada_value_equal (arg1
, arg2
);
10309 if (op
== BINOP_NOTEQUAL
)
10311 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10312 return value_from_longest (type
, (LONGEST
) tem
);
10315 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10316 if (noside
== EVAL_SKIP
)
10318 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10319 return value_cast (value_type (arg1
), value_neg (arg1
));
10322 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10323 return value_neg (arg1
);
10326 case BINOP_LOGICAL_AND
:
10327 case BINOP_LOGICAL_OR
:
10328 case UNOP_LOGICAL_NOT
:
10333 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10334 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10335 return value_cast (type
, val
);
10338 case BINOP_BITWISE_AND
:
10339 case BINOP_BITWISE_IOR
:
10340 case BINOP_BITWISE_XOR
:
10344 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10346 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10348 return value_cast (value_type (arg1
), val
);
10354 if (noside
== EVAL_SKIP
)
10360 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10361 /* Only encountered when an unresolved symbol occurs in a
10362 context other than a function call, in which case, it is
10364 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10365 exp
->elts
[pc
+ 2].symbol
->print_name ());
10367 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10369 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10370 /* Check to see if this is a tagged type. We also need to handle
10371 the case where the type is a reference to a tagged type, but
10372 we have to be careful to exclude pointers to tagged types.
10373 The latter should be shown as usual (as a pointer), whereas
10374 a reference should mostly be transparent to the user. */
10375 if (ada_is_tagged_type (type
, 0)
10376 || (type
->code () == TYPE_CODE_REF
10377 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10379 /* Tagged types are a little special in the fact that the real
10380 type is dynamic and can only be determined by inspecting the
10381 object's tag. This means that we need to get the object's
10382 value first (EVAL_NORMAL) and then extract the actual object
10385 Note that we cannot skip the final step where we extract
10386 the object type from its tag, because the EVAL_NORMAL phase
10387 results in dynamic components being resolved into fixed ones.
10388 This can cause problems when trying to print the type
10389 description of tagged types whose parent has a dynamic size:
10390 We use the type name of the "_parent" component in order
10391 to print the name of the ancestor type in the type description.
10392 If that component had a dynamic size, the resolution into
10393 a fixed type would result in the loss of that type name,
10394 thus preventing us from printing the name of the ancestor
10395 type in the type description. */
10396 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_NORMAL
);
10398 if (type
->code () != TYPE_CODE_REF
)
10400 struct type
*actual_type
;
10402 actual_type
= type_from_tag (ada_value_tag (arg1
));
10403 if (actual_type
== NULL
)
10404 /* If, for some reason, we were unable to determine
10405 the actual type from the tag, then use the static
10406 approximation that we just computed as a fallback.
10407 This can happen if the debugging information is
10408 incomplete, for instance. */
10409 actual_type
= type
;
10410 return value_zero (actual_type
, not_lval
);
10414 /* In the case of a ref, ada_coerce_ref takes care
10415 of determining the actual type. But the evaluation
10416 should return a ref as it should be valid to ask
10417 for its address; so rebuild a ref after coerce. */
10418 arg1
= ada_coerce_ref (arg1
);
10419 return value_ref (arg1
, TYPE_CODE_REF
);
10423 /* Records and unions for which GNAT encodings have been
10424 generated need to be statically fixed as well.
10425 Otherwise, non-static fixing produces a type where
10426 all dynamic properties are removed, which prevents "ptype"
10427 from being able to completely describe the type.
10428 For instance, a case statement in a variant record would be
10429 replaced by the relevant components based on the actual
10430 value of the discriminants. */
10431 if ((type
->code () == TYPE_CODE_STRUCT
10432 && dynamic_template_type (type
) != NULL
)
10433 || (type
->code () == TYPE_CODE_UNION
10434 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10437 return value_zero (to_static_fixed_type (type
), not_lval
);
10441 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10442 return ada_to_fixed_value (arg1
);
10447 /* Allocate arg vector, including space for the function to be
10448 called in argvec[0] and a terminating NULL. */
10449 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10450 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10452 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10453 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10454 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10455 exp
->elts
[pc
+ 5].symbol
->print_name ());
10458 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10459 argvec
[tem
] = evaluate_subexp (nullptr, exp
, pos
, noside
);
10462 if (noside
== EVAL_SKIP
)
10466 if (ada_is_constrained_packed_array_type
10467 (desc_base_type (value_type (argvec
[0]))))
10468 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10469 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10470 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10471 /* This is a packed array that has already been fixed, and
10472 therefore already coerced to a simple array. Nothing further
10475 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10477 /* Make sure we dereference references so that all the code below
10478 feels like it's really handling the referenced value. Wrapping
10479 types (for alignment) may be there, so make sure we strip them as
10481 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10483 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10484 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10485 argvec
[0] = value_addr (argvec
[0]);
10487 type
= ada_check_typedef (value_type (argvec
[0]));
10489 /* Ada allows us to implicitly dereference arrays when subscripting
10490 them. So, if this is an array typedef (encoding use for array
10491 access types encoded as fat pointers), strip it now. */
10492 if (type
->code () == TYPE_CODE_TYPEDEF
)
10493 type
= ada_typedef_target_type (type
);
10495 if (type
->code () == TYPE_CODE_PTR
)
10497 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10499 case TYPE_CODE_FUNC
:
10500 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10502 case TYPE_CODE_ARRAY
:
10504 case TYPE_CODE_STRUCT
:
10505 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10506 argvec
[0] = ada_value_ind (argvec
[0]);
10507 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10510 error (_("cannot subscript or call something of type `%s'"),
10511 ada_type_name (value_type (argvec
[0])));
10516 switch (type
->code ())
10518 case TYPE_CODE_FUNC
:
10519 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10521 if (TYPE_TARGET_TYPE (type
) == NULL
)
10522 error_call_unknown_return_type (NULL
);
10523 return allocate_value (TYPE_TARGET_TYPE (type
));
10525 return call_function_by_hand (argvec
[0], NULL
,
10526 gdb::make_array_view (argvec
+ 1,
10528 case TYPE_CODE_INTERNAL_FUNCTION
:
10529 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10530 /* We don't know anything about what the internal
10531 function might return, but we have to return
10533 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10536 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10537 argvec
[0], nargs
, argvec
+ 1);
10539 case TYPE_CODE_STRUCT
:
10543 arity
= ada_array_arity (type
);
10544 type
= ada_array_element_type (type
, nargs
);
10546 error (_("cannot subscript or call a record"));
10547 if (arity
!= nargs
)
10548 error (_("wrong number of subscripts; expecting %d"), arity
);
10549 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10550 return value_zero (ada_aligned_type (type
), lval_memory
);
10552 unwrap_value (ada_value_subscript
10553 (argvec
[0], nargs
, argvec
+ 1));
10555 case TYPE_CODE_ARRAY
:
10556 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10558 type
= ada_array_element_type (type
, nargs
);
10560 error (_("element type of array unknown"));
10562 return value_zero (ada_aligned_type (type
), lval_memory
);
10565 unwrap_value (ada_value_subscript
10566 (ada_coerce_to_simple_array (argvec
[0]),
10567 nargs
, argvec
+ 1));
10568 case TYPE_CODE_PTR
: /* Pointer to array */
10569 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10571 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10572 type
= ada_array_element_type (type
, nargs
);
10574 error (_("element type of array unknown"));
10576 return value_zero (ada_aligned_type (type
), lval_memory
);
10579 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10580 nargs
, argvec
+ 1));
10583 error (_("Attempt to index or call something other than an "
10584 "array or function"));
10589 struct value
*array
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10590 struct value
*low_bound_val
10591 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10592 struct value
*high_bound_val
10593 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10595 LONGEST high_bound
;
10597 low_bound_val
= coerce_ref (low_bound_val
);
10598 high_bound_val
= coerce_ref (high_bound_val
);
10599 low_bound
= value_as_long (low_bound_val
);
10600 high_bound
= value_as_long (high_bound_val
);
10602 if (noside
== EVAL_SKIP
)
10605 /* If this is a reference to an aligner type, then remove all
10607 if (value_type (array
)->code () == TYPE_CODE_REF
10608 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10609 TYPE_TARGET_TYPE (value_type (array
)) =
10610 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10612 if (ada_is_constrained_packed_array_type (value_type (array
)))
10613 error (_("cannot slice a packed array"));
10615 /* If this is a reference to an array or an array lvalue,
10616 convert to a pointer. */
10617 if (value_type (array
)->code () == TYPE_CODE_REF
10618 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10619 && VALUE_LVAL (array
) == lval_memory
))
10620 array
= value_addr (array
);
10622 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10623 && ada_is_array_descriptor_type (ada_check_typedef
10624 (value_type (array
))))
10625 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10628 array
= ada_coerce_to_simple_array_ptr (array
);
10630 /* If we have more than one level of pointer indirection,
10631 dereference the value until we get only one level. */
10632 while (value_type (array
)->code () == TYPE_CODE_PTR
10633 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10635 array
= value_ind (array
);
10637 /* Make sure we really do have an array type before going further,
10638 to avoid a SEGV when trying to get the index type or the target
10639 type later down the road if the debug info generated by
10640 the compiler is incorrect or incomplete. */
10641 if (!ada_is_simple_array_type (value_type (array
)))
10642 error (_("cannot take slice of non-array"));
10644 if (ada_check_typedef (value_type (array
))->code ()
10647 struct type
*type0
= ada_check_typedef (value_type (array
));
10649 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10650 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10653 struct type
*arr_type0
=
10654 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10656 return ada_value_slice_from_ptr (array
, arr_type0
,
10657 longest_to_int (low_bound
),
10658 longest_to_int (high_bound
));
10661 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10663 else if (high_bound
< low_bound
)
10664 return empty_array (value_type (array
), low_bound
, high_bound
);
10666 return ada_value_slice (array
, longest_to_int (low_bound
),
10667 longest_to_int (high_bound
));
10670 case UNOP_IN_RANGE
:
10672 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10673 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10675 if (noside
== EVAL_SKIP
)
10678 switch (type
->code ())
10681 lim_warning (_("Membership test incompletely implemented; "
10682 "always returns true"));
10683 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10684 return value_from_longest (type
, (LONGEST
) 1);
10686 case TYPE_CODE_RANGE
:
10687 arg2
= value_from_longest (type
,
10688 type
->bounds ()->low
.const_val ());
10689 arg3
= value_from_longest (type
,
10690 type
->bounds ()->high
.const_val ());
10691 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10692 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10693 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10695 value_from_longest (type
,
10696 (value_less (arg1
, arg3
)
10697 || value_equal (arg1
, arg3
))
10698 && (value_less (arg2
, arg1
)
10699 || value_equal (arg2
, arg1
)));
10702 case BINOP_IN_BOUNDS
:
10704 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10705 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10707 if (noside
== EVAL_SKIP
)
10710 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10712 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10713 return value_zero (type
, not_lval
);
10716 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10718 type
= ada_index_type (value_type (arg2
), tem
, "range");
10720 type
= value_type (arg1
);
10722 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10723 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10725 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10726 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10727 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10729 value_from_longest (type
,
10730 (value_less (arg1
, arg3
)
10731 || value_equal (arg1
, arg3
))
10732 && (value_less (arg2
, arg1
)
10733 || value_equal (arg2
, arg1
)));
10735 case TERNOP_IN_RANGE
:
10736 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10737 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10738 arg3
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10740 if (noside
== EVAL_SKIP
)
10743 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10744 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10745 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10747 value_from_longest (type
,
10748 (value_less (arg1
, arg3
)
10749 || value_equal (arg1
, arg3
))
10750 && (value_less (arg2
, arg1
)
10751 || value_equal (arg2
, arg1
)));
10755 case OP_ATR_LENGTH
:
10757 struct type
*type_arg
;
10759 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10761 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10763 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10767 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10771 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10772 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10773 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10776 if (noside
== EVAL_SKIP
)
10778 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10780 if (type_arg
== NULL
)
10781 type_arg
= value_type (arg1
);
10783 if (ada_is_constrained_packed_array_type (type_arg
))
10784 type_arg
= decode_constrained_packed_array_type (type_arg
);
10786 if (!discrete_type_p (type_arg
))
10790 default: /* Should never happen. */
10791 error (_("unexpected attribute encountered"));
10794 type_arg
= ada_index_type (type_arg
, tem
,
10795 ada_attribute_name (op
));
10797 case OP_ATR_LENGTH
:
10798 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
10803 return value_zero (type_arg
, not_lval
);
10805 else if (type_arg
== NULL
)
10807 arg1
= ada_coerce_ref (arg1
);
10809 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10810 arg1
= ada_coerce_to_simple_array (arg1
);
10812 if (op
== OP_ATR_LENGTH
)
10813 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10816 type
= ada_index_type (value_type (arg1
), tem
,
10817 ada_attribute_name (op
));
10819 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10824 default: /* Should never happen. */
10825 error (_("unexpected attribute encountered"));
10827 return value_from_longest
10828 (type
, ada_array_bound (arg1
, tem
, 0));
10830 return value_from_longest
10831 (type
, ada_array_bound (arg1
, tem
, 1));
10832 case OP_ATR_LENGTH
:
10833 return value_from_longest
10834 (type
, ada_array_length (arg1
, tem
));
10837 else if (discrete_type_p (type_arg
))
10839 struct type
*range_type
;
10840 const char *name
= ada_type_name (type_arg
);
10843 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
10844 range_type
= to_fixed_range_type (type_arg
, NULL
);
10845 if (range_type
== NULL
)
10846 range_type
= type_arg
;
10850 error (_("unexpected attribute encountered"));
10852 return value_from_longest
10853 (range_type
, ada_discrete_type_low_bound (range_type
));
10855 return value_from_longest
10856 (range_type
, ada_discrete_type_high_bound (range_type
));
10857 case OP_ATR_LENGTH
:
10858 error (_("the 'length attribute applies only to array types"));
10861 else if (type_arg
->code () == TYPE_CODE_FLT
)
10862 error (_("unimplemented type attribute"));
10867 if (ada_is_constrained_packed_array_type (type_arg
))
10868 type_arg
= decode_constrained_packed_array_type (type_arg
);
10870 if (op
== OP_ATR_LENGTH
)
10871 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10874 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10876 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10882 error (_("unexpected attribute encountered"));
10884 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10885 return value_from_longest (type
, low
);
10887 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10888 return value_from_longest (type
, high
);
10889 case OP_ATR_LENGTH
:
10890 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10891 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10892 return value_from_longest (type
, high
- low
+ 1);
10898 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10899 if (noside
== EVAL_SKIP
)
10902 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10903 return value_zero (ada_tag_type (arg1
), not_lval
);
10905 return ada_value_tag (arg1
);
10909 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10910 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10911 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10912 if (noside
== EVAL_SKIP
)
10914 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10915 return value_zero (value_type (arg1
), not_lval
);
10918 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10919 return value_binop (arg1
, arg2
,
10920 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10923 case OP_ATR_MODULUS
:
10925 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10927 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10928 if (noside
== EVAL_SKIP
)
10931 if (!ada_is_modular_type (type_arg
))
10932 error (_("'modulus must be applied to modular type"));
10934 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10935 ada_modulus (type_arg
));
10940 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10941 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10942 if (noside
== EVAL_SKIP
)
10944 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10945 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10946 return value_zero (type
, not_lval
);
10948 return value_pos_atr (type
, arg1
);
10951 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10952 type
= value_type (arg1
);
10954 /* If the argument is a reference, then dereference its type, since
10955 the user is really asking for the size of the actual object,
10956 not the size of the pointer. */
10957 if (type
->code () == TYPE_CODE_REF
)
10958 type
= TYPE_TARGET_TYPE (type
);
10960 if (noside
== EVAL_SKIP
)
10962 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10963 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10965 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10966 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10969 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10970 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10971 type
= exp
->elts
[pc
+ 2].type
;
10972 if (noside
== EVAL_SKIP
)
10974 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10975 return value_zero (type
, not_lval
);
10977 return value_val_atr (type
, arg1
);
10980 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10981 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10982 if (noside
== EVAL_SKIP
)
10984 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10985 return value_zero (value_type (arg1
), not_lval
);
10988 /* For integer exponentiation operations,
10989 only promote the first argument. */
10990 if (is_integral_type (value_type (arg2
)))
10991 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10993 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10995 return value_binop (arg1
, arg2
, op
);
10999 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11000 if (noside
== EVAL_SKIP
)
11006 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11007 if (noside
== EVAL_SKIP
)
11009 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11010 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11011 return value_neg (arg1
);
11016 preeval_pos
= *pos
;
11017 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11018 if (noside
== EVAL_SKIP
)
11020 type
= ada_check_typedef (value_type (arg1
));
11021 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11023 if (ada_is_array_descriptor_type (type
))
11024 /* GDB allows dereferencing GNAT array descriptors. */
11026 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11028 if (arrType
== NULL
)
11029 error (_("Attempt to dereference null array pointer."));
11030 return value_at_lazy (arrType
, 0);
11032 else if (type
->code () == TYPE_CODE_PTR
11033 || type
->code () == TYPE_CODE_REF
11034 /* In C you can dereference an array to get the 1st elt. */
11035 || type
->code () == TYPE_CODE_ARRAY
)
11037 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11038 only be determined by inspecting the object's tag.
11039 This means that we need to evaluate completely the
11040 expression in order to get its type. */
11042 if ((type
->code () == TYPE_CODE_REF
11043 || type
->code () == TYPE_CODE_PTR
)
11044 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11047 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11048 type
= value_type (ada_value_ind (arg1
));
11052 type
= to_static_fixed_type
11054 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11056 ada_ensure_varsize_limit (type
);
11057 return value_zero (type
, lval_memory
);
11059 else if (type
->code () == TYPE_CODE_INT
)
11061 /* GDB allows dereferencing an int. */
11062 if (expect_type
== NULL
)
11063 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11068 to_static_fixed_type (ada_aligned_type (expect_type
));
11069 return value_zero (expect_type
, lval_memory
);
11073 error (_("Attempt to take contents of a non-pointer value."));
11075 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11076 type
= ada_check_typedef (value_type (arg1
));
11078 if (type
->code () == TYPE_CODE_INT
)
11079 /* GDB allows dereferencing an int. If we were given
11080 the expect_type, then use that as the target type.
11081 Otherwise, assume that the target type is an int. */
11083 if (expect_type
!= NULL
)
11084 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11087 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11088 (CORE_ADDR
) value_as_address (arg1
));
11091 if (ada_is_array_descriptor_type (type
))
11092 /* GDB allows dereferencing GNAT array descriptors. */
11093 return ada_coerce_to_simple_array (arg1
);
11095 return ada_value_ind (arg1
);
11097 case STRUCTOP_STRUCT
:
11098 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11099 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11100 preeval_pos
= *pos
;
11101 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11102 if (noside
== EVAL_SKIP
)
11104 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11106 struct type
*type1
= value_type (arg1
);
11108 if (ada_is_tagged_type (type1
, 1))
11110 type
= ada_lookup_struct_elt_type (type1
,
11111 &exp
->elts
[pc
+ 2].string
,
11114 /* If the field is not found, check if it exists in the
11115 extension of this object's type. This means that we
11116 need to evaluate completely the expression. */
11121 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11122 arg1
= ada_value_struct_elt (arg1
,
11123 &exp
->elts
[pc
+ 2].string
,
11125 arg1
= unwrap_value (arg1
);
11126 type
= value_type (ada_to_fixed_value (arg1
));
11131 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11134 return value_zero (ada_aligned_type (type
), lval_memory
);
11138 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11139 arg1
= unwrap_value (arg1
);
11140 return ada_to_fixed_value (arg1
);
11144 /* The value is not supposed to be used. This is here to make it
11145 easier to accommodate expressions that contain types. */
11147 if (noside
== EVAL_SKIP
)
11149 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11150 return allocate_value (exp
->elts
[pc
+ 1].type
);
11152 error (_("Attempt to use a type name as an expression"));
11157 case OP_DISCRETE_RANGE
:
11158 case OP_POSITIONAL
:
11160 if (noside
== EVAL_NORMAL
)
11164 error (_("Undefined name, ambiguous name, or renaming used in "
11165 "component association: %s."), &exp
->elts
[pc
+2].string
);
11167 error (_("Aggregates only allowed on the right of an assignment"));
11169 internal_error (__FILE__
, __LINE__
,
11170 _("aggregate apparently mangled"));
11173 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11175 for (tem
= 0; tem
< nargs
; tem
+= 1)
11176 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11181 return eval_skip_value (exp
);
11187 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11188 type name that encodes the 'small and 'delta information.
11189 Otherwise, return NULL. */
11191 static const char *
11192 gnat_encoded_fixed_point_type_info (struct type
*type
)
11194 const char *name
= ada_type_name (type
);
11195 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: type
->code ();
11197 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11199 const char *tail
= strstr (name
, "___XF_");
11206 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11207 return gnat_encoded_fixed_point_type_info (TYPE_TARGET_TYPE (type
));
11212 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11215 ada_is_gnat_encoded_fixed_point_type (struct type
*type
)
11217 return gnat_encoded_fixed_point_type_info (type
) != NULL
;
11220 /* Return non-zero iff TYPE represents a System.Address type. */
11223 ada_is_system_address_type (struct type
*type
)
11225 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11228 /* Assuming that TYPE is the representation of an Ada fixed-point
11229 type, return the target floating-point type to be used to represent
11230 of this type during internal computation. */
11232 static struct type
*
11233 ada_scaling_type (struct type
*type
)
11235 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11238 /* Assuming that TYPE is the representation of an Ada fixed-point
11239 type, return its delta, or NULL if the type is malformed and the
11240 delta cannot be determined. */
11243 gnat_encoded_fixed_point_delta (struct type
*type
)
11245 const char *encoding
= gnat_encoded_fixed_point_type_info (type
);
11246 struct type
*scale_type
= ada_scaling_type (type
);
11248 long long num
, den
;
11250 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11253 return value_binop (value_from_longest (scale_type
, num
),
11254 value_from_longest (scale_type
, den
), BINOP_DIV
);
11257 /* Assuming that ada_is_gnat_encoded_fixed_point_type (TYPE), return
11258 the scaling factor ('SMALL value) associated with the type. */
11261 gnat_encoded_fixed_point_scaling_factor (struct type
*type
)
11263 const char *encoding
= gnat_encoded_fixed_point_type_info (type
);
11264 struct type
*scale_type
= ada_scaling_type (type
);
11266 long long num0
, den0
, num1
, den1
;
11269 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11270 &num0
, &den0
, &num1
, &den1
);
11273 return value_from_longest (scale_type
, 1);
11275 return value_binop (value_from_longest (scale_type
, num1
),
11276 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11278 return value_binop (value_from_longest (scale_type
, num0
),
11279 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11286 /* Scan STR beginning at position K for a discriminant name, and
11287 return the value of that discriminant field of DVAL in *PX. If
11288 PNEW_K is not null, put the position of the character beyond the
11289 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11290 not alter *PX and *PNEW_K if unsuccessful. */
11293 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11296 static char *bound_buffer
= NULL
;
11297 static size_t bound_buffer_len
= 0;
11298 const char *pstart
, *pend
, *bound
;
11299 struct value
*bound_val
;
11301 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11305 pend
= strstr (pstart
, "__");
11309 k
+= strlen (bound
);
11313 int len
= pend
- pstart
;
11315 /* Strip __ and beyond. */
11316 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11317 strncpy (bound_buffer
, pstart
, len
);
11318 bound_buffer
[len
] = '\0';
11320 bound
= bound_buffer
;
11324 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11325 if (bound_val
== NULL
)
11328 *px
= value_as_long (bound_val
);
11329 if (pnew_k
!= NULL
)
11334 /* Value of variable named NAME in the current environment. If
11335 no such variable found, then if ERR_MSG is null, returns 0, and
11336 otherwise causes an error with message ERR_MSG. */
11338 static struct value
*
11339 get_var_value (const char *name
, const char *err_msg
)
11341 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11343 std::vector
<struct block_symbol
> syms
;
11344 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11345 get_selected_block (0),
11346 VAR_DOMAIN
, &syms
, 1);
11350 if (err_msg
== NULL
)
11353 error (("%s"), err_msg
);
11356 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11359 /* Value of integer variable named NAME in the current environment.
11360 If no such variable is found, returns false. Otherwise, sets VALUE
11361 to the variable's value and returns true. */
11364 get_int_var_value (const char *name
, LONGEST
&value
)
11366 struct value
*var_val
= get_var_value (name
, 0);
11371 value
= value_as_long (var_val
);
11376 /* Return a range type whose base type is that of the range type named
11377 NAME in the current environment, and whose bounds are calculated
11378 from NAME according to the GNAT range encoding conventions.
11379 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11380 corresponding range type from debug information; fall back to using it
11381 if symbol lookup fails. If a new type must be created, allocate it
11382 like ORIG_TYPE was. The bounds information, in general, is encoded
11383 in NAME, the base type given in the named range type. */
11385 static struct type
*
11386 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11389 struct type
*base_type
;
11390 const char *subtype_info
;
11392 gdb_assert (raw_type
!= NULL
);
11393 gdb_assert (raw_type
->name () != NULL
);
11395 if (raw_type
->code () == TYPE_CODE_RANGE
)
11396 base_type
= TYPE_TARGET_TYPE (raw_type
);
11398 base_type
= raw_type
;
11400 name
= raw_type
->name ();
11401 subtype_info
= strstr (name
, "___XD");
11402 if (subtype_info
== NULL
)
11404 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11405 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11407 if (L
< INT_MIN
|| U
> INT_MAX
)
11410 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11415 static char *name_buf
= NULL
;
11416 static size_t name_len
= 0;
11417 int prefix_len
= subtype_info
- name
;
11420 const char *bounds_str
;
11423 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11424 strncpy (name_buf
, name
, prefix_len
);
11425 name_buf
[prefix_len
] = '\0';
11428 bounds_str
= strchr (subtype_info
, '_');
11431 if (*subtype_info
== 'L')
11433 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11434 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11436 if (bounds_str
[n
] == '_')
11438 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11444 strcpy (name_buf
+ prefix_len
, "___L");
11445 if (!get_int_var_value (name_buf
, L
))
11447 lim_warning (_("Unknown lower bound, using 1."));
11452 if (*subtype_info
== 'U')
11454 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11455 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11460 strcpy (name_buf
+ prefix_len
, "___U");
11461 if (!get_int_var_value (name_buf
, U
))
11463 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11468 type
= create_static_range_type (alloc_type_copy (raw_type
),
11470 /* create_static_range_type alters the resulting type's length
11471 to match the size of the base_type, which is not what we want.
11472 Set it back to the original range type's length. */
11473 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11474 type
->set_name (name
);
11479 /* True iff NAME is the name of a range type. */
11482 ada_is_range_type_name (const char *name
)
11484 return (name
!= NULL
&& strstr (name
, "___XD"));
11488 /* Modular types */
11490 /* True iff TYPE is an Ada modular type. */
11493 ada_is_modular_type (struct type
*type
)
11495 struct type
*subranged_type
= get_base_type (type
);
11497 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11498 && subranged_type
->code () == TYPE_CODE_INT
11499 && subranged_type
->is_unsigned ());
11502 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11505 ada_modulus (struct type
*type
)
11507 const dynamic_prop
&high
= type
->bounds ()->high
;
11509 if (high
.kind () == PROP_CONST
)
11510 return (ULONGEST
) high
.const_val () + 1;
11512 /* If TYPE is unresolved, the high bound might be a location list. Return
11513 0, for lack of a better value to return. */
11518 /* Ada exception catchpoint support:
11519 ---------------------------------
11521 We support 3 kinds of exception catchpoints:
11522 . catchpoints on Ada exceptions
11523 . catchpoints on unhandled Ada exceptions
11524 . catchpoints on failed assertions
11526 Exceptions raised during failed assertions, or unhandled exceptions
11527 could perfectly be caught with the general catchpoint on Ada exceptions.
11528 However, we can easily differentiate these two special cases, and having
11529 the option to distinguish these two cases from the rest can be useful
11530 to zero-in on certain situations.
11532 Exception catchpoints are a specialized form of breakpoint,
11533 since they rely on inserting breakpoints inside known routines
11534 of the GNAT runtime. The implementation therefore uses a standard
11535 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11538 Support in the runtime for exception catchpoints have been changed
11539 a few times already, and these changes affect the implementation
11540 of these catchpoints. In order to be able to support several
11541 variants of the runtime, we use a sniffer that will determine
11542 the runtime variant used by the program being debugged. */
11544 /* Ada's standard exceptions.
11546 The Ada 83 standard also defined Numeric_Error. But there so many
11547 situations where it was unclear from the Ada 83 Reference Manual
11548 (RM) whether Constraint_Error or Numeric_Error should be raised,
11549 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11550 Interpretation saying that anytime the RM says that Numeric_Error
11551 should be raised, the implementation may raise Constraint_Error.
11552 Ada 95 went one step further and pretty much removed Numeric_Error
11553 from the list of standard exceptions (it made it a renaming of
11554 Constraint_Error, to help preserve compatibility when compiling
11555 an Ada83 compiler). As such, we do not include Numeric_Error from
11556 this list of standard exceptions. */
11558 static const char * const standard_exc
[] = {
11559 "constraint_error",
11565 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11567 /* A structure that describes how to support exception catchpoints
11568 for a given executable. */
11570 struct exception_support_info
11572 /* The name of the symbol to break on in order to insert
11573 a catchpoint on exceptions. */
11574 const char *catch_exception_sym
;
11576 /* The name of the symbol to break on in order to insert
11577 a catchpoint on unhandled exceptions. */
11578 const char *catch_exception_unhandled_sym
;
11580 /* The name of the symbol to break on in order to insert
11581 a catchpoint on failed assertions. */
11582 const char *catch_assert_sym
;
11584 /* The name of the symbol to break on in order to insert
11585 a catchpoint on exception handling. */
11586 const char *catch_handlers_sym
;
11588 /* Assuming that the inferior just triggered an unhandled exception
11589 catchpoint, this function is responsible for returning the address
11590 in inferior memory where the name of that exception is stored.
11591 Return zero if the address could not be computed. */
11592 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11595 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11596 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11598 /* The following exception support info structure describes how to
11599 implement exception catchpoints with the latest version of the
11600 Ada runtime (as of 2019-08-??). */
11602 static const struct exception_support_info default_exception_support_info
=
11604 "__gnat_debug_raise_exception", /* catch_exception_sym */
11605 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11606 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11607 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11608 ada_unhandled_exception_name_addr
11611 /* The following exception support info structure describes how to
11612 implement exception catchpoints with an earlier version of the
11613 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11615 static const struct exception_support_info exception_support_info_v0
=
11617 "__gnat_debug_raise_exception", /* catch_exception_sym */
11618 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11619 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11620 "__gnat_begin_handler", /* catch_handlers_sym */
11621 ada_unhandled_exception_name_addr
11624 /* The following exception support info structure describes how to
11625 implement exception catchpoints with a slightly older version
11626 of the Ada runtime. */
11628 static const struct exception_support_info exception_support_info_fallback
=
11630 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11631 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11632 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11633 "__gnat_begin_handler", /* catch_handlers_sym */
11634 ada_unhandled_exception_name_addr_from_raise
11637 /* Return nonzero if we can detect the exception support routines
11638 described in EINFO.
11640 This function errors out if an abnormal situation is detected
11641 (for instance, if we find the exception support routines, but
11642 that support is found to be incomplete). */
11645 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11647 struct symbol
*sym
;
11649 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11650 that should be compiled with debugging information. As a result, we
11651 expect to find that symbol in the symtabs. */
11653 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11656 /* Perhaps we did not find our symbol because the Ada runtime was
11657 compiled without debugging info, or simply stripped of it.
11658 It happens on some GNU/Linux distributions for instance, where
11659 users have to install a separate debug package in order to get
11660 the runtime's debugging info. In that situation, let the user
11661 know why we cannot insert an Ada exception catchpoint.
11663 Note: Just for the purpose of inserting our Ada exception
11664 catchpoint, we could rely purely on the associated minimal symbol.
11665 But we would be operating in degraded mode anyway, since we are
11666 still lacking the debugging info needed later on to extract
11667 the name of the exception being raised (this name is printed in
11668 the catchpoint message, and is also used when trying to catch
11669 a specific exception). We do not handle this case for now. */
11670 struct bound_minimal_symbol msym
11671 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11673 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11674 error (_("Your Ada runtime appears to be missing some debugging "
11675 "information.\nCannot insert Ada exception catchpoint "
11676 "in this configuration."));
11681 /* Make sure that the symbol we found corresponds to a function. */
11683 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11685 error (_("Symbol \"%s\" is not a function (class = %d)"),
11686 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11690 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11693 struct bound_minimal_symbol msym
11694 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11696 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11697 error (_("Your Ada runtime appears to be missing some debugging "
11698 "information.\nCannot insert Ada exception catchpoint "
11699 "in this configuration."));
11704 /* Make sure that the symbol we found corresponds to a function. */
11706 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11708 error (_("Symbol \"%s\" is not a function (class = %d)"),
11709 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11716 /* Inspect the Ada runtime and determine which exception info structure
11717 should be used to provide support for exception catchpoints.
11719 This function will always set the per-inferior exception_info,
11720 or raise an error. */
11723 ada_exception_support_info_sniffer (void)
11725 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11727 /* If the exception info is already known, then no need to recompute it. */
11728 if (data
->exception_info
!= NULL
)
11731 /* Check the latest (default) exception support info. */
11732 if (ada_has_this_exception_support (&default_exception_support_info
))
11734 data
->exception_info
= &default_exception_support_info
;
11738 /* Try the v0 exception suport info. */
11739 if (ada_has_this_exception_support (&exception_support_info_v0
))
11741 data
->exception_info
= &exception_support_info_v0
;
11745 /* Try our fallback exception suport info. */
11746 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11748 data
->exception_info
= &exception_support_info_fallback
;
11752 /* Sometimes, it is normal for us to not be able to find the routine
11753 we are looking for. This happens when the program is linked with
11754 the shared version of the GNAT runtime, and the program has not been
11755 started yet. Inform the user of these two possible causes if
11758 if (ada_update_initial_language (language_unknown
) != language_ada
)
11759 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11761 /* If the symbol does not exist, then check that the program is
11762 already started, to make sure that shared libraries have been
11763 loaded. If it is not started, this may mean that the symbol is
11764 in a shared library. */
11766 if (inferior_ptid
.pid () == 0)
11767 error (_("Unable to insert catchpoint. Try to start the program first."));
11769 /* At this point, we know that we are debugging an Ada program and
11770 that the inferior has been started, but we still are not able to
11771 find the run-time symbols. That can mean that we are in
11772 configurable run time mode, or that a-except as been optimized
11773 out by the linker... In any case, at this point it is not worth
11774 supporting this feature. */
11776 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11779 /* True iff FRAME is very likely to be that of a function that is
11780 part of the runtime system. This is all very heuristic, but is
11781 intended to be used as advice as to what frames are uninteresting
11785 is_known_support_routine (struct frame_info
*frame
)
11787 enum language func_lang
;
11789 const char *fullname
;
11791 /* If this code does not have any debugging information (no symtab),
11792 This cannot be any user code. */
11794 symtab_and_line sal
= find_frame_sal (frame
);
11795 if (sal
.symtab
== NULL
)
11798 /* If there is a symtab, but the associated source file cannot be
11799 located, then assume this is not user code: Selecting a frame
11800 for which we cannot display the code would not be very helpful
11801 for the user. This should also take care of case such as VxWorks
11802 where the kernel has some debugging info provided for a few units. */
11804 fullname
= symtab_to_fullname (sal
.symtab
);
11805 if (access (fullname
, R_OK
) != 0)
11808 /* Check the unit filename against the Ada runtime file naming.
11809 We also check the name of the objfile against the name of some
11810 known system libraries that sometimes come with debugging info
11813 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11815 re_comp (known_runtime_file_name_patterns
[i
]);
11816 if (re_exec (lbasename (sal
.symtab
->filename
)))
11818 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11819 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11823 /* Check whether the function is a GNAT-generated entity. */
11825 gdb::unique_xmalloc_ptr
<char> func_name
11826 = find_frame_funname (frame
, &func_lang
, NULL
);
11827 if (func_name
== NULL
)
11830 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11832 re_comp (known_auxiliary_function_name_patterns
[i
]);
11833 if (re_exec (func_name
.get ()))
11840 /* Find the first frame that contains debugging information and that is not
11841 part of the Ada run-time, starting from FI and moving upward. */
11844 ada_find_printable_frame (struct frame_info
*fi
)
11846 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11848 if (!is_known_support_routine (fi
))
11857 /* Assuming that the inferior just triggered an unhandled exception
11858 catchpoint, return the address in inferior memory where the name
11859 of the exception is stored.
11861 Return zero if the address could not be computed. */
11864 ada_unhandled_exception_name_addr (void)
11866 return parse_and_eval_address ("e.full_name");
11869 /* Same as ada_unhandled_exception_name_addr, except that this function
11870 should be used when the inferior uses an older version of the runtime,
11871 where the exception name needs to be extracted from a specific frame
11872 several frames up in the callstack. */
11875 ada_unhandled_exception_name_addr_from_raise (void)
11878 struct frame_info
*fi
;
11879 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11881 /* To determine the name of this exception, we need to select
11882 the frame corresponding to RAISE_SYM_NAME. This frame is
11883 at least 3 levels up, so we simply skip the first 3 frames
11884 without checking the name of their associated function. */
11885 fi
= get_current_frame ();
11886 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11888 fi
= get_prev_frame (fi
);
11892 enum language func_lang
;
11894 gdb::unique_xmalloc_ptr
<char> func_name
11895 = find_frame_funname (fi
, &func_lang
, NULL
);
11896 if (func_name
!= NULL
)
11898 if (strcmp (func_name
.get (),
11899 data
->exception_info
->catch_exception_sym
) == 0)
11900 break; /* We found the frame we were looking for... */
11902 fi
= get_prev_frame (fi
);
11909 return parse_and_eval_address ("id.full_name");
11912 /* Assuming the inferior just triggered an Ada exception catchpoint
11913 (of any type), return the address in inferior memory where the name
11914 of the exception is stored, if applicable.
11916 Assumes the selected frame is the current frame.
11918 Return zero if the address could not be computed, or if not relevant. */
11921 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11922 struct breakpoint
*b
)
11924 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11928 case ada_catch_exception
:
11929 return (parse_and_eval_address ("e.full_name"));
11932 case ada_catch_exception_unhandled
:
11933 return data
->exception_info
->unhandled_exception_name_addr ();
11936 case ada_catch_handlers
:
11937 return 0; /* The runtimes does not provide access to the exception
11941 case ada_catch_assert
:
11942 return 0; /* Exception name is not relevant in this case. */
11946 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11950 return 0; /* Should never be reached. */
11953 /* Assuming the inferior is stopped at an exception catchpoint,
11954 return the message which was associated to the exception, if
11955 available. Return NULL if the message could not be retrieved.
11957 Note: The exception message can be associated to an exception
11958 either through the use of the Raise_Exception function, or
11959 more simply (Ada 2005 and later), via:
11961 raise Exception_Name with "exception message";
11965 static gdb::unique_xmalloc_ptr
<char>
11966 ada_exception_message_1 (void)
11968 struct value
*e_msg_val
;
11971 /* For runtimes that support this feature, the exception message
11972 is passed as an unbounded string argument called "message". */
11973 e_msg_val
= parse_and_eval ("message");
11974 if (e_msg_val
== NULL
)
11975 return NULL
; /* Exception message not supported. */
11977 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
11978 gdb_assert (e_msg_val
!= NULL
);
11979 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
11981 /* If the message string is empty, then treat it as if there was
11982 no exception message. */
11983 if (e_msg_len
<= 0)
11986 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
11987 read_memory (value_address (e_msg_val
), (gdb_byte
*) e_msg
.get (),
11989 e_msg
.get ()[e_msg_len
] = '\0';
11994 /* Same as ada_exception_message_1, except that all exceptions are
11995 contained here (returning NULL instead). */
11997 static gdb::unique_xmalloc_ptr
<char>
11998 ada_exception_message (void)
12000 gdb::unique_xmalloc_ptr
<char> e_msg
;
12004 e_msg
= ada_exception_message_1 ();
12006 catch (const gdb_exception_error
&e
)
12008 e_msg
.reset (nullptr);
12014 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12015 any error that ada_exception_name_addr_1 might cause to be thrown.
12016 When an error is intercepted, a warning with the error message is printed,
12017 and zero is returned. */
12020 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12021 struct breakpoint
*b
)
12023 CORE_ADDR result
= 0;
12027 result
= ada_exception_name_addr_1 (ex
, b
);
12030 catch (const gdb_exception_error
&e
)
12032 warning (_("failed to get exception name: %s"), e
.what ());
12039 static std::string ada_exception_catchpoint_cond_string
12040 (const char *excep_string
,
12041 enum ada_exception_catchpoint_kind ex
);
12043 /* Ada catchpoints.
12045 In the case of catchpoints on Ada exceptions, the catchpoint will
12046 stop the target on every exception the program throws. When a user
12047 specifies the name of a specific exception, we translate this
12048 request into a condition expression (in text form), and then parse
12049 it into an expression stored in each of the catchpoint's locations.
12050 We then use this condition to check whether the exception that was
12051 raised is the one the user is interested in. If not, then the
12052 target is resumed again. We store the name of the requested
12053 exception, in order to be able to re-set the condition expression
12054 when symbols change. */
12056 /* An instance of this type is used to represent an Ada catchpoint
12057 breakpoint location. */
12059 class ada_catchpoint_location
: public bp_location
12062 ada_catchpoint_location (breakpoint
*owner
)
12063 : bp_location (owner
, bp_loc_software_breakpoint
)
12066 /* The condition that checks whether the exception that was raised
12067 is the specific exception the user specified on catchpoint
12069 expression_up excep_cond_expr
;
12072 /* An instance of this type is used to represent an Ada catchpoint. */
12074 struct ada_catchpoint
: public breakpoint
12076 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12081 /* The name of the specific exception the user specified. */
12082 std::string excep_string
;
12084 /* What kind of catchpoint this is. */
12085 enum ada_exception_catchpoint_kind m_kind
;
12088 /* Parse the exception condition string in the context of each of the
12089 catchpoint's locations, and store them for later evaluation. */
12092 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12093 enum ada_exception_catchpoint_kind ex
)
12095 struct bp_location
*bl
;
12097 /* Nothing to do if there's no specific exception to catch. */
12098 if (c
->excep_string
.empty ())
12101 /* Same if there are no locations... */
12102 if (c
->loc
== NULL
)
12105 /* Compute the condition expression in text form, from the specific
12106 expection we want to catch. */
12107 std::string cond_string
12108 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12110 /* Iterate over all the catchpoint's locations, and parse an
12111 expression for each. */
12112 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12114 struct ada_catchpoint_location
*ada_loc
12115 = (struct ada_catchpoint_location
*) bl
;
12118 if (!bl
->shlib_disabled
)
12122 s
= cond_string
.c_str ();
12125 exp
= parse_exp_1 (&s
, bl
->address
,
12126 block_for_pc (bl
->address
),
12129 catch (const gdb_exception_error
&e
)
12131 warning (_("failed to reevaluate internal exception condition "
12132 "for catchpoint %d: %s"),
12133 c
->number
, e
.what ());
12137 ada_loc
->excep_cond_expr
= std::move (exp
);
12141 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12142 structure for all exception catchpoint kinds. */
12144 static struct bp_location
*
12145 allocate_location_exception (struct breakpoint
*self
)
12147 return new ada_catchpoint_location (self
);
12150 /* Implement the RE_SET method in the breakpoint_ops structure for all
12151 exception catchpoint kinds. */
12154 re_set_exception (struct breakpoint
*b
)
12156 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12158 /* Call the base class's method. This updates the catchpoint's
12160 bkpt_breakpoint_ops
.re_set (b
);
12162 /* Reparse the exception conditional expressions. One for each
12164 create_excep_cond_exprs (c
, c
->m_kind
);
12167 /* Returns true if we should stop for this breakpoint hit. If the
12168 user specified a specific exception, we only want to cause a stop
12169 if the program thrown that exception. */
12172 should_stop_exception (const struct bp_location
*bl
)
12174 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12175 const struct ada_catchpoint_location
*ada_loc
12176 = (const struct ada_catchpoint_location
*) bl
;
12179 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12180 if (c
->m_kind
== ada_catch_assert
)
12181 clear_internalvar (var
);
12188 if (c
->m_kind
== ada_catch_handlers
)
12189 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12190 ".all.occurrence.id");
12194 struct value
*exc
= parse_and_eval (expr
);
12195 set_internalvar (var
, exc
);
12197 catch (const gdb_exception_error
&ex
)
12199 clear_internalvar (var
);
12203 /* With no specific exception, should always stop. */
12204 if (c
->excep_string
.empty ())
12207 if (ada_loc
->excep_cond_expr
== NULL
)
12209 /* We will have a NULL expression if back when we were creating
12210 the expressions, this location's had failed to parse. */
12217 struct value
*mark
;
12219 mark
= value_mark ();
12220 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12221 value_free_to_mark (mark
);
12223 catch (const gdb_exception
&ex
)
12225 exception_fprintf (gdb_stderr
, ex
,
12226 _("Error in testing exception condition:\n"));
12232 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12233 for all exception catchpoint kinds. */
12236 check_status_exception (bpstat bs
)
12238 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12241 /* Implement the PRINT_IT method in the breakpoint_ops structure
12242 for all exception catchpoint kinds. */
12244 static enum print_stop_action
12245 print_it_exception (bpstat bs
)
12247 struct ui_out
*uiout
= current_uiout
;
12248 struct breakpoint
*b
= bs
->breakpoint_at
;
12250 annotate_catchpoint (b
->number
);
12252 if (uiout
->is_mi_like_p ())
12254 uiout
->field_string ("reason",
12255 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12256 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12259 uiout
->text (b
->disposition
== disp_del
12260 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12261 uiout
->field_signed ("bkptno", b
->number
);
12262 uiout
->text (", ");
12264 /* ada_exception_name_addr relies on the selected frame being the
12265 current frame. Need to do this here because this function may be
12266 called more than once when printing a stop, and below, we'll
12267 select the first frame past the Ada run-time (see
12268 ada_find_printable_frame). */
12269 select_frame (get_current_frame ());
12271 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12274 case ada_catch_exception
:
12275 case ada_catch_exception_unhandled
:
12276 case ada_catch_handlers
:
12278 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12279 char exception_name
[256];
12283 read_memory (addr
, (gdb_byte
*) exception_name
,
12284 sizeof (exception_name
) - 1);
12285 exception_name
[sizeof (exception_name
) - 1] = '\0';
12289 /* For some reason, we were unable to read the exception
12290 name. This could happen if the Runtime was compiled
12291 without debugging info, for instance. In that case,
12292 just replace the exception name by the generic string
12293 "exception" - it will read as "an exception" in the
12294 notification we are about to print. */
12295 memcpy (exception_name
, "exception", sizeof ("exception"));
12297 /* In the case of unhandled exception breakpoints, we print
12298 the exception name as "unhandled EXCEPTION_NAME", to make
12299 it clearer to the user which kind of catchpoint just got
12300 hit. We used ui_out_text to make sure that this extra
12301 info does not pollute the exception name in the MI case. */
12302 if (c
->m_kind
== ada_catch_exception_unhandled
)
12303 uiout
->text ("unhandled ");
12304 uiout
->field_string ("exception-name", exception_name
);
12307 case ada_catch_assert
:
12308 /* In this case, the name of the exception is not really
12309 important. Just print "failed assertion" to make it clearer
12310 that his program just hit an assertion-failure catchpoint.
12311 We used ui_out_text because this info does not belong in
12313 uiout
->text ("failed assertion");
12317 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12318 if (exception_message
!= NULL
)
12320 uiout
->text (" (");
12321 uiout
->field_string ("exception-message", exception_message
.get ());
12325 uiout
->text (" at ");
12326 ada_find_printable_frame (get_current_frame ());
12328 return PRINT_SRC_AND_LOC
;
12331 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12332 for all exception catchpoint kinds. */
12335 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12337 struct ui_out
*uiout
= current_uiout
;
12338 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12339 struct value_print_options opts
;
12341 get_user_print_options (&opts
);
12343 if (opts
.addressprint
)
12344 uiout
->field_skip ("addr");
12346 annotate_field (5);
12349 case ada_catch_exception
:
12350 if (!c
->excep_string
.empty ())
12352 std::string msg
= string_printf (_("`%s' Ada exception"),
12353 c
->excep_string
.c_str ());
12355 uiout
->field_string ("what", msg
);
12358 uiout
->field_string ("what", "all Ada exceptions");
12362 case ada_catch_exception_unhandled
:
12363 uiout
->field_string ("what", "unhandled Ada exceptions");
12366 case ada_catch_handlers
:
12367 if (!c
->excep_string
.empty ())
12369 uiout
->field_fmt ("what",
12370 _("`%s' Ada exception handlers"),
12371 c
->excep_string
.c_str ());
12374 uiout
->field_string ("what", "all Ada exceptions handlers");
12377 case ada_catch_assert
:
12378 uiout
->field_string ("what", "failed Ada assertions");
12382 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12387 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12388 for all exception catchpoint kinds. */
12391 print_mention_exception (struct breakpoint
*b
)
12393 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12394 struct ui_out
*uiout
= current_uiout
;
12396 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12397 : _("Catchpoint "));
12398 uiout
->field_signed ("bkptno", b
->number
);
12399 uiout
->text (": ");
12403 case ada_catch_exception
:
12404 if (!c
->excep_string
.empty ())
12406 std::string info
= string_printf (_("`%s' Ada exception"),
12407 c
->excep_string
.c_str ());
12408 uiout
->text (info
.c_str ());
12411 uiout
->text (_("all Ada exceptions"));
12414 case ada_catch_exception_unhandled
:
12415 uiout
->text (_("unhandled Ada exceptions"));
12418 case ada_catch_handlers
:
12419 if (!c
->excep_string
.empty ())
12422 = string_printf (_("`%s' Ada exception handlers"),
12423 c
->excep_string
.c_str ());
12424 uiout
->text (info
.c_str ());
12427 uiout
->text (_("all Ada exceptions handlers"));
12430 case ada_catch_assert
:
12431 uiout
->text (_("failed Ada assertions"));
12435 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12440 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12441 for all exception catchpoint kinds. */
12444 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12446 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12450 case ada_catch_exception
:
12451 fprintf_filtered (fp
, "catch exception");
12452 if (!c
->excep_string
.empty ())
12453 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12456 case ada_catch_exception_unhandled
:
12457 fprintf_filtered (fp
, "catch exception unhandled");
12460 case ada_catch_handlers
:
12461 fprintf_filtered (fp
, "catch handlers");
12464 case ada_catch_assert
:
12465 fprintf_filtered (fp
, "catch assert");
12469 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12471 print_recreate_thread (b
, fp
);
12474 /* Virtual tables for various breakpoint types. */
12475 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12476 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12477 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12478 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12480 /* See ada-lang.h. */
12483 is_ada_exception_catchpoint (breakpoint
*bp
)
12485 return (bp
->ops
== &catch_exception_breakpoint_ops
12486 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12487 || bp
->ops
== &catch_assert_breakpoint_ops
12488 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12491 /* Split the arguments specified in a "catch exception" command.
12492 Set EX to the appropriate catchpoint type.
12493 Set EXCEP_STRING to the name of the specific exception if
12494 specified by the user.
12495 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12496 "catch handlers" command. False otherwise.
12497 If a condition is found at the end of the arguments, the condition
12498 expression is stored in COND_STRING (memory must be deallocated
12499 after use). Otherwise COND_STRING is set to NULL. */
12502 catch_ada_exception_command_split (const char *args
,
12503 bool is_catch_handlers_cmd
,
12504 enum ada_exception_catchpoint_kind
*ex
,
12505 std::string
*excep_string
,
12506 std::string
*cond_string
)
12508 std::string exception_name
;
12510 exception_name
= extract_arg (&args
);
12511 if (exception_name
== "if")
12513 /* This is not an exception name; this is the start of a condition
12514 expression for a catchpoint on all exceptions. So, "un-get"
12515 this token, and set exception_name to NULL. */
12516 exception_name
.clear ();
12520 /* Check to see if we have a condition. */
12522 args
= skip_spaces (args
);
12523 if (startswith (args
, "if")
12524 && (isspace (args
[2]) || args
[2] == '\0'))
12527 args
= skip_spaces (args
);
12529 if (args
[0] == '\0')
12530 error (_("Condition missing after `if' keyword"));
12531 *cond_string
= args
;
12533 args
+= strlen (args
);
12536 /* Check that we do not have any more arguments. Anything else
12539 if (args
[0] != '\0')
12540 error (_("Junk at end of expression"));
12542 if (is_catch_handlers_cmd
)
12544 /* Catch handling of exceptions. */
12545 *ex
= ada_catch_handlers
;
12546 *excep_string
= exception_name
;
12548 else if (exception_name
.empty ())
12550 /* Catch all exceptions. */
12551 *ex
= ada_catch_exception
;
12552 excep_string
->clear ();
12554 else if (exception_name
== "unhandled")
12556 /* Catch unhandled exceptions. */
12557 *ex
= ada_catch_exception_unhandled
;
12558 excep_string
->clear ();
12562 /* Catch a specific exception. */
12563 *ex
= ada_catch_exception
;
12564 *excep_string
= exception_name
;
12568 /* Return the name of the symbol on which we should break in order to
12569 implement a catchpoint of the EX kind. */
12571 static const char *
12572 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12574 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12576 gdb_assert (data
->exception_info
!= NULL
);
12580 case ada_catch_exception
:
12581 return (data
->exception_info
->catch_exception_sym
);
12583 case ada_catch_exception_unhandled
:
12584 return (data
->exception_info
->catch_exception_unhandled_sym
);
12586 case ada_catch_assert
:
12587 return (data
->exception_info
->catch_assert_sym
);
12589 case ada_catch_handlers
:
12590 return (data
->exception_info
->catch_handlers_sym
);
12593 internal_error (__FILE__
, __LINE__
,
12594 _("unexpected catchpoint kind (%d)"), ex
);
12598 /* Return the breakpoint ops "virtual table" used for catchpoints
12601 static const struct breakpoint_ops
*
12602 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12606 case ada_catch_exception
:
12607 return (&catch_exception_breakpoint_ops
);
12609 case ada_catch_exception_unhandled
:
12610 return (&catch_exception_unhandled_breakpoint_ops
);
12612 case ada_catch_assert
:
12613 return (&catch_assert_breakpoint_ops
);
12615 case ada_catch_handlers
:
12616 return (&catch_handlers_breakpoint_ops
);
12619 internal_error (__FILE__
, __LINE__
,
12620 _("unexpected catchpoint kind (%d)"), ex
);
12624 /* Return the condition that will be used to match the current exception
12625 being raised with the exception that the user wants to catch. This
12626 assumes that this condition is used when the inferior just triggered
12627 an exception catchpoint.
12628 EX: the type of catchpoints used for catching Ada exceptions. */
12631 ada_exception_catchpoint_cond_string (const char *excep_string
,
12632 enum ada_exception_catchpoint_kind ex
)
12635 bool is_standard_exc
= false;
12636 std::string result
;
12638 if (ex
== ada_catch_handlers
)
12640 /* For exception handlers catchpoints, the condition string does
12641 not use the same parameter as for the other exceptions. */
12642 result
= ("long_integer (GNAT_GCC_exception_Access"
12643 "(gcc_exception).all.occurrence.id)");
12646 result
= "long_integer (e)";
12648 /* The standard exceptions are a special case. They are defined in
12649 runtime units that have been compiled without debugging info; if
12650 EXCEP_STRING is the not-fully-qualified name of a standard
12651 exception (e.g. "constraint_error") then, during the evaluation
12652 of the condition expression, the symbol lookup on this name would
12653 *not* return this standard exception. The catchpoint condition
12654 may then be set only on user-defined exceptions which have the
12655 same not-fully-qualified name (e.g. my_package.constraint_error).
12657 To avoid this unexcepted behavior, these standard exceptions are
12658 systematically prefixed by "standard". This means that "catch
12659 exception constraint_error" is rewritten into "catch exception
12660 standard.constraint_error".
12662 If an exception named constraint_error is defined in another package of
12663 the inferior program, then the only way to specify this exception as a
12664 breakpoint condition is to use its fully-qualified named:
12665 e.g. my_package.constraint_error. */
12667 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12669 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12671 is_standard_exc
= true;
12678 if (is_standard_exc
)
12679 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12681 string_appendf (result
, "long_integer (&%s)", excep_string
);
12686 /* Return the symtab_and_line that should be used to insert an exception
12687 catchpoint of the TYPE kind.
12689 ADDR_STRING returns the name of the function where the real
12690 breakpoint that implements the catchpoints is set, depending on the
12691 type of catchpoint we need to create. */
12693 static struct symtab_and_line
12694 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12695 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12697 const char *sym_name
;
12698 struct symbol
*sym
;
12700 /* First, find out which exception support info to use. */
12701 ada_exception_support_info_sniffer ();
12703 /* Then lookup the function on which we will break in order to catch
12704 the Ada exceptions requested by the user. */
12705 sym_name
= ada_exception_sym_name (ex
);
12706 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12709 error (_("Catchpoint symbol not found: %s"), sym_name
);
12711 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12712 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12714 /* Set ADDR_STRING. */
12715 *addr_string
= sym_name
;
12718 *ops
= ada_exception_breakpoint_ops (ex
);
12720 return find_function_start_sal (sym
, 1);
12723 /* Create an Ada exception catchpoint.
12725 EX_KIND is the kind of exception catchpoint to be created.
12727 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12728 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12729 of the exception to which this catchpoint applies.
12731 COND_STRING, if not empty, is the catchpoint condition.
12733 TEMPFLAG, if nonzero, means that the underlying breakpoint
12734 should be temporary.
12736 FROM_TTY is the usual argument passed to all commands implementations. */
12739 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12740 enum ada_exception_catchpoint_kind ex_kind
,
12741 const std::string
&excep_string
,
12742 const std::string
&cond_string
,
12747 std::string addr_string
;
12748 const struct breakpoint_ops
*ops
= NULL
;
12749 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12751 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12752 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12753 ops
, tempflag
, disabled
, from_tty
);
12754 c
->excep_string
= excep_string
;
12755 create_excep_cond_exprs (c
.get (), ex_kind
);
12756 if (!cond_string
.empty ())
12757 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
, false);
12758 install_breakpoint (0, std::move (c
), 1);
12761 /* Implement the "catch exception" command. */
12764 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12765 struct cmd_list_element
*command
)
12767 const char *arg
= arg_entry
;
12768 struct gdbarch
*gdbarch
= get_current_arch ();
12770 enum ada_exception_catchpoint_kind ex_kind
;
12771 std::string excep_string
;
12772 std::string cond_string
;
12774 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12778 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12780 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12781 excep_string
, cond_string
,
12782 tempflag
, 1 /* enabled */,
12786 /* Implement the "catch handlers" command. */
12789 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12790 struct cmd_list_element
*command
)
12792 const char *arg
= arg_entry
;
12793 struct gdbarch
*gdbarch
= get_current_arch ();
12795 enum ada_exception_catchpoint_kind ex_kind
;
12796 std::string excep_string
;
12797 std::string cond_string
;
12799 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12803 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
12805 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12806 excep_string
, cond_string
,
12807 tempflag
, 1 /* enabled */,
12811 /* Completion function for the Ada "catch" commands. */
12814 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
12815 const char *text
, const char *word
)
12817 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
12819 for (const ada_exc_info
&info
: exceptions
)
12821 if (startswith (info
.name
, word
))
12822 tracker
.add_completion (make_unique_xstrdup (info
.name
));
12826 /* Split the arguments specified in a "catch assert" command.
12828 ARGS contains the command's arguments (or the empty string if
12829 no arguments were passed).
12831 If ARGS contains a condition, set COND_STRING to that condition
12832 (the memory needs to be deallocated after use). */
12835 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
12837 args
= skip_spaces (args
);
12839 /* Check whether a condition was provided. */
12840 if (startswith (args
, "if")
12841 && (isspace (args
[2]) || args
[2] == '\0'))
12844 args
= skip_spaces (args
);
12845 if (args
[0] == '\0')
12846 error (_("condition missing after `if' keyword"));
12847 cond_string
.assign (args
);
12850 /* Otherwise, there should be no other argument at the end of
12852 else if (args
[0] != '\0')
12853 error (_("Junk at end of arguments."));
12856 /* Implement the "catch assert" command. */
12859 catch_assert_command (const char *arg_entry
, int from_tty
,
12860 struct cmd_list_element
*command
)
12862 const char *arg
= arg_entry
;
12863 struct gdbarch
*gdbarch
= get_current_arch ();
12865 std::string cond_string
;
12867 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12871 catch_ada_assert_command_split (arg
, cond_string
);
12872 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12874 tempflag
, 1 /* enabled */,
12878 /* Return non-zero if the symbol SYM is an Ada exception object. */
12881 ada_is_exception_sym (struct symbol
*sym
)
12883 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
12885 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12886 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12887 && SYMBOL_CLASS (sym
) != LOC_CONST
12888 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12889 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12892 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12893 Ada exception object. This matches all exceptions except the ones
12894 defined by the Ada language. */
12897 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12901 if (!ada_is_exception_sym (sym
))
12904 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12905 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
12906 return 0; /* A standard exception. */
12908 /* Numeric_Error is also a standard exception, so exclude it.
12909 See the STANDARD_EXC description for more details as to why
12910 this exception is not listed in that array. */
12911 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
12917 /* A helper function for std::sort, comparing two struct ada_exc_info
12920 The comparison is determined first by exception name, and then
12921 by exception address. */
12924 ada_exc_info::operator< (const ada_exc_info
&other
) const
12928 result
= strcmp (name
, other
.name
);
12931 if (result
== 0 && addr
< other
.addr
)
12937 ada_exc_info::operator== (const ada_exc_info
&other
) const
12939 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
12942 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12943 routine, but keeping the first SKIP elements untouched.
12945 All duplicates are also removed. */
12948 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
12951 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
12952 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
12953 exceptions
->end ());
12956 /* Add all exceptions defined by the Ada standard whose name match
12957 a regular expression.
12959 If PREG is not NULL, then this regexp_t object is used to
12960 perform the symbol name matching. Otherwise, no name-based
12961 filtering is performed.
12963 EXCEPTIONS is a vector of exceptions to which matching exceptions
12967 ada_add_standard_exceptions (compiled_regex
*preg
,
12968 std::vector
<ada_exc_info
> *exceptions
)
12972 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12975 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
12977 struct bound_minimal_symbol msymbol
12978 = ada_lookup_simple_minsym (standard_exc
[i
]);
12980 if (msymbol
.minsym
!= NULL
)
12982 struct ada_exc_info info
12983 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12985 exceptions
->push_back (info
);
12991 /* Add all Ada exceptions defined locally and accessible from the given
12994 If PREG is not NULL, then this regexp_t object is used to
12995 perform the symbol name matching. Otherwise, no name-based
12996 filtering is performed.
12998 EXCEPTIONS is a vector of exceptions to which matching exceptions
13002 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13003 struct frame_info
*frame
,
13004 std::vector
<ada_exc_info
> *exceptions
)
13006 const struct block
*block
= get_frame_block (frame
, 0);
13010 struct block_iterator iter
;
13011 struct symbol
*sym
;
13013 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13015 switch (SYMBOL_CLASS (sym
))
13022 if (ada_is_exception_sym (sym
))
13024 struct ada_exc_info info
= {sym
->print_name (),
13025 SYMBOL_VALUE_ADDRESS (sym
)};
13027 exceptions
->push_back (info
);
13031 if (BLOCK_FUNCTION (block
) != NULL
)
13033 block
= BLOCK_SUPERBLOCK (block
);
13037 /* Return true if NAME matches PREG or if PREG is NULL. */
13040 name_matches_regex (const char *name
, compiled_regex
*preg
)
13042 return (preg
== NULL
13043 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13046 /* Add all exceptions defined globally whose name name match
13047 a regular expression, excluding standard exceptions.
13049 The reason we exclude standard exceptions is that they need
13050 to be handled separately: Standard exceptions are defined inside
13051 a runtime unit which is normally not compiled with debugging info,
13052 and thus usually do not show up in our symbol search. However,
13053 if the unit was in fact built with debugging info, we need to
13054 exclude them because they would duplicate the entry we found
13055 during the special loop that specifically searches for those
13056 standard exceptions.
13058 If PREG is not NULL, then this regexp_t object is used to
13059 perform the symbol name matching. Otherwise, no name-based
13060 filtering is performed.
13062 EXCEPTIONS is a vector of exceptions to which matching exceptions
13066 ada_add_global_exceptions (compiled_regex
*preg
,
13067 std::vector
<ada_exc_info
> *exceptions
)
13069 /* In Ada, the symbol "search name" is a linkage name, whereas the
13070 regular expression used to do the matching refers to the natural
13071 name. So match against the decoded name. */
13072 expand_symtabs_matching (NULL
,
13073 lookup_name_info::match_any (),
13074 [&] (const char *search_name
)
13076 std::string decoded
= ada_decode (search_name
);
13077 return name_matches_regex (decoded
.c_str (), preg
);
13082 for (objfile
*objfile
: current_program_space
->objfiles ())
13084 for (compunit_symtab
*s
: objfile
->compunits ())
13086 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13089 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13091 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13092 struct block_iterator iter
;
13093 struct symbol
*sym
;
13095 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13096 if (ada_is_non_standard_exception_sym (sym
)
13097 && name_matches_regex (sym
->natural_name (), preg
))
13099 struct ada_exc_info info
13100 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13102 exceptions
->push_back (info
);
13109 /* Implements ada_exceptions_list with the regular expression passed
13110 as a regex_t, rather than a string.
13112 If not NULL, PREG is used to filter out exceptions whose names
13113 do not match. Otherwise, all exceptions are listed. */
13115 static std::vector
<ada_exc_info
>
13116 ada_exceptions_list_1 (compiled_regex
*preg
)
13118 std::vector
<ada_exc_info
> result
;
13121 /* First, list the known standard exceptions. These exceptions
13122 need to be handled separately, as they are usually defined in
13123 runtime units that have been compiled without debugging info. */
13125 ada_add_standard_exceptions (preg
, &result
);
13127 /* Next, find all exceptions whose scope is local and accessible
13128 from the currently selected frame. */
13130 if (has_stack_frames ())
13132 prev_len
= result
.size ();
13133 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13135 if (result
.size () > prev_len
)
13136 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13139 /* Add all exceptions whose scope is global. */
13141 prev_len
= result
.size ();
13142 ada_add_global_exceptions (preg
, &result
);
13143 if (result
.size () > prev_len
)
13144 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13149 /* Return a vector of ada_exc_info.
13151 If REGEXP is NULL, all exceptions are included in the result.
13152 Otherwise, it should contain a valid regular expression,
13153 and only the exceptions whose names match that regular expression
13154 are included in the result.
13156 The exceptions are sorted in the following order:
13157 - Standard exceptions (defined by the Ada language), in
13158 alphabetical order;
13159 - Exceptions only visible from the current frame, in
13160 alphabetical order;
13161 - Exceptions whose scope is global, in alphabetical order. */
13163 std::vector
<ada_exc_info
>
13164 ada_exceptions_list (const char *regexp
)
13166 if (regexp
== NULL
)
13167 return ada_exceptions_list_1 (NULL
);
13169 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13170 return ada_exceptions_list_1 (®
);
13173 /* Implement the "info exceptions" command. */
13176 info_exceptions_command (const char *regexp
, int from_tty
)
13178 struct gdbarch
*gdbarch
= get_current_arch ();
13180 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13182 if (regexp
!= NULL
)
13184 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13186 printf_filtered (_("All defined Ada exceptions:\n"));
13188 for (const ada_exc_info
&info
: exceptions
)
13189 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13193 /* Information about operators given special treatment in functions
13195 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13197 #define ADA_OPERATORS \
13198 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13199 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13200 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13201 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13202 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13203 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13204 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13205 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13206 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13207 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13208 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13209 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13210 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13211 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13212 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13213 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13214 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13215 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13216 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13219 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13222 switch (exp
->elts
[pc
- 1].opcode
)
13225 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13228 #define OP_DEFN(op, len, args, binop) \
13229 case op: *oplenp = len; *argsp = args; break;
13235 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13240 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13245 /* Implementation of the exp_descriptor method operator_check. */
13248 ada_operator_check (struct expression
*exp
, int pos
,
13249 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13252 const union exp_element
*const elts
= exp
->elts
;
13253 struct type
*type
= NULL
;
13255 switch (elts
[pos
].opcode
)
13257 case UNOP_IN_RANGE
:
13259 type
= elts
[pos
+ 1].type
;
13263 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13266 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13268 if (type
&& TYPE_OBJFILE (type
)
13269 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13275 static const char *
13276 ada_op_name (enum exp_opcode opcode
)
13281 return op_name_standard (opcode
);
13283 #define OP_DEFN(op, len, args, binop) case op: return #op;
13288 return "OP_AGGREGATE";
13290 return "OP_CHOICES";
13296 /* As for operator_length, but assumes PC is pointing at the first
13297 element of the operator, and gives meaningful results only for the
13298 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13301 ada_forward_operator_length (struct expression
*exp
, int pc
,
13302 int *oplenp
, int *argsp
)
13304 switch (exp
->elts
[pc
].opcode
)
13307 *oplenp
= *argsp
= 0;
13310 #define OP_DEFN(op, len, args, binop) \
13311 case op: *oplenp = len; *argsp = args; break;
13317 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13322 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13328 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13330 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13338 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13340 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13345 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13349 /* Ada attributes ('Foo). */
13352 case OP_ATR_LENGTH
:
13356 case OP_ATR_MODULUS
:
13363 case UNOP_IN_RANGE
:
13365 /* XXX: gdb_sprint_host_address, type_sprint */
13366 fprintf_filtered (stream
, _("Type @"));
13367 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13368 fprintf_filtered (stream
, " (");
13369 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13370 fprintf_filtered (stream
, ")");
13372 case BINOP_IN_BOUNDS
:
13373 fprintf_filtered (stream
, " (%d)",
13374 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13376 case TERNOP_IN_RANGE
:
13381 case OP_DISCRETE_RANGE
:
13382 case OP_POSITIONAL
:
13389 char *name
= &exp
->elts
[elt
+ 2].string
;
13390 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13392 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13397 return dump_subexp_body_standard (exp
, stream
, elt
);
13401 for (i
= 0; i
< nargs
; i
+= 1)
13402 elt
= dump_subexp (exp
, stream
, elt
);
13407 /* The Ada extension of print_subexp (q.v.). */
13410 ada_print_subexp (struct expression
*exp
, int *pos
,
13411 struct ui_file
*stream
, enum precedence prec
)
13413 int oplen
, nargs
, i
;
13415 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13417 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13424 print_subexp_standard (exp
, pos
, stream
, prec
);
13428 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13431 case BINOP_IN_BOUNDS
:
13432 /* XXX: sprint_subexp */
13433 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13434 fputs_filtered (" in ", stream
);
13435 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13436 fputs_filtered ("'range", stream
);
13437 if (exp
->elts
[pc
+ 1].longconst
> 1)
13438 fprintf_filtered (stream
, "(%ld)",
13439 (long) exp
->elts
[pc
+ 1].longconst
);
13442 case TERNOP_IN_RANGE
:
13443 if (prec
>= PREC_EQUAL
)
13444 fputs_filtered ("(", stream
);
13445 /* XXX: sprint_subexp */
13446 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13447 fputs_filtered (" in ", stream
);
13448 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13449 fputs_filtered (" .. ", stream
);
13450 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13451 if (prec
>= PREC_EQUAL
)
13452 fputs_filtered (")", stream
);
13457 case OP_ATR_LENGTH
:
13461 case OP_ATR_MODULUS
:
13466 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13468 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13469 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13470 &type_print_raw_options
);
13474 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13475 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13480 for (tem
= 1; tem
< nargs
; tem
+= 1)
13482 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13483 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13485 fputs_filtered (")", stream
);
13490 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13491 fputs_filtered ("'(", stream
);
13492 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13493 fputs_filtered (")", stream
);
13496 case UNOP_IN_RANGE
:
13497 /* XXX: sprint_subexp */
13498 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13499 fputs_filtered (" in ", stream
);
13500 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13501 &type_print_raw_options
);
13504 case OP_DISCRETE_RANGE
:
13505 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13506 fputs_filtered ("..", stream
);
13507 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13511 fputs_filtered ("others => ", stream
);
13512 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13516 for (i
= 0; i
< nargs
-1; i
+= 1)
13519 fputs_filtered ("|", stream
);
13520 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13522 fputs_filtered (" => ", stream
);
13523 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13526 case OP_POSITIONAL
:
13527 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13531 fputs_filtered ("(", stream
);
13532 for (i
= 0; i
< nargs
; i
+= 1)
13535 fputs_filtered (", ", stream
);
13536 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13538 fputs_filtered (")", stream
);
13543 /* Table mapping opcodes into strings for printing operators
13544 and precedences of the operators. */
13546 static const struct op_print ada_op_print_tab
[] = {
13547 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13548 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13549 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13550 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13551 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13552 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13553 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13554 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13555 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13556 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13557 {">", BINOP_GTR
, PREC_ORDER
, 0},
13558 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13559 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13560 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13561 {"+", BINOP_ADD
, PREC_ADD
, 0},
13562 {"-", BINOP_SUB
, PREC_ADD
, 0},
13563 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13564 {"*", BINOP_MUL
, PREC_MUL
, 0},
13565 {"/", BINOP_DIV
, PREC_MUL
, 0},
13566 {"rem", BINOP_REM
, PREC_MUL
, 0},
13567 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13568 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13569 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13570 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13571 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13572 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13573 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13574 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13575 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13576 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13577 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13578 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13581 enum ada_primitive_types
{
13582 ada_primitive_type_int
,
13583 ada_primitive_type_long
,
13584 ada_primitive_type_short
,
13585 ada_primitive_type_char
,
13586 ada_primitive_type_float
,
13587 ada_primitive_type_double
,
13588 ada_primitive_type_void
,
13589 ada_primitive_type_long_long
,
13590 ada_primitive_type_long_double
,
13591 ada_primitive_type_natural
,
13592 ada_primitive_type_positive
,
13593 ada_primitive_type_system_address
,
13594 ada_primitive_type_storage_offset
,
13595 nr_ada_primitive_types
13599 /* Language vector */
13601 static const struct exp_descriptor ada_exp_descriptor
= {
13603 ada_operator_length
,
13604 ada_operator_check
,
13606 ada_dump_subexp_body
,
13607 ada_evaluate_subexp
13610 /* symbol_name_matcher_ftype adapter for wild_match. */
13613 do_wild_match (const char *symbol_search_name
,
13614 const lookup_name_info
&lookup_name
,
13615 completion_match_result
*comp_match_res
)
13617 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13620 /* symbol_name_matcher_ftype adapter for full_match. */
13623 do_full_match (const char *symbol_search_name
,
13624 const lookup_name_info
&lookup_name
,
13625 completion_match_result
*comp_match_res
)
13627 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13630 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13633 do_exact_match (const char *symbol_search_name
,
13634 const lookup_name_info
&lookup_name
,
13635 completion_match_result
*comp_match_res
)
13637 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13640 /* Build the Ada lookup name for LOOKUP_NAME. */
13642 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13644 gdb::string_view user_name
= lookup_name
.name ();
13646 if (user_name
[0] == '<')
13648 if (user_name
.back () == '>')
13650 = gdb::to_string (user_name
.substr (1, user_name
.size () - 2));
13653 = gdb::to_string (user_name
.substr (1, user_name
.size () - 1));
13654 m_encoded_p
= true;
13655 m_verbatim_p
= true;
13656 m_wild_match_p
= false;
13657 m_standard_p
= false;
13661 m_verbatim_p
= false;
13663 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13667 const char *folded
= ada_fold_name (user_name
);
13668 m_encoded_name
= ada_encode_1 (folded
, false);
13669 if (m_encoded_name
.empty ())
13670 m_encoded_name
= gdb::to_string (user_name
);
13673 m_encoded_name
= gdb::to_string (user_name
);
13675 /* Handle the 'package Standard' special case. See description
13676 of m_standard_p. */
13677 if (startswith (m_encoded_name
.c_str (), "standard__"))
13679 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13680 m_standard_p
= true;
13683 m_standard_p
= false;
13685 /* If the name contains a ".", then the user is entering a fully
13686 qualified entity name, and the match must not be done in wild
13687 mode. Similarly, if the user wants to complete what looks
13688 like an encoded name, the match must not be done in wild
13689 mode. Also, in the standard__ special case always do
13690 non-wild matching. */
13692 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13695 && user_name
.find ('.') == std::string::npos
);
13699 /* symbol_name_matcher_ftype method for Ada. This only handles
13700 completion mode. */
13703 ada_symbol_name_matches (const char *symbol_search_name
,
13704 const lookup_name_info
&lookup_name
,
13705 completion_match_result
*comp_match_res
)
13707 return lookup_name
.ada ().matches (symbol_search_name
,
13708 lookup_name
.match_type (),
13712 /* A name matcher that matches the symbol name exactly, with
13716 literal_symbol_name_matcher (const char *symbol_search_name
,
13717 const lookup_name_info
&lookup_name
,
13718 completion_match_result
*comp_match_res
)
13720 gdb::string_view name_view
= lookup_name
.name ();
13722 if (lookup_name
.completion_mode ()
13723 ? (strncmp (symbol_search_name
, name_view
.data (),
13724 name_view
.size ()) == 0)
13725 : symbol_search_name
== name_view
)
13727 if (comp_match_res
!= NULL
)
13728 comp_match_res
->set_match (symbol_search_name
);
13735 /* Implement the "get_symbol_name_matcher" language_defn method for
13738 static symbol_name_matcher_ftype
*
13739 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
13741 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
13742 return literal_symbol_name_matcher
;
13744 if (lookup_name
.completion_mode ())
13745 return ada_symbol_name_matches
;
13748 if (lookup_name
.ada ().wild_match_p ())
13749 return do_wild_match
;
13750 else if (lookup_name
.ada ().verbatim_p ())
13751 return do_exact_match
;
13753 return do_full_match
;
13757 /* Class representing the Ada language. */
13759 class ada_language
: public language_defn
13763 : language_defn (language_ada
)
13766 /* See language.h. */
13768 const char *name () const override
13771 /* See language.h. */
13773 const char *natural_name () const override
13776 /* See language.h. */
13778 const std::vector
<const char *> &filename_extensions () const override
13780 static const std::vector
<const char *> extensions
13781 = { ".adb", ".ads", ".a", ".ada", ".dg" };
13785 /* Print an array element index using the Ada syntax. */
13787 void print_array_index (struct type
*index_type
,
13789 struct ui_file
*stream
,
13790 const value_print_options
*options
) const override
13792 struct value
*index_value
= val_atr (index_type
, index
);
13794 value_print (index_value
, stream
, options
);
13795 fprintf_filtered (stream
, " => ");
13798 /* Implement the "read_var_value" language_defn method for Ada. */
13800 struct value
*read_var_value (struct symbol
*var
,
13801 const struct block
*var_block
,
13802 struct frame_info
*frame
) const override
13804 /* The only case where default_read_var_value is not sufficient
13805 is when VAR is a renaming... */
13806 if (frame
!= nullptr)
13808 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
13809 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
13810 return ada_read_renaming_var_value (var
, frame_block
);
13813 /* This is a typical case where we expect the default_read_var_value
13814 function to work. */
13815 return language_defn::read_var_value (var
, var_block
, frame
);
13818 /* See language.h. */
13819 void language_arch_info (struct gdbarch
*gdbarch
,
13820 struct language_arch_info
*lai
) const override
13822 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13824 lai
->primitive_type_vector
13825 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13828 lai
->primitive_type_vector
[ada_primitive_type_int
]
13829 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13831 lai
->primitive_type_vector
[ada_primitive_type_long
]
13832 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13833 0, "long_integer");
13834 lai
->primitive_type_vector
[ada_primitive_type_short
]
13835 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13836 0, "short_integer");
13837 lai
->string_char_type
13838 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13839 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13840 lai
->primitive_type_vector
[ada_primitive_type_float
]
13841 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13842 "float", gdbarch_float_format (gdbarch
));
13843 lai
->primitive_type_vector
[ada_primitive_type_double
]
13844 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13845 "long_float", gdbarch_double_format (gdbarch
));
13846 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13847 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13848 0, "long_long_integer");
13849 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13850 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13851 "long_long_float", gdbarch_long_double_format (gdbarch
));
13852 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13853 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13855 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13856 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13858 lai
->primitive_type_vector
[ada_primitive_type_void
]
13859 = builtin
->builtin_void
;
13861 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13862 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13864 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13865 ->set_name ("system__address");
13867 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13868 type. This is a signed integral type whose size is the same as
13869 the size of addresses. */
13871 unsigned int addr_length
= TYPE_LENGTH
13872 (lai
->primitive_type_vector
[ada_primitive_type_system_address
]);
13874 lai
->primitive_type_vector
[ada_primitive_type_storage_offset
]
13875 = arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13879 lai
->bool_type_symbol
= NULL
;
13880 lai
->bool_type_default
= builtin
->builtin_bool
;
13883 /* See language.h. */
13885 bool iterate_over_symbols
13886 (const struct block
*block
, const lookup_name_info
&name
,
13887 domain_enum domain
,
13888 gdb::function_view
<symbol_found_callback_ftype
> callback
) const override
13890 std::vector
<struct block_symbol
> results
;
13892 ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
13893 for (block_symbol
&sym
: results
)
13895 if (!callback (&sym
))
13902 /* See language.h. */
13903 bool sniff_from_mangled_name (const char *mangled
,
13904 char **out
) const override
13906 std::string demangled
= ada_decode (mangled
);
13910 if (demangled
!= mangled
&& demangled
[0] != '<')
13912 /* Set the gsymbol language to Ada, but still return 0.
13913 Two reasons for that:
13915 1. For Ada, we prefer computing the symbol's decoded name
13916 on the fly rather than pre-compute it, in order to save
13917 memory (Ada projects are typically very large).
13919 2. There are some areas in the definition of the GNAT
13920 encoding where, with a bit of bad luck, we might be able
13921 to decode a non-Ada symbol, generating an incorrect
13922 demangled name (Eg: names ending with "TB" for instance
13923 are identified as task bodies and so stripped from
13924 the decoded name returned).
13926 Returning true, here, but not setting *DEMANGLED, helps us get
13927 a little bit of the best of both worlds. Because we're last,
13928 we should not affect any of the other languages that were
13929 able to demangle the symbol before us; we get to correctly
13930 tag Ada symbols as such; and even if we incorrectly tagged a
13931 non-Ada symbol, which should be rare, any routing through the
13932 Ada language should be transparent (Ada tries to behave much
13933 like C/C++ with non-Ada symbols). */
13940 /* See language.h. */
13942 char *demangle_symbol (const char *mangled
, int options
) const override
13944 return ada_la_decode (mangled
, options
);
13947 /* See language.h. */
13949 void print_type (struct type
*type
, const char *varstring
,
13950 struct ui_file
*stream
, int show
, int level
,
13951 const struct type_print_options
*flags
) const override
13953 ada_print_type (type
, varstring
, stream
, show
, level
, flags
);
13956 /* See language.h. */
13958 const char *word_break_characters (void) const override
13960 return ada_completer_word_break_characters
;
13963 /* See language.h. */
13965 void collect_symbol_completion_matches (completion_tracker
&tracker
,
13966 complete_symbol_mode mode
,
13967 symbol_name_match_type name_match_type
,
13968 const char *text
, const char *word
,
13969 enum type_code code
) const override
13971 struct symbol
*sym
;
13972 const struct block
*b
, *surrounding_static_block
= 0;
13973 struct block_iterator iter
;
13975 gdb_assert (code
== TYPE_CODE_UNDEF
);
13977 lookup_name_info
lookup_name (text
, name_match_type
, true);
13979 /* First, look at the partial symtab symbols. */
13980 expand_symtabs_matching (NULL
,
13986 /* At this point scan through the misc symbol vectors and add each
13987 symbol you find to the list. Eventually we want to ignore
13988 anything that isn't a text symbol (everything else will be
13989 handled by the psymtab code above). */
13991 for (objfile
*objfile
: current_program_space
->objfiles ())
13993 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
13997 if (completion_skip_symbol (mode
, msymbol
))
14000 language symbol_language
= msymbol
->language ();
14002 /* Ada minimal symbols won't have their language set to Ada. If
14003 we let completion_list_add_name compare using the
14004 default/C-like matcher, then when completing e.g., symbols in a
14005 package named "pck", we'd match internal Ada symbols like
14006 "pckS", which are invalid in an Ada expression, unless you wrap
14007 them in '<' '>' to request a verbatim match.
14009 Unfortunately, some Ada encoded names successfully demangle as
14010 C++ symbols (using an old mangling scheme), such as "name__2Xn"
14011 -> "Xn::name(void)" and thus some Ada minimal symbols end up
14012 with the wrong language set. Paper over that issue here. */
14013 if (symbol_language
== language_auto
14014 || symbol_language
== language_cplus
)
14015 symbol_language
= language_ada
;
14017 completion_list_add_name (tracker
,
14019 msymbol
->linkage_name (),
14020 lookup_name
, text
, word
);
14024 /* Search upwards from currently selected frame (so that we can
14025 complete on local vars. */
14027 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
14029 if (!BLOCK_SUPERBLOCK (b
))
14030 surrounding_static_block
= b
; /* For elmin of dups */
14032 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14034 if (completion_skip_symbol (mode
, sym
))
14037 completion_list_add_name (tracker
,
14039 sym
->linkage_name (),
14040 lookup_name
, text
, word
);
14044 /* Go through the symtabs and check the externs and statics for
14045 symbols which match. */
14047 for (objfile
*objfile
: current_program_space
->objfiles ())
14049 for (compunit_symtab
*s
: objfile
->compunits ())
14052 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
14053 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14055 if (completion_skip_symbol (mode
, sym
))
14058 completion_list_add_name (tracker
,
14060 sym
->linkage_name (),
14061 lookup_name
, text
, word
);
14066 for (objfile
*objfile
: current_program_space
->objfiles ())
14068 for (compunit_symtab
*s
: objfile
->compunits ())
14071 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
14072 /* Don't do this block twice. */
14073 if (b
== surrounding_static_block
)
14075 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14077 if (completion_skip_symbol (mode
, sym
))
14080 completion_list_add_name (tracker
,
14082 sym
->linkage_name (),
14083 lookup_name
, text
, word
);
14089 /* See language.h. */
14091 gdb::unique_xmalloc_ptr
<char> watch_location_expression
14092 (struct type
*type
, CORE_ADDR addr
) const override
14094 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
14095 std::string name
= type_to_string (type
);
14096 return gdb::unique_xmalloc_ptr
<char>
14097 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
14100 /* See language.h. */
14102 void value_print (struct value
*val
, struct ui_file
*stream
,
14103 const struct value_print_options
*options
) const override
14105 return ada_value_print (val
, stream
, options
);
14108 /* See language.h. */
14110 void value_print_inner
14111 (struct value
*val
, struct ui_file
*stream
, int recurse
,
14112 const struct value_print_options
*options
) const override
14114 return ada_value_print_inner (val
, stream
, recurse
, options
);
14117 /* See language.h. */
14119 struct block_symbol lookup_symbol_nonlocal
14120 (const char *name
, const struct block
*block
,
14121 const domain_enum domain
) const override
14123 struct block_symbol sym
;
14125 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
14126 if (sym
.symbol
!= NULL
)
14129 /* If we haven't found a match at this point, try the primitive
14130 types. In other languages, this search is performed before
14131 searching for global symbols in order to short-circuit that
14132 global-symbol search if it happens that the name corresponds
14133 to a primitive type. But we cannot do the same in Ada, because
14134 it is perfectly legitimate for a program to declare a type which
14135 has the same name as a standard type. If looking up a type in
14136 that situation, we have traditionally ignored the primitive type
14137 in favor of user-defined types. This is why, unlike most other
14138 languages, we search the primitive types this late and only after
14139 having searched the global symbols without success. */
14141 if (domain
== VAR_DOMAIN
)
14143 struct gdbarch
*gdbarch
;
14146 gdbarch
= target_gdbarch ();
14148 gdbarch
= block_gdbarch (block
);
14150 = language_lookup_primitive_type_as_symbol (this, gdbarch
, name
);
14151 if (sym
.symbol
!= NULL
)
14158 /* See language.h. */
14160 int parser (struct parser_state
*ps
) const override
14162 warnings_issued
= 0;
14163 return ada_parse (ps
);
14168 Same as evaluate_type (*EXP), but resolves ambiguous symbol references
14169 (marked by OP_VAR_VALUE nodes in which the symbol has an undefined
14170 namespace) and converts operators that are user-defined into
14171 appropriate function calls. If CONTEXT_TYPE is non-null, it provides
14172 a preferred result type [at the moment, only type void has any
14173 effect---causing procedures to be preferred over functions in calls].
14174 A null CONTEXT_TYPE indicates that a non-void return type is
14175 preferred. May change (expand) *EXP. */
14177 void post_parser (expression_up
*expp
, int void_context_p
, int completing
,
14178 innermost_block_tracker
*tracker
) const override
14180 struct type
*context_type
= NULL
;
14183 if (void_context_p
)
14184 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
14186 resolve_subexp (expp
, &pc
, 1, context_type
, completing
, tracker
);
14189 /* See language.h. */
14191 void emitchar (int ch
, struct type
*chtype
,
14192 struct ui_file
*stream
, int quoter
) const override
14194 ada_emit_char (ch
, chtype
, stream
, quoter
, 1);
14197 /* See language.h. */
14199 void printchar (int ch
, struct type
*chtype
,
14200 struct ui_file
*stream
) const override
14202 ada_printchar (ch
, chtype
, stream
);
14205 /* See language.h. */
14207 void printstr (struct ui_file
*stream
, struct type
*elttype
,
14208 const gdb_byte
*string
, unsigned int length
,
14209 const char *encoding
, int force_ellipses
,
14210 const struct value_print_options
*options
) const override
14212 ada_printstr (stream
, elttype
, string
, length
, encoding
,
14213 force_ellipses
, options
);
14216 /* See language.h. */
14218 void print_typedef (struct type
*type
, struct symbol
*new_symbol
,
14219 struct ui_file
*stream
) const override
14221 ada_print_typedef (type
, new_symbol
, stream
);
14224 /* See language.h. */
14226 bool is_string_type_p (struct type
*type
) const override
14228 return ada_is_string_type (type
);
14231 /* See language.h. */
14233 const char *struct_too_deep_ellipsis () const override
14234 { return "(...)"; }
14236 /* See language.h. */
14238 bool c_style_arrays_p () const override
14241 /* See language.h. */
14243 bool store_sym_names_in_linkage_form_p () const override
14246 /* See language.h. */
14248 const struct lang_varobj_ops
*varobj_ops () const override
14249 { return &ada_varobj_ops
; }
14251 /* See language.h. */
14253 const struct exp_descriptor
*expression_ops () const override
14254 { return &ada_exp_descriptor
; }
14256 /* See language.h. */
14258 const struct op_print
*opcode_print_table () const override
14259 { return ada_op_print_tab
; }
14262 /* See language.h. */
14264 symbol_name_matcher_ftype
*get_symbol_name_matcher_inner
14265 (const lookup_name_info
&lookup_name
) const override
14267 return ada_get_symbol_name_matcher (lookup_name
);
14271 /* Single instance of the Ada language class. */
14273 static ada_language ada_language_defn
;
14275 /* Command-list for the "set/show ada" prefix command. */
14276 static struct cmd_list_element
*set_ada_list
;
14277 static struct cmd_list_element
*show_ada_list
;
14280 initialize_ada_catchpoint_ops (void)
14282 struct breakpoint_ops
*ops
;
14284 initialize_breakpoint_ops ();
14286 ops
= &catch_exception_breakpoint_ops
;
14287 *ops
= bkpt_breakpoint_ops
;
14288 ops
->allocate_location
= allocate_location_exception
;
14289 ops
->re_set
= re_set_exception
;
14290 ops
->check_status
= check_status_exception
;
14291 ops
->print_it
= print_it_exception
;
14292 ops
->print_one
= print_one_exception
;
14293 ops
->print_mention
= print_mention_exception
;
14294 ops
->print_recreate
= print_recreate_exception
;
14296 ops
= &catch_exception_unhandled_breakpoint_ops
;
14297 *ops
= bkpt_breakpoint_ops
;
14298 ops
->allocate_location
= allocate_location_exception
;
14299 ops
->re_set
= re_set_exception
;
14300 ops
->check_status
= check_status_exception
;
14301 ops
->print_it
= print_it_exception
;
14302 ops
->print_one
= print_one_exception
;
14303 ops
->print_mention
= print_mention_exception
;
14304 ops
->print_recreate
= print_recreate_exception
;
14306 ops
= &catch_assert_breakpoint_ops
;
14307 *ops
= bkpt_breakpoint_ops
;
14308 ops
->allocate_location
= allocate_location_exception
;
14309 ops
->re_set
= re_set_exception
;
14310 ops
->check_status
= check_status_exception
;
14311 ops
->print_it
= print_it_exception
;
14312 ops
->print_one
= print_one_exception
;
14313 ops
->print_mention
= print_mention_exception
;
14314 ops
->print_recreate
= print_recreate_exception
;
14316 ops
= &catch_handlers_breakpoint_ops
;
14317 *ops
= bkpt_breakpoint_ops
;
14318 ops
->allocate_location
= allocate_location_exception
;
14319 ops
->re_set
= re_set_exception
;
14320 ops
->check_status
= check_status_exception
;
14321 ops
->print_it
= print_it_exception
;
14322 ops
->print_one
= print_one_exception
;
14323 ops
->print_mention
= print_mention_exception
;
14324 ops
->print_recreate
= print_recreate_exception
;
14327 /* This module's 'new_objfile' observer. */
14330 ada_new_objfile_observer (struct objfile
*objfile
)
14332 ada_clear_symbol_cache ();
14335 /* This module's 'free_objfile' observer. */
14338 ada_free_objfile_observer (struct objfile
*objfile
)
14340 ada_clear_symbol_cache ();
14343 void _initialize_ada_language ();
14345 _initialize_ada_language ()
14347 initialize_ada_catchpoint_ops ();
14349 add_basic_prefix_cmd ("ada", no_class
,
14350 _("Prefix command for changing Ada-specific settings."),
14351 &set_ada_list
, "set ada ", 0, &setlist
);
14353 add_show_prefix_cmd ("ada", no_class
,
14354 _("Generic command for showing Ada-specific settings."),
14355 &show_ada_list
, "show ada ", 0, &showlist
);
14357 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14358 &trust_pad_over_xvs
, _("\
14359 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14360 Show whether an optimization trusting PAD types over XVS types is activated."),
14362 This is related to the encoding used by the GNAT compiler. The debugger\n\
14363 should normally trust the contents of PAD types, but certain older versions\n\
14364 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14365 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14366 work around this bug. It is always safe to turn this option \"off\", but\n\
14367 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14368 this option to \"off\" unless necessary."),
14369 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14371 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14372 &print_signatures
, _("\
14373 Enable or disable the output of formal and return types for functions in the \
14374 overloads selection menu."), _("\
14375 Show whether the output of formal and return types for functions in the \
14376 overloads selection menu is activated."),
14377 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14379 add_catch_command ("exception", _("\
14380 Catch Ada exceptions, when raised.\n\
14381 Usage: catch exception [ARG] [if CONDITION]\n\
14382 Without any argument, stop when any Ada exception is raised.\n\
14383 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14384 being raised does not have a handler (and will therefore lead to the task's\n\
14386 Otherwise, the catchpoint only stops when the name of the exception being\n\
14387 raised is the same as ARG.\n\
14388 CONDITION is a boolean expression that is evaluated to see whether the\n\
14389 exception should cause a stop."),
14390 catch_ada_exception_command
,
14391 catch_ada_completer
,
14395 add_catch_command ("handlers", _("\
14396 Catch Ada exceptions, when handled.\n\
14397 Usage: catch handlers [ARG] [if CONDITION]\n\
14398 Without any argument, stop when any Ada exception is handled.\n\
14399 With an argument, catch only exceptions with the given name.\n\
14400 CONDITION is a boolean expression that is evaluated to see whether the\n\
14401 exception should cause a stop."),
14402 catch_ada_handlers_command
,
14403 catch_ada_completer
,
14406 add_catch_command ("assert", _("\
14407 Catch failed Ada assertions, when raised.\n\
14408 Usage: catch assert [if CONDITION]\n\
14409 CONDITION is a boolean expression that is evaluated to see whether the\n\
14410 exception should cause a stop."),
14411 catch_assert_command
,
14416 varsize_limit
= 65536;
14417 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14418 &varsize_limit
, _("\
14419 Set the maximum number of bytes allowed in a variable-size object."), _("\
14420 Show the maximum number of bytes allowed in a variable-size object."), _("\
14421 Attempts to access an object whose size is not a compile-time constant\n\
14422 and exceeds this limit will cause an error."),
14423 NULL
, NULL
, &setlist
, &showlist
);
14425 add_info ("exceptions", info_exceptions_command
,
14427 List all Ada exception names.\n\
14428 Usage: info exceptions [REGEXP]\n\
14429 If a regular expression is passed as an argument, only those matching\n\
14430 the regular expression are listed."));
14432 add_basic_prefix_cmd ("ada", class_maintenance
,
14433 _("Set Ada maintenance-related variables."),
14434 &maint_set_ada_cmdlist
, "maintenance set ada ",
14435 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14437 add_show_prefix_cmd ("ada", class_maintenance
,
14438 _("Show Ada maintenance-related variables."),
14439 &maint_show_ada_cmdlist
, "maintenance show ada ",
14440 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14442 add_setshow_boolean_cmd
14443 ("ignore-descriptive-types", class_maintenance
,
14444 &ada_ignore_descriptive_types_p
,
14445 _("Set whether descriptive types generated by GNAT should be ignored."),
14446 _("Show whether descriptive types generated by GNAT should be ignored."),
14448 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14449 DWARF attribute."),
14450 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14452 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14453 NULL
, xcalloc
, xfree
);
14455 /* The ada-lang observers. */
14456 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14457 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14458 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);