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
< TYPE_NFIELDS (struct_type
); 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_NFIELDS (type
) - 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 (TYPE_NFIELDS (index_desc_type
) > 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
< TYPE_NFIELDS (index_desc_type
); 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 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1491 static const char *bound_name
[] = {
1492 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1493 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1496 /* Maximum number of array dimensions we are prepared to handle. */
1498 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1501 /* The desc_* routines return primitive portions of array descriptors
1504 /* The descriptor or array type, if any, indicated by TYPE; removes
1505 level of indirection, if needed. */
1507 static struct type
*
1508 desc_base_type (struct type
*type
)
1512 type
= ada_check_typedef (type
);
1513 if (type
->code () == TYPE_CODE_TYPEDEF
)
1514 type
= ada_typedef_target_type (type
);
1517 && (type
->code () == TYPE_CODE_PTR
1518 || type
->code () == TYPE_CODE_REF
))
1519 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1524 /* True iff TYPE indicates a "thin" array pointer type. */
1527 is_thin_pntr (struct type
*type
)
1530 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1531 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1534 /* The descriptor type for thin pointer type TYPE. */
1536 static struct type
*
1537 thin_descriptor_type (struct type
*type
)
1539 struct type
*base_type
= desc_base_type (type
);
1541 if (base_type
== NULL
)
1543 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1547 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1549 if (alt_type
== NULL
)
1556 /* A pointer to the array data for thin-pointer value VAL. */
1558 static struct value
*
1559 thin_data_pntr (struct value
*val
)
1561 struct type
*type
= ada_check_typedef (value_type (val
));
1562 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1564 data_type
= lookup_pointer_type (data_type
);
1566 if (type
->code () == TYPE_CODE_PTR
)
1567 return value_cast (data_type
, value_copy (val
));
1569 return value_from_longest (data_type
, value_address (val
));
1572 /* True iff TYPE indicates a "thick" array pointer type. */
1575 is_thick_pntr (struct type
*type
)
1577 type
= desc_base_type (type
);
1578 return (type
!= NULL
&& type
->code () == TYPE_CODE_STRUCT
1579 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1582 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1583 pointer to one, the type of its bounds data; otherwise, NULL. */
1585 static struct type
*
1586 desc_bounds_type (struct type
*type
)
1590 type
= desc_base_type (type
);
1594 else if (is_thin_pntr (type
))
1596 type
= thin_descriptor_type (type
);
1599 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1601 return ada_check_typedef (r
);
1603 else if (type
->code () == TYPE_CODE_STRUCT
)
1605 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1607 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1612 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1613 one, a pointer to its bounds data. Otherwise NULL. */
1615 static struct value
*
1616 desc_bounds (struct value
*arr
)
1618 struct type
*type
= ada_check_typedef (value_type (arr
));
1620 if (is_thin_pntr (type
))
1622 struct type
*bounds_type
=
1623 desc_bounds_type (thin_descriptor_type (type
));
1626 if (bounds_type
== NULL
)
1627 error (_("Bad GNAT array descriptor"));
1629 /* NOTE: The following calculation is not really kosher, but
1630 since desc_type is an XVE-encoded type (and shouldn't be),
1631 the correct calculation is a real pain. FIXME (and fix GCC). */
1632 if (type
->code () == TYPE_CODE_PTR
)
1633 addr
= value_as_long (arr
);
1635 addr
= value_address (arr
);
1638 value_from_longest (lookup_pointer_type (bounds_type
),
1639 addr
- TYPE_LENGTH (bounds_type
));
1642 else if (is_thick_pntr (type
))
1644 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1645 _("Bad GNAT array descriptor"));
1646 struct type
*p_bounds_type
= value_type (p_bounds
);
1649 && p_bounds_type
->code () == TYPE_CODE_PTR
)
1651 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1653 if (TYPE_STUB (target_type
))
1654 p_bounds
= value_cast (lookup_pointer_type
1655 (ada_check_typedef (target_type
)),
1659 error (_("Bad GNAT array descriptor"));
1667 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1668 position of the field containing the address of the bounds data. */
1671 fat_pntr_bounds_bitpos (struct type
*type
)
1673 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1676 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1677 size of the field containing the address of the bounds data. */
1680 fat_pntr_bounds_bitsize (struct type
*type
)
1682 type
= desc_base_type (type
);
1684 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1685 return TYPE_FIELD_BITSIZE (type
, 1);
1687 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1690 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1691 pointer to one, the type of its array data (a array-with-no-bounds type);
1692 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1695 static struct type
*
1696 desc_data_target_type (struct type
*type
)
1698 type
= desc_base_type (type
);
1700 /* NOTE: The following is bogus; see comment in desc_bounds. */
1701 if (is_thin_pntr (type
))
1702 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1703 else if (is_thick_pntr (type
))
1705 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1708 && ada_check_typedef (data_type
)->code () == TYPE_CODE_PTR
)
1709 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1715 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1718 static struct value
*
1719 desc_data (struct value
*arr
)
1721 struct type
*type
= value_type (arr
);
1723 if (is_thin_pntr (type
))
1724 return thin_data_pntr (arr
);
1725 else if (is_thick_pntr (type
))
1726 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1727 _("Bad GNAT array descriptor"));
1733 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1734 position of the field containing the address of the data. */
1737 fat_pntr_data_bitpos (struct type
*type
)
1739 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1742 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1743 size of the field containing the address of the data. */
1746 fat_pntr_data_bitsize (struct type
*type
)
1748 type
= desc_base_type (type
);
1750 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1751 return TYPE_FIELD_BITSIZE (type
, 0);
1753 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1756 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1757 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1758 bound, if WHICH is 1. The first bound is I=1. */
1760 static struct value
*
1761 desc_one_bound (struct value
*bounds
, int i
, int which
)
1763 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1764 _("Bad GNAT array descriptor bounds"));
1767 /* If BOUNDS is an array-bounds structure type, return the bit position
1768 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1769 bound, if WHICH is 1. The first bound is I=1. */
1772 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1774 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1777 /* If BOUNDS is an array-bounds structure type, return the bit field size
1778 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1779 bound, if WHICH is 1. The first bound is I=1. */
1782 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1784 type
= desc_base_type (type
);
1786 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1787 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1789 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1792 /* If TYPE is the type of an array-bounds structure, the type of its
1793 Ith bound (numbering from 1). Otherwise, NULL. */
1795 static struct type
*
1796 desc_index_type (struct type
*type
, int i
)
1798 type
= desc_base_type (type
);
1800 if (type
->code () == TYPE_CODE_STRUCT
)
1801 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1806 /* The number of index positions in the array-bounds type TYPE.
1807 Return 0 if TYPE is NULL. */
1810 desc_arity (struct type
*type
)
1812 type
= desc_base_type (type
);
1815 return TYPE_NFIELDS (type
) / 2;
1819 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1820 an array descriptor type (representing an unconstrained array
1824 ada_is_direct_array_type (struct type
*type
)
1828 type
= ada_check_typedef (type
);
1829 return (type
->code () == TYPE_CODE_ARRAY
1830 || ada_is_array_descriptor_type (type
));
1833 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1837 ada_is_array_type (struct type
*type
)
1840 && (type
->code () == TYPE_CODE_PTR
1841 || type
->code () == TYPE_CODE_REF
))
1842 type
= TYPE_TARGET_TYPE (type
);
1843 return ada_is_direct_array_type (type
);
1846 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1849 ada_is_simple_array_type (struct type
*type
)
1853 type
= ada_check_typedef (type
);
1854 return (type
->code () == TYPE_CODE_ARRAY
1855 || (type
->code () == TYPE_CODE_PTR
1856 && (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ()
1857 == TYPE_CODE_ARRAY
)));
1860 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1863 ada_is_array_descriptor_type (struct type
*type
)
1865 struct type
*data_type
= desc_data_target_type (type
);
1869 type
= ada_check_typedef (type
);
1870 return (data_type
!= NULL
1871 && data_type
->code () == TYPE_CODE_ARRAY
1872 && desc_arity (desc_bounds_type (type
)) > 0);
1875 /* Non-zero iff type is a partially mal-formed GNAT array
1876 descriptor. FIXME: This is to compensate for some problems with
1877 debugging output from GNAT. Re-examine periodically to see if it
1881 ada_is_bogus_array_descriptor (struct type
*type
)
1885 && type
->code () == TYPE_CODE_STRUCT
1886 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1887 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1888 && !ada_is_array_descriptor_type (type
);
1892 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1893 (fat pointer) returns the type of the array data described---specifically,
1894 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1895 in from the descriptor; otherwise, they are left unspecified. If
1896 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1897 returns NULL. The result is simply the type of ARR if ARR is not
1900 static struct type
*
1901 ada_type_of_array (struct value
*arr
, int bounds
)
1903 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1904 return decode_constrained_packed_array_type (value_type (arr
));
1906 if (!ada_is_array_descriptor_type (value_type (arr
)))
1907 return value_type (arr
);
1911 struct type
*array_type
=
1912 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1914 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1915 TYPE_FIELD_BITSIZE (array_type
, 0) =
1916 decode_packed_array_bitsize (value_type (arr
));
1922 struct type
*elt_type
;
1924 struct value
*descriptor
;
1926 elt_type
= ada_array_element_type (value_type (arr
), -1);
1927 arity
= ada_array_arity (value_type (arr
));
1929 if (elt_type
== NULL
|| arity
== 0)
1930 return ada_check_typedef (value_type (arr
));
1932 descriptor
= desc_bounds (arr
);
1933 if (value_as_long (descriptor
) == 0)
1937 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1938 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1939 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1940 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1943 create_static_range_type (range_type
, value_type (low
),
1944 longest_to_int (value_as_long (low
)),
1945 longest_to_int (value_as_long (high
)));
1946 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1948 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1950 /* We need to store the element packed bitsize, as well as
1951 recompute the array size, because it was previously
1952 computed based on the unpacked element size. */
1953 LONGEST lo
= value_as_long (low
);
1954 LONGEST hi
= value_as_long (high
);
1956 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1957 decode_packed_array_bitsize (value_type (arr
));
1958 /* If the array has no element, then the size is already
1959 zero, and does not need to be recomputed. */
1963 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1965 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1970 return lookup_pointer_type (elt_type
);
1974 /* If ARR does not represent an array, returns ARR unchanged.
1975 Otherwise, returns either a standard GDB array with bounds set
1976 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1977 GDB array. Returns NULL if ARR is a null fat pointer. */
1980 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1982 if (ada_is_array_descriptor_type (value_type (arr
)))
1984 struct type
*arrType
= ada_type_of_array (arr
, 1);
1986 if (arrType
== NULL
)
1988 return value_cast (arrType
, value_copy (desc_data (arr
)));
1990 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1991 return decode_constrained_packed_array (arr
);
1996 /* If ARR does not represent an array, returns ARR unchanged.
1997 Otherwise, returns a standard GDB array describing ARR (which may
1998 be ARR itself if it already is in the proper form). */
2001 ada_coerce_to_simple_array (struct value
*arr
)
2003 if (ada_is_array_descriptor_type (value_type (arr
)))
2005 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2008 error (_("Bounds unavailable for null array pointer."));
2009 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
2010 return value_ind (arrVal
);
2012 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2013 return decode_constrained_packed_array (arr
);
2018 /* If TYPE represents a GNAT array type, return it translated to an
2019 ordinary GDB array type (possibly with BITSIZE fields indicating
2020 packing). For other types, is the identity. */
2023 ada_coerce_to_simple_array_type (struct type
*type
)
2025 if (ada_is_constrained_packed_array_type (type
))
2026 return decode_constrained_packed_array_type (type
);
2028 if (ada_is_array_descriptor_type (type
))
2029 return ada_check_typedef (desc_data_target_type (type
));
2034 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2037 ada_is_packed_array_type (struct type
*type
)
2041 type
= desc_base_type (type
);
2042 type
= ada_check_typedef (type
);
2044 ada_type_name (type
) != NULL
2045 && strstr (ada_type_name (type
), "___XP") != NULL
;
2048 /* Non-zero iff TYPE represents a standard GNAT constrained
2049 packed-array type. */
2052 ada_is_constrained_packed_array_type (struct type
*type
)
2054 return ada_is_packed_array_type (type
)
2055 && !ada_is_array_descriptor_type (type
);
2058 /* Non-zero iff TYPE represents an array descriptor for a
2059 unconstrained packed-array type. */
2062 ada_is_unconstrained_packed_array_type (struct type
*type
)
2064 return ada_is_packed_array_type (type
)
2065 && ada_is_array_descriptor_type (type
);
2068 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2069 return the size of its elements in bits. */
2072 decode_packed_array_bitsize (struct type
*type
)
2074 const char *raw_name
;
2078 /* Access to arrays implemented as fat pointers are encoded as a typedef
2079 of the fat pointer type. We need the name of the fat pointer type
2080 to do the decoding, so strip the typedef layer. */
2081 if (type
->code () == TYPE_CODE_TYPEDEF
)
2082 type
= ada_typedef_target_type (type
);
2084 raw_name
= ada_type_name (ada_check_typedef (type
));
2086 raw_name
= ada_type_name (desc_base_type (type
));
2091 tail
= strstr (raw_name
, "___XP");
2092 gdb_assert (tail
!= NULL
);
2094 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2097 (_("could not understand bit size information on packed array"));
2104 /* Given that TYPE is a standard GDB array type with all bounds filled
2105 in, and that the element size of its ultimate scalar constituents
2106 (that is, either its elements, or, if it is an array of arrays, its
2107 elements' elements, etc.) is *ELT_BITS, return an identical type,
2108 but with the bit sizes of its elements (and those of any
2109 constituent arrays) recorded in the BITSIZE components of its
2110 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2113 Note that, for arrays whose index type has an XA encoding where
2114 a bound references a record discriminant, getting that discriminant,
2115 and therefore the actual value of that bound, is not possible
2116 because none of the given parameters gives us access to the record.
2117 This function assumes that it is OK in the context where it is being
2118 used to return an array whose bounds are still dynamic and where
2119 the length is arbitrary. */
2121 static struct type
*
2122 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2124 struct type
*new_elt_type
;
2125 struct type
*new_type
;
2126 struct type
*index_type_desc
;
2127 struct type
*index_type
;
2128 LONGEST low_bound
, high_bound
;
2130 type
= ada_check_typedef (type
);
2131 if (type
->code () != TYPE_CODE_ARRAY
)
2134 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2135 if (index_type_desc
)
2136 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2139 index_type
= TYPE_INDEX_TYPE (type
);
2141 new_type
= alloc_type_copy (type
);
2143 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2145 create_array_type (new_type
, new_elt_type
, index_type
);
2146 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2147 new_type
->set_name (ada_type_name (type
));
2149 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2150 && is_dynamic_type (check_typedef (index_type
)))
2151 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2152 low_bound
= high_bound
= 0;
2153 if (high_bound
< low_bound
)
2154 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2157 *elt_bits
*= (high_bound
- low_bound
+ 1);
2158 TYPE_LENGTH (new_type
) =
2159 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2162 TYPE_FIXED_INSTANCE (new_type
) = 1;
2166 /* The array type encoded by TYPE, where
2167 ada_is_constrained_packed_array_type (TYPE). */
2169 static struct type
*
2170 decode_constrained_packed_array_type (struct type
*type
)
2172 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2175 struct type
*shadow_type
;
2179 raw_name
= ada_type_name (desc_base_type (type
));
2184 name
= (char *) alloca (strlen (raw_name
) + 1);
2185 tail
= strstr (raw_name
, "___XP");
2186 type
= desc_base_type (type
);
2188 memcpy (name
, raw_name
, tail
- raw_name
);
2189 name
[tail
- raw_name
] = '\000';
2191 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2193 if (shadow_type
== NULL
)
2195 lim_warning (_("could not find bounds information on packed array"));
2198 shadow_type
= check_typedef (shadow_type
);
2200 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2202 lim_warning (_("could not understand bounds "
2203 "information on packed array"));
2207 bits
= decode_packed_array_bitsize (type
);
2208 return constrained_packed_array_type (shadow_type
, &bits
);
2211 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2212 array, returns a simple array that denotes that array. Its type is a
2213 standard GDB array type except that the BITSIZEs of the array
2214 target types are set to the number of bits in each element, and the
2215 type length is set appropriately. */
2217 static struct value
*
2218 decode_constrained_packed_array (struct value
*arr
)
2222 /* If our value is a pointer, then dereference it. Likewise if
2223 the value is a reference. Make sure that this operation does not
2224 cause the target type to be fixed, as this would indirectly cause
2225 this array to be decoded. The rest of the routine assumes that
2226 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2227 and "value_ind" routines to perform the dereferencing, as opposed
2228 to using "ada_coerce_ref" or "ada_value_ind". */
2229 arr
= coerce_ref (arr
);
2230 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2231 arr
= value_ind (arr
);
2233 type
= decode_constrained_packed_array_type (value_type (arr
));
2236 error (_("can't unpack array"));
2240 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2241 && ada_is_modular_type (value_type (arr
)))
2243 /* This is a (right-justified) modular type representing a packed
2244 array with no wrapper. In order to interpret the value through
2245 the (left-justified) packed array type we just built, we must
2246 first left-justify it. */
2247 int bit_size
, bit_pos
;
2250 mod
= ada_modulus (value_type (arr
)) - 1;
2257 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2258 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2259 bit_pos
/ HOST_CHAR_BIT
,
2260 bit_pos
% HOST_CHAR_BIT
,
2265 return coerce_unspec_val_to_type (arr
, type
);
2269 /* The value of the element of packed array ARR at the ARITY indices
2270 given in IND. ARR must be a simple array. */
2272 static struct value
*
2273 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2276 int bits
, elt_off
, bit_off
;
2277 long elt_total_bit_offset
;
2278 struct type
*elt_type
;
2282 elt_total_bit_offset
= 0;
2283 elt_type
= ada_check_typedef (value_type (arr
));
2284 for (i
= 0; i
< arity
; i
+= 1)
2286 if (elt_type
->code () != TYPE_CODE_ARRAY
2287 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2289 (_("attempt to do packed indexing of "
2290 "something other than a packed array"));
2293 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2294 LONGEST lowerbound
, upperbound
;
2297 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2299 lim_warning (_("don't know bounds of array"));
2300 lowerbound
= upperbound
= 0;
2303 idx
= pos_atr (ind
[i
]);
2304 if (idx
< lowerbound
|| idx
> upperbound
)
2305 lim_warning (_("packed array index %ld out of bounds"),
2307 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2308 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2309 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2312 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2313 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2315 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2320 /* Non-zero iff TYPE includes negative integer values. */
2323 has_negatives (struct type
*type
)
2325 switch (type
->code ())
2330 return !TYPE_UNSIGNED (type
);
2331 case TYPE_CODE_RANGE
:
2332 return TYPE_LOW_BOUND (type
) - TYPE_RANGE_DATA (type
)->bias
< 0;
2336 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2337 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2338 the unpacked buffer.
2340 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2341 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2343 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2346 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2348 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2351 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2352 gdb_byte
*unpacked
, int unpacked_len
,
2353 int is_big_endian
, int is_signed_type
,
2356 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2357 int src_idx
; /* Index into the source area */
2358 int src_bytes_left
; /* Number of source bytes left to process. */
2359 int srcBitsLeft
; /* Number of source bits left to move */
2360 int unusedLS
; /* Number of bits in next significant
2361 byte of source that are unused */
2363 int unpacked_idx
; /* Index into the unpacked buffer */
2364 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2366 unsigned long accum
; /* Staging area for bits being transferred */
2367 int accumSize
; /* Number of meaningful bits in accum */
2370 /* Transmit bytes from least to most significant; delta is the direction
2371 the indices move. */
2372 int delta
= is_big_endian
? -1 : 1;
2374 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2376 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2377 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2378 bit_size
, unpacked_len
);
2380 srcBitsLeft
= bit_size
;
2381 src_bytes_left
= src_len
;
2382 unpacked_bytes_left
= unpacked_len
;
2387 src_idx
= src_len
- 1;
2389 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2393 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2399 unpacked_idx
= unpacked_len
- 1;
2403 /* Non-scalar values must be aligned at a byte boundary... */
2405 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2406 /* ... And are placed at the beginning (most-significant) bytes
2408 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2409 unpacked_bytes_left
= unpacked_idx
+ 1;
2414 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2416 src_idx
= unpacked_idx
= 0;
2417 unusedLS
= bit_offset
;
2420 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2425 while (src_bytes_left
> 0)
2427 /* Mask for removing bits of the next source byte that are not
2428 part of the value. */
2429 unsigned int unusedMSMask
=
2430 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2432 /* Sign-extend bits for this byte. */
2433 unsigned int signMask
= sign
& ~unusedMSMask
;
2436 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2437 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2438 if (accumSize
>= HOST_CHAR_BIT
)
2440 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2441 accumSize
-= HOST_CHAR_BIT
;
2442 accum
>>= HOST_CHAR_BIT
;
2443 unpacked_bytes_left
-= 1;
2444 unpacked_idx
+= delta
;
2446 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2448 src_bytes_left
-= 1;
2451 while (unpacked_bytes_left
> 0)
2453 accum
|= sign
<< accumSize
;
2454 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2455 accumSize
-= HOST_CHAR_BIT
;
2458 accum
>>= HOST_CHAR_BIT
;
2459 unpacked_bytes_left
-= 1;
2460 unpacked_idx
+= delta
;
2464 /* Create a new value of type TYPE from the contents of OBJ starting
2465 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2466 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2467 assigning through the result will set the field fetched from.
2468 VALADDR is ignored unless OBJ is NULL, in which case,
2469 VALADDR+OFFSET must address the start of storage containing the
2470 packed value. The value returned in this case is never an lval.
2471 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2474 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2475 long offset
, int bit_offset
, int bit_size
,
2479 const gdb_byte
*src
; /* First byte containing data to unpack */
2481 const int is_scalar
= is_scalar_type (type
);
2482 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2483 gdb::byte_vector staging
;
2485 type
= ada_check_typedef (type
);
2488 src
= valaddr
+ offset
;
2490 src
= value_contents (obj
) + offset
;
2492 if (is_dynamic_type (type
))
2494 /* The length of TYPE might by dynamic, so we need to resolve
2495 TYPE in order to know its actual size, which we then use
2496 to create the contents buffer of the value we return.
2497 The difficulty is that the data containing our object is
2498 packed, and therefore maybe not at a byte boundary. So, what
2499 we do, is unpack the data into a byte-aligned buffer, and then
2500 use that buffer as our object's value for resolving the type. */
2501 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2502 staging
.resize (staging_len
);
2504 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2505 staging
.data (), staging
.size (),
2506 is_big_endian
, has_negatives (type
),
2508 type
= resolve_dynamic_type (type
, staging
, 0);
2509 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2511 /* This happens when the length of the object is dynamic,
2512 and is actually smaller than the space reserved for it.
2513 For instance, in an array of variant records, the bit_size
2514 we're given is the array stride, which is constant and
2515 normally equal to the maximum size of its element.
2516 But, in reality, each element only actually spans a portion
2518 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2524 v
= allocate_value (type
);
2525 src
= valaddr
+ offset
;
2527 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2529 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2532 v
= value_at (type
, value_address (obj
) + offset
);
2533 buf
= (gdb_byte
*) alloca (src_len
);
2534 read_memory (value_address (v
), buf
, src_len
);
2539 v
= allocate_value (type
);
2540 src
= value_contents (obj
) + offset
;
2545 long new_offset
= offset
;
2547 set_value_component_location (v
, obj
);
2548 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2549 set_value_bitsize (v
, bit_size
);
2550 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2553 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2555 set_value_offset (v
, new_offset
);
2557 /* Also set the parent value. This is needed when trying to
2558 assign a new value (in inferior memory). */
2559 set_value_parent (v
, obj
);
2562 set_value_bitsize (v
, bit_size
);
2563 unpacked
= value_contents_writeable (v
);
2567 memset (unpacked
, 0, TYPE_LENGTH (type
));
2571 if (staging
.size () == TYPE_LENGTH (type
))
2573 /* Small short-cut: If we've unpacked the data into a buffer
2574 of the same size as TYPE's length, then we can reuse that,
2575 instead of doing the unpacking again. */
2576 memcpy (unpacked
, staging
.data (), staging
.size ());
2579 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2580 unpacked
, TYPE_LENGTH (type
),
2581 is_big_endian
, has_negatives (type
), is_scalar
);
2586 /* Store the contents of FROMVAL into the location of TOVAL.
2587 Return a new value with the location of TOVAL and contents of
2588 FROMVAL. Handles assignment into packed fields that have
2589 floating-point or non-scalar types. */
2591 static struct value
*
2592 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2594 struct type
*type
= value_type (toval
);
2595 int bits
= value_bitsize (toval
);
2597 toval
= ada_coerce_ref (toval
);
2598 fromval
= ada_coerce_ref (fromval
);
2600 if (ada_is_direct_array_type (value_type (toval
)))
2601 toval
= ada_coerce_to_simple_array (toval
);
2602 if (ada_is_direct_array_type (value_type (fromval
)))
2603 fromval
= ada_coerce_to_simple_array (fromval
);
2605 if (!deprecated_value_modifiable (toval
))
2606 error (_("Left operand of assignment is not a modifiable lvalue."));
2608 if (VALUE_LVAL (toval
) == lval_memory
2610 && (type
->code () == TYPE_CODE_FLT
2611 || type
->code () == TYPE_CODE_STRUCT
))
2613 int len
= (value_bitpos (toval
)
2614 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2616 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2618 CORE_ADDR to_addr
= value_address (toval
);
2620 if (type
->code () == TYPE_CODE_FLT
)
2621 fromval
= value_cast (type
, fromval
);
2623 read_memory (to_addr
, buffer
, len
);
2624 from_size
= value_bitsize (fromval
);
2626 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2628 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2629 ULONGEST from_offset
= 0;
2630 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2631 from_offset
= from_size
- bits
;
2632 copy_bitwise (buffer
, value_bitpos (toval
),
2633 value_contents (fromval
), from_offset
,
2634 bits
, is_big_endian
);
2635 write_memory_with_notification (to_addr
, buffer
, len
);
2637 val
= value_copy (toval
);
2638 memcpy (value_contents_raw (val
), value_contents (fromval
),
2639 TYPE_LENGTH (type
));
2640 deprecated_set_value_type (val
, type
);
2645 return value_assign (toval
, fromval
);
2649 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2650 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2651 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2652 COMPONENT, and not the inferior's memory. The current contents
2653 of COMPONENT are ignored.
2655 Although not part of the initial design, this function also works
2656 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2657 had a null address, and COMPONENT had an address which is equal to
2658 its offset inside CONTAINER. */
2661 value_assign_to_component (struct value
*container
, struct value
*component
,
2664 LONGEST offset_in_container
=
2665 (LONGEST
) (value_address (component
) - value_address (container
));
2666 int bit_offset_in_container
=
2667 value_bitpos (component
) - value_bitpos (container
);
2670 val
= value_cast (value_type (component
), val
);
2672 if (value_bitsize (component
) == 0)
2673 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2675 bits
= value_bitsize (component
);
2677 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2681 if (is_scalar_type (check_typedef (value_type (component
))))
2683 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2686 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2687 value_bitpos (container
) + bit_offset_in_container
,
2688 value_contents (val
), src_offset
, bits
, 1);
2691 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2692 value_bitpos (container
) + bit_offset_in_container
,
2693 value_contents (val
), 0, bits
, 0);
2696 /* Determine if TYPE is an access to an unconstrained array. */
2699 ada_is_access_to_unconstrained_array (struct type
*type
)
2701 return (type
->code () == TYPE_CODE_TYPEDEF
2702 && is_thick_pntr (ada_typedef_target_type (type
)));
2705 /* The value of the element of array ARR at the ARITY indices given in IND.
2706 ARR may be either a simple array, GNAT array descriptor, or pointer
2710 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2714 struct type
*elt_type
;
2716 elt
= ada_coerce_to_simple_array (arr
);
2718 elt_type
= ada_check_typedef (value_type (elt
));
2719 if (elt_type
->code () == TYPE_CODE_ARRAY
2720 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2721 return value_subscript_packed (elt
, arity
, ind
);
2723 for (k
= 0; k
< arity
; k
+= 1)
2725 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2727 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2728 error (_("too many subscripts (%d expected)"), k
);
2730 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2732 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2733 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2735 /* The element is a typedef to an unconstrained array,
2736 except that the value_subscript call stripped the
2737 typedef layer. The typedef layer is GNAT's way to
2738 specify that the element is, at the source level, an
2739 access to the unconstrained array, rather than the
2740 unconstrained array. So, we need to restore that
2741 typedef layer, which we can do by forcing the element's
2742 type back to its original type. Otherwise, the returned
2743 value is going to be printed as the array, rather
2744 than as an access. Another symptom of the same issue
2745 would be that an expression trying to dereference the
2746 element would also be improperly rejected. */
2747 deprecated_set_value_type (elt
, saved_elt_type
);
2750 elt_type
= ada_check_typedef (value_type (elt
));
2756 /* Assuming ARR is a pointer to a GDB array, the value of the element
2757 of *ARR at the ARITY indices given in IND.
2758 Does not read the entire array into memory.
2760 Note: Unlike what one would expect, this function is used instead of
2761 ada_value_subscript for basically all non-packed array types. The reason
2762 for this is that a side effect of doing our own pointer arithmetics instead
2763 of relying on value_subscript is that there is no implicit typedef peeling.
2764 This is important for arrays of array accesses, where it allows us to
2765 preserve the fact that the array's element is an array access, where the
2766 access part os encoded in a typedef layer. */
2768 static struct value
*
2769 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2772 struct value
*array_ind
= ada_value_ind (arr
);
2774 = check_typedef (value_enclosing_type (array_ind
));
2776 if (type
->code () == TYPE_CODE_ARRAY
2777 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2778 return value_subscript_packed (array_ind
, arity
, ind
);
2780 for (k
= 0; k
< arity
; k
+= 1)
2783 struct value
*lwb_value
;
2785 if (type
->code () != TYPE_CODE_ARRAY
)
2786 error (_("too many subscripts (%d expected)"), k
);
2787 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2789 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2790 lwb_value
= value_from_longest (value_type (ind
[k
]), lwb
);
2791 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - pos_atr (lwb_value
));
2792 type
= TYPE_TARGET_TYPE (type
);
2795 return value_ind (arr
);
2798 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2799 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2800 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2801 this array is LOW, as per Ada rules. */
2802 static struct value
*
2803 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2806 struct type
*type0
= ada_check_typedef (type
);
2807 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
));
2808 struct type
*index_type
2809 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2810 struct type
*slice_type
= create_array_type_with_stride
2811 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2812 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2813 TYPE_FIELD_BITSIZE (type0
, 0));
2814 int base_low
= ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
));
2815 LONGEST base_low_pos
, low_pos
;
2818 if (!discrete_position (base_index_type
, low
, &low_pos
)
2819 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2821 warning (_("unable to get positions in slice, use bounds instead"));
2823 base_low_pos
= base_low
;
2826 base
= value_as_address (array_ptr
)
2827 + ((low_pos
- base_low_pos
)
2828 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2829 return value_at_lazy (slice_type
, base
);
2833 static struct value
*
2834 ada_value_slice (struct value
*array
, int low
, int high
)
2836 struct type
*type
= ada_check_typedef (value_type (array
));
2837 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2838 struct type
*index_type
2839 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2840 struct type
*slice_type
= create_array_type_with_stride
2841 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2842 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2843 TYPE_FIELD_BITSIZE (type
, 0));
2844 LONGEST low_pos
, high_pos
;
2846 if (!discrete_position (base_index_type
, low
, &low_pos
)
2847 || !discrete_position (base_index_type
, high
, &high_pos
))
2849 warning (_("unable to get positions in slice, use bounds instead"));
2854 return value_cast (slice_type
,
2855 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2858 /* If type is a record type in the form of a standard GNAT array
2859 descriptor, returns the number of dimensions for type. If arr is a
2860 simple array, returns the number of "array of"s that prefix its
2861 type designation. Otherwise, returns 0. */
2864 ada_array_arity (struct type
*type
)
2871 type
= desc_base_type (type
);
2874 if (type
->code () == TYPE_CODE_STRUCT
)
2875 return desc_arity (desc_bounds_type (type
));
2877 while (type
->code () == TYPE_CODE_ARRAY
)
2880 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2886 /* If TYPE is a record type in the form of a standard GNAT array
2887 descriptor or a simple array type, returns the element type for
2888 TYPE after indexing by NINDICES indices, or by all indices if
2889 NINDICES is -1. Otherwise, returns NULL. */
2892 ada_array_element_type (struct type
*type
, int nindices
)
2894 type
= desc_base_type (type
);
2896 if (type
->code () == TYPE_CODE_STRUCT
)
2899 struct type
*p_array_type
;
2901 p_array_type
= desc_data_target_type (type
);
2903 k
= ada_array_arity (type
);
2907 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2908 if (nindices
>= 0 && k
> nindices
)
2910 while (k
> 0 && p_array_type
!= NULL
)
2912 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2915 return p_array_type
;
2917 else if (type
->code () == TYPE_CODE_ARRAY
)
2919 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2921 type
= TYPE_TARGET_TYPE (type
);
2930 /* The type of nth index in arrays of given type (n numbering from 1).
2931 Does not examine memory. Throws an error if N is invalid or TYPE
2932 is not an array type. NAME is the name of the Ada attribute being
2933 evaluated ('range, 'first, 'last, or 'length); it is used in building
2934 the error message. */
2936 static struct type
*
2937 ada_index_type (struct type
*type
, int n
, const char *name
)
2939 struct type
*result_type
;
2941 type
= desc_base_type (type
);
2943 if (n
< 0 || n
> ada_array_arity (type
))
2944 error (_("invalid dimension number to '%s"), name
);
2946 if (ada_is_simple_array_type (type
))
2950 for (i
= 1; i
< n
; i
+= 1)
2951 type
= TYPE_TARGET_TYPE (type
);
2952 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2953 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2954 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2955 perhaps stabsread.c would make more sense. */
2956 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2961 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2962 if (result_type
== NULL
)
2963 error (_("attempt to take bound of something that is not an array"));
2969 /* Given that arr is an array type, returns the lower bound of the
2970 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2971 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2972 array-descriptor type. It works for other arrays with bounds supplied
2973 by run-time quantities other than discriminants. */
2976 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2978 struct type
*type
, *index_type_desc
, *index_type
;
2981 gdb_assert (which
== 0 || which
== 1);
2983 if (ada_is_constrained_packed_array_type (arr_type
))
2984 arr_type
= decode_constrained_packed_array_type (arr_type
);
2986 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2987 return (LONGEST
) - which
;
2989 if (arr_type
->code () == TYPE_CODE_PTR
)
2990 type
= TYPE_TARGET_TYPE (arr_type
);
2994 if (TYPE_FIXED_INSTANCE (type
))
2996 /* The array has already been fixed, so we do not need to
2997 check the parallel ___XA type again. That encoding has
2998 already been applied, so ignore it now. */
2999 index_type_desc
= NULL
;
3003 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3004 ada_fixup_array_indexes_type (index_type_desc
);
3007 if (index_type_desc
!= NULL
)
3008 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
3012 struct type
*elt_type
= check_typedef (type
);
3014 for (i
= 1; i
< n
; i
++)
3015 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3017 index_type
= TYPE_INDEX_TYPE (elt_type
);
3021 (LONGEST
) (which
== 0
3022 ? ada_discrete_type_low_bound (index_type
)
3023 : ada_discrete_type_high_bound (index_type
));
3026 /* Given that arr is an array value, returns the lower bound of the
3027 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3028 WHICH is 1. This routine will also work for arrays with bounds
3029 supplied by run-time quantities other than discriminants. */
3032 ada_array_bound (struct value
*arr
, int n
, int which
)
3034 struct type
*arr_type
;
3036 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3037 arr
= value_ind (arr
);
3038 arr_type
= value_enclosing_type (arr
);
3040 if (ada_is_constrained_packed_array_type (arr_type
))
3041 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3042 else if (ada_is_simple_array_type (arr_type
))
3043 return ada_array_bound_from_type (arr_type
, n
, which
);
3045 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3048 /* Given that arr is an array value, returns the length of the
3049 nth index. This routine will also work for arrays with bounds
3050 supplied by run-time quantities other than discriminants.
3051 Does not work for arrays indexed by enumeration types with representation
3052 clauses at the moment. */
3055 ada_array_length (struct value
*arr
, int n
)
3057 struct type
*arr_type
, *index_type
;
3060 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3061 arr
= value_ind (arr
);
3062 arr_type
= value_enclosing_type (arr
);
3064 if (ada_is_constrained_packed_array_type (arr_type
))
3065 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3067 if (ada_is_simple_array_type (arr_type
))
3069 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3070 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3074 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3075 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3078 arr_type
= check_typedef (arr_type
);
3079 index_type
= ada_index_type (arr_type
, n
, "length");
3080 if (index_type
!= NULL
)
3082 struct type
*base_type
;
3083 if (index_type
->code () == TYPE_CODE_RANGE
)
3084 base_type
= TYPE_TARGET_TYPE (index_type
);
3086 base_type
= index_type
;
3088 low
= pos_atr (value_from_longest (base_type
, low
));
3089 high
= pos_atr (value_from_longest (base_type
, high
));
3091 return high
- low
+ 1;
3094 /* An array whose type is that of ARR_TYPE (an array type), with
3095 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3096 less than LOW, then LOW-1 is used. */
3098 static struct value
*
3099 empty_array (struct type
*arr_type
, int low
, int high
)
3101 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3102 struct type
*index_type
3103 = create_static_range_type
3104 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
,
3105 high
< low
? low
- 1 : high
);
3106 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3108 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3112 /* Name resolution */
3114 /* The "decoded" name for the user-definable Ada operator corresponding
3118 ada_decoded_op_name (enum exp_opcode op
)
3122 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3124 if (ada_opname_table
[i
].op
== op
)
3125 return ada_opname_table
[i
].decoded
;
3127 error (_("Could not find operator name for opcode"));
3130 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3131 in a listing of choices during disambiguation (see sort_choices, below).
3132 The idea is that overloadings of a subprogram name from the
3133 same package should sort in their source order. We settle for ordering
3134 such symbols by their trailing number (__N or $N). */
3137 encoded_ordered_before (const char *N0
, const char *N1
)
3141 else if (N0
== NULL
)
3147 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3149 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3151 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3152 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3157 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3160 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3162 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3163 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3165 return (strcmp (N0
, N1
) < 0);
3169 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3173 sort_choices (struct block_symbol syms
[], int nsyms
)
3177 for (i
= 1; i
< nsyms
; i
+= 1)
3179 struct block_symbol sym
= syms
[i
];
3182 for (j
= i
- 1; j
>= 0; j
-= 1)
3184 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3185 sym
.symbol
->linkage_name ()))
3187 syms
[j
+ 1] = syms
[j
];
3193 /* Whether GDB should display formals and return types for functions in the
3194 overloads selection menu. */
3195 static bool print_signatures
= true;
3197 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3198 all but functions, the signature is just the name of the symbol. For
3199 functions, this is the name of the function, the list of types for formals
3200 and the return type (if any). */
3203 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3204 const struct type_print_options
*flags
)
3206 struct type
*type
= SYMBOL_TYPE (sym
);
3208 fprintf_filtered (stream
, "%s", sym
->print_name ());
3209 if (!print_signatures
3211 || type
->code () != TYPE_CODE_FUNC
)
3214 if (TYPE_NFIELDS (type
) > 0)
3218 fprintf_filtered (stream
, " (");
3219 for (i
= 0; i
< TYPE_NFIELDS (type
); ++i
)
3222 fprintf_filtered (stream
, "; ");
3223 ada_print_type (TYPE_FIELD_TYPE (type
, i
), NULL
, stream
, -1, 0,
3226 fprintf_filtered (stream
, ")");
3228 if (TYPE_TARGET_TYPE (type
) != NULL
3229 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3231 fprintf_filtered (stream
, " return ");
3232 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3236 /* Read and validate a set of numeric choices from the user in the
3237 range 0 .. N_CHOICES-1. Place the results in increasing
3238 order in CHOICES[0 .. N-1], and return N.
3240 The user types choices as a sequence of numbers on one line
3241 separated by blanks, encoding them as follows:
3243 + A choice of 0 means to cancel the selection, throwing an error.
3244 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3245 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3247 The user is not allowed to choose more than MAX_RESULTS values.
3249 ANNOTATION_SUFFIX, if present, is used to annotate the input
3250 prompts (for use with the -f switch). */
3253 get_selections (int *choices
, int n_choices
, int max_results
,
3254 int is_all_choice
, const char *annotation_suffix
)
3259 int first_choice
= is_all_choice
? 2 : 1;
3261 prompt
= getenv ("PS2");
3265 args
= command_line_input (prompt
, annotation_suffix
);
3268 error_no_arg (_("one or more choice numbers"));
3272 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3273 order, as given in args. Choices are validated. */
3279 args
= skip_spaces (args
);
3280 if (*args
== '\0' && n_chosen
== 0)
3281 error_no_arg (_("one or more choice numbers"));
3282 else if (*args
== '\0')
3285 choice
= strtol (args
, &args2
, 10);
3286 if (args
== args2
|| choice
< 0
3287 || choice
> n_choices
+ first_choice
- 1)
3288 error (_("Argument must be choice number"));
3292 error (_("cancelled"));
3294 if (choice
< first_choice
)
3296 n_chosen
= n_choices
;
3297 for (j
= 0; j
< n_choices
; j
+= 1)
3301 choice
-= first_choice
;
3303 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3307 if (j
< 0 || choice
!= choices
[j
])
3311 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3312 choices
[k
+ 1] = choices
[k
];
3313 choices
[j
+ 1] = choice
;
3318 if (n_chosen
> max_results
)
3319 error (_("Select no more than %d of the above"), max_results
);
3324 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3325 by asking the user (if necessary), returning the number selected,
3326 and setting the first elements of SYMS items. Error if no symbols
3329 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3330 to be re-integrated one of these days. */
3333 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3336 int *chosen
= XALLOCAVEC (int , nsyms
);
3338 int first_choice
= (max_results
== 1) ? 1 : 2;
3339 const char *select_mode
= multiple_symbols_select_mode ();
3341 if (max_results
< 1)
3342 error (_("Request to select 0 symbols!"));
3346 if (select_mode
== multiple_symbols_cancel
)
3348 canceled because the command is ambiguous\n\
3349 See set/show multiple-symbol."));
3351 /* If select_mode is "all", then return all possible symbols.
3352 Only do that if more than one symbol can be selected, of course.
3353 Otherwise, display the menu as usual. */
3354 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3357 printf_filtered (_("[0] cancel\n"));
3358 if (max_results
> 1)
3359 printf_filtered (_("[1] all\n"));
3361 sort_choices (syms
, nsyms
);
3363 for (i
= 0; i
< nsyms
; i
+= 1)
3365 if (syms
[i
].symbol
== NULL
)
3368 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3370 struct symtab_and_line sal
=
3371 find_function_start_sal (syms
[i
].symbol
, 1);
3373 printf_filtered ("[%d] ", i
+ first_choice
);
3374 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3375 &type_print_raw_options
);
3376 if (sal
.symtab
== NULL
)
3377 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3378 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3382 styled_string (file_name_style
.style (),
3383 symtab_to_filename_for_display (sal
.symtab
)),
3390 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3391 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3392 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3393 struct symtab
*symtab
= NULL
;
3395 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3396 symtab
= symbol_symtab (syms
[i
].symbol
);
3398 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3400 printf_filtered ("[%d] ", i
+ first_choice
);
3401 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3402 &type_print_raw_options
);
3403 printf_filtered (_(" at %s:%d\n"),
3404 symtab_to_filename_for_display (symtab
),
3405 SYMBOL_LINE (syms
[i
].symbol
));
3407 else if (is_enumeral
3408 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3410 printf_filtered (("[%d] "), i
+ first_choice
);
3411 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3412 gdb_stdout
, -1, 0, &type_print_raw_options
);
3413 printf_filtered (_("'(%s) (enumeral)\n"),
3414 syms
[i
].symbol
->print_name ());
3418 printf_filtered ("[%d] ", i
+ first_choice
);
3419 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3420 &type_print_raw_options
);
3423 printf_filtered (is_enumeral
3424 ? _(" in %s (enumeral)\n")
3426 symtab_to_filename_for_display (symtab
));
3428 printf_filtered (is_enumeral
3429 ? _(" (enumeral)\n")
3435 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3438 for (i
= 0; i
< n_chosen
; i
+= 1)
3439 syms
[i
] = syms
[chosen
[i
]];
3444 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3445 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3446 undefined namespace) and converts operators that are
3447 user-defined into appropriate function calls. If CONTEXT_TYPE is
3448 non-null, it provides a preferred result type [at the moment, only
3449 type void has any effect---causing procedures to be preferred over
3450 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3451 return type is preferred. May change (expand) *EXP. */
3454 resolve (expression_up
*expp
, int void_context_p
, int parse_completion
,
3455 innermost_block_tracker
*tracker
)
3457 struct type
*context_type
= NULL
;
3461 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3463 resolve_subexp (expp
, &pc
, 1, context_type
, parse_completion
, tracker
);
3466 /* Resolve the operator of the subexpression beginning at
3467 position *POS of *EXPP. "Resolving" consists of replacing
3468 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3469 with their resolutions, replacing built-in operators with
3470 function calls to user-defined operators, where appropriate, and,
3471 when DEPROCEDURE_P is non-zero, converting function-valued variables
3472 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3473 are as in ada_resolve, above. */
3475 static struct value
*
3476 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3477 struct type
*context_type
, int parse_completion
,
3478 innermost_block_tracker
*tracker
)
3482 struct expression
*exp
; /* Convenience: == *expp. */
3483 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3484 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3485 int nargs
; /* Number of operands. */
3492 /* Pass one: resolve operands, saving their types and updating *pos,
3497 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3498 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3503 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3505 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3510 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3515 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3516 parse_completion
, tracker
);
3519 case OP_ATR_MODULUS
:
3529 case TERNOP_IN_RANGE
:
3530 case BINOP_IN_BOUNDS
:
3536 case OP_DISCRETE_RANGE
:
3538 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3547 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3549 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3551 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3569 case BINOP_LOGICAL_AND
:
3570 case BINOP_LOGICAL_OR
:
3571 case BINOP_BITWISE_AND
:
3572 case BINOP_BITWISE_IOR
:
3573 case BINOP_BITWISE_XOR
:
3576 case BINOP_NOTEQUAL
:
3583 case BINOP_SUBSCRIPT
:
3591 case UNOP_LOGICAL_NOT
:
3601 case OP_VAR_MSYM_VALUE
:
3608 case OP_INTERNALVAR
:
3618 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3621 case STRUCTOP_STRUCT
:
3622 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3635 error (_("Unexpected operator during name resolution"));
3638 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3639 for (i
= 0; i
< nargs
; i
+= 1)
3640 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
,
3645 /* Pass two: perform any resolution on principal operator. */
3652 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3654 std::vector
<struct block_symbol
> candidates
;
3658 ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3659 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3662 if (n_candidates
> 1)
3664 /* Types tend to get re-introduced locally, so if there
3665 are any local symbols that are not types, first filter
3668 for (j
= 0; j
< n_candidates
; j
+= 1)
3669 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3674 case LOC_REGPARM_ADDR
:
3682 if (j
< n_candidates
)
3685 while (j
< n_candidates
)
3687 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3689 candidates
[j
] = candidates
[n_candidates
- 1];
3698 if (n_candidates
== 0)
3699 error (_("No definition found for %s"),
3700 exp
->elts
[pc
+ 2].symbol
->print_name ());
3701 else if (n_candidates
== 1)
3703 else if (deprocedure_p
3704 && !is_nonfunction (candidates
.data (), n_candidates
))
3706 i
= ada_resolve_function
3707 (candidates
.data (), n_candidates
, NULL
, 0,
3708 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3709 context_type
, parse_completion
);
3711 error (_("Could not find a match for %s"),
3712 exp
->elts
[pc
+ 2].symbol
->print_name ());
3716 printf_filtered (_("Multiple matches for %s\n"),
3717 exp
->elts
[pc
+ 2].symbol
->print_name ());
3718 user_select_syms (candidates
.data (), n_candidates
, 1);
3722 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3723 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3724 tracker
->update (candidates
[i
]);
3728 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3731 replace_operator_with_call (expp
, pc
, 0, 4,
3732 exp
->elts
[pc
+ 2].symbol
,
3733 exp
->elts
[pc
+ 1].block
);
3740 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3741 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3743 std::vector
<struct block_symbol
> candidates
;
3747 ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3748 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3751 if (n_candidates
== 1)
3755 i
= ada_resolve_function
3756 (candidates
.data (), n_candidates
,
3758 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3759 context_type
, parse_completion
);
3761 error (_("Could not find a match for %s"),
3762 exp
->elts
[pc
+ 5].symbol
->print_name ());
3765 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3766 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3767 tracker
->update (candidates
[i
]);
3778 case BINOP_BITWISE_AND
:
3779 case BINOP_BITWISE_IOR
:
3780 case BINOP_BITWISE_XOR
:
3782 case BINOP_NOTEQUAL
:
3790 case UNOP_LOGICAL_NOT
:
3792 if (possible_user_operator_p (op
, argvec
))
3794 std::vector
<struct block_symbol
> candidates
;
3798 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3802 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3803 nargs
, ada_decoded_op_name (op
), NULL
,
3808 replace_operator_with_call (expp
, pc
, nargs
, 1,
3809 candidates
[i
].symbol
,
3810 candidates
[i
].block
);
3821 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3822 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3823 exp
->elts
[pc
+ 1].objfile
,
3824 exp
->elts
[pc
+ 2].msymbol
);
3826 return evaluate_subexp_type (exp
, pos
);
3829 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3830 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3832 /* The term "match" here is rather loose. The match is heuristic and
3836 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3838 ftype
= ada_check_typedef (ftype
);
3839 atype
= ada_check_typedef (atype
);
3841 if (ftype
->code () == TYPE_CODE_REF
)
3842 ftype
= TYPE_TARGET_TYPE (ftype
);
3843 if (atype
->code () == TYPE_CODE_REF
)
3844 atype
= TYPE_TARGET_TYPE (atype
);
3846 switch (ftype
->code ())
3849 return ftype
->code () == atype
->code ();
3851 if (atype
->code () == TYPE_CODE_PTR
)
3852 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3853 TYPE_TARGET_TYPE (atype
), 0);
3856 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3858 case TYPE_CODE_ENUM
:
3859 case TYPE_CODE_RANGE
:
3860 switch (atype
->code ())
3863 case TYPE_CODE_ENUM
:
3864 case TYPE_CODE_RANGE
:
3870 case TYPE_CODE_ARRAY
:
3871 return (atype
->code () == TYPE_CODE_ARRAY
3872 || ada_is_array_descriptor_type (atype
));
3874 case TYPE_CODE_STRUCT
:
3875 if (ada_is_array_descriptor_type (ftype
))
3876 return (atype
->code () == TYPE_CODE_ARRAY
3877 || ada_is_array_descriptor_type (atype
));
3879 return (atype
->code () == TYPE_CODE_STRUCT
3880 && !ada_is_array_descriptor_type (atype
));
3882 case TYPE_CODE_UNION
:
3884 return (atype
->code () == ftype
->code ());
3888 /* Return non-zero if the formals of FUNC "sufficiently match" the
3889 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3890 may also be an enumeral, in which case it is treated as a 0-
3891 argument function. */
3894 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3897 struct type
*func_type
= SYMBOL_TYPE (func
);
3899 if (SYMBOL_CLASS (func
) == LOC_CONST
3900 && func_type
->code () == TYPE_CODE_ENUM
)
3901 return (n_actuals
== 0);
3902 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3905 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3908 for (i
= 0; i
< n_actuals
; i
+= 1)
3910 if (actuals
[i
] == NULL
)
3914 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3916 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3918 if (!ada_type_match (ftype
, atype
, 1))
3925 /* False iff function type FUNC_TYPE definitely does not produce a value
3926 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3927 FUNC_TYPE is not a valid function type with a non-null return type
3928 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3931 return_match (struct type
*func_type
, struct type
*context_type
)
3933 struct type
*return_type
;
3935 if (func_type
== NULL
)
3938 if (func_type
->code () == TYPE_CODE_FUNC
)
3939 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3941 return_type
= get_base_type (func_type
);
3942 if (return_type
== NULL
)
3945 context_type
= get_base_type (context_type
);
3947 if (return_type
->code () == TYPE_CODE_ENUM
)
3948 return context_type
== NULL
|| return_type
== context_type
;
3949 else if (context_type
== NULL
)
3950 return return_type
->code () != TYPE_CODE_VOID
;
3952 return return_type
->code () == context_type
->code ();
3956 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3957 function (if any) that matches the types of the NARGS arguments in
3958 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3959 that returns that type, then eliminate matches that don't. If
3960 CONTEXT_TYPE is void and there is at least one match that does not
3961 return void, eliminate all matches that do.
3963 Asks the user if there is more than one match remaining. Returns -1
3964 if there is no such symbol or none is selected. NAME is used
3965 solely for messages. May re-arrange and modify SYMS in
3966 the process; the index returned is for the modified vector. */
3969 ada_resolve_function (struct block_symbol syms
[],
3970 int nsyms
, struct value
**args
, int nargs
,
3971 const char *name
, struct type
*context_type
,
3972 int parse_completion
)
3976 int m
; /* Number of hits */
3979 /* In the first pass of the loop, we only accept functions matching
3980 context_type. If none are found, we add a second pass of the loop
3981 where every function is accepted. */
3982 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3984 for (k
= 0; k
< nsyms
; k
+= 1)
3986 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3988 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3989 && (fallback
|| return_match (type
, context_type
)))
3997 /* If we got multiple matches, ask the user which one to use. Don't do this
3998 interactive thing during completion, though, as the purpose of the
3999 completion is providing a list of all possible matches. Prompting the
4000 user to filter it down would be completely unexpected in this case. */
4003 else if (m
> 1 && !parse_completion
)
4005 printf_filtered (_("Multiple matches for %s\n"), name
);
4006 user_select_syms (syms
, m
, 1);
4012 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4013 on the function identified by SYM and BLOCK, and taking NARGS
4014 arguments. Update *EXPP as needed to hold more space. */
4017 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4018 int oplen
, struct symbol
*sym
,
4019 const struct block
*block
)
4021 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4022 symbol, -oplen for operator being replaced). */
4023 struct expression
*newexp
= (struct expression
*)
4024 xzalloc (sizeof (struct expression
)
4025 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
4026 struct expression
*exp
= expp
->get ();
4028 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4029 newexp
->language_defn
= exp
->language_defn
;
4030 newexp
->gdbarch
= exp
->gdbarch
;
4031 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4032 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4033 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4035 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4036 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4038 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4039 newexp
->elts
[pc
+ 4].block
= block
;
4040 newexp
->elts
[pc
+ 5].symbol
= sym
;
4042 expp
->reset (newexp
);
4045 /* Type-class predicates */
4047 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4051 numeric_type_p (struct type
*type
)
4057 switch (type
->code ())
4062 case TYPE_CODE_RANGE
:
4063 return (type
== TYPE_TARGET_TYPE (type
)
4064 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4071 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4074 integer_type_p (struct type
*type
)
4080 switch (type
->code ())
4084 case TYPE_CODE_RANGE
:
4085 return (type
== TYPE_TARGET_TYPE (type
)
4086 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4093 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4096 scalar_type_p (struct type
*type
)
4102 switch (type
->code ())
4105 case TYPE_CODE_RANGE
:
4106 case TYPE_CODE_ENUM
:
4115 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4118 discrete_type_p (struct type
*type
)
4124 switch (type
->code ())
4127 case TYPE_CODE_RANGE
:
4128 case TYPE_CODE_ENUM
:
4129 case TYPE_CODE_BOOL
:
4137 /* Returns non-zero if OP with operands in the vector ARGS could be
4138 a user-defined function. Errs on the side of pre-defined operators
4139 (i.e., result 0). */
4142 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4144 struct type
*type0
=
4145 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4146 struct type
*type1
=
4147 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4161 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4165 case BINOP_BITWISE_AND
:
4166 case BINOP_BITWISE_IOR
:
4167 case BINOP_BITWISE_XOR
:
4168 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4171 case BINOP_NOTEQUAL
:
4176 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4179 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4182 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4186 case UNOP_LOGICAL_NOT
:
4188 return (!numeric_type_p (type0
));
4197 1. In the following, we assume that a renaming type's name may
4198 have an ___XD suffix. It would be nice if this went away at some
4200 2. We handle both the (old) purely type-based representation of
4201 renamings and the (new) variable-based encoding. At some point,
4202 it is devoutly to be hoped that the former goes away
4203 (FIXME: hilfinger-2007-07-09).
4204 3. Subprogram renamings are not implemented, although the XRS
4205 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4207 /* If SYM encodes a renaming,
4209 <renaming> renames <renamed entity>,
4211 sets *LEN to the length of the renamed entity's name,
4212 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4213 the string describing the subcomponent selected from the renamed
4214 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4215 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4216 are undefined). Otherwise, returns a value indicating the category
4217 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4218 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4219 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4220 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4221 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4222 may be NULL, in which case they are not assigned.
4224 [Currently, however, GCC does not generate subprogram renamings.] */
4226 enum ada_renaming_category
4227 ada_parse_renaming (struct symbol
*sym
,
4228 const char **renamed_entity
, int *len
,
4229 const char **renaming_expr
)
4231 enum ada_renaming_category kind
;
4236 return ADA_NOT_RENAMING
;
4237 switch (SYMBOL_CLASS (sym
))
4240 return ADA_NOT_RENAMING
;
4244 case LOC_OPTIMIZED_OUT
:
4245 info
= strstr (sym
->linkage_name (), "___XR");
4247 return ADA_NOT_RENAMING
;
4251 kind
= ADA_OBJECT_RENAMING
;
4255 kind
= ADA_EXCEPTION_RENAMING
;
4259 kind
= ADA_PACKAGE_RENAMING
;
4263 kind
= ADA_SUBPROGRAM_RENAMING
;
4267 return ADA_NOT_RENAMING
;
4271 if (renamed_entity
!= NULL
)
4272 *renamed_entity
= info
;
4273 suffix
= strstr (info
, "___XE");
4274 if (suffix
== NULL
|| suffix
== info
)
4275 return ADA_NOT_RENAMING
;
4277 *len
= strlen (info
) - strlen (suffix
);
4279 if (renaming_expr
!= NULL
)
4280 *renaming_expr
= suffix
;
4284 /* Compute the value of the given RENAMING_SYM, which is expected to
4285 be a symbol encoding a renaming expression. BLOCK is the block
4286 used to evaluate the renaming. */
4288 static struct value
*
4289 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4290 const struct block
*block
)
4292 const char *sym_name
;
4294 sym_name
= renaming_sym
->linkage_name ();
4295 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4296 return evaluate_expression (expr
.get ());
4300 /* Evaluation: Function Calls */
4302 /* Return an lvalue containing the value VAL. This is the identity on
4303 lvalues, and otherwise has the side-effect of allocating memory
4304 in the inferior where a copy of the value contents is copied. */
4306 static struct value
*
4307 ensure_lval (struct value
*val
)
4309 if (VALUE_LVAL (val
) == not_lval
4310 || VALUE_LVAL (val
) == lval_internalvar
)
4312 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4313 const CORE_ADDR addr
=
4314 value_as_long (value_allocate_space_in_inferior (len
));
4316 VALUE_LVAL (val
) = lval_memory
;
4317 set_value_address (val
, addr
);
4318 write_memory (addr
, value_contents (val
), len
);
4324 /* Given ARG, a value of type (pointer or reference to a)*
4325 structure/union, extract the component named NAME from the ultimate
4326 target structure/union and return it as a value with its
4329 The routine searches for NAME among all members of the structure itself
4330 and (recursively) among all members of any wrapper members
4333 If NO_ERR, then simply return NULL in case of error, rather than
4336 static struct value
*
4337 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4339 struct type
*t
, *t1
;
4344 t1
= t
= ada_check_typedef (value_type (arg
));
4345 if (t
->code () == TYPE_CODE_REF
)
4347 t1
= TYPE_TARGET_TYPE (t
);
4350 t1
= ada_check_typedef (t1
);
4351 if (t1
->code () == TYPE_CODE_PTR
)
4353 arg
= coerce_ref (arg
);
4358 while (t
->code () == TYPE_CODE_PTR
)
4360 t1
= TYPE_TARGET_TYPE (t
);
4363 t1
= ada_check_typedef (t1
);
4364 if (t1
->code () == TYPE_CODE_PTR
)
4366 arg
= value_ind (arg
);
4373 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4377 v
= ada_search_struct_field (name
, arg
, 0, t
);
4380 int bit_offset
, bit_size
, byte_offset
;
4381 struct type
*field_type
;
4384 if (t
->code () == TYPE_CODE_PTR
)
4385 address
= value_address (ada_value_ind (arg
));
4387 address
= value_address (ada_coerce_ref (arg
));
4389 /* Check to see if this is a tagged type. We also need to handle
4390 the case where the type is a reference to a tagged type, but
4391 we have to be careful to exclude pointers to tagged types.
4392 The latter should be shown as usual (as a pointer), whereas
4393 a reference should mostly be transparent to the user. */
4395 if (ada_is_tagged_type (t1
, 0)
4396 || (t1
->code () == TYPE_CODE_REF
4397 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4399 /* We first try to find the searched field in the current type.
4400 If not found then let's look in the fixed type. */
4402 if (!find_struct_field (name
, t1
, 0,
4403 &field_type
, &byte_offset
, &bit_offset
,
4412 /* Convert to fixed type in all cases, so that we have proper
4413 offsets to each field in unconstrained record types. */
4414 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4415 address
, NULL
, check_tag
);
4417 if (find_struct_field (name
, t1
, 0,
4418 &field_type
, &byte_offset
, &bit_offset
,
4423 if (t
->code () == TYPE_CODE_REF
)
4424 arg
= ada_coerce_ref (arg
);
4426 arg
= ada_value_ind (arg
);
4427 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4428 bit_offset
, bit_size
,
4432 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4436 if (v
!= NULL
|| no_err
)
4439 error (_("There is no member named %s."), name
);
4445 error (_("Attempt to extract a component of "
4446 "a value that is not a record."));
4449 /* Return the value ACTUAL, converted to be an appropriate value for a
4450 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4451 allocating any necessary descriptors (fat pointers), or copies of
4452 values not residing in memory, updating it as needed. */
4455 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4457 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4458 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4459 struct type
*formal_target
=
4460 formal_type
->code () == TYPE_CODE_PTR
4461 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4462 struct type
*actual_target
=
4463 actual_type
->code () == TYPE_CODE_PTR
4464 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4466 if (ada_is_array_descriptor_type (formal_target
)
4467 && actual_target
->code () == TYPE_CODE_ARRAY
)
4468 return make_array_descriptor (formal_type
, actual
);
4469 else if (formal_type
->code () == TYPE_CODE_PTR
4470 || formal_type
->code () == TYPE_CODE_REF
)
4472 struct value
*result
;
4474 if (formal_target
->code () == TYPE_CODE_ARRAY
4475 && ada_is_array_descriptor_type (actual_target
))
4476 result
= desc_data (actual
);
4477 else if (formal_type
->code () != TYPE_CODE_PTR
)
4479 if (VALUE_LVAL (actual
) != lval_memory
)
4483 actual_type
= ada_check_typedef (value_type (actual
));
4484 val
= allocate_value (actual_type
);
4485 memcpy ((char *) value_contents_raw (val
),
4486 (char *) value_contents (actual
),
4487 TYPE_LENGTH (actual_type
));
4488 actual
= ensure_lval (val
);
4490 result
= value_addr (actual
);
4494 return value_cast_pointers (formal_type
, result
, 0);
4496 else if (actual_type
->code () == TYPE_CODE_PTR
)
4497 return ada_value_ind (actual
);
4498 else if (ada_is_aligner_type (formal_type
))
4500 /* We need to turn this parameter into an aligner type
4502 struct value
*aligner
= allocate_value (formal_type
);
4503 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4505 value_assign_to_component (aligner
, component
, actual
);
4512 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4513 type TYPE. This is usually an inefficient no-op except on some targets
4514 (such as AVR) where the representation of a pointer and an address
4518 value_pointer (struct value
*value
, struct type
*type
)
4520 struct gdbarch
*gdbarch
= get_type_arch (type
);
4521 unsigned len
= TYPE_LENGTH (type
);
4522 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4525 addr
= value_address (value
);
4526 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4527 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4532 /* Push a descriptor of type TYPE for array value ARR on the stack at
4533 *SP, updating *SP to reflect the new descriptor. Return either
4534 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4535 to-descriptor type rather than a descriptor type), a struct value *
4536 representing a pointer to this descriptor. */
4538 static struct value
*
4539 make_array_descriptor (struct type
*type
, struct value
*arr
)
4541 struct type
*bounds_type
= desc_bounds_type (type
);
4542 struct type
*desc_type
= desc_base_type (type
);
4543 struct value
*descriptor
= allocate_value (desc_type
);
4544 struct value
*bounds
= allocate_value (bounds_type
);
4547 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4550 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4551 ada_array_bound (arr
, i
, 0),
4552 desc_bound_bitpos (bounds_type
, i
, 0),
4553 desc_bound_bitsize (bounds_type
, i
, 0));
4554 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4555 ada_array_bound (arr
, i
, 1),
4556 desc_bound_bitpos (bounds_type
, i
, 1),
4557 desc_bound_bitsize (bounds_type
, i
, 1));
4560 bounds
= ensure_lval (bounds
);
4562 modify_field (value_type (descriptor
),
4563 value_contents_writeable (descriptor
),
4564 value_pointer (ensure_lval (arr
),
4565 TYPE_FIELD_TYPE (desc_type
, 0)),
4566 fat_pntr_data_bitpos (desc_type
),
4567 fat_pntr_data_bitsize (desc_type
));
4569 modify_field (value_type (descriptor
),
4570 value_contents_writeable (descriptor
),
4571 value_pointer (bounds
,
4572 TYPE_FIELD_TYPE (desc_type
, 1)),
4573 fat_pntr_bounds_bitpos (desc_type
),
4574 fat_pntr_bounds_bitsize (desc_type
));
4576 descriptor
= ensure_lval (descriptor
);
4578 if (type
->code () == TYPE_CODE_PTR
)
4579 return value_addr (descriptor
);
4584 /* Symbol Cache Module */
4586 /* Performance measurements made as of 2010-01-15 indicate that
4587 this cache does bring some noticeable improvements. Depending
4588 on the type of entity being printed, the cache can make it as much
4589 as an order of magnitude faster than without it.
4591 The descriptive type DWARF extension has significantly reduced
4592 the need for this cache, at least when DWARF is being used. However,
4593 even in this case, some expensive name-based symbol searches are still
4594 sometimes necessary - to find an XVZ variable, mostly. */
4596 /* Initialize the contents of SYM_CACHE. */
4599 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4601 obstack_init (&sym_cache
->cache_space
);
4602 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4605 /* Free the memory used by SYM_CACHE. */
4608 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4610 obstack_free (&sym_cache
->cache_space
, NULL
);
4614 /* Return the symbol cache associated to the given program space PSPACE.
4615 If not allocated for this PSPACE yet, allocate and initialize one. */
4617 static struct ada_symbol_cache
*
4618 ada_get_symbol_cache (struct program_space
*pspace
)
4620 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4622 if (pspace_data
->sym_cache
== NULL
)
4624 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4625 ada_init_symbol_cache (pspace_data
->sym_cache
);
4628 return pspace_data
->sym_cache
;
4631 /* Clear all entries from the symbol cache. */
4634 ada_clear_symbol_cache (void)
4636 struct ada_symbol_cache
*sym_cache
4637 = ada_get_symbol_cache (current_program_space
);
4639 obstack_free (&sym_cache
->cache_space
, NULL
);
4640 ada_init_symbol_cache (sym_cache
);
4643 /* Search our cache for an entry matching NAME and DOMAIN.
4644 Return it if found, or NULL otherwise. */
4646 static struct cache_entry
**
4647 find_entry (const char *name
, domain_enum domain
)
4649 struct ada_symbol_cache
*sym_cache
4650 = ada_get_symbol_cache (current_program_space
);
4651 int h
= msymbol_hash (name
) % HASH_SIZE
;
4652 struct cache_entry
**e
;
4654 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4656 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4662 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4663 Return 1 if found, 0 otherwise.
4665 If an entry was found and SYM is not NULL, set *SYM to the entry's
4666 SYM. Same principle for BLOCK if not NULL. */
4669 lookup_cached_symbol (const char *name
, domain_enum domain
,
4670 struct symbol
**sym
, const struct block
**block
)
4672 struct cache_entry
**e
= find_entry (name
, domain
);
4679 *block
= (*e
)->block
;
4683 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4684 in domain DOMAIN, save this result in our symbol cache. */
4687 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4688 const struct block
*block
)
4690 struct ada_symbol_cache
*sym_cache
4691 = ada_get_symbol_cache (current_program_space
);
4693 struct cache_entry
*e
;
4695 /* Symbols for builtin types don't have a block.
4696 For now don't cache such symbols. */
4697 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4700 /* If the symbol is a local symbol, then do not cache it, as a search
4701 for that symbol depends on the context. To determine whether
4702 the symbol is local or not, we check the block where we found it
4703 against the global and static blocks of its associated symtab. */
4705 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4706 GLOBAL_BLOCK
) != block
4707 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4708 STATIC_BLOCK
) != block
)
4711 h
= msymbol_hash (name
) % HASH_SIZE
;
4712 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4713 e
->next
= sym_cache
->root
[h
];
4714 sym_cache
->root
[h
] = e
;
4715 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4723 /* Return the symbol name match type that should be used used when
4724 searching for all symbols matching LOOKUP_NAME.
4726 LOOKUP_NAME is expected to be a symbol name after transformation
4729 static symbol_name_match_type
4730 name_match_type_from_name (const char *lookup_name
)
4732 return (strstr (lookup_name
, "__") == NULL
4733 ? symbol_name_match_type::WILD
4734 : symbol_name_match_type::FULL
);
4737 /* Return the result of a standard (literal, C-like) lookup of NAME in
4738 given DOMAIN, visible from lexical block BLOCK. */
4740 static struct symbol
*
4741 standard_lookup (const char *name
, const struct block
*block
,
4744 /* Initialize it just to avoid a GCC false warning. */
4745 struct block_symbol sym
= {};
4747 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4749 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4750 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4755 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4756 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4757 since they contend in overloading in the same way. */
4759 is_nonfunction (struct block_symbol syms
[], int n
)
4763 for (i
= 0; i
< n
; i
+= 1)
4764 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_FUNC
4765 && (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
4766 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4772 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4773 struct types. Otherwise, they may not. */
4776 equiv_types (struct type
*type0
, struct type
*type1
)
4780 if (type0
== NULL
|| type1
== NULL
4781 || type0
->code () != type1
->code ())
4783 if ((type0
->code () == TYPE_CODE_STRUCT
4784 || type0
->code () == TYPE_CODE_ENUM
)
4785 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4786 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4792 /* True iff SYM0 represents the same entity as SYM1, or one that is
4793 no more defined than that of SYM1. */
4796 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4800 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4801 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4804 switch (SYMBOL_CLASS (sym0
))
4810 struct type
*type0
= SYMBOL_TYPE (sym0
);
4811 struct type
*type1
= SYMBOL_TYPE (sym1
);
4812 const char *name0
= sym0
->linkage_name ();
4813 const char *name1
= sym1
->linkage_name ();
4814 int len0
= strlen (name0
);
4817 type0
->code () == type1
->code ()
4818 && (equiv_types (type0
, type1
)
4819 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4820 && startswith (name1
+ len0
, "___XV")));
4823 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4824 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4828 const char *name0
= sym0
->linkage_name ();
4829 const char *name1
= sym1
->linkage_name ();
4830 return (strcmp (name0
, name1
) == 0
4831 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4839 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4840 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4843 add_defn_to_vec (struct obstack
*obstackp
,
4845 const struct block
*block
)
4848 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4850 /* Do not try to complete stub types, as the debugger is probably
4851 already scanning all symbols matching a certain name at the
4852 time when this function is called. Trying to replace the stub
4853 type by its associated full type will cause us to restart a scan
4854 which may lead to an infinite recursion. Instead, the client
4855 collecting the matching symbols will end up collecting several
4856 matches, with at least one of them complete. It can then filter
4857 out the stub ones if needed. */
4859 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4861 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4863 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4865 prevDefns
[i
].symbol
= sym
;
4866 prevDefns
[i
].block
= block
;
4872 struct block_symbol info
;
4876 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4880 /* Number of block_symbol structures currently collected in current vector in
4884 num_defns_collected (struct obstack
*obstackp
)
4886 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4889 /* Vector of block_symbol structures currently collected in current vector in
4890 OBSTACKP. If FINISH, close off the vector and return its final address. */
4892 static struct block_symbol
*
4893 defns_collected (struct obstack
*obstackp
, int finish
)
4896 return (struct block_symbol
*) obstack_finish (obstackp
);
4898 return (struct block_symbol
*) obstack_base (obstackp
);
4901 /* Return a bound minimal symbol matching NAME according to Ada
4902 decoding rules. Returns an invalid symbol if there is no such
4903 minimal symbol. Names prefixed with "standard__" are handled
4904 specially: "standard__" is first stripped off, and only static and
4905 global symbols are searched. */
4907 struct bound_minimal_symbol
4908 ada_lookup_simple_minsym (const char *name
)
4910 struct bound_minimal_symbol result
;
4912 memset (&result
, 0, sizeof (result
));
4914 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4915 lookup_name_info
lookup_name (name
, match_type
);
4917 symbol_name_matcher_ftype
*match_name
4918 = ada_get_symbol_name_matcher (lookup_name
);
4920 for (objfile
*objfile
: current_program_space
->objfiles ())
4922 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4924 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4925 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4927 result
.minsym
= msymbol
;
4928 result
.objfile
= objfile
;
4937 /* For all subprograms that statically enclose the subprogram of the
4938 selected frame, add symbols matching identifier NAME in DOMAIN
4939 and their blocks to the list of data in OBSTACKP, as for
4940 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4941 with a wildcard prefix. */
4944 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4945 const lookup_name_info
&lookup_name
,
4950 /* True if TYPE is definitely an artificial type supplied to a symbol
4951 for which no debugging information was given in the symbol file. */
4954 is_nondebugging_type (struct type
*type
)
4956 const char *name
= ada_type_name (type
);
4958 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4961 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4962 that are deemed "identical" for practical purposes.
4964 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4965 types and that their number of enumerals is identical (in other
4966 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4969 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4973 /* The heuristic we use here is fairly conservative. We consider
4974 that 2 enumerate types are identical if they have the same
4975 number of enumerals and that all enumerals have the same
4976 underlying value and name. */
4978 /* All enums in the type should have an identical underlying value. */
4979 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4980 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4983 /* All enumerals should also have the same name (modulo any numerical
4985 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4987 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4988 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4989 int len_1
= strlen (name_1
);
4990 int len_2
= strlen (name_2
);
4992 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4993 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4995 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4996 TYPE_FIELD_NAME (type2
, i
),
5004 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
5005 that are deemed "identical" for practical purposes. Sometimes,
5006 enumerals are not strictly identical, but their types are so similar
5007 that they can be considered identical.
5009 For instance, consider the following code:
5011 type Color is (Black, Red, Green, Blue, White);
5012 type RGB_Color is new Color range Red .. Blue;
5014 Type RGB_Color is a subrange of an implicit type which is a copy
5015 of type Color. If we call that implicit type RGB_ColorB ("B" is
5016 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5017 As a result, when an expression references any of the enumeral
5018 by name (Eg. "print green"), the expression is technically
5019 ambiguous and the user should be asked to disambiguate. But
5020 doing so would only hinder the user, since it wouldn't matter
5021 what choice he makes, the outcome would always be the same.
5022 So, for practical purposes, we consider them as the same. */
5025 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
5029 /* Before performing a thorough comparison check of each type,
5030 we perform a series of inexpensive checks. We expect that these
5031 checks will quickly fail in the vast majority of cases, and thus
5032 help prevent the unnecessary use of a more expensive comparison.
5033 Said comparison also expects us to make some of these checks
5034 (see ada_identical_enum_types_p). */
5036 /* Quick check: All symbols should have an enum type. */
5037 for (i
= 0; i
< syms
.size (); i
++)
5038 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
5041 /* Quick check: They should all have the same value. */
5042 for (i
= 1; i
< syms
.size (); i
++)
5043 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5046 /* Quick check: They should all have the same number of enumerals. */
5047 for (i
= 1; i
< syms
.size (); i
++)
5048 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].symbol
))
5049 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].symbol
)))
5052 /* All the sanity checks passed, so we might have a set of
5053 identical enumeration types. Perform a more complete
5054 comparison of the type of each symbol. */
5055 for (i
= 1; i
< syms
.size (); i
++)
5056 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5057 SYMBOL_TYPE (syms
[0].symbol
)))
5063 /* Remove any non-debugging symbols in SYMS that definitely
5064 duplicate other symbols in the list (The only case I know of where
5065 this happens is when object files containing stabs-in-ecoff are
5066 linked with files containing ordinary ecoff debugging symbols (or no
5067 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5068 Returns the number of items in the modified list. */
5071 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5075 /* We should never be called with less than 2 symbols, as there
5076 cannot be any extra symbol in that case. But it's easy to
5077 handle, since we have nothing to do in that case. */
5078 if (syms
->size () < 2)
5079 return syms
->size ();
5082 while (i
< syms
->size ())
5086 /* If two symbols have the same name and one of them is a stub type,
5087 the get rid of the stub. */
5089 if (TYPE_STUB (SYMBOL_TYPE ((*syms
)[i
].symbol
))
5090 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5092 for (j
= 0; j
< syms
->size (); j
++)
5095 && !TYPE_STUB (SYMBOL_TYPE ((*syms
)[j
].symbol
))
5096 && (*syms
)[j
].symbol
->linkage_name () != NULL
5097 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5098 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5103 /* Two symbols with the same name, same class and same address
5104 should be identical. */
5106 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5107 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5108 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5110 for (j
= 0; j
< syms
->size (); j
+= 1)
5113 && (*syms
)[j
].symbol
->linkage_name () != NULL
5114 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5115 (*syms
)[j
].symbol
->linkage_name ()) == 0
5116 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5117 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5118 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5119 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5125 syms
->erase (syms
->begin () + i
);
5130 /* If all the remaining symbols are identical enumerals, then
5131 just keep the first one and discard the rest.
5133 Unlike what we did previously, we do not discard any entry
5134 unless they are ALL identical. This is because the symbol
5135 comparison is not a strict comparison, but rather a practical
5136 comparison. If all symbols are considered identical, then
5137 we can just go ahead and use the first one and discard the rest.
5138 But if we cannot reduce the list to a single element, we have
5139 to ask the user to disambiguate anyways. And if we have to
5140 present a multiple-choice menu, it's less confusing if the list
5141 isn't missing some choices that were identical and yet distinct. */
5142 if (symbols_are_identical_enums (*syms
))
5145 return syms
->size ();
5148 /* Given a type that corresponds to a renaming entity, use the type name
5149 to extract the scope (package name or function name, fully qualified,
5150 and following the GNAT encoding convention) where this renaming has been
5154 xget_renaming_scope (struct type
*renaming_type
)
5156 /* The renaming types adhere to the following convention:
5157 <scope>__<rename>___<XR extension>.
5158 So, to extract the scope, we search for the "___XR" extension,
5159 and then backtrack until we find the first "__". */
5161 const char *name
= renaming_type
->name ();
5162 const char *suffix
= strstr (name
, "___XR");
5165 /* Now, backtrack a bit until we find the first "__". Start looking
5166 at suffix - 3, as the <rename> part is at least one character long. */
5168 for (last
= suffix
- 3; last
> name
; last
--)
5169 if (last
[0] == '_' && last
[1] == '_')
5172 /* Make a copy of scope and return it. */
5173 return std::string (name
, last
);
5176 /* Return nonzero if NAME corresponds to a package name. */
5179 is_package_name (const char *name
)
5181 /* Here, We take advantage of the fact that no symbols are generated
5182 for packages, while symbols are generated for each function.
5183 So the condition for NAME represent a package becomes equivalent
5184 to NAME not existing in our list of symbols. There is only one
5185 small complication with library-level functions (see below). */
5187 /* If it is a function that has not been defined at library level,
5188 then we should be able to look it up in the symbols. */
5189 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5192 /* Library-level function names start with "_ada_". See if function
5193 "_ada_" followed by NAME can be found. */
5195 /* Do a quick check that NAME does not contain "__", since library-level
5196 functions names cannot contain "__" in them. */
5197 if (strstr (name
, "__") != NULL
)
5200 std::string fun_name
= string_printf ("_ada_%s", name
);
5202 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5205 /* Return nonzero if SYM corresponds to a renaming entity that is
5206 not visible from FUNCTION_NAME. */
5209 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5211 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5214 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5216 /* If the rename has been defined in a package, then it is visible. */
5217 if (is_package_name (scope
.c_str ()))
5220 /* Check that the rename is in the current function scope by checking
5221 that its name starts with SCOPE. */
5223 /* If the function name starts with "_ada_", it means that it is
5224 a library-level function. Strip this prefix before doing the
5225 comparison, as the encoding for the renaming does not contain
5227 if (startswith (function_name
, "_ada_"))
5230 return !startswith (function_name
, scope
.c_str ());
5233 /* Remove entries from SYMS that corresponds to a renaming entity that
5234 is not visible from the function associated with CURRENT_BLOCK or
5235 that is superfluous due to the presence of more specific renaming
5236 information. Places surviving symbols in the initial entries of
5237 SYMS and returns the number of surviving symbols.
5240 First, in cases where an object renaming is implemented as a
5241 reference variable, GNAT may produce both the actual reference
5242 variable and the renaming encoding. In this case, we discard the
5245 Second, GNAT emits a type following a specified encoding for each renaming
5246 entity. Unfortunately, STABS currently does not support the definition
5247 of types that are local to a given lexical block, so all renamings types
5248 are emitted at library level. As a consequence, if an application
5249 contains two renaming entities using the same name, and a user tries to
5250 print the value of one of these entities, the result of the ada symbol
5251 lookup will also contain the wrong renaming type.
5253 This function partially covers for this limitation by attempting to
5254 remove from the SYMS list renaming symbols that should be visible
5255 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5256 method with the current information available. The implementation
5257 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5259 - When the user tries to print a rename in a function while there
5260 is another rename entity defined in a package: Normally, the
5261 rename in the function has precedence over the rename in the
5262 package, so the latter should be removed from the list. This is
5263 currently not the case.
5265 - This function will incorrectly remove valid renames if
5266 the CURRENT_BLOCK corresponds to a function which symbol name
5267 has been changed by an "Export" pragma. As a consequence,
5268 the user will be unable to print such rename entities. */
5271 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5272 const struct block
*current_block
)
5274 struct symbol
*current_function
;
5275 const char *current_function_name
;
5277 int is_new_style_renaming
;
5279 /* If there is both a renaming foo___XR... encoded as a variable and
5280 a simple variable foo in the same block, discard the latter.
5281 First, zero out such symbols, then compress. */
5282 is_new_style_renaming
= 0;
5283 for (i
= 0; i
< syms
->size (); i
+= 1)
5285 struct symbol
*sym
= (*syms
)[i
].symbol
;
5286 const struct block
*block
= (*syms
)[i
].block
;
5290 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5292 name
= sym
->linkage_name ();
5293 suffix
= strstr (name
, "___XR");
5297 int name_len
= suffix
- name
;
5300 is_new_style_renaming
= 1;
5301 for (j
= 0; j
< syms
->size (); j
+= 1)
5302 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5303 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5305 && block
== (*syms
)[j
].block
)
5306 (*syms
)[j
].symbol
= NULL
;
5309 if (is_new_style_renaming
)
5313 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5314 if ((*syms
)[j
].symbol
!= NULL
)
5316 (*syms
)[k
] = (*syms
)[j
];
5322 /* Extract the function name associated to CURRENT_BLOCK.
5323 Abort if unable to do so. */
5325 if (current_block
== NULL
)
5326 return syms
->size ();
5328 current_function
= block_linkage_function (current_block
);
5329 if (current_function
== NULL
)
5330 return syms
->size ();
5332 current_function_name
= current_function
->linkage_name ();
5333 if (current_function_name
== NULL
)
5334 return syms
->size ();
5336 /* Check each of the symbols, and remove it from the list if it is
5337 a type corresponding to a renaming that is out of the scope of
5338 the current block. */
5341 while (i
< syms
->size ())
5343 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5344 == ADA_OBJECT_RENAMING
5345 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5346 current_function_name
))
5347 syms
->erase (syms
->begin () + i
);
5352 return syms
->size ();
5355 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5356 whose name and domain match NAME and DOMAIN respectively.
5357 If no match was found, then extend the search to "enclosing"
5358 routines (in other words, if we're inside a nested function,
5359 search the symbols defined inside the enclosing functions).
5360 If WILD_MATCH_P is nonzero, perform the naming matching in
5361 "wild" mode (see function "wild_match" for more info).
5363 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5366 ada_add_local_symbols (struct obstack
*obstackp
,
5367 const lookup_name_info
&lookup_name
,
5368 const struct block
*block
, domain_enum domain
)
5370 int block_depth
= 0;
5372 while (block
!= NULL
)
5375 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5377 /* If we found a non-function match, assume that's the one. */
5378 if (is_nonfunction (defns_collected (obstackp
, 0),
5379 num_defns_collected (obstackp
)))
5382 block
= BLOCK_SUPERBLOCK (block
);
5385 /* If no luck so far, try to find NAME as a local symbol in some lexically
5386 enclosing subprogram. */
5387 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5388 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5391 /* An object of this type is used as the user_data argument when
5392 calling the map_matching_symbols method. */
5396 struct objfile
*objfile
;
5397 struct obstack
*obstackp
;
5398 struct symbol
*arg_sym
;
5402 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5403 to a list of symbols. DATA is a pointer to a struct match_data *
5404 containing the obstack that collects the symbol list, the file that SYM
5405 must come from, a flag indicating whether a non-argument symbol has
5406 been found in the current block, and the last argument symbol
5407 passed in SYM within the current block (if any). When SYM is null,
5408 marking the end of a block, the argument symbol is added if no
5409 other has been found. */
5412 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5413 struct match_data
*data
)
5415 const struct block
*block
= bsym
->block
;
5416 struct symbol
*sym
= bsym
->symbol
;
5420 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5421 add_defn_to_vec (data
->obstackp
,
5422 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5424 data
->found_sym
= 0;
5425 data
->arg_sym
= NULL
;
5429 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5431 else if (SYMBOL_IS_ARGUMENT (sym
))
5432 data
->arg_sym
= sym
;
5435 data
->found_sym
= 1;
5436 add_defn_to_vec (data
->obstackp
,
5437 fixup_symbol_section (sym
, data
->objfile
),
5444 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5445 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5446 symbols to OBSTACKP. Return whether we found such symbols. */
5449 ada_add_block_renamings (struct obstack
*obstackp
,
5450 const struct block
*block
,
5451 const lookup_name_info
&lookup_name
,
5454 struct using_direct
*renaming
;
5455 int defns_mark
= num_defns_collected (obstackp
);
5457 symbol_name_matcher_ftype
*name_match
5458 = ada_get_symbol_name_matcher (lookup_name
);
5460 for (renaming
= block_using (block
);
5462 renaming
= renaming
->next
)
5466 /* Avoid infinite recursions: skip this renaming if we are actually
5467 already traversing it.
5469 Currently, symbol lookup in Ada don't use the namespace machinery from
5470 C++/Fortran support: skip namespace imports that use them. */
5471 if (renaming
->searched
5472 || (renaming
->import_src
!= NULL
5473 && renaming
->import_src
[0] != '\0')
5474 || (renaming
->import_dest
!= NULL
5475 && renaming
->import_dest
[0] != '\0'))
5477 renaming
->searched
= 1;
5479 /* TODO: here, we perform another name-based symbol lookup, which can
5480 pull its own multiple overloads. In theory, we should be able to do
5481 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5482 not a simple name. But in order to do this, we would need to enhance
5483 the DWARF reader to associate a symbol to this renaming, instead of a
5484 name. So, for now, we do something simpler: re-use the C++/Fortran
5485 namespace machinery. */
5486 r_name
= (renaming
->alias
!= NULL
5488 : renaming
->declaration
);
5489 if (name_match (r_name
, lookup_name
, NULL
))
5491 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5492 lookup_name
.match_type ());
5493 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5496 renaming
->searched
= 0;
5498 return num_defns_collected (obstackp
) != defns_mark
;
5501 /* Implements compare_names, but only applying the comparision using
5502 the given CASING. */
5505 compare_names_with_case (const char *string1
, const char *string2
,
5506 enum case_sensitivity casing
)
5508 while (*string1
!= '\0' && *string2
!= '\0')
5512 if (isspace (*string1
) || isspace (*string2
))
5513 return strcmp_iw_ordered (string1
, string2
);
5515 if (casing
== case_sensitive_off
)
5517 c1
= tolower (*string1
);
5518 c2
= tolower (*string2
);
5535 return strcmp_iw_ordered (string1
, string2
);
5537 if (*string2
== '\0')
5539 if (is_name_suffix (string1
))
5546 if (*string2
== '(')
5547 return strcmp_iw_ordered (string1
, string2
);
5550 if (casing
== case_sensitive_off
)
5551 return tolower (*string1
) - tolower (*string2
);
5553 return *string1
- *string2
;
5558 /* Compare STRING1 to STRING2, with results as for strcmp.
5559 Compatible with strcmp_iw_ordered in that...
5561 strcmp_iw_ordered (STRING1, STRING2) <= 0
5565 compare_names (STRING1, STRING2) <= 0
5567 (they may differ as to what symbols compare equal). */
5570 compare_names (const char *string1
, const char *string2
)
5574 /* Similar to what strcmp_iw_ordered does, we need to perform
5575 a case-insensitive comparison first, and only resort to
5576 a second, case-sensitive, comparison if the first one was
5577 not sufficient to differentiate the two strings. */
5579 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5581 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5586 /* Convenience function to get at the Ada encoded lookup name for
5587 LOOKUP_NAME, as a C string. */
5590 ada_lookup_name (const lookup_name_info
&lookup_name
)
5592 return lookup_name
.ada ().lookup_name ().c_str ();
5595 /* Add to OBSTACKP all non-local symbols whose name and domain match
5596 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5597 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5598 symbols otherwise. */
5601 add_nonlocal_symbols (struct obstack
*obstackp
,
5602 const lookup_name_info
&lookup_name
,
5603 domain_enum domain
, int global
)
5605 struct match_data data
;
5607 memset (&data
, 0, sizeof data
);
5608 data
.obstackp
= obstackp
;
5610 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5612 auto callback
= [&] (struct block_symbol
*bsym
)
5614 return aux_add_nonlocal_symbols (bsym
, &data
);
5617 for (objfile
*objfile
: current_program_space
->objfiles ())
5619 data
.objfile
= objfile
;
5621 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5622 domain
, global
, callback
,
5624 ? NULL
: compare_names
));
5626 for (compunit_symtab
*cu
: objfile
->compunits ())
5628 const struct block
*global_block
5629 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5631 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5637 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5639 const char *name
= ada_lookup_name (lookup_name
);
5640 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5641 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5643 for (objfile
*objfile
: current_program_space
->objfiles ())
5645 data
.objfile
= objfile
;
5646 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5647 domain
, global
, callback
,
5653 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5654 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5655 returning the number of matches. Add these to OBSTACKP.
5657 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5658 symbol match within the nest of blocks whose innermost member is BLOCK,
5659 is the one match returned (no other matches in that or
5660 enclosing blocks is returned). If there are any matches in or
5661 surrounding BLOCK, then these alone are returned.
5663 Names prefixed with "standard__" are handled specially:
5664 "standard__" is first stripped off (by the lookup_name
5665 constructor), and only static and global symbols are searched.
5667 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5668 to lookup global symbols. */
5671 ada_add_all_symbols (struct obstack
*obstackp
,
5672 const struct block
*block
,
5673 const lookup_name_info
&lookup_name
,
5676 int *made_global_lookup_p
)
5680 if (made_global_lookup_p
)
5681 *made_global_lookup_p
= 0;
5683 /* Special case: If the user specifies a symbol name inside package
5684 Standard, do a non-wild matching of the symbol name without
5685 the "standard__" prefix. This was primarily introduced in order
5686 to allow the user to specifically access the standard exceptions
5687 using, for instance, Standard.Constraint_Error when Constraint_Error
5688 is ambiguous (due to the user defining its own Constraint_Error
5689 entity inside its program). */
5690 if (lookup_name
.ada ().standard_p ())
5693 /* Check the non-global symbols. If we have ANY match, then we're done. */
5698 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5701 /* In the !full_search case we're are being called by
5702 ada_iterate_over_symbols, and we don't want to search
5704 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5706 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5710 /* No non-global symbols found. Check our cache to see if we have
5711 already performed this search before. If we have, then return
5714 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5715 domain
, &sym
, &block
))
5718 add_defn_to_vec (obstackp
, sym
, block
);
5722 if (made_global_lookup_p
)
5723 *made_global_lookup_p
= 1;
5725 /* Search symbols from all global blocks. */
5727 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5729 /* Now add symbols from all per-file blocks if we've gotten no hits
5730 (not strictly correct, but perhaps better than an error). */
5732 if (num_defns_collected (obstackp
) == 0)
5733 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5736 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5737 is non-zero, enclosing scope and in global scopes, returning the number of
5739 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5740 found and the blocks and symbol tables (if any) in which they were
5743 When full_search is non-zero, any non-function/non-enumeral
5744 symbol match within the nest of blocks whose innermost member is BLOCK,
5745 is the one match returned (no other matches in that or
5746 enclosing blocks is returned). If there are any matches in or
5747 surrounding BLOCK, then these alone are returned.
5749 Names prefixed with "standard__" are handled specially: "standard__"
5750 is first stripped off, and only static and global symbols are searched. */
5753 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5754 const struct block
*block
,
5756 std::vector
<struct block_symbol
> *results
,
5759 int syms_from_global_search
;
5761 auto_obstack obstack
;
5763 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5764 domain
, full_search
, &syms_from_global_search
);
5766 ndefns
= num_defns_collected (&obstack
);
5768 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5769 for (int i
= 0; i
< ndefns
; ++i
)
5770 results
->push_back (base
[i
]);
5772 ndefns
= remove_extra_symbols (results
);
5774 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5775 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5777 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5778 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5779 (*results
)[0].symbol
, (*results
)[0].block
);
5781 ndefns
= remove_irrelevant_renamings (results
, block
);
5786 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5787 in global scopes, returning the number of matches, and filling *RESULTS
5788 with (SYM,BLOCK) tuples.
5790 See ada_lookup_symbol_list_worker for further details. */
5793 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5795 std::vector
<struct block_symbol
> *results
)
5797 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5798 lookup_name_info
lookup_name (name
, name_match_type
);
5800 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5803 /* Implementation of the la_iterate_over_symbols method. */
5806 ada_iterate_over_symbols
5807 (const struct block
*block
, const lookup_name_info
&name
,
5809 gdb::function_view
<symbol_found_callback_ftype
> callback
)
5812 std::vector
<struct block_symbol
> results
;
5814 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5816 for (i
= 0; i
< ndefs
; ++i
)
5818 if (!callback (&results
[i
]))
5825 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5826 to 1, but choosing the first symbol found if there are multiple
5829 The result is stored in *INFO, which must be non-NULL.
5830 If no match is found, INFO->SYM is set to NULL. */
5833 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5835 struct block_symbol
*info
)
5837 /* Since we already have an encoded name, wrap it in '<>' to force a
5838 verbatim match. Otherwise, if the name happens to not look like
5839 an encoded name (because it doesn't include a "__"),
5840 ada_lookup_name_info would re-encode/fold it again, and that
5841 would e.g., incorrectly lowercase object renaming names like
5842 "R28b" -> "r28b". */
5843 std::string verbatim
= std::string ("<") + name
+ '>';
5845 gdb_assert (info
!= NULL
);
5846 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5849 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5850 scope and in global scopes, or NULL if none. NAME is folded and
5851 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5852 choosing the first symbol if there are multiple choices. */
5855 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5858 std::vector
<struct block_symbol
> candidates
;
5861 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5863 if (n_candidates
== 0)
5866 block_symbol info
= candidates
[0];
5867 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5871 static struct block_symbol
5872 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5874 const struct block
*block
,
5875 const domain_enum domain
)
5877 struct block_symbol sym
;
5879 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
5880 if (sym
.symbol
!= NULL
)
5883 /* If we haven't found a match at this point, try the primitive
5884 types. In other languages, this search is performed before
5885 searching for global symbols in order to short-circuit that
5886 global-symbol search if it happens that the name corresponds
5887 to a primitive type. But we cannot do the same in Ada, because
5888 it is perfectly legitimate for a program to declare a type which
5889 has the same name as a standard type. If looking up a type in
5890 that situation, we have traditionally ignored the primitive type
5891 in favor of user-defined types. This is why, unlike most other
5892 languages, we search the primitive types this late and only after
5893 having searched the global symbols without success. */
5895 if (domain
== VAR_DOMAIN
)
5897 struct gdbarch
*gdbarch
;
5900 gdbarch
= target_gdbarch ();
5902 gdbarch
= block_gdbarch (block
);
5903 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5904 if (sym
.symbol
!= NULL
)
5912 /* True iff STR is a possible encoded suffix of a normal Ada name
5913 that is to be ignored for matching purposes. Suffixes of parallel
5914 names (e.g., XVE) are not included here. Currently, the possible suffixes
5915 are given by any of the regular expressions:
5917 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5918 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5919 TKB [subprogram suffix for task bodies]
5920 _E[0-9]+[bs]$ [protected object entry suffixes]
5921 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5923 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5924 match is performed. This sequence is used to differentiate homonyms,
5925 is an optional part of a valid name suffix. */
5928 is_name_suffix (const char *str
)
5931 const char *matching
;
5932 const int len
= strlen (str
);
5934 /* Skip optional leading __[0-9]+. */
5936 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5939 while (isdigit (str
[0]))
5945 if (str
[0] == '.' || str
[0] == '$')
5948 while (isdigit (matching
[0]))
5950 if (matching
[0] == '\0')
5956 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5959 while (isdigit (matching
[0]))
5961 if (matching
[0] == '\0')
5965 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5967 if (strcmp (str
, "TKB") == 0)
5971 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5972 with a N at the end. Unfortunately, the compiler uses the same
5973 convention for other internal types it creates. So treating
5974 all entity names that end with an "N" as a name suffix causes
5975 some regressions. For instance, consider the case of an enumerated
5976 type. To support the 'Image attribute, it creates an array whose
5978 Having a single character like this as a suffix carrying some
5979 information is a bit risky. Perhaps we should change the encoding
5980 to be something like "_N" instead. In the meantime, do not do
5981 the following check. */
5982 /* Protected Object Subprograms */
5983 if (len
== 1 && str
[0] == 'N')
5988 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5991 while (isdigit (matching
[0]))
5993 if ((matching
[0] == 'b' || matching
[0] == 's')
5994 && matching
[1] == '\0')
5998 /* ??? We should not modify STR directly, as we are doing below. This
5999 is fine in this case, but may become problematic later if we find
6000 that this alternative did not work, and want to try matching
6001 another one from the begining of STR. Since we modified it, we
6002 won't be able to find the begining of the string anymore! */
6006 while (str
[0] != '_' && str
[0] != '\0')
6008 if (str
[0] != 'n' && str
[0] != 'b')
6014 if (str
[0] == '\000')
6019 if (str
[1] != '_' || str
[2] == '\000')
6023 if (strcmp (str
+ 3, "JM") == 0)
6025 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6026 the LJM suffix in favor of the JM one. But we will
6027 still accept LJM as a valid suffix for a reasonable
6028 amount of time, just to allow ourselves to debug programs
6029 compiled using an older version of GNAT. */
6030 if (strcmp (str
+ 3, "LJM") == 0)
6034 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
6035 || str
[4] == 'U' || str
[4] == 'P')
6037 if (str
[4] == 'R' && str
[5] != 'T')
6041 if (!isdigit (str
[2]))
6043 for (k
= 3; str
[k
] != '\0'; k
+= 1)
6044 if (!isdigit (str
[k
]) && str
[k
] != '_')
6048 if (str
[0] == '$' && isdigit (str
[1]))
6050 for (k
= 2; str
[k
] != '\0'; k
+= 1)
6051 if (!isdigit (str
[k
]) && str
[k
] != '_')
6058 /* Return non-zero if the string starting at NAME and ending before
6059 NAME_END contains no capital letters. */
6062 is_valid_name_for_wild_match (const char *name0
)
6064 std::string decoded_name
= ada_decode (name0
);
6067 /* If the decoded name starts with an angle bracket, it means that
6068 NAME0 does not follow the GNAT encoding format. It should then
6069 not be allowed as a possible wild match. */
6070 if (decoded_name
[0] == '<')
6073 for (i
=0; decoded_name
[i
] != '\0'; i
++)
6074 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6080 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6081 that could start a simple name. Assumes that *NAMEP points into
6082 the string beginning at NAME0. */
6085 advance_wild_match (const char **namep
, const char *name0
, int target0
)
6087 const char *name
= *namep
;
6097 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6100 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6105 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6106 || name
[2] == target0
))
6114 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6124 /* Return true iff NAME encodes a name of the form prefix.PATN.
6125 Ignores any informational suffixes of NAME (i.e., for which
6126 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6130 wild_match (const char *name
, const char *patn
)
6133 const char *name0
= name
;
6137 const char *match
= name
;
6141 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6144 if (*p
== '\0' && is_name_suffix (name
))
6145 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6147 if (name
[-1] == '_')
6150 if (!advance_wild_match (&name
, name0
, *patn
))
6155 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6156 any trailing suffixes that encode debugging information or leading
6157 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6158 information that is ignored). */
6161 full_match (const char *sym_name
, const char *search_name
)
6163 size_t search_name_len
= strlen (search_name
);
6165 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6166 && is_name_suffix (sym_name
+ search_name_len
))
6169 if (startswith (sym_name
, "_ada_")
6170 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6171 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6177 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6178 *defn_symbols, updating the list of symbols in OBSTACKP (if
6179 necessary). OBJFILE is the section containing BLOCK. */
6182 ada_add_block_symbols (struct obstack
*obstackp
,
6183 const struct block
*block
,
6184 const lookup_name_info
&lookup_name
,
6185 domain_enum domain
, struct objfile
*objfile
)
6187 struct block_iterator iter
;
6188 /* A matching argument symbol, if any. */
6189 struct symbol
*arg_sym
;
6190 /* Set true when we find a matching non-argument symbol. */
6196 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6198 sym
= block_iter_match_next (lookup_name
, &iter
))
6200 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6202 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6204 if (SYMBOL_IS_ARGUMENT (sym
))
6209 add_defn_to_vec (obstackp
,
6210 fixup_symbol_section (sym
, objfile
),
6217 /* Handle renamings. */
6219 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6222 if (!found_sym
&& arg_sym
!= NULL
)
6224 add_defn_to_vec (obstackp
,
6225 fixup_symbol_section (arg_sym
, objfile
),
6229 if (!lookup_name
.ada ().wild_match_p ())
6233 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6234 const char *name
= ada_lookup_name
.c_str ();
6235 size_t name_len
= ada_lookup_name
.size ();
6237 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6239 if (symbol_matches_domain (sym
->language (),
6240 SYMBOL_DOMAIN (sym
), domain
))
6244 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6247 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6249 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6254 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6256 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6258 if (SYMBOL_IS_ARGUMENT (sym
))
6263 add_defn_to_vec (obstackp
,
6264 fixup_symbol_section (sym
, objfile
),
6272 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6273 They aren't parameters, right? */
6274 if (!found_sym
&& arg_sym
!= NULL
)
6276 add_defn_to_vec (obstackp
,
6277 fixup_symbol_section (arg_sym
, objfile
),
6284 /* Symbol Completion */
6289 ada_lookup_name_info::matches
6290 (const char *sym_name
,
6291 symbol_name_match_type match_type
,
6292 completion_match_result
*comp_match_res
) const
6295 const char *text
= m_encoded_name
.c_str ();
6296 size_t text_len
= m_encoded_name
.size ();
6298 /* First, test against the fully qualified name of the symbol. */
6300 if (strncmp (sym_name
, text
, text_len
) == 0)
6303 std::string decoded_name
= ada_decode (sym_name
);
6304 if (match
&& !m_encoded_p
)
6306 /* One needed check before declaring a positive match is to verify
6307 that iff we are doing a verbatim match, the decoded version
6308 of the symbol name starts with '<'. Otherwise, this symbol name
6309 is not a suitable completion. */
6311 bool has_angle_bracket
= (decoded_name
[0] == '<');
6312 match
= (has_angle_bracket
== m_verbatim_p
);
6315 if (match
&& !m_verbatim_p
)
6317 /* When doing non-verbatim match, another check that needs to
6318 be done is to verify that the potentially matching symbol name
6319 does not include capital letters, because the ada-mode would
6320 not be able to understand these symbol names without the
6321 angle bracket notation. */
6324 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6329 /* Second: Try wild matching... */
6331 if (!match
&& m_wild_match_p
)
6333 /* Since we are doing wild matching, this means that TEXT
6334 may represent an unqualified symbol name. We therefore must
6335 also compare TEXT against the unqualified name of the symbol. */
6336 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6338 if (strncmp (sym_name
, text
, text_len
) == 0)
6342 /* Finally: If we found a match, prepare the result to return. */
6347 if (comp_match_res
!= NULL
)
6349 std::string
&match_str
= comp_match_res
->match
.storage ();
6352 match_str
= ada_decode (sym_name
);
6356 match_str
= add_angle_brackets (sym_name
);
6358 match_str
= sym_name
;
6362 comp_match_res
->set_match (match_str
.c_str ());
6368 /* Add the list of possible symbol names completing TEXT to TRACKER.
6369 WORD is the entire command on which completion is made. */
6372 ada_collect_symbol_completion_matches (completion_tracker
&tracker
,
6373 complete_symbol_mode mode
,
6374 symbol_name_match_type name_match_type
,
6375 const char *text
, const char *word
,
6376 enum type_code code
)
6379 const struct block
*b
, *surrounding_static_block
= 0;
6380 struct block_iterator iter
;
6382 gdb_assert (code
== TYPE_CODE_UNDEF
);
6384 lookup_name_info
lookup_name (text
, name_match_type
, true);
6386 /* First, look at the partial symtab symbols. */
6387 expand_symtabs_matching (NULL
,
6393 /* At this point scan through the misc symbol vectors and add each
6394 symbol you find to the list. Eventually we want to ignore
6395 anything that isn't a text symbol (everything else will be
6396 handled by the psymtab code above). */
6398 for (objfile
*objfile
: current_program_space
->objfiles ())
6400 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
6404 if (completion_skip_symbol (mode
, msymbol
))
6407 language symbol_language
= msymbol
->language ();
6409 /* Ada minimal symbols won't have their language set to Ada. If
6410 we let completion_list_add_name compare using the
6411 default/C-like matcher, then when completing e.g., symbols in a
6412 package named "pck", we'd match internal Ada symbols like
6413 "pckS", which are invalid in an Ada expression, unless you wrap
6414 them in '<' '>' to request a verbatim match.
6416 Unfortunately, some Ada encoded names successfully demangle as
6417 C++ symbols (using an old mangling scheme), such as "name__2Xn"
6418 -> "Xn::name(void)" and thus some Ada minimal symbols end up
6419 with the wrong language set. Paper over that issue here. */
6420 if (symbol_language
== language_auto
6421 || symbol_language
== language_cplus
)
6422 symbol_language
= language_ada
;
6424 completion_list_add_name (tracker
,
6426 msymbol
->linkage_name (),
6427 lookup_name
, text
, word
);
6431 /* Search upwards from currently selected frame (so that we can
6432 complete on local vars. */
6434 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6436 if (!BLOCK_SUPERBLOCK (b
))
6437 surrounding_static_block
= b
; /* For elmin of dups */
6439 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6441 if (completion_skip_symbol (mode
, sym
))
6444 completion_list_add_name (tracker
,
6446 sym
->linkage_name (),
6447 lookup_name
, text
, word
);
6451 /* Go through the symtabs and check the externs and statics for
6452 symbols which match. */
6454 for (objfile
*objfile
: current_program_space
->objfiles ())
6456 for (compunit_symtab
*s
: objfile
->compunits ())
6459 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6460 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6462 if (completion_skip_symbol (mode
, sym
))
6465 completion_list_add_name (tracker
,
6467 sym
->linkage_name (),
6468 lookup_name
, text
, word
);
6473 for (objfile
*objfile
: current_program_space
->objfiles ())
6475 for (compunit_symtab
*s
: objfile
->compunits ())
6478 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6479 /* Don't do this block twice. */
6480 if (b
== surrounding_static_block
)
6482 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6484 if (completion_skip_symbol (mode
, sym
))
6487 completion_list_add_name (tracker
,
6489 sym
->linkage_name (),
6490 lookup_name
, text
, word
);
6498 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6499 for tagged types. */
6502 ada_is_dispatch_table_ptr_type (struct type
*type
)
6506 if (type
->code () != TYPE_CODE_PTR
)
6509 name
= TYPE_TARGET_TYPE (type
)->name ();
6513 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6516 /* Return non-zero if TYPE is an interface tag. */
6519 ada_is_interface_tag (struct type
*type
)
6521 const char *name
= type
->name ();
6526 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6529 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6530 to be invisible to users. */
6533 ada_is_ignored_field (struct type
*type
, int field_num
)
6535 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6538 /* Check the name of that field. */
6540 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6542 /* Anonymous field names should not be printed.
6543 brobecker/2007-02-20: I don't think this can actually happen
6544 but we don't want to print the value of anonymous fields anyway. */
6548 /* Normally, fields whose name start with an underscore ("_")
6549 are fields that have been internally generated by the compiler,
6550 and thus should not be printed. The "_parent" field is special,
6551 however: This is a field internally generated by the compiler
6552 for tagged types, and it contains the components inherited from
6553 the parent type. This field should not be printed as is, but
6554 should not be ignored either. */
6555 if (name
[0] == '_' && !startswith (name
, "_parent"))
6559 /* If this is the dispatch table of a tagged type or an interface tag,
6561 if (ada_is_tagged_type (type
, 1)
6562 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6563 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6566 /* Not a special field, so it should not be ignored. */
6570 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6571 pointer or reference type whose ultimate target has a tag field. */
6574 ada_is_tagged_type (struct type
*type
, int refok
)
6576 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6579 /* True iff TYPE represents the type of X'Tag */
6582 ada_is_tag_type (struct type
*type
)
6584 type
= ada_check_typedef (type
);
6586 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6590 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6592 return (name
!= NULL
6593 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6597 /* The type of the tag on VAL. */
6599 static struct type
*
6600 ada_tag_type (struct value
*val
)
6602 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6605 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6606 retired at Ada 05). */
6609 is_ada95_tag (struct value
*tag
)
6611 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6614 /* The value of the tag on VAL. */
6616 static struct value
*
6617 ada_value_tag (struct value
*val
)
6619 return ada_value_struct_elt (val
, "_tag", 0);
6622 /* The value of the tag on the object of type TYPE whose contents are
6623 saved at VALADDR, if it is non-null, or is at memory address
6626 static struct value
*
6627 value_tag_from_contents_and_address (struct type
*type
,
6628 const gdb_byte
*valaddr
,
6631 int tag_byte_offset
;
6632 struct type
*tag_type
;
6634 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6637 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6639 : valaddr
+ tag_byte_offset
);
6640 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6642 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6647 static struct type
*
6648 type_from_tag (struct value
*tag
)
6650 const char *type_name
= ada_tag_name (tag
);
6652 if (type_name
!= NULL
)
6653 return ada_find_any_type (ada_encode (type_name
));
6657 /* Given a value OBJ of a tagged type, return a value of this
6658 type at the base address of the object. The base address, as
6659 defined in Ada.Tags, it is the address of the primary tag of
6660 the object, and therefore where the field values of its full
6661 view can be fetched. */
6664 ada_tag_value_at_base_address (struct value
*obj
)
6667 LONGEST offset_to_top
= 0;
6668 struct type
*ptr_type
, *obj_type
;
6670 CORE_ADDR base_address
;
6672 obj_type
= value_type (obj
);
6674 /* It is the responsability of the caller to deref pointers. */
6676 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6679 tag
= ada_value_tag (obj
);
6683 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6685 if (is_ada95_tag (tag
))
6688 ptr_type
= language_lookup_primitive_type
6689 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6690 ptr_type
= lookup_pointer_type (ptr_type
);
6691 val
= value_cast (ptr_type
, tag
);
6695 /* It is perfectly possible that an exception be raised while
6696 trying to determine the base address, just like for the tag;
6697 see ada_tag_name for more details. We do not print the error
6698 message for the same reason. */
6702 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6705 catch (const gdb_exception_error
&e
)
6710 /* If offset is null, nothing to do. */
6712 if (offset_to_top
== 0)
6715 /* -1 is a special case in Ada.Tags; however, what should be done
6716 is not quite clear from the documentation. So do nothing for
6719 if (offset_to_top
== -1)
6722 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6723 from the base address. This was however incompatible with
6724 C++ dispatch table: C++ uses a *negative* value to *add*
6725 to the base address. Ada's convention has therefore been
6726 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6727 use the same convention. Here, we support both cases by
6728 checking the sign of OFFSET_TO_TOP. */
6730 if (offset_to_top
> 0)
6731 offset_to_top
= -offset_to_top
;
6733 base_address
= value_address (obj
) + offset_to_top
;
6734 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6736 /* Make sure that we have a proper tag at the new address.
6737 Otherwise, offset_to_top is bogus (which can happen when
6738 the object is not initialized yet). */
6743 obj_type
= type_from_tag (tag
);
6748 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6751 /* Return the "ada__tags__type_specific_data" type. */
6753 static struct type
*
6754 ada_get_tsd_type (struct inferior
*inf
)
6756 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6758 if (data
->tsd_type
== 0)
6759 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6760 return data
->tsd_type
;
6763 /* Return the TSD (type-specific data) associated to the given TAG.
6764 TAG is assumed to be the tag of a tagged-type entity.
6766 May return NULL if we are unable to get the TSD. */
6768 static struct value
*
6769 ada_get_tsd_from_tag (struct value
*tag
)
6774 /* First option: The TSD is simply stored as a field of our TAG.
6775 Only older versions of GNAT would use this format, but we have
6776 to test it first, because there are no visible markers for
6777 the current approach except the absence of that field. */
6779 val
= ada_value_struct_elt (tag
, "tsd", 1);
6783 /* Try the second representation for the dispatch table (in which
6784 there is no explicit 'tsd' field in the referent of the tag pointer,
6785 and instead the tsd pointer is stored just before the dispatch
6788 type
= ada_get_tsd_type (current_inferior());
6791 type
= lookup_pointer_type (lookup_pointer_type (type
));
6792 val
= value_cast (type
, tag
);
6795 return value_ind (value_ptradd (val
, -1));
6798 /* Given the TSD of a tag (type-specific data), return a string
6799 containing the name of the associated type.
6801 The returned value is good until the next call. May return NULL
6802 if we are unable to determine the tag name. */
6805 ada_tag_name_from_tsd (struct value
*tsd
)
6807 static char name
[1024];
6811 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6814 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6815 for (p
= name
; *p
!= '\0'; p
+= 1)
6821 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6824 Return NULL if the TAG is not an Ada tag, or if we were unable to
6825 determine the name of that tag. The result is good until the next
6829 ada_tag_name (struct value
*tag
)
6833 if (!ada_is_tag_type (value_type (tag
)))
6836 /* It is perfectly possible that an exception be raised while trying
6837 to determine the TAG's name, even under normal circumstances:
6838 The associated variable may be uninitialized or corrupted, for
6839 instance. We do not let any exception propagate past this point.
6840 instead we return NULL.
6842 We also do not print the error message either (which often is very
6843 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6844 the caller print a more meaningful message if necessary. */
6847 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6850 name
= ada_tag_name_from_tsd (tsd
);
6852 catch (const gdb_exception_error
&e
)
6859 /* The parent type of TYPE, or NULL if none. */
6862 ada_parent_type (struct type
*type
)
6866 type
= ada_check_typedef (type
);
6868 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6871 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6872 if (ada_is_parent_field (type
, i
))
6874 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6876 /* If the _parent field is a pointer, then dereference it. */
6877 if (parent_type
->code () == TYPE_CODE_PTR
)
6878 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6879 /* If there is a parallel XVS type, get the actual base type. */
6880 parent_type
= ada_get_base_type (parent_type
);
6882 return ada_check_typedef (parent_type
);
6888 /* True iff field number FIELD_NUM of structure type TYPE contains the
6889 parent-type (inherited) fields of a derived type. Assumes TYPE is
6890 a structure type with at least FIELD_NUM+1 fields. */
6893 ada_is_parent_field (struct type
*type
, int field_num
)
6895 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6897 return (name
!= NULL
6898 && (startswith (name
, "PARENT")
6899 || startswith (name
, "_parent")));
6902 /* True iff field number FIELD_NUM of structure type TYPE is a
6903 transparent wrapper field (which should be silently traversed when doing
6904 field selection and flattened when printing). Assumes TYPE is a
6905 structure type with at least FIELD_NUM+1 fields. Such fields are always
6909 ada_is_wrapper_field (struct type
*type
, int field_num
)
6911 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6913 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6915 /* This happens in functions with "out" or "in out" parameters
6916 which are passed by copy. For such functions, GNAT describes
6917 the function's return type as being a struct where the return
6918 value is in a field called RETVAL, and where the other "out"
6919 or "in out" parameters are fields of that struct. This is not
6924 return (name
!= NULL
6925 && (startswith (name
, "PARENT")
6926 || strcmp (name
, "REP") == 0
6927 || startswith (name
, "_parent")
6928 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6931 /* True iff field number FIELD_NUM of structure or union type TYPE
6932 is a variant wrapper. Assumes TYPE is a structure type with at least
6933 FIELD_NUM+1 fields. */
6936 ada_is_variant_part (struct type
*type
, int field_num
)
6938 /* Only Ada types are eligible. */
6939 if (!ADA_TYPE_P (type
))
6942 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6944 return (field_type
->code () == TYPE_CODE_UNION
6945 || (is_dynamic_field (type
, field_num
)
6946 && (TYPE_TARGET_TYPE (field_type
)->code ()
6947 == TYPE_CODE_UNION
)));
6950 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6951 whose discriminants are contained in the record type OUTER_TYPE,
6952 returns the type of the controlling discriminant for the variant.
6953 May return NULL if the type could not be found. */
6956 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6958 const char *name
= ada_variant_discrim_name (var_type
);
6960 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6963 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6964 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6965 represents a 'when others' clause; otherwise 0. */
6968 ada_is_others_clause (struct type
*type
, int field_num
)
6970 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6972 return (name
!= NULL
&& name
[0] == 'O');
6975 /* Assuming that TYPE0 is the type of the variant part of a record,
6976 returns the name of the discriminant controlling the variant.
6977 The value is valid until the next call to ada_variant_discrim_name. */
6980 ada_variant_discrim_name (struct type
*type0
)
6982 static char *result
= NULL
;
6983 static size_t result_len
= 0;
6986 const char *discrim_end
;
6987 const char *discrim_start
;
6989 if (type0
->code () == TYPE_CODE_PTR
)
6990 type
= TYPE_TARGET_TYPE (type0
);
6994 name
= ada_type_name (type
);
6996 if (name
== NULL
|| name
[0] == '\000')
6999 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
7002 if (startswith (discrim_end
, "___XVN"))
7005 if (discrim_end
== name
)
7008 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
7011 if (discrim_start
== name
+ 1)
7013 if ((discrim_start
> name
+ 3
7014 && startswith (discrim_start
- 3, "___"))
7015 || discrim_start
[-1] == '.')
7019 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
7020 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
7021 result
[discrim_end
- discrim_start
] = '\0';
7025 /* Scan STR for a subtype-encoded number, beginning at position K.
7026 Put the position of the character just past the number scanned in
7027 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7028 Return 1 if there was a valid number at the given position, and 0
7029 otherwise. A "subtype-encoded" number consists of the absolute value
7030 in decimal, followed by the letter 'm' to indicate a negative number.
7031 Assumes 0m does not occur. */
7034 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
7038 if (!isdigit (str
[k
]))
7041 /* Do it the hard way so as not to make any assumption about
7042 the relationship of unsigned long (%lu scan format code) and
7045 while (isdigit (str
[k
]))
7047 RU
= RU
* 10 + (str
[k
] - '0');
7054 *R
= (-(LONGEST
) (RU
- 1)) - 1;
7060 /* NOTE on the above: Technically, C does not say what the results of
7061 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7062 number representable as a LONGEST (although either would probably work
7063 in most implementations). When RU>0, the locution in the then branch
7064 above is always equivalent to the negative of RU. */
7071 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7072 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7073 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7076 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
7078 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7092 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
7102 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
7103 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7105 if (val
>= L
&& val
<= U
)
7117 /* FIXME: Lots of redundancy below. Try to consolidate. */
7119 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7120 ARG_TYPE, extract and return the value of one of its (non-static)
7121 fields. FIELDNO says which field. Differs from value_primitive_field
7122 only in that it can handle packed values of arbitrary type. */
7125 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7126 struct type
*arg_type
)
7130 arg_type
= ada_check_typedef (arg_type
);
7131 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
7133 /* Handle packed fields. It might be that the field is not packed
7134 relative to its containing structure, but the structure itself is
7135 packed; in this case we must take the bit-field path. */
7136 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
7138 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7139 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7141 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7142 offset
+ bit_pos
/ 8,
7143 bit_pos
% 8, bit_size
, type
);
7146 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7149 /* Find field with name NAME in object of type TYPE. If found,
7150 set the following for each argument that is non-null:
7151 - *FIELD_TYPE_P to the field's type;
7152 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7153 an object of that type;
7154 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7155 - *BIT_SIZE_P to its size in bits if the field is packed, and
7157 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7158 fields up to but not including the desired field, or by the total
7159 number of fields if not found. A NULL value of NAME never
7160 matches; the function just counts visible fields in this case.
7162 Notice that we need to handle when a tagged record hierarchy
7163 has some components with the same name, like in this scenario:
7165 type Top_T is tagged record
7171 type Middle_T is new Top.Top_T with record
7172 N : Character := 'a';
7176 type Bottom_T is new Middle.Middle_T with record
7178 C : Character := '5';
7180 A : Character := 'J';
7183 Let's say we now have a variable declared and initialized as follow:
7185 TC : Top_A := new Bottom_T;
7187 And then we use this variable to call this function
7189 procedure Assign (Obj: in out Top_T; TV : Integer);
7193 Assign (Top_T (B), 12);
7195 Now, we're in the debugger, and we're inside that procedure
7196 then and we want to print the value of obj.c:
7198 Usually, the tagged record or one of the parent type owns the
7199 component to print and there's no issue but in this particular
7200 case, what does it mean to ask for Obj.C? Since the actual
7201 type for object is type Bottom_T, it could mean two things: type
7202 component C from the Middle_T view, but also component C from
7203 Bottom_T. So in that "undefined" case, when the component is
7204 not found in the non-resolved type (which includes all the
7205 components of the parent type), then resolve it and see if we
7206 get better luck once expanded.
7208 In the case of homonyms in the derived tagged type, we don't
7209 guaranty anything, and pick the one that's easiest for us
7212 Returns 1 if found, 0 otherwise. */
7215 find_struct_field (const char *name
, struct type
*type
, int offset
,
7216 struct type
**field_type_p
,
7217 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7221 int parent_offset
= -1;
7223 type
= ada_check_typedef (type
);
7225 if (field_type_p
!= NULL
)
7226 *field_type_p
= NULL
;
7227 if (byte_offset_p
!= NULL
)
7229 if (bit_offset_p
!= NULL
)
7231 if (bit_size_p
!= NULL
)
7234 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7236 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7237 int fld_offset
= offset
+ bit_pos
/ 8;
7238 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7240 if (t_field_name
== NULL
)
7243 else if (ada_is_parent_field (type
, i
))
7245 /* This is a field pointing us to the parent type of a tagged
7246 type. As hinted in this function's documentation, we give
7247 preference to fields in the current record first, so what
7248 we do here is just record the index of this field before
7249 we skip it. If it turns out we couldn't find our field
7250 in the current record, then we'll get back to it and search
7251 inside it whether the field might exist in the parent. */
7257 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7259 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7261 if (field_type_p
!= NULL
)
7262 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7263 if (byte_offset_p
!= NULL
)
7264 *byte_offset_p
= fld_offset
;
7265 if (bit_offset_p
!= NULL
)
7266 *bit_offset_p
= bit_pos
% 8;
7267 if (bit_size_p
!= NULL
)
7268 *bit_size_p
= bit_size
;
7271 else if (ada_is_wrapper_field (type
, i
))
7273 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7274 field_type_p
, byte_offset_p
, bit_offset_p
,
7275 bit_size_p
, index_p
))
7278 else if (ada_is_variant_part (type
, i
))
7280 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7283 struct type
*field_type
7284 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7286 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7288 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7290 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7291 field_type_p
, byte_offset_p
,
7292 bit_offset_p
, bit_size_p
, index_p
))
7296 else if (index_p
!= NULL
)
7300 /* Field not found so far. If this is a tagged type which
7301 has a parent, try finding that field in the parent now. */
7303 if (parent_offset
!= -1)
7305 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7306 int fld_offset
= offset
+ bit_pos
/ 8;
7308 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, parent_offset
),
7309 fld_offset
, field_type_p
, byte_offset_p
,
7310 bit_offset_p
, bit_size_p
, index_p
))
7317 /* Number of user-visible fields in record type TYPE. */
7320 num_visible_fields (struct type
*type
)
7325 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7329 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7330 and search in it assuming it has (class) type TYPE.
7331 If found, return value, else return NULL.
7333 Searches recursively through wrapper fields (e.g., '_parent').
7335 In the case of homonyms in the tagged types, please refer to the
7336 long explanation in find_struct_field's function documentation. */
7338 static struct value
*
7339 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7343 int parent_offset
= -1;
7345 type
= ada_check_typedef (type
);
7346 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7348 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7350 if (t_field_name
== NULL
)
7353 else if (ada_is_parent_field (type
, i
))
7355 /* This is a field pointing us to the parent type of a tagged
7356 type. As hinted in this function's documentation, we give
7357 preference to fields in the current record first, so what
7358 we do here is just record the index of this field before
7359 we skip it. If it turns out we couldn't find our field
7360 in the current record, then we'll get back to it and search
7361 inside it whether the field might exist in the parent. */
7367 else if (field_name_match (t_field_name
, name
))
7368 return ada_value_primitive_field (arg
, offset
, i
, type
);
7370 else if (ada_is_wrapper_field (type
, i
))
7372 struct value
*v
= /* Do not let indent join lines here. */
7373 ada_search_struct_field (name
, arg
,
7374 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7375 TYPE_FIELD_TYPE (type
, i
));
7381 else if (ada_is_variant_part (type
, i
))
7383 /* PNH: Do we ever get here? See find_struct_field. */
7385 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7387 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7389 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7391 struct value
*v
= ada_search_struct_field
/* Force line
7394 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7395 TYPE_FIELD_TYPE (field_type
, j
));
7403 /* Field not found so far. If this is a tagged type which
7404 has a parent, try finding that field in the parent now. */
7406 if (parent_offset
!= -1)
7408 struct value
*v
= ada_search_struct_field (
7409 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7410 TYPE_FIELD_TYPE (type
, parent_offset
));
7419 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7420 int, struct type
*);
7423 /* Return field #INDEX in ARG, where the index is that returned by
7424 * find_struct_field through its INDEX_P argument. Adjust the address
7425 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7426 * If found, return value, else return NULL. */
7428 static struct value
*
7429 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7432 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7436 /* Auxiliary function for ada_index_struct_field. Like
7437 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7440 static struct value
*
7441 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7445 type
= ada_check_typedef (type
);
7447 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7449 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7451 else if (ada_is_wrapper_field (type
, i
))
7453 struct value
*v
= /* Do not let indent join lines here. */
7454 ada_index_struct_field_1 (index_p
, arg
,
7455 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7456 TYPE_FIELD_TYPE (type
, i
));
7462 else if (ada_is_variant_part (type
, i
))
7464 /* PNH: Do we ever get here? See ada_search_struct_field,
7465 find_struct_field. */
7466 error (_("Cannot assign this kind of variant record"));
7468 else if (*index_p
== 0)
7469 return ada_value_primitive_field (arg
, offset
, i
, type
);
7476 /* Return a string representation of type TYPE. */
7479 type_as_string (struct type
*type
)
7481 string_file tmp_stream
;
7483 type_print (type
, "", &tmp_stream
, -1);
7485 return std::move (tmp_stream
.string ());
7488 /* Given a type TYPE, look up the type of the component of type named NAME.
7489 If DISPP is non-null, add its byte displacement from the beginning of a
7490 structure (pointed to by a value) of type TYPE to *DISPP (does not
7491 work for packed fields).
7493 Matches any field whose name has NAME as a prefix, possibly
7496 TYPE can be either a struct or union. If REFOK, TYPE may also
7497 be a (pointer or reference)+ to a struct or union, and the
7498 ultimate target type will be searched.
7500 Looks recursively into variant clauses and parent types.
7502 In the case of homonyms in the tagged types, please refer to the
7503 long explanation in find_struct_field's function documentation.
7505 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7506 TYPE is not a type of the right kind. */
7508 static struct type
*
7509 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7513 int parent_offset
= -1;
7518 if (refok
&& type
!= NULL
)
7521 type
= ada_check_typedef (type
);
7522 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7524 type
= TYPE_TARGET_TYPE (type
);
7528 || (type
->code () != TYPE_CODE_STRUCT
7529 && type
->code () != TYPE_CODE_UNION
))
7534 error (_("Type %s is not a structure or union type"),
7535 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7538 type
= to_static_fixed_type (type
);
7540 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7542 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7545 if (t_field_name
== NULL
)
7548 else if (ada_is_parent_field (type
, i
))
7550 /* This is a field pointing us to the parent type of a tagged
7551 type. As hinted in this function's documentation, we give
7552 preference to fields in the current record first, so what
7553 we do here is just record the index of this field before
7554 we skip it. If it turns out we couldn't find our field
7555 in the current record, then we'll get back to it and search
7556 inside it whether the field might exist in the parent. */
7562 else if (field_name_match (t_field_name
, name
))
7563 return TYPE_FIELD_TYPE (type
, i
);
7565 else if (ada_is_wrapper_field (type
, i
))
7567 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7573 else if (ada_is_variant_part (type
, i
))
7576 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7579 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7581 /* FIXME pnh 2008/01/26: We check for a field that is
7582 NOT wrapped in a struct, since the compiler sometimes
7583 generates these for unchecked variant types. Revisit
7584 if the compiler changes this practice. */
7585 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7587 if (v_field_name
!= NULL
7588 && field_name_match (v_field_name
, name
))
7589 t
= TYPE_FIELD_TYPE (field_type
, j
);
7591 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7602 /* Field not found so far. If this is a tagged type which
7603 has a parent, try finding that field in the parent now. */
7605 if (parent_offset
!= -1)
7609 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, parent_offset
),
7618 const char *name_str
= name
!= NULL
? name
: _("<null>");
7620 error (_("Type %s has no component named %s"),
7621 type_as_string (type
).c_str (), name_str
);
7627 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7628 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7629 represents an unchecked union (that is, the variant part of a
7630 record that is named in an Unchecked_Union pragma). */
7633 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7635 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7637 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7641 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7642 within OUTER, determine which variant clause (field number in VAR_TYPE,
7643 numbering from 0) is applicable. Returns -1 if none are. */
7646 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7650 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7651 struct value
*discrim
;
7652 LONGEST discrim_val
;
7654 /* Using plain value_from_contents_and_address here causes problems
7655 because we will end up trying to resolve a type that is currently
7656 being constructed. */
7657 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7658 if (discrim
== NULL
)
7660 discrim_val
= value_as_long (discrim
);
7663 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7665 if (ada_is_others_clause (var_type
, i
))
7667 else if (ada_in_variant (discrim_val
, var_type
, i
))
7671 return others_clause
;
7676 /* Dynamic-Sized Records */
7678 /* Strategy: The type ostensibly attached to a value with dynamic size
7679 (i.e., a size that is not statically recorded in the debugging
7680 data) does not accurately reflect the size or layout of the value.
7681 Our strategy is to convert these values to values with accurate,
7682 conventional types that are constructed on the fly. */
7684 /* There is a subtle and tricky problem here. In general, we cannot
7685 determine the size of dynamic records without its data. However,
7686 the 'struct value' data structure, which GDB uses to represent
7687 quantities in the inferior process (the target), requires the size
7688 of the type at the time of its allocation in order to reserve space
7689 for GDB's internal copy of the data. That's why the
7690 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7691 rather than struct value*s.
7693 However, GDB's internal history variables ($1, $2, etc.) are
7694 struct value*s containing internal copies of the data that are not, in
7695 general, the same as the data at their corresponding addresses in
7696 the target. Fortunately, the types we give to these values are all
7697 conventional, fixed-size types (as per the strategy described
7698 above), so that we don't usually have to perform the
7699 'to_fixed_xxx_type' conversions to look at their values.
7700 Unfortunately, there is one exception: if one of the internal
7701 history variables is an array whose elements are unconstrained
7702 records, then we will need to create distinct fixed types for each
7703 element selected. */
7705 /* The upshot of all of this is that many routines take a (type, host
7706 address, target address) triple as arguments to represent a value.
7707 The host address, if non-null, is supposed to contain an internal
7708 copy of the relevant data; otherwise, the program is to consult the
7709 target at the target address. */
7711 /* Assuming that VAL0 represents a pointer value, the result of
7712 dereferencing it. Differs from value_ind in its treatment of
7713 dynamic-sized types. */
7716 ada_value_ind (struct value
*val0
)
7718 struct value
*val
= value_ind (val0
);
7720 if (ada_is_tagged_type (value_type (val
), 0))
7721 val
= ada_tag_value_at_base_address (val
);
7723 return ada_to_fixed_value (val
);
7726 /* The value resulting from dereferencing any "reference to"
7727 qualifiers on VAL0. */
7729 static struct value
*
7730 ada_coerce_ref (struct value
*val0
)
7732 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7734 struct value
*val
= val0
;
7736 val
= coerce_ref (val
);
7738 if (ada_is_tagged_type (value_type (val
), 0))
7739 val
= ada_tag_value_at_base_address (val
);
7741 return ada_to_fixed_value (val
);
7747 /* Return the bit alignment required for field #F of template type TYPE. */
7750 field_alignment (struct type
*type
, int f
)
7752 const char *name
= TYPE_FIELD_NAME (type
, f
);
7756 /* The field name should never be null, unless the debugging information
7757 is somehow malformed. In this case, we assume the field does not
7758 require any alignment. */
7762 len
= strlen (name
);
7764 if (!isdigit (name
[len
- 1]))
7767 if (isdigit (name
[len
- 2]))
7768 align_offset
= len
- 2;
7770 align_offset
= len
- 1;
7772 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7773 return TARGET_CHAR_BIT
;
7775 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7778 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7780 static struct symbol
*
7781 ada_find_any_type_symbol (const char *name
)
7785 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7786 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7789 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7793 /* Find a type named NAME. Ignores ambiguity. This routine will look
7794 solely for types defined by debug info, it will not search the GDB
7797 static struct type
*
7798 ada_find_any_type (const char *name
)
7800 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7803 return SYMBOL_TYPE (sym
);
7808 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7809 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7810 symbol, in which case it is returned. Otherwise, this looks for
7811 symbols whose name is that of NAME_SYM suffixed with "___XR".
7812 Return symbol if found, and NULL otherwise. */
7815 ada_is_renaming_symbol (struct symbol
*name_sym
)
7817 const char *name
= name_sym
->linkage_name ();
7818 return strstr (name
, "___XR") != NULL
;
7821 /* Because of GNAT encoding conventions, several GDB symbols may match a
7822 given type name. If the type denoted by TYPE0 is to be preferred to
7823 that of TYPE1 for purposes of type printing, return non-zero;
7824 otherwise return 0. */
7827 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7831 else if (type0
== NULL
)
7833 else if (type1
->code () == TYPE_CODE_VOID
)
7835 else if (type0
->code () == TYPE_CODE_VOID
)
7837 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7839 else if (ada_is_constrained_packed_array_type (type0
))
7841 else if (ada_is_array_descriptor_type (type0
)
7842 && !ada_is_array_descriptor_type (type1
))
7846 const char *type0_name
= type0
->name ();
7847 const char *type1_name
= type1
->name ();
7849 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7850 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7856 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7860 ada_type_name (struct type
*type
)
7864 return type
->name ();
7867 /* Search the list of "descriptive" types associated to TYPE for a type
7868 whose name is NAME. */
7870 static struct type
*
7871 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7873 struct type
*result
, *tmp
;
7875 if (ada_ignore_descriptive_types_p
)
7878 /* If there no descriptive-type info, then there is no parallel type
7880 if (!HAVE_GNAT_AUX_INFO (type
))
7883 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7884 while (result
!= NULL
)
7886 const char *result_name
= ada_type_name (result
);
7888 if (result_name
== NULL
)
7890 warning (_("unexpected null name on descriptive type"));
7894 /* If the names match, stop. */
7895 if (strcmp (result_name
, name
) == 0)
7898 /* Otherwise, look at the next item on the list, if any. */
7899 if (HAVE_GNAT_AUX_INFO (result
))
7900 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7904 /* If not found either, try after having resolved the typedef. */
7909 result
= check_typedef (result
);
7910 if (HAVE_GNAT_AUX_INFO (result
))
7911 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7917 /* If we didn't find a match, see whether this is a packed array. With
7918 older compilers, the descriptive type information is either absent or
7919 irrelevant when it comes to packed arrays so the above lookup fails.
7920 Fall back to using a parallel lookup by name in this case. */
7921 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7922 return ada_find_any_type (name
);
7927 /* Find a parallel type to TYPE with the specified NAME, using the
7928 descriptive type taken from the debugging information, if available,
7929 and otherwise using the (slower) name-based method. */
7931 static struct type
*
7932 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7934 struct type
*result
= NULL
;
7936 if (HAVE_GNAT_AUX_INFO (type
))
7937 result
= find_parallel_type_by_descriptive_type (type
, name
);
7939 result
= ada_find_any_type (name
);
7944 /* Same as above, but specify the name of the parallel type by appending
7945 SUFFIX to the name of TYPE. */
7948 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7951 const char *type_name
= ada_type_name (type
);
7954 if (type_name
== NULL
)
7957 len
= strlen (type_name
);
7959 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7961 strcpy (name
, type_name
);
7962 strcpy (name
+ len
, suffix
);
7964 return ada_find_parallel_type_with_name (type
, name
);
7967 /* If TYPE is a variable-size record type, return the corresponding template
7968 type describing its fields. Otherwise, return NULL. */
7970 static struct type
*
7971 dynamic_template_type (struct type
*type
)
7973 type
= ada_check_typedef (type
);
7975 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7976 || ada_type_name (type
) == NULL
)
7980 int len
= strlen (ada_type_name (type
));
7982 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7985 return ada_find_parallel_type (type
, "___XVE");
7989 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7990 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7993 is_dynamic_field (struct type
*templ_type
, int field_num
)
7995 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7998 && TYPE_FIELD_TYPE (templ_type
, field_num
)->code () == TYPE_CODE_PTR
7999 && strstr (name
, "___XVL") != NULL
;
8002 /* The index of the variant field of TYPE, or -1 if TYPE does not
8003 represent a variant record type. */
8006 variant_field_index (struct type
*type
)
8010 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
8013 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
8015 if (ada_is_variant_part (type
, f
))
8021 /* A record type with no fields. */
8023 static struct type
*
8024 empty_record (struct type
*templ
)
8026 struct type
*type
= alloc_type_copy (templ
);
8028 type
->set_code (TYPE_CODE_STRUCT
);
8029 TYPE_NFIELDS (type
) = 0;
8030 TYPE_FIELDS (type
) = NULL
;
8031 INIT_NONE_SPECIFIC (type
);
8032 type
->set_name ("<empty>");
8033 TYPE_LENGTH (type
) = 0;
8037 /* An ordinary record type (with fixed-length fields) that describes
8038 the value of type TYPE at VALADDR or ADDRESS (see comments at
8039 the beginning of this section) VAL according to GNAT conventions.
8040 DVAL0 should describe the (portion of a) record that contains any
8041 necessary discriminants. It should be NULL if value_type (VAL) is
8042 an outer-level type (i.e., as opposed to a branch of a variant.) A
8043 variant field (unless unchecked) is replaced by a particular branch
8046 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8047 length are not statically known are discarded. As a consequence,
8048 VALADDR, ADDRESS and DVAL0 are ignored.
8050 NOTE: Limitations: For now, we assume that dynamic fields and
8051 variants occupy whole numbers of bytes. However, they need not be
8055 ada_template_to_fixed_record_type_1 (struct type
*type
,
8056 const gdb_byte
*valaddr
,
8057 CORE_ADDR address
, struct value
*dval0
,
8058 int keep_dynamic_fields
)
8060 struct value
*mark
= value_mark ();
8063 int nfields
, bit_len
;
8069 /* Compute the number of fields in this record type that are going
8070 to be processed: unless keep_dynamic_fields, this includes only
8071 fields whose position and length are static will be processed. */
8072 if (keep_dynamic_fields
)
8073 nfields
= TYPE_NFIELDS (type
);
8077 while (nfields
< TYPE_NFIELDS (type
)
8078 && !ada_is_variant_part (type
, nfields
)
8079 && !is_dynamic_field (type
, nfields
))
8083 rtype
= alloc_type_copy (type
);
8084 rtype
->set_code (TYPE_CODE_STRUCT
);
8085 INIT_NONE_SPECIFIC (rtype
);
8086 TYPE_NFIELDS (rtype
) = nfields
;
8087 TYPE_FIELDS (rtype
) = (struct field
*)
8088 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8089 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
8090 rtype
->set_name (ada_type_name (type
));
8091 TYPE_FIXED_INSTANCE (rtype
) = 1;
8097 for (f
= 0; f
< nfields
; f
+= 1)
8099 off
= align_up (off
, field_alignment (type
, f
))
8100 + TYPE_FIELD_BITPOS (type
, f
);
8101 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
8102 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8104 if (ada_is_variant_part (type
, f
))
8109 else if (is_dynamic_field (type
, f
))
8111 const gdb_byte
*field_valaddr
= valaddr
;
8112 CORE_ADDR field_address
= address
;
8113 struct type
*field_type
=
8114 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8118 /* rtype's length is computed based on the run-time
8119 value of discriminants. If the discriminants are not
8120 initialized, the type size may be completely bogus and
8121 GDB may fail to allocate a value for it. So check the
8122 size first before creating the value. */
8123 ada_ensure_varsize_limit (rtype
);
8124 /* Using plain value_from_contents_and_address here
8125 causes problems because we will end up trying to
8126 resolve a type that is currently being
8128 dval
= value_from_contents_and_address_unresolved (rtype
,
8131 rtype
= value_type (dval
);
8136 /* If the type referenced by this field is an aligner type, we need
8137 to unwrap that aligner type, because its size might not be set.
8138 Keeping the aligner type would cause us to compute the wrong
8139 size for this field, impacting the offset of the all the fields
8140 that follow this one. */
8141 if (ada_is_aligner_type (field_type
))
8143 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8145 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8146 field_address
= cond_offset_target (field_address
, field_offset
);
8147 field_type
= ada_aligned_type (field_type
);
8150 field_valaddr
= cond_offset_host (field_valaddr
,
8151 off
/ TARGET_CHAR_BIT
);
8152 field_address
= cond_offset_target (field_address
,
8153 off
/ TARGET_CHAR_BIT
);
8155 /* Get the fixed type of the field. Note that, in this case,
8156 we do not want to get the real type out of the tag: if
8157 the current field is the parent part of a tagged record,
8158 we will get the tag of the object. Clearly wrong: the real
8159 type of the parent is not the real type of the child. We
8160 would end up in an infinite loop. */
8161 field_type
= ada_get_base_type (field_type
);
8162 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8163 field_address
, dval
, 0);
8164 /* If the field size is already larger than the maximum
8165 object size, then the record itself will necessarily
8166 be larger than the maximum object size. We need to make
8167 this check now, because the size might be so ridiculously
8168 large (due to an uninitialized variable in the inferior)
8169 that it would cause an overflow when adding it to the
8171 ada_ensure_varsize_limit (field_type
);
8173 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8174 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8175 /* The multiplication can potentially overflow. But because
8176 the field length has been size-checked just above, and
8177 assuming that the maximum size is a reasonable value,
8178 an overflow should not happen in practice. So rather than
8179 adding overflow recovery code to this already complex code,
8180 we just assume that it's not going to happen. */
8182 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8186 /* Note: If this field's type is a typedef, it is important
8187 to preserve the typedef layer.
8189 Otherwise, we might be transforming a typedef to a fat
8190 pointer (encoding a pointer to an unconstrained array),
8191 into a basic fat pointer (encoding an unconstrained
8192 array). As both types are implemented using the same
8193 structure, the typedef is the only clue which allows us
8194 to distinguish between the two options. Stripping it
8195 would prevent us from printing this field appropriately. */
8196 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8197 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8198 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8200 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8203 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8205 /* We need to be careful of typedefs when computing
8206 the length of our field. If this is a typedef,
8207 get the length of the target type, not the length
8209 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
8210 field_type
= ada_typedef_target_type (field_type
);
8213 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8216 if (off
+ fld_bit_len
> bit_len
)
8217 bit_len
= off
+ fld_bit_len
;
8219 TYPE_LENGTH (rtype
) =
8220 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8223 /* We handle the variant part, if any, at the end because of certain
8224 odd cases in which it is re-ordered so as NOT to be the last field of
8225 the record. This can happen in the presence of representation
8227 if (variant_field
>= 0)
8229 struct type
*branch_type
;
8231 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8235 /* Using plain value_from_contents_and_address here causes
8236 problems because we will end up trying to resolve a type
8237 that is currently being constructed. */
8238 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8240 rtype
= value_type (dval
);
8246 to_fixed_variant_branch_type
8247 (TYPE_FIELD_TYPE (type
, variant_field
),
8248 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8249 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8250 if (branch_type
== NULL
)
8252 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8253 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8254 TYPE_NFIELDS (rtype
) -= 1;
8258 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8259 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8261 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8263 if (off
+ fld_bit_len
> bit_len
)
8264 bit_len
= off
+ fld_bit_len
;
8265 TYPE_LENGTH (rtype
) =
8266 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8270 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8271 should contain the alignment of that record, which should be a strictly
8272 positive value. If null or negative, then something is wrong, most
8273 probably in the debug info. In that case, we don't round up the size
8274 of the resulting type. If this record is not part of another structure,
8275 the current RTYPE length might be good enough for our purposes. */
8276 if (TYPE_LENGTH (type
) <= 0)
8279 warning (_("Invalid type size for `%s' detected: %s."),
8280 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
8282 warning (_("Invalid type size for <unnamed> detected: %s."),
8283 pulongest (TYPE_LENGTH (type
)));
8287 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
8288 TYPE_LENGTH (type
));
8291 value_free_to_mark (mark
);
8292 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8293 error (_("record type with dynamic size is larger than varsize-limit"));
8297 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8300 static struct type
*
8301 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8302 CORE_ADDR address
, struct value
*dval0
)
8304 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8308 /* An ordinary record type in which ___XVL-convention fields and
8309 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8310 static approximations, containing all possible fields. Uses
8311 no runtime values. Useless for use in values, but that's OK,
8312 since the results are used only for type determinations. Works on both
8313 structs and unions. Representation note: to save space, we memorize
8314 the result of this function in the TYPE_TARGET_TYPE of the
8317 static struct type
*
8318 template_to_static_fixed_type (struct type
*type0
)
8324 /* No need no do anything if the input type is already fixed. */
8325 if (TYPE_FIXED_INSTANCE (type0
))
8328 /* Likewise if we already have computed the static approximation. */
8329 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8330 return TYPE_TARGET_TYPE (type0
);
8332 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8334 nfields
= TYPE_NFIELDS (type0
);
8336 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8337 recompute all over next time. */
8338 TYPE_TARGET_TYPE (type0
) = type
;
8340 for (f
= 0; f
< nfields
; f
+= 1)
8342 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8343 struct type
*new_type
;
8345 if (is_dynamic_field (type0
, f
))
8347 field_type
= ada_check_typedef (field_type
);
8348 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8351 new_type
= static_unwrap_type (field_type
);
8353 if (new_type
!= field_type
)
8355 /* Clone TYPE0 only the first time we get a new field type. */
8358 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8359 type
->set_code (type0
->code ());
8360 INIT_NONE_SPECIFIC (type
);
8361 TYPE_NFIELDS (type
) = nfields
;
8362 TYPE_FIELDS (type
) = (struct field
*)
8363 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8364 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8365 sizeof (struct field
) * nfields
);
8366 type
->set_name (ada_type_name (type0
));
8367 TYPE_FIXED_INSTANCE (type
) = 1;
8368 TYPE_LENGTH (type
) = 0;
8370 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8371 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8378 /* Given an object of type TYPE whose contents are at VALADDR and
8379 whose address in memory is ADDRESS, returns a revision of TYPE,
8380 which should be a non-dynamic-sized record, in which the variant
8381 part, if any, is replaced with the appropriate branch. Looks
8382 for discriminant values in DVAL0, which can be NULL if the record
8383 contains the necessary discriminant values. */
8385 static struct type
*
8386 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8387 CORE_ADDR address
, struct value
*dval0
)
8389 struct value
*mark
= value_mark ();
8392 struct type
*branch_type
;
8393 int nfields
= TYPE_NFIELDS (type
);
8394 int variant_field
= variant_field_index (type
);
8396 if (variant_field
== -1)
8401 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8402 type
= value_type (dval
);
8407 rtype
= alloc_type_copy (type
);
8408 rtype
->set_code (TYPE_CODE_STRUCT
);
8409 INIT_NONE_SPECIFIC (rtype
);
8410 TYPE_NFIELDS (rtype
) = nfields
;
8411 TYPE_FIELDS (rtype
) =
8412 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8413 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8414 sizeof (struct field
) * nfields
);
8415 rtype
->set_name (ada_type_name (type
));
8416 TYPE_FIXED_INSTANCE (rtype
) = 1;
8417 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8419 branch_type
= to_fixed_variant_branch_type
8420 (TYPE_FIELD_TYPE (type
, variant_field
),
8421 cond_offset_host (valaddr
,
8422 TYPE_FIELD_BITPOS (type
, variant_field
)
8424 cond_offset_target (address
,
8425 TYPE_FIELD_BITPOS (type
, variant_field
)
8426 / TARGET_CHAR_BIT
), dval
);
8427 if (branch_type
== NULL
)
8431 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8432 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8433 TYPE_NFIELDS (rtype
) -= 1;
8437 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8438 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8439 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8440 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8442 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8444 value_free_to_mark (mark
);
8448 /* An ordinary record type (with fixed-length fields) that describes
8449 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8450 beginning of this section]. Any necessary discriminants' values
8451 should be in DVAL, a record value; it may be NULL if the object
8452 at ADDR itself contains any necessary discriminant values.
8453 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8454 values from the record are needed. Except in the case that DVAL,
8455 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8456 unchecked) is replaced by a particular branch of the variant.
8458 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8459 is questionable and may be removed. It can arise during the
8460 processing of an unconstrained-array-of-record type where all the
8461 variant branches have exactly the same size. This is because in
8462 such cases, the compiler does not bother to use the XVS convention
8463 when encoding the record. I am currently dubious of this
8464 shortcut and suspect the compiler should be altered. FIXME. */
8466 static struct type
*
8467 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8468 CORE_ADDR address
, struct value
*dval
)
8470 struct type
*templ_type
;
8472 if (TYPE_FIXED_INSTANCE (type0
))
8475 templ_type
= dynamic_template_type (type0
);
8477 if (templ_type
!= NULL
)
8478 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8479 else if (variant_field_index (type0
) >= 0)
8481 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8483 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8488 TYPE_FIXED_INSTANCE (type0
) = 1;
8494 /* An ordinary record type (with fixed-length fields) that describes
8495 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8496 union type. Any necessary discriminants' values should be in DVAL,
8497 a record value. That is, this routine selects the appropriate
8498 branch of the union at ADDR according to the discriminant value
8499 indicated in the union's type name. Returns VAR_TYPE0 itself if
8500 it represents a variant subject to a pragma Unchecked_Union. */
8502 static struct type
*
8503 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8504 CORE_ADDR address
, struct value
*dval
)
8507 struct type
*templ_type
;
8508 struct type
*var_type
;
8510 if (var_type0
->code () == TYPE_CODE_PTR
)
8511 var_type
= TYPE_TARGET_TYPE (var_type0
);
8513 var_type
= var_type0
;
8515 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8517 if (templ_type
!= NULL
)
8518 var_type
= templ_type
;
8520 if (is_unchecked_variant (var_type
, value_type (dval
)))
8522 which
= ada_which_variant_applies (var_type
, dval
);
8525 return empty_record (var_type
);
8526 else if (is_dynamic_field (var_type
, which
))
8527 return to_fixed_record_type
8528 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8529 valaddr
, address
, dval
);
8530 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8532 to_fixed_record_type
8533 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8535 return TYPE_FIELD_TYPE (var_type
, which
);
8538 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8539 ENCODING_TYPE, a type following the GNAT conventions for discrete
8540 type encodings, only carries redundant information. */
8543 ada_is_redundant_range_encoding (struct type
*range_type
,
8544 struct type
*encoding_type
)
8546 const char *bounds_str
;
8550 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8552 if (get_base_type (range_type
)->code ()
8553 != get_base_type (encoding_type
)->code ())
8555 /* The compiler probably used a simple base type to describe
8556 the range type instead of the range's actual base type,
8557 expecting us to get the real base type from the encoding
8558 anyway. In this situation, the encoding cannot be ignored
8563 if (is_dynamic_type (range_type
))
8566 if (encoding_type
->name () == NULL
)
8569 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8570 if (bounds_str
== NULL
)
8573 n
= 8; /* Skip "___XDLU_". */
8574 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8576 if (TYPE_LOW_BOUND (range_type
) != lo
)
8579 n
+= 2; /* Skip the "__" separator between the two bounds. */
8580 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8582 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8588 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8589 a type following the GNAT encoding for describing array type
8590 indices, only carries redundant information. */
8593 ada_is_redundant_index_type_desc (struct type
*array_type
,
8594 struct type
*desc_type
)
8596 struct type
*this_layer
= check_typedef (array_type
);
8599 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8601 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8602 TYPE_FIELD_TYPE (desc_type
, i
)))
8604 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8610 /* Assuming that TYPE0 is an array type describing the type of a value
8611 at ADDR, and that DVAL describes a record containing any
8612 discriminants used in TYPE0, returns a type for the value that
8613 contains no dynamic components (that is, no components whose sizes
8614 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8615 true, gives an error message if the resulting type's size is over
8618 static struct type
*
8619 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8622 struct type
*index_type_desc
;
8623 struct type
*result
;
8624 int constrained_packed_array_p
;
8625 static const char *xa_suffix
= "___XA";
8627 type0
= ada_check_typedef (type0
);
8628 if (TYPE_FIXED_INSTANCE (type0
))
8631 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8632 if (constrained_packed_array_p
)
8633 type0
= decode_constrained_packed_array_type (type0
);
8635 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8637 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8638 encoding suffixed with 'P' may still be generated. If so,
8639 it should be used to find the XA type. */
8641 if (index_type_desc
== NULL
)
8643 const char *type_name
= ada_type_name (type0
);
8645 if (type_name
!= NULL
)
8647 const int len
= strlen (type_name
);
8648 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8650 if (type_name
[len
- 1] == 'P')
8652 strcpy (name
, type_name
);
8653 strcpy (name
+ len
- 1, xa_suffix
);
8654 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8659 ada_fixup_array_indexes_type (index_type_desc
);
8660 if (index_type_desc
!= NULL
8661 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8663 /* Ignore this ___XA parallel type, as it does not bring any
8664 useful information. This allows us to avoid creating fixed
8665 versions of the array's index types, which would be identical
8666 to the original ones. This, in turn, can also help avoid
8667 the creation of fixed versions of the array itself. */
8668 index_type_desc
= NULL
;
8671 if (index_type_desc
== NULL
)
8673 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8675 /* NOTE: elt_type---the fixed version of elt_type0---should never
8676 depend on the contents of the array in properly constructed
8678 /* Create a fixed version of the array element type.
8679 We're not providing the address of an element here,
8680 and thus the actual object value cannot be inspected to do
8681 the conversion. This should not be a problem, since arrays of
8682 unconstrained objects are not allowed. In particular, all
8683 the elements of an array of a tagged type should all be of
8684 the same type specified in the debugging info. No need to
8685 consult the object tag. */
8686 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8688 /* Make sure we always create a new array type when dealing with
8689 packed array types, since we're going to fix-up the array
8690 type length and element bitsize a little further down. */
8691 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8694 result
= create_array_type (alloc_type_copy (type0
),
8695 elt_type
, TYPE_INDEX_TYPE (type0
));
8700 struct type
*elt_type0
;
8703 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8704 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8706 /* NOTE: result---the fixed version of elt_type0---should never
8707 depend on the contents of the array in properly constructed
8709 /* Create a fixed version of the array element type.
8710 We're not providing the address of an element here,
8711 and thus the actual object value cannot be inspected to do
8712 the conversion. This should not be a problem, since arrays of
8713 unconstrained objects are not allowed. In particular, all
8714 the elements of an array of a tagged type should all be of
8715 the same type specified in the debugging info. No need to
8716 consult the object tag. */
8718 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8721 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8723 struct type
*range_type
=
8724 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8726 result
= create_array_type (alloc_type_copy (elt_type0
),
8727 result
, range_type
);
8728 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8730 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8731 error (_("array type with dynamic size is larger than varsize-limit"));
8734 /* We want to preserve the type name. This can be useful when
8735 trying to get the type name of a value that has already been
8736 printed (for instance, if the user did "print VAR; whatis $". */
8737 result
->set_name (type0
->name ());
8739 if (constrained_packed_array_p
)
8741 /* So far, the resulting type has been created as if the original
8742 type was a regular (non-packed) array type. As a result, the
8743 bitsize of the array elements needs to be set again, and the array
8744 length needs to be recomputed based on that bitsize. */
8745 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8746 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8748 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8749 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8750 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8751 TYPE_LENGTH (result
)++;
8754 TYPE_FIXED_INSTANCE (result
) = 1;
8759 /* A standard type (containing no dynamically sized components)
8760 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8761 DVAL describes a record containing any discriminants used in TYPE0,
8762 and may be NULL if there are none, or if the object of type TYPE at
8763 ADDRESS or in VALADDR contains these discriminants.
8765 If CHECK_TAG is not null, in the case of tagged types, this function
8766 attempts to locate the object's tag and use it to compute the actual
8767 type. However, when ADDRESS is null, we cannot use it to determine the
8768 location of the tag, and therefore compute the tagged type's actual type.
8769 So we return the tagged type without consulting the tag. */
8771 static struct type
*
8772 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8773 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8775 type
= ada_check_typedef (type
);
8777 /* Only un-fixed types need to be handled here. */
8778 if (!HAVE_GNAT_AUX_INFO (type
))
8781 switch (type
->code ())
8785 case TYPE_CODE_STRUCT
:
8787 struct type
*static_type
= to_static_fixed_type (type
);
8788 struct type
*fixed_record_type
=
8789 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8791 /* If STATIC_TYPE is a tagged type and we know the object's address,
8792 then we can determine its tag, and compute the object's actual
8793 type from there. Note that we have to use the fixed record
8794 type (the parent part of the record may have dynamic fields
8795 and the way the location of _tag is expressed may depend on
8798 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8801 value_tag_from_contents_and_address
8805 struct type
*real_type
= type_from_tag (tag
);
8807 value_from_contents_and_address (fixed_record_type
,
8810 fixed_record_type
= value_type (obj
);
8811 if (real_type
!= NULL
)
8812 return to_fixed_record_type
8814 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8817 /* Check to see if there is a parallel ___XVZ variable.
8818 If there is, then it provides the actual size of our type. */
8819 else if (ada_type_name (fixed_record_type
) != NULL
)
8821 const char *name
= ada_type_name (fixed_record_type
);
8823 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8824 bool xvz_found
= false;
8827 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8830 xvz_found
= get_int_var_value (xvz_name
, size
);
8832 catch (const gdb_exception_error
&except
)
8834 /* We found the variable, but somehow failed to read
8835 its value. Rethrow the same error, but with a little
8836 bit more information, to help the user understand
8837 what went wrong (Eg: the variable might have been
8839 throw_error (except
.error
,
8840 _("unable to read value of %s (%s)"),
8841 xvz_name
, except
.what ());
8844 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8846 fixed_record_type
= copy_type (fixed_record_type
);
8847 TYPE_LENGTH (fixed_record_type
) = size
;
8849 /* The FIXED_RECORD_TYPE may have be a stub. We have
8850 observed this when the debugging info is STABS, and
8851 apparently it is something that is hard to fix.
8853 In practice, we don't need the actual type definition
8854 at all, because the presence of the XVZ variable allows us
8855 to assume that there must be a XVS type as well, which we
8856 should be able to use later, when we need the actual type
8859 In the meantime, pretend that the "fixed" type we are
8860 returning is NOT a stub, because this can cause trouble
8861 when using this type to create new types targeting it.
8862 Indeed, the associated creation routines often check
8863 whether the target type is a stub and will try to replace
8864 it, thus using a type with the wrong size. This, in turn,
8865 might cause the new type to have the wrong size too.
8866 Consider the case of an array, for instance, where the size
8867 of the array is computed from the number of elements in
8868 our array multiplied by the size of its element. */
8869 TYPE_STUB (fixed_record_type
) = 0;
8872 return fixed_record_type
;
8874 case TYPE_CODE_ARRAY
:
8875 return to_fixed_array_type (type
, dval
, 1);
8876 case TYPE_CODE_UNION
:
8880 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8884 /* The same as ada_to_fixed_type_1, except that it preserves the type
8885 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8887 The typedef layer needs be preserved in order to differentiate between
8888 arrays and array pointers when both types are implemented using the same
8889 fat pointer. In the array pointer case, the pointer is encoded as
8890 a typedef of the pointer type. For instance, considering:
8892 type String_Access is access String;
8893 S1 : String_Access := null;
8895 To the debugger, S1 is defined as a typedef of type String. But
8896 to the user, it is a pointer. So if the user tries to print S1,
8897 we should not dereference the array, but print the array address
8900 If we didn't preserve the typedef layer, we would lose the fact that
8901 the type is to be presented as a pointer (needs de-reference before
8902 being printed). And we would also use the source-level type name. */
8905 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8906 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8909 struct type
*fixed_type
=
8910 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8912 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8913 then preserve the typedef layer.
8915 Implementation note: We can only check the main-type portion of
8916 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8917 from TYPE now returns a type that has the same instance flags
8918 as TYPE. For instance, if TYPE is a "typedef const", and its
8919 target type is a "struct", then the typedef elimination will return
8920 a "const" version of the target type. See check_typedef for more
8921 details about how the typedef layer elimination is done.
8923 brobecker/2010-11-19: It seems to me that the only case where it is
8924 useful to preserve the typedef layer is when dealing with fat pointers.
8925 Perhaps, we could add a check for that and preserve the typedef layer
8926 only in that situation. But this seems unnecessary so far, probably
8927 because we call check_typedef/ada_check_typedef pretty much everywhere.
8929 if (type
->code () == TYPE_CODE_TYPEDEF
8930 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8931 == TYPE_MAIN_TYPE (fixed_type
)))
8937 /* A standard (static-sized) type corresponding as well as possible to
8938 TYPE0, but based on no runtime data. */
8940 static struct type
*
8941 to_static_fixed_type (struct type
*type0
)
8948 if (TYPE_FIXED_INSTANCE (type0
))
8951 type0
= ada_check_typedef (type0
);
8953 switch (type0
->code ())
8957 case TYPE_CODE_STRUCT
:
8958 type
= dynamic_template_type (type0
);
8960 return template_to_static_fixed_type (type
);
8962 return template_to_static_fixed_type (type0
);
8963 case TYPE_CODE_UNION
:
8964 type
= ada_find_parallel_type (type0
, "___XVU");
8966 return template_to_static_fixed_type (type
);
8968 return template_to_static_fixed_type (type0
);
8972 /* A static approximation of TYPE with all type wrappers removed. */
8974 static struct type
*
8975 static_unwrap_type (struct type
*type
)
8977 if (ada_is_aligner_type (type
))
8979 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8980 if (ada_type_name (type1
) == NULL
)
8981 type1
->set_name (ada_type_name (type
));
8983 return static_unwrap_type (type1
);
8987 struct type
*raw_real_type
= ada_get_base_type (type
);
8989 if (raw_real_type
== type
)
8992 return to_static_fixed_type (raw_real_type
);
8996 /* In some cases, incomplete and private types require
8997 cross-references that are not resolved as records (for example,
8999 type FooP is access Foo;
9001 type Foo is array ...;
9002 ). In these cases, since there is no mechanism for producing
9003 cross-references to such types, we instead substitute for FooP a
9004 stub enumeration type that is nowhere resolved, and whose tag is
9005 the name of the actual type. Call these types "non-record stubs". */
9007 /* A type equivalent to TYPE that is not a non-record stub, if one
9008 exists, otherwise TYPE. */
9011 ada_check_typedef (struct type
*type
)
9016 /* If our type is an access to an unconstrained array, which is encoded
9017 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
9018 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9019 what allows us to distinguish between fat pointers that represent
9020 array types, and fat pointers that represent array access types
9021 (in both cases, the compiler implements them as fat pointers). */
9022 if (ada_is_access_to_unconstrained_array (type
))
9025 type
= check_typedef (type
);
9026 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
9027 || !TYPE_STUB (type
)
9028 || type
->name () == NULL
)
9032 const char *name
= type
->name ();
9033 struct type
*type1
= ada_find_any_type (name
);
9038 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9039 stubs pointing to arrays, as we don't create symbols for array
9040 types, only for the typedef-to-array types). If that's the case,
9041 strip the typedef layer. */
9042 if (type1
->code () == TYPE_CODE_TYPEDEF
)
9043 type1
= ada_check_typedef (type1
);
9049 /* A value representing the data at VALADDR/ADDRESS as described by
9050 type TYPE0, but with a standard (static-sized) type that correctly
9051 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9052 type, then return VAL0 [this feature is simply to avoid redundant
9053 creation of struct values]. */
9055 static struct value
*
9056 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
9059 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
9061 if (type
== type0
&& val0
!= NULL
)
9064 if (VALUE_LVAL (val0
) != lval_memory
)
9066 /* Our value does not live in memory; it could be a convenience
9067 variable, for instance. Create a not_lval value using val0's
9069 return value_from_contents (type
, value_contents (val0
));
9072 return value_from_contents_and_address (type
, 0, address
);
9075 /* A value representing VAL, but with a standard (static-sized) type
9076 that correctly describes it. Does not necessarily create a new
9080 ada_to_fixed_value (struct value
*val
)
9082 val
= unwrap_value (val
);
9083 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
9090 /* Table mapping attribute numbers to names.
9091 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9093 static const char *attribute_names
[] = {
9111 ada_attribute_name (enum exp_opcode n
)
9113 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9114 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9116 return attribute_names
[0];
9119 /* Evaluate the 'POS attribute applied to ARG. */
9122 pos_atr (struct value
*arg
)
9124 struct value
*val
= coerce_ref (arg
);
9125 struct type
*type
= value_type (val
);
9128 if (!discrete_type_p (type
))
9129 error (_("'POS only defined on discrete types"));
9131 if (!discrete_position (type
, value_as_long (val
), &result
))
9132 error (_("enumeration value is invalid: can't find 'POS"));
9137 static struct value
*
9138 value_pos_atr (struct type
*type
, struct value
*arg
)
9140 return value_from_longest (type
, pos_atr (arg
));
9143 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9145 static struct value
*
9146 value_val_atr (struct type
*type
, struct value
*arg
)
9148 if (!discrete_type_p (type
))
9149 error (_("'VAL only defined on discrete types"));
9150 if (!integer_type_p (value_type (arg
)))
9151 error (_("'VAL requires integral argument"));
9153 if (type
->code () == TYPE_CODE_ENUM
)
9155 long pos
= value_as_long (arg
);
9157 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
9158 error (_("argument to 'VAL out of range"));
9159 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
9162 return value_from_longest (type
, value_as_long (arg
));
9168 /* True if TYPE appears to be an Ada character type.
9169 [At the moment, this is true only for Character and Wide_Character;
9170 It is a heuristic test that could stand improvement]. */
9173 ada_is_character_type (struct type
*type
)
9177 /* If the type code says it's a character, then assume it really is,
9178 and don't check any further. */
9179 if (type
->code () == TYPE_CODE_CHAR
)
9182 /* Otherwise, assume it's a character type iff it is a discrete type
9183 with a known character type name. */
9184 name
= ada_type_name (type
);
9185 return (name
!= NULL
9186 && (type
->code () == TYPE_CODE_INT
9187 || type
->code () == TYPE_CODE_RANGE
)
9188 && (strcmp (name
, "character") == 0
9189 || strcmp (name
, "wide_character") == 0
9190 || strcmp (name
, "wide_wide_character") == 0
9191 || strcmp (name
, "unsigned char") == 0));
9194 /* True if TYPE appears to be an Ada string type. */
9197 ada_is_string_type (struct type
*type
)
9199 type
= ada_check_typedef (type
);
9201 && type
->code () != TYPE_CODE_PTR
9202 && (ada_is_simple_array_type (type
)
9203 || ada_is_array_descriptor_type (type
))
9204 && ada_array_arity (type
) == 1)
9206 struct type
*elttype
= ada_array_element_type (type
, 1);
9208 return ada_is_character_type (elttype
);
9214 /* The compiler sometimes provides a parallel XVS type for a given
9215 PAD type. Normally, it is safe to follow the PAD type directly,
9216 but older versions of the compiler have a bug that causes the offset
9217 of its "F" field to be wrong. Following that field in that case
9218 would lead to incorrect results, but this can be worked around
9219 by ignoring the PAD type and using the associated XVS type instead.
9221 Set to True if the debugger should trust the contents of PAD types.
9222 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9223 static bool trust_pad_over_xvs
= true;
9225 /* True if TYPE is a struct type introduced by the compiler to force the
9226 alignment of a value. Such types have a single field with a
9227 distinctive name. */
9230 ada_is_aligner_type (struct type
*type
)
9232 type
= ada_check_typedef (type
);
9234 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9237 return (type
->code () == TYPE_CODE_STRUCT
9238 && TYPE_NFIELDS (type
) == 1
9239 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9242 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9243 the parallel type. */
9246 ada_get_base_type (struct type
*raw_type
)
9248 struct type
*real_type_namer
;
9249 struct type
*raw_real_type
;
9251 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
9254 if (ada_is_aligner_type (raw_type
))
9255 /* The encoding specifies that we should always use the aligner type.
9256 So, even if this aligner type has an associated XVS type, we should
9259 According to the compiler gurus, an XVS type parallel to an aligner
9260 type may exist because of a stabs limitation. In stabs, aligner
9261 types are empty because the field has a variable-sized type, and
9262 thus cannot actually be used as an aligner type. As a result,
9263 we need the associated parallel XVS type to decode the type.
9264 Since the policy in the compiler is to not change the internal
9265 representation based on the debugging info format, we sometimes
9266 end up having a redundant XVS type parallel to the aligner type. */
9269 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9270 if (real_type_namer
== NULL
9271 || real_type_namer
->code () != TYPE_CODE_STRUCT
9272 || TYPE_NFIELDS (real_type_namer
) != 1)
9275 if (TYPE_FIELD_TYPE (real_type_namer
, 0)->code () != TYPE_CODE_REF
)
9277 /* This is an older encoding form where the base type needs to be
9278 looked up by name. We prefer the newer encoding because it is
9280 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9281 if (raw_real_type
== NULL
)
9284 return raw_real_type
;
9287 /* The field in our XVS type is a reference to the base type. */
9288 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9291 /* The type of value designated by TYPE, with all aligners removed. */
9294 ada_aligned_type (struct type
*type
)
9296 if (ada_is_aligner_type (type
))
9297 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9299 return ada_get_base_type (type
);
9303 /* The address of the aligned value in an object at address VALADDR
9304 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9307 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9309 if (ada_is_aligner_type (type
))
9310 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9312 TYPE_FIELD_BITPOS (type
,
9313 0) / TARGET_CHAR_BIT
);
9320 /* The printed representation of an enumeration literal with encoded
9321 name NAME. The value is good to the next call of ada_enum_name. */
9323 ada_enum_name (const char *name
)
9325 static char *result
;
9326 static size_t result_len
= 0;
9329 /* First, unqualify the enumeration name:
9330 1. Search for the last '.' character. If we find one, then skip
9331 all the preceding characters, the unqualified name starts
9332 right after that dot.
9333 2. Otherwise, we may be debugging on a target where the compiler
9334 translates dots into "__". Search forward for double underscores,
9335 but stop searching when we hit an overloading suffix, which is
9336 of the form "__" followed by digits. */
9338 tmp
= strrchr (name
, '.');
9343 while ((tmp
= strstr (name
, "__")) != NULL
)
9345 if (isdigit (tmp
[2]))
9356 if (name
[1] == 'U' || name
[1] == 'W')
9358 if (sscanf (name
+ 2, "%x", &v
) != 1)
9361 else if (((name
[1] >= '0' && name
[1] <= '9')
9362 || (name
[1] >= 'a' && name
[1] <= 'z'))
9365 GROW_VECT (result
, result_len
, 4);
9366 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9372 GROW_VECT (result
, result_len
, 16);
9373 if (isascii (v
) && isprint (v
))
9374 xsnprintf (result
, result_len
, "'%c'", v
);
9375 else if (name
[1] == 'U')
9376 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9378 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9384 tmp
= strstr (name
, "__");
9386 tmp
= strstr (name
, "$");
9389 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9390 strncpy (result
, name
, tmp
- name
);
9391 result
[tmp
- name
] = '\0';
9399 /* Evaluate the subexpression of EXP starting at *POS as for
9400 evaluate_type, updating *POS to point just past the evaluated
9403 static struct value
*
9404 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9406 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9409 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9412 static struct value
*
9413 unwrap_value (struct value
*val
)
9415 struct type
*type
= ada_check_typedef (value_type (val
));
9417 if (ada_is_aligner_type (type
))
9419 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9420 struct type
*val_type
= ada_check_typedef (value_type (v
));
9422 if (ada_type_name (val_type
) == NULL
)
9423 val_type
->set_name (ada_type_name (type
));
9425 return unwrap_value (v
);
9429 struct type
*raw_real_type
=
9430 ada_check_typedef (ada_get_base_type (type
));
9432 /* If there is no parallel XVS or XVE type, then the value is
9433 already unwrapped. Return it without further modification. */
9434 if ((type
== raw_real_type
)
9435 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9439 coerce_unspec_val_to_type
9440 (val
, ada_to_fixed_type (raw_real_type
, 0,
9441 value_address (val
),
9446 static struct value
*
9447 cast_from_fixed (struct type
*type
, struct value
*arg
)
9449 struct value
*scale
= ada_scaling_factor (value_type (arg
));
9450 arg
= value_cast (value_type (scale
), arg
);
9452 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9453 return value_cast (type
, arg
);
9456 static struct value
*
9457 cast_to_fixed (struct type
*type
, struct value
*arg
)
9459 if (type
== value_type (arg
))
9462 struct value
*scale
= ada_scaling_factor (type
);
9463 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg
)))
9464 arg
= cast_from_fixed (value_type (scale
), arg
);
9466 arg
= value_cast (value_type (scale
), arg
);
9468 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9469 return value_cast (type
, arg
);
9472 /* Given two array types T1 and T2, return nonzero iff both arrays
9473 contain the same number of elements. */
9476 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9478 LONGEST lo1
, hi1
, lo2
, hi2
;
9480 /* Get the array bounds in order to verify that the size of
9481 the two arrays match. */
9482 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9483 || !get_array_bounds (t2
, &lo2
, &hi2
))
9484 error (_("unable to determine array bounds"));
9486 /* To make things easier for size comparison, normalize a bit
9487 the case of empty arrays by making sure that the difference
9488 between upper bound and lower bound is always -1. */
9494 return (hi1
- lo1
== hi2
- lo2
);
9497 /* Assuming that VAL is an array of integrals, and TYPE represents
9498 an array with the same number of elements, but with wider integral
9499 elements, return an array "casted" to TYPE. In practice, this
9500 means that the returned array is built by casting each element
9501 of the original array into TYPE's (wider) element type. */
9503 static struct value
*
9504 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9506 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9511 /* Verify that both val and type are arrays of scalars, and
9512 that the size of val's elements is smaller than the size
9513 of type's element. */
9514 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9515 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9516 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9517 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9518 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9519 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9521 if (!get_array_bounds (type
, &lo
, &hi
))
9522 error (_("unable to determine array bounds"));
9524 res
= allocate_value (type
);
9526 /* Promote each array element. */
9527 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9529 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9531 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9532 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9538 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9539 return the converted value. */
9541 static struct value
*
9542 coerce_for_assign (struct type
*type
, struct value
*val
)
9544 struct type
*type2
= value_type (val
);
9549 type2
= ada_check_typedef (type2
);
9550 type
= ada_check_typedef (type
);
9552 if (type2
->code () == TYPE_CODE_PTR
9553 && type
->code () == TYPE_CODE_ARRAY
)
9555 val
= ada_value_ind (val
);
9556 type2
= value_type (val
);
9559 if (type2
->code () == TYPE_CODE_ARRAY
9560 && type
->code () == TYPE_CODE_ARRAY
)
9562 if (!ada_same_array_size_p (type
, type2
))
9563 error (_("cannot assign arrays of different length"));
9565 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9566 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9567 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9568 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9570 /* Allow implicit promotion of the array elements to
9572 return ada_promote_array_of_integrals (type
, val
);
9575 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9576 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9577 error (_("Incompatible types in assignment"));
9578 deprecated_set_value_type (val
, type
);
9583 static struct value
*
9584 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9587 struct type
*type1
, *type2
;
9590 arg1
= coerce_ref (arg1
);
9591 arg2
= coerce_ref (arg2
);
9592 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9593 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9595 if (type1
->code () != TYPE_CODE_INT
9596 || type2
->code () != TYPE_CODE_INT
)
9597 return value_binop (arg1
, arg2
, op
);
9606 return value_binop (arg1
, arg2
, op
);
9609 v2
= value_as_long (arg2
);
9611 error (_("second operand of %s must not be zero."), op_string (op
));
9613 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9614 return value_binop (arg1
, arg2
, op
);
9616 v1
= value_as_long (arg1
);
9621 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9622 v
+= v
> 0 ? -1 : 1;
9630 /* Should not reach this point. */
9634 val
= allocate_value (type1
);
9635 store_unsigned_integer (value_contents_raw (val
),
9636 TYPE_LENGTH (value_type (val
)),
9637 type_byte_order (type1
), v
);
9642 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9644 if (ada_is_direct_array_type (value_type (arg1
))
9645 || ada_is_direct_array_type (value_type (arg2
)))
9647 struct type
*arg1_type
, *arg2_type
;
9649 /* Automatically dereference any array reference before
9650 we attempt to perform the comparison. */
9651 arg1
= ada_coerce_ref (arg1
);
9652 arg2
= ada_coerce_ref (arg2
);
9654 arg1
= ada_coerce_to_simple_array (arg1
);
9655 arg2
= ada_coerce_to_simple_array (arg2
);
9657 arg1_type
= ada_check_typedef (value_type (arg1
));
9658 arg2_type
= ada_check_typedef (value_type (arg2
));
9660 if (arg1_type
->code () != TYPE_CODE_ARRAY
9661 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9662 error (_("Attempt to compare array with non-array"));
9663 /* FIXME: The following works only for types whose
9664 representations use all bits (no padding or undefined bits)
9665 and do not have user-defined equality. */
9666 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9667 && memcmp (value_contents (arg1
), value_contents (arg2
),
9668 TYPE_LENGTH (arg1_type
)) == 0);
9670 return value_equal (arg1
, arg2
);
9673 /* Total number of component associations in the aggregate starting at
9674 index PC in EXP. Assumes that index PC is the start of an
9678 num_component_specs (struct expression
*exp
, int pc
)
9682 m
= exp
->elts
[pc
+ 1].longconst
;
9685 for (i
= 0; i
< m
; i
+= 1)
9687 switch (exp
->elts
[pc
].opcode
)
9693 n
+= exp
->elts
[pc
+ 1].longconst
;
9696 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9701 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9702 component of LHS (a simple array or a record), updating *POS past
9703 the expression, assuming that LHS is contained in CONTAINER. Does
9704 not modify the inferior's memory, nor does it modify LHS (unless
9705 LHS == CONTAINER). */
9708 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9709 struct expression
*exp
, int *pos
)
9711 struct value
*mark
= value_mark ();
9713 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9715 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9717 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9718 struct value
*index_val
= value_from_longest (index_type
, index
);
9720 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9724 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9725 elt
= ada_to_fixed_value (elt
);
9728 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9729 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9731 value_assign_to_component (container
, elt
,
9732 ada_evaluate_subexp (NULL
, exp
, pos
,
9735 value_free_to_mark (mark
);
9738 /* Assuming that LHS represents an lvalue having a record or array
9739 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9740 of that aggregate's value to LHS, advancing *POS past the
9741 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9742 lvalue containing LHS (possibly LHS itself). Does not modify
9743 the inferior's memory, nor does it modify the contents of
9744 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9746 static struct value
*
9747 assign_aggregate (struct value
*container
,
9748 struct value
*lhs
, struct expression
*exp
,
9749 int *pos
, enum noside noside
)
9751 struct type
*lhs_type
;
9752 int n
= exp
->elts
[*pos
+1].longconst
;
9753 LONGEST low_index
, high_index
;
9756 int max_indices
, num_indices
;
9760 if (noside
!= EVAL_NORMAL
)
9762 for (i
= 0; i
< n
; i
+= 1)
9763 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9767 container
= ada_coerce_ref (container
);
9768 if (ada_is_direct_array_type (value_type (container
)))
9769 container
= ada_coerce_to_simple_array (container
);
9770 lhs
= ada_coerce_ref (lhs
);
9771 if (!deprecated_value_modifiable (lhs
))
9772 error (_("Left operand of assignment is not a modifiable lvalue."));
9774 lhs_type
= check_typedef (value_type (lhs
));
9775 if (ada_is_direct_array_type (lhs_type
))
9777 lhs
= ada_coerce_to_simple_array (lhs
);
9778 lhs_type
= check_typedef (value_type (lhs
));
9779 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9780 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9782 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9785 high_index
= num_visible_fields (lhs_type
) - 1;
9788 error (_("Left-hand side must be array or record."));
9790 num_specs
= num_component_specs (exp
, *pos
- 3);
9791 max_indices
= 4 * num_specs
+ 4;
9792 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9793 indices
[0] = indices
[1] = low_index
- 1;
9794 indices
[2] = indices
[3] = high_index
+ 1;
9797 for (i
= 0; i
< n
; i
+= 1)
9799 switch (exp
->elts
[*pos
].opcode
)
9802 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9803 &num_indices
, max_indices
,
9804 low_index
, high_index
);
9807 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9808 &num_indices
, max_indices
,
9809 low_index
, high_index
);
9813 error (_("Misplaced 'others' clause"));
9814 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9815 num_indices
, low_index
, high_index
);
9818 error (_("Internal error: bad aggregate clause"));
9825 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9826 construct at *POS, updating *POS past the construct, given that
9827 the positions are relative to lower bound LOW, where HIGH is the
9828 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9829 updating *NUM_INDICES as needed. CONTAINER is as for
9830 assign_aggregate. */
9832 aggregate_assign_positional (struct value
*container
,
9833 struct value
*lhs
, struct expression
*exp
,
9834 int *pos
, LONGEST
*indices
, int *num_indices
,
9835 int max_indices
, LONGEST low
, LONGEST high
)
9837 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9839 if (ind
- 1 == high
)
9840 warning (_("Extra components in aggregate ignored."));
9843 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9845 assign_component (container
, lhs
, ind
, exp
, pos
);
9848 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9851 /* Assign into the components of LHS indexed by the OP_CHOICES
9852 construct at *POS, updating *POS past the construct, given that
9853 the allowable indices are LOW..HIGH. Record the indices assigned
9854 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9855 needed. CONTAINER is as for assign_aggregate. */
9857 aggregate_assign_from_choices (struct value
*container
,
9858 struct value
*lhs
, struct expression
*exp
,
9859 int *pos
, LONGEST
*indices
, int *num_indices
,
9860 int max_indices
, LONGEST low
, LONGEST high
)
9863 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9864 int choice_pos
, expr_pc
;
9865 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9867 choice_pos
= *pos
+= 3;
9869 for (j
= 0; j
< n_choices
; j
+= 1)
9870 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9872 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9874 for (j
= 0; j
< n_choices
; j
+= 1)
9876 LONGEST lower
, upper
;
9877 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9879 if (op
== OP_DISCRETE_RANGE
)
9882 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9884 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9889 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9901 name
= &exp
->elts
[choice_pos
+ 2].string
;
9904 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9907 error (_("Invalid record component association."));
9909 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9911 if (! find_struct_field (name
, value_type (lhs
), 0,
9912 NULL
, NULL
, NULL
, NULL
, &ind
))
9913 error (_("Unknown component name: %s."), name
);
9914 lower
= upper
= ind
;
9917 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9918 error (_("Index in component association out of bounds."));
9920 add_component_interval (lower
, upper
, indices
, num_indices
,
9922 while (lower
<= upper
)
9927 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9933 /* Assign the value of the expression in the OP_OTHERS construct in
9934 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9935 have not been previously assigned. The index intervals already assigned
9936 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9937 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9939 aggregate_assign_others (struct value
*container
,
9940 struct value
*lhs
, struct expression
*exp
,
9941 int *pos
, LONGEST
*indices
, int num_indices
,
9942 LONGEST low
, LONGEST high
)
9945 int expr_pc
= *pos
+ 1;
9947 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9951 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9956 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9959 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9962 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9963 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9964 modifying *SIZE as needed. It is an error if *SIZE exceeds
9965 MAX_SIZE. The resulting intervals do not overlap. */
9967 add_component_interval (LONGEST low
, LONGEST high
,
9968 LONGEST
* indices
, int *size
, int max_size
)
9972 for (i
= 0; i
< *size
; i
+= 2) {
9973 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9977 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9978 if (high
< indices
[kh
])
9980 if (low
< indices
[i
])
9982 indices
[i
+ 1] = indices
[kh
- 1];
9983 if (high
> indices
[i
+ 1])
9984 indices
[i
+ 1] = high
;
9985 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9986 *size
-= kh
- i
- 2;
9989 else if (high
< indices
[i
])
9993 if (*size
== max_size
)
9994 error (_("Internal error: miscounted aggregate components."));
9996 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9997 indices
[j
] = indices
[j
- 2];
9999 indices
[i
+ 1] = high
;
10002 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10005 static struct value
*
10006 ada_value_cast (struct type
*type
, struct value
*arg2
)
10008 if (type
== ada_check_typedef (value_type (arg2
)))
10011 if (ada_is_gnat_encoded_fixed_point_type (type
))
10012 return cast_to_fixed (type
, arg2
);
10014 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10015 return cast_from_fixed (type
, arg2
);
10017 return value_cast (type
, arg2
);
10020 /* Evaluating Ada expressions, and printing their result.
10021 ------------------------------------------------------
10026 We usually evaluate an Ada expression in order to print its value.
10027 We also evaluate an expression in order to print its type, which
10028 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10029 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10030 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10031 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10034 Evaluating expressions is a little more complicated for Ada entities
10035 than it is for entities in languages such as C. The main reason for
10036 this is that Ada provides types whose definition might be dynamic.
10037 One example of such types is variant records. Or another example
10038 would be an array whose bounds can only be known at run time.
10040 The following description is a general guide as to what should be
10041 done (and what should NOT be done) in order to evaluate an expression
10042 involving such types, and when. This does not cover how the semantic
10043 information is encoded by GNAT as this is covered separatly. For the
10044 document used as the reference for the GNAT encoding, see exp_dbug.ads
10045 in the GNAT sources.
10047 Ideally, we should embed each part of this description next to its
10048 associated code. Unfortunately, the amount of code is so vast right
10049 now that it's hard to see whether the code handling a particular
10050 situation might be duplicated or not. One day, when the code is
10051 cleaned up, this guide might become redundant with the comments
10052 inserted in the code, and we might want to remove it.
10054 2. ``Fixing'' an Entity, the Simple Case:
10055 -----------------------------------------
10057 When evaluating Ada expressions, the tricky issue is that they may
10058 reference entities whose type contents and size are not statically
10059 known. Consider for instance a variant record:
10061 type Rec (Empty : Boolean := True) is record
10064 when False => Value : Integer;
10067 Yes : Rec := (Empty => False, Value => 1);
10068 No : Rec := (empty => True);
10070 The size and contents of that record depends on the value of the
10071 descriminant (Rec.Empty). At this point, neither the debugging
10072 information nor the associated type structure in GDB are able to
10073 express such dynamic types. So what the debugger does is to create
10074 "fixed" versions of the type that applies to the specific object.
10075 We also informally refer to this operation as "fixing" an object,
10076 which means creating its associated fixed type.
10078 Example: when printing the value of variable "Yes" above, its fixed
10079 type would look like this:
10086 On the other hand, if we printed the value of "No", its fixed type
10093 Things become a little more complicated when trying to fix an entity
10094 with a dynamic type that directly contains another dynamic type,
10095 such as an array of variant records, for instance. There are
10096 two possible cases: Arrays, and records.
10098 3. ``Fixing'' Arrays:
10099 ---------------------
10101 The type structure in GDB describes an array in terms of its bounds,
10102 and the type of its elements. By design, all elements in the array
10103 have the same type and we cannot represent an array of variant elements
10104 using the current type structure in GDB. When fixing an array,
10105 we cannot fix the array element, as we would potentially need one
10106 fixed type per element of the array. As a result, the best we can do
10107 when fixing an array is to produce an array whose bounds and size
10108 are correct (allowing us to read it from memory), but without having
10109 touched its element type. Fixing each element will be done later,
10110 when (if) necessary.
10112 Arrays are a little simpler to handle than records, because the same
10113 amount of memory is allocated for each element of the array, even if
10114 the amount of space actually used by each element differs from element
10115 to element. Consider for instance the following array of type Rec:
10117 type Rec_Array is array (1 .. 2) of Rec;
10119 The actual amount of memory occupied by each element might be different
10120 from element to element, depending on the value of their discriminant.
10121 But the amount of space reserved for each element in the array remains
10122 fixed regardless. So we simply need to compute that size using
10123 the debugging information available, from which we can then determine
10124 the array size (we multiply the number of elements of the array by
10125 the size of each element).
10127 The simplest case is when we have an array of a constrained element
10128 type. For instance, consider the following type declarations:
10130 type Bounded_String (Max_Size : Integer) is
10132 Buffer : String (1 .. Max_Size);
10134 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10136 In this case, the compiler describes the array as an array of
10137 variable-size elements (identified by its XVS suffix) for which
10138 the size can be read in the parallel XVZ variable.
10140 In the case of an array of an unconstrained element type, the compiler
10141 wraps the array element inside a private PAD type. This type should not
10142 be shown to the user, and must be "unwrap"'ed before printing. Note
10143 that we also use the adjective "aligner" in our code to designate
10144 these wrapper types.
10146 In some cases, the size allocated for each element is statically
10147 known. In that case, the PAD type already has the correct size,
10148 and the array element should remain unfixed.
10150 But there are cases when this size is not statically known.
10151 For instance, assuming that "Five" is an integer variable:
10153 type Dynamic is array (1 .. Five) of Integer;
10154 type Wrapper (Has_Length : Boolean := False) is record
10157 when True => Length : Integer;
10158 when False => null;
10161 type Wrapper_Array is array (1 .. 2) of Wrapper;
10163 Hello : Wrapper_Array := (others => (Has_Length => True,
10164 Data => (others => 17),
10168 The debugging info would describe variable Hello as being an
10169 array of a PAD type. The size of that PAD type is not statically
10170 known, but can be determined using a parallel XVZ variable.
10171 In that case, a copy of the PAD type with the correct size should
10172 be used for the fixed array.
10174 3. ``Fixing'' record type objects:
10175 ----------------------------------
10177 Things are slightly different from arrays in the case of dynamic
10178 record types. In this case, in order to compute the associated
10179 fixed type, we need to determine the size and offset of each of
10180 its components. This, in turn, requires us to compute the fixed
10181 type of each of these components.
10183 Consider for instance the example:
10185 type Bounded_String (Max_Size : Natural) is record
10186 Str : String (1 .. Max_Size);
10189 My_String : Bounded_String (Max_Size => 10);
10191 In that case, the position of field "Length" depends on the size
10192 of field Str, which itself depends on the value of the Max_Size
10193 discriminant. In order to fix the type of variable My_String,
10194 we need to fix the type of field Str. Therefore, fixing a variant
10195 record requires us to fix each of its components.
10197 However, if a component does not have a dynamic size, the component
10198 should not be fixed. In particular, fields that use a PAD type
10199 should not fixed. Here is an example where this might happen
10200 (assuming type Rec above):
10202 type Container (Big : Boolean) is record
10206 when True => Another : Integer;
10207 when False => null;
10210 My_Container : Container := (Big => False,
10211 First => (Empty => True),
10214 In that example, the compiler creates a PAD type for component First,
10215 whose size is constant, and then positions the component After just
10216 right after it. The offset of component After is therefore constant
10219 The debugger computes the position of each field based on an algorithm
10220 that uses, among other things, the actual position and size of the field
10221 preceding it. Let's now imagine that the user is trying to print
10222 the value of My_Container. If the type fixing was recursive, we would
10223 end up computing the offset of field After based on the size of the
10224 fixed version of field First. And since in our example First has
10225 only one actual field, the size of the fixed type is actually smaller
10226 than the amount of space allocated to that field, and thus we would
10227 compute the wrong offset of field After.
10229 To make things more complicated, we need to watch out for dynamic
10230 components of variant records (identified by the ___XVL suffix in
10231 the component name). Even if the target type is a PAD type, the size
10232 of that type might not be statically known. So the PAD type needs
10233 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10234 we might end up with the wrong size for our component. This can be
10235 observed with the following type declarations:
10237 type Octal is new Integer range 0 .. 7;
10238 type Octal_Array is array (Positive range <>) of Octal;
10239 pragma Pack (Octal_Array);
10241 type Octal_Buffer (Size : Positive) is record
10242 Buffer : Octal_Array (1 .. Size);
10246 In that case, Buffer is a PAD type whose size is unset and needs
10247 to be computed by fixing the unwrapped type.
10249 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10250 ----------------------------------------------------------
10252 Lastly, when should the sub-elements of an entity that remained unfixed
10253 thus far, be actually fixed?
10255 The answer is: Only when referencing that element. For instance
10256 when selecting one component of a record, this specific component
10257 should be fixed at that point in time. Or when printing the value
10258 of a record, each component should be fixed before its value gets
10259 printed. Similarly for arrays, the element of the array should be
10260 fixed when printing each element of the array, or when extracting
10261 one element out of that array. On the other hand, fixing should
10262 not be performed on the elements when taking a slice of an array!
10264 Note that one of the side effects of miscomputing the offset and
10265 size of each field is that we end up also miscomputing the size
10266 of the containing type. This can have adverse results when computing
10267 the value of an entity. GDB fetches the value of an entity based
10268 on the size of its type, and thus a wrong size causes GDB to fetch
10269 the wrong amount of memory. In the case where the computed size is
10270 too small, GDB fetches too little data to print the value of our
10271 entity. Results in this case are unpredictable, as we usually read
10272 past the buffer containing the data =:-o. */
10274 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10275 for that subexpression cast to TO_TYPE. Advance *POS over the
10279 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10280 enum noside noside
, struct type
*to_type
)
10284 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10285 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10290 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10292 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10293 return value_zero (to_type
, not_lval
);
10295 val
= evaluate_var_msym_value (noside
,
10296 exp
->elts
[pc
+ 1].objfile
,
10297 exp
->elts
[pc
+ 2].msymbol
);
10300 val
= evaluate_var_value (noside
,
10301 exp
->elts
[pc
+ 1].block
,
10302 exp
->elts
[pc
+ 2].symbol
);
10304 if (noside
== EVAL_SKIP
)
10305 return eval_skip_value (exp
);
10307 val
= ada_value_cast (to_type
, val
);
10309 /* Follow the Ada language semantics that do not allow taking
10310 an address of the result of a cast (view conversion in Ada). */
10311 if (VALUE_LVAL (val
) == lval_memory
)
10313 if (value_lazy (val
))
10314 value_fetch_lazy (val
);
10315 VALUE_LVAL (val
) = not_lval
;
10320 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10321 if (noside
== EVAL_SKIP
)
10322 return eval_skip_value (exp
);
10323 return ada_value_cast (to_type
, val
);
10326 /* Implement the evaluate_exp routine in the exp_descriptor structure
10327 for the Ada language. */
10329 static struct value
*
10330 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10331 int *pos
, enum noside noside
)
10333 enum exp_opcode op
;
10337 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10340 struct value
**argvec
;
10344 op
= exp
->elts
[pc
].opcode
;
10350 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10352 if (noside
== EVAL_NORMAL
)
10353 arg1
= unwrap_value (arg1
);
10355 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10356 then we need to perform the conversion manually, because
10357 evaluate_subexp_standard doesn't do it. This conversion is
10358 necessary in Ada because the different kinds of float/fixed
10359 types in Ada have different representations.
10361 Similarly, we need to perform the conversion from OP_LONG
10363 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10364 arg1
= ada_value_cast (expect_type
, arg1
);
10370 struct value
*result
;
10373 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10374 /* The result type will have code OP_STRING, bashed there from
10375 OP_ARRAY. Bash it back. */
10376 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10377 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10383 type
= exp
->elts
[pc
+ 1].type
;
10384 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10388 type
= exp
->elts
[pc
+ 1].type
;
10389 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10392 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10393 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10395 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10396 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10398 return ada_value_assign (arg1
, arg1
);
10400 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10401 except if the lhs of our assignment is a convenience variable.
10402 In the case of assigning to a convenience variable, the lhs
10403 should be exactly the result of the evaluation of the rhs. */
10404 type
= value_type (arg1
);
10405 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10407 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10408 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10410 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10414 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10415 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10416 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10418 (_("Fixed-point values must be assigned to fixed-point variables"));
10420 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10421 return ada_value_assign (arg1
, arg2
);
10424 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10425 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10426 if (noside
== EVAL_SKIP
)
10428 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10429 return (value_from_longest
10430 (value_type (arg1
),
10431 value_as_long (arg1
) + value_as_long (arg2
)));
10432 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10433 return (value_from_longest
10434 (value_type (arg2
),
10435 value_as_long (arg1
) + value_as_long (arg2
)));
10436 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10437 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10438 && value_type (arg1
) != value_type (arg2
))
10439 error (_("Operands of fixed-point addition must have the same type"));
10440 /* Do the addition, and cast the result to the type of the first
10441 argument. We cannot cast the result to a reference type, so if
10442 ARG1 is a reference type, find its underlying type. */
10443 type
= value_type (arg1
);
10444 while (type
->code () == TYPE_CODE_REF
)
10445 type
= TYPE_TARGET_TYPE (type
);
10446 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10447 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10450 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10451 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10452 if (noside
== EVAL_SKIP
)
10454 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10455 return (value_from_longest
10456 (value_type (arg1
),
10457 value_as_long (arg1
) - value_as_long (arg2
)));
10458 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10459 return (value_from_longest
10460 (value_type (arg2
),
10461 value_as_long (arg1
) - value_as_long (arg2
)));
10462 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10463 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10464 && value_type (arg1
) != value_type (arg2
))
10465 error (_("Operands of fixed-point subtraction "
10466 "must have the same type"));
10467 /* Do the substraction, and cast the result to the type of the first
10468 argument. We cannot cast the result to a reference type, so if
10469 ARG1 is a reference type, find its underlying type. */
10470 type
= value_type (arg1
);
10471 while (type
->code () == TYPE_CODE_REF
)
10472 type
= TYPE_TARGET_TYPE (type
);
10473 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10474 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10480 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10481 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10482 if (noside
== EVAL_SKIP
)
10484 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10486 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10487 return value_zero (value_type (arg1
), not_lval
);
10491 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10492 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10493 arg1
= cast_from_fixed (type
, arg1
);
10494 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10495 arg2
= cast_from_fixed (type
, arg2
);
10496 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10497 return ada_value_binop (arg1
, arg2
, op
);
10501 case BINOP_NOTEQUAL
:
10502 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10503 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10504 if (noside
== EVAL_SKIP
)
10506 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10510 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10511 tem
= ada_value_equal (arg1
, arg2
);
10513 if (op
== BINOP_NOTEQUAL
)
10515 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10516 return value_from_longest (type
, (LONGEST
) tem
);
10519 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10520 if (noside
== EVAL_SKIP
)
10522 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10523 return value_cast (value_type (arg1
), value_neg (arg1
));
10526 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10527 return value_neg (arg1
);
10530 case BINOP_LOGICAL_AND
:
10531 case BINOP_LOGICAL_OR
:
10532 case UNOP_LOGICAL_NOT
:
10537 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10538 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10539 return value_cast (type
, val
);
10542 case BINOP_BITWISE_AND
:
10543 case BINOP_BITWISE_IOR
:
10544 case BINOP_BITWISE_XOR
:
10548 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10550 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10552 return value_cast (value_type (arg1
), val
);
10558 if (noside
== EVAL_SKIP
)
10564 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10565 /* Only encountered when an unresolved symbol occurs in a
10566 context other than a function call, in which case, it is
10568 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10569 exp
->elts
[pc
+ 2].symbol
->print_name ());
10571 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10573 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10574 /* Check to see if this is a tagged type. We also need to handle
10575 the case where the type is a reference to a tagged type, but
10576 we have to be careful to exclude pointers to tagged types.
10577 The latter should be shown as usual (as a pointer), whereas
10578 a reference should mostly be transparent to the user. */
10579 if (ada_is_tagged_type (type
, 0)
10580 || (type
->code () == TYPE_CODE_REF
10581 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10583 /* Tagged types are a little special in the fact that the real
10584 type is dynamic and can only be determined by inspecting the
10585 object's tag. This means that we need to get the object's
10586 value first (EVAL_NORMAL) and then extract the actual object
10589 Note that we cannot skip the final step where we extract
10590 the object type from its tag, because the EVAL_NORMAL phase
10591 results in dynamic components being resolved into fixed ones.
10592 This can cause problems when trying to print the type
10593 description of tagged types whose parent has a dynamic size:
10594 We use the type name of the "_parent" component in order
10595 to print the name of the ancestor type in the type description.
10596 If that component had a dynamic size, the resolution into
10597 a fixed type would result in the loss of that type name,
10598 thus preventing us from printing the name of the ancestor
10599 type in the type description. */
10600 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10602 if (type
->code () != TYPE_CODE_REF
)
10604 struct type
*actual_type
;
10606 actual_type
= type_from_tag (ada_value_tag (arg1
));
10607 if (actual_type
== NULL
)
10608 /* If, for some reason, we were unable to determine
10609 the actual type from the tag, then use the static
10610 approximation that we just computed as a fallback.
10611 This can happen if the debugging information is
10612 incomplete, for instance. */
10613 actual_type
= type
;
10614 return value_zero (actual_type
, not_lval
);
10618 /* In the case of a ref, ada_coerce_ref takes care
10619 of determining the actual type. But the evaluation
10620 should return a ref as it should be valid to ask
10621 for its address; so rebuild a ref after coerce. */
10622 arg1
= ada_coerce_ref (arg1
);
10623 return value_ref (arg1
, TYPE_CODE_REF
);
10627 /* Records and unions for which GNAT encodings have been
10628 generated need to be statically fixed as well.
10629 Otherwise, non-static fixing produces a type where
10630 all dynamic properties are removed, which prevents "ptype"
10631 from being able to completely describe the type.
10632 For instance, a case statement in a variant record would be
10633 replaced by the relevant components based on the actual
10634 value of the discriminants. */
10635 if ((type
->code () == TYPE_CODE_STRUCT
10636 && dynamic_template_type (type
) != NULL
)
10637 || (type
->code () == TYPE_CODE_UNION
10638 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10641 return value_zero (to_static_fixed_type (type
), not_lval
);
10645 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10646 return ada_to_fixed_value (arg1
);
10651 /* Allocate arg vector, including space for the function to be
10652 called in argvec[0] and a terminating NULL. */
10653 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10654 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10656 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10657 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10658 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10659 exp
->elts
[pc
+ 5].symbol
->print_name ());
10662 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10663 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10666 if (noside
== EVAL_SKIP
)
10670 if (ada_is_constrained_packed_array_type
10671 (desc_base_type (value_type (argvec
[0]))))
10672 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10673 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10674 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10675 /* This is a packed array that has already been fixed, and
10676 therefore already coerced to a simple array. Nothing further
10679 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10681 /* Make sure we dereference references so that all the code below
10682 feels like it's really handling the referenced value. Wrapping
10683 types (for alignment) may be there, so make sure we strip them as
10685 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10687 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10688 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10689 argvec
[0] = value_addr (argvec
[0]);
10691 type
= ada_check_typedef (value_type (argvec
[0]));
10693 /* Ada allows us to implicitly dereference arrays when subscripting
10694 them. So, if this is an array typedef (encoding use for array
10695 access types encoded as fat pointers), strip it now. */
10696 if (type
->code () == TYPE_CODE_TYPEDEF
)
10697 type
= ada_typedef_target_type (type
);
10699 if (type
->code () == TYPE_CODE_PTR
)
10701 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10703 case TYPE_CODE_FUNC
:
10704 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10706 case TYPE_CODE_ARRAY
:
10708 case TYPE_CODE_STRUCT
:
10709 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10710 argvec
[0] = ada_value_ind (argvec
[0]);
10711 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10714 error (_("cannot subscript or call something of type `%s'"),
10715 ada_type_name (value_type (argvec
[0])));
10720 switch (type
->code ())
10722 case TYPE_CODE_FUNC
:
10723 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10725 if (TYPE_TARGET_TYPE (type
) == NULL
)
10726 error_call_unknown_return_type (NULL
);
10727 return allocate_value (TYPE_TARGET_TYPE (type
));
10729 return call_function_by_hand (argvec
[0], NULL
,
10730 gdb::make_array_view (argvec
+ 1,
10732 case TYPE_CODE_INTERNAL_FUNCTION
:
10733 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10734 /* We don't know anything about what the internal
10735 function might return, but we have to return
10737 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10740 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10741 argvec
[0], nargs
, argvec
+ 1);
10743 case TYPE_CODE_STRUCT
:
10747 arity
= ada_array_arity (type
);
10748 type
= ada_array_element_type (type
, nargs
);
10750 error (_("cannot subscript or call a record"));
10751 if (arity
!= nargs
)
10752 error (_("wrong number of subscripts; expecting %d"), arity
);
10753 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10754 return value_zero (ada_aligned_type (type
), lval_memory
);
10756 unwrap_value (ada_value_subscript
10757 (argvec
[0], nargs
, argvec
+ 1));
10759 case TYPE_CODE_ARRAY
:
10760 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10762 type
= ada_array_element_type (type
, nargs
);
10764 error (_("element type of array unknown"));
10766 return value_zero (ada_aligned_type (type
), lval_memory
);
10769 unwrap_value (ada_value_subscript
10770 (ada_coerce_to_simple_array (argvec
[0]),
10771 nargs
, argvec
+ 1));
10772 case TYPE_CODE_PTR
: /* Pointer to array */
10773 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10775 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10776 type
= ada_array_element_type (type
, nargs
);
10778 error (_("element type of array unknown"));
10780 return value_zero (ada_aligned_type (type
), lval_memory
);
10783 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10784 nargs
, argvec
+ 1));
10787 error (_("Attempt to index or call something other than an "
10788 "array or function"));
10793 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10794 struct value
*low_bound_val
=
10795 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10796 struct value
*high_bound_val
=
10797 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10799 LONGEST high_bound
;
10801 low_bound_val
= coerce_ref (low_bound_val
);
10802 high_bound_val
= coerce_ref (high_bound_val
);
10803 low_bound
= value_as_long (low_bound_val
);
10804 high_bound
= value_as_long (high_bound_val
);
10806 if (noside
== EVAL_SKIP
)
10809 /* If this is a reference to an aligner type, then remove all
10811 if (value_type (array
)->code () == TYPE_CODE_REF
10812 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10813 TYPE_TARGET_TYPE (value_type (array
)) =
10814 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10816 if (ada_is_constrained_packed_array_type (value_type (array
)))
10817 error (_("cannot slice a packed array"));
10819 /* If this is a reference to an array or an array lvalue,
10820 convert to a pointer. */
10821 if (value_type (array
)->code () == TYPE_CODE_REF
10822 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10823 && VALUE_LVAL (array
) == lval_memory
))
10824 array
= value_addr (array
);
10826 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10827 && ada_is_array_descriptor_type (ada_check_typedef
10828 (value_type (array
))))
10829 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10832 array
= ada_coerce_to_simple_array_ptr (array
);
10834 /* If we have more than one level of pointer indirection,
10835 dereference the value until we get only one level. */
10836 while (value_type (array
)->code () == TYPE_CODE_PTR
10837 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10839 array
= value_ind (array
);
10841 /* Make sure we really do have an array type before going further,
10842 to avoid a SEGV when trying to get the index type or the target
10843 type later down the road if the debug info generated by
10844 the compiler is incorrect or incomplete. */
10845 if (!ada_is_simple_array_type (value_type (array
)))
10846 error (_("cannot take slice of non-array"));
10848 if (ada_check_typedef (value_type (array
))->code ()
10851 struct type
*type0
= ada_check_typedef (value_type (array
));
10853 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10854 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10857 struct type
*arr_type0
=
10858 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10860 return ada_value_slice_from_ptr (array
, arr_type0
,
10861 longest_to_int (low_bound
),
10862 longest_to_int (high_bound
));
10865 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10867 else if (high_bound
< low_bound
)
10868 return empty_array (value_type (array
), low_bound
, high_bound
);
10870 return ada_value_slice (array
, longest_to_int (low_bound
),
10871 longest_to_int (high_bound
));
10874 case UNOP_IN_RANGE
:
10876 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10877 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10879 if (noside
== EVAL_SKIP
)
10882 switch (type
->code ())
10885 lim_warning (_("Membership test incompletely implemented; "
10886 "always returns true"));
10887 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10888 return value_from_longest (type
, (LONGEST
) 1);
10890 case TYPE_CODE_RANGE
:
10891 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10892 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10893 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10894 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10895 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10897 value_from_longest (type
,
10898 (value_less (arg1
, arg3
)
10899 || value_equal (arg1
, arg3
))
10900 && (value_less (arg2
, arg1
)
10901 || value_equal (arg2
, arg1
)));
10904 case BINOP_IN_BOUNDS
:
10906 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10907 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10909 if (noside
== EVAL_SKIP
)
10912 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10914 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10915 return value_zero (type
, not_lval
);
10918 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10920 type
= ada_index_type (value_type (arg2
), tem
, "range");
10922 type
= value_type (arg1
);
10924 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10925 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10927 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10928 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10929 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10931 value_from_longest (type
,
10932 (value_less (arg1
, arg3
)
10933 || value_equal (arg1
, arg3
))
10934 && (value_less (arg2
, arg1
)
10935 || value_equal (arg2
, arg1
)));
10937 case TERNOP_IN_RANGE
:
10938 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10939 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10940 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10942 if (noside
== EVAL_SKIP
)
10945 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10946 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10947 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10949 value_from_longest (type
,
10950 (value_less (arg1
, arg3
)
10951 || value_equal (arg1
, arg3
))
10952 && (value_less (arg2
, arg1
)
10953 || value_equal (arg2
, arg1
)));
10957 case OP_ATR_LENGTH
:
10959 struct type
*type_arg
;
10961 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10963 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10965 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10969 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10973 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10974 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10975 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10978 if (noside
== EVAL_SKIP
)
10980 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10982 if (type_arg
== NULL
)
10983 type_arg
= value_type (arg1
);
10985 if (ada_is_constrained_packed_array_type (type_arg
))
10986 type_arg
= decode_constrained_packed_array_type (type_arg
);
10988 if (!discrete_type_p (type_arg
))
10992 default: /* Should never happen. */
10993 error (_("unexpected attribute encountered"));
10996 type_arg
= ada_index_type (type_arg
, tem
,
10997 ada_attribute_name (op
));
10999 case OP_ATR_LENGTH
:
11000 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
11005 return value_zero (type_arg
, not_lval
);
11007 else if (type_arg
== NULL
)
11009 arg1
= ada_coerce_ref (arg1
);
11011 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
11012 arg1
= ada_coerce_to_simple_array (arg1
);
11014 if (op
== OP_ATR_LENGTH
)
11015 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11018 type
= ada_index_type (value_type (arg1
), tem
,
11019 ada_attribute_name (op
));
11021 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11026 default: /* Should never happen. */
11027 error (_("unexpected attribute encountered"));
11029 return value_from_longest
11030 (type
, ada_array_bound (arg1
, tem
, 0));
11032 return value_from_longest
11033 (type
, ada_array_bound (arg1
, tem
, 1));
11034 case OP_ATR_LENGTH
:
11035 return value_from_longest
11036 (type
, ada_array_length (arg1
, tem
));
11039 else if (discrete_type_p (type_arg
))
11041 struct type
*range_type
;
11042 const char *name
= ada_type_name (type_arg
);
11045 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
11046 range_type
= to_fixed_range_type (type_arg
, NULL
);
11047 if (range_type
== NULL
)
11048 range_type
= type_arg
;
11052 error (_("unexpected attribute encountered"));
11054 return value_from_longest
11055 (range_type
, ada_discrete_type_low_bound (range_type
));
11057 return value_from_longest
11058 (range_type
, ada_discrete_type_high_bound (range_type
));
11059 case OP_ATR_LENGTH
:
11060 error (_("the 'length attribute applies only to array types"));
11063 else if (type_arg
->code () == TYPE_CODE_FLT
)
11064 error (_("unimplemented type attribute"));
11069 if (ada_is_constrained_packed_array_type (type_arg
))
11070 type_arg
= decode_constrained_packed_array_type (type_arg
);
11072 if (op
== OP_ATR_LENGTH
)
11073 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11076 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11078 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11084 error (_("unexpected attribute encountered"));
11086 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11087 return value_from_longest (type
, low
);
11089 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11090 return value_from_longest (type
, high
);
11091 case OP_ATR_LENGTH
:
11092 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11093 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11094 return value_from_longest (type
, high
- low
+ 1);
11100 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11101 if (noside
== EVAL_SKIP
)
11104 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11105 return value_zero (ada_tag_type (arg1
), not_lval
);
11107 return ada_value_tag (arg1
);
11111 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11112 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11113 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11114 if (noside
== EVAL_SKIP
)
11116 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11117 return value_zero (value_type (arg1
), not_lval
);
11120 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11121 return value_binop (arg1
, arg2
,
11122 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11125 case OP_ATR_MODULUS
:
11127 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11129 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11130 if (noside
== EVAL_SKIP
)
11133 if (!ada_is_modular_type (type_arg
))
11134 error (_("'modulus must be applied to modular type"));
11136 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11137 ada_modulus (type_arg
));
11142 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11143 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11144 if (noside
== EVAL_SKIP
)
11146 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11147 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11148 return value_zero (type
, not_lval
);
11150 return value_pos_atr (type
, arg1
);
11153 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11154 type
= value_type (arg1
);
11156 /* If the argument is a reference, then dereference its type, since
11157 the user is really asking for the size of the actual object,
11158 not the size of the pointer. */
11159 if (type
->code () == TYPE_CODE_REF
)
11160 type
= TYPE_TARGET_TYPE (type
);
11162 if (noside
== EVAL_SKIP
)
11164 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11165 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11167 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11168 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11171 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11172 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11173 type
= exp
->elts
[pc
+ 2].type
;
11174 if (noside
== EVAL_SKIP
)
11176 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11177 return value_zero (type
, not_lval
);
11179 return value_val_atr (type
, arg1
);
11182 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11183 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11184 if (noside
== EVAL_SKIP
)
11186 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11187 return value_zero (value_type (arg1
), not_lval
);
11190 /* For integer exponentiation operations,
11191 only promote the first argument. */
11192 if (is_integral_type (value_type (arg2
)))
11193 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11195 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11197 return value_binop (arg1
, arg2
, op
);
11201 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11202 if (noside
== EVAL_SKIP
)
11208 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11209 if (noside
== EVAL_SKIP
)
11211 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11212 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11213 return value_neg (arg1
);
11218 preeval_pos
= *pos
;
11219 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11220 if (noside
== EVAL_SKIP
)
11222 type
= ada_check_typedef (value_type (arg1
));
11223 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11225 if (ada_is_array_descriptor_type (type
))
11226 /* GDB allows dereferencing GNAT array descriptors. */
11228 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11230 if (arrType
== NULL
)
11231 error (_("Attempt to dereference null array pointer."));
11232 return value_at_lazy (arrType
, 0);
11234 else if (type
->code () == TYPE_CODE_PTR
11235 || type
->code () == TYPE_CODE_REF
11236 /* In C you can dereference an array to get the 1st elt. */
11237 || type
->code () == TYPE_CODE_ARRAY
)
11239 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11240 only be determined by inspecting the object's tag.
11241 This means that we need to evaluate completely the
11242 expression in order to get its type. */
11244 if ((type
->code () == TYPE_CODE_REF
11245 || type
->code () == TYPE_CODE_PTR
)
11246 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11248 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11250 type
= value_type (ada_value_ind (arg1
));
11254 type
= to_static_fixed_type
11256 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11258 ada_ensure_varsize_limit (type
);
11259 return value_zero (type
, lval_memory
);
11261 else if (type
->code () == TYPE_CODE_INT
)
11263 /* GDB allows dereferencing an int. */
11264 if (expect_type
== NULL
)
11265 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11270 to_static_fixed_type (ada_aligned_type (expect_type
));
11271 return value_zero (expect_type
, lval_memory
);
11275 error (_("Attempt to take contents of a non-pointer value."));
11277 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11278 type
= ada_check_typedef (value_type (arg1
));
11280 if (type
->code () == TYPE_CODE_INT
)
11281 /* GDB allows dereferencing an int. If we were given
11282 the expect_type, then use that as the target type.
11283 Otherwise, assume that the target type is an int. */
11285 if (expect_type
!= NULL
)
11286 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11289 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11290 (CORE_ADDR
) value_as_address (arg1
));
11293 if (ada_is_array_descriptor_type (type
))
11294 /* GDB allows dereferencing GNAT array descriptors. */
11295 return ada_coerce_to_simple_array (arg1
);
11297 return ada_value_ind (arg1
);
11299 case STRUCTOP_STRUCT
:
11300 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11301 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11302 preeval_pos
= *pos
;
11303 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11304 if (noside
== EVAL_SKIP
)
11306 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11308 struct type
*type1
= value_type (arg1
);
11310 if (ada_is_tagged_type (type1
, 1))
11312 type
= ada_lookup_struct_elt_type (type1
,
11313 &exp
->elts
[pc
+ 2].string
,
11316 /* If the field is not found, check if it exists in the
11317 extension of this object's type. This means that we
11318 need to evaluate completely the expression. */
11322 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11324 arg1
= ada_value_struct_elt (arg1
,
11325 &exp
->elts
[pc
+ 2].string
,
11327 arg1
= unwrap_value (arg1
);
11328 type
= value_type (ada_to_fixed_value (arg1
));
11333 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11336 return value_zero (ada_aligned_type (type
), lval_memory
);
11340 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11341 arg1
= unwrap_value (arg1
);
11342 return ada_to_fixed_value (arg1
);
11346 /* The value is not supposed to be used. This is here to make it
11347 easier to accommodate expressions that contain types. */
11349 if (noside
== EVAL_SKIP
)
11351 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11352 return allocate_value (exp
->elts
[pc
+ 1].type
);
11354 error (_("Attempt to use a type name as an expression"));
11359 case OP_DISCRETE_RANGE
:
11360 case OP_POSITIONAL
:
11362 if (noside
== EVAL_NORMAL
)
11366 error (_("Undefined name, ambiguous name, or renaming used in "
11367 "component association: %s."), &exp
->elts
[pc
+2].string
);
11369 error (_("Aggregates only allowed on the right of an assignment"));
11371 internal_error (__FILE__
, __LINE__
,
11372 _("aggregate apparently mangled"));
11375 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11377 for (tem
= 0; tem
< nargs
; tem
+= 1)
11378 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11383 return eval_skip_value (exp
);
11389 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11390 type name that encodes the 'small and 'delta information.
11391 Otherwise, return NULL. */
11393 static const char *
11394 gnat_encoded_fixed_type_info (struct type
*type
)
11396 const char *name
= ada_type_name (type
);
11397 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: type
->code ();
11399 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11401 const char *tail
= strstr (name
, "___XF_");
11408 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11409 return gnat_encoded_fixed_type_info (TYPE_TARGET_TYPE (type
));
11414 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11417 ada_is_gnat_encoded_fixed_point_type (struct type
*type
)
11419 return gnat_encoded_fixed_type_info (type
) != NULL
;
11422 /* Return non-zero iff TYPE represents a System.Address type. */
11425 ada_is_system_address_type (struct type
*type
)
11427 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11430 /* Assuming that TYPE is the representation of an Ada fixed-point
11431 type, return the target floating-point type to be used to represent
11432 of this type during internal computation. */
11434 static struct type
*
11435 ada_scaling_type (struct type
*type
)
11437 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11440 /* Assuming that TYPE is the representation of an Ada fixed-point
11441 type, return its delta, or NULL if the type is malformed and the
11442 delta cannot be determined. */
11445 gnat_encoded_fixed_point_delta (struct type
*type
)
11447 const char *encoding
= gnat_encoded_fixed_type_info (type
);
11448 struct type
*scale_type
= ada_scaling_type (type
);
11450 long long num
, den
;
11452 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11455 return value_binop (value_from_longest (scale_type
, num
),
11456 value_from_longest (scale_type
, den
), BINOP_DIV
);
11459 /* Assuming that ada_is_gnat_encoded_fixed_point_type (TYPE), return
11460 the scaling factor ('SMALL value) associated with the type. */
11463 ada_scaling_factor (struct type
*type
)
11465 const char *encoding
= gnat_encoded_fixed_type_info (type
);
11466 struct type
*scale_type
= ada_scaling_type (type
);
11468 long long num0
, den0
, num1
, den1
;
11471 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11472 &num0
, &den0
, &num1
, &den1
);
11475 return value_from_longest (scale_type
, 1);
11477 return value_binop (value_from_longest (scale_type
, num1
),
11478 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11480 return value_binop (value_from_longest (scale_type
, num0
),
11481 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11488 /* Scan STR beginning at position K for a discriminant name, and
11489 return the value of that discriminant field of DVAL in *PX. If
11490 PNEW_K is not null, put the position of the character beyond the
11491 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11492 not alter *PX and *PNEW_K if unsuccessful. */
11495 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11498 static char *bound_buffer
= NULL
;
11499 static size_t bound_buffer_len
= 0;
11500 const char *pstart
, *pend
, *bound
;
11501 struct value
*bound_val
;
11503 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11507 pend
= strstr (pstart
, "__");
11511 k
+= strlen (bound
);
11515 int len
= pend
- pstart
;
11517 /* Strip __ and beyond. */
11518 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11519 strncpy (bound_buffer
, pstart
, len
);
11520 bound_buffer
[len
] = '\0';
11522 bound
= bound_buffer
;
11526 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11527 if (bound_val
== NULL
)
11530 *px
= value_as_long (bound_val
);
11531 if (pnew_k
!= NULL
)
11536 /* Value of variable named NAME in the current environment. If
11537 no such variable found, then if ERR_MSG is null, returns 0, and
11538 otherwise causes an error with message ERR_MSG. */
11540 static struct value
*
11541 get_var_value (const char *name
, const char *err_msg
)
11543 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11545 std::vector
<struct block_symbol
> syms
;
11546 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11547 get_selected_block (0),
11548 VAR_DOMAIN
, &syms
, 1);
11552 if (err_msg
== NULL
)
11555 error (("%s"), err_msg
);
11558 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11561 /* Value of integer variable named NAME in the current environment.
11562 If no such variable is found, returns false. Otherwise, sets VALUE
11563 to the variable's value and returns true. */
11566 get_int_var_value (const char *name
, LONGEST
&value
)
11568 struct value
*var_val
= get_var_value (name
, 0);
11573 value
= value_as_long (var_val
);
11578 /* Return a range type whose base type is that of the range type named
11579 NAME in the current environment, and whose bounds are calculated
11580 from NAME according to the GNAT range encoding conventions.
11581 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11582 corresponding range type from debug information; fall back to using it
11583 if symbol lookup fails. If a new type must be created, allocate it
11584 like ORIG_TYPE was. The bounds information, in general, is encoded
11585 in NAME, the base type given in the named range type. */
11587 static struct type
*
11588 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11591 struct type
*base_type
;
11592 const char *subtype_info
;
11594 gdb_assert (raw_type
!= NULL
);
11595 gdb_assert (raw_type
->name () != NULL
);
11597 if (raw_type
->code () == TYPE_CODE_RANGE
)
11598 base_type
= TYPE_TARGET_TYPE (raw_type
);
11600 base_type
= raw_type
;
11602 name
= raw_type
->name ();
11603 subtype_info
= strstr (name
, "___XD");
11604 if (subtype_info
== NULL
)
11606 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11607 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11609 if (L
< INT_MIN
|| U
> INT_MAX
)
11612 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11617 static char *name_buf
= NULL
;
11618 static size_t name_len
= 0;
11619 int prefix_len
= subtype_info
- name
;
11622 const char *bounds_str
;
11625 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11626 strncpy (name_buf
, name
, prefix_len
);
11627 name_buf
[prefix_len
] = '\0';
11630 bounds_str
= strchr (subtype_info
, '_');
11633 if (*subtype_info
== 'L')
11635 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11636 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11638 if (bounds_str
[n
] == '_')
11640 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11646 strcpy (name_buf
+ prefix_len
, "___L");
11647 if (!get_int_var_value (name_buf
, L
))
11649 lim_warning (_("Unknown lower bound, using 1."));
11654 if (*subtype_info
== 'U')
11656 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11657 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11662 strcpy (name_buf
+ prefix_len
, "___U");
11663 if (!get_int_var_value (name_buf
, U
))
11665 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11670 type
= create_static_range_type (alloc_type_copy (raw_type
),
11672 /* create_static_range_type alters the resulting type's length
11673 to match the size of the base_type, which is not what we want.
11674 Set it back to the original range type's length. */
11675 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11676 type
->set_name (name
);
11681 /* True iff NAME is the name of a range type. */
11684 ada_is_range_type_name (const char *name
)
11686 return (name
!= NULL
&& strstr (name
, "___XD"));
11690 /* Modular types */
11692 /* True iff TYPE is an Ada modular type. */
11695 ada_is_modular_type (struct type
*type
)
11697 struct type
*subranged_type
= get_base_type (type
);
11699 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11700 && subranged_type
->code () == TYPE_CODE_INT
11701 && TYPE_UNSIGNED (subranged_type
));
11704 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11707 ada_modulus (struct type
*type
)
11709 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11713 /* Ada exception catchpoint support:
11714 ---------------------------------
11716 We support 3 kinds of exception catchpoints:
11717 . catchpoints on Ada exceptions
11718 . catchpoints on unhandled Ada exceptions
11719 . catchpoints on failed assertions
11721 Exceptions raised during failed assertions, or unhandled exceptions
11722 could perfectly be caught with the general catchpoint on Ada exceptions.
11723 However, we can easily differentiate these two special cases, and having
11724 the option to distinguish these two cases from the rest can be useful
11725 to zero-in on certain situations.
11727 Exception catchpoints are a specialized form of breakpoint,
11728 since they rely on inserting breakpoints inside known routines
11729 of the GNAT runtime. The implementation therefore uses a standard
11730 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11733 Support in the runtime for exception catchpoints have been changed
11734 a few times already, and these changes affect the implementation
11735 of these catchpoints. In order to be able to support several
11736 variants of the runtime, we use a sniffer that will determine
11737 the runtime variant used by the program being debugged. */
11739 /* Ada's standard exceptions.
11741 The Ada 83 standard also defined Numeric_Error. But there so many
11742 situations where it was unclear from the Ada 83 Reference Manual
11743 (RM) whether Constraint_Error or Numeric_Error should be raised,
11744 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11745 Interpretation saying that anytime the RM says that Numeric_Error
11746 should be raised, the implementation may raise Constraint_Error.
11747 Ada 95 went one step further and pretty much removed Numeric_Error
11748 from the list of standard exceptions (it made it a renaming of
11749 Constraint_Error, to help preserve compatibility when compiling
11750 an Ada83 compiler). As such, we do not include Numeric_Error from
11751 this list of standard exceptions. */
11753 static const char *standard_exc
[] = {
11754 "constraint_error",
11760 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11762 /* A structure that describes how to support exception catchpoints
11763 for a given executable. */
11765 struct exception_support_info
11767 /* The name of the symbol to break on in order to insert
11768 a catchpoint on exceptions. */
11769 const char *catch_exception_sym
;
11771 /* The name of the symbol to break on in order to insert
11772 a catchpoint on unhandled exceptions. */
11773 const char *catch_exception_unhandled_sym
;
11775 /* The name of the symbol to break on in order to insert
11776 a catchpoint on failed assertions. */
11777 const char *catch_assert_sym
;
11779 /* The name of the symbol to break on in order to insert
11780 a catchpoint on exception handling. */
11781 const char *catch_handlers_sym
;
11783 /* Assuming that the inferior just triggered an unhandled exception
11784 catchpoint, this function is responsible for returning the address
11785 in inferior memory where the name of that exception is stored.
11786 Return zero if the address could not be computed. */
11787 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11790 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11791 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11793 /* The following exception support info structure describes how to
11794 implement exception catchpoints with the latest version of the
11795 Ada runtime (as of 2019-08-??). */
11797 static const struct exception_support_info default_exception_support_info
=
11799 "__gnat_debug_raise_exception", /* catch_exception_sym */
11800 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11801 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11802 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11803 ada_unhandled_exception_name_addr
11806 /* The following exception support info structure describes how to
11807 implement exception catchpoints with an earlier version of the
11808 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11810 static const struct exception_support_info exception_support_info_v0
=
11812 "__gnat_debug_raise_exception", /* catch_exception_sym */
11813 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11814 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11815 "__gnat_begin_handler", /* catch_handlers_sym */
11816 ada_unhandled_exception_name_addr
11819 /* The following exception support info structure describes how to
11820 implement exception catchpoints with a slightly older version
11821 of the Ada runtime. */
11823 static const struct exception_support_info exception_support_info_fallback
=
11825 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11826 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11827 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11828 "__gnat_begin_handler", /* catch_handlers_sym */
11829 ada_unhandled_exception_name_addr_from_raise
11832 /* Return nonzero if we can detect the exception support routines
11833 described in EINFO.
11835 This function errors out if an abnormal situation is detected
11836 (for instance, if we find the exception support routines, but
11837 that support is found to be incomplete). */
11840 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11842 struct symbol
*sym
;
11844 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11845 that should be compiled with debugging information. As a result, we
11846 expect to find that symbol in the symtabs. */
11848 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11851 /* Perhaps we did not find our symbol because the Ada runtime was
11852 compiled without debugging info, or simply stripped of it.
11853 It happens on some GNU/Linux distributions for instance, where
11854 users have to install a separate debug package in order to get
11855 the runtime's debugging info. In that situation, let the user
11856 know why we cannot insert an Ada exception catchpoint.
11858 Note: Just for the purpose of inserting our Ada exception
11859 catchpoint, we could rely purely on the associated minimal symbol.
11860 But we would be operating in degraded mode anyway, since we are
11861 still lacking the debugging info needed later on to extract
11862 the name of the exception being raised (this name is printed in
11863 the catchpoint message, and is also used when trying to catch
11864 a specific exception). We do not handle this case for now. */
11865 struct bound_minimal_symbol msym
11866 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11868 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11869 error (_("Your Ada runtime appears to be missing some debugging "
11870 "information.\nCannot insert Ada exception catchpoint "
11871 "in this configuration."));
11876 /* Make sure that the symbol we found corresponds to a function. */
11878 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11880 error (_("Symbol \"%s\" is not a function (class = %d)"),
11881 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11885 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11888 struct bound_minimal_symbol msym
11889 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11891 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11892 error (_("Your Ada runtime appears to be missing some debugging "
11893 "information.\nCannot insert Ada exception catchpoint "
11894 "in this configuration."));
11899 /* Make sure that the symbol we found corresponds to a function. */
11901 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11903 error (_("Symbol \"%s\" is not a function (class = %d)"),
11904 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11911 /* Inspect the Ada runtime and determine which exception info structure
11912 should be used to provide support for exception catchpoints.
11914 This function will always set the per-inferior exception_info,
11915 or raise an error. */
11918 ada_exception_support_info_sniffer (void)
11920 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11922 /* If the exception info is already known, then no need to recompute it. */
11923 if (data
->exception_info
!= NULL
)
11926 /* Check the latest (default) exception support info. */
11927 if (ada_has_this_exception_support (&default_exception_support_info
))
11929 data
->exception_info
= &default_exception_support_info
;
11933 /* Try the v0 exception suport info. */
11934 if (ada_has_this_exception_support (&exception_support_info_v0
))
11936 data
->exception_info
= &exception_support_info_v0
;
11940 /* Try our fallback exception suport info. */
11941 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11943 data
->exception_info
= &exception_support_info_fallback
;
11947 /* Sometimes, it is normal for us to not be able to find the routine
11948 we are looking for. This happens when the program is linked with
11949 the shared version of the GNAT runtime, and the program has not been
11950 started yet. Inform the user of these two possible causes if
11953 if (ada_update_initial_language (language_unknown
) != language_ada
)
11954 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11956 /* If the symbol does not exist, then check that the program is
11957 already started, to make sure that shared libraries have been
11958 loaded. If it is not started, this may mean that the symbol is
11959 in a shared library. */
11961 if (inferior_ptid
.pid () == 0)
11962 error (_("Unable to insert catchpoint. Try to start the program first."));
11964 /* At this point, we know that we are debugging an Ada program and
11965 that the inferior has been started, but we still are not able to
11966 find the run-time symbols. That can mean that we are in
11967 configurable run time mode, or that a-except as been optimized
11968 out by the linker... In any case, at this point it is not worth
11969 supporting this feature. */
11971 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11974 /* True iff FRAME is very likely to be that of a function that is
11975 part of the runtime system. This is all very heuristic, but is
11976 intended to be used as advice as to what frames are uninteresting
11980 is_known_support_routine (struct frame_info
*frame
)
11982 enum language func_lang
;
11984 const char *fullname
;
11986 /* If this code does not have any debugging information (no symtab),
11987 This cannot be any user code. */
11989 symtab_and_line sal
= find_frame_sal (frame
);
11990 if (sal
.symtab
== NULL
)
11993 /* If there is a symtab, but the associated source file cannot be
11994 located, then assume this is not user code: Selecting a frame
11995 for which we cannot display the code would not be very helpful
11996 for the user. This should also take care of case such as VxWorks
11997 where the kernel has some debugging info provided for a few units. */
11999 fullname
= symtab_to_fullname (sal
.symtab
);
12000 if (access (fullname
, R_OK
) != 0)
12003 /* Check the unit filename against the Ada runtime file naming.
12004 We also check the name of the objfile against the name of some
12005 known system libraries that sometimes come with debugging info
12008 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
12010 re_comp (known_runtime_file_name_patterns
[i
]);
12011 if (re_exec (lbasename (sal
.symtab
->filename
)))
12013 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
12014 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
12018 /* Check whether the function is a GNAT-generated entity. */
12020 gdb::unique_xmalloc_ptr
<char> func_name
12021 = find_frame_funname (frame
, &func_lang
, NULL
);
12022 if (func_name
== NULL
)
12025 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
12027 re_comp (known_auxiliary_function_name_patterns
[i
]);
12028 if (re_exec (func_name
.get ()))
12035 /* Find the first frame that contains debugging information and that is not
12036 part of the Ada run-time, starting from FI and moving upward. */
12039 ada_find_printable_frame (struct frame_info
*fi
)
12041 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
12043 if (!is_known_support_routine (fi
))
12052 /* Assuming that the inferior just triggered an unhandled exception
12053 catchpoint, return the address in inferior memory where the name
12054 of the exception is stored.
12056 Return zero if the address could not be computed. */
12059 ada_unhandled_exception_name_addr (void)
12061 return parse_and_eval_address ("e.full_name");
12064 /* Same as ada_unhandled_exception_name_addr, except that this function
12065 should be used when the inferior uses an older version of the runtime,
12066 where the exception name needs to be extracted from a specific frame
12067 several frames up in the callstack. */
12070 ada_unhandled_exception_name_addr_from_raise (void)
12073 struct frame_info
*fi
;
12074 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12076 /* To determine the name of this exception, we need to select
12077 the frame corresponding to RAISE_SYM_NAME. This frame is
12078 at least 3 levels up, so we simply skip the first 3 frames
12079 without checking the name of their associated function. */
12080 fi
= get_current_frame ();
12081 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
12083 fi
= get_prev_frame (fi
);
12087 enum language func_lang
;
12089 gdb::unique_xmalloc_ptr
<char> func_name
12090 = find_frame_funname (fi
, &func_lang
, NULL
);
12091 if (func_name
!= NULL
)
12093 if (strcmp (func_name
.get (),
12094 data
->exception_info
->catch_exception_sym
) == 0)
12095 break; /* We found the frame we were looking for... */
12097 fi
= get_prev_frame (fi
);
12104 return parse_and_eval_address ("id.full_name");
12107 /* Assuming the inferior just triggered an Ada exception catchpoint
12108 (of any type), return the address in inferior memory where the name
12109 of the exception is stored, if applicable.
12111 Assumes the selected frame is the current frame.
12113 Return zero if the address could not be computed, or if not relevant. */
12116 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12117 struct breakpoint
*b
)
12119 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12123 case ada_catch_exception
:
12124 return (parse_and_eval_address ("e.full_name"));
12127 case ada_catch_exception_unhandled
:
12128 return data
->exception_info
->unhandled_exception_name_addr ();
12131 case ada_catch_handlers
:
12132 return 0; /* The runtimes does not provide access to the exception
12136 case ada_catch_assert
:
12137 return 0; /* Exception name is not relevant in this case. */
12141 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12145 return 0; /* Should never be reached. */
12148 /* Assuming the inferior is stopped at an exception catchpoint,
12149 return the message which was associated to the exception, if
12150 available. Return NULL if the message could not be retrieved.
12152 Note: The exception message can be associated to an exception
12153 either through the use of the Raise_Exception function, or
12154 more simply (Ada 2005 and later), via:
12156 raise Exception_Name with "exception message";
12160 static gdb::unique_xmalloc_ptr
<char>
12161 ada_exception_message_1 (void)
12163 struct value
*e_msg_val
;
12166 /* For runtimes that support this feature, the exception message
12167 is passed as an unbounded string argument called "message". */
12168 e_msg_val
= parse_and_eval ("message");
12169 if (e_msg_val
== NULL
)
12170 return NULL
; /* Exception message not supported. */
12172 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
12173 gdb_assert (e_msg_val
!= NULL
);
12174 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
12176 /* If the message string is empty, then treat it as if there was
12177 no exception message. */
12178 if (e_msg_len
<= 0)
12181 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
12182 read_memory_string (value_address (e_msg_val
), e_msg
.get (), e_msg_len
+ 1);
12183 e_msg
.get ()[e_msg_len
] = '\0';
12188 /* Same as ada_exception_message_1, except that all exceptions are
12189 contained here (returning NULL instead). */
12191 static gdb::unique_xmalloc_ptr
<char>
12192 ada_exception_message (void)
12194 gdb::unique_xmalloc_ptr
<char> e_msg
;
12198 e_msg
= ada_exception_message_1 ();
12200 catch (const gdb_exception_error
&e
)
12202 e_msg
.reset (nullptr);
12208 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12209 any error that ada_exception_name_addr_1 might cause to be thrown.
12210 When an error is intercepted, a warning with the error message is printed,
12211 and zero is returned. */
12214 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12215 struct breakpoint
*b
)
12217 CORE_ADDR result
= 0;
12221 result
= ada_exception_name_addr_1 (ex
, b
);
12224 catch (const gdb_exception_error
&e
)
12226 warning (_("failed to get exception name: %s"), e
.what ());
12233 static std::string ada_exception_catchpoint_cond_string
12234 (const char *excep_string
,
12235 enum ada_exception_catchpoint_kind ex
);
12237 /* Ada catchpoints.
12239 In the case of catchpoints on Ada exceptions, the catchpoint will
12240 stop the target on every exception the program throws. When a user
12241 specifies the name of a specific exception, we translate this
12242 request into a condition expression (in text form), and then parse
12243 it into an expression stored in each of the catchpoint's locations.
12244 We then use this condition to check whether the exception that was
12245 raised is the one the user is interested in. If not, then the
12246 target is resumed again. We store the name of the requested
12247 exception, in order to be able to re-set the condition expression
12248 when symbols change. */
12250 /* An instance of this type is used to represent an Ada catchpoint
12251 breakpoint location. */
12253 class ada_catchpoint_location
: public bp_location
12256 ada_catchpoint_location (breakpoint
*owner
)
12257 : bp_location (owner
, bp_loc_software_breakpoint
)
12260 /* The condition that checks whether the exception that was raised
12261 is the specific exception the user specified on catchpoint
12263 expression_up excep_cond_expr
;
12266 /* An instance of this type is used to represent an Ada catchpoint. */
12268 struct ada_catchpoint
: public breakpoint
12270 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12275 /* The name of the specific exception the user specified. */
12276 std::string excep_string
;
12278 /* What kind of catchpoint this is. */
12279 enum ada_exception_catchpoint_kind m_kind
;
12282 /* Parse the exception condition string in the context of each of the
12283 catchpoint's locations, and store them for later evaluation. */
12286 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12287 enum ada_exception_catchpoint_kind ex
)
12289 struct bp_location
*bl
;
12291 /* Nothing to do if there's no specific exception to catch. */
12292 if (c
->excep_string
.empty ())
12295 /* Same if there are no locations... */
12296 if (c
->loc
== NULL
)
12299 /* Compute the condition expression in text form, from the specific
12300 expection we want to catch. */
12301 std::string cond_string
12302 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12304 /* Iterate over all the catchpoint's locations, and parse an
12305 expression for each. */
12306 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12308 struct ada_catchpoint_location
*ada_loc
12309 = (struct ada_catchpoint_location
*) bl
;
12312 if (!bl
->shlib_disabled
)
12316 s
= cond_string
.c_str ();
12319 exp
= parse_exp_1 (&s
, bl
->address
,
12320 block_for_pc (bl
->address
),
12323 catch (const gdb_exception_error
&e
)
12325 warning (_("failed to reevaluate internal exception condition "
12326 "for catchpoint %d: %s"),
12327 c
->number
, e
.what ());
12331 ada_loc
->excep_cond_expr
= std::move (exp
);
12335 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12336 structure for all exception catchpoint kinds. */
12338 static struct bp_location
*
12339 allocate_location_exception (struct breakpoint
*self
)
12341 return new ada_catchpoint_location (self
);
12344 /* Implement the RE_SET method in the breakpoint_ops structure for all
12345 exception catchpoint kinds. */
12348 re_set_exception (struct breakpoint
*b
)
12350 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12352 /* Call the base class's method. This updates the catchpoint's
12354 bkpt_breakpoint_ops
.re_set (b
);
12356 /* Reparse the exception conditional expressions. One for each
12358 create_excep_cond_exprs (c
, c
->m_kind
);
12361 /* Returns true if we should stop for this breakpoint hit. If the
12362 user specified a specific exception, we only want to cause a stop
12363 if the program thrown that exception. */
12366 should_stop_exception (const struct bp_location
*bl
)
12368 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12369 const struct ada_catchpoint_location
*ada_loc
12370 = (const struct ada_catchpoint_location
*) bl
;
12373 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12374 if (c
->m_kind
== ada_catch_assert
)
12375 clear_internalvar (var
);
12382 if (c
->m_kind
== ada_catch_handlers
)
12383 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12384 ".all.occurrence.id");
12388 struct value
*exc
= parse_and_eval (expr
);
12389 set_internalvar (var
, exc
);
12391 catch (const gdb_exception_error
&ex
)
12393 clear_internalvar (var
);
12397 /* With no specific exception, should always stop. */
12398 if (c
->excep_string
.empty ())
12401 if (ada_loc
->excep_cond_expr
== NULL
)
12403 /* We will have a NULL expression if back when we were creating
12404 the expressions, this location's had failed to parse. */
12411 struct value
*mark
;
12413 mark
= value_mark ();
12414 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12415 value_free_to_mark (mark
);
12417 catch (const gdb_exception
&ex
)
12419 exception_fprintf (gdb_stderr
, ex
,
12420 _("Error in testing exception condition:\n"));
12426 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12427 for all exception catchpoint kinds. */
12430 check_status_exception (bpstat bs
)
12432 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12435 /* Implement the PRINT_IT method in the breakpoint_ops structure
12436 for all exception catchpoint kinds. */
12438 static enum print_stop_action
12439 print_it_exception (bpstat bs
)
12441 struct ui_out
*uiout
= current_uiout
;
12442 struct breakpoint
*b
= bs
->breakpoint_at
;
12444 annotate_catchpoint (b
->number
);
12446 if (uiout
->is_mi_like_p ())
12448 uiout
->field_string ("reason",
12449 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12450 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12453 uiout
->text (b
->disposition
== disp_del
12454 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12455 uiout
->field_signed ("bkptno", b
->number
);
12456 uiout
->text (", ");
12458 /* ada_exception_name_addr relies on the selected frame being the
12459 current frame. Need to do this here because this function may be
12460 called more than once when printing a stop, and below, we'll
12461 select the first frame past the Ada run-time (see
12462 ada_find_printable_frame). */
12463 select_frame (get_current_frame ());
12465 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12468 case ada_catch_exception
:
12469 case ada_catch_exception_unhandled
:
12470 case ada_catch_handlers
:
12472 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12473 char exception_name
[256];
12477 read_memory (addr
, (gdb_byte
*) exception_name
,
12478 sizeof (exception_name
) - 1);
12479 exception_name
[sizeof (exception_name
) - 1] = '\0';
12483 /* For some reason, we were unable to read the exception
12484 name. This could happen if the Runtime was compiled
12485 without debugging info, for instance. In that case,
12486 just replace the exception name by the generic string
12487 "exception" - it will read as "an exception" in the
12488 notification we are about to print. */
12489 memcpy (exception_name
, "exception", sizeof ("exception"));
12491 /* In the case of unhandled exception breakpoints, we print
12492 the exception name as "unhandled EXCEPTION_NAME", to make
12493 it clearer to the user which kind of catchpoint just got
12494 hit. We used ui_out_text to make sure that this extra
12495 info does not pollute the exception name in the MI case. */
12496 if (c
->m_kind
== ada_catch_exception_unhandled
)
12497 uiout
->text ("unhandled ");
12498 uiout
->field_string ("exception-name", exception_name
);
12501 case ada_catch_assert
:
12502 /* In this case, the name of the exception is not really
12503 important. Just print "failed assertion" to make it clearer
12504 that his program just hit an assertion-failure catchpoint.
12505 We used ui_out_text because this info does not belong in
12507 uiout
->text ("failed assertion");
12511 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12512 if (exception_message
!= NULL
)
12514 uiout
->text (" (");
12515 uiout
->field_string ("exception-message", exception_message
.get ());
12519 uiout
->text (" at ");
12520 ada_find_printable_frame (get_current_frame ());
12522 return PRINT_SRC_AND_LOC
;
12525 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12526 for all exception catchpoint kinds. */
12529 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12531 struct ui_out
*uiout
= current_uiout
;
12532 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12533 struct value_print_options opts
;
12535 get_user_print_options (&opts
);
12537 if (opts
.addressprint
)
12538 uiout
->field_skip ("addr");
12540 annotate_field (5);
12543 case ada_catch_exception
:
12544 if (!c
->excep_string
.empty ())
12546 std::string msg
= string_printf (_("`%s' Ada exception"),
12547 c
->excep_string
.c_str ());
12549 uiout
->field_string ("what", msg
);
12552 uiout
->field_string ("what", "all Ada exceptions");
12556 case ada_catch_exception_unhandled
:
12557 uiout
->field_string ("what", "unhandled Ada exceptions");
12560 case ada_catch_handlers
:
12561 if (!c
->excep_string
.empty ())
12563 uiout
->field_fmt ("what",
12564 _("`%s' Ada exception handlers"),
12565 c
->excep_string
.c_str ());
12568 uiout
->field_string ("what", "all Ada exceptions handlers");
12571 case ada_catch_assert
:
12572 uiout
->field_string ("what", "failed Ada assertions");
12576 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12581 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12582 for all exception catchpoint kinds. */
12585 print_mention_exception (struct breakpoint
*b
)
12587 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12588 struct ui_out
*uiout
= current_uiout
;
12590 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12591 : _("Catchpoint "));
12592 uiout
->field_signed ("bkptno", b
->number
);
12593 uiout
->text (": ");
12597 case ada_catch_exception
:
12598 if (!c
->excep_string
.empty ())
12600 std::string info
= string_printf (_("`%s' Ada exception"),
12601 c
->excep_string
.c_str ());
12602 uiout
->text (info
.c_str ());
12605 uiout
->text (_("all Ada exceptions"));
12608 case ada_catch_exception_unhandled
:
12609 uiout
->text (_("unhandled Ada exceptions"));
12612 case ada_catch_handlers
:
12613 if (!c
->excep_string
.empty ())
12616 = string_printf (_("`%s' Ada exception handlers"),
12617 c
->excep_string
.c_str ());
12618 uiout
->text (info
.c_str ());
12621 uiout
->text (_("all Ada exceptions handlers"));
12624 case ada_catch_assert
:
12625 uiout
->text (_("failed Ada assertions"));
12629 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12634 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12635 for all exception catchpoint kinds. */
12638 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12640 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12644 case ada_catch_exception
:
12645 fprintf_filtered (fp
, "catch exception");
12646 if (!c
->excep_string
.empty ())
12647 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12650 case ada_catch_exception_unhandled
:
12651 fprintf_filtered (fp
, "catch exception unhandled");
12654 case ada_catch_handlers
:
12655 fprintf_filtered (fp
, "catch handlers");
12658 case ada_catch_assert
:
12659 fprintf_filtered (fp
, "catch assert");
12663 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12665 print_recreate_thread (b
, fp
);
12668 /* Virtual tables for various breakpoint types. */
12669 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12670 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12671 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12672 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12674 /* See ada-lang.h. */
12677 is_ada_exception_catchpoint (breakpoint
*bp
)
12679 return (bp
->ops
== &catch_exception_breakpoint_ops
12680 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12681 || bp
->ops
== &catch_assert_breakpoint_ops
12682 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12685 /* Split the arguments specified in a "catch exception" command.
12686 Set EX to the appropriate catchpoint type.
12687 Set EXCEP_STRING to the name of the specific exception if
12688 specified by the user.
12689 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12690 "catch handlers" command. False otherwise.
12691 If a condition is found at the end of the arguments, the condition
12692 expression is stored in COND_STRING (memory must be deallocated
12693 after use). Otherwise COND_STRING is set to NULL. */
12696 catch_ada_exception_command_split (const char *args
,
12697 bool is_catch_handlers_cmd
,
12698 enum ada_exception_catchpoint_kind
*ex
,
12699 std::string
*excep_string
,
12700 std::string
*cond_string
)
12702 std::string exception_name
;
12704 exception_name
= extract_arg (&args
);
12705 if (exception_name
== "if")
12707 /* This is not an exception name; this is the start of a condition
12708 expression for a catchpoint on all exceptions. So, "un-get"
12709 this token, and set exception_name to NULL. */
12710 exception_name
.clear ();
12714 /* Check to see if we have a condition. */
12716 args
= skip_spaces (args
);
12717 if (startswith (args
, "if")
12718 && (isspace (args
[2]) || args
[2] == '\0'))
12721 args
= skip_spaces (args
);
12723 if (args
[0] == '\0')
12724 error (_("Condition missing after `if' keyword"));
12725 *cond_string
= args
;
12727 args
+= strlen (args
);
12730 /* Check that we do not have any more arguments. Anything else
12733 if (args
[0] != '\0')
12734 error (_("Junk at end of expression"));
12736 if (is_catch_handlers_cmd
)
12738 /* Catch handling of exceptions. */
12739 *ex
= ada_catch_handlers
;
12740 *excep_string
= exception_name
;
12742 else if (exception_name
.empty ())
12744 /* Catch all exceptions. */
12745 *ex
= ada_catch_exception
;
12746 excep_string
->clear ();
12748 else if (exception_name
== "unhandled")
12750 /* Catch unhandled exceptions. */
12751 *ex
= ada_catch_exception_unhandled
;
12752 excep_string
->clear ();
12756 /* Catch a specific exception. */
12757 *ex
= ada_catch_exception
;
12758 *excep_string
= exception_name
;
12762 /* Return the name of the symbol on which we should break in order to
12763 implement a catchpoint of the EX kind. */
12765 static const char *
12766 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12768 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12770 gdb_assert (data
->exception_info
!= NULL
);
12774 case ada_catch_exception
:
12775 return (data
->exception_info
->catch_exception_sym
);
12777 case ada_catch_exception_unhandled
:
12778 return (data
->exception_info
->catch_exception_unhandled_sym
);
12780 case ada_catch_assert
:
12781 return (data
->exception_info
->catch_assert_sym
);
12783 case ada_catch_handlers
:
12784 return (data
->exception_info
->catch_handlers_sym
);
12787 internal_error (__FILE__
, __LINE__
,
12788 _("unexpected catchpoint kind (%d)"), ex
);
12792 /* Return the breakpoint ops "virtual table" used for catchpoints
12795 static const struct breakpoint_ops
*
12796 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12800 case ada_catch_exception
:
12801 return (&catch_exception_breakpoint_ops
);
12803 case ada_catch_exception_unhandled
:
12804 return (&catch_exception_unhandled_breakpoint_ops
);
12806 case ada_catch_assert
:
12807 return (&catch_assert_breakpoint_ops
);
12809 case ada_catch_handlers
:
12810 return (&catch_handlers_breakpoint_ops
);
12813 internal_error (__FILE__
, __LINE__
,
12814 _("unexpected catchpoint kind (%d)"), ex
);
12818 /* Return the condition that will be used to match the current exception
12819 being raised with the exception that the user wants to catch. This
12820 assumes that this condition is used when the inferior just triggered
12821 an exception catchpoint.
12822 EX: the type of catchpoints used for catching Ada exceptions. */
12825 ada_exception_catchpoint_cond_string (const char *excep_string
,
12826 enum ada_exception_catchpoint_kind ex
)
12829 bool is_standard_exc
= false;
12830 std::string result
;
12832 if (ex
== ada_catch_handlers
)
12834 /* For exception handlers catchpoints, the condition string does
12835 not use the same parameter as for the other exceptions. */
12836 result
= ("long_integer (GNAT_GCC_exception_Access"
12837 "(gcc_exception).all.occurrence.id)");
12840 result
= "long_integer (e)";
12842 /* The standard exceptions are a special case. They are defined in
12843 runtime units that have been compiled without debugging info; if
12844 EXCEP_STRING is the not-fully-qualified name of a standard
12845 exception (e.g. "constraint_error") then, during the evaluation
12846 of the condition expression, the symbol lookup on this name would
12847 *not* return this standard exception. The catchpoint condition
12848 may then be set only on user-defined exceptions which have the
12849 same not-fully-qualified name (e.g. my_package.constraint_error).
12851 To avoid this unexcepted behavior, these standard exceptions are
12852 systematically prefixed by "standard". This means that "catch
12853 exception constraint_error" is rewritten into "catch exception
12854 standard.constraint_error".
12856 If an exception named constraint_error is defined in another package of
12857 the inferior program, then the only way to specify this exception as a
12858 breakpoint condition is to use its fully-qualified named:
12859 e.g. my_package.constraint_error. */
12861 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12863 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12865 is_standard_exc
= true;
12872 if (is_standard_exc
)
12873 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12875 string_appendf (result
, "long_integer (&%s)", excep_string
);
12880 /* Return the symtab_and_line that should be used to insert an exception
12881 catchpoint of the TYPE kind.
12883 ADDR_STRING returns the name of the function where the real
12884 breakpoint that implements the catchpoints is set, depending on the
12885 type of catchpoint we need to create. */
12887 static struct symtab_and_line
12888 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12889 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12891 const char *sym_name
;
12892 struct symbol
*sym
;
12894 /* First, find out which exception support info to use. */
12895 ada_exception_support_info_sniffer ();
12897 /* Then lookup the function on which we will break in order to catch
12898 the Ada exceptions requested by the user. */
12899 sym_name
= ada_exception_sym_name (ex
);
12900 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12903 error (_("Catchpoint symbol not found: %s"), sym_name
);
12905 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12906 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12908 /* Set ADDR_STRING. */
12909 *addr_string
= sym_name
;
12912 *ops
= ada_exception_breakpoint_ops (ex
);
12914 return find_function_start_sal (sym
, 1);
12917 /* Create an Ada exception catchpoint.
12919 EX_KIND is the kind of exception catchpoint to be created.
12921 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12922 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12923 of the exception to which this catchpoint applies.
12925 COND_STRING, if not empty, is the catchpoint condition.
12927 TEMPFLAG, if nonzero, means that the underlying breakpoint
12928 should be temporary.
12930 FROM_TTY is the usual argument passed to all commands implementations. */
12933 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12934 enum ada_exception_catchpoint_kind ex_kind
,
12935 const std::string
&excep_string
,
12936 const std::string
&cond_string
,
12941 std::string addr_string
;
12942 const struct breakpoint_ops
*ops
= NULL
;
12943 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12945 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12946 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12947 ops
, tempflag
, disabled
, from_tty
);
12948 c
->excep_string
= excep_string
;
12949 create_excep_cond_exprs (c
.get (), ex_kind
);
12950 if (!cond_string
.empty ())
12951 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
);
12952 install_breakpoint (0, std::move (c
), 1);
12955 /* Implement the "catch exception" command. */
12958 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12959 struct cmd_list_element
*command
)
12961 const char *arg
= arg_entry
;
12962 struct gdbarch
*gdbarch
= get_current_arch ();
12964 enum ada_exception_catchpoint_kind ex_kind
;
12965 std::string excep_string
;
12966 std::string cond_string
;
12968 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12972 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12974 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12975 excep_string
, cond_string
,
12976 tempflag
, 1 /* enabled */,
12980 /* Implement the "catch handlers" command. */
12983 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12984 struct cmd_list_element
*command
)
12986 const char *arg
= arg_entry
;
12987 struct gdbarch
*gdbarch
= get_current_arch ();
12989 enum ada_exception_catchpoint_kind ex_kind
;
12990 std::string excep_string
;
12991 std::string cond_string
;
12993 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12997 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
12999 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
13000 excep_string
, cond_string
,
13001 tempflag
, 1 /* enabled */,
13005 /* Completion function for the Ada "catch" commands. */
13008 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
13009 const char *text
, const char *word
)
13011 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
13013 for (const ada_exc_info
&info
: exceptions
)
13015 if (startswith (info
.name
, word
))
13016 tracker
.add_completion (make_unique_xstrdup (info
.name
));
13020 /* Split the arguments specified in a "catch assert" command.
13022 ARGS contains the command's arguments (or the empty string if
13023 no arguments were passed).
13025 If ARGS contains a condition, set COND_STRING to that condition
13026 (the memory needs to be deallocated after use). */
13029 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
13031 args
= skip_spaces (args
);
13033 /* Check whether a condition was provided. */
13034 if (startswith (args
, "if")
13035 && (isspace (args
[2]) || args
[2] == '\0'))
13038 args
= skip_spaces (args
);
13039 if (args
[0] == '\0')
13040 error (_("condition missing after `if' keyword"));
13041 cond_string
.assign (args
);
13044 /* Otherwise, there should be no other argument at the end of
13046 else if (args
[0] != '\0')
13047 error (_("Junk at end of arguments."));
13050 /* Implement the "catch assert" command. */
13053 catch_assert_command (const char *arg_entry
, int from_tty
,
13054 struct cmd_list_element
*command
)
13056 const char *arg
= arg_entry
;
13057 struct gdbarch
*gdbarch
= get_current_arch ();
13059 std::string cond_string
;
13061 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13065 catch_ada_assert_command_split (arg
, cond_string
);
13066 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
13068 tempflag
, 1 /* enabled */,
13072 /* Return non-zero if the symbol SYM is an Ada exception object. */
13075 ada_is_exception_sym (struct symbol
*sym
)
13077 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
13079 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
13080 && SYMBOL_CLASS (sym
) != LOC_BLOCK
13081 && SYMBOL_CLASS (sym
) != LOC_CONST
13082 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
13083 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
13086 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13087 Ada exception object. This matches all exceptions except the ones
13088 defined by the Ada language. */
13091 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13095 if (!ada_is_exception_sym (sym
))
13098 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13099 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
13100 return 0; /* A standard exception. */
13102 /* Numeric_Error is also a standard exception, so exclude it.
13103 See the STANDARD_EXC description for more details as to why
13104 this exception is not listed in that array. */
13105 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
13111 /* A helper function for std::sort, comparing two struct ada_exc_info
13114 The comparison is determined first by exception name, and then
13115 by exception address. */
13118 ada_exc_info::operator< (const ada_exc_info
&other
) const
13122 result
= strcmp (name
, other
.name
);
13125 if (result
== 0 && addr
< other
.addr
)
13131 ada_exc_info::operator== (const ada_exc_info
&other
) const
13133 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
13136 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13137 routine, but keeping the first SKIP elements untouched.
13139 All duplicates are also removed. */
13142 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
13145 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
13146 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
13147 exceptions
->end ());
13150 /* Add all exceptions defined by the Ada standard whose name match
13151 a regular expression.
13153 If PREG is not NULL, then this regexp_t object is used to
13154 perform the symbol name matching. Otherwise, no name-based
13155 filtering is performed.
13157 EXCEPTIONS is a vector of exceptions to which matching exceptions
13161 ada_add_standard_exceptions (compiled_regex
*preg
,
13162 std::vector
<ada_exc_info
> *exceptions
)
13166 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13169 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
13171 struct bound_minimal_symbol msymbol
13172 = ada_lookup_simple_minsym (standard_exc
[i
]);
13174 if (msymbol
.minsym
!= NULL
)
13176 struct ada_exc_info info
13177 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13179 exceptions
->push_back (info
);
13185 /* Add all Ada exceptions defined locally and accessible from the given
13188 If PREG is not NULL, then this regexp_t object is used to
13189 perform the symbol name matching. Otherwise, no name-based
13190 filtering is performed.
13192 EXCEPTIONS is a vector of exceptions to which matching exceptions
13196 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13197 struct frame_info
*frame
,
13198 std::vector
<ada_exc_info
> *exceptions
)
13200 const struct block
*block
= get_frame_block (frame
, 0);
13204 struct block_iterator iter
;
13205 struct symbol
*sym
;
13207 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13209 switch (SYMBOL_CLASS (sym
))
13216 if (ada_is_exception_sym (sym
))
13218 struct ada_exc_info info
= {sym
->print_name (),
13219 SYMBOL_VALUE_ADDRESS (sym
)};
13221 exceptions
->push_back (info
);
13225 if (BLOCK_FUNCTION (block
) != NULL
)
13227 block
= BLOCK_SUPERBLOCK (block
);
13231 /* Return true if NAME matches PREG or if PREG is NULL. */
13234 name_matches_regex (const char *name
, compiled_regex
*preg
)
13236 return (preg
== NULL
13237 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13240 /* Add all exceptions defined globally whose name name match
13241 a regular expression, excluding standard exceptions.
13243 The reason we exclude standard exceptions is that they need
13244 to be handled separately: Standard exceptions are defined inside
13245 a runtime unit which is normally not compiled with debugging info,
13246 and thus usually do not show up in our symbol search. However,
13247 if the unit was in fact built with debugging info, we need to
13248 exclude them because they would duplicate the entry we found
13249 during the special loop that specifically searches for those
13250 standard exceptions.
13252 If PREG is not NULL, then this regexp_t object is used to
13253 perform the symbol name matching. Otherwise, no name-based
13254 filtering is performed.
13256 EXCEPTIONS is a vector of exceptions to which matching exceptions
13260 ada_add_global_exceptions (compiled_regex
*preg
,
13261 std::vector
<ada_exc_info
> *exceptions
)
13263 /* In Ada, the symbol "search name" is a linkage name, whereas the
13264 regular expression used to do the matching refers to the natural
13265 name. So match against the decoded name. */
13266 expand_symtabs_matching (NULL
,
13267 lookup_name_info::match_any (),
13268 [&] (const char *search_name
)
13270 std::string decoded
= ada_decode (search_name
);
13271 return name_matches_regex (decoded
.c_str (), preg
);
13276 for (objfile
*objfile
: current_program_space
->objfiles ())
13278 for (compunit_symtab
*s
: objfile
->compunits ())
13280 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13283 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13285 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13286 struct block_iterator iter
;
13287 struct symbol
*sym
;
13289 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13290 if (ada_is_non_standard_exception_sym (sym
)
13291 && name_matches_regex (sym
->natural_name (), preg
))
13293 struct ada_exc_info info
13294 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13296 exceptions
->push_back (info
);
13303 /* Implements ada_exceptions_list with the regular expression passed
13304 as a regex_t, rather than a string.
13306 If not NULL, PREG is used to filter out exceptions whose names
13307 do not match. Otherwise, all exceptions are listed. */
13309 static std::vector
<ada_exc_info
>
13310 ada_exceptions_list_1 (compiled_regex
*preg
)
13312 std::vector
<ada_exc_info
> result
;
13315 /* First, list the known standard exceptions. These exceptions
13316 need to be handled separately, as they are usually defined in
13317 runtime units that have been compiled without debugging info. */
13319 ada_add_standard_exceptions (preg
, &result
);
13321 /* Next, find all exceptions whose scope is local and accessible
13322 from the currently selected frame. */
13324 if (has_stack_frames ())
13326 prev_len
= result
.size ();
13327 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13329 if (result
.size () > prev_len
)
13330 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13333 /* Add all exceptions whose scope is global. */
13335 prev_len
= result
.size ();
13336 ada_add_global_exceptions (preg
, &result
);
13337 if (result
.size () > prev_len
)
13338 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13343 /* Return a vector of ada_exc_info.
13345 If REGEXP is NULL, all exceptions are included in the result.
13346 Otherwise, it should contain a valid regular expression,
13347 and only the exceptions whose names match that regular expression
13348 are included in the result.
13350 The exceptions are sorted in the following order:
13351 - Standard exceptions (defined by the Ada language), in
13352 alphabetical order;
13353 - Exceptions only visible from the current frame, in
13354 alphabetical order;
13355 - Exceptions whose scope is global, in alphabetical order. */
13357 std::vector
<ada_exc_info
>
13358 ada_exceptions_list (const char *regexp
)
13360 if (regexp
== NULL
)
13361 return ada_exceptions_list_1 (NULL
);
13363 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13364 return ada_exceptions_list_1 (®
);
13367 /* Implement the "info exceptions" command. */
13370 info_exceptions_command (const char *regexp
, int from_tty
)
13372 struct gdbarch
*gdbarch
= get_current_arch ();
13374 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13376 if (regexp
!= NULL
)
13378 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13380 printf_filtered (_("All defined Ada exceptions:\n"));
13382 for (const ada_exc_info
&info
: exceptions
)
13383 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13387 /* Information about operators given special treatment in functions
13389 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13391 #define ADA_OPERATORS \
13392 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13393 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13394 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13395 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13396 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13397 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13398 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13399 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13400 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13401 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13402 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13403 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13404 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13405 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13406 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13407 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13408 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13409 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13410 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13413 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13416 switch (exp
->elts
[pc
- 1].opcode
)
13419 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13422 #define OP_DEFN(op, len, args, binop) \
13423 case op: *oplenp = len; *argsp = args; break;
13429 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13434 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13439 /* Implementation of the exp_descriptor method operator_check. */
13442 ada_operator_check (struct expression
*exp
, int pos
,
13443 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13446 const union exp_element
*const elts
= exp
->elts
;
13447 struct type
*type
= NULL
;
13449 switch (elts
[pos
].opcode
)
13451 case UNOP_IN_RANGE
:
13453 type
= elts
[pos
+ 1].type
;
13457 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13460 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13462 if (type
&& TYPE_OBJFILE (type
)
13463 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13469 static const char *
13470 ada_op_name (enum exp_opcode opcode
)
13475 return op_name_standard (opcode
);
13477 #define OP_DEFN(op, len, args, binop) case op: return #op;
13482 return "OP_AGGREGATE";
13484 return "OP_CHOICES";
13490 /* As for operator_length, but assumes PC is pointing at the first
13491 element of the operator, and gives meaningful results only for the
13492 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13495 ada_forward_operator_length (struct expression
*exp
, int pc
,
13496 int *oplenp
, int *argsp
)
13498 switch (exp
->elts
[pc
].opcode
)
13501 *oplenp
= *argsp
= 0;
13504 #define OP_DEFN(op, len, args, binop) \
13505 case op: *oplenp = len; *argsp = args; break;
13511 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13516 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13522 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13524 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13532 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13534 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13539 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13543 /* Ada attributes ('Foo). */
13546 case OP_ATR_LENGTH
:
13550 case OP_ATR_MODULUS
:
13557 case UNOP_IN_RANGE
:
13559 /* XXX: gdb_sprint_host_address, type_sprint */
13560 fprintf_filtered (stream
, _("Type @"));
13561 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13562 fprintf_filtered (stream
, " (");
13563 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13564 fprintf_filtered (stream
, ")");
13566 case BINOP_IN_BOUNDS
:
13567 fprintf_filtered (stream
, " (%d)",
13568 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13570 case TERNOP_IN_RANGE
:
13575 case OP_DISCRETE_RANGE
:
13576 case OP_POSITIONAL
:
13583 char *name
= &exp
->elts
[elt
+ 2].string
;
13584 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13586 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13591 return dump_subexp_body_standard (exp
, stream
, elt
);
13595 for (i
= 0; i
< nargs
; i
+= 1)
13596 elt
= dump_subexp (exp
, stream
, elt
);
13601 /* The Ada extension of print_subexp (q.v.). */
13604 ada_print_subexp (struct expression
*exp
, int *pos
,
13605 struct ui_file
*stream
, enum precedence prec
)
13607 int oplen
, nargs
, i
;
13609 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13611 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13618 print_subexp_standard (exp
, pos
, stream
, prec
);
13622 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13625 case BINOP_IN_BOUNDS
:
13626 /* XXX: sprint_subexp */
13627 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13628 fputs_filtered (" in ", stream
);
13629 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13630 fputs_filtered ("'range", stream
);
13631 if (exp
->elts
[pc
+ 1].longconst
> 1)
13632 fprintf_filtered (stream
, "(%ld)",
13633 (long) exp
->elts
[pc
+ 1].longconst
);
13636 case TERNOP_IN_RANGE
:
13637 if (prec
>= PREC_EQUAL
)
13638 fputs_filtered ("(", stream
);
13639 /* XXX: sprint_subexp */
13640 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13641 fputs_filtered (" in ", stream
);
13642 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13643 fputs_filtered (" .. ", stream
);
13644 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13645 if (prec
>= PREC_EQUAL
)
13646 fputs_filtered (")", stream
);
13651 case OP_ATR_LENGTH
:
13655 case OP_ATR_MODULUS
:
13660 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13662 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13663 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13664 &type_print_raw_options
);
13668 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13669 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13674 for (tem
= 1; tem
< nargs
; tem
+= 1)
13676 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13677 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13679 fputs_filtered (")", stream
);
13684 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13685 fputs_filtered ("'(", stream
);
13686 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13687 fputs_filtered (")", stream
);
13690 case UNOP_IN_RANGE
:
13691 /* XXX: sprint_subexp */
13692 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13693 fputs_filtered (" in ", stream
);
13694 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13695 &type_print_raw_options
);
13698 case OP_DISCRETE_RANGE
:
13699 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13700 fputs_filtered ("..", stream
);
13701 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13705 fputs_filtered ("others => ", stream
);
13706 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13710 for (i
= 0; i
< nargs
-1; i
+= 1)
13713 fputs_filtered ("|", stream
);
13714 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13716 fputs_filtered (" => ", stream
);
13717 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13720 case OP_POSITIONAL
:
13721 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13725 fputs_filtered ("(", stream
);
13726 for (i
= 0; i
< nargs
; i
+= 1)
13729 fputs_filtered (", ", stream
);
13730 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13732 fputs_filtered (")", stream
);
13737 /* Table mapping opcodes into strings for printing operators
13738 and precedences of the operators. */
13740 static const struct op_print ada_op_print_tab
[] = {
13741 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13742 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13743 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13744 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13745 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13746 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13747 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13748 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13749 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13750 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13751 {">", BINOP_GTR
, PREC_ORDER
, 0},
13752 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13753 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13754 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13755 {"+", BINOP_ADD
, PREC_ADD
, 0},
13756 {"-", BINOP_SUB
, PREC_ADD
, 0},
13757 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13758 {"*", BINOP_MUL
, PREC_MUL
, 0},
13759 {"/", BINOP_DIV
, PREC_MUL
, 0},
13760 {"rem", BINOP_REM
, PREC_MUL
, 0},
13761 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13762 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13763 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13764 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13765 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13766 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13767 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13768 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13769 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13770 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13771 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13772 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13775 enum ada_primitive_types
{
13776 ada_primitive_type_int
,
13777 ada_primitive_type_long
,
13778 ada_primitive_type_short
,
13779 ada_primitive_type_char
,
13780 ada_primitive_type_float
,
13781 ada_primitive_type_double
,
13782 ada_primitive_type_void
,
13783 ada_primitive_type_long_long
,
13784 ada_primitive_type_long_double
,
13785 ada_primitive_type_natural
,
13786 ada_primitive_type_positive
,
13787 ada_primitive_type_system_address
,
13788 ada_primitive_type_storage_offset
,
13789 nr_ada_primitive_types
13793 ada_language_arch_info (struct gdbarch
*gdbarch
,
13794 struct language_arch_info
*lai
)
13796 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13798 lai
->primitive_type_vector
13799 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13802 lai
->primitive_type_vector
[ada_primitive_type_int
]
13803 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13805 lai
->primitive_type_vector
[ada_primitive_type_long
]
13806 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13807 0, "long_integer");
13808 lai
->primitive_type_vector
[ada_primitive_type_short
]
13809 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13810 0, "short_integer");
13811 lai
->string_char_type
13812 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13813 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13814 lai
->primitive_type_vector
[ada_primitive_type_float
]
13815 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13816 "float", gdbarch_float_format (gdbarch
));
13817 lai
->primitive_type_vector
[ada_primitive_type_double
]
13818 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13819 "long_float", gdbarch_double_format (gdbarch
));
13820 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13821 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13822 0, "long_long_integer");
13823 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13824 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13825 "long_long_float", gdbarch_long_double_format (gdbarch
));
13826 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13827 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13829 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13830 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13832 lai
->primitive_type_vector
[ada_primitive_type_void
]
13833 = builtin
->builtin_void
;
13835 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13836 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13838 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13839 ->set_name ("system__address");
13841 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13842 type. This is a signed integral type whose size is the same as
13843 the size of addresses. */
13845 unsigned int addr_length
= TYPE_LENGTH
13846 (lai
->primitive_type_vector
[ada_primitive_type_system_address
]);
13848 lai
->primitive_type_vector
[ada_primitive_type_storage_offset
]
13849 = arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13853 lai
->bool_type_symbol
= NULL
;
13854 lai
->bool_type_default
= builtin
->builtin_bool
;
13857 /* Language vector */
13859 /* Not really used, but needed in the ada_language_defn. */
13862 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13864 ada_emit_char (c
, type
, stream
, quoter
, 1);
13868 parse (struct parser_state
*ps
)
13870 warnings_issued
= 0;
13871 return ada_parse (ps
);
13874 static const struct exp_descriptor ada_exp_descriptor
= {
13876 ada_operator_length
,
13877 ada_operator_check
,
13879 ada_dump_subexp_body
,
13880 ada_evaluate_subexp
13883 /* symbol_name_matcher_ftype adapter for wild_match. */
13886 do_wild_match (const char *symbol_search_name
,
13887 const lookup_name_info
&lookup_name
,
13888 completion_match_result
*comp_match_res
)
13890 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13893 /* symbol_name_matcher_ftype adapter for full_match. */
13896 do_full_match (const char *symbol_search_name
,
13897 const lookup_name_info
&lookup_name
,
13898 completion_match_result
*comp_match_res
)
13900 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13903 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13906 do_exact_match (const char *symbol_search_name
,
13907 const lookup_name_info
&lookup_name
,
13908 completion_match_result
*comp_match_res
)
13910 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13913 /* Build the Ada lookup name for LOOKUP_NAME. */
13915 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13917 gdb::string_view user_name
= lookup_name
.name ();
13919 if (user_name
[0] == '<')
13921 if (user_name
.back () == '>')
13923 = user_name
.substr (1, user_name
.size () - 2).to_string ();
13926 = user_name
.substr (1, user_name
.size () - 1).to_string ();
13927 m_encoded_p
= true;
13928 m_verbatim_p
= true;
13929 m_wild_match_p
= false;
13930 m_standard_p
= false;
13934 m_verbatim_p
= false;
13936 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13940 const char *folded
= ada_fold_name (user_name
);
13941 const char *encoded
= ada_encode_1 (folded
, false);
13942 if (encoded
!= NULL
)
13943 m_encoded_name
= encoded
;
13945 m_encoded_name
= user_name
.to_string ();
13948 m_encoded_name
= user_name
.to_string ();
13950 /* Handle the 'package Standard' special case. See description
13951 of m_standard_p. */
13952 if (startswith (m_encoded_name
.c_str (), "standard__"))
13954 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13955 m_standard_p
= true;
13958 m_standard_p
= false;
13960 /* If the name contains a ".", then the user is entering a fully
13961 qualified entity name, and the match must not be done in wild
13962 mode. Similarly, if the user wants to complete what looks
13963 like an encoded name, the match must not be done in wild
13964 mode. Also, in the standard__ special case always do
13965 non-wild matching. */
13967 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13970 && user_name
.find ('.') == std::string::npos
);
13974 /* symbol_name_matcher_ftype method for Ada. This only handles
13975 completion mode. */
13978 ada_symbol_name_matches (const char *symbol_search_name
,
13979 const lookup_name_info
&lookup_name
,
13980 completion_match_result
*comp_match_res
)
13982 return lookup_name
.ada ().matches (symbol_search_name
,
13983 lookup_name
.match_type (),
13987 /* A name matcher that matches the symbol name exactly, with
13991 literal_symbol_name_matcher (const char *symbol_search_name
,
13992 const lookup_name_info
&lookup_name
,
13993 completion_match_result
*comp_match_res
)
13995 gdb::string_view name_view
= lookup_name
.name ();
13997 if (lookup_name
.completion_mode ()
13998 ? (strncmp (symbol_search_name
, name_view
.data (),
13999 name_view
.size ()) == 0)
14000 : symbol_search_name
== name_view
)
14002 if (comp_match_res
!= NULL
)
14003 comp_match_res
->set_match (symbol_search_name
);
14010 /* Implement the "la_get_symbol_name_matcher" language_defn method for
14013 static symbol_name_matcher_ftype
*
14014 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
14016 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
14017 return literal_symbol_name_matcher
;
14019 if (lookup_name
.completion_mode ())
14020 return ada_symbol_name_matches
;
14023 if (lookup_name
.ada ().wild_match_p ())
14024 return do_wild_match
;
14025 else if (lookup_name
.ada ().verbatim_p ())
14026 return do_exact_match
;
14028 return do_full_match
;
14032 /* Implement the "la_read_var_value" language_defn method for Ada. */
14034 static struct value
*
14035 ada_read_var_value (struct symbol
*var
, const struct block
*var_block
,
14036 struct frame_info
*frame
)
14038 /* The only case where default_read_var_value is not sufficient
14039 is when VAR is a renaming... */
14040 if (frame
!= nullptr)
14042 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
14043 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
14044 return ada_read_renaming_var_value (var
, frame_block
);
14047 /* This is a typical case where we expect the default_read_var_value
14048 function to work. */
14049 return default_read_var_value (var
, var_block
, frame
);
14052 static const char *ada_extensions
[] =
14054 ".adb", ".ads", ".a", ".ada", ".dg", NULL
14057 extern const struct language_defn ada_language_defn
= {
14058 "ada", /* Language name */
14062 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
14063 that's not quite what this means. */
14065 macro_expansion_no
,
14067 &ada_exp_descriptor
,
14070 ada_printchar
, /* Print a character constant */
14071 ada_printstr
, /* Function to print string constant */
14072 emit_char
, /* Function to print single char (not used) */
14073 ada_print_type
, /* Print a type using appropriate syntax */
14074 ada_print_typedef
, /* Print a typedef using appropriate syntax */
14075 ada_value_print_inner
, /* la_value_print_inner */
14076 ada_value_print
, /* Print a top-level value */
14077 ada_read_var_value
, /* la_read_var_value */
14078 NULL
, /* Language specific skip_trampoline */
14079 NULL
, /* name_of_this */
14080 true, /* la_store_sym_names_in_linkage_form_p */
14081 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
14082 basic_lookup_transparent_type
, /* lookup_transparent_type */
14083 ada_la_decode
, /* Language specific symbol demangler */
14084 ada_sniff_from_mangled_name
,
14085 NULL
, /* Language specific
14086 class_name_from_physname */
14087 ada_op_print_tab
, /* expression operators for printing */
14088 0, /* c-style arrays */
14089 1, /* String lower bound */
14090 ada_get_gdb_completer_word_break_characters
,
14091 ada_collect_symbol_completion_matches
,
14092 ada_language_arch_info
,
14093 ada_print_array_index
,
14094 default_pass_by_reference
,
14095 ada_watch_location_expression
,
14096 ada_get_symbol_name_matcher
, /* la_get_symbol_name_matcher */
14097 ada_iterate_over_symbols
,
14098 default_search_name_hash
,
14102 ada_is_string_type
,
14103 "(...)" /* la_struct_too_deep_ellipsis */
14106 /* Command-list for the "set/show ada" prefix command. */
14107 static struct cmd_list_element
*set_ada_list
;
14108 static struct cmd_list_element
*show_ada_list
;
14111 initialize_ada_catchpoint_ops (void)
14113 struct breakpoint_ops
*ops
;
14115 initialize_breakpoint_ops ();
14117 ops
= &catch_exception_breakpoint_ops
;
14118 *ops
= bkpt_breakpoint_ops
;
14119 ops
->allocate_location
= allocate_location_exception
;
14120 ops
->re_set
= re_set_exception
;
14121 ops
->check_status
= check_status_exception
;
14122 ops
->print_it
= print_it_exception
;
14123 ops
->print_one
= print_one_exception
;
14124 ops
->print_mention
= print_mention_exception
;
14125 ops
->print_recreate
= print_recreate_exception
;
14127 ops
= &catch_exception_unhandled_breakpoint_ops
;
14128 *ops
= bkpt_breakpoint_ops
;
14129 ops
->allocate_location
= allocate_location_exception
;
14130 ops
->re_set
= re_set_exception
;
14131 ops
->check_status
= check_status_exception
;
14132 ops
->print_it
= print_it_exception
;
14133 ops
->print_one
= print_one_exception
;
14134 ops
->print_mention
= print_mention_exception
;
14135 ops
->print_recreate
= print_recreate_exception
;
14137 ops
= &catch_assert_breakpoint_ops
;
14138 *ops
= bkpt_breakpoint_ops
;
14139 ops
->allocate_location
= allocate_location_exception
;
14140 ops
->re_set
= re_set_exception
;
14141 ops
->check_status
= check_status_exception
;
14142 ops
->print_it
= print_it_exception
;
14143 ops
->print_one
= print_one_exception
;
14144 ops
->print_mention
= print_mention_exception
;
14145 ops
->print_recreate
= print_recreate_exception
;
14147 ops
= &catch_handlers_breakpoint_ops
;
14148 *ops
= bkpt_breakpoint_ops
;
14149 ops
->allocate_location
= allocate_location_exception
;
14150 ops
->re_set
= re_set_exception
;
14151 ops
->check_status
= check_status_exception
;
14152 ops
->print_it
= print_it_exception
;
14153 ops
->print_one
= print_one_exception
;
14154 ops
->print_mention
= print_mention_exception
;
14155 ops
->print_recreate
= print_recreate_exception
;
14158 /* This module's 'new_objfile' observer. */
14161 ada_new_objfile_observer (struct objfile
*objfile
)
14163 ada_clear_symbol_cache ();
14166 /* This module's 'free_objfile' observer. */
14169 ada_free_objfile_observer (struct objfile
*objfile
)
14171 ada_clear_symbol_cache ();
14174 void _initialize_ada_language ();
14176 _initialize_ada_language ()
14178 initialize_ada_catchpoint_ops ();
14180 add_basic_prefix_cmd ("ada", no_class
,
14181 _("Prefix command for changing Ada-specific settings."),
14182 &set_ada_list
, "set ada ", 0, &setlist
);
14184 add_show_prefix_cmd ("ada", no_class
,
14185 _("Generic command for showing Ada-specific settings."),
14186 &show_ada_list
, "show ada ", 0, &showlist
);
14188 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14189 &trust_pad_over_xvs
, _("\
14190 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14191 Show whether an optimization trusting PAD types over XVS types is activated."),
14193 This is related to the encoding used by the GNAT compiler. The debugger\n\
14194 should normally trust the contents of PAD types, but certain older versions\n\
14195 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14196 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14197 work around this bug. It is always safe to turn this option \"off\", but\n\
14198 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14199 this option to \"off\" unless necessary."),
14200 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14202 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14203 &print_signatures
, _("\
14204 Enable or disable the output of formal and return types for functions in the \
14205 overloads selection menu."), _("\
14206 Show whether the output of formal and return types for functions in the \
14207 overloads selection menu is activated."),
14208 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14210 add_catch_command ("exception", _("\
14211 Catch Ada exceptions, when raised.\n\
14212 Usage: catch exception [ARG] [if CONDITION]\n\
14213 Without any argument, stop when any Ada exception is raised.\n\
14214 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14215 being raised does not have a handler (and will therefore lead to the task's\n\
14217 Otherwise, the catchpoint only stops when the name of the exception being\n\
14218 raised is the same as ARG.\n\
14219 CONDITION is a boolean expression that is evaluated to see whether the\n\
14220 exception should cause a stop."),
14221 catch_ada_exception_command
,
14222 catch_ada_completer
,
14226 add_catch_command ("handlers", _("\
14227 Catch Ada exceptions, when handled.\n\
14228 Usage: catch handlers [ARG] [if CONDITION]\n\
14229 Without any argument, stop when any Ada exception is handled.\n\
14230 With an argument, catch only exceptions with the given name.\n\
14231 CONDITION is a boolean expression that is evaluated to see whether the\n\
14232 exception should cause a stop."),
14233 catch_ada_handlers_command
,
14234 catch_ada_completer
,
14237 add_catch_command ("assert", _("\
14238 Catch failed Ada assertions, when raised.\n\
14239 Usage: catch assert [if CONDITION]\n\
14240 CONDITION is a boolean expression that is evaluated to see whether the\n\
14241 exception should cause a stop."),
14242 catch_assert_command
,
14247 varsize_limit
= 65536;
14248 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14249 &varsize_limit
, _("\
14250 Set the maximum number of bytes allowed in a variable-size object."), _("\
14251 Show the maximum number of bytes allowed in a variable-size object."), _("\
14252 Attempts to access an object whose size is not a compile-time constant\n\
14253 and exceeds this limit will cause an error."),
14254 NULL
, NULL
, &setlist
, &showlist
);
14256 add_info ("exceptions", info_exceptions_command
,
14258 List all Ada exception names.\n\
14259 Usage: info exceptions [REGEXP]\n\
14260 If a regular expression is passed as an argument, only those matching\n\
14261 the regular expression are listed."));
14263 add_basic_prefix_cmd ("ada", class_maintenance
,
14264 _("Set Ada maintenance-related variables."),
14265 &maint_set_ada_cmdlist
, "maintenance set ada ",
14266 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14268 add_show_prefix_cmd ("ada", class_maintenance
,
14269 _("Show Ada maintenance-related variables."),
14270 &maint_show_ada_cmdlist
, "maintenance show ada ",
14271 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14273 add_setshow_boolean_cmd
14274 ("ignore-descriptive-types", class_maintenance
,
14275 &ada_ignore_descriptive_types_p
,
14276 _("Set whether descriptive types generated by GNAT should be ignored."),
14277 _("Show whether descriptive types generated by GNAT should be ignored."),
14279 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14280 DWARF attribute."),
14281 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14283 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14284 NULL
, xcalloc
, xfree
);
14286 /* The ada-lang observers. */
14287 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14288 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14289 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);