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
*value_val_atr (struct type
*, struct value
*);
201 static struct symbol
*standard_lookup (const char *, const struct block
*,
204 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
207 static int find_struct_field (const char *, struct type
*, int,
208 struct type
**, int *, int *, int *, int *);
210 static int ada_resolve_function (struct block_symbol
*, int,
211 struct value
**, int, const char *,
214 static int ada_is_direct_array_type (struct type
*);
216 static void ada_language_arch_info (struct gdbarch
*,
217 struct language_arch_info
*);
219 static struct value
*ada_index_struct_field (int, struct value
*, int,
222 static struct value
*assign_aggregate (struct value
*, struct value
*,
226 static void aggregate_assign_from_choices (struct value
*, struct value
*,
228 int *, LONGEST
*, int *,
229 int, LONGEST
, LONGEST
);
231 static void aggregate_assign_positional (struct value
*, struct value
*,
233 int *, LONGEST
*, int *, int,
237 static void aggregate_assign_others (struct value
*, struct value
*,
239 int *, LONGEST
*, int, LONGEST
, LONGEST
);
242 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
245 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
248 static void ada_forward_operator_length (struct expression
*, int, int *,
251 static struct type
*ada_find_any_type (const char *name
);
253 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
254 (const lookup_name_info
&lookup_name
);
258 /* The result of a symbol lookup to be stored in our symbol cache. */
262 /* The name used to perform the lookup. */
264 /* The namespace used during the lookup. */
266 /* The symbol returned by the lookup, or NULL if no matching symbol
269 /* The block where the symbol was found, or NULL if no matching
271 const struct block
*block
;
272 /* A pointer to the next entry with the same hash. */
273 struct cache_entry
*next
;
276 /* The Ada symbol cache, used to store the result of Ada-mode symbol
277 lookups in the course of executing the user's commands.
279 The cache is implemented using a simple, fixed-sized hash.
280 The size is fixed on the grounds that there are not likely to be
281 all that many symbols looked up during any given session, regardless
282 of the size of the symbol table. If we decide to go to a resizable
283 table, let's just use the stuff from libiberty instead. */
285 #define HASH_SIZE 1009
287 struct ada_symbol_cache
289 /* An obstack used to store the entries in our cache. */
290 struct obstack cache_space
;
292 /* The root of the hash table used to implement our symbol cache. */
293 struct cache_entry
*root
[HASH_SIZE
];
296 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
298 /* Maximum-sized dynamic type. */
299 static unsigned int varsize_limit
;
301 static const char ada_completer_word_break_characters
[] =
303 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
305 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
308 /* The name of the symbol to use to get the name of the main subprogram. */
309 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
310 = "__gnat_ada_main_program_name";
312 /* Limit on the number of warnings to raise per expression evaluation. */
313 static int warning_limit
= 2;
315 /* Number of warning messages issued; reset to 0 by cleanups after
316 expression evaluation. */
317 static int warnings_issued
= 0;
319 static const char *known_runtime_file_name_patterns
[] = {
320 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
323 static const char *known_auxiliary_function_name_patterns
[] = {
324 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
327 /* Maintenance-related settings for this module. */
329 static struct cmd_list_element
*maint_set_ada_cmdlist
;
330 static struct cmd_list_element
*maint_show_ada_cmdlist
;
332 /* The "maintenance ada set/show ignore-descriptive-type" value. */
334 static bool ada_ignore_descriptive_types_p
= false;
336 /* Inferior-specific data. */
338 /* Per-inferior data for this module. */
340 struct ada_inferior_data
342 /* The ada__tags__type_specific_data type, which is used when decoding
343 tagged types. With older versions of GNAT, this type was directly
344 accessible through a component ("tsd") in the object tag. But this
345 is no longer the case, so we cache it for each inferior. */
346 struct type
*tsd_type
= nullptr;
348 /* The exception_support_info data. This data is used to determine
349 how to implement support for Ada exception catchpoints in a given
351 const struct exception_support_info
*exception_info
= nullptr;
354 /* Our key to this module's inferior data. */
355 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
357 /* Return our inferior data for the given inferior (INF).
359 This function always returns a valid pointer to an allocated
360 ada_inferior_data structure. If INF's inferior data has not
361 been previously set, this functions creates a new one with all
362 fields set to zero, sets INF's inferior to it, and then returns
363 a pointer to that newly allocated ada_inferior_data. */
365 static struct ada_inferior_data
*
366 get_ada_inferior_data (struct inferior
*inf
)
368 struct ada_inferior_data
*data
;
370 data
= ada_inferior_data
.get (inf
);
372 data
= ada_inferior_data
.emplace (inf
);
377 /* Perform all necessary cleanups regarding our module's inferior data
378 that is required after the inferior INF just exited. */
381 ada_inferior_exit (struct inferior
*inf
)
383 ada_inferior_data
.clear (inf
);
387 /* program-space-specific data. */
389 /* This module's per-program-space data. */
390 struct ada_pspace_data
394 if (sym_cache
!= NULL
)
395 ada_free_symbol_cache (sym_cache
);
398 /* The Ada symbol cache. */
399 struct ada_symbol_cache
*sym_cache
= nullptr;
402 /* Key to our per-program-space data. */
403 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
405 /* Return this module's data for the given program space (PSPACE).
406 If not is found, add a zero'ed one now.
408 This function always returns a valid object. */
410 static struct ada_pspace_data
*
411 get_ada_pspace_data (struct program_space
*pspace
)
413 struct ada_pspace_data
*data
;
415 data
= ada_pspace_data_handle
.get (pspace
);
417 data
= ada_pspace_data_handle
.emplace (pspace
);
424 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
425 all typedef layers have been peeled. Otherwise, return TYPE.
427 Normally, we really expect a typedef type to only have 1 typedef layer.
428 In other words, we really expect the target type of a typedef type to be
429 a non-typedef type. This is particularly true for Ada units, because
430 the language does not have a typedef vs not-typedef distinction.
431 In that respect, the Ada compiler has been trying to eliminate as many
432 typedef definitions in the debugging information, since they generally
433 do not bring any extra information (we still use typedef under certain
434 circumstances related mostly to the GNAT encoding).
436 Unfortunately, we have seen situations where the debugging information
437 generated by the compiler leads to such multiple typedef layers. For
438 instance, consider the following example with stabs:
440 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
441 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
443 This is an error in the debugging information which causes type
444 pck__float_array___XUP to be defined twice, and the second time,
445 it is defined as a typedef of a typedef.
447 This is on the fringe of legality as far as debugging information is
448 concerned, and certainly unexpected. But it is easy to handle these
449 situations correctly, so we can afford to be lenient in this case. */
452 ada_typedef_target_type (struct type
*type
)
454 while (type
->code () == TYPE_CODE_TYPEDEF
)
455 type
= TYPE_TARGET_TYPE (type
);
459 /* Given DECODED_NAME a string holding a symbol name in its
460 decoded form (ie using the Ada dotted notation), returns
461 its unqualified name. */
464 ada_unqualified_name (const char *decoded_name
)
468 /* If the decoded name starts with '<', it means that the encoded
469 name does not follow standard naming conventions, and thus that
470 it is not your typical Ada symbol name. Trying to unqualify it
471 is therefore pointless and possibly erroneous. */
472 if (decoded_name
[0] == '<')
475 result
= strrchr (decoded_name
, '.');
477 result
++; /* Skip the dot... */
479 result
= decoded_name
;
484 /* Return a string starting with '<', followed by STR, and '>'. */
487 add_angle_brackets (const char *str
)
489 return string_printf ("<%s>", str
);
493 ada_get_gdb_completer_word_break_characters (void)
495 return ada_completer_word_break_characters
;
498 /* Print an array element index using the Ada syntax. */
501 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
502 const struct value_print_options
*options
)
504 LA_VALUE_PRINT (index_value
, stream
, options
);
505 fprintf_filtered (stream
, " => ");
508 /* la_watch_location_expression for Ada. */
510 static gdb::unique_xmalloc_ptr
<char>
511 ada_watch_location_expression (struct type
*type
, CORE_ADDR addr
)
513 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
514 std::string name
= type_to_string (type
);
515 return gdb::unique_xmalloc_ptr
<char>
516 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
519 /* Assuming V points to an array of S objects, make sure that it contains at
520 least M objects, updating V and S as necessary. */
522 #define GROW_VECT(v, s, m) \
523 if ((s) < (m)) (v) = (char *) grow_vect (v, &(s), m, sizeof *(v));
525 /* Assuming VECT points to an array of *SIZE objects of size
526 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
527 updating *SIZE as necessary and returning the (new) array. */
530 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
532 if (*size
< min_size
)
535 if (*size
< min_size
)
537 vect
= xrealloc (vect
, *size
* element_size
);
542 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
543 suffix of FIELD_NAME beginning "___". */
546 field_name_match (const char *field_name
, const char *target
)
548 int len
= strlen (target
);
551 (strncmp (field_name
, target
, len
) == 0
552 && (field_name
[len
] == '\0'
553 || (startswith (field_name
+ len
, "___")
554 && strcmp (field_name
+ strlen (field_name
) - 6,
559 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
560 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
561 and return its index. This function also handles fields whose name
562 have ___ suffixes because the compiler sometimes alters their name
563 by adding such a suffix to represent fields with certain constraints.
564 If the field could not be found, return a negative number if
565 MAYBE_MISSING is set. Otherwise raise an error. */
568 ada_get_field_index (const struct type
*type
, const char *field_name
,
572 struct type
*struct_type
= check_typedef ((struct type
*) type
);
574 for (fieldno
= 0; fieldno
< struct_type
->num_fields (); fieldno
++)
575 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
579 error (_("Unable to find field %s in struct %s. Aborting"),
580 field_name
, struct_type
->name ());
585 /* The length of the prefix of NAME prior to any "___" suffix. */
588 ada_name_prefix_len (const char *name
)
594 const char *p
= strstr (name
, "___");
597 return strlen (name
);
603 /* Return non-zero if SUFFIX is a suffix of STR.
604 Return zero if STR is null. */
607 is_suffix (const char *str
, const char *suffix
)
614 len2
= strlen (suffix
);
615 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
618 /* The contents of value VAL, treated as a value of type TYPE. The
619 result is an lval in memory if VAL is. */
621 static struct value
*
622 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
624 type
= ada_check_typedef (type
);
625 if (value_type (val
) == type
)
629 struct value
*result
;
631 /* Make sure that the object size is not unreasonable before
632 trying to allocate some memory for it. */
633 ada_ensure_varsize_limit (type
);
636 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
637 result
= allocate_value_lazy (type
);
640 result
= allocate_value (type
);
641 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
643 set_value_component_location (result
, val
);
644 set_value_bitsize (result
, value_bitsize (val
));
645 set_value_bitpos (result
, value_bitpos (val
));
646 if (VALUE_LVAL (result
) == lval_memory
)
647 set_value_address (result
, value_address (val
));
652 static const gdb_byte
*
653 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
658 return valaddr
+ offset
;
662 cond_offset_target (CORE_ADDR address
, long offset
)
667 return address
+ offset
;
670 /* Issue a warning (as for the definition of warning in utils.c, but
671 with exactly one argument rather than ...), unless the limit on the
672 number of warnings has passed during the evaluation of the current
675 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
676 provided by "complaint". */
677 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
680 lim_warning (const char *format
, ...)
684 va_start (args
, format
);
685 warnings_issued
+= 1;
686 if (warnings_issued
<= warning_limit
)
687 vwarning (format
, args
);
692 /* Issue an error if the size of an object of type T is unreasonable,
693 i.e. if it would be a bad idea to allocate a value of this type in
697 ada_ensure_varsize_limit (const struct type
*type
)
699 if (TYPE_LENGTH (type
) > varsize_limit
)
700 error (_("object size is larger than varsize-limit"));
703 /* Maximum value of a SIZE-byte signed integer type. */
705 max_of_size (int size
)
707 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
709 return top_bit
| (top_bit
- 1);
712 /* Minimum value of a SIZE-byte signed integer type. */
714 min_of_size (int size
)
716 return -max_of_size (size
) - 1;
719 /* Maximum value of a SIZE-byte unsigned integer type. */
721 umax_of_size (int size
)
723 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
725 return top_bit
| (top_bit
- 1);
728 /* Maximum value of integral type T, as a signed quantity. */
730 max_of_type (struct type
*t
)
732 if (TYPE_UNSIGNED (t
))
733 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
735 return max_of_size (TYPE_LENGTH (t
));
738 /* Minimum value of integral type T, as a signed quantity. */
740 min_of_type (struct type
*t
)
742 if (TYPE_UNSIGNED (t
))
745 return min_of_size (TYPE_LENGTH (t
));
748 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
750 ada_discrete_type_high_bound (struct type
*type
)
752 type
= resolve_dynamic_type (type
, {}, 0);
753 switch (type
->code ())
755 case TYPE_CODE_RANGE
:
756 return TYPE_HIGH_BOUND (type
);
758 return TYPE_FIELD_ENUMVAL (type
, type
->num_fields () - 1);
763 return max_of_type (type
);
765 error (_("Unexpected type in ada_discrete_type_high_bound."));
769 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
771 ada_discrete_type_low_bound (struct type
*type
)
773 type
= resolve_dynamic_type (type
, {}, 0);
774 switch (type
->code ())
776 case TYPE_CODE_RANGE
:
777 return TYPE_LOW_BOUND (type
);
779 return TYPE_FIELD_ENUMVAL (type
, 0);
784 return min_of_type (type
);
786 error (_("Unexpected type in ada_discrete_type_low_bound."));
790 /* The identity on non-range types. For range types, the underlying
791 non-range scalar type. */
794 get_base_type (struct type
*type
)
796 while (type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
)
798 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
800 type
= TYPE_TARGET_TYPE (type
);
805 /* Return a decoded version of the given VALUE. This means returning
806 a value whose type is obtained by applying all the GNAT-specific
807 encodings, making the resulting type a static but standard description
808 of the initial type. */
811 ada_get_decoded_value (struct value
*value
)
813 struct type
*type
= ada_check_typedef (value_type (value
));
815 if (ada_is_array_descriptor_type (type
)
816 || (ada_is_constrained_packed_array_type (type
)
817 && type
->code () != TYPE_CODE_PTR
))
819 if (type
->code () == TYPE_CODE_TYPEDEF
) /* array access type. */
820 value
= ada_coerce_to_simple_array_ptr (value
);
822 value
= ada_coerce_to_simple_array (value
);
825 value
= ada_to_fixed_value (value
);
830 /* Same as ada_get_decoded_value, but with the given TYPE.
831 Because there is no associated actual value for this type,
832 the resulting type might be a best-effort approximation in
833 the case of dynamic types. */
836 ada_get_decoded_type (struct type
*type
)
838 type
= to_static_fixed_type (type
);
839 if (ada_is_constrained_packed_array_type (type
))
840 type
= ada_coerce_to_simple_array_type (type
);
846 /* Language Selection */
848 /* If the main program is in Ada, return language_ada, otherwise return LANG
849 (the main program is in Ada iif the adainit symbol is found). */
852 ada_update_initial_language (enum language lang
)
854 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
860 /* If the main procedure is written in Ada, then return its name.
861 The result is good until the next call. Return NULL if the main
862 procedure doesn't appear to be in Ada. */
867 struct bound_minimal_symbol msym
;
868 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
870 /* For Ada, the name of the main procedure is stored in a specific
871 string constant, generated by the binder. Look for that symbol,
872 extract its address, and then read that string. If we didn't find
873 that string, then most probably the main procedure is not written
875 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
877 if (msym
.minsym
!= NULL
)
879 CORE_ADDR main_program_name_addr
;
882 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
883 if (main_program_name_addr
== 0)
884 error (_("Invalid address for Ada main program name."));
886 target_read_string (main_program_name_addr
, &main_program_name
,
891 return main_program_name
.get ();
894 /* The main procedure doesn't seem to be in Ada. */
900 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
903 const struct ada_opname_map ada_opname_table
[] = {
904 {"Oadd", "\"+\"", BINOP_ADD
},
905 {"Osubtract", "\"-\"", BINOP_SUB
},
906 {"Omultiply", "\"*\"", BINOP_MUL
},
907 {"Odivide", "\"/\"", BINOP_DIV
},
908 {"Omod", "\"mod\"", BINOP_MOD
},
909 {"Orem", "\"rem\"", BINOP_REM
},
910 {"Oexpon", "\"**\"", BINOP_EXP
},
911 {"Olt", "\"<\"", BINOP_LESS
},
912 {"Ole", "\"<=\"", BINOP_LEQ
},
913 {"Ogt", "\">\"", BINOP_GTR
},
914 {"Oge", "\">=\"", BINOP_GEQ
},
915 {"Oeq", "\"=\"", BINOP_EQUAL
},
916 {"One", "\"/=\"", BINOP_NOTEQUAL
},
917 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
918 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
919 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
920 {"Oconcat", "\"&\"", BINOP_CONCAT
},
921 {"Oabs", "\"abs\"", UNOP_ABS
},
922 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
923 {"Oadd", "\"+\"", UNOP_PLUS
},
924 {"Osubtract", "\"-\"", UNOP_NEG
},
928 /* The "encoded" form of DECODED, according to GNAT conventions. The
929 result is valid until the next call to ada_encode. If
930 THROW_ERRORS, throw an error if invalid operator name is found.
931 Otherwise, return NULL in that case. */
934 ada_encode_1 (const char *decoded
, bool throw_errors
)
936 static char *encoding_buffer
= NULL
;
937 static size_t encoding_buffer_size
= 0;
944 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
945 2 * strlen (decoded
) + 10);
948 for (p
= decoded
; *p
!= '\0'; p
+= 1)
952 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
957 const struct ada_opname_map
*mapping
;
959 for (mapping
= ada_opname_table
;
960 mapping
->encoded
!= NULL
961 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
963 if (mapping
->encoded
== NULL
)
966 error (_("invalid Ada operator name: %s"), p
);
970 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
971 k
+= strlen (mapping
->encoded
);
976 encoding_buffer
[k
] = *p
;
981 encoding_buffer
[k
] = '\0';
982 return encoding_buffer
;
985 /* The "encoded" form of DECODED, according to GNAT conventions.
986 The result is valid until the next call to ada_encode. */
989 ada_encode (const char *decoded
)
991 return ada_encode_1 (decoded
, true);
994 /* Return NAME folded to lower case, or, if surrounded by single
995 quotes, unfolded, but with the quotes stripped away. Result good
999 ada_fold_name (gdb::string_view name
)
1001 static char *fold_buffer
= NULL
;
1002 static size_t fold_buffer_size
= 0;
1004 int len
= name
.size ();
1005 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1007 if (name
[0] == '\'')
1009 strncpy (fold_buffer
, name
.data () + 1, len
- 2);
1010 fold_buffer
[len
- 2] = '\000';
1016 for (i
= 0; i
<= len
; i
+= 1)
1017 fold_buffer
[i
] = tolower (name
[i
]);
1023 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1026 is_lower_alphanum (const char c
)
1028 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1031 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1032 This function saves in LEN the length of that same symbol name but
1033 without either of these suffixes:
1039 These are suffixes introduced by the compiler for entities such as
1040 nested subprogram for instance, in order to avoid name clashes.
1041 They do not serve any purpose for the debugger. */
1044 ada_remove_trailing_digits (const char *encoded
, int *len
)
1046 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1050 while (i
> 0 && isdigit (encoded
[i
]))
1052 if (i
>= 0 && encoded
[i
] == '.')
1054 else if (i
>= 0 && encoded
[i
] == '$')
1056 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1058 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1063 /* Remove the suffix introduced by the compiler for protected object
1067 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1069 /* Remove trailing N. */
1071 /* Protected entry subprograms are broken into two
1072 separate subprograms: The first one is unprotected, and has
1073 a 'N' suffix; the second is the protected version, and has
1074 the 'P' suffix. The second calls the first one after handling
1075 the protection. Since the P subprograms are internally generated,
1076 we leave these names undecoded, giving the user a clue that this
1077 entity is internal. */
1080 && encoded
[*len
- 1] == 'N'
1081 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1085 /* If ENCODED follows the GNAT entity encoding conventions, then return
1086 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1087 replaced by ENCODED. */
1090 ada_decode (const char *encoded
)
1096 std::string decoded
;
1098 /* With function descriptors on PPC64, the value of a symbol named
1099 ".FN", if it exists, is the entry point of the function "FN". */
1100 if (encoded
[0] == '.')
1103 /* The name of the Ada main procedure starts with "_ada_".
1104 This prefix is not part of the decoded name, so skip this part
1105 if we see this prefix. */
1106 if (startswith (encoded
, "_ada_"))
1109 /* If the name starts with '_', then it is not a properly encoded
1110 name, so do not attempt to decode it. Similarly, if the name
1111 starts with '<', the name should not be decoded. */
1112 if (encoded
[0] == '_' || encoded
[0] == '<')
1115 len0
= strlen (encoded
);
1117 ada_remove_trailing_digits (encoded
, &len0
);
1118 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1120 /* Remove the ___X.* suffix if present. Do not forget to verify that
1121 the suffix is located before the current "end" of ENCODED. We want
1122 to avoid re-matching parts of ENCODED that have previously been
1123 marked as discarded (by decrementing LEN0). */
1124 p
= strstr (encoded
, "___");
1125 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1133 /* Remove any trailing TKB suffix. It tells us that this symbol
1134 is for the body of a task, but that information does not actually
1135 appear in the decoded name. */
1137 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1140 /* Remove any trailing TB suffix. The TB suffix is slightly different
1141 from the TKB suffix because it is used for non-anonymous task
1144 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1147 /* Remove trailing "B" suffixes. */
1148 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1150 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1153 /* Make decoded big enough for possible expansion by operator name. */
1155 decoded
.resize (2 * len0
+ 1, 'X');
1157 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1159 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1162 while ((i
>= 0 && isdigit (encoded
[i
]))
1163 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1165 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1167 else if (encoded
[i
] == '$')
1171 /* The first few characters that are not alphabetic are not part
1172 of any encoding we use, so we can copy them over verbatim. */
1174 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1175 decoded
[j
] = encoded
[i
];
1180 /* Is this a symbol function? */
1181 if (at_start_name
&& encoded
[i
] == 'O')
1185 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1187 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1188 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1190 && !isalnum (encoded
[i
+ op_len
]))
1192 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1195 j
+= strlen (ada_opname_table
[k
].decoded
);
1199 if (ada_opname_table
[k
].encoded
!= NULL
)
1204 /* Replace "TK__" with "__", which will eventually be translated
1205 into "." (just below). */
1207 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1210 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1211 be translated into "." (just below). These are internal names
1212 generated for anonymous blocks inside which our symbol is nested. */
1214 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1215 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1216 && isdigit (encoded
[i
+4]))
1220 while (k
< len0
&& isdigit (encoded
[k
]))
1221 k
++; /* Skip any extra digit. */
1223 /* Double-check that the "__B_{DIGITS}+" sequence we found
1224 is indeed followed by "__". */
1225 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1229 /* Remove _E{DIGITS}+[sb] */
1231 /* Just as for protected object subprograms, there are 2 categories
1232 of subprograms created by the compiler for each entry. The first
1233 one implements the actual entry code, and has a suffix following
1234 the convention above; the second one implements the barrier and
1235 uses the same convention as above, except that the 'E' is replaced
1238 Just as above, we do not decode the name of barrier functions
1239 to give the user a clue that the code he is debugging has been
1240 internally generated. */
1242 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1243 && isdigit (encoded
[i
+2]))
1247 while (k
< len0
&& isdigit (encoded
[k
]))
1251 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1254 /* Just as an extra precaution, make sure that if this
1255 suffix is followed by anything else, it is a '_'.
1256 Otherwise, we matched this sequence by accident. */
1258 || (k
< len0
&& encoded
[k
] == '_'))
1263 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1264 the GNAT front-end in protected object subprograms. */
1267 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1269 /* Backtrack a bit up until we reach either the begining of
1270 the encoded name, or "__". Make sure that we only find
1271 digits or lowercase characters. */
1272 const char *ptr
= encoded
+ i
- 1;
1274 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1277 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1281 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1283 /* This is a X[bn]* sequence not separated from the previous
1284 part of the name with a non-alpha-numeric character (in other
1285 words, immediately following an alpha-numeric character), then
1286 verify that it is placed at the end of the encoded name. If
1287 not, then the encoding is not valid and we should abort the
1288 decoding. Otherwise, just skip it, it is used in body-nested
1292 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1296 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1298 /* Replace '__' by '.'. */
1306 /* It's a character part of the decoded name, so just copy it
1308 decoded
[j
] = encoded
[i
];
1315 /* Decoded names should never contain any uppercase character.
1316 Double-check this, and abort the decoding if we find one. */
1318 for (i
= 0; i
< decoded
.length(); ++i
)
1319 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1325 if (encoded
[0] == '<')
1328 decoded
= '<' + std::string(encoded
) + '>';
1333 /* Table for keeping permanent unique copies of decoded names. Once
1334 allocated, names in this table are never released. While this is a
1335 storage leak, it should not be significant unless there are massive
1336 changes in the set of decoded names in successive versions of a
1337 symbol table loaded during a single session. */
1338 static struct htab
*decoded_names_store
;
1340 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1341 in the language-specific part of GSYMBOL, if it has not been
1342 previously computed. Tries to save the decoded name in the same
1343 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1344 in any case, the decoded symbol has a lifetime at least that of
1346 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1347 const, but nevertheless modified to a semantically equivalent form
1348 when a decoded name is cached in it. */
1351 ada_decode_symbol (const struct general_symbol_info
*arg
)
1353 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1354 const char **resultp
=
1355 &gsymbol
->language_specific
.demangled_name
;
1357 if (!gsymbol
->ada_mangled
)
1359 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1360 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1362 gsymbol
->ada_mangled
= 1;
1364 if (obstack
!= NULL
)
1365 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1368 /* Sometimes, we can't find a corresponding objfile, in
1369 which case, we put the result on the heap. Since we only
1370 decode when needed, we hope this usually does not cause a
1371 significant memory leak (FIXME). */
1373 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1374 decoded
.c_str (), INSERT
);
1377 *slot
= xstrdup (decoded
.c_str ());
1386 ada_la_decode (const char *encoded
, int options
)
1388 return xstrdup (ada_decode (encoded
).c_str ());
1391 /* Implement la_sniff_from_mangled_name for Ada. */
1394 ada_sniff_from_mangled_name (const char *mangled
, char **out
)
1396 std::string demangled
= ada_decode (mangled
);
1400 if (demangled
!= mangled
&& demangled
[0] != '<')
1402 /* Set the gsymbol language to Ada, but still return 0.
1403 Two reasons for that:
1405 1. For Ada, we prefer computing the symbol's decoded name
1406 on the fly rather than pre-compute it, in order to save
1407 memory (Ada projects are typically very large).
1409 2. There are some areas in the definition of the GNAT
1410 encoding where, with a bit of bad luck, we might be able
1411 to decode a non-Ada symbol, generating an incorrect
1412 demangled name (Eg: names ending with "TB" for instance
1413 are identified as task bodies and so stripped from
1414 the decoded name returned).
1416 Returning 1, here, but not setting *DEMANGLED, helps us get a
1417 little bit of the best of both worlds. Because we're last,
1418 we should not affect any of the other languages that were
1419 able to demangle the symbol before us; we get to correctly
1420 tag Ada symbols as such; and even if we incorrectly tagged a
1421 non-Ada symbol, which should be rare, any routing through the
1422 Ada language should be transparent (Ada tries to behave much
1423 like C/C++ with non-Ada symbols). */
1434 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1435 generated by the GNAT compiler to describe the index type used
1436 for each dimension of an array, check whether it follows the latest
1437 known encoding. If not, fix it up to conform to the latest encoding.
1438 Otherwise, do nothing. This function also does nothing if
1439 INDEX_DESC_TYPE is NULL.
1441 The GNAT encoding used to describe the array index type evolved a bit.
1442 Initially, the information would be provided through the name of each
1443 field of the structure type only, while the type of these fields was
1444 described as unspecified and irrelevant. The debugger was then expected
1445 to perform a global type lookup using the name of that field in order
1446 to get access to the full index type description. Because these global
1447 lookups can be very expensive, the encoding was later enhanced to make
1448 the global lookup unnecessary by defining the field type as being
1449 the full index type description.
1451 The purpose of this routine is to allow us to support older versions
1452 of the compiler by detecting the use of the older encoding, and by
1453 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1454 we essentially replace each field's meaningless type by the associated
1458 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1462 if (index_desc_type
== NULL
)
1464 gdb_assert (index_desc_type
->num_fields () > 0);
1466 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1467 to check one field only, no need to check them all). If not, return
1470 If our INDEX_DESC_TYPE was generated using the older encoding,
1471 the field type should be a meaningless integer type whose name
1472 is not equal to the field name. */
1473 if (TYPE_FIELD_TYPE (index_desc_type
, 0)->name () != NULL
1474 && strcmp (TYPE_FIELD_TYPE (index_desc_type
, 0)->name (),
1475 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1478 /* Fixup each field of INDEX_DESC_TYPE. */
1479 for (i
= 0; i
< index_desc_type
->num_fields (); i
++)
1481 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1482 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1485 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1489 /* The desc_* routines return primitive portions of array descriptors
1492 /* The descriptor or array type, if any, indicated by TYPE; removes
1493 level of indirection, if needed. */
1495 static struct type
*
1496 desc_base_type (struct type
*type
)
1500 type
= ada_check_typedef (type
);
1501 if (type
->code () == TYPE_CODE_TYPEDEF
)
1502 type
= ada_typedef_target_type (type
);
1505 && (type
->code () == TYPE_CODE_PTR
1506 || type
->code () == TYPE_CODE_REF
))
1507 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1512 /* True iff TYPE indicates a "thin" array pointer type. */
1515 is_thin_pntr (struct type
*type
)
1518 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1519 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1522 /* The descriptor type for thin pointer type TYPE. */
1524 static struct type
*
1525 thin_descriptor_type (struct type
*type
)
1527 struct type
*base_type
= desc_base_type (type
);
1529 if (base_type
== NULL
)
1531 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1535 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1537 if (alt_type
== NULL
)
1544 /* A pointer to the array data for thin-pointer value VAL. */
1546 static struct value
*
1547 thin_data_pntr (struct value
*val
)
1549 struct type
*type
= ada_check_typedef (value_type (val
));
1550 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1552 data_type
= lookup_pointer_type (data_type
);
1554 if (type
->code () == TYPE_CODE_PTR
)
1555 return value_cast (data_type
, value_copy (val
));
1557 return value_from_longest (data_type
, value_address (val
));
1560 /* True iff TYPE indicates a "thick" array pointer type. */
1563 is_thick_pntr (struct type
*type
)
1565 type
= desc_base_type (type
);
1566 return (type
!= NULL
&& type
->code () == TYPE_CODE_STRUCT
1567 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1570 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1571 pointer to one, the type of its bounds data; otherwise, NULL. */
1573 static struct type
*
1574 desc_bounds_type (struct type
*type
)
1578 type
= desc_base_type (type
);
1582 else if (is_thin_pntr (type
))
1584 type
= thin_descriptor_type (type
);
1587 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1589 return ada_check_typedef (r
);
1591 else if (type
->code () == TYPE_CODE_STRUCT
)
1593 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1595 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1600 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1601 one, a pointer to its bounds data. Otherwise NULL. */
1603 static struct value
*
1604 desc_bounds (struct value
*arr
)
1606 struct type
*type
= ada_check_typedef (value_type (arr
));
1608 if (is_thin_pntr (type
))
1610 struct type
*bounds_type
=
1611 desc_bounds_type (thin_descriptor_type (type
));
1614 if (bounds_type
== NULL
)
1615 error (_("Bad GNAT array descriptor"));
1617 /* NOTE: The following calculation is not really kosher, but
1618 since desc_type is an XVE-encoded type (and shouldn't be),
1619 the correct calculation is a real pain. FIXME (and fix GCC). */
1620 if (type
->code () == TYPE_CODE_PTR
)
1621 addr
= value_as_long (arr
);
1623 addr
= value_address (arr
);
1626 value_from_longest (lookup_pointer_type (bounds_type
),
1627 addr
- TYPE_LENGTH (bounds_type
));
1630 else if (is_thick_pntr (type
))
1632 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1633 _("Bad GNAT array descriptor"));
1634 struct type
*p_bounds_type
= value_type (p_bounds
);
1637 && p_bounds_type
->code () == TYPE_CODE_PTR
)
1639 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1641 if (TYPE_STUB (target_type
))
1642 p_bounds
= value_cast (lookup_pointer_type
1643 (ada_check_typedef (target_type
)),
1647 error (_("Bad GNAT array descriptor"));
1655 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1656 position of the field containing the address of the bounds data. */
1659 fat_pntr_bounds_bitpos (struct type
*type
)
1661 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1664 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1665 size of the field containing the address of the bounds data. */
1668 fat_pntr_bounds_bitsize (struct type
*type
)
1670 type
= desc_base_type (type
);
1672 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1673 return TYPE_FIELD_BITSIZE (type
, 1);
1675 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1678 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1679 pointer to one, the type of its array data (a array-with-no-bounds type);
1680 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1683 static struct type
*
1684 desc_data_target_type (struct type
*type
)
1686 type
= desc_base_type (type
);
1688 /* NOTE: The following is bogus; see comment in desc_bounds. */
1689 if (is_thin_pntr (type
))
1690 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1691 else if (is_thick_pntr (type
))
1693 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1696 && ada_check_typedef (data_type
)->code () == TYPE_CODE_PTR
)
1697 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1703 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1706 static struct value
*
1707 desc_data (struct value
*arr
)
1709 struct type
*type
= value_type (arr
);
1711 if (is_thin_pntr (type
))
1712 return thin_data_pntr (arr
);
1713 else if (is_thick_pntr (type
))
1714 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1715 _("Bad GNAT array descriptor"));
1721 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1722 position of the field containing the address of the data. */
1725 fat_pntr_data_bitpos (struct type
*type
)
1727 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1730 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1731 size of the field containing the address of the data. */
1734 fat_pntr_data_bitsize (struct type
*type
)
1736 type
= desc_base_type (type
);
1738 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1739 return TYPE_FIELD_BITSIZE (type
, 0);
1741 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1744 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1745 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1746 bound, if WHICH is 1. The first bound is I=1. */
1748 static struct value
*
1749 desc_one_bound (struct value
*bounds
, int i
, int which
)
1751 char bound_name
[20];
1752 xsnprintf (bound_name
, sizeof (bound_name
), "%cB%d",
1753 which
? 'U' : 'L', i
- 1);
1754 return value_struct_elt (&bounds
, NULL
, bound_name
, NULL
,
1755 _("Bad GNAT array descriptor bounds"));
1758 /* If BOUNDS is an array-bounds structure type, return the bit position
1759 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1760 bound, if WHICH is 1. The first bound is I=1. */
1763 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1765 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1768 /* If BOUNDS is an array-bounds structure type, return the bit field size
1769 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1770 bound, if WHICH is 1. The first bound is I=1. */
1773 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1775 type
= desc_base_type (type
);
1777 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1778 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1780 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1783 /* If TYPE is the type of an array-bounds structure, the type of its
1784 Ith bound (numbering from 1). Otherwise, NULL. */
1786 static struct type
*
1787 desc_index_type (struct type
*type
, int i
)
1789 type
= desc_base_type (type
);
1791 if (type
->code () == TYPE_CODE_STRUCT
)
1793 char bound_name
[20];
1794 xsnprintf (bound_name
, sizeof (bound_name
), "LB%d", i
- 1);
1795 return lookup_struct_elt_type (type
, bound_name
, 1);
1801 /* The number of index positions in the array-bounds type TYPE.
1802 Return 0 if TYPE is NULL. */
1805 desc_arity (struct type
*type
)
1807 type
= desc_base_type (type
);
1810 return type
->num_fields () / 2;
1814 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1815 an array descriptor type (representing an unconstrained array
1819 ada_is_direct_array_type (struct type
*type
)
1823 type
= ada_check_typedef (type
);
1824 return (type
->code () == TYPE_CODE_ARRAY
1825 || ada_is_array_descriptor_type (type
));
1828 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1832 ada_is_array_type (struct type
*type
)
1835 && (type
->code () == TYPE_CODE_PTR
1836 || type
->code () == TYPE_CODE_REF
))
1837 type
= TYPE_TARGET_TYPE (type
);
1838 return ada_is_direct_array_type (type
);
1841 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1844 ada_is_simple_array_type (struct type
*type
)
1848 type
= ada_check_typedef (type
);
1849 return (type
->code () == TYPE_CODE_ARRAY
1850 || (type
->code () == TYPE_CODE_PTR
1851 && (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ()
1852 == TYPE_CODE_ARRAY
)));
1855 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1858 ada_is_array_descriptor_type (struct type
*type
)
1860 struct type
*data_type
= desc_data_target_type (type
);
1864 type
= ada_check_typedef (type
);
1865 return (data_type
!= NULL
1866 && data_type
->code () == TYPE_CODE_ARRAY
1867 && desc_arity (desc_bounds_type (type
)) > 0);
1870 /* Non-zero iff type is a partially mal-formed GNAT array
1871 descriptor. FIXME: This is to compensate for some problems with
1872 debugging output from GNAT. Re-examine periodically to see if it
1876 ada_is_bogus_array_descriptor (struct type
*type
)
1880 && type
->code () == TYPE_CODE_STRUCT
1881 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1882 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1883 && !ada_is_array_descriptor_type (type
);
1887 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1888 (fat pointer) returns the type of the array data described---specifically,
1889 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1890 in from the descriptor; otherwise, they are left unspecified. If
1891 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1892 returns NULL. The result is simply the type of ARR if ARR is not
1895 static struct type
*
1896 ada_type_of_array (struct value
*arr
, int bounds
)
1898 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1899 return decode_constrained_packed_array_type (value_type (arr
));
1901 if (!ada_is_array_descriptor_type (value_type (arr
)))
1902 return value_type (arr
);
1906 struct type
*array_type
=
1907 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1909 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1910 TYPE_FIELD_BITSIZE (array_type
, 0) =
1911 decode_packed_array_bitsize (value_type (arr
));
1917 struct type
*elt_type
;
1919 struct value
*descriptor
;
1921 elt_type
= ada_array_element_type (value_type (arr
), -1);
1922 arity
= ada_array_arity (value_type (arr
));
1924 if (elt_type
== NULL
|| arity
== 0)
1925 return ada_check_typedef (value_type (arr
));
1927 descriptor
= desc_bounds (arr
);
1928 if (value_as_long (descriptor
) == 0)
1932 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1933 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1934 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1935 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1938 create_static_range_type (range_type
, value_type (low
),
1939 longest_to_int (value_as_long (low
)),
1940 longest_to_int (value_as_long (high
)));
1941 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1943 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1945 /* We need to store the element packed bitsize, as well as
1946 recompute the array size, because it was previously
1947 computed based on the unpacked element size. */
1948 LONGEST lo
= value_as_long (low
);
1949 LONGEST hi
= value_as_long (high
);
1951 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1952 decode_packed_array_bitsize (value_type (arr
));
1953 /* If the array has no element, then the size is already
1954 zero, and does not need to be recomputed. */
1958 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1960 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1965 return lookup_pointer_type (elt_type
);
1969 /* If ARR does not represent an array, returns ARR unchanged.
1970 Otherwise, returns either a standard GDB array with bounds set
1971 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1972 GDB array. Returns NULL if ARR is a null fat pointer. */
1975 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1977 if (ada_is_array_descriptor_type (value_type (arr
)))
1979 struct type
*arrType
= ada_type_of_array (arr
, 1);
1981 if (arrType
== NULL
)
1983 return value_cast (arrType
, value_copy (desc_data (arr
)));
1985 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1986 return decode_constrained_packed_array (arr
);
1991 /* If ARR does not represent an array, returns ARR unchanged.
1992 Otherwise, returns a standard GDB array describing ARR (which may
1993 be ARR itself if it already is in the proper form). */
1996 ada_coerce_to_simple_array (struct value
*arr
)
1998 if (ada_is_array_descriptor_type (value_type (arr
)))
2000 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2003 error (_("Bounds unavailable for null array pointer."));
2004 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
2005 return value_ind (arrVal
);
2007 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2008 return decode_constrained_packed_array (arr
);
2013 /* If TYPE represents a GNAT array type, return it translated to an
2014 ordinary GDB array type (possibly with BITSIZE fields indicating
2015 packing). For other types, is the identity. */
2018 ada_coerce_to_simple_array_type (struct type
*type
)
2020 if (ada_is_constrained_packed_array_type (type
))
2021 return decode_constrained_packed_array_type (type
);
2023 if (ada_is_array_descriptor_type (type
))
2024 return ada_check_typedef (desc_data_target_type (type
));
2029 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2032 ada_is_packed_array_type (struct type
*type
)
2036 type
= desc_base_type (type
);
2037 type
= ada_check_typedef (type
);
2039 ada_type_name (type
) != NULL
2040 && strstr (ada_type_name (type
), "___XP") != NULL
;
2043 /* Non-zero iff TYPE represents a standard GNAT constrained
2044 packed-array type. */
2047 ada_is_constrained_packed_array_type (struct type
*type
)
2049 return ada_is_packed_array_type (type
)
2050 && !ada_is_array_descriptor_type (type
);
2053 /* Non-zero iff TYPE represents an array descriptor for a
2054 unconstrained packed-array type. */
2057 ada_is_unconstrained_packed_array_type (struct type
*type
)
2059 return ada_is_packed_array_type (type
)
2060 && ada_is_array_descriptor_type (type
);
2063 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2064 return the size of its elements in bits. */
2067 decode_packed_array_bitsize (struct type
*type
)
2069 const char *raw_name
;
2073 /* Access to arrays implemented as fat pointers are encoded as a typedef
2074 of the fat pointer type. We need the name of the fat pointer type
2075 to do the decoding, so strip the typedef layer. */
2076 if (type
->code () == TYPE_CODE_TYPEDEF
)
2077 type
= ada_typedef_target_type (type
);
2079 raw_name
= ada_type_name (ada_check_typedef (type
));
2081 raw_name
= ada_type_name (desc_base_type (type
));
2086 tail
= strstr (raw_name
, "___XP");
2087 gdb_assert (tail
!= NULL
);
2089 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2092 (_("could not understand bit size information on packed array"));
2099 /* Given that TYPE is a standard GDB array type with all bounds filled
2100 in, and that the element size of its ultimate scalar constituents
2101 (that is, either its elements, or, if it is an array of arrays, its
2102 elements' elements, etc.) is *ELT_BITS, return an identical type,
2103 but with the bit sizes of its elements (and those of any
2104 constituent arrays) recorded in the BITSIZE components of its
2105 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2108 Note that, for arrays whose index type has an XA encoding where
2109 a bound references a record discriminant, getting that discriminant,
2110 and therefore the actual value of that bound, is not possible
2111 because none of the given parameters gives us access to the record.
2112 This function assumes that it is OK in the context where it is being
2113 used to return an array whose bounds are still dynamic and where
2114 the length is arbitrary. */
2116 static struct type
*
2117 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2119 struct type
*new_elt_type
;
2120 struct type
*new_type
;
2121 struct type
*index_type_desc
;
2122 struct type
*index_type
;
2123 LONGEST low_bound
, high_bound
;
2125 type
= ada_check_typedef (type
);
2126 if (type
->code () != TYPE_CODE_ARRAY
)
2129 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2130 if (index_type_desc
)
2131 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2134 index_type
= TYPE_INDEX_TYPE (type
);
2136 new_type
= alloc_type_copy (type
);
2138 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2140 create_array_type (new_type
, new_elt_type
, index_type
);
2141 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2142 new_type
->set_name (ada_type_name (type
));
2144 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2145 && is_dynamic_type (check_typedef (index_type
)))
2146 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2147 low_bound
= high_bound
= 0;
2148 if (high_bound
< low_bound
)
2149 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2152 *elt_bits
*= (high_bound
- low_bound
+ 1);
2153 TYPE_LENGTH (new_type
) =
2154 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2157 TYPE_FIXED_INSTANCE (new_type
) = 1;
2161 /* The array type encoded by TYPE, where
2162 ada_is_constrained_packed_array_type (TYPE). */
2164 static struct type
*
2165 decode_constrained_packed_array_type (struct type
*type
)
2167 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2170 struct type
*shadow_type
;
2174 raw_name
= ada_type_name (desc_base_type (type
));
2179 name
= (char *) alloca (strlen (raw_name
) + 1);
2180 tail
= strstr (raw_name
, "___XP");
2181 type
= desc_base_type (type
);
2183 memcpy (name
, raw_name
, tail
- raw_name
);
2184 name
[tail
- raw_name
] = '\000';
2186 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2188 if (shadow_type
== NULL
)
2190 lim_warning (_("could not find bounds information on packed array"));
2193 shadow_type
= check_typedef (shadow_type
);
2195 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2197 lim_warning (_("could not understand bounds "
2198 "information on packed array"));
2202 bits
= decode_packed_array_bitsize (type
);
2203 return constrained_packed_array_type (shadow_type
, &bits
);
2206 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2207 array, returns a simple array that denotes that array. Its type is a
2208 standard GDB array type except that the BITSIZEs of the array
2209 target types are set to the number of bits in each element, and the
2210 type length is set appropriately. */
2212 static struct value
*
2213 decode_constrained_packed_array (struct value
*arr
)
2217 /* If our value is a pointer, then dereference it. Likewise if
2218 the value is a reference. Make sure that this operation does not
2219 cause the target type to be fixed, as this would indirectly cause
2220 this array to be decoded. The rest of the routine assumes that
2221 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2222 and "value_ind" routines to perform the dereferencing, as opposed
2223 to using "ada_coerce_ref" or "ada_value_ind". */
2224 arr
= coerce_ref (arr
);
2225 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2226 arr
= value_ind (arr
);
2228 type
= decode_constrained_packed_array_type (value_type (arr
));
2231 error (_("can't unpack array"));
2235 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2236 && ada_is_modular_type (value_type (arr
)))
2238 /* This is a (right-justified) modular type representing a packed
2239 array with no wrapper. In order to interpret the value through
2240 the (left-justified) packed array type we just built, we must
2241 first left-justify it. */
2242 int bit_size
, bit_pos
;
2245 mod
= ada_modulus (value_type (arr
)) - 1;
2252 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2253 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2254 bit_pos
/ HOST_CHAR_BIT
,
2255 bit_pos
% HOST_CHAR_BIT
,
2260 return coerce_unspec_val_to_type (arr
, type
);
2264 /* The value of the element of packed array ARR at the ARITY indices
2265 given in IND. ARR must be a simple array. */
2267 static struct value
*
2268 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2271 int bits
, elt_off
, bit_off
;
2272 long elt_total_bit_offset
;
2273 struct type
*elt_type
;
2277 elt_total_bit_offset
= 0;
2278 elt_type
= ada_check_typedef (value_type (arr
));
2279 for (i
= 0; i
< arity
; i
+= 1)
2281 if (elt_type
->code () != TYPE_CODE_ARRAY
2282 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2284 (_("attempt to do packed indexing of "
2285 "something other than a packed array"));
2288 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2289 LONGEST lowerbound
, upperbound
;
2292 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2294 lim_warning (_("don't know bounds of array"));
2295 lowerbound
= upperbound
= 0;
2298 idx
= pos_atr (ind
[i
]);
2299 if (idx
< lowerbound
|| idx
> upperbound
)
2300 lim_warning (_("packed array index %ld out of bounds"),
2302 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2303 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2304 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2307 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2308 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2310 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2315 /* Non-zero iff TYPE includes negative integer values. */
2318 has_negatives (struct type
*type
)
2320 switch (type
->code ())
2325 return !TYPE_UNSIGNED (type
);
2326 case TYPE_CODE_RANGE
:
2327 return TYPE_LOW_BOUND (type
) - TYPE_RANGE_DATA (type
)->bias
< 0;
2331 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2332 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2333 the unpacked buffer.
2335 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2336 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2338 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2341 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2343 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2346 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2347 gdb_byte
*unpacked
, int unpacked_len
,
2348 int is_big_endian
, int is_signed_type
,
2351 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2352 int src_idx
; /* Index into the source area */
2353 int src_bytes_left
; /* Number of source bytes left to process. */
2354 int srcBitsLeft
; /* Number of source bits left to move */
2355 int unusedLS
; /* Number of bits in next significant
2356 byte of source that are unused */
2358 int unpacked_idx
; /* Index into the unpacked buffer */
2359 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2361 unsigned long accum
; /* Staging area for bits being transferred */
2362 int accumSize
; /* Number of meaningful bits in accum */
2365 /* Transmit bytes from least to most significant; delta is the direction
2366 the indices move. */
2367 int delta
= is_big_endian
? -1 : 1;
2369 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2371 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2372 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2373 bit_size
, unpacked_len
);
2375 srcBitsLeft
= bit_size
;
2376 src_bytes_left
= src_len
;
2377 unpacked_bytes_left
= unpacked_len
;
2382 src_idx
= src_len
- 1;
2384 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2388 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2394 unpacked_idx
= unpacked_len
- 1;
2398 /* Non-scalar values must be aligned at a byte boundary... */
2400 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2401 /* ... And are placed at the beginning (most-significant) bytes
2403 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2404 unpacked_bytes_left
= unpacked_idx
+ 1;
2409 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2411 src_idx
= unpacked_idx
= 0;
2412 unusedLS
= bit_offset
;
2415 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2420 while (src_bytes_left
> 0)
2422 /* Mask for removing bits of the next source byte that are not
2423 part of the value. */
2424 unsigned int unusedMSMask
=
2425 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2427 /* Sign-extend bits for this byte. */
2428 unsigned int signMask
= sign
& ~unusedMSMask
;
2431 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2432 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2433 if (accumSize
>= HOST_CHAR_BIT
)
2435 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2436 accumSize
-= HOST_CHAR_BIT
;
2437 accum
>>= HOST_CHAR_BIT
;
2438 unpacked_bytes_left
-= 1;
2439 unpacked_idx
+= delta
;
2441 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2443 src_bytes_left
-= 1;
2446 while (unpacked_bytes_left
> 0)
2448 accum
|= sign
<< accumSize
;
2449 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2450 accumSize
-= HOST_CHAR_BIT
;
2453 accum
>>= HOST_CHAR_BIT
;
2454 unpacked_bytes_left
-= 1;
2455 unpacked_idx
+= delta
;
2459 /* Create a new value of type TYPE from the contents of OBJ starting
2460 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2461 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2462 assigning through the result will set the field fetched from.
2463 VALADDR is ignored unless OBJ is NULL, in which case,
2464 VALADDR+OFFSET must address the start of storage containing the
2465 packed value. The value returned in this case is never an lval.
2466 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2469 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2470 long offset
, int bit_offset
, int bit_size
,
2474 const gdb_byte
*src
; /* First byte containing data to unpack */
2476 const int is_scalar
= is_scalar_type (type
);
2477 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2478 gdb::byte_vector staging
;
2480 type
= ada_check_typedef (type
);
2483 src
= valaddr
+ offset
;
2485 src
= value_contents (obj
) + offset
;
2487 if (is_dynamic_type (type
))
2489 /* The length of TYPE might by dynamic, so we need to resolve
2490 TYPE in order to know its actual size, which we then use
2491 to create the contents buffer of the value we return.
2492 The difficulty is that the data containing our object is
2493 packed, and therefore maybe not at a byte boundary. So, what
2494 we do, is unpack the data into a byte-aligned buffer, and then
2495 use that buffer as our object's value for resolving the type. */
2496 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2497 staging
.resize (staging_len
);
2499 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2500 staging
.data (), staging
.size (),
2501 is_big_endian
, has_negatives (type
),
2503 type
= resolve_dynamic_type (type
, staging
, 0);
2504 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2506 /* This happens when the length of the object is dynamic,
2507 and is actually smaller than the space reserved for it.
2508 For instance, in an array of variant records, the bit_size
2509 we're given is the array stride, which is constant and
2510 normally equal to the maximum size of its element.
2511 But, in reality, each element only actually spans a portion
2513 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2519 v
= allocate_value (type
);
2520 src
= valaddr
+ offset
;
2522 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2524 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2527 v
= value_at (type
, value_address (obj
) + offset
);
2528 buf
= (gdb_byte
*) alloca (src_len
);
2529 read_memory (value_address (v
), buf
, src_len
);
2534 v
= allocate_value (type
);
2535 src
= value_contents (obj
) + offset
;
2540 long new_offset
= offset
;
2542 set_value_component_location (v
, obj
);
2543 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2544 set_value_bitsize (v
, bit_size
);
2545 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2548 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2550 set_value_offset (v
, new_offset
);
2552 /* Also set the parent value. This is needed when trying to
2553 assign a new value (in inferior memory). */
2554 set_value_parent (v
, obj
);
2557 set_value_bitsize (v
, bit_size
);
2558 unpacked
= value_contents_writeable (v
);
2562 memset (unpacked
, 0, TYPE_LENGTH (type
));
2566 if (staging
.size () == TYPE_LENGTH (type
))
2568 /* Small short-cut: If we've unpacked the data into a buffer
2569 of the same size as TYPE's length, then we can reuse that,
2570 instead of doing the unpacking again. */
2571 memcpy (unpacked
, staging
.data (), staging
.size ());
2574 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2575 unpacked
, TYPE_LENGTH (type
),
2576 is_big_endian
, has_negatives (type
), is_scalar
);
2581 /* Store the contents of FROMVAL into the location of TOVAL.
2582 Return a new value with the location of TOVAL and contents of
2583 FROMVAL. Handles assignment into packed fields that have
2584 floating-point or non-scalar types. */
2586 static struct value
*
2587 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2589 struct type
*type
= value_type (toval
);
2590 int bits
= value_bitsize (toval
);
2592 toval
= ada_coerce_ref (toval
);
2593 fromval
= ada_coerce_ref (fromval
);
2595 if (ada_is_direct_array_type (value_type (toval
)))
2596 toval
= ada_coerce_to_simple_array (toval
);
2597 if (ada_is_direct_array_type (value_type (fromval
)))
2598 fromval
= ada_coerce_to_simple_array (fromval
);
2600 if (!deprecated_value_modifiable (toval
))
2601 error (_("Left operand of assignment is not a modifiable lvalue."));
2603 if (VALUE_LVAL (toval
) == lval_memory
2605 && (type
->code () == TYPE_CODE_FLT
2606 || type
->code () == TYPE_CODE_STRUCT
))
2608 int len
= (value_bitpos (toval
)
2609 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2611 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2613 CORE_ADDR to_addr
= value_address (toval
);
2615 if (type
->code () == TYPE_CODE_FLT
)
2616 fromval
= value_cast (type
, fromval
);
2618 read_memory (to_addr
, buffer
, len
);
2619 from_size
= value_bitsize (fromval
);
2621 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2623 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2624 ULONGEST from_offset
= 0;
2625 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2626 from_offset
= from_size
- bits
;
2627 copy_bitwise (buffer
, value_bitpos (toval
),
2628 value_contents (fromval
), from_offset
,
2629 bits
, is_big_endian
);
2630 write_memory_with_notification (to_addr
, buffer
, len
);
2632 val
= value_copy (toval
);
2633 memcpy (value_contents_raw (val
), value_contents (fromval
),
2634 TYPE_LENGTH (type
));
2635 deprecated_set_value_type (val
, type
);
2640 return value_assign (toval
, fromval
);
2644 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2645 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2646 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2647 COMPONENT, and not the inferior's memory. The current contents
2648 of COMPONENT are ignored.
2650 Although not part of the initial design, this function also works
2651 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2652 had a null address, and COMPONENT had an address which is equal to
2653 its offset inside CONTAINER. */
2656 value_assign_to_component (struct value
*container
, struct value
*component
,
2659 LONGEST offset_in_container
=
2660 (LONGEST
) (value_address (component
) - value_address (container
));
2661 int bit_offset_in_container
=
2662 value_bitpos (component
) - value_bitpos (container
);
2665 val
= value_cast (value_type (component
), val
);
2667 if (value_bitsize (component
) == 0)
2668 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2670 bits
= value_bitsize (component
);
2672 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2676 if (is_scalar_type (check_typedef (value_type (component
))))
2678 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2681 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2682 value_bitpos (container
) + bit_offset_in_container
,
2683 value_contents (val
), src_offset
, bits
, 1);
2686 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2687 value_bitpos (container
) + bit_offset_in_container
,
2688 value_contents (val
), 0, bits
, 0);
2691 /* Determine if TYPE is an access to an unconstrained array. */
2694 ada_is_access_to_unconstrained_array (struct type
*type
)
2696 return (type
->code () == TYPE_CODE_TYPEDEF
2697 && is_thick_pntr (ada_typedef_target_type (type
)));
2700 /* The value of the element of array ARR at the ARITY indices given in IND.
2701 ARR may be either a simple array, GNAT array descriptor, or pointer
2705 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2709 struct type
*elt_type
;
2711 elt
= ada_coerce_to_simple_array (arr
);
2713 elt_type
= ada_check_typedef (value_type (elt
));
2714 if (elt_type
->code () == TYPE_CODE_ARRAY
2715 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2716 return value_subscript_packed (elt
, arity
, ind
);
2718 for (k
= 0; k
< arity
; k
+= 1)
2720 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2722 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2723 error (_("too many subscripts (%d expected)"), k
);
2725 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2727 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2728 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2730 /* The element is a typedef to an unconstrained array,
2731 except that the value_subscript call stripped the
2732 typedef layer. The typedef layer is GNAT's way to
2733 specify that the element is, at the source level, an
2734 access to the unconstrained array, rather than the
2735 unconstrained array. So, we need to restore that
2736 typedef layer, which we can do by forcing the element's
2737 type back to its original type. Otherwise, the returned
2738 value is going to be printed as the array, rather
2739 than as an access. Another symptom of the same issue
2740 would be that an expression trying to dereference the
2741 element would also be improperly rejected. */
2742 deprecated_set_value_type (elt
, saved_elt_type
);
2745 elt_type
= ada_check_typedef (value_type (elt
));
2751 /* Assuming ARR is a pointer to a GDB array, the value of the element
2752 of *ARR at the ARITY indices given in IND.
2753 Does not read the entire array into memory.
2755 Note: Unlike what one would expect, this function is used instead of
2756 ada_value_subscript for basically all non-packed array types. The reason
2757 for this is that a side effect of doing our own pointer arithmetics instead
2758 of relying on value_subscript is that there is no implicit typedef peeling.
2759 This is important for arrays of array accesses, where it allows us to
2760 preserve the fact that the array's element is an array access, where the
2761 access part os encoded in a typedef layer. */
2763 static struct value
*
2764 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2767 struct value
*array_ind
= ada_value_ind (arr
);
2769 = check_typedef (value_enclosing_type (array_ind
));
2771 if (type
->code () == TYPE_CODE_ARRAY
2772 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2773 return value_subscript_packed (array_ind
, arity
, ind
);
2775 for (k
= 0; k
< arity
; k
+= 1)
2778 struct value
*lwb_value
;
2780 if (type
->code () != TYPE_CODE_ARRAY
)
2781 error (_("too many subscripts (%d expected)"), k
);
2782 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2784 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2785 lwb_value
= value_from_longest (value_type (ind
[k
]), lwb
);
2786 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - pos_atr (lwb_value
));
2787 type
= TYPE_TARGET_TYPE (type
);
2790 return value_ind (arr
);
2793 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2794 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2795 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2796 this array is LOW, as per Ada rules. */
2797 static struct value
*
2798 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2801 struct type
*type0
= ada_check_typedef (type
);
2802 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
));
2803 struct type
*index_type
2804 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2805 struct type
*slice_type
= create_array_type_with_stride
2806 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2807 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2808 TYPE_FIELD_BITSIZE (type0
, 0));
2809 int base_low
= ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
));
2810 LONGEST base_low_pos
, low_pos
;
2813 if (!discrete_position (base_index_type
, low
, &low_pos
)
2814 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2816 warning (_("unable to get positions in slice, use bounds instead"));
2818 base_low_pos
= base_low
;
2821 base
= value_as_address (array_ptr
)
2822 + ((low_pos
- base_low_pos
)
2823 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2824 return value_at_lazy (slice_type
, base
);
2828 static struct value
*
2829 ada_value_slice (struct value
*array
, int low
, int high
)
2831 struct type
*type
= ada_check_typedef (value_type (array
));
2832 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2833 struct type
*index_type
2834 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2835 struct type
*slice_type
= create_array_type_with_stride
2836 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2837 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2838 TYPE_FIELD_BITSIZE (type
, 0));
2839 LONGEST low_pos
, high_pos
;
2841 if (!discrete_position (base_index_type
, low
, &low_pos
)
2842 || !discrete_position (base_index_type
, high
, &high_pos
))
2844 warning (_("unable to get positions in slice, use bounds instead"));
2849 return value_cast (slice_type
,
2850 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2853 /* If type is a record type in the form of a standard GNAT array
2854 descriptor, returns the number of dimensions for type. If arr is a
2855 simple array, returns the number of "array of"s that prefix its
2856 type designation. Otherwise, returns 0. */
2859 ada_array_arity (struct type
*type
)
2866 type
= desc_base_type (type
);
2869 if (type
->code () == TYPE_CODE_STRUCT
)
2870 return desc_arity (desc_bounds_type (type
));
2872 while (type
->code () == TYPE_CODE_ARRAY
)
2875 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2881 /* If TYPE is a record type in the form of a standard GNAT array
2882 descriptor or a simple array type, returns the element type for
2883 TYPE after indexing by NINDICES indices, or by all indices if
2884 NINDICES is -1. Otherwise, returns NULL. */
2887 ada_array_element_type (struct type
*type
, int nindices
)
2889 type
= desc_base_type (type
);
2891 if (type
->code () == TYPE_CODE_STRUCT
)
2894 struct type
*p_array_type
;
2896 p_array_type
= desc_data_target_type (type
);
2898 k
= ada_array_arity (type
);
2902 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2903 if (nindices
>= 0 && k
> nindices
)
2905 while (k
> 0 && p_array_type
!= NULL
)
2907 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2910 return p_array_type
;
2912 else if (type
->code () == TYPE_CODE_ARRAY
)
2914 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2916 type
= TYPE_TARGET_TYPE (type
);
2925 /* The type of nth index in arrays of given type (n numbering from 1).
2926 Does not examine memory. Throws an error if N is invalid or TYPE
2927 is not an array type. NAME is the name of the Ada attribute being
2928 evaluated ('range, 'first, 'last, or 'length); it is used in building
2929 the error message. */
2931 static struct type
*
2932 ada_index_type (struct type
*type
, int n
, const char *name
)
2934 struct type
*result_type
;
2936 type
= desc_base_type (type
);
2938 if (n
< 0 || n
> ada_array_arity (type
))
2939 error (_("invalid dimension number to '%s"), name
);
2941 if (ada_is_simple_array_type (type
))
2945 for (i
= 1; i
< n
; i
+= 1)
2946 type
= TYPE_TARGET_TYPE (type
);
2947 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2948 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2949 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2950 perhaps stabsread.c would make more sense. */
2951 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2956 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2957 if (result_type
== NULL
)
2958 error (_("attempt to take bound of something that is not an array"));
2964 /* Given that arr is an array type, returns the lower bound of the
2965 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2966 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2967 array-descriptor type. It works for other arrays with bounds supplied
2968 by run-time quantities other than discriminants. */
2971 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2973 struct type
*type
, *index_type_desc
, *index_type
;
2976 gdb_assert (which
== 0 || which
== 1);
2978 if (ada_is_constrained_packed_array_type (arr_type
))
2979 arr_type
= decode_constrained_packed_array_type (arr_type
);
2981 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2982 return (LONGEST
) - which
;
2984 if (arr_type
->code () == TYPE_CODE_PTR
)
2985 type
= TYPE_TARGET_TYPE (arr_type
);
2989 if (TYPE_FIXED_INSTANCE (type
))
2991 /* The array has already been fixed, so we do not need to
2992 check the parallel ___XA type again. That encoding has
2993 already been applied, so ignore it now. */
2994 index_type_desc
= NULL
;
2998 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2999 ada_fixup_array_indexes_type (index_type_desc
);
3002 if (index_type_desc
!= NULL
)
3003 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
3007 struct type
*elt_type
= check_typedef (type
);
3009 for (i
= 1; i
< n
; i
++)
3010 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3012 index_type
= TYPE_INDEX_TYPE (elt_type
);
3016 (LONGEST
) (which
== 0
3017 ? ada_discrete_type_low_bound (index_type
)
3018 : ada_discrete_type_high_bound (index_type
));
3021 /* Given that arr is an array value, returns the lower bound of the
3022 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3023 WHICH is 1. This routine will also work for arrays with bounds
3024 supplied by run-time quantities other than discriminants. */
3027 ada_array_bound (struct value
*arr
, int n
, int which
)
3029 struct type
*arr_type
;
3031 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3032 arr
= value_ind (arr
);
3033 arr_type
= value_enclosing_type (arr
);
3035 if (ada_is_constrained_packed_array_type (arr_type
))
3036 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3037 else if (ada_is_simple_array_type (arr_type
))
3038 return ada_array_bound_from_type (arr_type
, n
, which
);
3040 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3043 /* Given that arr is an array value, returns the length of the
3044 nth index. This routine will also work for arrays with bounds
3045 supplied by run-time quantities other than discriminants.
3046 Does not work for arrays indexed by enumeration types with representation
3047 clauses at the moment. */
3050 ada_array_length (struct value
*arr
, int n
)
3052 struct type
*arr_type
, *index_type
;
3055 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3056 arr
= value_ind (arr
);
3057 arr_type
= value_enclosing_type (arr
);
3059 if (ada_is_constrained_packed_array_type (arr_type
))
3060 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3062 if (ada_is_simple_array_type (arr_type
))
3064 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3065 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3069 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3070 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3073 arr_type
= check_typedef (arr_type
);
3074 index_type
= ada_index_type (arr_type
, n
, "length");
3075 if (index_type
!= NULL
)
3077 struct type
*base_type
;
3078 if (index_type
->code () == TYPE_CODE_RANGE
)
3079 base_type
= TYPE_TARGET_TYPE (index_type
);
3081 base_type
= index_type
;
3083 low
= pos_atr (value_from_longest (base_type
, low
));
3084 high
= pos_atr (value_from_longest (base_type
, high
));
3086 return high
- low
+ 1;
3089 /* An array whose type is that of ARR_TYPE (an array type), with
3090 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3091 less than LOW, then LOW-1 is used. */
3093 static struct value
*
3094 empty_array (struct type
*arr_type
, int low
, int high
)
3096 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3097 struct type
*index_type
3098 = create_static_range_type
3099 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
,
3100 high
< low
? low
- 1 : high
);
3101 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3103 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3107 /* Name resolution */
3109 /* The "decoded" name for the user-definable Ada operator corresponding
3113 ada_decoded_op_name (enum exp_opcode op
)
3117 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3119 if (ada_opname_table
[i
].op
== op
)
3120 return ada_opname_table
[i
].decoded
;
3122 error (_("Could not find operator name for opcode"));
3125 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3126 in a listing of choices during disambiguation (see sort_choices, below).
3127 The idea is that overloadings of a subprogram name from the
3128 same package should sort in their source order. We settle for ordering
3129 such symbols by their trailing number (__N or $N). */
3132 encoded_ordered_before (const char *N0
, const char *N1
)
3136 else if (N0
== NULL
)
3142 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3144 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3146 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3147 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3152 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3155 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3157 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3158 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3160 return (strcmp (N0
, N1
) < 0);
3164 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3168 sort_choices (struct block_symbol syms
[], int nsyms
)
3172 for (i
= 1; i
< nsyms
; i
+= 1)
3174 struct block_symbol sym
= syms
[i
];
3177 for (j
= i
- 1; j
>= 0; j
-= 1)
3179 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3180 sym
.symbol
->linkage_name ()))
3182 syms
[j
+ 1] = syms
[j
];
3188 /* Whether GDB should display formals and return types for functions in the
3189 overloads selection menu. */
3190 static bool print_signatures
= true;
3192 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3193 all but functions, the signature is just the name of the symbol. For
3194 functions, this is the name of the function, the list of types for formals
3195 and the return type (if any). */
3198 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3199 const struct type_print_options
*flags
)
3201 struct type
*type
= SYMBOL_TYPE (sym
);
3203 fprintf_filtered (stream
, "%s", sym
->print_name ());
3204 if (!print_signatures
3206 || type
->code () != TYPE_CODE_FUNC
)
3209 if (type
->num_fields () > 0)
3213 fprintf_filtered (stream
, " (");
3214 for (i
= 0; i
< type
->num_fields (); ++i
)
3217 fprintf_filtered (stream
, "; ");
3218 ada_print_type (TYPE_FIELD_TYPE (type
, i
), NULL
, stream
, -1, 0,
3221 fprintf_filtered (stream
, ")");
3223 if (TYPE_TARGET_TYPE (type
) != NULL
3224 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3226 fprintf_filtered (stream
, " return ");
3227 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3231 /* Read and validate a set of numeric choices from the user in the
3232 range 0 .. N_CHOICES-1. Place the results in increasing
3233 order in CHOICES[0 .. N-1], and return N.
3235 The user types choices as a sequence of numbers on one line
3236 separated by blanks, encoding them as follows:
3238 + A choice of 0 means to cancel the selection, throwing an error.
3239 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3240 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3242 The user is not allowed to choose more than MAX_RESULTS values.
3244 ANNOTATION_SUFFIX, if present, is used to annotate the input
3245 prompts (for use with the -f switch). */
3248 get_selections (int *choices
, int n_choices
, int max_results
,
3249 int is_all_choice
, const char *annotation_suffix
)
3254 int first_choice
= is_all_choice
? 2 : 1;
3256 prompt
= getenv ("PS2");
3260 args
= command_line_input (prompt
, annotation_suffix
);
3263 error_no_arg (_("one or more choice numbers"));
3267 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3268 order, as given in args. Choices are validated. */
3274 args
= skip_spaces (args
);
3275 if (*args
== '\0' && n_chosen
== 0)
3276 error_no_arg (_("one or more choice numbers"));
3277 else if (*args
== '\0')
3280 choice
= strtol (args
, &args2
, 10);
3281 if (args
== args2
|| choice
< 0
3282 || choice
> n_choices
+ first_choice
- 1)
3283 error (_("Argument must be choice number"));
3287 error (_("cancelled"));
3289 if (choice
< first_choice
)
3291 n_chosen
= n_choices
;
3292 for (j
= 0; j
< n_choices
; j
+= 1)
3296 choice
-= first_choice
;
3298 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3302 if (j
< 0 || choice
!= choices
[j
])
3306 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3307 choices
[k
+ 1] = choices
[k
];
3308 choices
[j
+ 1] = choice
;
3313 if (n_chosen
> max_results
)
3314 error (_("Select no more than %d of the above"), max_results
);
3319 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3320 by asking the user (if necessary), returning the number selected,
3321 and setting the first elements of SYMS items. Error if no symbols
3324 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3325 to be re-integrated one of these days. */
3328 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3331 int *chosen
= XALLOCAVEC (int , nsyms
);
3333 int first_choice
= (max_results
== 1) ? 1 : 2;
3334 const char *select_mode
= multiple_symbols_select_mode ();
3336 if (max_results
< 1)
3337 error (_("Request to select 0 symbols!"));
3341 if (select_mode
== multiple_symbols_cancel
)
3343 canceled because the command is ambiguous\n\
3344 See set/show multiple-symbol."));
3346 /* If select_mode is "all", then return all possible symbols.
3347 Only do that if more than one symbol can be selected, of course.
3348 Otherwise, display the menu as usual. */
3349 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3352 printf_filtered (_("[0] cancel\n"));
3353 if (max_results
> 1)
3354 printf_filtered (_("[1] all\n"));
3356 sort_choices (syms
, nsyms
);
3358 for (i
= 0; i
< nsyms
; i
+= 1)
3360 if (syms
[i
].symbol
== NULL
)
3363 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3365 struct symtab_and_line sal
=
3366 find_function_start_sal (syms
[i
].symbol
, 1);
3368 printf_filtered ("[%d] ", i
+ first_choice
);
3369 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3370 &type_print_raw_options
);
3371 if (sal
.symtab
== NULL
)
3372 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3373 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3377 styled_string (file_name_style
.style (),
3378 symtab_to_filename_for_display (sal
.symtab
)),
3385 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3386 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3387 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3388 struct symtab
*symtab
= NULL
;
3390 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3391 symtab
= symbol_symtab (syms
[i
].symbol
);
3393 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3395 printf_filtered ("[%d] ", i
+ first_choice
);
3396 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3397 &type_print_raw_options
);
3398 printf_filtered (_(" at %s:%d\n"),
3399 symtab_to_filename_for_display (symtab
),
3400 SYMBOL_LINE (syms
[i
].symbol
));
3402 else if (is_enumeral
3403 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3405 printf_filtered (("[%d] "), i
+ first_choice
);
3406 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3407 gdb_stdout
, -1, 0, &type_print_raw_options
);
3408 printf_filtered (_("'(%s) (enumeral)\n"),
3409 syms
[i
].symbol
->print_name ());
3413 printf_filtered ("[%d] ", i
+ first_choice
);
3414 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3415 &type_print_raw_options
);
3418 printf_filtered (is_enumeral
3419 ? _(" in %s (enumeral)\n")
3421 symtab_to_filename_for_display (symtab
));
3423 printf_filtered (is_enumeral
3424 ? _(" (enumeral)\n")
3430 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3433 for (i
= 0; i
< n_chosen
; i
+= 1)
3434 syms
[i
] = syms
[chosen
[i
]];
3439 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3440 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3441 undefined namespace) and converts operators that are
3442 user-defined into appropriate function calls. If CONTEXT_TYPE is
3443 non-null, it provides a preferred result type [at the moment, only
3444 type void has any effect---causing procedures to be preferred over
3445 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3446 return type is preferred. May change (expand) *EXP. */
3449 resolve (expression_up
*expp
, int void_context_p
, int parse_completion
,
3450 innermost_block_tracker
*tracker
)
3452 struct type
*context_type
= NULL
;
3456 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3458 resolve_subexp (expp
, &pc
, 1, context_type
, parse_completion
, tracker
);
3461 /* Resolve the operator of the subexpression beginning at
3462 position *POS of *EXPP. "Resolving" consists of replacing
3463 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3464 with their resolutions, replacing built-in operators with
3465 function calls to user-defined operators, where appropriate, and,
3466 when DEPROCEDURE_P is non-zero, converting function-valued variables
3467 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3468 are as in ada_resolve, above. */
3470 static struct value
*
3471 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3472 struct type
*context_type
, int parse_completion
,
3473 innermost_block_tracker
*tracker
)
3477 struct expression
*exp
; /* Convenience: == *expp. */
3478 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3479 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3480 int nargs
; /* Number of operands. */
3487 /* Pass one: resolve operands, saving their types and updating *pos,
3492 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3493 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3498 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3500 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3505 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3510 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3511 parse_completion
, tracker
);
3514 case OP_ATR_MODULUS
:
3524 case TERNOP_IN_RANGE
:
3525 case BINOP_IN_BOUNDS
:
3531 case OP_DISCRETE_RANGE
:
3533 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3542 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3544 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3546 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3564 case BINOP_LOGICAL_AND
:
3565 case BINOP_LOGICAL_OR
:
3566 case BINOP_BITWISE_AND
:
3567 case BINOP_BITWISE_IOR
:
3568 case BINOP_BITWISE_XOR
:
3571 case BINOP_NOTEQUAL
:
3578 case BINOP_SUBSCRIPT
:
3586 case UNOP_LOGICAL_NOT
:
3596 case OP_VAR_MSYM_VALUE
:
3603 case OP_INTERNALVAR
:
3613 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3616 case STRUCTOP_STRUCT
:
3617 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3630 error (_("Unexpected operator during name resolution"));
3633 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3634 for (i
= 0; i
< nargs
; i
+= 1)
3635 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
,
3640 /* Pass two: perform any resolution on principal operator. */
3647 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3649 std::vector
<struct block_symbol
> candidates
;
3653 ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3654 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3657 if (n_candidates
> 1)
3659 /* Types tend to get re-introduced locally, so if there
3660 are any local symbols that are not types, first filter
3663 for (j
= 0; j
< n_candidates
; j
+= 1)
3664 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3669 case LOC_REGPARM_ADDR
:
3677 if (j
< n_candidates
)
3680 while (j
< n_candidates
)
3682 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3684 candidates
[j
] = candidates
[n_candidates
- 1];
3693 if (n_candidates
== 0)
3694 error (_("No definition found for %s"),
3695 exp
->elts
[pc
+ 2].symbol
->print_name ());
3696 else if (n_candidates
== 1)
3698 else if (deprocedure_p
3699 && !is_nonfunction (candidates
.data (), n_candidates
))
3701 i
= ada_resolve_function
3702 (candidates
.data (), n_candidates
, NULL
, 0,
3703 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3704 context_type
, parse_completion
);
3706 error (_("Could not find a match for %s"),
3707 exp
->elts
[pc
+ 2].symbol
->print_name ());
3711 printf_filtered (_("Multiple matches for %s\n"),
3712 exp
->elts
[pc
+ 2].symbol
->print_name ());
3713 user_select_syms (candidates
.data (), n_candidates
, 1);
3717 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3718 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3719 tracker
->update (candidates
[i
]);
3723 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3726 replace_operator_with_call (expp
, pc
, 0, 4,
3727 exp
->elts
[pc
+ 2].symbol
,
3728 exp
->elts
[pc
+ 1].block
);
3735 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3736 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3738 std::vector
<struct block_symbol
> candidates
;
3742 ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3743 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3746 if (n_candidates
== 1)
3750 i
= ada_resolve_function
3751 (candidates
.data (), n_candidates
,
3753 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3754 context_type
, parse_completion
);
3756 error (_("Could not find a match for %s"),
3757 exp
->elts
[pc
+ 5].symbol
->print_name ());
3760 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3761 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3762 tracker
->update (candidates
[i
]);
3773 case BINOP_BITWISE_AND
:
3774 case BINOP_BITWISE_IOR
:
3775 case BINOP_BITWISE_XOR
:
3777 case BINOP_NOTEQUAL
:
3785 case UNOP_LOGICAL_NOT
:
3787 if (possible_user_operator_p (op
, argvec
))
3789 std::vector
<struct block_symbol
> candidates
;
3793 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3797 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3798 nargs
, ada_decoded_op_name (op
), NULL
,
3803 replace_operator_with_call (expp
, pc
, nargs
, 1,
3804 candidates
[i
].symbol
,
3805 candidates
[i
].block
);
3816 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3817 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3818 exp
->elts
[pc
+ 1].objfile
,
3819 exp
->elts
[pc
+ 2].msymbol
);
3821 return evaluate_subexp_type (exp
, pos
);
3824 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3825 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3827 /* The term "match" here is rather loose. The match is heuristic and
3831 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3833 ftype
= ada_check_typedef (ftype
);
3834 atype
= ada_check_typedef (atype
);
3836 if (ftype
->code () == TYPE_CODE_REF
)
3837 ftype
= TYPE_TARGET_TYPE (ftype
);
3838 if (atype
->code () == TYPE_CODE_REF
)
3839 atype
= TYPE_TARGET_TYPE (atype
);
3841 switch (ftype
->code ())
3844 return ftype
->code () == atype
->code ();
3846 if (atype
->code () == TYPE_CODE_PTR
)
3847 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3848 TYPE_TARGET_TYPE (atype
), 0);
3851 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3853 case TYPE_CODE_ENUM
:
3854 case TYPE_CODE_RANGE
:
3855 switch (atype
->code ())
3858 case TYPE_CODE_ENUM
:
3859 case TYPE_CODE_RANGE
:
3865 case TYPE_CODE_ARRAY
:
3866 return (atype
->code () == TYPE_CODE_ARRAY
3867 || ada_is_array_descriptor_type (atype
));
3869 case TYPE_CODE_STRUCT
:
3870 if (ada_is_array_descriptor_type (ftype
))
3871 return (atype
->code () == TYPE_CODE_ARRAY
3872 || ada_is_array_descriptor_type (atype
));
3874 return (atype
->code () == TYPE_CODE_STRUCT
3875 && !ada_is_array_descriptor_type (atype
));
3877 case TYPE_CODE_UNION
:
3879 return (atype
->code () == ftype
->code ());
3883 /* Return non-zero if the formals of FUNC "sufficiently match" the
3884 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3885 may also be an enumeral, in which case it is treated as a 0-
3886 argument function. */
3889 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3892 struct type
*func_type
= SYMBOL_TYPE (func
);
3894 if (SYMBOL_CLASS (func
) == LOC_CONST
3895 && func_type
->code () == TYPE_CODE_ENUM
)
3896 return (n_actuals
== 0);
3897 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3900 if (func_type
->num_fields () != n_actuals
)
3903 for (i
= 0; i
< n_actuals
; i
+= 1)
3905 if (actuals
[i
] == NULL
)
3909 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3911 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3913 if (!ada_type_match (ftype
, atype
, 1))
3920 /* False iff function type FUNC_TYPE definitely does not produce a value
3921 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3922 FUNC_TYPE is not a valid function type with a non-null return type
3923 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3926 return_match (struct type
*func_type
, struct type
*context_type
)
3928 struct type
*return_type
;
3930 if (func_type
== NULL
)
3933 if (func_type
->code () == TYPE_CODE_FUNC
)
3934 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3936 return_type
= get_base_type (func_type
);
3937 if (return_type
== NULL
)
3940 context_type
= get_base_type (context_type
);
3942 if (return_type
->code () == TYPE_CODE_ENUM
)
3943 return context_type
== NULL
|| return_type
== context_type
;
3944 else if (context_type
== NULL
)
3945 return return_type
->code () != TYPE_CODE_VOID
;
3947 return return_type
->code () == context_type
->code ();
3951 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3952 function (if any) that matches the types of the NARGS arguments in
3953 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3954 that returns that type, then eliminate matches that don't. If
3955 CONTEXT_TYPE is void and there is at least one match that does not
3956 return void, eliminate all matches that do.
3958 Asks the user if there is more than one match remaining. Returns -1
3959 if there is no such symbol or none is selected. NAME is used
3960 solely for messages. May re-arrange and modify SYMS in
3961 the process; the index returned is for the modified vector. */
3964 ada_resolve_function (struct block_symbol syms
[],
3965 int nsyms
, struct value
**args
, int nargs
,
3966 const char *name
, struct type
*context_type
,
3967 int parse_completion
)
3971 int m
; /* Number of hits */
3974 /* In the first pass of the loop, we only accept functions matching
3975 context_type. If none are found, we add a second pass of the loop
3976 where every function is accepted. */
3977 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3979 for (k
= 0; k
< nsyms
; k
+= 1)
3981 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3983 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3984 && (fallback
|| return_match (type
, context_type
)))
3992 /* If we got multiple matches, ask the user which one to use. Don't do this
3993 interactive thing during completion, though, as the purpose of the
3994 completion is providing a list of all possible matches. Prompting the
3995 user to filter it down would be completely unexpected in this case. */
3998 else if (m
> 1 && !parse_completion
)
4000 printf_filtered (_("Multiple matches for %s\n"), name
);
4001 user_select_syms (syms
, m
, 1);
4007 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4008 on the function identified by SYM and BLOCK, and taking NARGS
4009 arguments. Update *EXPP as needed to hold more space. */
4012 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4013 int oplen
, struct symbol
*sym
,
4014 const struct block
*block
)
4016 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4017 symbol, -oplen for operator being replaced). */
4018 struct expression
*newexp
= (struct expression
*)
4019 xzalloc (sizeof (struct expression
)
4020 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
4021 struct expression
*exp
= expp
->get ();
4023 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4024 newexp
->language_defn
= exp
->language_defn
;
4025 newexp
->gdbarch
= exp
->gdbarch
;
4026 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4027 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4028 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4030 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4031 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4033 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4034 newexp
->elts
[pc
+ 4].block
= block
;
4035 newexp
->elts
[pc
+ 5].symbol
= sym
;
4037 expp
->reset (newexp
);
4040 /* Type-class predicates */
4042 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4046 numeric_type_p (struct type
*type
)
4052 switch (type
->code ())
4057 case TYPE_CODE_RANGE
:
4058 return (type
== TYPE_TARGET_TYPE (type
)
4059 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4066 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4069 integer_type_p (struct type
*type
)
4075 switch (type
->code ())
4079 case TYPE_CODE_RANGE
:
4080 return (type
== TYPE_TARGET_TYPE (type
)
4081 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4088 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4091 scalar_type_p (struct type
*type
)
4097 switch (type
->code ())
4100 case TYPE_CODE_RANGE
:
4101 case TYPE_CODE_ENUM
:
4110 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4113 discrete_type_p (struct type
*type
)
4119 switch (type
->code ())
4122 case TYPE_CODE_RANGE
:
4123 case TYPE_CODE_ENUM
:
4124 case TYPE_CODE_BOOL
:
4132 /* Returns non-zero if OP with operands in the vector ARGS could be
4133 a user-defined function. Errs on the side of pre-defined operators
4134 (i.e., result 0). */
4137 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4139 struct type
*type0
=
4140 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4141 struct type
*type1
=
4142 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4156 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4160 case BINOP_BITWISE_AND
:
4161 case BINOP_BITWISE_IOR
:
4162 case BINOP_BITWISE_XOR
:
4163 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4166 case BINOP_NOTEQUAL
:
4171 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4174 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4177 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4181 case UNOP_LOGICAL_NOT
:
4183 return (!numeric_type_p (type0
));
4192 1. In the following, we assume that a renaming type's name may
4193 have an ___XD suffix. It would be nice if this went away at some
4195 2. We handle both the (old) purely type-based representation of
4196 renamings and the (new) variable-based encoding. At some point,
4197 it is devoutly to be hoped that the former goes away
4198 (FIXME: hilfinger-2007-07-09).
4199 3. Subprogram renamings are not implemented, although the XRS
4200 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4202 /* If SYM encodes a renaming,
4204 <renaming> renames <renamed entity>,
4206 sets *LEN to the length of the renamed entity's name,
4207 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4208 the string describing the subcomponent selected from the renamed
4209 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4210 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4211 are undefined). Otherwise, returns a value indicating the category
4212 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4213 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4214 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4215 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4216 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4217 may be NULL, in which case they are not assigned.
4219 [Currently, however, GCC does not generate subprogram renamings.] */
4221 enum ada_renaming_category
4222 ada_parse_renaming (struct symbol
*sym
,
4223 const char **renamed_entity
, int *len
,
4224 const char **renaming_expr
)
4226 enum ada_renaming_category kind
;
4231 return ADA_NOT_RENAMING
;
4232 switch (SYMBOL_CLASS (sym
))
4235 return ADA_NOT_RENAMING
;
4239 case LOC_OPTIMIZED_OUT
:
4240 info
= strstr (sym
->linkage_name (), "___XR");
4242 return ADA_NOT_RENAMING
;
4246 kind
= ADA_OBJECT_RENAMING
;
4250 kind
= ADA_EXCEPTION_RENAMING
;
4254 kind
= ADA_PACKAGE_RENAMING
;
4258 kind
= ADA_SUBPROGRAM_RENAMING
;
4262 return ADA_NOT_RENAMING
;
4266 if (renamed_entity
!= NULL
)
4267 *renamed_entity
= info
;
4268 suffix
= strstr (info
, "___XE");
4269 if (suffix
== NULL
|| suffix
== info
)
4270 return ADA_NOT_RENAMING
;
4272 *len
= strlen (info
) - strlen (suffix
);
4274 if (renaming_expr
!= NULL
)
4275 *renaming_expr
= suffix
;
4279 /* Compute the value of the given RENAMING_SYM, which is expected to
4280 be a symbol encoding a renaming expression. BLOCK is the block
4281 used to evaluate the renaming. */
4283 static struct value
*
4284 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4285 const struct block
*block
)
4287 const char *sym_name
;
4289 sym_name
= renaming_sym
->linkage_name ();
4290 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4291 return evaluate_expression (expr
.get ());
4295 /* Evaluation: Function Calls */
4297 /* Return an lvalue containing the value VAL. This is the identity on
4298 lvalues, and otherwise has the side-effect of allocating memory
4299 in the inferior where a copy of the value contents is copied. */
4301 static struct value
*
4302 ensure_lval (struct value
*val
)
4304 if (VALUE_LVAL (val
) == not_lval
4305 || VALUE_LVAL (val
) == lval_internalvar
)
4307 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4308 const CORE_ADDR addr
=
4309 value_as_long (value_allocate_space_in_inferior (len
));
4311 VALUE_LVAL (val
) = lval_memory
;
4312 set_value_address (val
, addr
);
4313 write_memory (addr
, value_contents (val
), len
);
4319 /* Given ARG, a value of type (pointer or reference to a)*
4320 structure/union, extract the component named NAME from the ultimate
4321 target structure/union and return it as a value with its
4324 The routine searches for NAME among all members of the structure itself
4325 and (recursively) among all members of any wrapper members
4328 If NO_ERR, then simply return NULL in case of error, rather than
4331 static struct value
*
4332 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4334 struct type
*t
, *t1
;
4339 t1
= t
= ada_check_typedef (value_type (arg
));
4340 if (t
->code () == TYPE_CODE_REF
)
4342 t1
= TYPE_TARGET_TYPE (t
);
4345 t1
= ada_check_typedef (t1
);
4346 if (t1
->code () == TYPE_CODE_PTR
)
4348 arg
= coerce_ref (arg
);
4353 while (t
->code () == TYPE_CODE_PTR
)
4355 t1
= TYPE_TARGET_TYPE (t
);
4358 t1
= ada_check_typedef (t1
);
4359 if (t1
->code () == TYPE_CODE_PTR
)
4361 arg
= value_ind (arg
);
4368 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4372 v
= ada_search_struct_field (name
, arg
, 0, t
);
4375 int bit_offset
, bit_size
, byte_offset
;
4376 struct type
*field_type
;
4379 if (t
->code () == TYPE_CODE_PTR
)
4380 address
= value_address (ada_value_ind (arg
));
4382 address
= value_address (ada_coerce_ref (arg
));
4384 /* Check to see if this is a tagged type. We also need to handle
4385 the case where the type is a reference to a tagged type, but
4386 we have to be careful to exclude pointers to tagged types.
4387 The latter should be shown as usual (as a pointer), whereas
4388 a reference should mostly be transparent to the user. */
4390 if (ada_is_tagged_type (t1
, 0)
4391 || (t1
->code () == TYPE_CODE_REF
4392 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4394 /* We first try to find the searched field in the current type.
4395 If not found then let's look in the fixed type. */
4397 if (!find_struct_field (name
, t1
, 0,
4398 &field_type
, &byte_offset
, &bit_offset
,
4407 /* Convert to fixed type in all cases, so that we have proper
4408 offsets to each field in unconstrained record types. */
4409 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4410 address
, NULL
, check_tag
);
4412 if (find_struct_field (name
, t1
, 0,
4413 &field_type
, &byte_offset
, &bit_offset
,
4418 if (t
->code () == TYPE_CODE_REF
)
4419 arg
= ada_coerce_ref (arg
);
4421 arg
= ada_value_ind (arg
);
4422 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4423 bit_offset
, bit_size
,
4427 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4431 if (v
!= NULL
|| no_err
)
4434 error (_("There is no member named %s."), name
);
4440 error (_("Attempt to extract a component of "
4441 "a value that is not a record."));
4444 /* Return the value ACTUAL, converted to be an appropriate value for a
4445 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4446 allocating any necessary descriptors (fat pointers), or copies of
4447 values not residing in memory, updating it as needed. */
4450 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4452 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4453 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4454 struct type
*formal_target
=
4455 formal_type
->code () == TYPE_CODE_PTR
4456 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4457 struct type
*actual_target
=
4458 actual_type
->code () == TYPE_CODE_PTR
4459 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4461 if (ada_is_array_descriptor_type (formal_target
)
4462 && actual_target
->code () == TYPE_CODE_ARRAY
)
4463 return make_array_descriptor (formal_type
, actual
);
4464 else if (formal_type
->code () == TYPE_CODE_PTR
4465 || formal_type
->code () == TYPE_CODE_REF
)
4467 struct value
*result
;
4469 if (formal_target
->code () == TYPE_CODE_ARRAY
4470 && ada_is_array_descriptor_type (actual_target
))
4471 result
= desc_data (actual
);
4472 else if (formal_type
->code () != TYPE_CODE_PTR
)
4474 if (VALUE_LVAL (actual
) != lval_memory
)
4478 actual_type
= ada_check_typedef (value_type (actual
));
4479 val
= allocate_value (actual_type
);
4480 memcpy ((char *) value_contents_raw (val
),
4481 (char *) value_contents (actual
),
4482 TYPE_LENGTH (actual_type
));
4483 actual
= ensure_lval (val
);
4485 result
= value_addr (actual
);
4489 return value_cast_pointers (formal_type
, result
, 0);
4491 else if (actual_type
->code () == TYPE_CODE_PTR
)
4492 return ada_value_ind (actual
);
4493 else if (ada_is_aligner_type (formal_type
))
4495 /* We need to turn this parameter into an aligner type
4497 struct value
*aligner
= allocate_value (formal_type
);
4498 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4500 value_assign_to_component (aligner
, component
, actual
);
4507 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4508 type TYPE. This is usually an inefficient no-op except on some targets
4509 (such as AVR) where the representation of a pointer and an address
4513 value_pointer (struct value
*value
, struct type
*type
)
4515 struct gdbarch
*gdbarch
= get_type_arch (type
);
4516 unsigned len
= TYPE_LENGTH (type
);
4517 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4520 addr
= value_address (value
);
4521 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4522 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4527 /* Push a descriptor of type TYPE for array value ARR on the stack at
4528 *SP, updating *SP to reflect the new descriptor. Return either
4529 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4530 to-descriptor type rather than a descriptor type), a struct value *
4531 representing a pointer to this descriptor. */
4533 static struct value
*
4534 make_array_descriptor (struct type
*type
, struct value
*arr
)
4536 struct type
*bounds_type
= desc_bounds_type (type
);
4537 struct type
*desc_type
= desc_base_type (type
);
4538 struct value
*descriptor
= allocate_value (desc_type
);
4539 struct value
*bounds
= allocate_value (bounds_type
);
4542 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4545 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4546 ada_array_bound (arr
, i
, 0),
4547 desc_bound_bitpos (bounds_type
, i
, 0),
4548 desc_bound_bitsize (bounds_type
, i
, 0));
4549 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4550 ada_array_bound (arr
, i
, 1),
4551 desc_bound_bitpos (bounds_type
, i
, 1),
4552 desc_bound_bitsize (bounds_type
, i
, 1));
4555 bounds
= ensure_lval (bounds
);
4557 modify_field (value_type (descriptor
),
4558 value_contents_writeable (descriptor
),
4559 value_pointer (ensure_lval (arr
),
4560 TYPE_FIELD_TYPE (desc_type
, 0)),
4561 fat_pntr_data_bitpos (desc_type
),
4562 fat_pntr_data_bitsize (desc_type
));
4564 modify_field (value_type (descriptor
),
4565 value_contents_writeable (descriptor
),
4566 value_pointer (bounds
,
4567 TYPE_FIELD_TYPE (desc_type
, 1)),
4568 fat_pntr_bounds_bitpos (desc_type
),
4569 fat_pntr_bounds_bitsize (desc_type
));
4571 descriptor
= ensure_lval (descriptor
);
4573 if (type
->code () == TYPE_CODE_PTR
)
4574 return value_addr (descriptor
);
4579 /* Symbol Cache Module */
4581 /* Performance measurements made as of 2010-01-15 indicate that
4582 this cache does bring some noticeable improvements. Depending
4583 on the type of entity being printed, the cache can make it as much
4584 as an order of magnitude faster than without it.
4586 The descriptive type DWARF extension has significantly reduced
4587 the need for this cache, at least when DWARF is being used. However,
4588 even in this case, some expensive name-based symbol searches are still
4589 sometimes necessary - to find an XVZ variable, mostly. */
4591 /* Initialize the contents of SYM_CACHE. */
4594 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4596 obstack_init (&sym_cache
->cache_space
);
4597 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4600 /* Free the memory used by SYM_CACHE. */
4603 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4605 obstack_free (&sym_cache
->cache_space
, NULL
);
4609 /* Return the symbol cache associated to the given program space PSPACE.
4610 If not allocated for this PSPACE yet, allocate and initialize one. */
4612 static struct ada_symbol_cache
*
4613 ada_get_symbol_cache (struct program_space
*pspace
)
4615 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4617 if (pspace_data
->sym_cache
== NULL
)
4619 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4620 ada_init_symbol_cache (pspace_data
->sym_cache
);
4623 return pspace_data
->sym_cache
;
4626 /* Clear all entries from the symbol cache. */
4629 ada_clear_symbol_cache (void)
4631 struct ada_symbol_cache
*sym_cache
4632 = ada_get_symbol_cache (current_program_space
);
4634 obstack_free (&sym_cache
->cache_space
, NULL
);
4635 ada_init_symbol_cache (sym_cache
);
4638 /* Search our cache for an entry matching NAME and DOMAIN.
4639 Return it if found, or NULL otherwise. */
4641 static struct cache_entry
**
4642 find_entry (const char *name
, domain_enum domain
)
4644 struct ada_symbol_cache
*sym_cache
4645 = ada_get_symbol_cache (current_program_space
);
4646 int h
= msymbol_hash (name
) % HASH_SIZE
;
4647 struct cache_entry
**e
;
4649 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4651 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4657 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4658 Return 1 if found, 0 otherwise.
4660 If an entry was found and SYM is not NULL, set *SYM to the entry's
4661 SYM. Same principle for BLOCK if not NULL. */
4664 lookup_cached_symbol (const char *name
, domain_enum domain
,
4665 struct symbol
**sym
, const struct block
**block
)
4667 struct cache_entry
**e
= find_entry (name
, domain
);
4674 *block
= (*e
)->block
;
4678 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4679 in domain DOMAIN, save this result in our symbol cache. */
4682 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4683 const struct block
*block
)
4685 struct ada_symbol_cache
*sym_cache
4686 = ada_get_symbol_cache (current_program_space
);
4688 struct cache_entry
*e
;
4690 /* Symbols for builtin types don't have a block.
4691 For now don't cache such symbols. */
4692 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4695 /* If the symbol is a local symbol, then do not cache it, as a search
4696 for that symbol depends on the context. To determine whether
4697 the symbol is local or not, we check the block where we found it
4698 against the global and static blocks of its associated symtab. */
4700 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4701 GLOBAL_BLOCK
) != block
4702 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4703 STATIC_BLOCK
) != block
)
4706 h
= msymbol_hash (name
) % HASH_SIZE
;
4707 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4708 e
->next
= sym_cache
->root
[h
];
4709 sym_cache
->root
[h
] = e
;
4710 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4718 /* Return the symbol name match type that should be used used when
4719 searching for all symbols matching LOOKUP_NAME.
4721 LOOKUP_NAME is expected to be a symbol name after transformation
4724 static symbol_name_match_type
4725 name_match_type_from_name (const char *lookup_name
)
4727 return (strstr (lookup_name
, "__") == NULL
4728 ? symbol_name_match_type::WILD
4729 : symbol_name_match_type::FULL
);
4732 /* Return the result of a standard (literal, C-like) lookup of NAME in
4733 given DOMAIN, visible from lexical block BLOCK. */
4735 static struct symbol
*
4736 standard_lookup (const char *name
, const struct block
*block
,
4739 /* Initialize it just to avoid a GCC false warning. */
4740 struct block_symbol sym
= {};
4742 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4744 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4745 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4750 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4751 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4752 since they contend in overloading in the same way. */
4754 is_nonfunction (struct block_symbol syms
[], int n
)
4758 for (i
= 0; i
< n
; i
+= 1)
4759 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_FUNC
4760 && (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
4761 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4767 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4768 struct types. Otherwise, they may not. */
4771 equiv_types (struct type
*type0
, struct type
*type1
)
4775 if (type0
== NULL
|| type1
== NULL
4776 || type0
->code () != type1
->code ())
4778 if ((type0
->code () == TYPE_CODE_STRUCT
4779 || type0
->code () == TYPE_CODE_ENUM
)
4780 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4781 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4787 /* True iff SYM0 represents the same entity as SYM1, or one that is
4788 no more defined than that of SYM1. */
4791 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4795 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4796 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4799 switch (SYMBOL_CLASS (sym0
))
4805 struct type
*type0
= SYMBOL_TYPE (sym0
);
4806 struct type
*type1
= SYMBOL_TYPE (sym1
);
4807 const char *name0
= sym0
->linkage_name ();
4808 const char *name1
= sym1
->linkage_name ();
4809 int len0
= strlen (name0
);
4812 type0
->code () == type1
->code ()
4813 && (equiv_types (type0
, type1
)
4814 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4815 && startswith (name1
+ len0
, "___XV")));
4818 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4819 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4823 const char *name0
= sym0
->linkage_name ();
4824 const char *name1
= sym1
->linkage_name ();
4825 return (strcmp (name0
, name1
) == 0
4826 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4834 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4835 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4838 add_defn_to_vec (struct obstack
*obstackp
,
4840 const struct block
*block
)
4843 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4845 /* Do not try to complete stub types, as the debugger is probably
4846 already scanning all symbols matching a certain name at the
4847 time when this function is called. Trying to replace the stub
4848 type by its associated full type will cause us to restart a scan
4849 which may lead to an infinite recursion. Instead, the client
4850 collecting the matching symbols will end up collecting several
4851 matches, with at least one of them complete. It can then filter
4852 out the stub ones if needed. */
4854 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4856 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4858 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4860 prevDefns
[i
].symbol
= sym
;
4861 prevDefns
[i
].block
= block
;
4867 struct block_symbol info
;
4871 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4875 /* Number of block_symbol structures currently collected in current vector in
4879 num_defns_collected (struct obstack
*obstackp
)
4881 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4884 /* Vector of block_symbol structures currently collected in current vector in
4885 OBSTACKP. If FINISH, close off the vector and return its final address. */
4887 static struct block_symbol
*
4888 defns_collected (struct obstack
*obstackp
, int finish
)
4891 return (struct block_symbol
*) obstack_finish (obstackp
);
4893 return (struct block_symbol
*) obstack_base (obstackp
);
4896 /* Return a bound minimal symbol matching NAME according to Ada
4897 decoding rules. Returns an invalid symbol if there is no such
4898 minimal symbol. Names prefixed with "standard__" are handled
4899 specially: "standard__" is first stripped off, and only static and
4900 global symbols are searched. */
4902 struct bound_minimal_symbol
4903 ada_lookup_simple_minsym (const char *name
)
4905 struct bound_minimal_symbol result
;
4907 memset (&result
, 0, sizeof (result
));
4909 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4910 lookup_name_info
lookup_name (name
, match_type
);
4912 symbol_name_matcher_ftype
*match_name
4913 = ada_get_symbol_name_matcher (lookup_name
);
4915 for (objfile
*objfile
: current_program_space
->objfiles ())
4917 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4919 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4920 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4922 result
.minsym
= msymbol
;
4923 result
.objfile
= objfile
;
4932 /* For all subprograms that statically enclose the subprogram of the
4933 selected frame, add symbols matching identifier NAME in DOMAIN
4934 and their blocks to the list of data in OBSTACKP, as for
4935 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4936 with a wildcard prefix. */
4939 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4940 const lookup_name_info
&lookup_name
,
4945 /* True if TYPE is definitely an artificial type supplied to a symbol
4946 for which no debugging information was given in the symbol file. */
4949 is_nondebugging_type (struct type
*type
)
4951 const char *name
= ada_type_name (type
);
4953 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4956 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4957 that are deemed "identical" for practical purposes.
4959 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4960 types and that their number of enumerals is identical (in other
4961 words, type1->num_fields () == type2->num_fields ()). */
4964 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4968 /* The heuristic we use here is fairly conservative. We consider
4969 that 2 enumerate types are identical if they have the same
4970 number of enumerals and that all enumerals have the same
4971 underlying value and name. */
4973 /* All enums in the type should have an identical underlying value. */
4974 for (i
= 0; i
< type1
->num_fields (); i
++)
4975 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4978 /* All enumerals should also have the same name (modulo any numerical
4980 for (i
= 0; i
< type1
->num_fields (); i
++)
4982 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4983 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4984 int len_1
= strlen (name_1
);
4985 int len_2
= strlen (name_2
);
4987 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4988 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4990 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4991 TYPE_FIELD_NAME (type2
, i
),
4999 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
5000 that are deemed "identical" for practical purposes. Sometimes,
5001 enumerals are not strictly identical, but their types are so similar
5002 that they can be considered identical.
5004 For instance, consider the following code:
5006 type Color is (Black, Red, Green, Blue, White);
5007 type RGB_Color is new Color range Red .. Blue;
5009 Type RGB_Color is a subrange of an implicit type which is a copy
5010 of type Color. If we call that implicit type RGB_ColorB ("B" is
5011 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5012 As a result, when an expression references any of the enumeral
5013 by name (Eg. "print green"), the expression is technically
5014 ambiguous and the user should be asked to disambiguate. But
5015 doing so would only hinder the user, since it wouldn't matter
5016 what choice he makes, the outcome would always be the same.
5017 So, for practical purposes, we consider them as the same. */
5020 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
5024 /* Before performing a thorough comparison check of each type,
5025 we perform a series of inexpensive checks. We expect that these
5026 checks will quickly fail in the vast majority of cases, and thus
5027 help prevent the unnecessary use of a more expensive comparison.
5028 Said comparison also expects us to make some of these checks
5029 (see ada_identical_enum_types_p). */
5031 /* Quick check: All symbols should have an enum type. */
5032 for (i
= 0; i
< syms
.size (); i
++)
5033 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
5036 /* Quick check: They should all have the same value. */
5037 for (i
= 1; i
< syms
.size (); i
++)
5038 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5041 /* Quick check: They should all have the same number of enumerals. */
5042 for (i
= 1; i
< syms
.size (); i
++)
5043 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
5044 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
5047 /* All the sanity checks passed, so we might have a set of
5048 identical enumeration types. Perform a more complete
5049 comparison of the type of each symbol. */
5050 for (i
= 1; i
< syms
.size (); i
++)
5051 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5052 SYMBOL_TYPE (syms
[0].symbol
)))
5058 /* Remove any non-debugging symbols in SYMS that definitely
5059 duplicate other symbols in the list (The only case I know of where
5060 this happens is when object files containing stabs-in-ecoff are
5061 linked with files containing ordinary ecoff debugging symbols (or no
5062 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5063 Returns the number of items in the modified list. */
5066 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5070 /* We should never be called with less than 2 symbols, as there
5071 cannot be any extra symbol in that case. But it's easy to
5072 handle, since we have nothing to do in that case. */
5073 if (syms
->size () < 2)
5074 return syms
->size ();
5077 while (i
< syms
->size ())
5081 /* If two symbols have the same name and one of them is a stub type,
5082 the get rid of the stub. */
5084 if (TYPE_STUB (SYMBOL_TYPE ((*syms
)[i
].symbol
))
5085 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5087 for (j
= 0; j
< syms
->size (); j
++)
5090 && !TYPE_STUB (SYMBOL_TYPE ((*syms
)[j
].symbol
))
5091 && (*syms
)[j
].symbol
->linkage_name () != NULL
5092 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5093 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5098 /* Two symbols with the same name, same class and same address
5099 should be identical. */
5101 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5102 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5103 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5105 for (j
= 0; j
< syms
->size (); j
+= 1)
5108 && (*syms
)[j
].symbol
->linkage_name () != NULL
5109 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5110 (*syms
)[j
].symbol
->linkage_name ()) == 0
5111 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5112 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5113 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5114 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5120 syms
->erase (syms
->begin () + i
);
5125 /* If all the remaining symbols are identical enumerals, then
5126 just keep the first one and discard the rest.
5128 Unlike what we did previously, we do not discard any entry
5129 unless they are ALL identical. This is because the symbol
5130 comparison is not a strict comparison, but rather a practical
5131 comparison. If all symbols are considered identical, then
5132 we can just go ahead and use the first one and discard the rest.
5133 But if we cannot reduce the list to a single element, we have
5134 to ask the user to disambiguate anyways. And if we have to
5135 present a multiple-choice menu, it's less confusing if the list
5136 isn't missing some choices that were identical and yet distinct. */
5137 if (symbols_are_identical_enums (*syms
))
5140 return syms
->size ();
5143 /* Given a type that corresponds to a renaming entity, use the type name
5144 to extract the scope (package name or function name, fully qualified,
5145 and following the GNAT encoding convention) where this renaming has been
5149 xget_renaming_scope (struct type
*renaming_type
)
5151 /* The renaming types adhere to the following convention:
5152 <scope>__<rename>___<XR extension>.
5153 So, to extract the scope, we search for the "___XR" extension,
5154 and then backtrack until we find the first "__". */
5156 const char *name
= renaming_type
->name ();
5157 const char *suffix
= strstr (name
, "___XR");
5160 /* Now, backtrack a bit until we find the first "__". Start looking
5161 at suffix - 3, as the <rename> part is at least one character long. */
5163 for (last
= suffix
- 3; last
> name
; last
--)
5164 if (last
[0] == '_' && last
[1] == '_')
5167 /* Make a copy of scope and return it. */
5168 return std::string (name
, last
);
5171 /* Return nonzero if NAME corresponds to a package name. */
5174 is_package_name (const char *name
)
5176 /* Here, We take advantage of the fact that no symbols are generated
5177 for packages, while symbols are generated for each function.
5178 So the condition for NAME represent a package becomes equivalent
5179 to NAME not existing in our list of symbols. There is only one
5180 small complication with library-level functions (see below). */
5182 /* If it is a function that has not been defined at library level,
5183 then we should be able to look it up in the symbols. */
5184 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5187 /* Library-level function names start with "_ada_". See if function
5188 "_ada_" followed by NAME can be found. */
5190 /* Do a quick check that NAME does not contain "__", since library-level
5191 functions names cannot contain "__" in them. */
5192 if (strstr (name
, "__") != NULL
)
5195 std::string fun_name
= string_printf ("_ada_%s", name
);
5197 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5200 /* Return nonzero if SYM corresponds to a renaming entity that is
5201 not visible from FUNCTION_NAME. */
5204 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5206 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5209 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5211 /* If the rename has been defined in a package, then it is visible. */
5212 if (is_package_name (scope
.c_str ()))
5215 /* Check that the rename is in the current function scope by checking
5216 that its name starts with SCOPE. */
5218 /* If the function name starts with "_ada_", it means that it is
5219 a library-level function. Strip this prefix before doing the
5220 comparison, as the encoding for the renaming does not contain
5222 if (startswith (function_name
, "_ada_"))
5225 return !startswith (function_name
, scope
.c_str ());
5228 /* Remove entries from SYMS that corresponds to a renaming entity that
5229 is not visible from the function associated with CURRENT_BLOCK or
5230 that is superfluous due to the presence of more specific renaming
5231 information. Places surviving symbols in the initial entries of
5232 SYMS and returns the number of surviving symbols.
5235 First, in cases where an object renaming is implemented as a
5236 reference variable, GNAT may produce both the actual reference
5237 variable and the renaming encoding. In this case, we discard the
5240 Second, GNAT emits a type following a specified encoding for each renaming
5241 entity. Unfortunately, STABS currently does not support the definition
5242 of types that are local to a given lexical block, so all renamings types
5243 are emitted at library level. As a consequence, if an application
5244 contains two renaming entities using the same name, and a user tries to
5245 print the value of one of these entities, the result of the ada symbol
5246 lookup will also contain the wrong renaming type.
5248 This function partially covers for this limitation by attempting to
5249 remove from the SYMS list renaming symbols that should be visible
5250 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5251 method with the current information available. The implementation
5252 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5254 - When the user tries to print a rename in a function while there
5255 is another rename entity defined in a package: Normally, the
5256 rename in the function has precedence over the rename in the
5257 package, so the latter should be removed from the list. This is
5258 currently not the case.
5260 - This function will incorrectly remove valid renames if
5261 the CURRENT_BLOCK corresponds to a function which symbol name
5262 has been changed by an "Export" pragma. As a consequence,
5263 the user will be unable to print such rename entities. */
5266 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5267 const struct block
*current_block
)
5269 struct symbol
*current_function
;
5270 const char *current_function_name
;
5272 int is_new_style_renaming
;
5274 /* If there is both a renaming foo___XR... encoded as a variable and
5275 a simple variable foo in the same block, discard the latter.
5276 First, zero out such symbols, then compress. */
5277 is_new_style_renaming
= 0;
5278 for (i
= 0; i
< syms
->size (); i
+= 1)
5280 struct symbol
*sym
= (*syms
)[i
].symbol
;
5281 const struct block
*block
= (*syms
)[i
].block
;
5285 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5287 name
= sym
->linkage_name ();
5288 suffix
= strstr (name
, "___XR");
5292 int name_len
= suffix
- name
;
5295 is_new_style_renaming
= 1;
5296 for (j
= 0; j
< syms
->size (); j
+= 1)
5297 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5298 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5300 && block
== (*syms
)[j
].block
)
5301 (*syms
)[j
].symbol
= NULL
;
5304 if (is_new_style_renaming
)
5308 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5309 if ((*syms
)[j
].symbol
!= NULL
)
5311 (*syms
)[k
] = (*syms
)[j
];
5317 /* Extract the function name associated to CURRENT_BLOCK.
5318 Abort if unable to do so. */
5320 if (current_block
== NULL
)
5321 return syms
->size ();
5323 current_function
= block_linkage_function (current_block
);
5324 if (current_function
== NULL
)
5325 return syms
->size ();
5327 current_function_name
= current_function
->linkage_name ();
5328 if (current_function_name
== NULL
)
5329 return syms
->size ();
5331 /* Check each of the symbols, and remove it from the list if it is
5332 a type corresponding to a renaming that is out of the scope of
5333 the current block. */
5336 while (i
< syms
->size ())
5338 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5339 == ADA_OBJECT_RENAMING
5340 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5341 current_function_name
))
5342 syms
->erase (syms
->begin () + i
);
5347 return syms
->size ();
5350 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5351 whose name and domain match NAME and DOMAIN respectively.
5352 If no match was found, then extend the search to "enclosing"
5353 routines (in other words, if we're inside a nested function,
5354 search the symbols defined inside the enclosing functions).
5355 If WILD_MATCH_P is nonzero, perform the naming matching in
5356 "wild" mode (see function "wild_match" for more info).
5358 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5361 ada_add_local_symbols (struct obstack
*obstackp
,
5362 const lookup_name_info
&lookup_name
,
5363 const struct block
*block
, domain_enum domain
)
5365 int block_depth
= 0;
5367 while (block
!= NULL
)
5370 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5372 /* If we found a non-function match, assume that's the one. */
5373 if (is_nonfunction (defns_collected (obstackp
, 0),
5374 num_defns_collected (obstackp
)))
5377 block
= BLOCK_SUPERBLOCK (block
);
5380 /* If no luck so far, try to find NAME as a local symbol in some lexically
5381 enclosing subprogram. */
5382 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5383 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5386 /* An object of this type is used as the user_data argument when
5387 calling the map_matching_symbols method. */
5391 struct objfile
*objfile
;
5392 struct obstack
*obstackp
;
5393 struct symbol
*arg_sym
;
5397 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5398 to a list of symbols. DATA is a pointer to a struct match_data *
5399 containing the obstack that collects the symbol list, the file that SYM
5400 must come from, a flag indicating whether a non-argument symbol has
5401 been found in the current block, and the last argument symbol
5402 passed in SYM within the current block (if any). When SYM is null,
5403 marking the end of a block, the argument symbol is added if no
5404 other has been found. */
5407 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5408 struct match_data
*data
)
5410 const struct block
*block
= bsym
->block
;
5411 struct symbol
*sym
= bsym
->symbol
;
5415 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5416 add_defn_to_vec (data
->obstackp
,
5417 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5419 data
->found_sym
= 0;
5420 data
->arg_sym
= NULL
;
5424 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5426 else if (SYMBOL_IS_ARGUMENT (sym
))
5427 data
->arg_sym
= sym
;
5430 data
->found_sym
= 1;
5431 add_defn_to_vec (data
->obstackp
,
5432 fixup_symbol_section (sym
, data
->objfile
),
5439 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5440 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5441 symbols to OBSTACKP. Return whether we found such symbols. */
5444 ada_add_block_renamings (struct obstack
*obstackp
,
5445 const struct block
*block
,
5446 const lookup_name_info
&lookup_name
,
5449 struct using_direct
*renaming
;
5450 int defns_mark
= num_defns_collected (obstackp
);
5452 symbol_name_matcher_ftype
*name_match
5453 = ada_get_symbol_name_matcher (lookup_name
);
5455 for (renaming
= block_using (block
);
5457 renaming
= renaming
->next
)
5461 /* Avoid infinite recursions: skip this renaming if we are actually
5462 already traversing it.
5464 Currently, symbol lookup in Ada don't use the namespace machinery from
5465 C++/Fortran support: skip namespace imports that use them. */
5466 if (renaming
->searched
5467 || (renaming
->import_src
!= NULL
5468 && renaming
->import_src
[0] != '\0')
5469 || (renaming
->import_dest
!= NULL
5470 && renaming
->import_dest
[0] != '\0'))
5472 renaming
->searched
= 1;
5474 /* TODO: here, we perform another name-based symbol lookup, which can
5475 pull its own multiple overloads. In theory, we should be able to do
5476 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5477 not a simple name. But in order to do this, we would need to enhance
5478 the DWARF reader to associate a symbol to this renaming, instead of a
5479 name. So, for now, we do something simpler: re-use the C++/Fortran
5480 namespace machinery. */
5481 r_name
= (renaming
->alias
!= NULL
5483 : renaming
->declaration
);
5484 if (name_match (r_name
, lookup_name
, NULL
))
5486 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5487 lookup_name
.match_type ());
5488 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5491 renaming
->searched
= 0;
5493 return num_defns_collected (obstackp
) != defns_mark
;
5496 /* Implements compare_names, but only applying the comparision using
5497 the given CASING. */
5500 compare_names_with_case (const char *string1
, const char *string2
,
5501 enum case_sensitivity casing
)
5503 while (*string1
!= '\0' && *string2
!= '\0')
5507 if (isspace (*string1
) || isspace (*string2
))
5508 return strcmp_iw_ordered (string1
, string2
);
5510 if (casing
== case_sensitive_off
)
5512 c1
= tolower (*string1
);
5513 c2
= tolower (*string2
);
5530 return strcmp_iw_ordered (string1
, string2
);
5532 if (*string2
== '\0')
5534 if (is_name_suffix (string1
))
5541 if (*string2
== '(')
5542 return strcmp_iw_ordered (string1
, string2
);
5545 if (casing
== case_sensitive_off
)
5546 return tolower (*string1
) - tolower (*string2
);
5548 return *string1
- *string2
;
5553 /* Compare STRING1 to STRING2, with results as for strcmp.
5554 Compatible with strcmp_iw_ordered in that...
5556 strcmp_iw_ordered (STRING1, STRING2) <= 0
5560 compare_names (STRING1, STRING2) <= 0
5562 (they may differ as to what symbols compare equal). */
5565 compare_names (const char *string1
, const char *string2
)
5569 /* Similar to what strcmp_iw_ordered does, we need to perform
5570 a case-insensitive comparison first, and only resort to
5571 a second, case-sensitive, comparison if the first one was
5572 not sufficient to differentiate the two strings. */
5574 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5576 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5581 /* Convenience function to get at the Ada encoded lookup name for
5582 LOOKUP_NAME, as a C string. */
5585 ada_lookup_name (const lookup_name_info
&lookup_name
)
5587 return lookup_name
.ada ().lookup_name ().c_str ();
5590 /* Add to OBSTACKP all non-local symbols whose name and domain match
5591 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5592 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5593 symbols otherwise. */
5596 add_nonlocal_symbols (struct obstack
*obstackp
,
5597 const lookup_name_info
&lookup_name
,
5598 domain_enum domain
, int global
)
5600 struct match_data data
;
5602 memset (&data
, 0, sizeof data
);
5603 data
.obstackp
= obstackp
;
5605 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5607 auto callback
= [&] (struct block_symbol
*bsym
)
5609 return aux_add_nonlocal_symbols (bsym
, &data
);
5612 for (objfile
*objfile
: current_program_space
->objfiles ())
5614 data
.objfile
= objfile
;
5616 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5617 domain
, global
, callback
,
5619 ? NULL
: compare_names
));
5621 for (compunit_symtab
*cu
: objfile
->compunits ())
5623 const struct block
*global_block
5624 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5626 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5632 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5634 const char *name
= ada_lookup_name (lookup_name
);
5635 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5636 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5638 for (objfile
*objfile
: current_program_space
->objfiles ())
5640 data
.objfile
= objfile
;
5641 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5642 domain
, global
, callback
,
5648 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5649 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5650 returning the number of matches. Add these to OBSTACKP.
5652 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5653 symbol match within the nest of blocks whose innermost member is BLOCK,
5654 is the one match returned (no other matches in that or
5655 enclosing blocks is returned). If there are any matches in or
5656 surrounding BLOCK, then these alone are returned.
5658 Names prefixed with "standard__" are handled specially:
5659 "standard__" is first stripped off (by the lookup_name
5660 constructor), and only static and global symbols are searched.
5662 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5663 to lookup global symbols. */
5666 ada_add_all_symbols (struct obstack
*obstackp
,
5667 const struct block
*block
,
5668 const lookup_name_info
&lookup_name
,
5671 int *made_global_lookup_p
)
5675 if (made_global_lookup_p
)
5676 *made_global_lookup_p
= 0;
5678 /* Special case: If the user specifies a symbol name inside package
5679 Standard, do a non-wild matching of the symbol name without
5680 the "standard__" prefix. This was primarily introduced in order
5681 to allow the user to specifically access the standard exceptions
5682 using, for instance, Standard.Constraint_Error when Constraint_Error
5683 is ambiguous (due to the user defining its own Constraint_Error
5684 entity inside its program). */
5685 if (lookup_name
.ada ().standard_p ())
5688 /* Check the non-global symbols. If we have ANY match, then we're done. */
5693 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5696 /* In the !full_search case we're are being called by
5697 ada_iterate_over_symbols, and we don't want to search
5699 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5701 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5705 /* No non-global symbols found. Check our cache to see if we have
5706 already performed this search before. If we have, then return
5709 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5710 domain
, &sym
, &block
))
5713 add_defn_to_vec (obstackp
, sym
, block
);
5717 if (made_global_lookup_p
)
5718 *made_global_lookup_p
= 1;
5720 /* Search symbols from all global blocks. */
5722 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5724 /* Now add symbols from all per-file blocks if we've gotten no hits
5725 (not strictly correct, but perhaps better than an error). */
5727 if (num_defns_collected (obstackp
) == 0)
5728 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5731 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5732 is non-zero, enclosing scope and in global scopes, returning the number of
5734 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5735 found and the blocks and symbol tables (if any) in which they were
5738 When full_search is non-zero, any non-function/non-enumeral
5739 symbol match within the nest of blocks whose innermost member is BLOCK,
5740 is the one match returned (no other matches in that or
5741 enclosing blocks is returned). If there are any matches in or
5742 surrounding BLOCK, then these alone are returned.
5744 Names prefixed with "standard__" are handled specially: "standard__"
5745 is first stripped off, and only static and global symbols are searched. */
5748 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5749 const struct block
*block
,
5751 std::vector
<struct block_symbol
> *results
,
5754 int syms_from_global_search
;
5756 auto_obstack obstack
;
5758 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5759 domain
, full_search
, &syms_from_global_search
);
5761 ndefns
= num_defns_collected (&obstack
);
5763 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5764 for (int i
= 0; i
< ndefns
; ++i
)
5765 results
->push_back (base
[i
]);
5767 ndefns
= remove_extra_symbols (results
);
5769 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5770 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5772 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5773 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5774 (*results
)[0].symbol
, (*results
)[0].block
);
5776 ndefns
= remove_irrelevant_renamings (results
, block
);
5781 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5782 in global scopes, returning the number of matches, and filling *RESULTS
5783 with (SYM,BLOCK) tuples.
5785 See ada_lookup_symbol_list_worker for further details. */
5788 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5790 std::vector
<struct block_symbol
> *results
)
5792 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5793 lookup_name_info
lookup_name (name
, name_match_type
);
5795 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5798 /* Implementation of the la_iterate_over_symbols method. */
5801 ada_iterate_over_symbols
5802 (const struct block
*block
, const lookup_name_info
&name
,
5804 gdb::function_view
<symbol_found_callback_ftype
> callback
)
5807 std::vector
<struct block_symbol
> results
;
5809 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5811 for (i
= 0; i
< ndefs
; ++i
)
5813 if (!callback (&results
[i
]))
5820 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5821 to 1, but choosing the first symbol found if there are multiple
5824 The result is stored in *INFO, which must be non-NULL.
5825 If no match is found, INFO->SYM is set to NULL. */
5828 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5830 struct block_symbol
*info
)
5832 /* Since we already have an encoded name, wrap it in '<>' to force a
5833 verbatim match. Otherwise, if the name happens to not look like
5834 an encoded name (because it doesn't include a "__"),
5835 ada_lookup_name_info would re-encode/fold it again, and that
5836 would e.g., incorrectly lowercase object renaming names like
5837 "R28b" -> "r28b". */
5838 std::string verbatim
= std::string ("<") + name
+ '>';
5840 gdb_assert (info
!= NULL
);
5841 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5844 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5845 scope and in global scopes, or NULL if none. NAME is folded and
5846 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5847 choosing the first symbol if there are multiple choices. */
5850 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5853 std::vector
<struct block_symbol
> candidates
;
5856 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5858 if (n_candidates
== 0)
5861 block_symbol info
= candidates
[0];
5862 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5866 static struct block_symbol
5867 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5869 const struct block
*block
,
5870 const domain_enum domain
)
5872 struct block_symbol sym
;
5874 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
5875 if (sym
.symbol
!= NULL
)
5878 /* If we haven't found a match at this point, try the primitive
5879 types. In other languages, this search is performed before
5880 searching for global symbols in order to short-circuit that
5881 global-symbol search if it happens that the name corresponds
5882 to a primitive type. But we cannot do the same in Ada, because
5883 it is perfectly legitimate for a program to declare a type which
5884 has the same name as a standard type. If looking up a type in
5885 that situation, we have traditionally ignored the primitive type
5886 in favor of user-defined types. This is why, unlike most other
5887 languages, we search the primitive types this late and only after
5888 having searched the global symbols without success. */
5890 if (domain
== VAR_DOMAIN
)
5892 struct gdbarch
*gdbarch
;
5895 gdbarch
= target_gdbarch ();
5897 gdbarch
= block_gdbarch (block
);
5898 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5899 if (sym
.symbol
!= NULL
)
5907 /* True iff STR is a possible encoded suffix of a normal Ada name
5908 that is to be ignored for matching purposes. Suffixes of parallel
5909 names (e.g., XVE) are not included here. Currently, the possible suffixes
5910 are given by any of the regular expressions:
5912 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5913 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5914 TKB [subprogram suffix for task bodies]
5915 _E[0-9]+[bs]$ [protected object entry suffixes]
5916 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5918 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5919 match is performed. This sequence is used to differentiate homonyms,
5920 is an optional part of a valid name suffix. */
5923 is_name_suffix (const char *str
)
5926 const char *matching
;
5927 const int len
= strlen (str
);
5929 /* Skip optional leading __[0-9]+. */
5931 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5934 while (isdigit (str
[0]))
5940 if (str
[0] == '.' || str
[0] == '$')
5943 while (isdigit (matching
[0]))
5945 if (matching
[0] == '\0')
5951 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5954 while (isdigit (matching
[0]))
5956 if (matching
[0] == '\0')
5960 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5962 if (strcmp (str
, "TKB") == 0)
5966 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5967 with a N at the end. Unfortunately, the compiler uses the same
5968 convention for other internal types it creates. So treating
5969 all entity names that end with an "N" as a name suffix causes
5970 some regressions. For instance, consider the case of an enumerated
5971 type. To support the 'Image attribute, it creates an array whose
5973 Having a single character like this as a suffix carrying some
5974 information is a bit risky. Perhaps we should change the encoding
5975 to be something like "_N" instead. In the meantime, do not do
5976 the following check. */
5977 /* Protected Object Subprograms */
5978 if (len
== 1 && str
[0] == 'N')
5983 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5986 while (isdigit (matching
[0]))
5988 if ((matching
[0] == 'b' || matching
[0] == 's')
5989 && matching
[1] == '\0')
5993 /* ??? We should not modify STR directly, as we are doing below. This
5994 is fine in this case, but may become problematic later if we find
5995 that this alternative did not work, and want to try matching
5996 another one from the begining of STR. Since we modified it, we
5997 won't be able to find the begining of the string anymore! */
6001 while (str
[0] != '_' && str
[0] != '\0')
6003 if (str
[0] != 'n' && str
[0] != 'b')
6009 if (str
[0] == '\000')
6014 if (str
[1] != '_' || str
[2] == '\000')
6018 if (strcmp (str
+ 3, "JM") == 0)
6020 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6021 the LJM suffix in favor of the JM one. But we will
6022 still accept LJM as a valid suffix for a reasonable
6023 amount of time, just to allow ourselves to debug programs
6024 compiled using an older version of GNAT. */
6025 if (strcmp (str
+ 3, "LJM") == 0)
6029 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
6030 || str
[4] == 'U' || str
[4] == 'P')
6032 if (str
[4] == 'R' && str
[5] != 'T')
6036 if (!isdigit (str
[2]))
6038 for (k
= 3; str
[k
] != '\0'; k
+= 1)
6039 if (!isdigit (str
[k
]) && str
[k
] != '_')
6043 if (str
[0] == '$' && isdigit (str
[1]))
6045 for (k
= 2; str
[k
] != '\0'; k
+= 1)
6046 if (!isdigit (str
[k
]) && str
[k
] != '_')
6053 /* Return non-zero if the string starting at NAME and ending before
6054 NAME_END contains no capital letters. */
6057 is_valid_name_for_wild_match (const char *name0
)
6059 std::string decoded_name
= ada_decode (name0
);
6062 /* If the decoded name starts with an angle bracket, it means that
6063 NAME0 does not follow the GNAT encoding format. It should then
6064 not be allowed as a possible wild match. */
6065 if (decoded_name
[0] == '<')
6068 for (i
=0; decoded_name
[i
] != '\0'; i
++)
6069 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6075 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6076 that could start a simple name. Assumes that *NAMEP points into
6077 the string beginning at NAME0. */
6080 advance_wild_match (const char **namep
, const char *name0
, int target0
)
6082 const char *name
= *namep
;
6092 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6095 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6100 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6101 || name
[2] == target0
))
6109 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6119 /* Return true iff NAME encodes a name of the form prefix.PATN.
6120 Ignores any informational suffixes of NAME (i.e., for which
6121 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6125 wild_match (const char *name
, const char *patn
)
6128 const char *name0
= name
;
6132 const char *match
= name
;
6136 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6139 if (*p
== '\0' && is_name_suffix (name
))
6140 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6142 if (name
[-1] == '_')
6145 if (!advance_wild_match (&name
, name0
, *patn
))
6150 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6151 any trailing suffixes that encode debugging information or leading
6152 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6153 information that is ignored). */
6156 full_match (const char *sym_name
, const char *search_name
)
6158 size_t search_name_len
= strlen (search_name
);
6160 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6161 && is_name_suffix (sym_name
+ search_name_len
))
6164 if (startswith (sym_name
, "_ada_")
6165 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6166 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6172 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6173 *defn_symbols, updating the list of symbols in OBSTACKP (if
6174 necessary). OBJFILE is the section containing BLOCK. */
6177 ada_add_block_symbols (struct obstack
*obstackp
,
6178 const struct block
*block
,
6179 const lookup_name_info
&lookup_name
,
6180 domain_enum domain
, struct objfile
*objfile
)
6182 struct block_iterator iter
;
6183 /* A matching argument symbol, if any. */
6184 struct symbol
*arg_sym
;
6185 /* Set true when we find a matching non-argument symbol. */
6191 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6193 sym
= block_iter_match_next (lookup_name
, &iter
))
6195 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6197 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6199 if (SYMBOL_IS_ARGUMENT (sym
))
6204 add_defn_to_vec (obstackp
,
6205 fixup_symbol_section (sym
, objfile
),
6212 /* Handle renamings. */
6214 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6217 if (!found_sym
&& arg_sym
!= NULL
)
6219 add_defn_to_vec (obstackp
,
6220 fixup_symbol_section (arg_sym
, objfile
),
6224 if (!lookup_name
.ada ().wild_match_p ())
6228 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6229 const char *name
= ada_lookup_name
.c_str ();
6230 size_t name_len
= ada_lookup_name
.size ();
6232 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6234 if (symbol_matches_domain (sym
->language (),
6235 SYMBOL_DOMAIN (sym
), domain
))
6239 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6242 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6244 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6249 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6251 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6253 if (SYMBOL_IS_ARGUMENT (sym
))
6258 add_defn_to_vec (obstackp
,
6259 fixup_symbol_section (sym
, objfile
),
6267 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6268 They aren't parameters, right? */
6269 if (!found_sym
&& arg_sym
!= NULL
)
6271 add_defn_to_vec (obstackp
,
6272 fixup_symbol_section (arg_sym
, objfile
),
6279 /* Symbol Completion */
6284 ada_lookup_name_info::matches
6285 (const char *sym_name
,
6286 symbol_name_match_type match_type
,
6287 completion_match_result
*comp_match_res
) const
6290 const char *text
= m_encoded_name
.c_str ();
6291 size_t text_len
= m_encoded_name
.size ();
6293 /* First, test against the fully qualified name of the symbol. */
6295 if (strncmp (sym_name
, text
, text_len
) == 0)
6298 std::string decoded_name
= ada_decode (sym_name
);
6299 if (match
&& !m_encoded_p
)
6301 /* One needed check before declaring a positive match is to verify
6302 that iff we are doing a verbatim match, the decoded version
6303 of the symbol name starts with '<'. Otherwise, this symbol name
6304 is not a suitable completion. */
6306 bool has_angle_bracket
= (decoded_name
[0] == '<');
6307 match
= (has_angle_bracket
== m_verbatim_p
);
6310 if (match
&& !m_verbatim_p
)
6312 /* When doing non-verbatim match, another check that needs to
6313 be done is to verify that the potentially matching symbol name
6314 does not include capital letters, because the ada-mode would
6315 not be able to understand these symbol names without the
6316 angle bracket notation. */
6319 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6324 /* Second: Try wild matching... */
6326 if (!match
&& m_wild_match_p
)
6328 /* Since we are doing wild matching, this means that TEXT
6329 may represent an unqualified symbol name. We therefore must
6330 also compare TEXT against the unqualified name of the symbol. */
6331 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6333 if (strncmp (sym_name
, text
, text_len
) == 0)
6337 /* Finally: If we found a match, prepare the result to return. */
6342 if (comp_match_res
!= NULL
)
6344 std::string
&match_str
= comp_match_res
->match
.storage ();
6347 match_str
= ada_decode (sym_name
);
6351 match_str
= add_angle_brackets (sym_name
);
6353 match_str
= sym_name
;
6357 comp_match_res
->set_match (match_str
.c_str ());
6363 /* Add the list of possible symbol names completing TEXT to TRACKER.
6364 WORD is the entire command on which completion is made. */
6367 ada_collect_symbol_completion_matches (completion_tracker
&tracker
,
6368 complete_symbol_mode mode
,
6369 symbol_name_match_type name_match_type
,
6370 const char *text
, const char *word
,
6371 enum type_code code
)
6374 const struct block
*b
, *surrounding_static_block
= 0;
6375 struct block_iterator iter
;
6377 gdb_assert (code
== TYPE_CODE_UNDEF
);
6379 lookup_name_info
lookup_name (text
, name_match_type
, true);
6381 /* First, look at the partial symtab symbols. */
6382 expand_symtabs_matching (NULL
,
6388 /* At this point scan through the misc symbol vectors and add each
6389 symbol you find to the list. Eventually we want to ignore
6390 anything that isn't a text symbol (everything else will be
6391 handled by the psymtab code above). */
6393 for (objfile
*objfile
: current_program_space
->objfiles ())
6395 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
6399 if (completion_skip_symbol (mode
, msymbol
))
6402 language symbol_language
= msymbol
->language ();
6404 /* Ada minimal symbols won't have their language set to Ada. If
6405 we let completion_list_add_name compare using the
6406 default/C-like matcher, then when completing e.g., symbols in a
6407 package named "pck", we'd match internal Ada symbols like
6408 "pckS", which are invalid in an Ada expression, unless you wrap
6409 them in '<' '>' to request a verbatim match.
6411 Unfortunately, some Ada encoded names successfully demangle as
6412 C++ symbols (using an old mangling scheme), such as "name__2Xn"
6413 -> "Xn::name(void)" and thus some Ada minimal symbols end up
6414 with the wrong language set. Paper over that issue here. */
6415 if (symbol_language
== language_auto
6416 || symbol_language
== language_cplus
)
6417 symbol_language
= language_ada
;
6419 completion_list_add_name (tracker
,
6421 msymbol
->linkage_name (),
6422 lookup_name
, text
, word
);
6426 /* Search upwards from currently selected frame (so that we can
6427 complete on local vars. */
6429 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6431 if (!BLOCK_SUPERBLOCK (b
))
6432 surrounding_static_block
= b
; /* For elmin of dups */
6434 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6436 if (completion_skip_symbol (mode
, sym
))
6439 completion_list_add_name (tracker
,
6441 sym
->linkage_name (),
6442 lookup_name
, text
, word
);
6446 /* Go through the symtabs and check the externs and statics for
6447 symbols which match. */
6449 for (objfile
*objfile
: current_program_space
->objfiles ())
6451 for (compunit_symtab
*s
: objfile
->compunits ())
6454 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6455 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6457 if (completion_skip_symbol (mode
, sym
))
6460 completion_list_add_name (tracker
,
6462 sym
->linkage_name (),
6463 lookup_name
, text
, word
);
6468 for (objfile
*objfile
: current_program_space
->objfiles ())
6470 for (compunit_symtab
*s
: objfile
->compunits ())
6473 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6474 /* Don't do this block twice. */
6475 if (b
== surrounding_static_block
)
6477 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6479 if (completion_skip_symbol (mode
, sym
))
6482 completion_list_add_name (tracker
,
6484 sym
->linkage_name (),
6485 lookup_name
, text
, word
);
6493 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6494 for tagged types. */
6497 ada_is_dispatch_table_ptr_type (struct type
*type
)
6501 if (type
->code () != TYPE_CODE_PTR
)
6504 name
= TYPE_TARGET_TYPE (type
)->name ();
6508 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6511 /* Return non-zero if TYPE is an interface tag. */
6514 ada_is_interface_tag (struct type
*type
)
6516 const char *name
= type
->name ();
6521 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6524 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6525 to be invisible to users. */
6528 ada_is_ignored_field (struct type
*type
, int field_num
)
6530 if (field_num
< 0 || field_num
> type
->num_fields ())
6533 /* Check the name of that field. */
6535 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6537 /* Anonymous field names should not be printed.
6538 brobecker/2007-02-20: I don't think this can actually happen
6539 but we don't want to print the value of anonymous fields anyway. */
6543 /* Normally, fields whose name start with an underscore ("_")
6544 are fields that have been internally generated by the compiler,
6545 and thus should not be printed. The "_parent" field is special,
6546 however: This is a field internally generated by the compiler
6547 for tagged types, and it contains the components inherited from
6548 the parent type. This field should not be printed as is, but
6549 should not be ignored either. */
6550 if (name
[0] == '_' && !startswith (name
, "_parent"))
6554 /* If this is the dispatch table of a tagged type or an interface tag,
6556 if (ada_is_tagged_type (type
, 1)
6557 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6558 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6561 /* Not a special field, so it should not be ignored. */
6565 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6566 pointer or reference type whose ultimate target has a tag field. */
6569 ada_is_tagged_type (struct type
*type
, int refok
)
6571 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6574 /* True iff TYPE represents the type of X'Tag */
6577 ada_is_tag_type (struct type
*type
)
6579 type
= ada_check_typedef (type
);
6581 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6585 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6587 return (name
!= NULL
6588 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6592 /* The type of the tag on VAL. */
6594 static struct type
*
6595 ada_tag_type (struct value
*val
)
6597 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6600 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6601 retired at Ada 05). */
6604 is_ada95_tag (struct value
*tag
)
6606 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6609 /* The value of the tag on VAL. */
6611 static struct value
*
6612 ada_value_tag (struct value
*val
)
6614 return ada_value_struct_elt (val
, "_tag", 0);
6617 /* The value of the tag on the object of type TYPE whose contents are
6618 saved at VALADDR, if it is non-null, or is at memory address
6621 static struct value
*
6622 value_tag_from_contents_and_address (struct type
*type
,
6623 const gdb_byte
*valaddr
,
6626 int tag_byte_offset
;
6627 struct type
*tag_type
;
6629 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6632 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6634 : valaddr
+ tag_byte_offset
);
6635 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6637 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6642 static struct type
*
6643 type_from_tag (struct value
*tag
)
6645 const char *type_name
= ada_tag_name (tag
);
6647 if (type_name
!= NULL
)
6648 return ada_find_any_type (ada_encode (type_name
));
6652 /* Given a value OBJ of a tagged type, return a value of this
6653 type at the base address of the object. The base address, as
6654 defined in Ada.Tags, it is the address of the primary tag of
6655 the object, and therefore where the field values of its full
6656 view can be fetched. */
6659 ada_tag_value_at_base_address (struct value
*obj
)
6662 LONGEST offset_to_top
= 0;
6663 struct type
*ptr_type
, *obj_type
;
6665 CORE_ADDR base_address
;
6667 obj_type
= value_type (obj
);
6669 /* It is the responsability of the caller to deref pointers. */
6671 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6674 tag
= ada_value_tag (obj
);
6678 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6680 if (is_ada95_tag (tag
))
6683 ptr_type
= language_lookup_primitive_type
6684 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6685 ptr_type
= lookup_pointer_type (ptr_type
);
6686 val
= value_cast (ptr_type
, tag
);
6690 /* It is perfectly possible that an exception be raised while
6691 trying to determine the base address, just like for the tag;
6692 see ada_tag_name for more details. We do not print the error
6693 message for the same reason. */
6697 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6700 catch (const gdb_exception_error
&e
)
6705 /* If offset is null, nothing to do. */
6707 if (offset_to_top
== 0)
6710 /* -1 is a special case in Ada.Tags; however, what should be done
6711 is not quite clear from the documentation. So do nothing for
6714 if (offset_to_top
== -1)
6717 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6718 from the base address. This was however incompatible with
6719 C++ dispatch table: C++ uses a *negative* value to *add*
6720 to the base address. Ada's convention has therefore been
6721 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6722 use the same convention. Here, we support both cases by
6723 checking the sign of OFFSET_TO_TOP. */
6725 if (offset_to_top
> 0)
6726 offset_to_top
= -offset_to_top
;
6728 base_address
= value_address (obj
) + offset_to_top
;
6729 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6731 /* Make sure that we have a proper tag at the new address.
6732 Otherwise, offset_to_top is bogus (which can happen when
6733 the object is not initialized yet). */
6738 obj_type
= type_from_tag (tag
);
6743 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6746 /* Return the "ada__tags__type_specific_data" type. */
6748 static struct type
*
6749 ada_get_tsd_type (struct inferior
*inf
)
6751 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6753 if (data
->tsd_type
== 0)
6754 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6755 return data
->tsd_type
;
6758 /* Return the TSD (type-specific data) associated to the given TAG.
6759 TAG is assumed to be the tag of a tagged-type entity.
6761 May return NULL if we are unable to get the TSD. */
6763 static struct value
*
6764 ada_get_tsd_from_tag (struct value
*tag
)
6769 /* First option: The TSD is simply stored as a field of our TAG.
6770 Only older versions of GNAT would use this format, but we have
6771 to test it first, because there are no visible markers for
6772 the current approach except the absence of that field. */
6774 val
= ada_value_struct_elt (tag
, "tsd", 1);
6778 /* Try the second representation for the dispatch table (in which
6779 there is no explicit 'tsd' field in the referent of the tag pointer,
6780 and instead the tsd pointer is stored just before the dispatch
6783 type
= ada_get_tsd_type (current_inferior());
6786 type
= lookup_pointer_type (lookup_pointer_type (type
));
6787 val
= value_cast (type
, tag
);
6790 return value_ind (value_ptradd (val
, -1));
6793 /* Given the TSD of a tag (type-specific data), return a string
6794 containing the name of the associated type.
6796 The returned value is good until the next call. May return NULL
6797 if we are unable to determine the tag name. */
6800 ada_tag_name_from_tsd (struct value
*tsd
)
6802 static char name
[1024];
6806 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6809 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6810 for (p
= name
; *p
!= '\0'; p
+= 1)
6816 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6819 Return NULL if the TAG is not an Ada tag, or if we were unable to
6820 determine the name of that tag. The result is good until the next
6824 ada_tag_name (struct value
*tag
)
6828 if (!ada_is_tag_type (value_type (tag
)))
6831 /* It is perfectly possible that an exception be raised while trying
6832 to determine the TAG's name, even under normal circumstances:
6833 The associated variable may be uninitialized or corrupted, for
6834 instance. We do not let any exception propagate past this point.
6835 instead we return NULL.
6837 We also do not print the error message either (which often is very
6838 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6839 the caller print a more meaningful message if necessary. */
6842 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6845 name
= ada_tag_name_from_tsd (tsd
);
6847 catch (const gdb_exception_error
&e
)
6854 /* The parent type of TYPE, or NULL if none. */
6857 ada_parent_type (struct type
*type
)
6861 type
= ada_check_typedef (type
);
6863 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6866 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6867 if (ada_is_parent_field (type
, i
))
6869 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6871 /* If the _parent field is a pointer, then dereference it. */
6872 if (parent_type
->code () == TYPE_CODE_PTR
)
6873 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6874 /* If there is a parallel XVS type, get the actual base type. */
6875 parent_type
= ada_get_base_type (parent_type
);
6877 return ada_check_typedef (parent_type
);
6883 /* True iff field number FIELD_NUM of structure type TYPE contains the
6884 parent-type (inherited) fields of a derived type. Assumes TYPE is
6885 a structure type with at least FIELD_NUM+1 fields. */
6888 ada_is_parent_field (struct type
*type
, int field_num
)
6890 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6892 return (name
!= NULL
6893 && (startswith (name
, "PARENT")
6894 || startswith (name
, "_parent")));
6897 /* True iff field number FIELD_NUM of structure type TYPE is a
6898 transparent wrapper field (which should be silently traversed when doing
6899 field selection and flattened when printing). Assumes TYPE is a
6900 structure type with at least FIELD_NUM+1 fields. Such fields are always
6904 ada_is_wrapper_field (struct type
*type
, int field_num
)
6906 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6908 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6910 /* This happens in functions with "out" or "in out" parameters
6911 which are passed by copy. For such functions, GNAT describes
6912 the function's return type as being a struct where the return
6913 value is in a field called RETVAL, and where the other "out"
6914 or "in out" parameters are fields of that struct. This is not
6919 return (name
!= NULL
6920 && (startswith (name
, "PARENT")
6921 || strcmp (name
, "REP") == 0
6922 || startswith (name
, "_parent")
6923 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6926 /* True iff field number FIELD_NUM of structure or union type TYPE
6927 is a variant wrapper. Assumes TYPE is a structure type with at least
6928 FIELD_NUM+1 fields. */
6931 ada_is_variant_part (struct type
*type
, int field_num
)
6933 /* Only Ada types are eligible. */
6934 if (!ADA_TYPE_P (type
))
6937 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6939 return (field_type
->code () == TYPE_CODE_UNION
6940 || (is_dynamic_field (type
, field_num
)
6941 && (TYPE_TARGET_TYPE (field_type
)->code ()
6942 == TYPE_CODE_UNION
)));
6945 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6946 whose discriminants are contained in the record type OUTER_TYPE,
6947 returns the type of the controlling discriminant for the variant.
6948 May return NULL if the type could not be found. */
6951 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6953 const char *name
= ada_variant_discrim_name (var_type
);
6955 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6958 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6959 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6960 represents a 'when others' clause; otherwise 0. */
6963 ada_is_others_clause (struct type
*type
, int field_num
)
6965 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6967 return (name
!= NULL
&& name
[0] == 'O');
6970 /* Assuming that TYPE0 is the type of the variant part of a record,
6971 returns the name of the discriminant controlling the variant.
6972 The value is valid until the next call to ada_variant_discrim_name. */
6975 ada_variant_discrim_name (struct type
*type0
)
6977 static char *result
= NULL
;
6978 static size_t result_len
= 0;
6981 const char *discrim_end
;
6982 const char *discrim_start
;
6984 if (type0
->code () == TYPE_CODE_PTR
)
6985 type
= TYPE_TARGET_TYPE (type0
);
6989 name
= ada_type_name (type
);
6991 if (name
== NULL
|| name
[0] == '\000')
6994 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6997 if (startswith (discrim_end
, "___XVN"))
7000 if (discrim_end
== name
)
7003 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
7006 if (discrim_start
== name
+ 1)
7008 if ((discrim_start
> name
+ 3
7009 && startswith (discrim_start
- 3, "___"))
7010 || discrim_start
[-1] == '.')
7014 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
7015 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
7016 result
[discrim_end
- discrim_start
] = '\0';
7020 /* Scan STR for a subtype-encoded number, beginning at position K.
7021 Put the position of the character just past the number scanned in
7022 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7023 Return 1 if there was a valid number at the given position, and 0
7024 otherwise. A "subtype-encoded" number consists of the absolute value
7025 in decimal, followed by the letter 'm' to indicate a negative number.
7026 Assumes 0m does not occur. */
7029 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
7033 if (!isdigit (str
[k
]))
7036 /* Do it the hard way so as not to make any assumption about
7037 the relationship of unsigned long (%lu scan format code) and
7040 while (isdigit (str
[k
]))
7042 RU
= RU
* 10 + (str
[k
] - '0');
7049 *R
= (-(LONGEST
) (RU
- 1)) - 1;
7055 /* NOTE on the above: Technically, C does not say what the results of
7056 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7057 number representable as a LONGEST (although either would probably work
7058 in most implementations). When RU>0, the locution in the then branch
7059 above is always equivalent to the negative of RU. */
7066 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7067 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7068 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7071 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
7073 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7087 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
7097 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
7098 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7100 if (val
>= L
&& val
<= U
)
7112 /* FIXME: Lots of redundancy below. Try to consolidate. */
7114 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7115 ARG_TYPE, extract and return the value of one of its (non-static)
7116 fields. FIELDNO says which field. Differs from value_primitive_field
7117 only in that it can handle packed values of arbitrary type. */
7120 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7121 struct type
*arg_type
)
7125 arg_type
= ada_check_typedef (arg_type
);
7126 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
7128 /* Handle packed fields. It might be that the field is not packed
7129 relative to its containing structure, but the structure itself is
7130 packed; in this case we must take the bit-field path. */
7131 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
7133 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7134 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7136 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7137 offset
+ bit_pos
/ 8,
7138 bit_pos
% 8, bit_size
, type
);
7141 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7144 /* Find field with name NAME in object of type TYPE. If found,
7145 set the following for each argument that is non-null:
7146 - *FIELD_TYPE_P to the field's type;
7147 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7148 an object of that type;
7149 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7150 - *BIT_SIZE_P to its size in bits if the field is packed, and
7152 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7153 fields up to but not including the desired field, or by the total
7154 number of fields if not found. A NULL value of NAME never
7155 matches; the function just counts visible fields in this case.
7157 Notice that we need to handle when a tagged record hierarchy
7158 has some components with the same name, like in this scenario:
7160 type Top_T is tagged record
7166 type Middle_T is new Top.Top_T with record
7167 N : Character := 'a';
7171 type Bottom_T is new Middle.Middle_T with record
7173 C : Character := '5';
7175 A : Character := 'J';
7178 Let's say we now have a variable declared and initialized as follow:
7180 TC : Top_A := new Bottom_T;
7182 And then we use this variable to call this function
7184 procedure Assign (Obj: in out Top_T; TV : Integer);
7188 Assign (Top_T (B), 12);
7190 Now, we're in the debugger, and we're inside that procedure
7191 then and we want to print the value of obj.c:
7193 Usually, the tagged record or one of the parent type owns the
7194 component to print and there's no issue but in this particular
7195 case, what does it mean to ask for Obj.C? Since the actual
7196 type for object is type Bottom_T, it could mean two things: type
7197 component C from the Middle_T view, but also component C from
7198 Bottom_T. So in that "undefined" case, when the component is
7199 not found in the non-resolved type (which includes all the
7200 components of the parent type), then resolve it and see if we
7201 get better luck once expanded.
7203 In the case of homonyms in the derived tagged type, we don't
7204 guaranty anything, and pick the one that's easiest for us
7207 Returns 1 if found, 0 otherwise. */
7210 find_struct_field (const char *name
, struct type
*type
, int offset
,
7211 struct type
**field_type_p
,
7212 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7216 int parent_offset
= -1;
7218 type
= ada_check_typedef (type
);
7220 if (field_type_p
!= NULL
)
7221 *field_type_p
= NULL
;
7222 if (byte_offset_p
!= NULL
)
7224 if (bit_offset_p
!= NULL
)
7226 if (bit_size_p
!= NULL
)
7229 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7231 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7232 int fld_offset
= offset
+ bit_pos
/ 8;
7233 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7235 if (t_field_name
== NULL
)
7238 else if (ada_is_parent_field (type
, i
))
7240 /* This is a field pointing us to the parent type of a tagged
7241 type. As hinted in this function's documentation, we give
7242 preference to fields in the current record first, so what
7243 we do here is just record the index of this field before
7244 we skip it. If it turns out we couldn't find our field
7245 in the current record, then we'll get back to it and search
7246 inside it whether the field might exist in the parent. */
7252 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7254 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7256 if (field_type_p
!= NULL
)
7257 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7258 if (byte_offset_p
!= NULL
)
7259 *byte_offset_p
= fld_offset
;
7260 if (bit_offset_p
!= NULL
)
7261 *bit_offset_p
= bit_pos
% 8;
7262 if (bit_size_p
!= NULL
)
7263 *bit_size_p
= bit_size
;
7266 else if (ada_is_wrapper_field (type
, i
))
7268 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7269 field_type_p
, byte_offset_p
, bit_offset_p
,
7270 bit_size_p
, index_p
))
7273 else if (ada_is_variant_part (type
, i
))
7275 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7278 struct type
*field_type
7279 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7281 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7283 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7285 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7286 field_type_p
, byte_offset_p
,
7287 bit_offset_p
, bit_size_p
, index_p
))
7291 else if (index_p
!= NULL
)
7295 /* Field not found so far. If this is a tagged type which
7296 has a parent, try finding that field in the parent now. */
7298 if (parent_offset
!= -1)
7300 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7301 int fld_offset
= offset
+ bit_pos
/ 8;
7303 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, parent_offset
),
7304 fld_offset
, field_type_p
, byte_offset_p
,
7305 bit_offset_p
, bit_size_p
, index_p
))
7312 /* Number of user-visible fields in record type TYPE. */
7315 num_visible_fields (struct type
*type
)
7320 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7324 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7325 and search in it assuming it has (class) type TYPE.
7326 If found, return value, else return NULL.
7328 Searches recursively through wrapper fields (e.g., '_parent').
7330 In the case of homonyms in the tagged types, please refer to the
7331 long explanation in find_struct_field's function documentation. */
7333 static struct value
*
7334 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7338 int parent_offset
= -1;
7340 type
= ada_check_typedef (type
);
7341 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7343 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7345 if (t_field_name
== NULL
)
7348 else if (ada_is_parent_field (type
, i
))
7350 /* This is a field pointing us to the parent type of a tagged
7351 type. As hinted in this function's documentation, we give
7352 preference to fields in the current record first, so what
7353 we do here is just record the index of this field before
7354 we skip it. If it turns out we couldn't find our field
7355 in the current record, then we'll get back to it and search
7356 inside it whether the field might exist in the parent. */
7362 else if (field_name_match (t_field_name
, name
))
7363 return ada_value_primitive_field (arg
, offset
, i
, type
);
7365 else if (ada_is_wrapper_field (type
, i
))
7367 struct value
*v
= /* Do not let indent join lines here. */
7368 ada_search_struct_field (name
, arg
,
7369 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7370 TYPE_FIELD_TYPE (type
, i
));
7376 else if (ada_is_variant_part (type
, i
))
7378 /* PNH: Do we ever get here? See find_struct_field. */
7380 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7382 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7384 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7386 struct value
*v
= ada_search_struct_field
/* Force line
7389 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7390 TYPE_FIELD_TYPE (field_type
, j
));
7398 /* Field not found so far. If this is a tagged type which
7399 has a parent, try finding that field in the parent now. */
7401 if (parent_offset
!= -1)
7403 struct value
*v
= ada_search_struct_field (
7404 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7405 TYPE_FIELD_TYPE (type
, parent_offset
));
7414 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7415 int, struct type
*);
7418 /* Return field #INDEX in ARG, where the index is that returned by
7419 * find_struct_field through its INDEX_P argument. Adjust the address
7420 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7421 * If found, return value, else return NULL. */
7423 static struct value
*
7424 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7427 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7431 /* Auxiliary function for ada_index_struct_field. Like
7432 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7435 static struct value
*
7436 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7440 type
= ada_check_typedef (type
);
7442 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7444 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7446 else if (ada_is_wrapper_field (type
, i
))
7448 struct value
*v
= /* Do not let indent join lines here. */
7449 ada_index_struct_field_1 (index_p
, arg
,
7450 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7451 TYPE_FIELD_TYPE (type
, i
));
7457 else if (ada_is_variant_part (type
, i
))
7459 /* PNH: Do we ever get here? See ada_search_struct_field,
7460 find_struct_field. */
7461 error (_("Cannot assign this kind of variant record"));
7463 else if (*index_p
== 0)
7464 return ada_value_primitive_field (arg
, offset
, i
, type
);
7471 /* Return a string representation of type TYPE. */
7474 type_as_string (struct type
*type
)
7476 string_file tmp_stream
;
7478 type_print (type
, "", &tmp_stream
, -1);
7480 return std::move (tmp_stream
.string ());
7483 /* Given a type TYPE, look up the type of the component of type named NAME.
7484 If DISPP is non-null, add its byte displacement from the beginning of a
7485 structure (pointed to by a value) of type TYPE to *DISPP (does not
7486 work for packed fields).
7488 Matches any field whose name has NAME as a prefix, possibly
7491 TYPE can be either a struct or union. If REFOK, TYPE may also
7492 be a (pointer or reference)+ to a struct or union, and the
7493 ultimate target type will be searched.
7495 Looks recursively into variant clauses and parent types.
7497 In the case of homonyms in the tagged types, please refer to the
7498 long explanation in find_struct_field's function documentation.
7500 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7501 TYPE is not a type of the right kind. */
7503 static struct type
*
7504 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7508 int parent_offset
= -1;
7513 if (refok
&& type
!= NULL
)
7516 type
= ada_check_typedef (type
);
7517 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7519 type
= TYPE_TARGET_TYPE (type
);
7523 || (type
->code () != TYPE_CODE_STRUCT
7524 && type
->code () != TYPE_CODE_UNION
))
7529 error (_("Type %s is not a structure or union type"),
7530 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7533 type
= to_static_fixed_type (type
);
7535 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7537 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7540 if (t_field_name
== NULL
)
7543 else if (ada_is_parent_field (type
, i
))
7545 /* This is a field pointing us to the parent type of a tagged
7546 type. As hinted in this function's documentation, we give
7547 preference to fields in the current record first, so what
7548 we do here is just record the index of this field before
7549 we skip it. If it turns out we couldn't find our field
7550 in the current record, then we'll get back to it and search
7551 inside it whether the field might exist in the parent. */
7557 else if (field_name_match (t_field_name
, name
))
7558 return TYPE_FIELD_TYPE (type
, i
);
7560 else if (ada_is_wrapper_field (type
, i
))
7562 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7568 else if (ada_is_variant_part (type
, i
))
7571 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7574 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
7576 /* FIXME pnh 2008/01/26: We check for a field that is
7577 NOT wrapped in a struct, since the compiler sometimes
7578 generates these for unchecked variant types. Revisit
7579 if the compiler changes this practice. */
7580 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7582 if (v_field_name
!= NULL
7583 && field_name_match (v_field_name
, name
))
7584 t
= TYPE_FIELD_TYPE (field_type
, j
);
7586 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7597 /* Field not found so far. If this is a tagged type which
7598 has a parent, try finding that field in the parent now. */
7600 if (parent_offset
!= -1)
7604 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, parent_offset
),
7613 const char *name_str
= name
!= NULL
? name
: _("<null>");
7615 error (_("Type %s has no component named %s"),
7616 type_as_string (type
).c_str (), name_str
);
7622 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7623 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7624 represents an unchecked union (that is, the variant part of a
7625 record that is named in an Unchecked_Union pragma). */
7628 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7630 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7632 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7636 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7637 within OUTER, determine which variant clause (field number in VAR_TYPE,
7638 numbering from 0) is applicable. Returns -1 if none are. */
7641 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7645 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7646 struct value
*discrim
;
7647 LONGEST discrim_val
;
7649 /* Using plain value_from_contents_and_address here causes problems
7650 because we will end up trying to resolve a type that is currently
7651 being constructed. */
7652 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7653 if (discrim
== NULL
)
7655 discrim_val
= value_as_long (discrim
);
7658 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7660 if (ada_is_others_clause (var_type
, i
))
7662 else if (ada_in_variant (discrim_val
, var_type
, i
))
7666 return others_clause
;
7671 /* Dynamic-Sized Records */
7673 /* Strategy: The type ostensibly attached to a value with dynamic size
7674 (i.e., a size that is not statically recorded in the debugging
7675 data) does not accurately reflect the size or layout of the value.
7676 Our strategy is to convert these values to values with accurate,
7677 conventional types that are constructed on the fly. */
7679 /* There is a subtle and tricky problem here. In general, we cannot
7680 determine the size of dynamic records without its data. However,
7681 the 'struct value' data structure, which GDB uses to represent
7682 quantities in the inferior process (the target), requires the size
7683 of the type at the time of its allocation in order to reserve space
7684 for GDB's internal copy of the data. That's why the
7685 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7686 rather than struct value*s.
7688 However, GDB's internal history variables ($1, $2, etc.) are
7689 struct value*s containing internal copies of the data that are not, in
7690 general, the same as the data at their corresponding addresses in
7691 the target. Fortunately, the types we give to these values are all
7692 conventional, fixed-size types (as per the strategy described
7693 above), so that we don't usually have to perform the
7694 'to_fixed_xxx_type' conversions to look at their values.
7695 Unfortunately, there is one exception: if one of the internal
7696 history variables is an array whose elements are unconstrained
7697 records, then we will need to create distinct fixed types for each
7698 element selected. */
7700 /* The upshot of all of this is that many routines take a (type, host
7701 address, target address) triple as arguments to represent a value.
7702 The host address, if non-null, is supposed to contain an internal
7703 copy of the relevant data; otherwise, the program is to consult the
7704 target at the target address. */
7706 /* Assuming that VAL0 represents a pointer value, the result of
7707 dereferencing it. Differs from value_ind in its treatment of
7708 dynamic-sized types. */
7711 ada_value_ind (struct value
*val0
)
7713 struct value
*val
= value_ind (val0
);
7715 if (ada_is_tagged_type (value_type (val
), 0))
7716 val
= ada_tag_value_at_base_address (val
);
7718 return ada_to_fixed_value (val
);
7721 /* The value resulting from dereferencing any "reference to"
7722 qualifiers on VAL0. */
7724 static struct value
*
7725 ada_coerce_ref (struct value
*val0
)
7727 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7729 struct value
*val
= val0
;
7731 val
= coerce_ref (val
);
7733 if (ada_is_tagged_type (value_type (val
), 0))
7734 val
= ada_tag_value_at_base_address (val
);
7736 return ada_to_fixed_value (val
);
7742 /* Return the bit alignment required for field #F of template type TYPE. */
7745 field_alignment (struct type
*type
, int f
)
7747 const char *name
= TYPE_FIELD_NAME (type
, f
);
7751 /* The field name should never be null, unless the debugging information
7752 is somehow malformed. In this case, we assume the field does not
7753 require any alignment. */
7757 len
= strlen (name
);
7759 if (!isdigit (name
[len
- 1]))
7762 if (isdigit (name
[len
- 2]))
7763 align_offset
= len
- 2;
7765 align_offset
= len
- 1;
7767 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7768 return TARGET_CHAR_BIT
;
7770 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7773 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7775 static struct symbol
*
7776 ada_find_any_type_symbol (const char *name
)
7780 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7781 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7784 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7788 /* Find a type named NAME. Ignores ambiguity. This routine will look
7789 solely for types defined by debug info, it will not search the GDB
7792 static struct type
*
7793 ada_find_any_type (const char *name
)
7795 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7798 return SYMBOL_TYPE (sym
);
7803 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7804 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7805 symbol, in which case it is returned. Otherwise, this looks for
7806 symbols whose name is that of NAME_SYM suffixed with "___XR".
7807 Return symbol if found, and NULL otherwise. */
7810 ada_is_renaming_symbol (struct symbol
*name_sym
)
7812 const char *name
= name_sym
->linkage_name ();
7813 return strstr (name
, "___XR") != NULL
;
7816 /* Because of GNAT encoding conventions, several GDB symbols may match a
7817 given type name. If the type denoted by TYPE0 is to be preferred to
7818 that of TYPE1 for purposes of type printing, return non-zero;
7819 otherwise return 0. */
7822 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7826 else if (type0
== NULL
)
7828 else if (type1
->code () == TYPE_CODE_VOID
)
7830 else if (type0
->code () == TYPE_CODE_VOID
)
7832 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7834 else if (ada_is_constrained_packed_array_type (type0
))
7836 else if (ada_is_array_descriptor_type (type0
)
7837 && !ada_is_array_descriptor_type (type1
))
7841 const char *type0_name
= type0
->name ();
7842 const char *type1_name
= type1
->name ();
7844 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7845 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7851 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7855 ada_type_name (struct type
*type
)
7859 return type
->name ();
7862 /* Search the list of "descriptive" types associated to TYPE for a type
7863 whose name is NAME. */
7865 static struct type
*
7866 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7868 struct type
*result
, *tmp
;
7870 if (ada_ignore_descriptive_types_p
)
7873 /* If there no descriptive-type info, then there is no parallel type
7875 if (!HAVE_GNAT_AUX_INFO (type
))
7878 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7879 while (result
!= NULL
)
7881 const char *result_name
= ada_type_name (result
);
7883 if (result_name
== NULL
)
7885 warning (_("unexpected null name on descriptive type"));
7889 /* If the names match, stop. */
7890 if (strcmp (result_name
, name
) == 0)
7893 /* Otherwise, look at the next item on the list, if any. */
7894 if (HAVE_GNAT_AUX_INFO (result
))
7895 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7899 /* If not found either, try after having resolved the typedef. */
7904 result
= check_typedef (result
);
7905 if (HAVE_GNAT_AUX_INFO (result
))
7906 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7912 /* If we didn't find a match, see whether this is a packed array. With
7913 older compilers, the descriptive type information is either absent or
7914 irrelevant when it comes to packed arrays so the above lookup fails.
7915 Fall back to using a parallel lookup by name in this case. */
7916 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7917 return ada_find_any_type (name
);
7922 /* Find a parallel type to TYPE with the specified NAME, using the
7923 descriptive type taken from the debugging information, if available,
7924 and otherwise using the (slower) name-based method. */
7926 static struct type
*
7927 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7929 struct type
*result
= NULL
;
7931 if (HAVE_GNAT_AUX_INFO (type
))
7932 result
= find_parallel_type_by_descriptive_type (type
, name
);
7934 result
= ada_find_any_type (name
);
7939 /* Same as above, but specify the name of the parallel type by appending
7940 SUFFIX to the name of TYPE. */
7943 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7946 const char *type_name
= ada_type_name (type
);
7949 if (type_name
== NULL
)
7952 len
= strlen (type_name
);
7954 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7956 strcpy (name
, type_name
);
7957 strcpy (name
+ len
, suffix
);
7959 return ada_find_parallel_type_with_name (type
, name
);
7962 /* If TYPE is a variable-size record type, return the corresponding template
7963 type describing its fields. Otherwise, return NULL. */
7965 static struct type
*
7966 dynamic_template_type (struct type
*type
)
7968 type
= ada_check_typedef (type
);
7970 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7971 || ada_type_name (type
) == NULL
)
7975 int len
= strlen (ada_type_name (type
));
7977 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7980 return ada_find_parallel_type (type
, "___XVE");
7984 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7985 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7988 is_dynamic_field (struct type
*templ_type
, int field_num
)
7990 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7993 && TYPE_FIELD_TYPE (templ_type
, field_num
)->code () == TYPE_CODE_PTR
7994 && strstr (name
, "___XVL") != NULL
;
7997 /* The index of the variant field of TYPE, or -1 if TYPE does not
7998 represent a variant record type. */
8001 variant_field_index (struct type
*type
)
8005 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
8008 for (f
= 0; f
< type
->num_fields (); f
+= 1)
8010 if (ada_is_variant_part (type
, f
))
8016 /* A record type with no fields. */
8018 static struct type
*
8019 empty_record (struct type
*templ
)
8021 struct type
*type
= alloc_type_copy (templ
);
8023 type
->set_code (TYPE_CODE_STRUCT
);
8024 INIT_NONE_SPECIFIC (type
);
8025 type
->set_name ("<empty>");
8026 TYPE_LENGTH (type
) = 0;
8030 /* An ordinary record type (with fixed-length fields) that describes
8031 the value of type TYPE at VALADDR or ADDRESS (see comments at
8032 the beginning of this section) VAL according to GNAT conventions.
8033 DVAL0 should describe the (portion of a) record that contains any
8034 necessary discriminants. It should be NULL if value_type (VAL) is
8035 an outer-level type (i.e., as opposed to a branch of a variant.) A
8036 variant field (unless unchecked) is replaced by a particular branch
8039 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8040 length are not statically known are discarded. As a consequence,
8041 VALADDR, ADDRESS and DVAL0 are ignored.
8043 NOTE: Limitations: For now, we assume that dynamic fields and
8044 variants occupy whole numbers of bytes. However, they need not be
8048 ada_template_to_fixed_record_type_1 (struct type
*type
,
8049 const gdb_byte
*valaddr
,
8050 CORE_ADDR address
, struct value
*dval0
,
8051 int keep_dynamic_fields
)
8053 struct value
*mark
= value_mark ();
8056 int nfields
, bit_len
;
8062 /* Compute the number of fields in this record type that are going
8063 to be processed: unless keep_dynamic_fields, this includes only
8064 fields whose position and length are static will be processed. */
8065 if (keep_dynamic_fields
)
8066 nfields
= type
->num_fields ();
8070 while (nfields
< type
->num_fields ()
8071 && !ada_is_variant_part (type
, nfields
)
8072 && !is_dynamic_field (type
, nfields
))
8076 rtype
= alloc_type_copy (type
);
8077 rtype
->set_code (TYPE_CODE_STRUCT
);
8078 INIT_NONE_SPECIFIC (rtype
);
8079 rtype
->set_num_fields (nfields
);
8081 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
8082 rtype
->set_name (ada_type_name (type
));
8083 TYPE_FIXED_INSTANCE (rtype
) = 1;
8089 for (f
= 0; f
< nfields
; f
+= 1)
8091 off
= align_up (off
, field_alignment (type
, f
))
8092 + TYPE_FIELD_BITPOS (type
, f
);
8093 SET_FIELD_BITPOS (rtype
->field (f
), off
);
8094 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8096 if (ada_is_variant_part (type
, f
))
8101 else if (is_dynamic_field (type
, f
))
8103 const gdb_byte
*field_valaddr
= valaddr
;
8104 CORE_ADDR field_address
= address
;
8105 struct type
*field_type
=
8106 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8110 /* rtype's length is computed based on the run-time
8111 value of discriminants. If the discriminants are not
8112 initialized, the type size may be completely bogus and
8113 GDB may fail to allocate a value for it. So check the
8114 size first before creating the value. */
8115 ada_ensure_varsize_limit (rtype
);
8116 /* Using plain value_from_contents_and_address here
8117 causes problems because we will end up trying to
8118 resolve a type that is currently being
8120 dval
= value_from_contents_and_address_unresolved (rtype
,
8123 rtype
= value_type (dval
);
8128 /* If the type referenced by this field is an aligner type, we need
8129 to unwrap that aligner type, because its size might not be set.
8130 Keeping the aligner type would cause us to compute the wrong
8131 size for this field, impacting the offset of the all the fields
8132 that follow this one. */
8133 if (ada_is_aligner_type (field_type
))
8135 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8137 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8138 field_address
= cond_offset_target (field_address
, field_offset
);
8139 field_type
= ada_aligned_type (field_type
);
8142 field_valaddr
= cond_offset_host (field_valaddr
,
8143 off
/ TARGET_CHAR_BIT
);
8144 field_address
= cond_offset_target (field_address
,
8145 off
/ TARGET_CHAR_BIT
);
8147 /* Get the fixed type of the field. Note that, in this case,
8148 we do not want to get the real type out of the tag: if
8149 the current field is the parent part of a tagged record,
8150 we will get the tag of the object. Clearly wrong: the real
8151 type of the parent is not the real type of the child. We
8152 would end up in an infinite loop. */
8153 field_type
= ada_get_base_type (field_type
);
8154 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8155 field_address
, dval
, 0);
8156 /* If the field size is already larger than the maximum
8157 object size, then the record itself will necessarily
8158 be larger than the maximum object size. We need to make
8159 this check now, because the size might be so ridiculously
8160 large (due to an uninitialized variable in the inferior)
8161 that it would cause an overflow when adding it to the
8163 ada_ensure_varsize_limit (field_type
);
8165 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8166 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8167 /* The multiplication can potentially overflow. But because
8168 the field length has been size-checked just above, and
8169 assuming that the maximum size is a reasonable value,
8170 an overflow should not happen in practice. So rather than
8171 adding overflow recovery code to this already complex code,
8172 we just assume that it's not going to happen. */
8174 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8178 /* Note: If this field's type is a typedef, it is important
8179 to preserve the typedef layer.
8181 Otherwise, we might be transforming a typedef to a fat
8182 pointer (encoding a pointer to an unconstrained array),
8183 into a basic fat pointer (encoding an unconstrained
8184 array). As both types are implemented using the same
8185 structure, the typedef is the only clue which allows us
8186 to distinguish between the two options. Stripping it
8187 would prevent us from printing this field appropriately. */
8188 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8189 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8190 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8192 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8195 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8197 /* We need to be careful of typedefs when computing
8198 the length of our field. If this is a typedef,
8199 get the length of the target type, not the length
8201 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
8202 field_type
= ada_typedef_target_type (field_type
);
8205 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8208 if (off
+ fld_bit_len
> bit_len
)
8209 bit_len
= off
+ fld_bit_len
;
8211 TYPE_LENGTH (rtype
) =
8212 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8215 /* We handle the variant part, if any, at the end because of certain
8216 odd cases in which it is re-ordered so as NOT to be the last field of
8217 the record. This can happen in the presence of representation
8219 if (variant_field
>= 0)
8221 struct type
*branch_type
;
8223 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8227 /* Using plain value_from_contents_and_address here causes
8228 problems because we will end up trying to resolve a type
8229 that is currently being constructed. */
8230 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8232 rtype
= value_type (dval
);
8238 to_fixed_variant_branch_type
8239 (TYPE_FIELD_TYPE (type
, variant_field
),
8240 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8241 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8242 if (branch_type
== NULL
)
8244 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
8245 rtype
->field (f
- 1) = rtype
->field (f
);
8246 rtype
->set_num_fields (rtype
->num_fields () - 1);
8250 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8251 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8253 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8255 if (off
+ fld_bit_len
> bit_len
)
8256 bit_len
= off
+ fld_bit_len
;
8257 TYPE_LENGTH (rtype
) =
8258 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8262 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8263 should contain the alignment of that record, which should be a strictly
8264 positive value. If null or negative, then something is wrong, most
8265 probably in the debug info. In that case, we don't round up the size
8266 of the resulting type. If this record is not part of another structure,
8267 the current RTYPE length might be good enough for our purposes. */
8268 if (TYPE_LENGTH (type
) <= 0)
8271 warning (_("Invalid type size for `%s' detected: %s."),
8272 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
8274 warning (_("Invalid type size for <unnamed> detected: %s."),
8275 pulongest (TYPE_LENGTH (type
)));
8279 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
8280 TYPE_LENGTH (type
));
8283 value_free_to_mark (mark
);
8284 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8285 error (_("record type with dynamic size is larger than varsize-limit"));
8289 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8292 static struct type
*
8293 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8294 CORE_ADDR address
, struct value
*dval0
)
8296 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8300 /* An ordinary record type in which ___XVL-convention fields and
8301 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8302 static approximations, containing all possible fields. Uses
8303 no runtime values. Useless for use in values, but that's OK,
8304 since the results are used only for type determinations. Works on both
8305 structs and unions. Representation note: to save space, we memorize
8306 the result of this function in the TYPE_TARGET_TYPE of the
8309 static struct type
*
8310 template_to_static_fixed_type (struct type
*type0
)
8316 /* No need no do anything if the input type is already fixed. */
8317 if (TYPE_FIXED_INSTANCE (type0
))
8320 /* Likewise if we already have computed the static approximation. */
8321 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8322 return TYPE_TARGET_TYPE (type0
);
8324 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8326 nfields
= type0
->num_fields ();
8328 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8329 recompute all over next time. */
8330 TYPE_TARGET_TYPE (type0
) = type
;
8332 for (f
= 0; f
< nfields
; f
+= 1)
8334 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8335 struct type
*new_type
;
8337 if (is_dynamic_field (type0
, f
))
8339 field_type
= ada_check_typedef (field_type
);
8340 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8343 new_type
= static_unwrap_type (field_type
);
8345 if (new_type
!= field_type
)
8347 /* Clone TYPE0 only the first time we get a new field type. */
8350 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8351 type
->set_code (type0
->code ());
8352 INIT_NONE_SPECIFIC (type
);
8353 type
->set_num_fields (nfields
);
8357 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
8358 memcpy (fields
, type0
->fields (),
8359 sizeof (struct field
) * nfields
);
8360 type
->set_fields (fields
);
8362 type
->set_name (ada_type_name (type0
));
8363 TYPE_FIXED_INSTANCE (type
) = 1;
8364 TYPE_LENGTH (type
) = 0;
8366 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8367 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8374 /* Given an object of type TYPE whose contents are at VALADDR and
8375 whose address in memory is ADDRESS, returns a revision of TYPE,
8376 which should be a non-dynamic-sized record, in which the variant
8377 part, if any, is replaced with the appropriate branch. Looks
8378 for discriminant values in DVAL0, which can be NULL if the record
8379 contains the necessary discriminant values. */
8381 static struct type
*
8382 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8383 CORE_ADDR address
, struct value
*dval0
)
8385 struct value
*mark
= value_mark ();
8388 struct type
*branch_type
;
8389 int nfields
= type
->num_fields ();
8390 int variant_field
= variant_field_index (type
);
8392 if (variant_field
== -1)
8397 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8398 type
= value_type (dval
);
8403 rtype
= alloc_type_copy (type
);
8404 rtype
->set_code (TYPE_CODE_STRUCT
);
8405 INIT_NONE_SPECIFIC (rtype
);
8406 rtype
->set_num_fields (nfields
);
8409 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8410 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
8411 rtype
->set_fields (fields
);
8413 rtype
->set_name (ada_type_name (type
));
8414 TYPE_FIXED_INSTANCE (rtype
) = 1;
8415 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8417 branch_type
= to_fixed_variant_branch_type
8418 (TYPE_FIELD_TYPE (type
, variant_field
),
8419 cond_offset_host (valaddr
,
8420 TYPE_FIELD_BITPOS (type
, variant_field
)
8422 cond_offset_target (address
,
8423 TYPE_FIELD_BITPOS (type
, variant_field
)
8424 / TARGET_CHAR_BIT
), dval
);
8425 if (branch_type
== NULL
)
8429 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8430 rtype
->field (f
- 1) = rtype
->field (f
);
8431 rtype
->set_num_fields (rtype
->num_fields () - 1);
8435 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8436 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8437 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8438 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8440 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8442 value_free_to_mark (mark
);
8446 /* An ordinary record type (with fixed-length fields) that describes
8447 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8448 beginning of this section]. Any necessary discriminants' values
8449 should be in DVAL, a record value; it may be NULL if the object
8450 at ADDR itself contains any necessary discriminant values.
8451 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8452 values from the record are needed. Except in the case that DVAL,
8453 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8454 unchecked) is replaced by a particular branch of the variant.
8456 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8457 is questionable and may be removed. It can arise during the
8458 processing of an unconstrained-array-of-record type where all the
8459 variant branches have exactly the same size. This is because in
8460 such cases, the compiler does not bother to use the XVS convention
8461 when encoding the record. I am currently dubious of this
8462 shortcut and suspect the compiler should be altered. FIXME. */
8464 static struct type
*
8465 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8466 CORE_ADDR address
, struct value
*dval
)
8468 struct type
*templ_type
;
8470 if (TYPE_FIXED_INSTANCE (type0
))
8473 templ_type
= dynamic_template_type (type0
);
8475 if (templ_type
!= NULL
)
8476 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8477 else if (variant_field_index (type0
) >= 0)
8479 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8481 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8486 TYPE_FIXED_INSTANCE (type0
) = 1;
8492 /* An ordinary record type (with fixed-length fields) that describes
8493 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8494 union type. Any necessary discriminants' values should be in DVAL,
8495 a record value. That is, this routine selects the appropriate
8496 branch of the union at ADDR according to the discriminant value
8497 indicated in the union's type name. Returns VAR_TYPE0 itself if
8498 it represents a variant subject to a pragma Unchecked_Union. */
8500 static struct type
*
8501 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8502 CORE_ADDR address
, struct value
*dval
)
8505 struct type
*templ_type
;
8506 struct type
*var_type
;
8508 if (var_type0
->code () == TYPE_CODE_PTR
)
8509 var_type
= TYPE_TARGET_TYPE (var_type0
);
8511 var_type
= var_type0
;
8513 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8515 if (templ_type
!= NULL
)
8516 var_type
= templ_type
;
8518 if (is_unchecked_variant (var_type
, value_type (dval
)))
8520 which
= ada_which_variant_applies (var_type
, dval
);
8523 return empty_record (var_type
);
8524 else if (is_dynamic_field (var_type
, which
))
8525 return to_fixed_record_type
8526 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8527 valaddr
, address
, dval
);
8528 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8530 to_fixed_record_type
8531 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8533 return TYPE_FIELD_TYPE (var_type
, which
);
8536 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8537 ENCODING_TYPE, a type following the GNAT conventions for discrete
8538 type encodings, only carries redundant information. */
8541 ada_is_redundant_range_encoding (struct type
*range_type
,
8542 struct type
*encoding_type
)
8544 const char *bounds_str
;
8548 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8550 if (get_base_type (range_type
)->code ()
8551 != get_base_type (encoding_type
)->code ())
8553 /* The compiler probably used a simple base type to describe
8554 the range type instead of the range's actual base type,
8555 expecting us to get the real base type from the encoding
8556 anyway. In this situation, the encoding cannot be ignored
8561 if (is_dynamic_type (range_type
))
8564 if (encoding_type
->name () == NULL
)
8567 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8568 if (bounds_str
== NULL
)
8571 n
= 8; /* Skip "___XDLU_". */
8572 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8574 if (TYPE_LOW_BOUND (range_type
) != lo
)
8577 n
+= 2; /* Skip the "__" separator between the two bounds. */
8578 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8580 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8586 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8587 a type following the GNAT encoding for describing array type
8588 indices, only carries redundant information. */
8591 ada_is_redundant_index_type_desc (struct type
*array_type
,
8592 struct type
*desc_type
)
8594 struct type
*this_layer
= check_typedef (array_type
);
8597 for (i
= 0; i
< desc_type
->num_fields (); i
++)
8599 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8600 TYPE_FIELD_TYPE (desc_type
, i
)))
8602 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8608 /* Assuming that TYPE0 is an array type describing the type of a value
8609 at ADDR, and that DVAL describes a record containing any
8610 discriminants used in TYPE0, returns a type for the value that
8611 contains no dynamic components (that is, no components whose sizes
8612 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8613 true, gives an error message if the resulting type's size is over
8616 static struct type
*
8617 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8620 struct type
*index_type_desc
;
8621 struct type
*result
;
8622 int constrained_packed_array_p
;
8623 static const char *xa_suffix
= "___XA";
8625 type0
= ada_check_typedef (type0
);
8626 if (TYPE_FIXED_INSTANCE (type0
))
8629 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8630 if (constrained_packed_array_p
)
8631 type0
= decode_constrained_packed_array_type (type0
);
8633 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8635 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8636 encoding suffixed with 'P' may still be generated. If so,
8637 it should be used to find the XA type. */
8639 if (index_type_desc
== NULL
)
8641 const char *type_name
= ada_type_name (type0
);
8643 if (type_name
!= NULL
)
8645 const int len
= strlen (type_name
);
8646 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8648 if (type_name
[len
- 1] == 'P')
8650 strcpy (name
, type_name
);
8651 strcpy (name
+ len
- 1, xa_suffix
);
8652 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8657 ada_fixup_array_indexes_type (index_type_desc
);
8658 if (index_type_desc
!= NULL
8659 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8661 /* Ignore this ___XA parallel type, as it does not bring any
8662 useful information. This allows us to avoid creating fixed
8663 versions of the array's index types, which would be identical
8664 to the original ones. This, in turn, can also help avoid
8665 the creation of fixed versions of the array itself. */
8666 index_type_desc
= NULL
;
8669 if (index_type_desc
== NULL
)
8671 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8673 /* NOTE: elt_type---the fixed version of elt_type0---should never
8674 depend on the contents of the array in properly constructed
8676 /* Create a fixed version of the array element type.
8677 We're not providing the address of an element here,
8678 and thus the actual object value cannot be inspected to do
8679 the conversion. This should not be a problem, since arrays of
8680 unconstrained objects are not allowed. In particular, all
8681 the elements of an array of a tagged type should all be of
8682 the same type specified in the debugging info. No need to
8683 consult the object tag. */
8684 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8686 /* Make sure we always create a new array type when dealing with
8687 packed array types, since we're going to fix-up the array
8688 type length and element bitsize a little further down. */
8689 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8692 result
= create_array_type (alloc_type_copy (type0
),
8693 elt_type
, TYPE_INDEX_TYPE (type0
));
8698 struct type
*elt_type0
;
8701 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8702 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8704 /* NOTE: result---the fixed version of elt_type0---should never
8705 depend on the contents of the array in properly constructed
8707 /* Create a fixed version of the array element type.
8708 We're not providing the address of an element here,
8709 and thus the actual object value cannot be inspected to do
8710 the conversion. This should not be a problem, since arrays of
8711 unconstrained objects are not allowed. In particular, all
8712 the elements of an array of a tagged type should all be of
8713 the same type specified in the debugging info. No need to
8714 consult the object tag. */
8716 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8719 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8721 struct type
*range_type
=
8722 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8724 result
= create_array_type (alloc_type_copy (elt_type0
),
8725 result
, range_type
);
8726 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8728 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8729 error (_("array type with dynamic size is larger than varsize-limit"));
8732 /* We want to preserve the type name. This can be useful when
8733 trying to get the type name of a value that has already been
8734 printed (for instance, if the user did "print VAR; whatis $". */
8735 result
->set_name (type0
->name ());
8737 if (constrained_packed_array_p
)
8739 /* So far, the resulting type has been created as if the original
8740 type was a regular (non-packed) array type. As a result, the
8741 bitsize of the array elements needs to be set again, and the array
8742 length needs to be recomputed based on that bitsize. */
8743 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8744 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8746 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8747 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8748 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8749 TYPE_LENGTH (result
)++;
8752 TYPE_FIXED_INSTANCE (result
) = 1;
8757 /* A standard type (containing no dynamically sized components)
8758 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8759 DVAL describes a record containing any discriminants used in TYPE0,
8760 and may be NULL if there are none, or if the object of type TYPE at
8761 ADDRESS or in VALADDR contains these discriminants.
8763 If CHECK_TAG is not null, in the case of tagged types, this function
8764 attempts to locate the object's tag and use it to compute the actual
8765 type. However, when ADDRESS is null, we cannot use it to determine the
8766 location of the tag, and therefore compute the tagged type's actual type.
8767 So we return the tagged type without consulting the tag. */
8769 static struct type
*
8770 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8771 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8773 type
= ada_check_typedef (type
);
8775 /* Only un-fixed types need to be handled here. */
8776 if (!HAVE_GNAT_AUX_INFO (type
))
8779 switch (type
->code ())
8783 case TYPE_CODE_STRUCT
:
8785 struct type
*static_type
= to_static_fixed_type (type
);
8786 struct type
*fixed_record_type
=
8787 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8789 /* If STATIC_TYPE is a tagged type and we know the object's address,
8790 then we can determine its tag, and compute the object's actual
8791 type from there. Note that we have to use the fixed record
8792 type (the parent part of the record may have dynamic fields
8793 and the way the location of _tag is expressed may depend on
8796 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8799 value_tag_from_contents_and_address
8803 struct type
*real_type
= type_from_tag (tag
);
8805 value_from_contents_and_address (fixed_record_type
,
8808 fixed_record_type
= value_type (obj
);
8809 if (real_type
!= NULL
)
8810 return to_fixed_record_type
8812 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8815 /* Check to see if there is a parallel ___XVZ variable.
8816 If there is, then it provides the actual size of our type. */
8817 else if (ada_type_name (fixed_record_type
) != NULL
)
8819 const char *name
= ada_type_name (fixed_record_type
);
8821 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8822 bool xvz_found
= false;
8825 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8828 xvz_found
= get_int_var_value (xvz_name
, size
);
8830 catch (const gdb_exception_error
&except
)
8832 /* We found the variable, but somehow failed to read
8833 its value. Rethrow the same error, but with a little
8834 bit more information, to help the user understand
8835 what went wrong (Eg: the variable might have been
8837 throw_error (except
.error
,
8838 _("unable to read value of %s (%s)"),
8839 xvz_name
, except
.what ());
8842 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8844 fixed_record_type
= copy_type (fixed_record_type
);
8845 TYPE_LENGTH (fixed_record_type
) = size
;
8847 /* The FIXED_RECORD_TYPE may have be a stub. We have
8848 observed this when the debugging info is STABS, and
8849 apparently it is something that is hard to fix.
8851 In practice, we don't need the actual type definition
8852 at all, because the presence of the XVZ variable allows us
8853 to assume that there must be a XVS type as well, which we
8854 should be able to use later, when we need the actual type
8857 In the meantime, pretend that the "fixed" type we are
8858 returning is NOT a stub, because this can cause trouble
8859 when using this type to create new types targeting it.
8860 Indeed, the associated creation routines often check
8861 whether the target type is a stub and will try to replace
8862 it, thus using a type with the wrong size. This, in turn,
8863 might cause the new type to have the wrong size too.
8864 Consider the case of an array, for instance, where the size
8865 of the array is computed from the number of elements in
8866 our array multiplied by the size of its element. */
8867 TYPE_STUB (fixed_record_type
) = 0;
8870 return fixed_record_type
;
8872 case TYPE_CODE_ARRAY
:
8873 return to_fixed_array_type (type
, dval
, 1);
8874 case TYPE_CODE_UNION
:
8878 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8882 /* The same as ada_to_fixed_type_1, except that it preserves the type
8883 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8885 The typedef layer needs be preserved in order to differentiate between
8886 arrays and array pointers when both types are implemented using the same
8887 fat pointer. In the array pointer case, the pointer is encoded as
8888 a typedef of the pointer type. For instance, considering:
8890 type String_Access is access String;
8891 S1 : String_Access := null;
8893 To the debugger, S1 is defined as a typedef of type String. But
8894 to the user, it is a pointer. So if the user tries to print S1,
8895 we should not dereference the array, but print the array address
8898 If we didn't preserve the typedef layer, we would lose the fact that
8899 the type is to be presented as a pointer (needs de-reference before
8900 being printed). And we would also use the source-level type name. */
8903 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8904 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8907 struct type
*fixed_type
=
8908 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8910 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8911 then preserve the typedef layer.
8913 Implementation note: We can only check the main-type portion of
8914 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8915 from TYPE now returns a type that has the same instance flags
8916 as TYPE. For instance, if TYPE is a "typedef const", and its
8917 target type is a "struct", then the typedef elimination will return
8918 a "const" version of the target type. See check_typedef for more
8919 details about how the typedef layer elimination is done.
8921 brobecker/2010-11-19: It seems to me that the only case where it is
8922 useful to preserve the typedef layer is when dealing with fat pointers.
8923 Perhaps, we could add a check for that and preserve the typedef layer
8924 only in that situation. But this seems unnecessary so far, probably
8925 because we call check_typedef/ada_check_typedef pretty much everywhere.
8927 if (type
->code () == TYPE_CODE_TYPEDEF
8928 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8929 == TYPE_MAIN_TYPE (fixed_type
)))
8935 /* A standard (static-sized) type corresponding as well as possible to
8936 TYPE0, but based on no runtime data. */
8938 static struct type
*
8939 to_static_fixed_type (struct type
*type0
)
8946 if (TYPE_FIXED_INSTANCE (type0
))
8949 type0
= ada_check_typedef (type0
);
8951 switch (type0
->code ())
8955 case TYPE_CODE_STRUCT
:
8956 type
= dynamic_template_type (type0
);
8958 return template_to_static_fixed_type (type
);
8960 return template_to_static_fixed_type (type0
);
8961 case TYPE_CODE_UNION
:
8962 type
= ada_find_parallel_type (type0
, "___XVU");
8964 return template_to_static_fixed_type (type
);
8966 return template_to_static_fixed_type (type0
);
8970 /* A static approximation of TYPE with all type wrappers removed. */
8972 static struct type
*
8973 static_unwrap_type (struct type
*type
)
8975 if (ada_is_aligner_type (type
))
8977 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8978 if (ada_type_name (type1
) == NULL
)
8979 type1
->set_name (ada_type_name (type
));
8981 return static_unwrap_type (type1
);
8985 struct type
*raw_real_type
= ada_get_base_type (type
);
8987 if (raw_real_type
== type
)
8990 return to_static_fixed_type (raw_real_type
);
8994 /* In some cases, incomplete and private types require
8995 cross-references that are not resolved as records (for example,
8997 type FooP is access Foo;
8999 type Foo is array ...;
9000 ). In these cases, since there is no mechanism for producing
9001 cross-references to such types, we instead substitute for FooP a
9002 stub enumeration type that is nowhere resolved, and whose tag is
9003 the name of the actual type. Call these types "non-record stubs". */
9005 /* A type equivalent to TYPE that is not a non-record stub, if one
9006 exists, otherwise TYPE. */
9009 ada_check_typedef (struct type
*type
)
9014 /* If our type is an access to an unconstrained array, which is encoded
9015 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
9016 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9017 what allows us to distinguish between fat pointers that represent
9018 array types, and fat pointers that represent array access types
9019 (in both cases, the compiler implements them as fat pointers). */
9020 if (ada_is_access_to_unconstrained_array (type
))
9023 type
= check_typedef (type
);
9024 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
9025 || !TYPE_STUB (type
)
9026 || type
->name () == NULL
)
9030 const char *name
= type
->name ();
9031 struct type
*type1
= ada_find_any_type (name
);
9036 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9037 stubs pointing to arrays, as we don't create symbols for array
9038 types, only for the typedef-to-array types). If that's the case,
9039 strip the typedef layer. */
9040 if (type1
->code () == TYPE_CODE_TYPEDEF
)
9041 type1
= ada_check_typedef (type1
);
9047 /* A value representing the data at VALADDR/ADDRESS as described by
9048 type TYPE0, but with a standard (static-sized) type that correctly
9049 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9050 type, then return VAL0 [this feature is simply to avoid redundant
9051 creation of struct values]. */
9053 static struct value
*
9054 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
9057 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
9059 if (type
== type0
&& val0
!= NULL
)
9062 if (VALUE_LVAL (val0
) != lval_memory
)
9064 /* Our value does not live in memory; it could be a convenience
9065 variable, for instance. Create a not_lval value using val0's
9067 return value_from_contents (type
, value_contents (val0
));
9070 return value_from_contents_and_address (type
, 0, address
);
9073 /* A value representing VAL, but with a standard (static-sized) type
9074 that correctly describes it. Does not necessarily create a new
9078 ada_to_fixed_value (struct value
*val
)
9080 val
= unwrap_value (val
);
9081 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
9088 /* Table mapping attribute numbers to names.
9089 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9091 static const char *attribute_names
[] = {
9109 ada_attribute_name (enum exp_opcode n
)
9111 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9112 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9114 return attribute_names
[0];
9117 /* Evaluate the 'POS attribute applied to ARG. */
9120 pos_atr (struct value
*arg
)
9122 struct value
*val
= coerce_ref (arg
);
9123 struct type
*type
= value_type (val
);
9126 if (!discrete_type_p (type
))
9127 error (_("'POS only defined on discrete types"));
9129 if (!discrete_position (type
, value_as_long (val
), &result
))
9130 error (_("enumeration value is invalid: can't find 'POS"));
9135 static struct value
*
9136 value_pos_atr (struct type
*type
, struct value
*arg
)
9138 return value_from_longest (type
, pos_atr (arg
));
9141 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9143 static struct value
*
9144 value_val_atr (struct type
*type
, struct value
*arg
)
9146 if (!discrete_type_p (type
))
9147 error (_("'VAL only defined on discrete types"));
9148 if (!integer_type_p (value_type (arg
)))
9149 error (_("'VAL requires integral argument"));
9151 if (type
->code () == TYPE_CODE_RANGE
)
9152 type
= TYPE_TARGET_TYPE (type
);
9154 if (type
->code () == TYPE_CODE_ENUM
)
9156 long pos
= value_as_long (arg
);
9158 if (pos
< 0 || pos
>= type
->num_fields ())
9159 error (_("argument to 'VAL out of range"));
9160 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
9163 return value_from_longest (type
, value_as_long (arg
));
9169 /* True if TYPE appears to be an Ada character type.
9170 [At the moment, this is true only for Character and Wide_Character;
9171 It is a heuristic test that could stand improvement]. */
9174 ada_is_character_type (struct type
*type
)
9178 /* If the type code says it's a character, then assume it really is,
9179 and don't check any further. */
9180 if (type
->code () == TYPE_CODE_CHAR
)
9183 /* Otherwise, assume it's a character type iff it is a discrete type
9184 with a known character type name. */
9185 name
= ada_type_name (type
);
9186 return (name
!= NULL
9187 && (type
->code () == TYPE_CODE_INT
9188 || type
->code () == TYPE_CODE_RANGE
)
9189 && (strcmp (name
, "character") == 0
9190 || strcmp (name
, "wide_character") == 0
9191 || strcmp (name
, "wide_wide_character") == 0
9192 || strcmp (name
, "unsigned char") == 0));
9195 /* True if TYPE appears to be an Ada string type. */
9198 ada_is_string_type (struct type
*type
)
9200 type
= ada_check_typedef (type
);
9202 && type
->code () != TYPE_CODE_PTR
9203 && (ada_is_simple_array_type (type
)
9204 || ada_is_array_descriptor_type (type
))
9205 && ada_array_arity (type
) == 1)
9207 struct type
*elttype
= ada_array_element_type (type
, 1);
9209 return ada_is_character_type (elttype
);
9215 /* The compiler sometimes provides a parallel XVS type for a given
9216 PAD type. Normally, it is safe to follow the PAD type directly,
9217 but older versions of the compiler have a bug that causes the offset
9218 of its "F" field to be wrong. Following that field in that case
9219 would lead to incorrect results, but this can be worked around
9220 by ignoring the PAD type and using the associated XVS type instead.
9222 Set to True if the debugger should trust the contents of PAD types.
9223 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9224 static bool trust_pad_over_xvs
= true;
9226 /* True if TYPE is a struct type introduced by the compiler to force the
9227 alignment of a value. Such types have a single field with a
9228 distinctive name. */
9231 ada_is_aligner_type (struct type
*type
)
9233 type
= ada_check_typedef (type
);
9235 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9238 return (type
->code () == TYPE_CODE_STRUCT
9239 && type
->num_fields () == 1
9240 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9243 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9244 the parallel type. */
9247 ada_get_base_type (struct type
*raw_type
)
9249 struct type
*real_type_namer
;
9250 struct type
*raw_real_type
;
9252 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
9255 if (ada_is_aligner_type (raw_type
))
9256 /* The encoding specifies that we should always use the aligner type.
9257 So, even if this aligner type has an associated XVS type, we should
9260 According to the compiler gurus, an XVS type parallel to an aligner
9261 type may exist because of a stabs limitation. In stabs, aligner
9262 types are empty because the field has a variable-sized type, and
9263 thus cannot actually be used as an aligner type. As a result,
9264 we need the associated parallel XVS type to decode the type.
9265 Since the policy in the compiler is to not change the internal
9266 representation based on the debugging info format, we sometimes
9267 end up having a redundant XVS type parallel to the aligner type. */
9270 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9271 if (real_type_namer
== NULL
9272 || real_type_namer
->code () != TYPE_CODE_STRUCT
9273 || real_type_namer
->num_fields () != 1)
9276 if (TYPE_FIELD_TYPE (real_type_namer
, 0)->code () != TYPE_CODE_REF
)
9278 /* This is an older encoding form where the base type needs to be
9279 looked up by name. We prefer the newer encoding because it is
9281 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9282 if (raw_real_type
== NULL
)
9285 return raw_real_type
;
9288 /* The field in our XVS type is a reference to the base type. */
9289 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9292 /* The type of value designated by TYPE, with all aligners removed. */
9295 ada_aligned_type (struct type
*type
)
9297 if (ada_is_aligner_type (type
))
9298 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9300 return ada_get_base_type (type
);
9304 /* The address of the aligned value in an object at address VALADDR
9305 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9308 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9310 if (ada_is_aligner_type (type
))
9311 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9313 TYPE_FIELD_BITPOS (type
,
9314 0) / TARGET_CHAR_BIT
);
9321 /* The printed representation of an enumeration literal with encoded
9322 name NAME. The value is good to the next call of ada_enum_name. */
9324 ada_enum_name (const char *name
)
9326 static char *result
;
9327 static size_t result_len
= 0;
9330 /* First, unqualify the enumeration name:
9331 1. Search for the last '.' character. If we find one, then skip
9332 all the preceding characters, the unqualified name starts
9333 right after that dot.
9334 2. Otherwise, we may be debugging on a target where the compiler
9335 translates dots into "__". Search forward for double underscores,
9336 but stop searching when we hit an overloading suffix, which is
9337 of the form "__" followed by digits. */
9339 tmp
= strrchr (name
, '.');
9344 while ((tmp
= strstr (name
, "__")) != NULL
)
9346 if (isdigit (tmp
[2]))
9357 if (name
[1] == 'U' || name
[1] == 'W')
9359 if (sscanf (name
+ 2, "%x", &v
) != 1)
9362 else if (((name
[1] >= '0' && name
[1] <= '9')
9363 || (name
[1] >= 'a' && name
[1] <= 'z'))
9366 GROW_VECT (result
, result_len
, 4);
9367 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9373 GROW_VECT (result
, result_len
, 16);
9374 if (isascii (v
) && isprint (v
))
9375 xsnprintf (result
, result_len
, "'%c'", v
);
9376 else if (name
[1] == 'U')
9377 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9379 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9385 tmp
= strstr (name
, "__");
9387 tmp
= strstr (name
, "$");
9390 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9391 strncpy (result
, name
, tmp
- name
);
9392 result
[tmp
- name
] = '\0';
9400 /* Evaluate the subexpression of EXP starting at *POS as for
9401 evaluate_type, updating *POS to point just past the evaluated
9404 static struct value
*
9405 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9407 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9410 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9413 static struct value
*
9414 unwrap_value (struct value
*val
)
9416 struct type
*type
= ada_check_typedef (value_type (val
));
9418 if (ada_is_aligner_type (type
))
9420 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9421 struct type
*val_type
= ada_check_typedef (value_type (v
));
9423 if (ada_type_name (val_type
) == NULL
)
9424 val_type
->set_name (ada_type_name (type
));
9426 return unwrap_value (v
);
9430 struct type
*raw_real_type
=
9431 ada_check_typedef (ada_get_base_type (type
));
9433 /* If there is no parallel XVS or XVE type, then the value is
9434 already unwrapped. Return it without further modification. */
9435 if ((type
== raw_real_type
)
9436 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9440 coerce_unspec_val_to_type
9441 (val
, ada_to_fixed_type (raw_real_type
, 0,
9442 value_address (val
),
9447 static struct value
*
9448 cast_from_fixed (struct type
*type
, struct value
*arg
)
9450 struct value
*scale
= ada_scaling_factor (value_type (arg
));
9451 arg
= value_cast (value_type (scale
), arg
);
9453 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9454 return value_cast (type
, arg
);
9457 static struct value
*
9458 cast_to_fixed (struct type
*type
, struct value
*arg
)
9460 if (type
== value_type (arg
))
9463 struct value
*scale
= ada_scaling_factor (type
);
9464 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg
)))
9465 arg
= cast_from_fixed (value_type (scale
), arg
);
9467 arg
= value_cast (value_type (scale
), arg
);
9469 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9470 return value_cast (type
, arg
);
9473 /* Given two array types T1 and T2, return nonzero iff both arrays
9474 contain the same number of elements. */
9477 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9479 LONGEST lo1
, hi1
, lo2
, hi2
;
9481 /* Get the array bounds in order to verify that the size of
9482 the two arrays match. */
9483 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9484 || !get_array_bounds (t2
, &lo2
, &hi2
))
9485 error (_("unable to determine array bounds"));
9487 /* To make things easier for size comparison, normalize a bit
9488 the case of empty arrays by making sure that the difference
9489 between upper bound and lower bound is always -1. */
9495 return (hi1
- lo1
== hi2
- lo2
);
9498 /* Assuming that VAL is an array of integrals, and TYPE represents
9499 an array with the same number of elements, but with wider integral
9500 elements, return an array "casted" to TYPE. In practice, this
9501 means that the returned array is built by casting each element
9502 of the original array into TYPE's (wider) element type. */
9504 static struct value
*
9505 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9507 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9512 /* Verify that both val and type are arrays of scalars, and
9513 that the size of val's elements is smaller than the size
9514 of type's element. */
9515 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9516 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9517 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9518 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9519 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9520 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9522 if (!get_array_bounds (type
, &lo
, &hi
))
9523 error (_("unable to determine array bounds"));
9525 res
= allocate_value (type
);
9527 /* Promote each array element. */
9528 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9530 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9532 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9533 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9539 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9540 return the converted value. */
9542 static struct value
*
9543 coerce_for_assign (struct type
*type
, struct value
*val
)
9545 struct type
*type2
= value_type (val
);
9550 type2
= ada_check_typedef (type2
);
9551 type
= ada_check_typedef (type
);
9553 if (type2
->code () == TYPE_CODE_PTR
9554 && type
->code () == TYPE_CODE_ARRAY
)
9556 val
= ada_value_ind (val
);
9557 type2
= value_type (val
);
9560 if (type2
->code () == TYPE_CODE_ARRAY
9561 && type
->code () == TYPE_CODE_ARRAY
)
9563 if (!ada_same_array_size_p (type
, type2
))
9564 error (_("cannot assign arrays of different length"));
9566 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9567 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9568 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9569 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9571 /* Allow implicit promotion of the array elements to
9573 return ada_promote_array_of_integrals (type
, val
);
9576 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9577 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9578 error (_("Incompatible types in assignment"));
9579 deprecated_set_value_type (val
, type
);
9584 static struct value
*
9585 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9588 struct type
*type1
, *type2
;
9591 arg1
= coerce_ref (arg1
);
9592 arg2
= coerce_ref (arg2
);
9593 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9594 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9596 if (type1
->code () != TYPE_CODE_INT
9597 || type2
->code () != TYPE_CODE_INT
)
9598 return value_binop (arg1
, arg2
, op
);
9607 return value_binop (arg1
, arg2
, op
);
9610 v2
= value_as_long (arg2
);
9612 error (_("second operand of %s must not be zero."), op_string (op
));
9614 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9615 return value_binop (arg1
, arg2
, op
);
9617 v1
= value_as_long (arg1
);
9622 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9623 v
+= v
> 0 ? -1 : 1;
9631 /* Should not reach this point. */
9635 val
= allocate_value (type1
);
9636 store_unsigned_integer (value_contents_raw (val
),
9637 TYPE_LENGTH (value_type (val
)),
9638 type_byte_order (type1
), v
);
9643 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9645 if (ada_is_direct_array_type (value_type (arg1
))
9646 || ada_is_direct_array_type (value_type (arg2
)))
9648 struct type
*arg1_type
, *arg2_type
;
9650 /* Automatically dereference any array reference before
9651 we attempt to perform the comparison. */
9652 arg1
= ada_coerce_ref (arg1
);
9653 arg2
= ada_coerce_ref (arg2
);
9655 arg1
= ada_coerce_to_simple_array (arg1
);
9656 arg2
= ada_coerce_to_simple_array (arg2
);
9658 arg1_type
= ada_check_typedef (value_type (arg1
));
9659 arg2_type
= ada_check_typedef (value_type (arg2
));
9661 if (arg1_type
->code () != TYPE_CODE_ARRAY
9662 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9663 error (_("Attempt to compare array with non-array"));
9664 /* FIXME: The following works only for types whose
9665 representations use all bits (no padding or undefined bits)
9666 and do not have user-defined equality. */
9667 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9668 && memcmp (value_contents (arg1
), value_contents (arg2
),
9669 TYPE_LENGTH (arg1_type
)) == 0);
9671 return value_equal (arg1
, arg2
);
9674 /* Total number of component associations in the aggregate starting at
9675 index PC in EXP. Assumes that index PC is the start of an
9679 num_component_specs (struct expression
*exp
, int pc
)
9683 m
= exp
->elts
[pc
+ 1].longconst
;
9686 for (i
= 0; i
< m
; i
+= 1)
9688 switch (exp
->elts
[pc
].opcode
)
9694 n
+= exp
->elts
[pc
+ 1].longconst
;
9697 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9702 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9703 component of LHS (a simple array or a record), updating *POS past
9704 the expression, assuming that LHS is contained in CONTAINER. Does
9705 not modify the inferior's memory, nor does it modify LHS (unless
9706 LHS == CONTAINER). */
9709 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9710 struct expression
*exp
, int *pos
)
9712 struct value
*mark
= value_mark ();
9714 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9716 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9718 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9719 struct value
*index_val
= value_from_longest (index_type
, index
);
9721 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9725 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9726 elt
= ada_to_fixed_value (elt
);
9729 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9730 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9732 value_assign_to_component (container
, elt
,
9733 ada_evaluate_subexp (NULL
, exp
, pos
,
9736 value_free_to_mark (mark
);
9739 /* Assuming that LHS represents an lvalue having a record or array
9740 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9741 of that aggregate's value to LHS, advancing *POS past the
9742 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9743 lvalue containing LHS (possibly LHS itself). Does not modify
9744 the inferior's memory, nor does it modify the contents of
9745 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9747 static struct value
*
9748 assign_aggregate (struct value
*container
,
9749 struct value
*lhs
, struct expression
*exp
,
9750 int *pos
, enum noside noside
)
9752 struct type
*lhs_type
;
9753 int n
= exp
->elts
[*pos
+1].longconst
;
9754 LONGEST low_index
, high_index
;
9757 int max_indices
, num_indices
;
9761 if (noside
!= EVAL_NORMAL
)
9763 for (i
= 0; i
< n
; i
+= 1)
9764 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9768 container
= ada_coerce_ref (container
);
9769 if (ada_is_direct_array_type (value_type (container
)))
9770 container
= ada_coerce_to_simple_array (container
);
9771 lhs
= ada_coerce_ref (lhs
);
9772 if (!deprecated_value_modifiable (lhs
))
9773 error (_("Left operand of assignment is not a modifiable lvalue."));
9775 lhs_type
= check_typedef (value_type (lhs
));
9776 if (ada_is_direct_array_type (lhs_type
))
9778 lhs
= ada_coerce_to_simple_array (lhs
);
9779 lhs_type
= check_typedef (value_type (lhs
));
9780 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9781 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9783 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9786 high_index
= num_visible_fields (lhs_type
) - 1;
9789 error (_("Left-hand side must be array or record."));
9791 num_specs
= num_component_specs (exp
, *pos
- 3);
9792 max_indices
= 4 * num_specs
+ 4;
9793 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9794 indices
[0] = indices
[1] = low_index
- 1;
9795 indices
[2] = indices
[3] = high_index
+ 1;
9798 for (i
= 0; i
< n
; i
+= 1)
9800 switch (exp
->elts
[*pos
].opcode
)
9803 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9804 &num_indices
, max_indices
,
9805 low_index
, high_index
);
9808 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9809 &num_indices
, max_indices
,
9810 low_index
, high_index
);
9814 error (_("Misplaced 'others' clause"));
9815 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9816 num_indices
, low_index
, high_index
);
9819 error (_("Internal error: bad aggregate clause"));
9826 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9827 construct at *POS, updating *POS past the construct, given that
9828 the positions are relative to lower bound LOW, where HIGH is the
9829 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9830 updating *NUM_INDICES as needed. CONTAINER is as for
9831 assign_aggregate. */
9833 aggregate_assign_positional (struct value
*container
,
9834 struct value
*lhs
, struct expression
*exp
,
9835 int *pos
, LONGEST
*indices
, int *num_indices
,
9836 int max_indices
, LONGEST low
, LONGEST high
)
9838 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9840 if (ind
- 1 == high
)
9841 warning (_("Extra components in aggregate ignored."));
9844 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9846 assign_component (container
, lhs
, ind
, exp
, pos
);
9849 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9852 /* Assign into the components of LHS indexed by the OP_CHOICES
9853 construct at *POS, updating *POS past the construct, given that
9854 the allowable indices are LOW..HIGH. Record the indices assigned
9855 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9856 needed. CONTAINER is as for assign_aggregate. */
9858 aggregate_assign_from_choices (struct value
*container
,
9859 struct value
*lhs
, struct expression
*exp
,
9860 int *pos
, LONGEST
*indices
, int *num_indices
,
9861 int max_indices
, LONGEST low
, LONGEST high
)
9864 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9865 int choice_pos
, expr_pc
;
9866 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9868 choice_pos
= *pos
+= 3;
9870 for (j
= 0; j
< n_choices
; j
+= 1)
9871 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9873 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9875 for (j
= 0; j
< n_choices
; j
+= 1)
9877 LONGEST lower
, upper
;
9878 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9880 if (op
== OP_DISCRETE_RANGE
)
9883 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9885 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9890 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9902 name
= &exp
->elts
[choice_pos
+ 2].string
;
9905 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9908 error (_("Invalid record component association."));
9910 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9912 if (! find_struct_field (name
, value_type (lhs
), 0,
9913 NULL
, NULL
, NULL
, NULL
, &ind
))
9914 error (_("Unknown component name: %s."), name
);
9915 lower
= upper
= ind
;
9918 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9919 error (_("Index in component association out of bounds."));
9921 add_component_interval (lower
, upper
, indices
, num_indices
,
9923 while (lower
<= upper
)
9928 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9934 /* Assign the value of the expression in the OP_OTHERS construct in
9935 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9936 have not been previously assigned. The index intervals already assigned
9937 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9938 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9940 aggregate_assign_others (struct value
*container
,
9941 struct value
*lhs
, struct expression
*exp
,
9942 int *pos
, LONGEST
*indices
, int num_indices
,
9943 LONGEST low
, LONGEST high
)
9946 int expr_pc
= *pos
+ 1;
9948 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9952 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9957 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9960 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9963 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9964 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9965 modifying *SIZE as needed. It is an error if *SIZE exceeds
9966 MAX_SIZE. The resulting intervals do not overlap. */
9968 add_component_interval (LONGEST low
, LONGEST high
,
9969 LONGEST
* indices
, int *size
, int max_size
)
9973 for (i
= 0; i
< *size
; i
+= 2) {
9974 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9978 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9979 if (high
< indices
[kh
])
9981 if (low
< indices
[i
])
9983 indices
[i
+ 1] = indices
[kh
- 1];
9984 if (high
> indices
[i
+ 1])
9985 indices
[i
+ 1] = high
;
9986 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9987 *size
-= kh
- i
- 2;
9990 else if (high
< indices
[i
])
9994 if (*size
== max_size
)
9995 error (_("Internal error: miscounted aggregate components."));
9997 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9998 indices
[j
] = indices
[j
- 2];
10000 indices
[i
+ 1] = high
;
10003 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10006 static struct value
*
10007 ada_value_cast (struct type
*type
, struct value
*arg2
)
10009 if (type
== ada_check_typedef (value_type (arg2
)))
10012 if (ada_is_gnat_encoded_fixed_point_type (type
))
10013 return cast_to_fixed (type
, arg2
);
10015 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10016 return cast_from_fixed (type
, arg2
);
10018 return value_cast (type
, arg2
);
10021 /* Evaluating Ada expressions, and printing their result.
10022 ------------------------------------------------------
10027 We usually evaluate an Ada expression in order to print its value.
10028 We also evaluate an expression in order to print its type, which
10029 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10030 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10031 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10032 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10035 Evaluating expressions is a little more complicated for Ada entities
10036 than it is for entities in languages such as C. The main reason for
10037 this is that Ada provides types whose definition might be dynamic.
10038 One example of such types is variant records. Or another example
10039 would be an array whose bounds can only be known at run time.
10041 The following description is a general guide as to what should be
10042 done (and what should NOT be done) in order to evaluate an expression
10043 involving such types, and when. This does not cover how the semantic
10044 information is encoded by GNAT as this is covered separatly. For the
10045 document used as the reference for the GNAT encoding, see exp_dbug.ads
10046 in the GNAT sources.
10048 Ideally, we should embed each part of this description next to its
10049 associated code. Unfortunately, the amount of code is so vast right
10050 now that it's hard to see whether the code handling a particular
10051 situation might be duplicated or not. One day, when the code is
10052 cleaned up, this guide might become redundant with the comments
10053 inserted in the code, and we might want to remove it.
10055 2. ``Fixing'' an Entity, the Simple Case:
10056 -----------------------------------------
10058 When evaluating Ada expressions, the tricky issue is that they may
10059 reference entities whose type contents and size are not statically
10060 known. Consider for instance a variant record:
10062 type Rec (Empty : Boolean := True) is record
10065 when False => Value : Integer;
10068 Yes : Rec := (Empty => False, Value => 1);
10069 No : Rec := (empty => True);
10071 The size and contents of that record depends on the value of the
10072 descriminant (Rec.Empty). At this point, neither the debugging
10073 information nor the associated type structure in GDB are able to
10074 express such dynamic types. So what the debugger does is to create
10075 "fixed" versions of the type that applies to the specific object.
10076 We also informally refer to this operation as "fixing" an object,
10077 which means creating its associated fixed type.
10079 Example: when printing the value of variable "Yes" above, its fixed
10080 type would look like this:
10087 On the other hand, if we printed the value of "No", its fixed type
10094 Things become a little more complicated when trying to fix an entity
10095 with a dynamic type that directly contains another dynamic type,
10096 such as an array of variant records, for instance. There are
10097 two possible cases: Arrays, and records.
10099 3. ``Fixing'' Arrays:
10100 ---------------------
10102 The type structure in GDB describes an array in terms of its bounds,
10103 and the type of its elements. By design, all elements in the array
10104 have the same type and we cannot represent an array of variant elements
10105 using the current type structure in GDB. When fixing an array,
10106 we cannot fix the array element, as we would potentially need one
10107 fixed type per element of the array. As a result, the best we can do
10108 when fixing an array is to produce an array whose bounds and size
10109 are correct (allowing us to read it from memory), but without having
10110 touched its element type. Fixing each element will be done later,
10111 when (if) necessary.
10113 Arrays are a little simpler to handle than records, because the same
10114 amount of memory is allocated for each element of the array, even if
10115 the amount of space actually used by each element differs from element
10116 to element. Consider for instance the following array of type Rec:
10118 type Rec_Array is array (1 .. 2) of Rec;
10120 The actual amount of memory occupied by each element might be different
10121 from element to element, depending on the value of their discriminant.
10122 But the amount of space reserved for each element in the array remains
10123 fixed regardless. So we simply need to compute that size using
10124 the debugging information available, from which we can then determine
10125 the array size (we multiply the number of elements of the array by
10126 the size of each element).
10128 The simplest case is when we have an array of a constrained element
10129 type. For instance, consider the following type declarations:
10131 type Bounded_String (Max_Size : Integer) is
10133 Buffer : String (1 .. Max_Size);
10135 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10137 In this case, the compiler describes the array as an array of
10138 variable-size elements (identified by its XVS suffix) for which
10139 the size can be read in the parallel XVZ variable.
10141 In the case of an array of an unconstrained element type, the compiler
10142 wraps the array element inside a private PAD type. This type should not
10143 be shown to the user, and must be "unwrap"'ed before printing. Note
10144 that we also use the adjective "aligner" in our code to designate
10145 these wrapper types.
10147 In some cases, the size allocated for each element is statically
10148 known. In that case, the PAD type already has the correct size,
10149 and the array element should remain unfixed.
10151 But there are cases when this size is not statically known.
10152 For instance, assuming that "Five" is an integer variable:
10154 type Dynamic is array (1 .. Five) of Integer;
10155 type Wrapper (Has_Length : Boolean := False) is record
10158 when True => Length : Integer;
10159 when False => null;
10162 type Wrapper_Array is array (1 .. 2) of Wrapper;
10164 Hello : Wrapper_Array := (others => (Has_Length => True,
10165 Data => (others => 17),
10169 The debugging info would describe variable Hello as being an
10170 array of a PAD type. The size of that PAD type is not statically
10171 known, but can be determined using a parallel XVZ variable.
10172 In that case, a copy of the PAD type with the correct size should
10173 be used for the fixed array.
10175 3. ``Fixing'' record type objects:
10176 ----------------------------------
10178 Things are slightly different from arrays in the case of dynamic
10179 record types. In this case, in order to compute the associated
10180 fixed type, we need to determine the size and offset of each of
10181 its components. This, in turn, requires us to compute the fixed
10182 type of each of these components.
10184 Consider for instance the example:
10186 type Bounded_String (Max_Size : Natural) is record
10187 Str : String (1 .. Max_Size);
10190 My_String : Bounded_String (Max_Size => 10);
10192 In that case, the position of field "Length" depends on the size
10193 of field Str, which itself depends on the value of the Max_Size
10194 discriminant. In order to fix the type of variable My_String,
10195 we need to fix the type of field Str. Therefore, fixing a variant
10196 record requires us to fix each of its components.
10198 However, if a component does not have a dynamic size, the component
10199 should not be fixed. In particular, fields that use a PAD type
10200 should not fixed. Here is an example where this might happen
10201 (assuming type Rec above):
10203 type Container (Big : Boolean) is record
10207 when True => Another : Integer;
10208 when False => null;
10211 My_Container : Container := (Big => False,
10212 First => (Empty => True),
10215 In that example, the compiler creates a PAD type for component First,
10216 whose size is constant, and then positions the component After just
10217 right after it. The offset of component After is therefore constant
10220 The debugger computes the position of each field based on an algorithm
10221 that uses, among other things, the actual position and size of the field
10222 preceding it. Let's now imagine that the user is trying to print
10223 the value of My_Container. If the type fixing was recursive, we would
10224 end up computing the offset of field After based on the size of the
10225 fixed version of field First. And since in our example First has
10226 only one actual field, the size of the fixed type is actually smaller
10227 than the amount of space allocated to that field, and thus we would
10228 compute the wrong offset of field After.
10230 To make things more complicated, we need to watch out for dynamic
10231 components of variant records (identified by the ___XVL suffix in
10232 the component name). Even if the target type is a PAD type, the size
10233 of that type might not be statically known. So the PAD type needs
10234 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10235 we might end up with the wrong size for our component. This can be
10236 observed with the following type declarations:
10238 type Octal is new Integer range 0 .. 7;
10239 type Octal_Array is array (Positive range <>) of Octal;
10240 pragma Pack (Octal_Array);
10242 type Octal_Buffer (Size : Positive) is record
10243 Buffer : Octal_Array (1 .. Size);
10247 In that case, Buffer is a PAD type whose size is unset and needs
10248 to be computed by fixing the unwrapped type.
10250 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10251 ----------------------------------------------------------
10253 Lastly, when should the sub-elements of an entity that remained unfixed
10254 thus far, be actually fixed?
10256 The answer is: Only when referencing that element. For instance
10257 when selecting one component of a record, this specific component
10258 should be fixed at that point in time. Or when printing the value
10259 of a record, each component should be fixed before its value gets
10260 printed. Similarly for arrays, the element of the array should be
10261 fixed when printing each element of the array, or when extracting
10262 one element out of that array. On the other hand, fixing should
10263 not be performed on the elements when taking a slice of an array!
10265 Note that one of the side effects of miscomputing the offset and
10266 size of each field is that we end up also miscomputing the size
10267 of the containing type. This can have adverse results when computing
10268 the value of an entity. GDB fetches the value of an entity based
10269 on the size of its type, and thus a wrong size causes GDB to fetch
10270 the wrong amount of memory. In the case where the computed size is
10271 too small, GDB fetches too little data to print the value of our
10272 entity. Results in this case are unpredictable, as we usually read
10273 past the buffer containing the data =:-o. */
10275 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10276 for that subexpression cast to TO_TYPE. Advance *POS over the
10280 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10281 enum noside noside
, struct type
*to_type
)
10285 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10286 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10291 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10293 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10294 return value_zero (to_type
, not_lval
);
10296 val
= evaluate_var_msym_value (noside
,
10297 exp
->elts
[pc
+ 1].objfile
,
10298 exp
->elts
[pc
+ 2].msymbol
);
10301 val
= evaluate_var_value (noside
,
10302 exp
->elts
[pc
+ 1].block
,
10303 exp
->elts
[pc
+ 2].symbol
);
10305 if (noside
== EVAL_SKIP
)
10306 return eval_skip_value (exp
);
10308 val
= ada_value_cast (to_type
, val
);
10310 /* Follow the Ada language semantics that do not allow taking
10311 an address of the result of a cast (view conversion in Ada). */
10312 if (VALUE_LVAL (val
) == lval_memory
)
10314 if (value_lazy (val
))
10315 value_fetch_lazy (val
);
10316 VALUE_LVAL (val
) = not_lval
;
10321 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10322 if (noside
== EVAL_SKIP
)
10323 return eval_skip_value (exp
);
10324 return ada_value_cast (to_type
, val
);
10327 /* Implement the evaluate_exp routine in the exp_descriptor structure
10328 for the Ada language. */
10330 static struct value
*
10331 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10332 int *pos
, enum noside noside
)
10334 enum exp_opcode op
;
10338 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10341 struct value
**argvec
;
10345 op
= exp
->elts
[pc
].opcode
;
10351 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10353 if (noside
== EVAL_NORMAL
)
10354 arg1
= unwrap_value (arg1
);
10356 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10357 then we need to perform the conversion manually, because
10358 evaluate_subexp_standard doesn't do it. This conversion is
10359 necessary in Ada because the different kinds of float/fixed
10360 types in Ada have different representations.
10362 Similarly, we need to perform the conversion from OP_LONG
10364 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10365 arg1
= ada_value_cast (expect_type
, arg1
);
10371 struct value
*result
;
10374 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10375 /* The result type will have code OP_STRING, bashed there from
10376 OP_ARRAY. Bash it back. */
10377 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10378 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10384 type
= exp
->elts
[pc
+ 1].type
;
10385 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10389 type
= exp
->elts
[pc
+ 1].type
;
10390 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10393 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10394 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10396 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10397 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10399 return ada_value_assign (arg1
, arg1
);
10401 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10402 except if the lhs of our assignment is a convenience variable.
10403 In the case of assigning to a convenience variable, the lhs
10404 should be exactly the result of the evaluation of the rhs. */
10405 type
= value_type (arg1
);
10406 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10408 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10409 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10411 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10415 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10416 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10417 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10419 (_("Fixed-point values must be assigned to fixed-point variables"));
10421 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10422 return ada_value_assign (arg1
, arg2
);
10425 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10426 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10427 if (noside
== EVAL_SKIP
)
10429 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10430 return (value_from_longest
10431 (value_type (arg1
),
10432 value_as_long (arg1
) + value_as_long (arg2
)));
10433 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10434 return (value_from_longest
10435 (value_type (arg2
),
10436 value_as_long (arg1
) + value_as_long (arg2
)));
10437 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10438 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10439 && value_type (arg1
) != value_type (arg2
))
10440 error (_("Operands of fixed-point addition must have the same type"));
10441 /* Do the addition, and cast the result to the type of the first
10442 argument. We cannot cast the result to a reference type, so if
10443 ARG1 is a reference type, find its underlying type. */
10444 type
= value_type (arg1
);
10445 while (type
->code () == TYPE_CODE_REF
)
10446 type
= TYPE_TARGET_TYPE (type
);
10447 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10448 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10451 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10452 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10453 if (noside
== EVAL_SKIP
)
10455 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10456 return (value_from_longest
10457 (value_type (arg1
),
10458 value_as_long (arg1
) - value_as_long (arg2
)));
10459 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10460 return (value_from_longest
10461 (value_type (arg2
),
10462 value_as_long (arg1
) - value_as_long (arg2
)));
10463 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10464 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10465 && value_type (arg1
) != value_type (arg2
))
10466 error (_("Operands of fixed-point subtraction "
10467 "must have the same type"));
10468 /* Do the substraction, and cast the result to the type of the first
10469 argument. We cannot cast the result to a reference type, so if
10470 ARG1 is a reference type, find its underlying type. */
10471 type
= value_type (arg1
);
10472 while (type
->code () == TYPE_CODE_REF
)
10473 type
= TYPE_TARGET_TYPE (type
);
10474 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10475 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10481 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10482 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10483 if (noside
== EVAL_SKIP
)
10485 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10487 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10488 return value_zero (value_type (arg1
), not_lval
);
10492 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10493 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10494 arg1
= cast_from_fixed (type
, arg1
);
10495 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10496 arg2
= cast_from_fixed (type
, arg2
);
10497 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10498 return ada_value_binop (arg1
, arg2
, op
);
10502 case BINOP_NOTEQUAL
:
10503 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10504 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10505 if (noside
== EVAL_SKIP
)
10507 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10511 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10512 tem
= ada_value_equal (arg1
, arg2
);
10514 if (op
== BINOP_NOTEQUAL
)
10516 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10517 return value_from_longest (type
, (LONGEST
) tem
);
10520 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10521 if (noside
== EVAL_SKIP
)
10523 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10524 return value_cast (value_type (arg1
), value_neg (arg1
));
10527 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10528 return value_neg (arg1
);
10531 case BINOP_LOGICAL_AND
:
10532 case BINOP_LOGICAL_OR
:
10533 case UNOP_LOGICAL_NOT
:
10538 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10539 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10540 return value_cast (type
, val
);
10543 case BINOP_BITWISE_AND
:
10544 case BINOP_BITWISE_IOR
:
10545 case BINOP_BITWISE_XOR
:
10549 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10551 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10553 return value_cast (value_type (arg1
), val
);
10559 if (noside
== EVAL_SKIP
)
10565 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10566 /* Only encountered when an unresolved symbol occurs in a
10567 context other than a function call, in which case, it is
10569 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10570 exp
->elts
[pc
+ 2].symbol
->print_name ());
10572 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10574 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10575 /* Check to see if this is a tagged type. We also need to handle
10576 the case where the type is a reference to a tagged type, but
10577 we have to be careful to exclude pointers to tagged types.
10578 The latter should be shown as usual (as a pointer), whereas
10579 a reference should mostly be transparent to the user. */
10580 if (ada_is_tagged_type (type
, 0)
10581 || (type
->code () == TYPE_CODE_REF
10582 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10584 /* Tagged types are a little special in the fact that the real
10585 type is dynamic and can only be determined by inspecting the
10586 object's tag. This means that we need to get the object's
10587 value first (EVAL_NORMAL) and then extract the actual object
10590 Note that we cannot skip the final step where we extract
10591 the object type from its tag, because the EVAL_NORMAL phase
10592 results in dynamic components being resolved into fixed ones.
10593 This can cause problems when trying to print the type
10594 description of tagged types whose parent has a dynamic size:
10595 We use the type name of the "_parent" component in order
10596 to print the name of the ancestor type in the type description.
10597 If that component had a dynamic size, the resolution into
10598 a fixed type would result in the loss of that type name,
10599 thus preventing us from printing the name of the ancestor
10600 type in the type description. */
10601 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10603 if (type
->code () != TYPE_CODE_REF
)
10605 struct type
*actual_type
;
10607 actual_type
= type_from_tag (ada_value_tag (arg1
));
10608 if (actual_type
== NULL
)
10609 /* If, for some reason, we were unable to determine
10610 the actual type from the tag, then use the static
10611 approximation that we just computed as a fallback.
10612 This can happen if the debugging information is
10613 incomplete, for instance. */
10614 actual_type
= type
;
10615 return value_zero (actual_type
, not_lval
);
10619 /* In the case of a ref, ada_coerce_ref takes care
10620 of determining the actual type. But the evaluation
10621 should return a ref as it should be valid to ask
10622 for its address; so rebuild a ref after coerce. */
10623 arg1
= ada_coerce_ref (arg1
);
10624 return value_ref (arg1
, TYPE_CODE_REF
);
10628 /* Records and unions for which GNAT encodings have been
10629 generated need to be statically fixed as well.
10630 Otherwise, non-static fixing produces a type where
10631 all dynamic properties are removed, which prevents "ptype"
10632 from being able to completely describe the type.
10633 For instance, a case statement in a variant record would be
10634 replaced by the relevant components based on the actual
10635 value of the discriminants. */
10636 if ((type
->code () == TYPE_CODE_STRUCT
10637 && dynamic_template_type (type
) != NULL
)
10638 || (type
->code () == TYPE_CODE_UNION
10639 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10642 return value_zero (to_static_fixed_type (type
), not_lval
);
10646 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10647 return ada_to_fixed_value (arg1
);
10652 /* Allocate arg vector, including space for the function to be
10653 called in argvec[0] and a terminating NULL. */
10654 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10655 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10657 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10658 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10659 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10660 exp
->elts
[pc
+ 5].symbol
->print_name ());
10663 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10664 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10667 if (noside
== EVAL_SKIP
)
10671 if (ada_is_constrained_packed_array_type
10672 (desc_base_type (value_type (argvec
[0]))))
10673 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10674 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10675 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10676 /* This is a packed array that has already been fixed, and
10677 therefore already coerced to a simple array. Nothing further
10680 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10682 /* Make sure we dereference references so that all the code below
10683 feels like it's really handling the referenced value. Wrapping
10684 types (for alignment) may be there, so make sure we strip them as
10686 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10688 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10689 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10690 argvec
[0] = value_addr (argvec
[0]);
10692 type
= ada_check_typedef (value_type (argvec
[0]));
10694 /* Ada allows us to implicitly dereference arrays when subscripting
10695 them. So, if this is an array typedef (encoding use for array
10696 access types encoded as fat pointers), strip it now. */
10697 if (type
->code () == TYPE_CODE_TYPEDEF
)
10698 type
= ada_typedef_target_type (type
);
10700 if (type
->code () == TYPE_CODE_PTR
)
10702 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10704 case TYPE_CODE_FUNC
:
10705 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10707 case TYPE_CODE_ARRAY
:
10709 case TYPE_CODE_STRUCT
:
10710 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10711 argvec
[0] = ada_value_ind (argvec
[0]);
10712 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10715 error (_("cannot subscript or call something of type `%s'"),
10716 ada_type_name (value_type (argvec
[0])));
10721 switch (type
->code ())
10723 case TYPE_CODE_FUNC
:
10724 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10726 if (TYPE_TARGET_TYPE (type
) == NULL
)
10727 error_call_unknown_return_type (NULL
);
10728 return allocate_value (TYPE_TARGET_TYPE (type
));
10730 return call_function_by_hand (argvec
[0], NULL
,
10731 gdb::make_array_view (argvec
+ 1,
10733 case TYPE_CODE_INTERNAL_FUNCTION
:
10734 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10735 /* We don't know anything about what the internal
10736 function might return, but we have to return
10738 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10741 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10742 argvec
[0], nargs
, argvec
+ 1);
10744 case TYPE_CODE_STRUCT
:
10748 arity
= ada_array_arity (type
);
10749 type
= ada_array_element_type (type
, nargs
);
10751 error (_("cannot subscript or call a record"));
10752 if (arity
!= nargs
)
10753 error (_("wrong number of subscripts; expecting %d"), arity
);
10754 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10755 return value_zero (ada_aligned_type (type
), lval_memory
);
10757 unwrap_value (ada_value_subscript
10758 (argvec
[0], nargs
, argvec
+ 1));
10760 case TYPE_CODE_ARRAY
:
10761 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10763 type
= ada_array_element_type (type
, nargs
);
10765 error (_("element type of array unknown"));
10767 return value_zero (ada_aligned_type (type
), lval_memory
);
10770 unwrap_value (ada_value_subscript
10771 (ada_coerce_to_simple_array (argvec
[0]),
10772 nargs
, argvec
+ 1));
10773 case TYPE_CODE_PTR
: /* Pointer to array */
10774 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10776 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10777 type
= ada_array_element_type (type
, nargs
);
10779 error (_("element type of array unknown"));
10781 return value_zero (ada_aligned_type (type
), lval_memory
);
10784 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10785 nargs
, argvec
+ 1));
10788 error (_("Attempt to index or call something other than an "
10789 "array or function"));
10794 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10795 struct value
*low_bound_val
=
10796 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10797 struct value
*high_bound_val
=
10798 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10800 LONGEST high_bound
;
10802 low_bound_val
= coerce_ref (low_bound_val
);
10803 high_bound_val
= coerce_ref (high_bound_val
);
10804 low_bound
= value_as_long (low_bound_val
);
10805 high_bound
= value_as_long (high_bound_val
);
10807 if (noside
== EVAL_SKIP
)
10810 /* If this is a reference to an aligner type, then remove all
10812 if (value_type (array
)->code () == TYPE_CODE_REF
10813 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10814 TYPE_TARGET_TYPE (value_type (array
)) =
10815 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10817 if (ada_is_constrained_packed_array_type (value_type (array
)))
10818 error (_("cannot slice a packed array"));
10820 /* If this is a reference to an array or an array lvalue,
10821 convert to a pointer. */
10822 if (value_type (array
)->code () == TYPE_CODE_REF
10823 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10824 && VALUE_LVAL (array
) == lval_memory
))
10825 array
= value_addr (array
);
10827 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10828 && ada_is_array_descriptor_type (ada_check_typedef
10829 (value_type (array
))))
10830 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10833 array
= ada_coerce_to_simple_array_ptr (array
);
10835 /* If we have more than one level of pointer indirection,
10836 dereference the value until we get only one level. */
10837 while (value_type (array
)->code () == TYPE_CODE_PTR
10838 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10840 array
= value_ind (array
);
10842 /* Make sure we really do have an array type before going further,
10843 to avoid a SEGV when trying to get the index type or the target
10844 type later down the road if the debug info generated by
10845 the compiler is incorrect or incomplete. */
10846 if (!ada_is_simple_array_type (value_type (array
)))
10847 error (_("cannot take slice of non-array"));
10849 if (ada_check_typedef (value_type (array
))->code ()
10852 struct type
*type0
= ada_check_typedef (value_type (array
));
10854 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10855 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10858 struct type
*arr_type0
=
10859 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10861 return ada_value_slice_from_ptr (array
, arr_type0
,
10862 longest_to_int (low_bound
),
10863 longest_to_int (high_bound
));
10866 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10868 else if (high_bound
< low_bound
)
10869 return empty_array (value_type (array
), low_bound
, high_bound
);
10871 return ada_value_slice (array
, longest_to_int (low_bound
),
10872 longest_to_int (high_bound
));
10875 case UNOP_IN_RANGE
:
10877 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10878 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10880 if (noside
== EVAL_SKIP
)
10883 switch (type
->code ())
10886 lim_warning (_("Membership test incompletely implemented; "
10887 "always returns true"));
10888 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10889 return value_from_longest (type
, (LONGEST
) 1);
10891 case TYPE_CODE_RANGE
:
10892 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10893 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10894 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10895 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10896 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10898 value_from_longest (type
,
10899 (value_less (arg1
, arg3
)
10900 || value_equal (arg1
, arg3
))
10901 && (value_less (arg2
, arg1
)
10902 || value_equal (arg2
, arg1
)));
10905 case BINOP_IN_BOUNDS
:
10907 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10908 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10910 if (noside
== EVAL_SKIP
)
10913 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10915 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10916 return value_zero (type
, not_lval
);
10919 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10921 type
= ada_index_type (value_type (arg2
), tem
, "range");
10923 type
= value_type (arg1
);
10925 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10926 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10928 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10929 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10930 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10932 value_from_longest (type
,
10933 (value_less (arg1
, arg3
)
10934 || value_equal (arg1
, arg3
))
10935 && (value_less (arg2
, arg1
)
10936 || value_equal (arg2
, arg1
)));
10938 case TERNOP_IN_RANGE
:
10939 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10940 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10941 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10943 if (noside
== EVAL_SKIP
)
10946 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10947 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10948 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10950 value_from_longest (type
,
10951 (value_less (arg1
, arg3
)
10952 || value_equal (arg1
, arg3
))
10953 && (value_less (arg2
, arg1
)
10954 || value_equal (arg2
, arg1
)));
10958 case OP_ATR_LENGTH
:
10960 struct type
*type_arg
;
10962 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10964 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10966 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10970 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10974 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10975 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10976 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10979 if (noside
== EVAL_SKIP
)
10981 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10983 if (type_arg
== NULL
)
10984 type_arg
= value_type (arg1
);
10986 if (ada_is_constrained_packed_array_type (type_arg
))
10987 type_arg
= decode_constrained_packed_array_type (type_arg
);
10989 if (!discrete_type_p (type_arg
))
10993 default: /* Should never happen. */
10994 error (_("unexpected attribute encountered"));
10997 type_arg
= ada_index_type (type_arg
, tem
,
10998 ada_attribute_name (op
));
11000 case OP_ATR_LENGTH
:
11001 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
11006 return value_zero (type_arg
, not_lval
);
11008 else if (type_arg
== NULL
)
11010 arg1
= ada_coerce_ref (arg1
);
11012 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
11013 arg1
= ada_coerce_to_simple_array (arg1
);
11015 if (op
== OP_ATR_LENGTH
)
11016 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11019 type
= ada_index_type (value_type (arg1
), tem
,
11020 ada_attribute_name (op
));
11022 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11027 default: /* Should never happen. */
11028 error (_("unexpected attribute encountered"));
11030 return value_from_longest
11031 (type
, ada_array_bound (arg1
, tem
, 0));
11033 return value_from_longest
11034 (type
, ada_array_bound (arg1
, tem
, 1));
11035 case OP_ATR_LENGTH
:
11036 return value_from_longest
11037 (type
, ada_array_length (arg1
, tem
));
11040 else if (discrete_type_p (type_arg
))
11042 struct type
*range_type
;
11043 const char *name
= ada_type_name (type_arg
);
11046 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
11047 range_type
= to_fixed_range_type (type_arg
, NULL
);
11048 if (range_type
== NULL
)
11049 range_type
= type_arg
;
11053 error (_("unexpected attribute encountered"));
11055 return value_from_longest
11056 (range_type
, ada_discrete_type_low_bound (range_type
));
11058 return value_from_longest
11059 (range_type
, ada_discrete_type_high_bound (range_type
));
11060 case OP_ATR_LENGTH
:
11061 error (_("the 'length attribute applies only to array types"));
11064 else if (type_arg
->code () == TYPE_CODE_FLT
)
11065 error (_("unimplemented type attribute"));
11070 if (ada_is_constrained_packed_array_type (type_arg
))
11071 type_arg
= decode_constrained_packed_array_type (type_arg
);
11073 if (op
== OP_ATR_LENGTH
)
11074 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11077 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11079 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11085 error (_("unexpected attribute encountered"));
11087 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11088 return value_from_longest (type
, low
);
11090 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11091 return value_from_longest (type
, high
);
11092 case OP_ATR_LENGTH
:
11093 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11094 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11095 return value_from_longest (type
, high
- low
+ 1);
11101 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11102 if (noside
== EVAL_SKIP
)
11105 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11106 return value_zero (ada_tag_type (arg1
), not_lval
);
11108 return ada_value_tag (arg1
);
11112 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11113 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11114 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11115 if (noside
== EVAL_SKIP
)
11117 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11118 return value_zero (value_type (arg1
), not_lval
);
11121 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11122 return value_binop (arg1
, arg2
,
11123 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11126 case OP_ATR_MODULUS
:
11128 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11130 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11131 if (noside
== EVAL_SKIP
)
11134 if (!ada_is_modular_type (type_arg
))
11135 error (_("'modulus must be applied to modular type"));
11137 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11138 ada_modulus (type_arg
));
11143 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11144 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11145 if (noside
== EVAL_SKIP
)
11147 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11148 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11149 return value_zero (type
, not_lval
);
11151 return value_pos_atr (type
, arg1
);
11154 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11155 type
= value_type (arg1
);
11157 /* If the argument is a reference, then dereference its type, since
11158 the user is really asking for the size of the actual object,
11159 not the size of the pointer. */
11160 if (type
->code () == TYPE_CODE_REF
)
11161 type
= TYPE_TARGET_TYPE (type
);
11163 if (noside
== EVAL_SKIP
)
11165 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11166 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11168 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11169 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11172 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11173 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11174 type
= exp
->elts
[pc
+ 2].type
;
11175 if (noside
== EVAL_SKIP
)
11177 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11178 return value_zero (type
, not_lval
);
11180 return value_val_atr (type
, arg1
);
11183 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11184 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11185 if (noside
== EVAL_SKIP
)
11187 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11188 return value_zero (value_type (arg1
), not_lval
);
11191 /* For integer exponentiation operations,
11192 only promote the first argument. */
11193 if (is_integral_type (value_type (arg2
)))
11194 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11196 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11198 return value_binop (arg1
, arg2
, op
);
11202 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11203 if (noside
== EVAL_SKIP
)
11209 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11210 if (noside
== EVAL_SKIP
)
11212 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11213 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11214 return value_neg (arg1
);
11219 preeval_pos
= *pos
;
11220 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11221 if (noside
== EVAL_SKIP
)
11223 type
= ada_check_typedef (value_type (arg1
));
11224 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11226 if (ada_is_array_descriptor_type (type
))
11227 /* GDB allows dereferencing GNAT array descriptors. */
11229 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11231 if (arrType
== NULL
)
11232 error (_("Attempt to dereference null array pointer."));
11233 return value_at_lazy (arrType
, 0);
11235 else if (type
->code () == TYPE_CODE_PTR
11236 || type
->code () == TYPE_CODE_REF
11237 /* In C you can dereference an array to get the 1st elt. */
11238 || type
->code () == TYPE_CODE_ARRAY
)
11240 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11241 only be determined by inspecting the object's tag.
11242 This means that we need to evaluate completely the
11243 expression in order to get its type. */
11245 if ((type
->code () == TYPE_CODE_REF
11246 || type
->code () == TYPE_CODE_PTR
)
11247 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11249 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11251 type
= value_type (ada_value_ind (arg1
));
11255 type
= to_static_fixed_type
11257 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11259 ada_ensure_varsize_limit (type
);
11260 return value_zero (type
, lval_memory
);
11262 else if (type
->code () == TYPE_CODE_INT
)
11264 /* GDB allows dereferencing an int. */
11265 if (expect_type
== NULL
)
11266 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11271 to_static_fixed_type (ada_aligned_type (expect_type
));
11272 return value_zero (expect_type
, lval_memory
);
11276 error (_("Attempt to take contents of a non-pointer value."));
11278 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11279 type
= ada_check_typedef (value_type (arg1
));
11281 if (type
->code () == TYPE_CODE_INT
)
11282 /* GDB allows dereferencing an int. If we were given
11283 the expect_type, then use that as the target type.
11284 Otherwise, assume that the target type is an int. */
11286 if (expect_type
!= NULL
)
11287 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11290 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11291 (CORE_ADDR
) value_as_address (arg1
));
11294 if (ada_is_array_descriptor_type (type
))
11295 /* GDB allows dereferencing GNAT array descriptors. */
11296 return ada_coerce_to_simple_array (arg1
);
11298 return ada_value_ind (arg1
);
11300 case STRUCTOP_STRUCT
:
11301 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11302 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11303 preeval_pos
= *pos
;
11304 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11305 if (noside
== EVAL_SKIP
)
11307 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11309 struct type
*type1
= value_type (arg1
);
11311 if (ada_is_tagged_type (type1
, 1))
11313 type
= ada_lookup_struct_elt_type (type1
,
11314 &exp
->elts
[pc
+ 2].string
,
11317 /* If the field is not found, check if it exists in the
11318 extension of this object's type. This means that we
11319 need to evaluate completely the expression. */
11323 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11325 arg1
= ada_value_struct_elt (arg1
,
11326 &exp
->elts
[pc
+ 2].string
,
11328 arg1
= unwrap_value (arg1
);
11329 type
= value_type (ada_to_fixed_value (arg1
));
11334 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11337 return value_zero (ada_aligned_type (type
), lval_memory
);
11341 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11342 arg1
= unwrap_value (arg1
);
11343 return ada_to_fixed_value (arg1
);
11347 /* The value is not supposed to be used. This is here to make it
11348 easier to accommodate expressions that contain types. */
11350 if (noside
== EVAL_SKIP
)
11352 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11353 return allocate_value (exp
->elts
[pc
+ 1].type
);
11355 error (_("Attempt to use a type name as an expression"));
11360 case OP_DISCRETE_RANGE
:
11361 case OP_POSITIONAL
:
11363 if (noside
== EVAL_NORMAL
)
11367 error (_("Undefined name, ambiguous name, or renaming used in "
11368 "component association: %s."), &exp
->elts
[pc
+2].string
);
11370 error (_("Aggregates only allowed on the right of an assignment"));
11372 internal_error (__FILE__
, __LINE__
,
11373 _("aggregate apparently mangled"));
11376 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11378 for (tem
= 0; tem
< nargs
; tem
+= 1)
11379 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11384 return eval_skip_value (exp
);
11390 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11391 type name that encodes the 'small and 'delta information.
11392 Otherwise, return NULL. */
11394 static const char *
11395 gnat_encoded_fixed_type_info (struct type
*type
)
11397 const char *name
= ada_type_name (type
);
11398 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: type
->code ();
11400 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11402 const char *tail
= strstr (name
, "___XF_");
11409 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11410 return gnat_encoded_fixed_type_info (TYPE_TARGET_TYPE (type
));
11415 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11418 ada_is_gnat_encoded_fixed_point_type (struct type
*type
)
11420 return gnat_encoded_fixed_type_info (type
) != NULL
;
11423 /* Return non-zero iff TYPE represents a System.Address type. */
11426 ada_is_system_address_type (struct type
*type
)
11428 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11431 /* Assuming that TYPE is the representation of an Ada fixed-point
11432 type, return the target floating-point type to be used to represent
11433 of this type during internal computation. */
11435 static struct type
*
11436 ada_scaling_type (struct type
*type
)
11438 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11441 /* Assuming that TYPE is the representation of an Ada fixed-point
11442 type, return its delta, or NULL if the type is malformed and the
11443 delta cannot be determined. */
11446 gnat_encoded_fixed_point_delta (struct type
*type
)
11448 const char *encoding
= gnat_encoded_fixed_type_info (type
);
11449 struct type
*scale_type
= ada_scaling_type (type
);
11451 long long num
, den
;
11453 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11456 return value_binop (value_from_longest (scale_type
, num
),
11457 value_from_longest (scale_type
, den
), BINOP_DIV
);
11460 /* Assuming that ada_is_gnat_encoded_fixed_point_type (TYPE), return
11461 the scaling factor ('SMALL value) associated with the type. */
11464 ada_scaling_factor (struct type
*type
)
11466 const char *encoding
= gnat_encoded_fixed_type_info (type
);
11467 struct type
*scale_type
= ada_scaling_type (type
);
11469 long long num0
, den0
, num1
, den1
;
11472 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11473 &num0
, &den0
, &num1
, &den1
);
11476 return value_from_longest (scale_type
, 1);
11478 return value_binop (value_from_longest (scale_type
, num1
),
11479 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11481 return value_binop (value_from_longest (scale_type
, num0
),
11482 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11489 /* Scan STR beginning at position K for a discriminant name, and
11490 return the value of that discriminant field of DVAL in *PX. If
11491 PNEW_K is not null, put the position of the character beyond the
11492 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11493 not alter *PX and *PNEW_K if unsuccessful. */
11496 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11499 static char *bound_buffer
= NULL
;
11500 static size_t bound_buffer_len
= 0;
11501 const char *pstart
, *pend
, *bound
;
11502 struct value
*bound_val
;
11504 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11508 pend
= strstr (pstart
, "__");
11512 k
+= strlen (bound
);
11516 int len
= pend
- pstart
;
11518 /* Strip __ and beyond. */
11519 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11520 strncpy (bound_buffer
, pstart
, len
);
11521 bound_buffer
[len
] = '\0';
11523 bound
= bound_buffer
;
11527 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11528 if (bound_val
== NULL
)
11531 *px
= value_as_long (bound_val
);
11532 if (pnew_k
!= NULL
)
11537 /* Value of variable named NAME in the current environment. If
11538 no such variable found, then if ERR_MSG is null, returns 0, and
11539 otherwise causes an error with message ERR_MSG. */
11541 static struct value
*
11542 get_var_value (const char *name
, const char *err_msg
)
11544 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11546 std::vector
<struct block_symbol
> syms
;
11547 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11548 get_selected_block (0),
11549 VAR_DOMAIN
, &syms
, 1);
11553 if (err_msg
== NULL
)
11556 error (("%s"), err_msg
);
11559 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11562 /* Value of integer variable named NAME in the current environment.
11563 If no such variable is found, returns false. Otherwise, sets VALUE
11564 to the variable's value and returns true. */
11567 get_int_var_value (const char *name
, LONGEST
&value
)
11569 struct value
*var_val
= get_var_value (name
, 0);
11574 value
= value_as_long (var_val
);
11579 /* Return a range type whose base type is that of the range type named
11580 NAME in the current environment, and whose bounds are calculated
11581 from NAME according to the GNAT range encoding conventions.
11582 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11583 corresponding range type from debug information; fall back to using it
11584 if symbol lookup fails. If a new type must be created, allocate it
11585 like ORIG_TYPE was. The bounds information, in general, is encoded
11586 in NAME, the base type given in the named range type. */
11588 static struct type
*
11589 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11592 struct type
*base_type
;
11593 const char *subtype_info
;
11595 gdb_assert (raw_type
!= NULL
);
11596 gdb_assert (raw_type
->name () != NULL
);
11598 if (raw_type
->code () == TYPE_CODE_RANGE
)
11599 base_type
= TYPE_TARGET_TYPE (raw_type
);
11601 base_type
= raw_type
;
11603 name
= raw_type
->name ();
11604 subtype_info
= strstr (name
, "___XD");
11605 if (subtype_info
== NULL
)
11607 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11608 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11610 if (L
< INT_MIN
|| U
> INT_MAX
)
11613 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11618 static char *name_buf
= NULL
;
11619 static size_t name_len
= 0;
11620 int prefix_len
= subtype_info
- name
;
11623 const char *bounds_str
;
11626 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11627 strncpy (name_buf
, name
, prefix_len
);
11628 name_buf
[prefix_len
] = '\0';
11631 bounds_str
= strchr (subtype_info
, '_');
11634 if (*subtype_info
== 'L')
11636 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11637 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11639 if (bounds_str
[n
] == '_')
11641 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11647 strcpy (name_buf
+ prefix_len
, "___L");
11648 if (!get_int_var_value (name_buf
, L
))
11650 lim_warning (_("Unknown lower bound, using 1."));
11655 if (*subtype_info
== 'U')
11657 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11658 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11663 strcpy (name_buf
+ prefix_len
, "___U");
11664 if (!get_int_var_value (name_buf
, U
))
11666 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11671 type
= create_static_range_type (alloc_type_copy (raw_type
),
11673 /* create_static_range_type alters the resulting type's length
11674 to match the size of the base_type, which is not what we want.
11675 Set it back to the original range type's length. */
11676 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11677 type
->set_name (name
);
11682 /* True iff NAME is the name of a range type. */
11685 ada_is_range_type_name (const char *name
)
11687 return (name
!= NULL
&& strstr (name
, "___XD"));
11691 /* Modular types */
11693 /* True iff TYPE is an Ada modular type. */
11696 ada_is_modular_type (struct type
*type
)
11698 struct type
*subranged_type
= get_base_type (type
);
11700 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11701 && subranged_type
->code () == TYPE_CODE_INT
11702 && TYPE_UNSIGNED (subranged_type
));
11705 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11708 ada_modulus (struct type
*type
)
11710 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11714 /* Ada exception catchpoint support:
11715 ---------------------------------
11717 We support 3 kinds of exception catchpoints:
11718 . catchpoints on Ada exceptions
11719 . catchpoints on unhandled Ada exceptions
11720 . catchpoints on failed assertions
11722 Exceptions raised during failed assertions, or unhandled exceptions
11723 could perfectly be caught with the general catchpoint on Ada exceptions.
11724 However, we can easily differentiate these two special cases, and having
11725 the option to distinguish these two cases from the rest can be useful
11726 to zero-in on certain situations.
11728 Exception catchpoints are a specialized form of breakpoint,
11729 since they rely on inserting breakpoints inside known routines
11730 of the GNAT runtime. The implementation therefore uses a standard
11731 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11734 Support in the runtime for exception catchpoints have been changed
11735 a few times already, and these changes affect the implementation
11736 of these catchpoints. In order to be able to support several
11737 variants of the runtime, we use a sniffer that will determine
11738 the runtime variant used by the program being debugged. */
11740 /* Ada's standard exceptions.
11742 The Ada 83 standard also defined Numeric_Error. But there so many
11743 situations where it was unclear from the Ada 83 Reference Manual
11744 (RM) whether Constraint_Error or Numeric_Error should be raised,
11745 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11746 Interpretation saying that anytime the RM says that Numeric_Error
11747 should be raised, the implementation may raise Constraint_Error.
11748 Ada 95 went one step further and pretty much removed Numeric_Error
11749 from the list of standard exceptions (it made it a renaming of
11750 Constraint_Error, to help preserve compatibility when compiling
11751 an Ada83 compiler). As such, we do not include Numeric_Error from
11752 this list of standard exceptions. */
11754 static const char *standard_exc
[] = {
11755 "constraint_error",
11761 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11763 /* A structure that describes how to support exception catchpoints
11764 for a given executable. */
11766 struct exception_support_info
11768 /* The name of the symbol to break on in order to insert
11769 a catchpoint on exceptions. */
11770 const char *catch_exception_sym
;
11772 /* The name of the symbol to break on in order to insert
11773 a catchpoint on unhandled exceptions. */
11774 const char *catch_exception_unhandled_sym
;
11776 /* The name of the symbol to break on in order to insert
11777 a catchpoint on failed assertions. */
11778 const char *catch_assert_sym
;
11780 /* The name of the symbol to break on in order to insert
11781 a catchpoint on exception handling. */
11782 const char *catch_handlers_sym
;
11784 /* Assuming that the inferior just triggered an unhandled exception
11785 catchpoint, this function is responsible for returning the address
11786 in inferior memory where the name of that exception is stored.
11787 Return zero if the address could not be computed. */
11788 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11791 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11792 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11794 /* The following exception support info structure describes how to
11795 implement exception catchpoints with the latest version of the
11796 Ada runtime (as of 2019-08-??). */
11798 static const struct exception_support_info default_exception_support_info
=
11800 "__gnat_debug_raise_exception", /* catch_exception_sym */
11801 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11802 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11803 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11804 ada_unhandled_exception_name_addr
11807 /* The following exception support info structure describes how to
11808 implement exception catchpoints with an earlier version of the
11809 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11811 static const struct exception_support_info exception_support_info_v0
=
11813 "__gnat_debug_raise_exception", /* catch_exception_sym */
11814 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11815 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11816 "__gnat_begin_handler", /* catch_handlers_sym */
11817 ada_unhandled_exception_name_addr
11820 /* The following exception support info structure describes how to
11821 implement exception catchpoints with a slightly older version
11822 of the Ada runtime. */
11824 static const struct exception_support_info exception_support_info_fallback
=
11826 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11827 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11828 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11829 "__gnat_begin_handler", /* catch_handlers_sym */
11830 ada_unhandled_exception_name_addr_from_raise
11833 /* Return nonzero if we can detect the exception support routines
11834 described in EINFO.
11836 This function errors out if an abnormal situation is detected
11837 (for instance, if we find the exception support routines, but
11838 that support is found to be incomplete). */
11841 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11843 struct symbol
*sym
;
11845 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11846 that should be compiled with debugging information. As a result, we
11847 expect to find that symbol in the symtabs. */
11849 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11852 /* Perhaps we did not find our symbol because the Ada runtime was
11853 compiled without debugging info, or simply stripped of it.
11854 It happens on some GNU/Linux distributions for instance, where
11855 users have to install a separate debug package in order to get
11856 the runtime's debugging info. In that situation, let the user
11857 know why we cannot insert an Ada exception catchpoint.
11859 Note: Just for the purpose of inserting our Ada exception
11860 catchpoint, we could rely purely on the associated minimal symbol.
11861 But we would be operating in degraded mode anyway, since we are
11862 still lacking the debugging info needed later on to extract
11863 the name of the exception being raised (this name is printed in
11864 the catchpoint message, and is also used when trying to catch
11865 a specific exception). We do not handle this case for now. */
11866 struct bound_minimal_symbol msym
11867 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11869 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11870 error (_("Your Ada runtime appears to be missing some debugging "
11871 "information.\nCannot insert Ada exception catchpoint "
11872 "in this configuration."));
11877 /* Make sure that the symbol we found corresponds to a function. */
11879 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11881 error (_("Symbol \"%s\" is not a function (class = %d)"),
11882 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11886 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11889 struct bound_minimal_symbol msym
11890 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11892 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11893 error (_("Your Ada runtime appears to be missing some debugging "
11894 "information.\nCannot insert Ada exception catchpoint "
11895 "in this configuration."));
11900 /* Make sure that the symbol we found corresponds to a function. */
11902 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11904 error (_("Symbol \"%s\" is not a function (class = %d)"),
11905 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11912 /* Inspect the Ada runtime and determine which exception info structure
11913 should be used to provide support for exception catchpoints.
11915 This function will always set the per-inferior exception_info,
11916 or raise an error. */
11919 ada_exception_support_info_sniffer (void)
11921 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11923 /* If the exception info is already known, then no need to recompute it. */
11924 if (data
->exception_info
!= NULL
)
11927 /* Check the latest (default) exception support info. */
11928 if (ada_has_this_exception_support (&default_exception_support_info
))
11930 data
->exception_info
= &default_exception_support_info
;
11934 /* Try the v0 exception suport info. */
11935 if (ada_has_this_exception_support (&exception_support_info_v0
))
11937 data
->exception_info
= &exception_support_info_v0
;
11941 /* Try our fallback exception suport info. */
11942 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11944 data
->exception_info
= &exception_support_info_fallback
;
11948 /* Sometimes, it is normal for us to not be able to find the routine
11949 we are looking for. This happens when the program is linked with
11950 the shared version of the GNAT runtime, and the program has not been
11951 started yet. Inform the user of these two possible causes if
11954 if (ada_update_initial_language (language_unknown
) != language_ada
)
11955 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11957 /* If the symbol does not exist, then check that the program is
11958 already started, to make sure that shared libraries have been
11959 loaded. If it is not started, this may mean that the symbol is
11960 in a shared library. */
11962 if (inferior_ptid
.pid () == 0)
11963 error (_("Unable to insert catchpoint. Try to start the program first."));
11965 /* At this point, we know that we are debugging an Ada program and
11966 that the inferior has been started, but we still are not able to
11967 find the run-time symbols. That can mean that we are in
11968 configurable run time mode, or that a-except as been optimized
11969 out by the linker... In any case, at this point it is not worth
11970 supporting this feature. */
11972 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11975 /* True iff FRAME is very likely to be that of a function that is
11976 part of the runtime system. This is all very heuristic, but is
11977 intended to be used as advice as to what frames are uninteresting
11981 is_known_support_routine (struct frame_info
*frame
)
11983 enum language func_lang
;
11985 const char *fullname
;
11987 /* If this code does not have any debugging information (no symtab),
11988 This cannot be any user code. */
11990 symtab_and_line sal
= find_frame_sal (frame
);
11991 if (sal
.symtab
== NULL
)
11994 /* If there is a symtab, but the associated source file cannot be
11995 located, then assume this is not user code: Selecting a frame
11996 for which we cannot display the code would not be very helpful
11997 for the user. This should also take care of case such as VxWorks
11998 where the kernel has some debugging info provided for a few units. */
12000 fullname
= symtab_to_fullname (sal
.symtab
);
12001 if (access (fullname
, R_OK
) != 0)
12004 /* Check the unit filename against the Ada runtime file naming.
12005 We also check the name of the objfile against the name of some
12006 known system libraries that sometimes come with debugging info
12009 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
12011 re_comp (known_runtime_file_name_patterns
[i
]);
12012 if (re_exec (lbasename (sal
.symtab
->filename
)))
12014 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
12015 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
12019 /* Check whether the function is a GNAT-generated entity. */
12021 gdb::unique_xmalloc_ptr
<char> func_name
12022 = find_frame_funname (frame
, &func_lang
, NULL
);
12023 if (func_name
== NULL
)
12026 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
12028 re_comp (known_auxiliary_function_name_patterns
[i
]);
12029 if (re_exec (func_name
.get ()))
12036 /* Find the first frame that contains debugging information and that is not
12037 part of the Ada run-time, starting from FI and moving upward. */
12040 ada_find_printable_frame (struct frame_info
*fi
)
12042 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
12044 if (!is_known_support_routine (fi
))
12053 /* Assuming that the inferior just triggered an unhandled exception
12054 catchpoint, return the address in inferior memory where the name
12055 of the exception is stored.
12057 Return zero if the address could not be computed. */
12060 ada_unhandled_exception_name_addr (void)
12062 return parse_and_eval_address ("e.full_name");
12065 /* Same as ada_unhandled_exception_name_addr, except that this function
12066 should be used when the inferior uses an older version of the runtime,
12067 where the exception name needs to be extracted from a specific frame
12068 several frames up in the callstack. */
12071 ada_unhandled_exception_name_addr_from_raise (void)
12074 struct frame_info
*fi
;
12075 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12077 /* To determine the name of this exception, we need to select
12078 the frame corresponding to RAISE_SYM_NAME. This frame is
12079 at least 3 levels up, so we simply skip the first 3 frames
12080 without checking the name of their associated function. */
12081 fi
= get_current_frame ();
12082 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
12084 fi
= get_prev_frame (fi
);
12088 enum language func_lang
;
12090 gdb::unique_xmalloc_ptr
<char> func_name
12091 = find_frame_funname (fi
, &func_lang
, NULL
);
12092 if (func_name
!= NULL
)
12094 if (strcmp (func_name
.get (),
12095 data
->exception_info
->catch_exception_sym
) == 0)
12096 break; /* We found the frame we were looking for... */
12098 fi
= get_prev_frame (fi
);
12105 return parse_and_eval_address ("id.full_name");
12108 /* Assuming the inferior just triggered an Ada exception catchpoint
12109 (of any type), return the address in inferior memory where the name
12110 of the exception is stored, if applicable.
12112 Assumes the selected frame is the current frame.
12114 Return zero if the address could not be computed, or if not relevant. */
12117 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12118 struct breakpoint
*b
)
12120 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12124 case ada_catch_exception
:
12125 return (parse_and_eval_address ("e.full_name"));
12128 case ada_catch_exception_unhandled
:
12129 return data
->exception_info
->unhandled_exception_name_addr ();
12132 case ada_catch_handlers
:
12133 return 0; /* The runtimes does not provide access to the exception
12137 case ada_catch_assert
:
12138 return 0; /* Exception name is not relevant in this case. */
12142 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12146 return 0; /* Should never be reached. */
12149 /* Assuming the inferior is stopped at an exception catchpoint,
12150 return the message which was associated to the exception, if
12151 available. Return NULL if the message could not be retrieved.
12153 Note: The exception message can be associated to an exception
12154 either through the use of the Raise_Exception function, or
12155 more simply (Ada 2005 and later), via:
12157 raise Exception_Name with "exception message";
12161 static gdb::unique_xmalloc_ptr
<char>
12162 ada_exception_message_1 (void)
12164 struct value
*e_msg_val
;
12167 /* For runtimes that support this feature, the exception message
12168 is passed as an unbounded string argument called "message". */
12169 e_msg_val
= parse_and_eval ("message");
12170 if (e_msg_val
== NULL
)
12171 return NULL
; /* Exception message not supported. */
12173 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
12174 gdb_assert (e_msg_val
!= NULL
);
12175 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
12177 /* If the message string is empty, then treat it as if there was
12178 no exception message. */
12179 if (e_msg_len
<= 0)
12182 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
12183 read_memory_string (value_address (e_msg_val
), e_msg
.get (), e_msg_len
+ 1);
12184 e_msg
.get ()[e_msg_len
] = '\0';
12189 /* Same as ada_exception_message_1, except that all exceptions are
12190 contained here (returning NULL instead). */
12192 static gdb::unique_xmalloc_ptr
<char>
12193 ada_exception_message (void)
12195 gdb::unique_xmalloc_ptr
<char> e_msg
;
12199 e_msg
= ada_exception_message_1 ();
12201 catch (const gdb_exception_error
&e
)
12203 e_msg
.reset (nullptr);
12209 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12210 any error that ada_exception_name_addr_1 might cause to be thrown.
12211 When an error is intercepted, a warning with the error message is printed,
12212 and zero is returned. */
12215 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12216 struct breakpoint
*b
)
12218 CORE_ADDR result
= 0;
12222 result
= ada_exception_name_addr_1 (ex
, b
);
12225 catch (const gdb_exception_error
&e
)
12227 warning (_("failed to get exception name: %s"), e
.what ());
12234 static std::string ada_exception_catchpoint_cond_string
12235 (const char *excep_string
,
12236 enum ada_exception_catchpoint_kind ex
);
12238 /* Ada catchpoints.
12240 In the case of catchpoints on Ada exceptions, the catchpoint will
12241 stop the target on every exception the program throws. When a user
12242 specifies the name of a specific exception, we translate this
12243 request into a condition expression (in text form), and then parse
12244 it into an expression stored in each of the catchpoint's locations.
12245 We then use this condition to check whether the exception that was
12246 raised is the one the user is interested in. If not, then the
12247 target is resumed again. We store the name of the requested
12248 exception, in order to be able to re-set the condition expression
12249 when symbols change. */
12251 /* An instance of this type is used to represent an Ada catchpoint
12252 breakpoint location. */
12254 class ada_catchpoint_location
: public bp_location
12257 ada_catchpoint_location (breakpoint
*owner
)
12258 : bp_location (owner
, bp_loc_software_breakpoint
)
12261 /* The condition that checks whether the exception that was raised
12262 is the specific exception the user specified on catchpoint
12264 expression_up excep_cond_expr
;
12267 /* An instance of this type is used to represent an Ada catchpoint. */
12269 struct ada_catchpoint
: public breakpoint
12271 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12276 /* The name of the specific exception the user specified. */
12277 std::string excep_string
;
12279 /* What kind of catchpoint this is. */
12280 enum ada_exception_catchpoint_kind m_kind
;
12283 /* Parse the exception condition string in the context of each of the
12284 catchpoint's locations, and store them for later evaluation. */
12287 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12288 enum ada_exception_catchpoint_kind ex
)
12290 struct bp_location
*bl
;
12292 /* Nothing to do if there's no specific exception to catch. */
12293 if (c
->excep_string
.empty ())
12296 /* Same if there are no locations... */
12297 if (c
->loc
== NULL
)
12300 /* Compute the condition expression in text form, from the specific
12301 expection we want to catch. */
12302 std::string cond_string
12303 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12305 /* Iterate over all the catchpoint's locations, and parse an
12306 expression for each. */
12307 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12309 struct ada_catchpoint_location
*ada_loc
12310 = (struct ada_catchpoint_location
*) bl
;
12313 if (!bl
->shlib_disabled
)
12317 s
= cond_string
.c_str ();
12320 exp
= parse_exp_1 (&s
, bl
->address
,
12321 block_for_pc (bl
->address
),
12324 catch (const gdb_exception_error
&e
)
12326 warning (_("failed to reevaluate internal exception condition "
12327 "for catchpoint %d: %s"),
12328 c
->number
, e
.what ());
12332 ada_loc
->excep_cond_expr
= std::move (exp
);
12336 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12337 structure for all exception catchpoint kinds. */
12339 static struct bp_location
*
12340 allocate_location_exception (struct breakpoint
*self
)
12342 return new ada_catchpoint_location (self
);
12345 /* Implement the RE_SET method in the breakpoint_ops structure for all
12346 exception catchpoint kinds. */
12349 re_set_exception (struct breakpoint
*b
)
12351 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12353 /* Call the base class's method. This updates the catchpoint's
12355 bkpt_breakpoint_ops
.re_set (b
);
12357 /* Reparse the exception conditional expressions. One for each
12359 create_excep_cond_exprs (c
, c
->m_kind
);
12362 /* Returns true if we should stop for this breakpoint hit. If the
12363 user specified a specific exception, we only want to cause a stop
12364 if the program thrown that exception. */
12367 should_stop_exception (const struct bp_location
*bl
)
12369 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12370 const struct ada_catchpoint_location
*ada_loc
12371 = (const struct ada_catchpoint_location
*) bl
;
12374 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12375 if (c
->m_kind
== ada_catch_assert
)
12376 clear_internalvar (var
);
12383 if (c
->m_kind
== ada_catch_handlers
)
12384 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12385 ".all.occurrence.id");
12389 struct value
*exc
= parse_and_eval (expr
);
12390 set_internalvar (var
, exc
);
12392 catch (const gdb_exception_error
&ex
)
12394 clear_internalvar (var
);
12398 /* With no specific exception, should always stop. */
12399 if (c
->excep_string
.empty ())
12402 if (ada_loc
->excep_cond_expr
== NULL
)
12404 /* We will have a NULL expression if back when we were creating
12405 the expressions, this location's had failed to parse. */
12412 struct value
*mark
;
12414 mark
= value_mark ();
12415 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12416 value_free_to_mark (mark
);
12418 catch (const gdb_exception
&ex
)
12420 exception_fprintf (gdb_stderr
, ex
,
12421 _("Error in testing exception condition:\n"));
12427 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12428 for all exception catchpoint kinds. */
12431 check_status_exception (bpstat bs
)
12433 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12436 /* Implement the PRINT_IT method in the breakpoint_ops structure
12437 for all exception catchpoint kinds. */
12439 static enum print_stop_action
12440 print_it_exception (bpstat bs
)
12442 struct ui_out
*uiout
= current_uiout
;
12443 struct breakpoint
*b
= bs
->breakpoint_at
;
12445 annotate_catchpoint (b
->number
);
12447 if (uiout
->is_mi_like_p ())
12449 uiout
->field_string ("reason",
12450 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12451 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12454 uiout
->text (b
->disposition
== disp_del
12455 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12456 uiout
->field_signed ("bkptno", b
->number
);
12457 uiout
->text (", ");
12459 /* ada_exception_name_addr relies on the selected frame being the
12460 current frame. Need to do this here because this function may be
12461 called more than once when printing a stop, and below, we'll
12462 select the first frame past the Ada run-time (see
12463 ada_find_printable_frame). */
12464 select_frame (get_current_frame ());
12466 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12469 case ada_catch_exception
:
12470 case ada_catch_exception_unhandled
:
12471 case ada_catch_handlers
:
12473 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12474 char exception_name
[256];
12478 read_memory (addr
, (gdb_byte
*) exception_name
,
12479 sizeof (exception_name
) - 1);
12480 exception_name
[sizeof (exception_name
) - 1] = '\0';
12484 /* For some reason, we were unable to read the exception
12485 name. This could happen if the Runtime was compiled
12486 without debugging info, for instance. In that case,
12487 just replace the exception name by the generic string
12488 "exception" - it will read as "an exception" in the
12489 notification we are about to print. */
12490 memcpy (exception_name
, "exception", sizeof ("exception"));
12492 /* In the case of unhandled exception breakpoints, we print
12493 the exception name as "unhandled EXCEPTION_NAME", to make
12494 it clearer to the user which kind of catchpoint just got
12495 hit. We used ui_out_text to make sure that this extra
12496 info does not pollute the exception name in the MI case. */
12497 if (c
->m_kind
== ada_catch_exception_unhandled
)
12498 uiout
->text ("unhandled ");
12499 uiout
->field_string ("exception-name", exception_name
);
12502 case ada_catch_assert
:
12503 /* In this case, the name of the exception is not really
12504 important. Just print "failed assertion" to make it clearer
12505 that his program just hit an assertion-failure catchpoint.
12506 We used ui_out_text because this info does not belong in
12508 uiout
->text ("failed assertion");
12512 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12513 if (exception_message
!= NULL
)
12515 uiout
->text (" (");
12516 uiout
->field_string ("exception-message", exception_message
.get ());
12520 uiout
->text (" at ");
12521 ada_find_printable_frame (get_current_frame ());
12523 return PRINT_SRC_AND_LOC
;
12526 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12527 for all exception catchpoint kinds. */
12530 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12532 struct ui_out
*uiout
= current_uiout
;
12533 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12534 struct value_print_options opts
;
12536 get_user_print_options (&opts
);
12538 if (opts
.addressprint
)
12539 uiout
->field_skip ("addr");
12541 annotate_field (5);
12544 case ada_catch_exception
:
12545 if (!c
->excep_string
.empty ())
12547 std::string msg
= string_printf (_("`%s' Ada exception"),
12548 c
->excep_string
.c_str ());
12550 uiout
->field_string ("what", msg
);
12553 uiout
->field_string ("what", "all Ada exceptions");
12557 case ada_catch_exception_unhandled
:
12558 uiout
->field_string ("what", "unhandled Ada exceptions");
12561 case ada_catch_handlers
:
12562 if (!c
->excep_string
.empty ())
12564 uiout
->field_fmt ("what",
12565 _("`%s' Ada exception handlers"),
12566 c
->excep_string
.c_str ());
12569 uiout
->field_string ("what", "all Ada exceptions handlers");
12572 case ada_catch_assert
:
12573 uiout
->field_string ("what", "failed Ada assertions");
12577 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12582 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12583 for all exception catchpoint kinds. */
12586 print_mention_exception (struct breakpoint
*b
)
12588 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12589 struct ui_out
*uiout
= current_uiout
;
12591 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12592 : _("Catchpoint "));
12593 uiout
->field_signed ("bkptno", b
->number
);
12594 uiout
->text (": ");
12598 case ada_catch_exception
:
12599 if (!c
->excep_string
.empty ())
12601 std::string info
= string_printf (_("`%s' Ada exception"),
12602 c
->excep_string
.c_str ());
12603 uiout
->text (info
.c_str ());
12606 uiout
->text (_("all Ada exceptions"));
12609 case ada_catch_exception_unhandled
:
12610 uiout
->text (_("unhandled Ada exceptions"));
12613 case ada_catch_handlers
:
12614 if (!c
->excep_string
.empty ())
12617 = string_printf (_("`%s' Ada exception handlers"),
12618 c
->excep_string
.c_str ());
12619 uiout
->text (info
.c_str ());
12622 uiout
->text (_("all Ada exceptions handlers"));
12625 case ada_catch_assert
:
12626 uiout
->text (_("failed Ada assertions"));
12630 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12635 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12636 for all exception catchpoint kinds. */
12639 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12641 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12645 case ada_catch_exception
:
12646 fprintf_filtered (fp
, "catch exception");
12647 if (!c
->excep_string
.empty ())
12648 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12651 case ada_catch_exception_unhandled
:
12652 fprintf_filtered (fp
, "catch exception unhandled");
12655 case ada_catch_handlers
:
12656 fprintf_filtered (fp
, "catch handlers");
12659 case ada_catch_assert
:
12660 fprintf_filtered (fp
, "catch assert");
12664 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12666 print_recreate_thread (b
, fp
);
12669 /* Virtual tables for various breakpoint types. */
12670 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12671 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12672 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12673 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12675 /* See ada-lang.h. */
12678 is_ada_exception_catchpoint (breakpoint
*bp
)
12680 return (bp
->ops
== &catch_exception_breakpoint_ops
12681 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12682 || bp
->ops
== &catch_assert_breakpoint_ops
12683 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12686 /* Split the arguments specified in a "catch exception" command.
12687 Set EX to the appropriate catchpoint type.
12688 Set EXCEP_STRING to the name of the specific exception if
12689 specified by the user.
12690 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12691 "catch handlers" command. False otherwise.
12692 If a condition is found at the end of the arguments, the condition
12693 expression is stored in COND_STRING (memory must be deallocated
12694 after use). Otherwise COND_STRING is set to NULL. */
12697 catch_ada_exception_command_split (const char *args
,
12698 bool is_catch_handlers_cmd
,
12699 enum ada_exception_catchpoint_kind
*ex
,
12700 std::string
*excep_string
,
12701 std::string
*cond_string
)
12703 std::string exception_name
;
12705 exception_name
= extract_arg (&args
);
12706 if (exception_name
== "if")
12708 /* This is not an exception name; this is the start of a condition
12709 expression for a catchpoint on all exceptions. So, "un-get"
12710 this token, and set exception_name to NULL. */
12711 exception_name
.clear ();
12715 /* Check to see if we have a condition. */
12717 args
= skip_spaces (args
);
12718 if (startswith (args
, "if")
12719 && (isspace (args
[2]) || args
[2] == '\0'))
12722 args
= skip_spaces (args
);
12724 if (args
[0] == '\0')
12725 error (_("Condition missing after `if' keyword"));
12726 *cond_string
= args
;
12728 args
+= strlen (args
);
12731 /* Check that we do not have any more arguments. Anything else
12734 if (args
[0] != '\0')
12735 error (_("Junk at end of expression"));
12737 if (is_catch_handlers_cmd
)
12739 /* Catch handling of exceptions. */
12740 *ex
= ada_catch_handlers
;
12741 *excep_string
= exception_name
;
12743 else if (exception_name
.empty ())
12745 /* Catch all exceptions. */
12746 *ex
= ada_catch_exception
;
12747 excep_string
->clear ();
12749 else if (exception_name
== "unhandled")
12751 /* Catch unhandled exceptions. */
12752 *ex
= ada_catch_exception_unhandled
;
12753 excep_string
->clear ();
12757 /* Catch a specific exception. */
12758 *ex
= ada_catch_exception
;
12759 *excep_string
= exception_name
;
12763 /* Return the name of the symbol on which we should break in order to
12764 implement a catchpoint of the EX kind. */
12766 static const char *
12767 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12769 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12771 gdb_assert (data
->exception_info
!= NULL
);
12775 case ada_catch_exception
:
12776 return (data
->exception_info
->catch_exception_sym
);
12778 case ada_catch_exception_unhandled
:
12779 return (data
->exception_info
->catch_exception_unhandled_sym
);
12781 case ada_catch_assert
:
12782 return (data
->exception_info
->catch_assert_sym
);
12784 case ada_catch_handlers
:
12785 return (data
->exception_info
->catch_handlers_sym
);
12788 internal_error (__FILE__
, __LINE__
,
12789 _("unexpected catchpoint kind (%d)"), ex
);
12793 /* Return the breakpoint ops "virtual table" used for catchpoints
12796 static const struct breakpoint_ops
*
12797 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12801 case ada_catch_exception
:
12802 return (&catch_exception_breakpoint_ops
);
12804 case ada_catch_exception_unhandled
:
12805 return (&catch_exception_unhandled_breakpoint_ops
);
12807 case ada_catch_assert
:
12808 return (&catch_assert_breakpoint_ops
);
12810 case ada_catch_handlers
:
12811 return (&catch_handlers_breakpoint_ops
);
12814 internal_error (__FILE__
, __LINE__
,
12815 _("unexpected catchpoint kind (%d)"), ex
);
12819 /* Return the condition that will be used to match the current exception
12820 being raised with the exception that the user wants to catch. This
12821 assumes that this condition is used when the inferior just triggered
12822 an exception catchpoint.
12823 EX: the type of catchpoints used for catching Ada exceptions. */
12826 ada_exception_catchpoint_cond_string (const char *excep_string
,
12827 enum ada_exception_catchpoint_kind ex
)
12830 bool is_standard_exc
= false;
12831 std::string result
;
12833 if (ex
== ada_catch_handlers
)
12835 /* For exception handlers catchpoints, the condition string does
12836 not use the same parameter as for the other exceptions. */
12837 result
= ("long_integer (GNAT_GCC_exception_Access"
12838 "(gcc_exception).all.occurrence.id)");
12841 result
= "long_integer (e)";
12843 /* The standard exceptions are a special case. They are defined in
12844 runtime units that have been compiled without debugging info; if
12845 EXCEP_STRING is the not-fully-qualified name of a standard
12846 exception (e.g. "constraint_error") then, during the evaluation
12847 of the condition expression, the symbol lookup on this name would
12848 *not* return this standard exception. The catchpoint condition
12849 may then be set only on user-defined exceptions which have the
12850 same not-fully-qualified name (e.g. my_package.constraint_error).
12852 To avoid this unexcepted behavior, these standard exceptions are
12853 systematically prefixed by "standard". This means that "catch
12854 exception constraint_error" is rewritten into "catch exception
12855 standard.constraint_error".
12857 If an exception named constraint_error is defined in another package of
12858 the inferior program, then the only way to specify this exception as a
12859 breakpoint condition is to use its fully-qualified named:
12860 e.g. my_package.constraint_error. */
12862 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12864 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12866 is_standard_exc
= true;
12873 if (is_standard_exc
)
12874 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12876 string_appendf (result
, "long_integer (&%s)", excep_string
);
12881 /* Return the symtab_and_line that should be used to insert an exception
12882 catchpoint of the TYPE kind.
12884 ADDR_STRING returns the name of the function where the real
12885 breakpoint that implements the catchpoints is set, depending on the
12886 type of catchpoint we need to create. */
12888 static struct symtab_and_line
12889 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12890 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12892 const char *sym_name
;
12893 struct symbol
*sym
;
12895 /* First, find out which exception support info to use. */
12896 ada_exception_support_info_sniffer ();
12898 /* Then lookup the function on which we will break in order to catch
12899 the Ada exceptions requested by the user. */
12900 sym_name
= ada_exception_sym_name (ex
);
12901 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12904 error (_("Catchpoint symbol not found: %s"), sym_name
);
12906 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12907 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12909 /* Set ADDR_STRING. */
12910 *addr_string
= sym_name
;
12913 *ops
= ada_exception_breakpoint_ops (ex
);
12915 return find_function_start_sal (sym
, 1);
12918 /* Create an Ada exception catchpoint.
12920 EX_KIND is the kind of exception catchpoint to be created.
12922 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12923 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12924 of the exception to which this catchpoint applies.
12926 COND_STRING, if not empty, is the catchpoint condition.
12928 TEMPFLAG, if nonzero, means that the underlying breakpoint
12929 should be temporary.
12931 FROM_TTY is the usual argument passed to all commands implementations. */
12934 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12935 enum ada_exception_catchpoint_kind ex_kind
,
12936 const std::string
&excep_string
,
12937 const std::string
&cond_string
,
12942 std::string addr_string
;
12943 const struct breakpoint_ops
*ops
= NULL
;
12944 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12946 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12947 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12948 ops
, tempflag
, disabled
, from_tty
);
12949 c
->excep_string
= excep_string
;
12950 create_excep_cond_exprs (c
.get (), ex_kind
);
12951 if (!cond_string
.empty ())
12952 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
);
12953 install_breakpoint (0, std::move (c
), 1);
12956 /* Implement the "catch exception" command. */
12959 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12960 struct cmd_list_element
*command
)
12962 const char *arg
= arg_entry
;
12963 struct gdbarch
*gdbarch
= get_current_arch ();
12965 enum ada_exception_catchpoint_kind ex_kind
;
12966 std::string excep_string
;
12967 std::string cond_string
;
12969 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12973 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12975 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12976 excep_string
, cond_string
,
12977 tempflag
, 1 /* enabled */,
12981 /* Implement the "catch handlers" command. */
12984 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12985 struct cmd_list_element
*command
)
12987 const char *arg
= arg_entry
;
12988 struct gdbarch
*gdbarch
= get_current_arch ();
12990 enum ada_exception_catchpoint_kind ex_kind
;
12991 std::string excep_string
;
12992 std::string cond_string
;
12994 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12998 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
13000 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
13001 excep_string
, cond_string
,
13002 tempflag
, 1 /* enabled */,
13006 /* Completion function for the Ada "catch" commands. */
13009 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
13010 const char *text
, const char *word
)
13012 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
13014 for (const ada_exc_info
&info
: exceptions
)
13016 if (startswith (info
.name
, word
))
13017 tracker
.add_completion (make_unique_xstrdup (info
.name
));
13021 /* Split the arguments specified in a "catch assert" command.
13023 ARGS contains the command's arguments (or the empty string if
13024 no arguments were passed).
13026 If ARGS contains a condition, set COND_STRING to that condition
13027 (the memory needs to be deallocated after use). */
13030 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
13032 args
= skip_spaces (args
);
13034 /* Check whether a condition was provided. */
13035 if (startswith (args
, "if")
13036 && (isspace (args
[2]) || args
[2] == '\0'))
13039 args
= skip_spaces (args
);
13040 if (args
[0] == '\0')
13041 error (_("condition missing after `if' keyword"));
13042 cond_string
.assign (args
);
13045 /* Otherwise, there should be no other argument at the end of
13047 else if (args
[0] != '\0')
13048 error (_("Junk at end of arguments."));
13051 /* Implement the "catch assert" command. */
13054 catch_assert_command (const char *arg_entry
, int from_tty
,
13055 struct cmd_list_element
*command
)
13057 const char *arg
= arg_entry
;
13058 struct gdbarch
*gdbarch
= get_current_arch ();
13060 std::string cond_string
;
13062 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13066 catch_ada_assert_command_split (arg
, cond_string
);
13067 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
13069 tempflag
, 1 /* enabled */,
13073 /* Return non-zero if the symbol SYM is an Ada exception object. */
13076 ada_is_exception_sym (struct symbol
*sym
)
13078 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
13080 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
13081 && SYMBOL_CLASS (sym
) != LOC_BLOCK
13082 && SYMBOL_CLASS (sym
) != LOC_CONST
13083 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
13084 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
13087 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13088 Ada exception object. This matches all exceptions except the ones
13089 defined by the Ada language. */
13092 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13096 if (!ada_is_exception_sym (sym
))
13099 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13100 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
13101 return 0; /* A standard exception. */
13103 /* Numeric_Error is also a standard exception, so exclude it.
13104 See the STANDARD_EXC description for more details as to why
13105 this exception is not listed in that array. */
13106 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
13112 /* A helper function for std::sort, comparing two struct ada_exc_info
13115 The comparison is determined first by exception name, and then
13116 by exception address. */
13119 ada_exc_info::operator< (const ada_exc_info
&other
) const
13123 result
= strcmp (name
, other
.name
);
13126 if (result
== 0 && addr
< other
.addr
)
13132 ada_exc_info::operator== (const ada_exc_info
&other
) const
13134 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
13137 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13138 routine, but keeping the first SKIP elements untouched.
13140 All duplicates are also removed. */
13143 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
13146 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
13147 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
13148 exceptions
->end ());
13151 /* Add all exceptions defined by the Ada standard whose name match
13152 a regular expression.
13154 If PREG is not NULL, then this regexp_t object is used to
13155 perform the symbol name matching. Otherwise, no name-based
13156 filtering is performed.
13158 EXCEPTIONS is a vector of exceptions to which matching exceptions
13162 ada_add_standard_exceptions (compiled_regex
*preg
,
13163 std::vector
<ada_exc_info
> *exceptions
)
13167 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13170 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
13172 struct bound_minimal_symbol msymbol
13173 = ada_lookup_simple_minsym (standard_exc
[i
]);
13175 if (msymbol
.minsym
!= NULL
)
13177 struct ada_exc_info info
13178 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13180 exceptions
->push_back (info
);
13186 /* Add all Ada exceptions defined locally and accessible from the given
13189 If PREG is not NULL, then this regexp_t object is used to
13190 perform the symbol name matching. Otherwise, no name-based
13191 filtering is performed.
13193 EXCEPTIONS is a vector of exceptions to which matching exceptions
13197 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13198 struct frame_info
*frame
,
13199 std::vector
<ada_exc_info
> *exceptions
)
13201 const struct block
*block
= get_frame_block (frame
, 0);
13205 struct block_iterator iter
;
13206 struct symbol
*sym
;
13208 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13210 switch (SYMBOL_CLASS (sym
))
13217 if (ada_is_exception_sym (sym
))
13219 struct ada_exc_info info
= {sym
->print_name (),
13220 SYMBOL_VALUE_ADDRESS (sym
)};
13222 exceptions
->push_back (info
);
13226 if (BLOCK_FUNCTION (block
) != NULL
)
13228 block
= BLOCK_SUPERBLOCK (block
);
13232 /* Return true if NAME matches PREG or if PREG is NULL. */
13235 name_matches_regex (const char *name
, compiled_regex
*preg
)
13237 return (preg
== NULL
13238 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13241 /* Add all exceptions defined globally whose name name match
13242 a regular expression, excluding standard exceptions.
13244 The reason we exclude standard exceptions is that they need
13245 to be handled separately: Standard exceptions are defined inside
13246 a runtime unit which is normally not compiled with debugging info,
13247 and thus usually do not show up in our symbol search. However,
13248 if the unit was in fact built with debugging info, we need to
13249 exclude them because they would duplicate the entry we found
13250 during the special loop that specifically searches for those
13251 standard exceptions.
13253 If PREG is not NULL, then this regexp_t object is used to
13254 perform the symbol name matching. Otherwise, no name-based
13255 filtering is performed.
13257 EXCEPTIONS is a vector of exceptions to which matching exceptions
13261 ada_add_global_exceptions (compiled_regex
*preg
,
13262 std::vector
<ada_exc_info
> *exceptions
)
13264 /* In Ada, the symbol "search name" is a linkage name, whereas the
13265 regular expression used to do the matching refers to the natural
13266 name. So match against the decoded name. */
13267 expand_symtabs_matching (NULL
,
13268 lookup_name_info::match_any (),
13269 [&] (const char *search_name
)
13271 std::string decoded
= ada_decode (search_name
);
13272 return name_matches_regex (decoded
.c_str (), preg
);
13277 for (objfile
*objfile
: current_program_space
->objfiles ())
13279 for (compunit_symtab
*s
: objfile
->compunits ())
13281 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13284 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13286 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13287 struct block_iterator iter
;
13288 struct symbol
*sym
;
13290 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13291 if (ada_is_non_standard_exception_sym (sym
)
13292 && name_matches_regex (sym
->natural_name (), preg
))
13294 struct ada_exc_info info
13295 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13297 exceptions
->push_back (info
);
13304 /* Implements ada_exceptions_list with the regular expression passed
13305 as a regex_t, rather than a string.
13307 If not NULL, PREG is used to filter out exceptions whose names
13308 do not match. Otherwise, all exceptions are listed. */
13310 static std::vector
<ada_exc_info
>
13311 ada_exceptions_list_1 (compiled_regex
*preg
)
13313 std::vector
<ada_exc_info
> result
;
13316 /* First, list the known standard exceptions. These exceptions
13317 need to be handled separately, as they are usually defined in
13318 runtime units that have been compiled without debugging info. */
13320 ada_add_standard_exceptions (preg
, &result
);
13322 /* Next, find all exceptions whose scope is local and accessible
13323 from the currently selected frame. */
13325 if (has_stack_frames ())
13327 prev_len
= result
.size ();
13328 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13330 if (result
.size () > prev_len
)
13331 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13334 /* Add all exceptions whose scope is global. */
13336 prev_len
= result
.size ();
13337 ada_add_global_exceptions (preg
, &result
);
13338 if (result
.size () > prev_len
)
13339 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13344 /* Return a vector of ada_exc_info.
13346 If REGEXP is NULL, all exceptions are included in the result.
13347 Otherwise, it should contain a valid regular expression,
13348 and only the exceptions whose names match that regular expression
13349 are included in the result.
13351 The exceptions are sorted in the following order:
13352 - Standard exceptions (defined by the Ada language), in
13353 alphabetical order;
13354 - Exceptions only visible from the current frame, in
13355 alphabetical order;
13356 - Exceptions whose scope is global, in alphabetical order. */
13358 std::vector
<ada_exc_info
>
13359 ada_exceptions_list (const char *regexp
)
13361 if (regexp
== NULL
)
13362 return ada_exceptions_list_1 (NULL
);
13364 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13365 return ada_exceptions_list_1 (®
);
13368 /* Implement the "info exceptions" command. */
13371 info_exceptions_command (const char *regexp
, int from_tty
)
13373 struct gdbarch
*gdbarch
= get_current_arch ();
13375 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13377 if (regexp
!= NULL
)
13379 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13381 printf_filtered (_("All defined Ada exceptions:\n"));
13383 for (const ada_exc_info
&info
: exceptions
)
13384 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13388 /* Information about operators given special treatment in functions
13390 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13392 #define ADA_OPERATORS \
13393 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13394 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13395 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13396 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13397 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13398 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13399 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13400 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13401 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13402 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13403 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13404 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13405 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13406 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13407 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13408 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13409 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13410 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13411 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13414 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13417 switch (exp
->elts
[pc
- 1].opcode
)
13420 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13423 #define OP_DEFN(op, len, args, binop) \
13424 case op: *oplenp = len; *argsp = args; break;
13430 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13435 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13440 /* Implementation of the exp_descriptor method operator_check. */
13443 ada_operator_check (struct expression
*exp
, int pos
,
13444 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13447 const union exp_element
*const elts
= exp
->elts
;
13448 struct type
*type
= NULL
;
13450 switch (elts
[pos
].opcode
)
13452 case UNOP_IN_RANGE
:
13454 type
= elts
[pos
+ 1].type
;
13458 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13461 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13463 if (type
&& TYPE_OBJFILE (type
)
13464 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13470 static const char *
13471 ada_op_name (enum exp_opcode opcode
)
13476 return op_name_standard (opcode
);
13478 #define OP_DEFN(op, len, args, binop) case op: return #op;
13483 return "OP_AGGREGATE";
13485 return "OP_CHOICES";
13491 /* As for operator_length, but assumes PC is pointing at the first
13492 element of the operator, and gives meaningful results only for the
13493 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13496 ada_forward_operator_length (struct expression
*exp
, int pc
,
13497 int *oplenp
, int *argsp
)
13499 switch (exp
->elts
[pc
].opcode
)
13502 *oplenp
= *argsp
= 0;
13505 #define OP_DEFN(op, len, args, binop) \
13506 case op: *oplenp = len; *argsp = args; break;
13512 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13517 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13523 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13525 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13533 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13535 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13540 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13544 /* Ada attributes ('Foo). */
13547 case OP_ATR_LENGTH
:
13551 case OP_ATR_MODULUS
:
13558 case UNOP_IN_RANGE
:
13560 /* XXX: gdb_sprint_host_address, type_sprint */
13561 fprintf_filtered (stream
, _("Type @"));
13562 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13563 fprintf_filtered (stream
, " (");
13564 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13565 fprintf_filtered (stream
, ")");
13567 case BINOP_IN_BOUNDS
:
13568 fprintf_filtered (stream
, " (%d)",
13569 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13571 case TERNOP_IN_RANGE
:
13576 case OP_DISCRETE_RANGE
:
13577 case OP_POSITIONAL
:
13584 char *name
= &exp
->elts
[elt
+ 2].string
;
13585 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13587 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13592 return dump_subexp_body_standard (exp
, stream
, elt
);
13596 for (i
= 0; i
< nargs
; i
+= 1)
13597 elt
= dump_subexp (exp
, stream
, elt
);
13602 /* The Ada extension of print_subexp (q.v.). */
13605 ada_print_subexp (struct expression
*exp
, int *pos
,
13606 struct ui_file
*stream
, enum precedence prec
)
13608 int oplen
, nargs
, i
;
13610 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13612 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13619 print_subexp_standard (exp
, pos
, stream
, prec
);
13623 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13626 case BINOP_IN_BOUNDS
:
13627 /* XXX: sprint_subexp */
13628 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13629 fputs_filtered (" in ", stream
);
13630 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13631 fputs_filtered ("'range", stream
);
13632 if (exp
->elts
[pc
+ 1].longconst
> 1)
13633 fprintf_filtered (stream
, "(%ld)",
13634 (long) exp
->elts
[pc
+ 1].longconst
);
13637 case TERNOP_IN_RANGE
:
13638 if (prec
>= PREC_EQUAL
)
13639 fputs_filtered ("(", stream
);
13640 /* XXX: sprint_subexp */
13641 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13642 fputs_filtered (" in ", stream
);
13643 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13644 fputs_filtered (" .. ", stream
);
13645 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13646 if (prec
>= PREC_EQUAL
)
13647 fputs_filtered (")", stream
);
13652 case OP_ATR_LENGTH
:
13656 case OP_ATR_MODULUS
:
13661 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13663 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13664 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13665 &type_print_raw_options
);
13669 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13670 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13675 for (tem
= 1; tem
< nargs
; tem
+= 1)
13677 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13678 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13680 fputs_filtered (")", stream
);
13685 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13686 fputs_filtered ("'(", stream
);
13687 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13688 fputs_filtered (")", stream
);
13691 case UNOP_IN_RANGE
:
13692 /* XXX: sprint_subexp */
13693 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13694 fputs_filtered (" in ", stream
);
13695 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13696 &type_print_raw_options
);
13699 case OP_DISCRETE_RANGE
:
13700 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13701 fputs_filtered ("..", stream
);
13702 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13706 fputs_filtered ("others => ", stream
);
13707 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13711 for (i
= 0; i
< nargs
-1; i
+= 1)
13714 fputs_filtered ("|", stream
);
13715 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13717 fputs_filtered (" => ", stream
);
13718 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13721 case OP_POSITIONAL
:
13722 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13726 fputs_filtered ("(", stream
);
13727 for (i
= 0; i
< nargs
; i
+= 1)
13730 fputs_filtered (", ", stream
);
13731 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13733 fputs_filtered (")", stream
);
13738 /* Table mapping opcodes into strings for printing operators
13739 and precedences of the operators. */
13741 static const struct op_print ada_op_print_tab
[] = {
13742 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13743 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13744 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13745 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13746 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13747 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13748 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13749 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13750 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13751 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13752 {">", BINOP_GTR
, PREC_ORDER
, 0},
13753 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13754 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13755 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13756 {"+", BINOP_ADD
, PREC_ADD
, 0},
13757 {"-", BINOP_SUB
, PREC_ADD
, 0},
13758 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13759 {"*", BINOP_MUL
, PREC_MUL
, 0},
13760 {"/", BINOP_DIV
, PREC_MUL
, 0},
13761 {"rem", BINOP_REM
, PREC_MUL
, 0},
13762 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13763 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13764 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13765 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13766 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13767 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13768 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13769 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13770 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13771 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13772 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13773 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13776 enum ada_primitive_types
{
13777 ada_primitive_type_int
,
13778 ada_primitive_type_long
,
13779 ada_primitive_type_short
,
13780 ada_primitive_type_char
,
13781 ada_primitive_type_float
,
13782 ada_primitive_type_double
,
13783 ada_primitive_type_void
,
13784 ada_primitive_type_long_long
,
13785 ada_primitive_type_long_double
,
13786 ada_primitive_type_natural
,
13787 ada_primitive_type_positive
,
13788 ada_primitive_type_system_address
,
13789 ada_primitive_type_storage_offset
,
13790 nr_ada_primitive_types
13794 ada_language_arch_info (struct gdbarch
*gdbarch
,
13795 struct language_arch_info
*lai
)
13797 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13799 lai
->primitive_type_vector
13800 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13803 lai
->primitive_type_vector
[ada_primitive_type_int
]
13804 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13806 lai
->primitive_type_vector
[ada_primitive_type_long
]
13807 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13808 0, "long_integer");
13809 lai
->primitive_type_vector
[ada_primitive_type_short
]
13810 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13811 0, "short_integer");
13812 lai
->string_char_type
13813 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13814 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13815 lai
->primitive_type_vector
[ada_primitive_type_float
]
13816 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13817 "float", gdbarch_float_format (gdbarch
));
13818 lai
->primitive_type_vector
[ada_primitive_type_double
]
13819 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13820 "long_float", gdbarch_double_format (gdbarch
));
13821 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13822 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13823 0, "long_long_integer");
13824 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13825 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13826 "long_long_float", gdbarch_long_double_format (gdbarch
));
13827 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13828 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13830 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13831 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13833 lai
->primitive_type_vector
[ada_primitive_type_void
]
13834 = builtin
->builtin_void
;
13836 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13837 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13839 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13840 ->set_name ("system__address");
13842 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13843 type. This is a signed integral type whose size is the same as
13844 the size of addresses. */
13846 unsigned int addr_length
= TYPE_LENGTH
13847 (lai
->primitive_type_vector
[ada_primitive_type_system_address
]);
13849 lai
->primitive_type_vector
[ada_primitive_type_storage_offset
]
13850 = arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13854 lai
->bool_type_symbol
= NULL
;
13855 lai
->bool_type_default
= builtin
->builtin_bool
;
13858 /* Language vector */
13860 /* Not really used, but needed in the ada_language_defn. */
13863 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13865 ada_emit_char (c
, type
, stream
, quoter
, 1);
13869 parse (struct parser_state
*ps
)
13871 warnings_issued
= 0;
13872 return ada_parse (ps
);
13875 static const struct exp_descriptor ada_exp_descriptor
= {
13877 ada_operator_length
,
13878 ada_operator_check
,
13880 ada_dump_subexp_body
,
13881 ada_evaluate_subexp
13884 /* symbol_name_matcher_ftype adapter for wild_match. */
13887 do_wild_match (const char *symbol_search_name
,
13888 const lookup_name_info
&lookup_name
,
13889 completion_match_result
*comp_match_res
)
13891 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13894 /* symbol_name_matcher_ftype adapter for full_match. */
13897 do_full_match (const char *symbol_search_name
,
13898 const lookup_name_info
&lookup_name
,
13899 completion_match_result
*comp_match_res
)
13901 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13904 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13907 do_exact_match (const char *symbol_search_name
,
13908 const lookup_name_info
&lookup_name
,
13909 completion_match_result
*comp_match_res
)
13911 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13914 /* Build the Ada lookup name for LOOKUP_NAME. */
13916 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13918 gdb::string_view user_name
= lookup_name
.name ();
13920 if (user_name
[0] == '<')
13922 if (user_name
.back () == '>')
13924 = user_name
.substr (1, user_name
.size () - 2).to_string ();
13927 = user_name
.substr (1, user_name
.size () - 1).to_string ();
13928 m_encoded_p
= true;
13929 m_verbatim_p
= true;
13930 m_wild_match_p
= false;
13931 m_standard_p
= false;
13935 m_verbatim_p
= false;
13937 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13941 const char *folded
= ada_fold_name (user_name
);
13942 const char *encoded
= ada_encode_1 (folded
, false);
13943 if (encoded
!= NULL
)
13944 m_encoded_name
= encoded
;
13946 m_encoded_name
= user_name
.to_string ();
13949 m_encoded_name
= user_name
.to_string ();
13951 /* Handle the 'package Standard' special case. See description
13952 of m_standard_p. */
13953 if (startswith (m_encoded_name
.c_str (), "standard__"))
13955 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13956 m_standard_p
= true;
13959 m_standard_p
= false;
13961 /* If the name contains a ".", then the user is entering a fully
13962 qualified entity name, and the match must not be done in wild
13963 mode. Similarly, if the user wants to complete what looks
13964 like an encoded name, the match must not be done in wild
13965 mode. Also, in the standard__ special case always do
13966 non-wild matching. */
13968 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13971 && user_name
.find ('.') == std::string::npos
);
13975 /* symbol_name_matcher_ftype method for Ada. This only handles
13976 completion mode. */
13979 ada_symbol_name_matches (const char *symbol_search_name
,
13980 const lookup_name_info
&lookup_name
,
13981 completion_match_result
*comp_match_res
)
13983 return lookup_name
.ada ().matches (symbol_search_name
,
13984 lookup_name
.match_type (),
13988 /* A name matcher that matches the symbol name exactly, with
13992 literal_symbol_name_matcher (const char *symbol_search_name
,
13993 const lookup_name_info
&lookup_name
,
13994 completion_match_result
*comp_match_res
)
13996 gdb::string_view name_view
= lookup_name
.name ();
13998 if (lookup_name
.completion_mode ()
13999 ? (strncmp (symbol_search_name
, name_view
.data (),
14000 name_view
.size ()) == 0)
14001 : symbol_search_name
== name_view
)
14003 if (comp_match_res
!= NULL
)
14004 comp_match_res
->set_match (symbol_search_name
);
14011 /* Implement the "la_get_symbol_name_matcher" language_defn method for
14014 static symbol_name_matcher_ftype
*
14015 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
14017 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
14018 return literal_symbol_name_matcher
;
14020 if (lookup_name
.completion_mode ())
14021 return ada_symbol_name_matches
;
14024 if (lookup_name
.ada ().wild_match_p ())
14025 return do_wild_match
;
14026 else if (lookup_name
.ada ().verbatim_p ())
14027 return do_exact_match
;
14029 return do_full_match
;
14033 /* Implement the "la_read_var_value" language_defn method for Ada. */
14035 static struct value
*
14036 ada_read_var_value (struct symbol
*var
, const struct block
*var_block
,
14037 struct frame_info
*frame
)
14039 /* The only case where default_read_var_value is not sufficient
14040 is when VAR is a renaming... */
14041 if (frame
!= nullptr)
14043 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
14044 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
14045 return ada_read_renaming_var_value (var
, frame_block
);
14048 /* This is a typical case where we expect the default_read_var_value
14049 function to work. */
14050 return default_read_var_value (var
, var_block
, frame
);
14053 static const char *ada_extensions
[] =
14055 ".adb", ".ads", ".a", ".ada", ".dg", NULL
14058 extern const struct language_defn ada_language_defn
= {
14059 "ada", /* Language name */
14063 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
14064 that's not quite what this means. */
14066 macro_expansion_no
,
14068 &ada_exp_descriptor
,
14071 ada_printchar
, /* Print a character constant */
14072 ada_printstr
, /* Function to print string constant */
14073 emit_char
, /* Function to print single char (not used) */
14074 ada_print_type
, /* Print a type using appropriate syntax */
14075 ada_print_typedef
, /* Print a typedef using appropriate syntax */
14076 ada_value_print_inner
, /* la_value_print_inner */
14077 ada_value_print
, /* Print a top-level value */
14078 ada_read_var_value
, /* la_read_var_value */
14079 NULL
, /* Language specific skip_trampoline */
14080 NULL
, /* name_of_this */
14081 true, /* la_store_sym_names_in_linkage_form_p */
14082 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
14083 basic_lookup_transparent_type
, /* lookup_transparent_type */
14084 ada_la_decode
, /* Language specific symbol demangler */
14085 ada_sniff_from_mangled_name
,
14086 NULL
, /* Language specific
14087 class_name_from_physname */
14088 ada_op_print_tab
, /* expression operators for printing */
14089 0, /* c-style arrays */
14090 1, /* String lower bound */
14091 ada_get_gdb_completer_word_break_characters
,
14092 ada_collect_symbol_completion_matches
,
14093 ada_language_arch_info
,
14094 ada_print_array_index
,
14095 default_pass_by_reference
,
14096 ada_watch_location_expression
,
14097 ada_get_symbol_name_matcher
, /* la_get_symbol_name_matcher */
14098 ada_iterate_over_symbols
,
14099 default_search_name_hash
,
14103 ada_is_string_type
,
14104 "(...)" /* la_struct_too_deep_ellipsis */
14107 /* Command-list for the "set/show ada" prefix command. */
14108 static struct cmd_list_element
*set_ada_list
;
14109 static struct cmd_list_element
*show_ada_list
;
14112 initialize_ada_catchpoint_ops (void)
14114 struct breakpoint_ops
*ops
;
14116 initialize_breakpoint_ops ();
14118 ops
= &catch_exception_breakpoint_ops
;
14119 *ops
= bkpt_breakpoint_ops
;
14120 ops
->allocate_location
= allocate_location_exception
;
14121 ops
->re_set
= re_set_exception
;
14122 ops
->check_status
= check_status_exception
;
14123 ops
->print_it
= print_it_exception
;
14124 ops
->print_one
= print_one_exception
;
14125 ops
->print_mention
= print_mention_exception
;
14126 ops
->print_recreate
= print_recreate_exception
;
14128 ops
= &catch_exception_unhandled_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_assert_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_handlers_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
;
14159 /* This module's 'new_objfile' observer. */
14162 ada_new_objfile_observer (struct objfile
*objfile
)
14164 ada_clear_symbol_cache ();
14167 /* This module's 'free_objfile' observer. */
14170 ada_free_objfile_observer (struct objfile
*objfile
)
14172 ada_clear_symbol_cache ();
14175 void _initialize_ada_language ();
14177 _initialize_ada_language ()
14179 initialize_ada_catchpoint_ops ();
14181 add_basic_prefix_cmd ("ada", no_class
,
14182 _("Prefix command for changing Ada-specific settings."),
14183 &set_ada_list
, "set ada ", 0, &setlist
);
14185 add_show_prefix_cmd ("ada", no_class
,
14186 _("Generic command for showing Ada-specific settings."),
14187 &show_ada_list
, "show ada ", 0, &showlist
);
14189 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14190 &trust_pad_over_xvs
, _("\
14191 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14192 Show whether an optimization trusting PAD types over XVS types is activated."),
14194 This is related to the encoding used by the GNAT compiler. The debugger\n\
14195 should normally trust the contents of PAD types, but certain older versions\n\
14196 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14197 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14198 work around this bug. It is always safe to turn this option \"off\", but\n\
14199 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14200 this option to \"off\" unless necessary."),
14201 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14203 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14204 &print_signatures
, _("\
14205 Enable or disable the output of formal and return types for functions in the \
14206 overloads selection menu."), _("\
14207 Show whether the output of formal and return types for functions in the \
14208 overloads selection menu is activated."),
14209 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14211 add_catch_command ("exception", _("\
14212 Catch Ada exceptions, when raised.\n\
14213 Usage: catch exception [ARG] [if CONDITION]\n\
14214 Without any argument, stop when any Ada exception is raised.\n\
14215 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14216 being raised does not have a handler (and will therefore lead to the task's\n\
14218 Otherwise, the catchpoint only stops when the name of the exception being\n\
14219 raised is the same as ARG.\n\
14220 CONDITION is a boolean expression that is evaluated to see whether the\n\
14221 exception should cause a stop."),
14222 catch_ada_exception_command
,
14223 catch_ada_completer
,
14227 add_catch_command ("handlers", _("\
14228 Catch Ada exceptions, when handled.\n\
14229 Usage: catch handlers [ARG] [if CONDITION]\n\
14230 Without any argument, stop when any Ada exception is handled.\n\
14231 With an argument, catch only exceptions with the given name.\n\
14232 CONDITION is a boolean expression that is evaluated to see whether the\n\
14233 exception should cause a stop."),
14234 catch_ada_handlers_command
,
14235 catch_ada_completer
,
14238 add_catch_command ("assert", _("\
14239 Catch failed Ada assertions, when raised.\n\
14240 Usage: catch assert [if CONDITION]\n\
14241 CONDITION is a boolean expression that is evaluated to see whether the\n\
14242 exception should cause a stop."),
14243 catch_assert_command
,
14248 varsize_limit
= 65536;
14249 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14250 &varsize_limit
, _("\
14251 Set the maximum number of bytes allowed in a variable-size object."), _("\
14252 Show the maximum number of bytes allowed in a variable-size object."), _("\
14253 Attempts to access an object whose size is not a compile-time constant\n\
14254 and exceeds this limit will cause an error."),
14255 NULL
, NULL
, &setlist
, &showlist
);
14257 add_info ("exceptions", info_exceptions_command
,
14259 List all Ada exception names.\n\
14260 Usage: info exceptions [REGEXP]\n\
14261 If a regular expression is passed as an argument, only those matching\n\
14262 the regular expression are listed."));
14264 add_basic_prefix_cmd ("ada", class_maintenance
,
14265 _("Set Ada maintenance-related variables."),
14266 &maint_set_ada_cmdlist
, "maintenance set ada ",
14267 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14269 add_show_prefix_cmd ("ada", class_maintenance
,
14270 _("Show Ada maintenance-related variables."),
14271 &maint_show_ada_cmdlist
, "maintenance show ada ",
14272 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14274 add_setshow_boolean_cmd
14275 ("ignore-descriptive-types", class_maintenance
,
14276 &ada_ignore_descriptive_types_p
,
14277 _("Set whether descriptive types generated by GNAT should be ignored."),
14278 _("Show whether descriptive types generated by GNAT should be ignored."),
14280 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14281 DWARF attribute."),
14282 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14284 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14285 NULL
, xcalloc
, xfree
);
14287 /* The ada-lang observers. */
14288 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14289 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14290 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);