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_packed_array_type (struct type
*);
175 static int ada_is_unconstrained_packed_array_type (struct type
*);
177 static struct value
*value_subscript_packed (struct value
*, int,
180 static struct value
*coerce_unspec_val_to_type (struct value
*,
183 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
185 static int equiv_types (struct type
*, struct type
*);
187 static int is_name_suffix (const char *);
189 static int advance_wild_match (const char **, const char *, int);
191 static bool wild_match (const char *name
, const char *patn
);
193 static struct value
*ada_coerce_ref (struct value
*);
195 static LONGEST
pos_atr (struct value
*);
197 static struct value
*value_pos_atr (struct type
*, struct value
*);
199 static struct value
*val_atr (struct type
*, LONGEST
);
201 static struct value
*value_val_atr (struct type
*, struct value
*);
203 static struct symbol
*standard_lookup (const char *, const struct block
*,
206 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
209 static int find_struct_field (const char *, struct type
*, int,
210 struct type
**, int *, int *, int *, int *);
212 static int ada_resolve_function (struct block_symbol
*, int,
213 struct value
**, int, const char *,
216 static int ada_is_direct_array_type (struct type
*);
218 static struct value
*ada_index_struct_field (int, struct value
*, int,
221 static struct value
*assign_aggregate (struct value
*, struct value
*,
225 static void aggregate_assign_from_choices (struct value
*, struct value
*,
227 int *, LONGEST
*, int *,
228 int, LONGEST
, LONGEST
);
230 static void aggregate_assign_positional (struct value
*, struct value
*,
232 int *, LONGEST
*, int *, int,
236 static void aggregate_assign_others (struct value
*, struct value
*,
238 int *, LONGEST
*, int, LONGEST
, LONGEST
);
241 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
244 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
247 static void ada_forward_operator_length (struct expression
*, int, int *,
250 static struct type
*ada_find_any_type (const char *name
);
252 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
253 (const lookup_name_info
&lookup_name
);
257 /* The result of a symbol lookup to be stored in our symbol cache. */
261 /* The name used to perform the lookup. */
263 /* The namespace used during the lookup. */
265 /* The symbol returned by the lookup, or NULL if no matching symbol
268 /* The block where the symbol was found, or NULL if no matching
270 const struct block
*block
;
271 /* A pointer to the next entry with the same hash. */
272 struct cache_entry
*next
;
275 /* The Ada symbol cache, used to store the result of Ada-mode symbol
276 lookups in the course of executing the user's commands.
278 The cache is implemented using a simple, fixed-sized hash.
279 The size is fixed on the grounds that there are not likely to be
280 all that many symbols looked up during any given session, regardless
281 of the size of the symbol table. If we decide to go to a resizable
282 table, let's just use the stuff from libiberty instead. */
284 #define HASH_SIZE 1009
286 struct ada_symbol_cache
288 /* An obstack used to store the entries in our cache. */
289 struct obstack cache_space
;
291 /* The root of the hash table used to implement our symbol cache. */
292 struct cache_entry
*root
[HASH_SIZE
];
295 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
297 /* Maximum-sized dynamic type. */
298 static unsigned int varsize_limit
;
300 static const char ada_completer_word_break_characters
[] =
302 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
304 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
307 /* The name of the symbol to use to get the name of the main subprogram. */
308 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
309 = "__gnat_ada_main_program_name";
311 /* Limit on the number of warnings to raise per expression evaluation. */
312 static int warning_limit
= 2;
314 /* Number of warning messages issued; reset to 0 by cleanups after
315 expression evaluation. */
316 static int warnings_issued
= 0;
318 static const char *known_runtime_file_name_patterns
[] = {
319 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
322 static const char *known_auxiliary_function_name_patterns
[] = {
323 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
326 /* Maintenance-related settings for this module. */
328 static struct cmd_list_element
*maint_set_ada_cmdlist
;
329 static struct cmd_list_element
*maint_show_ada_cmdlist
;
331 /* The "maintenance ada set/show ignore-descriptive-type" value. */
333 static bool ada_ignore_descriptive_types_p
= false;
335 /* Inferior-specific data. */
337 /* Per-inferior data for this module. */
339 struct ada_inferior_data
341 /* The ada__tags__type_specific_data type, which is used when decoding
342 tagged types. With older versions of GNAT, this type was directly
343 accessible through a component ("tsd") in the object tag. But this
344 is no longer the case, so we cache it for each inferior. */
345 struct type
*tsd_type
= nullptr;
347 /* The exception_support_info data. This data is used to determine
348 how to implement support for Ada exception catchpoints in a given
350 const struct exception_support_info
*exception_info
= nullptr;
353 /* Our key to this module's inferior data. */
354 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
356 /* Return our inferior data for the given inferior (INF).
358 This function always returns a valid pointer to an allocated
359 ada_inferior_data structure. If INF's inferior data has not
360 been previously set, this functions creates a new one with all
361 fields set to zero, sets INF's inferior to it, and then returns
362 a pointer to that newly allocated ada_inferior_data. */
364 static struct ada_inferior_data
*
365 get_ada_inferior_data (struct inferior
*inf
)
367 struct ada_inferior_data
*data
;
369 data
= ada_inferior_data
.get (inf
);
371 data
= ada_inferior_data
.emplace (inf
);
376 /* Perform all necessary cleanups regarding our module's inferior data
377 that is required after the inferior INF just exited. */
380 ada_inferior_exit (struct inferior
*inf
)
382 ada_inferior_data
.clear (inf
);
386 /* program-space-specific data. */
388 /* This module's per-program-space data. */
389 struct ada_pspace_data
393 if (sym_cache
!= NULL
)
394 ada_free_symbol_cache (sym_cache
);
397 /* The Ada symbol cache. */
398 struct ada_symbol_cache
*sym_cache
= nullptr;
401 /* Key to our per-program-space data. */
402 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
404 /* Return this module's data for the given program space (PSPACE).
405 If not is found, add a zero'ed one now.
407 This function always returns a valid object. */
409 static struct ada_pspace_data
*
410 get_ada_pspace_data (struct program_space
*pspace
)
412 struct ada_pspace_data
*data
;
414 data
= ada_pspace_data_handle
.get (pspace
);
416 data
= ada_pspace_data_handle
.emplace (pspace
);
423 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
424 all typedef layers have been peeled. Otherwise, return TYPE.
426 Normally, we really expect a typedef type to only have 1 typedef layer.
427 In other words, we really expect the target type of a typedef type to be
428 a non-typedef type. This is particularly true for Ada units, because
429 the language does not have a typedef vs not-typedef distinction.
430 In that respect, the Ada compiler has been trying to eliminate as many
431 typedef definitions in the debugging information, since they generally
432 do not bring any extra information (we still use typedef under certain
433 circumstances related mostly to the GNAT encoding).
435 Unfortunately, we have seen situations where the debugging information
436 generated by the compiler leads to such multiple typedef layers. For
437 instance, consider the following example with stabs:
439 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
440 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
442 This is an error in the debugging information which causes type
443 pck__float_array___XUP to be defined twice, and the second time,
444 it is defined as a typedef of a typedef.
446 This is on the fringe of legality as far as debugging information is
447 concerned, and certainly unexpected. But it is easy to handle these
448 situations correctly, so we can afford to be lenient in this case. */
451 ada_typedef_target_type (struct type
*type
)
453 while (type
->code () == TYPE_CODE_TYPEDEF
)
454 type
= TYPE_TARGET_TYPE (type
);
458 /* Given DECODED_NAME a string holding a symbol name in its
459 decoded form (ie using the Ada dotted notation), returns
460 its unqualified name. */
463 ada_unqualified_name (const char *decoded_name
)
467 /* If the decoded name starts with '<', it means that the encoded
468 name does not follow standard naming conventions, and thus that
469 it is not your typical Ada symbol name. Trying to unqualify it
470 is therefore pointless and possibly erroneous. */
471 if (decoded_name
[0] == '<')
474 result
= strrchr (decoded_name
, '.');
476 result
++; /* Skip the dot... */
478 result
= decoded_name
;
483 /* Return a string starting with '<', followed by STR, and '>'. */
486 add_angle_brackets (const char *str
)
488 return string_printf ("<%s>", str
);
492 ada_get_gdb_completer_word_break_characters (void)
494 return ada_completer_word_break_characters
;
497 /* la_watch_location_expression for Ada. */
499 static gdb::unique_xmalloc_ptr
<char>
500 ada_watch_location_expression (struct type
*type
, CORE_ADDR addr
)
502 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
503 std::string name
= type_to_string (type
);
504 return gdb::unique_xmalloc_ptr
<char>
505 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
508 /* Assuming V points to an array of S objects, make sure that it contains at
509 least M objects, updating V and S as necessary. */
511 #define GROW_VECT(v, s, m) \
512 if ((s) < (m)) (v) = (char *) grow_vect (v, &(s), m, sizeof *(v));
514 /* Assuming VECT points to an array of *SIZE objects of size
515 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
516 updating *SIZE as necessary and returning the (new) array. */
519 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
521 if (*size
< min_size
)
524 if (*size
< min_size
)
526 vect
= xrealloc (vect
, *size
* element_size
);
531 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
532 suffix of FIELD_NAME beginning "___". */
535 field_name_match (const char *field_name
, const char *target
)
537 int len
= strlen (target
);
540 (strncmp (field_name
, target
, len
) == 0
541 && (field_name
[len
] == '\0'
542 || (startswith (field_name
+ len
, "___")
543 && strcmp (field_name
+ strlen (field_name
) - 6,
548 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
549 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
550 and return its index. This function also handles fields whose name
551 have ___ suffixes because the compiler sometimes alters their name
552 by adding such a suffix to represent fields with certain constraints.
553 If the field could not be found, return a negative number if
554 MAYBE_MISSING is set. Otherwise raise an error. */
557 ada_get_field_index (const struct type
*type
, const char *field_name
,
561 struct type
*struct_type
= check_typedef ((struct type
*) type
);
563 for (fieldno
= 0; fieldno
< struct_type
->num_fields (); fieldno
++)
564 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
568 error (_("Unable to find field %s in struct %s. Aborting"),
569 field_name
, struct_type
->name ());
574 /* The length of the prefix of NAME prior to any "___" suffix. */
577 ada_name_prefix_len (const char *name
)
583 const char *p
= strstr (name
, "___");
586 return strlen (name
);
592 /* Return non-zero if SUFFIX is a suffix of STR.
593 Return zero if STR is null. */
596 is_suffix (const char *str
, const char *suffix
)
603 len2
= strlen (suffix
);
604 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
607 /* The contents of value VAL, treated as a value of type TYPE. The
608 result is an lval in memory if VAL is. */
610 static struct value
*
611 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
613 type
= ada_check_typedef (type
);
614 if (value_type (val
) == type
)
618 struct value
*result
;
620 /* Make sure that the object size is not unreasonable before
621 trying to allocate some memory for it. */
622 ada_ensure_varsize_limit (type
);
625 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
626 result
= allocate_value_lazy (type
);
629 result
= allocate_value (type
);
630 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
632 set_value_component_location (result
, val
);
633 set_value_bitsize (result
, value_bitsize (val
));
634 set_value_bitpos (result
, value_bitpos (val
));
635 if (VALUE_LVAL (result
) == lval_memory
)
636 set_value_address (result
, value_address (val
));
641 static const gdb_byte
*
642 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
647 return valaddr
+ offset
;
651 cond_offset_target (CORE_ADDR address
, long offset
)
656 return address
+ offset
;
659 /* Issue a warning (as for the definition of warning in utils.c, but
660 with exactly one argument rather than ...), unless the limit on the
661 number of warnings has passed during the evaluation of the current
664 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
665 provided by "complaint". */
666 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
669 lim_warning (const char *format
, ...)
673 va_start (args
, format
);
674 warnings_issued
+= 1;
675 if (warnings_issued
<= warning_limit
)
676 vwarning (format
, args
);
681 /* Issue an error if the size of an object of type T is unreasonable,
682 i.e. if it would be a bad idea to allocate a value of this type in
686 ada_ensure_varsize_limit (const struct type
*type
)
688 if (TYPE_LENGTH (type
) > varsize_limit
)
689 error (_("object size is larger than varsize-limit"));
692 /* Maximum value of a SIZE-byte signed integer type. */
694 max_of_size (int size
)
696 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
698 return top_bit
| (top_bit
- 1);
701 /* Minimum value of a SIZE-byte signed integer type. */
703 min_of_size (int size
)
705 return -max_of_size (size
) - 1;
708 /* Maximum value of a SIZE-byte unsigned integer type. */
710 umax_of_size (int size
)
712 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
714 return top_bit
| (top_bit
- 1);
717 /* Maximum value of integral type T, as a signed quantity. */
719 max_of_type (struct type
*t
)
721 if (TYPE_UNSIGNED (t
))
722 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
724 return max_of_size (TYPE_LENGTH (t
));
727 /* Minimum value of integral type T, as a signed quantity. */
729 min_of_type (struct type
*t
)
731 if (TYPE_UNSIGNED (t
))
734 return min_of_size (TYPE_LENGTH (t
));
737 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
739 ada_discrete_type_high_bound (struct type
*type
)
741 type
= resolve_dynamic_type (type
, {}, 0);
742 switch (type
->code ())
744 case TYPE_CODE_RANGE
:
745 return TYPE_HIGH_BOUND (type
);
747 return TYPE_FIELD_ENUMVAL (type
, type
->num_fields () - 1);
752 return max_of_type (type
);
754 error (_("Unexpected type in ada_discrete_type_high_bound."));
758 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
760 ada_discrete_type_low_bound (struct type
*type
)
762 type
= resolve_dynamic_type (type
, {}, 0);
763 switch (type
->code ())
765 case TYPE_CODE_RANGE
:
766 return TYPE_LOW_BOUND (type
);
768 return TYPE_FIELD_ENUMVAL (type
, 0);
773 return min_of_type (type
);
775 error (_("Unexpected type in ada_discrete_type_low_bound."));
779 /* The identity on non-range types. For range types, the underlying
780 non-range scalar type. */
783 get_base_type (struct type
*type
)
785 while (type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
)
787 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
789 type
= TYPE_TARGET_TYPE (type
);
794 /* Return a decoded version of the given VALUE. This means returning
795 a value whose type is obtained by applying all the GNAT-specific
796 encodings, making the resulting type a static but standard description
797 of the initial type. */
800 ada_get_decoded_value (struct value
*value
)
802 struct type
*type
= ada_check_typedef (value_type (value
));
804 if (ada_is_array_descriptor_type (type
)
805 || (ada_is_constrained_packed_array_type (type
)
806 && type
->code () != TYPE_CODE_PTR
))
808 if (type
->code () == TYPE_CODE_TYPEDEF
) /* array access type. */
809 value
= ada_coerce_to_simple_array_ptr (value
);
811 value
= ada_coerce_to_simple_array (value
);
814 value
= ada_to_fixed_value (value
);
819 /* Same as ada_get_decoded_value, but with the given TYPE.
820 Because there is no associated actual value for this type,
821 the resulting type might be a best-effort approximation in
822 the case of dynamic types. */
825 ada_get_decoded_type (struct type
*type
)
827 type
= to_static_fixed_type (type
);
828 if (ada_is_constrained_packed_array_type (type
))
829 type
= ada_coerce_to_simple_array_type (type
);
835 /* Language Selection */
837 /* If the main program is in Ada, return language_ada, otherwise return LANG
838 (the main program is in Ada iif the adainit symbol is found). */
841 ada_update_initial_language (enum language lang
)
843 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
849 /* If the main procedure is written in Ada, then return its name.
850 The result is good until the next call. Return NULL if the main
851 procedure doesn't appear to be in Ada. */
856 struct bound_minimal_symbol msym
;
857 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
859 /* For Ada, the name of the main procedure is stored in a specific
860 string constant, generated by the binder. Look for that symbol,
861 extract its address, and then read that string. If we didn't find
862 that string, then most probably the main procedure is not written
864 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
866 if (msym
.minsym
!= NULL
)
868 CORE_ADDR main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
869 if (main_program_name_addr
== 0)
870 error (_("Invalid address for Ada main program name."));
872 main_program_name
= target_read_string (main_program_name_addr
, 1024);
873 return main_program_name
.get ();
876 /* The main procedure doesn't seem to be in Ada. */
882 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
885 const struct ada_opname_map ada_opname_table
[] = {
886 {"Oadd", "\"+\"", BINOP_ADD
},
887 {"Osubtract", "\"-\"", BINOP_SUB
},
888 {"Omultiply", "\"*\"", BINOP_MUL
},
889 {"Odivide", "\"/\"", BINOP_DIV
},
890 {"Omod", "\"mod\"", BINOP_MOD
},
891 {"Orem", "\"rem\"", BINOP_REM
},
892 {"Oexpon", "\"**\"", BINOP_EXP
},
893 {"Olt", "\"<\"", BINOP_LESS
},
894 {"Ole", "\"<=\"", BINOP_LEQ
},
895 {"Ogt", "\">\"", BINOP_GTR
},
896 {"Oge", "\">=\"", BINOP_GEQ
},
897 {"Oeq", "\"=\"", BINOP_EQUAL
},
898 {"One", "\"/=\"", BINOP_NOTEQUAL
},
899 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
900 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
901 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
902 {"Oconcat", "\"&\"", BINOP_CONCAT
},
903 {"Oabs", "\"abs\"", UNOP_ABS
},
904 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
905 {"Oadd", "\"+\"", UNOP_PLUS
},
906 {"Osubtract", "\"-\"", UNOP_NEG
},
910 /* The "encoded" form of DECODED, according to GNAT conventions. The
911 result is valid until the next call to ada_encode. If
912 THROW_ERRORS, throw an error if invalid operator name is found.
913 Otherwise, return NULL in that case. */
916 ada_encode_1 (const char *decoded
, bool throw_errors
)
918 static char *encoding_buffer
= NULL
;
919 static size_t encoding_buffer_size
= 0;
926 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
927 2 * strlen (decoded
) + 10);
930 for (p
= decoded
; *p
!= '\0'; p
+= 1)
934 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
939 const struct ada_opname_map
*mapping
;
941 for (mapping
= ada_opname_table
;
942 mapping
->encoded
!= NULL
943 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
945 if (mapping
->encoded
== NULL
)
948 error (_("invalid Ada operator name: %s"), p
);
952 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
953 k
+= strlen (mapping
->encoded
);
958 encoding_buffer
[k
] = *p
;
963 encoding_buffer
[k
] = '\0';
964 return encoding_buffer
;
967 /* The "encoded" form of DECODED, according to GNAT conventions.
968 The result is valid until the next call to ada_encode. */
971 ada_encode (const char *decoded
)
973 return ada_encode_1 (decoded
, true);
976 /* Return NAME folded to lower case, or, if surrounded by single
977 quotes, unfolded, but with the quotes stripped away. Result good
981 ada_fold_name (gdb::string_view name
)
983 static char *fold_buffer
= NULL
;
984 static size_t fold_buffer_size
= 0;
986 int len
= name
.size ();
987 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
991 strncpy (fold_buffer
, name
.data () + 1, len
- 2);
992 fold_buffer
[len
- 2] = '\000';
998 for (i
= 0; i
<= len
; i
+= 1)
999 fold_buffer
[i
] = tolower (name
[i
]);
1005 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1008 is_lower_alphanum (const char c
)
1010 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1013 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1014 This function saves in LEN the length of that same symbol name but
1015 without either of these suffixes:
1021 These are suffixes introduced by the compiler for entities such as
1022 nested subprogram for instance, in order to avoid name clashes.
1023 They do not serve any purpose for the debugger. */
1026 ada_remove_trailing_digits (const char *encoded
, int *len
)
1028 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1032 while (i
> 0 && isdigit (encoded
[i
]))
1034 if (i
>= 0 && encoded
[i
] == '.')
1036 else if (i
>= 0 && encoded
[i
] == '$')
1038 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1040 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1045 /* Remove the suffix introduced by the compiler for protected object
1049 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1051 /* Remove trailing N. */
1053 /* Protected entry subprograms are broken into two
1054 separate subprograms: The first one is unprotected, and has
1055 a 'N' suffix; the second is the protected version, and has
1056 the 'P' suffix. The second calls the first one after handling
1057 the protection. Since the P subprograms are internally generated,
1058 we leave these names undecoded, giving the user a clue that this
1059 entity is internal. */
1062 && encoded
[*len
- 1] == 'N'
1063 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1067 /* If ENCODED follows the GNAT entity encoding conventions, then return
1068 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1069 replaced by ENCODED. */
1072 ada_decode (const char *encoded
)
1078 std::string decoded
;
1080 /* With function descriptors on PPC64, the value of a symbol named
1081 ".FN", if it exists, is the entry point of the function "FN". */
1082 if (encoded
[0] == '.')
1085 /* The name of the Ada main procedure starts with "_ada_".
1086 This prefix is not part of the decoded name, so skip this part
1087 if we see this prefix. */
1088 if (startswith (encoded
, "_ada_"))
1091 /* If the name starts with '_', then it is not a properly encoded
1092 name, so do not attempt to decode it. Similarly, if the name
1093 starts with '<', the name should not be decoded. */
1094 if (encoded
[0] == '_' || encoded
[0] == '<')
1097 len0
= strlen (encoded
);
1099 ada_remove_trailing_digits (encoded
, &len0
);
1100 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1102 /* Remove the ___X.* suffix if present. Do not forget to verify that
1103 the suffix is located before the current "end" of ENCODED. We want
1104 to avoid re-matching parts of ENCODED that have previously been
1105 marked as discarded (by decrementing LEN0). */
1106 p
= strstr (encoded
, "___");
1107 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1115 /* Remove any trailing TKB suffix. It tells us that this symbol
1116 is for the body of a task, but that information does not actually
1117 appear in the decoded name. */
1119 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1122 /* Remove any trailing TB suffix. The TB suffix is slightly different
1123 from the TKB suffix because it is used for non-anonymous task
1126 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1129 /* Remove trailing "B" suffixes. */
1130 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1132 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1135 /* Make decoded big enough for possible expansion by operator name. */
1137 decoded
.resize (2 * len0
+ 1, 'X');
1139 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1141 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1144 while ((i
>= 0 && isdigit (encoded
[i
]))
1145 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1147 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1149 else if (encoded
[i
] == '$')
1153 /* The first few characters that are not alphabetic are not part
1154 of any encoding we use, so we can copy them over verbatim. */
1156 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1157 decoded
[j
] = encoded
[i
];
1162 /* Is this a symbol function? */
1163 if (at_start_name
&& encoded
[i
] == 'O')
1167 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1169 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1170 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1172 && !isalnum (encoded
[i
+ op_len
]))
1174 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1177 j
+= strlen (ada_opname_table
[k
].decoded
);
1181 if (ada_opname_table
[k
].encoded
!= NULL
)
1186 /* Replace "TK__" with "__", which will eventually be translated
1187 into "." (just below). */
1189 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1192 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1193 be translated into "." (just below). These are internal names
1194 generated for anonymous blocks inside which our symbol is nested. */
1196 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1197 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1198 && isdigit (encoded
[i
+4]))
1202 while (k
< len0
&& isdigit (encoded
[k
]))
1203 k
++; /* Skip any extra digit. */
1205 /* Double-check that the "__B_{DIGITS}+" sequence we found
1206 is indeed followed by "__". */
1207 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1211 /* Remove _E{DIGITS}+[sb] */
1213 /* Just as for protected object subprograms, there are 2 categories
1214 of subprograms created by the compiler for each entry. The first
1215 one implements the actual entry code, and has a suffix following
1216 the convention above; the second one implements the barrier and
1217 uses the same convention as above, except that the 'E' is replaced
1220 Just as above, we do not decode the name of barrier functions
1221 to give the user a clue that the code he is debugging has been
1222 internally generated. */
1224 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1225 && isdigit (encoded
[i
+2]))
1229 while (k
< len0
&& isdigit (encoded
[k
]))
1233 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1236 /* Just as an extra precaution, make sure that if this
1237 suffix is followed by anything else, it is a '_'.
1238 Otherwise, we matched this sequence by accident. */
1240 || (k
< len0
&& encoded
[k
] == '_'))
1245 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1246 the GNAT front-end in protected object subprograms. */
1249 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1251 /* Backtrack a bit up until we reach either the begining of
1252 the encoded name, or "__". Make sure that we only find
1253 digits or lowercase characters. */
1254 const char *ptr
= encoded
+ i
- 1;
1256 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1259 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1263 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1265 /* This is a X[bn]* sequence not separated from the previous
1266 part of the name with a non-alpha-numeric character (in other
1267 words, immediately following an alpha-numeric character), then
1268 verify that it is placed at the end of the encoded name. If
1269 not, then the encoding is not valid and we should abort the
1270 decoding. Otherwise, just skip it, it is used in body-nested
1274 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1278 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1280 /* Replace '__' by '.'. */
1288 /* It's a character part of the decoded name, so just copy it
1290 decoded
[j
] = encoded
[i
];
1297 /* Decoded names should never contain any uppercase character.
1298 Double-check this, and abort the decoding if we find one. */
1300 for (i
= 0; i
< decoded
.length(); ++i
)
1301 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1307 if (encoded
[0] == '<')
1310 decoded
= '<' + std::string(encoded
) + '>';
1315 /* Table for keeping permanent unique copies of decoded names. Once
1316 allocated, names in this table are never released. While this is a
1317 storage leak, it should not be significant unless there are massive
1318 changes in the set of decoded names in successive versions of a
1319 symbol table loaded during a single session. */
1320 static struct htab
*decoded_names_store
;
1322 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1323 in the language-specific part of GSYMBOL, if it has not been
1324 previously computed. Tries to save the decoded name in the same
1325 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1326 in any case, the decoded symbol has a lifetime at least that of
1328 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1329 const, but nevertheless modified to a semantically equivalent form
1330 when a decoded name is cached in it. */
1333 ada_decode_symbol (const struct general_symbol_info
*arg
)
1335 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1336 const char **resultp
=
1337 &gsymbol
->language_specific
.demangled_name
;
1339 if (!gsymbol
->ada_mangled
)
1341 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1342 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1344 gsymbol
->ada_mangled
= 1;
1346 if (obstack
!= NULL
)
1347 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1350 /* Sometimes, we can't find a corresponding objfile, in
1351 which case, we put the result on the heap. Since we only
1352 decode when needed, we hope this usually does not cause a
1353 significant memory leak (FIXME). */
1355 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1356 decoded
.c_str (), INSERT
);
1359 *slot
= xstrdup (decoded
.c_str ());
1368 ada_la_decode (const char *encoded
, int options
)
1370 return xstrdup (ada_decode (encoded
).c_str ());
1377 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1378 generated by the GNAT compiler to describe the index type used
1379 for each dimension of an array, check whether it follows the latest
1380 known encoding. If not, fix it up to conform to the latest encoding.
1381 Otherwise, do nothing. This function also does nothing if
1382 INDEX_DESC_TYPE is NULL.
1384 The GNAT encoding used to describe the array index type evolved a bit.
1385 Initially, the information would be provided through the name of each
1386 field of the structure type only, while the type of these fields was
1387 described as unspecified and irrelevant. The debugger was then expected
1388 to perform a global type lookup using the name of that field in order
1389 to get access to the full index type description. Because these global
1390 lookups can be very expensive, the encoding was later enhanced to make
1391 the global lookup unnecessary by defining the field type as being
1392 the full index type description.
1394 The purpose of this routine is to allow us to support older versions
1395 of the compiler by detecting the use of the older encoding, and by
1396 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1397 we essentially replace each field's meaningless type by the associated
1401 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1405 if (index_desc_type
== NULL
)
1407 gdb_assert (index_desc_type
->num_fields () > 0);
1409 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1410 to check one field only, no need to check them all). If not, return
1413 If our INDEX_DESC_TYPE was generated using the older encoding,
1414 the field type should be a meaningless integer type whose name
1415 is not equal to the field name. */
1416 if (index_desc_type
->field (0).type ()->name () != NULL
1417 && strcmp (index_desc_type
->field (0).type ()->name (),
1418 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1421 /* Fixup each field of INDEX_DESC_TYPE. */
1422 for (i
= 0; i
< index_desc_type
->num_fields (); i
++)
1424 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1425 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1428 index_desc_type
->field (i
).set_type (raw_type
);
1432 /* The desc_* routines return primitive portions of array descriptors
1435 /* The descriptor or array type, if any, indicated by TYPE; removes
1436 level of indirection, if needed. */
1438 static struct type
*
1439 desc_base_type (struct type
*type
)
1443 type
= ada_check_typedef (type
);
1444 if (type
->code () == TYPE_CODE_TYPEDEF
)
1445 type
= ada_typedef_target_type (type
);
1448 && (type
->code () == TYPE_CODE_PTR
1449 || type
->code () == TYPE_CODE_REF
))
1450 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1455 /* True iff TYPE indicates a "thin" array pointer type. */
1458 is_thin_pntr (struct type
*type
)
1461 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1462 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1465 /* The descriptor type for thin pointer type TYPE. */
1467 static struct type
*
1468 thin_descriptor_type (struct type
*type
)
1470 struct type
*base_type
= desc_base_type (type
);
1472 if (base_type
== NULL
)
1474 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1478 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1480 if (alt_type
== NULL
)
1487 /* A pointer to the array data for thin-pointer value VAL. */
1489 static struct value
*
1490 thin_data_pntr (struct value
*val
)
1492 struct type
*type
= ada_check_typedef (value_type (val
));
1493 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1495 data_type
= lookup_pointer_type (data_type
);
1497 if (type
->code () == TYPE_CODE_PTR
)
1498 return value_cast (data_type
, value_copy (val
));
1500 return value_from_longest (data_type
, value_address (val
));
1503 /* True iff TYPE indicates a "thick" array pointer type. */
1506 is_thick_pntr (struct type
*type
)
1508 type
= desc_base_type (type
);
1509 return (type
!= NULL
&& type
->code () == TYPE_CODE_STRUCT
1510 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1513 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1514 pointer to one, the type of its bounds data; otherwise, NULL. */
1516 static struct type
*
1517 desc_bounds_type (struct type
*type
)
1521 type
= desc_base_type (type
);
1525 else if (is_thin_pntr (type
))
1527 type
= thin_descriptor_type (type
);
1530 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1532 return ada_check_typedef (r
);
1534 else if (type
->code () == TYPE_CODE_STRUCT
)
1536 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1538 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1543 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1544 one, a pointer to its bounds data. Otherwise NULL. */
1546 static struct value
*
1547 desc_bounds (struct value
*arr
)
1549 struct type
*type
= ada_check_typedef (value_type (arr
));
1551 if (is_thin_pntr (type
))
1553 struct type
*bounds_type
=
1554 desc_bounds_type (thin_descriptor_type (type
));
1557 if (bounds_type
== NULL
)
1558 error (_("Bad GNAT array descriptor"));
1560 /* NOTE: The following calculation is not really kosher, but
1561 since desc_type is an XVE-encoded type (and shouldn't be),
1562 the correct calculation is a real pain. FIXME (and fix GCC). */
1563 if (type
->code () == TYPE_CODE_PTR
)
1564 addr
= value_as_long (arr
);
1566 addr
= value_address (arr
);
1569 value_from_longest (lookup_pointer_type (bounds_type
),
1570 addr
- TYPE_LENGTH (bounds_type
));
1573 else if (is_thick_pntr (type
))
1575 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1576 _("Bad GNAT array descriptor"));
1577 struct type
*p_bounds_type
= value_type (p_bounds
);
1580 && p_bounds_type
->code () == TYPE_CODE_PTR
)
1582 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1584 if (TYPE_STUB (target_type
))
1585 p_bounds
= value_cast (lookup_pointer_type
1586 (ada_check_typedef (target_type
)),
1590 error (_("Bad GNAT array descriptor"));
1598 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1599 position of the field containing the address of the bounds data. */
1602 fat_pntr_bounds_bitpos (struct type
*type
)
1604 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1607 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1608 size of the field containing the address of the bounds data. */
1611 fat_pntr_bounds_bitsize (struct type
*type
)
1613 type
= desc_base_type (type
);
1615 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1616 return TYPE_FIELD_BITSIZE (type
, 1);
1618 return 8 * TYPE_LENGTH (ada_check_typedef (type
->field (1).type ()));
1621 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1622 pointer to one, the type of its array data (a array-with-no-bounds type);
1623 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1626 static struct type
*
1627 desc_data_target_type (struct type
*type
)
1629 type
= desc_base_type (type
);
1631 /* NOTE: The following is bogus; see comment in desc_bounds. */
1632 if (is_thin_pntr (type
))
1633 return desc_base_type (thin_descriptor_type (type
)->field (1).type ());
1634 else if (is_thick_pntr (type
))
1636 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1639 && ada_check_typedef (data_type
)->code () == TYPE_CODE_PTR
)
1640 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1646 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1649 static struct value
*
1650 desc_data (struct value
*arr
)
1652 struct type
*type
= value_type (arr
);
1654 if (is_thin_pntr (type
))
1655 return thin_data_pntr (arr
);
1656 else if (is_thick_pntr (type
))
1657 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1658 _("Bad GNAT array descriptor"));
1664 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1665 position of the field containing the address of the data. */
1668 fat_pntr_data_bitpos (struct type
*type
)
1670 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1673 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1674 size of the field containing the address of the data. */
1677 fat_pntr_data_bitsize (struct type
*type
)
1679 type
= desc_base_type (type
);
1681 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1682 return TYPE_FIELD_BITSIZE (type
, 0);
1684 return TARGET_CHAR_BIT
* TYPE_LENGTH (type
->field (0).type ());
1687 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1688 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1689 bound, if WHICH is 1. The first bound is I=1. */
1691 static struct value
*
1692 desc_one_bound (struct value
*bounds
, int i
, int which
)
1694 char bound_name
[20];
1695 xsnprintf (bound_name
, sizeof (bound_name
), "%cB%d",
1696 which
? 'U' : 'L', i
- 1);
1697 return value_struct_elt (&bounds
, NULL
, bound_name
, NULL
,
1698 _("Bad GNAT array descriptor bounds"));
1701 /* If BOUNDS is an array-bounds structure type, return the bit position
1702 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1703 bound, if WHICH is 1. The first bound is I=1. */
1706 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1708 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1711 /* If BOUNDS is an array-bounds structure type, return the bit field size
1712 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1713 bound, if WHICH is 1. The first bound is I=1. */
1716 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1718 type
= desc_base_type (type
);
1720 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1721 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1723 return 8 * TYPE_LENGTH (type
->field (2 * i
+ which
- 2).type ());
1726 /* If TYPE is the type of an array-bounds structure, the type of its
1727 Ith bound (numbering from 1). Otherwise, NULL. */
1729 static struct type
*
1730 desc_index_type (struct type
*type
, int i
)
1732 type
= desc_base_type (type
);
1734 if (type
->code () == TYPE_CODE_STRUCT
)
1736 char bound_name
[20];
1737 xsnprintf (bound_name
, sizeof (bound_name
), "LB%d", i
- 1);
1738 return lookup_struct_elt_type (type
, bound_name
, 1);
1744 /* The number of index positions in the array-bounds type TYPE.
1745 Return 0 if TYPE is NULL. */
1748 desc_arity (struct type
*type
)
1750 type
= desc_base_type (type
);
1753 return type
->num_fields () / 2;
1757 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1758 an array descriptor type (representing an unconstrained array
1762 ada_is_direct_array_type (struct type
*type
)
1766 type
= ada_check_typedef (type
);
1767 return (type
->code () == TYPE_CODE_ARRAY
1768 || ada_is_array_descriptor_type (type
));
1771 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1775 ada_is_array_type (struct type
*type
)
1778 && (type
->code () == TYPE_CODE_PTR
1779 || type
->code () == TYPE_CODE_REF
))
1780 type
= TYPE_TARGET_TYPE (type
);
1781 return ada_is_direct_array_type (type
);
1784 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1787 ada_is_simple_array_type (struct type
*type
)
1791 type
= ada_check_typedef (type
);
1792 return (type
->code () == TYPE_CODE_ARRAY
1793 || (type
->code () == TYPE_CODE_PTR
1794 && (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ()
1795 == TYPE_CODE_ARRAY
)));
1798 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1801 ada_is_array_descriptor_type (struct type
*type
)
1803 struct type
*data_type
= desc_data_target_type (type
);
1807 type
= ada_check_typedef (type
);
1808 return (data_type
!= NULL
1809 && data_type
->code () == TYPE_CODE_ARRAY
1810 && desc_arity (desc_bounds_type (type
)) > 0);
1813 /* Non-zero iff type is a partially mal-formed GNAT array
1814 descriptor. FIXME: This is to compensate for some problems with
1815 debugging output from GNAT. Re-examine periodically to see if it
1819 ada_is_bogus_array_descriptor (struct type
*type
)
1823 && type
->code () == TYPE_CODE_STRUCT
1824 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1825 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1826 && !ada_is_array_descriptor_type (type
);
1830 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1831 (fat pointer) returns the type of the array data described---specifically,
1832 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1833 in from the descriptor; otherwise, they are left unspecified. If
1834 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1835 returns NULL. The result is simply the type of ARR if ARR is not
1838 static struct type
*
1839 ada_type_of_array (struct value
*arr
, int bounds
)
1841 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1842 return decode_constrained_packed_array_type (value_type (arr
));
1844 if (!ada_is_array_descriptor_type (value_type (arr
)))
1845 return value_type (arr
);
1849 struct type
*array_type
=
1850 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1852 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1853 TYPE_FIELD_BITSIZE (array_type
, 0) =
1854 decode_packed_array_bitsize (value_type (arr
));
1860 struct type
*elt_type
;
1862 struct value
*descriptor
;
1864 elt_type
= ada_array_element_type (value_type (arr
), -1);
1865 arity
= ada_array_arity (value_type (arr
));
1867 if (elt_type
== NULL
|| arity
== 0)
1868 return ada_check_typedef (value_type (arr
));
1870 descriptor
= desc_bounds (arr
);
1871 if (value_as_long (descriptor
) == 0)
1875 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1876 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1877 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1878 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1881 create_static_range_type (range_type
, value_type (low
),
1882 longest_to_int (value_as_long (low
)),
1883 longest_to_int (value_as_long (high
)));
1884 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1886 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1888 /* We need to store the element packed bitsize, as well as
1889 recompute the array size, because it was previously
1890 computed based on the unpacked element size. */
1891 LONGEST lo
= value_as_long (low
);
1892 LONGEST hi
= value_as_long (high
);
1894 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1895 decode_packed_array_bitsize (value_type (arr
));
1896 /* If the array has no element, then the size is already
1897 zero, and does not need to be recomputed. */
1901 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1903 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1908 return lookup_pointer_type (elt_type
);
1912 /* If ARR does not represent an array, returns ARR unchanged.
1913 Otherwise, returns either a standard GDB array with bounds set
1914 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1915 GDB array. Returns NULL if ARR is a null fat pointer. */
1918 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1920 if (ada_is_array_descriptor_type (value_type (arr
)))
1922 struct type
*arrType
= ada_type_of_array (arr
, 1);
1924 if (arrType
== NULL
)
1926 return value_cast (arrType
, value_copy (desc_data (arr
)));
1928 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1929 return decode_constrained_packed_array (arr
);
1934 /* If ARR does not represent an array, returns ARR unchanged.
1935 Otherwise, returns a standard GDB array describing ARR (which may
1936 be ARR itself if it already is in the proper form). */
1939 ada_coerce_to_simple_array (struct value
*arr
)
1941 if (ada_is_array_descriptor_type (value_type (arr
)))
1943 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1946 error (_("Bounds unavailable for null array pointer."));
1947 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
1948 return value_ind (arrVal
);
1950 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1951 return decode_constrained_packed_array (arr
);
1956 /* If TYPE represents a GNAT array type, return it translated to an
1957 ordinary GDB array type (possibly with BITSIZE fields indicating
1958 packing). For other types, is the identity. */
1961 ada_coerce_to_simple_array_type (struct type
*type
)
1963 if (ada_is_constrained_packed_array_type (type
))
1964 return decode_constrained_packed_array_type (type
);
1966 if (ada_is_array_descriptor_type (type
))
1967 return ada_check_typedef (desc_data_target_type (type
));
1972 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1975 ada_is_packed_array_type (struct type
*type
)
1979 type
= desc_base_type (type
);
1980 type
= ada_check_typedef (type
);
1982 ada_type_name (type
) != NULL
1983 && strstr (ada_type_name (type
), "___XP") != NULL
;
1986 /* Non-zero iff TYPE represents a standard GNAT constrained
1987 packed-array type. */
1990 ada_is_constrained_packed_array_type (struct type
*type
)
1992 return ada_is_packed_array_type (type
)
1993 && !ada_is_array_descriptor_type (type
);
1996 /* Non-zero iff TYPE represents an array descriptor for a
1997 unconstrained packed-array type. */
2000 ada_is_unconstrained_packed_array_type (struct type
*type
)
2002 return ada_is_packed_array_type (type
)
2003 && ada_is_array_descriptor_type (type
);
2006 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2007 return the size of its elements in bits. */
2010 decode_packed_array_bitsize (struct type
*type
)
2012 const char *raw_name
;
2016 /* Access to arrays implemented as fat pointers are encoded as a typedef
2017 of the fat pointer type. We need the name of the fat pointer type
2018 to do the decoding, so strip the typedef layer. */
2019 if (type
->code () == TYPE_CODE_TYPEDEF
)
2020 type
= ada_typedef_target_type (type
);
2022 raw_name
= ada_type_name (ada_check_typedef (type
));
2024 raw_name
= ada_type_name (desc_base_type (type
));
2029 tail
= strstr (raw_name
, "___XP");
2030 gdb_assert (tail
!= NULL
);
2032 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2035 (_("could not understand bit size information on packed array"));
2042 /* Given that TYPE is a standard GDB array type with all bounds filled
2043 in, and that the element size of its ultimate scalar constituents
2044 (that is, either its elements, or, if it is an array of arrays, its
2045 elements' elements, etc.) is *ELT_BITS, return an identical type,
2046 but with the bit sizes of its elements (and those of any
2047 constituent arrays) recorded in the BITSIZE components of its
2048 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2051 Note that, for arrays whose index type has an XA encoding where
2052 a bound references a record discriminant, getting that discriminant,
2053 and therefore the actual value of that bound, is not possible
2054 because none of the given parameters gives us access to the record.
2055 This function assumes that it is OK in the context where it is being
2056 used to return an array whose bounds are still dynamic and where
2057 the length is arbitrary. */
2059 static struct type
*
2060 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2062 struct type
*new_elt_type
;
2063 struct type
*new_type
;
2064 struct type
*index_type_desc
;
2065 struct type
*index_type
;
2066 LONGEST low_bound
, high_bound
;
2068 type
= ada_check_typedef (type
);
2069 if (type
->code () != TYPE_CODE_ARRAY
)
2072 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2073 if (index_type_desc
)
2074 index_type
= to_fixed_range_type (index_type_desc
->field (0).type (),
2077 index_type
= type
->index_type ();
2079 new_type
= alloc_type_copy (type
);
2081 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2083 create_array_type (new_type
, new_elt_type
, index_type
);
2084 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2085 new_type
->set_name (ada_type_name (type
));
2087 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2088 && is_dynamic_type (check_typedef (index_type
)))
2089 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2090 low_bound
= high_bound
= 0;
2091 if (high_bound
< low_bound
)
2092 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2095 *elt_bits
*= (high_bound
- low_bound
+ 1);
2096 TYPE_LENGTH (new_type
) =
2097 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2100 TYPE_FIXED_INSTANCE (new_type
) = 1;
2104 /* The array type encoded by TYPE, where
2105 ada_is_constrained_packed_array_type (TYPE). */
2107 static struct type
*
2108 decode_constrained_packed_array_type (struct type
*type
)
2110 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2113 struct type
*shadow_type
;
2117 raw_name
= ada_type_name (desc_base_type (type
));
2122 name
= (char *) alloca (strlen (raw_name
) + 1);
2123 tail
= strstr (raw_name
, "___XP");
2124 type
= desc_base_type (type
);
2126 memcpy (name
, raw_name
, tail
- raw_name
);
2127 name
[tail
- raw_name
] = '\000';
2129 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2131 if (shadow_type
== NULL
)
2133 lim_warning (_("could not find bounds information on packed array"));
2136 shadow_type
= check_typedef (shadow_type
);
2138 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2140 lim_warning (_("could not understand bounds "
2141 "information on packed array"));
2145 bits
= decode_packed_array_bitsize (type
);
2146 return constrained_packed_array_type (shadow_type
, &bits
);
2149 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2150 array, returns a simple array that denotes that array. Its type is a
2151 standard GDB array type except that the BITSIZEs of the array
2152 target types are set to the number of bits in each element, and the
2153 type length is set appropriately. */
2155 static struct value
*
2156 decode_constrained_packed_array (struct value
*arr
)
2160 /* If our value is a pointer, then dereference it. Likewise if
2161 the value is a reference. Make sure that this operation does not
2162 cause the target type to be fixed, as this would indirectly cause
2163 this array to be decoded. The rest of the routine assumes that
2164 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2165 and "value_ind" routines to perform the dereferencing, as opposed
2166 to using "ada_coerce_ref" or "ada_value_ind". */
2167 arr
= coerce_ref (arr
);
2168 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2169 arr
= value_ind (arr
);
2171 type
= decode_constrained_packed_array_type (value_type (arr
));
2174 error (_("can't unpack array"));
2178 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2179 && ada_is_modular_type (value_type (arr
)))
2181 /* This is a (right-justified) modular type representing a packed
2182 array with no wrapper. In order to interpret the value through
2183 the (left-justified) packed array type we just built, we must
2184 first left-justify it. */
2185 int bit_size
, bit_pos
;
2188 mod
= ada_modulus (value_type (arr
)) - 1;
2195 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2196 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2197 bit_pos
/ HOST_CHAR_BIT
,
2198 bit_pos
% HOST_CHAR_BIT
,
2203 return coerce_unspec_val_to_type (arr
, type
);
2207 /* The value of the element of packed array ARR at the ARITY indices
2208 given in IND. ARR must be a simple array. */
2210 static struct value
*
2211 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2214 int bits
, elt_off
, bit_off
;
2215 long elt_total_bit_offset
;
2216 struct type
*elt_type
;
2220 elt_total_bit_offset
= 0;
2221 elt_type
= ada_check_typedef (value_type (arr
));
2222 for (i
= 0; i
< arity
; i
+= 1)
2224 if (elt_type
->code () != TYPE_CODE_ARRAY
2225 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2227 (_("attempt to do packed indexing of "
2228 "something other than a packed array"));
2231 struct type
*range_type
= elt_type
->index_type ();
2232 LONGEST lowerbound
, upperbound
;
2235 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2237 lim_warning (_("don't know bounds of array"));
2238 lowerbound
= upperbound
= 0;
2241 idx
= pos_atr (ind
[i
]);
2242 if (idx
< lowerbound
|| idx
> upperbound
)
2243 lim_warning (_("packed array index %ld out of bounds"),
2245 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2246 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2247 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2250 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2251 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2253 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2258 /* Non-zero iff TYPE includes negative integer values. */
2261 has_negatives (struct type
*type
)
2263 switch (type
->code ())
2268 return !TYPE_UNSIGNED (type
);
2269 case TYPE_CODE_RANGE
:
2270 return TYPE_LOW_BOUND (type
) - TYPE_RANGE_DATA (type
)->bias
< 0;
2274 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2275 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2276 the unpacked buffer.
2278 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2279 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2281 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2284 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2286 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2289 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2290 gdb_byte
*unpacked
, int unpacked_len
,
2291 int is_big_endian
, int is_signed_type
,
2294 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2295 int src_idx
; /* Index into the source area */
2296 int src_bytes_left
; /* Number of source bytes left to process. */
2297 int srcBitsLeft
; /* Number of source bits left to move */
2298 int unusedLS
; /* Number of bits in next significant
2299 byte of source that are unused */
2301 int unpacked_idx
; /* Index into the unpacked buffer */
2302 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2304 unsigned long accum
; /* Staging area for bits being transferred */
2305 int accumSize
; /* Number of meaningful bits in accum */
2308 /* Transmit bytes from least to most significant; delta is the direction
2309 the indices move. */
2310 int delta
= is_big_endian
? -1 : 1;
2312 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2314 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2315 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2316 bit_size
, unpacked_len
);
2318 srcBitsLeft
= bit_size
;
2319 src_bytes_left
= src_len
;
2320 unpacked_bytes_left
= unpacked_len
;
2325 src_idx
= src_len
- 1;
2327 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2331 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2337 unpacked_idx
= unpacked_len
- 1;
2341 /* Non-scalar values must be aligned at a byte boundary... */
2343 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2344 /* ... And are placed at the beginning (most-significant) bytes
2346 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2347 unpacked_bytes_left
= unpacked_idx
+ 1;
2352 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2354 src_idx
= unpacked_idx
= 0;
2355 unusedLS
= bit_offset
;
2358 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2363 while (src_bytes_left
> 0)
2365 /* Mask for removing bits of the next source byte that are not
2366 part of the value. */
2367 unsigned int unusedMSMask
=
2368 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2370 /* Sign-extend bits for this byte. */
2371 unsigned int signMask
= sign
& ~unusedMSMask
;
2374 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2375 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2376 if (accumSize
>= HOST_CHAR_BIT
)
2378 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2379 accumSize
-= HOST_CHAR_BIT
;
2380 accum
>>= HOST_CHAR_BIT
;
2381 unpacked_bytes_left
-= 1;
2382 unpacked_idx
+= delta
;
2384 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2386 src_bytes_left
-= 1;
2389 while (unpacked_bytes_left
> 0)
2391 accum
|= sign
<< accumSize
;
2392 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2393 accumSize
-= HOST_CHAR_BIT
;
2396 accum
>>= HOST_CHAR_BIT
;
2397 unpacked_bytes_left
-= 1;
2398 unpacked_idx
+= delta
;
2402 /* Create a new value of type TYPE from the contents of OBJ starting
2403 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2404 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2405 assigning through the result will set the field fetched from.
2406 VALADDR is ignored unless OBJ is NULL, in which case,
2407 VALADDR+OFFSET must address the start of storage containing the
2408 packed value. The value returned in this case is never an lval.
2409 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2412 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2413 long offset
, int bit_offset
, int bit_size
,
2417 const gdb_byte
*src
; /* First byte containing data to unpack */
2419 const int is_scalar
= is_scalar_type (type
);
2420 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2421 gdb::byte_vector staging
;
2423 type
= ada_check_typedef (type
);
2426 src
= valaddr
+ offset
;
2428 src
= value_contents (obj
) + offset
;
2430 if (is_dynamic_type (type
))
2432 /* The length of TYPE might by dynamic, so we need to resolve
2433 TYPE in order to know its actual size, which we then use
2434 to create the contents buffer of the value we return.
2435 The difficulty is that the data containing our object is
2436 packed, and therefore maybe not at a byte boundary. So, what
2437 we do, is unpack the data into a byte-aligned buffer, and then
2438 use that buffer as our object's value for resolving the type. */
2439 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2440 staging
.resize (staging_len
);
2442 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2443 staging
.data (), staging
.size (),
2444 is_big_endian
, has_negatives (type
),
2446 type
= resolve_dynamic_type (type
, staging
, 0);
2447 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2449 /* This happens when the length of the object is dynamic,
2450 and is actually smaller than the space reserved for it.
2451 For instance, in an array of variant records, the bit_size
2452 we're given is the array stride, which is constant and
2453 normally equal to the maximum size of its element.
2454 But, in reality, each element only actually spans a portion
2456 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2462 v
= allocate_value (type
);
2463 src
= valaddr
+ offset
;
2465 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2467 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2470 v
= value_at (type
, value_address (obj
) + offset
);
2471 buf
= (gdb_byte
*) alloca (src_len
);
2472 read_memory (value_address (v
), buf
, src_len
);
2477 v
= allocate_value (type
);
2478 src
= value_contents (obj
) + offset
;
2483 long new_offset
= offset
;
2485 set_value_component_location (v
, obj
);
2486 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2487 set_value_bitsize (v
, bit_size
);
2488 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2491 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2493 set_value_offset (v
, new_offset
);
2495 /* Also set the parent value. This is needed when trying to
2496 assign a new value (in inferior memory). */
2497 set_value_parent (v
, obj
);
2500 set_value_bitsize (v
, bit_size
);
2501 unpacked
= value_contents_writeable (v
);
2505 memset (unpacked
, 0, TYPE_LENGTH (type
));
2509 if (staging
.size () == TYPE_LENGTH (type
))
2511 /* Small short-cut: If we've unpacked the data into a buffer
2512 of the same size as TYPE's length, then we can reuse that,
2513 instead of doing the unpacking again. */
2514 memcpy (unpacked
, staging
.data (), staging
.size ());
2517 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2518 unpacked
, TYPE_LENGTH (type
),
2519 is_big_endian
, has_negatives (type
), is_scalar
);
2524 /* Store the contents of FROMVAL into the location of TOVAL.
2525 Return a new value with the location of TOVAL and contents of
2526 FROMVAL. Handles assignment into packed fields that have
2527 floating-point or non-scalar types. */
2529 static struct value
*
2530 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2532 struct type
*type
= value_type (toval
);
2533 int bits
= value_bitsize (toval
);
2535 toval
= ada_coerce_ref (toval
);
2536 fromval
= ada_coerce_ref (fromval
);
2538 if (ada_is_direct_array_type (value_type (toval
)))
2539 toval
= ada_coerce_to_simple_array (toval
);
2540 if (ada_is_direct_array_type (value_type (fromval
)))
2541 fromval
= ada_coerce_to_simple_array (fromval
);
2543 if (!deprecated_value_modifiable (toval
))
2544 error (_("Left operand of assignment is not a modifiable lvalue."));
2546 if (VALUE_LVAL (toval
) == lval_memory
2548 && (type
->code () == TYPE_CODE_FLT
2549 || type
->code () == TYPE_CODE_STRUCT
))
2551 int len
= (value_bitpos (toval
)
2552 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2554 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2556 CORE_ADDR to_addr
= value_address (toval
);
2558 if (type
->code () == TYPE_CODE_FLT
)
2559 fromval
= value_cast (type
, fromval
);
2561 read_memory (to_addr
, buffer
, len
);
2562 from_size
= value_bitsize (fromval
);
2564 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2566 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2567 ULONGEST from_offset
= 0;
2568 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2569 from_offset
= from_size
- bits
;
2570 copy_bitwise (buffer
, value_bitpos (toval
),
2571 value_contents (fromval
), from_offset
,
2572 bits
, is_big_endian
);
2573 write_memory_with_notification (to_addr
, buffer
, len
);
2575 val
= value_copy (toval
);
2576 memcpy (value_contents_raw (val
), value_contents (fromval
),
2577 TYPE_LENGTH (type
));
2578 deprecated_set_value_type (val
, type
);
2583 return value_assign (toval
, fromval
);
2587 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2588 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2589 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2590 COMPONENT, and not the inferior's memory. The current contents
2591 of COMPONENT are ignored.
2593 Although not part of the initial design, this function also works
2594 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2595 had a null address, and COMPONENT had an address which is equal to
2596 its offset inside CONTAINER. */
2599 value_assign_to_component (struct value
*container
, struct value
*component
,
2602 LONGEST offset_in_container
=
2603 (LONGEST
) (value_address (component
) - value_address (container
));
2604 int bit_offset_in_container
=
2605 value_bitpos (component
) - value_bitpos (container
);
2608 val
= value_cast (value_type (component
), val
);
2610 if (value_bitsize (component
) == 0)
2611 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2613 bits
= value_bitsize (component
);
2615 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2619 if (is_scalar_type (check_typedef (value_type (component
))))
2621 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2624 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2625 value_bitpos (container
) + bit_offset_in_container
,
2626 value_contents (val
), src_offset
, bits
, 1);
2629 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2630 value_bitpos (container
) + bit_offset_in_container
,
2631 value_contents (val
), 0, bits
, 0);
2634 /* Determine if TYPE is an access to an unconstrained array. */
2637 ada_is_access_to_unconstrained_array (struct type
*type
)
2639 return (type
->code () == TYPE_CODE_TYPEDEF
2640 && is_thick_pntr (ada_typedef_target_type (type
)));
2643 /* The value of the element of array ARR at the ARITY indices given in IND.
2644 ARR may be either a simple array, GNAT array descriptor, or pointer
2648 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2652 struct type
*elt_type
;
2654 elt
= ada_coerce_to_simple_array (arr
);
2656 elt_type
= ada_check_typedef (value_type (elt
));
2657 if (elt_type
->code () == TYPE_CODE_ARRAY
2658 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2659 return value_subscript_packed (elt
, arity
, ind
);
2661 for (k
= 0; k
< arity
; k
+= 1)
2663 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2665 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2666 error (_("too many subscripts (%d expected)"), k
);
2668 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2670 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2671 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2673 /* The element is a typedef to an unconstrained array,
2674 except that the value_subscript call stripped the
2675 typedef layer. The typedef layer is GNAT's way to
2676 specify that the element is, at the source level, an
2677 access to the unconstrained array, rather than the
2678 unconstrained array. So, we need to restore that
2679 typedef layer, which we can do by forcing the element's
2680 type back to its original type. Otherwise, the returned
2681 value is going to be printed as the array, rather
2682 than as an access. Another symptom of the same issue
2683 would be that an expression trying to dereference the
2684 element would also be improperly rejected. */
2685 deprecated_set_value_type (elt
, saved_elt_type
);
2688 elt_type
= ada_check_typedef (value_type (elt
));
2694 /* Assuming ARR is a pointer to a GDB array, the value of the element
2695 of *ARR at the ARITY indices given in IND.
2696 Does not read the entire array into memory.
2698 Note: Unlike what one would expect, this function is used instead of
2699 ada_value_subscript for basically all non-packed array types. The reason
2700 for this is that a side effect of doing our own pointer arithmetics instead
2701 of relying on value_subscript is that there is no implicit typedef peeling.
2702 This is important for arrays of array accesses, where it allows us to
2703 preserve the fact that the array's element is an array access, where the
2704 access part os encoded in a typedef layer. */
2706 static struct value
*
2707 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2710 struct value
*array_ind
= ada_value_ind (arr
);
2712 = check_typedef (value_enclosing_type (array_ind
));
2714 if (type
->code () == TYPE_CODE_ARRAY
2715 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2716 return value_subscript_packed (array_ind
, arity
, ind
);
2718 for (k
= 0; k
< arity
; k
+= 1)
2722 if (type
->code () != TYPE_CODE_ARRAY
)
2723 error (_("too many subscripts (%d expected)"), k
);
2724 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2726 get_discrete_bounds (type
->index_type (), &lwb
, &upb
);
2727 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2728 type
= TYPE_TARGET_TYPE (type
);
2731 return value_ind (arr
);
2734 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2735 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2736 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2737 this array is LOW, as per Ada rules. */
2738 static struct value
*
2739 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2742 struct type
*type0
= ada_check_typedef (type
);
2743 struct type
*base_index_type
= TYPE_TARGET_TYPE (type0
->index_type ());
2744 struct type
*index_type
2745 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2746 struct type
*slice_type
= create_array_type_with_stride
2747 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2748 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2749 TYPE_FIELD_BITSIZE (type0
, 0));
2750 int base_low
= ada_discrete_type_low_bound (type0
->index_type ());
2751 LONGEST base_low_pos
, low_pos
;
2754 if (!discrete_position (base_index_type
, low
, &low_pos
)
2755 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2757 warning (_("unable to get positions in slice, use bounds instead"));
2759 base_low_pos
= base_low
;
2762 base
= value_as_address (array_ptr
)
2763 + ((low_pos
- base_low_pos
)
2764 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2765 return value_at_lazy (slice_type
, base
);
2769 static struct value
*
2770 ada_value_slice (struct value
*array
, int low
, int high
)
2772 struct type
*type
= ada_check_typedef (value_type (array
));
2773 struct type
*base_index_type
= TYPE_TARGET_TYPE (type
->index_type ());
2774 struct type
*index_type
2775 = create_static_range_type (NULL
, type
->index_type (), low
, high
);
2776 struct type
*slice_type
= create_array_type_with_stride
2777 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2778 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2779 TYPE_FIELD_BITSIZE (type
, 0));
2780 LONGEST low_pos
, high_pos
;
2782 if (!discrete_position (base_index_type
, low
, &low_pos
)
2783 || !discrete_position (base_index_type
, high
, &high_pos
))
2785 warning (_("unable to get positions in slice, use bounds instead"));
2790 return value_cast (slice_type
,
2791 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2794 /* If type is a record type in the form of a standard GNAT array
2795 descriptor, returns the number of dimensions for type. If arr is a
2796 simple array, returns the number of "array of"s that prefix its
2797 type designation. Otherwise, returns 0. */
2800 ada_array_arity (struct type
*type
)
2807 type
= desc_base_type (type
);
2810 if (type
->code () == TYPE_CODE_STRUCT
)
2811 return desc_arity (desc_bounds_type (type
));
2813 while (type
->code () == TYPE_CODE_ARRAY
)
2816 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2822 /* If TYPE is a record type in the form of a standard GNAT array
2823 descriptor or a simple array type, returns the element type for
2824 TYPE after indexing by NINDICES indices, or by all indices if
2825 NINDICES is -1. Otherwise, returns NULL. */
2828 ada_array_element_type (struct type
*type
, int nindices
)
2830 type
= desc_base_type (type
);
2832 if (type
->code () == TYPE_CODE_STRUCT
)
2835 struct type
*p_array_type
;
2837 p_array_type
= desc_data_target_type (type
);
2839 k
= ada_array_arity (type
);
2843 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2844 if (nindices
>= 0 && k
> nindices
)
2846 while (k
> 0 && p_array_type
!= NULL
)
2848 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2851 return p_array_type
;
2853 else if (type
->code () == TYPE_CODE_ARRAY
)
2855 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2857 type
= TYPE_TARGET_TYPE (type
);
2866 /* The type of nth index in arrays of given type (n numbering from 1).
2867 Does not examine memory. Throws an error if N is invalid or TYPE
2868 is not an array type. NAME is the name of the Ada attribute being
2869 evaluated ('range, 'first, 'last, or 'length); it is used in building
2870 the error message. */
2872 static struct type
*
2873 ada_index_type (struct type
*type
, int n
, const char *name
)
2875 struct type
*result_type
;
2877 type
= desc_base_type (type
);
2879 if (n
< 0 || n
> ada_array_arity (type
))
2880 error (_("invalid dimension number to '%s"), name
);
2882 if (ada_is_simple_array_type (type
))
2886 for (i
= 1; i
< n
; i
+= 1)
2887 type
= TYPE_TARGET_TYPE (type
);
2888 result_type
= TYPE_TARGET_TYPE (type
->index_type ());
2889 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2890 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2891 perhaps stabsread.c would make more sense. */
2892 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2897 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2898 if (result_type
== NULL
)
2899 error (_("attempt to take bound of something that is not an array"));
2905 /* Given that arr is an array type, returns the lower bound of the
2906 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2907 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2908 array-descriptor type. It works for other arrays with bounds supplied
2909 by run-time quantities other than discriminants. */
2912 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2914 struct type
*type
, *index_type_desc
, *index_type
;
2917 gdb_assert (which
== 0 || which
== 1);
2919 if (ada_is_constrained_packed_array_type (arr_type
))
2920 arr_type
= decode_constrained_packed_array_type (arr_type
);
2922 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2923 return (LONGEST
) - which
;
2925 if (arr_type
->code () == TYPE_CODE_PTR
)
2926 type
= TYPE_TARGET_TYPE (arr_type
);
2930 if (TYPE_FIXED_INSTANCE (type
))
2932 /* The array has already been fixed, so we do not need to
2933 check the parallel ___XA type again. That encoding has
2934 already been applied, so ignore it now. */
2935 index_type_desc
= NULL
;
2939 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2940 ada_fixup_array_indexes_type (index_type_desc
);
2943 if (index_type_desc
!= NULL
)
2944 index_type
= to_fixed_range_type (index_type_desc
->field (n
- 1).type (),
2948 struct type
*elt_type
= check_typedef (type
);
2950 for (i
= 1; i
< n
; i
++)
2951 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
2953 index_type
= elt_type
->index_type ();
2957 (LONGEST
) (which
== 0
2958 ? ada_discrete_type_low_bound (index_type
)
2959 : ada_discrete_type_high_bound (index_type
));
2962 /* Given that arr is an array value, returns the lower bound of the
2963 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2964 WHICH is 1. This routine will also work for arrays with bounds
2965 supplied by run-time quantities other than discriminants. */
2968 ada_array_bound (struct value
*arr
, int n
, int which
)
2970 struct type
*arr_type
;
2972 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2973 arr
= value_ind (arr
);
2974 arr_type
= value_enclosing_type (arr
);
2976 if (ada_is_constrained_packed_array_type (arr_type
))
2977 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2978 else if (ada_is_simple_array_type (arr_type
))
2979 return ada_array_bound_from_type (arr_type
, n
, which
);
2981 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2984 /* Given that arr is an array value, returns the length of the
2985 nth index. This routine will also work for arrays with bounds
2986 supplied by run-time quantities other than discriminants.
2987 Does not work for arrays indexed by enumeration types with representation
2988 clauses at the moment. */
2991 ada_array_length (struct value
*arr
, int n
)
2993 struct type
*arr_type
, *index_type
;
2996 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2997 arr
= value_ind (arr
);
2998 arr_type
= value_enclosing_type (arr
);
3000 if (ada_is_constrained_packed_array_type (arr_type
))
3001 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3003 if (ada_is_simple_array_type (arr_type
))
3005 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3006 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3010 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3011 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3014 arr_type
= check_typedef (arr_type
);
3015 index_type
= ada_index_type (arr_type
, n
, "length");
3016 if (index_type
!= NULL
)
3018 struct type
*base_type
;
3019 if (index_type
->code () == TYPE_CODE_RANGE
)
3020 base_type
= TYPE_TARGET_TYPE (index_type
);
3022 base_type
= index_type
;
3024 low
= pos_atr (value_from_longest (base_type
, low
));
3025 high
= pos_atr (value_from_longest (base_type
, high
));
3027 return high
- low
+ 1;
3030 /* An array whose type is that of ARR_TYPE (an array type), with
3031 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3032 less than LOW, then LOW-1 is used. */
3034 static struct value
*
3035 empty_array (struct type
*arr_type
, int low
, int high
)
3037 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3038 struct type
*index_type
3039 = create_static_range_type
3040 (NULL
, TYPE_TARGET_TYPE (arr_type0
->index_type ()), low
,
3041 high
< low
? low
- 1 : high
);
3042 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3044 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3048 /* Name resolution */
3050 /* The "decoded" name for the user-definable Ada operator corresponding
3054 ada_decoded_op_name (enum exp_opcode op
)
3058 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3060 if (ada_opname_table
[i
].op
== op
)
3061 return ada_opname_table
[i
].decoded
;
3063 error (_("Could not find operator name for opcode"));
3066 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3067 in a listing of choices during disambiguation (see sort_choices, below).
3068 The idea is that overloadings of a subprogram name from the
3069 same package should sort in their source order. We settle for ordering
3070 such symbols by their trailing number (__N or $N). */
3073 encoded_ordered_before (const char *N0
, const char *N1
)
3077 else if (N0
== NULL
)
3083 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3085 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3087 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3088 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3093 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3096 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3098 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3099 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3101 return (strcmp (N0
, N1
) < 0);
3105 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3109 sort_choices (struct block_symbol syms
[], int nsyms
)
3113 for (i
= 1; i
< nsyms
; i
+= 1)
3115 struct block_symbol sym
= syms
[i
];
3118 for (j
= i
- 1; j
>= 0; j
-= 1)
3120 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3121 sym
.symbol
->linkage_name ()))
3123 syms
[j
+ 1] = syms
[j
];
3129 /* Whether GDB should display formals and return types for functions in the
3130 overloads selection menu. */
3131 static bool print_signatures
= true;
3133 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3134 all but functions, the signature is just the name of the symbol. For
3135 functions, this is the name of the function, the list of types for formals
3136 and the return type (if any). */
3139 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3140 const struct type_print_options
*flags
)
3142 struct type
*type
= SYMBOL_TYPE (sym
);
3144 fprintf_filtered (stream
, "%s", sym
->print_name ());
3145 if (!print_signatures
3147 || type
->code () != TYPE_CODE_FUNC
)
3150 if (type
->num_fields () > 0)
3154 fprintf_filtered (stream
, " (");
3155 for (i
= 0; i
< type
->num_fields (); ++i
)
3158 fprintf_filtered (stream
, "; ");
3159 ada_print_type (type
->field (i
).type (), NULL
, stream
, -1, 0,
3162 fprintf_filtered (stream
, ")");
3164 if (TYPE_TARGET_TYPE (type
) != NULL
3165 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3167 fprintf_filtered (stream
, " return ");
3168 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3172 /* Read and validate a set of numeric choices from the user in the
3173 range 0 .. N_CHOICES-1. Place the results in increasing
3174 order in CHOICES[0 .. N-1], and return N.
3176 The user types choices as a sequence of numbers on one line
3177 separated by blanks, encoding them as follows:
3179 + A choice of 0 means to cancel the selection, throwing an error.
3180 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3181 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3183 The user is not allowed to choose more than MAX_RESULTS values.
3185 ANNOTATION_SUFFIX, if present, is used to annotate the input
3186 prompts (for use with the -f switch). */
3189 get_selections (int *choices
, int n_choices
, int max_results
,
3190 int is_all_choice
, const char *annotation_suffix
)
3195 int first_choice
= is_all_choice
? 2 : 1;
3197 prompt
= getenv ("PS2");
3201 args
= command_line_input (prompt
, annotation_suffix
);
3204 error_no_arg (_("one or more choice numbers"));
3208 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3209 order, as given in args. Choices are validated. */
3215 args
= skip_spaces (args
);
3216 if (*args
== '\0' && n_chosen
== 0)
3217 error_no_arg (_("one or more choice numbers"));
3218 else if (*args
== '\0')
3221 choice
= strtol (args
, &args2
, 10);
3222 if (args
== args2
|| choice
< 0
3223 || choice
> n_choices
+ first_choice
- 1)
3224 error (_("Argument must be choice number"));
3228 error (_("cancelled"));
3230 if (choice
< first_choice
)
3232 n_chosen
= n_choices
;
3233 for (j
= 0; j
< n_choices
; j
+= 1)
3237 choice
-= first_choice
;
3239 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3243 if (j
< 0 || choice
!= choices
[j
])
3247 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3248 choices
[k
+ 1] = choices
[k
];
3249 choices
[j
+ 1] = choice
;
3254 if (n_chosen
> max_results
)
3255 error (_("Select no more than %d of the above"), max_results
);
3260 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3261 by asking the user (if necessary), returning the number selected,
3262 and setting the first elements of SYMS items. Error if no symbols
3265 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3266 to be re-integrated one of these days. */
3269 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3272 int *chosen
= XALLOCAVEC (int , nsyms
);
3274 int first_choice
= (max_results
== 1) ? 1 : 2;
3275 const char *select_mode
= multiple_symbols_select_mode ();
3277 if (max_results
< 1)
3278 error (_("Request to select 0 symbols!"));
3282 if (select_mode
== multiple_symbols_cancel
)
3284 canceled because the command is ambiguous\n\
3285 See set/show multiple-symbol."));
3287 /* If select_mode is "all", then return all possible symbols.
3288 Only do that if more than one symbol can be selected, of course.
3289 Otherwise, display the menu as usual. */
3290 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3293 printf_filtered (_("[0] cancel\n"));
3294 if (max_results
> 1)
3295 printf_filtered (_("[1] all\n"));
3297 sort_choices (syms
, nsyms
);
3299 for (i
= 0; i
< nsyms
; i
+= 1)
3301 if (syms
[i
].symbol
== NULL
)
3304 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3306 struct symtab_and_line sal
=
3307 find_function_start_sal (syms
[i
].symbol
, 1);
3309 printf_filtered ("[%d] ", i
+ first_choice
);
3310 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3311 &type_print_raw_options
);
3312 if (sal
.symtab
== NULL
)
3313 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3314 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3318 styled_string (file_name_style
.style (),
3319 symtab_to_filename_for_display (sal
.symtab
)),
3326 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3327 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3328 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3329 struct symtab
*symtab
= NULL
;
3331 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3332 symtab
= symbol_symtab (syms
[i
].symbol
);
3334 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3336 printf_filtered ("[%d] ", i
+ first_choice
);
3337 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3338 &type_print_raw_options
);
3339 printf_filtered (_(" at %s:%d\n"),
3340 symtab_to_filename_for_display (symtab
),
3341 SYMBOL_LINE (syms
[i
].symbol
));
3343 else if (is_enumeral
3344 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3346 printf_filtered (("[%d] "), i
+ first_choice
);
3347 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3348 gdb_stdout
, -1, 0, &type_print_raw_options
);
3349 printf_filtered (_("'(%s) (enumeral)\n"),
3350 syms
[i
].symbol
->print_name ());
3354 printf_filtered ("[%d] ", i
+ first_choice
);
3355 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3356 &type_print_raw_options
);
3359 printf_filtered (is_enumeral
3360 ? _(" in %s (enumeral)\n")
3362 symtab_to_filename_for_display (symtab
));
3364 printf_filtered (is_enumeral
3365 ? _(" (enumeral)\n")
3371 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3374 for (i
= 0; i
< n_chosen
; i
+= 1)
3375 syms
[i
] = syms
[chosen
[i
]];
3380 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3381 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3382 undefined namespace) and converts operators that are
3383 user-defined into appropriate function calls. If CONTEXT_TYPE is
3384 non-null, it provides a preferred result type [at the moment, only
3385 type void has any effect---causing procedures to be preferred over
3386 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3387 return type is preferred. May change (expand) *EXP. */
3390 resolve (expression_up
*expp
, int void_context_p
, int parse_completion
,
3391 innermost_block_tracker
*tracker
)
3393 struct type
*context_type
= NULL
;
3397 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3399 resolve_subexp (expp
, &pc
, 1, context_type
, parse_completion
, tracker
);
3402 /* Resolve the operator of the subexpression beginning at
3403 position *POS of *EXPP. "Resolving" consists of replacing
3404 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3405 with their resolutions, replacing built-in operators with
3406 function calls to user-defined operators, where appropriate, and,
3407 when DEPROCEDURE_P is non-zero, converting function-valued variables
3408 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3409 are as in ada_resolve, above. */
3411 static struct value
*
3412 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3413 struct type
*context_type
, int parse_completion
,
3414 innermost_block_tracker
*tracker
)
3418 struct expression
*exp
; /* Convenience: == *expp. */
3419 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3420 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3421 int nargs
; /* Number of operands. */
3428 /* Pass one: resolve operands, saving their types and updating *pos,
3433 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3434 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3439 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3441 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3446 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3451 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3452 parse_completion
, tracker
);
3455 case OP_ATR_MODULUS
:
3465 case TERNOP_IN_RANGE
:
3466 case BINOP_IN_BOUNDS
:
3472 case OP_DISCRETE_RANGE
:
3474 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3483 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3485 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3487 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3505 case BINOP_LOGICAL_AND
:
3506 case BINOP_LOGICAL_OR
:
3507 case BINOP_BITWISE_AND
:
3508 case BINOP_BITWISE_IOR
:
3509 case BINOP_BITWISE_XOR
:
3512 case BINOP_NOTEQUAL
:
3519 case BINOP_SUBSCRIPT
:
3527 case UNOP_LOGICAL_NOT
:
3537 case OP_VAR_MSYM_VALUE
:
3544 case OP_INTERNALVAR
:
3554 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3557 case STRUCTOP_STRUCT
:
3558 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3571 error (_("Unexpected operator during name resolution"));
3574 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3575 for (i
= 0; i
< nargs
; i
+= 1)
3576 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
,
3581 /* Pass two: perform any resolution on principal operator. */
3588 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3590 std::vector
<struct block_symbol
> candidates
;
3594 ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3595 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3598 if (n_candidates
> 1)
3600 /* Types tend to get re-introduced locally, so if there
3601 are any local symbols that are not types, first filter
3604 for (j
= 0; j
< n_candidates
; j
+= 1)
3605 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3610 case LOC_REGPARM_ADDR
:
3618 if (j
< n_candidates
)
3621 while (j
< n_candidates
)
3623 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3625 candidates
[j
] = candidates
[n_candidates
- 1];
3634 if (n_candidates
== 0)
3635 error (_("No definition found for %s"),
3636 exp
->elts
[pc
+ 2].symbol
->print_name ());
3637 else if (n_candidates
== 1)
3639 else if (deprocedure_p
3640 && !is_nonfunction (candidates
.data (), n_candidates
))
3642 i
= ada_resolve_function
3643 (candidates
.data (), n_candidates
, NULL
, 0,
3644 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3645 context_type
, parse_completion
);
3647 error (_("Could not find a match for %s"),
3648 exp
->elts
[pc
+ 2].symbol
->print_name ());
3652 printf_filtered (_("Multiple matches for %s\n"),
3653 exp
->elts
[pc
+ 2].symbol
->print_name ());
3654 user_select_syms (candidates
.data (), n_candidates
, 1);
3658 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3659 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3660 tracker
->update (candidates
[i
]);
3664 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3667 replace_operator_with_call (expp
, pc
, 0, 4,
3668 exp
->elts
[pc
+ 2].symbol
,
3669 exp
->elts
[pc
+ 1].block
);
3676 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3677 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3679 std::vector
<struct block_symbol
> candidates
;
3683 ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3684 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3687 if (n_candidates
== 1)
3691 i
= ada_resolve_function
3692 (candidates
.data (), n_candidates
,
3694 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3695 context_type
, parse_completion
);
3697 error (_("Could not find a match for %s"),
3698 exp
->elts
[pc
+ 5].symbol
->print_name ());
3701 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3702 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3703 tracker
->update (candidates
[i
]);
3714 case BINOP_BITWISE_AND
:
3715 case BINOP_BITWISE_IOR
:
3716 case BINOP_BITWISE_XOR
:
3718 case BINOP_NOTEQUAL
:
3726 case UNOP_LOGICAL_NOT
:
3728 if (possible_user_operator_p (op
, argvec
))
3730 std::vector
<struct block_symbol
> candidates
;
3734 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3738 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3739 nargs
, ada_decoded_op_name (op
), NULL
,
3744 replace_operator_with_call (expp
, pc
, nargs
, 1,
3745 candidates
[i
].symbol
,
3746 candidates
[i
].block
);
3757 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3758 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3759 exp
->elts
[pc
+ 1].objfile
,
3760 exp
->elts
[pc
+ 2].msymbol
);
3762 return evaluate_subexp_type (exp
, pos
);
3765 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3766 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3768 /* The term "match" here is rather loose. The match is heuristic and
3772 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3774 ftype
= ada_check_typedef (ftype
);
3775 atype
= ada_check_typedef (atype
);
3777 if (ftype
->code () == TYPE_CODE_REF
)
3778 ftype
= TYPE_TARGET_TYPE (ftype
);
3779 if (atype
->code () == TYPE_CODE_REF
)
3780 atype
= TYPE_TARGET_TYPE (atype
);
3782 switch (ftype
->code ())
3785 return ftype
->code () == atype
->code ();
3787 if (atype
->code () == TYPE_CODE_PTR
)
3788 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3789 TYPE_TARGET_TYPE (atype
), 0);
3792 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3794 case TYPE_CODE_ENUM
:
3795 case TYPE_CODE_RANGE
:
3796 switch (atype
->code ())
3799 case TYPE_CODE_ENUM
:
3800 case TYPE_CODE_RANGE
:
3806 case TYPE_CODE_ARRAY
:
3807 return (atype
->code () == TYPE_CODE_ARRAY
3808 || ada_is_array_descriptor_type (atype
));
3810 case TYPE_CODE_STRUCT
:
3811 if (ada_is_array_descriptor_type (ftype
))
3812 return (atype
->code () == TYPE_CODE_ARRAY
3813 || ada_is_array_descriptor_type (atype
));
3815 return (atype
->code () == TYPE_CODE_STRUCT
3816 && !ada_is_array_descriptor_type (atype
));
3818 case TYPE_CODE_UNION
:
3820 return (atype
->code () == ftype
->code ());
3824 /* Return non-zero if the formals of FUNC "sufficiently match" the
3825 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3826 may also be an enumeral, in which case it is treated as a 0-
3827 argument function. */
3830 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3833 struct type
*func_type
= SYMBOL_TYPE (func
);
3835 if (SYMBOL_CLASS (func
) == LOC_CONST
3836 && func_type
->code () == TYPE_CODE_ENUM
)
3837 return (n_actuals
== 0);
3838 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3841 if (func_type
->num_fields () != n_actuals
)
3844 for (i
= 0; i
< n_actuals
; i
+= 1)
3846 if (actuals
[i
] == NULL
)
3850 struct type
*ftype
= ada_check_typedef (func_type
->field (i
).type ());
3851 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3853 if (!ada_type_match (ftype
, atype
, 1))
3860 /* False iff function type FUNC_TYPE definitely does not produce a value
3861 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3862 FUNC_TYPE is not a valid function type with a non-null return type
3863 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3866 return_match (struct type
*func_type
, struct type
*context_type
)
3868 struct type
*return_type
;
3870 if (func_type
== NULL
)
3873 if (func_type
->code () == TYPE_CODE_FUNC
)
3874 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3876 return_type
= get_base_type (func_type
);
3877 if (return_type
== NULL
)
3880 context_type
= get_base_type (context_type
);
3882 if (return_type
->code () == TYPE_CODE_ENUM
)
3883 return context_type
== NULL
|| return_type
== context_type
;
3884 else if (context_type
== NULL
)
3885 return return_type
->code () != TYPE_CODE_VOID
;
3887 return return_type
->code () == context_type
->code ();
3891 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3892 function (if any) that matches the types of the NARGS arguments in
3893 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3894 that returns that type, then eliminate matches that don't. If
3895 CONTEXT_TYPE is void and there is at least one match that does not
3896 return void, eliminate all matches that do.
3898 Asks the user if there is more than one match remaining. Returns -1
3899 if there is no such symbol or none is selected. NAME is used
3900 solely for messages. May re-arrange and modify SYMS in
3901 the process; the index returned is for the modified vector. */
3904 ada_resolve_function (struct block_symbol syms
[],
3905 int nsyms
, struct value
**args
, int nargs
,
3906 const char *name
, struct type
*context_type
,
3907 int parse_completion
)
3911 int m
; /* Number of hits */
3914 /* In the first pass of the loop, we only accept functions matching
3915 context_type. If none are found, we add a second pass of the loop
3916 where every function is accepted. */
3917 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3919 for (k
= 0; k
< nsyms
; k
+= 1)
3921 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3923 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3924 && (fallback
|| return_match (type
, context_type
)))
3932 /* If we got multiple matches, ask the user which one to use. Don't do this
3933 interactive thing during completion, though, as the purpose of the
3934 completion is providing a list of all possible matches. Prompting the
3935 user to filter it down would be completely unexpected in this case. */
3938 else if (m
> 1 && !parse_completion
)
3940 printf_filtered (_("Multiple matches for %s\n"), name
);
3941 user_select_syms (syms
, m
, 1);
3947 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3948 on the function identified by SYM and BLOCK, and taking NARGS
3949 arguments. Update *EXPP as needed to hold more space. */
3952 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
3953 int oplen
, struct symbol
*sym
,
3954 const struct block
*block
)
3956 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3957 symbol, -oplen for operator being replaced). */
3958 struct expression
*newexp
= (struct expression
*)
3959 xzalloc (sizeof (struct expression
)
3960 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3961 struct expression
*exp
= expp
->get ();
3963 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3964 newexp
->language_defn
= exp
->language_defn
;
3965 newexp
->gdbarch
= exp
->gdbarch
;
3966 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3967 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3968 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3970 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3971 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3973 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3974 newexp
->elts
[pc
+ 4].block
= block
;
3975 newexp
->elts
[pc
+ 5].symbol
= sym
;
3977 expp
->reset (newexp
);
3980 /* Type-class predicates */
3982 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3986 numeric_type_p (struct type
*type
)
3992 switch (type
->code ())
3997 case TYPE_CODE_RANGE
:
3998 return (type
== TYPE_TARGET_TYPE (type
)
3999 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4006 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4009 integer_type_p (struct type
*type
)
4015 switch (type
->code ())
4019 case TYPE_CODE_RANGE
:
4020 return (type
== TYPE_TARGET_TYPE (type
)
4021 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4028 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4031 scalar_type_p (struct type
*type
)
4037 switch (type
->code ())
4040 case TYPE_CODE_RANGE
:
4041 case TYPE_CODE_ENUM
:
4050 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4053 discrete_type_p (struct type
*type
)
4059 switch (type
->code ())
4062 case TYPE_CODE_RANGE
:
4063 case TYPE_CODE_ENUM
:
4064 case TYPE_CODE_BOOL
:
4072 /* Returns non-zero if OP with operands in the vector ARGS could be
4073 a user-defined function. Errs on the side of pre-defined operators
4074 (i.e., result 0). */
4077 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4079 struct type
*type0
=
4080 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4081 struct type
*type1
=
4082 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4096 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4100 case BINOP_BITWISE_AND
:
4101 case BINOP_BITWISE_IOR
:
4102 case BINOP_BITWISE_XOR
:
4103 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4106 case BINOP_NOTEQUAL
:
4111 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4114 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4117 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4121 case UNOP_LOGICAL_NOT
:
4123 return (!numeric_type_p (type0
));
4132 1. In the following, we assume that a renaming type's name may
4133 have an ___XD suffix. It would be nice if this went away at some
4135 2. We handle both the (old) purely type-based representation of
4136 renamings and the (new) variable-based encoding. At some point,
4137 it is devoutly to be hoped that the former goes away
4138 (FIXME: hilfinger-2007-07-09).
4139 3. Subprogram renamings are not implemented, although the XRS
4140 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4142 /* If SYM encodes a renaming,
4144 <renaming> renames <renamed entity>,
4146 sets *LEN to the length of the renamed entity's name,
4147 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4148 the string describing the subcomponent selected from the renamed
4149 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4150 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4151 are undefined). Otherwise, returns a value indicating the category
4152 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4153 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4154 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4155 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4156 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4157 may be NULL, in which case they are not assigned.
4159 [Currently, however, GCC does not generate subprogram renamings.] */
4161 enum ada_renaming_category
4162 ada_parse_renaming (struct symbol
*sym
,
4163 const char **renamed_entity
, int *len
,
4164 const char **renaming_expr
)
4166 enum ada_renaming_category kind
;
4171 return ADA_NOT_RENAMING
;
4172 switch (SYMBOL_CLASS (sym
))
4175 return ADA_NOT_RENAMING
;
4179 case LOC_OPTIMIZED_OUT
:
4180 info
= strstr (sym
->linkage_name (), "___XR");
4182 return ADA_NOT_RENAMING
;
4186 kind
= ADA_OBJECT_RENAMING
;
4190 kind
= ADA_EXCEPTION_RENAMING
;
4194 kind
= ADA_PACKAGE_RENAMING
;
4198 kind
= ADA_SUBPROGRAM_RENAMING
;
4202 return ADA_NOT_RENAMING
;
4206 if (renamed_entity
!= NULL
)
4207 *renamed_entity
= info
;
4208 suffix
= strstr (info
, "___XE");
4209 if (suffix
== NULL
|| suffix
== info
)
4210 return ADA_NOT_RENAMING
;
4212 *len
= strlen (info
) - strlen (suffix
);
4214 if (renaming_expr
!= NULL
)
4215 *renaming_expr
= suffix
;
4219 /* Compute the value of the given RENAMING_SYM, which is expected to
4220 be a symbol encoding a renaming expression. BLOCK is the block
4221 used to evaluate the renaming. */
4223 static struct value
*
4224 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4225 const struct block
*block
)
4227 const char *sym_name
;
4229 sym_name
= renaming_sym
->linkage_name ();
4230 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4231 return evaluate_expression (expr
.get ());
4235 /* Evaluation: Function Calls */
4237 /* Return an lvalue containing the value VAL. This is the identity on
4238 lvalues, and otherwise has the side-effect of allocating memory
4239 in the inferior where a copy of the value contents is copied. */
4241 static struct value
*
4242 ensure_lval (struct value
*val
)
4244 if (VALUE_LVAL (val
) == not_lval
4245 || VALUE_LVAL (val
) == lval_internalvar
)
4247 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4248 const CORE_ADDR addr
=
4249 value_as_long (value_allocate_space_in_inferior (len
));
4251 VALUE_LVAL (val
) = lval_memory
;
4252 set_value_address (val
, addr
);
4253 write_memory (addr
, value_contents (val
), len
);
4259 /* Given ARG, a value of type (pointer or reference to a)*
4260 structure/union, extract the component named NAME from the ultimate
4261 target structure/union and return it as a value with its
4264 The routine searches for NAME among all members of the structure itself
4265 and (recursively) among all members of any wrapper members
4268 If NO_ERR, then simply return NULL in case of error, rather than
4271 static struct value
*
4272 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4274 struct type
*t
, *t1
;
4279 t1
= t
= ada_check_typedef (value_type (arg
));
4280 if (t
->code () == TYPE_CODE_REF
)
4282 t1
= TYPE_TARGET_TYPE (t
);
4285 t1
= ada_check_typedef (t1
);
4286 if (t1
->code () == TYPE_CODE_PTR
)
4288 arg
= coerce_ref (arg
);
4293 while (t
->code () == TYPE_CODE_PTR
)
4295 t1
= TYPE_TARGET_TYPE (t
);
4298 t1
= ada_check_typedef (t1
);
4299 if (t1
->code () == TYPE_CODE_PTR
)
4301 arg
= value_ind (arg
);
4308 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4312 v
= ada_search_struct_field (name
, arg
, 0, t
);
4315 int bit_offset
, bit_size
, byte_offset
;
4316 struct type
*field_type
;
4319 if (t
->code () == TYPE_CODE_PTR
)
4320 address
= value_address (ada_value_ind (arg
));
4322 address
= value_address (ada_coerce_ref (arg
));
4324 /* Check to see if this is a tagged type. We also need to handle
4325 the case where the type is a reference to a tagged type, but
4326 we have to be careful to exclude pointers to tagged types.
4327 The latter should be shown as usual (as a pointer), whereas
4328 a reference should mostly be transparent to the user. */
4330 if (ada_is_tagged_type (t1
, 0)
4331 || (t1
->code () == TYPE_CODE_REF
4332 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4334 /* We first try to find the searched field in the current type.
4335 If not found then let's look in the fixed type. */
4337 if (!find_struct_field (name
, t1
, 0,
4338 &field_type
, &byte_offset
, &bit_offset
,
4347 /* Convert to fixed type in all cases, so that we have proper
4348 offsets to each field in unconstrained record types. */
4349 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4350 address
, NULL
, check_tag
);
4352 if (find_struct_field (name
, t1
, 0,
4353 &field_type
, &byte_offset
, &bit_offset
,
4358 if (t
->code () == TYPE_CODE_REF
)
4359 arg
= ada_coerce_ref (arg
);
4361 arg
= ada_value_ind (arg
);
4362 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4363 bit_offset
, bit_size
,
4367 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4371 if (v
!= NULL
|| no_err
)
4374 error (_("There is no member named %s."), name
);
4380 error (_("Attempt to extract a component of "
4381 "a value that is not a record."));
4384 /* Return the value ACTUAL, converted to be an appropriate value for a
4385 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4386 allocating any necessary descriptors (fat pointers), or copies of
4387 values not residing in memory, updating it as needed. */
4390 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4392 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4393 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4394 struct type
*formal_target
=
4395 formal_type
->code () == TYPE_CODE_PTR
4396 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4397 struct type
*actual_target
=
4398 actual_type
->code () == TYPE_CODE_PTR
4399 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4401 if (ada_is_array_descriptor_type (formal_target
)
4402 && actual_target
->code () == TYPE_CODE_ARRAY
)
4403 return make_array_descriptor (formal_type
, actual
);
4404 else if (formal_type
->code () == TYPE_CODE_PTR
4405 || formal_type
->code () == TYPE_CODE_REF
)
4407 struct value
*result
;
4409 if (formal_target
->code () == TYPE_CODE_ARRAY
4410 && ada_is_array_descriptor_type (actual_target
))
4411 result
= desc_data (actual
);
4412 else if (formal_type
->code () != TYPE_CODE_PTR
)
4414 if (VALUE_LVAL (actual
) != lval_memory
)
4418 actual_type
= ada_check_typedef (value_type (actual
));
4419 val
= allocate_value (actual_type
);
4420 memcpy ((char *) value_contents_raw (val
),
4421 (char *) value_contents (actual
),
4422 TYPE_LENGTH (actual_type
));
4423 actual
= ensure_lval (val
);
4425 result
= value_addr (actual
);
4429 return value_cast_pointers (formal_type
, result
, 0);
4431 else if (actual_type
->code () == TYPE_CODE_PTR
)
4432 return ada_value_ind (actual
);
4433 else if (ada_is_aligner_type (formal_type
))
4435 /* We need to turn this parameter into an aligner type
4437 struct value
*aligner
= allocate_value (formal_type
);
4438 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4440 value_assign_to_component (aligner
, component
, actual
);
4447 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4448 type TYPE. This is usually an inefficient no-op except on some targets
4449 (such as AVR) where the representation of a pointer and an address
4453 value_pointer (struct value
*value
, struct type
*type
)
4455 struct gdbarch
*gdbarch
= get_type_arch (type
);
4456 unsigned len
= TYPE_LENGTH (type
);
4457 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4460 addr
= value_address (value
);
4461 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4462 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4467 /* Push a descriptor of type TYPE for array value ARR on the stack at
4468 *SP, updating *SP to reflect the new descriptor. Return either
4469 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4470 to-descriptor type rather than a descriptor type), a struct value *
4471 representing a pointer to this descriptor. */
4473 static struct value
*
4474 make_array_descriptor (struct type
*type
, struct value
*arr
)
4476 struct type
*bounds_type
= desc_bounds_type (type
);
4477 struct type
*desc_type
= desc_base_type (type
);
4478 struct value
*descriptor
= allocate_value (desc_type
);
4479 struct value
*bounds
= allocate_value (bounds_type
);
4482 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4485 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4486 ada_array_bound (arr
, i
, 0),
4487 desc_bound_bitpos (bounds_type
, i
, 0),
4488 desc_bound_bitsize (bounds_type
, i
, 0));
4489 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4490 ada_array_bound (arr
, i
, 1),
4491 desc_bound_bitpos (bounds_type
, i
, 1),
4492 desc_bound_bitsize (bounds_type
, i
, 1));
4495 bounds
= ensure_lval (bounds
);
4497 modify_field (value_type (descriptor
),
4498 value_contents_writeable (descriptor
),
4499 value_pointer (ensure_lval (arr
),
4500 desc_type
->field (0).type ()),
4501 fat_pntr_data_bitpos (desc_type
),
4502 fat_pntr_data_bitsize (desc_type
));
4504 modify_field (value_type (descriptor
),
4505 value_contents_writeable (descriptor
),
4506 value_pointer (bounds
,
4507 desc_type
->field (1).type ()),
4508 fat_pntr_bounds_bitpos (desc_type
),
4509 fat_pntr_bounds_bitsize (desc_type
));
4511 descriptor
= ensure_lval (descriptor
);
4513 if (type
->code () == TYPE_CODE_PTR
)
4514 return value_addr (descriptor
);
4519 /* Symbol Cache Module */
4521 /* Performance measurements made as of 2010-01-15 indicate that
4522 this cache does bring some noticeable improvements. Depending
4523 on the type of entity being printed, the cache can make it as much
4524 as an order of magnitude faster than without it.
4526 The descriptive type DWARF extension has significantly reduced
4527 the need for this cache, at least when DWARF is being used. However,
4528 even in this case, some expensive name-based symbol searches are still
4529 sometimes necessary - to find an XVZ variable, mostly. */
4531 /* Initialize the contents of SYM_CACHE. */
4534 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4536 obstack_init (&sym_cache
->cache_space
);
4537 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4540 /* Free the memory used by SYM_CACHE. */
4543 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4545 obstack_free (&sym_cache
->cache_space
, NULL
);
4549 /* Return the symbol cache associated to the given program space PSPACE.
4550 If not allocated for this PSPACE yet, allocate and initialize one. */
4552 static struct ada_symbol_cache
*
4553 ada_get_symbol_cache (struct program_space
*pspace
)
4555 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4557 if (pspace_data
->sym_cache
== NULL
)
4559 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4560 ada_init_symbol_cache (pspace_data
->sym_cache
);
4563 return pspace_data
->sym_cache
;
4566 /* Clear all entries from the symbol cache. */
4569 ada_clear_symbol_cache (void)
4571 struct ada_symbol_cache
*sym_cache
4572 = ada_get_symbol_cache (current_program_space
);
4574 obstack_free (&sym_cache
->cache_space
, NULL
);
4575 ada_init_symbol_cache (sym_cache
);
4578 /* Search our cache for an entry matching NAME and DOMAIN.
4579 Return it if found, or NULL otherwise. */
4581 static struct cache_entry
**
4582 find_entry (const char *name
, domain_enum domain
)
4584 struct ada_symbol_cache
*sym_cache
4585 = ada_get_symbol_cache (current_program_space
);
4586 int h
= msymbol_hash (name
) % HASH_SIZE
;
4587 struct cache_entry
**e
;
4589 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4591 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4597 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4598 Return 1 if found, 0 otherwise.
4600 If an entry was found and SYM is not NULL, set *SYM to the entry's
4601 SYM. Same principle for BLOCK if not NULL. */
4604 lookup_cached_symbol (const char *name
, domain_enum domain
,
4605 struct symbol
**sym
, const struct block
**block
)
4607 struct cache_entry
**e
= find_entry (name
, domain
);
4614 *block
= (*e
)->block
;
4618 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4619 in domain DOMAIN, save this result in our symbol cache. */
4622 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4623 const struct block
*block
)
4625 struct ada_symbol_cache
*sym_cache
4626 = ada_get_symbol_cache (current_program_space
);
4628 struct cache_entry
*e
;
4630 /* Symbols for builtin types don't have a block.
4631 For now don't cache such symbols. */
4632 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4635 /* If the symbol is a local symbol, then do not cache it, as a search
4636 for that symbol depends on the context. To determine whether
4637 the symbol is local or not, we check the block where we found it
4638 against the global and static blocks of its associated symtab. */
4640 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4641 GLOBAL_BLOCK
) != block
4642 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4643 STATIC_BLOCK
) != block
)
4646 h
= msymbol_hash (name
) % HASH_SIZE
;
4647 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4648 e
->next
= sym_cache
->root
[h
];
4649 sym_cache
->root
[h
] = e
;
4650 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4658 /* Return the symbol name match type that should be used used when
4659 searching for all symbols matching LOOKUP_NAME.
4661 LOOKUP_NAME is expected to be a symbol name after transformation
4664 static symbol_name_match_type
4665 name_match_type_from_name (const char *lookup_name
)
4667 return (strstr (lookup_name
, "__") == NULL
4668 ? symbol_name_match_type::WILD
4669 : symbol_name_match_type::FULL
);
4672 /* Return the result of a standard (literal, C-like) lookup of NAME in
4673 given DOMAIN, visible from lexical block BLOCK. */
4675 static struct symbol
*
4676 standard_lookup (const char *name
, const struct block
*block
,
4679 /* Initialize it just to avoid a GCC false warning. */
4680 struct block_symbol sym
= {};
4682 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4684 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4685 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4690 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4691 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4692 since they contend in overloading in the same way. */
4694 is_nonfunction (struct block_symbol syms
[], int n
)
4698 for (i
= 0; i
< n
; i
+= 1)
4699 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_FUNC
4700 && (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
4701 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4707 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4708 struct types. Otherwise, they may not. */
4711 equiv_types (struct type
*type0
, struct type
*type1
)
4715 if (type0
== NULL
|| type1
== NULL
4716 || type0
->code () != type1
->code ())
4718 if ((type0
->code () == TYPE_CODE_STRUCT
4719 || type0
->code () == TYPE_CODE_ENUM
)
4720 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4721 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4727 /* True iff SYM0 represents the same entity as SYM1, or one that is
4728 no more defined than that of SYM1. */
4731 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4735 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4736 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4739 switch (SYMBOL_CLASS (sym0
))
4745 struct type
*type0
= SYMBOL_TYPE (sym0
);
4746 struct type
*type1
= SYMBOL_TYPE (sym1
);
4747 const char *name0
= sym0
->linkage_name ();
4748 const char *name1
= sym1
->linkage_name ();
4749 int len0
= strlen (name0
);
4752 type0
->code () == type1
->code ()
4753 && (equiv_types (type0
, type1
)
4754 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4755 && startswith (name1
+ len0
, "___XV")));
4758 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4759 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4763 const char *name0
= sym0
->linkage_name ();
4764 const char *name1
= sym1
->linkage_name ();
4765 return (strcmp (name0
, name1
) == 0
4766 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4774 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4775 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4778 add_defn_to_vec (struct obstack
*obstackp
,
4780 const struct block
*block
)
4783 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4785 /* Do not try to complete stub types, as the debugger is probably
4786 already scanning all symbols matching a certain name at the
4787 time when this function is called. Trying to replace the stub
4788 type by its associated full type will cause us to restart a scan
4789 which may lead to an infinite recursion. Instead, the client
4790 collecting the matching symbols will end up collecting several
4791 matches, with at least one of them complete. It can then filter
4792 out the stub ones if needed. */
4794 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4796 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4798 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4800 prevDefns
[i
].symbol
= sym
;
4801 prevDefns
[i
].block
= block
;
4807 struct block_symbol info
;
4811 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4815 /* Number of block_symbol structures currently collected in current vector in
4819 num_defns_collected (struct obstack
*obstackp
)
4821 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4824 /* Vector of block_symbol structures currently collected in current vector in
4825 OBSTACKP. If FINISH, close off the vector and return its final address. */
4827 static struct block_symbol
*
4828 defns_collected (struct obstack
*obstackp
, int finish
)
4831 return (struct block_symbol
*) obstack_finish (obstackp
);
4833 return (struct block_symbol
*) obstack_base (obstackp
);
4836 /* Return a bound minimal symbol matching NAME according to Ada
4837 decoding rules. Returns an invalid symbol if there is no such
4838 minimal symbol. Names prefixed with "standard__" are handled
4839 specially: "standard__" is first stripped off, and only static and
4840 global symbols are searched. */
4842 struct bound_minimal_symbol
4843 ada_lookup_simple_minsym (const char *name
)
4845 struct bound_minimal_symbol result
;
4847 memset (&result
, 0, sizeof (result
));
4849 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4850 lookup_name_info
lookup_name (name
, match_type
);
4852 symbol_name_matcher_ftype
*match_name
4853 = ada_get_symbol_name_matcher (lookup_name
);
4855 for (objfile
*objfile
: current_program_space
->objfiles ())
4857 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4859 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4860 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4862 result
.minsym
= msymbol
;
4863 result
.objfile
= objfile
;
4872 /* For all subprograms that statically enclose the subprogram of the
4873 selected frame, add symbols matching identifier NAME in DOMAIN
4874 and their blocks to the list of data in OBSTACKP, as for
4875 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4876 with a wildcard prefix. */
4879 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4880 const lookup_name_info
&lookup_name
,
4885 /* True if TYPE is definitely an artificial type supplied to a symbol
4886 for which no debugging information was given in the symbol file. */
4889 is_nondebugging_type (struct type
*type
)
4891 const char *name
= ada_type_name (type
);
4893 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4896 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4897 that are deemed "identical" for practical purposes.
4899 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4900 types and that their number of enumerals is identical (in other
4901 words, type1->num_fields () == type2->num_fields ()). */
4904 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4908 /* The heuristic we use here is fairly conservative. We consider
4909 that 2 enumerate types are identical if they have the same
4910 number of enumerals and that all enumerals have the same
4911 underlying value and name. */
4913 /* All enums in the type should have an identical underlying value. */
4914 for (i
= 0; i
< type1
->num_fields (); i
++)
4915 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4918 /* All enumerals should also have the same name (modulo any numerical
4920 for (i
= 0; i
< type1
->num_fields (); i
++)
4922 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4923 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4924 int len_1
= strlen (name_1
);
4925 int len_2
= strlen (name_2
);
4927 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4928 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4930 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4931 TYPE_FIELD_NAME (type2
, i
),
4939 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4940 that are deemed "identical" for practical purposes. Sometimes,
4941 enumerals are not strictly identical, but their types are so similar
4942 that they can be considered identical.
4944 For instance, consider the following code:
4946 type Color is (Black, Red, Green, Blue, White);
4947 type RGB_Color is new Color range Red .. Blue;
4949 Type RGB_Color is a subrange of an implicit type which is a copy
4950 of type Color. If we call that implicit type RGB_ColorB ("B" is
4951 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4952 As a result, when an expression references any of the enumeral
4953 by name (Eg. "print green"), the expression is technically
4954 ambiguous and the user should be asked to disambiguate. But
4955 doing so would only hinder the user, since it wouldn't matter
4956 what choice he makes, the outcome would always be the same.
4957 So, for practical purposes, we consider them as the same. */
4960 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
4964 /* Before performing a thorough comparison check of each type,
4965 we perform a series of inexpensive checks. We expect that these
4966 checks will quickly fail in the vast majority of cases, and thus
4967 help prevent the unnecessary use of a more expensive comparison.
4968 Said comparison also expects us to make some of these checks
4969 (see ada_identical_enum_types_p). */
4971 /* Quick check: All symbols should have an enum type. */
4972 for (i
= 0; i
< syms
.size (); i
++)
4973 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
4976 /* Quick check: They should all have the same value. */
4977 for (i
= 1; i
< syms
.size (); i
++)
4978 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
4981 /* Quick check: They should all have the same number of enumerals. */
4982 for (i
= 1; i
< syms
.size (); i
++)
4983 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
4984 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
4987 /* All the sanity checks passed, so we might have a set of
4988 identical enumeration types. Perform a more complete
4989 comparison of the type of each symbol. */
4990 for (i
= 1; i
< syms
.size (); i
++)
4991 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
4992 SYMBOL_TYPE (syms
[0].symbol
)))
4998 /* Remove any non-debugging symbols in SYMS that definitely
4999 duplicate other symbols in the list (The only case I know of where
5000 this happens is when object files containing stabs-in-ecoff are
5001 linked with files containing ordinary ecoff debugging symbols (or no
5002 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5003 Returns the number of items in the modified list. */
5006 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5010 /* We should never be called with less than 2 symbols, as there
5011 cannot be any extra symbol in that case. But it's easy to
5012 handle, since we have nothing to do in that case. */
5013 if (syms
->size () < 2)
5014 return syms
->size ();
5017 while (i
< syms
->size ())
5021 /* If two symbols have the same name and one of them is a stub type,
5022 the get rid of the stub. */
5024 if (TYPE_STUB (SYMBOL_TYPE ((*syms
)[i
].symbol
))
5025 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5027 for (j
= 0; j
< syms
->size (); j
++)
5030 && !TYPE_STUB (SYMBOL_TYPE ((*syms
)[j
].symbol
))
5031 && (*syms
)[j
].symbol
->linkage_name () != NULL
5032 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5033 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5038 /* Two symbols with the same name, same class and same address
5039 should be identical. */
5041 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5042 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5043 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5045 for (j
= 0; j
< syms
->size (); j
+= 1)
5048 && (*syms
)[j
].symbol
->linkage_name () != NULL
5049 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5050 (*syms
)[j
].symbol
->linkage_name ()) == 0
5051 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5052 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5053 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5054 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5060 syms
->erase (syms
->begin () + i
);
5065 /* If all the remaining symbols are identical enumerals, then
5066 just keep the first one and discard the rest.
5068 Unlike what we did previously, we do not discard any entry
5069 unless they are ALL identical. This is because the symbol
5070 comparison is not a strict comparison, but rather a practical
5071 comparison. If all symbols are considered identical, then
5072 we can just go ahead and use the first one and discard the rest.
5073 But if we cannot reduce the list to a single element, we have
5074 to ask the user to disambiguate anyways. And if we have to
5075 present a multiple-choice menu, it's less confusing if the list
5076 isn't missing some choices that were identical and yet distinct. */
5077 if (symbols_are_identical_enums (*syms
))
5080 return syms
->size ();
5083 /* Given a type that corresponds to a renaming entity, use the type name
5084 to extract the scope (package name or function name, fully qualified,
5085 and following the GNAT encoding convention) where this renaming has been
5089 xget_renaming_scope (struct type
*renaming_type
)
5091 /* The renaming types adhere to the following convention:
5092 <scope>__<rename>___<XR extension>.
5093 So, to extract the scope, we search for the "___XR" extension,
5094 and then backtrack until we find the first "__". */
5096 const char *name
= renaming_type
->name ();
5097 const char *suffix
= strstr (name
, "___XR");
5100 /* Now, backtrack a bit until we find the first "__". Start looking
5101 at suffix - 3, as the <rename> part is at least one character long. */
5103 for (last
= suffix
- 3; last
> name
; last
--)
5104 if (last
[0] == '_' && last
[1] == '_')
5107 /* Make a copy of scope and return it. */
5108 return std::string (name
, last
);
5111 /* Return nonzero if NAME corresponds to a package name. */
5114 is_package_name (const char *name
)
5116 /* Here, We take advantage of the fact that no symbols are generated
5117 for packages, while symbols are generated for each function.
5118 So the condition for NAME represent a package becomes equivalent
5119 to NAME not existing in our list of symbols. There is only one
5120 small complication with library-level functions (see below). */
5122 /* If it is a function that has not been defined at library level,
5123 then we should be able to look it up in the symbols. */
5124 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5127 /* Library-level function names start with "_ada_". See if function
5128 "_ada_" followed by NAME can be found. */
5130 /* Do a quick check that NAME does not contain "__", since library-level
5131 functions names cannot contain "__" in them. */
5132 if (strstr (name
, "__") != NULL
)
5135 std::string fun_name
= string_printf ("_ada_%s", name
);
5137 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5140 /* Return nonzero if SYM corresponds to a renaming entity that is
5141 not visible from FUNCTION_NAME. */
5144 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5146 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5149 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5151 /* If the rename has been defined in a package, then it is visible. */
5152 if (is_package_name (scope
.c_str ()))
5155 /* Check that the rename is in the current function scope by checking
5156 that its name starts with SCOPE. */
5158 /* If the function name starts with "_ada_", it means that it is
5159 a library-level function. Strip this prefix before doing the
5160 comparison, as the encoding for the renaming does not contain
5162 if (startswith (function_name
, "_ada_"))
5165 return !startswith (function_name
, scope
.c_str ());
5168 /* Remove entries from SYMS that corresponds to a renaming entity that
5169 is not visible from the function associated with CURRENT_BLOCK or
5170 that is superfluous due to the presence of more specific renaming
5171 information. Places surviving symbols in the initial entries of
5172 SYMS and returns the number of surviving symbols.
5175 First, in cases where an object renaming is implemented as a
5176 reference variable, GNAT may produce both the actual reference
5177 variable and the renaming encoding. In this case, we discard the
5180 Second, GNAT emits a type following a specified encoding for each renaming
5181 entity. Unfortunately, STABS currently does not support the definition
5182 of types that are local to a given lexical block, so all renamings types
5183 are emitted at library level. As a consequence, if an application
5184 contains two renaming entities using the same name, and a user tries to
5185 print the value of one of these entities, the result of the ada symbol
5186 lookup will also contain the wrong renaming type.
5188 This function partially covers for this limitation by attempting to
5189 remove from the SYMS list renaming symbols that should be visible
5190 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5191 method with the current information available. The implementation
5192 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5194 - When the user tries to print a rename in a function while there
5195 is another rename entity defined in a package: Normally, the
5196 rename in the function has precedence over the rename in the
5197 package, so the latter should be removed from the list. This is
5198 currently not the case.
5200 - This function will incorrectly remove valid renames if
5201 the CURRENT_BLOCK corresponds to a function which symbol name
5202 has been changed by an "Export" pragma. As a consequence,
5203 the user will be unable to print such rename entities. */
5206 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5207 const struct block
*current_block
)
5209 struct symbol
*current_function
;
5210 const char *current_function_name
;
5212 int is_new_style_renaming
;
5214 /* If there is both a renaming foo___XR... encoded as a variable and
5215 a simple variable foo in the same block, discard the latter.
5216 First, zero out such symbols, then compress. */
5217 is_new_style_renaming
= 0;
5218 for (i
= 0; i
< syms
->size (); i
+= 1)
5220 struct symbol
*sym
= (*syms
)[i
].symbol
;
5221 const struct block
*block
= (*syms
)[i
].block
;
5225 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5227 name
= sym
->linkage_name ();
5228 suffix
= strstr (name
, "___XR");
5232 int name_len
= suffix
- name
;
5235 is_new_style_renaming
= 1;
5236 for (j
= 0; j
< syms
->size (); j
+= 1)
5237 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5238 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5240 && block
== (*syms
)[j
].block
)
5241 (*syms
)[j
].symbol
= NULL
;
5244 if (is_new_style_renaming
)
5248 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5249 if ((*syms
)[j
].symbol
!= NULL
)
5251 (*syms
)[k
] = (*syms
)[j
];
5257 /* Extract the function name associated to CURRENT_BLOCK.
5258 Abort if unable to do so. */
5260 if (current_block
== NULL
)
5261 return syms
->size ();
5263 current_function
= block_linkage_function (current_block
);
5264 if (current_function
== NULL
)
5265 return syms
->size ();
5267 current_function_name
= current_function
->linkage_name ();
5268 if (current_function_name
== NULL
)
5269 return syms
->size ();
5271 /* Check each of the symbols, and remove it from the list if it is
5272 a type corresponding to a renaming that is out of the scope of
5273 the current block. */
5276 while (i
< syms
->size ())
5278 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5279 == ADA_OBJECT_RENAMING
5280 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5281 current_function_name
))
5282 syms
->erase (syms
->begin () + i
);
5287 return syms
->size ();
5290 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5291 whose name and domain match NAME and DOMAIN respectively.
5292 If no match was found, then extend the search to "enclosing"
5293 routines (in other words, if we're inside a nested function,
5294 search the symbols defined inside the enclosing functions).
5295 If WILD_MATCH_P is nonzero, perform the naming matching in
5296 "wild" mode (see function "wild_match" for more info).
5298 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5301 ada_add_local_symbols (struct obstack
*obstackp
,
5302 const lookup_name_info
&lookup_name
,
5303 const struct block
*block
, domain_enum domain
)
5305 int block_depth
= 0;
5307 while (block
!= NULL
)
5310 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5312 /* If we found a non-function match, assume that's the one. */
5313 if (is_nonfunction (defns_collected (obstackp
, 0),
5314 num_defns_collected (obstackp
)))
5317 block
= BLOCK_SUPERBLOCK (block
);
5320 /* If no luck so far, try to find NAME as a local symbol in some lexically
5321 enclosing subprogram. */
5322 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5323 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5326 /* An object of this type is used as the user_data argument when
5327 calling the map_matching_symbols method. */
5331 struct objfile
*objfile
;
5332 struct obstack
*obstackp
;
5333 struct symbol
*arg_sym
;
5337 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5338 to a list of symbols. DATA is a pointer to a struct match_data *
5339 containing the obstack that collects the symbol list, the file that SYM
5340 must come from, a flag indicating whether a non-argument symbol has
5341 been found in the current block, and the last argument symbol
5342 passed in SYM within the current block (if any). When SYM is null,
5343 marking the end of a block, the argument symbol is added if no
5344 other has been found. */
5347 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5348 struct match_data
*data
)
5350 const struct block
*block
= bsym
->block
;
5351 struct symbol
*sym
= bsym
->symbol
;
5355 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5356 add_defn_to_vec (data
->obstackp
,
5357 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5359 data
->found_sym
= 0;
5360 data
->arg_sym
= NULL
;
5364 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5366 else if (SYMBOL_IS_ARGUMENT (sym
))
5367 data
->arg_sym
= sym
;
5370 data
->found_sym
= 1;
5371 add_defn_to_vec (data
->obstackp
,
5372 fixup_symbol_section (sym
, data
->objfile
),
5379 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5380 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5381 symbols to OBSTACKP. Return whether we found such symbols. */
5384 ada_add_block_renamings (struct obstack
*obstackp
,
5385 const struct block
*block
,
5386 const lookup_name_info
&lookup_name
,
5389 struct using_direct
*renaming
;
5390 int defns_mark
= num_defns_collected (obstackp
);
5392 symbol_name_matcher_ftype
*name_match
5393 = ada_get_symbol_name_matcher (lookup_name
);
5395 for (renaming
= block_using (block
);
5397 renaming
= renaming
->next
)
5401 /* Avoid infinite recursions: skip this renaming if we are actually
5402 already traversing it.
5404 Currently, symbol lookup in Ada don't use the namespace machinery from
5405 C++/Fortran support: skip namespace imports that use them. */
5406 if (renaming
->searched
5407 || (renaming
->import_src
!= NULL
5408 && renaming
->import_src
[0] != '\0')
5409 || (renaming
->import_dest
!= NULL
5410 && renaming
->import_dest
[0] != '\0'))
5412 renaming
->searched
= 1;
5414 /* TODO: here, we perform another name-based symbol lookup, which can
5415 pull its own multiple overloads. In theory, we should be able to do
5416 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5417 not a simple name. But in order to do this, we would need to enhance
5418 the DWARF reader to associate a symbol to this renaming, instead of a
5419 name. So, for now, we do something simpler: re-use the C++/Fortran
5420 namespace machinery. */
5421 r_name
= (renaming
->alias
!= NULL
5423 : renaming
->declaration
);
5424 if (name_match (r_name
, lookup_name
, NULL
))
5426 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5427 lookup_name
.match_type ());
5428 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5431 renaming
->searched
= 0;
5433 return num_defns_collected (obstackp
) != defns_mark
;
5436 /* Implements compare_names, but only applying the comparision using
5437 the given CASING. */
5440 compare_names_with_case (const char *string1
, const char *string2
,
5441 enum case_sensitivity casing
)
5443 while (*string1
!= '\0' && *string2
!= '\0')
5447 if (isspace (*string1
) || isspace (*string2
))
5448 return strcmp_iw_ordered (string1
, string2
);
5450 if (casing
== case_sensitive_off
)
5452 c1
= tolower (*string1
);
5453 c2
= tolower (*string2
);
5470 return strcmp_iw_ordered (string1
, string2
);
5472 if (*string2
== '\0')
5474 if (is_name_suffix (string1
))
5481 if (*string2
== '(')
5482 return strcmp_iw_ordered (string1
, string2
);
5485 if (casing
== case_sensitive_off
)
5486 return tolower (*string1
) - tolower (*string2
);
5488 return *string1
- *string2
;
5493 /* Compare STRING1 to STRING2, with results as for strcmp.
5494 Compatible with strcmp_iw_ordered in that...
5496 strcmp_iw_ordered (STRING1, STRING2) <= 0
5500 compare_names (STRING1, STRING2) <= 0
5502 (they may differ as to what symbols compare equal). */
5505 compare_names (const char *string1
, const char *string2
)
5509 /* Similar to what strcmp_iw_ordered does, we need to perform
5510 a case-insensitive comparison first, and only resort to
5511 a second, case-sensitive, comparison if the first one was
5512 not sufficient to differentiate the two strings. */
5514 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5516 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5521 /* Convenience function to get at the Ada encoded lookup name for
5522 LOOKUP_NAME, as a C string. */
5525 ada_lookup_name (const lookup_name_info
&lookup_name
)
5527 return lookup_name
.ada ().lookup_name ().c_str ();
5530 /* Add to OBSTACKP all non-local symbols whose name and domain match
5531 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5532 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5533 symbols otherwise. */
5536 add_nonlocal_symbols (struct obstack
*obstackp
,
5537 const lookup_name_info
&lookup_name
,
5538 domain_enum domain
, int global
)
5540 struct match_data data
;
5542 memset (&data
, 0, sizeof data
);
5543 data
.obstackp
= obstackp
;
5545 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5547 auto callback
= [&] (struct block_symbol
*bsym
)
5549 return aux_add_nonlocal_symbols (bsym
, &data
);
5552 for (objfile
*objfile
: current_program_space
->objfiles ())
5554 data
.objfile
= objfile
;
5556 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5557 domain
, global
, callback
,
5559 ? NULL
: compare_names
));
5561 for (compunit_symtab
*cu
: objfile
->compunits ())
5563 const struct block
*global_block
5564 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5566 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5572 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5574 const char *name
= ada_lookup_name (lookup_name
);
5575 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5576 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5578 for (objfile
*objfile
: current_program_space
->objfiles ())
5580 data
.objfile
= objfile
;
5581 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5582 domain
, global
, callback
,
5588 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5589 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5590 returning the number of matches. Add these to OBSTACKP.
5592 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5593 symbol match within the nest of blocks whose innermost member is BLOCK,
5594 is the one match returned (no other matches in that or
5595 enclosing blocks is returned). If there are any matches in or
5596 surrounding BLOCK, then these alone are returned.
5598 Names prefixed with "standard__" are handled specially:
5599 "standard__" is first stripped off (by the lookup_name
5600 constructor), and only static and global symbols are searched.
5602 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5603 to lookup global symbols. */
5606 ada_add_all_symbols (struct obstack
*obstackp
,
5607 const struct block
*block
,
5608 const lookup_name_info
&lookup_name
,
5611 int *made_global_lookup_p
)
5615 if (made_global_lookup_p
)
5616 *made_global_lookup_p
= 0;
5618 /* Special case: If the user specifies a symbol name inside package
5619 Standard, do a non-wild matching of the symbol name without
5620 the "standard__" prefix. This was primarily introduced in order
5621 to allow the user to specifically access the standard exceptions
5622 using, for instance, Standard.Constraint_Error when Constraint_Error
5623 is ambiguous (due to the user defining its own Constraint_Error
5624 entity inside its program). */
5625 if (lookup_name
.ada ().standard_p ())
5628 /* Check the non-global symbols. If we have ANY match, then we're done. */
5633 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5636 /* In the !full_search case we're are being called by
5637 iterate_over_symbols, and we don't want to search
5639 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5641 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5645 /* No non-global symbols found. Check our cache to see if we have
5646 already performed this search before. If we have, then return
5649 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5650 domain
, &sym
, &block
))
5653 add_defn_to_vec (obstackp
, sym
, block
);
5657 if (made_global_lookup_p
)
5658 *made_global_lookup_p
= 1;
5660 /* Search symbols from all global blocks. */
5662 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5664 /* Now add symbols from all per-file blocks if we've gotten no hits
5665 (not strictly correct, but perhaps better than an error). */
5667 if (num_defns_collected (obstackp
) == 0)
5668 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5671 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5672 is non-zero, enclosing scope and in global scopes, returning the number of
5674 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5675 found and the blocks and symbol tables (if any) in which they were
5678 When full_search is non-zero, any non-function/non-enumeral
5679 symbol match within the nest of blocks whose innermost member is BLOCK,
5680 is the one match returned (no other matches in that or
5681 enclosing blocks is returned). If there are any matches in or
5682 surrounding BLOCK, then these alone are returned.
5684 Names prefixed with "standard__" are handled specially: "standard__"
5685 is first stripped off, and only static and global symbols are searched. */
5688 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5689 const struct block
*block
,
5691 std::vector
<struct block_symbol
> *results
,
5694 int syms_from_global_search
;
5696 auto_obstack obstack
;
5698 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5699 domain
, full_search
, &syms_from_global_search
);
5701 ndefns
= num_defns_collected (&obstack
);
5703 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5704 for (int i
= 0; i
< ndefns
; ++i
)
5705 results
->push_back (base
[i
]);
5707 ndefns
= remove_extra_symbols (results
);
5709 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5710 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5712 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5713 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5714 (*results
)[0].symbol
, (*results
)[0].block
);
5716 ndefns
= remove_irrelevant_renamings (results
, block
);
5721 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5722 in global scopes, returning the number of matches, and filling *RESULTS
5723 with (SYM,BLOCK) tuples.
5725 See ada_lookup_symbol_list_worker for further details. */
5728 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5730 std::vector
<struct block_symbol
> *results
)
5732 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5733 lookup_name_info
lookup_name (name
, name_match_type
);
5735 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5738 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5739 to 1, but choosing the first symbol found if there are multiple
5742 The result is stored in *INFO, which must be non-NULL.
5743 If no match is found, INFO->SYM is set to NULL. */
5746 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5748 struct block_symbol
*info
)
5750 /* Since we already have an encoded name, wrap it in '<>' to force a
5751 verbatim match. Otherwise, if the name happens to not look like
5752 an encoded name (because it doesn't include a "__"),
5753 ada_lookup_name_info would re-encode/fold it again, and that
5754 would e.g., incorrectly lowercase object renaming names like
5755 "R28b" -> "r28b". */
5756 std::string verbatim
= std::string ("<") + name
+ '>';
5758 gdb_assert (info
!= NULL
);
5759 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5762 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5763 scope and in global scopes, or NULL if none. NAME is folded and
5764 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5765 choosing the first symbol if there are multiple choices. */
5768 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5771 std::vector
<struct block_symbol
> candidates
;
5774 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5776 if (n_candidates
== 0)
5779 block_symbol info
= candidates
[0];
5780 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5784 static struct block_symbol
5785 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5787 const struct block
*block
,
5788 const domain_enum domain
)
5790 struct block_symbol sym
;
5792 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
5793 if (sym
.symbol
!= NULL
)
5796 /* If we haven't found a match at this point, try the primitive
5797 types. In other languages, this search is performed before
5798 searching for global symbols in order to short-circuit that
5799 global-symbol search if it happens that the name corresponds
5800 to a primitive type. But we cannot do the same in Ada, because
5801 it is perfectly legitimate for a program to declare a type which
5802 has the same name as a standard type. If looking up a type in
5803 that situation, we have traditionally ignored the primitive type
5804 in favor of user-defined types. This is why, unlike most other
5805 languages, we search the primitive types this late and only after
5806 having searched the global symbols without success. */
5808 if (domain
== VAR_DOMAIN
)
5810 struct gdbarch
*gdbarch
;
5813 gdbarch
= target_gdbarch ();
5815 gdbarch
= block_gdbarch (block
);
5816 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5817 if (sym
.symbol
!= NULL
)
5825 /* True iff STR is a possible encoded suffix of a normal Ada name
5826 that is to be ignored for matching purposes. Suffixes of parallel
5827 names (e.g., XVE) are not included here. Currently, the possible suffixes
5828 are given by any of the regular expressions:
5830 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5831 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5832 TKB [subprogram suffix for task bodies]
5833 _E[0-9]+[bs]$ [protected object entry suffixes]
5834 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5836 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5837 match is performed. This sequence is used to differentiate homonyms,
5838 is an optional part of a valid name suffix. */
5841 is_name_suffix (const char *str
)
5844 const char *matching
;
5845 const int len
= strlen (str
);
5847 /* Skip optional leading __[0-9]+. */
5849 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5852 while (isdigit (str
[0]))
5858 if (str
[0] == '.' || str
[0] == '$')
5861 while (isdigit (matching
[0]))
5863 if (matching
[0] == '\0')
5869 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5872 while (isdigit (matching
[0]))
5874 if (matching
[0] == '\0')
5878 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5880 if (strcmp (str
, "TKB") == 0)
5884 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5885 with a N at the end. Unfortunately, the compiler uses the same
5886 convention for other internal types it creates. So treating
5887 all entity names that end with an "N" as a name suffix causes
5888 some regressions. For instance, consider the case of an enumerated
5889 type. To support the 'Image attribute, it creates an array whose
5891 Having a single character like this as a suffix carrying some
5892 information is a bit risky. Perhaps we should change the encoding
5893 to be something like "_N" instead. In the meantime, do not do
5894 the following check. */
5895 /* Protected Object Subprograms */
5896 if (len
== 1 && str
[0] == 'N')
5901 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5904 while (isdigit (matching
[0]))
5906 if ((matching
[0] == 'b' || matching
[0] == 's')
5907 && matching
[1] == '\0')
5911 /* ??? We should not modify STR directly, as we are doing below. This
5912 is fine in this case, but may become problematic later if we find
5913 that this alternative did not work, and want to try matching
5914 another one from the begining of STR. Since we modified it, we
5915 won't be able to find the begining of the string anymore! */
5919 while (str
[0] != '_' && str
[0] != '\0')
5921 if (str
[0] != 'n' && str
[0] != 'b')
5927 if (str
[0] == '\000')
5932 if (str
[1] != '_' || str
[2] == '\000')
5936 if (strcmp (str
+ 3, "JM") == 0)
5938 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5939 the LJM suffix in favor of the JM one. But we will
5940 still accept LJM as a valid suffix for a reasonable
5941 amount of time, just to allow ourselves to debug programs
5942 compiled using an older version of GNAT. */
5943 if (strcmp (str
+ 3, "LJM") == 0)
5947 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5948 || str
[4] == 'U' || str
[4] == 'P')
5950 if (str
[4] == 'R' && str
[5] != 'T')
5954 if (!isdigit (str
[2]))
5956 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5957 if (!isdigit (str
[k
]) && str
[k
] != '_')
5961 if (str
[0] == '$' && isdigit (str
[1]))
5963 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5964 if (!isdigit (str
[k
]) && str
[k
] != '_')
5971 /* Return non-zero if the string starting at NAME and ending before
5972 NAME_END contains no capital letters. */
5975 is_valid_name_for_wild_match (const char *name0
)
5977 std::string decoded_name
= ada_decode (name0
);
5980 /* If the decoded name starts with an angle bracket, it means that
5981 NAME0 does not follow the GNAT encoding format. It should then
5982 not be allowed as a possible wild match. */
5983 if (decoded_name
[0] == '<')
5986 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5987 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5993 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5994 that could start a simple name. Assumes that *NAMEP points into
5995 the string beginning at NAME0. */
5998 advance_wild_match (const char **namep
, const char *name0
, int target0
)
6000 const char *name
= *namep
;
6010 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6013 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6018 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6019 || name
[2] == target0
))
6027 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6037 /* Return true iff NAME encodes a name of the form prefix.PATN.
6038 Ignores any informational suffixes of NAME (i.e., for which
6039 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6043 wild_match (const char *name
, const char *patn
)
6046 const char *name0
= name
;
6050 const char *match
= name
;
6054 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6057 if (*p
== '\0' && is_name_suffix (name
))
6058 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6060 if (name
[-1] == '_')
6063 if (!advance_wild_match (&name
, name0
, *patn
))
6068 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6069 any trailing suffixes that encode debugging information or leading
6070 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6071 information that is ignored). */
6074 full_match (const char *sym_name
, const char *search_name
)
6076 size_t search_name_len
= strlen (search_name
);
6078 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6079 && is_name_suffix (sym_name
+ search_name_len
))
6082 if (startswith (sym_name
, "_ada_")
6083 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6084 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6090 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6091 *defn_symbols, updating the list of symbols in OBSTACKP (if
6092 necessary). OBJFILE is the section containing BLOCK. */
6095 ada_add_block_symbols (struct obstack
*obstackp
,
6096 const struct block
*block
,
6097 const lookup_name_info
&lookup_name
,
6098 domain_enum domain
, struct objfile
*objfile
)
6100 struct block_iterator iter
;
6101 /* A matching argument symbol, if any. */
6102 struct symbol
*arg_sym
;
6103 /* Set true when we find a matching non-argument symbol. */
6109 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6111 sym
= block_iter_match_next (lookup_name
, &iter
))
6113 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6115 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6117 if (SYMBOL_IS_ARGUMENT (sym
))
6122 add_defn_to_vec (obstackp
,
6123 fixup_symbol_section (sym
, objfile
),
6130 /* Handle renamings. */
6132 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6135 if (!found_sym
&& arg_sym
!= NULL
)
6137 add_defn_to_vec (obstackp
,
6138 fixup_symbol_section (arg_sym
, objfile
),
6142 if (!lookup_name
.ada ().wild_match_p ())
6146 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6147 const char *name
= ada_lookup_name
.c_str ();
6148 size_t name_len
= ada_lookup_name
.size ();
6150 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6152 if (symbol_matches_domain (sym
->language (),
6153 SYMBOL_DOMAIN (sym
), domain
))
6157 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6160 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6162 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6167 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6169 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6171 if (SYMBOL_IS_ARGUMENT (sym
))
6176 add_defn_to_vec (obstackp
,
6177 fixup_symbol_section (sym
, objfile
),
6185 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6186 They aren't parameters, right? */
6187 if (!found_sym
&& arg_sym
!= NULL
)
6189 add_defn_to_vec (obstackp
,
6190 fixup_symbol_section (arg_sym
, objfile
),
6197 /* Symbol Completion */
6202 ada_lookup_name_info::matches
6203 (const char *sym_name
,
6204 symbol_name_match_type match_type
,
6205 completion_match_result
*comp_match_res
) const
6208 const char *text
= m_encoded_name
.c_str ();
6209 size_t text_len
= m_encoded_name
.size ();
6211 /* First, test against the fully qualified name of the symbol. */
6213 if (strncmp (sym_name
, text
, text_len
) == 0)
6216 std::string decoded_name
= ada_decode (sym_name
);
6217 if (match
&& !m_encoded_p
)
6219 /* One needed check before declaring a positive match is to verify
6220 that iff we are doing a verbatim match, the decoded version
6221 of the symbol name starts with '<'. Otherwise, this symbol name
6222 is not a suitable completion. */
6224 bool has_angle_bracket
= (decoded_name
[0] == '<');
6225 match
= (has_angle_bracket
== m_verbatim_p
);
6228 if (match
&& !m_verbatim_p
)
6230 /* When doing non-verbatim match, another check that needs to
6231 be done is to verify that the potentially matching symbol name
6232 does not include capital letters, because the ada-mode would
6233 not be able to understand these symbol names without the
6234 angle bracket notation. */
6237 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6242 /* Second: Try wild matching... */
6244 if (!match
&& m_wild_match_p
)
6246 /* Since we are doing wild matching, this means that TEXT
6247 may represent an unqualified symbol name. We therefore must
6248 also compare TEXT against the unqualified name of the symbol. */
6249 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6251 if (strncmp (sym_name
, text
, text_len
) == 0)
6255 /* Finally: If we found a match, prepare the result to return. */
6260 if (comp_match_res
!= NULL
)
6262 std::string
&match_str
= comp_match_res
->match
.storage ();
6265 match_str
= ada_decode (sym_name
);
6269 match_str
= add_angle_brackets (sym_name
);
6271 match_str
= sym_name
;
6275 comp_match_res
->set_match (match_str
.c_str ());
6281 /* Add the list of possible symbol names completing TEXT to TRACKER.
6282 WORD is the entire command on which completion is made. */
6285 ada_collect_symbol_completion_matches (completion_tracker
&tracker
,
6286 complete_symbol_mode mode
,
6287 symbol_name_match_type name_match_type
,
6288 const char *text
, const char *word
,
6289 enum type_code code
)
6292 const struct block
*b
, *surrounding_static_block
= 0;
6293 struct block_iterator iter
;
6295 gdb_assert (code
== TYPE_CODE_UNDEF
);
6297 lookup_name_info
lookup_name (text
, name_match_type
, true);
6299 /* First, look at the partial symtab symbols. */
6300 expand_symtabs_matching (NULL
,
6306 /* At this point scan through the misc symbol vectors and add each
6307 symbol you find to the list. Eventually we want to ignore
6308 anything that isn't a text symbol (everything else will be
6309 handled by the psymtab code above). */
6311 for (objfile
*objfile
: current_program_space
->objfiles ())
6313 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
6317 if (completion_skip_symbol (mode
, msymbol
))
6320 language symbol_language
= msymbol
->language ();
6322 /* Ada minimal symbols won't have their language set to Ada. If
6323 we let completion_list_add_name compare using the
6324 default/C-like matcher, then when completing e.g., symbols in a
6325 package named "pck", we'd match internal Ada symbols like
6326 "pckS", which are invalid in an Ada expression, unless you wrap
6327 them in '<' '>' to request a verbatim match.
6329 Unfortunately, some Ada encoded names successfully demangle as
6330 C++ symbols (using an old mangling scheme), such as "name__2Xn"
6331 -> "Xn::name(void)" and thus some Ada minimal symbols end up
6332 with the wrong language set. Paper over that issue here. */
6333 if (symbol_language
== language_auto
6334 || symbol_language
== language_cplus
)
6335 symbol_language
= language_ada
;
6337 completion_list_add_name (tracker
,
6339 msymbol
->linkage_name (),
6340 lookup_name
, text
, word
);
6344 /* Search upwards from currently selected frame (so that we can
6345 complete on local vars. */
6347 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6349 if (!BLOCK_SUPERBLOCK (b
))
6350 surrounding_static_block
= b
; /* For elmin of dups */
6352 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6354 if (completion_skip_symbol (mode
, sym
))
6357 completion_list_add_name (tracker
,
6359 sym
->linkage_name (),
6360 lookup_name
, text
, word
);
6364 /* Go through the symtabs and check the externs and statics for
6365 symbols which match. */
6367 for (objfile
*objfile
: current_program_space
->objfiles ())
6369 for (compunit_symtab
*s
: objfile
->compunits ())
6372 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6373 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6375 if (completion_skip_symbol (mode
, sym
))
6378 completion_list_add_name (tracker
,
6380 sym
->linkage_name (),
6381 lookup_name
, text
, word
);
6386 for (objfile
*objfile
: current_program_space
->objfiles ())
6388 for (compunit_symtab
*s
: objfile
->compunits ())
6391 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6392 /* Don't do this block twice. */
6393 if (b
== surrounding_static_block
)
6395 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6397 if (completion_skip_symbol (mode
, sym
))
6400 completion_list_add_name (tracker
,
6402 sym
->linkage_name (),
6403 lookup_name
, text
, word
);
6411 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6412 for tagged types. */
6415 ada_is_dispatch_table_ptr_type (struct type
*type
)
6419 if (type
->code () != TYPE_CODE_PTR
)
6422 name
= TYPE_TARGET_TYPE (type
)->name ();
6426 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6429 /* Return non-zero if TYPE is an interface tag. */
6432 ada_is_interface_tag (struct type
*type
)
6434 const char *name
= type
->name ();
6439 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6442 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6443 to be invisible to users. */
6446 ada_is_ignored_field (struct type
*type
, int field_num
)
6448 if (field_num
< 0 || field_num
> type
->num_fields ())
6451 /* Check the name of that field. */
6453 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6455 /* Anonymous field names should not be printed.
6456 brobecker/2007-02-20: I don't think this can actually happen
6457 but we don't want to print the value of anonymous fields anyway. */
6461 /* Normally, fields whose name start with an underscore ("_")
6462 are fields that have been internally generated by the compiler,
6463 and thus should not be printed. The "_parent" field is special,
6464 however: This is a field internally generated by the compiler
6465 for tagged types, and it contains the components inherited from
6466 the parent type. This field should not be printed as is, but
6467 should not be ignored either. */
6468 if (name
[0] == '_' && !startswith (name
, "_parent"))
6472 /* If this is the dispatch table of a tagged type or an interface tag,
6474 if (ada_is_tagged_type (type
, 1)
6475 && (ada_is_dispatch_table_ptr_type (type
->field (field_num
).type ())
6476 || ada_is_interface_tag (type
->field (field_num
).type ())))
6479 /* Not a special field, so it should not be ignored. */
6483 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6484 pointer or reference type whose ultimate target has a tag field. */
6487 ada_is_tagged_type (struct type
*type
, int refok
)
6489 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6492 /* True iff TYPE represents the type of X'Tag */
6495 ada_is_tag_type (struct type
*type
)
6497 type
= ada_check_typedef (type
);
6499 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6503 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6505 return (name
!= NULL
6506 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6510 /* The type of the tag on VAL. */
6512 static struct type
*
6513 ada_tag_type (struct value
*val
)
6515 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6518 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6519 retired at Ada 05). */
6522 is_ada95_tag (struct value
*tag
)
6524 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6527 /* The value of the tag on VAL. */
6529 static struct value
*
6530 ada_value_tag (struct value
*val
)
6532 return ada_value_struct_elt (val
, "_tag", 0);
6535 /* The value of the tag on the object of type TYPE whose contents are
6536 saved at VALADDR, if it is non-null, or is at memory address
6539 static struct value
*
6540 value_tag_from_contents_and_address (struct type
*type
,
6541 const gdb_byte
*valaddr
,
6544 int tag_byte_offset
;
6545 struct type
*tag_type
;
6547 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6550 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6552 : valaddr
+ tag_byte_offset
);
6553 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6555 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6560 static struct type
*
6561 type_from_tag (struct value
*tag
)
6563 gdb::unique_xmalloc_ptr
<char> type_name
= ada_tag_name (tag
);
6565 if (type_name
!= NULL
)
6566 return ada_find_any_type (ada_encode (type_name
.get ()));
6570 /* Given a value OBJ of a tagged type, return a value of this
6571 type at the base address of the object. The base address, as
6572 defined in Ada.Tags, it is the address of the primary tag of
6573 the object, and therefore where the field values of its full
6574 view can be fetched. */
6577 ada_tag_value_at_base_address (struct value
*obj
)
6580 LONGEST offset_to_top
= 0;
6581 struct type
*ptr_type
, *obj_type
;
6583 CORE_ADDR base_address
;
6585 obj_type
= value_type (obj
);
6587 /* It is the responsability of the caller to deref pointers. */
6589 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6592 tag
= ada_value_tag (obj
);
6596 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6598 if (is_ada95_tag (tag
))
6601 ptr_type
= language_lookup_primitive_type
6602 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6603 ptr_type
= lookup_pointer_type (ptr_type
);
6604 val
= value_cast (ptr_type
, tag
);
6608 /* It is perfectly possible that an exception be raised while
6609 trying to determine the base address, just like for the tag;
6610 see ada_tag_name for more details. We do not print the error
6611 message for the same reason. */
6615 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6618 catch (const gdb_exception_error
&e
)
6623 /* If offset is null, nothing to do. */
6625 if (offset_to_top
== 0)
6628 /* -1 is a special case in Ada.Tags; however, what should be done
6629 is not quite clear from the documentation. So do nothing for
6632 if (offset_to_top
== -1)
6635 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6636 from the base address. This was however incompatible with
6637 C++ dispatch table: C++ uses a *negative* value to *add*
6638 to the base address. Ada's convention has therefore been
6639 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6640 use the same convention. Here, we support both cases by
6641 checking the sign of OFFSET_TO_TOP. */
6643 if (offset_to_top
> 0)
6644 offset_to_top
= -offset_to_top
;
6646 base_address
= value_address (obj
) + offset_to_top
;
6647 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6649 /* Make sure that we have a proper tag at the new address.
6650 Otherwise, offset_to_top is bogus (which can happen when
6651 the object is not initialized yet). */
6656 obj_type
= type_from_tag (tag
);
6661 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6664 /* Return the "ada__tags__type_specific_data" type. */
6666 static struct type
*
6667 ada_get_tsd_type (struct inferior
*inf
)
6669 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6671 if (data
->tsd_type
== 0)
6672 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6673 return data
->tsd_type
;
6676 /* Return the TSD (type-specific data) associated to the given TAG.
6677 TAG is assumed to be the tag of a tagged-type entity.
6679 May return NULL if we are unable to get the TSD. */
6681 static struct value
*
6682 ada_get_tsd_from_tag (struct value
*tag
)
6687 /* First option: The TSD is simply stored as a field of our TAG.
6688 Only older versions of GNAT would use this format, but we have
6689 to test it first, because there are no visible markers for
6690 the current approach except the absence of that field. */
6692 val
= ada_value_struct_elt (tag
, "tsd", 1);
6696 /* Try the second representation for the dispatch table (in which
6697 there is no explicit 'tsd' field in the referent of the tag pointer,
6698 and instead the tsd pointer is stored just before the dispatch
6701 type
= ada_get_tsd_type (current_inferior());
6704 type
= lookup_pointer_type (lookup_pointer_type (type
));
6705 val
= value_cast (type
, tag
);
6708 return value_ind (value_ptradd (val
, -1));
6711 /* Given the TSD of a tag (type-specific data), return a string
6712 containing the name of the associated type.
6714 May return NULL if we are unable to determine the tag name. */
6716 static gdb::unique_xmalloc_ptr
<char>
6717 ada_tag_name_from_tsd (struct value
*tsd
)
6722 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6725 gdb::unique_xmalloc_ptr
<char> buffer
6726 = target_read_string (value_as_address (val
), INT_MAX
);
6727 if (buffer
== nullptr)
6730 for (p
= buffer
.get (); *p
!= '\0'; ++p
)
6739 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6742 Return NULL if the TAG is not an Ada tag, or if we were unable to
6743 determine the name of that tag. */
6745 gdb::unique_xmalloc_ptr
<char>
6746 ada_tag_name (struct value
*tag
)
6748 gdb::unique_xmalloc_ptr
<char> name
;
6750 if (!ada_is_tag_type (value_type (tag
)))
6753 /* It is perfectly possible that an exception be raised while trying
6754 to determine the TAG's name, even under normal circumstances:
6755 The associated variable may be uninitialized or corrupted, for
6756 instance. We do not let any exception propagate past this point.
6757 instead we return NULL.
6759 We also do not print the error message either (which often is very
6760 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6761 the caller print a more meaningful message if necessary. */
6764 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6767 name
= ada_tag_name_from_tsd (tsd
);
6769 catch (const gdb_exception_error
&e
)
6776 /* The parent type of TYPE, or NULL if none. */
6779 ada_parent_type (struct type
*type
)
6783 type
= ada_check_typedef (type
);
6785 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6788 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6789 if (ada_is_parent_field (type
, i
))
6791 struct type
*parent_type
= type
->field (i
).type ();
6793 /* If the _parent field is a pointer, then dereference it. */
6794 if (parent_type
->code () == TYPE_CODE_PTR
)
6795 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6796 /* If there is a parallel XVS type, get the actual base type. */
6797 parent_type
= ada_get_base_type (parent_type
);
6799 return ada_check_typedef (parent_type
);
6805 /* True iff field number FIELD_NUM of structure type TYPE contains the
6806 parent-type (inherited) fields of a derived type. Assumes TYPE is
6807 a structure type with at least FIELD_NUM+1 fields. */
6810 ada_is_parent_field (struct type
*type
, int field_num
)
6812 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6814 return (name
!= NULL
6815 && (startswith (name
, "PARENT")
6816 || startswith (name
, "_parent")));
6819 /* True iff field number FIELD_NUM of structure type TYPE is a
6820 transparent wrapper field (which should be silently traversed when doing
6821 field selection and flattened when printing). Assumes TYPE is a
6822 structure type with at least FIELD_NUM+1 fields. Such fields are always
6826 ada_is_wrapper_field (struct type
*type
, int field_num
)
6828 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6830 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6832 /* This happens in functions with "out" or "in out" parameters
6833 which are passed by copy. For such functions, GNAT describes
6834 the function's return type as being a struct where the return
6835 value is in a field called RETVAL, and where the other "out"
6836 or "in out" parameters are fields of that struct. This is not
6841 return (name
!= NULL
6842 && (startswith (name
, "PARENT")
6843 || strcmp (name
, "REP") == 0
6844 || startswith (name
, "_parent")
6845 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6848 /* True iff field number FIELD_NUM of structure or union type TYPE
6849 is a variant wrapper. Assumes TYPE is a structure type with at least
6850 FIELD_NUM+1 fields. */
6853 ada_is_variant_part (struct type
*type
, int field_num
)
6855 /* Only Ada types are eligible. */
6856 if (!ADA_TYPE_P (type
))
6859 struct type
*field_type
= type
->field (field_num
).type ();
6861 return (field_type
->code () == TYPE_CODE_UNION
6862 || (is_dynamic_field (type
, field_num
)
6863 && (TYPE_TARGET_TYPE (field_type
)->code ()
6864 == TYPE_CODE_UNION
)));
6867 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6868 whose discriminants are contained in the record type OUTER_TYPE,
6869 returns the type of the controlling discriminant for the variant.
6870 May return NULL if the type could not be found. */
6873 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6875 const char *name
= ada_variant_discrim_name (var_type
);
6877 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6880 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6881 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6882 represents a 'when others' clause; otherwise 0. */
6885 ada_is_others_clause (struct type
*type
, int field_num
)
6887 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6889 return (name
!= NULL
&& name
[0] == 'O');
6892 /* Assuming that TYPE0 is the type of the variant part of a record,
6893 returns the name of the discriminant controlling the variant.
6894 The value is valid until the next call to ada_variant_discrim_name. */
6897 ada_variant_discrim_name (struct type
*type0
)
6899 static char *result
= NULL
;
6900 static size_t result_len
= 0;
6903 const char *discrim_end
;
6904 const char *discrim_start
;
6906 if (type0
->code () == TYPE_CODE_PTR
)
6907 type
= TYPE_TARGET_TYPE (type0
);
6911 name
= ada_type_name (type
);
6913 if (name
== NULL
|| name
[0] == '\000')
6916 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6919 if (startswith (discrim_end
, "___XVN"))
6922 if (discrim_end
== name
)
6925 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6928 if (discrim_start
== name
+ 1)
6930 if ((discrim_start
> name
+ 3
6931 && startswith (discrim_start
- 3, "___"))
6932 || discrim_start
[-1] == '.')
6936 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6937 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6938 result
[discrim_end
- discrim_start
] = '\0';
6942 /* Scan STR for a subtype-encoded number, beginning at position K.
6943 Put the position of the character just past the number scanned in
6944 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6945 Return 1 if there was a valid number at the given position, and 0
6946 otherwise. A "subtype-encoded" number consists of the absolute value
6947 in decimal, followed by the letter 'm' to indicate a negative number.
6948 Assumes 0m does not occur. */
6951 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6955 if (!isdigit (str
[k
]))
6958 /* Do it the hard way so as not to make any assumption about
6959 the relationship of unsigned long (%lu scan format code) and
6962 while (isdigit (str
[k
]))
6964 RU
= RU
* 10 + (str
[k
] - '0');
6971 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6977 /* NOTE on the above: Technically, C does not say what the results of
6978 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6979 number representable as a LONGEST (although either would probably work
6980 in most implementations). When RU>0, the locution in the then branch
6981 above is always equivalent to the negative of RU. */
6988 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6989 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6990 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6993 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6995 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7009 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
7019 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
7020 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7022 if (val
>= L
&& val
<= U
)
7034 /* FIXME: Lots of redundancy below. Try to consolidate. */
7036 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7037 ARG_TYPE, extract and return the value of one of its (non-static)
7038 fields. FIELDNO says which field. Differs from value_primitive_field
7039 only in that it can handle packed values of arbitrary type. */
7042 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7043 struct type
*arg_type
)
7047 arg_type
= ada_check_typedef (arg_type
);
7048 type
= arg_type
->field (fieldno
).type ();
7050 /* Handle packed fields. It might be that the field is not packed
7051 relative to its containing structure, but the structure itself is
7052 packed; in this case we must take the bit-field path. */
7053 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
7055 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7056 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7058 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7059 offset
+ bit_pos
/ 8,
7060 bit_pos
% 8, bit_size
, type
);
7063 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7066 /* Find field with name NAME in object of type TYPE. If found,
7067 set the following for each argument that is non-null:
7068 - *FIELD_TYPE_P to the field's type;
7069 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7070 an object of that type;
7071 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7072 - *BIT_SIZE_P to its size in bits if the field is packed, and
7074 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7075 fields up to but not including the desired field, or by the total
7076 number of fields if not found. A NULL value of NAME never
7077 matches; the function just counts visible fields in this case.
7079 Notice that we need to handle when a tagged record hierarchy
7080 has some components with the same name, like in this scenario:
7082 type Top_T is tagged record
7088 type Middle_T is new Top.Top_T with record
7089 N : Character := 'a';
7093 type Bottom_T is new Middle.Middle_T with record
7095 C : Character := '5';
7097 A : Character := 'J';
7100 Let's say we now have a variable declared and initialized as follow:
7102 TC : Top_A := new Bottom_T;
7104 And then we use this variable to call this function
7106 procedure Assign (Obj: in out Top_T; TV : Integer);
7110 Assign (Top_T (B), 12);
7112 Now, we're in the debugger, and we're inside that procedure
7113 then and we want to print the value of obj.c:
7115 Usually, the tagged record or one of the parent type owns the
7116 component to print and there's no issue but in this particular
7117 case, what does it mean to ask for Obj.C? Since the actual
7118 type for object is type Bottom_T, it could mean two things: type
7119 component C from the Middle_T view, but also component C from
7120 Bottom_T. So in that "undefined" case, when the component is
7121 not found in the non-resolved type (which includes all the
7122 components of the parent type), then resolve it and see if we
7123 get better luck once expanded.
7125 In the case of homonyms in the derived tagged type, we don't
7126 guaranty anything, and pick the one that's easiest for us
7129 Returns 1 if found, 0 otherwise. */
7132 find_struct_field (const char *name
, struct type
*type
, int offset
,
7133 struct type
**field_type_p
,
7134 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7138 int parent_offset
= -1;
7140 type
= ada_check_typedef (type
);
7142 if (field_type_p
!= NULL
)
7143 *field_type_p
= NULL
;
7144 if (byte_offset_p
!= NULL
)
7146 if (bit_offset_p
!= NULL
)
7148 if (bit_size_p
!= NULL
)
7151 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7153 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7154 int fld_offset
= offset
+ bit_pos
/ 8;
7155 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7157 if (t_field_name
== NULL
)
7160 else if (ada_is_parent_field (type
, i
))
7162 /* This is a field pointing us to the parent type of a tagged
7163 type. As hinted in this function's documentation, we give
7164 preference to fields in the current record first, so what
7165 we do here is just record the index of this field before
7166 we skip it. If it turns out we couldn't find our field
7167 in the current record, then we'll get back to it and search
7168 inside it whether the field might exist in the parent. */
7174 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7176 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7178 if (field_type_p
!= NULL
)
7179 *field_type_p
= type
->field (i
).type ();
7180 if (byte_offset_p
!= NULL
)
7181 *byte_offset_p
= fld_offset
;
7182 if (bit_offset_p
!= NULL
)
7183 *bit_offset_p
= bit_pos
% 8;
7184 if (bit_size_p
!= NULL
)
7185 *bit_size_p
= bit_size
;
7188 else if (ada_is_wrapper_field (type
, i
))
7190 if (find_struct_field (name
, type
->field (i
).type (), fld_offset
,
7191 field_type_p
, byte_offset_p
, bit_offset_p
,
7192 bit_size_p
, index_p
))
7195 else if (ada_is_variant_part (type
, i
))
7197 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7200 struct type
*field_type
7201 = ada_check_typedef (type
->field (i
).type ());
7203 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7205 if (find_struct_field (name
, field_type
->field (j
).type (),
7207 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7208 field_type_p
, byte_offset_p
,
7209 bit_offset_p
, bit_size_p
, index_p
))
7213 else if (index_p
!= NULL
)
7217 /* Field not found so far. If this is a tagged type which
7218 has a parent, try finding that field in the parent now. */
7220 if (parent_offset
!= -1)
7222 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7223 int fld_offset
= offset
+ bit_pos
/ 8;
7225 if (find_struct_field (name
, type
->field (parent_offset
).type (),
7226 fld_offset
, field_type_p
, byte_offset_p
,
7227 bit_offset_p
, bit_size_p
, index_p
))
7234 /* Number of user-visible fields in record type TYPE. */
7237 num_visible_fields (struct type
*type
)
7242 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7246 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7247 and search in it assuming it has (class) type TYPE.
7248 If found, return value, else return NULL.
7250 Searches recursively through wrapper fields (e.g., '_parent').
7252 In the case of homonyms in the tagged types, please refer to the
7253 long explanation in find_struct_field's function documentation. */
7255 static struct value
*
7256 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7260 int parent_offset
= -1;
7262 type
= ada_check_typedef (type
);
7263 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7265 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7267 if (t_field_name
== NULL
)
7270 else if (ada_is_parent_field (type
, i
))
7272 /* This is a field pointing us to the parent type of a tagged
7273 type. As hinted in this function's documentation, we give
7274 preference to fields in the current record first, so what
7275 we do here is just record the index of this field before
7276 we skip it. If it turns out we couldn't find our field
7277 in the current record, then we'll get back to it and search
7278 inside it whether the field might exist in the parent. */
7284 else if (field_name_match (t_field_name
, name
))
7285 return ada_value_primitive_field (arg
, offset
, i
, type
);
7287 else if (ada_is_wrapper_field (type
, i
))
7289 struct value
*v
= /* Do not let indent join lines here. */
7290 ada_search_struct_field (name
, arg
,
7291 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7292 type
->field (i
).type ());
7298 else if (ada_is_variant_part (type
, i
))
7300 /* PNH: Do we ever get here? See find_struct_field. */
7302 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7303 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7305 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7307 struct value
*v
= ada_search_struct_field
/* Force line
7310 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7311 field_type
->field (j
).type ());
7319 /* Field not found so far. If this is a tagged type which
7320 has a parent, try finding that field in the parent now. */
7322 if (parent_offset
!= -1)
7324 struct value
*v
= ada_search_struct_field (
7325 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7326 type
->field (parent_offset
).type ());
7335 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7336 int, struct type
*);
7339 /* Return field #INDEX in ARG, where the index is that returned by
7340 * find_struct_field through its INDEX_P argument. Adjust the address
7341 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7342 * If found, return value, else return NULL. */
7344 static struct value
*
7345 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7348 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7352 /* Auxiliary function for ada_index_struct_field. Like
7353 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7356 static struct value
*
7357 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7361 type
= ada_check_typedef (type
);
7363 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7365 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7367 else if (ada_is_wrapper_field (type
, i
))
7369 struct value
*v
= /* Do not let indent join lines here. */
7370 ada_index_struct_field_1 (index_p
, arg
,
7371 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7372 type
->field (i
).type ());
7378 else if (ada_is_variant_part (type
, i
))
7380 /* PNH: Do we ever get here? See ada_search_struct_field,
7381 find_struct_field. */
7382 error (_("Cannot assign this kind of variant record"));
7384 else if (*index_p
== 0)
7385 return ada_value_primitive_field (arg
, offset
, i
, type
);
7392 /* Return a string representation of type TYPE. */
7395 type_as_string (struct type
*type
)
7397 string_file tmp_stream
;
7399 type_print (type
, "", &tmp_stream
, -1);
7401 return std::move (tmp_stream
.string ());
7404 /* Given a type TYPE, look up the type of the component of type named NAME.
7405 If DISPP is non-null, add its byte displacement from the beginning of a
7406 structure (pointed to by a value) of type TYPE to *DISPP (does not
7407 work for packed fields).
7409 Matches any field whose name has NAME as a prefix, possibly
7412 TYPE can be either a struct or union. If REFOK, TYPE may also
7413 be a (pointer or reference)+ to a struct or union, and the
7414 ultimate target type will be searched.
7416 Looks recursively into variant clauses and parent types.
7418 In the case of homonyms in the tagged types, please refer to the
7419 long explanation in find_struct_field's function documentation.
7421 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7422 TYPE is not a type of the right kind. */
7424 static struct type
*
7425 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7429 int parent_offset
= -1;
7434 if (refok
&& type
!= NULL
)
7437 type
= ada_check_typedef (type
);
7438 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7440 type
= TYPE_TARGET_TYPE (type
);
7444 || (type
->code () != TYPE_CODE_STRUCT
7445 && type
->code () != TYPE_CODE_UNION
))
7450 error (_("Type %s is not a structure or union type"),
7451 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7454 type
= to_static_fixed_type (type
);
7456 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7458 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7461 if (t_field_name
== NULL
)
7464 else if (ada_is_parent_field (type
, i
))
7466 /* This is a field pointing us to the parent type of a tagged
7467 type. As hinted in this function's documentation, we give
7468 preference to fields in the current record first, so what
7469 we do here is just record the index of this field before
7470 we skip it. If it turns out we couldn't find our field
7471 in the current record, then we'll get back to it and search
7472 inside it whether the field might exist in the parent. */
7478 else if (field_name_match (t_field_name
, name
))
7479 return type
->field (i
).type ();
7481 else if (ada_is_wrapper_field (type
, i
))
7483 t
= ada_lookup_struct_elt_type (type
->field (i
).type (), name
,
7489 else if (ada_is_variant_part (type
, i
))
7492 struct type
*field_type
= ada_check_typedef (type
->field (i
).type ());
7494 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
7496 /* FIXME pnh 2008/01/26: We check for a field that is
7497 NOT wrapped in a struct, since the compiler sometimes
7498 generates these for unchecked variant types. Revisit
7499 if the compiler changes this practice. */
7500 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7502 if (v_field_name
!= NULL
7503 && field_name_match (v_field_name
, name
))
7504 t
= field_type
->field (j
).type ();
7506 t
= ada_lookup_struct_elt_type (field_type
->field (j
).type (),
7516 /* Field not found so far. If this is a tagged type which
7517 has a parent, try finding that field in the parent now. */
7519 if (parent_offset
!= -1)
7523 t
= ada_lookup_struct_elt_type (type
->field (parent_offset
).type (),
7532 const char *name_str
= name
!= NULL
? name
: _("<null>");
7534 error (_("Type %s has no component named %s"),
7535 type_as_string (type
).c_str (), name_str
);
7541 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7542 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7543 represents an unchecked union (that is, the variant part of a
7544 record that is named in an Unchecked_Union pragma). */
7547 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7549 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7551 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7555 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7556 within OUTER, determine which variant clause (field number in VAR_TYPE,
7557 numbering from 0) is applicable. Returns -1 if none are. */
7560 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7564 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7565 struct value
*discrim
;
7566 LONGEST discrim_val
;
7568 /* Using plain value_from_contents_and_address here causes problems
7569 because we will end up trying to resolve a type that is currently
7570 being constructed. */
7571 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7572 if (discrim
== NULL
)
7574 discrim_val
= value_as_long (discrim
);
7577 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7579 if (ada_is_others_clause (var_type
, i
))
7581 else if (ada_in_variant (discrim_val
, var_type
, i
))
7585 return others_clause
;
7590 /* Dynamic-Sized Records */
7592 /* Strategy: The type ostensibly attached to a value with dynamic size
7593 (i.e., a size that is not statically recorded in the debugging
7594 data) does not accurately reflect the size or layout of the value.
7595 Our strategy is to convert these values to values with accurate,
7596 conventional types that are constructed on the fly. */
7598 /* There is a subtle and tricky problem here. In general, we cannot
7599 determine the size of dynamic records without its data. However,
7600 the 'struct value' data structure, which GDB uses to represent
7601 quantities in the inferior process (the target), requires the size
7602 of the type at the time of its allocation in order to reserve space
7603 for GDB's internal copy of the data. That's why the
7604 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7605 rather than struct value*s.
7607 However, GDB's internal history variables ($1, $2, etc.) are
7608 struct value*s containing internal copies of the data that are not, in
7609 general, the same as the data at their corresponding addresses in
7610 the target. Fortunately, the types we give to these values are all
7611 conventional, fixed-size types (as per the strategy described
7612 above), so that we don't usually have to perform the
7613 'to_fixed_xxx_type' conversions to look at their values.
7614 Unfortunately, there is one exception: if one of the internal
7615 history variables is an array whose elements are unconstrained
7616 records, then we will need to create distinct fixed types for each
7617 element selected. */
7619 /* The upshot of all of this is that many routines take a (type, host
7620 address, target address) triple as arguments to represent a value.
7621 The host address, if non-null, is supposed to contain an internal
7622 copy of the relevant data; otherwise, the program is to consult the
7623 target at the target address. */
7625 /* Assuming that VAL0 represents a pointer value, the result of
7626 dereferencing it. Differs from value_ind in its treatment of
7627 dynamic-sized types. */
7630 ada_value_ind (struct value
*val0
)
7632 struct value
*val
= value_ind (val0
);
7634 if (ada_is_tagged_type (value_type (val
), 0))
7635 val
= ada_tag_value_at_base_address (val
);
7637 return ada_to_fixed_value (val
);
7640 /* The value resulting from dereferencing any "reference to"
7641 qualifiers on VAL0. */
7643 static struct value
*
7644 ada_coerce_ref (struct value
*val0
)
7646 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7648 struct value
*val
= val0
;
7650 val
= coerce_ref (val
);
7652 if (ada_is_tagged_type (value_type (val
), 0))
7653 val
= ada_tag_value_at_base_address (val
);
7655 return ada_to_fixed_value (val
);
7661 /* Return the bit alignment required for field #F of template type TYPE. */
7664 field_alignment (struct type
*type
, int f
)
7666 const char *name
= TYPE_FIELD_NAME (type
, f
);
7670 /* The field name should never be null, unless the debugging information
7671 is somehow malformed. In this case, we assume the field does not
7672 require any alignment. */
7676 len
= strlen (name
);
7678 if (!isdigit (name
[len
- 1]))
7681 if (isdigit (name
[len
- 2]))
7682 align_offset
= len
- 2;
7684 align_offset
= len
- 1;
7686 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7687 return TARGET_CHAR_BIT
;
7689 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7692 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7694 static struct symbol
*
7695 ada_find_any_type_symbol (const char *name
)
7699 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7700 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7703 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7707 /* Find a type named NAME. Ignores ambiguity. This routine will look
7708 solely for types defined by debug info, it will not search the GDB
7711 static struct type
*
7712 ada_find_any_type (const char *name
)
7714 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7717 return SYMBOL_TYPE (sym
);
7722 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7723 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7724 symbol, in which case it is returned. Otherwise, this looks for
7725 symbols whose name is that of NAME_SYM suffixed with "___XR".
7726 Return symbol if found, and NULL otherwise. */
7729 ada_is_renaming_symbol (struct symbol
*name_sym
)
7731 const char *name
= name_sym
->linkage_name ();
7732 return strstr (name
, "___XR") != NULL
;
7735 /* Because of GNAT encoding conventions, several GDB symbols may match a
7736 given type name. If the type denoted by TYPE0 is to be preferred to
7737 that of TYPE1 for purposes of type printing, return non-zero;
7738 otherwise return 0. */
7741 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7745 else if (type0
== NULL
)
7747 else if (type1
->code () == TYPE_CODE_VOID
)
7749 else if (type0
->code () == TYPE_CODE_VOID
)
7751 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7753 else if (ada_is_constrained_packed_array_type (type0
))
7755 else if (ada_is_array_descriptor_type (type0
)
7756 && !ada_is_array_descriptor_type (type1
))
7760 const char *type0_name
= type0
->name ();
7761 const char *type1_name
= type1
->name ();
7763 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7764 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7770 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7774 ada_type_name (struct type
*type
)
7778 return type
->name ();
7781 /* Search the list of "descriptive" types associated to TYPE for a type
7782 whose name is NAME. */
7784 static struct type
*
7785 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7787 struct type
*result
, *tmp
;
7789 if (ada_ignore_descriptive_types_p
)
7792 /* If there no descriptive-type info, then there is no parallel type
7794 if (!HAVE_GNAT_AUX_INFO (type
))
7797 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7798 while (result
!= NULL
)
7800 const char *result_name
= ada_type_name (result
);
7802 if (result_name
== NULL
)
7804 warning (_("unexpected null name on descriptive type"));
7808 /* If the names match, stop. */
7809 if (strcmp (result_name
, name
) == 0)
7812 /* Otherwise, look at the next item on the list, if any. */
7813 if (HAVE_GNAT_AUX_INFO (result
))
7814 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7818 /* If not found either, try after having resolved the typedef. */
7823 result
= check_typedef (result
);
7824 if (HAVE_GNAT_AUX_INFO (result
))
7825 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7831 /* If we didn't find a match, see whether this is a packed array. With
7832 older compilers, the descriptive type information is either absent or
7833 irrelevant when it comes to packed arrays so the above lookup fails.
7834 Fall back to using a parallel lookup by name in this case. */
7835 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7836 return ada_find_any_type (name
);
7841 /* Find a parallel type to TYPE with the specified NAME, using the
7842 descriptive type taken from the debugging information, if available,
7843 and otherwise using the (slower) name-based method. */
7845 static struct type
*
7846 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7848 struct type
*result
= NULL
;
7850 if (HAVE_GNAT_AUX_INFO (type
))
7851 result
= find_parallel_type_by_descriptive_type (type
, name
);
7853 result
= ada_find_any_type (name
);
7858 /* Same as above, but specify the name of the parallel type by appending
7859 SUFFIX to the name of TYPE. */
7862 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7865 const char *type_name
= ada_type_name (type
);
7868 if (type_name
== NULL
)
7871 len
= strlen (type_name
);
7873 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7875 strcpy (name
, type_name
);
7876 strcpy (name
+ len
, suffix
);
7878 return ada_find_parallel_type_with_name (type
, name
);
7881 /* If TYPE is a variable-size record type, return the corresponding template
7882 type describing its fields. Otherwise, return NULL. */
7884 static struct type
*
7885 dynamic_template_type (struct type
*type
)
7887 type
= ada_check_typedef (type
);
7889 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7890 || ada_type_name (type
) == NULL
)
7894 int len
= strlen (ada_type_name (type
));
7896 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7899 return ada_find_parallel_type (type
, "___XVE");
7903 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7904 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7907 is_dynamic_field (struct type
*templ_type
, int field_num
)
7909 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7912 && templ_type
->field (field_num
).type ()->code () == TYPE_CODE_PTR
7913 && strstr (name
, "___XVL") != NULL
;
7916 /* The index of the variant field of TYPE, or -1 if TYPE does not
7917 represent a variant record type. */
7920 variant_field_index (struct type
*type
)
7924 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
7927 for (f
= 0; f
< type
->num_fields (); f
+= 1)
7929 if (ada_is_variant_part (type
, f
))
7935 /* A record type with no fields. */
7937 static struct type
*
7938 empty_record (struct type
*templ
)
7940 struct type
*type
= alloc_type_copy (templ
);
7942 type
->set_code (TYPE_CODE_STRUCT
);
7943 INIT_NONE_SPECIFIC (type
);
7944 type
->set_name ("<empty>");
7945 TYPE_LENGTH (type
) = 0;
7949 /* An ordinary record type (with fixed-length fields) that describes
7950 the value of type TYPE at VALADDR or ADDRESS (see comments at
7951 the beginning of this section) VAL according to GNAT conventions.
7952 DVAL0 should describe the (portion of a) record that contains any
7953 necessary discriminants. It should be NULL if value_type (VAL) is
7954 an outer-level type (i.e., as opposed to a branch of a variant.) A
7955 variant field (unless unchecked) is replaced by a particular branch
7958 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7959 length are not statically known are discarded. As a consequence,
7960 VALADDR, ADDRESS and DVAL0 are ignored.
7962 NOTE: Limitations: For now, we assume that dynamic fields and
7963 variants occupy whole numbers of bytes. However, they need not be
7967 ada_template_to_fixed_record_type_1 (struct type
*type
,
7968 const gdb_byte
*valaddr
,
7969 CORE_ADDR address
, struct value
*dval0
,
7970 int keep_dynamic_fields
)
7972 struct value
*mark
= value_mark ();
7975 int nfields
, bit_len
;
7981 /* Compute the number of fields in this record type that are going
7982 to be processed: unless keep_dynamic_fields, this includes only
7983 fields whose position and length are static will be processed. */
7984 if (keep_dynamic_fields
)
7985 nfields
= type
->num_fields ();
7989 while (nfields
< type
->num_fields ()
7990 && !ada_is_variant_part (type
, nfields
)
7991 && !is_dynamic_field (type
, nfields
))
7995 rtype
= alloc_type_copy (type
);
7996 rtype
->set_code (TYPE_CODE_STRUCT
);
7997 INIT_NONE_SPECIFIC (rtype
);
7998 rtype
->set_num_fields (nfields
);
8000 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
8001 rtype
->set_name (ada_type_name (type
));
8002 TYPE_FIXED_INSTANCE (rtype
) = 1;
8008 for (f
= 0; f
< nfields
; f
+= 1)
8010 off
= align_up (off
, field_alignment (type
, f
))
8011 + TYPE_FIELD_BITPOS (type
, f
);
8012 SET_FIELD_BITPOS (rtype
->field (f
), off
);
8013 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8015 if (ada_is_variant_part (type
, f
))
8020 else if (is_dynamic_field (type
, f
))
8022 const gdb_byte
*field_valaddr
= valaddr
;
8023 CORE_ADDR field_address
= address
;
8024 struct type
*field_type
=
8025 TYPE_TARGET_TYPE (type
->field (f
).type ());
8029 /* rtype's length is computed based on the run-time
8030 value of discriminants. If the discriminants are not
8031 initialized, the type size may be completely bogus and
8032 GDB may fail to allocate a value for it. So check the
8033 size first before creating the value. */
8034 ada_ensure_varsize_limit (rtype
);
8035 /* Using plain value_from_contents_and_address here
8036 causes problems because we will end up trying to
8037 resolve a type that is currently being
8039 dval
= value_from_contents_and_address_unresolved (rtype
,
8042 rtype
= value_type (dval
);
8047 /* If the type referenced by this field is an aligner type, we need
8048 to unwrap that aligner type, because its size might not be set.
8049 Keeping the aligner type would cause us to compute the wrong
8050 size for this field, impacting the offset of the all the fields
8051 that follow this one. */
8052 if (ada_is_aligner_type (field_type
))
8054 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8056 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8057 field_address
= cond_offset_target (field_address
, field_offset
);
8058 field_type
= ada_aligned_type (field_type
);
8061 field_valaddr
= cond_offset_host (field_valaddr
,
8062 off
/ TARGET_CHAR_BIT
);
8063 field_address
= cond_offset_target (field_address
,
8064 off
/ TARGET_CHAR_BIT
);
8066 /* Get the fixed type of the field. Note that, in this case,
8067 we do not want to get the real type out of the tag: if
8068 the current field is the parent part of a tagged record,
8069 we will get the tag of the object. Clearly wrong: the real
8070 type of the parent is not the real type of the child. We
8071 would end up in an infinite loop. */
8072 field_type
= ada_get_base_type (field_type
);
8073 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8074 field_address
, dval
, 0);
8075 /* If the field size is already larger than the maximum
8076 object size, then the record itself will necessarily
8077 be larger than the maximum object size. We need to make
8078 this check now, because the size might be so ridiculously
8079 large (due to an uninitialized variable in the inferior)
8080 that it would cause an overflow when adding it to the
8082 ada_ensure_varsize_limit (field_type
);
8084 rtype
->field (f
).set_type (field_type
);
8085 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8086 /* The multiplication can potentially overflow. But because
8087 the field length has been size-checked just above, and
8088 assuming that the maximum size is a reasonable value,
8089 an overflow should not happen in practice. So rather than
8090 adding overflow recovery code to this already complex code,
8091 we just assume that it's not going to happen. */
8093 TYPE_LENGTH (rtype
->field (f
).type ()) * TARGET_CHAR_BIT
;
8097 /* Note: If this field's type is a typedef, it is important
8098 to preserve the typedef layer.
8100 Otherwise, we might be transforming a typedef to a fat
8101 pointer (encoding a pointer to an unconstrained array),
8102 into a basic fat pointer (encoding an unconstrained
8103 array). As both types are implemented using the same
8104 structure, the typedef is the only clue which allows us
8105 to distinguish between the two options. Stripping it
8106 would prevent us from printing this field appropriately. */
8107 rtype
->field (f
).set_type (type
->field (f
).type ());
8108 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8109 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8111 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8114 struct type
*field_type
= type
->field (f
).type ();
8116 /* We need to be careful of typedefs when computing
8117 the length of our field. If this is a typedef,
8118 get the length of the target type, not the length
8120 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
8121 field_type
= ada_typedef_target_type (field_type
);
8124 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8127 if (off
+ fld_bit_len
> bit_len
)
8128 bit_len
= off
+ fld_bit_len
;
8130 TYPE_LENGTH (rtype
) =
8131 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8134 /* We handle the variant part, if any, at the end because of certain
8135 odd cases in which it is re-ordered so as NOT to be the last field of
8136 the record. This can happen in the presence of representation
8138 if (variant_field
>= 0)
8140 struct type
*branch_type
;
8142 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8146 /* Using plain value_from_contents_and_address here causes
8147 problems because we will end up trying to resolve a type
8148 that is currently being constructed. */
8149 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8151 rtype
= value_type (dval
);
8157 to_fixed_variant_branch_type
8158 (type
->field (variant_field
).type (),
8159 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8160 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8161 if (branch_type
== NULL
)
8163 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
8164 rtype
->field (f
- 1) = rtype
->field (f
);
8165 rtype
->set_num_fields (rtype
->num_fields () - 1);
8169 rtype
->field (variant_field
).set_type (branch_type
);
8170 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8172 TYPE_LENGTH (rtype
->field (variant_field
).type ()) *
8174 if (off
+ fld_bit_len
> bit_len
)
8175 bit_len
= off
+ fld_bit_len
;
8176 TYPE_LENGTH (rtype
) =
8177 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8181 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8182 should contain the alignment of that record, which should be a strictly
8183 positive value. If null or negative, then something is wrong, most
8184 probably in the debug info. In that case, we don't round up the size
8185 of the resulting type. If this record is not part of another structure,
8186 the current RTYPE length might be good enough for our purposes. */
8187 if (TYPE_LENGTH (type
) <= 0)
8190 warning (_("Invalid type size for `%s' detected: %s."),
8191 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
8193 warning (_("Invalid type size for <unnamed> detected: %s."),
8194 pulongest (TYPE_LENGTH (type
)));
8198 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
8199 TYPE_LENGTH (type
));
8202 value_free_to_mark (mark
);
8203 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8204 error (_("record type with dynamic size is larger than varsize-limit"));
8208 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8211 static struct type
*
8212 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8213 CORE_ADDR address
, struct value
*dval0
)
8215 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8219 /* An ordinary record type in which ___XVL-convention fields and
8220 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8221 static approximations, containing all possible fields. Uses
8222 no runtime values. Useless for use in values, but that's OK,
8223 since the results are used only for type determinations. Works on both
8224 structs and unions. Representation note: to save space, we memorize
8225 the result of this function in the TYPE_TARGET_TYPE of the
8228 static struct type
*
8229 template_to_static_fixed_type (struct type
*type0
)
8235 /* No need no do anything if the input type is already fixed. */
8236 if (TYPE_FIXED_INSTANCE (type0
))
8239 /* Likewise if we already have computed the static approximation. */
8240 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8241 return TYPE_TARGET_TYPE (type0
);
8243 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8245 nfields
= type0
->num_fields ();
8247 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8248 recompute all over next time. */
8249 TYPE_TARGET_TYPE (type0
) = type
;
8251 for (f
= 0; f
< nfields
; f
+= 1)
8253 struct type
*field_type
= type0
->field (f
).type ();
8254 struct type
*new_type
;
8256 if (is_dynamic_field (type0
, f
))
8258 field_type
= ada_check_typedef (field_type
);
8259 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8262 new_type
= static_unwrap_type (field_type
);
8264 if (new_type
!= field_type
)
8266 /* Clone TYPE0 only the first time we get a new field type. */
8269 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8270 type
->set_code (type0
->code ());
8271 INIT_NONE_SPECIFIC (type
);
8272 type
->set_num_fields (nfields
);
8276 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
8277 memcpy (fields
, type0
->fields (),
8278 sizeof (struct field
) * nfields
);
8279 type
->set_fields (fields
);
8281 type
->set_name (ada_type_name (type0
));
8282 TYPE_FIXED_INSTANCE (type
) = 1;
8283 TYPE_LENGTH (type
) = 0;
8285 type
->field (f
).set_type (new_type
);
8286 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8293 /* Given an object of type TYPE whose contents are at VALADDR and
8294 whose address in memory is ADDRESS, returns a revision of TYPE,
8295 which should be a non-dynamic-sized record, in which the variant
8296 part, if any, is replaced with the appropriate branch. Looks
8297 for discriminant values in DVAL0, which can be NULL if the record
8298 contains the necessary discriminant values. */
8300 static struct type
*
8301 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8302 CORE_ADDR address
, struct value
*dval0
)
8304 struct value
*mark
= value_mark ();
8307 struct type
*branch_type
;
8308 int nfields
= type
->num_fields ();
8309 int variant_field
= variant_field_index (type
);
8311 if (variant_field
== -1)
8316 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8317 type
= value_type (dval
);
8322 rtype
= alloc_type_copy (type
);
8323 rtype
->set_code (TYPE_CODE_STRUCT
);
8324 INIT_NONE_SPECIFIC (rtype
);
8325 rtype
->set_num_fields (nfields
);
8328 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8329 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
8330 rtype
->set_fields (fields
);
8332 rtype
->set_name (ada_type_name (type
));
8333 TYPE_FIXED_INSTANCE (rtype
) = 1;
8334 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8336 branch_type
= to_fixed_variant_branch_type
8337 (type
->field (variant_field
).type (),
8338 cond_offset_host (valaddr
,
8339 TYPE_FIELD_BITPOS (type
, variant_field
)
8341 cond_offset_target (address
,
8342 TYPE_FIELD_BITPOS (type
, variant_field
)
8343 / TARGET_CHAR_BIT
), dval
);
8344 if (branch_type
== NULL
)
8348 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8349 rtype
->field (f
- 1) = rtype
->field (f
);
8350 rtype
->set_num_fields (rtype
->num_fields () - 1);
8354 rtype
->field (variant_field
).set_type (branch_type
);
8355 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8356 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8357 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8359 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (type
->field (variant_field
).type ());
8361 value_free_to_mark (mark
);
8365 /* An ordinary record type (with fixed-length fields) that describes
8366 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8367 beginning of this section]. Any necessary discriminants' values
8368 should be in DVAL, a record value; it may be NULL if the object
8369 at ADDR itself contains any necessary discriminant values.
8370 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8371 values from the record are needed. Except in the case that DVAL,
8372 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8373 unchecked) is replaced by a particular branch of the variant.
8375 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8376 is questionable and may be removed. It can arise during the
8377 processing of an unconstrained-array-of-record type where all the
8378 variant branches have exactly the same size. This is because in
8379 such cases, the compiler does not bother to use the XVS convention
8380 when encoding the record. I am currently dubious of this
8381 shortcut and suspect the compiler should be altered. FIXME. */
8383 static struct type
*
8384 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8385 CORE_ADDR address
, struct value
*dval
)
8387 struct type
*templ_type
;
8389 if (TYPE_FIXED_INSTANCE (type0
))
8392 templ_type
= dynamic_template_type (type0
);
8394 if (templ_type
!= NULL
)
8395 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8396 else if (variant_field_index (type0
) >= 0)
8398 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8400 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8405 TYPE_FIXED_INSTANCE (type0
) = 1;
8411 /* An ordinary record type (with fixed-length fields) that describes
8412 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8413 union type. Any necessary discriminants' values should be in DVAL,
8414 a record value. That is, this routine selects the appropriate
8415 branch of the union at ADDR according to the discriminant value
8416 indicated in the union's type name. Returns VAR_TYPE0 itself if
8417 it represents a variant subject to a pragma Unchecked_Union. */
8419 static struct type
*
8420 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8421 CORE_ADDR address
, struct value
*dval
)
8424 struct type
*templ_type
;
8425 struct type
*var_type
;
8427 if (var_type0
->code () == TYPE_CODE_PTR
)
8428 var_type
= TYPE_TARGET_TYPE (var_type0
);
8430 var_type
= var_type0
;
8432 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8434 if (templ_type
!= NULL
)
8435 var_type
= templ_type
;
8437 if (is_unchecked_variant (var_type
, value_type (dval
)))
8439 which
= ada_which_variant_applies (var_type
, dval
);
8442 return empty_record (var_type
);
8443 else if (is_dynamic_field (var_type
, which
))
8444 return to_fixed_record_type
8445 (TYPE_TARGET_TYPE (var_type
->field (which
).type ()),
8446 valaddr
, address
, dval
);
8447 else if (variant_field_index (var_type
->field (which
).type ()) >= 0)
8449 to_fixed_record_type
8450 (var_type
->field (which
).type (), valaddr
, address
, dval
);
8452 return var_type
->field (which
).type ();
8455 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8456 ENCODING_TYPE, a type following the GNAT conventions for discrete
8457 type encodings, only carries redundant information. */
8460 ada_is_redundant_range_encoding (struct type
*range_type
,
8461 struct type
*encoding_type
)
8463 const char *bounds_str
;
8467 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8469 if (get_base_type (range_type
)->code ()
8470 != get_base_type (encoding_type
)->code ())
8472 /* The compiler probably used a simple base type to describe
8473 the range type instead of the range's actual base type,
8474 expecting us to get the real base type from the encoding
8475 anyway. In this situation, the encoding cannot be ignored
8480 if (is_dynamic_type (range_type
))
8483 if (encoding_type
->name () == NULL
)
8486 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8487 if (bounds_str
== NULL
)
8490 n
= 8; /* Skip "___XDLU_". */
8491 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8493 if (TYPE_LOW_BOUND (range_type
) != lo
)
8496 n
+= 2; /* Skip the "__" separator between the two bounds. */
8497 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8499 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8505 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8506 a type following the GNAT encoding for describing array type
8507 indices, only carries redundant information. */
8510 ada_is_redundant_index_type_desc (struct type
*array_type
,
8511 struct type
*desc_type
)
8513 struct type
*this_layer
= check_typedef (array_type
);
8516 for (i
= 0; i
< desc_type
->num_fields (); i
++)
8518 if (!ada_is_redundant_range_encoding (this_layer
->index_type (),
8519 desc_type
->field (i
).type ()))
8521 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8527 /* Assuming that TYPE0 is an array type describing the type of a value
8528 at ADDR, and that DVAL describes a record containing any
8529 discriminants used in TYPE0, returns a type for the value that
8530 contains no dynamic components (that is, no components whose sizes
8531 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8532 true, gives an error message if the resulting type's size is over
8535 static struct type
*
8536 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8539 struct type
*index_type_desc
;
8540 struct type
*result
;
8541 int constrained_packed_array_p
;
8542 static const char *xa_suffix
= "___XA";
8544 type0
= ada_check_typedef (type0
);
8545 if (TYPE_FIXED_INSTANCE (type0
))
8548 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8549 if (constrained_packed_array_p
)
8550 type0
= decode_constrained_packed_array_type (type0
);
8552 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8554 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8555 encoding suffixed with 'P' may still be generated. If so,
8556 it should be used to find the XA type. */
8558 if (index_type_desc
== NULL
)
8560 const char *type_name
= ada_type_name (type0
);
8562 if (type_name
!= NULL
)
8564 const int len
= strlen (type_name
);
8565 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8567 if (type_name
[len
- 1] == 'P')
8569 strcpy (name
, type_name
);
8570 strcpy (name
+ len
- 1, xa_suffix
);
8571 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8576 ada_fixup_array_indexes_type (index_type_desc
);
8577 if (index_type_desc
!= NULL
8578 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8580 /* Ignore this ___XA parallel type, as it does not bring any
8581 useful information. This allows us to avoid creating fixed
8582 versions of the array's index types, which would be identical
8583 to the original ones. This, in turn, can also help avoid
8584 the creation of fixed versions of the array itself. */
8585 index_type_desc
= NULL
;
8588 if (index_type_desc
== NULL
)
8590 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8592 /* NOTE: elt_type---the fixed version of elt_type0---should never
8593 depend on the contents of the array in properly constructed
8595 /* Create a fixed version of the array element type.
8596 We're not providing the address of an element here,
8597 and thus the actual object value cannot be inspected to do
8598 the conversion. This should not be a problem, since arrays of
8599 unconstrained objects are not allowed. In particular, all
8600 the elements of an array of a tagged type should all be of
8601 the same type specified in the debugging info. No need to
8602 consult the object tag. */
8603 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8605 /* Make sure we always create a new array type when dealing with
8606 packed array types, since we're going to fix-up the array
8607 type length and element bitsize a little further down. */
8608 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8611 result
= create_array_type (alloc_type_copy (type0
),
8612 elt_type
, type0
->index_type ());
8617 struct type
*elt_type0
;
8620 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8621 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8623 /* NOTE: result---the fixed version of elt_type0---should never
8624 depend on the contents of the array in properly constructed
8626 /* Create a fixed version of the array element type.
8627 We're not providing the address of an element here,
8628 and thus the actual object value cannot be inspected to do
8629 the conversion. This should not be a problem, since arrays of
8630 unconstrained objects are not allowed. In particular, all
8631 the elements of an array of a tagged type should all be of
8632 the same type specified in the debugging info. No need to
8633 consult the object tag. */
8635 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8638 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8640 struct type
*range_type
=
8641 to_fixed_range_type (index_type_desc
->field (i
).type (), dval
);
8643 result
= create_array_type (alloc_type_copy (elt_type0
),
8644 result
, range_type
);
8645 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8647 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8648 error (_("array type with dynamic size is larger than varsize-limit"));
8651 /* We want to preserve the type name. This can be useful when
8652 trying to get the type name of a value that has already been
8653 printed (for instance, if the user did "print VAR; whatis $". */
8654 result
->set_name (type0
->name ());
8656 if (constrained_packed_array_p
)
8658 /* So far, the resulting type has been created as if the original
8659 type was a regular (non-packed) array type. As a result, the
8660 bitsize of the array elements needs to be set again, and the array
8661 length needs to be recomputed based on that bitsize. */
8662 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8663 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8665 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8666 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8667 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8668 TYPE_LENGTH (result
)++;
8671 TYPE_FIXED_INSTANCE (result
) = 1;
8676 /* A standard type (containing no dynamically sized components)
8677 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8678 DVAL describes a record containing any discriminants used in TYPE0,
8679 and may be NULL if there are none, or if the object of type TYPE at
8680 ADDRESS or in VALADDR contains these discriminants.
8682 If CHECK_TAG is not null, in the case of tagged types, this function
8683 attempts to locate the object's tag and use it to compute the actual
8684 type. However, when ADDRESS is null, we cannot use it to determine the
8685 location of the tag, and therefore compute the tagged type's actual type.
8686 So we return the tagged type without consulting the tag. */
8688 static struct type
*
8689 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8690 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8692 type
= ada_check_typedef (type
);
8694 /* Only un-fixed types need to be handled here. */
8695 if (!HAVE_GNAT_AUX_INFO (type
))
8698 switch (type
->code ())
8702 case TYPE_CODE_STRUCT
:
8704 struct type
*static_type
= to_static_fixed_type (type
);
8705 struct type
*fixed_record_type
=
8706 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8708 /* If STATIC_TYPE is a tagged type and we know the object's address,
8709 then we can determine its tag, and compute the object's actual
8710 type from there. Note that we have to use the fixed record
8711 type (the parent part of the record may have dynamic fields
8712 and the way the location of _tag is expressed may depend on
8715 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8718 value_tag_from_contents_and_address
8722 struct type
*real_type
= type_from_tag (tag
);
8724 value_from_contents_and_address (fixed_record_type
,
8727 fixed_record_type
= value_type (obj
);
8728 if (real_type
!= NULL
)
8729 return to_fixed_record_type
8731 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8734 /* Check to see if there is a parallel ___XVZ variable.
8735 If there is, then it provides the actual size of our type. */
8736 else if (ada_type_name (fixed_record_type
) != NULL
)
8738 const char *name
= ada_type_name (fixed_record_type
);
8740 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8741 bool xvz_found
= false;
8744 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8747 xvz_found
= get_int_var_value (xvz_name
, size
);
8749 catch (const gdb_exception_error
&except
)
8751 /* We found the variable, but somehow failed to read
8752 its value. Rethrow the same error, but with a little
8753 bit more information, to help the user understand
8754 what went wrong (Eg: the variable might have been
8756 throw_error (except
.error
,
8757 _("unable to read value of %s (%s)"),
8758 xvz_name
, except
.what ());
8761 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8763 fixed_record_type
= copy_type (fixed_record_type
);
8764 TYPE_LENGTH (fixed_record_type
) = size
;
8766 /* The FIXED_RECORD_TYPE may have be a stub. We have
8767 observed this when the debugging info is STABS, and
8768 apparently it is something that is hard to fix.
8770 In practice, we don't need the actual type definition
8771 at all, because the presence of the XVZ variable allows us
8772 to assume that there must be a XVS type as well, which we
8773 should be able to use later, when we need the actual type
8776 In the meantime, pretend that the "fixed" type we are
8777 returning is NOT a stub, because this can cause trouble
8778 when using this type to create new types targeting it.
8779 Indeed, the associated creation routines often check
8780 whether the target type is a stub and will try to replace
8781 it, thus using a type with the wrong size. This, in turn,
8782 might cause the new type to have the wrong size too.
8783 Consider the case of an array, for instance, where the size
8784 of the array is computed from the number of elements in
8785 our array multiplied by the size of its element. */
8786 TYPE_STUB (fixed_record_type
) = 0;
8789 return fixed_record_type
;
8791 case TYPE_CODE_ARRAY
:
8792 return to_fixed_array_type (type
, dval
, 1);
8793 case TYPE_CODE_UNION
:
8797 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8801 /* The same as ada_to_fixed_type_1, except that it preserves the type
8802 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8804 The typedef layer needs be preserved in order to differentiate between
8805 arrays and array pointers when both types are implemented using the same
8806 fat pointer. In the array pointer case, the pointer is encoded as
8807 a typedef of the pointer type. For instance, considering:
8809 type String_Access is access String;
8810 S1 : String_Access := null;
8812 To the debugger, S1 is defined as a typedef of type String. But
8813 to the user, it is a pointer. So if the user tries to print S1,
8814 we should not dereference the array, but print the array address
8817 If we didn't preserve the typedef layer, we would lose the fact that
8818 the type is to be presented as a pointer (needs de-reference before
8819 being printed). And we would also use the source-level type name. */
8822 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8823 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8826 struct type
*fixed_type
=
8827 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8829 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8830 then preserve the typedef layer.
8832 Implementation note: We can only check the main-type portion of
8833 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8834 from TYPE now returns a type that has the same instance flags
8835 as TYPE. For instance, if TYPE is a "typedef const", and its
8836 target type is a "struct", then the typedef elimination will return
8837 a "const" version of the target type. See check_typedef for more
8838 details about how the typedef layer elimination is done.
8840 brobecker/2010-11-19: It seems to me that the only case where it is
8841 useful to preserve the typedef layer is when dealing with fat pointers.
8842 Perhaps, we could add a check for that and preserve the typedef layer
8843 only in that situation. But this seems unnecessary so far, probably
8844 because we call check_typedef/ada_check_typedef pretty much everywhere.
8846 if (type
->code () == TYPE_CODE_TYPEDEF
8847 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8848 == TYPE_MAIN_TYPE (fixed_type
)))
8854 /* A standard (static-sized) type corresponding as well as possible to
8855 TYPE0, but based on no runtime data. */
8857 static struct type
*
8858 to_static_fixed_type (struct type
*type0
)
8865 if (TYPE_FIXED_INSTANCE (type0
))
8868 type0
= ada_check_typedef (type0
);
8870 switch (type0
->code ())
8874 case TYPE_CODE_STRUCT
:
8875 type
= dynamic_template_type (type0
);
8877 return template_to_static_fixed_type (type
);
8879 return template_to_static_fixed_type (type0
);
8880 case TYPE_CODE_UNION
:
8881 type
= ada_find_parallel_type (type0
, "___XVU");
8883 return template_to_static_fixed_type (type
);
8885 return template_to_static_fixed_type (type0
);
8889 /* A static approximation of TYPE with all type wrappers removed. */
8891 static struct type
*
8892 static_unwrap_type (struct type
*type
)
8894 if (ada_is_aligner_type (type
))
8896 struct type
*type1
= ada_check_typedef (type
)->field (0).type ();
8897 if (ada_type_name (type1
) == NULL
)
8898 type1
->set_name (ada_type_name (type
));
8900 return static_unwrap_type (type1
);
8904 struct type
*raw_real_type
= ada_get_base_type (type
);
8906 if (raw_real_type
== type
)
8909 return to_static_fixed_type (raw_real_type
);
8913 /* In some cases, incomplete and private types require
8914 cross-references that are not resolved as records (for example,
8916 type FooP is access Foo;
8918 type Foo is array ...;
8919 ). In these cases, since there is no mechanism for producing
8920 cross-references to such types, we instead substitute for FooP a
8921 stub enumeration type that is nowhere resolved, and whose tag is
8922 the name of the actual type. Call these types "non-record stubs". */
8924 /* A type equivalent to TYPE that is not a non-record stub, if one
8925 exists, otherwise TYPE. */
8928 ada_check_typedef (struct type
*type
)
8933 /* If our type is an access to an unconstrained array, which is encoded
8934 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
8935 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8936 what allows us to distinguish between fat pointers that represent
8937 array types, and fat pointers that represent array access types
8938 (in both cases, the compiler implements them as fat pointers). */
8939 if (ada_is_access_to_unconstrained_array (type
))
8942 type
= check_typedef (type
);
8943 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
8944 || !TYPE_STUB (type
)
8945 || type
->name () == NULL
)
8949 const char *name
= type
->name ();
8950 struct type
*type1
= ada_find_any_type (name
);
8955 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8956 stubs pointing to arrays, as we don't create symbols for array
8957 types, only for the typedef-to-array types). If that's the case,
8958 strip the typedef layer. */
8959 if (type1
->code () == TYPE_CODE_TYPEDEF
)
8960 type1
= ada_check_typedef (type1
);
8966 /* A value representing the data at VALADDR/ADDRESS as described by
8967 type TYPE0, but with a standard (static-sized) type that correctly
8968 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8969 type, then return VAL0 [this feature is simply to avoid redundant
8970 creation of struct values]. */
8972 static struct value
*
8973 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8976 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8978 if (type
== type0
&& val0
!= NULL
)
8981 if (VALUE_LVAL (val0
) != lval_memory
)
8983 /* Our value does not live in memory; it could be a convenience
8984 variable, for instance. Create a not_lval value using val0's
8986 return value_from_contents (type
, value_contents (val0
));
8989 return value_from_contents_and_address (type
, 0, address
);
8992 /* A value representing VAL, but with a standard (static-sized) type
8993 that correctly describes it. Does not necessarily create a new
8997 ada_to_fixed_value (struct value
*val
)
8999 val
= unwrap_value (val
);
9000 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
9007 /* Table mapping attribute numbers to names.
9008 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9010 static const char *attribute_names
[] = {
9028 ada_attribute_name (enum exp_opcode n
)
9030 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9031 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9033 return attribute_names
[0];
9036 /* Evaluate the 'POS attribute applied to ARG. */
9039 pos_atr (struct value
*arg
)
9041 struct value
*val
= coerce_ref (arg
);
9042 struct type
*type
= value_type (val
);
9045 if (!discrete_type_p (type
))
9046 error (_("'POS only defined on discrete types"));
9048 if (!discrete_position (type
, value_as_long (val
), &result
))
9049 error (_("enumeration value is invalid: can't find 'POS"));
9054 static struct value
*
9055 value_pos_atr (struct type
*type
, struct value
*arg
)
9057 return value_from_longest (type
, pos_atr (arg
));
9060 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9062 static struct value
*
9063 val_atr (struct type
*type
, LONGEST val
)
9065 gdb_assert (discrete_type_p (type
));
9066 if (type
->code () == TYPE_CODE_RANGE
)
9067 type
= TYPE_TARGET_TYPE (type
);
9068 if (type
->code () == TYPE_CODE_ENUM
)
9070 if (val
< 0 || val
>= type
->num_fields ())
9071 error (_("argument to 'VAL out of range"));
9072 val
= TYPE_FIELD_ENUMVAL (type
, val
);
9074 return value_from_longest (type
, val
);
9077 static struct value
*
9078 value_val_atr (struct type
*type
, struct value
*arg
)
9080 if (!discrete_type_p (type
))
9081 error (_("'VAL only defined on discrete types"));
9082 if (!integer_type_p (value_type (arg
)))
9083 error (_("'VAL requires integral argument"));
9085 return val_atr (type
, value_as_long (arg
));
9091 /* True if TYPE appears to be an Ada character type.
9092 [At the moment, this is true only for Character and Wide_Character;
9093 It is a heuristic test that could stand improvement]. */
9096 ada_is_character_type (struct type
*type
)
9100 /* If the type code says it's a character, then assume it really is,
9101 and don't check any further. */
9102 if (type
->code () == TYPE_CODE_CHAR
)
9105 /* Otherwise, assume it's a character type iff it is a discrete type
9106 with a known character type name. */
9107 name
= ada_type_name (type
);
9108 return (name
!= NULL
9109 && (type
->code () == TYPE_CODE_INT
9110 || type
->code () == TYPE_CODE_RANGE
)
9111 && (strcmp (name
, "character") == 0
9112 || strcmp (name
, "wide_character") == 0
9113 || strcmp (name
, "wide_wide_character") == 0
9114 || strcmp (name
, "unsigned char") == 0));
9117 /* True if TYPE appears to be an Ada string type. */
9120 ada_is_string_type (struct type
*type
)
9122 type
= ada_check_typedef (type
);
9124 && type
->code () != TYPE_CODE_PTR
9125 && (ada_is_simple_array_type (type
)
9126 || ada_is_array_descriptor_type (type
))
9127 && ada_array_arity (type
) == 1)
9129 struct type
*elttype
= ada_array_element_type (type
, 1);
9131 return ada_is_character_type (elttype
);
9137 /* The compiler sometimes provides a parallel XVS type for a given
9138 PAD type. Normally, it is safe to follow the PAD type directly,
9139 but older versions of the compiler have a bug that causes the offset
9140 of its "F" field to be wrong. Following that field in that case
9141 would lead to incorrect results, but this can be worked around
9142 by ignoring the PAD type and using the associated XVS type instead.
9144 Set to True if the debugger should trust the contents of PAD types.
9145 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9146 static bool trust_pad_over_xvs
= true;
9148 /* True if TYPE is a struct type introduced by the compiler to force the
9149 alignment of a value. Such types have a single field with a
9150 distinctive name. */
9153 ada_is_aligner_type (struct type
*type
)
9155 type
= ada_check_typedef (type
);
9157 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9160 return (type
->code () == TYPE_CODE_STRUCT
9161 && type
->num_fields () == 1
9162 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9165 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9166 the parallel type. */
9169 ada_get_base_type (struct type
*raw_type
)
9171 struct type
*real_type_namer
;
9172 struct type
*raw_real_type
;
9174 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
9177 if (ada_is_aligner_type (raw_type
))
9178 /* The encoding specifies that we should always use the aligner type.
9179 So, even if this aligner type has an associated XVS type, we should
9182 According to the compiler gurus, an XVS type parallel to an aligner
9183 type may exist because of a stabs limitation. In stabs, aligner
9184 types are empty because the field has a variable-sized type, and
9185 thus cannot actually be used as an aligner type. As a result,
9186 we need the associated parallel XVS type to decode the type.
9187 Since the policy in the compiler is to not change the internal
9188 representation based on the debugging info format, we sometimes
9189 end up having a redundant XVS type parallel to the aligner type. */
9192 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9193 if (real_type_namer
== NULL
9194 || real_type_namer
->code () != TYPE_CODE_STRUCT
9195 || real_type_namer
->num_fields () != 1)
9198 if (real_type_namer
->field (0).type ()->code () != TYPE_CODE_REF
)
9200 /* This is an older encoding form where the base type needs to be
9201 looked up by name. We prefer the newer encoding because it is
9203 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9204 if (raw_real_type
== NULL
)
9207 return raw_real_type
;
9210 /* The field in our XVS type is a reference to the base type. */
9211 return TYPE_TARGET_TYPE (real_type_namer
->field (0).type ());
9214 /* The type of value designated by TYPE, with all aligners removed. */
9217 ada_aligned_type (struct type
*type
)
9219 if (ada_is_aligner_type (type
))
9220 return ada_aligned_type (type
->field (0).type ());
9222 return ada_get_base_type (type
);
9226 /* The address of the aligned value in an object at address VALADDR
9227 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9230 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9232 if (ada_is_aligner_type (type
))
9233 return ada_aligned_value_addr (type
->field (0).type (),
9235 TYPE_FIELD_BITPOS (type
,
9236 0) / TARGET_CHAR_BIT
);
9243 /* The printed representation of an enumeration literal with encoded
9244 name NAME. The value is good to the next call of ada_enum_name. */
9246 ada_enum_name (const char *name
)
9248 static char *result
;
9249 static size_t result_len
= 0;
9252 /* First, unqualify the enumeration name:
9253 1. Search for the last '.' character. If we find one, then skip
9254 all the preceding characters, the unqualified name starts
9255 right after that dot.
9256 2. Otherwise, we may be debugging on a target where the compiler
9257 translates dots into "__". Search forward for double underscores,
9258 but stop searching when we hit an overloading suffix, which is
9259 of the form "__" followed by digits. */
9261 tmp
= strrchr (name
, '.');
9266 while ((tmp
= strstr (name
, "__")) != NULL
)
9268 if (isdigit (tmp
[2]))
9279 if (name
[1] == 'U' || name
[1] == 'W')
9281 if (sscanf (name
+ 2, "%x", &v
) != 1)
9284 else if (((name
[1] >= '0' && name
[1] <= '9')
9285 || (name
[1] >= 'a' && name
[1] <= 'z'))
9288 GROW_VECT (result
, result_len
, 4);
9289 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9295 GROW_VECT (result
, result_len
, 16);
9296 if (isascii (v
) && isprint (v
))
9297 xsnprintf (result
, result_len
, "'%c'", v
);
9298 else if (name
[1] == 'U')
9299 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9301 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9307 tmp
= strstr (name
, "__");
9309 tmp
= strstr (name
, "$");
9312 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9313 strncpy (result
, name
, tmp
- name
);
9314 result
[tmp
- name
] = '\0';
9322 /* Evaluate the subexpression of EXP starting at *POS as for
9323 evaluate_type, updating *POS to point just past the evaluated
9326 static struct value
*
9327 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9329 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9332 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9335 static struct value
*
9336 unwrap_value (struct value
*val
)
9338 struct type
*type
= ada_check_typedef (value_type (val
));
9340 if (ada_is_aligner_type (type
))
9342 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9343 struct type
*val_type
= ada_check_typedef (value_type (v
));
9345 if (ada_type_name (val_type
) == NULL
)
9346 val_type
->set_name (ada_type_name (type
));
9348 return unwrap_value (v
);
9352 struct type
*raw_real_type
=
9353 ada_check_typedef (ada_get_base_type (type
));
9355 /* If there is no parallel XVS or XVE type, then the value is
9356 already unwrapped. Return it without further modification. */
9357 if ((type
== raw_real_type
)
9358 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9362 coerce_unspec_val_to_type
9363 (val
, ada_to_fixed_type (raw_real_type
, 0,
9364 value_address (val
),
9369 static struct value
*
9370 cast_from_fixed (struct type
*type
, struct value
*arg
)
9372 struct value
*scale
= ada_scaling_factor (value_type (arg
));
9373 arg
= value_cast (value_type (scale
), arg
);
9375 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9376 return value_cast (type
, arg
);
9379 static struct value
*
9380 cast_to_fixed (struct type
*type
, struct value
*arg
)
9382 if (type
== value_type (arg
))
9385 struct value
*scale
= ada_scaling_factor (type
);
9386 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg
)))
9387 arg
= cast_from_fixed (value_type (scale
), arg
);
9389 arg
= value_cast (value_type (scale
), arg
);
9391 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9392 return value_cast (type
, arg
);
9395 /* Given two array types T1 and T2, return nonzero iff both arrays
9396 contain the same number of elements. */
9399 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9401 LONGEST lo1
, hi1
, lo2
, hi2
;
9403 /* Get the array bounds in order to verify that the size of
9404 the two arrays match. */
9405 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9406 || !get_array_bounds (t2
, &lo2
, &hi2
))
9407 error (_("unable to determine array bounds"));
9409 /* To make things easier for size comparison, normalize a bit
9410 the case of empty arrays by making sure that the difference
9411 between upper bound and lower bound is always -1. */
9417 return (hi1
- lo1
== hi2
- lo2
);
9420 /* Assuming that VAL is an array of integrals, and TYPE represents
9421 an array with the same number of elements, but with wider integral
9422 elements, return an array "casted" to TYPE. In practice, this
9423 means that the returned array is built by casting each element
9424 of the original array into TYPE's (wider) element type. */
9426 static struct value
*
9427 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9429 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9434 /* Verify that both val and type are arrays of scalars, and
9435 that the size of val's elements is smaller than the size
9436 of type's element. */
9437 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9438 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9439 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9440 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9441 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9442 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9444 if (!get_array_bounds (type
, &lo
, &hi
))
9445 error (_("unable to determine array bounds"));
9447 res
= allocate_value (type
);
9449 /* Promote each array element. */
9450 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9452 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9454 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9455 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9461 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9462 return the converted value. */
9464 static struct value
*
9465 coerce_for_assign (struct type
*type
, struct value
*val
)
9467 struct type
*type2
= value_type (val
);
9472 type2
= ada_check_typedef (type2
);
9473 type
= ada_check_typedef (type
);
9475 if (type2
->code () == TYPE_CODE_PTR
9476 && type
->code () == TYPE_CODE_ARRAY
)
9478 val
= ada_value_ind (val
);
9479 type2
= value_type (val
);
9482 if (type2
->code () == TYPE_CODE_ARRAY
9483 && type
->code () == TYPE_CODE_ARRAY
)
9485 if (!ada_same_array_size_p (type
, type2
))
9486 error (_("cannot assign arrays of different length"));
9488 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9489 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9490 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9491 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9493 /* Allow implicit promotion of the array elements to
9495 return ada_promote_array_of_integrals (type
, val
);
9498 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9499 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9500 error (_("Incompatible types in assignment"));
9501 deprecated_set_value_type (val
, type
);
9506 static struct value
*
9507 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9510 struct type
*type1
, *type2
;
9513 arg1
= coerce_ref (arg1
);
9514 arg2
= coerce_ref (arg2
);
9515 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9516 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9518 if (type1
->code () != TYPE_CODE_INT
9519 || type2
->code () != TYPE_CODE_INT
)
9520 return value_binop (arg1
, arg2
, op
);
9529 return value_binop (arg1
, arg2
, op
);
9532 v2
= value_as_long (arg2
);
9534 error (_("second operand of %s must not be zero."), op_string (op
));
9536 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9537 return value_binop (arg1
, arg2
, op
);
9539 v1
= value_as_long (arg1
);
9544 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9545 v
+= v
> 0 ? -1 : 1;
9553 /* Should not reach this point. */
9557 val
= allocate_value (type1
);
9558 store_unsigned_integer (value_contents_raw (val
),
9559 TYPE_LENGTH (value_type (val
)),
9560 type_byte_order (type1
), v
);
9565 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9567 if (ada_is_direct_array_type (value_type (arg1
))
9568 || ada_is_direct_array_type (value_type (arg2
)))
9570 struct type
*arg1_type
, *arg2_type
;
9572 /* Automatically dereference any array reference before
9573 we attempt to perform the comparison. */
9574 arg1
= ada_coerce_ref (arg1
);
9575 arg2
= ada_coerce_ref (arg2
);
9577 arg1
= ada_coerce_to_simple_array (arg1
);
9578 arg2
= ada_coerce_to_simple_array (arg2
);
9580 arg1_type
= ada_check_typedef (value_type (arg1
));
9581 arg2_type
= ada_check_typedef (value_type (arg2
));
9583 if (arg1_type
->code () != TYPE_CODE_ARRAY
9584 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9585 error (_("Attempt to compare array with non-array"));
9586 /* FIXME: The following works only for types whose
9587 representations use all bits (no padding or undefined bits)
9588 and do not have user-defined equality. */
9589 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9590 && memcmp (value_contents (arg1
), value_contents (arg2
),
9591 TYPE_LENGTH (arg1_type
)) == 0);
9593 return value_equal (arg1
, arg2
);
9596 /* Total number of component associations in the aggregate starting at
9597 index PC in EXP. Assumes that index PC is the start of an
9601 num_component_specs (struct expression
*exp
, int pc
)
9605 m
= exp
->elts
[pc
+ 1].longconst
;
9608 for (i
= 0; i
< m
; i
+= 1)
9610 switch (exp
->elts
[pc
].opcode
)
9616 n
+= exp
->elts
[pc
+ 1].longconst
;
9619 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9624 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9625 component of LHS (a simple array or a record), updating *POS past
9626 the expression, assuming that LHS is contained in CONTAINER. Does
9627 not modify the inferior's memory, nor does it modify LHS (unless
9628 LHS == CONTAINER). */
9631 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9632 struct expression
*exp
, int *pos
)
9634 struct value
*mark
= value_mark ();
9636 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9638 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9640 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9641 struct value
*index_val
= value_from_longest (index_type
, index
);
9643 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9647 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9648 elt
= ada_to_fixed_value (elt
);
9651 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9652 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9654 value_assign_to_component (container
, elt
,
9655 ada_evaluate_subexp (NULL
, exp
, pos
,
9658 value_free_to_mark (mark
);
9661 /* Assuming that LHS represents an lvalue having a record or array
9662 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9663 of that aggregate's value to LHS, advancing *POS past the
9664 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9665 lvalue containing LHS (possibly LHS itself). Does not modify
9666 the inferior's memory, nor does it modify the contents of
9667 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9669 static struct value
*
9670 assign_aggregate (struct value
*container
,
9671 struct value
*lhs
, struct expression
*exp
,
9672 int *pos
, enum noside noside
)
9674 struct type
*lhs_type
;
9675 int n
= exp
->elts
[*pos
+1].longconst
;
9676 LONGEST low_index
, high_index
;
9679 int max_indices
, num_indices
;
9683 if (noside
!= EVAL_NORMAL
)
9685 for (i
= 0; i
< n
; i
+= 1)
9686 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9690 container
= ada_coerce_ref (container
);
9691 if (ada_is_direct_array_type (value_type (container
)))
9692 container
= ada_coerce_to_simple_array (container
);
9693 lhs
= ada_coerce_ref (lhs
);
9694 if (!deprecated_value_modifiable (lhs
))
9695 error (_("Left operand of assignment is not a modifiable lvalue."));
9697 lhs_type
= check_typedef (value_type (lhs
));
9698 if (ada_is_direct_array_type (lhs_type
))
9700 lhs
= ada_coerce_to_simple_array (lhs
);
9701 lhs_type
= check_typedef (value_type (lhs
));
9702 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9703 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9705 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9708 high_index
= num_visible_fields (lhs_type
) - 1;
9711 error (_("Left-hand side must be array or record."));
9713 num_specs
= num_component_specs (exp
, *pos
- 3);
9714 max_indices
= 4 * num_specs
+ 4;
9715 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9716 indices
[0] = indices
[1] = low_index
- 1;
9717 indices
[2] = indices
[3] = high_index
+ 1;
9720 for (i
= 0; i
< n
; i
+= 1)
9722 switch (exp
->elts
[*pos
].opcode
)
9725 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9726 &num_indices
, max_indices
,
9727 low_index
, high_index
);
9730 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9731 &num_indices
, max_indices
,
9732 low_index
, high_index
);
9736 error (_("Misplaced 'others' clause"));
9737 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9738 num_indices
, low_index
, high_index
);
9741 error (_("Internal error: bad aggregate clause"));
9748 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9749 construct at *POS, updating *POS past the construct, given that
9750 the positions are relative to lower bound LOW, where HIGH is the
9751 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9752 updating *NUM_INDICES as needed. CONTAINER is as for
9753 assign_aggregate. */
9755 aggregate_assign_positional (struct value
*container
,
9756 struct value
*lhs
, struct expression
*exp
,
9757 int *pos
, LONGEST
*indices
, int *num_indices
,
9758 int max_indices
, LONGEST low
, LONGEST high
)
9760 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9762 if (ind
- 1 == high
)
9763 warning (_("Extra components in aggregate ignored."));
9766 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9768 assign_component (container
, lhs
, ind
, exp
, pos
);
9771 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9774 /* Assign into the components of LHS indexed by the OP_CHOICES
9775 construct at *POS, updating *POS past the construct, given that
9776 the allowable indices are LOW..HIGH. Record the indices assigned
9777 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9778 needed. CONTAINER is as for assign_aggregate. */
9780 aggregate_assign_from_choices (struct value
*container
,
9781 struct value
*lhs
, struct expression
*exp
,
9782 int *pos
, LONGEST
*indices
, int *num_indices
,
9783 int max_indices
, LONGEST low
, LONGEST high
)
9786 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9787 int choice_pos
, expr_pc
;
9788 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9790 choice_pos
= *pos
+= 3;
9792 for (j
= 0; j
< n_choices
; j
+= 1)
9793 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9795 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9797 for (j
= 0; j
< n_choices
; j
+= 1)
9799 LONGEST lower
, upper
;
9800 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9802 if (op
== OP_DISCRETE_RANGE
)
9805 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9807 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9812 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9824 name
= &exp
->elts
[choice_pos
+ 2].string
;
9827 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9830 error (_("Invalid record component association."));
9832 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9834 if (! find_struct_field (name
, value_type (lhs
), 0,
9835 NULL
, NULL
, NULL
, NULL
, &ind
))
9836 error (_("Unknown component name: %s."), name
);
9837 lower
= upper
= ind
;
9840 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9841 error (_("Index in component association out of bounds."));
9843 add_component_interval (lower
, upper
, indices
, num_indices
,
9845 while (lower
<= upper
)
9850 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9856 /* Assign the value of the expression in the OP_OTHERS construct in
9857 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9858 have not been previously assigned. The index intervals already assigned
9859 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9860 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9862 aggregate_assign_others (struct value
*container
,
9863 struct value
*lhs
, struct expression
*exp
,
9864 int *pos
, LONGEST
*indices
, int num_indices
,
9865 LONGEST low
, LONGEST high
)
9868 int expr_pc
= *pos
+ 1;
9870 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9874 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9879 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9882 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9885 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9886 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9887 modifying *SIZE as needed. It is an error if *SIZE exceeds
9888 MAX_SIZE. The resulting intervals do not overlap. */
9890 add_component_interval (LONGEST low
, LONGEST high
,
9891 LONGEST
* indices
, int *size
, int max_size
)
9895 for (i
= 0; i
< *size
; i
+= 2) {
9896 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9900 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9901 if (high
< indices
[kh
])
9903 if (low
< indices
[i
])
9905 indices
[i
+ 1] = indices
[kh
- 1];
9906 if (high
> indices
[i
+ 1])
9907 indices
[i
+ 1] = high
;
9908 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9909 *size
-= kh
- i
- 2;
9912 else if (high
< indices
[i
])
9916 if (*size
== max_size
)
9917 error (_("Internal error: miscounted aggregate components."));
9919 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9920 indices
[j
] = indices
[j
- 2];
9922 indices
[i
+ 1] = high
;
9925 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9928 static struct value
*
9929 ada_value_cast (struct type
*type
, struct value
*arg2
)
9931 if (type
== ada_check_typedef (value_type (arg2
)))
9934 if (ada_is_gnat_encoded_fixed_point_type (type
))
9935 return cast_to_fixed (type
, arg2
);
9937 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
9938 return cast_from_fixed (type
, arg2
);
9940 return value_cast (type
, arg2
);
9943 /* Evaluating Ada expressions, and printing their result.
9944 ------------------------------------------------------
9949 We usually evaluate an Ada expression in order to print its value.
9950 We also evaluate an expression in order to print its type, which
9951 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9952 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9953 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9954 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9957 Evaluating expressions is a little more complicated for Ada entities
9958 than it is for entities in languages such as C. The main reason for
9959 this is that Ada provides types whose definition might be dynamic.
9960 One example of such types is variant records. Or another example
9961 would be an array whose bounds can only be known at run time.
9963 The following description is a general guide as to what should be
9964 done (and what should NOT be done) in order to evaluate an expression
9965 involving such types, and when. This does not cover how the semantic
9966 information is encoded by GNAT as this is covered separatly. For the
9967 document used as the reference for the GNAT encoding, see exp_dbug.ads
9968 in the GNAT sources.
9970 Ideally, we should embed each part of this description next to its
9971 associated code. Unfortunately, the amount of code is so vast right
9972 now that it's hard to see whether the code handling a particular
9973 situation might be duplicated or not. One day, when the code is
9974 cleaned up, this guide might become redundant with the comments
9975 inserted in the code, and we might want to remove it.
9977 2. ``Fixing'' an Entity, the Simple Case:
9978 -----------------------------------------
9980 When evaluating Ada expressions, the tricky issue is that they may
9981 reference entities whose type contents and size are not statically
9982 known. Consider for instance a variant record:
9984 type Rec (Empty : Boolean := True) is record
9987 when False => Value : Integer;
9990 Yes : Rec := (Empty => False, Value => 1);
9991 No : Rec := (empty => True);
9993 The size and contents of that record depends on the value of the
9994 descriminant (Rec.Empty). At this point, neither the debugging
9995 information nor the associated type structure in GDB are able to
9996 express such dynamic types. So what the debugger does is to create
9997 "fixed" versions of the type that applies to the specific object.
9998 We also informally refer to this operation as "fixing" an object,
9999 which means creating its associated fixed type.
10001 Example: when printing the value of variable "Yes" above, its fixed
10002 type would look like this:
10009 On the other hand, if we printed the value of "No", its fixed type
10016 Things become a little more complicated when trying to fix an entity
10017 with a dynamic type that directly contains another dynamic type,
10018 such as an array of variant records, for instance. There are
10019 two possible cases: Arrays, and records.
10021 3. ``Fixing'' Arrays:
10022 ---------------------
10024 The type structure in GDB describes an array in terms of its bounds,
10025 and the type of its elements. By design, all elements in the array
10026 have the same type and we cannot represent an array of variant elements
10027 using the current type structure in GDB. When fixing an array,
10028 we cannot fix the array element, as we would potentially need one
10029 fixed type per element of the array. As a result, the best we can do
10030 when fixing an array is to produce an array whose bounds and size
10031 are correct (allowing us to read it from memory), but without having
10032 touched its element type. Fixing each element will be done later,
10033 when (if) necessary.
10035 Arrays are a little simpler to handle than records, because the same
10036 amount of memory is allocated for each element of the array, even if
10037 the amount of space actually used by each element differs from element
10038 to element. Consider for instance the following array of type Rec:
10040 type Rec_Array is array (1 .. 2) of Rec;
10042 The actual amount of memory occupied by each element might be different
10043 from element to element, depending on the value of their discriminant.
10044 But the amount of space reserved for each element in the array remains
10045 fixed regardless. So we simply need to compute that size using
10046 the debugging information available, from which we can then determine
10047 the array size (we multiply the number of elements of the array by
10048 the size of each element).
10050 The simplest case is when we have an array of a constrained element
10051 type. For instance, consider the following type declarations:
10053 type Bounded_String (Max_Size : Integer) is
10055 Buffer : String (1 .. Max_Size);
10057 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10059 In this case, the compiler describes the array as an array of
10060 variable-size elements (identified by its XVS suffix) for which
10061 the size can be read in the parallel XVZ variable.
10063 In the case of an array of an unconstrained element type, the compiler
10064 wraps the array element inside a private PAD type. This type should not
10065 be shown to the user, and must be "unwrap"'ed before printing. Note
10066 that we also use the adjective "aligner" in our code to designate
10067 these wrapper types.
10069 In some cases, the size allocated for each element is statically
10070 known. In that case, the PAD type already has the correct size,
10071 and the array element should remain unfixed.
10073 But there are cases when this size is not statically known.
10074 For instance, assuming that "Five" is an integer variable:
10076 type Dynamic is array (1 .. Five) of Integer;
10077 type Wrapper (Has_Length : Boolean := False) is record
10080 when True => Length : Integer;
10081 when False => null;
10084 type Wrapper_Array is array (1 .. 2) of Wrapper;
10086 Hello : Wrapper_Array := (others => (Has_Length => True,
10087 Data => (others => 17),
10091 The debugging info would describe variable Hello as being an
10092 array of a PAD type. The size of that PAD type is not statically
10093 known, but can be determined using a parallel XVZ variable.
10094 In that case, a copy of the PAD type with the correct size should
10095 be used for the fixed array.
10097 3. ``Fixing'' record type objects:
10098 ----------------------------------
10100 Things are slightly different from arrays in the case of dynamic
10101 record types. In this case, in order to compute the associated
10102 fixed type, we need to determine the size and offset of each of
10103 its components. This, in turn, requires us to compute the fixed
10104 type of each of these components.
10106 Consider for instance the example:
10108 type Bounded_String (Max_Size : Natural) is record
10109 Str : String (1 .. Max_Size);
10112 My_String : Bounded_String (Max_Size => 10);
10114 In that case, the position of field "Length" depends on the size
10115 of field Str, which itself depends on the value of the Max_Size
10116 discriminant. In order to fix the type of variable My_String,
10117 we need to fix the type of field Str. Therefore, fixing a variant
10118 record requires us to fix each of its components.
10120 However, if a component does not have a dynamic size, the component
10121 should not be fixed. In particular, fields that use a PAD type
10122 should not fixed. Here is an example where this might happen
10123 (assuming type Rec above):
10125 type Container (Big : Boolean) is record
10129 when True => Another : Integer;
10130 when False => null;
10133 My_Container : Container := (Big => False,
10134 First => (Empty => True),
10137 In that example, the compiler creates a PAD type for component First,
10138 whose size is constant, and then positions the component After just
10139 right after it. The offset of component After is therefore constant
10142 The debugger computes the position of each field based on an algorithm
10143 that uses, among other things, the actual position and size of the field
10144 preceding it. Let's now imagine that the user is trying to print
10145 the value of My_Container. If the type fixing was recursive, we would
10146 end up computing the offset of field After based on the size of the
10147 fixed version of field First. And since in our example First has
10148 only one actual field, the size of the fixed type is actually smaller
10149 than the amount of space allocated to that field, and thus we would
10150 compute the wrong offset of field After.
10152 To make things more complicated, we need to watch out for dynamic
10153 components of variant records (identified by the ___XVL suffix in
10154 the component name). Even if the target type is a PAD type, the size
10155 of that type might not be statically known. So the PAD type needs
10156 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10157 we might end up with the wrong size for our component. This can be
10158 observed with the following type declarations:
10160 type Octal is new Integer range 0 .. 7;
10161 type Octal_Array is array (Positive range <>) of Octal;
10162 pragma Pack (Octal_Array);
10164 type Octal_Buffer (Size : Positive) is record
10165 Buffer : Octal_Array (1 .. Size);
10169 In that case, Buffer is a PAD type whose size is unset and needs
10170 to be computed by fixing the unwrapped type.
10172 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10173 ----------------------------------------------------------
10175 Lastly, when should the sub-elements of an entity that remained unfixed
10176 thus far, be actually fixed?
10178 The answer is: Only when referencing that element. For instance
10179 when selecting one component of a record, this specific component
10180 should be fixed at that point in time. Or when printing the value
10181 of a record, each component should be fixed before its value gets
10182 printed. Similarly for arrays, the element of the array should be
10183 fixed when printing each element of the array, or when extracting
10184 one element out of that array. On the other hand, fixing should
10185 not be performed on the elements when taking a slice of an array!
10187 Note that one of the side effects of miscomputing the offset and
10188 size of each field is that we end up also miscomputing the size
10189 of the containing type. This can have adverse results when computing
10190 the value of an entity. GDB fetches the value of an entity based
10191 on the size of its type, and thus a wrong size causes GDB to fetch
10192 the wrong amount of memory. In the case where the computed size is
10193 too small, GDB fetches too little data to print the value of our
10194 entity. Results in this case are unpredictable, as we usually read
10195 past the buffer containing the data =:-o. */
10197 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10198 for that subexpression cast to TO_TYPE. Advance *POS over the
10202 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10203 enum noside noside
, struct type
*to_type
)
10207 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10208 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10213 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10215 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10216 return value_zero (to_type
, not_lval
);
10218 val
= evaluate_var_msym_value (noside
,
10219 exp
->elts
[pc
+ 1].objfile
,
10220 exp
->elts
[pc
+ 2].msymbol
);
10223 val
= evaluate_var_value (noside
,
10224 exp
->elts
[pc
+ 1].block
,
10225 exp
->elts
[pc
+ 2].symbol
);
10227 if (noside
== EVAL_SKIP
)
10228 return eval_skip_value (exp
);
10230 val
= ada_value_cast (to_type
, val
);
10232 /* Follow the Ada language semantics that do not allow taking
10233 an address of the result of a cast (view conversion in Ada). */
10234 if (VALUE_LVAL (val
) == lval_memory
)
10236 if (value_lazy (val
))
10237 value_fetch_lazy (val
);
10238 VALUE_LVAL (val
) = not_lval
;
10243 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10244 if (noside
== EVAL_SKIP
)
10245 return eval_skip_value (exp
);
10246 return ada_value_cast (to_type
, val
);
10249 /* Implement the evaluate_exp routine in the exp_descriptor structure
10250 for the Ada language. */
10252 static struct value
*
10253 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10254 int *pos
, enum noside noside
)
10256 enum exp_opcode op
;
10260 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10263 struct value
**argvec
;
10267 op
= exp
->elts
[pc
].opcode
;
10273 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10275 if (noside
== EVAL_NORMAL
)
10276 arg1
= unwrap_value (arg1
);
10278 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10279 then we need to perform the conversion manually, because
10280 evaluate_subexp_standard doesn't do it. This conversion is
10281 necessary in Ada because the different kinds of float/fixed
10282 types in Ada have different representations.
10284 Similarly, we need to perform the conversion from OP_LONG
10286 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10287 arg1
= ada_value_cast (expect_type
, arg1
);
10293 struct value
*result
;
10296 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10297 /* The result type will have code OP_STRING, bashed there from
10298 OP_ARRAY. Bash it back. */
10299 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10300 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10306 type
= exp
->elts
[pc
+ 1].type
;
10307 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10311 type
= exp
->elts
[pc
+ 1].type
;
10312 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10315 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10316 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10318 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10319 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10321 return ada_value_assign (arg1
, arg1
);
10323 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10324 except if the lhs of our assignment is a convenience variable.
10325 In the case of assigning to a convenience variable, the lhs
10326 should be exactly the result of the evaluation of the rhs. */
10327 type
= value_type (arg1
);
10328 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10330 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10331 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10333 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10337 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10338 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10339 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10341 (_("Fixed-point values must be assigned to fixed-point variables"));
10343 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10344 return ada_value_assign (arg1
, arg2
);
10347 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10348 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10349 if (noside
== EVAL_SKIP
)
10351 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10352 return (value_from_longest
10353 (value_type (arg1
),
10354 value_as_long (arg1
) + value_as_long (arg2
)));
10355 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10356 return (value_from_longest
10357 (value_type (arg2
),
10358 value_as_long (arg1
) + value_as_long (arg2
)));
10359 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10360 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10361 && value_type (arg1
) != value_type (arg2
))
10362 error (_("Operands of fixed-point addition must have the same type"));
10363 /* Do the addition, and cast the result to the type of the first
10364 argument. We cannot cast the result to a reference type, so if
10365 ARG1 is a reference type, find its underlying type. */
10366 type
= value_type (arg1
);
10367 while (type
->code () == TYPE_CODE_REF
)
10368 type
= TYPE_TARGET_TYPE (type
);
10369 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10370 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10373 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10374 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10375 if (noside
== EVAL_SKIP
)
10377 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10378 return (value_from_longest
10379 (value_type (arg1
),
10380 value_as_long (arg1
) - value_as_long (arg2
)));
10381 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10382 return (value_from_longest
10383 (value_type (arg2
),
10384 value_as_long (arg1
) - value_as_long (arg2
)));
10385 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10386 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10387 && value_type (arg1
) != value_type (arg2
))
10388 error (_("Operands of fixed-point subtraction "
10389 "must have the same type"));
10390 /* Do the substraction, and cast the result to the type of the first
10391 argument. We cannot cast the result to a reference type, so if
10392 ARG1 is a reference type, find its underlying type. */
10393 type
= value_type (arg1
);
10394 while (type
->code () == TYPE_CODE_REF
)
10395 type
= TYPE_TARGET_TYPE (type
);
10396 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10397 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10403 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10404 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10405 if (noside
== EVAL_SKIP
)
10407 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10409 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10410 return value_zero (value_type (arg1
), not_lval
);
10414 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10415 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10416 arg1
= cast_from_fixed (type
, arg1
);
10417 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10418 arg2
= cast_from_fixed (type
, arg2
);
10419 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10420 return ada_value_binop (arg1
, arg2
, op
);
10424 case BINOP_NOTEQUAL
:
10425 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10426 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10427 if (noside
== EVAL_SKIP
)
10429 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10433 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10434 tem
= ada_value_equal (arg1
, arg2
);
10436 if (op
== BINOP_NOTEQUAL
)
10438 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10439 return value_from_longest (type
, (LONGEST
) tem
);
10442 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10443 if (noside
== EVAL_SKIP
)
10445 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10446 return value_cast (value_type (arg1
), value_neg (arg1
));
10449 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10450 return value_neg (arg1
);
10453 case BINOP_LOGICAL_AND
:
10454 case BINOP_LOGICAL_OR
:
10455 case UNOP_LOGICAL_NOT
:
10460 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10461 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10462 return value_cast (type
, val
);
10465 case BINOP_BITWISE_AND
:
10466 case BINOP_BITWISE_IOR
:
10467 case BINOP_BITWISE_XOR
:
10471 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10473 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10475 return value_cast (value_type (arg1
), val
);
10481 if (noside
== EVAL_SKIP
)
10487 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10488 /* Only encountered when an unresolved symbol occurs in a
10489 context other than a function call, in which case, it is
10491 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10492 exp
->elts
[pc
+ 2].symbol
->print_name ());
10494 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10496 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10497 /* Check to see if this is a tagged type. We also need to handle
10498 the case where the type is a reference to a tagged type, but
10499 we have to be careful to exclude pointers to tagged types.
10500 The latter should be shown as usual (as a pointer), whereas
10501 a reference should mostly be transparent to the user. */
10502 if (ada_is_tagged_type (type
, 0)
10503 || (type
->code () == TYPE_CODE_REF
10504 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10506 /* Tagged types are a little special in the fact that the real
10507 type is dynamic and can only be determined by inspecting the
10508 object's tag. This means that we need to get the object's
10509 value first (EVAL_NORMAL) and then extract the actual object
10512 Note that we cannot skip the final step where we extract
10513 the object type from its tag, because the EVAL_NORMAL phase
10514 results in dynamic components being resolved into fixed ones.
10515 This can cause problems when trying to print the type
10516 description of tagged types whose parent has a dynamic size:
10517 We use the type name of the "_parent" component in order
10518 to print the name of the ancestor type in the type description.
10519 If that component had a dynamic size, the resolution into
10520 a fixed type would result in the loss of that type name,
10521 thus preventing us from printing the name of the ancestor
10522 type in the type description. */
10523 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10525 if (type
->code () != TYPE_CODE_REF
)
10527 struct type
*actual_type
;
10529 actual_type
= type_from_tag (ada_value_tag (arg1
));
10530 if (actual_type
== NULL
)
10531 /* If, for some reason, we were unable to determine
10532 the actual type from the tag, then use the static
10533 approximation that we just computed as a fallback.
10534 This can happen if the debugging information is
10535 incomplete, for instance. */
10536 actual_type
= type
;
10537 return value_zero (actual_type
, not_lval
);
10541 /* In the case of a ref, ada_coerce_ref takes care
10542 of determining the actual type. But the evaluation
10543 should return a ref as it should be valid to ask
10544 for its address; so rebuild a ref after coerce. */
10545 arg1
= ada_coerce_ref (arg1
);
10546 return value_ref (arg1
, TYPE_CODE_REF
);
10550 /* Records and unions for which GNAT encodings have been
10551 generated need to be statically fixed as well.
10552 Otherwise, non-static fixing produces a type where
10553 all dynamic properties are removed, which prevents "ptype"
10554 from being able to completely describe the type.
10555 For instance, a case statement in a variant record would be
10556 replaced by the relevant components based on the actual
10557 value of the discriminants. */
10558 if ((type
->code () == TYPE_CODE_STRUCT
10559 && dynamic_template_type (type
) != NULL
)
10560 || (type
->code () == TYPE_CODE_UNION
10561 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10564 return value_zero (to_static_fixed_type (type
), not_lval
);
10568 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10569 return ada_to_fixed_value (arg1
);
10574 /* Allocate arg vector, including space for the function to be
10575 called in argvec[0] and a terminating NULL. */
10576 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10577 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10579 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10580 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10581 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10582 exp
->elts
[pc
+ 5].symbol
->print_name ());
10585 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10586 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10589 if (noside
== EVAL_SKIP
)
10593 if (ada_is_constrained_packed_array_type
10594 (desc_base_type (value_type (argvec
[0]))))
10595 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10596 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10597 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10598 /* This is a packed array that has already been fixed, and
10599 therefore already coerced to a simple array. Nothing further
10602 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10604 /* Make sure we dereference references so that all the code below
10605 feels like it's really handling the referenced value. Wrapping
10606 types (for alignment) may be there, so make sure we strip them as
10608 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10610 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10611 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10612 argvec
[0] = value_addr (argvec
[0]);
10614 type
= ada_check_typedef (value_type (argvec
[0]));
10616 /* Ada allows us to implicitly dereference arrays when subscripting
10617 them. So, if this is an array typedef (encoding use for array
10618 access types encoded as fat pointers), strip it now. */
10619 if (type
->code () == TYPE_CODE_TYPEDEF
)
10620 type
= ada_typedef_target_type (type
);
10622 if (type
->code () == TYPE_CODE_PTR
)
10624 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10626 case TYPE_CODE_FUNC
:
10627 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10629 case TYPE_CODE_ARRAY
:
10631 case TYPE_CODE_STRUCT
:
10632 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10633 argvec
[0] = ada_value_ind (argvec
[0]);
10634 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10637 error (_("cannot subscript or call something of type `%s'"),
10638 ada_type_name (value_type (argvec
[0])));
10643 switch (type
->code ())
10645 case TYPE_CODE_FUNC
:
10646 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10648 if (TYPE_TARGET_TYPE (type
) == NULL
)
10649 error_call_unknown_return_type (NULL
);
10650 return allocate_value (TYPE_TARGET_TYPE (type
));
10652 return call_function_by_hand (argvec
[0], NULL
,
10653 gdb::make_array_view (argvec
+ 1,
10655 case TYPE_CODE_INTERNAL_FUNCTION
:
10656 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10657 /* We don't know anything about what the internal
10658 function might return, but we have to return
10660 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10663 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10664 argvec
[0], nargs
, argvec
+ 1);
10666 case TYPE_CODE_STRUCT
:
10670 arity
= ada_array_arity (type
);
10671 type
= ada_array_element_type (type
, nargs
);
10673 error (_("cannot subscript or call a record"));
10674 if (arity
!= nargs
)
10675 error (_("wrong number of subscripts; expecting %d"), arity
);
10676 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10677 return value_zero (ada_aligned_type (type
), lval_memory
);
10679 unwrap_value (ada_value_subscript
10680 (argvec
[0], nargs
, argvec
+ 1));
10682 case TYPE_CODE_ARRAY
:
10683 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10685 type
= ada_array_element_type (type
, nargs
);
10687 error (_("element type of array unknown"));
10689 return value_zero (ada_aligned_type (type
), lval_memory
);
10692 unwrap_value (ada_value_subscript
10693 (ada_coerce_to_simple_array (argvec
[0]),
10694 nargs
, argvec
+ 1));
10695 case TYPE_CODE_PTR
: /* Pointer to array */
10696 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10698 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10699 type
= ada_array_element_type (type
, nargs
);
10701 error (_("element type of array unknown"));
10703 return value_zero (ada_aligned_type (type
), lval_memory
);
10706 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10707 nargs
, argvec
+ 1));
10710 error (_("Attempt to index or call something other than an "
10711 "array or function"));
10716 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10717 struct value
*low_bound_val
=
10718 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10719 struct value
*high_bound_val
=
10720 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10722 LONGEST high_bound
;
10724 low_bound_val
= coerce_ref (low_bound_val
);
10725 high_bound_val
= coerce_ref (high_bound_val
);
10726 low_bound
= value_as_long (low_bound_val
);
10727 high_bound
= value_as_long (high_bound_val
);
10729 if (noside
== EVAL_SKIP
)
10732 /* If this is a reference to an aligner type, then remove all
10734 if (value_type (array
)->code () == TYPE_CODE_REF
10735 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10736 TYPE_TARGET_TYPE (value_type (array
)) =
10737 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10739 if (ada_is_constrained_packed_array_type (value_type (array
)))
10740 error (_("cannot slice a packed array"));
10742 /* If this is a reference to an array or an array lvalue,
10743 convert to a pointer. */
10744 if (value_type (array
)->code () == TYPE_CODE_REF
10745 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10746 && VALUE_LVAL (array
) == lval_memory
))
10747 array
= value_addr (array
);
10749 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10750 && ada_is_array_descriptor_type (ada_check_typedef
10751 (value_type (array
))))
10752 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10755 array
= ada_coerce_to_simple_array_ptr (array
);
10757 /* If we have more than one level of pointer indirection,
10758 dereference the value until we get only one level. */
10759 while (value_type (array
)->code () == TYPE_CODE_PTR
10760 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10762 array
= value_ind (array
);
10764 /* Make sure we really do have an array type before going further,
10765 to avoid a SEGV when trying to get the index type or the target
10766 type later down the road if the debug info generated by
10767 the compiler is incorrect or incomplete. */
10768 if (!ada_is_simple_array_type (value_type (array
)))
10769 error (_("cannot take slice of non-array"));
10771 if (ada_check_typedef (value_type (array
))->code ()
10774 struct type
*type0
= ada_check_typedef (value_type (array
));
10776 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10777 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10780 struct type
*arr_type0
=
10781 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10783 return ada_value_slice_from_ptr (array
, arr_type0
,
10784 longest_to_int (low_bound
),
10785 longest_to_int (high_bound
));
10788 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10790 else if (high_bound
< low_bound
)
10791 return empty_array (value_type (array
), low_bound
, high_bound
);
10793 return ada_value_slice (array
, longest_to_int (low_bound
),
10794 longest_to_int (high_bound
));
10797 case UNOP_IN_RANGE
:
10799 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10800 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10802 if (noside
== EVAL_SKIP
)
10805 switch (type
->code ())
10808 lim_warning (_("Membership test incompletely implemented; "
10809 "always returns true"));
10810 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10811 return value_from_longest (type
, (LONGEST
) 1);
10813 case TYPE_CODE_RANGE
:
10814 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10815 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10816 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10817 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10818 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10820 value_from_longest (type
,
10821 (value_less (arg1
, arg3
)
10822 || value_equal (arg1
, arg3
))
10823 && (value_less (arg2
, arg1
)
10824 || value_equal (arg2
, arg1
)));
10827 case BINOP_IN_BOUNDS
:
10829 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10830 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10832 if (noside
== EVAL_SKIP
)
10835 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10837 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10838 return value_zero (type
, not_lval
);
10841 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10843 type
= ada_index_type (value_type (arg2
), tem
, "range");
10845 type
= value_type (arg1
);
10847 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10848 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10850 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10851 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10852 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10854 value_from_longest (type
,
10855 (value_less (arg1
, arg3
)
10856 || value_equal (arg1
, arg3
))
10857 && (value_less (arg2
, arg1
)
10858 || value_equal (arg2
, arg1
)));
10860 case TERNOP_IN_RANGE
:
10861 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10862 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10863 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10865 if (noside
== EVAL_SKIP
)
10868 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10869 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10870 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10872 value_from_longest (type
,
10873 (value_less (arg1
, arg3
)
10874 || value_equal (arg1
, arg3
))
10875 && (value_less (arg2
, arg1
)
10876 || value_equal (arg2
, arg1
)));
10880 case OP_ATR_LENGTH
:
10882 struct type
*type_arg
;
10884 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10886 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10888 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10892 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10896 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10897 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10898 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10901 if (noside
== EVAL_SKIP
)
10903 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10905 if (type_arg
== NULL
)
10906 type_arg
= value_type (arg1
);
10908 if (ada_is_constrained_packed_array_type (type_arg
))
10909 type_arg
= decode_constrained_packed_array_type (type_arg
);
10911 if (!discrete_type_p (type_arg
))
10915 default: /* Should never happen. */
10916 error (_("unexpected attribute encountered"));
10919 type_arg
= ada_index_type (type_arg
, tem
,
10920 ada_attribute_name (op
));
10922 case OP_ATR_LENGTH
:
10923 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
10928 return value_zero (type_arg
, not_lval
);
10930 else if (type_arg
== NULL
)
10932 arg1
= ada_coerce_ref (arg1
);
10934 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10935 arg1
= ada_coerce_to_simple_array (arg1
);
10937 if (op
== OP_ATR_LENGTH
)
10938 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10941 type
= ada_index_type (value_type (arg1
), tem
,
10942 ada_attribute_name (op
));
10944 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10949 default: /* Should never happen. */
10950 error (_("unexpected attribute encountered"));
10952 return value_from_longest
10953 (type
, ada_array_bound (arg1
, tem
, 0));
10955 return value_from_longest
10956 (type
, ada_array_bound (arg1
, tem
, 1));
10957 case OP_ATR_LENGTH
:
10958 return value_from_longest
10959 (type
, ada_array_length (arg1
, tem
));
10962 else if (discrete_type_p (type_arg
))
10964 struct type
*range_type
;
10965 const char *name
= ada_type_name (type_arg
);
10968 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
10969 range_type
= to_fixed_range_type (type_arg
, NULL
);
10970 if (range_type
== NULL
)
10971 range_type
= type_arg
;
10975 error (_("unexpected attribute encountered"));
10977 return value_from_longest
10978 (range_type
, ada_discrete_type_low_bound (range_type
));
10980 return value_from_longest
10981 (range_type
, ada_discrete_type_high_bound (range_type
));
10982 case OP_ATR_LENGTH
:
10983 error (_("the 'length attribute applies only to array types"));
10986 else if (type_arg
->code () == TYPE_CODE_FLT
)
10987 error (_("unimplemented type attribute"));
10992 if (ada_is_constrained_packed_array_type (type_arg
))
10993 type_arg
= decode_constrained_packed_array_type (type_arg
);
10995 if (op
== OP_ATR_LENGTH
)
10996 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10999 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11001 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11007 error (_("unexpected attribute encountered"));
11009 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11010 return value_from_longest (type
, low
);
11012 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11013 return value_from_longest (type
, high
);
11014 case OP_ATR_LENGTH
:
11015 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11016 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11017 return value_from_longest (type
, high
- low
+ 1);
11023 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11024 if (noside
== EVAL_SKIP
)
11027 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11028 return value_zero (ada_tag_type (arg1
), not_lval
);
11030 return ada_value_tag (arg1
);
11034 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11035 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11036 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11037 if (noside
== EVAL_SKIP
)
11039 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11040 return value_zero (value_type (arg1
), not_lval
);
11043 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11044 return value_binop (arg1
, arg2
,
11045 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11048 case OP_ATR_MODULUS
:
11050 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11052 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11053 if (noside
== EVAL_SKIP
)
11056 if (!ada_is_modular_type (type_arg
))
11057 error (_("'modulus must be applied to modular type"));
11059 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11060 ada_modulus (type_arg
));
11065 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11066 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11067 if (noside
== EVAL_SKIP
)
11069 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11070 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11071 return value_zero (type
, not_lval
);
11073 return value_pos_atr (type
, arg1
);
11076 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11077 type
= value_type (arg1
);
11079 /* If the argument is a reference, then dereference its type, since
11080 the user is really asking for the size of the actual object,
11081 not the size of the pointer. */
11082 if (type
->code () == TYPE_CODE_REF
)
11083 type
= TYPE_TARGET_TYPE (type
);
11085 if (noside
== EVAL_SKIP
)
11087 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11088 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11090 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11091 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11094 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11095 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11096 type
= exp
->elts
[pc
+ 2].type
;
11097 if (noside
== EVAL_SKIP
)
11099 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11100 return value_zero (type
, not_lval
);
11102 return value_val_atr (type
, arg1
);
11105 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11106 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11107 if (noside
== EVAL_SKIP
)
11109 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11110 return value_zero (value_type (arg1
), not_lval
);
11113 /* For integer exponentiation operations,
11114 only promote the first argument. */
11115 if (is_integral_type (value_type (arg2
)))
11116 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11118 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11120 return value_binop (arg1
, arg2
, op
);
11124 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11125 if (noside
== EVAL_SKIP
)
11131 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11132 if (noside
== EVAL_SKIP
)
11134 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11135 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11136 return value_neg (arg1
);
11141 preeval_pos
= *pos
;
11142 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11143 if (noside
== EVAL_SKIP
)
11145 type
= ada_check_typedef (value_type (arg1
));
11146 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11148 if (ada_is_array_descriptor_type (type
))
11149 /* GDB allows dereferencing GNAT array descriptors. */
11151 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11153 if (arrType
== NULL
)
11154 error (_("Attempt to dereference null array pointer."));
11155 return value_at_lazy (arrType
, 0);
11157 else if (type
->code () == TYPE_CODE_PTR
11158 || type
->code () == TYPE_CODE_REF
11159 /* In C you can dereference an array to get the 1st elt. */
11160 || type
->code () == TYPE_CODE_ARRAY
)
11162 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11163 only be determined by inspecting the object's tag.
11164 This means that we need to evaluate completely the
11165 expression in order to get its type. */
11167 if ((type
->code () == TYPE_CODE_REF
11168 || type
->code () == TYPE_CODE_PTR
)
11169 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11171 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11173 type
= value_type (ada_value_ind (arg1
));
11177 type
= to_static_fixed_type
11179 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11181 ada_ensure_varsize_limit (type
);
11182 return value_zero (type
, lval_memory
);
11184 else if (type
->code () == TYPE_CODE_INT
)
11186 /* GDB allows dereferencing an int. */
11187 if (expect_type
== NULL
)
11188 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11193 to_static_fixed_type (ada_aligned_type (expect_type
));
11194 return value_zero (expect_type
, lval_memory
);
11198 error (_("Attempt to take contents of a non-pointer value."));
11200 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11201 type
= ada_check_typedef (value_type (arg1
));
11203 if (type
->code () == TYPE_CODE_INT
)
11204 /* GDB allows dereferencing an int. If we were given
11205 the expect_type, then use that as the target type.
11206 Otherwise, assume that the target type is an int. */
11208 if (expect_type
!= NULL
)
11209 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11212 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11213 (CORE_ADDR
) value_as_address (arg1
));
11216 if (ada_is_array_descriptor_type (type
))
11217 /* GDB allows dereferencing GNAT array descriptors. */
11218 return ada_coerce_to_simple_array (arg1
);
11220 return ada_value_ind (arg1
);
11222 case STRUCTOP_STRUCT
:
11223 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11224 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11225 preeval_pos
= *pos
;
11226 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11227 if (noside
== EVAL_SKIP
)
11229 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11231 struct type
*type1
= value_type (arg1
);
11233 if (ada_is_tagged_type (type1
, 1))
11235 type
= ada_lookup_struct_elt_type (type1
,
11236 &exp
->elts
[pc
+ 2].string
,
11239 /* If the field is not found, check if it exists in the
11240 extension of this object's type. This means that we
11241 need to evaluate completely the expression. */
11245 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11247 arg1
= ada_value_struct_elt (arg1
,
11248 &exp
->elts
[pc
+ 2].string
,
11250 arg1
= unwrap_value (arg1
);
11251 type
= value_type (ada_to_fixed_value (arg1
));
11256 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11259 return value_zero (ada_aligned_type (type
), lval_memory
);
11263 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11264 arg1
= unwrap_value (arg1
);
11265 return ada_to_fixed_value (arg1
);
11269 /* The value is not supposed to be used. This is here to make it
11270 easier to accommodate expressions that contain types. */
11272 if (noside
== EVAL_SKIP
)
11274 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11275 return allocate_value (exp
->elts
[pc
+ 1].type
);
11277 error (_("Attempt to use a type name as an expression"));
11282 case OP_DISCRETE_RANGE
:
11283 case OP_POSITIONAL
:
11285 if (noside
== EVAL_NORMAL
)
11289 error (_("Undefined name, ambiguous name, or renaming used in "
11290 "component association: %s."), &exp
->elts
[pc
+2].string
);
11292 error (_("Aggregates only allowed on the right of an assignment"));
11294 internal_error (__FILE__
, __LINE__
,
11295 _("aggregate apparently mangled"));
11298 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11300 for (tem
= 0; tem
< nargs
; tem
+= 1)
11301 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11306 return eval_skip_value (exp
);
11312 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11313 type name that encodes the 'small and 'delta information.
11314 Otherwise, return NULL. */
11316 static const char *
11317 gnat_encoded_fixed_type_info (struct type
*type
)
11319 const char *name
= ada_type_name (type
);
11320 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: type
->code ();
11322 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11324 const char *tail
= strstr (name
, "___XF_");
11331 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11332 return gnat_encoded_fixed_type_info (TYPE_TARGET_TYPE (type
));
11337 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11340 ada_is_gnat_encoded_fixed_point_type (struct type
*type
)
11342 return gnat_encoded_fixed_type_info (type
) != NULL
;
11345 /* Return non-zero iff TYPE represents a System.Address type. */
11348 ada_is_system_address_type (struct type
*type
)
11350 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11353 /* Assuming that TYPE is the representation of an Ada fixed-point
11354 type, return the target floating-point type to be used to represent
11355 of this type during internal computation. */
11357 static struct type
*
11358 ada_scaling_type (struct type
*type
)
11360 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11363 /* Assuming that TYPE is the representation of an Ada fixed-point
11364 type, return its delta, or NULL if the type is malformed and the
11365 delta cannot be determined. */
11368 gnat_encoded_fixed_point_delta (struct type
*type
)
11370 const char *encoding
= gnat_encoded_fixed_type_info (type
);
11371 struct type
*scale_type
= ada_scaling_type (type
);
11373 long long num
, den
;
11375 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11378 return value_binop (value_from_longest (scale_type
, num
),
11379 value_from_longest (scale_type
, den
), BINOP_DIV
);
11382 /* Assuming that ada_is_gnat_encoded_fixed_point_type (TYPE), return
11383 the scaling factor ('SMALL value) associated with the type. */
11386 ada_scaling_factor (struct type
*type
)
11388 const char *encoding
= gnat_encoded_fixed_type_info (type
);
11389 struct type
*scale_type
= ada_scaling_type (type
);
11391 long long num0
, den0
, num1
, den1
;
11394 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11395 &num0
, &den0
, &num1
, &den1
);
11398 return value_from_longest (scale_type
, 1);
11400 return value_binop (value_from_longest (scale_type
, num1
),
11401 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11403 return value_binop (value_from_longest (scale_type
, num0
),
11404 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11411 /* Scan STR beginning at position K for a discriminant name, and
11412 return the value of that discriminant field of DVAL in *PX. If
11413 PNEW_K is not null, put the position of the character beyond the
11414 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11415 not alter *PX and *PNEW_K if unsuccessful. */
11418 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11421 static char *bound_buffer
= NULL
;
11422 static size_t bound_buffer_len
= 0;
11423 const char *pstart
, *pend
, *bound
;
11424 struct value
*bound_val
;
11426 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11430 pend
= strstr (pstart
, "__");
11434 k
+= strlen (bound
);
11438 int len
= pend
- pstart
;
11440 /* Strip __ and beyond. */
11441 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11442 strncpy (bound_buffer
, pstart
, len
);
11443 bound_buffer
[len
] = '\0';
11445 bound
= bound_buffer
;
11449 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11450 if (bound_val
== NULL
)
11453 *px
= value_as_long (bound_val
);
11454 if (pnew_k
!= NULL
)
11459 /* Value of variable named NAME in the current environment. If
11460 no such variable found, then if ERR_MSG is null, returns 0, and
11461 otherwise causes an error with message ERR_MSG. */
11463 static struct value
*
11464 get_var_value (const char *name
, const char *err_msg
)
11466 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11468 std::vector
<struct block_symbol
> syms
;
11469 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11470 get_selected_block (0),
11471 VAR_DOMAIN
, &syms
, 1);
11475 if (err_msg
== NULL
)
11478 error (("%s"), err_msg
);
11481 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11484 /* Value of integer variable named NAME in the current environment.
11485 If no such variable is found, returns false. Otherwise, sets VALUE
11486 to the variable's value and returns true. */
11489 get_int_var_value (const char *name
, LONGEST
&value
)
11491 struct value
*var_val
= get_var_value (name
, 0);
11496 value
= value_as_long (var_val
);
11501 /* Return a range type whose base type is that of the range type named
11502 NAME in the current environment, and whose bounds are calculated
11503 from NAME according to the GNAT range encoding conventions.
11504 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11505 corresponding range type from debug information; fall back to using it
11506 if symbol lookup fails. If a new type must be created, allocate it
11507 like ORIG_TYPE was. The bounds information, in general, is encoded
11508 in NAME, the base type given in the named range type. */
11510 static struct type
*
11511 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11514 struct type
*base_type
;
11515 const char *subtype_info
;
11517 gdb_assert (raw_type
!= NULL
);
11518 gdb_assert (raw_type
->name () != NULL
);
11520 if (raw_type
->code () == TYPE_CODE_RANGE
)
11521 base_type
= TYPE_TARGET_TYPE (raw_type
);
11523 base_type
= raw_type
;
11525 name
= raw_type
->name ();
11526 subtype_info
= strstr (name
, "___XD");
11527 if (subtype_info
== NULL
)
11529 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11530 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11532 if (L
< INT_MIN
|| U
> INT_MAX
)
11535 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11540 static char *name_buf
= NULL
;
11541 static size_t name_len
= 0;
11542 int prefix_len
= subtype_info
- name
;
11545 const char *bounds_str
;
11548 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11549 strncpy (name_buf
, name
, prefix_len
);
11550 name_buf
[prefix_len
] = '\0';
11553 bounds_str
= strchr (subtype_info
, '_');
11556 if (*subtype_info
== 'L')
11558 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11559 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11561 if (bounds_str
[n
] == '_')
11563 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11569 strcpy (name_buf
+ prefix_len
, "___L");
11570 if (!get_int_var_value (name_buf
, L
))
11572 lim_warning (_("Unknown lower bound, using 1."));
11577 if (*subtype_info
== 'U')
11579 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11580 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11585 strcpy (name_buf
+ prefix_len
, "___U");
11586 if (!get_int_var_value (name_buf
, U
))
11588 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11593 type
= create_static_range_type (alloc_type_copy (raw_type
),
11595 /* create_static_range_type alters the resulting type's length
11596 to match the size of the base_type, which is not what we want.
11597 Set it back to the original range type's length. */
11598 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11599 type
->set_name (name
);
11604 /* True iff NAME is the name of a range type. */
11607 ada_is_range_type_name (const char *name
)
11609 return (name
!= NULL
&& strstr (name
, "___XD"));
11613 /* Modular types */
11615 /* True iff TYPE is an Ada modular type. */
11618 ada_is_modular_type (struct type
*type
)
11620 struct type
*subranged_type
= get_base_type (type
);
11622 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11623 && subranged_type
->code () == TYPE_CODE_INT
11624 && TYPE_UNSIGNED (subranged_type
));
11627 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11630 ada_modulus (struct type
*type
)
11632 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11636 /* Ada exception catchpoint support:
11637 ---------------------------------
11639 We support 3 kinds of exception catchpoints:
11640 . catchpoints on Ada exceptions
11641 . catchpoints on unhandled Ada exceptions
11642 . catchpoints on failed assertions
11644 Exceptions raised during failed assertions, or unhandled exceptions
11645 could perfectly be caught with the general catchpoint on Ada exceptions.
11646 However, we can easily differentiate these two special cases, and having
11647 the option to distinguish these two cases from the rest can be useful
11648 to zero-in on certain situations.
11650 Exception catchpoints are a specialized form of breakpoint,
11651 since they rely on inserting breakpoints inside known routines
11652 of the GNAT runtime. The implementation therefore uses a standard
11653 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11656 Support in the runtime for exception catchpoints have been changed
11657 a few times already, and these changes affect the implementation
11658 of these catchpoints. In order to be able to support several
11659 variants of the runtime, we use a sniffer that will determine
11660 the runtime variant used by the program being debugged. */
11662 /* Ada's standard exceptions.
11664 The Ada 83 standard also defined Numeric_Error. But there so many
11665 situations where it was unclear from the Ada 83 Reference Manual
11666 (RM) whether Constraint_Error or Numeric_Error should be raised,
11667 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11668 Interpretation saying that anytime the RM says that Numeric_Error
11669 should be raised, the implementation may raise Constraint_Error.
11670 Ada 95 went one step further and pretty much removed Numeric_Error
11671 from the list of standard exceptions (it made it a renaming of
11672 Constraint_Error, to help preserve compatibility when compiling
11673 an Ada83 compiler). As such, we do not include Numeric_Error from
11674 this list of standard exceptions. */
11676 static const char *standard_exc
[] = {
11677 "constraint_error",
11683 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11685 /* A structure that describes how to support exception catchpoints
11686 for a given executable. */
11688 struct exception_support_info
11690 /* The name of the symbol to break on in order to insert
11691 a catchpoint on exceptions. */
11692 const char *catch_exception_sym
;
11694 /* The name of the symbol to break on in order to insert
11695 a catchpoint on unhandled exceptions. */
11696 const char *catch_exception_unhandled_sym
;
11698 /* The name of the symbol to break on in order to insert
11699 a catchpoint on failed assertions. */
11700 const char *catch_assert_sym
;
11702 /* The name of the symbol to break on in order to insert
11703 a catchpoint on exception handling. */
11704 const char *catch_handlers_sym
;
11706 /* Assuming that the inferior just triggered an unhandled exception
11707 catchpoint, this function is responsible for returning the address
11708 in inferior memory where the name of that exception is stored.
11709 Return zero if the address could not be computed. */
11710 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11713 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11714 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11716 /* The following exception support info structure describes how to
11717 implement exception catchpoints with the latest version of the
11718 Ada runtime (as of 2019-08-??). */
11720 static const struct exception_support_info default_exception_support_info
=
11722 "__gnat_debug_raise_exception", /* catch_exception_sym */
11723 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11724 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11725 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11726 ada_unhandled_exception_name_addr
11729 /* The following exception support info structure describes how to
11730 implement exception catchpoints with an earlier version of the
11731 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11733 static const struct exception_support_info exception_support_info_v0
=
11735 "__gnat_debug_raise_exception", /* catch_exception_sym */
11736 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11737 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11738 "__gnat_begin_handler", /* catch_handlers_sym */
11739 ada_unhandled_exception_name_addr
11742 /* The following exception support info structure describes how to
11743 implement exception catchpoints with a slightly older version
11744 of the Ada runtime. */
11746 static const struct exception_support_info exception_support_info_fallback
=
11748 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11749 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11750 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11751 "__gnat_begin_handler", /* catch_handlers_sym */
11752 ada_unhandled_exception_name_addr_from_raise
11755 /* Return nonzero if we can detect the exception support routines
11756 described in EINFO.
11758 This function errors out if an abnormal situation is detected
11759 (for instance, if we find the exception support routines, but
11760 that support is found to be incomplete). */
11763 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11765 struct symbol
*sym
;
11767 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11768 that should be compiled with debugging information. As a result, we
11769 expect to find that symbol in the symtabs. */
11771 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11774 /* Perhaps we did not find our symbol because the Ada runtime was
11775 compiled without debugging info, or simply stripped of it.
11776 It happens on some GNU/Linux distributions for instance, where
11777 users have to install a separate debug package in order to get
11778 the runtime's debugging info. In that situation, let the user
11779 know why we cannot insert an Ada exception catchpoint.
11781 Note: Just for the purpose of inserting our Ada exception
11782 catchpoint, we could rely purely on the associated minimal symbol.
11783 But we would be operating in degraded mode anyway, since we are
11784 still lacking the debugging info needed later on to extract
11785 the name of the exception being raised (this name is printed in
11786 the catchpoint message, and is also used when trying to catch
11787 a specific exception). We do not handle this case for now. */
11788 struct bound_minimal_symbol msym
11789 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11791 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11792 error (_("Your Ada runtime appears to be missing some debugging "
11793 "information.\nCannot insert Ada exception catchpoint "
11794 "in this configuration."));
11799 /* Make sure that the symbol we found corresponds to a function. */
11801 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11803 error (_("Symbol \"%s\" is not a function (class = %d)"),
11804 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11808 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11811 struct bound_minimal_symbol msym
11812 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11814 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11815 error (_("Your Ada runtime appears to be missing some debugging "
11816 "information.\nCannot insert Ada exception catchpoint "
11817 "in this configuration."));
11822 /* Make sure that the symbol we found corresponds to a function. */
11824 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11826 error (_("Symbol \"%s\" is not a function (class = %d)"),
11827 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11834 /* Inspect the Ada runtime and determine which exception info structure
11835 should be used to provide support for exception catchpoints.
11837 This function will always set the per-inferior exception_info,
11838 or raise an error. */
11841 ada_exception_support_info_sniffer (void)
11843 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11845 /* If the exception info is already known, then no need to recompute it. */
11846 if (data
->exception_info
!= NULL
)
11849 /* Check the latest (default) exception support info. */
11850 if (ada_has_this_exception_support (&default_exception_support_info
))
11852 data
->exception_info
= &default_exception_support_info
;
11856 /* Try the v0 exception suport info. */
11857 if (ada_has_this_exception_support (&exception_support_info_v0
))
11859 data
->exception_info
= &exception_support_info_v0
;
11863 /* Try our fallback exception suport info. */
11864 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11866 data
->exception_info
= &exception_support_info_fallback
;
11870 /* Sometimes, it is normal for us to not be able to find the routine
11871 we are looking for. This happens when the program is linked with
11872 the shared version of the GNAT runtime, and the program has not been
11873 started yet. Inform the user of these two possible causes if
11876 if (ada_update_initial_language (language_unknown
) != language_ada
)
11877 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11879 /* If the symbol does not exist, then check that the program is
11880 already started, to make sure that shared libraries have been
11881 loaded. If it is not started, this may mean that the symbol is
11882 in a shared library. */
11884 if (inferior_ptid
.pid () == 0)
11885 error (_("Unable to insert catchpoint. Try to start the program first."));
11887 /* At this point, we know that we are debugging an Ada program and
11888 that the inferior has been started, but we still are not able to
11889 find the run-time symbols. That can mean that we are in
11890 configurable run time mode, or that a-except as been optimized
11891 out by the linker... In any case, at this point it is not worth
11892 supporting this feature. */
11894 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11897 /* True iff FRAME is very likely to be that of a function that is
11898 part of the runtime system. This is all very heuristic, but is
11899 intended to be used as advice as to what frames are uninteresting
11903 is_known_support_routine (struct frame_info
*frame
)
11905 enum language func_lang
;
11907 const char *fullname
;
11909 /* If this code does not have any debugging information (no symtab),
11910 This cannot be any user code. */
11912 symtab_and_line sal
= find_frame_sal (frame
);
11913 if (sal
.symtab
== NULL
)
11916 /* If there is a symtab, but the associated source file cannot be
11917 located, then assume this is not user code: Selecting a frame
11918 for which we cannot display the code would not be very helpful
11919 for the user. This should also take care of case such as VxWorks
11920 where the kernel has some debugging info provided for a few units. */
11922 fullname
= symtab_to_fullname (sal
.symtab
);
11923 if (access (fullname
, R_OK
) != 0)
11926 /* Check the unit filename against the Ada runtime file naming.
11927 We also check the name of the objfile against the name of some
11928 known system libraries that sometimes come with debugging info
11931 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11933 re_comp (known_runtime_file_name_patterns
[i
]);
11934 if (re_exec (lbasename (sal
.symtab
->filename
)))
11936 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11937 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11941 /* Check whether the function is a GNAT-generated entity. */
11943 gdb::unique_xmalloc_ptr
<char> func_name
11944 = find_frame_funname (frame
, &func_lang
, NULL
);
11945 if (func_name
== NULL
)
11948 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11950 re_comp (known_auxiliary_function_name_patterns
[i
]);
11951 if (re_exec (func_name
.get ()))
11958 /* Find the first frame that contains debugging information and that is not
11959 part of the Ada run-time, starting from FI and moving upward. */
11962 ada_find_printable_frame (struct frame_info
*fi
)
11964 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11966 if (!is_known_support_routine (fi
))
11975 /* Assuming that the inferior just triggered an unhandled exception
11976 catchpoint, return the address in inferior memory where the name
11977 of the exception is stored.
11979 Return zero if the address could not be computed. */
11982 ada_unhandled_exception_name_addr (void)
11984 return parse_and_eval_address ("e.full_name");
11987 /* Same as ada_unhandled_exception_name_addr, except that this function
11988 should be used when the inferior uses an older version of the runtime,
11989 where the exception name needs to be extracted from a specific frame
11990 several frames up in the callstack. */
11993 ada_unhandled_exception_name_addr_from_raise (void)
11996 struct frame_info
*fi
;
11997 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11999 /* To determine the name of this exception, we need to select
12000 the frame corresponding to RAISE_SYM_NAME. This frame is
12001 at least 3 levels up, so we simply skip the first 3 frames
12002 without checking the name of their associated function. */
12003 fi
= get_current_frame ();
12004 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
12006 fi
= get_prev_frame (fi
);
12010 enum language func_lang
;
12012 gdb::unique_xmalloc_ptr
<char> func_name
12013 = find_frame_funname (fi
, &func_lang
, NULL
);
12014 if (func_name
!= NULL
)
12016 if (strcmp (func_name
.get (),
12017 data
->exception_info
->catch_exception_sym
) == 0)
12018 break; /* We found the frame we were looking for... */
12020 fi
= get_prev_frame (fi
);
12027 return parse_and_eval_address ("id.full_name");
12030 /* Assuming the inferior just triggered an Ada exception catchpoint
12031 (of any type), return the address in inferior memory where the name
12032 of the exception is stored, if applicable.
12034 Assumes the selected frame is the current frame.
12036 Return zero if the address could not be computed, or if not relevant. */
12039 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12040 struct breakpoint
*b
)
12042 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12046 case ada_catch_exception
:
12047 return (parse_and_eval_address ("e.full_name"));
12050 case ada_catch_exception_unhandled
:
12051 return data
->exception_info
->unhandled_exception_name_addr ();
12054 case ada_catch_handlers
:
12055 return 0; /* The runtimes does not provide access to the exception
12059 case ada_catch_assert
:
12060 return 0; /* Exception name is not relevant in this case. */
12064 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12068 return 0; /* Should never be reached. */
12071 /* Assuming the inferior is stopped at an exception catchpoint,
12072 return the message which was associated to the exception, if
12073 available. Return NULL if the message could not be retrieved.
12075 Note: The exception message can be associated to an exception
12076 either through the use of the Raise_Exception function, or
12077 more simply (Ada 2005 and later), via:
12079 raise Exception_Name with "exception message";
12083 static gdb::unique_xmalloc_ptr
<char>
12084 ada_exception_message_1 (void)
12086 struct value
*e_msg_val
;
12089 /* For runtimes that support this feature, the exception message
12090 is passed as an unbounded string argument called "message". */
12091 e_msg_val
= parse_and_eval ("message");
12092 if (e_msg_val
== NULL
)
12093 return NULL
; /* Exception message not supported. */
12095 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
12096 gdb_assert (e_msg_val
!= NULL
);
12097 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
12099 /* If the message string is empty, then treat it as if there was
12100 no exception message. */
12101 if (e_msg_len
<= 0)
12104 return target_read_string (value_address (e_msg_val
), INT_MAX
);
12107 /* Same as ada_exception_message_1, except that all exceptions are
12108 contained here (returning NULL instead). */
12110 static gdb::unique_xmalloc_ptr
<char>
12111 ada_exception_message (void)
12113 gdb::unique_xmalloc_ptr
<char> e_msg
;
12117 e_msg
= ada_exception_message_1 ();
12119 catch (const gdb_exception_error
&e
)
12121 e_msg
.reset (nullptr);
12127 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12128 any error that ada_exception_name_addr_1 might cause to be thrown.
12129 When an error is intercepted, a warning with the error message is printed,
12130 and zero is returned. */
12133 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12134 struct breakpoint
*b
)
12136 CORE_ADDR result
= 0;
12140 result
= ada_exception_name_addr_1 (ex
, b
);
12143 catch (const gdb_exception_error
&e
)
12145 warning (_("failed to get exception name: %s"), e
.what ());
12152 static std::string ada_exception_catchpoint_cond_string
12153 (const char *excep_string
,
12154 enum ada_exception_catchpoint_kind ex
);
12156 /* Ada catchpoints.
12158 In the case of catchpoints on Ada exceptions, the catchpoint will
12159 stop the target on every exception the program throws. When a user
12160 specifies the name of a specific exception, we translate this
12161 request into a condition expression (in text form), and then parse
12162 it into an expression stored in each of the catchpoint's locations.
12163 We then use this condition to check whether the exception that was
12164 raised is the one the user is interested in. If not, then the
12165 target is resumed again. We store the name of the requested
12166 exception, in order to be able to re-set the condition expression
12167 when symbols change. */
12169 /* An instance of this type is used to represent an Ada catchpoint
12170 breakpoint location. */
12172 class ada_catchpoint_location
: public bp_location
12175 ada_catchpoint_location (breakpoint
*owner
)
12176 : bp_location (owner
, bp_loc_software_breakpoint
)
12179 /* The condition that checks whether the exception that was raised
12180 is the specific exception the user specified on catchpoint
12182 expression_up excep_cond_expr
;
12185 /* An instance of this type is used to represent an Ada catchpoint. */
12187 struct ada_catchpoint
: public breakpoint
12189 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12194 /* The name of the specific exception the user specified. */
12195 std::string excep_string
;
12197 /* What kind of catchpoint this is. */
12198 enum ada_exception_catchpoint_kind m_kind
;
12201 /* Parse the exception condition string in the context of each of the
12202 catchpoint's locations, and store them for later evaluation. */
12205 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12206 enum ada_exception_catchpoint_kind ex
)
12208 struct bp_location
*bl
;
12210 /* Nothing to do if there's no specific exception to catch. */
12211 if (c
->excep_string
.empty ())
12214 /* Same if there are no locations... */
12215 if (c
->loc
== NULL
)
12218 /* Compute the condition expression in text form, from the specific
12219 expection we want to catch. */
12220 std::string cond_string
12221 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12223 /* Iterate over all the catchpoint's locations, and parse an
12224 expression for each. */
12225 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12227 struct ada_catchpoint_location
*ada_loc
12228 = (struct ada_catchpoint_location
*) bl
;
12231 if (!bl
->shlib_disabled
)
12235 s
= cond_string
.c_str ();
12238 exp
= parse_exp_1 (&s
, bl
->address
,
12239 block_for_pc (bl
->address
),
12242 catch (const gdb_exception_error
&e
)
12244 warning (_("failed to reevaluate internal exception condition "
12245 "for catchpoint %d: %s"),
12246 c
->number
, e
.what ());
12250 ada_loc
->excep_cond_expr
= std::move (exp
);
12254 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12255 structure for all exception catchpoint kinds. */
12257 static struct bp_location
*
12258 allocate_location_exception (struct breakpoint
*self
)
12260 return new ada_catchpoint_location (self
);
12263 /* Implement the RE_SET method in the breakpoint_ops structure for all
12264 exception catchpoint kinds. */
12267 re_set_exception (struct breakpoint
*b
)
12269 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12271 /* Call the base class's method. This updates the catchpoint's
12273 bkpt_breakpoint_ops
.re_set (b
);
12275 /* Reparse the exception conditional expressions. One for each
12277 create_excep_cond_exprs (c
, c
->m_kind
);
12280 /* Returns true if we should stop for this breakpoint hit. If the
12281 user specified a specific exception, we only want to cause a stop
12282 if the program thrown that exception. */
12285 should_stop_exception (const struct bp_location
*bl
)
12287 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12288 const struct ada_catchpoint_location
*ada_loc
12289 = (const struct ada_catchpoint_location
*) bl
;
12292 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12293 if (c
->m_kind
== ada_catch_assert
)
12294 clear_internalvar (var
);
12301 if (c
->m_kind
== ada_catch_handlers
)
12302 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12303 ".all.occurrence.id");
12307 struct value
*exc
= parse_and_eval (expr
);
12308 set_internalvar (var
, exc
);
12310 catch (const gdb_exception_error
&ex
)
12312 clear_internalvar (var
);
12316 /* With no specific exception, should always stop. */
12317 if (c
->excep_string
.empty ())
12320 if (ada_loc
->excep_cond_expr
== NULL
)
12322 /* We will have a NULL expression if back when we were creating
12323 the expressions, this location's had failed to parse. */
12330 struct value
*mark
;
12332 mark
= value_mark ();
12333 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12334 value_free_to_mark (mark
);
12336 catch (const gdb_exception
&ex
)
12338 exception_fprintf (gdb_stderr
, ex
,
12339 _("Error in testing exception condition:\n"));
12345 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12346 for all exception catchpoint kinds. */
12349 check_status_exception (bpstat bs
)
12351 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12354 /* Implement the PRINT_IT method in the breakpoint_ops structure
12355 for all exception catchpoint kinds. */
12357 static enum print_stop_action
12358 print_it_exception (bpstat bs
)
12360 struct ui_out
*uiout
= current_uiout
;
12361 struct breakpoint
*b
= bs
->breakpoint_at
;
12363 annotate_catchpoint (b
->number
);
12365 if (uiout
->is_mi_like_p ())
12367 uiout
->field_string ("reason",
12368 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12369 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12372 uiout
->text (b
->disposition
== disp_del
12373 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12374 uiout
->field_signed ("bkptno", b
->number
);
12375 uiout
->text (", ");
12377 /* ada_exception_name_addr relies on the selected frame being the
12378 current frame. Need to do this here because this function may be
12379 called more than once when printing a stop, and below, we'll
12380 select the first frame past the Ada run-time (see
12381 ada_find_printable_frame). */
12382 select_frame (get_current_frame ());
12384 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12387 case ada_catch_exception
:
12388 case ada_catch_exception_unhandled
:
12389 case ada_catch_handlers
:
12391 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12392 char exception_name
[256];
12396 read_memory (addr
, (gdb_byte
*) exception_name
,
12397 sizeof (exception_name
) - 1);
12398 exception_name
[sizeof (exception_name
) - 1] = '\0';
12402 /* For some reason, we were unable to read the exception
12403 name. This could happen if the Runtime was compiled
12404 without debugging info, for instance. In that case,
12405 just replace the exception name by the generic string
12406 "exception" - it will read as "an exception" in the
12407 notification we are about to print. */
12408 memcpy (exception_name
, "exception", sizeof ("exception"));
12410 /* In the case of unhandled exception breakpoints, we print
12411 the exception name as "unhandled EXCEPTION_NAME", to make
12412 it clearer to the user which kind of catchpoint just got
12413 hit. We used ui_out_text to make sure that this extra
12414 info does not pollute the exception name in the MI case. */
12415 if (c
->m_kind
== ada_catch_exception_unhandled
)
12416 uiout
->text ("unhandled ");
12417 uiout
->field_string ("exception-name", exception_name
);
12420 case ada_catch_assert
:
12421 /* In this case, the name of the exception is not really
12422 important. Just print "failed assertion" to make it clearer
12423 that his program just hit an assertion-failure catchpoint.
12424 We used ui_out_text because this info does not belong in
12426 uiout
->text ("failed assertion");
12430 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12431 if (exception_message
!= NULL
)
12433 uiout
->text (" (");
12434 uiout
->field_string ("exception-message", exception_message
.get ());
12438 uiout
->text (" at ");
12439 ada_find_printable_frame (get_current_frame ());
12441 return PRINT_SRC_AND_LOC
;
12444 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12445 for all exception catchpoint kinds. */
12448 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12450 struct ui_out
*uiout
= current_uiout
;
12451 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12452 struct value_print_options opts
;
12454 get_user_print_options (&opts
);
12456 if (opts
.addressprint
)
12457 uiout
->field_skip ("addr");
12459 annotate_field (5);
12462 case ada_catch_exception
:
12463 if (!c
->excep_string
.empty ())
12465 std::string msg
= string_printf (_("`%s' Ada exception"),
12466 c
->excep_string
.c_str ());
12468 uiout
->field_string ("what", msg
);
12471 uiout
->field_string ("what", "all Ada exceptions");
12475 case ada_catch_exception_unhandled
:
12476 uiout
->field_string ("what", "unhandled Ada exceptions");
12479 case ada_catch_handlers
:
12480 if (!c
->excep_string
.empty ())
12482 uiout
->field_fmt ("what",
12483 _("`%s' Ada exception handlers"),
12484 c
->excep_string
.c_str ());
12487 uiout
->field_string ("what", "all Ada exceptions handlers");
12490 case ada_catch_assert
:
12491 uiout
->field_string ("what", "failed Ada assertions");
12495 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12500 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12501 for all exception catchpoint kinds. */
12504 print_mention_exception (struct breakpoint
*b
)
12506 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12507 struct ui_out
*uiout
= current_uiout
;
12509 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12510 : _("Catchpoint "));
12511 uiout
->field_signed ("bkptno", b
->number
);
12512 uiout
->text (": ");
12516 case ada_catch_exception
:
12517 if (!c
->excep_string
.empty ())
12519 std::string info
= string_printf (_("`%s' Ada exception"),
12520 c
->excep_string
.c_str ());
12521 uiout
->text (info
.c_str ());
12524 uiout
->text (_("all Ada exceptions"));
12527 case ada_catch_exception_unhandled
:
12528 uiout
->text (_("unhandled Ada exceptions"));
12531 case ada_catch_handlers
:
12532 if (!c
->excep_string
.empty ())
12535 = string_printf (_("`%s' Ada exception handlers"),
12536 c
->excep_string
.c_str ());
12537 uiout
->text (info
.c_str ());
12540 uiout
->text (_("all Ada exceptions handlers"));
12543 case ada_catch_assert
:
12544 uiout
->text (_("failed Ada assertions"));
12548 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12553 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12554 for all exception catchpoint kinds. */
12557 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12559 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12563 case ada_catch_exception
:
12564 fprintf_filtered (fp
, "catch exception");
12565 if (!c
->excep_string
.empty ())
12566 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12569 case ada_catch_exception_unhandled
:
12570 fprintf_filtered (fp
, "catch exception unhandled");
12573 case ada_catch_handlers
:
12574 fprintf_filtered (fp
, "catch handlers");
12577 case ada_catch_assert
:
12578 fprintf_filtered (fp
, "catch assert");
12582 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12584 print_recreate_thread (b
, fp
);
12587 /* Virtual tables for various breakpoint types. */
12588 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12589 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12590 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12591 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12593 /* See ada-lang.h. */
12596 is_ada_exception_catchpoint (breakpoint
*bp
)
12598 return (bp
->ops
== &catch_exception_breakpoint_ops
12599 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12600 || bp
->ops
== &catch_assert_breakpoint_ops
12601 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12604 /* Split the arguments specified in a "catch exception" command.
12605 Set EX to the appropriate catchpoint type.
12606 Set EXCEP_STRING to the name of the specific exception if
12607 specified by the user.
12608 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12609 "catch handlers" command. False otherwise.
12610 If a condition is found at the end of the arguments, the condition
12611 expression is stored in COND_STRING (memory must be deallocated
12612 after use). Otherwise COND_STRING is set to NULL. */
12615 catch_ada_exception_command_split (const char *args
,
12616 bool is_catch_handlers_cmd
,
12617 enum ada_exception_catchpoint_kind
*ex
,
12618 std::string
*excep_string
,
12619 std::string
*cond_string
)
12621 std::string exception_name
;
12623 exception_name
= extract_arg (&args
);
12624 if (exception_name
== "if")
12626 /* This is not an exception name; this is the start of a condition
12627 expression for a catchpoint on all exceptions. So, "un-get"
12628 this token, and set exception_name to NULL. */
12629 exception_name
.clear ();
12633 /* Check to see if we have a condition. */
12635 args
= skip_spaces (args
);
12636 if (startswith (args
, "if")
12637 && (isspace (args
[2]) || args
[2] == '\0'))
12640 args
= skip_spaces (args
);
12642 if (args
[0] == '\0')
12643 error (_("Condition missing after `if' keyword"));
12644 *cond_string
= args
;
12646 args
+= strlen (args
);
12649 /* Check that we do not have any more arguments. Anything else
12652 if (args
[0] != '\0')
12653 error (_("Junk at end of expression"));
12655 if (is_catch_handlers_cmd
)
12657 /* Catch handling of exceptions. */
12658 *ex
= ada_catch_handlers
;
12659 *excep_string
= exception_name
;
12661 else if (exception_name
.empty ())
12663 /* Catch all exceptions. */
12664 *ex
= ada_catch_exception
;
12665 excep_string
->clear ();
12667 else if (exception_name
== "unhandled")
12669 /* Catch unhandled exceptions. */
12670 *ex
= ada_catch_exception_unhandled
;
12671 excep_string
->clear ();
12675 /* Catch a specific exception. */
12676 *ex
= ada_catch_exception
;
12677 *excep_string
= exception_name
;
12681 /* Return the name of the symbol on which we should break in order to
12682 implement a catchpoint of the EX kind. */
12684 static const char *
12685 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12687 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12689 gdb_assert (data
->exception_info
!= NULL
);
12693 case ada_catch_exception
:
12694 return (data
->exception_info
->catch_exception_sym
);
12696 case ada_catch_exception_unhandled
:
12697 return (data
->exception_info
->catch_exception_unhandled_sym
);
12699 case ada_catch_assert
:
12700 return (data
->exception_info
->catch_assert_sym
);
12702 case ada_catch_handlers
:
12703 return (data
->exception_info
->catch_handlers_sym
);
12706 internal_error (__FILE__
, __LINE__
,
12707 _("unexpected catchpoint kind (%d)"), ex
);
12711 /* Return the breakpoint ops "virtual table" used for catchpoints
12714 static const struct breakpoint_ops
*
12715 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12719 case ada_catch_exception
:
12720 return (&catch_exception_breakpoint_ops
);
12722 case ada_catch_exception_unhandled
:
12723 return (&catch_exception_unhandled_breakpoint_ops
);
12725 case ada_catch_assert
:
12726 return (&catch_assert_breakpoint_ops
);
12728 case ada_catch_handlers
:
12729 return (&catch_handlers_breakpoint_ops
);
12732 internal_error (__FILE__
, __LINE__
,
12733 _("unexpected catchpoint kind (%d)"), ex
);
12737 /* Return the condition that will be used to match the current exception
12738 being raised with the exception that the user wants to catch. This
12739 assumes that this condition is used when the inferior just triggered
12740 an exception catchpoint.
12741 EX: the type of catchpoints used for catching Ada exceptions. */
12744 ada_exception_catchpoint_cond_string (const char *excep_string
,
12745 enum ada_exception_catchpoint_kind ex
)
12748 bool is_standard_exc
= false;
12749 std::string result
;
12751 if (ex
== ada_catch_handlers
)
12753 /* For exception handlers catchpoints, the condition string does
12754 not use the same parameter as for the other exceptions. */
12755 result
= ("long_integer (GNAT_GCC_exception_Access"
12756 "(gcc_exception).all.occurrence.id)");
12759 result
= "long_integer (e)";
12761 /* The standard exceptions are a special case. They are defined in
12762 runtime units that have been compiled without debugging info; if
12763 EXCEP_STRING is the not-fully-qualified name of a standard
12764 exception (e.g. "constraint_error") then, during the evaluation
12765 of the condition expression, the symbol lookup on this name would
12766 *not* return this standard exception. The catchpoint condition
12767 may then be set only on user-defined exceptions which have the
12768 same not-fully-qualified name (e.g. my_package.constraint_error).
12770 To avoid this unexcepted behavior, these standard exceptions are
12771 systematically prefixed by "standard". This means that "catch
12772 exception constraint_error" is rewritten into "catch exception
12773 standard.constraint_error".
12775 If an exception named constraint_error is defined in another package of
12776 the inferior program, then the only way to specify this exception as a
12777 breakpoint condition is to use its fully-qualified named:
12778 e.g. my_package.constraint_error. */
12780 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12782 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12784 is_standard_exc
= true;
12791 if (is_standard_exc
)
12792 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12794 string_appendf (result
, "long_integer (&%s)", excep_string
);
12799 /* Return the symtab_and_line that should be used to insert an exception
12800 catchpoint of the TYPE kind.
12802 ADDR_STRING returns the name of the function where the real
12803 breakpoint that implements the catchpoints is set, depending on the
12804 type of catchpoint we need to create. */
12806 static struct symtab_and_line
12807 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12808 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12810 const char *sym_name
;
12811 struct symbol
*sym
;
12813 /* First, find out which exception support info to use. */
12814 ada_exception_support_info_sniffer ();
12816 /* Then lookup the function on which we will break in order to catch
12817 the Ada exceptions requested by the user. */
12818 sym_name
= ada_exception_sym_name (ex
);
12819 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12822 error (_("Catchpoint symbol not found: %s"), sym_name
);
12824 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12825 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12827 /* Set ADDR_STRING. */
12828 *addr_string
= sym_name
;
12831 *ops
= ada_exception_breakpoint_ops (ex
);
12833 return find_function_start_sal (sym
, 1);
12836 /* Create an Ada exception catchpoint.
12838 EX_KIND is the kind of exception catchpoint to be created.
12840 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12841 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12842 of the exception to which this catchpoint applies.
12844 COND_STRING, if not empty, is the catchpoint condition.
12846 TEMPFLAG, if nonzero, means that the underlying breakpoint
12847 should be temporary.
12849 FROM_TTY is the usual argument passed to all commands implementations. */
12852 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12853 enum ada_exception_catchpoint_kind ex_kind
,
12854 const std::string
&excep_string
,
12855 const std::string
&cond_string
,
12860 std::string addr_string
;
12861 const struct breakpoint_ops
*ops
= NULL
;
12862 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12864 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12865 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12866 ops
, tempflag
, disabled
, from_tty
);
12867 c
->excep_string
= excep_string
;
12868 create_excep_cond_exprs (c
.get (), ex_kind
);
12869 if (!cond_string
.empty ())
12870 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
);
12871 install_breakpoint (0, std::move (c
), 1);
12874 /* Implement the "catch exception" command. */
12877 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12878 struct cmd_list_element
*command
)
12880 const char *arg
= arg_entry
;
12881 struct gdbarch
*gdbarch
= get_current_arch ();
12883 enum ada_exception_catchpoint_kind ex_kind
;
12884 std::string excep_string
;
12885 std::string cond_string
;
12887 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12891 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12893 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12894 excep_string
, cond_string
,
12895 tempflag
, 1 /* enabled */,
12899 /* Implement the "catch handlers" command. */
12902 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12903 struct cmd_list_element
*command
)
12905 const char *arg
= arg_entry
;
12906 struct gdbarch
*gdbarch
= get_current_arch ();
12908 enum ada_exception_catchpoint_kind ex_kind
;
12909 std::string excep_string
;
12910 std::string cond_string
;
12912 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12916 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
12918 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12919 excep_string
, cond_string
,
12920 tempflag
, 1 /* enabled */,
12924 /* Completion function for the Ada "catch" commands. */
12927 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
12928 const char *text
, const char *word
)
12930 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
12932 for (const ada_exc_info
&info
: exceptions
)
12934 if (startswith (info
.name
, word
))
12935 tracker
.add_completion (make_unique_xstrdup (info
.name
));
12939 /* Split the arguments specified in a "catch assert" command.
12941 ARGS contains the command's arguments (or the empty string if
12942 no arguments were passed).
12944 If ARGS contains a condition, set COND_STRING to that condition
12945 (the memory needs to be deallocated after use). */
12948 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
12950 args
= skip_spaces (args
);
12952 /* Check whether a condition was provided. */
12953 if (startswith (args
, "if")
12954 && (isspace (args
[2]) || args
[2] == '\0'))
12957 args
= skip_spaces (args
);
12958 if (args
[0] == '\0')
12959 error (_("condition missing after `if' keyword"));
12960 cond_string
.assign (args
);
12963 /* Otherwise, there should be no other argument at the end of
12965 else if (args
[0] != '\0')
12966 error (_("Junk at end of arguments."));
12969 /* Implement the "catch assert" command. */
12972 catch_assert_command (const char *arg_entry
, int from_tty
,
12973 struct cmd_list_element
*command
)
12975 const char *arg
= arg_entry
;
12976 struct gdbarch
*gdbarch
= get_current_arch ();
12978 std::string cond_string
;
12980 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12984 catch_ada_assert_command_split (arg
, cond_string
);
12985 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12987 tempflag
, 1 /* enabled */,
12991 /* Return non-zero if the symbol SYM is an Ada exception object. */
12994 ada_is_exception_sym (struct symbol
*sym
)
12996 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
12998 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12999 && SYMBOL_CLASS (sym
) != LOC_BLOCK
13000 && SYMBOL_CLASS (sym
) != LOC_CONST
13001 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
13002 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
13005 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13006 Ada exception object. This matches all exceptions except the ones
13007 defined by the Ada language. */
13010 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13014 if (!ada_is_exception_sym (sym
))
13017 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13018 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
13019 return 0; /* A standard exception. */
13021 /* Numeric_Error is also a standard exception, so exclude it.
13022 See the STANDARD_EXC description for more details as to why
13023 this exception is not listed in that array. */
13024 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
13030 /* A helper function for std::sort, comparing two struct ada_exc_info
13033 The comparison is determined first by exception name, and then
13034 by exception address. */
13037 ada_exc_info::operator< (const ada_exc_info
&other
) const
13041 result
= strcmp (name
, other
.name
);
13044 if (result
== 0 && addr
< other
.addr
)
13050 ada_exc_info::operator== (const ada_exc_info
&other
) const
13052 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
13055 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13056 routine, but keeping the first SKIP elements untouched.
13058 All duplicates are also removed. */
13061 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
13064 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
13065 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
13066 exceptions
->end ());
13069 /* Add all exceptions defined by the Ada standard whose name match
13070 a regular expression.
13072 If PREG is not NULL, then this regexp_t object is used to
13073 perform the symbol name matching. Otherwise, no name-based
13074 filtering is performed.
13076 EXCEPTIONS is a vector of exceptions to which matching exceptions
13080 ada_add_standard_exceptions (compiled_regex
*preg
,
13081 std::vector
<ada_exc_info
> *exceptions
)
13085 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13088 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
13090 struct bound_minimal_symbol msymbol
13091 = ada_lookup_simple_minsym (standard_exc
[i
]);
13093 if (msymbol
.minsym
!= NULL
)
13095 struct ada_exc_info info
13096 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13098 exceptions
->push_back (info
);
13104 /* Add all Ada exceptions defined locally and accessible from the given
13107 If PREG is not NULL, then this regexp_t object is used to
13108 perform the symbol name matching. Otherwise, no name-based
13109 filtering is performed.
13111 EXCEPTIONS is a vector of exceptions to which matching exceptions
13115 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13116 struct frame_info
*frame
,
13117 std::vector
<ada_exc_info
> *exceptions
)
13119 const struct block
*block
= get_frame_block (frame
, 0);
13123 struct block_iterator iter
;
13124 struct symbol
*sym
;
13126 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13128 switch (SYMBOL_CLASS (sym
))
13135 if (ada_is_exception_sym (sym
))
13137 struct ada_exc_info info
= {sym
->print_name (),
13138 SYMBOL_VALUE_ADDRESS (sym
)};
13140 exceptions
->push_back (info
);
13144 if (BLOCK_FUNCTION (block
) != NULL
)
13146 block
= BLOCK_SUPERBLOCK (block
);
13150 /* Return true if NAME matches PREG or if PREG is NULL. */
13153 name_matches_regex (const char *name
, compiled_regex
*preg
)
13155 return (preg
== NULL
13156 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13159 /* Add all exceptions defined globally whose name name match
13160 a regular expression, excluding standard exceptions.
13162 The reason we exclude standard exceptions is that they need
13163 to be handled separately: Standard exceptions are defined inside
13164 a runtime unit which is normally not compiled with debugging info,
13165 and thus usually do not show up in our symbol search. However,
13166 if the unit was in fact built with debugging info, we need to
13167 exclude them because they would duplicate the entry we found
13168 during the special loop that specifically searches for those
13169 standard exceptions.
13171 If PREG is not NULL, then this regexp_t object is used to
13172 perform the symbol name matching. Otherwise, no name-based
13173 filtering is performed.
13175 EXCEPTIONS is a vector of exceptions to which matching exceptions
13179 ada_add_global_exceptions (compiled_regex
*preg
,
13180 std::vector
<ada_exc_info
> *exceptions
)
13182 /* In Ada, the symbol "search name" is a linkage name, whereas the
13183 regular expression used to do the matching refers to the natural
13184 name. So match against the decoded name. */
13185 expand_symtabs_matching (NULL
,
13186 lookup_name_info::match_any (),
13187 [&] (const char *search_name
)
13189 std::string decoded
= ada_decode (search_name
);
13190 return name_matches_regex (decoded
.c_str (), preg
);
13195 for (objfile
*objfile
: current_program_space
->objfiles ())
13197 for (compunit_symtab
*s
: objfile
->compunits ())
13199 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13202 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13204 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13205 struct block_iterator iter
;
13206 struct symbol
*sym
;
13208 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13209 if (ada_is_non_standard_exception_sym (sym
)
13210 && name_matches_regex (sym
->natural_name (), preg
))
13212 struct ada_exc_info info
13213 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13215 exceptions
->push_back (info
);
13222 /* Implements ada_exceptions_list with the regular expression passed
13223 as a regex_t, rather than a string.
13225 If not NULL, PREG is used to filter out exceptions whose names
13226 do not match. Otherwise, all exceptions are listed. */
13228 static std::vector
<ada_exc_info
>
13229 ada_exceptions_list_1 (compiled_regex
*preg
)
13231 std::vector
<ada_exc_info
> result
;
13234 /* First, list the known standard exceptions. These exceptions
13235 need to be handled separately, as they are usually defined in
13236 runtime units that have been compiled without debugging info. */
13238 ada_add_standard_exceptions (preg
, &result
);
13240 /* Next, find all exceptions whose scope is local and accessible
13241 from the currently selected frame. */
13243 if (has_stack_frames ())
13245 prev_len
= result
.size ();
13246 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13248 if (result
.size () > prev_len
)
13249 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13252 /* Add all exceptions whose scope is global. */
13254 prev_len
= result
.size ();
13255 ada_add_global_exceptions (preg
, &result
);
13256 if (result
.size () > prev_len
)
13257 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13262 /* Return a vector of ada_exc_info.
13264 If REGEXP is NULL, all exceptions are included in the result.
13265 Otherwise, it should contain a valid regular expression,
13266 and only the exceptions whose names match that regular expression
13267 are included in the result.
13269 The exceptions are sorted in the following order:
13270 - Standard exceptions (defined by the Ada language), in
13271 alphabetical order;
13272 - Exceptions only visible from the current frame, in
13273 alphabetical order;
13274 - Exceptions whose scope is global, in alphabetical order. */
13276 std::vector
<ada_exc_info
>
13277 ada_exceptions_list (const char *regexp
)
13279 if (regexp
== NULL
)
13280 return ada_exceptions_list_1 (NULL
);
13282 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13283 return ada_exceptions_list_1 (®
);
13286 /* Implement the "info exceptions" command. */
13289 info_exceptions_command (const char *regexp
, int from_tty
)
13291 struct gdbarch
*gdbarch
= get_current_arch ();
13293 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13295 if (regexp
!= NULL
)
13297 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13299 printf_filtered (_("All defined Ada exceptions:\n"));
13301 for (const ada_exc_info
&info
: exceptions
)
13302 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13306 /* Information about operators given special treatment in functions
13308 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13310 #define ADA_OPERATORS \
13311 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13312 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13313 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13314 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13315 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13316 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13317 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13318 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13319 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13320 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13321 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13322 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13323 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13324 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13325 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13326 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13327 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13328 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13329 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13332 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13335 switch (exp
->elts
[pc
- 1].opcode
)
13338 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13341 #define OP_DEFN(op, len, args, binop) \
13342 case op: *oplenp = len; *argsp = args; break;
13348 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13353 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13358 /* Implementation of the exp_descriptor method operator_check. */
13361 ada_operator_check (struct expression
*exp
, int pos
,
13362 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13365 const union exp_element
*const elts
= exp
->elts
;
13366 struct type
*type
= NULL
;
13368 switch (elts
[pos
].opcode
)
13370 case UNOP_IN_RANGE
:
13372 type
= elts
[pos
+ 1].type
;
13376 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13379 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13381 if (type
&& TYPE_OBJFILE (type
)
13382 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13388 static const char *
13389 ada_op_name (enum exp_opcode opcode
)
13394 return op_name_standard (opcode
);
13396 #define OP_DEFN(op, len, args, binop) case op: return #op;
13401 return "OP_AGGREGATE";
13403 return "OP_CHOICES";
13409 /* As for operator_length, but assumes PC is pointing at the first
13410 element of the operator, and gives meaningful results only for the
13411 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13414 ada_forward_operator_length (struct expression
*exp
, int pc
,
13415 int *oplenp
, int *argsp
)
13417 switch (exp
->elts
[pc
].opcode
)
13420 *oplenp
= *argsp
= 0;
13423 #define OP_DEFN(op, len, args, binop) \
13424 case op: *oplenp = len; *argsp = args; break;
13430 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13435 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13441 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13443 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13451 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13453 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13458 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13462 /* Ada attributes ('Foo). */
13465 case OP_ATR_LENGTH
:
13469 case OP_ATR_MODULUS
:
13476 case UNOP_IN_RANGE
:
13478 /* XXX: gdb_sprint_host_address, type_sprint */
13479 fprintf_filtered (stream
, _("Type @"));
13480 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13481 fprintf_filtered (stream
, " (");
13482 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13483 fprintf_filtered (stream
, ")");
13485 case BINOP_IN_BOUNDS
:
13486 fprintf_filtered (stream
, " (%d)",
13487 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13489 case TERNOP_IN_RANGE
:
13494 case OP_DISCRETE_RANGE
:
13495 case OP_POSITIONAL
:
13502 char *name
= &exp
->elts
[elt
+ 2].string
;
13503 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13505 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13510 return dump_subexp_body_standard (exp
, stream
, elt
);
13514 for (i
= 0; i
< nargs
; i
+= 1)
13515 elt
= dump_subexp (exp
, stream
, elt
);
13520 /* The Ada extension of print_subexp (q.v.). */
13523 ada_print_subexp (struct expression
*exp
, int *pos
,
13524 struct ui_file
*stream
, enum precedence prec
)
13526 int oplen
, nargs
, i
;
13528 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13530 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13537 print_subexp_standard (exp
, pos
, stream
, prec
);
13541 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13544 case BINOP_IN_BOUNDS
:
13545 /* XXX: sprint_subexp */
13546 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13547 fputs_filtered (" in ", stream
);
13548 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13549 fputs_filtered ("'range", stream
);
13550 if (exp
->elts
[pc
+ 1].longconst
> 1)
13551 fprintf_filtered (stream
, "(%ld)",
13552 (long) exp
->elts
[pc
+ 1].longconst
);
13555 case TERNOP_IN_RANGE
:
13556 if (prec
>= PREC_EQUAL
)
13557 fputs_filtered ("(", stream
);
13558 /* XXX: sprint_subexp */
13559 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13560 fputs_filtered (" in ", stream
);
13561 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13562 fputs_filtered (" .. ", stream
);
13563 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13564 if (prec
>= PREC_EQUAL
)
13565 fputs_filtered (")", stream
);
13570 case OP_ATR_LENGTH
:
13574 case OP_ATR_MODULUS
:
13579 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13581 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13582 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13583 &type_print_raw_options
);
13587 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13588 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13593 for (tem
= 1; tem
< nargs
; tem
+= 1)
13595 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13596 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13598 fputs_filtered (")", stream
);
13603 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13604 fputs_filtered ("'(", stream
);
13605 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13606 fputs_filtered (")", stream
);
13609 case UNOP_IN_RANGE
:
13610 /* XXX: sprint_subexp */
13611 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13612 fputs_filtered (" in ", stream
);
13613 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13614 &type_print_raw_options
);
13617 case OP_DISCRETE_RANGE
:
13618 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13619 fputs_filtered ("..", stream
);
13620 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13624 fputs_filtered ("others => ", stream
);
13625 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13629 for (i
= 0; i
< nargs
-1; i
+= 1)
13632 fputs_filtered ("|", stream
);
13633 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13635 fputs_filtered (" => ", stream
);
13636 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13639 case OP_POSITIONAL
:
13640 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13644 fputs_filtered ("(", stream
);
13645 for (i
= 0; i
< nargs
; i
+= 1)
13648 fputs_filtered (", ", stream
);
13649 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13651 fputs_filtered (")", stream
);
13656 /* Table mapping opcodes into strings for printing operators
13657 and precedences of the operators. */
13659 static const struct op_print ada_op_print_tab
[] = {
13660 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13661 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13662 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13663 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13664 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13665 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13666 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13667 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13668 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13669 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13670 {">", BINOP_GTR
, PREC_ORDER
, 0},
13671 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13672 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13673 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13674 {"+", BINOP_ADD
, PREC_ADD
, 0},
13675 {"-", BINOP_SUB
, PREC_ADD
, 0},
13676 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13677 {"*", BINOP_MUL
, PREC_MUL
, 0},
13678 {"/", BINOP_DIV
, PREC_MUL
, 0},
13679 {"rem", BINOP_REM
, PREC_MUL
, 0},
13680 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13681 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13682 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13683 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13684 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13685 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13686 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13687 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13688 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13689 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13690 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13691 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13694 enum ada_primitive_types
{
13695 ada_primitive_type_int
,
13696 ada_primitive_type_long
,
13697 ada_primitive_type_short
,
13698 ada_primitive_type_char
,
13699 ada_primitive_type_float
,
13700 ada_primitive_type_double
,
13701 ada_primitive_type_void
,
13702 ada_primitive_type_long_long
,
13703 ada_primitive_type_long_double
,
13704 ada_primitive_type_natural
,
13705 ada_primitive_type_positive
,
13706 ada_primitive_type_system_address
,
13707 ada_primitive_type_storage_offset
,
13708 nr_ada_primitive_types
13712 /* Language vector */
13714 /* Not really used, but needed in the ada_language_defn. */
13717 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13719 ada_emit_char (c
, type
, stream
, quoter
, 1);
13723 parse (struct parser_state
*ps
)
13725 warnings_issued
= 0;
13726 return ada_parse (ps
);
13729 static const struct exp_descriptor ada_exp_descriptor
= {
13731 ada_operator_length
,
13732 ada_operator_check
,
13734 ada_dump_subexp_body
,
13735 ada_evaluate_subexp
13738 /* symbol_name_matcher_ftype adapter for wild_match. */
13741 do_wild_match (const char *symbol_search_name
,
13742 const lookup_name_info
&lookup_name
,
13743 completion_match_result
*comp_match_res
)
13745 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13748 /* symbol_name_matcher_ftype adapter for full_match. */
13751 do_full_match (const char *symbol_search_name
,
13752 const lookup_name_info
&lookup_name
,
13753 completion_match_result
*comp_match_res
)
13755 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13758 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13761 do_exact_match (const char *symbol_search_name
,
13762 const lookup_name_info
&lookup_name
,
13763 completion_match_result
*comp_match_res
)
13765 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13768 /* Build the Ada lookup name for LOOKUP_NAME. */
13770 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13772 gdb::string_view user_name
= lookup_name
.name ();
13774 if (user_name
[0] == '<')
13776 if (user_name
.back () == '>')
13778 = user_name
.substr (1, user_name
.size () - 2).to_string ();
13781 = user_name
.substr (1, user_name
.size () - 1).to_string ();
13782 m_encoded_p
= true;
13783 m_verbatim_p
= true;
13784 m_wild_match_p
= false;
13785 m_standard_p
= false;
13789 m_verbatim_p
= false;
13791 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13795 const char *folded
= ada_fold_name (user_name
);
13796 const char *encoded
= ada_encode_1 (folded
, false);
13797 if (encoded
!= NULL
)
13798 m_encoded_name
= encoded
;
13800 m_encoded_name
= user_name
.to_string ();
13803 m_encoded_name
= user_name
.to_string ();
13805 /* Handle the 'package Standard' special case. See description
13806 of m_standard_p. */
13807 if (startswith (m_encoded_name
.c_str (), "standard__"))
13809 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13810 m_standard_p
= true;
13813 m_standard_p
= false;
13815 /* If the name contains a ".", then the user is entering a fully
13816 qualified entity name, and the match must not be done in wild
13817 mode. Similarly, if the user wants to complete what looks
13818 like an encoded name, the match must not be done in wild
13819 mode. Also, in the standard__ special case always do
13820 non-wild matching. */
13822 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13825 && user_name
.find ('.') == std::string::npos
);
13829 /* symbol_name_matcher_ftype method for Ada. This only handles
13830 completion mode. */
13833 ada_symbol_name_matches (const char *symbol_search_name
,
13834 const lookup_name_info
&lookup_name
,
13835 completion_match_result
*comp_match_res
)
13837 return lookup_name
.ada ().matches (symbol_search_name
,
13838 lookup_name
.match_type (),
13842 /* A name matcher that matches the symbol name exactly, with
13846 literal_symbol_name_matcher (const char *symbol_search_name
,
13847 const lookup_name_info
&lookup_name
,
13848 completion_match_result
*comp_match_res
)
13850 gdb::string_view name_view
= lookup_name
.name ();
13852 if (lookup_name
.completion_mode ()
13853 ? (strncmp (symbol_search_name
, name_view
.data (),
13854 name_view
.size ()) == 0)
13855 : symbol_search_name
== name_view
)
13857 if (comp_match_res
!= NULL
)
13858 comp_match_res
->set_match (symbol_search_name
);
13865 /* Implement the "la_get_symbol_name_matcher" language_defn method for
13868 static symbol_name_matcher_ftype
*
13869 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
13871 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
13872 return literal_symbol_name_matcher
;
13874 if (lookup_name
.completion_mode ())
13875 return ada_symbol_name_matches
;
13878 if (lookup_name
.ada ().wild_match_p ())
13879 return do_wild_match
;
13880 else if (lookup_name
.ada ().verbatim_p ())
13881 return do_exact_match
;
13883 return do_full_match
;
13887 static const char *ada_extensions
[] =
13889 ".adb", ".ads", ".a", ".ada", ".dg", NULL
13892 /* Constant data that describes the Ada language. */
13894 extern const struct language_data ada_language_data
=
13896 "ada", /* Language name */
13900 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13901 that's not quite what this means. */
13903 macro_expansion_no
,
13905 &ada_exp_descriptor
,
13908 ada_printchar
, /* Print a character constant */
13909 ada_printstr
, /* Function to print string constant */
13910 emit_char
, /* Function to print single char (not used) */
13911 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13912 ada_value_print_inner
, /* la_value_print_inner */
13913 ada_value_print
, /* Print a top-level value */
13914 NULL
, /* name_of_this */
13915 true, /* la_store_sym_names_in_linkage_form_p */
13916 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13917 NULL
, /* Language specific
13918 class_name_from_physname */
13919 ada_op_print_tab
, /* expression operators for printing */
13920 0, /* c-style arrays */
13921 1, /* String lower bound */
13922 ada_get_gdb_completer_word_break_characters
,
13923 ada_collect_symbol_completion_matches
,
13924 ada_watch_location_expression
,
13925 ada_get_symbol_name_matcher
, /* la_get_symbol_name_matcher */
13928 ada_is_string_type
,
13929 "(...)" /* la_struct_too_deep_ellipsis */
13932 /* Class representing the Ada language. */
13934 class ada_language
: public language_defn
13938 : language_defn (language_ada
, ada_language_data
)
13941 /* Print an array element index using the Ada syntax. */
13943 void print_array_index (struct type
*index_type
,
13945 struct ui_file
*stream
,
13946 const value_print_options
*options
) const override
13948 struct value
*index_value
= val_atr (index_type
, index
);
13950 LA_VALUE_PRINT (index_value
, stream
, options
);
13951 fprintf_filtered (stream
, " => ");
13954 /* Implement the "read_var_value" language_defn method for Ada. */
13956 struct value
*read_var_value (struct symbol
*var
,
13957 const struct block
*var_block
,
13958 struct frame_info
*frame
) const override
13960 /* The only case where default_read_var_value is not sufficient
13961 is when VAR is a renaming... */
13962 if (frame
!= nullptr)
13964 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
13965 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
13966 return ada_read_renaming_var_value (var
, frame_block
);
13969 /* This is a typical case where we expect the default_read_var_value
13970 function to work. */
13971 return language_defn::read_var_value (var
, var_block
, frame
);
13974 /* See language.h. */
13975 void language_arch_info (struct gdbarch
*gdbarch
,
13976 struct language_arch_info
*lai
) const override
13978 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13980 lai
->primitive_type_vector
13981 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13984 lai
->primitive_type_vector
[ada_primitive_type_int
]
13985 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13987 lai
->primitive_type_vector
[ada_primitive_type_long
]
13988 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13989 0, "long_integer");
13990 lai
->primitive_type_vector
[ada_primitive_type_short
]
13991 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13992 0, "short_integer");
13993 lai
->string_char_type
13994 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13995 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13996 lai
->primitive_type_vector
[ada_primitive_type_float
]
13997 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13998 "float", gdbarch_float_format (gdbarch
));
13999 lai
->primitive_type_vector
[ada_primitive_type_double
]
14000 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
14001 "long_float", gdbarch_double_format (gdbarch
));
14002 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
14003 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
14004 0, "long_long_integer");
14005 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
14006 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
14007 "long_long_float", gdbarch_long_double_format (gdbarch
));
14008 lai
->primitive_type_vector
[ada_primitive_type_natural
]
14009 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
14011 lai
->primitive_type_vector
[ada_primitive_type_positive
]
14012 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
14014 lai
->primitive_type_vector
[ada_primitive_type_void
]
14015 = builtin
->builtin_void
;
14017 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
14018 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
14020 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
14021 ->set_name ("system__address");
14023 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
14024 type. This is a signed integral type whose size is the same as
14025 the size of addresses. */
14027 unsigned int addr_length
= TYPE_LENGTH
14028 (lai
->primitive_type_vector
[ada_primitive_type_system_address
]);
14030 lai
->primitive_type_vector
[ada_primitive_type_storage_offset
]
14031 = arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
14035 lai
->bool_type_symbol
= NULL
;
14036 lai
->bool_type_default
= builtin
->builtin_bool
;
14039 /* See language.h. */
14041 bool iterate_over_symbols
14042 (const struct block
*block
, const lookup_name_info
&name
,
14043 domain_enum domain
,
14044 gdb::function_view
<symbol_found_callback_ftype
> callback
) const override
14046 std::vector
<struct block_symbol
> results
;
14048 ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
14049 for (block_symbol
&sym
: results
)
14051 if (!callback (&sym
))
14058 /* See language.h. */
14059 bool sniff_from_mangled_name (const char *mangled
,
14060 char **out
) const override
14062 std::string demangled
= ada_decode (mangled
);
14066 if (demangled
!= mangled
&& demangled
[0] != '<')
14068 /* Set the gsymbol language to Ada, but still return 0.
14069 Two reasons for that:
14071 1. For Ada, we prefer computing the symbol's decoded name
14072 on the fly rather than pre-compute it, in order to save
14073 memory (Ada projects are typically very large).
14075 2. There are some areas in the definition of the GNAT
14076 encoding where, with a bit of bad luck, we might be able
14077 to decode a non-Ada symbol, generating an incorrect
14078 demangled name (Eg: names ending with "TB" for instance
14079 are identified as task bodies and so stripped from
14080 the decoded name returned).
14082 Returning true, here, but not setting *DEMANGLED, helps us get
14083 a little bit of the best of both worlds. Because we're last,
14084 we should not affect any of the other languages that were
14085 able to demangle the symbol before us; we get to correctly
14086 tag Ada symbols as such; and even if we incorrectly tagged a
14087 non-Ada symbol, which should be rare, any routing through the
14088 Ada language should be transparent (Ada tries to behave much
14089 like C/C++ with non-Ada symbols). */
14096 /* See language.h. */
14098 char *demangle (const char *mangled
, int options
) const override
14100 return ada_la_decode (mangled
, options
);
14103 /* See language.h. */
14105 void print_type (struct type
*type
, const char *varstring
,
14106 struct ui_file
*stream
, int show
, int level
,
14107 const struct type_print_options
*flags
) const override
14109 ada_print_type (type
, varstring
, stream
, show
, level
, flags
);
14113 /* Single instance of the Ada language class. */
14115 static ada_language ada_language_defn
;
14117 /* Command-list for the "set/show ada" prefix command. */
14118 static struct cmd_list_element
*set_ada_list
;
14119 static struct cmd_list_element
*show_ada_list
;
14122 initialize_ada_catchpoint_ops (void)
14124 struct breakpoint_ops
*ops
;
14126 initialize_breakpoint_ops ();
14128 ops
= &catch_exception_breakpoint_ops
;
14129 *ops
= bkpt_breakpoint_ops
;
14130 ops
->allocate_location
= allocate_location_exception
;
14131 ops
->re_set
= re_set_exception
;
14132 ops
->check_status
= check_status_exception
;
14133 ops
->print_it
= print_it_exception
;
14134 ops
->print_one
= print_one_exception
;
14135 ops
->print_mention
= print_mention_exception
;
14136 ops
->print_recreate
= print_recreate_exception
;
14138 ops
= &catch_exception_unhandled_breakpoint_ops
;
14139 *ops
= bkpt_breakpoint_ops
;
14140 ops
->allocate_location
= allocate_location_exception
;
14141 ops
->re_set
= re_set_exception
;
14142 ops
->check_status
= check_status_exception
;
14143 ops
->print_it
= print_it_exception
;
14144 ops
->print_one
= print_one_exception
;
14145 ops
->print_mention
= print_mention_exception
;
14146 ops
->print_recreate
= print_recreate_exception
;
14148 ops
= &catch_assert_breakpoint_ops
;
14149 *ops
= bkpt_breakpoint_ops
;
14150 ops
->allocate_location
= allocate_location_exception
;
14151 ops
->re_set
= re_set_exception
;
14152 ops
->check_status
= check_status_exception
;
14153 ops
->print_it
= print_it_exception
;
14154 ops
->print_one
= print_one_exception
;
14155 ops
->print_mention
= print_mention_exception
;
14156 ops
->print_recreate
= print_recreate_exception
;
14158 ops
= &catch_handlers_breakpoint_ops
;
14159 *ops
= bkpt_breakpoint_ops
;
14160 ops
->allocate_location
= allocate_location_exception
;
14161 ops
->re_set
= re_set_exception
;
14162 ops
->check_status
= check_status_exception
;
14163 ops
->print_it
= print_it_exception
;
14164 ops
->print_one
= print_one_exception
;
14165 ops
->print_mention
= print_mention_exception
;
14166 ops
->print_recreate
= print_recreate_exception
;
14169 /* This module's 'new_objfile' observer. */
14172 ada_new_objfile_observer (struct objfile
*objfile
)
14174 ada_clear_symbol_cache ();
14177 /* This module's 'free_objfile' observer. */
14180 ada_free_objfile_observer (struct objfile
*objfile
)
14182 ada_clear_symbol_cache ();
14185 void _initialize_ada_language ();
14187 _initialize_ada_language ()
14189 initialize_ada_catchpoint_ops ();
14191 add_basic_prefix_cmd ("ada", no_class
,
14192 _("Prefix command for changing Ada-specific settings."),
14193 &set_ada_list
, "set ada ", 0, &setlist
);
14195 add_show_prefix_cmd ("ada", no_class
,
14196 _("Generic command for showing Ada-specific settings."),
14197 &show_ada_list
, "show ada ", 0, &showlist
);
14199 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14200 &trust_pad_over_xvs
, _("\
14201 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14202 Show whether an optimization trusting PAD types over XVS types is activated."),
14204 This is related to the encoding used by the GNAT compiler. The debugger\n\
14205 should normally trust the contents of PAD types, but certain older versions\n\
14206 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14207 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14208 work around this bug. It is always safe to turn this option \"off\", but\n\
14209 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14210 this option to \"off\" unless necessary."),
14211 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14213 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14214 &print_signatures
, _("\
14215 Enable or disable the output of formal and return types for functions in the \
14216 overloads selection menu."), _("\
14217 Show whether the output of formal and return types for functions in the \
14218 overloads selection menu is activated."),
14219 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14221 add_catch_command ("exception", _("\
14222 Catch Ada exceptions, when raised.\n\
14223 Usage: catch exception [ARG] [if CONDITION]\n\
14224 Without any argument, stop when any Ada exception is raised.\n\
14225 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14226 being raised does not have a handler (and will therefore lead to the task's\n\
14228 Otherwise, the catchpoint only stops when the name of the exception being\n\
14229 raised is the same as ARG.\n\
14230 CONDITION is a boolean expression that is evaluated to see whether the\n\
14231 exception should cause a stop."),
14232 catch_ada_exception_command
,
14233 catch_ada_completer
,
14237 add_catch_command ("handlers", _("\
14238 Catch Ada exceptions, when handled.\n\
14239 Usage: catch handlers [ARG] [if CONDITION]\n\
14240 Without any argument, stop when any Ada exception is handled.\n\
14241 With an argument, catch only exceptions with the given name.\n\
14242 CONDITION is a boolean expression that is evaluated to see whether the\n\
14243 exception should cause a stop."),
14244 catch_ada_handlers_command
,
14245 catch_ada_completer
,
14248 add_catch_command ("assert", _("\
14249 Catch failed Ada assertions, when raised.\n\
14250 Usage: catch assert [if CONDITION]\n\
14251 CONDITION is a boolean expression that is evaluated to see whether the\n\
14252 exception should cause a stop."),
14253 catch_assert_command
,
14258 varsize_limit
= 65536;
14259 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14260 &varsize_limit
, _("\
14261 Set the maximum number of bytes allowed in a variable-size object."), _("\
14262 Show the maximum number of bytes allowed in a variable-size object."), _("\
14263 Attempts to access an object whose size is not a compile-time constant\n\
14264 and exceeds this limit will cause an error."),
14265 NULL
, NULL
, &setlist
, &showlist
);
14267 add_info ("exceptions", info_exceptions_command
,
14269 List all Ada exception names.\n\
14270 Usage: info exceptions [REGEXP]\n\
14271 If a regular expression is passed as an argument, only those matching\n\
14272 the regular expression are listed."));
14274 add_basic_prefix_cmd ("ada", class_maintenance
,
14275 _("Set Ada maintenance-related variables."),
14276 &maint_set_ada_cmdlist
, "maintenance set ada ",
14277 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14279 add_show_prefix_cmd ("ada", class_maintenance
,
14280 _("Show Ada maintenance-related variables."),
14281 &maint_show_ada_cmdlist
, "maintenance show ada ",
14282 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14284 add_setshow_boolean_cmd
14285 ("ignore-descriptive-types", class_maintenance
,
14286 &ada_ignore_descriptive_types_p
,
14287 _("Set whether descriptive types generated by GNAT should be ignored."),
14288 _("Show whether descriptive types generated by GNAT should be ignored."),
14290 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14291 DWARF attribute."),
14292 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14294 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14295 NULL
, xcalloc
, xfree
);
14297 /* The ada-lang observers. */
14298 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14299 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14300 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);