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 /* Return true if TYPE is a (Gnat-encoded) constrained packed array
2016 type, or if it is an ordinary (non-Gnat-encoded) packed array. */
2019 ada_is_any_packed_array_type (struct type
*type
)
2021 return (ada_is_constrained_packed_array_type (type
)
2022 || (type
->code () == TYPE_CODE_ARRAY
2023 && TYPE_FIELD_BITSIZE (type
, 0) % 8 != 0));
2026 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2027 return the size of its elements in bits. */
2030 decode_packed_array_bitsize (struct type
*type
)
2032 const char *raw_name
;
2036 /* Access to arrays implemented as fat pointers are encoded as a typedef
2037 of the fat pointer type. We need the name of the fat pointer type
2038 to do the decoding, so strip the typedef layer. */
2039 if (type
->code () == TYPE_CODE_TYPEDEF
)
2040 type
= ada_typedef_target_type (type
);
2042 raw_name
= ada_type_name (ada_check_typedef (type
));
2044 raw_name
= ada_type_name (desc_base_type (type
));
2049 tail
= strstr (raw_name
, "___XP");
2050 if (tail
== nullptr)
2052 gdb_assert (is_thick_pntr (type
));
2053 /* The structure's first field is a pointer to an array, so this
2054 fetches the array type. */
2055 type
= TYPE_TARGET_TYPE (type
->field (0).type ());
2056 /* Now we can see if the array elements are packed. */
2057 return TYPE_FIELD_BITSIZE (type
, 0);
2060 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2063 (_("could not understand bit size information on packed array"));
2070 /* Given that TYPE is a standard GDB array type with all bounds filled
2071 in, and that the element size of its ultimate scalar constituents
2072 (that is, either its elements, or, if it is an array of arrays, its
2073 elements' elements, etc.) is *ELT_BITS, return an identical type,
2074 but with the bit sizes of its elements (and those of any
2075 constituent arrays) recorded in the BITSIZE components of its
2076 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2079 Note that, for arrays whose index type has an XA encoding where
2080 a bound references a record discriminant, getting that discriminant,
2081 and therefore the actual value of that bound, is not possible
2082 because none of the given parameters gives us access to the record.
2083 This function assumes that it is OK in the context where it is being
2084 used to return an array whose bounds are still dynamic and where
2085 the length is arbitrary. */
2087 static struct type
*
2088 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2090 struct type
*new_elt_type
;
2091 struct type
*new_type
;
2092 struct type
*index_type_desc
;
2093 struct type
*index_type
;
2094 LONGEST low_bound
, high_bound
;
2096 type
= ada_check_typedef (type
);
2097 if (type
->code () != TYPE_CODE_ARRAY
)
2100 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2101 if (index_type_desc
)
2102 index_type
= to_fixed_range_type (index_type_desc
->field (0).type (),
2105 index_type
= type
->index_type ();
2107 new_type
= alloc_type_copy (type
);
2109 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2111 create_array_type (new_type
, new_elt_type
, index_type
);
2112 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2113 new_type
->set_name (ada_type_name (type
));
2115 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2116 && is_dynamic_type (check_typedef (index_type
)))
2117 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2118 low_bound
= high_bound
= 0;
2119 if (high_bound
< low_bound
)
2120 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2123 *elt_bits
*= (high_bound
- low_bound
+ 1);
2124 TYPE_LENGTH (new_type
) =
2125 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2128 new_type
->set_is_fixed_instance (true);
2132 /* The array type encoded by TYPE, where
2133 ada_is_constrained_packed_array_type (TYPE). */
2135 static struct type
*
2136 decode_constrained_packed_array_type (struct type
*type
)
2138 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2141 struct type
*shadow_type
;
2145 raw_name
= ada_type_name (desc_base_type (type
));
2150 name
= (char *) alloca (strlen (raw_name
) + 1);
2151 tail
= strstr (raw_name
, "___XP");
2152 type
= desc_base_type (type
);
2154 memcpy (name
, raw_name
, tail
- raw_name
);
2155 name
[tail
- raw_name
] = '\000';
2157 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2159 if (shadow_type
== NULL
)
2161 lim_warning (_("could not find bounds information on packed array"));
2164 shadow_type
= check_typedef (shadow_type
);
2166 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2168 lim_warning (_("could not understand bounds "
2169 "information on packed array"));
2173 bits
= decode_packed_array_bitsize (type
);
2174 return constrained_packed_array_type (shadow_type
, &bits
);
2177 /* Helper function for decode_constrained_packed_array. Set the field
2178 bitsize on a series of packed arrays. Returns the number of
2179 elements in TYPE. */
2182 recursively_update_array_bitsize (struct type
*type
)
2184 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
2187 if (get_discrete_bounds (type
->index_type (), &low
, &high
) < 0
2190 LONGEST our_len
= high
- low
+ 1;
2192 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
2193 if (elt_type
->code () == TYPE_CODE_ARRAY
)
2195 LONGEST elt_len
= recursively_update_array_bitsize (elt_type
);
2196 LONGEST elt_bitsize
= elt_len
* TYPE_FIELD_BITSIZE (elt_type
, 0);
2197 TYPE_FIELD_BITSIZE (type
, 0) = elt_bitsize
;
2199 TYPE_LENGTH (type
) = ((our_len
* elt_bitsize
+ HOST_CHAR_BIT
- 1)
2206 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2207 array, returns a simple array that denotes that array. Its type is a
2208 standard GDB array type except that the BITSIZEs of the array
2209 target types are set to the number of bits in each element, and the
2210 type length is set appropriately. */
2212 static struct value
*
2213 decode_constrained_packed_array (struct value
*arr
)
2217 /* If our value is a pointer, then dereference it. Likewise if
2218 the value is a reference. Make sure that this operation does not
2219 cause the target type to be fixed, as this would indirectly cause
2220 this array to be decoded. The rest of the routine assumes that
2221 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2222 and "value_ind" routines to perform the dereferencing, as opposed
2223 to using "ada_coerce_ref" or "ada_value_ind". */
2224 arr
= coerce_ref (arr
);
2225 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2226 arr
= value_ind (arr
);
2228 type
= decode_constrained_packed_array_type (value_type (arr
));
2231 error (_("can't unpack array"));
2235 /* Decoding the packed array type could not correctly set the field
2236 bitsizes for any dimension except the innermost, because the
2237 bounds may be variable and were not passed to that function. So,
2238 we further resolve the array bounds here and then update the
2240 const gdb_byte
*valaddr
= value_contents_for_printing (arr
);
2241 CORE_ADDR address
= value_address (arr
);
2242 gdb::array_view
<const gdb_byte
> view
2243 = gdb::make_array_view (valaddr
, TYPE_LENGTH (type
));
2244 type
= resolve_dynamic_type (type
, view
, address
);
2245 recursively_update_array_bitsize (type
);
2247 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2248 && ada_is_modular_type (value_type (arr
)))
2250 /* This is a (right-justified) modular type representing a packed
2251 array with no wrapper. In order to interpret the value through
2252 the (left-justified) packed array type we just built, we must
2253 first left-justify it. */
2254 int bit_size
, bit_pos
;
2257 mod
= ada_modulus (value_type (arr
)) - 1;
2264 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2265 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2266 bit_pos
/ HOST_CHAR_BIT
,
2267 bit_pos
% HOST_CHAR_BIT
,
2272 return coerce_unspec_val_to_type (arr
, type
);
2276 /* The value of the element of packed array ARR at the ARITY indices
2277 given in IND. ARR must be a simple array. */
2279 static struct value
*
2280 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2283 int bits
, elt_off
, bit_off
;
2284 long elt_total_bit_offset
;
2285 struct type
*elt_type
;
2289 elt_total_bit_offset
= 0;
2290 elt_type
= ada_check_typedef (value_type (arr
));
2291 for (i
= 0; i
< arity
; i
+= 1)
2293 if (elt_type
->code () != TYPE_CODE_ARRAY
2294 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2296 (_("attempt to do packed indexing of "
2297 "something other than a packed array"));
2300 struct type
*range_type
= elt_type
->index_type ();
2301 LONGEST lowerbound
, upperbound
;
2304 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2306 lim_warning (_("don't know bounds of array"));
2307 lowerbound
= upperbound
= 0;
2310 idx
= pos_atr (ind
[i
]);
2311 if (idx
< lowerbound
|| idx
> upperbound
)
2312 lim_warning (_("packed array index %ld out of bounds"),
2314 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2315 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2316 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2319 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2320 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2322 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2327 /* Non-zero iff TYPE includes negative integer values. */
2330 has_negatives (struct type
*type
)
2332 switch (type
->code ())
2337 return !type
->is_unsigned ();
2338 case TYPE_CODE_RANGE
:
2339 return type
->bounds ()->low
.const_val () - type
->bounds ()->bias
< 0;
2343 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2344 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2345 the unpacked buffer.
2347 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2348 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2350 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2353 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2355 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2358 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2359 gdb_byte
*unpacked
, int unpacked_len
,
2360 int is_big_endian
, int is_signed_type
,
2363 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2364 int src_idx
; /* Index into the source area */
2365 int src_bytes_left
; /* Number of source bytes left to process. */
2366 int srcBitsLeft
; /* Number of source bits left to move */
2367 int unusedLS
; /* Number of bits in next significant
2368 byte of source that are unused */
2370 int unpacked_idx
; /* Index into the unpacked buffer */
2371 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2373 unsigned long accum
; /* Staging area for bits being transferred */
2374 int accumSize
; /* Number of meaningful bits in accum */
2377 /* Transmit bytes from least to most significant; delta is the direction
2378 the indices move. */
2379 int delta
= is_big_endian
? -1 : 1;
2381 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2383 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2384 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2385 bit_size
, unpacked_len
);
2387 srcBitsLeft
= bit_size
;
2388 src_bytes_left
= src_len
;
2389 unpacked_bytes_left
= unpacked_len
;
2394 src_idx
= src_len
- 1;
2396 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2400 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2406 unpacked_idx
= unpacked_len
- 1;
2410 /* Non-scalar values must be aligned at a byte boundary... */
2412 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2413 /* ... And are placed at the beginning (most-significant) bytes
2415 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2416 unpacked_bytes_left
= unpacked_idx
+ 1;
2421 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2423 src_idx
= unpacked_idx
= 0;
2424 unusedLS
= bit_offset
;
2427 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2432 while (src_bytes_left
> 0)
2434 /* Mask for removing bits of the next source byte that are not
2435 part of the value. */
2436 unsigned int unusedMSMask
=
2437 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2439 /* Sign-extend bits for this byte. */
2440 unsigned int signMask
= sign
& ~unusedMSMask
;
2443 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2444 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2445 if (accumSize
>= HOST_CHAR_BIT
)
2447 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2448 accumSize
-= HOST_CHAR_BIT
;
2449 accum
>>= HOST_CHAR_BIT
;
2450 unpacked_bytes_left
-= 1;
2451 unpacked_idx
+= delta
;
2453 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2455 src_bytes_left
-= 1;
2458 while (unpacked_bytes_left
> 0)
2460 accum
|= sign
<< accumSize
;
2461 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2462 accumSize
-= HOST_CHAR_BIT
;
2465 accum
>>= HOST_CHAR_BIT
;
2466 unpacked_bytes_left
-= 1;
2467 unpacked_idx
+= delta
;
2471 /* Create a new value of type TYPE from the contents of OBJ starting
2472 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2473 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2474 assigning through the result will set the field fetched from.
2475 VALADDR is ignored unless OBJ is NULL, in which case,
2476 VALADDR+OFFSET must address the start of storage containing the
2477 packed value. The value returned in this case is never an lval.
2478 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2481 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2482 long offset
, int bit_offset
, int bit_size
,
2486 const gdb_byte
*src
; /* First byte containing data to unpack */
2488 const int is_scalar
= is_scalar_type (type
);
2489 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2490 gdb::byte_vector staging
;
2492 type
= ada_check_typedef (type
);
2495 src
= valaddr
+ offset
;
2497 src
= value_contents (obj
) + offset
;
2499 if (is_dynamic_type (type
))
2501 /* The length of TYPE might by dynamic, so we need to resolve
2502 TYPE in order to know its actual size, which we then use
2503 to create the contents buffer of the value we return.
2504 The difficulty is that the data containing our object is
2505 packed, and therefore maybe not at a byte boundary. So, what
2506 we do, is unpack the data into a byte-aligned buffer, and then
2507 use that buffer as our object's value for resolving the type. */
2508 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2509 staging
.resize (staging_len
);
2511 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2512 staging
.data (), staging
.size (),
2513 is_big_endian
, has_negatives (type
),
2515 type
= resolve_dynamic_type (type
, staging
, 0);
2516 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2518 /* This happens when the length of the object is dynamic,
2519 and is actually smaller than the space reserved for it.
2520 For instance, in an array of variant records, the bit_size
2521 we're given is the array stride, which is constant and
2522 normally equal to the maximum size of its element.
2523 But, in reality, each element only actually spans a portion
2525 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2531 v
= allocate_value (type
);
2532 src
= valaddr
+ offset
;
2534 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2536 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2539 v
= value_at (type
, value_address (obj
) + offset
);
2540 buf
= (gdb_byte
*) alloca (src_len
);
2541 read_memory (value_address (v
), buf
, src_len
);
2546 v
= allocate_value (type
);
2547 src
= value_contents (obj
) + offset
;
2552 long new_offset
= offset
;
2554 set_value_component_location (v
, obj
);
2555 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2556 set_value_bitsize (v
, bit_size
);
2557 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2560 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2562 set_value_offset (v
, new_offset
);
2564 /* Also set the parent value. This is needed when trying to
2565 assign a new value (in inferior memory). */
2566 set_value_parent (v
, obj
);
2569 set_value_bitsize (v
, bit_size
);
2570 unpacked
= value_contents_writeable (v
);
2574 memset (unpacked
, 0, TYPE_LENGTH (type
));
2578 if (staging
.size () == TYPE_LENGTH (type
))
2580 /* Small short-cut: If we've unpacked the data into a buffer
2581 of the same size as TYPE's length, then we can reuse that,
2582 instead of doing the unpacking again. */
2583 memcpy (unpacked
, staging
.data (), staging
.size ());
2586 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2587 unpacked
, TYPE_LENGTH (type
),
2588 is_big_endian
, has_negatives (type
), is_scalar
);
2593 /* Store the contents of FROMVAL into the location of TOVAL.
2594 Return a new value with the location of TOVAL and contents of
2595 FROMVAL. Handles assignment into packed fields that have
2596 floating-point or non-scalar types. */
2598 static struct value
*
2599 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2601 struct type
*type
= value_type (toval
);
2602 int bits
= value_bitsize (toval
);
2604 toval
= ada_coerce_ref (toval
);
2605 fromval
= ada_coerce_ref (fromval
);
2607 if (ada_is_direct_array_type (value_type (toval
)))
2608 toval
= ada_coerce_to_simple_array (toval
);
2609 if (ada_is_direct_array_type (value_type (fromval
)))
2610 fromval
= ada_coerce_to_simple_array (fromval
);
2612 if (!deprecated_value_modifiable (toval
))
2613 error (_("Left operand of assignment is not a modifiable lvalue."));
2615 if (VALUE_LVAL (toval
) == lval_memory
2617 && (type
->code () == TYPE_CODE_FLT
2618 || type
->code () == TYPE_CODE_STRUCT
))
2620 int len
= (value_bitpos (toval
)
2621 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2623 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2625 CORE_ADDR to_addr
= value_address (toval
);
2627 if (type
->code () == TYPE_CODE_FLT
)
2628 fromval
= value_cast (type
, fromval
);
2630 read_memory (to_addr
, buffer
, len
);
2631 from_size
= value_bitsize (fromval
);
2633 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2635 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2636 ULONGEST from_offset
= 0;
2637 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2638 from_offset
= from_size
- bits
;
2639 copy_bitwise (buffer
, value_bitpos (toval
),
2640 value_contents (fromval
), from_offset
,
2641 bits
, is_big_endian
);
2642 write_memory_with_notification (to_addr
, buffer
, len
);
2644 val
= value_copy (toval
);
2645 memcpy (value_contents_raw (val
), value_contents (fromval
),
2646 TYPE_LENGTH (type
));
2647 deprecated_set_value_type (val
, type
);
2652 return value_assign (toval
, fromval
);
2656 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2657 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2658 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2659 COMPONENT, and not the inferior's memory. The current contents
2660 of COMPONENT are ignored.
2662 Although not part of the initial design, this function also works
2663 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2664 had a null address, and COMPONENT had an address which is equal to
2665 its offset inside CONTAINER. */
2668 value_assign_to_component (struct value
*container
, struct value
*component
,
2671 LONGEST offset_in_container
=
2672 (LONGEST
) (value_address (component
) - value_address (container
));
2673 int bit_offset_in_container
=
2674 value_bitpos (component
) - value_bitpos (container
);
2677 val
= value_cast (value_type (component
), val
);
2679 if (value_bitsize (component
) == 0)
2680 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2682 bits
= value_bitsize (component
);
2684 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2688 if (is_scalar_type (check_typedef (value_type (component
))))
2690 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2693 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2694 value_bitpos (container
) + bit_offset_in_container
,
2695 value_contents (val
), src_offset
, bits
, 1);
2698 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2699 value_bitpos (container
) + bit_offset_in_container
,
2700 value_contents (val
), 0, bits
, 0);
2703 /* Determine if TYPE is an access to an unconstrained array. */
2706 ada_is_access_to_unconstrained_array (struct type
*type
)
2708 return (type
->code () == TYPE_CODE_TYPEDEF
2709 && is_thick_pntr (ada_typedef_target_type (type
)));
2712 /* The value of the element of array ARR at the ARITY indices given in IND.
2713 ARR may be either a simple array, GNAT array descriptor, or pointer
2717 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2721 struct type
*elt_type
;
2723 elt
= ada_coerce_to_simple_array (arr
);
2725 elt_type
= ada_check_typedef (value_type (elt
));
2726 if (elt_type
->code () == TYPE_CODE_ARRAY
2727 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2728 return value_subscript_packed (elt
, arity
, ind
);
2730 for (k
= 0; k
< arity
; k
+= 1)
2732 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2734 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2735 error (_("too many subscripts (%d expected)"), k
);
2737 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2739 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2740 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2742 /* The element is a typedef to an unconstrained array,
2743 except that the value_subscript call stripped the
2744 typedef layer. The typedef layer is GNAT's way to
2745 specify that the element is, at the source level, an
2746 access to the unconstrained array, rather than the
2747 unconstrained array. So, we need to restore that
2748 typedef layer, which we can do by forcing the element's
2749 type back to its original type. Otherwise, the returned
2750 value is going to be printed as the array, rather
2751 than as an access. Another symptom of the same issue
2752 would be that an expression trying to dereference the
2753 element would also be improperly rejected. */
2754 deprecated_set_value_type (elt
, saved_elt_type
);
2757 elt_type
= ada_check_typedef (value_type (elt
));
2763 /* Assuming ARR is a pointer to a GDB array, the value of the element
2764 of *ARR at the ARITY indices given in IND.
2765 Does not read the entire array into memory.
2767 Note: Unlike what one would expect, this function is used instead of
2768 ada_value_subscript for basically all non-packed array types. The reason
2769 for this is that a side effect of doing our own pointer arithmetics instead
2770 of relying on value_subscript is that there is no implicit typedef peeling.
2771 This is important for arrays of array accesses, where it allows us to
2772 preserve the fact that the array's element is an array access, where the
2773 access part os encoded in a typedef layer. */
2775 static struct value
*
2776 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2779 struct value
*array_ind
= ada_value_ind (arr
);
2781 = check_typedef (value_enclosing_type (array_ind
));
2783 if (type
->code () == TYPE_CODE_ARRAY
2784 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2785 return value_subscript_packed (array_ind
, arity
, ind
);
2787 for (k
= 0; k
< arity
; k
+= 1)
2791 if (type
->code () != TYPE_CODE_ARRAY
)
2792 error (_("too many subscripts (%d expected)"), k
);
2793 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2795 get_discrete_bounds (type
->index_type (), &lwb
, &upb
);
2796 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2797 type
= TYPE_TARGET_TYPE (type
);
2800 return value_ind (arr
);
2803 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2804 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2805 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2806 this array is LOW, as per Ada rules. */
2807 static struct value
*
2808 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2811 struct type
*type0
= ada_check_typedef (type
);
2812 struct type
*base_index_type
= TYPE_TARGET_TYPE (type0
->index_type ());
2813 struct type
*index_type
2814 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2815 struct type
*slice_type
= create_array_type_with_stride
2816 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2817 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2818 TYPE_FIELD_BITSIZE (type0
, 0));
2819 int base_low
= ada_discrete_type_low_bound (type0
->index_type ());
2820 LONGEST base_low_pos
, low_pos
;
2823 if (!discrete_position (base_index_type
, low
, &low_pos
)
2824 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2826 warning (_("unable to get positions in slice, use bounds instead"));
2828 base_low_pos
= base_low
;
2831 base
= value_as_address (array_ptr
)
2832 + ((low_pos
- base_low_pos
)
2833 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2834 return value_at_lazy (slice_type
, base
);
2838 static struct value
*
2839 ada_value_slice (struct value
*array
, int low
, int high
)
2841 struct type
*type
= ada_check_typedef (value_type (array
));
2842 struct type
*base_index_type
= TYPE_TARGET_TYPE (type
->index_type ());
2843 struct type
*index_type
2844 = create_static_range_type (NULL
, type
->index_type (), low
, high
);
2845 struct type
*slice_type
= create_array_type_with_stride
2846 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2847 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2848 TYPE_FIELD_BITSIZE (type
, 0));
2849 LONGEST low_pos
, high_pos
;
2851 if (!discrete_position (base_index_type
, low
, &low_pos
)
2852 || !discrete_position (base_index_type
, high
, &high_pos
))
2854 warning (_("unable to get positions in slice, use bounds instead"));
2859 return value_cast (slice_type
,
2860 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2863 /* If type is a record type in the form of a standard GNAT array
2864 descriptor, returns the number of dimensions for type. If arr is a
2865 simple array, returns the number of "array of"s that prefix its
2866 type designation. Otherwise, returns 0. */
2869 ada_array_arity (struct type
*type
)
2876 type
= desc_base_type (type
);
2879 if (type
->code () == TYPE_CODE_STRUCT
)
2880 return desc_arity (desc_bounds_type (type
));
2882 while (type
->code () == TYPE_CODE_ARRAY
)
2885 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2891 /* If TYPE is a record type in the form of a standard GNAT array
2892 descriptor or a simple array type, returns the element type for
2893 TYPE after indexing by NINDICES indices, or by all indices if
2894 NINDICES is -1. Otherwise, returns NULL. */
2897 ada_array_element_type (struct type
*type
, int nindices
)
2899 type
= desc_base_type (type
);
2901 if (type
->code () == TYPE_CODE_STRUCT
)
2904 struct type
*p_array_type
;
2906 p_array_type
= desc_data_target_type (type
);
2908 k
= ada_array_arity (type
);
2912 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2913 if (nindices
>= 0 && k
> nindices
)
2915 while (k
> 0 && p_array_type
!= NULL
)
2917 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2920 return p_array_type
;
2922 else if (type
->code () == TYPE_CODE_ARRAY
)
2924 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2926 type
= TYPE_TARGET_TYPE (type
);
2935 /* The type of nth index in arrays of given type (n numbering from 1).
2936 Does not examine memory. Throws an error if N is invalid or TYPE
2937 is not an array type. NAME is the name of the Ada attribute being
2938 evaluated ('range, 'first, 'last, or 'length); it is used in building
2939 the error message. */
2941 static struct type
*
2942 ada_index_type (struct type
*type
, int n
, const char *name
)
2944 struct type
*result_type
;
2946 type
= desc_base_type (type
);
2948 if (n
< 0 || n
> ada_array_arity (type
))
2949 error (_("invalid dimension number to '%s"), name
);
2951 if (ada_is_simple_array_type (type
))
2955 for (i
= 1; i
< n
; i
+= 1)
2956 type
= TYPE_TARGET_TYPE (type
);
2957 result_type
= TYPE_TARGET_TYPE (type
->index_type ());
2958 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2959 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2960 perhaps stabsread.c would make more sense. */
2961 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2966 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2967 if (result_type
== NULL
)
2968 error (_("attempt to take bound of something that is not an array"));
2974 /* Given that arr is an array type, returns the lower bound of the
2975 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2976 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2977 array-descriptor type. It works for other arrays with bounds supplied
2978 by run-time quantities other than discriminants. */
2981 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2983 struct type
*type
, *index_type_desc
, *index_type
;
2986 gdb_assert (which
== 0 || which
== 1);
2988 if (ada_is_constrained_packed_array_type (arr_type
))
2989 arr_type
= decode_constrained_packed_array_type (arr_type
);
2991 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2992 return (LONGEST
) - which
;
2994 if (arr_type
->code () == TYPE_CODE_PTR
)
2995 type
= TYPE_TARGET_TYPE (arr_type
);
2999 if (type
->is_fixed_instance ())
3001 /* The array has already been fixed, so we do not need to
3002 check the parallel ___XA type again. That encoding has
3003 already been applied, so ignore it now. */
3004 index_type_desc
= NULL
;
3008 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3009 ada_fixup_array_indexes_type (index_type_desc
);
3012 if (index_type_desc
!= NULL
)
3013 index_type
= to_fixed_range_type (index_type_desc
->field (n
- 1).type (),
3017 struct type
*elt_type
= check_typedef (type
);
3019 for (i
= 1; i
< n
; i
++)
3020 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3022 index_type
= elt_type
->index_type ();
3026 (LONGEST
) (which
== 0
3027 ? ada_discrete_type_low_bound (index_type
)
3028 : ada_discrete_type_high_bound (index_type
));
3031 /* Given that arr is an array value, returns the lower bound of the
3032 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3033 WHICH is 1. This routine will also work for arrays with bounds
3034 supplied by run-time quantities other than discriminants. */
3037 ada_array_bound (struct value
*arr
, int n
, int which
)
3039 struct type
*arr_type
;
3041 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3042 arr
= value_ind (arr
);
3043 arr_type
= value_enclosing_type (arr
);
3045 if (ada_is_constrained_packed_array_type (arr_type
))
3046 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3047 else if (ada_is_simple_array_type (arr_type
))
3048 return ada_array_bound_from_type (arr_type
, n
, which
);
3050 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3053 /* Given that arr is an array value, returns the length of the
3054 nth index. This routine will also work for arrays with bounds
3055 supplied by run-time quantities other than discriminants.
3056 Does not work for arrays indexed by enumeration types with representation
3057 clauses at the moment. */
3060 ada_array_length (struct value
*arr
, int n
)
3062 struct type
*arr_type
, *index_type
;
3065 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3066 arr
= value_ind (arr
);
3067 arr_type
= value_enclosing_type (arr
);
3069 if (ada_is_constrained_packed_array_type (arr_type
))
3070 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3072 if (ada_is_simple_array_type (arr_type
))
3074 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3075 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3079 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3080 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3083 arr_type
= check_typedef (arr_type
);
3084 index_type
= ada_index_type (arr_type
, n
, "length");
3085 if (index_type
!= NULL
)
3087 struct type
*base_type
;
3088 if (index_type
->code () == TYPE_CODE_RANGE
)
3089 base_type
= TYPE_TARGET_TYPE (index_type
);
3091 base_type
= index_type
;
3093 low
= pos_atr (value_from_longest (base_type
, low
));
3094 high
= pos_atr (value_from_longest (base_type
, high
));
3096 return high
- low
+ 1;
3099 /* An array whose type is that of ARR_TYPE (an array type), with
3100 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3101 less than LOW, then LOW-1 is used. */
3103 static struct value
*
3104 empty_array (struct type
*arr_type
, int low
, int high
)
3106 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3107 struct type
*index_type
3108 = create_static_range_type
3109 (NULL
, TYPE_TARGET_TYPE (arr_type0
->index_type ()), low
,
3110 high
< low
? low
- 1 : high
);
3111 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3113 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3117 /* Name resolution */
3119 /* The "decoded" name for the user-definable Ada operator corresponding
3123 ada_decoded_op_name (enum exp_opcode op
)
3127 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3129 if (ada_opname_table
[i
].op
== op
)
3130 return ada_opname_table
[i
].decoded
;
3132 error (_("Could not find operator name for opcode"));
3135 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3136 in a listing of choices during disambiguation (see sort_choices, below).
3137 The idea is that overloadings of a subprogram name from the
3138 same package should sort in their source order. We settle for ordering
3139 such symbols by their trailing number (__N or $N). */
3142 encoded_ordered_before (const char *N0
, const char *N1
)
3146 else if (N0
== NULL
)
3152 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3154 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3156 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3157 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3162 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3165 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3167 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3168 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3170 return (strcmp (N0
, N1
) < 0);
3174 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3178 sort_choices (struct block_symbol syms
[], int nsyms
)
3182 for (i
= 1; i
< nsyms
; i
+= 1)
3184 struct block_symbol sym
= syms
[i
];
3187 for (j
= i
- 1; j
>= 0; j
-= 1)
3189 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3190 sym
.symbol
->linkage_name ()))
3192 syms
[j
+ 1] = syms
[j
];
3198 /* Whether GDB should display formals and return types for functions in the
3199 overloads selection menu. */
3200 static bool print_signatures
= true;
3202 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3203 all but functions, the signature is just the name of the symbol. For
3204 functions, this is the name of the function, the list of types for formals
3205 and the return type (if any). */
3208 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3209 const struct type_print_options
*flags
)
3211 struct type
*type
= SYMBOL_TYPE (sym
);
3213 fprintf_filtered (stream
, "%s", sym
->print_name ());
3214 if (!print_signatures
3216 || type
->code () != TYPE_CODE_FUNC
)
3219 if (type
->num_fields () > 0)
3223 fprintf_filtered (stream
, " (");
3224 for (i
= 0; i
< type
->num_fields (); ++i
)
3227 fprintf_filtered (stream
, "; ");
3228 ada_print_type (type
->field (i
).type (), NULL
, stream
, -1, 0,
3231 fprintf_filtered (stream
, ")");
3233 if (TYPE_TARGET_TYPE (type
) != NULL
3234 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3236 fprintf_filtered (stream
, " return ");
3237 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3241 /* Read and validate a set of numeric choices from the user in the
3242 range 0 .. N_CHOICES-1. Place the results in increasing
3243 order in CHOICES[0 .. N-1], and return N.
3245 The user types choices as a sequence of numbers on one line
3246 separated by blanks, encoding them as follows:
3248 + A choice of 0 means to cancel the selection, throwing an error.
3249 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3250 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3252 The user is not allowed to choose more than MAX_RESULTS values.
3254 ANNOTATION_SUFFIX, if present, is used to annotate the input
3255 prompts (for use with the -f switch). */
3258 get_selections (int *choices
, int n_choices
, int max_results
,
3259 int is_all_choice
, const char *annotation_suffix
)
3264 int first_choice
= is_all_choice
? 2 : 1;
3266 prompt
= getenv ("PS2");
3270 args
= command_line_input (prompt
, annotation_suffix
);
3273 error_no_arg (_("one or more choice numbers"));
3277 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3278 order, as given in args. Choices are validated. */
3284 args
= skip_spaces (args
);
3285 if (*args
== '\0' && n_chosen
== 0)
3286 error_no_arg (_("one or more choice numbers"));
3287 else if (*args
== '\0')
3290 choice
= strtol (args
, &args2
, 10);
3291 if (args
== args2
|| choice
< 0
3292 || choice
> n_choices
+ first_choice
- 1)
3293 error (_("Argument must be choice number"));
3297 error (_("cancelled"));
3299 if (choice
< first_choice
)
3301 n_chosen
= n_choices
;
3302 for (j
= 0; j
< n_choices
; j
+= 1)
3306 choice
-= first_choice
;
3308 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3312 if (j
< 0 || choice
!= choices
[j
])
3316 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3317 choices
[k
+ 1] = choices
[k
];
3318 choices
[j
+ 1] = choice
;
3323 if (n_chosen
> max_results
)
3324 error (_("Select no more than %d of the above"), max_results
);
3329 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3330 by asking the user (if necessary), returning the number selected,
3331 and setting the first elements of SYMS items. Error if no symbols
3334 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3335 to be re-integrated one of these days. */
3338 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3341 int *chosen
= XALLOCAVEC (int , nsyms
);
3343 int first_choice
= (max_results
== 1) ? 1 : 2;
3344 const char *select_mode
= multiple_symbols_select_mode ();
3346 if (max_results
< 1)
3347 error (_("Request to select 0 symbols!"));
3351 if (select_mode
== multiple_symbols_cancel
)
3353 canceled because the command is ambiguous\n\
3354 See set/show multiple-symbol."));
3356 /* If select_mode is "all", then return all possible symbols.
3357 Only do that if more than one symbol can be selected, of course.
3358 Otherwise, display the menu as usual. */
3359 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3362 printf_filtered (_("[0] cancel\n"));
3363 if (max_results
> 1)
3364 printf_filtered (_("[1] all\n"));
3366 sort_choices (syms
, nsyms
);
3368 for (i
= 0; i
< nsyms
; i
+= 1)
3370 if (syms
[i
].symbol
== NULL
)
3373 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3375 struct symtab_and_line sal
=
3376 find_function_start_sal (syms
[i
].symbol
, 1);
3378 printf_filtered ("[%d] ", i
+ first_choice
);
3379 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3380 &type_print_raw_options
);
3381 if (sal
.symtab
== NULL
)
3382 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3383 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3387 styled_string (file_name_style
.style (),
3388 symtab_to_filename_for_display (sal
.symtab
)),
3395 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3396 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3397 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3398 struct symtab
*symtab
= NULL
;
3400 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3401 symtab
= symbol_symtab (syms
[i
].symbol
);
3403 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3405 printf_filtered ("[%d] ", i
+ first_choice
);
3406 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3407 &type_print_raw_options
);
3408 printf_filtered (_(" at %s:%d\n"),
3409 symtab_to_filename_for_display (symtab
),
3410 SYMBOL_LINE (syms
[i
].symbol
));
3412 else if (is_enumeral
3413 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3415 printf_filtered (("[%d] "), i
+ first_choice
);
3416 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3417 gdb_stdout
, -1, 0, &type_print_raw_options
);
3418 printf_filtered (_("'(%s) (enumeral)\n"),
3419 syms
[i
].symbol
->print_name ());
3423 printf_filtered ("[%d] ", i
+ first_choice
);
3424 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3425 &type_print_raw_options
);
3428 printf_filtered (is_enumeral
3429 ? _(" in %s (enumeral)\n")
3431 symtab_to_filename_for_display (symtab
));
3433 printf_filtered (is_enumeral
3434 ? _(" (enumeral)\n")
3440 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3443 for (i
= 0; i
< n_chosen
; i
+= 1)
3444 syms
[i
] = syms
[chosen
[i
]];
3449 /* Resolve the operator of the subexpression beginning at
3450 position *POS of *EXPP. "Resolving" consists of replacing
3451 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3452 with their resolutions, replacing built-in operators with
3453 function calls to user-defined operators, where appropriate, and,
3454 when DEPROCEDURE_P is non-zero, converting function-valued variables
3455 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3456 are as in ada_resolve, above. */
3458 static struct value
*
3459 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3460 struct type
*context_type
, int parse_completion
,
3461 innermost_block_tracker
*tracker
)
3465 struct expression
*exp
; /* Convenience: == *expp. */
3466 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3467 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3468 int nargs
; /* Number of operands. */
3475 /* Pass one: resolve operands, saving their types and updating *pos,
3480 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3481 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3486 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3488 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3493 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3498 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3499 parse_completion
, tracker
);
3502 case OP_ATR_MODULUS
:
3512 case TERNOP_IN_RANGE
:
3513 case BINOP_IN_BOUNDS
:
3519 case OP_DISCRETE_RANGE
:
3521 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3530 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3532 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3534 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3552 case BINOP_LOGICAL_AND
:
3553 case BINOP_LOGICAL_OR
:
3554 case BINOP_BITWISE_AND
:
3555 case BINOP_BITWISE_IOR
:
3556 case BINOP_BITWISE_XOR
:
3559 case BINOP_NOTEQUAL
:
3566 case BINOP_SUBSCRIPT
:
3574 case UNOP_LOGICAL_NOT
:
3584 case OP_VAR_MSYM_VALUE
:
3591 case OP_INTERNALVAR
:
3601 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3604 case STRUCTOP_STRUCT
:
3605 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3618 error (_("Unexpected operator during name resolution"));
3621 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3622 for (i
= 0; i
< nargs
; i
+= 1)
3623 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
,
3628 /* Pass two: perform any resolution on principal operator. */
3635 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3637 std::vector
<struct block_symbol
> candidates
;
3641 ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3642 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3645 if (n_candidates
> 1)
3647 /* Types tend to get re-introduced locally, so if there
3648 are any local symbols that are not types, first filter
3651 for (j
= 0; j
< n_candidates
; j
+= 1)
3652 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3657 case LOC_REGPARM_ADDR
:
3665 if (j
< n_candidates
)
3668 while (j
< n_candidates
)
3670 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3672 candidates
[j
] = candidates
[n_candidates
- 1];
3681 if (n_candidates
== 0)
3682 error (_("No definition found for %s"),
3683 exp
->elts
[pc
+ 2].symbol
->print_name ());
3684 else if (n_candidates
== 1)
3686 else if (deprocedure_p
3687 && !is_nonfunction (candidates
.data (), n_candidates
))
3689 i
= ada_resolve_function
3690 (candidates
.data (), n_candidates
, NULL
, 0,
3691 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3692 context_type
, parse_completion
);
3694 error (_("Could not find a match for %s"),
3695 exp
->elts
[pc
+ 2].symbol
->print_name ());
3699 printf_filtered (_("Multiple matches for %s\n"),
3700 exp
->elts
[pc
+ 2].symbol
->print_name ());
3701 user_select_syms (candidates
.data (), n_candidates
, 1);
3705 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3706 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3707 tracker
->update (candidates
[i
]);
3711 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3714 replace_operator_with_call (expp
, pc
, 0, 4,
3715 exp
->elts
[pc
+ 2].symbol
,
3716 exp
->elts
[pc
+ 1].block
);
3723 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3724 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3726 std::vector
<struct block_symbol
> candidates
;
3730 ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3731 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3734 if (n_candidates
== 1)
3738 i
= ada_resolve_function
3739 (candidates
.data (), n_candidates
,
3741 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3742 context_type
, parse_completion
);
3744 error (_("Could not find a match for %s"),
3745 exp
->elts
[pc
+ 5].symbol
->print_name ());
3748 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3749 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3750 tracker
->update (candidates
[i
]);
3761 case BINOP_BITWISE_AND
:
3762 case BINOP_BITWISE_IOR
:
3763 case BINOP_BITWISE_XOR
:
3765 case BINOP_NOTEQUAL
:
3773 case UNOP_LOGICAL_NOT
:
3775 if (possible_user_operator_p (op
, argvec
))
3777 std::vector
<struct block_symbol
> candidates
;
3781 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3785 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3786 nargs
, ada_decoded_op_name (op
), NULL
,
3791 replace_operator_with_call (expp
, pc
, nargs
, 1,
3792 candidates
[i
].symbol
,
3793 candidates
[i
].block
);
3804 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3805 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3806 exp
->elts
[pc
+ 1].objfile
,
3807 exp
->elts
[pc
+ 2].msymbol
);
3809 return evaluate_subexp_type (exp
, pos
);
3812 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3813 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3815 /* The term "match" here is rather loose. The match is heuristic and
3819 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3821 ftype
= ada_check_typedef (ftype
);
3822 atype
= ada_check_typedef (atype
);
3824 if (ftype
->code () == TYPE_CODE_REF
)
3825 ftype
= TYPE_TARGET_TYPE (ftype
);
3826 if (atype
->code () == TYPE_CODE_REF
)
3827 atype
= TYPE_TARGET_TYPE (atype
);
3829 switch (ftype
->code ())
3832 return ftype
->code () == atype
->code ();
3834 if (atype
->code () == TYPE_CODE_PTR
)
3835 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3836 TYPE_TARGET_TYPE (atype
), 0);
3839 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3841 case TYPE_CODE_ENUM
:
3842 case TYPE_CODE_RANGE
:
3843 switch (atype
->code ())
3846 case TYPE_CODE_ENUM
:
3847 case TYPE_CODE_RANGE
:
3853 case TYPE_CODE_ARRAY
:
3854 return (atype
->code () == TYPE_CODE_ARRAY
3855 || ada_is_array_descriptor_type (atype
));
3857 case TYPE_CODE_STRUCT
:
3858 if (ada_is_array_descriptor_type (ftype
))
3859 return (atype
->code () == TYPE_CODE_ARRAY
3860 || ada_is_array_descriptor_type (atype
));
3862 return (atype
->code () == TYPE_CODE_STRUCT
3863 && !ada_is_array_descriptor_type (atype
));
3865 case TYPE_CODE_UNION
:
3867 return (atype
->code () == ftype
->code ());
3871 /* Return non-zero if the formals of FUNC "sufficiently match" the
3872 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3873 may also be an enumeral, in which case it is treated as a 0-
3874 argument function. */
3877 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3880 struct type
*func_type
= SYMBOL_TYPE (func
);
3882 if (SYMBOL_CLASS (func
) == LOC_CONST
3883 && func_type
->code () == TYPE_CODE_ENUM
)
3884 return (n_actuals
== 0);
3885 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3888 if (func_type
->num_fields () != n_actuals
)
3891 for (i
= 0; i
< n_actuals
; i
+= 1)
3893 if (actuals
[i
] == NULL
)
3897 struct type
*ftype
= ada_check_typedef (func_type
->field (i
).type ());
3898 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3900 if (!ada_type_match (ftype
, atype
, 1))
3907 /* False iff function type FUNC_TYPE definitely does not produce a value
3908 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3909 FUNC_TYPE is not a valid function type with a non-null return type
3910 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3913 return_match (struct type
*func_type
, struct type
*context_type
)
3915 struct type
*return_type
;
3917 if (func_type
== NULL
)
3920 if (func_type
->code () == TYPE_CODE_FUNC
)
3921 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3923 return_type
= get_base_type (func_type
);
3924 if (return_type
== NULL
)
3927 context_type
= get_base_type (context_type
);
3929 if (return_type
->code () == TYPE_CODE_ENUM
)
3930 return context_type
== NULL
|| return_type
== context_type
;
3931 else if (context_type
== NULL
)
3932 return return_type
->code () != TYPE_CODE_VOID
;
3934 return return_type
->code () == context_type
->code ();
3938 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3939 function (if any) that matches the types of the NARGS arguments in
3940 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3941 that returns that type, then eliminate matches that don't. If
3942 CONTEXT_TYPE is void and there is at least one match that does not
3943 return void, eliminate all matches that do.
3945 Asks the user if there is more than one match remaining. Returns -1
3946 if there is no such symbol or none is selected. NAME is used
3947 solely for messages. May re-arrange and modify SYMS in
3948 the process; the index returned is for the modified vector. */
3951 ada_resolve_function (struct block_symbol syms
[],
3952 int nsyms
, struct value
**args
, int nargs
,
3953 const char *name
, struct type
*context_type
,
3954 int parse_completion
)
3958 int m
; /* Number of hits */
3961 /* In the first pass of the loop, we only accept functions matching
3962 context_type. If none are found, we add a second pass of the loop
3963 where every function is accepted. */
3964 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3966 for (k
= 0; k
< nsyms
; k
+= 1)
3968 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3970 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3971 && (fallback
|| return_match (type
, context_type
)))
3979 /* If we got multiple matches, ask the user which one to use. Don't do this
3980 interactive thing during completion, though, as the purpose of the
3981 completion is providing a list of all possible matches. Prompting the
3982 user to filter it down would be completely unexpected in this case. */
3985 else if (m
> 1 && !parse_completion
)
3987 printf_filtered (_("Multiple matches for %s\n"), name
);
3988 user_select_syms (syms
, m
, 1);
3994 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3995 on the function identified by SYM and BLOCK, and taking NARGS
3996 arguments. Update *EXPP as needed to hold more space. */
3999 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4000 int oplen
, struct symbol
*sym
,
4001 const struct block
*block
)
4003 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4004 symbol, -oplen for operator being replaced). */
4005 struct expression
*newexp
= (struct expression
*)
4006 xzalloc (sizeof (struct expression
)
4007 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
4008 struct expression
*exp
= expp
->get ();
4010 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4011 newexp
->language_defn
= exp
->language_defn
;
4012 newexp
->gdbarch
= exp
->gdbarch
;
4013 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4014 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4015 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4017 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4018 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4020 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4021 newexp
->elts
[pc
+ 4].block
= block
;
4022 newexp
->elts
[pc
+ 5].symbol
= sym
;
4024 expp
->reset (newexp
);
4027 /* Type-class predicates */
4029 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4033 numeric_type_p (struct type
*type
)
4039 switch (type
->code ())
4044 case TYPE_CODE_RANGE
:
4045 return (type
== TYPE_TARGET_TYPE (type
)
4046 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4053 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4056 integer_type_p (struct type
*type
)
4062 switch (type
->code ())
4066 case TYPE_CODE_RANGE
:
4067 return (type
== TYPE_TARGET_TYPE (type
)
4068 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4075 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4078 scalar_type_p (struct type
*type
)
4084 switch (type
->code ())
4087 case TYPE_CODE_RANGE
:
4088 case TYPE_CODE_ENUM
:
4097 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4100 discrete_type_p (struct type
*type
)
4106 switch (type
->code ())
4109 case TYPE_CODE_RANGE
:
4110 case TYPE_CODE_ENUM
:
4111 case TYPE_CODE_BOOL
:
4119 /* Returns non-zero if OP with operands in the vector ARGS could be
4120 a user-defined function. Errs on the side of pre-defined operators
4121 (i.e., result 0). */
4124 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4126 struct type
*type0
=
4127 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4128 struct type
*type1
=
4129 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4143 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4147 case BINOP_BITWISE_AND
:
4148 case BINOP_BITWISE_IOR
:
4149 case BINOP_BITWISE_XOR
:
4150 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4153 case BINOP_NOTEQUAL
:
4158 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4161 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4164 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4168 case UNOP_LOGICAL_NOT
:
4170 return (!numeric_type_p (type0
));
4179 1. In the following, we assume that a renaming type's name may
4180 have an ___XD suffix. It would be nice if this went away at some
4182 2. We handle both the (old) purely type-based representation of
4183 renamings and the (new) variable-based encoding. At some point,
4184 it is devoutly to be hoped that the former goes away
4185 (FIXME: hilfinger-2007-07-09).
4186 3. Subprogram renamings are not implemented, although the XRS
4187 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4189 /* If SYM encodes a renaming,
4191 <renaming> renames <renamed entity>,
4193 sets *LEN to the length of the renamed entity's name,
4194 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4195 the string describing the subcomponent selected from the renamed
4196 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4197 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4198 are undefined). Otherwise, returns a value indicating the category
4199 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4200 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4201 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4202 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4203 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4204 may be NULL, in which case they are not assigned.
4206 [Currently, however, GCC does not generate subprogram renamings.] */
4208 enum ada_renaming_category
4209 ada_parse_renaming (struct symbol
*sym
,
4210 const char **renamed_entity
, int *len
,
4211 const char **renaming_expr
)
4213 enum ada_renaming_category kind
;
4218 return ADA_NOT_RENAMING
;
4219 switch (SYMBOL_CLASS (sym
))
4222 return ADA_NOT_RENAMING
;
4226 case LOC_OPTIMIZED_OUT
:
4227 info
= strstr (sym
->linkage_name (), "___XR");
4229 return ADA_NOT_RENAMING
;
4233 kind
= ADA_OBJECT_RENAMING
;
4237 kind
= ADA_EXCEPTION_RENAMING
;
4241 kind
= ADA_PACKAGE_RENAMING
;
4245 kind
= ADA_SUBPROGRAM_RENAMING
;
4249 return ADA_NOT_RENAMING
;
4253 if (renamed_entity
!= NULL
)
4254 *renamed_entity
= info
;
4255 suffix
= strstr (info
, "___XE");
4256 if (suffix
== NULL
|| suffix
== info
)
4257 return ADA_NOT_RENAMING
;
4259 *len
= strlen (info
) - strlen (suffix
);
4261 if (renaming_expr
!= NULL
)
4262 *renaming_expr
= suffix
;
4266 /* Compute the value of the given RENAMING_SYM, which is expected to
4267 be a symbol encoding a renaming expression. BLOCK is the block
4268 used to evaluate the renaming. */
4270 static struct value
*
4271 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4272 const struct block
*block
)
4274 const char *sym_name
;
4276 sym_name
= renaming_sym
->linkage_name ();
4277 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4278 return evaluate_expression (expr
.get ());
4282 /* Evaluation: Function Calls */
4284 /* Return an lvalue containing the value VAL. This is the identity on
4285 lvalues, and otherwise has the side-effect of allocating memory
4286 in the inferior where a copy of the value contents is copied. */
4288 static struct value
*
4289 ensure_lval (struct value
*val
)
4291 if (VALUE_LVAL (val
) == not_lval
4292 || VALUE_LVAL (val
) == lval_internalvar
)
4294 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4295 const CORE_ADDR addr
=
4296 value_as_long (value_allocate_space_in_inferior (len
));
4298 VALUE_LVAL (val
) = lval_memory
;
4299 set_value_address (val
, addr
);
4300 write_memory (addr
, value_contents (val
), len
);
4306 /* Given ARG, a value of type (pointer or reference to a)*
4307 structure/union, extract the component named NAME from the ultimate
4308 target structure/union and return it as a value with its
4311 The routine searches for NAME among all members of the structure itself
4312 and (recursively) among all members of any wrapper members
4315 If NO_ERR, then simply return NULL in case of error, rather than
4318 static struct value
*
4319 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4321 struct type
*t
, *t1
;
4326 t1
= t
= ada_check_typedef (value_type (arg
));
4327 if (t
->code () == TYPE_CODE_REF
)
4329 t1
= TYPE_TARGET_TYPE (t
);
4332 t1
= ada_check_typedef (t1
);
4333 if (t1
->code () == TYPE_CODE_PTR
)
4335 arg
= coerce_ref (arg
);
4340 while (t
->code () == TYPE_CODE_PTR
)
4342 t1
= TYPE_TARGET_TYPE (t
);
4345 t1
= ada_check_typedef (t1
);
4346 if (t1
->code () == TYPE_CODE_PTR
)
4348 arg
= value_ind (arg
);
4355 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4359 v
= ada_search_struct_field (name
, arg
, 0, t
);
4362 int bit_offset
, bit_size
, byte_offset
;
4363 struct type
*field_type
;
4366 if (t
->code () == TYPE_CODE_PTR
)
4367 address
= value_address (ada_value_ind (arg
));
4369 address
= value_address (ada_coerce_ref (arg
));
4371 /* Check to see if this is a tagged type. We also need to handle
4372 the case where the type is a reference to a tagged type, but
4373 we have to be careful to exclude pointers to tagged types.
4374 The latter should be shown as usual (as a pointer), whereas
4375 a reference should mostly be transparent to the user. */
4377 if (ada_is_tagged_type (t1
, 0)
4378 || (t1
->code () == TYPE_CODE_REF
4379 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4381 /* We first try to find the searched field in the current type.
4382 If not found then let's look in the fixed type. */
4384 if (!find_struct_field (name
, t1
, 0,
4385 &field_type
, &byte_offset
, &bit_offset
,
4394 /* Convert to fixed type in all cases, so that we have proper
4395 offsets to each field in unconstrained record types. */
4396 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4397 address
, NULL
, check_tag
);
4399 /* Resolve the dynamic type as well. */
4400 arg
= value_from_contents_and_address (t1
, nullptr, address
);
4401 t1
= value_type (arg
);
4403 if (find_struct_field (name
, t1
, 0,
4404 &field_type
, &byte_offset
, &bit_offset
,
4409 if (t
->code () == TYPE_CODE_REF
)
4410 arg
= ada_coerce_ref (arg
);
4412 arg
= ada_value_ind (arg
);
4413 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4414 bit_offset
, bit_size
,
4418 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4422 if (v
!= NULL
|| no_err
)
4425 error (_("There is no member named %s."), name
);
4431 error (_("Attempt to extract a component of "
4432 "a value that is not a record."));
4435 /* Return the value ACTUAL, converted to be an appropriate value for a
4436 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4437 allocating any necessary descriptors (fat pointers), or copies of
4438 values not residing in memory, updating it as needed. */
4441 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4443 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4444 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4445 struct type
*formal_target
=
4446 formal_type
->code () == TYPE_CODE_PTR
4447 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4448 struct type
*actual_target
=
4449 actual_type
->code () == TYPE_CODE_PTR
4450 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4452 if (ada_is_array_descriptor_type (formal_target
)
4453 && actual_target
->code () == TYPE_CODE_ARRAY
)
4454 return make_array_descriptor (formal_type
, actual
);
4455 else if (formal_type
->code () == TYPE_CODE_PTR
4456 || formal_type
->code () == TYPE_CODE_REF
)
4458 struct value
*result
;
4460 if (formal_target
->code () == TYPE_CODE_ARRAY
4461 && ada_is_array_descriptor_type (actual_target
))
4462 result
= desc_data (actual
);
4463 else if (formal_type
->code () != TYPE_CODE_PTR
)
4465 if (VALUE_LVAL (actual
) != lval_memory
)
4469 actual_type
= ada_check_typedef (value_type (actual
));
4470 val
= allocate_value (actual_type
);
4471 memcpy ((char *) value_contents_raw (val
),
4472 (char *) value_contents (actual
),
4473 TYPE_LENGTH (actual_type
));
4474 actual
= ensure_lval (val
);
4476 result
= value_addr (actual
);
4480 return value_cast_pointers (formal_type
, result
, 0);
4482 else if (actual_type
->code () == TYPE_CODE_PTR
)
4483 return ada_value_ind (actual
);
4484 else if (ada_is_aligner_type (formal_type
))
4486 /* We need to turn this parameter into an aligner type
4488 struct value
*aligner
= allocate_value (formal_type
);
4489 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4491 value_assign_to_component (aligner
, component
, actual
);
4498 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4499 type TYPE. This is usually an inefficient no-op except on some targets
4500 (such as AVR) where the representation of a pointer and an address
4504 value_pointer (struct value
*value
, struct type
*type
)
4506 struct gdbarch
*gdbarch
= get_type_arch (type
);
4507 unsigned len
= TYPE_LENGTH (type
);
4508 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4511 addr
= value_address (value
);
4512 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4513 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4518 /* Push a descriptor of type TYPE for array value ARR on the stack at
4519 *SP, updating *SP to reflect the new descriptor. Return either
4520 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4521 to-descriptor type rather than a descriptor type), a struct value *
4522 representing a pointer to this descriptor. */
4524 static struct value
*
4525 make_array_descriptor (struct type
*type
, struct value
*arr
)
4527 struct type
*bounds_type
= desc_bounds_type (type
);
4528 struct type
*desc_type
= desc_base_type (type
);
4529 struct value
*descriptor
= allocate_value (desc_type
);
4530 struct value
*bounds
= allocate_value (bounds_type
);
4533 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4536 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4537 ada_array_bound (arr
, i
, 0),
4538 desc_bound_bitpos (bounds_type
, i
, 0),
4539 desc_bound_bitsize (bounds_type
, i
, 0));
4540 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4541 ada_array_bound (arr
, i
, 1),
4542 desc_bound_bitpos (bounds_type
, i
, 1),
4543 desc_bound_bitsize (bounds_type
, i
, 1));
4546 bounds
= ensure_lval (bounds
);
4548 modify_field (value_type (descriptor
),
4549 value_contents_writeable (descriptor
),
4550 value_pointer (ensure_lval (arr
),
4551 desc_type
->field (0).type ()),
4552 fat_pntr_data_bitpos (desc_type
),
4553 fat_pntr_data_bitsize (desc_type
));
4555 modify_field (value_type (descriptor
),
4556 value_contents_writeable (descriptor
),
4557 value_pointer (bounds
,
4558 desc_type
->field (1).type ()),
4559 fat_pntr_bounds_bitpos (desc_type
),
4560 fat_pntr_bounds_bitsize (desc_type
));
4562 descriptor
= ensure_lval (descriptor
);
4564 if (type
->code () == TYPE_CODE_PTR
)
4565 return value_addr (descriptor
);
4570 /* Symbol Cache Module */
4572 /* Performance measurements made as of 2010-01-15 indicate that
4573 this cache does bring some noticeable improvements. Depending
4574 on the type of entity being printed, the cache can make it as much
4575 as an order of magnitude faster than without it.
4577 The descriptive type DWARF extension has significantly reduced
4578 the need for this cache, at least when DWARF is being used. However,
4579 even in this case, some expensive name-based symbol searches are still
4580 sometimes necessary - to find an XVZ variable, mostly. */
4582 /* Initialize the contents of SYM_CACHE. */
4585 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4587 obstack_init (&sym_cache
->cache_space
);
4588 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4591 /* Free the memory used by SYM_CACHE. */
4594 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4596 obstack_free (&sym_cache
->cache_space
, NULL
);
4600 /* Return the symbol cache associated to the given program space PSPACE.
4601 If not allocated for this PSPACE yet, allocate and initialize one. */
4603 static struct ada_symbol_cache
*
4604 ada_get_symbol_cache (struct program_space
*pspace
)
4606 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4608 if (pspace_data
->sym_cache
== NULL
)
4610 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4611 ada_init_symbol_cache (pspace_data
->sym_cache
);
4614 return pspace_data
->sym_cache
;
4617 /* Clear all entries from the symbol cache. */
4620 ada_clear_symbol_cache (void)
4622 struct ada_symbol_cache
*sym_cache
4623 = ada_get_symbol_cache (current_program_space
);
4625 obstack_free (&sym_cache
->cache_space
, NULL
);
4626 ada_init_symbol_cache (sym_cache
);
4629 /* Search our cache for an entry matching NAME and DOMAIN.
4630 Return it if found, or NULL otherwise. */
4632 static struct cache_entry
**
4633 find_entry (const char *name
, domain_enum domain
)
4635 struct ada_symbol_cache
*sym_cache
4636 = ada_get_symbol_cache (current_program_space
);
4637 int h
= msymbol_hash (name
) % HASH_SIZE
;
4638 struct cache_entry
**e
;
4640 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4642 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4648 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4649 Return 1 if found, 0 otherwise.
4651 If an entry was found and SYM is not NULL, set *SYM to the entry's
4652 SYM. Same principle for BLOCK if not NULL. */
4655 lookup_cached_symbol (const char *name
, domain_enum domain
,
4656 struct symbol
**sym
, const struct block
**block
)
4658 struct cache_entry
**e
= find_entry (name
, domain
);
4665 *block
= (*e
)->block
;
4669 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4670 in domain DOMAIN, save this result in our symbol cache. */
4673 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4674 const struct block
*block
)
4676 struct ada_symbol_cache
*sym_cache
4677 = ada_get_symbol_cache (current_program_space
);
4679 struct cache_entry
*e
;
4681 /* Symbols for builtin types don't have a block.
4682 For now don't cache such symbols. */
4683 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4686 /* If the symbol is a local symbol, then do not cache it, as a search
4687 for that symbol depends on the context. To determine whether
4688 the symbol is local or not, we check the block where we found it
4689 against the global and static blocks of its associated symtab. */
4691 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4692 GLOBAL_BLOCK
) != block
4693 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4694 STATIC_BLOCK
) != block
)
4697 h
= msymbol_hash (name
) % HASH_SIZE
;
4698 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4699 e
->next
= sym_cache
->root
[h
];
4700 sym_cache
->root
[h
] = e
;
4701 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4709 /* Return the symbol name match type that should be used used when
4710 searching for all symbols matching LOOKUP_NAME.
4712 LOOKUP_NAME is expected to be a symbol name after transformation
4715 static symbol_name_match_type
4716 name_match_type_from_name (const char *lookup_name
)
4718 return (strstr (lookup_name
, "__") == NULL
4719 ? symbol_name_match_type::WILD
4720 : symbol_name_match_type::FULL
);
4723 /* Return the result of a standard (literal, C-like) lookup of NAME in
4724 given DOMAIN, visible from lexical block BLOCK. */
4726 static struct symbol
*
4727 standard_lookup (const char *name
, const struct block
*block
,
4730 /* Initialize it just to avoid a GCC false warning. */
4731 struct block_symbol sym
= {};
4733 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4735 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4736 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4741 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4742 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4743 since they contend in overloading in the same way. */
4745 is_nonfunction (struct block_symbol syms
[], int n
)
4749 for (i
= 0; i
< n
; i
+= 1)
4750 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_FUNC
4751 && (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
4752 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4758 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4759 struct types. Otherwise, they may not. */
4762 equiv_types (struct type
*type0
, struct type
*type1
)
4766 if (type0
== NULL
|| type1
== NULL
4767 || type0
->code () != type1
->code ())
4769 if ((type0
->code () == TYPE_CODE_STRUCT
4770 || type0
->code () == TYPE_CODE_ENUM
)
4771 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4772 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4778 /* True iff SYM0 represents the same entity as SYM1, or one that is
4779 no more defined than that of SYM1. */
4782 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4786 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4787 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4790 switch (SYMBOL_CLASS (sym0
))
4796 struct type
*type0
= SYMBOL_TYPE (sym0
);
4797 struct type
*type1
= SYMBOL_TYPE (sym1
);
4798 const char *name0
= sym0
->linkage_name ();
4799 const char *name1
= sym1
->linkage_name ();
4800 int len0
= strlen (name0
);
4803 type0
->code () == type1
->code ()
4804 && (equiv_types (type0
, type1
)
4805 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4806 && startswith (name1
+ len0
, "___XV")));
4809 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4810 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4814 const char *name0
= sym0
->linkage_name ();
4815 const char *name1
= sym1
->linkage_name ();
4816 return (strcmp (name0
, name1
) == 0
4817 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4825 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4826 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4829 add_defn_to_vec (struct obstack
*obstackp
,
4831 const struct block
*block
)
4834 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4836 /* Do not try to complete stub types, as the debugger is probably
4837 already scanning all symbols matching a certain name at the
4838 time when this function is called. Trying to replace the stub
4839 type by its associated full type will cause us to restart a scan
4840 which may lead to an infinite recursion. Instead, the client
4841 collecting the matching symbols will end up collecting several
4842 matches, with at least one of them complete. It can then filter
4843 out the stub ones if needed. */
4845 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4847 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4849 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4851 prevDefns
[i
].symbol
= sym
;
4852 prevDefns
[i
].block
= block
;
4858 struct block_symbol info
;
4862 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4866 /* Number of block_symbol structures currently collected in current vector in
4870 num_defns_collected (struct obstack
*obstackp
)
4872 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4875 /* Vector of block_symbol structures currently collected in current vector in
4876 OBSTACKP. If FINISH, close off the vector and return its final address. */
4878 static struct block_symbol
*
4879 defns_collected (struct obstack
*obstackp
, int finish
)
4882 return (struct block_symbol
*) obstack_finish (obstackp
);
4884 return (struct block_symbol
*) obstack_base (obstackp
);
4887 /* Return a bound minimal symbol matching NAME according to Ada
4888 decoding rules. Returns an invalid symbol if there is no such
4889 minimal symbol. Names prefixed with "standard__" are handled
4890 specially: "standard__" is first stripped off, and only static and
4891 global symbols are searched. */
4893 struct bound_minimal_symbol
4894 ada_lookup_simple_minsym (const char *name
)
4896 struct bound_minimal_symbol result
;
4898 memset (&result
, 0, sizeof (result
));
4900 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4901 lookup_name_info
lookup_name (name
, match_type
);
4903 symbol_name_matcher_ftype
*match_name
4904 = ada_get_symbol_name_matcher (lookup_name
);
4906 for (objfile
*objfile
: current_program_space
->objfiles ())
4908 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4910 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4911 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4913 result
.minsym
= msymbol
;
4914 result
.objfile
= objfile
;
4923 /* For all subprograms that statically enclose the subprogram of the
4924 selected frame, add symbols matching identifier NAME in DOMAIN
4925 and their blocks to the list of data in OBSTACKP, as for
4926 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4927 with a wildcard prefix. */
4930 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4931 const lookup_name_info
&lookup_name
,
4936 /* True if TYPE is definitely an artificial type supplied to a symbol
4937 for which no debugging information was given in the symbol file. */
4940 is_nondebugging_type (struct type
*type
)
4942 const char *name
= ada_type_name (type
);
4944 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4947 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4948 that are deemed "identical" for practical purposes.
4950 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4951 types and that their number of enumerals is identical (in other
4952 words, type1->num_fields () == type2->num_fields ()). */
4955 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4959 /* The heuristic we use here is fairly conservative. We consider
4960 that 2 enumerate types are identical if they have the same
4961 number of enumerals and that all enumerals have the same
4962 underlying value and name. */
4964 /* All enums in the type should have an identical underlying value. */
4965 for (i
= 0; i
< type1
->num_fields (); i
++)
4966 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4969 /* All enumerals should also have the same name (modulo any numerical
4971 for (i
= 0; i
< type1
->num_fields (); i
++)
4973 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4974 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4975 int len_1
= strlen (name_1
);
4976 int len_2
= strlen (name_2
);
4978 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4979 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4981 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4982 TYPE_FIELD_NAME (type2
, i
),
4990 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4991 that are deemed "identical" for practical purposes. Sometimes,
4992 enumerals are not strictly identical, but their types are so similar
4993 that they can be considered identical.
4995 For instance, consider the following code:
4997 type Color is (Black, Red, Green, Blue, White);
4998 type RGB_Color is new Color range Red .. Blue;
5000 Type RGB_Color is a subrange of an implicit type which is a copy
5001 of type Color. If we call that implicit type RGB_ColorB ("B" is
5002 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5003 As a result, when an expression references any of the enumeral
5004 by name (Eg. "print green"), the expression is technically
5005 ambiguous and the user should be asked to disambiguate. But
5006 doing so would only hinder the user, since it wouldn't matter
5007 what choice he makes, the outcome would always be the same.
5008 So, for practical purposes, we consider them as the same. */
5011 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
5015 /* Before performing a thorough comparison check of each type,
5016 we perform a series of inexpensive checks. We expect that these
5017 checks will quickly fail in the vast majority of cases, and thus
5018 help prevent the unnecessary use of a more expensive comparison.
5019 Said comparison also expects us to make some of these checks
5020 (see ada_identical_enum_types_p). */
5022 /* Quick check: All symbols should have an enum type. */
5023 for (i
= 0; i
< syms
.size (); i
++)
5024 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
5027 /* Quick check: They should all have the same value. */
5028 for (i
= 1; i
< syms
.size (); i
++)
5029 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5032 /* Quick check: They should all have the same number of enumerals. */
5033 for (i
= 1; i
< syms
.size (); i
++)
5034 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
5035 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
5038 /* All the sanity checks passed, so we might have a set of
5039 identical enumeration types. Perform a more complete
5040 comparison of the type of each symbol. */
5041 for (i
= 1; i
< syms
.size (); i
++)
5042 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5043 SYMBOL_TYPE (syms
[0].symbol
)))
5049 /* Remove any non-debugging symbols in SYMS that definitely
5050 duplicate other symbols in the list (The only case I know of where
5051 this happens is when object files containing stabs-in-ecoff are
5052 linked with files containing ordinary ecoff debugging symbols (or no
5053 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5054 Returns the number of items in the modified list. */
5057 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5061 /* We should never be called with less than 2 symbols, as there
5062 cannot be any extra symbol in that case. But it's easy to
5063 handle, since we have nothing to do in that case. */
5064 if (syms
->size () < 2)
5065 return syms
->size ();
5068 while (i
< syms
->size ())
5072 /* If two symbols have the same name and one of them is a stub type,
5073 the get rid of the stub. */
5075 if (SYMBOL_TYPE ((*syms
)[i
].symbol
)->is_stub ()
5076 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5078 for (j
= 0; j
< syms
->size (); j
++)
5081 && !SYMBOL_TYPE ((*syms
)[j
].symbol
)->is_stub ()
5082 && (*syms
)[j
].symbol
->linkage_name () != NULL
5083 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5084 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5089 /* Two symbols with the same name, same class and same address
5090 should be identical. */
5092 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5093 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5094 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5096 for (j
= 0; j
< syms
->size (); j
+= 1)
5099 && (*syms
)[j
].symbol
->linkage_name () != NULL
5100 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5101 (*syms
)[j
].symbol
->linkage_name ()) == 0
5102 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5103 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5104 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5105 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5111 syms
->erase (syms
->begin () + i
);
5116 /* If all the remaining symbols are identical enumerals, then
5117 just keep the first one and discard the rest.
5119 Unlike what we did previously, we do not discard any entry
5120 unless they are ALL identical. This is because the symbol
5121 comparison is not a strict comparison, but rather a practical
5122 comparison. If all symbols are considered identical, then
5123 we can just go ahead and use the first one and discard the rest.
5124 But if we cannot reduce the list to a single element, we have
5125 to ask the user to disambiguate anyways. And if we have to
5126 present a multiple-choice menu, it's less confusing if the list
5127 isn't missing some choices that were identical and yet distinct. */
5128 if (symbols_are_identical_enums (*syms
))
5131 return syms
->size ();
5134 /* Given a type that corresponds to a renaming entity, use the type name
5135 to extract the scope (package name or function name, fully qualified,
5136 and following the GNAT encoding convention) where this renaming has been
5140 xget_renaming_scope (struct type
*renaming_type
)
5142 /* The renaming types adhere to the following convention:
5143 <scope>__<rename>___<XR extension>.
5144 So, to extract the scope, we search for the "___XR" extension,
5145 and then backtrack until we find the first "__". */
5147 const char *name
= renaming_type
->name ();
5148 const char *suffix
= strstr (name
, "___XR");
5151 /* Now, backtrack a bit until we find the first "__". Start looking
5152 at suffix - 3, as the <rename> part is at least one character long. */
5154 for (last
= suffix
- 3; last
> name
; last
--)
5155 if (last
[0] == '_' && last
[1] == '_')
5158 /* Make a copy of scope and return it. */
5159 return std::string (name
, last
);
5162 /* Return nonzero if NAME corresponds to a package name. */
5165 is_package_name (const char *name
)
5167 /* Here, We take advantage of the fact that no symbols are generated
5168 for packages, while symbols are generated for each function.
5169 So the condition for NAME represent a package becomes equivalent
5170 to NAME not existing in our list of symbols. There is only one
5171 small complication with library-level functions (see below). */
5173 /* If it is a function that has not been defined at library level,
5174 then we should be able to look it up in the symbols. */
5175 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5178 /* Library-level function names start with "_ada_". See if function
5179 "_ada_" followed by NAME can be found. */
5181 /* Do a quick check that NAME does not contain "__", since library-level
5182 functions names cannot contain "__" in them. */
5183 if (strstr (name
, "__") != NULL
)
5186 std::string fun_name
= string_printf ("_ada_%s", name
);
5188 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5191 /* Return nonzero if SYM corresponds to a renaming entity that is
5192 not visible from FUNCTION_NAME. */
5195 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5197 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5200 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5202 /* If the rename has been defined in a package, then it is visible. */
5203 if (is_package_name (scope
.c_str ()))
5206 /* Check that the rename is in the current function scope by checking
5207 that its name starts with SCOPE. */
5209 /* If the function name starts with "_ada_", it means that it is
5210 a library-level function. Strip this prefix before doing the
5211 comparison, as the encoding for the renaming does not contain
5213 if (startswith (function_name
, "_ada_"))
5216 return !startswith (function_name
, scope
.c_str ());
5219 /* Remove entries from SYMS that corresponds to a renaming entity that
5220 is not visible from the function associated with CURRENT_BLOCK or
5221 that is superfluous due to the presence of more specific renaming
5222 information. Places surviving symbols in the initial entries of
5223 SYMS and returns the number of surviving symbols.
5226 First, in cases where an object renaming is implemented as a
5227 reference variable, GNAT may produce both the actual reference
5228 variable and the renaming encoding. In this case, we discard the
5231 Second, GNAT emits a type following a specified encoding for each renaming
5232 entity. Unfortunately, STABS currently does not support the definition
5233 of types that are local to a given lexical block, so all renamings types
5234 are emitted at library level. As a consequence, if an application
5235 contains two renaming entities using the same name, and a user tries to
5236 print the value of one of these entities, the result of the ada symbol
5237 lookup will also contain the wrong renaming type.
5239 This function partially covers for this limitation by attempting to
5240 remove from the SYMS list renaming symbols that should be visible
5241 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5242 method with the current information available. The implementation
5243 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5245 - When the user tries to print a rename in a function while there
5246 is another rename entity defined in a package: Normally, the
5247 rename in the function has precedence over the rename in the
5248 package, so the latter should be removed from the list. This is
5249 currently not the case.
5251 - This function will incorrectly remove valid renames if
5252 the CURRENT_BLOCK corresponds to a function which symbol name
5253 has been changed by an "Export" pragma. As a consequence,
5254 the user will be unable to print such rename entities. */
5257 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5258 const struct block
*current_block
)
5260 struct symbol
*current_function
;
5261 const char *current_function_name
;
5263 int is_new_style_renaming
;
5265 /* If there is both a renaming foo___XR... encoded as a variable and
5266 a simple variable foo in the same block, discard the latter.
5267 First, zero out such symbols, then compress. */
5268 is_new_style_renaming
= 0;
5269 for (i
= 0; i
< syms
->size (); i
+= 1)
5271 struct symbol
*sym
= (*syms
)[i
].symbol
;
5272 const struct block
*block
= (*syms
)[i
].block
;
5276 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5278 name
= sym
->linkage_name ();
5279 suffix
= strstr (name
, "___XR");
5283 int name_len
= suffix
- name
;
5286 is_new_style_renaming
= 1;
5287 for (j
= 0; j
< syms
->size (); j
+= 1)
5288 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5289 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5291 && block
== (*syms
)[j
].block
)
5292 (*syms
)[j
].symbol
= NULL
;
5295 if (is_new_style_renaming
)
5299 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5300 if ((*syms
)[j
].symbol
!= NULL
)
5302 (*syms
)[k
] = (*syms
)[j
];
5308 /* Extract the function name associated to CURRENT_BLOCK.
5309 Abort if unable to do so. */
5311 if (current_block
== NULL
)
5312 return syms
->size ();
5314 current_function
= block_linkage_function (current_block
);
5315 if (current_function
== NULL
)
5316 return syms
->size ();
5318 current_function_name
= current_function
->linkage_name ();
5319 if (current_function_name
== NULL
)
5320 return syms
->size ();
5322 /* Check each of the symbols, and remove it from the list if it is
5323 a type corresponding to a renaming that is out of the scope of
5324 the current block. */
5327 while (i
< syms
->size ())
5329 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5330 == ADA_OBJECT_RENAMING
5331 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5332 current_function_name
))
5333 syms
->erase (syms
->begin () + i
);
5338 return syms
->size ();
5341 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5342 whose name and domain match NAME and DOMAIN respectively.
5343 If no match was found, then extend the search to "enclosing"
5344 routines (in other words, if we're inside a nested function,
5345 search the symbols defined inside the enclosing functions).
5346 If WILD_MATCH_P is nonzero, perform the naming matching in
5347 "wild" mode (see function "wild_match" for more info).
5349 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5352 ada_add_local_symbols (struct obstack
*obstackp
,
5353 const lookup_name_info
&lookup_name
,
5354 const struct block
*block
, domain_enum domain
)
5356 int block_depth
= 0;
5358 while (block
!= NULL
)
5361 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5363 /* If we found a non-function match, assume that's the one. */
5364 if (is_nonfunction (defns_collected (obstackp
, 0),
5365 num_defns_collected (obstackp
)))
5368 block
= BLOCK_SUPERBLOCK (block
);
5371 /* If no luck so far, try to find NAME as a local symbol in some lexically
5372 enclosing subprogram. */
5373 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5374 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5377 /* An object of this type is used as the user_data argument when
5378 calling the map_matching_symbols method. */
5382 struct objfile
*objfile
;
5383 struct obstack
*obstackp
;
5384 struct symbol
*arg_sym
;
5388 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5389 to a list of symbols. DATA is a pointer to a struct match_data *
5390 containing the obstack that collects the symbol list, the file that SYM
5391 must come from, a flag indicating whether a non-argument symbol has
5392 been found in the current block, and the last argument symbol
5393 passed in SYM within the current block (if any). When SYM is null,
5394 marking the end of a block, the argument symbol is added if no
5395 other has been found. */
5398 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5399 struct match_data
*data
)
5401 const struct block
*block
= bsym
->block
;
5402 struct symbol
*sym
= bsym
->symbol
;
5406 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5407 add_defn_to_vec (data
->obstackp
,
5408 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5410 data
->found_sym
= 0;
5411 data
->arg_sym
= NULL
;
5415 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5417 else if (SYMBOL_IS_ARGUMENT (sym
))
5418 data
->arg_sym
= sym
;
5421 data
->found_sym
= 1;
5422 add_defn_to_vec (data
->obstackp
,
5423 fixup_symbol_section (sym
, data
->objfile
),
5430 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5431 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5432 symbols to OBSTACKP. Return whether we found such symbols. */
5435 ada_add_block_renamings (struct obstack
*obstackp
,
5436 const struct block
*block
,
5437 const lookup_name_info
&lookup_name
,
5440 struct using_direct
*renaming
;
5441 int defns_mark
= num_defns_collected (obstackp
);
5443 symbol_name_matcher_ftype
*name_match
5444 = ada_get_symbol_name_matcher (lookup_name
);
5446 for (renaming
= block_using (block
);
5448 renaming
= renaming
->next
)
5452 /* Avoid infinite recursions: skip this renaming if we are actually
5453 already traversing it.
5455 Currently, symbol lookup in Ada don't use the namespace machinery from
5456 C++/Fortran support: skip namespace imports that use them. */
5457 if (renaming
->searched
5458 || (renaming
->import_src
!= NULL
5459 && renaming
->import_src
[0] != '\0')
5460 || (renaming
->import_dest
!= NULL
5461 && renaming
->import_dest
[0] != '\0'))
5463 renaming
->searched
= 1;
5465 /* TODO: here, we perform another name-based symbol lookup, which can
5466 pull its own multiple overloads. In theory, we should be able to do
5467 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5468 not a simple name. But in order to do this, we would need to enhance
5469 the DWARF reader to associate a symbol to this renaming, instead of a
5470 name. So, for now, we do something simpler: re-use the C++/Fortran
5471 namespace machinery. */
5472 r_name
= (renaming
->alias
!= NULL
5474 : renaming
->declaration
);
5475 if (name_match (r_name
, lookup_name
, NULL
))
5477 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5478 lookup_name
.match_type ());
5479 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5482 renaming
->searched
= 0;
5484 return num_defns_collected (obstackp
) != defns_mark
;
5487 /* Implements compare_names, but only applying the comparision using
5488 the given CASING. */
5491 compare_names_with_case (const char *string1
, const char *string2
,
5492 enum case_sensitivity casing
)
5494 while (*string1
!= '\0' && *string2
!= '\0')
5498 if (isspace (*string1
) || isspace (*string2
))
5499 return strcmp_iw_ordered (string1
, string2
);
5501 if (casing
== case_sensitive_off
)
5503 c1
= tolower (*string1
);
5504 c2
= tolower (*string2
);
5521 return strcmp_iw_ordered (string1
, string2
);
5523 if (*string2
== '\0')
5525 if (is_name_suffix (string1
))
5532 if (*string2
== '(')
5533 return strcmp_iw_ordered (string1
, string2
);
5536 if (casing
== case_sensitive_off
)
5537 return tolower (*string1
) - tolower (*string2
);
5539 return *string1
- *string2
;
5544 /* Compare STRING1 to STRING2, with results as for strcmp.
5545 Compatible with strcmp_iw_ordered in that...
5547 strcmp_iw_ordered (STRING1, STRING2) <= 0
5551 compare_names (STRING1, STRING2) <= 0
5553 (they may differ as to what symbols compare equal). */
5556 compare_names (const char *string1
, const char *string2
)
5560 /* Similar to what strcmp_iw_ordered does, we need to perform
5561 a case-insensitive comparison first, and only resort to
5562 a second, case-sensitive, comparison if the first one was
5563 not sufficient to differentiate the two strings. */
5565 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5567 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5572 /* Convenience function to get at the Ada encoded lookup name for
5573 LOOKUP_NAME, as a C string. */
5576 ada_lookup_name (const lookup_name_info
&lookup_name
)
5578 return lookup_name
.ada ().lookup_name ().c_str ();
5581 /* Add to OBSTACKP all non-local symbols whose name and domain match
5582 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5583 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5584 symbols otherwise. */
5587 add_nonlocal_symbols (struct obstack
*obstackp
,
5588 const lookup_name_info
&lookup_name
,
5589 domain_enum domain
, int global
)
5591 struct match_data data
;
5593 memset (&data
, 0, sizeof data
);
5594 data
.obstackp
= obstackp
;
5596 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5598 auto callback
= [&] (struct block_symbol
*bsym
)
5600 return aux_add_nonlocal_symbols (bsym
, &data
);
5603 for (objfile
*objfile
: current_program_space
->objfiles ())
5605 data
.objfile
= objfile
;
5607 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5608 domain
, global
, callback
,
5610 ? NULL
: compare_names
));
5612 for (compunit_symtab
*cu
: objfile
->compunits ())
5614 const struct block
*global_block
5615 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5617 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5623 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5625 const char *name
= ada_lookup_name (lookup_name
);
5626 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5627 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5629 for (objfile
*objfile
: current_program_space
->objfiles ())
5631 data
.objfile
= objfile
;
5632 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5633 domain
, global
, callback
,
5639 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5640 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5641 returning the number of matches. Add these to OBSTACKP.
5643 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5644 symbol match within the nest of blocks whose innermost member is BLOCK,
5645 is the one match returned (no other matches in that or
5646 enclosing blocks is returned). If there are any matches in or
5647 surrounding BLOCK, then these alone are returned.
5649 Names prefixed with "standard__" are handled specially:
5650 "standard__" is first stripped off (by the lookup_name
5651 constructor), and only static and global symbols are searched.
5653 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5654 to lookup global symbols. */
5657 ada_add_all_symbols (struct obstack
*obstackp
,
5658 const struct block
*block
,
5659 const lookup_name_info
&lookup_name
,
5662 int *made_global_lookup_p
)
5666 if (made_global_lookup_p
)
5667 *made_global_lookup_p
= 0;
5669 /* Special case: If the user specifies a symbol name inside package
5670 Standard, do a non-wild matching of the symbol name without
5671 the "standard__" prefix. This was primarily introduced in order
5672 to allow the user to specifically access the standard exceptions
5673 using, for instance, Standard.Constraint_Error when Constraint_Error
5674 is ambiguous (due to the user defining its own Constraint_Error
5675 entity inside its program). */
5676 if (lookup_name
.ada ().standard_p ())
5679 /* Check the non-global symbols. If we have ANY match, then we're done. */
5684 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5687 /* In the !full_search case we're are being called by
5688 iterate_over_symbols, and we don't want to search
5690 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5692 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5696 /* No non-global symbols found. Check our cache to see if we have
5697 already performed this search before. If we have, then return
5700 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5701 domain
, &sym
, &block
))
5704 add_defn_to_vec (obstackp
, sym
, block
);
5708 if (made_global_lookup_p
)
5709 *made_global_lookup_p
= 1;
5711 /* Search symbols from all global blocks. */
5713 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5715 /* Now add symbols from all per-file blocks if we've gotten no hits
5716 (not strictly correct, but perhaps better than an error). */
5718 if (num_defns_collected (obstackp
) == 0)
5719 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5722 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5723 is non-zero, enclosing scope and in global scopes, returning the number of
5725 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5726 found and the blocks and symbol tables (if any) in which they were
5729 When full_search is non-zero, any non-function/non-enumeral
5730 symbol match within the nest of blocks whose innermost member is BLOCK,
5731 is the one match returned (no other matches in that or
5732 enclosing blocks is returned). If there are any matches in or
5733 surrounding BLOCK, then these alone are returned.
5735 Names prefixed with "standard__" are handled specially: "standard__"
5736 is first stripped off, and only static and global symbols are searched. */
5739 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5740 const struct block
*block
,
5742 std::vector
<struct block_symbol
> *results
,
5745 int syms_from_global_search
;
5747 auto_obstack obstack
;
5749 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5750 domain
, full_search
, &syms_from_global_search
);
5752 ndefns
= num_defns_collected (&obstack
);
5754 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5755 for (int i
= 0; i
< ndefns
; ++i
)
5756 results
->push_back (base
[i
]);
5758 ndefns
= remove_extra_symbols (results
);
5760 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5761 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5763 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5764 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5765 (*results
)[0].symbol
, (*results
)[0].block
);
5767 ndefns
= remove_irrelevant_renamings (results
, block
);
5772 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5773 in global scopes, returning the number of matches, and filling *RESULTS
5774 with (SYM,BLOCK) tuples.
5776 See ada_lookup_symbol_list_worker for further details. */
5779 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5781 std::vector
<struct block_symbol
> *results
)
5783 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5784 lookup_name_info
lookup_name (name
, name_match_type
);
5786 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5789 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5790 to 1, but choosing the first symbol found if there are multiple
5793 The result is stored in *INFO, which must be non-NULL.
5794 If no match is found, INFO->SYM is set to NULL. */
5797 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5799 struct block_symbol
*info
)
5801 /* Since we already have an encoded name, wrap it in '<>' to force a
5802 verbatim match. Otherwise, if the name happens to not look like
5803 an encoded name (because it doesn't include a "__"),
5804 ada_lookup_name_info would re-encode/fold it again, and that
5805 would e.g., incorrectly lowercase object renaming names like
5806 "R28b" -> "r28b". */
5807 std::string verbatim
= std::string ("<") + name
+ '>';
5809 gdb_assert (info
!= NULL
);
5810 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5813 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5814 scope and in global scopes, or NULL if none. NAME is folded and
5815 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5816 choosing the first symbol if there are multiple choices. */
5819 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5822 std::vector
<struct block_symbol
> candidates
;
5825 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5827 if (n_candidates
== 0)
5830 block_symbol info
= candidates
[0];
5831 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5836 /* True iff STR is a possible encoded suffix of a normal Ada name
5837 that is to be ignored for matching purposes. Suffixes of parallel
5838 names (e.g., XVE) are not included here. Currently, the possible suffixes
5839 are given by any of the regular expressions:
5841 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5842 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5843 TKB [subprogram suffix for task bodies]
5844 _E[0-9]+[bs]$ [protected object entry suffixes]
5845 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5847 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5848 match is performed. This sequence is used to differentiate homonyms,
5849 is an optional part of a valid name suffix. */
5852 is_name_suffix (const char *str
)
5855 const char *matching
;
5856 const int len
= strlen (str
);
5858 /* Skip optional leading __[0-9]+. */
5860 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5863 while (isdigit (str
[0]))
5869 if (str
[0] == '.' || str
[0] == '$')
5872 while (isdigit (matching
[0]))
5874 if (matching
[0] == '\0')
5880 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5883 while (isdigit (matching
[0]))
5885 if (matching
[0] == '\0')
5889 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5891 if (strcmp (str
, "TKB") == 0)
5895 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5896 with a N at the end. Unfortunately, the compiler uses the same
5897 convention for other internal types it creates. So treating
5898 all entity names that end with an "N" as a name suffix causes
5899 some regressions. For instance, consider the case of an enumerated
5900 type. To support the 'Image attribute, it creates an array whose
5902 Having a single character like this as a suffix carrying some
5903 information is a bit risky. Perhaps we should change the encoding
5904 to be something like "_N" instead. In the meantime, do not do
5905 the following check. */
5906 /* Protected Object Subprograms */
5907 if (len
== 1 && str
[0] == 'N')
5912 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5915 while (isdigit (matching
[0]))
5917 if ((matching
[0] == 'b' || matching
[0] == 's')
5918 && matching
[1] == '\0')
5922 /* ??? We should not modify STR directly, as we are doing below. This
5923 is fine in this case, but may become problematic later if we find
5924 that this alternative did not work, and want to try matching
5925 another one from the begining of STR. Since we modified it, we
5926 won't be able to find the begining of the string anymore! */
5930 while (str
[0] != '_' && str
[0] != '\0')
5932 if (str
[0] != 'n' && str
[0] != 'b')
5938 if (str
[0] == '\000')
5943 if (str
[1] != '_' || str
[2] == '\000')
5947 if (strcmp (str
+ 3, "JM") == 0)
5949 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5950 the LJM suffix in favor of the JM one. But we will
5951 still accept LJM as a valid suffix for a reasonable
5952 amount of time, just to allow ourselves to debug programs
5953 compiled using an older version of GNAT. */
5954 if (strcmp (str
+ 3, "LJM") == 0)
5958 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5959 || str
[4] == 'U' || str
[4] == 'P')
5961 if (str
[4] == 'R' && str
[5] != 'T')
5965 if (!isdigit (str
[2]))
5967 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5968 if (!isdigit (str
[k
]) && str
[k
] != '_')
5972 if (str
[0] == '$' && isdigit (str
[1]))
5974 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5975 if (!isdigit (str
[k
]) && str
[k
] != '_')
5982 /* Return non-zero if the string starting at NAME and ending before
5983 NAME_END contains no capital letters. */
5986 is_valid_name_for_wild_match (const char *name0
)
5988 std::string decoded_name
= ada_decode (name0
);
5991 /* If the decoded name starts with an angle bracket, it means that
5992 NAME0 does not follow the GNAT encoding format. It should then
5993 not be allowed as a possible wild match. */
5994 if (decoded_name
[0] == '<')
5997 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5998 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6004 /* Advance *NAMEP to next occurrence in the string NAME0 of the TARGET0
6005 character which could start a simple name. Assumes that *NAMEP points
6006 somewhere inside the string beginning at NAME0. */
6009 advance_wild_match (const char **namep
, const char *name0
, char target0
)
6011 const char *name
= *namep
;
6021 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6024 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6029 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6030 || name
[2] == target0
))
6038 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6048 /* Return true iff NAME encodes a name of the form prefix.PATN.
6049 Ignores any informational suffixes of NAME (i.e., for which
6050 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6054 wild_match (const char *name
, const char *patn
)
6057 const char *name0
= name
;
6061 const char *match
= name
;
6065 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6068 if (*p
== '\0' && is_name_suffix (name
))
6069 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6071 if (name
[-1] == '_')
6074 if (!advance_wild_match (&name
, name0
, *patn
))
6079 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6080 any trailing suffixes that encode debugging information or leading
6081 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6082 information that is ignored). */
6085 full_match (const char *sym_name
, const char *search_name
)
6087 size_t search_name_len
= strlen (search_name
);
6089 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6090 && is_name_suffix (sym_name
+ search_name_len
))
6093 if (startswith (sym_name
, "_ada_")
6094 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6095 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6101 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6102 *defn_symbols, updating the list of symbols in OBSTACKP (if
6103 necessary). OBJFILE is the section containing BLOCK. */
6106 ada_add_block_symbols (struct obstack
*obstackp
,
6107 const struct block
*block
,
6108 const lookup_name_info
&lookup_name
,
6109 domain_enum domain
, struct objfile
*objfile
)
6111 struct block_iterator iter
;
6112 /* A matching argument symbol, if any. */
6113 struct symbol
*arg_sym
;
6114 /* Set true when we find a matching non-argument symbol. */
6120 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6122 sym
= block_iter_match_next (lookup_name
, &iter
))
6124 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6126 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6128 if (SYMBOL_IS_ARGUMENT (sym
))
6133 add_defn_to_vec (obstackp
,
6134 fixup_symbol_section (sym
, objfile
),
6141 /* Handle renamings. */
6143 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6146 if (!found_sym
&& arg_sym
!= NULL
)
6148 add_defn_to_vec (obstackp
,
6149 fixup_symbol_section (arg_sym
, objfile
),
6153 if (!lookup_name
.ada ().wild_match_p ())
6157 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6158 const char *name
= ada_lookup_name
.c_str ();
6159 size_t name_len
= ada_lookup_name
.size ();
6161 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6163 if (symbol_matches_domain (sym
->language (),
6164 SYMBOL_DOMAIN (sym
), domain
))
6168 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6171 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6173 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6178 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6180 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6182 if (SYMBOL_IS_ARGUMENT (sym
))
6187 add_defn_to_vec (obstackp
,
6188 fixup_symbol_section (sym
, objfile
),
6196 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6197 They aren't parameters, right? */
6198 if (!found_sym
&& arg_sym
!= NULL
)
6200 add_defn_to_vec (obstackp
,
6201 fixup_symbol_section (arg_sym
, objfile
),
6208 /* Symbol Completion */
6213 ada_lookup_name_info::matches
6214 (const char *sym_name
,
6215 symbol_name_match_type match_type
,
6216 completion_match_result
*comp_match_res
) const
6219 const char *text
= m_encoded_name
.c_str ();
6220 size_t text_len
= m_encoded_name
.size ();
6222 /* First, test against the fully qualified name of the symbol. */
6224 if (strncmp (sym_name
, text
, text_len
) == 0)
6227 std::string decoded_name
= ada_decode (sym_name
);
6228 if (match
&& !m_encoded_p
)
6230 /* One needed check before declaring a positive match is to verify
6231 that iff we are doing a verbatim match, the decoded version
6232 of the symbol name starts with '<'. Otherwise, this symbol name
6233 is not a suitable completion. */
6235 bool has_angle_bracket
= (decoded_name
[0] == '<');
6236 match
= (has_angle_bracket
== m_verbatim_p
);
6239 if (match
&& !m_verbatim_p
)
6241 /* When doing non-verbatim match, another check that needs to
6242 be done is to verify that the potentially matching symbol name
6243 does not include capital letters, because the ada-mode would
6244 not be able to understand these symbol names without the
6245 angle bracket notation. */
6248 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6253 /* Second: Try wild matching... */
6255 if (!match
&& m_wild_match_p
)
6257 /* Since we are doing wild matching, this means that TEXT
6258 may represent an unqualified symbol name. We therefore must
6259 also compare TEXT against the unqualified name of the symbol. */
6260 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6262 if (strncmp (sym_name
, text
, text_len
) == 0)
6266 /* Finally: If we found a match, prepare the result to return. */
6271 if (comp_match_res
!= NULL
)
6273 std::string
&match_str
= comp_match_res
->match
.storage ();
6276 match_str
= ada_decode (sym_name
);
6280 match_str
= add_angle_brackets (sym_name
);
6282 match_str
= sym_name
;
6286 comp_match_res
->set_match (match_str
.c_str ());
6294 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6295 for tagged types. */
6298 ada_is_dispatch_table_ptr_type (struct type
*type
)
6302 if (type
->code () != TYPE_CODE_PTR
)
6305 name
= TYPE_TARGET_TYPE (type
)->name ();
6309 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6312 /* Return non-zero if TYPE is an interface tag. */
6315 ada_is_interface_tag (struct type
*type
)
6317 const char *name
= type
->name ();
6322 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6325 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6326 to be invisible to users. */
6329 ada_is_ignored_field (struct type
*type
, int field_num
)
6331 if (field_num
< 0 || field_num
> type
->num_fields ())
6334 /* Check the name of that field. */
6336 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6338 /* Anonymous field names should not be printed.
6339 brobecker/2007-02-20: I don't think this can actually happen
6340 but we don't want to print the value of anonymous fields anyway. */
6344 /* Normally, fields whose name start with an underscore ("_")
6345 are fields that have been internally generated by the compiler,
6346 and thus should not be printed. The "_parent" field is special,
6347 however: This is a field internally generated by the compiler
6348 for tagged types, and it contains the components inherited from
6349 the parent type. This field should not be printed as is, but
6350 should not be ignored either. */
6351 if (name
[0] == '_' && !startswith (name
, "_parent"))
6355 /* If this is the dispatch table of a tagged type or an interface tag,
6357 if (ada_is_tagged_type (type
, 1)
6358 && (ada_is_dispatch_table_ptr_type (type
->field (field_num
).type ())
6359 || ada_is_interface_tag (type
->field (field_num
).type ())))
6362 /* Not a special field, so it should not be ignored. */
6366 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6367 pointer or reference type whose ultimate target has a tag field. */
6370 ada_is_tagged_type (struct type
*type
, int refok
)
6372 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6375 /* True iff TYPE represents the type of X'Tag */
6378 ada_is_tag_type (struct type
*type
)
6380 type
= ada_check_typedef (type
);
6382 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6386 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6388 return (name
!= NULL
6389 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6393 /* The type of the tag on VAL. */
6395 static struct type
*
6396 ada_tag_type (struct value
*val
)
6398 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6401 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6402 retired at Ada 05). */
6405 is_ada95_tag (struct value
*tag
)
6407 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6410 /* The value of the tag on VAL. */
6412 static struct value
*
6413 ada_value_tag (struct value
*val
)
6415 return ada_value_struct_elt (val
, "_tag", 0);
6418 /* The value of the tag on the object of type TYPE whose contents are
6419 saved at VALADDR, if it is non-null, or is at memory address
6422 static struct value
*
6423 value_tag_from_contents_and_address (struct type
*type
,
6424 const gdb_byte
*valaddr
,
6427 int tag_byte_offset
;
6428 struct type
*tag_type
;
6430 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6433 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6435 : valaddr
+ tag_byte_offset
);
6436 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6438 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6443 static struct type
*
6444 type_from_tag (struct value
*tag
)
6446 gdb::unique_xmalloc_ptr
<char> type_name
= ada_tag_name (tag
);
6448 if (type_name
!= NULL
)
6449 return ada_find_any_type (ada_encode (type_name
.get ()).c_str ());
6453 /* Given a value OBJ of a tagged type, return a value of this
6454 type at the base address of the object. The base address, as
6455 defined in Ada.Tags, it is the address of the primary tag of
6456 the object, and therefore where the field values of its full
6457 view can be fetched. */
6460 ada_tag_value_at_base_address (struct value
*obj
)
6463 LONGEST offset_to_top
= 0;
6464 struct type
*ptr_type
, *obj_type
;
6466 CORE_ADDR base_address
;
6468 obj_type
= value_type (obj
);
6470 /* It is the responsability of the caller to deref pointers. */
6472 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6475 tag
= ada_value_tag (obj
);
6479 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6481 if (is_ada95_tag (tag
))
6484 ptr_type
= language_lookup_primitive_type
6485 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6486 ptr_type
= lookup_pointer_type (ptr_type
);
6487 val
= value_cast (ptr_type
, tag
);
6491 /* It is perfectly possible that an exception be raised while
6492 trying to determine the base address, just like for the tag;
6493 see ada_tag_name for more details. We do not print the error
6494 message for the same reason. */
6498 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6501 catch (const gdb_exception_error
&e
)
6506 /* If offset is null, nothing to do. */
6508 if (offset_to_top
== 0)
6511 /* -1 is a special case in Ada.Tags; however, what should be done
6512 is not quite clear from the documentation. So do nothing for
6515 if (offset_to_top
== -1)
6518 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6519 from the base address. This was however incompatible with
6520 C++ dispatch table: C++ uses a *negative* value to *add*
6521 to the base address. Ada's convention has therefore been
6522 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6523 use the same convention. Here, we support both cases by
6524 checking the sign of OFFSET_TO_TOP. */
6526 if (offset_to_top
> 0)
6527 offset_to_top
= -offset_to_top
;
6529 base_address
= value_address (obj
) + offset_to_top
;
6530 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6532 /* Make sure that we have a proper tag at the new address.
6533 Otherwise, offset_to_top is bogus (which can happen when
6534 the object is not initialized yet). */
6539 obj_type
= type_from_tag (tag
);
6544 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6547 /* Return the "ada__tags__type_specific_data" type. */
6549 static struct type
*
6550 ada_get_tsd_type (struct inferior
*inf
)
6552 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6554 if (data
->tsd_type
== 0)
6555 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6556 return data
->tsd_type
;
6559 /* Return the TSD (type-specific data) associated to the given TAG.
6560 TAG is assumed to be the tag of a tagged-type entity.
6562 May return NULL if we are unable to get the TSD. */
6564 static struct value
*
6565 ada_get_tsd_from_tag (struct value
*tag
)
6570 /* First option: The TSD is simply stored as a field of our TAG.
6571 Only older versions of GNAT would use this format, but we have
6572 to test it first, because there are no visible markers for
6573 the current approach except the absence of that field. */
6575 val
= ada_value_struct_elt (tag
, "tsd", 1);
6579 /* Try the second representation for the dispatch table (in which
6580 there is no explicit 'tsd' field in the referent of the tag pointer,
6581 and instead the tsd pointer is stored just before the dispatch
6584 type
= ada_get_tsd_type (current_inferior());
6587 type
= lookup_pointer_type (lookup_pointer_type (type
));
6588 val
= value_cast (type
, tag
);
6591 return value_ind (value_ptradd (val
, -1));
6594 /* Given the TSD of a tag (type-specific data), return a string
6595 containing the name of the associated type.
6597 May return NULL if we are unable to determine the tag name. */
6599 static gdb::unique_xmalloc_ptr
<char>
6600 ada_tag_name_from_tsd (struct value
*tsd
)
6605 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6608 gdb::unique_xmalloc_ptr
<char> buffer
6609 = target_read_string (value_as_address (val
), INT_MAX
);
6610 if (buffer
== nullptr)
6613 for (p
= buffer
.get (); *p
!= '\0'; ++p
)
6622 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6625 Return NULL if the TAG is not an Ada tag, or if we were unable to
6626 determine the name of that tag. */
6628 gdb::unique_xmalloc_ptr
<char>
6629 ada_tag_name (struct value
*tag
)
6631 gdb::unique_xmalloc_ptr
<char> name
;
6633 if (!ada_is_tag_type (value_type (tag
)))
6636 /* It is perfectly possible that an exception be raised while trying
6637 to determine the TAG's name, even under normal circumstances:
6638 The associated variable may be uninitialized or corrupted, for
6639 instance. We do not let any exception propagate past this point.
6640 instead we return NULL.
6642 We also do not print the error message either (which often is very
6643 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6644 the caller print a more meaningful message if necessary. */
6647 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6650 name
= ada_tag_name_from_tsd (tsd
);
6652 catch (const gdb_exception_error
&e
)
6659 /* The parent type of TYPE, or NULL if none. */
6662 ada_parent_type (struct type
*type
)
6666 type
= ada_check_typedef (type
);
6668 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6671 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6672 if (ada_is_parent_field (type
, i
))
6674 struct type
*parent_type
= type
->field (i
).type ();
6676 /* If the _parent field is a pointer, then dereference it. */
6677 if (parent_type
->code () == TYPE_CODE_PTR
)
6678 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6679 /* If there is a parallel XVS type, get the actual base type. */
6680 parent_type
= ada_get_base_type (parent_type
);
6682 return ada_check_typedef (parent_type
);
6688 /* True iff field number FIELD_NUM of structure type TYPE contains the
6689 parent-type (inherited) fields of a derived type. Assumes TYPE is
6690 a structure type with at least FIELD_NUM+1 fields. */
6693 ada_is_parent_field (struct type
*type
, int field_num
)
6695 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6697 return (name
!= NULL
6698 && (startswith (name
, "PARENT")
6699 || startswith (name
, "_parent")));
6702 /* True iff field number FIELD_NUM of structure type TYPE is a
6703 transparent wrapper field (which should be silently traversed when doing
6704 field selection and flattened when printing). Assumes TYPE is a
6705 structure type with at least FIELD_NUM+1 fields. Such fields are always
6709 ada_is_wrapper_field (struct type
*type
, int field_num
)
6711 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6713 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6715 /* This happens in functions with "out" or "in out" parameters
6716 which are passed by copy. For such functions, GNAT describes
6717 the function's return type as being a struct where the return
6718 value is in a field called RETVAL, and where the other "out"
6719 or "in out" parameters are fields of that struct. This is not
6724 return (name
!= NULL
6725 && (startswith (name
, "PARENT")
6726 || strcmp (name
, "REP") == 0
6727 || startswith (name
, "_parent")
6728 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6731 /* True iff field number FIELD_NUM of structure or union type TYPE
6732 is a variant wrapper. Assumes TYPE is a structure type with at least
6733 FIELD_NUM+1 fields. */
6736 ada_is_variant_part (struct type
*type
, int field_num
)
6738 /* Only Ada types are eligible. */
6739 if (!ADA_TYPE_P (type
))
6742 struct type
*field_type
= type
->field (field_num
).type ();
6744 return (field_type
->code () == TYPE_CODE_UNION
6745 || (is_dynamic_field (type
, field_num
)
6746 && (TYPE_TARGET_TYPE (field_type
)->code ()
6747 == TYPE_CODE_UNION
)));
6750 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6751 whose discriminants are contained in the record type OUTER_TYPE,
6752 returns the type of the controlling discriminant for the variant.
6753 May return NULL if the type could not be found. */
6756 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6758 const char *name
= ada_variant_discrim_name (var_type
);
6760 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6763 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6764 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6765 represents a 'when others' clause; otherwise 0. */
6768 ada_is_others_clause (struct type
*type
, int field_num
)
6770 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6772 return (name
!= NULL
&& name
[0] == 'O');
6775 /* Assuming that TYPE0 is the type of the variant part of a record,
6776 returns the name of the discriminant controlling the variant.
6777 The value is valid until the next call to ada_variant_discrim_name. */
6780 ada_variant_discrim_name (struct type
*type0
)
6782 static char *result
= NULL
;
6783 static size_t result_len
= 0;
6786 const char *discrim_end
;
6787 const char *discrim_start
;
6789 if (type0
->code () == TYPE_CODE_PTR
)
6790 type
= TYPE_TARGET_TYPE (type0
);
6794 name
= ada_type_name (type
);
6796 if (name
== NULL
|| name
[0] == '\000')
6799 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6802 if (startswith (discrim_end
, "___XVN"))
6805 if (discrim_end
== name
)
6808 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6811 if (discrim_start
== name
+ 1)
6813 if ((discrim_start
> name
+ 3
6814 && startswith (discrim_start
- 3, "___"))
6815 || discrim_start
[-1] == '.')
6819 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6820 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6821 result
[discrim_end
- discrim_start
] = '\0';
6825 /* Scan STR for a subtype-encoded number, beginning at position K.
6826 Put the position of the character just past the number scanned in
6827 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6828 Return 1 if there was a valid number at the given position, and 0
6829 otherwise. A "subtype-encoded" number consists of the absolute value
6830 in decimal, followed by the letter 'm' to indicate a negative number.
6831 Assumes 0m does not occur. */
6834 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6838 if (!isdigit (str
[k
]))
6841 /* Do it the hard way so as not to make any assumption about
6842 the relationship of unsigned long (%lu scan format code) and
6845 while (isdigit (str
[k
]))
6847 RU
= RU
* 10 + (str
[k
] - '0');
6854 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6860 /* NOTE on the above: Technically, C does not say what the results of
6861 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6862 number representable as a LONGEST (although either would probably work
6863 in most implementations). When RU>0, the locution in the then branch
6864 above is always equivalent to the negative of RU. */
6871 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6872 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6873 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6876 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6878 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6892 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6902 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6903 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6905 if (val
>= L
&& val
<= U
)
6917 /* FIXME: Lots of redundancy below. Try to consolidate. */
6919 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6920 ARG_TYPE, extract and return the value of one of its (non-static)
6921 fields. FIELDNO says which field. Differs from value_primitive_field
6922 only in that it can handle packed values of arbitrary type. */
6925 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6926 struct type
*arg_type
)
6930 arg_type
= ada_check_typedef (arg_type
);
6931 type
= arg_type
->field (fieldno
).type ();
6933 /* Handle packed fields. It might be that the field is not packed
6934 relative to its containing structure, but the structure itself is
6935 packed; in this case we must take the bit-field path. */
6936 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
6938 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6939 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6941 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6942 offset
+ bit_pos
/ 8,
6943 bit_pos
% 8, bit_size
, type
);
6946 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6949 /* Find field with name NAME in object of type TYPE. If found,
6950 set the following for each argument that is non-null:
6951 - *FIELD_TYPE_P to the field's type;
6952 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6953 an object of that type;
6954 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6955 - *BIT_SIZE_P to its size in bits if the field is packed, and
6957 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6958 fields up to but not including the desired field, or by the total
6959 number of fields if not found. A NULL value of NAME never
6960 matches; the function just counts visible fields in this case.
6962 Notice that we need to handle when a tagged record hierarchy
6963 has some components with the same name, like in this scenario:
6965 type Top_T is tagged record
6971 type Middle_T is new Top.Top_T with record
6972 N : Character := 'a';
6976 type Bottom_T is new Middle.Middle_T with record
6978 C : Character := '5';
6980 A : Character := 'J';
6983 Let's say we now have a variable declared and initialized as follow:
6985 TC : Top_A := new Bottom_T;
6987 And then we use this variable to call this function
6989 procedure Assign (Obj: in out Top_T; TV : Integer);
6993 Assign (Top_T (B), 12);
6995 Now, we're in the debugger, and we're inside that procedure
6996 then and we want to print the value of obj.c:
6998 Usually, the tagged record or one of the parent type owns the
6999 component to print and there's no issue but in this particular
7000 case, what does it mean to ask for Obj.C? Since the actual
7001 type for object is type Bottom_T, it could mean two things: type
7002 component C from the Middle_T view, but also component C from
7003 Bottom_T. So in that "undefined" case, when the component is
7004 not found in the non-resolved type (which includes all the
7005 components of the parent type), then resolve it and see if we
7006 get better luck once expanded.
7008 In the case of homonyms in the derived tagged type, we don't
7009 guaranty anything, and pick the one that's easiest for us
7012 Returns 1 if found, 0 otherwise. */
7015 find_struct_field (const char *name
, struct type
*type
, int offset
,
7016 struct type
**field_type_p
,
7017 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7021 int parent_offset
= -1;
7023 type
= ada_check_typedef (type
);
7025 if (field_type_p
!= NULL
)
7026 *field_type_p
= NULL
;
7027 if (byte_offset_p
!= NULL
)
7029 if (bit_offset_p
!= NULL
)
7031 if (bit_size_p
!= NULL
)
7034 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7036 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7037 int fld_offset
= offset
+ bit_pos
/ 8;
7038 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7040 if (t_field_name
== NULL
)
7043 else if (ada_is_parent_field (type
, i
))
7045 /* This is a field pointing us to the parent type of a tagged
7046 type. As hinted in this function's documentation, we give
7047 preference to fields in the current record first, so what
7048 we do here is just record the index of this field before
7049 we skip it. If it turns out we couldn't find our field
7050 in the current record, then we'll get back to it and search
7051 inside it whether the field might exist in the parent. */
7057 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7059 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7061 if (field_type_p
!= NULL
)
7062 *field_type_p
= type
->field (i
).type ();
7063 if (byte_offset_p
!= NULL
)
7064 *byte_offset_p
= fld_offset
;
7065 if (bit_offset_p
!= NULL
)
7066 *bit_offset_p
= bit_pos
% 8;
7067 if (bit_size_p
!= NULL
)
7068 *bit_size_p
= bit_size
;
7071 else if (ada_is_wrapper_field (type
, i
))
7073 if (find_struct_field (name
, type
->field (i
).type (), fld_offset
,
7074 field_type_p
, byte_offset_p
, bit_offset_p
,
7075 bit_size_p
, index_p
))
7078 else if (ada_is_variant_part (type
, i
))
7080 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7083 struct type
*field_type
7084 = ada_check_typedef (type
->field (i
).type ());
7086 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7088 if (find_struct_field (name
, field_type
->field (j
).type (),
7090 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7091 field_type_p
, byte_offset_p
,
7092 bit_offset_p
, bit_size_p
, index_p
))
7096 else if (index_p
!= NULL
)
7100 /* Field not found so far. If this is a tagged type which
7101 has a parent, try finding that field in the parent now. */
7103 if (parent_offset
!= -1)
7105 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7106 int fld_offset
= offset
+ bit_pos
/ 8;
7108 if (find_struct_field (name
, type
->field (parent_offset
).type (),
7109 fld_offset
, field_type_p
, byte_offset_p
,
7110 bit_offset_p
, bit_size_p
, index_p
))
7117 /* Number of user-visible fields in record type TYPE. */
7120 num_visible_fields (struct type
*type
)
7125 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7129 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7130 and search in it assuming it has (class) type TYPE.
7131 If found, return value, else return NULL.
7133 Searches recursively through wrapper fields (e.g., '_parent').
7135 In the case of homonyms in the tagged types, please refer to the
7136 long explanation in find_struct_field's function documentation. */
7138 static struct value
*
7139 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7143 int parent_offset
= -1;
7145 type
= ada_check_typedef (type
);
7146 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7148 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7150 if (t_field_name
== NULL
)
7153 else if (ada_is_parent_field (type
, i
))
7155 /* This is a field pointing us to the parent type of a tagged
7156 type. As hinted in this function's documentation, we give
7157 preference to fields in the current record first, so what
7158 we do here is just record the index of this field before
7159 we skip it. If it turns out we couldn't find our field
7160 in the current record, then we'll get back to it and search
7161 inside it whether the field might exist in the parent. */
7167 else if (field_name_match (t_field_name
, name
))
7168 return ada_value_primitive_field (arg
, offset
, i
, type
);
7170 else if (ada_is_wrapper_field (type
, i
))
7172 struct value
*v
= /* Do not let indent join lines here. */
7173 ada_search_struct_field (name
, arg
,
7174 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7175 type
->field (i
).type ());
7181 else if (ada_is_variant_part (type
, i
))
7183 /* PNH: Do we ever get here? See find_struct_field. */
7185 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7186 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7188 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7190 struct value
*v
= ada_search_struct_field
/* Force line
7193 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7194 field_type
->field (j
).type ());
7202 /* Field not found so far. If this is a tagged type which
7203 has a parent, try finding that field in the parent now. */
7205 if (parent_offset
!= -1)
7207 struct value
*v
= ada_search_struct_field (
7208 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7209 type
->field (parent_offset
).type ());
7218 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7219 int, struct type
*);
7222 /* Return field #INDEX in ARG, where the index is that returned by
7223 * find_struct_field through its INDEX_P argument. Adjust the address
7224 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7225 * If found, return value, else return NULL. */
7227 static struct value
*
7228 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7231 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7235 /* Auxiliary function for ada_index_struct_field. Like
7236 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7239 static struct value
*
7240 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7244 type
= ada_check_typedef (type
);
7246 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7248 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7250 else if (ada_is_wrapper_field (type
, i
))
7252 struct value
*v
= /* Do not let indent join lines here. */
7253 ada_index_struct_field_1 (index_p
, arg
,
7254 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7255 type
->field (i
).type ());
7261 else if (ada_is_variant_part (type
, i
))
7263 /* PNH: Do we ever get here? See ada_search_struct_field,
7264 find_struct_field. */
7265 error (_("Cannot assign this kind of variant record"));
7267 else if (*index_p
== 0)
7268 return ada_value_primitive_field (arg
, offset
, i
, type
);
7275 /* Return a string representation of type TYPE. */
7278 type_as_string (struct type
*type
)
7280 string_file tmp_stream
;
7282 type_print (type
, "", &tmp_stream
, -1);
7284 return std::move (tmp_stream
.string ());
7287 /* Given a type TYPE, look up the type of the component of type named NAME.
7288 If DISPP is non-null, add its byte displacement from the beginning of a
7289 structure (pointed to by a value) of type TYPE to *DISPP (does not
7290 work for packed fields).
7292 Matches any field whose name has NAME as a prefix, possibly
7295 TYPE can be either a struct or union. If REFOK, TYPE may also
7296 be a (pointer or reference)+ to a struct or union, and the
7297 ultimate target type will be searched.
7299 Looks recursively into variant clauses and parent types.
7301 In the case of homonyms in the tagged types, please refer to the
7302 long explanation in find_struct_field's function documentation.
7304 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7305 TYPE is not a type of the right kind. */
7307 static struct type
*
7308 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7312 int parent_offset
= -1;
7317 if (refok
&& type
!= NULL
)
7320 type
= ada_check_typedef (type
);
7321 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7323 type
= TYPE_TARGET_TYPE (type
);
7327 || (type
->code () != TYPE_CODE_STRUCT
7328 && type
->code () != TYPE_CODE_UNION
))
7333 error (_("Type %s is not a structure or union type"),
7334 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7337 type
= to_static_fixed_type (type
);
7339 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7341 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7344 if (t_field_name
== NULL
)
7347 else if (ada_is_parent_field (type
, i
))
7349 /* This is a field pointing us to the parent type of a tagged
7350 type. As hinted in this function's documentation, we give
7351 preference to fields in the current record first, so what
7352 we do here is just record the index of this field before
7353 we skip it. If it turns out we couldn't find our field
7354 in the current record, then we'll get back to it and search
7355 inside it whether the field might exist in the parent. */
7361 else if (field_name_match (t_field_name
, name
))
7362 return type
->field (i
).type ();
7364 else if (ada_is_wrapper_field (type
, i
))
7366 t
= ada_lookup_struct_elt_type (type
->field (i
).type (), name
,
7372 else if (ada_is_variant_part (type
, i
))
7375 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7377 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
7379 /* FIXME pnh 2008/01/26: We check for a field that is
7380 NOT wrapped in a struct, since the compiler sometimes
7381 generates these for unchecked variant types. Revisit
7382 if the compiler changes this practice. */
7383 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7385 if (v_field_name
!= NULL
7386 && field_name_match (v_field_name
, name
))
7387 t
= field_type
->field (j
).type ();
7389 t
= ada_lookup_struct_elt_type (field_type
->field (j
).type (),
7399 /* Field not found so far. If this is a tagged type which
7400 has a parent, try finding that field in the parent now. */
7402 if (parent_offset
!= -1)
7406 t
= ada_lookup_struct_elt_type (type
->field (parent_offset
).type (),
7415 const char *name_str
= name
!= NULL
? name
: _("<null>");
7417 error (_("Type %s has no component named %s"),
7418 type_as_string (type
).c_str (), name_str
);
7424 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7425 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7426 represents an unchecked union (that is, the variant part of a
7427 record that is named in an Unchecked_Union pragma). */
7430 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7432 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7434 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7438 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7439 within OUTER, determine which variant clause (field number in VAR_TYPE,
7440 numbering from 0) is applicable. Returns -1 if none are. */
7443 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7447 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7448 struct value
*discrim
;
7449 LONGEST discrim_val
;
7451 /* Using plain value_from_contents_and_address here causes problems
7452 because we will end up trying to resolve a type that is currently
7453 being constructed. */
7454 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7455 if (discrim
== NULL
)
7457 discrim_val
= value_as_long (discrim
);
7460 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7462 if (ada_is_others_clause (var_type
, i
))
7464 else if (ada_in_variant (discrim_val
, var_type
, i
))
7468 return others_clause
;
7473 /* Dynamic-Sized Records */
7475 /* Strategy: The type ostensibly attached to a value with dynamic size
7476 (i.e., a size that is not statically recorded in the debugging
7477 data) does not accurately reflect the size or layout of the value.
7478 Our strategy is to convert these values to values with accurate,
7479 conventional types that are constructed on the fly. */
7481 /* There is a subtle and tricky problem here. In general, we cannot
7482 determine the size of dynamic records without its data. However,
7483 the 'struct value' data structure, which GDB uses to represent
7484 quantities in the inferior process (the target), requires the size
7485 of the type at the time of its allocation in order to reserve space
7486 for GDB's internal copy of the data. That's why the
7487 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7488 rather than struct value*s.
7490 However, GDB's internal history variables ($1, $2, etc.) are
7491 struct value*s containing internal copies of the data that are not, in
7492 general, the same as the data at their corresponding addresses in
7493 the target. Fortunately, the types we give to these values are all
7494 conventional, fixed-size types (as per the strategy described
7495 above), so that we don't usually have to perform the
7496 'to_fixed_xxx_type' conversions to look at their values.
7497 Unfortunately, there is one exception: if one of the internal
7498 history variables is an array whose elements are unconstrained
7499 records, then we will need to create distinct fixed types for each
7500 element selected. */
7502 /* The upshot of all of this is that many routines take a (type, host
7503 address, target address) triple as arguments to represent a value.
7504 The host address, if non-null, is supposed to contain an internal
7505 copy of the relevant data; otherwise, the program is to consult the
7506 target at the target address. */
7508 /* Assuming that VAL0 represents a pointer value, the result of
7509 dereferencing it. Differs from value_ind in its treatment of
7510 dynamic-sized types. */
7513 ada_value_ind (struct value
*val0
)
7515 struct value
*val
= value_ind (val0
);
7517 if (ada_is_tagged_type (value_type (val
), 0))
7518 val
= ada_tag_value_at_base_address (val
);
7520 return ada_to_fixed_value (val
);
7523 /* The value resulting from dereferencing any "reference to"
7524 qualifiers on VAL0. */
7526 static struct value
*
7527 ada_coerce_ref (struct value
*val0
)
7529 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7531 struct value
*val
= val0
;
7533 val
= coerce_ref (val
);
7535 if (ada_is_tagged_type (value_type (val
), 0))
7536 val
= ada_tag_value_at_base_address (val
);
7538 return ada_to_fixed_value (val
);
7544 /* Return the bit alignment required for field #F of template type TYPE. */
7547 field_alignment (struct type
*type
, int f
)
7549 const char *name
= TYPE_FIELD_NAME (type
, f
);
7553 /* The field name should never be null, unless the debugging information
7554 is somehow malformed. In this case, we assume the field does not
7555 require any alignment. */
7559 len
= strlen (name
);
7561 if (!isdigit (name
[len
- 1]))
7564 if (isdigit (name
[len
- 2]))
7565 align_offset
= len
- 2;
7567 align_offset
= len
- 1;
7569 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7570 return TARGET_CHAR_BIT
;
7572 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7575 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7577 static struct symbol
*
7578 ada_find_any_type_symbol (const char *name
)
7582 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7583 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7586 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7590 /* Find a type named NAME. Ignores ambiguity. This routine will look
7591 solely for types defined by debug info, it will not search the GDB
7594 static struct type
*
7595 ada_find_any_type (const char *name
)
7597 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7600 return SYMBOL_TYPE (sym
);
7605 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7606 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7607 symbol, in which case it is returned. Otherwise, this looks for
7608 symbols whose name is that of NAME_SYM suffixed with "___XR".
7609 Return symbol if found, and NULL otherwise. */
7612 ada_is_renaming_symbol (struct symbol
*name_sym
)
7614 const char *name
= name_sym
->linkage_name ();
7615 return strstr (name
, "___XR") != NULL
;
7618 /* Because of GNAT encoding conventions, several GDB symbols may match a
7619 given type name. If the type denoted by TYPE0 is to be preferred to
7620 that of TYPE1 for purposes of type printing, return non-zero;
7621 otherwise return 0. */
7624 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7628 else if (type0
== NULL
)
7630 else if (type1
->code () == TYPE_CODE_VOID
)
7632 else if (type0
->code () == TYPE_CODE_VOID
)
7634 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7636 else if (ada_is_constrained_packed_array_type (type0
))
7638 else if (ada_is_array_descriptor_type (type0
)
7639 && !ada_is_array_descriptor_type (type1
))
7643 const char *type0_name
= type0
->name ();
7644 const char *type1_name
= type1
->name ();
7646 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7647 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7653 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7657 ada_type_name (struct type
*type
)
7661 return type
->name ();
7664 /* Search the list of "descriptive" types associated to TYPE for a type
7665 whose name is NAME. */
7667 static struct type
*
7668 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7670 struct type
*result
, *tmp
;
7672 if (ada_ignore_descriptive_types_p
)
7675 /* If there no descriptive-type info, then there is no parallel type
7677 if (!HAVE_GNAT_AUX_INFO (type
))
7680 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7681 while (result
!= NULL
)
7683 const char *result_name
= ada_type_name (result
);
7685 if (result_name
== NULL
)
7687 warning (_("unexpected null name on descriptive type"));
7691 /* If the names match, stop. */
7692 if (strcmp (result_name
, name
) == 0)
7695 /* Otherwise, look at the next item on the list, if any. */
7696 if (HAVE_GNAT_AUX_INFO (result
))
7697 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7701 /* If not found either, try after having resolved the typedef. */
7706 result
= check_typedef (result
);
7707 if (HAVE_GNAT_AUX_INFO (result
))
7708 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7714 /* If we didn't find a match, see whether this is a packed array. With
7715 older compilers, the descriptive type information is either absent or
7716 irrelevant when it comes to packed arrays so the above lookup fails.
7717 Fall back to using a parallel lookup by name in this case. */
7718 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7719 return ada_find_any_type (name
);
7724 /* Find a parallel type to TYPE with the specified NAME, using the
7725 descriptive type taken from the debugging information, if available,
7726 and otherwise using the (slower) name-based method. */
7728 static struct type
*
7729 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7731 struct type
*result
= NULL
;
7733 if (HAVE_GNAT_AUX_INFO (type
))
7734 result
= find_parallel_type_by_descriptive_type (type
, name
);
7736 result
= ada_find_any_type (name
);
7741 /* Same as above, but specify the name of the parallel type by appending
7742 SUFFIX to the name of TYPE. */
7745 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7748 const char *type_name
= ada_type_name (type
);
7751 if (type_name
== NULL
)
7754 len
= strlen (type_name
);
7756 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7758 strcpy (name
, type_name
);
7759 strcpy (name
+ len
, suffix
);
7761 return ada_find_parallel_type_with_name (type
, name
);
7764 /* If TYPE is a variable-size record type, return the corresponding template
7765 type describing its fields. Otherwise, return NULL. */
7767 static struct type
*
7768 dynamic_template_type (struct type
*type
)
7770 type
= ada_check_typedef (type
);
7772 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7773 || ada_type_name (type
) == NULL
)
7777 int len
= strlen (ada_type_name (type
));
7779 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7782 return ada_find_parallel_type (type
, "___XVE");
7786 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7787 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7790 is_dynamic_field (struct type
*templ_type
, int field_num
)
7792 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7795 && templ_type
->field (field_num
).type ()->code () == TYPE_CODE_PTR
7796 && strstr (name
, "___XVL") != NULL
;
7799 /* The index of the variant field of TYPE, or -1 if TYPE does not
7800 represent a variant record type. */
7803 variant_field_index (struct type
*type
)
7807 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
7810 for (f
= 0; f
< type
->num_fields (); f
+= 1)
7812 if (ada_is_variant_part (type
, f
))
7818 /* A record type with no fields. */
7820 static struct type
*
7821 empty_record (struct type
*templ
)
7823 struct type
*type
= alloc_type_copy (templ
);
7825 type
->set_code (TYPE_CODE_STRUCT
);
7826 INIT_NONE_SPECIFIC (type
);
7827 type
->set_name ("<empty>");
7828 TYPE_LENGTH (type
) = 0;
7832 /* An ordinary record type (with fixed-length fields) that describes
7833 the value of type TYPE at VALADDR or ADDRESS (see comments at
7834 the beginning of this section) VAL according to GNAT conventions.
7835 DVAL0 should describe the (portion of a) record that contains any
7836 necessary discriminants. It should be NULL if value_type (VAL) is
7837 an outer-level type (i.e., as opposed to a branch of a variant.) A
7838 variant field (unless unchecked) is replaced by a particular branch
7841 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7842 length are not statically known are discarded. As a consequence,
7843 VALADDR, ADDRESS and DVAL0 are ignored.
7845 NOTE: Limitations: For now, we assume that dynamic fields and
7846 variants occupy whole numbers of bytes. However, they need not be
7850 ada_template_to_fixed_record_type_1 (struct type
*type
,
7851 const gdb_byte
*valaddr
,
7852 CORE_ADDR address
, struct value
*dval0
,
7853 int keep_dynamic_fields
)
7855 struct value
*mark
= value_mark ();
7858 int nfields
, bit_len
;
7864 /* Compute the number of fields in this record type that are going
7865 to be processed: unless keep_dynamic_fields, this includes only
7866 fields whose position and length are static will be processed. */
7867 if (keep_dynamic_fields
)
7868 nfields
= type
->num_fields ();
7872 while (nfields
< type
->num_fields ()
7873 && !ada_is_variant_part (type
, nfields
)
7874 && !is_dynamic_field (type
, nfields
))
7878 rtype
= alloc_type_copy (type
);
7879 rtype
->set_code (TYPE_CODE_STRUCT
);
7880 INIT_NONE_SPECIFIC (rtype
);
7881 rtype
->set_num_fields (nfields
);
7883 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
7884 rtype
->set_name (ada_type_name (type
));
7885 rtype
->set_is_fixed_instance (true);
7891 for (f
= 0; f
< nfields
; f
+= 1)
7893 off
= align_up (off
, field_alignment (type
, f
))
7894 + TYPE_FIELD_BITPOS (type
, f
);
7895 SET_FIELD_BITPOS (rtype
->field (f
), off
);
7896 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7898 if (ada_is_variant_part (type
, f
))
7903 else if (is_dynamic_field (type
, f
))
7905 const gdb_byte
*field_valaddr
= valaddr
;
7906 CORE_ADDR field_address
= address
;
7907 struct type
*field_type
=
7908 TYPE_TARGET_TYPE (type
->field (f
).type ());
7912 /* rtype's length is computed based on the run-time
7913 value of discriminants. If the discriminants are not
7914 initialized, the type size may be completely bogus and
7915 GDB may fail to allocate a value for it. So check the
7916 size first before creating the value. */
7917 ada_ensure_varsize_limit (rtype
);
7918 /* Using plain value_from_contents_and_address here
7919 causes problems because we will end up trying to
7920 resolve a type that is currently being
7922 dval
= value_from_contents_and_address_unresolved (rtype
,
7925 rtype
= value_type (dval
);
7930 /* If the type referenced by this field is an aligner type, we need
7931 to unwrap that aligner type, because its size might not be set.
7932 Keeping the aligner type would cause us to compute the wrong
7933 size for this field, impacting the offset of the all the fields
7934 that follow this one. */
7935 if (ada_is_aligner_type (field_type
))
7937 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7939 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7940 field_address
= cond_offset_target (field_address
, field_offset
);
7941 field_type
= ada_aligned_type (field_type
);
7944 field_valaddr
= cond_offset_host (field_valaddr
,
7945 off
/ TARGET_CHAR_BIT
);
7946 field_address
= cond_offset_target (field_address
,
7947 off
/ TARGET_CHAR_BIT
);
7949 /* Get the fixed type of the field. Note that, in this case,
7950 we do not want to get the real type out of the tag: if
7951 the current field is the parent part of a tagged record,
7952 we will get the tag of the object. Clearly wrong: the real
7953 type of the parent is not the real type of the child. We
7954 would end up in an infinite loop. */
7955 field_type
= ada_get_base_type (field_type
);
7956 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7957 field_address
, dval
, 0);
7958 /* If the field size is already larger than the maximum
7959 object size, then the record itself will necessarily
7960 be larger than the maximum object size. We need to make
7961 this check now, because the size might be so ridiculously
7962 large (due to an uninitialized variable in the inferior)
7963 that it would cause an overflow when adding it to the
7965 ada_ensure_varsize_limit (field_type
);
7967 rtype
->field (f
).set_type (field_type
);
7968 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7969 /* The multiplication can potentially overflow. But because
7970 the field length has been size-checked just above, and
7971 assuming that the maximum size is a reasonable value,
7972 an overflow should not happen in practice. So rather than
7973 adding overflow recovery code to this already complex code,
7974 we just assume that it's not going to happen. */
7976 TYPE_LENGTH (rtype
->field (f
).type ()) * TARGET_CHAR_BIT
;
7980 /* Note: If this field's type is a typedef, it is important
7981 to preserve the typedef layer.
7983 Otherwise, we might be transforming a typedef to a fat
7984 pointer (encoding a pointer to an unconstrained array),
7985 into a basic fat pointer (encoding an unconstrained
7986 array). As both types are implemented using the same
7987 structure, the typedef is the only clue which allows us
7988 to distinguish between the two options. Stripping it
7989 would prevent us from printing this field appropriately. */
7990 rtype
->field (f
).set_type (type
->field (f
).type ());
7991 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7992 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7994 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7997 struct type
*field_type
= type
->field (f
).type ();
7999 /* We need to be careful of typedefs when computing
8000 the length of our field. If this is a typedef,
8001 get the length of the target type, not the length
8003 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
8004 field_type
= ada_typedef_target_type (field_type
);
8007 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8010 if (off
+ fld_bit_len
> bit_len
)
8011 bit_len
= off
+ fld_bit_len
;
8013 TYPE_LENGTH (rtype
) =
8014 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8017 /* We handle the variant part, if any, at the end because of certain
8018 odd cases in which it is re-ordered so as NOT to be the last field of
8019 the record. This can happen in the presence of representation
8021 if (variant_field
>= 0)
8023 struct type
*branch_type
;
8025 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8029 /* Using plain value_from_contents_and_address here causes
8030 problems because we will end up trying to resolve a type
8031 that is currently being constructed. */
8032 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8034 rtype
= value_type (dval
);
8040 to_fixed_variant_branch_type
8041 (type
->field (variant_field
).type (),
8042 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8043 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8044 if (branch_type
== NULL
)
8046 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
8047 rtype
->field (f
- 1) = rtype
->field (f
);
8048 rtype
->set_num_fields (rtype
->num_fields () - 1);
8052 rtype
->field (variant_field
).set_type (branch_type
);
8053 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8055 TYPE_LENGTH (rtype
->field (variant_field
).type ()) *
8057 if (off
+ fld_bit_len
> bit_len
)
8058 bit_len
= off
+ fld_bit_len
;
8059 TYPE_LENGTH (rtype
) =
8060 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8064 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8065 should contain the alignment of that record, which should be a strictly
8066 positive value. If null or negative, then something is wrong, most
8067 probably in the debug info. In that case, we don't round up the size
8068 of the resulting type. If this record is not part of another structure,
8069 the current RTYPE length might be good enough for our purposes. */
8070 if (TYPE_LENGTH (type
) <= 0)
8073 warning (_("Invalid type size for `%s' detected: %s."),
8074 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
8076 warning (_("Invalid type size for <unnamed> detected: %s."),
8077 pulongest (TYPE_LENGTH (type
)));
8081 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
8082 TYPE_LENGTH (type
));
8085 value_free_to_mark (mark
);
8086 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8087 error (_("record type with dynamic size is larger than varsize-limit"));
8091 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8094 static struct type
*
8095 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8096 CORE_ADDR address
, struct value
*dval0
)
8098 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8102 /* An ordinary record type in which ___XVL-convention fields and
8103 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8104 static approximations, containing all possible fields. Uses
8105 no runtime values. Useless for use in values, but that's OK,
8106 since the results are used only for type determinations. Works on both
8107 structs and unions. Representation note: to save space, we memorize
8108 the result of this function in the TYPE_TARGET_TYPE of the
8111 static struct type
*
8112 template_to_static_fixed_type (struct type
*type0
)
8118 /* No need no do anything if the input type is already fixed. */
8119 if (type0
->is_fixed_instance ())
8122 /* Likewise if we already have computed the static approximation. */
8123 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8124 return TYPE_TARGET_TYPE (type0
);
8126 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8128 nfields
= type0
->num_fields ();
8130 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8131 recompute all over next time. */
8132 TYPE_TARGET_TYPE (type0
) = type
;
8134 for (f
= 0; f
< nfields
; f
+= 1)
8136 struct type
*field_type
= type0
->field (f
).type ();
8137 struct type
*new_type
;
8139 if (is_dynamic_field (type0
, f
))
8141 field_type
= ada_check_typedef (field_type
);
8142 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8145 new_type
= static_unwrap_type (field_type
);
8147 if (new_type
!= field_type
)
8149 /* Clone TYPE0 only the first time we get a new field type. */
8152 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8153 type
->set_code (type0
->code ());
8154 INIT_NONE_SPECIFIC (type
);
8155 type
->set_num_fields (nfields
);
8159 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
8160 memcpy (fields
, type0
->fields (),
8161 sizeof (struct field
) * nfields
);
8162 type
->set_fields (fields
);
8164 type
->set_name (ada_type_name (type0
));
8165 type
->set_is_fixed_instance (true);
8166 TYPE_LENGTH (type
) = 0;
8168 type
->field (f
).set_type (new_type
);
8169 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8176 /* Given an object of type TYPE whose contents are at VALADDR and
8177 whose address in memory is ADDRESS, returns a revision of TYPE,
8178 which should be a non-dynamic-sized record, in which the variant
8179 part, if any, is replaced with the appropriate branch. Looks
8180 for discriminant values in DVAL0, which can be NULL if the record
8181 contains the necessary discriminant values. */
8183 static struct type
*
8184 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8185 CORE_ADDR address
, struct value
*dval0
)
8187 struct value
*mark
= value_mark ();
8190 struct type
*branch_type
;
8191 int nfields
= type
->num_fields ();
8192 int variant_field
= variant_field_index (type
);
8194 if (variant_field
== -1)
8199 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8200 type
= value_type (dval
);
8205 rtype
= alloc_type_copy (type
);
8206 rtype
->set_code (TYPE_CODE_STRUCT
);
8207 INIT_NONE_SPECIFIC (rtype
);
8208 rtype
->set_num_fields (nfields
);
8211 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8212 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
8213 rtype
->set_fields (fields
);
8215 rtype
->set_name (ada_type_name (type
));
8216 rtype
->set_is_fixed_instance (true);
8217 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8219 branch_type
= to_fixed_variant_branch_type
8220 (type
->field (variant_field
).type (),
8221 cond_offset_host (valaddr
,
8222 TYPE_FIELD_BITPOS (type
, variant_field
)
8224 cond_offset_target (address
,
8225 TYPE_FIELD_BITPOS (type
, variant_field
)
8226 / TARGET_CHAR_BIT
), dval
);
8227 if (branch_type
== NULL
)
8231 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8232 rtype
->field (f
- 1) = rtype
->field (f
);
8233 rtype
->set_num_fields (rtype
->num_fields () - 1);
8237 rtype
->field (variant_field
).set_type (branch_type
);
8238 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8239 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8240 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8242 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (type
->field (variant_field
).type ());
8244 value_free_to_mark (mark
);
8248 /* An ordinary record type (with fixed-length fields) that describes
8249 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8250 beginning of this section]. Any necessary discriminants' values
8251 should be in DVAL, a record value; it may be NULL if the object
8252 at ADDR itself contains any necessary discriminant values.
8253 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8254 values from the record are needed. Except in the case that DVAL,
8255 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8256 unchecked) is replaced by a particular branch of the variant.
8258 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8259 is questionable and may be removed. It can arise during the
8260 processing of an unconstrained-array-of-record type where all the
8261 variant branches have exactly the same size. This is because in
8262 such cases, the compiler does not bother to use the XVS convention
8263 when encoding the record. I am currently dubious of this
8264 shortcut and suspect the compiler should be altered. FIXME. */
8266 static struct type
*
8267 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8268 CORE_ADDR address
, struct value
*dval
)
8270 struct type
*templ_type
;
8272 if (type0
->is_fixed_instance ())
8275 templ_type
= dynamic_template_type (type0
);
8277 if (templ_type
!= NULL
)
8278 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8279 else if (variant_field_index (type0
) >= 0)
8281 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8283 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8288 type0
->set_is_fixed_instance (true);
8294 /* An ordinary record type (with fixed-length fields) that describes
8295 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8296 union type. Any necessary discriminants' values should be in DVAL,
8297 a record value. That is, this routine selects the appropriate
8298 branch of the union at ADDR according to the discriminant value
8299 indicated in the union's type name. Returns VAR_TYPE0 itself if
8300 it represents a variant subject to a pragma Unchecked_Union. */
8302 static struct type
*
8303 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8304 CORE_ADDR address
, struct value
*dval
)
8307 struct type
*templ_type
;
8308 struct type
*var_type
;
8310 if (var_type0
->code () == TYPE_CODE_PTR
)
8311 var_type
= TYPE_TARGET_TYPE (var_type0
);
8313 var_type
= var_type0
;
8315 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8317 if (templ_type
!= NULL
)
8318 var_type
= templ_type
;
8320 if (is_unchecked_variant (var_type
, value_type (dval
)))
8322 which
= ada_which_variant_applies (var_type
, dval
);
8325 return empty_record (var_type
);
8326 else if (is_dynamic_field (var_type
, which
))
8327 return to_fixed_record_type
8328 (TYPE_TARGET_TYPE (var_type
->field (which
).type ()),
8329 valaddr
, address
, dval
);
8330 else if (variant_field_index (var_type
->field (which
).type ()) >= 0)
8332 to_fixed_record_type
8333 (var_type
->field (which
).type (), valaddr
, address
, dval
);
8335 return var_type
->field (which
).type ();
8338 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8339 ENCODING_TYPE, a type following the GNAT conventions for discrete
8340 type encodings, only carries redundant information. */
8343 ada_is_redundant_range_encoding (struct type
*range_type
,
8344 struct type
*encoding_type
)
8346 const char *bounds_str
;
8350 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8352 if (get_base_type (range_type
)->code ()
8353 != get_base_type (encoding_type
)->code ())
8355 /* The compiler probably used a simple base type to describe
8356 the range type instead of the range's actual base type,
8357 expecting us to get the real base type from the encoding
8358 anyway. In this situation, the encoding cannot be ignored
8363 if (is_dynamic_type (range_type
))
8366 if (encoding_type
->name () == NULL
)
8369 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8370 if (bounds_str
== NULL
)
8373 n
= 8; /* Skip "___XDLU_". */
8374 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8376 if (range_type
->bounds ()->low
.const_val () != lo
)
8379 n
+= 2; /* Skip the "__" separator between the two bounds. */
8380 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8382 if (range_type
->bounds ()->high
.const_val () != hi
)
8388 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8389 a type following the GNAT encoding for describing array type
8390 indices, only carries redundant information. */
8393 ada_is_redundant_index_type_desc (struct type
*array_type
,
8394 struct type
*desc_type
)
8396 struct type
*this_layer
= check_typedef (array_type
);
8399 for (i
= 0; i
< desc_type
->num_fields (); i
++)
8401 if (!ada_is_redundant_range_encoding (this_layer
->index_type (),
8402 desc_type
->field (i
).type ()))
8404 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8410 /* Assuming that TYPE0 is an array type describing the type of a value
8411 at ADDR, and that DVAL describes a record containing any
8412 discriminants used in TYPE0, returns a type for the value that
8413 contains no dynamic components (that is, no components whose sizes
8414 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8415 true, gives an error message if the resulting type's size is over
8418 static struct type
*
8419 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8422 struct type
*index_type_desc
;
8423 struct type
*result
;
8424 int constrained_packed_array_p
;
8425 static const char *xa_suffix
= "___XA";
8427 type0
= ada_check_typedef (type0
);
8428 if (type0
->is_fixed_instance ())
8431 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8432 if (constrained_packed_array_p
)
8434 type0
= decode_constrained_packed_array_type (type0
);
8435 if (type0
== nullptr)
8436 error (_("could not decode constrained packed array type"));
8439 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8441 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8442 encoding suffixed with 'P' may still be generated. If so,
8443 it should be used to find the XA type. */
8445 if (index_type_desc
== NULL
)
8447 const char *type_name
= ada_type_name (type0
);
8449 if (type_name
!= NULL
)
8451 const int len
= strlen (type_name
);
8452 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8454 if (type_name
[len
- 1] == 'P')
8456 strcpy (name
, type_name
);
8457 strcpy (name
+ len
- 1, xa_suffix
);
8458 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8463 ada_fixup_array_indexes_type (index_type_desc
);
8464 if (index_type_desc
!= NULL
8465 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8467 /* Ignore this ___XA parallel type, as it does not bring any
8468 useful information. This allows us to avoid creating fixed
8469 versions of the array's index types, which would be identical
8470 to the original ones. This, in turn, can also help avoid
8471 the creation of fixed versions of the array itself. */
8472 index_type_desc
= NULL
;
8475 if (index_type_desc
== NULL
)
8477 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8479 /* NOTE: elt_type---the fixed version of elt_type0---should never
8480 depend on the contents of the array in properly constructed
8482 /* Create a fixed version of the array element type.
8483 We're not providing the address of an element here,
8484 and thus the actual object value cannot be inspected to do
8485 the conversion. This should not be a problem, since arrays of
8486 unconstrained objects are not allowed. In particular, all
8487 the elements of an array of a tagged type should all be of
8488 the same type specified in the debugging info. No need to
8489 consult the object tag. */
8490 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8492 /* Make sure we always create a new array type when dealing with
8493 packed array types, since we're going to fix-up the array
8494 type length and element bitsize a little further down. */
8495 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8498 result
= create_array_type (alloc_type_copy (type0
),
8499 elt_type
, type0
->index_type ());
8504 struct type
*elt_type0
;
8507 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8508 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8510 /* NOTE: result---the fixed version of elt_type0---should never
8511 depend on the contents of the array in properly constructed
8513 /* Create a fixed version of the array element type.
8514 We're not providing the address of an element here,
8515 and thus the actual object value cannot be inspected to do
8516 the conversion. This should not be a problem, since arrays of
8517 unconstrained objects are not allowed. In particular, all
8518 the elements of an array of a tagged type should all be of
8519 the same type specified in the debugging info. No need to
8520 consult the object tag. */
8522 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8525 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8527 struct type
*range_type
=
8528 to_fixed_range_type (index_type_desc
->field (i
).type (), dval
);
8530 result
= create_array_type (alloc_type_copy (elt_type0
),
8531 result
, range_type
);
8532 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8534 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8535 error (_("array type with dynamic size is larger than varsize-limit"));
8538 /* We want to preserve the type name. This can be useful when
8539 trying to get the type name of a value that has already been
8540 printed (for instance, if the user did "print VAR; whatis $". */
8541 result
->set_name (type0
->name ());
8543 if (constrained_packed_array_p
)
8545 /* So far, the resulting type has been created as if the original
8546 type was a regular (non-packed) array type. As a result, the
8547 bitsize of the array elements needs to be set again, and the array
8548 length needs to be recomputed based on that bitsize. */
8549 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8550 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8552 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8553 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8554 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8555 TYPE_LENGTH (result
)++;
8558 result
->set_is_fixed_instance (true);
8563 /* A standard type (containing no dynamically sized components)
8564 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8565 DVAL describes a record containing any discriminants used in TYPE0,
8566 and may be NULL if there are none, or if the object of type TYPE at
8567 ADDRESS or in VALADDR contains these discriminants.
8569 If CHECK_TAG is not null, in the case of tagged types, this function
8570 attempts to locate the object's tag and use it to compute the actual
8571 type. However, when ADDRESS is null, we cannot use it to determine the
8572 location of the tag, and therefore compute the tagged type's actual type.
8573 So we return the tagged type without consulting the tag. */
8575 static struct type
*
8576 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8577 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8579 type
= ada_check_typedef (type
);
8581 /* Only un-fixed types need to be handled here. */
8582 if (!HAVE_GNAT_AUX_INFO (type
))
8585 switch (type
->code ())
8589 case TYPE_CODE_STRUCT
:
8591 struct type
*static_type
= to_static_fixed_type (type
);
8592 struct type
*fixed_record_type
=
8593 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8595 /* If STATIC_TYPE is a tagged type and we know the object's address,
8596 then we can determine its tag, and compute the object's actual
8597 type from there. Note that we have to use the fixed record
8598 type (the parent part of the record may have dynamic fields
8599 and the way the location of _tag is expressed may depend on
8602 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8605 value_tag_from_contents_and_address
8609 struct type
*real_type
= type_from_tag (tag
);
8611 value_from_contents_and_address (fixed_record_type
,
8614 fixed_record_type
= value_type (obj
);
8615 if (real_type
!= NULL
)
8616 return to_fixed_record_type
8618 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8621 /* Check to see if there is a parallel ___XVZ variable.
8622 If there is, then it provides the actual size of our type. */
8623 else if (ada_type_name (fixed_record_type
) != NULL
)
8625 const char *name
= ada_type_name (fixed_record_type
);
8627 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8628 bool xvz_found
= false;
8631 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8634 xvz_found
= get_int_var_value (xvz_name
, size
);
8636 catch (const gdb_exception_error
&except
)
8638 /* We found the variable, but somehow failed to read
8639 its value. Rethrow the same error, but with a little
8640 bit more information, to help the user understand
8641 what went wrong (Eg: the variable might have been
8643 throw_error (except
.error
,
8644 _("unable to read value of %s (%s)"),
8645 xvz_name
, except
.what ());
8648 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8650 fixed_record_type
= copy_type (fixed_record_type
);
8651 TYPE_LENGTH (fixed_record_type
) = size
;
8653 /* The FIXED_RECORD_TYPE may have be a stub. We have
8654 observed this when the debugging info is STABS, and
8655 apparently it is something that is hard to fix.
8657 In practice, we don't need the actual type definition
8658 at all, because the presence of the XVZ variable allows us
8659 to assume that there must be a XVS type as well, which we
8660 should be able to use later, when we need the actual type
8663 In the meantime, pretend that the "fixed" type we are
8664 returning is NOT a stub, because this can cause trouble
8665 when using this type to create new types targeting it.
8666 Indeed, the associated creation routines often check
8667 whether the target type is a stub and will try to replace
8668 it, thus using a type with the wrong size. This, in turn,
8669 might cause the new type to have the wrong size too.
8670 Consider the case of an array, for instance, where the size
8671 of the array is computed from the number of elements in
8672 our array multiplied by the size of its element. */
8673 fixed_record_type
->set_is_stub (false);
8676 return fixed_record_type
;
8678 case TYPE_CODE_ARRAY
:
8679 return to_fixed_array_type (type
, dval
, 1);
8680 case TYPE_CODE_UNION
:
8684 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8688 /* The same as ada_to_fixed_type_1, except that it preserves the type
8689 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8691 The typedef layer needs be preserved in order to differentiate between
8692 arrays and array pointers when both types are implemented using the same
8693 fat pointer. In the array pointer case, the pointer is encoded as
8694 a typedef of the pointer type. For instance, considering:
8696 type String_Access is access String;
8697 S1 : String_Access := null;
8699 To the debugger, S1 is defined as a typedef of type String. But
8700 to the user, it is a pointer. So if the user tries to print S1,
8701 we should not dereference the array, but print the array address
8704 If we didn't preserve the typedef layer, we would lose the fact that
8705 the type is to be presented as a pointer (needs de-reference before
8706 being printed). And we would also use the source-level type name. */
8709 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8710 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8713 struct type
*fixed_type
=
8714 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8716 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8717 then preserve the typedef layer.
8719 Implementation note: We can only check the main-type portion of
8720 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8721 from TYPE now returns a type that has the same instance flags
8722 as TYPE. For instance, if TYPE is a "typedef const", and its
8723 target type is a "struct", then the typedef elimination will return
8724 a "const" version of the target type. See check_typedef for more
8725 details about how the typedef layer elimination is done.
8727 brobecker/2010-11-19: It seems to me that the only case where it is
8728 useful to preserve the typedef layer is when dealing with fat pointers.
8729 Perhaps, we could add a check for that and preserve the typedef layer
8730 only in that situation. But this seems unnecessary so far, probably
8731 because we call check_typedef/ada_check_typedef pretty much everywhere.
8733 if (type
->code () == TYPE_CODE_TYPEDEF
8734 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8735 == TYPE_MAIN_TYPE (fixed_type
)))
8741 /* A standard (static-sized) type corresponding as well as possible to
8742 TYPE0, but based on no runtime data. */
8744 static struct type
*
8745 to_static_fixed_type (struct type
*type0
)
8752 if (type0
->is_fixed_instance ())
8755 type0
= ada_check_typedef (type0
);
8757 switch (type0
->code ())
8761 case TYPE_CODE_STRUCT
:
8762 type
= dynamic_template_type (type0
);
8764 return template_to_static_fixed_type (type
);
8766 return template_to_static_fixed_type (type0
);
8767 case TYPE_CODE_UNION
:
8768 type
= ada_find_parallel_type (type0
, "___XVU");
8770 return template_to_static_fixed_type (type
);
8772 return template_to_static_fixed_type (type0
);
8776 /* A static approximation of TYPE with all type wrappers removed. */
8778 static struct type
*
8779 static_unwrap_type (struct type
*type
)
8781 if (ada_is_aligner_type (type
))
8783 struct type
*type1
= ada_check_typedef (type
)->field (0).type ();
8784 if (ada_type_name (type1
) == NULL
)
8785 type1
->set_name (ada_type_name (type
));
8787 return static_unwrap_type (type1
);
8791 struct type
*raw_real_type
= ada_get_base_type (type
);
8793 if (raw_real_type
== type
)
8796 return to_static_fixed_type (raw_real_type
);
8800 /* In some cases, incomplete and private types require
8801 cross-references that are not resolved as records (for example,
8803 type FooP is access Foo;
8805 type Foo is array ...;
8806 ). In these cases, since there is no mechanism for producing
8807 cross-references to such types, we instead substitute for FooP a
8808 stub enumeration type that is nowhere resolved, and whose tag is
8809 the name of the actual type. Call these types "non-record stubs". */
8811 /* A type equivalent to TYPE that is not a non-record stub, if one
8812 exists, otherwise TYPE. */
8815 ada_check_typedef (struct type
*type
)
8820 /* If our type is an access to an unconstrained array, which is encoded
8821 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
8822 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8823 what allows us to distinguish between fat pointers that represent
8824 array types, and fat pointers that represent array access types
8825 (in both cases, the compiler implements them as fat pointers). */
8826 if (ada_is_access_to_unconstrained_array (type
))
8829 type
= check_typedef (type
);
8830 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
8831 || !type
->is_stub ()
8832 || type
->name () == NULL
)
8836 const char *name
= type
->name ();
8837 struct type
*type1
= ada_find_any_type (name
);
8842 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8843 stubs pointing to arrays, as we don't create symbols for array
8844 types, only for the typedef-to-array types). If that's the case,
8845 strip the typedef layer. */
8846 if (type1
->code () == TYPE_CODE_TYPEDEF
)
8847 type1
= ada_check_typedef (type1
);
8853 /* A value representing the data at VALADDR/ADDRESS as described by
8854 type TYPE0, but with a standard (static-sized) type that correctly
8855 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8856 type, then return VAL0 [this feature is simply to avoid redundant
8857 creation of struct values]. */
8859 static struct value
*
8860 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8863 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8865 if (type
== type0
&& val0
!= NULL
)
8868 if (VALUE_LVAL (val0
) != lval_memory
)
8870 /* Our value does not live in memory; it could be a convenience
8871 variable, for instance. Create a not_lval value using val0's
8873 return value_from_contents (type
, value_contents (val0
));
8876 return value_from_contents_and_address (type
, 0, address
);
8879 /* A value representing VAL, but with a standard (static-sized) type
8880 that correctly describes it. Does not necessarily create a new
8884 ada_to_fixed_value (struct value
*val
)
8886 val
= unwrap_value (val
);
8887 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
8894 /* Table mapping attribute numbers to names.
8895 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8897 static const char * const attribute_names
[] = {
8915 ada_attribute_name (enum exp_opcode n
)
8917 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8918 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8920 return attribute_names
[0];
8923 /* Evaluate the 'POS attribute applied to ARG. */
8926 pos_atr (struct value
*arg
)
8928 struct value
*val
= coerce_ref (arg
);
8929 struct type
*type
= value_type (val
);
8932 if (!discrete_type_p (type
))
8933 error (_("'POS only defined on discrete types"));
8935 if (!discrete_position (type
, value_as_long (val
), &result
))
8936 error (_("enumeration value is invalid: can't find 'POS"));
8941 static struct value
*
8942 value_pos_atr (struct type
*type
, struct value
*arg
)
8944 return value_from_longest (type
, pos_atr (arg
));
8947 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8949 static struct value
*
8950 val_atr (struct type
*type
, LONGEST val
)
8952 gdb_assert (discrete_type_p (type
));
8953 if (type
->code () == TYPE_CODE_RANGE
)
8954 type
= TYPE_TARGET_TYPE (type
);
8955 if (type
->code () == TYPE_CODE_ENUM
)
8957 if (val
< 0 || val
>= type
->num_fields ())
8958 error (_("argument to 'VAL out of range"));
8959 val
= TYPE_FIELD_ENUMVAL (type
, val
);
8961 return value_from_longest (type
, val
);
8964 static struct value
*
8965 value_val_atr (struct type
*type
, struct value
*arg
)
8967 if (!discrete_type_p (type
))
8968 error (_("'VAL only defined on discrete types"));
8969 if (!integer_type_p (value_type (arg
)))
8970 error (_("'VAL requires integral argument"));
8972 return val_atr (type
, value_as_long (arg
));
8978 /* True if TYPE appears to be an Ada character type.
8979 [At the moment, this is true only for Character and Wide_Character;
8980 It is a heuristic test that could stand improvement]. */
8983 ada_is_character_type (struct type
*type
)
8987 /* If the type code says it's a character, then assume it really is,
8988 and don't check any further. */
8989 if (type
->code () == TYPE_CODE_CHAR
)
8992 /* Otherwise, assume it's a character type iff it is a discrete type
8993 with a known character type name. */
8994 name
= ada_type_name (type
);
8995 return (name
!= NULL
8996 && (type
->code () == TYPE_CODE_INT
8997 || type
->code () == TYPE_CODE_RANGE
)
8998 && (strcmp (name
, "character") == 0
8999 || strcmp (name
, "wide_character") == 0
9000 || strcmp (name
, "wide_wide_character") == 0
9001 || strcmp (name
, "unsigned char") == 0));
9004 /* True if TYPE appears to be an Ada string type. */
9007 ada_is_string_type (struct type
*type
)
9009 type
= ada_check_typedef (type
);
9011 && type
->code () != TYPE_CODE_PTR
9012 && (ada_is_simple_array_type (type
)
9013 || ada_is_array_descriptor_type (type
))
9014 && ada_array_arity (type
) == 1)
9016 struct type
*elttype
= ada_array_element_type (type
, 1);
9018 return ada_is_character_type (elttype
);
9024 /* The compiler sometimes provides a parallel XVS type for a given
9025 PAD type. Normally, it is safe to follow the PAD type directly,
9026 but older versions of the compiler have a bug that causes the offset
9027 of its "F" field to be wrong. Following that field in that case
9028 would lead to incorrect results, but this can be worked around
9029 by ignoring the PAD type and using the associated XVS type instead.
9031 Set to True if the debugger should trust the contents of PAD types.
9032 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9033 static bool trust_pad_over_xvs
= true;
9035 /* True if TYPE is a struct type introduced by the compiler to force the
9036 alignment of a value. Such types have a single field with a
9037 distinctive name. */
9040 ada_is_aligner_type (struct type
*type
)
9042 type
= ada_check_typedef (type
);
9044 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9047 return (type
->code () == TYPE_CODE_STRUCT
9048 && type
->num_fields () == 1
9049 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9052 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9053 the parallel type. */
9056 ada_get_base_type (struct type
*raw_type
)
9058 struct type
*real_type_namer
;
9059 struct type
*raw_real_type
;
9061 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
9064 if (ada_is_aligner_type (raw_type
))
9065 /* The encoding specifies that we should always use the aligner type.
9066 So, even if this aligner type has an associated XVS type, we should
9069 According to the compiler gurus, an XVS type parallel to an aligner
9070 type may exist because of a stabs limitation. In stabs, aligner
9071 types are empty because the field has a variable-sized type, and
9072 thus cannot actually be used as an aligner type. As a result,
9073 we need the associated parallel XVS type to decode the type.
9074 Since the policy in the compiler is to not change the internal
9075 representation based on the debugging info format, we sometimes
9076 end up having a redundant XVS type parallel to the aligner type. */
9079 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9080 if (real_type_namer
== NULL
9081 || real_type_namer
->code () != TYPE_CODE_STRUCT
9082 || real_type_namer
->num_fields () != 1)
9085 if (real_type_namer
->field (0).type ()->code () != TYPE_CODE_REF
)
9087 /* This is an older encoding form where the base type needs to be
9088 looked up by name. We prefer the newer encoding because it is
9090 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9091 if (raw_real_type
== NULL
)
9094 return raw_real_type
;
9097 /* The field in our XVS type is a reference to the base type. */
9098 return TYPE_TARGET_TYPE (real_type_namer
->field (0).type ());
9101 /* The type of value designated by TYPE, with all aligners removed. */
9104 ada_aligned_type (struct type
*type
)
9106 if (ada_is_aligner_type (type
))
9107 return ada_aligned_type (type
->field (0).type ());
9109 return ada_get_base_type (type
);
9113 /* The address of the aligned value in an object at address VALADDR
9114 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9117 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9119 if (ada_is_aligner_type (type
))
9120 return ada_aligned_value_addr (type
->field (0).type (),
9122 TYPE_FIELD_BITPOS (type
,
9123 0) / TARGET_CHAR_BIT
);
9130 /* The printed representation of an enumeration literal with encoded
9131 name NAME. The value is good to the next call of ada_enum_name. */
9133 ada_enum_name (const char *name
)
9135 static char *result
;
9136 static size_t result_len
= 0;
9139 /* First, unqualify the enumeration name:
9140 1. Search for the last '.' character. If we find one, then skip
9141 all the preceding characters, the unqualified name starts
9142 right after that dot.
9143 2. Otherwise, we may be debugging on a target where the compiler
9144 translates dots into "__". Search forward for double underscores,
9145 but stop searching when we hit an overloading suffix, which is
9146 of the form "__" followed by digits. */
9148 tmp
= strrchr (name
, '.');
9153 while ((tmp
= strstr (name
, "__")) != NULL
)
9155 if (isdigit (tmp
[2]))
9166 if (name
[1] == 'U' || name
[1] == 'W')
9168 if (sscanf (name
+ 2, "%x", &v
) != 1)
9171 else if (((name
[1] >= '0' && name
[1] <= '9')
9172 || (name
[1] >= 'a' && name
[1] <= 'z'))
9175 GROW_VECT (result
, result_len
, 4);
9176 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9182 GROW_VECT (result
, result_len
, 16);
9183 if (isascii (v
) && isprint (v
))
9184 xsnprintf (result
, result_len
, "'%c'", v
);
9185 else if (name
[1] == 'U')
9186 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9188 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9194 tmp
= strstr (name
, "__");
9196 tmp
= strstr (name
, "$");
9199 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9200 strncpy (result
, name
, tmp
- name
);
9201 result
[tmp
- name
] = '\0';
9209 /* Evaluate the subexpression of EXP starting at *POS as for
9210 evaluate_type, updating *POS to point just past the evaluated
9213 static struct value
*
9214 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9216 return evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9219 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9222 static struct value
*
9223 unwrap_value (struct value
*val
)
9225 struct type
*type
= ada_check_typedef (value_type (val
));
9227 if (ada_is_aligner_type (type
))
9229 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9230 struct type
*val_type
= ada_check_typedef (value_type (v
));
9232 if (ada_type_name (val_type
) == NULL
)
9233 val_type
->set_name (ada_type_name (type
));
9235 return unwrap_value (v
);
9239 struct type
*raw_real_type
=
9240 ada_check_typedef (ada_get_base_type (type
));
9242 /* If there is no parallel XVS or XVE type, then the value is
9243 already unwrapped. Return it without further modification. */
9244 if ((type
== raw_real_type
)
9245 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9249 coerce_unspec_val_to_type
9250 (val
, ada_to_fixed_type (raw_real_type
, 0,
9251 value_address (val
),
9256 static struct value
*
9257 cast_from_gnat_encoded_fixed_point_type (struct type
*type
, struct value
*arg
)
9260 = gnat_encoded_fixed_point_scaling_factor (value_type (arg
));
9261 arg
= value_cast (value_type (scale
), arg
);
9263 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9264 return value_cast (type
, arg
);
9267 static struct value
*
9268 cast_to_gnat_encoded_fixed_point_type (struct type
*type
, struct value
*arg
)
9270 if (type
== value_type (arg
))
9273 struct value
*scale
= gnat_encoded_fixed_point_scaling_factor (type
);
9274 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg
)))
9275 arg
= cast_from_gnat_encoded_fixed_point_type (value_type (scale
), arg
);
9277 arg
= value_cast (value_type (scale
), arg
);
9279 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9280 return value_cast (type
, arg
);
9283 /* Given two array types T1 and T2, return nonzero iff both arrays
9284 contain the same number of elements. */
9287 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9289 LONGEST lo1
, hi1
, lo2
, hi2
;
9291 /* Get the array bounds in order to verify that the size of
9292 the two arrays match. */
9293 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9294 || !get_array_bounds (t2
, &lo2
, &hi2
))
9295 error (_("unable to determine array bounds"));
9297 /* To make things easier for size comparison, normalize a bit
9298 the case of empty arrays by making sure that the difference
9299 between upper bound and lower bound is always -1. */
9305 return (hi1
- lo1
== hi2
- lo2
);
9308 /* Assuming that VAL is an array of integrals, and TYPE represents
9309 an array with the same number of elements, but with wider integral
9310 elements, return an array "casted" to TYPE. In practice, this
9311 means that the returned array is built by casting each element
9312 of the original array into TYPE's (wider) element type. */
9314 static struct value
*
9315 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9317 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9322 /* Verify that both val and type are arrays of scalars, and
9323 that the size of val's elements is smaller than the size
9324 of type's element. */
9325 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9326 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9327 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9328 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9329 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9330 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9332 if (!get_array_bounds (type
, &lo
, &hi
))
9333 error (_("unable to determine array bounds"));
9335 res
= allocate_value (type
);
9337 /* Promote each array element. */
9338 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9340 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9342 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9343 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9349 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9350 return the converted value. */
9352 static struct value
*
9353 coerce_for_assign (struct type
*type
, struct value
*val
)
9355 struct type
*type2
= value_type (val
);
9360 type2
= ada_check_typedef (type2
);
9361 type
= ada_check_typedef (type
);
9363 if (type2
->code () == TYPE_CODE_PTR
9364 && type
->code () == TYPE_CODE_ARRAY
)
9366 val
= ada_value_ind (val
);
9367 type2
= value_type (val
);
9370 if (type2
->code () == TYPE_CODE_ARRAY
9371 && type
->code () == TYPE_CODE_ARRAY
)
9373 if (!ada_same_array_size_p (type
, type2
))
9374 error (_("cannot assign arrays of different length"));
9376 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9377 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9378 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9379 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9381 /* Allow implicit promotion of the array elements to
9383 return ada_promote_array_of_integrals (type
, val
);
9386 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9387 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9388 error (_("Incompatible types in assignment"));
9389 deprecated_set_value_type (val
, type
);
9394 static struct value
*
9395 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9398 struct type
*type1
, *type2
;
9401 arg1
= coerce_ref (arg1
);
9402 arg2
= coerce_ref (arg2
);
9403 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9404 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9406 if (type1
->code () != TYPE_CODE_INT
9407 || type2
->code () != TYPE_CODE_INT
)
9408 return value_binop (arg1
, arg2
, op
);
9417 return value_binop (arg1
, arg2
, op
);
9420 v2
= value_as_long (arg2
);
9422 error (_("second operand of %s must not be zero."), op_string (op
));
9424 if (type1
->is_unsigned () || op
== BINOP_MOD
)
9425 return value_binop (arg1
, arg2
, op
);
9427 v1
= value_as_long (arg1
);
9432 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9433 v
+= v
> 0 ? -1 : 1;
9441 /* Should not reach this point. */
9445 val
= allocate_value (type1
);
9446 store_unsigned_integer (value_contents_raw (val
),
9447 TYPE_LENGTH (value_type (val
)),
9448 type_byte_order (type1
), v
);
9453 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9455 if (ada_is_direct_array_type (value_type (arg1
))
9456 || ada_is_direct_array_type (value_type (arg2
)))
9458 struct type
*arg1_type
, *arg2_type
;
9460 /* Automatically dereference any array reference before
9461 we attempt to perform the comparison. */
9462 arg1
= ada_coerce_ref (arg1
);
9463 arg2
= ada_coerce_ref (arg2
);
9465 arg1
= ada_coerce_to_simple_array (arg1
);
9466 arg2
= ada_coerce_to_simple_array (arg2
);
9468 arg1_type
= ada_check_typedef (value_type (arg1
));
9469 arg2_type
= ada_check_typedef (value_type (arg2
));
9471 if (arg1_type
->code () != TYPE_CODE_ARRAY
9472 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9473 error (_("Attempt to compare array with non-array"));
9474 /* FIXME: The following works only for types whose
9475 representations use all bits (no padding or undefined bits)
9476 and do not have user-defined equality. */
9477 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9478 && memcmp (value_contents (arg1
), value_contents (arg2
),
9479 TYPE_LENGTH (arg1_type
)) == 0);
9481 return value_equal (arg1
, arg2
);
9484 /* Total number of component associations in the aggregate starting at
9485 index PC in EXP. Assumes that index PC is the start of an
9489 num_component_specs (struct expression
*exp
, int pc
)
9493 m
= exp
->elts
[pc
+ 1].longconst
;
9496 for (i
= 0; i
< m
; i
+= 1)
9498 switch (exp
->elts
[pc
].opcode
)
9504 n
+= exp
->elts
[pc
+ 1].longconst
;
9507 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9512 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9513 component of LHS (a simple array or a record), updating *POS past
9514 the expression, assuming that LHS is contained in CONTAINER. Does
9515 not modify the inferior's memory, nor does it modify LHS (unless
9516 LHS == CONTAINER). */
9519 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9520 struct expression
*exp
, int *pos
)
9522 struct value
*mark
= value_mark ();
9524 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9526 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9528 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9529 struct value
*index_val
= value_from_longest (index_type
, index
);
9531 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9535 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9536 elt
= ada_to_fixed_value (elt
);
9539 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9540 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9542 value_assign_to_component (container
, elt
,
9543 ada_evaluate_subexp (NULL
, exp
, pos
,
9546 value_free_to_mark (mark
);
9549 /* Assuming that LHS represents an lvalue having a record or array
9550 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9551 of that aggregate's value to LHS, advancing *POS past the
9552 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9553 lvalue containing LHS (possibly LHS itself). Does not modify
9554 the inferior's memory, nor does it modify the contents of
9555 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9557 static struct value
*
9558 assign_aggregate (struct value
*container
,
9559 struct value
*lhs
, struct expression
*exp
,
9560 int *pos
, enum noside noside
)
9562 struct type
*lhs_type
;
9563 int n
= exp
->elts
[*pos
+1].longconst
;
9564 LONGEST low_index
, high_index
;
9567 int max_indices
, num_indices
;
9571 if (noside
!= EVAL_NORMAL
)
9573 for (i
= 0; i
< n
; i
+= 1)
9574 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9578 container
= ada_coerce_ref (container
);
9579 if (ada_is_direct_array_type (value_type (container
)))
9580 container
= ada_coerce_to_simple_array (container
);
9581 lhs
= ada_coerce_ref (lhs
);
9582 if (!deprecated_value_modifiable (lhs
))
9583 error (_("Left operand of assignment is not a modifiable lvalue."));
9585 lhs_type
= check_typedef (value_type (lhs
));
9586 if (ada_is_direct_array_type (lhs_type
))
9588 lhs
= ada_coerce_to_simple_array (lhs
);
9589 lhs_type
= check_typedef (value_type (lhs
));
9590 low_index
= lhs_type
->bounds ()->low
.const_val ();
9591 high_index
= lhs_type
->bounds ()->high
.const_val ();
9593 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9596 high_index
= num_visible_fields (lhs_type
) - 1;
9599 error (_("Left-hand side must be array or record."));
9601 num_specs
= num_component_specs (exp
, *pos
- 3);
9602 max_indices
= 4 * num_specs
+ 4;
9603 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9604 indices
[0] = indices
[1] = low_index
- 1;
9605 indices
[2] = indices
[3] = high_index
+ 1;
9608 for (i
= 0; i
< n
; i
+= 1)
9610 switch (exp
->elts
[*pos
].opcode
)
9613 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9614 &num_indices
, max_indices
,
9615 low_index
, high_index
);
9618 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9619 &num_indices
, max_indices
,
9620 low_index
, high_index
);
9624 error (_("Misplaced 'others' clause"));
9625 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9626 num_indices
, low_index
, high_index
);
9629 error (_("Internal error: bad aggregate clause"));
9636 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9637 construct at *POS, updating *POS past the construct, given that
9638 the positions are relative to lower bound LOW, where HIGH is the
9639 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9640 updating *NUM_INDICES as needed. CONTAINER is as for
9641 assign_aggregate. */
9643 aggregate_assign_positional (struct value
*container
,
9644 struct value
*lhs
, struct expression
*exp
,
9645 int *pos
, LONGEST
*indices
, int *num_indices
,
9646 int max_indices
, LONGEST low
, LONGEST high
)
9648 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9650 if (ind
- 1 == high
)
9651 warning (_("Extra components in aggregate ignored."));
9654 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9656 assign_component (container
, lhs
, ind
, exp
, pos
);
9659 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9662 /* Assign into the components of LHS indexed by the OP_CHOICES
9663 construct at *POS, updating *POS past the construct, given that
9664 the allowable indices are LOW..HIGH. Record the indices assigned
9665 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9666 needed. CONTAINER is as for assign_aggregate. */
9668 aggregate_assign_from_choices (struct value
*container
,
9669 struct value
*lhs
, struct expression
*exp
,
9670 int *pos
, LONGEST
*indices
, int *num_indices
,
9671 int max_indices
, LONGEST low
, LONGEST high
)
9674 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9675 int choice_pos
, expr_pc
;
9676 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9678 choice_pos
= *pos
+= 3;
9680 for (j
= 0; j
< n_choices
; j
+= 1)
9681 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9683 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9685 for (j
= 0; j
< n_choices
; j
+= 1)
9687 LONGEST lower
, upper
;
9688 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9690 if (op
== OP_DISCRETE_RANGE
)
9693 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9695 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9700 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9712 name
= &exp
->elts
[choice_pos
+ 2].string
;
9715 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9718 error (_("Invalid record component association."));
9720 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9722 if (! find_struct_field (name
, value_type (lhs
), 0,
9723 NULL
, NULL
, NULL
, NULL
, &ind
))
9724 error (_("Unknown component name: %s."), name
);
9725 lower
= upper
= ind
;
9728 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9729 error (_("Index in component association out of bounds."));
9731 add_component_interval (lower
, upper
, indices
, num_indices
,
9733 while (lower
<= upper
)
9738 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9744 /* Assign the value of the expression in the OP_OTHERS construct in
9745 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9746 have not been previously assigned. The index intervals already assigned
9747 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9748 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9750 aggregate_assign_others (struct value
*container
,
9751 struct value
*lhs
, struct expression
*exp
,
9752 int *pos
, LONGEST
*indices
, int num_indices
,
9753 LONGEST low
, LONGEST high
)
9756 int expr_pc
= *pos
+ 1;
9758 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9762 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9767 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9770 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9773 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9774 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9775 modifying *SIZE as needed. It is an error if *SIZE exceeds
9776 MAX_SIZE. The resulting intervals do not overlap. */
9778 add_component_interval (LONGEST low
, LONGEST high
,
9779 LONGEST
* indices
, int *size
, int max_size
)
9783 for (i
= 0; i
< *size
; i
+= 2) {
9784 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9788 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9789 if (high
< indices
[kh
])
9791 if (low
< indices
[i
])
9793 indices
[i
+ 1] = indices
[kh
- 1];
9794 if (high
> indices
[i
+ 1])
9795 indices
[i
+ 1] = high
;
9796 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9797 *size
-= kh
- i
- 2;
9800 else if (high
< indices
[i
])
9804 if (*size
== max_size
)
9805 error (_("Internal error: miscounted aggregate components."));
9807 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9808 indices
[j
] = indices
[j
- 2];
9810 indices
[i
+ 1] = high
;
9813 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9816 static struct value
*
9817 ada_value_cast (struct type
*type
, struct value
*arg2
)
9819 if (type
== ada_check_typedef (value_type (arg2
)))
9822 if (ada_is_gnat_encoded_fixed_point_type (type
))
9823 return cast_to_gnat_encoded_fixed_point_type (type
, arg2
);
9825 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
9826 return cast_from_gnat_encoded_fixed_point_type (type
, arg2
);
9828 return value_cast (type
, arg2
);
9831 /* Evaluating Ada expressions, and printing their result.
9832 ------------------------------------------------------
9837 We usually evaluate an Ada expression in order to print its value.
9838 We also evaluate an expression in order to print its type, which
9839 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9840 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9841 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9842 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9845 Evaluating expressions is a little more complicated for Ada entities
9846 than it is for entities in languages such as C. The main reason for
9847 this is that Ada provides types whose definition might be dynamic.
9848 One example of such types is variant records. Or another example
9849 would be an array whose bounds can only be known at run time.
9851 The following description is a general guide as to what should be
9852 done (and what should NOT be done) in order to evaluate an expression
9853 involving such types, and when. This does not cover how the semantic
9854 information is encoded by GNAT as this is covered separatly. For the
9855 document used as the reference for the GNAT encoding, see exp_dbug.ads
9856 in the GNAT sources.
9858 Ideally, we should embed each part of this description next to its
9859 associated code. Unfortunately, the amount of code is so vast right
9860 now that it's hard to see whether the code handling a particular
9861 situation might be duplicated or not. One day, when the code is
9862 cleaned up, this guide might become redundant with the comments
9863 inserted in the code, and we might want to remove it.
9865 2. ``Fixing'' an Entity, the Simple Case:
9866 -----------------------------------------
9868 When evaluating Ada expressions, the tricky issue is that they may
9869 reference entities whose type contents and size are not statically
9870 known. Consider for instance a variant record:
9872 type Rec (Empty : Boolean := True) is record
9875 when False => Value : Integer;
9878 Yes : Rec := (Empty => False, Value => 1);
9879 No : Rec := (empty => True);
9881 The size and contents of that record depends on the value of the
9882 descriminant (Rec.Empty). At this point, neither the debugging
9883 information nor the associated type structure in GDB are able to
9884 express such dynamic types. So what the debugger does is to create
9885 "fixed" versions of the type that applies to the specific object.
9886 We also informally refer to this operation as "fixing" an object,
9887 which means creating its associated fixed type.
9889 Example: when printing the value of variable "Yes" above, its fixed
9890 type would look like this:
9897 On the other hand, if we printed the value of "No", its fixed type
9904 Things become a little more complicated when trying to fix an entity
9905 with a dynamic type that directly contains another dynamic type,
9906 such as an array of variant records, for instance. There are
9907 two possible cases: Arrays, and records.
9909 3. ``Fixing'' Arrays:
9910 ---------------------
9912 The type structure in GDB describes an array in terms of its bounds,
9913 and the type of its elements. By design, all elements in the array
9914 have the same type and we cannot represent an array of variant elements
9915 using the current type structure in GDB. When fixing an array,
9916 we cannot fix the array element, as we would potentially need one
9917 fixed type per element of the array. As a result, the best we can do
9918 when fixing an array is to produce an array whose bounds and size
9919 are correct (allowing us to read it from memory), but without having
9920 touched its element type. Fixing each element will be done later,
9921 when (if) necessary.
9923 Arrays are a little simpler to handle than records, because the same
9924 amount of memory is allocated for each element of the array, even if
9925 the amount of space actually used by each element differs from element
9926 to element. Consider for instance the following array of type Rec:
9928 type Rec_Array is array (1 .. 2) of Rec;
9930 The actual amount of memory occupied by each element might be different
9931 from element to element, depending on the value of their discriminant.
9932 But the amount of space reserved for each element in the array remains
9933 fixed regardless. So we simply need to compute that size using
9934 the debugging information available, from which we can then determine
9935 the array size (we multiply the number of elements of the array by
9936 the size of each element).
9938 The simplest case is when we have an array of a constrained element
9939 type. For instance, consider the following type declarations:
9941 type Bounded_String (Max_Size : Integer) is
9943 Buffer : String (1 .. Max_Size);
9945 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9947 In this case, the compiler describes the array as an array of
9948 variable-size elements (identified by its XVS suffix) for which
9949 the size can be read in the parallel XVZ variable.
9951 In the case of an array of an unconstrained element type, the compiler
9952 wraps the array element inside a private PAD type. This type should not
9953 be shown to the user, and must be "unwrap"'ed before printing. Note
9954 that we also use the adjective "aligner" in our code to designate
9955 these wrapper types.
9957 In some cases, the size allocated for each element is statically
9958 known. In that case, the PAD type already has the correct size,
9959 and the array element should remain unfixed.
9961 But there are cases when this size is not statically known.
9962 For instance, assuming that "Five" is an integer variable:
9964 type Dynamic is array (1 .. Five) of Integer;
9965 type Wrapper (Has_Length : Boolean := False) is record
9968 when True => Length : Integer;
9972 type Wrapper_Array is array (1 .. 2) of Wrapper;
9974 Hello : Wrapper_Array := (others => (Has_Length => True,
9975 Data => (others => 17),
9979 The debugging info would describe variable Hello as being an
9980 array of a PAD type. The size of that PAD type is not statically
9981 known, but can be determined using a parallel XVZ variable.
9982 In that case, a copy of the PAD type with the correct size should
9983 be used for the fixed array.
9985 3. ``Fixing'' record type objects:
9986 ----------------------------------
9988 Things are slightly different from arrays in the case of dynamic
9989 record types. In this case, in order to compute the associated
9990 fixed type, we need to determine the size and offset of each of
9991 its components. This, in turn, requires us to compute the fixed
9992 type of each of these components.
9994 Consider for instance the example:
9996 type Bounded_String (Max_Size : Natural) is record
9997 Str : String (1 .. Max_Size);
10000 My_String : Bounded_String (Max_Size => 10);
10002 In that case, the position of field "Length" depends on the size
10003 of field Str, which itself depends on the value of the Max_Size
10004 discriminant. In order to fix the type of variable My_String,
10005 we need to fix the type of field Str. Therefore, fixing a variant
10006 record requires us to fix each of its components.
10008 However, if a component does not have a dynamic size, the component
10009 should not be fixed. In particular, fields that use a PAD type
10010 should not fixed. Here is an example where this might happen
10011 (assuming type Rec above):
10013 type Container (Big : Boolean) is record
10017 when True => Another : Integer;
10018 when False => null;
10021 My_Container : Container := (Big => False,
10022 First => (Empty => True),
10025 In that example, the compiler creates a PAD type for component First,
10026 whose size is constant, and then positions the component After just
10027 right after it. The offset of component After is therefore constant
10030 The debugger computes the position of each field based on an algorithm
10031 that uses, among other things, the actual position and size of the field
10032 preceding it. Let's now imagine that the user is trying to print
10033 the value of My_Container. If the type fixing was recursive, we would
10034 end up computing the offset of field After based on the size of the
10035 fixed version of field First. And since in our example First has
10036 only one actual field, the size of the fixed type is actually smaller
10037 than the amount of space allocated to that field, and thus we would
10038 compute the wrong offset of field After.
10040 To make things more complicated, we need to watch out for dynamic
10041 components of variant records (identified by the ___XVL suffix in
10042 the component name). Even if the target type is a PAD type, the size
10043 of that type might not be statically known. So the PAD type needs
10044 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10045 we might end up with the wrong size for our component. This can be
10046 observed with the following type declarations:
10048 type Octal is new Integer range 0 .. 7;
10049 type Octal_Array is array (Positive range <>) of Octal;
10050 pragma Pack (Octal_Array);
10052 type Octal_Buffer (Size : Positive) is record
10053 Buffer : Octal_Array (1 .. Size);
10057 In that case, Buffer is a PAD type whose size is unset and needs
10058 to be computed by fixing the unwrapped type.
10060 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10061 ----------------------------------------------------------
10063 Lastly, when should the sub-elements of an entity that remained unfixed
10064 thus far, be actually fixed?
10066 The answer is: Only when referencing that element. For instance
10067 when selecting one component of a record, this specific component
10068 should be fixed at that point in time. Or when printing the value
10069 of a record, each component should be fixed before its value gets
10070 printed. Similarly for arrays, the element of the array should be
10071 fixed when printing each element of the array, or when extracting
10072 one element out of that array. On the other hand, fixing should
10073 not be performed on the elements when taking a slice of an array!
10075 Note that one of the side effects of miscomputing the offset and
10076 size of each field is that we end up also miscomputing the size
10077 of the containing type. This can have adverse results when computing
10078 the value of an entity. GDB fetches the value of an entity based
10079 on the size of its type, and thus a wrong size causes GDB to fetch
10080 the wrong amount of memory. In the case where the computed size is
10081 too small, GDB fetches too little data to print the value of our
10082 entity. Results in this case are unpredictable, as we usually read
10083 past the buffer containing the data =:-o. */
10085 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10086 for that subexpression cast to TO_TYPE. Advance *POS over the
10090 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10091 enum noside noside
, struct type
*to_type
)
10095 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10096 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10101 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10103 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10104 return value_zero (to_type
, not_lval
);
10106 val
= evaluate_var_msym_value (noside
,
10107 exp
->elts
[pc
+ 1].objfile
,
10108 exp
->elts
[pc
+ 2].msymbol
);
10111 val
= evaluate_var_value (noside
,
10112 exp
->elts
[pc
+ 1].block
,
10113 exp
->elts
[pc
+ 2].symbol
);
10115 if (noside
== EVAL_SKIP
)
10116 return eval_skip_value (exp
);
10118 val
= ada_value_cast (to_type
, val
);
10120 /* Follow the Ada language semantics that do not allow taking
10121 an address of the result of a cast (view conversion in Ada). */
10122 if (VALUE_LVAL (val
) == lval_memory
)
10124 if (value_lazy (val
))
10125 value_fetch_lazy (val
);
10126 VALUE_LVAL (val
) = not_lval
;
10131 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10132 if (noside
== EVAL_SKIP
)
10133 return eval_skip_value (exp
);
10134 return ada_value_cast (to_type
, val
);
10137 /* Implement the evaluate_exp routine in the exp_descriptor structure
10138 for the Ada language. */
10140 static struct value
*
10141 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10142 int *pos
, enum noside noside
)
10144 enum exp_opcode op
;
10148 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10151 struct value
**argvec
;
10155 op
= exp
->elts
[pc
].opcode
;
10161 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10163 if (noside
== EVAL_NORMAL
)
10164 arg1
= unwrap_value (arg1
);
10166 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10167 then we need to perform the conversion manually, because
10168 evaluate_subexp_standard doesn't do it. This conversion is
10169 necessary in Ada because the different kinds of float/fixed
10170 types in Ada have different representations.
10172 Similarly, we need to perform the conversion from OP_LONG
10174 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10175 arg1
= ada_value_cast (expect_type
, arg1
);
10181 struct value
*result
;
10184 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10185 /* The result type will have code OP_STRING, bashed there from
10186 OP_ARRAY. Bash it back. */
10187 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10188 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10194 type
= exp
->elts
[pc
+ 1].type
;
10195 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10199 type
= exp
->elts
[pc
+ 1].type
;
10200 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10203 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10204 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10206 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10207 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10209 return ada_value_assign (arg1
, arg1
);
10211 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10212 except if the lhs of our assignment is a convenience variable.
10213 In the case of assigning to a convenience variable, the lhs
10214 should be exactly the result of the evaluation of the rhs. */
10215 type
= value_type (arg1
);
10216 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10218 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10219 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10221 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10225 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10226 arg2
= cast_to_gnat_encoded_fixed_point_type (value_type (arg1
), arg2
);
10227 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10229 (_("Fixed-point values must be assigned to fixed-point variables"));
10231 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10232 return ada_value_assign (arg1
, arg2
);
10235 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10236 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10237 if (noside
== EVAL_SKIP
)
10239 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10240 return (value_from_longest
10241 (value_type (arg1
),
10242 value_as_long (arg1
) + value_as_long (arg2
)));
10243 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10244 return (value_from_longest
10245 (value_type (arg2
),
10246 value_as_long (arg1
) + value_as_long (arg2
)));
10247 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10248 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10249 && value_type (arg1
) != value_type (arg2
))
10250 error (_("Operands of fixed-point addition must have the same type"));
10251 /* Do the addition, and cast the result to the type of the first
10252 argument. We cannot cast the result to a reference type, so if
10253 ARG1 is a reference type, find its underlying type. */
10254 type
= value_type (arg1
);
10255 while (type
->code () == TYPE_CODE_REF
)
10256 type
= TYPE_TARGET_TYPE (type
);
10257 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10258 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10261 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10262 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10263 if (noside
== EVAL_SKIP
)
10265 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10266 return (value_from_longest
10267 (value_type (arg1
),
10268 value_as_long (arg1
) - value_as_long (arg2
)));
10269 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10270 return (value_from_longest
10271 (value_type (arg2
),
10272 value_as_long (arg1
) - value_as_long (arg2
)));
10273 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10274 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10275 && value_type (arg1
) != value_type (arg2
))
10276 error (_("Operands of fixed-point subtraction "
10277 "must have the same type"));
10278 /* Do the substraction, and cast the result to the type of the first
10279 argument. We cannot cast the result to a reference type, so if
10280 ARG1 is a reference type, find its underlying type. */
10281 type
= value_type (arg1
);
10282 while (type
->code () == TYPE_CODE_REF
)
10283 type
= TYPE_TARGET_TYPE (type
);
10284 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10285 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10291 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10292 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10293 if (noside
== EVAL_SKIP
)
10295 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10297 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10298 return value_zero (value_type (arg1
), not_lval
);
10302 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10303 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10304 arg1
= cast_from_gnat_encoded_fixed_point_type (type
, arg1
);
10305 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10306 arg2
= cast_from_gnat_encoded_fixed_point_type (type
, arg2
);
10307 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10308 return ada_value_binop (arg1
, arg2
, op
);
10312 case BINOP_NOTEQUAL
:
10313 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10314 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10315 if (noside
== EVAL_SKIP
)
10317 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10321 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10322 tem
= ada_value_equal (arg1
, arg2
);
10324 if (op
== BINOP_NOTEQUAL
)
10326 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10327 return value_from_longest (type
, (LONGEST
) tem
);
10330 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10331 if (noside
== EVAL_SKIP
)
10333 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10334 return value_cast (value_type (arg1
), value_neg (arg1
));
10337 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10338 return value_neg (arg1
);
10341 case BINOP_LOGICAL_AND
:
10342 case BINOP_LOGICAL_OR
:
10343 case UNOP_LOGICAL_NOT
:
10348 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10349 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10350 return value_cast (type
, val
);
10353 case BINOP_BITWISE_AND
:
10354 case BINOP_BITWISE_IOR
:
10355 case BINOP_BITWISE_XOR
:
10359 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10361 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10363 return value_cast (value_type (arg1
), val
);
10369 if (noside
== EVAL_SKIP
)
10375 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10376 /* Only encountered when an unresolved symbol occurs in a
10377 context other than a function call, in which case, it is
10379 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10380 exp
->elts
[pc
+ 2].symbol
->print_name ());
10382 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10384 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10385 /* Check to see if this is a tagged type. We also need to handle
10386 the case where the type is a reference to a tagged type, but
10387 we have to be careful to exclude pointers to tagged types.
10388 The latter should be shown as usual (as a pointer), whereas
10389 a reference should mostly be transparent to the user. */
10390 if (ada_is_tagged_type (type
, 0)
10391 || (type
->code () == TYPE_CODE_REF
10392 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10394 /* Tagged types are a little special in the fact that the real
10395 type is dynamic and can only be determined by inspecting the
10396 object's tag. This means that we need to get the object's
10397 value first (EVAL_NORMAL) and then extract the actual object
10400 Note that we cannot skip the final step where we extract
10401 the object type from its tag, because the EVAL_NORMAL phase
10402 results in dynamic components being resolved into fixed ones.
10403 This can cause problems when trying to print the type
10404 description of tagged types whose parent has a dynamic size:
10405 We use the type name of the "_parent" component in order
10406 to print the name of the ancestor type in the type description.
10407 If that component had a dynamic size, the resolution into
10408 a fixed type would result in the loss of that type name,
10409 thus preventing us from printing the name of the ancestor
10410 type in the type description. */
10411 arg1
= evaluate_subexp (nullptr, exp
, pos
, EVAL_NORMAL
);
10413 if (type
->code () != TYPE_CODE_REF
)
10415 struct type
*actual_type
;
10417 actual_type
= type_from_tag (ada_value_tag (arg1
));
10418 if (actual_type
== NULL
)
10419 /* If, for some reason, we were unable to determine
10420 the actual type from the tag, then use the static
10421 approximation that we just computed as a fallback.
10422 This can happen if the debugging information is
10423 incomplete, for instance. */
10424 actual_type
= type
;
10425 return value_zero (actual_type
, not_lval
);
10429 /* In the case of a ref, ada_coerce_ref takes care
10430 of determining the actual type. But the evaluation
10431 should return a ref as it should be valid to ask
10432 for its address; so rebuild a ref after coerce. */
10433 arg1
= ada_coerce_ref (arg1
);
10434 return value_ref (arg1
, TYPE_CODE_REF
);
10438 /* Records and unions for which GNAT encodings have been
10439 generated need to be statically fixed as well.
10440 Otherwise, non-static fixing produces a type where
10441 all dynamic properties are removed, which prevents "ptype"
10442 from being able to completely describe the type.
10443 For instance, a case statement in a variant record would be
10444 replaced by the relevant components based on the actual
10445 value of the discriminants. */
10446 if ((type
->code () == TYPE_CODE_STRUCT
10447 && dynamic_template_type (type
) != NULL
)
10448 || (type
->code () == TYPE_CODE_UNION
10449 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10452 return value_zero (to_static_fixed_type (type
), not_lval
);
10456 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10457 return ada_to_fixed_value (arg1
);
10462 /* Allocate arg vector, including space for the function to be
10463 called in argvec[0] and a terminating NULL. */
10464 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10465 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10467 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10468 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10469 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10470 exp
->elts
[pc
+ 5].symbol
->print_name ());
10473 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10474 argvec
[tem
] = evaluate_subexp (nullptr, exp
, pos
, noside
);
10477 if (noside
== EVAL_SKIP
)
10481 if (ada_is_constrained_packed_array_type
10482 (desc_base_type (value_type (argvec
[0]))))
10483 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10484 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10485 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10486 /* This is a packed array that has already been fixed, and
10487 therefore already coerced to a simple array. Nothing further
10490 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10492 /* Make sure we dereference references so that all the code below
10493 feels like it's really handling the referenced value. Wrapping
10494 types (for alignment) may be there, so make sure we strip them as
10496 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10498 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10499 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10500 argvec
[0] = value_addr (argvec
[0]);
10502 type
= ada_check_typedef (value_type (argvec
[0]));
10504 /* Ada allows us to implicitly dereference arrays when subscripting
10505 them. So, if this is an array typedef (encoding use for array
10506 access types encoded as fat pointers), strip it now. */
10507 if (type
->code () == TYPE_CODE_TYPEDEF
)
10508 type
= ada_typedef_target_type (type
);
10510 if (type
->code () == TYPE_CODE_PTR
)
10512 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10514 case TYPE_CODE_FUNC
:
10515 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10517 case TYPE_CODE_ARRAY
:
10519 case TYPE_CODE_STRUCT
:
10520 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10521 argvec
[0] = ada_value_ind (argvec
[0]);
10522 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10525 error (_("cannot subscript or call something of type `%s'"),
10526 ada_type_name (value_type (argvec
[0])));
10531 switch (type
->code ())
10533 case TYPE_CODE_FUNC
:
10534 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10536 if (TYPE_TARGET_TYPE (type
) == NULL
)
10537 error_call_unknown_return_type (NULL
);
10538 return allocate_value (TYPE_TARGET_TYPE (type
));
10540 return call_function_by_hand (argvec
[0], NULL
,
10541 gdb::make_array_view (argvec
+ 1,
10543 case TYPE_CODE_INTERNAL_FUNCTION
:
10544 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10545 /* We don't know anything about what the internal
10546 function might return, but we have to return
10548 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10551 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10552 argvec
[0], nargs
, argvec
+ 1);
10554 case TYPE_CODE_STRUCT
:
10558 arity
= ada_array_arity (type
);
10559 type
= ada_array_element_type (type
, nargs
);
10561 error (_("cannot subscript or call a record"));
10562 if (arity
!= nargs
)
10563 error (_("wrong number of subscripts; expecting %d"), arity
);
10564 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10565 return value_zero (ada_aligned_type (type
), lval_memory
);
10567 unwrap_value (ada_value_subscript
10568 (argvec
[0], nargs
, argvec
+ 1));
10570 case TYPE_CODE_ARRAY
:
10571 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10573 type
= ada_array_element_type (type
, nargs
);
10575 error (_("element type of array unknown"));
10577 return value_zero (ada_aligned_type (type
), lval_memory
);
10580 unwrap_value (ada_value_subscript
10581 (ada_coerce_to_simple_array (argvec
[0]),
10582 nargs
, argvec
+ 1));
10583 case TYPE_CODE_PTR
: /* Pointer to array */
10584 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10586 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10587 type
= ada_array_element_type (type
, nargs
);
10589 error (_("element type of array unknown"));
10591 return value_zero (ada_aligned_type (type
), lval_memory
);
10594 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10595 nargs
, argvec
+ 1));
10598 error (_("Attempt to index or call something other than an "
10599 "array or function"));
10604 struct value
*array
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10605 struct value
*low_bound_val
10606 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10607 struct value
*high_bound_val
10608 = evaluate_subexp (nullptr, exp
, pos
, noside
);
10610 LONGEST high_bound
;
10612 low_bound_val
= coerce_ref (low_bound_val
);
10613 high_bound_val
= coerce_ref (high_bound_val
);
10614 low_bound
= value_as_long (low_bound_val
);
10615 high_bound
= value_as_long (high_bound_val
);
10617 if (noside
== EVAL_SKIP
)
10620 /* If this is a reference to an aligner type, then remove all
10622 if (value_type (array
)->code () == TYPE_CODE_REF
10623 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10624 TYPE_TARGET_TYPE (value_type (array
)) =
10625 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10627 if (ada_is_any_packed_array_type (value_type (array
)))
10628 error (_("cannot slice a packed array"));
10630 /* If this is a reference to an array or an array lvalue,
10631 convert to a pointer. */
10632 if (value_type (array
)->code () == TYPE_CODE_REF
10633 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10634 && VALUE_LVAL (array
) == lval_memory
))
10635 array
= value_addr (array
);
10637 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10638 && ada_is_array_descriptor_type (ada_check_typedef
10639 (value_type (array
))))
10640 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10643 array
= ada_coerce_to_simple_array_ptr (array
);
10645 /* If we have more than one level of pointer indirection,
10646 dereference the value until we get only one level. */
10647 while (value_type (array
)->code () == TYPE_CODE_PTR
10648 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10650 array
= value_ind (array
);
10652 /* Make sure we really do have an array type before going further,
10653 to avoid a SEGV when trying to get the index type or the target
10654 type later down the road if the debug info generated by
10655 the compiler is incorrect or incomplete. */
10656 if (!ada_is_simple_array_type (value_type (array
)))
10657 error (_("cannot take slice of non-array"));
10659 if (ada_check_typedef (value_type (array
))->code ()
10662 struct type
*type0
= ada_check_typedef (value_type (array
));
10664 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10665 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10668 struct type
*arr_type0
=
10669 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10671 return ada_value_slice_from_ptr (array
, arr_type0
,
10672 longest_to_int (low_bound
),
10673 longest_to_int (high_bound
));
10676 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10678 else if (high_bound
< low_bound
)
10679 return empty_array (value_type (array
), low_bound
, high_bound
);
10681 return ada_value_slice (array
, longest_to_int (low_bound
),
10682 longest_to_int (high_bound
));
10685 case UNOP_IN_RANGE
:
10687 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10688 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10690 if (noside
== EVAL_SKIP
)
10693 switch (type
->code ())
10696 lim_warning (_("Membership test incompletely implemented; "
10697 "always returns true"));
10698 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10699 return value_from_longest (type
, (LONGEST
) 1);
10701 case TYPE_CODE_RANGE
:
10702 arg2
= value_from_longest (type
,
10703 type
->bounds ()->low
.const_val ());
10704 arg3
= value_from_longest (type
,
10705 type
->bounds ()->high
.const_val ());
10706 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10707 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10708 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10710 value_from_longest (type
,
10711 (value_less (arg1
, arg3
)
10712 || value_equal (arg1
, arg3
))
10713 && (value_less (arg2
, arg1
)
10714 || value_equal (arg2
, arg1
)));
10717 case BINOP_IN_BOUNDS
:
10719 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10720 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10722 if (noside
== EVAL_SKIP
)
10725 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10727 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10728 return value_zero (type
, not_lval
);
10731 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10733 type
= ada_index_type (value_type (arg2
), tem
, "range");
10735 type
= value_type (arg1
);
10737 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10738 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10740 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10741 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10742 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10744 value_from_longest (type
,
10745 (value_less (arg1
, arg3
)
10746 || value_equal (arg1
, arg3
))
10747 && (value_less (arg2
, arg1
)
10748 || value_equal (arg2
, arg1
)));
10750 case TERNOP_IN_RANGE
:
10751 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10752 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10753 arg3
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10755 if (noside
== EVAL_SKIP
)
10758 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10759 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10760 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10762 value_from_longest (type
,
10763 (value_less (arg1
, arg3
)
10764 || value_equal (arg1
, arg3
))
10765 && (value_less (arg2
, arg1
)
10766 || value_equal (arg2
, arg1
)));
10770 case OP_ATR_LENGTH
:
10772 struct type
*type_arg
;
10774 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10776 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10778 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10782 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10786 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10787 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10788 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10791 if (noside
== EVAL_SKIP
)
10793 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10795 if (type_arg
== NULL
)
10796 type_arg
= value_type (arg1
);
10798 if (ada_is_constrained_packed_array_type (type_arg
))
10799 type_arg
= decode_constrained_packed_array_type (type_arg
);
10801 if (!discrete_type_p (type_arg
))
10805 default: /* Should never happen. */
10806 error (_("unexpected attribute encountered"));
10809 type_arg
= ada_index_type (type_arg
, tem
,
10810 ada_attribute_name (op
));
10812 case OP_ATR_LENGTH
:
10813 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
10818 return value_zero (type_arg
, not_lval
);
10820 else if (type_arg
== NULL
)
10822 arg1
= ada_coerce_ref (arg1
);
10824 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10825 arg1
= ada_coerce_to_simple_array (arg1
);
10827 if (op
== OP_ATR_LENGTH
)
10828 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10831 type
= ada_index_type (value_type (arg1
), tem
,
10832 ada_attribute_name (op
));
10834 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10839 default: /* Should never happen. */
10840 error (_("unexpected attribute encountered"));
10842 return value_from_longest
10843 (type
, ada_array_bound (arg1
, tem
, 0));
10845 return value_from_longest
10846 (type
, ada_array_bound (arg1
, tem
, 1));
10847 case OP_ATR_LENGTH
:
10848 return value_from_longest
10849 (type
, ada_array_length (arg1
, tem
));
10852 else if (discrete_type_p (type_arg
))
10854 struct type
*range_type
;
10855 const char *name
= ada_type_name (type_arg
);
10858 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
10859 range_type
= to_fixed_range_type (type_arg
, NULL
);
10860 if (range_type
== NULL
)
10861 range_type
= type_arg
;
10865 error (_("unexpected attribute encountered"));
10867 return value_from_longest
10868 (range_type
, ada_discrete_type_low_bound (range_type
));
10870 return value_from_longest
10871 (range_type
, ada_discrete_type_high_bound (range_type
));
10872 case OP_ATR_LENGTH
:
10873 error (_("the 'length attribute applies only to array types"));
10876 else if (type_arg
->code () == TYPE_CODE_FLT
)
10877 error (_("unimplemented type attribute"));
10882 if (ada_is_constrained_packed_array_type (type_arg
))
10883 type_arg
= decode_constrained_packed_array_type (type_arg
);
10885 if (op
== OP_ATR_LENGTH
)
10886 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10889 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10891 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10897 error (_("unexpected attribute encountered"));
10899 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10900 return value_from_longest (type
, low
);
10902 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10903 return value_from_longest (type
, high
);
10904 case OP_ATR_LENGTH
:
10905 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10906 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10907 return value_from_longest (type
, high
- low
+ 1);
10913 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10914 if (noside
== EVAL_SKIP
)
10917 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10918 return value_zero (ada_tag_type (arg1
), not_lval
);
10920 return ada_value_tag (arg1
);
10924 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10925 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10926 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10927 if (noside
== EVAL_SKIP
)
10929 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10930 return value_zero (value_type (arg1
), not_lval
);
10933 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10934 return value_binop (arg1
, arg2
,
10935 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10938 case OP_ATR_MODULUS
:
10940 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10942 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10943 if (noside
== EVAL_SKIP
)
10946 if (!ada_is_modular_type (type_arg
))
10947 error (_("'modulus must be applied to modular type"));
10949 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10950 ada_modulus (type_arg
));
10955 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10956 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10957 if (noside
== EVAL_SKIP
)
10959 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10960 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10961 return value_zero (type
, not_lval
);
10963 return value_pos_atr (type
, arg1
);
10966 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10967 type
= value_type (arg1
);
10969 /* If the argument is a reference, then dereference its type, since
10970 the user is really asking for the size of the actual object,
10971 not the size of the pointer. */
10972 if (type
->code () == TYPE_CODE_REF
)
10973 type
= TYPE_TARGET_TYPE (type
);
10975 if (noside
== EVAL_SKIP
)
10977 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10978 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10980 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10981 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10984 evaluate_subexp (nullptr, exp
, pos
, EVAL_SKIP
);
10985 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10986 type
= exp
->elts
[pc
+ 2].type
;
10987 if (noside
== EVAL_SKIP
)
10989 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10990 return value_zero (type
, not_lval
);
10992 return value_val_atr (type
, arg1
);
10995 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10996 arg2
= evaluate_subexp (nullptr, exp
, pos
, noside
);
10997 if (noside
== EVAL_SKIP
)
10999 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11000 return value_zero (value_type (arg1
), not_lval
);
11003 /* For integer exponentiation operations,
11004 only promote the first argument. */
11005 if (is_integral_type (value_type (arg2
)))
11006 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11008 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11010 return value_binop (arg1
, arg2
, op
);
11014 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11015 if (noside
== EVAL_SKIP
)
11021 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11022 if (noside
== EVAL_SKIP
)
11024 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11025 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11026 return value_neg (arg1
);
11031 preeval_pos
= *pos
;
11032 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11033 if (noside
== EVAL_SKIP
)
11035 type
= ada_check_typedef (value_type (arg1
));
11036 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11038 if (ada_is_array_descriptor_type (type
))
11039 /* GDB allows dereferencing GNAT array descriptors. */
11041 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11043 if (arrType
== NULL
)
11044 error (_("Attempt to dereference null array pointer."));
11045 return value_at_lazy (arrType
, 0);
11047 else if (type
->code () == TYPE_CODE_PTR
11048 || type
->code () == TYPE_CODE_REF
11049 /* In C you can dereference an array to get the 1st elt. */
11050 || type
->code () == TYPE_CODE_ARRAY
)
11052 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11053 only be determined by inspecting the object's tag.
11054 This means that we need to evaluate completely the
11055 expression in order to get its type. */
11057 if ((type
->code () == TYPE_CODE_REF
11058 || type
->code () == TYPE_CODE_PTR
)
11059 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11062 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11063 type
= value_type (ada_value_ind (arg1
));
11067 type
= to_static_fixed_type
11069 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11071 ada_ensure_varsize_limit (type
);
11072 return value_zero (type
, lval_memory
);
11074 else if (type
->code () == TYPE_CODE_INT
)
11076 /* GDB allows dereferencing an int. */
11077 if (expect_type
== NULL
)
11078 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11083 to_static_fixed_type (ada_aligned_type (expect_type
));
11084 return value_zero (expect_type
, lval_memory
);
11088 error (_("Attempt to take contents of a non-pointer value."));
11090 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11091 type
= ada_check_typedef (value_type (arg1
));
11093 if (type
->code () == TYPE_CODE_INT
)
11094 /* GDB allows dereferencing an int. If we were given
11095 the expect_type, then use that as the target type.
11096 Otherwise, assume that the target type is an int. */
11098 if (expect_type
!= NULL
)
11099 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11102 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11103 (CORE_ADDR
) value_as_address (arg1
));
11106 if (ada_is_array_descriptor_type (type
))
11107 /* GDB allows dereferencing GNAT array descriptors. */
11108 return ada_coerce_to_simple_array (arg1
);
11110 return ada_value_ind (arg1
);
11112 case STRUCTOP_STRUCT
:
11113 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11114 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11115 preeval_pos
= *pos
;
11116 arg1
= evaluate_subexp (nullptr, exp
, pos
, noside
);
11117 if (noside
== EVAL_SKIP
)
11119 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11121 struct type
*type1
= value_type (arg1
);
11123 if (ada_is_tagged_type (type1
, 1))
11125 type
= ada_lookup_struct_elt_type (type1
,
11126 &exp
->elts
[pc
+ 2].string
,
11129 /* If the field is not found, check if it exists in the
11130 extension of this object's type. This means that we
11131 need to evaluate completely the expression. */
11136 = evaluate_subexp (nullptr, exp
, &preeval_pos
, EVAL_NORMAL
);
11137 arg1
= ada_value_struct_elt (arg1
,
11138 &exp
->elts
[pc
+ 2].string
,
11140 arg1
= unwrap_value (arg1
);
11141 type
= value_type (ada_to_fixed_value (arg1
));
11146 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11149 return value_zero (ada_aligned_type (type
), lval_memory
);
11153 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11154 arg1
= unwrap_value (arg1
);
11155 return ada_to_fixed_value (arg1
);
11159 /* The value is not supposed to be used. This is here to make it
11160 easier to accommodate expressions that contain types. */
11162 if (noside
== EVAL_SKIP
)
11164 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11165 return allocate_value (exp
->elts
[pc
+ 1].type
);
11167 error (_("Attempt to use a type name as an expression"));
11172 case OP_DISCRETE_RANGE
:
11173 case OP_POSITIONAL
:
11175 if (noside
== EVAL_NORMAL
)
11179 error (_("Undefined name, ambiguous name, or renaming used in "
11180 "component association: %s."), &exp
->elts
[pc
+2].string
);
11182 error (_("Aggregates only allowed on the right of an assignment"));
11184 internal_error (__FILE__
, __LINE__
,
11185 _("aggregate apparently mangled"));
11188 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11190 for (tem
= 0; tem
< nargs
; tem
+= 1)
11191 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11196 return eval_skip_value (exp
);
11202 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11203 type name that encodes the 'small and 'delta information.
11204 Otherwise, return NULL. */
11206 static const char *
11207 gnat_encoded_fixed_point_type_info (struct type
*type
)
11209 const char *name
= ada_type_name (type
);
11210 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: type
->code ();
11212 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11214 const char *tail
= strstr (name
, "___XF_");
11221 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11222 return gnat_encoded_fixed_point_type_info (TYPE_TARGET_TYPE (type
));
11227 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11230 ada_is_gnat_encoded_fixed_point_type (struct type
*type
)
11232 return gnat_encoded_fixed_point_type_info (type
) != NULL
;
11235 /* Return non-zero iff TYPE represents a System.Address type. */
11238 ada_is_system_address_type (struct type
*type
)
11240 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11243 /* Assuming that TYPE is the representation of an Ada fixed-point
11244 type, return the target floating-point type to be used to represent
11245 of this type during internal computation. */
11247 static struct type
*
11248 ada_scaling_type (struct type
*type
)
11250 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11253 /* Assuming that TYPE is the representation of an Ada fixed-point
11254 type, return its delta, or NULL if the type is malformed and the
11255 delta cannot be determined. */
11258 gnat_encoded_fixed_point_delta (struct type
*type
)
11260 const char *encoding
= gnat_encoded_fixed_point_type_info (type
);
11261 struct type
*scale_type
= ada_scaling_type (type
);
11263 long long num
, den
;
11265 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11268 return value_binop (value_from_longest (scale_type
, num
),
11269 value_from_longest (scale_type
, den
), BINOP_DIV
);
11272 /* Assuming that ada_is_gnat_encoded_fixed_point_type (TYPE), return
11273 the scaling factor ('SMALL value) associated with the type. */
11276 gnat_encoded_fixed_point_scaling_factor (struct type
*type
)
11278 const char *encoding
= gnat_encoded_fixed_point_type_info (type
);
11279 struct type
*scale_type
= ada_scaling_type (type
);
11281 long long num0
, den0
, num1
, den1
;
11284 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11285 &num0
, &den0
, &num1
, &den1
);
11288 return value_from_longest (scale_type
, 1);
11290 return value_binop (value_from_longest (scale_type
, num1
),
11291 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11293 return value_binop (value_from_longest (scale_type
, num0
),
11294 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11301 /* Scan STR beginning at position K for a discriminant name, and
11302 return the value of that discriminant field of DVAL in *PX. If
11303 PNEW_K is not null, put the position of the character beyond the
11304 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11305 not alter *PX and *PNEW_K if unsuccessful. */
11308 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11311 static char *bound_buffer
= NULL
;
11312 static size_t bound_buffer_len
= 0;
11313 const char *pstart
, *pend
, *bound
;
11314 struct value
*bound_val
;
11316 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11320 pend
= strstr (pstart
, "__");
11324 k
+= strlen (bound
);
11328 int len
= pend
- pstart
;
11330 /* Strip __ and beyond. */
11331 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11332 strncpy (bound_buffer
, pstart
, len
);
11333 bound_buffer
[len
] = '\0';
11335 bound
= bound_buffer
;
11339 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11340 if (bound_val
== NULL
)
11343 *px
= value_as_long (bound_val
);
11344 if (pnew_k
!= NULL
)
11349 /* Value of variable named NAME in the current environment. If
11350 no such variable found, then if ERR_MSG is null, returns 0, and
11351 otherwise causes an error with message ERR_MSG. */
11353 static struct value
*
11354 get_var_value (const char *name
, const char *err_msg
)
11356 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11358 std::vector
<struct block_symbol
> syms
;
11359 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11360 get_selected_block (0),
11361 VAR_DOMAIN
, &syms
, 1);
11365 if (err_msg
== NULL
)
11368 error (("%s"), err_msg
);
11371 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11374 /* Value of integer variable named NAME in the current environment.
11375 If no such variable is found, returns false. Otherwise, sets VALUE
11376 to the variable's value and returns true. */
11379 get_int_var_value (const char *name
, LONGEST
&value
)
11381 struct value
*var_val
= get_var_value (name
, 0);
11386 value
= value_as_long (var_val
);
11391 /* Return a range type whose base type is that of the range type named
11392 NAME in the current environment, and whose bounds are calculated
11393 from NAME according to the GNAT range encoding conventions.
11394 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11395 corresponding range type from debug information; fall back to using it
11396 if symbol lookup fails. If a new type must be created, allocate it
11397 like ORIG_TYPE was. The bounds information, in general, is encoded
11398 in NAME, the base type given in the named range type. */
11400 static struct type
*
11401 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11404 struct type
*base_type
;
11405 const char *subtype_info
;
11407 gdb_assert (raw_type
!= NULL
);
11408 gdb_assert (raw_type
->name () != NULL
);
11410 if (raw_type
->code () == TYPE_CODE_RANGE
)
11411 base_type
= TYPE_TARGET_TYPE (raw_type
);
11413 base_type
= raw_type
;
11415 name
= raw_type
->name ();
11416 subtype_info
= strstr (name
, "___XD");
11417 if (subtype_info
== NULL
)
11419 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11420 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11422 if (L
< INT_MIN
|| U
> INT_MAX
)
11425 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11430 static char *name_buf
= NULL
;
11431 static size_t name_len
= 0;
11432 int prefix_len
= subtype_info
- name
;
11435 const char *bounds_str
;
11438 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11439 strncpy (name_buf
, name
, prefix_len
);
11440 name_buf
[prefix_len
] = '\0';
11443 bounds_str
= strchr (subtype_info
, '_');
11446 if (*subtype_info
== 'L')
11448 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11449 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11451 if (bounds_str
[n
] == '_')
11453 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11459 strcpy (name_buf
+ prefix_len
, "___L");
11460 if (!get_int_var_value (name_buf
, L
))
11462 lim_warning (_("Unknown lower bound, using 1."));
11467 if (*subtype_info
== 'U')
11469 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11470 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11475 strcpy (name_buf
+ prefix_len
, "___U");
11476 if (!get_int_var_value (name_buf
, U
))
11478 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11483 type
= create_static_range_type (alloc_type_copy (raw_type
),
11485 /* create_static_range_type alters the resulting type's length
11486 to match the size of the base_type, which is not what we want.
11487 Set it back to the original range type's length. */
11488 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11489 type
->set_name (name
);
11494 /* True iff NAME is the name of a range type. */
11497 ada_is_range_type_name (const char *name
)
11499 return (name
!= NULL
&& strstr (name
, "___XD"));
11503 /* Modular types */
11505 /* True iff TYPE is an Ada modular type. */
11508 ada_is_modular_type (struct type
*type
)
11510 struct type
*subranged_type
= get_base_type (type
);
11512 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11513 && subranged_type
->code () == TYPE_CODE_INT
11514 && subranged_type
->is_unsigned ());
11517 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11520 ada_modulus (struct type
*type
)
11522 const dynamic_prop
&high
= type
->bounds ()->high
;
11524 if (high
.kind () == PROP_CONST
)
11525 return (ULONGEST
) high
.const_val () + 1;
11527 /* If TYPE is unresolved, the high bound might be a location list. Return
11528 0, for lack of a better value to return. */
11533 /* Ada exception catchpoint support:
11534 ---------------------------------
11536 We support 3 kinds of exception catchpoints:
11537 . catchpoints on Ada exceptions
11538 . catchpoints on unhandled Ada exceptions
11539 . catchpoints on failed assertions
11541 Exceptions raised during failed assertions, or unhandled exceptions
11542 could perfectly be caught with the general catchpoint on Ada exceptions.
11543 However, we can easily differentiate these two special cases, and having
11544 the option to distinguish these two cases from the rest can be useful
11545 to zero-in on certain situations.
11547 Exception catchpoints are a specialized form of breakpoint,
11548 since they rely on inserting breakpoints inside known routines
11549 of the GNAT runtime. The implementation therefore uses a standard
11550 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11553 Support in the runtime for exception catchpoints have been changed
11554 a few times already, and these changes affect the implementation
11555 of these catchpoints. In order to be able to support several
11556 variants of the runtime, we use a sniffer that will determine
11557 the runtime variant used by the program being debugged. */
11559 /* Ada's standard exceptions.
11561 The Ada 83 standard also defined Numeric_Error. But there so many
11562 situations where it was unclear from the Ada 83 Reference Manual
11563 (RM) whether Constraint_Error or Numeric_Error should be raised,
11564 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11565 Interpretation saying that anytime the RM says that Numeric_Error
11566 should be raised, the implementation may raise Constraint_Error.
11567 Ada 95 went one step further and pretty much removed Numeric_Error
11568 from the list of standard exceptions (it made it a renaming of
11569 Constraint_Error, to help preserve compatibility when compiling
11570 an Ada83 compiler). As such, we do not include Numeric_Error from
11571 this list of standard exceptions. */
11573 static const char * const standard_exc
[] = {
11574 "constraint_error",
11580 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11582 /* A structure that describes how to support exception catchpoints
11583 for a given executable. */
11585 struct exception_support_info
11587 /* The name of the symbol to break on in order to insert
11588 a catchpoint on exceptions. */
11589 const char *catch_exception_sym
;
11591 /* The name of the symbol to break on in order to insert
11592 a catchpoint on unhandled exceptions. */
11593 const char *catch_exception_unhandled_sym
;
11595 /* The name of the symbol to break on in order to insert
11596 a catchpoint on failed assertions. */
11597 const char *catch_assert_sym
;
11599 /* The name of the symbol to break on in order to insert
11600 a catchpoint on exception handling. */
11601 const char *catch_handlers_sym
;
11603 /* Assuming that the inferior just triggered an unhandled exception
11604 catchpoint, this function is responsible for returning the address
11605 in inferior memory where the name of that exception is stored.
11606 Return zero if the address could not be computed. */
11607 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11610 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11611 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11613 /* The following exception support info structure describes how to
11614 implement exception catchpoints with the latest version of the
11615 Ada runtime (as of 2019-08-??). */
11617 static const struct exception_support_info default_exception_support_info
=
11619 "__gnat_debug_raise_exception", /* catch_exception_sym */
11620 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11621 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11622 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11623 ada_unhandled_exception_name_addr
11626 /* The following exception support info structure describes how to
11627 implement exception catchpoints with an earlier version of the
11628 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11630 static const struct exception_support_info exception_support_info_v0
=
11632 "__gnat_debug_raise_exception", /* catch_exception_sym */
11633 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11634 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11635 "__gnat_begin_handler", /* catch_handlers_sym */
11636 ada_unhandled_exception_name_addr
11639 /* The following exception support info structure describes how to
11640 implement exception catchpoints with a slightly older version
11641 of the Ada runtime. */
11643 static const struct exception_support_info exception_support_info_fallback
=
11645 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11646 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11647 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11648 "__gnat_begin_handler", /* catch_handlers_sym */
11649 ada_unhandled_exception_name_addr_from_raise
11652 /* Return nonzero if we can detect the exception support routines
11653 described in EINFO.
11655 This function errors out if an abnormal situation is detected
11656 (for instance, if we find the exception support routines, but
11657 that support is found to be incomplete). */
11660 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11662 struct symbol
*sym
;
11664 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11665 that should be compiled with debugging information. As a result, we
11666 expect to find that symbol in the symtabs. */
11668 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11671 /* Perhaps we did not find our symbol because the Ada runtime was
11672 compiled without debugging info, or simply stripped of it.
11673 It happens on some GNU/Linux distributions for instance, where
11674 users have to install a separate debug package in order to get
11675 the runtime's debugging info. In that situation, let the user
11676 know why we cannot insert an Ada exception catchpoint.
11678 Note: Just for the purpose of inserting our Ada exception
11679 catchpoint, we could rely purely on the associated minimal symbol.
11680 But we would be operating in degraded mode anyway, since we are
11681 still lacking the debugging info needed later on to extract
11682 the name of the exception being raised (this name is printed in
11683 the catchpoint message, and is also used when trying to catch
11684 a specific exception). We do not handle this case for now. */
11685 struct bound_minimal_symbol msym
11686 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11688 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11689 error (_("Your Ada runtime appears to be missing some debugging "
11690 "information.\nCannot insert Ada exception catchpoint "
11691 "in this configuration."));
11696 /* Make sure that the symbol we found corresponds to a function. */
11698 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11700 error (_("Symbol \"%s\" is not a function (class = %d)"),
11701 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11705 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11708 struct bound_minimal_symbol msym
11709 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11711 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11712 error (_("Your Ada runtime appears to be missing some debugging "
11713 "information.\nCannot insert Ada exception catchpoint "
11714 "in this configuration."));
11719 /* Make sure that the symbol we found corresponds to a function. */
11721 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11723 error (_("Symbol \"%s\" is not a function (class = %d)"),
11724 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11731 /* Inspect the Ada runtime and determine which exception info structure
11732 should be used to provide support for exception catchpoints.
11734 This function will always set the per-inferior exception_info,
11735 or raise an error. */
11738 ada_exception_support_info_sniffer (void)
11740 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11742 /* If the exception info is already known, then no need to recompute it. */
11743 if (data
->exception_info
!= NULL
)
11746 /* Check the latest (default) exception support info. */
11747 if (ada_has_this_exception_support (&default_exception_support_info
))
11749 data
->exception_info
= &default_exception_support_info
;
11753 /* Try the v0 exception suport info. */
11754 if (ada_has_this_exception_support (&exception_support_info_v0
))
11756 data
->exception_info
= &exception_support_info_v0
;
11760 /* Try our fallback exception suport info. */
11761 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11763 data
->exception_info
= &exception_support_info_fallback
;
11767 /* Sometimes, it is normal for us to not be able to find the routine
11768 we are looking for. This happens when the program is linked with
11769 the shared version of the GNAT runtime, and the program has not been
11770 started yet. Inform the user of these two possible causes if
11773 if (ada_update_initial_language (language_unknown
) != language_ada
)
11774 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11776 /* If the symbol does not exist, then check that the program is
11777 already started, to make sure that shared libraries have been
11778 loaded. If it is not started, this may mean that the symbol is
11779 in a shared library. */
11781 if (inferior_ptid
.pid () == 0)
11782 error (_("Unable to insert catchpoint. Try to start the program first."));
11784 /* At this point, we know that we are debugging an Ada program and
11785 that the inferior has been started, but we still are not able to
11786 find the run-time symbols. That can mean that we are in
11787 configurable run time mode, or that a-except as been optimized
11788 out by the linker... In any case, at this point it is not worth
11789 supporting this feature. */
11791 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11794 /* True iff FRAME is very likely to be that of a function that is
11795 part of the runtime system. This is all very heuristic, but is
11796 intended to be used as advice as to what frames are uninteresting
11800 is_known_support_routine (struct frame_info
*frame
)
11802 enum language func_lang
;
11804 const char *fullname
;
11806 /* If this code does not have any debugging information (no symtab),
11807 This cannot be any user code. */
11809 symtab_and_line sal
= find_frame_sal (frame
);
11810 if (sal
.symtab
== NULL
)
11813 /* If there is a symtab, but the associated source file cannot be
11814 located, then assume this is not user code: Selecting a frame
11815 for which we cannot display the code would not be very helpful
11816 for the user. This should also take care of case such as VxWorks
11817 where the kernel has some debugging info provided for a few units. */
11819 fullname
= symtab_to_fullname (sal
.symtab
);
11820 if (access (fullname
, R_OK
) != 0)
11823 /* Check the unit filename against the Ada runtime file naming.
11824 We also check the name of the objfile against the name of some
11825 known system libraries that sometimes come with debugging info
11828 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11830 re_comp (known_runtime_file_name_patterns
[i
]);
11831 if (re_exec (lbasename (sal
.symtab
->filename
)))
11833 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11834 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11838 /* Check whether the function is a GNAT-generated entity. */
11840 gdb::unique_xmalloc_ptr
<char> func_name
11841 = find_frame_funname (frame
, &func_lang
, NULL
);
11842 if (func_name
== NULL
)
11845 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11847 re_comp (known_auxiliary_function_name_patterns
[i
]);
11848 if (re_exec (func_name
.get ()))
11855 /* Find the first frame that contains debugging information and that is not
11856 part of the Ada run-time, starting from FI and moving upward. */
11859 ada_find_printable_frame (struct frame_info
*fi
)
11861 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11863 if (!is_known_support_routine (fi
))
11872 /* Assuming that the inferior just triggered an unhandled exception
11873 catchpoint, return the address in inferior memory where the name
11874 of the exception is stored.
11876 Return zero if the address could not be computed. */
11879 ada_unhandled_exception_name_addr (void)
11881 return parse_and_eval_address ("e.full_name");
11884 /* Same as ada_unhandled_exception_name_addr, except that this function
11885 should be used when the inferior uses an older version of the runtime,
11886 where the exception name needs to be extracted from a specific frame
11887 several frames up in the callstack. */
11890 ada_unhandled_exception_name_addr_from_raise (void)
11893 struct frame_info
*fi
;
11894 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11896 /* To determine the name of this exception, we need to select
11897 the frame corresponding to RAISE_SYM_NAME. This frame is
11898 at least 3 levels up, so we simply skip the first 3 frames
11899 without checking the name of their associated function. */
11900 fi
= get_current_frame ();
11901 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11903 fi
= get_prev_frame (fi
);
11907 enum language func_lang
;
11909 gdb::unique_xmalloc_ptr
<char> func_name
11910 = find_frame_funname (fi
, &func_lang
, NULL
);
11911 if (func_name
!= NULL
)
11913 if (strcmp (func_name
.get (),
11914 data
->exception_info
->catch_exception_sym
) == 0)
11915 break; /* We found the frame we were looking for... */
11917 fi
= get_prev_frame (fi
);
11924 return parse_and_eval_address ("id.full_name");
11927 /* Assuming the inferior just triggered an Ada exception catchpoint
11928 (of any type), return the address in inferior memory where the name
11929 of the exception is stored, if applicable.
11931 Assumes the selected frame is the current frame.
11933 Return zero if the address could not be computed, or if not relevant. */
11936 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11937 struct breakpoint
*b
)
11939 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11943 case ada_catch_exception
:
11944 return (parse_and_eval_address ("e.full_name"));
11947 case ada_catch_exception_unhandled
:
11948 return data
->exception_info
->unhandled_exception_name_addr ();
11951 case ada_catch_handlers
:
11952 return 0; /* The runtimes does not provide access to the exception
11956 case ada_catch_assert
:
11957 return 0; /* Exception name is not relevant in this case. */
11961 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11965 return 0; /* Should never be reached. */
11968 /* Assuming the inferior is stopped at an exception catchpoint,
11969 return the message which was associated to the exception, if
11970 available. Return NULL if the message could not be retrieved.
11972 Note: The exception message can be associated to an exception
11973 either through the use of the Raise_Exception function, or
11974 more simply (Ada 2005 and later), via:
11976 raise Exception_Name with "exception message";
11980 static gdb::unique_xmalloc_ptr
<char>
11981 ada_exception_message_1 (void)
11983 struct value
*e_msg_val
;
11986 /* For runtimes that support this feature, the exception message
11987 is passed as an unbounded string argument called "message". */
11988 e_msg_val
= parse_and_eval ("message");
11989 if (e_msg_val
== NULL
)
11990 return NULL
; /* Exception message not supported. */
11992 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
11993 gdb_assert (e_msg_val
!= NULL
);
11994 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
11996 /* If the message string is empty, then treat it as if there was
11997 no exception message. */
11998 if (e_msg_len
<= 0)
12001 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
12002 read_memory (value_address (e_msg_val
), (gdb_byte
*) e_msg
.get (),
12004 e_msg
.get ()[e_msg_len
] = '\0';
12009 /* Same as ada_exception_message_1, except that all exceptions are
12010 contained here (returning NULL instead). */
12012 static gdb::unique_xmalloc_ptr
<char>
12013 ada_exception_message (void)
12015 gdb::unique_xmalloc_ptr
<char> e_msg
;
12019 e_msg
= ada_exception_message_1 ();
12021 catch (const gdb_exception_error
&e
)
12023 e_msg
.reset (nullptr);
12029 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12030 any error that ada_exception_name_addr_1 might cause to be thrown.
12031 When an error is intercepted, a warning with the error message is printed,
12032 and zero is returned. */
12035 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12036 struct breakpoint
*b
)
12038 CORE_ADDR result
= 0;
12042 result
= ada_exception_name_addr_1 (ex
, b
);
12045 catch (const gdb_exception_error
&e
)
12047 warning (_("failed to get exception name: %s"), e
.what ());
12054 static std::string ada_exception_catchpoint_cond_string
12055 (const char *excep_string
,
12056 enum ada_exception_catchpoint_kind ex
);
12058 /* Ada catchpoints.
12060 In the case of catchpoints on Ada exceptions, the catchpoint will
12061 stop the target on every exception the program throws. When a user
12062 specifies the name of a specific exception, we translate this
12063 request into a condition expression (in text form), and then parse
12064 it into an expression stored in each of the catchpoint's locations.
12065 We then use this condition to check whether the exception that was
12066 raised is the one the user is interested in. If not, then the
12067 target is resumed again. We store the name of the requested
12068 exception, in order to be able to re-set the condition expression
12069 when symbols change. */
12071 /* An instance of this type is used to represent an Ada catchpoint
12072 breakpoint location. */
12074 class ada_catchpoint_location
: public bp_location
12077 ada_catchpoint_location (breakpoint
*owner
)
12078 : bp_location (owner
, bp_loc_software_breakpoint
)
12081 /* The condition that checks whether the exception that was raised
12082 is the specific exception the user specified on catchpoint
12084 expression_up excep_cond_expr
;
12087 /* An instance of this type is used to represent an Ada catchpoint. */
12089 struct ada_catchpoint
: public breakpoint
12091 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12096 /* The name of the specific exception the user specified. */
12097 std::string excep_string
;
12099 /* What kind of catchpoint this is. */
12100 enum ada_exception_catchpoint_kind m_kind
;
12103 /* Parse the exception condition string in the context of each of the
12104 catchpoint's locations, and store them for later evaluation. */
12107 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12108 enum ada_exception_catchpoint_kind ex
)
12110 struct bp_location
*bl
;
12112 /* Nothing to do if there's no specific exception to catch. */
12113 if (c
->excep_string
.empty ())
12116 /* Same if there are no locations... */
12117 if (c
->loc
== NULL
)
12120 /* Compute the condition expression in text form, from the specific
12121 expection we want to catch. */
12122 std::string cond_string
12123 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12125 /* Iterate over all the catchpoint's locations, and parse an
12126 expression for each. */
12127 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12129 struct ada_catchpoint_location
*ada_loc
12130 = (struct ada_catchpoint_location
*) bl
;
12133 if (!bl
->shlib_disabled
)
12137 s
= cond_string
.c_str ();
12140 exp
= parse_exp_1 (&s
, bl
->address
,
12141 block_for_pc (bl
->address
),
12144 catch (const gdb_exception_error
&e
)
12146 warning (_("failed to reevaluate internal exception condition "
12147 "for catchpoint %d: %s"),
12148 c
->number
, e
.what ());
12152 ada_loc
->excep_cond_expr
= std::move (exp
);
12156 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12157 structure for all exception catchpoint kinds. */
12159 static struct bp_location
*
12160 allocate_location_exception (struct breakpoint
*self
)
12162 return new ada_catchpoint_location (self
);
12165 /* Implement the RE_SET method in the breakpoint_ops structure for all
12166 exception catchpoint kinds. */
12169 re_set_exception (struct breakpoint
*b
)
12171 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12173 /* Call the base class's method. This updates the catchpoint's
12175 bkpt_breakpoint_ops
.re_set (b
);
12177 /* Reparse the exception conditional expressions. One for each
12179 create_excep_cond_exprs (c
, c
->m_kind
);
12182 /* Returns true if we should stop for this breakpoint hit. If the
12183 user specified a specific exception, we only want to cause a stop
12184 if the program thrown that exception. */
12187 should_stop_exception (const struct bp_location
*bl
)
12189 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12190 const struct ada_catchpoint_location
*ada_loc
12191 = (const struct ada_catchpoint_location
*) bl
;
12194 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12195 if (c
->m_kind
== ada_catch_assert
)
12196 clear_internalvar (var
);
12203 if (c
->m_kind
== ada_catch_handlers
)
12204 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12205 ".all.occurrence.id");
12209 struct value
*exc
= parse_and_eval (expr
);
12210 set_internalvar (var
, exc
);
12212 catch (const gdb_exception_error
&ex
)
12214 clear_internalvar (var
);
12218 /* With no specific exception, should always stop. */
12219 if (c
->excep_string
.empty ())
12222 if (ada_loc
->excep_cond_expr
== NULL
)
12224 /* We will have a NULL expression if back when we were creating
12225 the expressions, this location's had failed to parse. */
12232 struct value
*mark
;
12234 mark
= value_mark ();
12235 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12236 value_free_to_mark (mark
);
12238 catch (const gdb_exception
&ex
)
12240 exception_fprintf (gdb_stderr
, ex
,
12241 _("Error in testing exception condition:\n"));
12247 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12248 for all exception catchpoint kinds. */
12251 check_status_exception (bpstat bs
)
12253 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12256 /* Implement the PRINT_IT method in the breakpoint_ops structure
12257 for all exception catchpoint kinds. */
12259 static enum print_stop_action
12260 print_it_exception (bpstat bs
)
12262 struct ui_out
*uiout
= current_uiout
;
12263 struct breakpoint
*b
= bs
->breakpoint_at
;
12265 annotate_catchpoint (b
->number
);
12267 if (uiout
->is_mi_like_p ())
12269 uiout
->field_string ("reason",
12270 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12271 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12274 uiout
->text (b
->disposition
== disp_del
12275 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12276 uiout
->field_signed ("bkptno", b
->number
);
12277 uiout
->text (", ");
12279 /* ada_exception_name_addr relies on the selected frame being the
12280 current frame. Need to do this here because this function may be
12281 called more than once when printing a stop, and below, we'll
12282 select the first frame past the Ada run-time (see
12283 ada_find_printable_frame). */
12284 select_frame (get_current_frame ());
12286 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12289 case ada_catch_exception
:
12290 case ada_catch_exception_unhandled
:
12291 case ada_catch_handlers
:
12293 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12294 char exception_name
[256];
12298 read_memory (addr
, (gdb_byte
*) exception_name
,
12299 sizeof (exception_name
) - 1);
12300 exception_name
[sizeof (exception_name
) - 1] = '\0';
12304 /* For some reason, we were unable to read the exception
12305 name. This could happen if the Runtime was compiled
12306 without debugging info, for instance. In that case,
12307 just replace the exception name by the generic string
12308 "exception" - it will read as "an exception" in the
12309 notification we are about to print. */
12310 memcpy (exception_name
, "exception", sizeof ("exception"));
12312 /* In the case of unhandled exception breakpoints, we print
12313 the exception name as "unhandled EXCEPTION_NAME", to make
12314 it clearer to the user which kind of catchpoint just got
12315 hit. We used ui_out_text to make sure that this extra
12316 info does not pollute the exception name in the MI case. */
12317 if (c
->m_kind
== ada_catch_exception_unhandled
)
12318 uiout
->text ("unhandled ");
12319 uiout
->field_string ("exception-name", exception_name
);
12322 case ada_catch_assert
:
12323 /* In this case, the name of the exception is not really
12324 important. Just print "failed assertion" to make it clearer
12325 that his program just hit an assertion-failure catchpoint.
12326 We used ui_out_text because this info does not belong in
12328 uiout
->text ("failed assertion");
12332 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12333 if (exception_message
!= NULL
)
12335 uiout
->text (" (");
12336 uiout
->field_string ("exception-message", exception_message
.get ());
12340 uiout
->text (" at ");
12341 ada_find_printable_frame (get_current_frame ());
12343 return PRINT_SRC_AND_LOC
;
12346 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12347 for all exception catchpoint kinds. */
12350 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12352 struct ui_out
*uiout
= current_uiout
;
12353 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12354 struct value_print_options opts
;
12356 get_user_print_options (&opts
);
12358 if (opts
.addressprint
)
12359 uiout
->field_skip ("addr");
12361 annotate_field (5);
12364 case ada_catch_exception
:
12365 if (!c
->excep_string
.empty ())
12367 std::string msg
= string_printf (_("`%s' Ada exception"),
12368 c
->excep_string
.c_str ());
12370 uiout
->field_string ("what", msg
);
12373 uiout
->field_string ("what", "all Ada exceptions");
12377 case ada_catch_exception_unhandled
:
12378 uiout
->field_string ("what", "unhandled Ada exceptions");
12381 case ada_catch_handlers
:
12382 if (!c
->excep_string
.empty ())
12384 uiout
->field_fmt ("what",
12385 _("`%s' Ada exception handlers"),
12386 c
->excep_string
.c_str ());
12389 uiout
->field_string ("what", "all Ada exceptions handlers");
12392 case ada_catch_assert
:
12393 uiout
->field_string ("what", "failed Ada assertions");
12397 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12402 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12403 for all exception catchpoint kinds. */
12406 print_mention_exception (struct breakpoint
*b
)
12408 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12409 struct ui_out
*uiout
= current_uiout
;
12411 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12412 : _("Catchpoint "));
12413 uiout
->field_signed ("bkptno", b
->number
);
12414 uiout
->text (": ");
12418 case ada_catch_exception
:
12419 if (!c
->excep_string
.empty ())
12421 std::string info
= string_printf (_("`%s' Ada exception"),
12422 c
->excep_string
.c_str ());
12423 uiout
->text (info
.c_str ());
12426 uiout
->text (_("all Ada exceptions"));
12429 case ada_catch_exception_unhandled
:
12430 uiout
->text (_("unhandled Ada exceptions"));
12433 case ada_catch_handlers
:
12434 if (!c
->excep_string
.empty ())
12437 = string_printf (_("`%s' Ada exception handlers"),
12438 c
->excep_string
.c_str ());
12439 uiout
->text (info
.c_str ());
12442 uiout
->text (_("all Ada exceptions handlers"));
12445 case ada_catch_assert
:
12446 uiout
->text (_("failed Ada assertions"));
12450 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12455 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12456 for all exception catchpoint kinds. */
12459 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12461 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12465 case ada_catch_exception
:
12466 fprintf_filtered (fp
, "catch exception");
12467 if (!c
->excep_string
.empty ())
12468 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12471 case ada_catch_exception_unhandled
:
12472 fprintf_filtered (fp
, "catch exception unhandled");
12475 case ada_catch_handlers
:
12476 fprintf_filtered (fp
, "catch handlers");
12479 case ada_catch_assert
:
12480 fprintf_filtered (fp
, "catch assert");
12484 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12486 print_recreate_thread (b
, fp
);
12489 /* Virtual tables for various breakpoint types. */
12490 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12491 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12492 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12493 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12495 /* See ada-lang.h. */
12498 is_ada_exception_catchpoint (breakpoint
*bp
)
12500 return (bp
->ops
== &catch_exception_breakpoint_ops
12501 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12502 || bp
->ops
== &catch_assert_breakpoint_ops
12503 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12506 /* Split the arguments specified in a "catch exception" command.
12507 Set EX to the appropriate catchpoint type.
12508 Set EXCEP_STRING to the name of the specific exception if
12509 specified by the user.
12510 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12511 "catch handlers" command. False otherwise.
12512 If a condition is found at the end of the arguments, the condition
12513 expression is stored in COND_STRING (memory must be deallocated
12514 after use). Otherwise COND_STRING is set to NULL. */
12517 catch_ada_exception_command_split (const char *args
,
12518 bool is_catch_handlers_cmd
,
12519 enum ada_exception_catchpoint_kind
*ex
,
12520 std::string
*excep_string
,
12521 std::string
*cond_string
)
12523 std::string exception_name
;
12525 exception_name
= extract_arg (&args
);
12526 if (exception_name
== "if")
12528 /* This is not an exception name; this is the start of a condition
12529 expression for a catchpoint on all exceptions. So, "un-get"
12530 this token, and set exception_name to NULL. */
12531 exception_name
.clear ();
12535 /* Check to see if we have a condition. */
12537 args
= skip_spaces (args
);
12538 if (startswith (args
, "if")
12539 && (isspace (args
[2]) || args
[2] == '\0'))
12542 args
= skip_spaces (args
);
12544 if (args
[0] == '\0')
12545 error (_("Condition missing after `if' keyword"));
12546 *cond_string
= args
;
12548 args
+= strlen (args
);
12551 /* Check that we do not have any more arguments. Anything else
12554 if (args
[0] != '\0')
12555 error (_("Junk at end of expression"));
12557 if (is_catch_handlers_cmd
)
12559 /* Catch handling of exceptions. */
12560 *ex
= ada_catch_handlers
;
12561 *excep_string
= exception_name
;
12563 else if (exception_name
.empty ())
12565 /* Catch all exceptions. */
12566 *ex
= ada_catch_exception
;
12567 excep_string
->clear ();
12569 else if (exception_name
== "unhandled")
12571 /* Catch unhandled exceptions. */
12572 *ex
= ada_catch_exception_unhandled
;
12573 excep_string
->clear ();
12577 /* Catch a specific exception. */
12578 *ex
= ada_catch_exception
;
12579 *excep_string
= exception_name
;
12583 /* Return the name of the symbol on which we should break in order to
12584 implement a catchpoint of the EX kind. */
12586 static const char *
12587 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12589 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12591 gdb_assert (data
->exception_info
!= NULL
);
12595 case ada_catch_exception
:
12596 return (data
->exception_info
->catch_exception_sym
);
12598 case ada_catch_exception_unhandled
:
12599 return (data
->exception_info
->catch_exception_unhandled_sym
);
12601 case ada_catch_assert
:
12602 return (data
->exception_info
->catch_assert_sym
);
12604 case ada_catch_handlers
:
12605 return (data
->exception_info
->catch_handlers_sym
);
12608 internal_error (__FILE__
, __LINE__
,
12609 _("unexpected catchpoint kind (%d)"), ex
);
12613 /* Return the breakpoint ops "virtual table" used for catchpoints
12616 static const struct breakpoint_ops
*
12617 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12621 case ada_catch_exception
:
12622 return (&catch_exception_breakpoint_ops
);
12624 case ada_catch_exception_unhandled
:
12625 return (&catch_exception_unhandled_breakpoint_ops
);
12627 case ada_catch_assert
:
12628 return (&catch_assert_breakpoint_ops
);
12630 case ada_catch_handlers
:
12631 return (&catch_handlers_breakpoint_ops
);
12634 internal_error (__FILE__
, __LINE__
,
12635 _("unexpected catchpoint kind (%d)"), ex
);
12639 /* Return the condition that will be used to match the current exception
12640 being raised with the exception that the user wants to catch. This
12641 assumes that this condition is used when the inferior just triggered
12642 an exception catchpoint.
12643 EX: the type of catchpoints used for catching Ada exceptions. */
12646 ada_exception_catchpoint_cond_string (const char *excep_string
,
12647 enum ada_exception_catchpoint_kind ex
)
12650 bool is_standard_exc
= false;
12651 std::string result
;
12653 if (ex
== ada_catch_handlers
)
12655 /* For exception handlers catchpoints, the condition string does
12656 not use the same parameter as for the other exceptions. */
12657 result
= ("long_integer (GNAT_GCC_exception_Access"
12658 "(gcc_exception).all.occurrence.id)");
12661 result
= "long_integer (e)";
12663 /* The standard exceptions are a special case. They are defined in
12664 runtime units that have been compiled without debugging info; if
12665 EXCEP_STRING is the not-fully-qualified name of a standard
12666 exception (e.g. "constraint_error") then, during the evaluation
12667 of the condition expression, the symbol lookup on this name would
12668 *not* return this standard exception. The catchpoint condition
12669 may then be set only on user-defined exceptions which have the
12670 same not-fully-qualified name (e.g. my_package.constraint_error).
12672 To avoid this unexcepted behavior, these standard exceptions are
12673 systematically prefixed by "standard". This means that "catch
12674 exception constraint_error" is rewritten into "catch exception
12675 standard.constraint_error".
12677 If an exception named constraint_error is defined in another package of
12678 the inferior program, then the only way to specify this exception as a
12679 breakpoint condition is to use its fully-qualified named:
12680 e.g. my_package.constraint_error. */
12682 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12684 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12686 is_standard_exc
= true;
12693 if (is_standard_exc
)
12694 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12696 string_appendf (result
, "long_integer (&%s)", excep_string
);
12701 /* Return the symtab_and_line that should be used to insert an exception
12702 catchpoint of the TYPE kind.
12704 ADDR_STRING returns the name of the function where the real
12705 breakpoint that implements the catchpoints is set, depending on the
12706 type of catchpoint we need to create. */
12708 static struct symtab_and_line
12709 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12710 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12712 const char *sym_name
;
12713 struct symbol
*sym
;
12715 /* First, find out which exception support info to use. */
12716 ada_exception_support_info_sniffer ();
12718 /* Then lookup the function on which we will break in order to catch
12719 the Ada exceptions requested by the user. */
12720 sym_name
= ada_exception_sym_name (ex
);
12721 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12724 error (_("Catchpoint symbol not found: %s"), sym_name
);
12726 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12727 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12729 /* Set ADDR_STRING. */
12730 *addr_string
= sym_name
;
12733 *ops
= ada_exception_breakpoint_ops (ex
);
12735 return find_function_start_sal (sym
, 1);
12738 /* Create an Ada exception catchpoint.
12740 EX_KIND is the kind of exception catchpoint to be created.
12742 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12743 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12744 of the exception to which this catchpoint applies.
12746 COND_STRING, if not empty, is the catchpoint condition.
12748 TEMPFLAG, if nonzero, means that the underlying breakpoint
12749 should be temporary.
12751 FROM_TTY is the usual argument passed to all commands implementations. */
12754 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12755 enum ada_exception_catchpoint_kind ex_kind
,
12756 const std::string
&excep_string
,
12757 const std::string
&cond_string
,
12762 std::string addr_string
;
12763 const struct breakpoint_ops
*ops
= NULL
;
12764 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12766 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12767 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12768 ops
, tempflag
, disabled
, from_tty
);
12769 c
->excep_string
= excep_string
;
12770 create_excep_cond_exprs (c
.get (), ex_kind
);
12771 if (!cond_string
.empty ())
12772 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
, false);
12773 install_breakpoint (0, std::move (c
), 1);
12776 /* Implement the "catch exception" command. */
12779 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12780 struct cmd_list_element
*command
)
12782 const char *arg
= arg_entry
;
12783 struct gdbarch
*gdbarch
= get_current_arch ();
12785 enum ada_exception_catchpoint_kind ex_kind
;
12786 std::string excep_string
;
12787 std::string cond_string
;
12789 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12793 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12795 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12796 excep_string
, cond_string
,
12797 tempflag
, 1 /* enabled */,
12801 /* Implement the "catch handlers" command. */
12804 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12805 struct cmd_list_element
*command
)
12807 const char *arg
= arg_entry
;
12808 struct gdbarch
*gdbarch
= get_current_arch ();
12810 enum ada_exception_catchpoint_kind ex_kind
;
12811 std::string excep_string
;
12812 std::string cond_string
;
12814 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12818 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
12820 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12821 excep_string
, cond_string
,
12822 tempflag
, 1 /* enabled */,
12826 /* Completion function for the Ada "catch" commands. */
12829 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
12830 const char *text
, const char *word
)
12832 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
12834 for (const ada_exc_info
&info
: exceptions
)
12836 if (startswith (info
.name
, word
))
12837 tracker
.add_completion (make_unique_xstrdup (info
.name
));
12841 /* Split the arguments specified in a "catch assert" command.
12843 ARGS contains the command's arguments (or the empty string if
12844 no arguments were passed).
12846 If ARGS contains a condition, set COND_STRING to that condition
12847 (the memory needs to be deallocated after use). */
12850 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
12852 args
= skip_spaces (args
);
12854 /* Check whether a condition was provided. */
12855 if (startswith (args
, "if")
12856 && (isspace (args
[2]) || args
[2] == '\0'))
12859 args
= skip_spaces (args
);
12860 if (args
[0] == '\0')
12861 error (_("condition missing after `if' keyword"));
12862 cond_string
.assign (args
);
12865 /* Otherwise, there should be no other argument at the end of
12867 else if (args
[0] != '\0')
12868 error (_("Junk at end of arguments."));
12871 /* Implement the "catch assert" command. */
12874 catch_assert_command (const char *arg_entry
, int from_tty
,
12875 struct cmd_list_element
*command
)
12877 const char *arg
= arg_entry
;
12878 struct gdbarch
*gdbarch
= get_current_arch ();
12880 std::string cond_string
;
12882 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12886 catch_ada_assert_command_split (arg
, cond_string
);
12887 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12889 tempflag
, 1 /* enabled */,
12893 /* Return non-zero if the symbol SYM is an Ada exception object. */
12896 ada_is_exception_sym (struct symbol
*sym
)
12898 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
12900 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12901 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12902 && SYMBOL_CLASS (sym
) != LOC_CONST
12903 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12904 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12907 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12908 Ada exception object. This matches all exceptions except the ones
12909 defined by the Ada language. */
12912 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12916 if (!ada_is_exception_sym (sym
))
12919 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12920 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
12921 return 0; /* A standard exception. */
12923 /* Numeric_Error is also a standard exception, so exclude it.
12924 See the STANDARD_EXC description for more details as to why
12925 this exception is not listed in that array. */
12926 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
12932 /* A helper function for std::sort, comparing two struct ada_exc_info
12935 The comparison is determined first by exception name, and then
12936 by exception address. */
12939 ada_exc_info::operator< (const ada_exc_info
&other
) const
12943 result
= strcmp (name
, other
.name
);
12946 if (result
== 0 && addr
< other
.addr
)
12952 ada_exc_info::operator== (const ada_exc_info
&other
) const
12954 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
12957 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12958 routine, but keeping the first SKIP elements untouched.
12960 All duplicates are also removed. */
12963 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
12966 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
12967 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
12968 exceptions
->end ());
12971 /* Add all exceptions defined by the Ada standard whose name match
12972 a regular expression.
12974 If PREG is not NULL, then this regexp_t object is used to
12975 perform the symbol name matching. Otherwise, no name-based
12976 filtering is performed.
12978 EXCEPTIONS is a vector of exceptions to which matching exceptions
12982 ada_add_standard_exceptions (compiled_regex
*preg
,
12983 std::vector
<ada_exc_info
> *exceptions
)
12987 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12990 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
12992 struct bound_minimal_symbol msymbol
12993 = ada_lookup_simple_minsym (standard_exc
[i
]);
12995 if (msymbol
.minsym
!= NULL
)
12997 struct ada_exc_info info
12998 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13000 exceptions
->push_back (info
);
13006 /* Add all Ada exceptions defined locally and accessible from the given
13009 If PREG is not NULL, then this regexp_t object is used to
13010 perform the symbol name matching. Otherwise, no name-based
13011 filtering is performed.
13013 EXCEPTIONS is a vector of exceptions to which matching exceptions
13017 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13018 struct frame_info
*frame
,
13019 std::vector
<ada_exc_info
> *exceptions
)
13021 const struct block
*block
= get_frame_block (frame
, 0);
13025 struct block_iterator iter
;
13026 struct symbol
*sym
;
13028 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13030 switch (SYMBOL_CLASS (sym
))
13037 if (ada_is_exception_sym (sym
))
13039 struct ada_exc_info info
= {sym
->print_name (),
13040 SYMBOL_VALUE_ADDRESS (sym
)};
13042 exceptions
->push_back (info
);
13046 if (BLOCK_FUNCTION (block
) != NULL
)
13048 block
= BLOCK_SUPERBLOCK (block
);
13052 /* Return true if NAME matches PREG or if PREG is NULL. */
13055 name_matches_regex (const char *name
, compiled_regex
*preg
)
13057 return (preg
== NULL
13058 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13061 /* Add all exceptions defined globally whose name name match
13062 a regular expression, excluding standard exceptions.
13064 The reason we exclude standard exceptions is that they need
13065 to be handled separately: Standard exceptions are defined inside
13066 a runtime unit which is normally not compiled with debugging info,
13067 and thus usually do not show up in our symbol search. However,
13068 if the unit was in fact built with debugging info, we need to
13069 exclude them because they would duplicate the entry we found
13070 during the special loop that specifically searches for those
13071 standard exceptions.
13073 If PREG is not NULL, then this regexp_t object is used to
13074 perform the symbol name matching. Otherwise, no name-based
13075 filtering is performed.
13077 EXCEPTIONS is a vector of exceptions to which matching exceptions
13081 ada_add_global_exceptions (compiled_regex
*preg
,
13082 std::vector
<ada_exc_info
> *exceptions
)
13084 /* In Ada, the symbol "search name" is a linkage name, whereas the
13085 regular expression used to do the matching refers to the natural
13086 name. So match against the decoded name. */
13087 expand_symtabs_matching (NULL
,
13088 lookup_name_info::match_any (),
13089 [&] (const char *search_name
)
13091 std::string decoded
= ada_decode (search_name
);
13092 return name_matches_regex (decoded
.c_str (), preg
);
13097 for (objfile
*objfile
: current_program_space
->objfiles ())
13099 for (compunit_symtab
*s
: objfile
->compunits ())
13101 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13104 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13106 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13107 struct block_iterator iter
;
13108 struct symbol
*sym
;
13110 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13111 if (ada_is_non_standard_exception_sym (sym
)
13112 && name_matches_regex (sym
->natural_name (), preg
))
13114 struct ada_exc_info info
13115 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13117 exceptions
->push_back (info
);
13124 /* Implements ada_exceptions_list with the regular expression passed
13125 as a regex_t, rather than a string.
13127 If not NULL, PREG is used to filter out exceptions whose names
13128 do not match. Otherwise, all exceptions are listed. */
13130 static std::vector
<ada_exc_info
>
13131 ada_exceptions_list_1 (compiled_regex
*preg
)
13133 std::vector
<ada_exc_info
> result
;
13136 /* First, list the known standard exceptions. These exceptions
13137 need to be handled separately, as they are usually defined in
13138 runtime units that have been compiled without debugging info. */
13140 ada_add_standard_exceptions (preg
, &result
);
13142 /* Next, find all exceptions whose scope is local and accessible
13143 from the currently selected frame. */
13145 if (has_stack_frames ())
13147 prev_len
= result
.size ();
13148 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13150 if (result
.size () > prev_len
)
13151 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13154 /* Add all exceptions whose scope is global. */
13156 prev_len
= result
.size ();
13157 ada_add_global_exceptions (preg
, &result
);
13158 if (result
.size () > prev_len
)
13159 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13164 /* Return a vector of ada_exc_info.
13166 If REGEXP is NULL, all exceptions are included in the result.
13167 Otherwise, it should contain a valid regular expression,
13168 and only the exceptions whose names match that regular expression
13169 are included in the result.
13171 The exceptions are sorted in the following order:
13172 - Standard exceptions (defined by the Ada language), in
13173 alphabetical order;
13174 - Exceptions only visible from the current frame, in
13175 alphabetical order;
13176 - Exceptions whose scope is global, in alphabetical order. */
13178 std::vector
<ada_exc_info
>
13179 ada_exceptions_list (const char *regexp
)
13181 if (regexp
== NULL
)
13182 return ada_exceptions_list_1 (NULL
);
13184 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13185 return ada_exceptions_list_1 (®
);
13188 /* Implement the "info exceptions" command. */
13191 info_exceptions_command (const char *regexp
, int from_tty
)
13193 struct gdbarch
*gdbarch
= get_current_arch ();
13195 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13197 if (regexp
!= NULL
)
13199 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13201 printf_filtered (_("All defined Ada exceptions:\n"));
13203 for (const ada_exc_info
&info
: exceptions
)
13204 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13208 /* Information about operators given special treatment in functions
13210 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13212 #define ADA_OPERATORS \
13213 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13214 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13215 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13216 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13217 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13218 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13219 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13220 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13221 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13222 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13223 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13224 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13225 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13226 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13227 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13228 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13229 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13230 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13231 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13234 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13237 switch (exp
->elts
[pc
- 1].opcode
)
13240 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13243 #define OP_DEFN(op, len, args, binop) \
13244 case op: *oplenp = len; *argsp = args; break;
13250 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13255 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13260 /* Implementation of the exp_descriptor method operator_check. */
13263 ada_operator_check (struct expression
*exp
, int pos
,
13264 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13267 const union exp_element
*const elts
= exp
->elts
;
13268 struct type
*type
= NULL
;
13270 switch (elts
[pos
].opcode
)
13272 case UNOP_IN_RANGE
:
13274 type
= elts
[pos
+ 1].type
;
13278 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13281 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13283 if (type
&& TYPE_OBJFILE (type
)
13284 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13290 static const char *
13291 ada_op_name (enum exp_opcode opcode
)
13296 return op_name_standard (opcode
);
13298 #define OP_DEFN(op, len, args, binop) case op: return #op;
13303 return "OP_AGGREGATE";
13305 return "OP_CHOICES";
13311 /* As for operator_length, but assumes PC is pointing at the first
13312 element of the operator, and gives meaningful results only for the
13313 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13316 ada_forward_operator_length (struct expression
*exp
, int pc
,
13317 int *oplenp
, int *argsp
)
13319 switch (exp
->elts
[pc
].opcode
)
13322 *oplenp
= *argsp
= 0;
13325 #define OP_DEFN(op, len, args, binop) \
13326 case op: *oplenp = len; *argsp = args; break;
13332 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13337 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13343 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13345 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13353 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13355 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13360 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13364 /* Ada attributes ('Foo). */
13367 case OP_ATR_LENGTH
:
13371 case OP_ATR_MODULUS
:
13378 case UNOP_IN_RANGE
:
13380 /* XXX: gdb_sprint_host_address, type_sprint */
13381 fprintf_filtered (stream
, _("Type @"));
13382 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13383 fprintf_filtered (stream
, " (");
13384 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13385 fprintf_filtered (stream
, ")");
13387 case BINOP_IN_BOUNDS
:
13388 fprintf_filtered (stream
, " (%d)",
13389 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13391 case TERNOP_IN_RANGE
:
13396 case OP_DISCRETE_RANGE
:
13397 case OP_POSITIONAL
:
13404 char *name
= &exp
->elts
[elt
+ 2].string
;
13405 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13407 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13412 return dump_subexp_body_standard (exp
, stream
, elt
);
13416 for (i
= 0; i
< nargs
; i
+= 1)
13417 elt
= dump_subexp (exp
, stream
, elt
);
13422 /* The Ada extension of print_subexp (q.v.). */
13425 ada_print_subexp (struct expression
*exp
, int *pos
,
13426 struct ui_file
*stream
, enum precedence prec
)
13428 int oplen
, nargs
, i
;
13430 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13432 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13439 print_subexp_standard (exp
, pos
, stream
, prec
);
13443 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13446 case BINOP_IN_BOUNDS
:
13447 /* XXX: sprint_subexp */
13448 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13449 fputs_filtered (" in ", stream
);
13450 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13451 fputs_filtered ("'range", stream
);
13452 if (exp
->elts
[pc
+ 1].longconst
> 1)
13453 fprintf_filtered (stream
, "(%ld)",
13454 (long) exp
->elts
[pc
+ 1].longconst
);
13457 case TERNOP_IN_RANGE
:
13458 if (prec
>= PREC_EQUAL
)
13459 fputs_filtered ("(", stream
);
13460 /* XXX: sprint_subexp */
13461 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13462 fputs_filtered (" in ", stream
);
13463 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13464 fputs_filtered (" .. ", stream
);
13465 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13466 if (prec
>= PREC_EQUAL
)
13467 fputs_filtered (")", stream
);
13472 case OP_ATR_LENGTH
:
13476 case OP_ATR_MODULUS
:
13481 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13483 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13484 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13485 &type_print_raw_options
);
13489 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13490 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13495 for (tem
= 1; tem
< nargs
; tem
+= 1)
13497 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13498 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13500 fputs_filtered (")", stream
);
13505 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13506 fputs_filtered ("'(", stream
);
13507 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13508 fputs_filtered (")", stream
);
13511 case UNOP_IN_RANGE
:
13512 /* XXX: sprint_subexp */
13513 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13514 fputs_filtered (" in ", stream
);
13515 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13516 &type_print_raw_options
);
13519 case OP_DISCRETE_RANGE
:
13520 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13521 fputs_filtered ("..", stream
);
13522 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13526 fputs_filtered ("others => ", stream
);
13527 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13531 for (i
= 0; i
< nargs
-1; i
+= 1)
13534 fputs_filtered ("|", stream
);
13535 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13537 fputs_filtered (" => ", stream
);
13538 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13541 case OP_POSITIONAL
:
13542 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13546 fputs_filtered ("(", stream
);
13547 for (i
= 0; i
< nargs
; i
+= 1)
13550 fputs_filtered (", ", stream
);
13551 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13553 fputs_filtered (")", stream
);
13558 /* Table mapping opcodes into strings for printing operators
13559 and precedences of the operators. */
13561 static const struct op_print ada_op_print_tab
[] = {
13562 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13563 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13564 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13565 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13566 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13567 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13568 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13569 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13570 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13571 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13572 {">", BINOP_GTR
, PREC_ORDER
, 0},
13573 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13574 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13575 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13576 {"+", BINOP_ADD
, PREC_ADD
, 0},
13577 {"-", BINOP_SUB
, PREC_ADD
, 0},
13578 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13579 {"*", BINOP_MUL
, PREC_MUL
, 0},
13580 {"/", BINOP_DIV
, PREC_MUL
, 0},
13581 {"rem", BINOP_REM
, PREC_MUL
, 0},
13582 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13583 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13584 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13585 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13586 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13587 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13588 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13589 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13590 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13591 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13592 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13593 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13596 enum ada_primitive_types
{
13597 ada_primitive_type_int
,
13598 ada_primitive_type_long
,
13599 ada_primitive_type_short
,
13600 ada_primitive_type_char
,
13601 ada_primitive_type_float
,
13602 ada_primitive_type_double
,
13603 ada_primitive_type_void
,
13604 ada_primitive_type_long_long
,
13605 ada_primitive_type_long_double
,
13606 ada_primitive_type_natural
,
13607 ada_primitive_type_positive
,
13608 ada_primitive_type_system_address
,
13609 ada_primitive_type_storage_offset
,
13610 nr_ada_primitive_types
13614 /* Language vector */
13616 static const struct exp_descriptor ada_exp_descriptor
= {
13618 ada_operator_length
,
13619 ada_operator_check
,
13621 ada_dump_subexp_body
,
13622 ada_evaluate_subexp
13625 /* symbol_name_matcher_ftype adapter for wild_match. */
13628 do_wild_match (const char *symbol_search_name
,
13629 const lookup_name_info
&lookup_name
,
13630 completion_match_result
*comp_match_res
)
13632 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13635 /* symbol_name_matcher_ftype adapter for full_match. */
13638 do_full_match (const char *symbol_search_name
,
13639 const lookup_name_info
&lookup_name
,
13640 completion_match_result
*comp_match_res
)
13642 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13645 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13648 do_exact_match (const char *symbol_search_name
,
13649 const lookup_name_info
&lookup_name
,
13650 completion_match_result
*comp_match_res
)
13652 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13655 /* Build the Ada lookup name for LOOKUP_NAME. */
13657 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13659 gdb::string_view user_name
= lookup_name
.name ();
13661 if (user_name
[0] == '<')
13663 if (user_name
.back () == '>')
13665 = gdb::to_string (user_name
.substr (1, user_name
.size () - 2));
13668 = gdb::to_string (user_name
.substr (1, user_name
.size () - 1));
13669 m_encoded_p
= true;
13670 m_verbatim_p
= true;
13671 m_wild_match_p
= false;
13672 m_standard_p
= false;
13676 m_verbatim_p
= false;
13678 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13682 const char *folded
= ada_fold_name (user_name
);
13683 m_encoded_name
= ada_encode_1 (folded
, false);
13684 if (m_encoded_name
.empty ())
13685 m_encoded_name
= gdb::to_string (user_name
);
13688 m_encoded_name
= gdb::to_string (user_name
);
13690 /* Handle the 'package Standard' special case. See description
13691 of m_standard_p. */
13692 if (startswith (m_encoded_name
.c_str (), "standard__"))
13694 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13695 m_standard_p
= true;
13698 m_standard_p
= false;
13700 /* If the name contains a ".", then the user is entering a fully
13701 qualified entity name, and the match must not be done in wild
13702 mode. Similarly, if the user wants to complete what looks
13703 like an encoded name, the match must not be done in wild
13704 mode. Also, in the standard__ special case always do
13705 non-wild matching. */
13707 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13710 && user_name
.find ('.') == std::string::npos
);
13714 /* symbol_name_matcher_ftype method for Ada. This only handles
13715 completion mode. */
13718 ada_symbol_name_matches (const char *symbol_search_name
,
13719 const lookup_name_info
&lookup_name
,
13720 completion_match_result
*comp_match_res
)
13722 return lookup_name
.ada ().matches (symbol_search_name
,
13723 lookup_name
.match_type (),
13727 /* A name matcher that matches the symbol name exactly, with
13731 literal_symbol_name_matcher (const char *symbol_search_name
,
13732 const lookup_name_info
&lookup_name
,
13733 completion_match_result
*comp_match_res
)
13735 gdb::string_view name_view
= lookup_name
.name ();
13737 if (lookup_name
.completion_mode ()
13738 ? (strncmp (symbol_search_name
, name_view
.data (),
13739 name_view
.size ()) == 0)
13740 : symbol_search_name
== name_view
)
13742 if (comp_match_res
!= NULL
)
13743 comp_match_res
->set_match (symbol_search_name
);
13750 /* Implement the "get_symbol_name_matcher" language_defn method for
13753 static symbol_name_matcher_ftype
*
13754 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
13756 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
13757 return literal_symbol_name_matcher
;
13759 if (lookup_name
.completion_mode ())
13760 return ada_symbol_name_matches
;
13763 if (lookup_name
.ada ().wild_match_p ())
13764 return do_wild_match
;
13765 else if (lookup_name
.ada ().verbatim_p ())
13766 return do_exact_match
;
13768 return do_full_match
;
13772 /* Class representing the Ada language. */
13774 class ada_language
: public language_defn
13778 : language_defn (language_ada
)
13781 /* See language.h. */
13783 const char *name () const override
13786 /* See language.h. */
13788 const char *natural_name () const override
13791 /* See language.h. */
13793 const std::vector
<const char *> &filename_extensions () const override
13795 static const std::vector
<const char *> extensions
13796 = { ".adb", ".ads", ".a", ".ada", ".dg" };
13800 /* Print an array element index using the Ada syntax. */
13802 void print_array_index (struct type
*index_type
,
13804 struct ui_file
*stream
,
13805 const value_print_options
*options
) const override
13807 struct value
*index_value
= val_atr (index_type
, index
);
13809 value_print (index_value
, stream
, options
);
13810 fprintf_filtered (stream
, " => ");
13813 /* Implement the "read_var_value" language_defn method for Ada. */
13815 struct value
*read_var_value (struct symbol
*var
,
13816 const struct block
*var_block
,
13817 struct frame_info
*frame
) const override
13819 /* The only case where default_read_var_value is not sufficient
13820 is when VAR is a renaming... */
13821 if (frame
!= nullptr)
13823 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
13824 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
13825 return ada_read_renaming_var_value (var
, frame_block
);
13828 /* This is a typical case where we expect the default_read_var_value
13829 function to work. */
13830 return language_defn::read_var_value (var
, var_block
, frame
);
13833 /* See language.h. */
13834 void language_arch_info (struct gdbarch
*gdbarch
,
13835 struct language_arch_info
*lai
) const override
13837 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13839 lai
->primitive_type_vector
13840 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13843 lai
->primitive_type_vector
[ada_primitive_type_int
]
13844 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13846 lai
->primitive_type_vector
[ada_primitive_type_long
]
13847 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13848 0, "long_integer");
13849 lai
->primitive_type_vector
[ada_primitive_type_short
]
13850 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13851 0, "short_integer");
13852 lai
->string_char_type
13853 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13854 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13855 lai
->primitive_type_vector
[ada_primitive_type_float
]
13856 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13857 "float", gdbarch_float_format (gdbarch
));
13858 lai
->primitive_type_vector
[ada_primitive_type_double
]
13859 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13860 "long_float", gdbarch_double_format (gdbarch
));
13861 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13862 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13863 0, "long_long_integer");
13864 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13865 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13866 "long_long_float", gdbarch_long_double_format (gdbarch
));
13867 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13868 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13870 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13871 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13873 lai
->primitive_type_vector
[ada_primitive_type_void
]
13874 = builtin
->builtin_void
;
13876 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13877 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13879 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13880 ->set_name ("system__address");
13882 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13883 type. This is a signed integral type whose size is the same as
13884 the size of addresses. */
13886 unsigned int addr_length
= TYPE_LENGTH
13887 (lai
->primitive_type_vector
[ada_primitive_type_system_address
]);
13889 lai
->primitive_type_vector
[ada_primitive_type_storage_offset
]
13890 = arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13894 lai
->bool_type_symbol
= NULL
;
13895 lai
->bool_type_default
= builtin
->builtin_bool
;
13898 /* See language.h. */
13900 bool iterate_over_symbols
13901 (const struct block
*block
, const lookup_name_info
&name
,
13902 domain_enum domain
,
13903 gdb::function_view
<symbol_found_callback_ftype
> callback
) const override
13905 std::vector
<struct block_symbol
> results
;
13907 ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
13908 for (block_symbol
&sym
: results
)
13910 if (!callback (&sym
))
13917 /* See language.h. */
13918 bool sniff_from_mangled_name (const char *mangled
,
13919 char **out
) const override
13921 std::string demangled
= ada_decode (mangled
);
13925 if (demangled
!= mangled
&& demangled
[0] != '<')
13927 /* Set the gsymbol language to Ada, but still return 0.
13928 Two reasons for that:
13930 1. For Ada, we prefer computing the symbol's decoded name
13931 on the fly rather than pre-compute it, in order to save
13932 memory (Ada projects are typically very large).
13934 2. There are some areas in the definition of the GNAT
13935 encoding where, with a bit of bad luck, we might be able
13936 to decode a non-Ada symbol, generating an incorrect
13937 demangled name (Eg: names ending with "TB" for instance
13938 are identified as task bodies and so stripped from
13939 the decoded name returned).
13941 Returning true, here, but not setting *DEMANGLED, helps us get
13942 a little bit of the best of both worlds. Because we're last,
13943 we should not affect any of the other languages that were
13944 able to demangle the symbol before us; we get to correctly
13945 tag Ada symbols as such; and even if we incorrectly tagged a
13946 non-Ada symbol, which should be rare, any routing through the
13947 Ada language should be transparent (Ada tries to behave much
13948 like C/C++ with non-Ada symbols). */
13955 /* See language.h. */
13957 char *demangle_symbol (const char *mangled
, int options
) const override
13959 return ada_la_decode (mangled
, options
);
13962 /* See language.h. */
13964 void print_type (struct type
*type
, const char *varstring
,
13965 struct ui_file
*stream
, int show
, int level
,
13966 const struct type_print_options
*flags
) const override
13968 ada_print_type (type
, varstring
, stream
, show
, level
, flags
);
13971 /* See language.h. */
13973 const char *word_break_characters (void) const override
13975 return ada_completer_word_break_characters
;
13978 /* See language.h. */
13980 void collect_symbol_completion_matches (completion_tracker
&tracker
,
13981 complete_symbol_mode mode
,
13982 symbol_name_match_type name_match_type
,
13983 const char *text
, const char *word
,
13984 enum type_code code
) const override
13986 struct symbol
*sym
;
13987 const struct block
*b
, *surrounding_static_block
= 0;
13988 struct block_iterator iter
;
13990 gdb_assert (code
== TYPE_CODE_UNDEF
);
13992 lookup_name_info
lookup_name (text
, name_match_type
, true);
13994 /* First, look at the partial symtab symbols. */
13995 expand_symtabs_matching (NULL
,
14001 /* At this point scan through the misc symbol vectors and add each
14002 symbol you find to the list. Eventually we want to ignore
14003 anything that isn't a text symbol (everything else will be
14004 handled by the psymtab code above). */
14006 for (objfile
*objfile
: current_program_space
->objfiles ())
14008 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
14012 if (completion_skip_symbol (mode
, msymbol
))
14015 language symbol_language
= msymbol
->language ();
14017 /* Ada minimal symbols won't have their language set to Ada. If
14018 we let completion_list_add_name compare using the
14019 default/C-like matcher, then when completing e.g., symbols in a
14020 package named "pck", we'd match internal Ada symbols like
14021 "pckS", which are invalid in an Ada expression, unless you wrap
14022 them in '<' '>' to request a verbatim match.
14024 Unfortunately, some Ada encoded names successfully demangle as
14025 C++ symbols (using an old mangling scheme), such as "name__2Xn"
14026 -> "Xn::name(void)" and thus some Ada minimal symbols end up
14027 with the wrong language set. Paper over that issue here. */
14028 if (symbol_language
== language_auto
14029 || symbol_language
== language_cplus
)
14030 symbol_language
= language_ada
;
14032 completion_list_add_name (tracker
,
14034 msymbol
->linkage_name (),
14035 lookup_name
, text
, word
);
14039 /* Search upwards from currently selected frame (so that we can
14040 complete on local vars. */
14042 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
14044 if (!BLOCK_SUPERBLOCK (b
))
14045 surrounding_static_block
= b
; /* For elmin of dups */
14047 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14049 if (completion_skip_symbol (mode
, sym
))
14052 completion_list_add_name (tracker
,
14054 sym
->linkage_name (),
14055 lookup_name
, text
, word
);
14059 /* Go through the symtabs and check the externs and statics for
14060 symbols which match. */
14062 for (objfile
*objfile
: current_program_space
->objfiles ())
14064 for (compunit_symtab
*s
: objfile
->compunits ())
14067 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
14068 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14070 if (completion_skip_symbol (mode
, sym
))
14073 completion_list_add_name (tracker
,
14075 sym
->linkage_name (),
14076 lookup_name
, text
, word
);
14081 for (objfile
*objfile
: current_program_space
->objfiles ())
14083 for (compunit_symtab
*s
: objfile
->compunits ())
14086 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
14087 /* Don't do this block twice. */
14088 if (b
== surrounding_static_block
)
14090 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
14092 if (completion_skip_symbol (mode
, sym
))
14095 completion_list_add_name (tracker
,
14097 sym
->linkage_name (),
14098 lookup_name
, text
, word
);
14104 /* See language.h. */
14106 gdb::unique_xmalloc_ptr
<char> watch_location_expression
14107 (struct type
*type
, CORE_ADDR addr
) const override
14109 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
14110 std::string name
= type_to_string (type
);
14111 return gdb::unique_xmalloc_ptr
<char>
14112 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
14115 /* See language.h. */
14117 void value_print (struct value
*val
, struct ui_file
*stream
,
14118 const struct value_print_options
*options
) const override
14120 return ada_value_print (val
, stream
, options
);
14123 /* See language.h. */
14125 void value_print_inner
14126 (struct value
*val
, struct ui_file
*stream
, int recurse
,
14127 const struct value_print_options
*options
) const override
14129 return ada_value_print_inner (val
, stream
, recurse
, options
);
14132 /* See language.h. */
14134 struct block_symbol lookup_symbol_nonlocal
14135 (const char *name
, const struct block
*block
,
14136 const domain_enum domain
) const override
14138 struct block_symbol sym
;
14140 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
14141 if (sym
.symbol
!= NULL
)
14144 /* If we haven't found a match at this point, try the primitive
14145 types. In other languages, this search is performed before
14146 searching for global symbols in order to short-circuit that
14147 global-symbol search if it happens that the name corresponds
14148 to a primitive type. But we cannot do the same in Ada, because
14149 it is perfectly legitimate for a program to declare a type which
14150 has the same name as a standard type. If looking up a type in
14151 that situation, we have traditionally ignored the primitive type
14152 in favor of user-defined types. This is why, unlike most other
14153 languages, we search the primitive types this late and only after
14154 having searched the global symbols without success. */
14156 if (domain
== VAR_DOMAIN
)
14158 struct gdbarch
*gdbarch
;
14161 gdbarch
= target_gdbarch ();
14163 gdbarch
= block_gdbarch (block
);
14165 = language_lookup_primitive_type_as_symbol (this, gdbarch
, name
);
14166 if (sym
.symbol
!= NULL
)
14173 /* See language.h. */
14175 int parser (struct parser_state
*ps
) const override
14177 warnings_issued
= 0;
14178 return ada_parse (ps
);
14183 Same as evaluate_type (*EXP), but resolves ambiguous symbol references
14184 (marked by OP_VAR_VALUE nodes in which the symbol has an undefined
14185 namespace) and converts operators that are user-defined into
14186 appropriate function calls. If CONTEXT_TYPE is non-null, it provides
14187 a preferred result type [at the moment, only type void has any
14188 effect---causing procedures to be preferred over functions in calls].
14189 A null CONTEXT_TYPE indicates that a non-void return type is
14190 preferred. May change (expand) *EXP. */
14192 void post_parser (expression_up
*expp
, int void_context_p
, int completing
,
14193 innermost_block_tracker
*tracker
) const override
14195 struct type
*context_type
= NULL
;
14198 if (void_context_p
)
14199 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
14201 resolve_subexp (expp
, &pc
, 1, context_type
, completing
, tracker
);
14204 /* See language.h. */
14206 void emitchar (int ch
, struct type
*chtype
,
14207 struct ui_file
*stream
, int quoter
) const override
14209 ada_emit_char (ch
, chtype
, stream
, quoter
, 1);
14212 /* See language.h. */
14214 void printchar (int ch
, struct type
*chtype
,
14215 struct ui_file
*stream
) const override
14217 ada_printchar (ch
, chtype
, stream
);
14220 /* See language.h. */
14222 void printstr (struct ui_file
*stream
, struct type
*elttype
,
14223 const gdb_byte
*string
, unsigned int length
,
14224 const char *encoding
, int force_ellipses
,
14225 const struct value_print_options
*options
) const override
14227 ada_printstr (stream
, elttype
, string
, length
, encoding
,
14228 force_ellipses
, options
);
14231 /* See language.h. */
14233 void print_typedef (struct type
*type
, struct symbol
*new_symbol
,
14234 struct ui_file
*stream
) const override
14236 ada_print_typedef (type
, new_symbol
, stream
);
14239 /* See language.h. */
14241 bool is_string_type_p (struct type
*type
) const override
14243 return ada_is_string_type (type
);
14246 /* See language.h. */
14248 const char *struct_too_deep_ellipsis () const override
14249 { return "(...)"; }
14251 /* See language.h. */
14253 bool c_style_arrays_p () const override
14256 /* See language.h. */
14258 bool store_sym_names_in_linkage_form_p () const override
14261 /* See language.h. */
14263 const struct lang_varobj_ops
*varobj_ops () const override
14264 { return &ada_varobj_ops
; }
14266 /* See language.h. */
14268 const struct exp_descriptor
*expression_ops () const override
14269 { return &ada_exp_descriptor
; }
14271 /* See language.h. */
14273 const struct op_print
*opcode_print_table () const override
14274 { return ada_op_print_tab
; }
14277 /* See language.h. */
14279 symbol_name_matcher_ftype
*get_symbol_name_matcher_inner
14280 (const lookup_name_info
&lookup_name
) const override
14282 return ada_get_symbol_name_matcher (lookup_name
);
14286 /* Single instance of the Ada language class. */
14288 static ada_language ada_language_defn
;
14290 /* Command-list for the "set/show ada" prefix command. */
14291 static struct cmd_list_element
*set_ada_list
;
14292 static struct cmd_list_element
*show_ada_list
;
14295 initialize_ada_catchpoint_ops (void)
14297 struct breakpoint_ops
*ops
;
14299 initialize_breakpoint_ops ();
14301 ops
= &catch_exception_breakpoint_ops
;
14302 *ops
= bkpt_breakpoint_ops
;
14303 ops
->allocate_location
= allocate_location_exception
;
14304 ops
->re_set
= re_set_exception
;
14305 ops
->check_status
= check_status_exception
;
14306 ops
->print_it
= print_it_exception
;
14307 ops
->print_one
= print_one_exception
;
14308 ops
->print_mention
= print_mention_exception
;
14309 ops
->print_recreate
= print_recreate_exception
;
14311 ops
= &catch_exception_unhandled_breakpoint_ops
;
14312 *ops
= bkpt_breakpoint_ops
;
14313 ops
->allocate_location
= allocate_location_exception
;
14314 ops
->re_set
= re_set_exception
;
14315 ops
->check_status
= check_status_exception
;
14316 ops
->print_it
= print_it_exception
;
14317 ops
->print_one
= print_one_exception
;
14318 ops
->print_mention
= print_mention_exception
;
14319 ops
->print_recreate
= print_recreate_exception
;
14321 ops
= &catch_assert_breakpoint_ops
;
14322 *ops
= bkpt_breakpoint_ops
;
14323 ops
->allocate_location
= allocate_location_exception
;
14324 ops
->re_set
= re_set_exception
;
14325 ops
->check_status
= check_status_exception
;
14326 ops
->print_it
= print_it_exception
;
14327 ops
->print_one
= print_one_exception
;
14328 ops
->print_mention
= print_mention_exception
;
14329 ops
->print_recreate
= print_recreate_exception
;
14331 ops
= &catch_handlers_breakpoint_ops
;
14332 *ops
= bkpt_breakpoint_ops
;
14333 ops
->allocate_location
= allocate_location_exception
;
14334 ops
->re_set
= re_set_exception
;
14335 ops
->check_status
= check_status_exception
;
14336 ops
->print_it
= print_it_exception
;
14337 ops
->print_one
= print_one_exception
;
14338 ops
->print_mention
= print_mention_exception
;
14339 ops
->print_recreate
= print_recreate_exception
;
14342 /* This module's 'new_objfile' observer. */
14345 ada_new_objfile_observer (struct objfile
*objfile
)
14347 ada_clear_symbol_cache ();
14350 /* This module's 'free_objfile' observer. */
14353 ada_free_objfile_observer (struct objfile
*objfile
)
14355 ada_clear_symbol_cache ();
14358 void _initialize_ada_language ();
14360 _initialize_ada_language ()
14362 initialize_ada_catchpoint_ops ();
14364 add_basic_prefix_cmd ("ada", no_class
,
14365 _("Prefix command for changing Ada-specific settings."),
14366 &set_ada_list
, "set ada ", 0, &setlist
);
14368 add_show_prefix_cmd ("ada", no_class
,
14369 _("Generic command for showing Ada-specific settings."),
14370 &show_ada_list
, "show ada ", 0, &showlist
);
14372 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14373 &trust_pad_over_xvs
, _("\
14374 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14375 Show whether an optimization trusting PAD types over XVS types is activated."),
14377 This is related to the encoding used by the GNAT compiler. The debugger\n\
14378 should normally trust the contents of PAD types, but certain older versions\n\
14379 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14380 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14381 work around this bug. It is always safe to turn this option \"off\", but\n\
14382 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14383 this option to \"off\" unless necessary."),
14384 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14386 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14387 &print_signatures
, _("\
14388 Enable or disable the output of formal and return types for functions in the \
14389 overloads selection menu."), _("\
14390 Show whether the output of formal and return types for functions in the \
14391 overloads selection menu is activated."),
14392 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14394 add_catch_command ("exception", _("\
14395 Catch Ada exceptions, when raised.\n\
14396 Usage: catch exception [ARG] [if CONDITION]\n\
14397 Without any argument, stop when any Ada exception is raised.\n\
14398 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14399 being raised does not have a handler (and will therefore lead to the task's\n\
14401 Otherwise, the catchpoint only stops when the name of the exception being\n\
14402 raised is the same as ARG.\n\
14403 CONDITION is a boolean expression that is evaluated to see whether the\n\
14404 exception should cause a stop."),
14405 catch_ada_exception_command
,
14406 catch_ada_completer
,
14410 add_catch_command ("handlers", _("\
14411 Catch Ada exceptions, when handled.\n\
14412 Usage: catch handlers [ARG] [if CONDITION]\n\
14413 Without any argument, stop when any Ada exception is handled.\n\
14414 With an argument, catch only exceptions with the given name.\n\
14415 CONDITION is a boolean expression that is evaluated to see whether the\n\
14416 exception should cause a stop."),
14417 catch_ada_handlers_command
,
14418 catch_ada_completer
,
14421 add_catch_command ("assert", _("\
14422 Catch failed Ada assertions, when raised.\n\
14423 Usage: catch assert [if CONDITION]\n\
14424 CONDITION is a boolean expression that is evaluated to see whether the\n\
14425 exception should cause a stop."),
14426 catch_assert_command
,
14431 varsize_limit
= 65536;
14432 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14433 &varsize_limit
, _("\
14434 Set the maximum number of bytes allowed in a variable-size object."), _("\
14435 Show the maximum number of bytes allowed in a variable-size object."), _("\
14436 Attempts to access an object whose size is not a compile-time constant\n\
14437 and exceeds this limit will cause an error."),
14438 NULL
, NULL
, &setlist
, &showlist
);
14440 add_info ("exceptions", info_exceptions_command
,
14442 List all Ada exception names.\n\
14443 Usage: info exceptions [REGEXP]\n\
14444 If a regular expression is passed as an argument, only those matching\n\
14445 the regular expression are listed."));
14447 add_basic_prefix_cmd ("ada", class_maintenance
,
14448 _("Set Ada maintenance-related variables."),
14449 &maint_set_ada_cmdlist
, "maintenance set ada ",
14450 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14452 add_show_prefix_cmd ("ada", class_maintenance
,
14453 _("Show Ada maintenance-related variables."),
14454 &maint_show_ada_cmdlist
, "maintenance show ada ",
14455 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14457 add_setshow_boolean_cmd
14458 ("ignore-descriptive-types", class_maintenance
,
14459 &ada_ignore_descriptive_types_p
,
14460 _("Set whether descriptive types generated by GNAT should be ignored."),
14461 _("Show whether descriptive types generated by GNAT should be ignored."),
14463 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14464 DWARF attribute."),
14465 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14467 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14468 NULL
, xcalloc
, xfree
);
14470 /* The ada-lang observers. */
14471 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14472 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14473 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);