1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2020 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
23 #include "gdb_regex.h"
28 #include "expression.h"
29 #include "parser-defs.h"
35 #include "breakpoint.h"
38 #include "gdb_obstack.h"
40 #include "completer.h"
47 #include "observable.h"
49 #include "typeprint.h"
50 #include "namespace.h"
51 #include "cli/cli-style.h"
54 #include "mi/mi-common.h"
55 #include "arch-utils.h"
56 #include "cli/cli-utils.h"
57 #include "gdbsupport/function-view.h"
58 #include "gdbsupport/byte-vector.h"
61 /* Define whether or not the C operator '/' truncates towards zero for
62 differently signed operands (truncation direction is undefined in C).
63 Copied from valarith.c. */
65 #ifndef TRUNCATION_TOWARDS_ZERO
66 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
69 static struct type
*desc_base_type (struct type
*);
71 static struct type
*desc_bounds_type (struct type
*);
73 static struct value
*desc_bounds (struct value
*);
75 static int fat_pntr_bounds_bitpos (struct type
*);
77 static int fat_pntr_bounds_bitsize (struct type
*);
79 static struct type
*desc_data_target_type (struct type
*);
81 static struct value
*desc_data (struct value
*);
83 static int fat_pntr_data_bitpos (struct type
*);
85 static int fat_pntr_data_bitsize (struct type
*);
87 static struct value
*desc_one_bound (struct value
*, int, int);
89 static int desc_bound_bitpos (struct type
*, int, int);
91 static int desc_bound_bitsize (struct type
*, int, int);
93 static struct type
*desc_index_type (struct type
*, int);
95 static int desc_arity (struct type
*);
97 static int ada_type_match (struct type
*, struct type
*, int);
99 static int ada_args_match (struct symbol
*, struct value
**, int);
101 static struct value
*make_array_descriptor (struct type
*, struct value
*);
103 static void ada_add_block_symbols (struct obstack
*,
104 const struct block
*,
105 const lookup_name_info
&lookup_name
,
106 domain_enum
, struct objfile
*);
108 static void ada_add_all_symbols (struct obstack
*, const struct block
*,
109 const lookup_name_info
&lookup_name
,
110 domain_enum
, int, int *);
112 static int is_nonfunction (struct block_symbol
*, int);
114 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
115 const struct block
*);
117 static int num_defns_collected (struct obstack
*);
119 static struct block_symbol
*defns_collected (struct obstack
*, int);
121 static struct value
*resolve_subexp (expression_up
*, int *, int,
123 innermost_block_tracker
*);
125 static void replace_operator_with_call (expression_up
*, int, int, int,
126 struct symbol
*, const struct block
*);
128 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
130 static const char *ada_op_name (enum exp_opcode
);
132 static const char *ada_decoded_op_name (enum exp_opcode
);
134 static int numeric_type_p (struct type
*);
136 static int integer_type_p (struct type
*);
138 static int scalar_type_p (struct type
*);
140 static int discrete_type_p (struct type
*);
142 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
145 static struct value
*evaluate_subexp_type (struct expression
*, int *);
147 static struct type
*ada_find_parallel_type_with_name (struct type
*,
150 static int is_dynamic_field (struct type
*, int);
152 static struct type
*to_fixed_variant_branch_type (struct type
*,
154 CORE_ADDR
, struct value
*);
156 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
158 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
160 static struct type
*to_static_fixed_type (struct type
*);
161 static struct type
*static_unwrap_type (struct type
*type
);
163 static struct value
*unwrap_value (struct value
*);
165 static struct type
*constrained_packed_array_type (struct type
*, long *);
167 static struct type
*decode_constrained_packed_array_type (struct type
*);
169 static long decode_packed_array_bitsize (struct type
*);
171 static struct value
*decode_constrained_packed_array (struct value
*);
173 static int ada_is_packed_array_type (struct type
*);
175 static int ada_is_unconstrained_packed_array_type (struct type
*);
177 static struct value
*value_subscript_packed (struct value
*, int,
180 static struct value
*coerce_unspec_val_to_type (struct value
*,
183 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
185 static int equiv_types (struct type
*, struct type
*);
187 static int is_name_suffix (const char *);
189 static int advance_wild_match (const char **, const char *, int);
191 static bool wild_match (const char *name
, const char *patn
);
193 static struct value
*ada_coerce_ref (struct value
*);
195 static LONGEST
pos_atr (struct value
*);
197 static struct value
*value_pos_atr (struct type
*, struct value
*);
199 static struct value
*val_atr (struct type
*, LONGEST
);
201 static struct value
*value_val_atr (struct type
*, struct value
*);
203 static struct symbol
*standard_lookup (const char *, const struct block
*,
206 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
209 static int find_struct_field (const char *, struct type
*, int,
210 struct type
**, int *, int *, int *, int *);
212 static int ada_resolve_function (struct block_symbol
*, int,
213 struct value
**, int, const char *,
216 static int ada_is_direct_array_type (struct type
*);
218 static void ada_language_arch_info (struct gdbarch
*,
219 struct language_arch_info
*);
221 static struct value
*ada_index_struct_field (int, struct value
*, int,
224 static struct value
*assign_aggregate (struct value
*, struct value
*,
228 static void aggregate_assign_from_choices (struct value
*, struct value
*,
230 int *, LONGEST
*, int *,
231 int, LONGEST
, LONGEST
);
233 static void aggregate_assign_positional (struct value
*, struct value
*,
235 int *, LONGEST
*, int *, int,
239 static void aggregate_assign_others (struct value
*, struct value
*,
241 int *, LONGEST
*, int, LONGEST
, LONGEST
);
244 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
247 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
250 static void ada_forward_operator_length (struct expression
*, int, int *,
253 static struct type
*ada_find_any_type (const char *name
);
255 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
256 (const lookup_name_info
&lookup_name
);
260 /* The result of a symbol lookup to be stored in our symbol cache. */
264 /* The name used to perform the lookup. */
266 /* The namespace used during the lookup. */
268 /* The symbol returned by the lookup, or NULL if no matching symbol
271 /* The block where the symbol was found, or NULL if no matching
273 const struct block
*block
;
274 /* A pointer to the next entry with the same hash. */
275 struct cache_entry
*next
;
278 /* The Ada symbol cache, used to store the result of Ada-mode symbol
279 lookups in the course of executing the user's commands.
281 The cache is implemented using a simple, fixed-sized hash.
282 The size is fixed on the grounds that there are not likely to be
283 all that many symbols looked up during any given session, regardless
284 of the size of the symbol table. If we decide to go to a resizable
285 table, let's just use the stuff from libiberty instead. */
287 #define HASH_SIZE 1009
289 struct ada_symbol_cache
291 /* An obstack used to store the entries in our cache. */
292 struct obstack cache_space
;
294 /* The root of the hash table used to implement our symbol cache. */
295 struct cache_entry
*root
[HASH_SIZE
];
298 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
300 /* Maximum-sized dynamic type. */
301 static unsigned int varsize_limit
;
303 static const char ada_completer_word_break_characters
[] =
305 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
307 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
310 /* The name of the symbol to use to get the name of the main subprogram. */
311 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
312 = "__gnat_ada_main_program_name";
314 /* Limit on the number of warnings to raise per expression evaluation. */
315 static int warning_limit
= 2;
317 /* Number of warning messages issued; reset to 0 by cleanups after
318 expression evaluation. */
319 static int warnings_issued
= 0;
321 static const char *known_runtime_file_name_patterns
[] = {
322 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
325 static const char *known_auxiliary_function_name_patterns
[] = {
326 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
329 /* Maintenance-related settings for this module. */
331 static struct cmd_list_element
*maint_set_ada_cmdlist
;
332 static struct cmd_list_element
*maint_show_ada_cmdlist
;
334 /* The "maintenance ada set/show ignore-descriptive-type" value. */
336 static bool ada_ignore_descriptive_types_p
= false;
338 /* Inferior-specific data. */
340 /* Per-inferior data for this module. */
342 struct ada_inferior_data
344 /* The ada__tags__type_specific_data type, which is used when decoding
345 tagged types. With older versions of GNAT, this type was directly
346 accessible through a component ("tsd") in the object tag. But this
347 is no longer the case, so we cache it for each inferior. */
348 struct type
*tsd_type
= nullptr;
350 /* The exception_support_info data. This data is used to determine
351 how to implement support for Ada exception catchpoints in a given
353 const struct exception_support_info
*exception_info
= nullptr;
356 /* Our key to this module's inferior data. */
357 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
359 /* Return our inferior data for the given inferior (INF).
361 This function always returns a valid pointer to an allocated
362 ada_inferior_data structure. If INF's inferior data has not
363 been previously set, this functions creates a new one with all
364 fields set to zero, sets INF's inferior to it, and then returns
365 a pointer to that newly allocated ada_inferior_data. */
367 static struct ada_inferior_data
*
368 get_ada_inferior_data (struct inferior
*inf
)
370 struct ada_inferior_data
*data
;
372 data
= ada_inferior_data
.get (inf
);
374 data
= ada_inferior_data
.emplace (inf
);
379 /* Perform all necessary cleanups regarding our module's inferior data
380 that is required after the inferior INF just exited. */
383 ada_inferior_exit (struct inferior
*inf
)
385 ada_inferior_data
.clear (inf
);
389 /* program-space-specific data. */
391 /* This module's per-program-space data. */
392 struct ada_pspace_data
396 if (sym_cache
!= NULL
)
397 ada_free_symbol_cache (sym_cache
);
400 /* The Ada symbol cache. */
401 struct ada_symbol_cache
*sym_cache
= nullptr;
404 /* Key to our per-program-space data. */
405 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
407 /* Return this module's data for the given program space (PSPACE).
408 If not is found, add a zero'ed one now.
410 This function always returns a valid object. */
412 static struct ada_pspace_data
*
413 get_ada_pspace_data (struct program_space
*pspace
)
415 struct ada_pspace_data
*data
;
417 data
= ada_pspace_data_handle
.get (pspace
);
419 data
= ada_pspace_data_handle
.emplace (pspace
);
426 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
427 all typedef layers have been peeled. Otherwise, return TYPE.
429 Normally, we really expect a typedef type to only have 1 typedef layer.
430 In other words, we really expect the target type of a typedef type to be
431 a non-typedef type. This is particularly true for Ada units, because
432 the language does not have a typedef vs not-typedef distinction.
433 In that respect, the Ada compiler has been trying to eliminate as many
434 typedef definitions in the debugging information, since they generally
435 do not bring any extra information (we still use typedef under certain
436 circumstances related mostly to the GNAT encoding).
438 Unfortunately, we have seen situations where the debugging information
439 generated by the compiler leads to such multiple typedef layers. For
440 instance, consider the following example with stabs:
442 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
443 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
445 This is an error in the debugging information which causes type
446 pck__float_array___XUP to be defined twice, and the second time,
447 it is defined as a typedef of a typedef.
449 This is on the fringe of legality as far as debugging information is
450 concerned, and certainly unexpected. But it is easy to handle these
451 situations correctly, so we can afford to be lenient in this case. */
454 ada_typedef_target_type (struct type
*type
)
456 while (type
->code () == TYPE_CODE_TYPEDEF
)
457 type
= TYPE_TARGET_TYPE (type
);
461 /* Given DECODED_NAME a string holding a symbol name in its
462 decoded form (ie using the Ada dotted notation), returns
463 its unqualified name. */
466 ada_unqualified_name (const char *decoded_name
)
470 /* If the decoded name starts with '<', it means that the encoded
471 name does not follow standard naming conventions, and thus that
472 it is not your typical Ada symbol name. Trying to unqualify it
473 is therefore pointless and possibly erroneous. */
474 if (decoded_name
[0] == '<')
477 result
= strrchr (decoded_name
, '.');
479 result
++; /* Skip the dot... */
481 result
= decoded_name
;
486 /* Return a string starting with '<', followed by STR, and '>'. */
489 add_angle_brackets (const char *str
)
491 return string_printf ("<%s>", str
);
495 ada_get_gdb_completer_word_break_characters (void)
497 return ada_completer_word_break_characters
;
500 /* la_watch_location_expression for Ada. */
502 static gdb::unique_xmalloc_ptr
<char>
503 ada_watch_location_expression (struct type
*type
, CORE_ADDR addr
)
505 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
506 std::string name
= type_to_string (type
);
507 return gdb::unique_xmalloc_ptr
<char>
508 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
511 /* Assuming V points to an array of S objects, make sure that it contains at
512 least M objects, updating V and S as necessary. */
514 #define GROW_VECT(v, s, m) \
515 if ((s) < (m)) (v) = (char *) grow_vect (v, &(s), m, sizeof *(v));
517 /* Assuming VECT points to an array of *SIZE objects of size
518 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
519 updating *SIZE as necessary and returning the (new) array. */
522 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
524 if (*size
< min_size
)
527 if (*size
< min_size
)
529 vect
= xrealloc (vect
, *size
* element_size
);
534 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
535 suffix of FIELD_NAME beginning "___". */
538 field_name_match (const char *field_name
, const char *target
)
540 int len
= strlen (target
);
543 (strncmp (field_name
, target
, len
) == 0
544 && (field_name
[len
] == '\0'
545 || (startswith (field_name
+ len
, "___")
546 && strcmp (field_name
+ strlen (field_name
) - 6,
551 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
552 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
553 and return its index. This function also handles fields whose name
554 have ___ suffixes because the compiler sometimes alters their name
555 by adding such a suffix to represent fields with certain constraints.
556 If the field could not be found, return a negative number if
557 MAYBE_MISSING is set. Otherwise raise an error. */
560 ada_get_field_index (const struct type
*type
, const char *field_name
,
564 struct type
*struct_type
= check_typedef ((struct type
*) type
);
566 for (fieldno
= 0; fieldno
< struct_type
->num_fields (); fieldno
++)
567 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
571 error (_("Unable to find field %s in struct %s. Aborting"),
572 field_name
, struct_type
->name ());
577 /* The length of the prefix of NAME prior to any "___" suffix. */
580 ada_name_prefix_len (const char *name
)
586 const char *p
= strstr (name
, "___");
589 return strlen (name
);
595 /* Return non-zero if SUFFIX is a suffix of STR.
596 Return zero if STR is null. */
599 is_suffix (const char *str
, const char *suffix
)
606 len2
= strlen (suffix
);
607 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
610 /* The contents of value VAL, treated as a value of type TYPE. The
611 result is an lval in memory if VAL is. */
613 static struct value
*
614 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
616 type
= ada_check_typedef (type
);
617 if (value_type (val
) == type
)
621 struct value
*result
;
623 /* Make sure that the object size is not unreasonable before
624 trying to allocate some memory for it. */
625 ada_ensure_varsize_limit (type
);
628 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
629 result
= allocate_value_lazy (type
);
632 result
= allocate_value (type
);
633 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
635 set_value_component_location (result
, val
);
636 set_value_bitsize (result
, value_bitsize (val
));
637 set_value_bitpos (result
, value_bitpos (val
));
638 if (VALUE_LVAL (result
) == lval_memory
)
639 set_value_address (result
, value_address (val
));
644 static const gdb_byte
*
645 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
650 return valaddr
+ offset
;
654 cond_offset_target (CORE_ADDR address
, long offset
)
659 return address
+ offset
;
662 /* Issue a warning (as for the definition of warning in utils.c, but
663 with exactly one argument rather than ...), unless the limit on the
664 number of warnings has passed during the evaluation of the current
667 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
668 provided by "complaint". */
669 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
672 lim_warning (const char *format
, ...)
676 va_start (args
, format
);
677 warnings_issued
+= 1;
678 if (warnings_issued
<= warning_limit
)
679 vwarning (format
, args
);
684 /* Issue an error if the size of an object of type T is unreasonable,
685 i.e. if it would be a bad idea to allocate a value of this type in
689 ada_ensure_varsize_limit (const struct type
*type
)
691 if (TYPE_LENGTH (type
) > varsize_limit
)
692 error (_("object size is larger than varsize-limit"));
695 /* Maximum value of a SIZE-byte signed integer type. */
697 max_of_size (int size
)
699 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
701 return top_bit
| (top_bit
- 1);
704 /* Minimum value of a SIZE-byte signed integer type. */
706 min_of_size (int size
)
708 return -max_of_size (size
) - 1;
711 /* Maximum value of a SIZE-byte unsigned integer type. */
713 umax_of_size (int size
)
715 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
717 return top_bit
| (top_bit
- 1);
720 /* Maximum value of integral type T, as a signed quantity. */
722 max_of_type (struct type
*t
)
724 if (TYPE_UNSIGNED (t
))
725 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
727 return max_of_size (TYPE_LENGTH (t
));
730 /* Minimum value of integral type T, as a signed quantity. */
732 min_of_type (struct type
*t
)
734 if (TYPE_UNSIGNED (t
))
737 return min_of_size (TYPE_LENGTH (t
));
740 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
742 ada_discrete_type_high_bound (struct type
*type
)
744 type
= resolve_dynamic_type (type
, {}, 0);
745 switch (type
->code ())
747 case TYPE_CODE_RANGE
:
748 return TYPE_HIGH_BOUND (type
);
750 return TYPE_FIELD_ENUMVAL (type
, type
->num_fields () - 1);
755 return max_of_type (type
);
757 error (_("Unexpected type in ada_discrete_type_high_bound."));
761 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
763 ada_discrete_type_low_bound (struct type
*type
)
765 type
= resolve_dynamic_type (type
, {}, 0);
766 switch (type
->code ())
768 case TYPE_CODE_RANGE
:
769 return TYPE_LOW_BOUND (type
);
771 return TYPE_FIELD_ENUMVAL (type
, 0);
776 return min_of_type (type
);
778 error (_("Unexpected type in ada_discrete_type_low_bound."));
782 /* The identity on non-range types. For range types, the underlying
783 non-range scalar type. */
786 get_base_type (struct type
*type
)
788 while (type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
)
790 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
792 type
= TYPE_TARGET_TYPE (type
);
797 /* Return a decoded version of the given VALUE. This means returning
798 a value whose type is obtained by applying all the GNAT-specific
799 encodings, making the resulting type a static but standard description
800 of the initial type. */
803 ada_get_decoded_value (struct value
*value
)
805 struct type
*type
= ada_check_typedef (value_type (value
));
807 if (ada_is_array_descriptor_type (type
)
808 || (ada_is_constrained_packed_array_type (type
)
809 && type
->code () != TYPE_CODE_PTR
))
811 if (type
->code () == TYPE_CODE_TYPEDEF
) /* array access type. */
812 value
= ada_coerce_to_simple_array_ptr (value
);
814 value
= ada_coerce_to_simple_array (value
);
817 value
= ada_to_fixed_value (value
);
822 /* Same as ada_get_decoded_value, but with the given TYPE.
823 Because there is no associated actual value for this type,
824 the resulting type might be a best-effort approximation in
825 the case of dynamic types. */
828 ada_get_decoded_type (struct type
*type
)
830 type
= to_static_fixed_type (type
);
831 if (ada_is_constrained_packed_array_type (type
))
832 type
= ada_coerce_to_simple_array_type (type
);
838 /* Language Selection */
840 /* If the main program is in Ada, return language_ada, otherwise return LANG
841 (the main program is in Ada iif the adainit symbol is found). */
844 ada_update_initial_language (enum language lang
)
846 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
852 /* If the main procedure is written in Ada, then return its name.
853 The result is good until the next call. Return NULL if the main
854 procedure doesn't appear to be in Ada. */
859 struct bound_minimal_symbol msym
;
860 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
862 /* For Ada, the name of the main procedure is stored in a specific
863 string constant, generated by the binder. Look for that symbol,
864 extract its address, and then read that string. If we didn't find
865 that string, then most probably the main procedure is not written
867 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
869 if (msym
.minsym
!= NULL
)
871 CORE_ADDR main_program_name_addr
;
874 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
875 if (main_program_name_addr
== 0)
876 error (_("Invalid address for Ada main program name."));
878 target_read_string (main_program_name_addr
, &main_program_name
,
883 return main_program_name
.get ();
886 /* The main procedure doesn't seem to be in Ada. */
892 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
895 const struct ada_opname_map ada_opname_table
[] = {
896 {"Oadd", "\"+\"", BINOP_ADD
},
897 {"Osubtract", "\"-\"", BINOP_SUB
},
898 {"Omultiply", "\"*\"", BINOP_MUL
},
899 {"Odivide", "\"/\"", BINOP_DIV
},
900 {"Omod", "\"mod\"", BINOP_MOD
},
901 {"Orem", "\"rem\"", BINOP_REM
},
902 {"Oexpon", "\"**\"", BINOP_EXP
},
903 {"Olt", "\"<\"", BINOP_LESS
},
904 {"Ole", "\"<=\"", BINOP_LEQ
},
905 {"Ogt", "\">\"", BINOP_GTR
},
906 {"Oge", "\">=\"", BINOP_GEQ
},
907 {"Oeq", "\"=\"", BINOP_EQUAL
},
908 {"One", "\"/=\"", BINOP_NOTEQUAL
},
909 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
910 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
911 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
912 {"Oconcat", "\"&\"", BINOP_CONCAT
},
913 {"Oabs", "\"abs\"", UNOP_ABS
},
914 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
915 {"Oadd", "\"+\"", UNOP_PLUS
},
916 {"Osubtract", "\"-\"", UNOP_NEG
},
920 /* The "encoded" form of DECODED, according to GNAT conventions. The
921 result is valid until the next call to ada_encode. If
922 THROW_ERRORS, throw an error if invalid operator name is found.
923 Otherwise, return NULL in that case. */
926 ada_encode_1 (const char *decoded
, bool throw_errors
)
928 static char *encoding_buffer
= NULL
;
929 static size_t encoding_buffer_size
= 0;
936 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
937 2 * strlen (decoded
) + 10);
940 for (p
= decoded
; *p
!= '\0'; p
+= 1)
944 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
949 const struct ada_opname_map
*mapping
;
951 for (mapping
= ada_opname_table
;
952 mapping
->encoded
!= NULL
953 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
955 if (mapping
->encoded
== NULL
)
958 error (_("invalid Ada operator name: %s"), p
);
962 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
963 k
+= strlen (mapping
->encoded
);
968 encoding_buffer
[k
] = *p
;
973 encoding_buffer
[k
] = '\0';
974 return encoding_buffer
;
977 /* The "encoded" form of DECODED, according to GNAT conventions.
978 The result is valid until the next call to ada_encode. */
981 ada_encode (const char *decoded
)
983 return ada_encode_1 (decoded
, true);
986 /* Return NAME folded to lower case, or, if surrounded by single
987 quotes, unfolded, but with the quotes stripped away. Result good
991 ada_fold_name (gdb::string_view name
)
993 static char *fold_buffer
= NULL
;
994 static size_t fold_buffer_size
= 0;
996 int len
= name
.size ();
997 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1001 strncpy (fold_buffer
, name
.data () + 1, len
- 2);
1002 fold_buffer
[len
- 2] = '\000';
1008 for (i
= 0; i
<= len
; i
+= 1)
1009 fold_buffer
[i
] = tolower (name
[i
]);
1015 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1018 is_lower_alphanum (const char c
)
1020 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1023 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1024 This function saves in LEN the length of that same symbol name but
1025 without either of these suffixes:
1031 These are suffixes introduced by the compiler for entities such as
1032 nested subprogram for instance, in order to avoid name clashes.
1033 They do not serve any purpose for the debugger. */
1036 ada_remove_trailing_digits (const char *encoded
, int *len
)
1038 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1042 while (i
> 0 && isdigit (encoded
[i
]))
1044 if (i
>= 0 && encoded
[i
] == '.')
1046 else if (i
>= 0 && encoded
[i
] == '$')
1048 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1050 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1055 /* Remove the suffix introduced by the compiler for protected object
1059 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1061 /* Remove trailing N. */
1063 /* Protected entry subprograms are broken into two
1064 separate subprograms: The first one is unprotected, and has
1065 a 'N' suffix; the second is the protected version, and has
1066 the 'P' suffix. The second calls the first one after handling
1067 the protection. Since the P subprograms are internally generated,
1068 we leave these names undecoded, giving the user a clue that this
1069 entity is internal. */
1072 && encoded
[*len
- 1] == 'N'
1073 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1077 /* If ENCODED follows the GNAT entity encoding conventions, then return
1078 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1079 replaced by ENCODED. */
1082 ada_decode (const char *encoded
)
1088 std::string decoded
;
1090 /* With function descriptors on PPC64, the value of a symbol named
1091 ".FN", if it exists, is the entry point of the function "FN". */
1092 if (encoded
[0] == '.')
1095 /* The name of the Ada main procedure starts with "_ada_".
1096 This prefix is not part of the decoded name, so skip this part
1097 if we see this prefix. */
1098 if (startswith (encoded
, "_ada_"))
1101 /* If the name starts with '_', then it is not a properly encoded
1102 name, so do not attempt to decode it. Similarly, if the name
1103 starts with '<', the name should not be decoded. */
1104 if (encoded
[0] == '_' || encoded
[0] == '<')
1107 len0
= strlen (encoded
);
1109 ada_remove_trailing_digits (encoded
, &len0
);
1110 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1112 /* Remove the ___X.* suffix if present. Do not forget to verify that
1113 the suffix is located before the current "end" of ENCODED. We want
1114 to avoid re-matching parts of ENCODED that have previously been
1115 marked as discarded (by decrementing LEN0). */
1116 p
= strstr (encoded
, "___");
1117 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1125 /* Remove any trailing TKB suffix. It tells us that this symbol
1126 is for the body of a task, but that information does not actually
1127 appear in the decoded name. */
1129 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1132 /* Remove any trailing TB suffix. The TB suffix is slightly different
1133 from the TKB suffix because it is used for non-anonymous task
1136 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1139 /* Remove trailing "B" suffixes. */
1140 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1142 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1145 /* Make decoded big enough for possible expansion by operator name. */
1147 decoded
.resize (2 * len0
+ 1, 'X');
1149 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1151 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1154 while ((i
>= 0 && isdigit (encoded
[i
]))
1155 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1157 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1159 else if (encoded
[i
] == '$')
1163 /* The first few characters that are not alphabetic are not part
1164 of any encoding we use, so we can copy them over verbatim. */
1166 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1167 decoded
[j
] = encoded
[i
];
1172 /* Is this a symbol function? */
1173 if (at_start_name
&& encoded
[i
] == 'O')
1177 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1179 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1180 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1182 && !isalnum (encoded
[i
+ op_len
]))
1184 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1187 j
+= strlen (ada_opname_table
[k
].decoded
);
1191 if (ada_opname_table
[k
].encoded
!= NULL
)
1196 /* Replace "TK__" with "__", which will eventually be translated
1197 into "." (just below). */
1199 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1202 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1203 be translated into "." (just below). These are internal names
1204 generated for anonymous blocks inside which our symbol is nested. */
1206 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1207 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1208 && isdigit (encoded
[i
+4]))
1212 while (k
< len0
&& isdigit (encoded
[k
]))
1213 k
++; /* Skip any extra digit. */
1215 /* Double-check that the "__B_{DIGITS}+" sequence we found
1216 is indeed followed by "__". */
1217 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1221 /* Remove _E{DIGITS}+[sb] */
1223 /* Just as for protected object subprograms, there are 2 categories
1224 of subprograms created by the compiler for each entry. The first
1225 one implements the actual entry code, and has a suffix following
1226 the convention above; the second one implements the barrier and
1227 uses the same convention as above, except that the 'E' is replaced
1230 Just as above, we do not decode the name of barrier functions
1231 to give the user a clue that the code he is debugging has been
1232 internally generated. */
1234 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1235 && isdigit (encoded
[i
+2]))
1239 while (k
< len0
&& isdigit (encoded
[k
]))
1243 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1246 /* Just as an extra precaution, make sure that if this
1247 suffix is followed by anything else, it is a '_'.
1248 Otherwise, we matched this sequence by accident. */
1250 || (k
< len0
&& encoded
[k
] == '_'))
1255 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1256 the GNAT front-end in protected object subprograms. */
1259 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1261 /* Backtrack a bit up until we reach either the begining of
1262 the encoded name, or "__". Make sure that we only find
1263 digits or lowercase characters. */
1264 const char *ptr
= encoded
+ i
- 1;
1266 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1269 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1273 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1275 /* This is a X[bn]* sequence not separated from the previous
1276 part of the name with a non-alpha-numeric character (in other
1277 words, immediately following an alpha-numeric character), then
1278 verify that it is placed at the end of the encoded name. If
1279 not, then the encoding is not valid and we should abort the
1280 decoding. Otherwise, just skip it, it is used in body-nested
1284 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1288 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1290 /* Replace '__' by '.'. */
1298 /* It's a character part of the decoded name, so just copy it
1300 decoded
[j
] = encoded
[i
];
1307 /* Decoded names should never contain any uppercase character.
1308 Double-check this, and abort the decoding if we find one. */
1310 for (i
= 0; i
< decoded
.length(); ++i
)
1311 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1317 if (encoded
[0] == '<')
1320 decoded
= '<' + std::string(encoded
) + '>';
1325 /* Table for keeping permanent unique copies of decoded names. Once
1326 allocated, names in this table are never released. While this is a
1327 storage leak, it should not be significant unless there are massive
1328 changes in the set of decoded names in successive versions of a
1329 symbol table loaded during a single session. */
1330 static struct htab
*decoded_names_store
;
1332 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1333 in the language-specific part of GSYMBOL, if it has not been
1334 previously computed. Tries to save the decoded name in the same
1335 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1336 in any case, the decoded symbol has a lifetime at least that of
1338 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1339 const, but nevertheless modified to a semantically equivalent form
1340 when a decoded name is cached in it. */
1343 ada_decode_symbol (const struct general_symbol_info
*arg
)
1345 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1346 const char **resultp
=
1347 &gsymbol
->language_specific
.demangled_name
;
1349 if (!gsymbol
->ada_mangled
)
1351 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1352 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1354 gsymbol
->ada_mangled
= 1;
1356 if (obstack
!= NULL
)
1357 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1360 /* Sometimes, we can't find a corresponding objfile, in
1361 which case, we put the result on the heap. Since we only
1362 decode when needed, we hope this usually does not cause a
1363 significant memory leak (FIXME). */
1365 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1366 decoded
.c_str (), INSERT
);
1369 *slot
= xstrdup (decoded
.c_str ());
1378 ada_la_decode (const char *encoded
, int options
)
1380 return xstrdup (ada_decode (encoded
).c_str ());
1383 /* Implement la_sniff_from_mangled_name for Ada. */
1386 ada_sniff_from_mangled_name (const char *mangled
, char **out
)
1388 std::string demangled
= ada_decode (mangled
);
1392 if (demangled
!= mangled
&& demangled
[0] != '<')
1394 /* Set the gsymbol language to Ada, but still return 0.
1395 Two reasons for that:
1397 1. For Ada, we prefer computing the symbol's decoded name
1398 on the fly rather than pre-compute it, in order to save
1399 memory (Ada projects are typically very large).
1401 2. There are some areas in the definition of the GNAT
1402 encoding where, with a bit of bad luck, we might be able
1403 to decode a non-Ada symbol, generating an incorrect
1404 demangled name (Eg: names ending with "TB" for instance
1405 are identified as task bodies and so stripped from
1406 the decoded name returned).
1408 Returning 1, here, but not setting *DEMANGLED, helps us get a
1409 little bit of the best of both worlds. Because we're last,
1410 we should not affect any of the other languages that were
1411 able to demangle the symbol before us; we get to correctly
1412 tag Ada symbols as such; and even if we incorrectly tagged a
1413 non-Ada symbol, which should be rare, any routing through the
1414 Ada language should be transparent (Ada tries to behave much
1415 like C/C++ with non-Ada symbols). */
1426 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1427 generated by the GNAT compiler to describe the index type used
1428 for each dimension of an array, check whether it follows the latest
1429 known encoding. If not, fix it up to conform to the latest encoding.
1430 Otherwise, do nothing. This function also does nothing if
1431 INDEX_DESC_TYPE is NULL.
1433 The GNAT encoding used to describe the array index type evolved a bit.
1434 Initially, the information would be provided through the name of each
1435 field of the structure type only, while the type of these fields was
1436 described as unspecified and irrelevant. The debugger was then expected
1437 to perform a global type lookup using the name of that field in order
1438 to get access to the full index type description. Because these global
1439 lookups can be very expensive, the encoding was later enhanced to make
1440 the global lookup unnecessary by defining the field type as being
1441 the full index type description.
1443 The purpose of this routine is to allow us to support older versions
1444 of the compiler by detecting the use of the older encoding, and by
1445 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1446 we essentially replace each field's meaningless type by the associated
1450 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1454 if (index_desc_type
== NULL
)
1456 gdb_assert (index_desc_type
->num_fields () > 0);
1458 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1459 to check one field only, no need to check them all). If not, return
1462 If our INDEX_DESC_TYPE was generated using the older encoding,
1463 the field type should be a meaningless integer type whose name
1464 is not equal to the field name. */
1465 if (TYPE_FIELD_TYPE (index_desc_type
, 0)->name () != NULL
1466 && strcmp (TYPE_FIELD_TYPE (index_desc_type
, 0)->name (),
1467 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1470 /* Fixup each field of INDEX_DESC_TYPE. */
1471 for (i
= 0; i
< index_desc_type
->num_fields (); i
++)
1473 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1474 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1477 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1481 /* The desc_* routines return primitive portions of array descriptors
1484 /* The descriptor or array type, if any, indicated by TYPE; removes
1485 level of indirection, if needed. */
1487 static struct type
*
1488 desc_base_type (struct type
*type
)
1492 type
= ada_check_typedef (type
);
1493 if (type
->code () == TYPE_CODE_TYPEDEF
)
1494 type
= ada_typedef_target_type (type
);
1497 && (type
->code () == TYPE_CODE_PTR
1498 || type
->code () == TYPE_CODE_REF
))
1499 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1504 /* True iff TYPE indicates a "thin" array pointer type. */
1507 is_thin_pntr (struct type
*type
)
1510 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1511 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1514 /* The descriptor type for thin pointer type TYPE. */
1516 static struct type
*
1517 thin_descriptor_type (struct type
*type
)
1519 struct type
*base_type
= desc_base_type (type
);
1521 if (base_type
== NULL
)
1523 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1527 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1529 if (alt_type
== NULL
)
1536 /* A pointer to the array data for thin-pointer value VAL. */
1538 static struct value
*
1539 thin_data_pntr (struct value
*val
)
1541 struct type
*type
= ada_check_typedef (value_type (val
));
1542 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1544 data_type
= lookup_pointer_type (data_type
);
1546 if (type
->code () == TYPE_CODE_PTR
)
1547 return value_cast (data_type
, value_copy (val
));
1549 return value_from_longest (data_type
, value_address (val
));
1552 /* True iff TYPE indicates a "thick" array pointer type. */
1555 is_thick_pntr (struct type
*type
)
1557 type
= desc_base_type (type
);
1558 return (type
!= NULL
&& type
->code () == TYPE_CODE_STRUCT
1559 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1562 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1563 pointer to one, the type of its bounds data; otherwise, NULL. */
1565 static struct type
*
1566 desc_bounds_type (struct type
*type
)
1570 type
= desc_base_type (type
);
1574 else if (is_thin_pntr (type
))
1576 type
= thin_descriptor_type (type
);
1579 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1581 return ada_check_typedef (r
);
1583 else if (type
->code () == TYPE_CODE_STRUCT
)
1585 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1587 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1592 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1593 one, a pointer to its bounds data. Otherwise NULL. */
1595 static struct value
*
1596 desc_bounds (struct value
*arr
)
1598 struct type
*type
= ada_check_typedef (value_type (arr
));
1600 if (is_thin_pntr (type
))
1602 struct type
*bounds_type
=
1603 desc_bounds_type (thin_descriptor_type (type
));
1606 if (bounds_type
== NULL
)
1607 error (_("Bad GNAT array descriptor"));
1609 /* NOTE: The following calculation is not really kosher, but
1610 since desc_type is an XVE-encoded type (and shouldn't be),
1611 the correct calculation is a real pain. FIXME (and fix GCC). */
1612 if (type
->code () == TYPE_CODE_PTR
)
1613 addr
= value_as_long (arr
);
1615 addr
= value_address (arr
);
1618 value_from_longest (lookup_pointer_type (bounds_type
),
1619 addr
- TYPE_LENGTH (bounds_type
));
1622 else if (is_thick_pntr (type
))
1624 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1625 _("Bad GNAT array descriptor"));
1626 struct type
*p_bounds_type
= value_type (p_bounds
);
1629 && p_bounds_type
->code () == TYPE_CODE_PTR
)
1631 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1633 if (TYPE_STUB (target_type
))
1634 p_bounds
= value_cast (lookup_pointer_type
1635 (ada_check_typedef (target_type
)),
1639 error (_("Bad GNAT array descriptor"));
1647 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1648 position of the field containing the address of the bounds data. */
1651 fat_pntr_bounds_bitpos (struct type
*type
)
1653 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1656 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1657 size of the field containing the address of the bounds data. */
1660 fat_pntr_bounds_bitsize (struct type
*type
)
1662 type
= desc_base_type (type
);
1664 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1665 return TYPE_FIELD_BITSIZE (type
, 1);
1667 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1670 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1671 pointer to one, the type of its array data (a array-with-no-bounds type);
1672 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1675 static struct type
*
1676 desc_data_target_type (struct type
*type
)
1678 type
= desc_base_type (type
);
1680 /* NOTE: The following is bogus; see comment in desc_bounds. */
1681 if (is_thin_pntr (type
))
1682 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1683 else if (is_thick_pntr (type
))
1685 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1688 && ada_check_typedef (data_type
)->code () == TYPE_CODE_PTR
)
1689 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1695 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1698 static struct value
*
1699 desc_data (struct value
*arr
)
1701 struct type
*type
= value_type (arr
);
1703 if (is_thin_pntr (type
))
1704 return thin_data_pntr (arr
);
1705 else if (is_thick_pntr (type
))
1706 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1707 _("Bad GNAT array descriptor"));
1713 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1714 position of the field containing the address of the data. */
1717 fat_pntr_data_bitpos (struct type
*type
)
1719 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1722 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1723 size of the field containing the address of the data. */
1726 fat_pntr_data_bitsize (struct type
*type
)
1728 type
= desc_base_type (type
);
1730 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1731 return TYPE_FIELD_BITSIZE (type
, 0);
1733 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1736 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1737 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1738 bound, if WHICH is 1. The first bound is I=1. */
1740 static struct value
*
1741 desc_one_bound (struct value
*bounds
, int i
, int which
)
1743 char bound_name
[20];
1744 xsnprintf (bound_name
, sizeof (bound_name
), "%cB%d",
1745 which
? 'U' : 'L', i
- 1);
1746 return value_struct_elt (&bounds
, NULL
, bound_name
, NULL
,
1747 _("Bad GNAT array descriptor bounds"));
1750 /* If BOUNDS is an array-bounds structure type, return the bit position
1751 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1752 bound, if WHICH is 1. The first bound is I=1. */
1755 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1757 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1760 /* If BOUNDS is an array-bounds structure type, return the bit field size
1761 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1762 bound, if WHICH is 1. The first bound is I=1. */
1765 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1767 type
= desc_base_type (type
);
1769 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1770 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1772 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1775 /* If TYPE is the type of an array-bounds structure, the type of its
1776 Ith bound (numbering from 1). Otherwise, NULL. */
1778 static struct type
*
1779 desc_index_type (struct type
*type
, int i
)
1781 type
= desc_base_type (type
);
1783 if (type
->code () == TYPE_CODE_STRUCT
)
1785 char bound_name
[20];
1786 xsnprintf (bound_name
, sizeof (bound_name
), "LB%d", i
- 1);
1787 return lookup_struct_elt_type (type
, bound_name
, 1);
1793 /* The number of index positions in the array-bounds type TYPE.
1794 Return 0 if TYPE is NULL. */
1797 desc_arity (struct type
*type
)
1799 type
= desc_base_type (type
);
1802 return type
->num_fields () / 2;
1806 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1807 an array descriptor type (representing an unconstrained array
1811 ada_is_direct_array_type (struct type
*type
)
1815 type
= ada_check_typedef (type
);
1816 return (type
->code () == TYPE_CODE_ARRAY
1817 || ada_is_array_descriptor_type (type
));
1820 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1824 ada_is_array_type (struct type
*type
)
1827 && (type
->code () == TYPE_CODE_PTR
1828 || type
->code () == TYPE_CODE_REF
))
1829 type
= TYPE_TARGET_TYPE (type
);
1830 return ada_is_direct_array_type (type
);
1833 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1836 ada_is_simple_array_type (struct type
*type
)
1840 type
= ada_check_typedef (type
);
1841 return (type
->code () == TYPE_CODE_ARRAY
1842 || (type
->code () == TYPE_CODE_PTR
1843 && (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ()
1844 == TYPE_CODE_ARRAY
)));
1847 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1850 ada_is_array_descriptor_type (struct type
*type
)
1852 struct type
*data_type
= desc_data_target_type (type
);
1856 type
= ada_check_typedef (type
);
1857 return (data_type
!= NULL
1858 && data_type
->code () == TYPE_CODE_ARRAY
1859 && desc_arity (desc_bounds_type (type
)) > 0);
1862 /* Non-zero iff type is a partially mal-formed GNAT array
1863 descriptor. FIXME: This is to compensate for some problems with
1864 debugging output from GNAT. Re-examine periodically to see if it
1868 ada_is_bogus_array_descriptor (struct type
*type
)
1872 && type
->code () == TYPE_CODE_STRUCT
1873 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1874 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1875 && !ada_is_array_descriptor_type (type
);
1879 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1880 (fat pointer) returns the type of the array data described---specifically,
1881 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1882 in from the descriptor; otherwise, they are left unspecified. If
1883 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1884 returns NULL. The result is simply the type of ARR if ARR is not
1887 static struct type
*
1888 ada_type_of_array (struct value
*arr
, int bounds
)
1890 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1891 return decode_constrained_packed_array_type (value_type (arr
));
1893 if (!ada_is_array_descriptor_type (value_type (arr
)))
1894 return value_type (arr
);
1898 struct type
*array_type
=
1899 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1901 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1902 TYPE_FIELD_BITSIZE (array_type
, 0) =
1903 decode_packed_array_bitsize (value_type (arr
));
1909 struct type
*elt_type
;
1911 struct value
*descriptor
;
1913 elt_type
= ada_array_element_type (value_type (arr
), -1);
1914 arity
= ada_array_arity (value_type (arr
));
1916 if (elt_type
== NULL
|| arity
== 0)
1917 return ada_check_typedef (value_type (arr
));
1919 descriptor
= desc_bounds (arr
);
1920 if (value_as_long (descriptor
) == 0)
1924 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1925 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1926 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1927 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1930 create_static_range_type (range_type
, value_type (low
),
1931 longest_to_int (value_as_long (low
)),
1932 longest_to_int (value_as_long (high
)));
1933 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1935 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1937 /* We need to store the element packed bitsize, as well as
1938 recompute the array size, because it was previously
1939 computed based on the unpacked element size. */
1940 LONGEST lo
= value_as_long (low
);
1941 LONGEST hi
= value_as_long (high
);
1943 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1944 decode_packed_array_bitsize (value_type (arr
));
1945 /* If the array has no element, then the size is already
1946 zero, and does not need to be recomputed. */
1950 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1952 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1957 return lookup_pointer_type (elt_type
);
1961 /* If ARR does not represent an array, returns ARR unchanged.
1962 Otherwise, returns either a standard GDB array with bounds set
1963 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1964 GDB array. Returns NULL if ARR is a null fat pointer. */
1967 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1969 if (ada_is_array_descriptor_type (value_type (arr
)))
1971 struct type
*arrType
= ada_type_of_array (arr
, 1);
1973 if (arrType
== NULL
)
1975 return value_cast (arrType
, value_copy (desc_data (arr
)));
1977 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1978 return decode_constrained_packed_array (arr
);
1983 /* If ARR does not represent an array, returns ARR unchanged.
1984 Otherwise, returns a standard GDB array describing ARR (which may
1985 be ARR itself if it already is in the proper form). */
1988 ada_coerce_to_simple_array (struct value
*arr
)
1990 if (ada_is_array_descriptor_type (value_type (arr
)))
1992 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1995 error (_("Bounds unavailable for null array pointer."));
1996 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
1997 return value_ind (arrVal
);
1999 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2000 return decode_constrained_packed_array (arr
);
2005 /* If TYPE represents a GNAT array type, return it translated to an
2006 ordinary GDB array type (possibly with BITSIZE fields indicating
2007 packing). For other types, is the identity. */
2010 ada_coerce_to_simple_array_type (struct type
*type
)
2012 if (ada_is_constrained_packed_array_type (type
))
2013 return decode_constrained_packed_array_type (type
);
2015 if (ada_is_array_descriptor_type (type
))
2016 return ada_check_typedef (desc_data_target_type (type
));
2021 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2024 ada_is_packed_array_type (struct type
*type
)
2028 type
= desc_base_type (type
);
2029 type
= ada_check_typedef (type
);
2031 ada_type_name (type
) != NULL
2032 && strstr (ada_type_name (type
), "___XP") != NULL
;
2035 /* Non-zero iff TYPE represents a standard GNAT constrained
2036 packed-array type. */
2039 ada_is_constrained_packed_array_type (struct type
*type
)
2041 return ada_is_packed_array_type (type
)
2042 && !ada_is_array_descriptor_type (type
);
2045 /* Non-zero iff TYPE represents an array descriptor for a
2046 unconstrained packed-array type. */
2049 ada_is_unconstrained_packed_array_type (struct type
*type
)
2051 return ada_is_packed_array_type (type
)
2052 && ada_is_array_descriptor_type (type
);
2055 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2056 return the size of its elements in bits. */
2059 decode_packed_array_bitsize (struct type
*type
)
2061 const char *raw_name
;
2065 /* Access to arrays implemented as fat pointers are encoded as a typedef
2066 of the fat pointer type. We need the name of the fat pointer type
2067 to do the decoding, so strip the typedef layer. */
2068 if (type
->code () == TYPE_CODE_TYPEDEF
)
2069 type
= ada_typedef_target_type (type
);
2071 raw_name
= ada_type_name (ada_check_typedef (type
));
2073 raw_name
= ada_type_name (desc_base_type (type
));
2078 tail
= strstr (raw_name
, "___XP");
2079 gdb_assert (tail
!= NULL
);
2081 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2084 (_("could not understand bit size information on packed array"));
2091 /* Given that TYPE is a standard GDB array type with all bounds filled
2092 in, and that the element size of its ultimate scalar constituents
2093 (that is, either its elements, or, if it is an array of arrays, its
2094 elements' elements, etc.) is *ELT_BITS, return an identical type,
2095 but with the bit sizes of its elements (and those of any
2096 constituent arrays) recorded in the BITSIZE components of its
2097 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2100 Note that, for arrays whose index type has an XA encoding where
2101 a bound references a record discriminant, getting that discriminant,
2102 and therefore the actual value of that bound, is not possible
2103 because none of the given parameters gives us access to the record.
2104 This function assumes that it is OK in the context where it is being
2105 used to return an array whose bounds are still dynamic and where
2106 the length is arbitrary. */
2108 static struct type
*
2109 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2111 struct type
*new_elt_type
;
2112 struct type
*new_type
;
2113 struct type
*index_type_desc
;
2114 struct type
*index_type
;
2115 LONGEST low_bound
, high_bound
;
2117 type
= ada_check_typedef (type
);
2118 if (type
->code () != TYPE_CODE_ARRAY
)
2121 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2122 if (index_type_desc
)
2123 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2126 index_type
= TYPE_INDEX_TYPE (type
);
2128 new_type
= alloc_type_copy (type
);
2130 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2132 create_array_type (new_type
, new_elt_type
, index_type
);
2133 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2134 new_type
->set_name (ada_type_name (type
));
2136 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2137 && is_dynamic_type (check_typedef (index_type
)))
2138 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2139 low_bound
= high_bound
= 0;
2140 if (high_bound
< low_bound
)
2141 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2144 *elt_bits
*= (high_bound
- low_bound
+ 1);
2145 TYPE_LENGTH (new_type
) =
2146 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2149 TYPE_FIXED_INSTANCE (new_type
) = 1;
2153 /* The array type encoded by TYPE, where
2154 ada_is_constrained_packed_array_type (TYPE). */
2156 static struct type
*
2157 decode_constrained_packed_array_type (struct type
*type
)
2159 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2162 struct type
*shadow_type
;
2166 raw_name
= ada_type_name (desc_base_type (type
));
2171 name
= (char *) alloca (strlen (raw_name
) + 1);
2172 tail
= strstr (raw_name
, "___XP");
2173 type
= desc_base_type (type
);
2175 memcpy (name
, raw_name
, tail
- raw_name
);
2176 name
[tail
- raw_name
] = '\000';
2178 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2180 if (shadow_type
== NULL
)
2182 lim_warning (_("could not find bounds information on packed array"));
2185 shadow_type
= check_typedef (shadow_type
);
2187 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2189 lim_warning (_("could not understand bounds "
2190 "information on packed array"));
2194 bits
= decode_packed_array_bitsize (type
);
2195 return constrained_packed_array_type (shadow_type
, &bits
);
2198 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2199 array, returns a simple array that denotes that array. Its type is a
2200 standard GDB array type except that the BITSIZEs of the array
2201 target types are set to the number of bits in each element, and the
2202 type length is set appropriately. */
2204 static struct value
*
2205 decode_constrained_packed_array (struct value
*arr
)
2209 /* If our value is a pointer, then dereference it. Likewise if
2210 the value is a reference. Make sure that this operation does not
2211 cause the target type to be fixed, as this would indirectly cause
2212 this array to be decoded. The rest of the routine assumes that
2213 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2214 and "value_ind" routines to perform the dereferencing, as opposed
2215 to using "ada_coerce_ref" or "ada_value_ind". */
2216 arr
= coerce_ref (arr
);
2217 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2218 arr
= value_ind (arr
);
2220 type
= decode_constrained_packed_array_type (value_type (arr
));
2223 error (_("can't unpack array"));
2227 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2228 && ada_is_modular_type (value_type (arr
)))
2230 /* This is a (right-justified) modular type representing a packed
2231 array with no wrapper. In order to interpret the value through
2232 the (left-justified) packed array type we just built, we must
2233 first left-justify it. */
2234 int bit_size
, bit_pos
;
2237 mod
= ada_modulus (value_type (arr
)) - 1;
2244 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2245 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2246 bit_pos
/ HOST_CHAR_BIT
,
2247 bit_pos
% HOST_CHAR_BIT
,
2252 return coerce_unspec_val_to_type (arr
, type
);
2256 /* The value of the element of packed array ARR at the ARITY indices
2257 given in IND. ARR must be a simple array. */
2259 static struct value
*
2260 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2263 int bits
, elt_off
, bit_off
;
2264 long elt_total_bit_offset
;
2265 struct type
*elt_type
;
2269 elt_total_bit_offset
= 0;
2270 elt_type
= ada_check_typedef (value_type (arr
));
2271 for (i
= 0; i
< arity
; i
+= 1)
2273 if (elt_type
->code () != TYPE_CODE_ARRAY
2274 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2276 (_("attempt to do packed indexing of "
2277 "something other than a packed array"));
2280 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2281 LONGEST lowerbound
, upperbound
;
2284 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2286 lim_warning (_("don't know bounds of array"));
2287 lowerbound
= upperbound
= 0;
2290 idx
= pos_atr (ind
[i
]);
2291 if (idx
< lowerbound
|| idx
> upperbound
)
2292 lim_warning (_("packed array index %ld out of bounds"),
2294 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2295 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2296 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2299 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2300 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2302 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2307 /* Non-zero iff TYPE includes negative integer values. */
2310 has_negatives (struct type
*type
)
2312 switch (type
->code ())
2317 return !TYPE_UNSIGNED (type
);
2318 case TYPE_CODE_RANGE
:
2319 return TYPE_LOW_BOUND (type
) - TYPE_RANGE_DATA (type
)->bias
< 0;
2323 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2324 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2325 the unpacked buffer.
2327 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2328 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2330 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2333 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2335 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2338 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2339 gdb_byte
*unpacked
, int unpacked_len
,
2340 int is_big_endian
, int is_signed_type
,
2343 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2344 int src_idx
; /* Index into the source area */
2345 int src_bytes_left
; /* Number of source bytes left to process. */
2346 int srcBitsLeft
; /* Number of source bits left to move */
2347 int unusedLS
; /* Number of bits in next significant
2348 byte of source that are unused */
2350 int unpacked_idx
; /* Index into the unpacked buffer */
2351 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2353 unsigned long accum
; /* Staging area for bits being transferred */
2354 int accumSize
; /* Number of meaningful bits in accum */
2357 /* Transmit bytes from least to most significant; delta is the direction
2358 the indices move. */
2359 int delta
= is_big_endian
? -1 : 1;
2361 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2363 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2364 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2365 bit_size
, unpacked_len
);
2367 srcBitsLeft
= bit_size
;
2368 src_bytes_left
= src_len
;
2369 unpacked_bytes_left
= unpacked_len
;
2374 src_idx
= src_len
- 1;
2376 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2380 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2386 unpacked_idx
= unpacked_len
- 1;
2390 /* Non-scalar values must be aligned at a byte boundary... */
2392 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2393 /* ... And are placed at the beginning (most-significant) bytes
2395 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2396 unpacked_bytes_left
= unpacked_idx
+ 1;
2401 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2403 src_idx
= unpacked_idx
= 0;
2404 unusedLS
= bit_offset
;
2407 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2412 while (src_bytes_left
> 0)
2414 /* Mask for removing bits of the next source byte that are not
2415 part of the value. */
2416 unsigned int unusedMSMask
=
2417 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2419 /* Sign-extend bits for this byte. */
2420 unsigned int signMask
= sign
& ~unusedMSMask
;
2423 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2424 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2425 if (accumSize
>= HOST_CHAR_BIT
)
2427 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2428 accumSize
-= HOST_CHAR_BIT
;
2429 accum
>>= HOST_CHAR_BIT
;
2430 unpacked_bytes_left
-= 1;
2431 unpacked_idx
+= delta
;
2433 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2435 src_bytes_left
-= 1;
2438 while (unpacked_bytes_left
> 0)
2440 accum
|= sign
<< accumSize
;
2441 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2442 accumSize
-= HOST_CHAR_BIT
;
2445 accum
>>= HOST_CHAR_BIT
;
2446 unpacked_bytes_left
-= 1;
2447 unpacked_idx
+= delta
;
2451 /* Create a new value of type TYPE from the contents of OBJ starting
2452 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2453 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2454 assigning through the result will set the field fetched from.
2455 VALADDR is ignored unless OBJ is NULL, in which case,
2456 VALADDR+OFFSET must address the start of storage containing the
2457 packed value. The value returned in this case is never an lval.
2458 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2461 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2462 long offset
, int bit_offset
, int bit_size
,
2466 const gdb_byte
*src
; /* First byte containing data to unpack */
2468 const int is_scalar
= is_scalar_type (type
);
2469 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2470 gdb::byte_vector staging
;
2472 type
= ada_check_typedef (type
);
2475 src
= valaddr
+ offset
;
2477 src
= value_contents (obj
) + offset
;
2479 if (is_dynamic_type (type
))
2481 /* The length of TYPE might by dynamic, so we need to resolve
2482 TYPE in order to know its actual size, which we then use
2483 to create the contents buffer of the value we return.
2484 The difficulty is that the data containing our object is
2485 packed, and therefore maybe not at a byte boundary. So, what
2486 we do, is unpack the data into a byte-aligned buffer, and then
2487 use that buffer as our object's value for resolving the type. */
2488 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2489 staging
.resize (staging_len
);
2491 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2492 staging
.data (), staging
.size (),
2493 is_big_endian
, has_negatives (type
),
2495 type
= resolve_dynamic_type (type
, staging
, 0);
2496 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2498 /* This happens when the length of the object is dynamic,
2499 and is actually smaller than the space reserved for it.
2500 For instance, in an array of variant records, the bit_size
2501 we're given is the array stride, which is constant and
2502 normally equal to the maximum size of its element.
2503 But, in reality, each element only actually spans a portion
2505 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2511 v
= allocate_value (type
);
2512 src
= valaddr
+ offset
;
2514 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2516 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2519 v
= value_at (type
, value_address (obj
) + offset
);
2520 buf
= (gdb_byte
*) alloca (src_len
);
2521 read_memory (value_address (v
), buf
, src_len
);
2526 v
= allocate_value (type
);
2527 src
= value_contents (obj
) + offset
;
2532 long new_offset
= offset
;
2534 set_value_component_location (v
, obj
);
2535 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2536 set_value_bitsize (v
, bit_size
);
2537 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2540 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2542 set_value_offset (v
, new_offset
);
2544 /* Also set the parent value. This is needed when trying to
2545 assign a new value (in inferior memory). */
2546 set_value_parent (v
, obj
);
2549 set_value_bitsize (v
, bit_size
);
2550 unpacked
= value_contents_writeable (v
);
2554 memset (unpacked
, 0, TYPE_LENGTH (type
));
2558 if (staging
.size () == TYPE_LENGTH (type
))
2560 /* Small short-cut: If we've unpacked the data into a buffer
2561 of the same size as TYPE's length, then we can reuse that,
2562 instead of doing the unpacking again. */
2563 memcpy (unpacked
, staging
.data (), staging
.size ());
2566 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2567 unpacked
, TYPE_LENGTH (type
),
2568 is_big_endian
, has_negatives (type
), is_scalar
);
2573 /* Store the contents of FROMVAL into the location of TOVAL.
2574 Return a new value with the location of TOVAL and contents of
2575 FROMVAL. Handles assignment into packed fields that have
2576 floating-point or non-scalar types. */
2578 static struct value
*
2579 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2581 struct type
*type
= value_type (toval
);
2582 int bits
= value_bitsize (toval
);
2584 toval
= ada_coerce_ref (toval
);
2585 fromval
= ada_coerce_ref (fromval
);
2587 if (ada_is_direct_array_type (value_type (toval
)))
2588 toval
= ada_coerce_to_simple_array (toval
);
2589 if (ada_is_direct_array_type (value_type (fromval
)))
2590 fromval
= ada_coerce_to_simple_array (fromval
);
2592 if (!deprecated_value_modifiable (toval
))
2593 error (_("Left operand of assignment is not a modifiable lvalue."));
2595 if (VALUE_LVAL (toval
) == lval_memory
2597 && (type
->code () == TYPE_CODE_FLT
2598 || type
->code () == TYPE_CODE_STRUCT
))
2600 int len
= (value_bitpos (toval
)
2601 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2603 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2605 CORE_ADDR to_addr
= value_address (toval
);
2607 if (type
->code () == TYPE_CODE_FLT
)
2608 fromval
= value_cast (type
, fromval
);
2610 read_memory (to_addr
, buffer
, len
);
2611 from_size
= value_bitsize (fromval
);
2613 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2615 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2616 ULONGEST from_offset
= 0;
2617 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2618 from_offset
= from_size
- bits
;
2619 copy_bitwise (buffer
, value_bitpos (toval
),
2620 value_contents (fromval
), from_offset
,
2621 bits
, is_big_endian
);
2622 write_memory_with_notification (to_addr
, buffer
, len
);
2624 val
= value_copy (toval
);
2625 memcpy (value_contents_raw (val
), value_contents (fromval
),
2626 TYPE_LENGTH (type
));
2627 deprecated_set_value_type (val
, type
);
2632 return value_assign (toval
, fromval
);
2636 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2637 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2638 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2639 COMPONENT, and not the inferior's memory. The current contents
2640 of COMPONENT are ignored.
2642 Although not part of the initial design, this function also works
2643 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2644 had a null address, and COMPONENT had an address which is equal to
2645 its offset inside CONTAINER. */
2648 value_assign_to_component (struct value
*container
, struct value
*component
,
2651 LONGEST offset_in_container
=
2652 (LONGEST
) (value_address (component
) - value_address (container
));
2653 int bit_offset_in_container
=
2654 value_bitpos (component
) - value_bitpos (container
);
2657 val
= value_cast (value_type (component
), val
);
2659 if (value_bitsize (component
) == 0)
2660 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2662 bits
= value_bitsize (component
);
2664 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2668 if (is_scalar_type (check_typedef (value_type (component
))))
2670 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2673 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2674 value_bitpos (container
) + bit_offset_in_container
,
2675 value_contents (val
), src_offset
, bits
, 1);
2678 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2679 value_bitpos (container
) + bit_offset_in_container
,
2680 value_contents (val
), 0, bits
, 0);
2683 /* Determine if TYPE is an access to an unconstrained array. */
2686 ada_is_access_to_unconstrained_array (struct type
*type
)
2688 return (type
->code () == TYPE_CODE_TYPEDEF
2689 && is_thick_pntr (ada_typedef_target_type (type
)));
2692 /* The value of the element of array ARR at the ARITY indices given in IND.
2693 ARR may be either a simple array, GNAT array descriptor, or pointer
2697 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2701 struct type
*elt_type
;
2703 elt
= ada_coerce_to_simple_array (arr
);
2705 elt_type
= ada_check_typedef (value_type (elt
));
2706 if (elt_type
->code () == TYPE_CODE_ARRAY
2707 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2708 return value_subscript_packed (elt
, arity
, ind
);
2710 for (k
= 0; k
< arity
; k
+= 1)
2712 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2714 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2715 error (_("too many subscripts (%d expected)"), k
);
2717 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2719 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2720 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2722 /* The element is a typedef to an unconstrained array,
2723 except that the value_subscript call stripped the
2724 typedef layer. The typedef layer is GNAT's way to
2725 specify that the element is, at the source level, an
2726 access to the unconstrained array, rather than the
2727 unconstrained array. So, we need to restore that
2728 typedef layer, which we can do by forcing the element's
2729 type back to its original type. Otherwise, the returned
2730 value is going to be printed as the array, rather
2731 than as an access. Another symptom of the same issue
2732 would be that an expression trying to dereference the
2733 element would also be improperly rejected. */
2734 deprecated_set_value_type (elt
, saved_elt_type
);
2737 elt_type
= ada_check_typedef (value_type (elt
));
2743 /* Assuming ARR is a pointer to a GDB array, the value of the element
2744 of *ARR at the ARITY indices given in IND.
2745 Does not read the entire array into memory.
2747 Note: Unlike what one would expect, this function is used instead of
2748 ada_value_subscript for basically all non-packed array types. The reason
2749 for this is that a side effect of doing our own pointer arithmetics instead
2750 of relying on value_subscript is that there is no implicit typedef peeling.
2751 This is important for arrays of array accesses, where it allows us to
2752 preserve the fact that the array's element is an array access, where the
2753 access part os encoded in a typedef layer. */
2755 static struct value
*
2756 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2759 struct value
*array_ind
= ada_value_ind (arr
);
2761 = check_typedef (value_enclosing_type (array_ind
));
2763 if (type
->code () == TYPE_CODE_ARRAY
2764 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2765 return value_subscript_packed (array_ind
, arity
, ind
);
2767 for (k
= 0; k
< arity
; k
+= 1)
2771 if (type
->code () != TYPE_CODE_ARRAY
)
2772 error (_("too many subscripts (%d expected)"), k
);
2773 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2775 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2776 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2777 type
= TYPE_TARGET_TYPE (type
);
2780 return value_ind (arr
);
2783 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2784 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2785 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2786 this array is LOW, as per Ada rules. */
2787 static struct value
*
2788 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2791 struct type
*type0
= ada_check_typedef (type
);
2792 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
));
2793 struct type
*index_type
2794 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2795 struct type
*slice_type
= create_array_type_with_stride
2796 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2797 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2798 TYPE_FIELD_BITSIZE (type0
, 0));
2799 int base_low
= ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
));
2800 LONGEST base_low_pos
, low_pos
;
2803 if (!discrete_position (base_index_type
, low
, &low_pos
)
2804 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2806 warning (_("unable to get positions in slice, use bounds instead"));
2808 base_low_pos
= base_low
;
2811 base
= value_as_address (array_ptr
)
2812 + ((low_pos
- base_low_pos
)
2813 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2814 return value_at_lazy (slice_type
, base
);
2818 static struct value
*
2819 ada_value_slice (struct value
*array
, int low
, int high
)
2821 struct type
*type
= ada_check_typedef (value_type (array
));
2822 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2823 struct type
*index_type
2824 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2825 struct type
*slice_type
= create_array_type_with_stride
2826 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2827 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2828 TYPE_FIELD_BITSIZE (type
, 0));
2829 LONGEST low_pos
, high_pos
;
2831 if (!discrete_position (base_index_type
, low
, &low_pos
)
2832 || !discrete_position (base_index_type
, high
, &high_pos
))
2834 warning (_("unable to get positions in slice, use bounds instead"));
2839 return value_cast (slice_type
,
2840 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2843 /* If type is a record type in the form of a standard GNAT array
2844 descriptor, returns the number of dimensions for type. If arr is a
2845 simple array, returns the number of "array of"s that prefix its
2846 type designation. Otherwise, returns 0. */
2849 ada_array_arity (struct type
*type
)
2856 type
= desc_base_type (type
);
2859 if (type
->code () == TYPE_CODE_STRUCT
)
2860 return desc_arity (desc_bounds_type (type
));
2862 while (type
->code () == TYPE_CODE_ARRAY
)
2865 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2871 /* If TYPE is a record type in the form of a standard GNAT array
2872 descriptor or a simple array type, returns the element type for
2873 TYPE after indexing by NINDICES indices, or by all indices if
2874 NINDICES is -1. Otherwise, returns NULL. */
2877 ada_array_element_type (struct type
*type
, int nindices
)
2879 type
= desc_base_type (type
);
2881 if (type
->code () == TYPE_CODE_STRUCT
)
2884 struct type
*p_array_type
;
2886 p_array_type
= desc_data_target_type (type
);
2888 k
= ada_array_arity (type
);
2892 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2893 if (nindices
>= 0 && k
> nindices
)
2895 while (k
> 0 && p_array_type
!= NULL
)
2897 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2900 return p_array_type
;
2902 else if (type
->code () == TYPE_CODE_ARRAY
)
2904 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2906 type
= TYPE_TARGET_TYPE (type
);
2915 /* The type of nth index in arrays of given type (n numbering from 1).
2916 Does not examine memory. Throws an error if N is invalid or TYPE
2917 is not an array type. NAME is the name of the Ada attribute being
2918 evaluated ('range, 'first, 'last, or 'length); it is used in building
2919 the error message. */
2921 static struct type
*
2922 ada_index_type (struct type
*type
, int n
, const char *name
)
2924 struct type
*result_type
;
2926 type
= desc_base_type (type
);
2928 if (n
< 0 || n
> ada_array_arity (type
))
2929 error (_("invalid dimension number to '%s"), name
);
2931 if (ada_is_simple_array_type (type
))
2935 for (i
= 1; i
< n
; i
+= 1)
2936 type
= TYPE_TARGET_TYPE (type
);
2937 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2938 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2939 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2940 perhaps stabsread.c would make more sense. */
2941 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2946 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2947 if (result_type
== NULL
)
2948 error (_("attempt to take bound of something that is not an array"));
2954 /* Given that arr is an array type, returns the lower bound of the
2955 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2956 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2957 array-descriptor type. It works for other arrays with bounds supplied
2958 by run-time quantities other than discriminants. */
2961 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2963 struct type
*type
, *index_type_desc
, *index_type
;
2966 gdb_assert (which
== 0 || which
== 1);
2968 if (ada_is_constrained_packed_array_type (arr_type
))
2969 arr_type
= decode_constrained_packed_array_type (arr_type
);
2971 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2972 return (LONGEST
) - which
;
2974 if (arr_type
->code () == TYPE_CODE_PTR
)
2975 type
= TYPE_TARGET_TYPE (arr_type
);
2979 if (TYPE_FIXED_INSTANCE (type
))
2981 /* The array has already been fixed, so we do not need to
2982 check the parallel ___XA type again. That encoding has
2983 already been applied, so ignore it now. */
2984 index_type_desc
= NULL
;
2988 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2989 ada_fixup_array_indexes_type (index_type_desc
);
2992 if (index_type_desc
!= NULL
)
2993 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2997 struct type
*elt_type
= check_typedef (type
);
2999 for (i
= 1; i
< n
; i
++)
3000 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3002 index_type
= TYPE_INDEX_TYPE (elt_type
);
3006 (LONGEST
) (which
== 0
3007 ? ada_discrete_type_low_bound (index_type
)
3008 : ada_discrete_type_high_bound (index_type
));
3011 /* Given that arr is an array value, returns the lower bound of the
3012 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3013 WHICH is 1. This routine will also work for arrays with bounds
3014 supplied by run-time quantities other than discriminants. */
3017 ada_array_bound (struct value
*arr
, int n
, int which
)
3019 struct type
*arr_type
;
3021 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3022 arr
= value_ind (arr
);
3023 arr_type
= value_enclosing_type (arr
);
3025 if (ada_is_constrained_packed_array_type (arr_type
))
3026 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3027 else if (ada_is_simple_array_type (arr_type
))
3028 return ada_array_bound_from_type (arr_type
, n
, which
);
3030 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3033 /* Given that arr is an array value, returns the length of the
3034 nth index. This routine will also work for arrays with bounds
3035 supplied by run-time quantities other than discriminants.
3036 Does not work for arrays indexed by enumeration types with representation
3037 clauses at the moment. */
3040 ada_array_length (struct value
*arr
, int n
)
3042 struct type
*arr_type
, *index_type
;
3045 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3046 arr
= value_ind (arr
);
3047 arr_type
= value_enclosing_type (arr
);
3049 if (ada_is_constrained_packed_array_type (arr_type
))
3050 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3052 if (ada_is_simple_array_type (arr_type
))
3054 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3055 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3059 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3060 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3063 arr_type
= check_typedef (arr_type
);
3064 index_type
= ada_index_type (arr_type
, n
, "length");
3065 if (index_type
!= NULL
)
3067 struct type
*base_type
;
3068 if (index_type
->code () == TYPE_CODE_RANGE
)
3069 base_type
= TYPE_TARGET_TYPE (index_type
);
3071 base_type
= index_type
;
3073 low
= pos_atr (value_from_longest (base_type
, low
));
3074 high
= pos_atr (value_from_longest (base_type
, high
));
3076 return high
- low
+ 1;
3079 /* An array whose type is that of ARR_TYPE (an array type), with
3080 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3081 less than LOW, then LOW-1 is used. */
3083 static struct value
*
3084 empty_array (struct type
*arr_type
, int low
, int high
)
3086 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3087 struct type
*index_type
3088 = create_static_range_type
3089 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
,
3090 high
< low
? low
- 1 : high
);
3091 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3093 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3097 /* Name resolution */
3099 /* The "decoded" name for the user-definable Ada operator corresponding
3103 ada_decoded_op_name (enum exp_opcode op
)
3107 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3109 if (ada_opname_table
[i
].op
== op
)
3110 return ada_opname_table
[i
].decoded
;
3112 error (_("Could not find operator name for opcode"));
3115 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3116 in a listing of choices during disambiguation (see sort_choices, below).
3117 The idea is that overloadings of a subprogram name from the
3118 same package should sort in their source order. We settle for ordering
3119 such symbols by their trailing number (__N or $N). */
3122 encoded_ordered_before (const char *N0
, const char *N1
)
3126 else if (N0
== NULL
)
3132 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3134 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3136 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3137 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3142 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3145 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3147 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3148 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3150 return (strcmp (N0
, N1
) < 0);
3154 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3158 sort_choices (struct block_symbol syms
[], int nsyms
)
3162 for (i
= 1; i
< nsyms
; i
+= 1)
3164 struct block_symbol sym
= syms
[i
];
3167 for (j
= i
- 1; j
>= 0; j
-= 1)
3169 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3170 sym
.symbol
->linkage_name ()))
3172 syms
[j
+ 1] = syms
[j
];
3178 /* Whether GDB should display formals and return types for functions in the
3179 overloads selection menu. */
3180 static bool print_signatures
= true;
3182 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3183 all but functions, the signature is just the name of the symbol. For
3184 functions, this is the name of the function, the list of types for formals
3185 and the return type (if any). */
3188 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3189 const struct type_print_options
*flags
)
3191 struct type
*type
= SYMBOL_TYPE (sym
);
3193 fprintf_filtered (stream
, "%s", sym
->print_name ());
3194 if (!print_signatures
3196 || type
->code () != TYPE_CODE_FUNC
)
3199 if (type
->num_fields () > 0)
3203 fprintf_filtered (stream
, " (");
3204 for (i
= 0; i
< type
->num_fields (); ++i
)
3207 fprintf_filtered (stream
, "; ");
3208 ada_print_type (TYPE_FIELD_TYPE (type
, i
), NULL
, stream
, -1, 0,
3211 fprintf_filtered (stream
, ")");
3213 if (TYPE_TARGET_TYPE (type
) != NULL
3214 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3216 fprintf_filtered (stream
, " return ");
3217 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3221 /* Read and validate a set of numeric choices from the user in the
3222 range 0 .. N_CHOICES-1. Place the results in increasing
3223 order in CHOICES[0 .. N-1], and return N.
3225 The user types choices as a sequence of numbers on one line
3226 separated by blanks, encoding them as follows:
3228 + A choice of 0 means to cancel the selection, throwing an error.
3229 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3230 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3232 The user is not allowed to choose more than MAX_RESULTS values.
3234 ANNOTATION_SUFFIX, if present, is used to annotate the input
3235 prompts (for use with the -f switch). */
3238 get_selections (int *choices
, int n_choices
, int max_results
,
3239 int is_all_choice
, const char *annotation_suffix
)
3244 int first_choice
= is_all_choice
? 2 : 1;
3246 prompt
= getenv ("PS2");
3250 args
= command_line_input (prompt
, annotation_suffix
);
3253 error_no_arg (_("one or more choice numbers"));
3257 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3258 order, as given in args. Choices are validated. */
3264 args
= skip_spaces (args
);
3265 if (*args
== '\0' && n_chosen
== 0)
3266 error_no_arg (_("one or more choice numbers"));
3267 else if (*args
== '\0')
3270 choice
= strtol (args
, &args2
, 10);
3271 if (args
== args2
|| choice
< 0
3272 || choice
> n_choices
+ first_choice
- 1)
3273 error (_("Argument must be choice number"));
3277 error (_("cancelled"));
3279 if (choice
< first_choice
)
3281 n_chosen
= n_choices
;
3282 for (j
= 0; j
< n_choices
; j
+= 1)
3286 choice
-= first_choice
;
3288 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3292 if (j
< 0 || choice
!= choices
[j
])
3296 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3297 choices
[k
+ 1] = choices
[k
];
3298 choices
[j
+ 1] = choice
;
3303 if (n_chosen
> max_results
)
3304 error (_("Select no more than %d of the above"), max_results
);
3309 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3310 by asking the user (if necessary), returning the number selected,
3311 and setting the first elements of SYMS items. Error if no symbols
3314 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3315 to be re-integrated one of these days. */
3318 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3321 int *chosen
= XALLOCAVEC (int , nsyms
);
3323 int first_choice
= (max_results
== 1) ? 1 : 2;
3324 const char *select_mode
= multiple_symbols_select_mode ();
3326 if (max_results
< 1)
3327 error (_("Request to select 0 symbols!"));
3331 if (select_mode
== multiple_symbols_cancel
)
3333 canceled because the command is ambiguous\n\
3334 See set/show multiple-symbol."));
3336 /* If select_mode is "all", then return all possible symbols.
3337 Only do that if more than one symbol can be selected, of course.
3338 Otherwise, display the menu as usual. */
3339 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3342 printf_filtered (_("[0] cancel\n"));
3343 if (max_results
> 1)
3344 printf_filtered (_("[1] all\n"));
3346 sort_choices (syms
, nsyms
);
3348 for (i
= 0; i
< nsyms
; i
+= 1)
3350 if (syms
[i
].symbol
== NULL
)
3353 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3355 struct symtab_and_line sal
=
3356 find_function_start_sal (syms
[i
].symbol
, 1);
3358 printf_filtered ("[%d] ", i
+ first_choice
);
3359 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3360 &type_print_raw_options
);
3361 if (sal
.symtab
== NULL
)
3362 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3363 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3367 styled_string (file_name_style
.style (),
3368 symtab_to_filename_for_display (sal
.symtab
)),
3375 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3376 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3377 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3378 struct symtab
*symtab
= NULL
;
3380 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3381 symtab
= symbol_symtab (syms
[i
].symbol
);
3383 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3385 printf_filtered ("[%d] ", i
+ first_choice
);
3386 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3387 &type_print_raw_options
);
3388 printf_filtered (_(" at %s:%d\n"),
3389 symtab_to_filename_for_display (symtab
),
3390 SYMBOL_LINE (syms
[i
].symbol
));
3392 else if (is_enumeral
3393 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3395 printf_filtered (("[%d] "), i
+ first_choice
);
3396 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3397 gdb_stdout
, -1, 0, &type_print_raw_options
);
3398 printf_filtered (_("'(%s) (enumeral)\n"),
3399 syms
[i
].symbol
->print_name ());
3403 printf_filtered ("[%d] ", i
+ first_choice
);
3404 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3405 &type_print_raw_options
);
3408 printf_filtered (is_enumeral
3409 ? _(" in %s (enumeral)\n")
3411 symtab_to_filename_for_display (symtab
));
3413 printf_filtered (is_enumeral
3414 ? _(" (enumeral)\n")
3420 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3423 for (i
= 0; i
< n_chosen
; i
+= 1)
3424 syms
[i
] = syms
[chosen
[i
]];
3429 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3430 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3431 undefined namespace) and converts operators that are
3432 user-defined into appropriate function calls. If CONTEXT_TYPE is
3433 non-null, it provides a preferred result type [at the moment, only
3434 type void has any effect---causing procedures to be preferred over
3435 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3436 return type is preferred. May change (expand) *EXP. */
3439 resolve (expression_up
*expp
, int void_context_p
, int parse_completion
,
3440 innermost_block_tracker
*tracker
)
3442 struct type
*context_type
= NULL
;
3446 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3448 resolve_subexp (expp
, &pc
, 1, context_type
, parse_completion
, tracker
);
3451 /* Resolve the operator of the subexpression beginning at
3452 position *POS of *EXPP. "Resolving" consists of replacing
3453 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3454 with their resolutions, replacing built-in operators with
3455 function calls to user-defined operators, where appropriate, and,
3456 when DEPROCEDURE_P is non-zero, converting function-valued variables
3457 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3458 are as in ada_resolve, above. */
3460 static struct value
*
3461 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3462 struct type
*context_type
, int parse_completion
,
3463 innermost_block_tracker
*tracker
)
3467 struct expression
*exp
; /* Convenience: == *expp. */
3468 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3469 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3470 int nargs
; /* Number of operands. */
3477 /* Pass one: resolve operands, saving their types and updating *pos,
3482 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3483 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3488 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3490 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3495 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3500 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3501 parse_completion
, tracker
);
3504 case OP_ATR_MODULUS
:
3514 case TERNOP_IN_RANGE
:
3515 case BINOP_IN_BOUNDS
:
3521 case OP_DISCRETE_RANGE
:
3523 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3532 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3534 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3536 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3554 case BINOP_LOGICAL_AND
:
3555 case BINOP_LOGICAL_OR
:
3556 case BINOP_BITWISE_AND
:
3557 case BINOP_BITWISE_IOR
:
3558 case BINOP_BITWISE_XOR
:
3561 case BINOP_NOTEQUAL
:
3568 case BINOP_SUBSCRIPT
:
3576 case UNOP_LOGICAL_NOT
:
3586 case OP_VAR_MSYM_VALUE
:
3593 case OP_INTERNALVAR
:
3603 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3606 case STRUCTOP_STRUCT
:
3607 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3620 error (_("Unexpected operator during name resolution"));
3623 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3624 for (i
= 0; i
< nargs
; i
+= 1)
3625 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
,
3630 /* Pass two: perform any resolution on principal operator. */
3637 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3639 std::vector
<struct block_symbol
> candidates
;
3643 ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3644 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3647 if (n_candidates
> 1)
3649 /* Types tend to get re-introduced locally, so if there
3650 are any local symbols that are not types, first filter
3653 for (j
= 0; j
< n_candidates
; j
+= 1)
3654 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3659 case LOC_REGPARM_ADDR
:
3667 if (j
< n_candidates
)
3670 while (j
< n_candidates
)
3672 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3674 candidates
[j
] = candidates
[n_candidates
- 1];
3683 if (n_candidates
== 0)
3684 error (_("No definition found for %s"),
3685 exp
->elts
[pc
+ 2].symbol
->print_name ());
3686 else if (n_candidates
== 1)
3688 else if (deprocedure_p
3689 && !is_nonfunction (candidates
.data (), n_candidates
))
3691 i
= ada_resolve_function
3692 (candidates
.data (), n_candidates
, NULL
, 0,
3693 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3694 context_type
, parse_completion
);
3696 error (_("Could not find a match for %s"),
3697 exp
->elts
[pc
+ 2].symbol
->print_name ());
3701 printf_filtered (_("Multiple matches for %s\n"),
3702 exp
->elts
[pc
+ 2].symbol
->print_name ());
3703 user_select_syms (candidates
.data (), n_candidates
, 1);
3707 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3708 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3709 tracker
->update (candidates
[i
]);
3713 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3716 replace_operator_with_call (expp
, pc
, 0, 4,
3717 exp
->elts
[pc
+ 2].symbol
,
3718 exp
->elts
[pc
+ 1].block
);
3725 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3726 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3728 std::vector
<struct block_symbol
> candidates
;
3732 ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3733 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3736 if (n_candidates
== 1)
3740 i
= ada_resolve_function
3741 (candidates
.data (), n_candidates
,
3743 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3744 context_type
, parse_completion
);
3746 error (_("Could not find a match for %s"),
3747 exp
->elts
[pc
+ 5].symbol
->print_name ());
3750 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3751 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3752 tracker
->update (candidates
[i
]);
3763 case BINOP_BITWISE_AND
:
3764 case BINOP_BITWISE_IOR
:
3765 case BINOP_BITWISE_XOR
:
3767 case BINOP_NOTEQUAL
:
3775 case UNOP_LOGICAL_NOT
:
3777 if (possible_user_operator_p (op
, argvec
))
3779 std::vector
<struct block_symbol
> candidates
;
3783 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3787 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3788 nargs
, ada_decoded_op_name (op
), NULL
,
3793 replace_operator_with_call (expp
, pc
, nargs
, 1,
3794 candidates
[i
].symbol
,
3795 candidates
[i
].block
);
3806 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3807 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3808 exp
->elts
[pc
+ 1].objfile
,
3809 exp
->elts
[pc
+ 2].msymbol
);
3811 return evaluate_subexp_type (exp
, pos
);
3814 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3815 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3817 /* The term "match" here is rather loose. The match is heuristic and
3821 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3823 ftype
= ada_check_typedef (ftype
);
3824 atype
= ada_check_typedef (atype
);
3826 if (ftype
->code () == TYPE_CODE_REF
)
3827 ftype
= TYPE_TARGET_TYPE (ftype
);
3828 if (atype
->code () == TYPE_CODE_REF
)
3829 atype
= TYPE_TARGET_TYPE (atype
);
3831 switch (ftype
->code ())
3834 return ftype
->code () == atype
->code ();
3836 if (atype
->code () == TYPE_CODE_PTR
)
3837 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3838 TYPE_TARGET_TYPE (atype
), 0);
3841 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3843 case TYPE_CODE_ENUM
:
3844 case TYPE_CODE_RANGE
:
3845 switch (atype
->code ())
3848 case TYPE_CODE_ENUM
:
3849 case TYPE_CODE_RANGE
:
3855 case TYPE_CODE_ARRAY
:
3856 return (atype
->code () == TYPE_CODE_ARRAY
3857 || ada_is_array_descriptor_type (atype
));
3859 case TYPE_CODE_STRUCT
:
3860 if (ada_is_array_descriptor_type (ftype
))
3861 return (atype
->code () == TYPE_CODE_ARRAY
3862 || ada_is_array_descriptor_type (atype
));
3864 return (atype
->code () == TYPE_CODE_STRUCT
3865 && !ada_is_array_descriptor_type (atype
));
3867 case TYPE_CODE_UNION
:
3869 return (atype
->code () == ftype
->code ());
3873 /* Return non-zero if the formals of FUNC "sufficiently match" the
3874 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3875 may also be an enumeral, in which case it is treated as a 0-
3876 argument function. */
3879 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3882 struct type
*func_type
= SYMBOL_TYPE (func
);
3884 if (SYMBOL_CLASS (func
) == LOC_CONST
3885 && func_type
->code () == TYPE_CODE_ENUM
)
3886 return (n_actuals
== 0);
3887 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3890 if (func_type
->num_fields () != n_actuals
)
3893 for (i
= 0; i
< n_actuals
; i
+= 1)
3895 if (actuals
[i
] == NULL
)
3899 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3901 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3903 if (!ada_type_match (ftype
, atype
, 1))
3910 /* False iff function type FUNC_TYPE definitely does not produce a value
3911 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3912 FUNC_TYPE is not a valid function type with a non-null return type
3913 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3916 return_match (struct type
*func_type
, struct type
*context_type
)
3918 struct type
*return_type
;
3920 if (func_type
== NULL
)
3923 if (func_type
->code () == TYPE_CODE_FUNC
)
3924 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3926 return_type
= get_base_type (func_type
);
3927 if (return_type
== NULL
)
3930 context_type
= get_base_type (context_type
);
3932 if (return_type
->code () == TYPE_CODE_ENUM
)
3933 return context_type
== NULL
|| return_type
== context_type
;
3934 else if (context_type
== NULL
)
3935 return return_type
->code () != TYPE_CODE_VOID
;
3937 return return_type
->code () == context_type
->code ();
3941 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3942 function (if any) that matches the types of the NARGS arguments in
3943 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3944 that returns that type, then eliminate matches that don't. If
3945 CONTEXT_TYPE is void and there is at least one match that does not
3946 return void, eliminate all matches that do.
3948 Asks the user if there is more than one match remaining. Returns -1
3949 if there is no such symbol or none is selected. NAME is used
3950 solely for messages. May re-arrange and modify SYMS in
3951 the process; the index returned is for the modified vector. */
3954 ada_resolve_function (struct block_symbol syms
[],
3955 int nsyms
, struct value
**args
, int nargs
,
3956 const char *name
, struct type
*context_type
,
3957 int parse_completion
)
3961 int m
; /* Number of hits */
3964 /* In the first pass of the loop, we only accept functions matching
3965 context_type. If none are found, we add a second pass of the loop
3966 where every function is accepted. */
3967 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3969 for (k
= 0; k
< nsyms
; k
+= 1)
3971 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3973 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3974 && (fallback
|| return_match (type
, context_type
)))
3982 /* If we got multiple matches, ask the user which one to use. Don't do this
3983 interactive thing during completion, though, as the purpose of the
3984 completion is providing a list of all possible matches. Prompting the
3985 user to filter it down would be completely unexpected in this case. */
3988 else if (m
> 1 && !parse_completion
)
3990 printf_filtered (_("Multiple matches for %s\n"), name
);
3991 user_select_syms (syms
, m
, 1);
3997 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3998 on the function identified by SYM and BLOCK, and taking NARGS
3999 arguments. Update *EXPP as needed to hold more space. */
4002 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4003 int oplen
, struct symbol
*sym
,
4004 const struct block
*block
)
4006 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4007 symbol, -oplen for operator being replaced). */
4008 struct expression
*newexp
= (struct expression
*)
4009 xzalloc (sizeof (struct expression
)
4010 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
4011 struct expression
*exp
= expp
->get ();
4013 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4014 newexp
->language_defn
= exp
->language_defn
;
4015 newexp
->gdbarch
= exp
->gdbarch
;
4016 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4017 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4018 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4020 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4021 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4023 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4024 newexp
->elts
[pc
+ 4].block
= block
;
4025 newexp
->elts
[pc
+ 5].symbol
= sym
;
4027 expp
->reset (newexp
);
4030 /* Type-class predicates */
4032 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4036 numeric_type_p (struct type
*type
)
4042 switch (type
->code ())
4047 case TYPE_CODE_RANGE
:
4048 return (type
== TYPE_TARGET_TYPE (type
)
4049 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4056 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4059 integer_type_p (struct type
*type
)
4065 switch (type
->code ())
4069 case TYPE_CODE_RANGE
:
4070 return (type
== TYPE_TARGET_TYPE (type
)
4071 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4078 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4081 scalar_type_p (struct type
*type
)
4087 switch (type
->code ())
4090 case TYPE_CODE_RANGE
:
4091 case TYPE_CODE_ENUM
:
4100 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4103 discrete_type_p (struct type
*type
)
4109 switch (type
->code ())
4112 case TYPE_CODE_RANGE
:
4113 case TYPE_CODE_ENUM
:
4114 case TYPE_CODE_BOOL
:
4122 /* Returns non-zero if OP with operands in the vector ARGS could be
4123 a user-defined function. Errs on the side of pre-defined operators
4124 (i.e., result 0). */
4127 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4129 struct type
*type0
=
4130 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4131 struct type
*type1
=
4132 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4146 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4150 case BINOP_BITWISE_AND
:
4151 case BINOP_BITWISE_IOR
:
4152 case BINOP_BITWISE_XOR
:
4153 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4156 case BINOP_NOTEQUAL
:
4161 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4164 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4167 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4171 case UNOP_LOGICAL_NOT
:
4173 return (!numeric_type_p (type0
));
4182 1. In the following, we assume that a renaming type's name may
4183 have an ___XD suffix. It would be nice if this went away at some
4185 2. We handle both the (old) purely type-based representation of
4186 renamings and the (new) variable-based encoding. At some point,
4187 it is devoutly to be hoped that the former goes away
4188 (FIXME: hilfinger-2007-07-09).
4189 3. Subprogram renamings are not implemented, although the XRS
4190 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4192 /* If SYM encodes a renaming,
4194 <renaming> renames <renamed entity>,
4196 sets *LEN to the length of the renamed entity's name,
4197 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4198 the string describing the subcomponent selected from the renamed
4199 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4200 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4201 are undefined). Otherwise, returns a value indicating the category
4202 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4203 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4204 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4205 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4206 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4207 may be NULL, in which case they are not assigned.
4209 [Currently, however, GCC does not generate subprogram renamings.] */
4211 enum ada_renaming_category
4212 ada_parse_renaming (struct symbol
*sym
,
4213 const char **renamed_entity
, int *len
,
4214 const char **renaming_expr
)
4216 enum ada_renaming_category kind
;
4221 return ADA_NOT_RENAMING
;
4222 switch (SYMBOL_CLASS (sym
))
4225 return ADA_NOT_RENAMING
;
4229 case LOC_OPTIMIZED_OUT
:
4230 info
= strstr (sym
->linkage_name (), "___XR");
4232 return ADA_NOT_RENAMING
;
4236 kind
= ADA_OBJECT_RENAMING
;
4240 kind
= ADA_EXCEPTION_RENAMING
;
4244 kind
= ADA_PACKAGE_RENAMING
;
4248 kind
= ADA_SUBPROGRAM_RENAMING
;
4252 return ADA_NOT_RENAMING
;
4256 if (renamed_entity
!= NULL
)
4257 *renamed_entity
= info
;
4258 suffix
= strstr (info
, "___XE");
4259 if (suffix
== NULL
|| suffix
== info
)
4260 return ADA_NOT_RENAMING
;
4262 *len
= strlen (info
) - strlen (suffix
);
4264 if (renaming_expr
!= NULL
)
4265 *renaming_expr
= suffix
;
4269 /* Compute the value of the given RENAMING_SYM, which is expected to
4270 be a symbol encoding a renaming expression. BLOCK is the block
4271 used to evaluate the renaming. */
4273 static struct value
*
4274 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4275 const struct block
*block
)
4277 const char *sym_name
;
4279 sym_name
= renaming_sym
->linkage_name ();
4280 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4281 return evaluate_expression (expr
.get ());
4285 /* Evaluation: Function Calls */
4287 /* Return an lvalue containing the value VAL. This is the identity on
4288 lvalues, and otherwise has the side-effect of allocating memory
4289 in the inferior where a copy of the value contents is copied. */
4291 static struct value
*
4292 ensure_lval (struct value
*val
)
4294 if (VALUE_LVAL (val
) == not_lval
4295 || VALUE_LVAL (val
) == lval_internalvar
)
4297 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4298 const CORE_ADDR addr
=
4299 value_as_long (value_allocate_space_in_inferior (len
));
4301 VALUE_LVAL (val
) = lval_memory
;
4302 set_value_address (val
, addr
);
4303 write_memory (addr
, value_contents (val
), len
);
4309 /* Given ARG, a value of type (pointer or reference to a)*
4310 structure/union, extract the component named NAME from the ultimate
4311 target structure/union and return it as a value with its
4314 The routine searches for NAME among all members of the structure itself
4315 and (recursively) among all members of any wrapper members
4318 If NO_ERR, then simply return NULL in case of error, rather than
4321 static struct value
*
4322 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4324 struct type
*t
, *t1
;
4329 t1
= t
= ada_check_typedef (value_type (arg
));
4330 if (t
->code () == TYPE_CODE_REF
)
4332 t1
= TYPE_TARGET_TYPE (t
);
4335 t1
= ada_check_typedef (t1
);
4336 if (t1
->code () == TYPE_CODE_PTR
)
4338 arg
= coerce_ref (arg
);
4343 while (t
->code () == TYPE_CODE_PTR
)
4345 t1
= TYPE_TARGET_TYPE (t
);
4348 t1
= ada_check_typedef (t1
);
4349 if (t1
->code () == TYPE_CODE_PTR
)
4351 arg
= value_ind (arg
);
4358 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4362 v
= ada_search_struct_field (name
, arg
, 0, t
);
4365 int bit_offset
, bit_size
, byte_offset
;
4366 struct type
*field_type
;
4369 if (t
->code () == TYPE_CODE_PTR
)
4370 address
= value_address (ada_value_ind (arg
));
4372 address
= value_address (ada_coerce_ref (arg
));
4374 /* Check to see if this is a tagged type. We also need to handle
4375 the case where the type is a reference to a tagged type, but
4376 we have to be careful to exclude pointers to tagged types.
4377 The latter should be shown as usual (as a pointer), whereas
4378 a reference should mostly be transparent to the user. */
4380 if (ada_is_tagged_type (t1
, 0)
4381 || (t1
->code () == TYPE_CODE_REF
4382 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4384 /* We first try to find the searched field in the current type.
4385 If not found then let's look in the fixed type. */
4387 if (!find_struct_field (name
, t1
, 0,
4388 &field_type
, &byte_offset
, &bit_offset
,
4397 /* Convert to fixed type in all cases, so that we have proper
4398 offsets to each field in unconstrained record types. */
4399 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4400 address
, NULL
, check_tag
);
4402 if (find_struct_field (name
, t1
, 0,
4403 &field_type
, &byte_offset
, &bit_offset
,
4408 if (t
->code () == TYPE_CODE_REF
)
4409 arg
= ada_coerce_ref (arg
);
4411 arg
= ada_value_ind (arg
);
4412 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4413 bit_offset
, bit_size
,
4417 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4421 if (v
!= NULL
|| no_err
)
4424 error (_("There is no member named %s."), name
);
4430 error (_("Attempt to extract a component of "
4431 "a value that is not a record."));
4434 /* Return the value ACTUAL, converted to be an appropriate value for a
4435 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4436 allocating any necessary descriptors (fat pointers), or copies of
4437 values not residing in memory, updating it as needed. */
4440 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4442 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4443 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4444 struct type
*formal_target
=
4445 formal_type
->code () == TYPE_CODE_PTR
4446 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4447 struct type
*actual_target
=
4448 actual_type
->code () == TYPE_CODE_PTR
4449 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4451 if (ada_is_array_descriptor_type (formal_target
)
4452 && actual_target
->code () == TYPE_CODE_ARRAY
)
4453 return make_array_descriptor (formal_type
, actual
);
4454 else if (formal_type
->code () == TYPE_CODE_PTR
4455 || formal_type
->code () == TYPE_CODE_REF
)
4457 struct value
*result
;
4459 if (formal_target
->code () == TYPE_CODE_ARRAY
4460 && ada_is_array_descriptor_type (actual_target
))
4461 result
= desc_data (actual
);
4462 else if (formal_type
->code () != TYPE_CODE_PTR
)
4464 if (VALUE_LVAL (actual
) != lval_memory
)
4468 actual_type
= ada_check_typedef (value_type (actual
));
4469 val
= allocate_value (actual_type
);
4470 memcpy ((char *) value_contents_raw (val
),
4471 (char *) value_contents (actual
),
4472 TYPE_LENGTH (actual_type
));
4473 actual
= ensure_lval (val
);
4475 result
= value_addr (actual
);
4479 return value_cast_pointers (formal_type
, result
, 0);
4481 else if (actual_type
->code () == TYPE_CODE_PTR
)
4482 return ada_value_ind (actual
);
4483 else if (ada_is_aligner_type (formal_type
))
4485 /* We need to turn this parameter into an aligner type
4487 struct value
*aligner
= allocate_value (formal_type
);
4488 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4490 value_assign_to_component (aligner
, component
, actual
);
4497 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4498 type TYPE. This is usually an inefficient no-op except on some targets
4499 (such as AVR) where the representation of a pointer and an address
4503 value_pointer (struct value
*value
, struct type
*type
)
4505 struct gdbarch
*gdbarch
= get_type_arch (type
);
4506 unsigned len
= TYPE_LENGTH (type
);
4507 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4510 addr
= value_address (value
);
4511 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4512 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4517 /* Push a descriptor of type TYPE for array value ARR on the stack at
4518 *SP, updating *SP to reflect the new descriptor. Return either
4519 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4520 to-descriptor type rather than a descriptor type), a struct value *
4521 representing a pointer to this descriptor. */
4523 static struct value
*
4524 make_array_descriptor (struct type
*type
, struct value
*arr
)
4526 struct type
*bounds_type
= desc_bounds_type (type
);
4527 struct type
*desc_type
= desc_base_type (type
);
4528 struct value
*descriptor
= allocate_value (desc_type
);
4529 struct value
*bounds
= allocate_value (bounds_type
);
4532 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4535 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4536 ada_array_bound (arr
, i
, 0),
4537 desc_bound_bitpos (bounds_type
, i
, 0),
4538 desc_bound_bitsize (bounds_type
, i
, 0));
4539 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4540 ada_array_bound (arr
, i
, 1),
4541 desc_bound_bitpos (bounds_type
, i
, 1),
4542 desc_bound_bitsize (bounds_type
, i
, 1));
4545 bounds
= ensure_lval (bounds
);
4547 modify_field (value_type (descriptor
),
4548 value_contents_writeable (descriptor
),
4549 value_pointer (ensure_lval (arr
),
4550 TYPE_FIELD_TYPE (desc_type
, 0)),
4551 fat_pntr_data_bitpos (desc_type
),
4552 fat_pntr_data_bitsize (desc_type
));
4554 modify_field (value_type (descriptor
),
4555 value_contents_writeable (descriptor
),
4556 value_pointer (bounds
,
4557 TYPE_FIELD_TYPE (desc_type
, 1)),
4558 fat_pntr_bounds_bitpos (desc_type
),
4559 fat_pntr_bounds_bitsize (desc_type
));
4561 descriptor
= ensure_lval (descriptor
);
4563 if (type
->code () == TYPE_CODE_PTR
)
4564 return value_addr (descriptor
);
4569 /* Symbol Cache Module */
4571 /* Performance measurements made as of 2010-01-15 indicate that
4572 this cache does bring some noticeable improvements. Depending
4573 on the type of entity being printed, the cache can make it as much
4574 as an order of magnitude faster than without it.
4576 The descriptive type DWARF extension has significantly reduced
4577 the need for this cache, at least when DWARF is being used. However,
4578 even in this case, some expensive name-based symbol searches are still
4579 sometimes necessary - to find an XVZ variable, mostly. */
4581 /* Initialize the contents of SYM_CACHE. */
4584 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4586 obstack_init (&sym_cache
->cache_space
);
4587 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4590 /* Free the memory used by SYM_CACHE. */
4593 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4595 obstack_free (&sym_cache
->cache_space
, NULL
);
4599 /* Return the symbol cache associated to the given program space PSPACE.
4600 If not allocated for this PSPACE yet, allocate and initialize one. */
4602 static struct ada_symbol_cache
*
4603 ada_get_symbol_cache (struct program_space
*pspace
)
4605 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4607 if (pspace_data
->sym_cache
== NULL
)
4609 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4610 ada_init_symbol_cache (pspace_data
->sym_cache
);
4613 return pspace_data
->sym_cache
;
4616 /* Clear all entries from the symbol cache. */
4619 ada_clear_symbol_cache (void)
4621 struct ada_symbol_cache
*sym_cache
4622 = ada_get_symbol_cache (current_program_space
);
4624 obstack_free (&sym_cache
->cache_space
, NULL
);
4625 ada_init_symbol_cache (sym_cache
);
4628 /* Search our cache for an entry matching NAME and DOMAIN.
4629 Return it if found, or NULL otherwise. */
4631 static struct cache_entry
**
4632 find_entry (const char *name
, domain_enum domain
)
4634 struct ada_symbol_cache
*sym_cache
4635 = ada_get_symbol_cache (current_program_space
);
4636 int h
= msymbol_hash (name
) % HASH_SIZE
;
4637 struct cache_entry
**e
;
4639 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4641 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4647 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4648 Return 1 if found, 0 otherwise.
4650 If an entry was found and SYM is not NULL, set *SYM to the entry's
4651 SYM. Same principle for BLOCK if not NULL. */
4654 lookup_cached_symbol (const char *name
, domain_enum domain
,
4655 struct symbol
**sym
, const struct block
**block
)
4657 struct cache_entry
**e
= find_entry (name
, domain
);
4664 *block
= (*e
)->block
;
4668 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4669 in domain DOMAIN, save this result in our symbol cache. */
4672 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4673 const struct block
*block
)
4675 struct ada_symbol_cache
*sym_cache
4676 = ada_get_symbol_cache (current_program_space
);
4678 struct cache_entry
*e
;
4680 /* Symbols for builtin types don't have a block.
4681 For now don't cache such symbols. */
4682 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4685 /* If the symbol is a local symbol, then do not cache it, as a search
4686 for that symbol depends on the context. To determine whether
4687 the symbol is local or not, we check the block where we found it
4688 against the global and static blocks of its associated symtab. */
4690 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4691 GLOBAL_BLOCK
) != block
4692 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4693 STATIC_BLOCK
) != block
)
4696 h
= msymbol_hash (name
) % HASH_SIZE
;
4697 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4698 e
->next
= sym_cache
->root
[h
];
4699 sym_cache
->root
[h
] = e
;
4700 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4708 /* Return the symbol name match type that should be used used when
4709 searching for all symbols matching LOOKUP_NAME.
4711 LOOKUP_NAME is expected to be a symbol name after transformation
4714 static symbol_name_match_type
4715 name_match_type_from_name (const char *lookup_name
)
4717 return (strstr (lookup_name
, "__") == NULL
4718 ? symbol_name_match_type::WILD
4719 : symbol_name_match_type::FULL
);
4722 /* Return the result of a standard (literal, C-like) lookup of NAME in
4723 given DOMAIN, visible from lexical block BLOCK. */
4725 static struct symbol
*
4726 standard_lookup (const char *name
, const struct block
*block
,
4729 /* Initialize it just to avoid a GCC false warning. */
4730 struct block_symbol sym
= {};
4732 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4734 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4735 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4740 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4741 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4742 since they contend in overloading in the same way. */
4744 is_nonfunction (struct block_symbol syms
[], int n
)
4748 for (i
= 0; i
< n
; i
+= 1)
4749 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_FUNC
4750 && (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
4751 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4757 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4758 struct types. Otherwise, they may not. */
4761 equiv_types (struct type
*type0
, struct type
*type1
)
4765 if (type0
== NULL
|| type1
== NULL
4766 || type0
->code () != type1
->code ())
4768 if ((type0
->code () == TYPE_CODE_STRUCT
4769 || type0
->code () == TYPE_CODE_ENUM
)
4770 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4771 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4777 /* True iff SYM0 represents the same entity as SYM1, or one that is
4778 no more defined than that of SYM1. */
4781 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4785 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4786 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4789 switch (SYMBOL_CLASS (sym0
))
4795 struct type
*type0
= SYMBOL_TYPE (sym0
);
4796 struct type
*type1
= SYMBOL_TYPE (sym1
);
4797 const char *name0
= sym0
->linkage_name ();
4798 const char *name1
= sym1
->linkage_name ();
4799 int len0
= strlen (name0
);
4802 type0
->code () == type1
->code ()
4803 && (equiv_types (type0
, type1
)
4804 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4805 && startswith (name1
+ len0
, "___XV")));
4808 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4809 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4813 const char *name0
= sym0
->linkage_name ();
4814 const char *name1
= sym1
->linkage_name ();
4815 return (strcmp (name0
, name1
) == 0
4816 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4824 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4825 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4828 add_defn_to_vec (struct obstack
*obstackp
,
4830 const struct block
*block
)
4833 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4835 /* Do not try to complete stub types, as the debugger is probably
4836 already scanning all symbols matching a certain name at the
4837 time when this function is called. Trying to replace the stub
4838 type by its associated full type will cause us to restart a scan
4839 which may lead to an infinite recursion. Instead, the client
4840 collecting the matching symbols will end up collecting several
4841 matches, with at least one of them complete. It can then filter
4842 out the stub ones if needed. */
4844 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4846 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4848 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4850 prevDefns
[i
].symbol
= sym
;
4851 prevDefns
[i
].block
= block
;
4857 struct block_symbol info
;
4861 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4865 /* Number of block_symbol structures currently collected in current vector in
4869 num_defns_collected (struct obstack
*obstackp
)
4871 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4874 /* Vector of block_symbol structures currently collected in current vector in
4875 OBSTACKP. If FINISH, close off the vector and return its final address. */
4877 static struct block_symbol
*
4878 defns_collected (struct obstack
*obstackp
, int finish
)
4881 return (struct block_symbol
*) obstack_finish (obstackp
);
4883 return (struct block_symbol
*) obstack_base (obstackp
);
4886 /* Return a bound minimal symbol matching NAME according to Ada
4887 decoding rules. Returns an invalid symbol if there is no such
4888 minimal symbol. Names prefixed with "standard__" are handled
4889 specially: "standard__" is first stripped off, and only static and
4890 global symbols are searched. */
4892 struct bound_minimal_symbol
4893 ada_lookup_simple_minsym (const char *name
)
4895 struct bound_minimal_symbol result
;
4897 memset (&result
, 0, sizeof (result
));
4899 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4900 lookup_name_info
lookup_name (name
, match_type
);
4902 symbol_name_matcher_ftype
*match_name
4903 = ada_get_symbol_name_matcher (lookup_name
);
4905 for (objfile
*objfile
: current_program_space
->objfiles ())
4907 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4909 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4910 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4912 result
.minsym
= msymbol
;
4913 result
.objfile
= objfile
;
4922 /* For all subprograms that statically enclose the subprogram of the
4923 selected frame, add symbols matching identifier NAME in DOMAIN
4924 and their blocks to the list of data in OBSTACKP, as for
4925 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4926 with a wildcard prefix. */
4929 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4930 const lookup_name_info
&lookup_name
,
4935 /* True if TYPE is definitely an artificial type supplied to a symbol
4936 for which no debugging information was given in the symbol file. */
4939 is_nondebugging_type (struct type
*type
)
4941 const char *name
= ada_type_name (type
);
4943 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4946 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4947 that are deemed "identical" for practical purposes.
4949 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4950 types and that their number of enumerals is identical (in other
4951 words, type1->num_fields () == type2->num_fields ()). */
4954 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4958 /* The heuristic we use here is fairly conservative. We consider
4959 that 2 enumerate types are identical if they have the same
4960 number of enumerals and that all enumerals have the same
4961 underlying value and name. */
4963 /* All enums in the type should have an identical underlying value. */
4964 for (i
= 0; i
< type1
->num_fields (); i
++)
4965 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4968 /* All enumerals should also have the same name (modulo any numerical
4970 for (i
= 0; i
< type1
->num_fields (); i
++)
4972 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4973 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4974 int len_1
= strlen (name_1
);
4975 int len_2
= strlen (name_2
);
4977 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4978 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4980 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4981 TYPE_FIELD_NAME (type2
, i
),
4989 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4990 that are deemed "identical" for practical purposes. Sometimes,
4991 enumerals are not strictly identical, but their types are so similar
4992 that they can be considered identical.
4994 For instance, consider the following code:
4996 type Color is (Black, Red, Green, Blue, White);
4997 type RGB_Color is new Color range Red .. Blue;
4999 Type RGB_Color is a subrange of an implicit type which is a copy
5000 of type Color. If we call that implicit type RGB_ColorB ("B" is
5001 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5002 As a result, when an expression references any of the enumeral
5003 by name (Eg. "print green"), the expression is technically
5004 ambiguous and the user should be asked to disambiguate. But
5005 doing so would only hinder the user, since it wouldn't matter
5006 what choice he makes, the outcome would always be the same.
5007 So, for practical purposes, we consider them as the same. */
5010 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
5014 /* Before performing a thorough comparison check of each type,
5015 we perform a series of inexpensive checks. We expect that these
5016 checks will quickly fail in the vast majority of cases, and thus
5017 help prevent the unnecessary use of a more expensive comparison.
5018 Said comparison also expects us to make some of these checks
5019 (see ada_identical_enum_types_p). */
5021 /* Quick check: All symbols should have an enum type. */
5022 for (i
= 0; i
< syms
.size (); i
++)
5023 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
5026 /* Quick check: They should all have the same value. */
5027 for (i
= 1; i
< syms
.size (); i
++)
5028 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5031 /* Quick check: They should all have the same number of enumerals. */
5032 for (i
= 1; i
< syms
.size (); i
++)
5033 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
5034 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
5037 /* All the sanity checks passed, so we might have a set of
5038 identical enumeration types. Perform a more complete
5039 comparison of the type of each symbol. */
5040 for (i
= 1; i
< syms
.size (); i
++)
5041 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5042 SYMBOL_TYPE (syms
[0].symbol
)))
5048 /* Remove any non-debugging symbols in SYMS that definitely
5049 duplicate other symbols in the list (The only case I know of where
5050 this happens is when object files containing stabs-in-ecoff are
5051 linked with files containing ordinary ecoff debugging symbols (or no
5052 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5053 Returns the number of items in the modified list. */
5056 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5060 /* We should never be called with less than 2 symbols, as there
5061 cannot be any extra symbol in that case. But it's easy to
5062 handle, since we have nothing to do in that case. */
5063 if (syms
->size () < 2)
5064 return syms
->size ();
5067 while (i
< syms
->size ())
5071 /* If two symbols have the same name and one of them is a stub type,
5072 the get rid of the stub. */
5074 if (TYPE_STUB (SYMBOL_TYPE ((*syms
)[i
].symbol
))
5075 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5077 for (j
= 0; j
< syms
->size (); j
++)
5080 && !TYPE_STUB (SYMBOL_TYPE ((*syms
)[j
].symbol
))
5081 && (*syms
)[j
].symbol
->linkage_name () != NULL
5082 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5083 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5088 /* Two symbols with the same name, same class and same address
5089 should be identical. */
5091 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5092 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5093 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5095 for (j
= 0; j
< syms
->size (); j
+= 1)
5098 && (*syms
)[j
].symbol
->linkage_name () != NULL
5099 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5100 (*syms
)[j
].symbol
->linkage_name ()) == 0
5101 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5102 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5103 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5104 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5110 syms
->erase (syms
->begin () + i
);
5115 /* If all the remaining symbols are identical enumerals, then
5116 just keep the first one and discard the rest.
5118 Unlike what we did previously, we do not discard any entry
5119 unless they are ALL identical. This is because the symbol
5120 comparison is not a strict comparison, but rather a practical
5121 comparison. If all symbols are considered identical, then
5122 we can just go ahead and use the first one and discard the rest.
5123 But if we cannot reduce the list to a single element, we have
5124 to ask the user to disambiguate anyways. And if we have to
5125 present a multiple-choice menu, it's less confusing if the list
5126 isn't missing some choices that were identical and yet distinct. */
5127 if (symbols_are_identical_enums (*syms
))
5130 return syms
->size ();
5133 /* Given a type that corresponds to a renaming entity, use the type name
5134 to extract the scope (package name or function name, fully qualified,
5135 and following the GNAT encoding convention) where this renaming has been
5139 xget_renaming_scope (struct type
*renaming_type
)
5141 /* The renaming types adhere to the following convention:
5142 <scope>__<rename>___<XR extension>.
5143 So, to extract the scope, we search for the "___XR" extension,
5144 and then backtrack until we find the first "__". */
5146 const char *name
= renaming_type
->name ();
5147 const char *suffix
= strstr (name
, "___XR");
5150 /* Now, backtrack a bit until we find the first "__". Start looking
5151 at suffix - 3, as the <rename> part is at least one character long. */
5153 for (last
= suffix
- 3; last
> name
; last
--)
5154 if (last
[0] == '_' && last
[1] == '_')
5157 /* Make a copy of scope and return it. */
5158 return std::string (name
, last
);
5161 /* Return nonzero if NAME corresponds to a package name. */
5164 is_package_name (const char *name
)
5166 /* Here, We take advantage of the fact that no symbols are generated
5167 for packages, while symbols are generated for each function.
5168 So the condition for NAME represent a package becomes equivalent
5169 to NAME not existing in our list of symbols. There is only one
5170 small complication with library-level functions (see below). */
5172 /* If it is a function that has not been defined at library level,
5173 then we should be able to look it up in the symbols. */
5174 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5177 /* Library-level function names start with "_ada_". See if function
5178 "_ada_" followed by NAME can be found. */
5180 /* Do a quick check that NAME does not contain "__", since library-level
5181 functions names cannot contain "__" in them. */
5182 if (strstr (name
, "__") != NULL
)
5185 std::string fun_name
= string_printf ("_ada_%s", name
);
5187 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5190 /* Return nonzero if SYM corresponds to a renaming entity that is
5191 not visible from FUNCTION_NAME. */
5194 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5196 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5199 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5201 /* If the rename has been defined in a package, then it is visible. */
5202 if (is_package_name (scope
.c_str ()))
5205 /* Check that the rename is in the current function scope by checking
5206 that its name starts with SCOPE. */
5208 /* If the function name starts with "_ada_", it means that it is
5209 a library-level function. Strip this prefix before doing the
5210 comparison, as the encoding for the renaming does not contain
5212 if (startswith (function_name
, "_ada_"))
5215 return !startswith (function_name
, scope
.c_str ());
5218 /* Remove entries from SYMS that corresponds to a renaming entity that
5219 is not visible from the function associated with CURRENT_BLOCK or
5220 that is superfluous due to the presence of more specific renaming
5221 information. Places surviving symbols in the initial entries of
5222 SYMS and returns the number of surviving symbols.
5225 First, in cases where an object renaming is implemented as a
5226 reference variable, GNAT may produce both the actual reference
5227 variable and the renaming encoding. In this case, we discard the
5230 Second, GNAT emits a type following a specified encoding for each renaming
5231 entity. Unfortunately, STABS currently does not support the definition
5232 of types that are local to a given lexical block, so all renamings types
5233 are emitted at library level. As a consequence, if an application
5234 contains two renaming entities using the same name, and a user tries to
5235 print the value of one of these entities, the result of the ada symbol
5236 lookup will also contain the wrong renaming type.
5238 This function partially covers for this limitation by attempting to
5239 remove from the SYMS list renaming symbols that should be visible
5240 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5241 method with the current information available. The implementation
5242 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5244 - When the user tries to print a rename in a function while there
5245 is another rename entity defined in a package: Normally, the
5246 rename in the function has precedence over the rename in the
5247 package, so the latter should be removed from the list. This is
5248 currently not the case.
5250 - This function will incorrectly remove valid renames if
5251 the CURRENT_BLOCK corresponds to a function which symbol name
5252 has been changed by an "Export" pragma. As a consequence,
5253 the user will be unable to print such rename entities. */
5256 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5257 const struct block
*current_block
)
5259 struct symbol
*current_function
;
5260 const char *current_function_name
;
5262 int is_new_style_renaming
;
5264 /* If there is both a renaming foo___XR... encoded as a variable and
5265 a simple variable foo in the same block, discard the latter.
5266 First, zero out such symbols, then compress. */
5267 is_new_style_renaming
= 0;
5268 for (i
= 0; i
< syms
->size (); i
+= 1)
5270 struct symbol
*sym
= (*syms
)[i
].symbol
;
5271 const struct block
*block
= (*syms
)[i
].block
;
5275 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5277 name
= sym
->linkage_name ();
5278 suffix
= strstr (name
, "___XR");
5282 int name_len
= suffix
- name
;
5285 is_new_style_renaming
= 1;
5286 for (j
= 0; j
< syms
->size (); j
+= 1)
5287 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5288 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5290 && block
== (*syms
)[j
].block
)
5291 (*syms
)[j
].symbol
= NULL
;
5294 if (is_new_style_renaming
)
5298 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5299 if ((*syms
)[j
].symbol
!= NULL
)
5301 (*syms
)[k
] = (*syms
)[j
];
5307 /* Extract the function name associated to CURRENT_BLOCK.
5308 Abort if unable to do so. */
5310 if (current_block
== NULL
)
5311 return syms
->size ();
5313 current_function
= block_linkage_function (current_block
);
5314 if (current_function
== NULL
)
5315 return syms
->size ();
5317 current_function_name
= current_function
->linkage_name ();
5318 if (current_function_name
== NULL
)
5319 return syms
->size ();
5321 /* Check each of the symbols, and remove it from the list if it is
5322 a type corresponding to a renaming that is out of the scope of
5323 the current block. */
5326 while (i
< syms
->size ())
5328 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5329 == ADA_OBJECT_RENAMING
5330 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5331 current_function_name
))
5332 syms
->erase (syms
->begin () + i
);
5337 return syms
->size ();
5340 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5341 whose name and domain match NAME and DOMAIN respectively.
5342 If no match was found, then extend the search to "enclosing"
5343 routines (in other words, if we're inside a nested function,
5344 search the symbols defined inside the enclosing functions).
5345 If WILD_MATCH_P is nonzero, perform the naming matching in
5346 "wild" mode (see function "wild_match" for more info).
5348 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5351 ada_add_local_symbols (struct obstack
*obstackp
,
5352 const lookup_name_info
&lookup_name
,
5353 const struct block
*block
, domain_enum domain
)
5355 int block_depth
= 0;
5357 while (block
!= NULL
)
5360 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5362 /* If we found a non-function match, assume that's the one. */
5363 if (is_nonfunction (defns_collected (obstackp
, 0),
5364 num_defns_collected (obstackp
)))
5367 block
= BLOCK_SUPERBLOCK (block
);
5370 /* If no luck so far, try to find NAME as a local symbol in some lexically
5371 enclosing subprogram. */
5372 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5373 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5376 /* An object of this type is used as the user_data argument when
5377 calling the map_matching_symbols method. */
5381 struct objfile
*objfile
;
5382 struct obstack
*obstackp
;
5383 struct symbol
*arg_sym
;
5387 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5388 to a list of symbols. DATA is a pointer to a struct match_data *
5389 containing the obstack that collects the symbol list, the file that SYM
5390 must come from, a flag indicating whether a non-argument symbol has
5391 been found in the current block, and the last argument symbol
5392 passed in SYM within the current block (if any). When SYM is null,
5393 marking the end of a block, the argument symbol is added if no
5394 other has been found. */
5397 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5398 struct match_data
*data
)
5400 const struct block
*block
= bsym
->block
;
5401 struct symbol
*sym
= bsym
->symbol
;
5405 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5406 add_defn_to_vec (data
->obstackp
,
5407 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5409 data
->found_sym
= 0;
5410 data
->arg_sym
= NULL
;
5414 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5416 else if (SYMBOL_IS_ARGUMENT (sym
))
5417 data
->arg_sym
= sym
;
5420 data
->found_sym
= 1;
5421 add_defn_to_vec (data
->obstackp
,
5422 fixup_symbol_section (sym
, data
->objfile
),
5429 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5430 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5431 symbols to OBSTACKP. Return whether we found such symbols. */
5434 ada_add_block_renamings (struct obstack
*obstackp
,
5435 const struct block
*block
,
5436 const lookup_name_info
&lookup_name
,
5439 struct using_direct
*renaming
;
5440 int defns_mark
= num_defns_collected (obstackp
);
5442 symbol_name_matcher_ftype
*name_match
5443 = ada_get_symbol_name_matcher (lookup_name
);
5445 for (renaming
= block_using (block
);
5447 renaming
= renaming
->next
)
5451 /* Avoid infinite recursions: skip this renaming if we are actually
5452 already traversing it.
5454 Currently, symbol lookup in Ada don't use the namespace machinery from
5455 C++/Fortran support: skip namespace imports that use them. */
5456 if (renaming
->searched
5457 || (renaming
->import_src
!= NULL
5458 && renaming
->import_src
[0] != '\0')
5459 || (renaming
->import_dest
!= NULL
5460 && renaming
->import_dest
[0] != '\0'))
5462 renaming
->searched
= 1;
5464 /* TODO: here, we perform another name-based symbol lookup, which can
5465 pull its own multiple overloads. In theory, we should be able to do
5466 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5467 not a simple name. But in order to do this, we would need to enhance
5468 the DWARF reader to associate a symbol to this renaming, instead of a
5469 name. So, for now, we do something simpler: re-use the C++/Fortran
5470 namespace machinery. */
5471 r_name
= (renaming
->alias
!= NULL
5473 : renaming
->declaration
);
5474 if (name_match (r_name
, lookup_name
, NULL
))
5476 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5477 lookup_name
.match_type ());
5478 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5481 renaming
->searched
= 0;
5483 return num_defns_collected (obstackp
) != defns_mark
;
5486 /* Implements compare_names, but only applying the comparision using
5487 the given CASING. */
5490 compare_names_with_case (const char *string1
, const char *string2
,
5491 enum case_sensitivity casing
)
5493 while (*string1
!= '\0' && *string2
!= '\0')
5497 if (isspace (*string1
) || isspace (*string2
))
5498 return strcmp_iw_ordered (string1
, string2
);
5500 if (casing
== case_sensitive_off
)
5502 c1
= tolower (*string1
);
5503 c2
= tolower (*string2
);
5520 return strcmp_iw_ordered (string1
, string2
);
5522 if (*string2
== '\0')
5524 if (is_name_suffix (string1
))
5531 if (*string2
== '(')
5532 return strcmp_iw_ordered (string1
, string2
);
5535 if (casing
== case_sensitive_off
)
5536 return tolower (*string1
) - tolower (*string2
);
5538 return *string1
- *string2
;
5543 /* Compare STRING1 to STRING2, with results as for strcmp.
5544 Compatible with strcmp_iw_ordered in that...
5546 strcmp_iw_ordered (STRING1, STRING2) <= 0
5550 compare_names (STRING1, STRING2) <= 0
5552 (they may differ as to what symbols compare equal). */
5555 compare_names (const char *string1
, const char *string2
)
5559 /* Similar to what strcmp_iw_ordered does, we need to perform
5560 a case-insensitive comparison first, and only resort to
5561 a second, case-sensitive, comparison if the first one was
5562 not sufficient to differentiate the two strings. */
5564 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5566 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5571 /* Convenience function to get at the Ada encoded lookup name for
5572 LOOKUP_NAME, as a C string. */
5575 ada_lookup_name (const lookup_name_info
&lookup_name
)
5577 return lookup_name
.ada ().lookup_name ().c_str ();
5580 /* Add to OBSTACKP all non-local symbols whose name and domain match
5581 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5582 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5583 symbols otherwise. */
5586 add_nonlocal_symbols (struct obstack
*obstackp
,
5587 const lookup_name_info
&lookup_name
,
5588 domain_enum domain
, int global
)
5590 struct match_data data
;
5592 memset (&data
, 0, sizeof data
);
5593 data
.obstackp
= obstackp
;
5595 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5597 auto callback
= [&] (struct block_symbol
*bsym
)
5599 return aux_add_nonlocal_symbols (bsym
, &data
);
5602 for (objfile
*objfile
: current_program_space
->objfiles ())
5604 data
.objfile
= objfile
;
5606 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5607 domain
, global
, callback
,
5609 ? NULL
: compare_names
));
5611 for (compunit_symtab
*cu
: objfile
->compunits ())
5613 const struct block
*global_block
5614 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5616 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5622 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5624 const char *name
= ada_lookup_name (lookup_name
);
5625 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5626 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5628 for (objfile
*objfile
: current_program_space
->objfiles ())
5630 data
.objfile
= objfile
;
5631 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5632 domain
, global
, callback
,
5638 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5639 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5640 returning the number of matches. Add these to OBSTACKP.
5642 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5643 symbol match within the nest of blocks whose innermost member is BLOCK,
5644 is the one match returned (no other matches in that or
5645 enclosing blocks is returned). If there are any matches in or
5646 surrounding BLOCK, then these alone are returned.
5648 Names prefixed with "standard__" are handled specially:
5649 "standard__" is first stripped off (by the lookup_name
5650 constructor), and only static and global symbols are searched.
5652 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5653 to lookup global symbols. */
5656 ada_add_all_symbols (struct obstack
*obstackp
,
5657 const struct block
*block
,
5658 const lookup_name_info
&lookup_name
,
5661 int *made_global_lookup_p
)
5665 if (made_global_lookup_p
)
5666 *made_global_lookup_p
= 0;
5668 /* Special case: If the user specifies a symbol name inside package
5669 Standard, do a non-wild matching of the symbol name without
5670 the "standard__" prefix. This was primarily introduced in order
5671 to allow the user to specifically access the standard exceptions
5672 using, for instance, Standard.Constraint_Error when Constraint_Error
5673 is ambiguous (due to the user defining its own Constraint_Error
5674 entity inside its program). */
5675 if (lookup_name
.ada ().standard_p ())
5678 /* Check the non-global symbols. If we have ANY match, then we're done. */
5683 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5686 /* In the !full_search case we're are being called by
5687 ada_iterate_over_symbols, and we don't want to search
5689 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5691 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5695 /* No non-global symbols found. Check our cache to see if we have
5696 already performed this search before. If we have, then return
5699 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5700 domain
, &sym
, &block
))
5703 add_defn_to_vec (obstackp
, sym
, block
);
5707 if (made_global_lookup_p
)
5708 *made_global_lookup_p
= 1;
5710 /* Search symbols from all global blocks. */
5712 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5714 /* Now add symbols from all per-file blocks if we've gotten no hits
5715 (not strictly correct, but perhaps better than an error). */
5717 if (num_defns_collected (obstackp
) == 0)
5718 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5721 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5722 is non-zero, enclosing scope and in global scopes, returning the number of
5724 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5725 found and the blocks and symbol tables (if any) in which they were
5728 When full_search is non-zero, any non-function/non-enumeral
5729 symbol match within the nest of blocks whose innermost member is BLOCK,
5730 is the one match returned (no other matches in that or
5731 enclosing blocks is returned). If there are any matches in or
5732 surrounding BLOCK, then these alone are returned.
5734 Names prefixed with "standard__" are handled specially: "standard__"
5735 is first stripped off, and only static and global symbols are searched. */
5738 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5739 const struct block
*block
,
5741 std::vector
<struct block_symbol
> *results
,
5744 int syms_from_global_search
;
5746 auto_obstack obstack
;
5748 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5749 domain
, full_search
, &syms_from_global_search
);
5751 ndefns
= num_defns_collected (&obstack
);
5753 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5754 for (int i
= 0; i
< ndefns
; ++i
)
5755 results
->push_back (base
[i
]);
5757 ndefns
= remove_extra_symbols (results
);
5759 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5760 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5762 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5763 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5764 (*results
)[0].symbol
, (*results
)[0].block
);
5766 ndefns
= remove_irrelevant_renamings (results
, block
);
5771 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5772 in global scopes, returning the number of matches, and filling *RESULTS
5773 with (SYM,BLOCK) tuples.
5775 See ada_lookup_symbol_list_worker for further details. */
5778 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5780 std::vector
<struct block_symbol
> *results
)
5782 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5783 lookup_name_info
lookup_name (name
, name_match_type
);
5785 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5788 /* Implementation of the la_iterate_over_symbols method. */
5791 ada_iterate_over_symbols
5792 (const struct block
*block
, const lookup_name_info
&name
,
5794 gdb::function_view
<symbol_found_callback_ftype
> callback
)
5797 std::vector
<struct block_symbol
> results
;
5799 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5801 for (i
= 0; i
< ndefs
; ++i
)
5803 if (!callback (&results
[i
]))
5810 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5811 to 1, but choosing the first symbol found if there are multiple
5814 The result is stored in *INFO, which must be non-NULL.
5815 If no match is found, INFO->SYM is set to NULL. */
5818 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5820 struct block_symbol
*info
)
5822 /* Since we already have an encoded name, wrap it in '<>' to force a
5823 verbatim match. Otherwise, if the name happens to not look like
5824 an encoded name (because it doesn't include a "__"),
5825 ada_lookup_name_info would re-encode/fold it again, and that
5826 would e.g., incorrectly lowercase object renaming names like
5827 "R28b" -> "r28b". */
5828 std::string verbatim
= std::string ("<") + name
+ '>';
5830 gdb_assert (info
!= NULL
);
5831 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5834 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5835 scope and in global scopes, or NULL if none. NAME is folded and
5836 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5837 choosing the first symbol if there are multiple choices. */
5840 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5843 std::vector
<struct block_symbol
> candidates
;
5846 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5848 if (n_candidates
== 0)
5851 block_symbol info
= candidates
[0];
5852 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5856 static struct block_symbol
5857 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5859 const struct block
*block
,
5860 const domain_enum domain
)
5862 struct block_symbol sym
;
5864 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
5865 if (sym
.symbol
!= NULL
)
5868 /* If we haven't found a match at this point, try the primitive
5869 types. In other languages, this search is performed before
5870 searching for global symbols in order to short-circuit that
5871 global-symbol search if it happens that the name corresponds
5872 to a primitive type. But we cannot do the same in Ada, because
5873 it is perfectly legitimate for a program to declare a type which
5874 has the same name as a standard type. If looking up a type in
5875 that situation, we have traditionally ignored the primitive type
5876 in favor of user-defined types. This is why, unlike most other
5877 languages, we search the primitive types this late and only after
5878 having searched the global symbols without success. */
5880 if (domain
== VAR_DOMAIN
)
5882 struct gdbarch
*gdbarch
;
5885 gdbarch
= target_gdbarch ();
5887 gdbarch
= block_gdbarch (block
);
5888 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5889 if (sym
.symbol
!= NULL
)
5897 /* True iff STR is a possible encoded suffix of a normal Ada name
5898 that is to be ignored for matching purposes. Suffixes of parallel
5899 names (e.g., XVE) are not included here. Currently, the possible suffixes
5900 are given by any of the regular expressions:
5902 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5903 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5904 TKB [subprogram suffix for task bodies]
5905 _E[0-9]+[bs]$ [protected object entry suffixes]
5906 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5908 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5909 match is performed. This sequence is used to differentiate homonyms,
5910 is an optional part of a valid name suffix. */
5913 is_name_suffix (const char *str
)
5916 const char *matching
;
5917 const int len
= strlen (str
);
5919 /* Skip optional leading __[0-9]+. */
5921 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5924 while (isdigit (str
[0]))
5930 if (str
[0] == '.' || str
[0] == '$')
5933 while (isdigit (matching
[0]))
5935 if (matching
[0] == '\0')
5941 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5944 while (isdigit (matching
[0]))
5946 if (matching
[0] == '\0')
5950 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5952 if (strcmp (str
, "TKB") == 0)
5956 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5957 with a N at the end. Unfortunately, the compiler uses the same
5958 convention for other internal types it creates. So treating
5959 all entity names that end with an "N" as a name suffix causes
5960 some regressions. For instance, consider the case of an enumerated
5961 type. To support the 'Image attribute, it creates an array whose
5963 Having a single character like this as a suffix carrying some
5964 information is a bit risky. Perhaps we should change the encoding
5965 to be something like "_N" instead. In the meantime, do not do
5966 the following check. */
5967 /* Protected Object Subprograms */
5968 if (len
== 1 && str
[0] == 'N')
5973 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5976 while (isdigit (matching
[0]))
5978 if ((matching
[0] == 'b' || matching
[0] == 's')
5979 && matching
[1] == '\0')
5983 /* ??? We should not modify STR directly, as we are doing below. This
5984 is fine in this case, but may become problematic later if we find
5985 that this alternative did not work, and want to try matching
5986 another one from the begining of STR. Since we modified it, we
5987 won't be able to find the begining of the string anymore! */
5991 while (str
[0] != '_' && str
[0] != '\0')
5993 if (str
[0] != 'n' && str
[0] != 'b')
5999 if (str
[0] == '\000')
6004 if (str
[1] != '_' || str
[2] == '\000')
6008 if (strcmp (str
+ 3, "JM") == 0)
6010 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6011 the LJM suffix in favor of the JM one. But we will
6012 still accept LJM as a valid suffix for a reasonable
6013 amount of time, just to allow ourselves to debug programs
6014 compiled using an older version of GNAT. */
6015 if (strcmp (str
+ 3, "LJM") == 0)
6019 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
6020 || str
[4] == 'U' || str
[4] == 'P')
6022 if (str
[4] == 'R' && str
[5] != 'T')
6026 if (!isdigit (str
[2]))
6028 for (k
= 3; str
[k
] != '\0'; k
+= 1)
6029 if (!isdigit (str
[k
]) && str
[k
] != '_')
6033 if (str
[0] == '$' && isdigit (str
[1]))
6035 for (k
= 2; str
[k
] != '\0'; k
+= 1)
6036 if (!isdigit (str
[k
]) && str
[k
] != '_')
6043 /* Return non-zero if the string starting at NAME and ending before
6044 NAME_END contains no capital letters. */
6047 is_valid_name_for_wild_match (const char *name0
)
6049 std::string decoded_name
= ada_decode (name0
);
6052 /* If the decoded name starts with an angle bracket, it means that
6053 NAME0 does not follow the GNAT encoding format. It should then
6054 not be allowed as a possible wild match. */
6055 if (decoded_name
[0] == '<')
6058 for (i
=0; decoded_name
[i
] != '\0'; i
++)
6059 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6065 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6066 that could start a simple name. Assumes that *NAMEP points into
6067 the string beginning at NAME0. */
6070 advance_wild_match (const char **namep
, const char *name0
, int target0
)
6072 const char *name
= *namep
;
6082 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6085 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6090 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6091 || name
[2] == target0
))
6099 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6109 /* Return true iff NAME encodes a name of the form prefix.PATN.
6110 Ignores any informational suffixes of NAME (i.e., for which
6111 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6115 wild_match (const char *name
, const char *patn
)
6118 const char *name0
= name
;
6122 const char *match
= name
;
6126 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6129 if (*p
== '\0' && is_name_suffix (name
))
6130 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6132 if (name
[-1] == '_')
6135 if (!advance_wild_match (&name
, name0
, *patn
))
6140 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6141 any trailing suffixes that encode debugging information or leading
6142 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6143 information that is ignored). */
6146 full_match (const char *sym_name
, const char *search_name
)
6148 size_t search_name_len
= strlen (search_name
);
6150 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6151 && is_name_suffix (sym_name
+ search_name_len
))
6154 if (startswith (sym_name
, "_ada_")
6155 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6156 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6162 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6163 *defn_symbols, updating the list of symbols in OBSTACKP (if
6164 necessary). OBJFILE is the section containing BLOCK. */
6167 ada_add_block_symbols (struct obstack
*obstackp
,
6168 const struct block
*block
,
6169 const lookup_name_info
&lookup_name
,
6170 domain_enum domain
, struct objfile
*objfile
)
6172 struct block_iterator iter
;
6173 /* A matching argument symbol, if any. */
6174 struct symbol
*arg_sym
;
6175 /* Set true when we find a matching non-argument symbol. */
6181 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6183 sym
= block_iter_match_next (lookup_name
, &iter
))
6185 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6187 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6189 if (SYMBOL_IS_ARGUMENT (sym
))
6194 add_defn_to_vec (obstackp
,
6195 fixup_symbol_section (sym
, objfile
),
6202 /* Handle renamings. */
6204 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6207 if (!found_sym
&& arg_sym
!= NULL
)
6209 add_defn_to_vec (obstackp
,
6210 fixup_symbol_section (arg_sym
, objfile
),
6214 if (!lookup_name
.ada ().wild_match_p ())
6218 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6219 const char *name
= ada_lookup_name
.c_str ();
6220 size_t name_len
= ada_lookup_name
.size ();
6222 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6224 if (symbol_matches_domain (sym
->language (),
6225 SYMBOL_DOMAIN (sym
), domain
))
6229 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6232 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6234 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6239 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6241 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6243 if (SYMBOL_IS_ARGUMENT (sym
))
6248 add_defn_to_vec (obstackp
,
6249 fixup_symbol_section (sym
, objfile
),
6257 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6258 They aren't parameters, right? */
6259 if (!found_sym
&& arg_sym
!= NULL
)
6261 add_defn_to_vec (obstackp
,
6262 fixup_symbol_section (arg_sym
, objfile
),
6269 /* Symbol Completion */
6274 ada_lookup_name_info::matches
6275 (const char *sym_name
,
6276 symbol_name_match_type match_type
,
6277 completion_match_result
*comp_match_res
) const
6280 const char *text
= m_encoded_name
.c_str ();
6281 size_t text_len
= m_encoded_name
.size ();
6283 /* First, test against the fully qualified name of the symbol. */
6285 if (strncmp (sym_name
, text
, text_len
) == 0)
6288 std::string decoded_name
= ada_decode (sym_name
);
6289 if (match
&& !m_encoded_p
)
6291 /* One needed check before declaring a positive match is to verify
6292 that iff we are doing a verbatim match, the decoded version
6293 of the symbol name starts with '<'. Otherwise, this symbol name
6294 is not a suitable completion. */
6296 bool has_angle_bracket
= (decoded_name
[0] == '<');
6297 match
= (has_angle_bracket
== m_verbatim_p
);
6300 if (match
&& !m_verbatim_p
)
6302 /* When doing non-verbatim match, another check that needs to
6303 be done is to verify that the potentially matching symbol name
6304 does not include capital letters, because the ada-mode would
6305 not be able to understand these symbol names without the
6306 angle bracket notation. */
6309 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6314 /* Second: Try wild matching... */
6316 if (!match
&& m_wild_match_p
)
6318 /* Since we are doing wild matching, this means that TEXT
6319 may represent an unqualified symbol name. We therefore must
6320 also compare TEXT against the unqualified name of the symbol. */
6321 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6323 if (strncmp (sym_name
, text
, text_len
) == 0)
6327 /* Finally: If we found a match, prepare the result to return. */
6332 if (comp_match_res
!= NULL
)
6334 std::string
&match_str
= comp_match_res
->match
.storage ();
6337 match_str
= ada_decode (sym_name
);
6341 match_str
= add_angle_brackets (sym_name
);
6343 match_str
= sym_name
;
6347 comp_match_res
->set_match (match_str
.c_str ());
6353 /* Add the list of possible symbol names completing TEXT to TRACKER.
6354 WORD is the entire command on which completion is made. */
6357 ada_collect_symbol_completion_matches (completion_tracker
&tracker
,
6358 complete_symbol_mode mode
,
6359 symbol_name_match_type name_match_type
,
6360 const char *text
, const char *word
,
6361 enum type_code code
)
6364 const struct block
*b
, *surrounding_static_block
= 0;
6365 struct block_iterator iter
;
6367 gdb_assert (code
== TYPE_CODE_UNDEF
);
6369 lookup_name_info
lookup_name (text
, name_match_type
, true);
6371 /* First, look at the partial symtab symbols. */
6372 expand_symtabs_matching (NULL
,
6378 /* At this point scan through the misc symbol vectors and add each
6379 symbol you find to the list. Eventually we want to ignore
6380 anything that isn't a text symbol (everything else will be
6381 handled by the psymtab code above). */
6383 for (objfile
*objfile
: current_program_space
->objfiles ())
6385 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
6389 if (completion_skip_symbol (mode
, msymbol
))
6392 language symbol_language
= msymbol
->language ();
6394 /* Ada minimal symbols won't have their language set to Ada. If
6395 we let completion_list_add_name compare using the
6396 default/C-like matcher, then when completing e.g., symbols in a
6397 package named "pck", we'd match internal Ada symbols like
6398 "pckS", which are invalid in an Ada expression, unless you wrap
6399 them in '<' '>' to request a verbatim match.
6401 Unfortunately, some Ada encoded names successfully demangle as
6402 C++ symbols (using an old mangling scheme), such as "name__2Xn"
6403 -> "Xn::name(void)" and thus some Ada minimal symbols end up
6404 with the wrong language set. Paper over that issue here. */
6405 if (symbol_language
== language_auto
6406 || symbol_language
== language_cplus
)
6407 symbol_language
= language_ada
;
6409 completion_list_add_name (tracker
,
6411 msymbol
->linkage_name (),
6412 lookup_name
, text
, word
);
6416 /* Search upwards from currently selected frame (so that we can
6417 complete on local vars. */
6419 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6421 if (!BLOCK_SUPERBLOCK (b
))
6422 surrounding_static_block
= b
; /* For elmin of dups */
6424 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6426 if (completion_skip_symbol (mode
, sym
))
6429 completion_list_add_name (tracker
,
6431 sym
->linkage_name (),
6432 lookup_name
, text
, word
);
6436 /* Go through the symtabs and check the externs and statics for
6437 symbols which match. */
6439 for (objfile
*objfile
: current_program_space
->objfiles ())
6441 for (compunit_symtab
*s
: objfile
->compunits ())
6444 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6445 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6447 if (completion_skip_symbol (mode
, sym
))
6450 completion_list_add_name (tracker
,
6452 sym
->linkage_name (),
6453 lookup_name
, text
, word
);
6458 for (objfile
*objfile
: current_program_space
->objfiles ())
6460 for (compunit_symtab
*s
: objfile
->compunits ())
6463 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6464 /* Don't do this block twice. */
6465 if (b
== surrounding_static_block
)
6467 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6469 if (completion_skip_symbol (mode
, sym
))
6472 completion_list_add_name (tracker
,
6474 sym
->linkage_name (),
6475 lookup_name
, text
, word
);
6483 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6484 for tagged types. */
6487 ada_is_dispatch_table_ptr_type (struct type
*type
)
6491 if (type
->code () != TYPE_CODE_PTR
)
6494 name
= TYPE_TARGET_TYPE (type
)->name ();
6498 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6501 /* Return non-zero if TYPE is an interface tag. */
6504 ada_is_interface_tag (struct type
*type
)
6506 const char *name
= type
->name ();
6511 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6514 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6515 to be invisible to users. */
6518 ada_is_ignored_field (struct type
*type
, int field_num
)
6520 if (field_num
< 0 || field_num
> type
->num_fields ())
6523 /* Check the name of that field. */
6525 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6527 /* Anonymous field names should not be printed.
6528 brobecker/2007-02-20: I don't think this can actually happen
6529 but we don't want to print the value of anonymous fields anyway. */
6533 /* Normally, fields whose name start with an underscore ("_")
6534 are fields that have been internally generated by the compiler,
6535 and thus should not be printed. The "_parent" field is special,
6536 however: This is a field internally generated by the compiler
6537 for tagged types, and it contains the components inherited from
6538 the parent type. This field should not be printed as is, but
6539 should not be ignored either. */
6540 if (name
[0] == '_' && !startswith (name
, "_parent"))
6544 /* If this is the dispatch table of a tagged type or an interface tag,
6546 if (ada_is_tagged_type (type
, 1)
6547 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6548 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6551 /* Not a special field, so it should not be ignored. */
6555 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6556 pointer or reference type whose ultimate target has a tag field. */
6559 ada_is_tagged_type (struct type
*type
, int refok
)
6561 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6564 /* True iff TYPE represents the type of X'Tag */
6567 ada_is_tag_type (struct type
*type
)
6569 type
= ada_check_typedef (type
);
6571 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6575 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6577 return (name
!= NULL
6578 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6582 /* The type of the tag on VAL. */
6584 static struct type
*
6585 ada_tag_type (struct value
*val
)
6587 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6590 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6591 retired at Ada 05). */
6594 is_ada95_tag (struct value
*tag
)
6596 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6599 /* The value of the tag on VAL. */
6601 static struct value
*
6602 ada_value_tag (struct value
*val
)
6604 return ada_value_struct_elt (val
, "_tag", 0);
6607 /* The value of the tag on the object of type TYPE whose contents are
6608 saved at VALADDR, if it is non-null, or is at memory address
6611 static struct value
*
6612 value_tag_from_contents_and_address (struct type
*type
,
6613 const gdb_byte
*valaddr
,
6616 int tag_byte_offset
;
6617 struct type
*tag_type
;
6619 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6622 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6624 : valaddr
+ tag_byte_offset
);
6625 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6627 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6632 static struct type
*
6633 type_from_tag (struct value
*tag
)
6635 const char *type_name
= ada_tag_name (tag
);
6637 if (type_name
!= NULL
)
6638 return ada_find_any_type (ada_encode (type_name
));
6642 /* Given a value OBJ of a tagged type, return a value of this
6643 type at the base address of the object. The base address, as
6644 defined in Ada.Tags, it is the address of the primary tag of
6645 the object, and therefore where the field values of its full
6646 view can be fetched. */
6649 ada_tag_value_at_base_address (struct value
*obj
)
6652 LONGEST offset_to_top
= 0;
6653 struct type
*ptr_type
, *obj_type
;
6655 CORE_ADDR base_address
;
6657 obj_type
= value_type (obj
);
6659 /* It is the responsability of the caller to deref pointers. */
6661 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6664 tag
= ada_value_tag (obj
);
6668 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6670 if (is_ada95_tag (tag
))
6673 ptr_type
= language_lookup_primitive_type
6674 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6675 ptr_type
= lookup_pointer_type (ptr_type
);
6676 val
= value_cast (ptr_type
, tag
);
6680 /* It is perfectly possible that an exception be raised while
6681 trying to determine the base address, just like for the tag;
6682 see ada_tag_name for more details. We do not print the error
6683 message for the same reason. */
6687 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6690 catch (const gdb_exception_error
&e
)
6695 /* If offset is null, nothing to do. */
6697 if (offset_to_top
== 0)
6700 /* -1 is a special case in Ada.Tags; however, what should be done
6701 is not quite clear from the documentation. So do nothing for
6704 if (offset_to_top
== -1)
6707 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6708 from the base address. This was however incompatible with
6709 C++ dispatch table: C++ uses a *negative* value to *add*
6710 to the base address. Ada's convention has therefore been
6711 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6712 use the same convention. Here, we support both cases by
6713 checking the sign of OFFSET_TO_TOP. */
6715 if (offset_to_top
> 0)
6716 offset_to_top
= -offset_to_top
;
6718 base_address
= value_address (obj
) + offset_to_top
;
6719 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6721 /* Make sure that we have a proper tag at the new address.
6722 Otherwise, offset_to_top is bogus (which can happen when
6723 the object is not initialized yet). */
6728 obj_type
= type_from_tag (tag
);
6733 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6736 /* Return the "ada__tags__type_specific_data" type. */
6738 static struct type
*
6739 ada_get_tsd_type (struct inferior
*inf
)
6741 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6743 if (data
->tsd_type
== 0)
6744 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6745 return data
->tsd_type
;
6748 /* Return the TSD (type-specific data) associated to the given TAG.
6749 TAG is assumed to be the tag of a tagged-type entity.
6751 May return NULL if we are unable to get the TSD. */
6753 static struct value
*
6754 ada_get_tsd_from_tag (struct value
*tag
)
6759 /* First option: The TSD is simply stored as a field of our TAG.
6760 Only older versions of GNAT would use this format, but we have
6761 to test it first, because there are no visible markers for
6762 the current approach except the absence of that field. */
6764 val
= ada_value_struct_elt (tag
, "tsd", 1);
6768 /* Try the second representation for the dispatch table (in which
6769 there is no explicit 'tsd' field in the referent of the tag pointer,
6770 and instead the tsd pointer is stored just before the dispatch
6773 type
= ada_get_tsd_type (current_inferior());
6776 type
= lookup_pointer_type (lookup_pointer_type (type
));
6777 val
= value_cast (type
, tag
);
6780 return value_ind (value_ptradd (val
, -1));
6783 /* Given the TSD of a tag (type-specific data), return a string
6784 containing the name of the associated type.
6786 The returned value is good until the next call. May return NULL
6787 if we are unable to determine the tag name. */
6790 ada_tag_name_from_tsd (struct value
*tsd
)
6792 static char name
[1024];
6796 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6799 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6800 for (p
= name
; *p
!= '\0'; p
+= 1)
6806 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6809 Return NULL if the TAG is not an Ada tag, or if we were unable to
6810 determine the name of that tag. The result is good until the next
6814 ada_tag_name (struct value
*tag
)
6818 if (!ada_is_tag_type (value_type (tag
)))
6821 /* It is perfectly possible that an exception be raised while trying
6822 to determine the TAG's name, even under normal circumstances:
6823 The associated variable may be uninitialized or corrupted, for
6824 instance. We do not let any exception propagate past this point.
6825 instead we return NULL.
6827 We also do not print the error message either (which often is very
6828 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6829 the caller print a more meaningful message if necessary. */
6832 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6835 name
= ada_tag_name_from_tsd (tsd
);
6837 catch (const gdb_exception_error
&e
)
6844 /* The parent type of TYPE, or NULL if none. */
6847 ada_parent_type (struct type
*type
)
6851 type
= ada_check_typedef (type
);
6853 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6856 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6857 if (ada_is_parent_field (type
, i
))
6859 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6861 /* If the _parent field is a pointer, then dereference it. */
6862 if (parent_type
->code () == TYPE_CODE_PTR
)
6863 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6864 /* If there is a parallel XVS type, get the actual base type. */
6865 parent_type
= ada_get_base_type (parent_type
);
6867 return ada_check_typedef (parent_type
);
6873 /* True iff field number FIELD_NUM of structure type TYPE contains the
6874 parent-type (inherited) fields of a derived type. Assumes TYPE is
6875 a structure type with at least FIELD_NUM+1 fields. */
6878 ada_is_parent_field (struct type
*type
, int field_num
)
6880 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6882 return (name
!= NULL
6883 && (startswith (name
, "PARENT")
6884 || startswith (name
, "_parent")));
6887 /* True iff field number FIELD_NUM of structure type TYPE is a
6888 transparent wrapper field (which should be silently traversed when doing
6889 field selection and flattened when printing). Assumes TYPE is a
6890 structure type with at least FIELD_NUM+1 fields. Such fields are always
6894 ada_is_wrapper_field (struct type
*type
, int field_num
)
6896 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6898 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6900 /* This happens in functions with "out" or "in out" parameters
6901 which are passed by copy. For such functions, GNAT describes
6902 the function's return type as being a struct where the return
6903 value is in a field called RETVAL, and where the other "out"
6904 or "in out" parameters are fields of that struct. This is not
6909 return (name
!= NULL
6910 && (startswith (name
, "PARENT")
6911 || strcmp (name
, "REP") == 0
6912 || startswith (name
, "_parent")
6913 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6916 /* True iff field number FIELD_NUM of structure or union type TYPE
6917 is a variant wrapper. Assumes TYPE is a structure type with at least
6918 FIELD_NUM+1 fields. */
6921 ada_is_variant_part (struct type
*type
, int field_num
)
6923 /* Only Ada types are eligible. */
6924 if (!ADA_TYPE_P (type
))
6927 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6929 return (field_type
->code () == TYPE_CODE_UNION
6930 || (is_dynamic_field (type
, field_num
)
6931 && (TYPE_TARGET_TYPE (field_type
)->code ()
6932 == TYPE_CODE_UNION
)));
6935 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6936 whose discriminants are contained in the record type OUTER_TYPE,
6937 returns the type of the controlling discriminant for the variant.
6938 May return NULL if the type could not be found. */
6941 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6943 const char *name
= ada_variant_discrim_name (var_type
);
6945 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6948 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6949 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6950 represents a 'when others' clause; otherwise 0. */
6953 ada_is_others_clause (struct type
*type
, int field_num
)
6955 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6957 return (name
!= NULL
&& name
[0] == 'O');
6960 /* Assuming that TYPE0 is the type of the variant part of a record,
6961 returns the name of the discriminant controlling the variant.
6962 The value is valid until the next call to ada_variant_discrim_name. */
6965 ada_variant_discrim_name (struct type
*type0
)
6967 static char *result
= NULL
;
6968 static size_t result_len
= 0;
6971 const char *discrim_end
;
6972 const char *discrim_start
;
6974 if (type0
->code () == TYPE_CODE_PTR
)
6975 type
= TYPE_TARGET_TYPE (type0
);
6979 name
= ada_type_name (type
);
6981 if (name
== NULL
|| name
[0] == '\000')
6984 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6987 if (startswith (discrim_end
, "___XVN"))
6990 if (discrim_end
== name
)
6993 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6996 if (discrim_start
== name
+ 1)
6998 if ((discrim_start
> name
+ 3
6999 && startswith (discrim_start
- 3, "___"))
7000 || discrim_start
[-1] == '.')
7004 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
7005 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
7006 result
[discrim_end
- discrim_start
] = '\0';
7010 /* Scan STR for a subtype-encoded number, beginning at position K.
7011 Put the position of the character just past the number scanned in
7012 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7013 Return 1 if there was a valid number at the given position, and 0
7014 otherwise. A "subtype-encoded" number consists of the absolute value
7015 in decimal, followed by the letter 'm' to indicate a negative number.
7016 Assumes 0m does not occur. */
7019 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
7023 if (!isdigit (str
[k
]))
7026 /* Do it the hard way so as not to make any assumption about
7027 the relationship of unsigned long (%lu scan format code) and
7030 while (isdigit (str
[k
]))
7032 RU
= RU
* 10 + (str
[k
] - '0');
7039 *R
= (-(LONGEST
) (RU
- 1)) - 1;
7045 /* NOTE on the above: Technically, C does not say what the results of
7046 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7047 number representable as a LONGEST (although either would probably work
7048 in most implementations). When RU>0, the locution in the then branch
7049 above is always equivalent to the negative of RU. */
7056 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7057 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7058 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7061 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
7063 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7077 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
7087 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
7088 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7090 if (val
>= L
&& val
<= U
)
7102 /* FIXME: Lots of redundancy below. Try to consolidate. */
7104 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7105 ARG_TYPE, extract and return the value of one of its (non-static)
7106 fields. FIELDNO says which field. Differs from value_primitive_field
7107 only in that it can handle packed values of arbitrary type. */
7110 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7111 struct type
*arg_type
)
7115 arg_type
= ada_check_typedef (arg_type
);
7116 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
7118 /* Handle packed fields. It might be that the field is not packed
7119 relative to its containing structure, but the structure itself is
7120 packed; in this case we must take the bit-field path. */
7121 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
7123 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7124 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7126 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7127 offset
+ bit_pos
/ 8,
7128 bit_pos
% 8, bit_size
, type
);
7131 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7134 /* Find field with name NAME in object of type TYPE. If found,
7135 set the following for each argument that is non-null:
7136 - *FIELD_TYPE_P to the field's type;
7137 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7138 an object of that type;
7139 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7140 - *BIT_SIZE_P to its size in bits if the field is packed, and
7142 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7143 fields up to but not including the desired field, or by the total
7144 number of fields if not found. A NULL value of NAME never
7145 matches; the function just counts visible fields in this case.
7147 Notice that we need to handle when a tagged record hierarchy
7148 has some components with the same name, like in this scenario:
7150 type Top_T is tagged record
7156 type Middle_T is new Top.Top_T with record
7157 N : Character := 'a';
7161 type Bottom_T is new Middle.Middle_T with record
7163 C : Character := '5';
7165 A : Character := 'J';
7168 Let's say we now have a variable declared and initialized as follow:
7170 TC : Top_A := new Bottom_T;
7172 And then we use this variable to call this function
7174 procedure Assign (Obj: in out Top_T; TV : Integer);
7178 Assign (Top_T (B), 12);
7180 Now, we're in the debugger, and we're inside that procedure
7181 then and we want to print the value of obj.c:
7183 Usually, the tagged record or one of the parent type owns the
7184 component to print and there's no issue but in this particular
7185 case, what does it mean to ask for Obj.C? Since the actual
7186 type for object is type Bottom_T, it could mean two things: type
7187 component C from the Middle_T view, but also component C from
7188 Bottom_T. So in that "undefined" case, when the component is
7189 not found in the non-resolved type (which includes all the
7190 components of the parent type), then resolve it and see if we
7191 get better luck once expanded.
7193 In the case of homonyms in the derived tagged type, we don't
7194 guaranty anything, and pick the one that's easiest for us
7197 Returns 1 if found, 0 otherwise. */
7200 find_struct_field (const char *name
, struct type
*type
, int offset
,
7201 struct type
**field_type_p
,
7202 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7206 int parent_offset
= -1;
7208 type
= ada_check_typedef (type
);
7210 if (field_type_p
!= NULL
)
7211 *field_type_p
= NULL
;
7212 if (byte_offset_p
!= NULL
)
7214 if (bit_offset_p
!= NULL
)
7216 if (bit_size_p
!= NULL
)
7219 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7221 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7222 int fld_offset
= offset
+ bit_pos
/ 8;
7223 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7225 if (t_field_name
== NULL
)
7228 else if (ada_is_parent_field (type
, i
))
7230 /* This is a field pointing us to the parent type of a tagged
7231 type. As hinted in this function's documentation, we give
7232 preference to fields in the current record first, so what
7233 we do here is just record the index of this field before
7234 we skip it. If it turns out we couldn't find our field
7235 in the current record, then we'll get back to it and search
7236 inside it whether the field might exist in the parent. */
7242 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7244 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7246 if (field_type_p
!= NULL
)
7247 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7248 if (byte_offset_p
!= NULL
)
7249 *byte_offset_p
= fld_offset
;
7250 if (bit_offset_p
!= NULL
)
7251 *bit_offset_p
= bit_pos
% 8;
7252 if (bit_size_p
!= NULL
)
7253 *bit_size_p
= bit_size
;
7256 else if (ada_is_wrapper_field (type
, i
))
7258 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7259 field_type_p
, byte_offset_p
, bit_offset_p
,
7260 bit_size_p
, index_p
))
7263 else if (ada_is_variant_part (type
, i
))
7265 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7268 struct type
*field_type
7269 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7271 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7273 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7275 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7276 field_type_p
, byte_offset_p
,
7277 bit_offset_p
, bit_size_p
, index_p
))
7281 else if (index_p
!= NULL
)
7285 /* Field not found so far. If this is a tagged type which
7286 has a parent, try finding that field in the parent now. */
7288 if (parent_offset
!= -1)
7290 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7291 int fld_offset
= offset
+ bit_pos
/ 8;
7293 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, parent_offset
),
7294 fld_offset
, field_type_p
, byte_offset_p
,
7295 bit_offset_p
, bit_size_p
, index_p
))
7302 /* Number of user-visible fields in record type TYPE. */
7305 num_visible_fields (struct type
*type
)
7310 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7314 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7315 and search in it assuming it has (class) type TYPE.
7316 If found, return value, else return NULL.
7318 Searches recursively through wrapper fields (e.g., '_parent').
7320 In the case of homonyms in the tagged types, please refer to the
7321 long explanation in find_struct_field's function documentation. */
7323 static struct value
*
7324 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7328 int parent_offset
= -1;
7330 type
= ada_check_typedef (type
);
7331 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7333 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7335 if (t_field_name
== NULL
)
7338 else if (ada_is_parent_field (type
, i
))
7340 /* This is a field pointing us to the parent type of a tagged
7341 type. As hinted in this function's documentation, we give
7342 preference to fields in the current record first, so what
7343 we do here is just record the index of this field before
7344 we skip it. If it turns out we couldn't find our field
7345 in the current record, then we'll get back to it and search
7346 inside it whether the field might exist in the parent. */
7352 else if (field_name_match (t_field_name
, name
))
7353 return ada_value_primitive_field (arg
, offset
, i
, type
);
7355 else if (ada_is_wrapper_field (type
, i
))
7357 struct value
*v
= /* Do not let indent join lines here. */
7358 ada_search_struct_field (name
, arg
,
7359 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7360 TYPE_FIELD_TYPE (type
, i
));
7366 else if (ada_is_variant_part (type
, i
))
7368 /* PNH: Do we ever get here? See find_struct_field. */
7370 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7372 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7374 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7376 struct value
*v
= ada_search_struct_field
/* Force line
7379 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7380 TYPE_FIELD_TYPE (field_type
, j
));
7388 /* Field not found so far. If this is a tagged type which
7389 has a parent, try finding that field in the parent now. */
7391 if (parent_offset
!= -1)
7393 struct value
*v
= ada_search_struct_field (
7394 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7395 TYPE_FIELD_TYPE (type
, parent_offset
));
7404 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7405 int, struct type
*);
7408 /* Return field #INDEX in ARG, where the index is that returned by
7409 * find_struct_field through its INDEX_P argument. Adjust the address
7410 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7411 * If found, return value, else return NULL. */
7413 static struct value
*
7414 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7417 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7421 /* Auxiliary function for ada_index_struct_field. Like
7422 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7425 static struct value
*
7426 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7430 type
= ada_check_typedef (type
);
7432 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7434 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7436 else if (ada_is_wrapper_field (type
, i
))
7438 struct value
*v
= /* Do not let indent join lines here. */
7439 ada_index_struct_field_1 (index_p
, arg
,
7440 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7441 TYPE_FIELD_TYPE (type
, i
));
7447 else if (ada_is_variant_part (type
, i
))
7449 /* PNH: Do we ever get here? See ada_search_struct_field,
7450 find_struct_field. */
7451 error (_("Cannot assign this kind of variant record"));
7453 else if (*index_p
== 0)
7454 return ada_value_primitive_field (arg
, offset
, i
, type
);
7461 /* Return a string representation of type TYPE. */
7464 type_as_string (struct type
*type
)
7466 string_file tmp_stream
;
7468 type_print (type
, "", &tmp_stream
, -1);
7470 return std::move (tmp_stream
.string ());
7473 /* Given a type TYPE, look up the type of the component of type named NAME.
7474 If DISPP is non-null, add its byte displacement from the beginning of a
7475 structure (pointed to by a value) of type TYPE to *DISPP (does not
7476 work for packed fields).
7478 Matches any field whose name has NAME as a prefix, possibly
7481 TYPE can be either a struct or union. If REFOK, TYPE may also
7482 be a (pointer or reference)+ to a struct or union, and the
7483 ultimate target type will be searched.
7485 Looks recursively into variant clauses and parent types.
7487 In the case of homonyms in the tagged types, please refer to the
7488 long explanation in find_struct_field's function documentation.
7490 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7491 TYPE is not a type of the right kind. */
7493 static struct type
*
7494 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7498 int parent_offset
= -1;
7503 if (refok
&& type
!= NULL
)
7506 type
= ada_check_typedef (type
);
7507 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7509 type
= TYPE_TARGET_TYPE (type
);
7513 || (type
->code () != TYPE_CODE_STRUCT
7514 && type
->code () != TYPE_CODE_UNION
))
7519 error (_("Type %s is not a structure or union type"),
7520 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7523 type
= to_static_fixed_type (type
);
7525 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7527 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7530 if (t_field_name
== NULL
)
7533 else if (ada_is_parent_field (type
, i
))
7535 /* This is a field pointing us to the parent type of a tagged
7536 type. As hinted in this function's documentation, we give
7537 preference to fields in the current record first, so what
7538 we do here is just record the index of this field before
7539 we skip it. If it turns out we couldn't find our field
7540 in the current record, then we'll get back to it and search
7541 inside it whether the field might exist in the parent. */
7547 else if (field_name_match (t_field_name
, name
))
7548 return TYPE_FIELD_TYPE (type
, i
);
7550 else if (ada_is_wrapper_field (type
, i
))
7552 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7558 else if (ada_is_variant_part (type
, i
))
7561 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7564 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
7566 /* FIXME pnh 2008/01/26: We check for a field that is
7567 NOT wrapped in a struct, since the compiler sometimes
7568 generates these for unchecked variant types. Revisit
7569 if the compiler changes this practice. */
7570 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7572 if (v_field_name
!= NULL
7573 && field_name_match (v_field_name
, name
))
7574 t
= TYPE_FIELD_TYPE (field_type
, j
);
7576 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7587 /* Field not found so far. If this is a tagged type which
7588 has a parent, try finding that field in the parent now. */
7590 if (parent_offset
!= -1)
7594 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, parent_offset
),
7603 const char *name_str
= name
!= NULL
? name
: _("<null>");
7605 error (_("Type %s has no component named %s"),
7606 type_as_string (type
).c_str (), name_str
);
7612 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7613 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7614 represents an unchecked union (that is, the variant part of a
7615 record that is named in an Unchecked_Union pragma). */
7618 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7620 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7622 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7626 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7627 within OUTER, determine which variant clause (field number in VAR_TYPE,
7628 numbering from 0) is applicable. Returns -1 if none are. */
7631 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7635 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7636 struct value
*discrim
;
7637 LONGEST discrim_val
;
7639 /* Using plain value_from_contents_and_address here causes problems
7640 because we will end up trying to resolve a type that is currently
7641 being constructed. */
7642 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7643 if (discrim
== NULL
)
7645 discrim_val
= value_as_long (discrim
);
7648 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7650 if (ada_is_others_clause (var_type
, i
))
7652 else if (ada_in_variant (discrim_val
, var_type
, i
))
7656 return others_clause
;
7661 /* Dynamic-Sized Records */
7663 /* Strategy: The type ostensibly attached to a value with dynamic size
7664 (i.e., a size that is not statically recorded in the debugging
7665 data) does not accurately reflect the size or layout of the value.
7666 Our strategy is to convert these values to values with accurate,
7667 conventional types that are constructed on the fly. */
7669 /* There is a subtle and tricky problem here. In general, we cannot
7670 determine the size of dynamic records without its data. However,
7671 the 'struct value' data structure, which GDB uses to represent
7672 quantities in the inferior process (the target), requires the size
7673 of the type at the time of its allocation in order to reserve space
7674 for GDB's internal copy of the data. That's why the
7675 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7676 rather than struct value*s.
7678 However, GDB's internal history variables ($1, $2, etc.) are
7679 struct value*s containing internal copies of the data that are not, in
7680 general, the same as the data at their corresponding addresses in
7681 the target. Fortunately, the types we give to these values are all
7682 conventional, fixed-size types (as per the strategy described
7683 above), so that we don't usually have to perform the
7684 'to_fixed_xxx_type' conversions to look at their values.
7685 Unfortunately, there is one exception: if one of the internal
7686 history variables is an array whose elements are unconstrained
7687 records, then we will need to create distinct fixed types for each
7688 element selected. */
7690 /* The upshot of all of this is that many routines take a (type, host
7691 address, target address) triple as arguments to represent a value.
7692 The host address, if non-null, is supposed to contain an internal
7693 copy of the relevant data; otherwise, the program is to consult the
7694 target at the target address. */
7696 /* Assuming that VAL0 represents a pointer value, the result of
7697 dereferencing it. Differs from value_ind in its treatment of
7698 dynamic-sized types. */
7701 ada_value_ind (struct value
*val0
)
7703 struct value
*val
= value_ind (val0
);
7705 if (ada_is_tagged_type (value_type (val
), 0))
7706 val
= ada_tag_value_at_base_address (val
);
7708 return ada_to_fixed_value (val
);
7711 /* The value resulting from dereferencing any "reference to"
7712 qualifiers on VAL0. */
7714 static struct value
*
7715 ada_coerce_ref (struct value
*val0
)
7717 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7719 struct value
*val
= val0
;
7721 val
= coerce_ref (val
);
7723 if (ada_is_tagged_type (value_type (val
), 0))
7724 val
= ada_tag_value_at_base_address (val
);
7726 return ada_to_fixed_value (val
);
7732 /* Return the bit alignment required for field #F of template type TYPE. */
7735 field_alignment (struct type
*type
, int f
)
7737 const char *name
= TYPE_FIELD_NAME (type
, f
);
7741 /* The field name should never be null, unless the debugging information
7742 is somehow malformed. In this case, we assume the field does not
7743 require any alignment. */
7747 len
= strlen (name
);
7749 if (!isdigit (name
[len
- 1]))
7752 if (isdigit (name
[len
- 2]))
7753 align_offset
= len
- 2;
7755 align_offset
= len
- 1;
7757 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7758 return TARGET_CHAR_BIT
;
7760 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7763 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7765 static struct symbol
*
7766 ada_find_any_type_symbol (const char *name
)
7770 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7771 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7774 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7778 /* Find a type named NAME. Ignores ambiguity. This routine will look
7779 solely for types defined by debug info, it will not search the GDB
7782 static struct type
*
7783 ada_find_any_type (const char *name
)
7785 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7788 return SYMBOL_TYPE (sym
);
7793 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7794 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7795 symbol, in which case it is returned. Otherwise, this looks for
7796 symbols whose name is that of NAME_SYM suffixed with "___XR".
7797 Return symbol if found, and NULL otherwise. */
7800 ada_is_renaming_symbol (struct symbol
*name_sym
)
7802 const char *name
= name_sym
->linkage_name ();
7803 return strstr (name
, "___XR") != NULL
;
7806 /* Because of GNAT encoding conventions, several GDB symbols may match a
7807 given type name. If the type denoted by TYPE0 is to be preferred to
7808 that of TYPE1 for purposes of type printing, return non-zero;
7809 otherwise return 0. */
7812 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7816 else if (type0
== NULL
)
7818 else if (type1
->code () == TYPE_CODE_VOID
)
7820 else if (type0
->code () == TYPE_CODE_VOID
)
7822 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7824 else if (ada_is_constrained_packed_array_type (type0
))
7826 else if (ada_is_array_descriptor_type (type0
)
7827 && !ada_is_array_descriptor_type (type1
))
7831 const char *type0_name
= type0
->name ();
7832 const char *type1_name
= type1
->name ();
7834 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7835 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7841 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7845 ada_type_name (struct type
*type
)
7849 return type
->name ();
7852 /* Search the list of "descriptive" types associated to TYPE for a type
7853 whose name is NAME. */
7855 static struct type
*
7856 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7858 struct type
*result
, *tmp
;
7860 if (ada_ignore_descriptive_types_p
)
7863 /* If there no descriptive-type info, then there is no parallel type
7865 if (!HAVE_GNAT_AUX_INFO (type
))
7868 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7869 while (result
!= NULL
)
7871 const char *result_name
= ada_type_name (result
);
7873 if (result_name
== NULL
)
7875 warning (_("unexpected null name on descriptive type"));
7879 /* If the names match, stop. */
7880 if (strcmp (result_name
, name
) == 0)
7883 /* Otherwise, look at the next item on the list, if any. */
7884 if (HAVE_GNAT_AUX_INFO (result
))
7885 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7889 /* If not found either, try after having resolved the typedef. */
7894 result
= check_typedef (result
);
7895 if (HAVE_GNAT_AUX_INFO (result
))
7896 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7902 /* If we didn't find a match, see whether this is a packed array. With
7903 older compilers, the descriptive type information is either absent or
7904 irrelevant when it comes to packed arrays so the above lookup fails.
7905 Fall back to using a parallel lookup by name in this case. */
7906 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7907 return ada_find_any_type (name
);
7912 /* Find a parallel type to TYPE with the specified NAME, using the
7913 descriptive type taken from the debugging information, if available,
7914 and otherwise using the (slower) name-based method. */
7916 static struct type
*
7917 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7919 struct type
*result
= NULL
;
7921 if (HAVE_GNAT_AUX_INFO (type
))
7922 result
= find_parallel_type_by_descriptive_type (type
, name
);
7924 result
= ada_find_any_type (name
);
7929 /* Same as above, but specify the name of the parallel type by appending
7930 SUFFIX to the name of TYPE. */
7933 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7936 const char *type_name
= ada_type_name (type
);
7939 if (type_name
== NULL
)
7942 len
= strlen (type_name
);
7944 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7946 strcpy (name
, type_name
);
7947 strcpy (name
+ len
, suffix
);
7949 return ada_find_parallel_type_with_name (type
, name
);
7952 /* If TYPE is a variable-size record type, return the corresponding template
7953 type describing its fields. Otherwise, return NULL. */
7955 static struct type
*
7956 dynamic_template_type (struct type
*type
)
7958 type
= ada_check_typedef (type
);
7960 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7961 || ada_type_name (type
) == NULL
)
7965 int len
= strlen (ada_type_name (type
));
7967 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7970 return ada_find_parallel_type (type
, "___XVE");
7974 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7975 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7978 is_dynamic_field (struct type
*templ_type
, int field_num
)
7980 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7983 && TYPE_FIELD_TYPE (templ_type
, field_num
)->code () == TYPE_CODE_PTR
7984 && strstr (name
, "___XVL") != NULL
;
7987 /* The index of the variant field of TYPE, or -1 if TYPE does not
7988 represent a variant record type. */
7991 variant_field_index (struct type
*type
)
7995 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
7998 for (f
= 0; f
< type
->num_fields (); f
+= 1)
8000 if (ada_is_variant_part (type
, f
))
8006 /* A record type with no fields. */
8008 static struct type
*
8009 empty_record (struct type
*templ
)
8011 struct type
*type
= alloc_type_copy (templ
);
8013 type
->set_code (TYPE_CODE_STRUCT
);
8014 INIT_NONE_SPECIFIC (type
);
8015 type
->set_name ("<empty>");
8016 TYPE_LENGTH (type
) = 0;
8020 /* An ordinary record type (with fixed-length fields) that describes
8021 the value of type TYPE at VALADDR or ADDRESS (see comments at
8022 the beginning of this section) VAL according to GNAT conventions.
8023 DVAL0 should describe the (portion of a) record that contains any
8024 necessary discriminants. It should be NULL if value_type (VAL) is
8025 an outer-level type (i.e., as opposed to a branch of a variant.) A
8026 variant field (unless unchecked) is replaced by a particular branch
8029 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8030 length are not statically known are discarded. As a consequence,
8031 VALADDR, ADDRESS and DVAL0 are ignored.
8033 NOTE: Limitations: For now, we assume that dynamic fields and
8034 variants occupy whole numbers of bytes. However, they need not be
8038 ada_template_to_fixed_record_type_1 (struct type
*type
,
8039 const gdb_byte
*valaddr
,
8040 CORE_ADDR address
, struct value
*dval0
,
8041 int keep_dynamic_fields
)
8043 struct value
*mark
= value_mark ();
8046 int nfields
, bit_len
;
8052 /* Compute the number of fields in this record type that are going
8053 to be processed: unless keep_dynamic_fields, this includes only
8054 fields whose position and length are static will be processed. */
8055 if (keep_dynamic_fields
)
8056 nfields
= type
->num_fields ();
8060 while (nfields
< type
->num_fields ()
8061 && !ada_is_variant_part (type
, nfields
)
8062 && !is_dynamic_field (type
, nfields
))
8066 rtype
= alloc_type_copy (type
);
8067 rtype
->set_code (TYPE_CODE_STRUCT
);
8068 INIT_NONE_SPECIFIC (rtype
);
8069 rtype
->set_num_fields (nfields
);
8071 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
8072 rtype
->set_name (ada_type_name (type
));
8073 TYPE_FIXED_INSTANCE (rtype
) = 1;
8079 for (f
= 0; f
< nfields
; f
+= 1)
8081 off
= align_up (off
, field_alignment (type
, f
))
8082 + TYPE_FIELD_BITPOS (type
, f
);
8083 SET_FIELD_BITPOS (rtype
->field (f
), off
);
8084 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8086 if (ada_is_variant_part (type
, f
))
8091 else if (is_dynamic_field (type
, f
))
8093 const gdb_byte
*field_valaddr
= valaddr
;
8094 CORE_ADDR field_address
= address
;
8095 struct type
*field_type
=
8096 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8100 /* rtype's length is computed based on the run-time
8101 value of discriminants. If the discriminants are not
8102 initialized, the type size may be completely bogus and
8103 GDB may fail to allocate a value for it. So check the
8104 size first before creating the value. */
8105 ada_ensure_varsize_limit (rtype
);
8106 /* Using plain value_from_contents_and_address here
8107 causes problems because we will end up trying to
8108 resolve a type that is currently being
8110 dval
= value_from_contents_and_address_unresolved (rtype
,
8113 rtype
= value_type (dval
);
8118 /* If the type referenced by this field is an aligner type, we need
8119 to unwrap that aligner type, because its size might not be set.
8120 Keeping the aligner type would cause us to compute the wrong
8121 size for this field, impacting the offset of the all the fields
8122 that follow this one. */
8123 if (ada_is_aligner_type (field_type
))
8125 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8127 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8128 field_address
= cond_offset_target (field_address
, field_offset
);
8129 field_type
= ada_aligned_type (field_type
);
8132 field_valaddr
= cond_offset_host (field_valaddr
,
8133 off
/ TARGET_CHAR_BIT
);
8134 field_address
= cond_offset_target (field_address
,
8135 off
/ TARGET_CHAR_BIT
);
8137 /* Get the fixed type of the field. Note that, in this case,
8138 we do not want to get the real type out of the tag: if
8139 the current field is the parent part of a tagged record,
8140 we will get the tag of the object. Clearly wrong: the real
8141 type of the parent is not the real type of the child. We
8142 would end up in an infinite loop. */
8143 field_type
= ada_get_base_type (field_type
);
8144 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8145 field_address
, dval
, 0);
8146 /* If the field size is already larger than the maximum
8147 object size, then the record itself will necessarily
8148 be larger than the maximum object size. We need to make
8149 this check now, because the size might be so ridiculously
8150 large (due to an uninitialized variable in the inferior)
8151 that it would cause an overflow when adding it to the
8153 ada_ensure_varsize_limit (field_type
);
8155 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8156 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8157 /* The multiplication can potentially overflow. But because
8158 the field length has been size-checked just above, and
8159 assuming that the maximum size is a reasonable value,
8160 an overflow should not happen in practice. So rather than
8161 adding overflow recovery code to this already complex code,
8162 we just assume that it's not going to happen. */
8164 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8168 /* Note: If this field's type is a typedef, it is important
8169 to preserve the typedef layer.
8171 Otherwise, we might be transforming a typedef to a fat
8172 pointer (encoding a pointer to an unconstrained array),
8173 into a basic fat pointer (encoding an unconstrained
8174 array). As both types are implemented using the same
8175 structure, the typedef is the only clue which allows us
8176 to distinguish between the two options. Stripping it
8177 would prevent us from printing this field appropriately. */
8178 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8179 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8180 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8182 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8185 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8187 /* We need to be careful of typedefs when computing
8188 the length of our field. If this is a typedef,
8189 get the length of the target type, not the length
8191 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
8192 field_type
= ada_typedef_target_type (field_type
);
8195 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8198 if (off
+ fld_bit_len
> bit_len
)
8199 bit_len
= off
+ fld_bit_len
;
8201 TYPE_LENGTH (rtype
) =
8202 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8205 /* We handle the variant part, if any, at the end because of certain
8206 odd cases in which it is re-ordered so as NOT to be the last field of
8207 the record. This can happen in the presence of representation
8209 if (variant_field
>= 0)
8211 struct type
*branch_type
;
8213 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8217 /* Using plain value_from_contents_and_address here causes
8218 problems because we will end up trying to resolve a type
8219 that is currently being constructed. */
8220 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8222 rtype
= value_type (dval
);
8228 to_fixed_variant_branch_type
8229 (TYPE_FIELD_TYPE (type
, variant_field
),
8230 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8231 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8232 if (branch_type
== NULL
)
8234 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
8235 rtype
->field (f
- 1) = rtype
->field (f
);
8236 rtype
->set_num_fields (rtype
->num_fields () - 1);
8240 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8241 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8243 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8245 if (off
+ fld_bit_len
> bit_len
)
8246 bit_len
= off
+ fld_bit_len
;
8247 TYPE_LENGTH (rtype
) =
8248 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8252 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8253 should contain the alignment of that record, which should be a strictly
8254 positive value. If null or negative, then something is wrong, most
8255 probably in the debug info. In that case, we don't round up the size
8256 of the resulting type. If this record is not part of another structure,
8257 the current RTYPE length might be good enough for our purposes. */
8258 if (TYPE_LENGTH (type
) <= 0)
8261 warning (_("Invalid type size for `%s' detected: %s."),
8262 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
8264 warning (_("Invalid type size for <unnamed> detected: %s."),
8265 pulongest (TYPE_LENGTH (type
)));
8269 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
8270 TYPE_LENGTH (type
));
8273 value_free_to_mark (mark
);
8274 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8275 error (_("record type with dynamic size is larger than varsize-limit"));
8279 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8282 static struct type
*
8283 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8284 CORE_ADDR address
, struct value
*dval0
)
8286 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8290 /* An ordinary record type in which ___XVL-convention fields and
8291 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8292 static approximations, containing all possible fields. Uses
8293 no runtime values. Useless for use in values, but that's OK,
8294 since the results are used only for type determinations. Works on both
8295 structs and unions. Representation note: to save space, we memorize
8296 the result of this function in the TYPE_TARGET_TYPE of the
8299 static struct type
*
8300 template_to_static_fixed_type (struct type
*type0
)
8306 /* No need no do anything if the input type is already fixed. */
8307 if (TYPE_FIXED_INSTANCE (type0
))
8310 /* Likewise if we already have computed the static approximation. */
8311 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8312 return TYPE_TARGET_TYPE (type0
);
8314 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8316 nfields
= type0
->num_fields ();
8318 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8319 recompute all over next time. */
8320 TYPE_TARGET_TYPE (type0
) = type
;
8322 for (f
= 0; f
< nfields
; f
+= 1)
8324 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8325 struct type
*new_type
;
8327 if (is_dynamic_field (type0
, f
))
8329 field_type
= ada_check_typedef (field_type
);
8330 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8333 new_type
= static_unwrap_type (field_type
);
8335 if (new_type
!= field_type
)
8337 /* Clone TYPE0 only the first time we get a new field type. */
8340 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8341 type
->set_code (type0
->code ());
8342 INIT_NONE_SPECIFIC (type
);
8343 type
->set_num_fields (nfields
);
8347 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
8348 memcpy (fields
, type0
->fields (),
8349 sizeof (struct field
) * nfields
);
8350 type
->set_fields (fields
);
8352 type
->set_name (ada_type_name (type0
));
8353 TYPE_FIXED_INSTANCE (type
) = 1;
8354 TYPE_LENGTH (type
) = 0;
8356 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8357 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8364 /* Given an object of type TYPE whose contents are at VALADDR and
8365 whose address in memory is ADDRESS, returns a revision of TYPE,
8366 which should be a non-dynamic-sized record, in which the variant
8367 part, if any, is replaced with the appropriate branch. Looks
8368 for discriminant values in DVAL0, which can be NULL if the record
8369 contains the necessary discriminant values. */
8371 static struct type
*
8372 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8373 CORE_ADDR address
, struct value
*dval0
)
8375 struct value
*mark
= value_mark ();
8378 struct type
*branch_type
;
8379 int nfields
= type
->num_fields ();
8380 int variant_field
= variant_field_index (type
);
8382 if (variant_field
== -1)
8387 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8388 type
= value_type (dval
);
8393 rtype
= alloc_type_copy (type
);
8394 rtype
->set_code (TYPE_CODE_STRUCT
);
8395 INIT_NONE_SPECIFIC (rtype
);
8396 rtype
->set_num_fields (nfields
);
8399 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8400 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
8401 rtype
->set_fields (fields
);
8403 rtype
->set_name (ada_type_name (type
));
8404 TYPE_FIXED_INSTANCE (rtype
) = 1;
8405 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8407 branch_type
= to_fixed_variant_branch_type
8408 (TYPE_FIELD_TYPE (type
, variant_field
),
8409 cond_offset_host (valaddr
,
8410 TYPE_FIELD_BITPOS (type
, variant_field
)
8412 cond_offset_target (address
,
8413 TYPE_FIELD_BITPOS (type
, variant_field
)
8414 / TARGET_CHAR_BIT
), dval
);
8415 if (branch_type
== NULL
)
8419 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8420 rtype
->field (f
- 1) = rtype
->field (f
);
8421 rtype
->set_num_fields (rtype
->num_fields () - 1);
8425 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8426 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8427 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8428 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8430 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8432 value_free_to_mark (mark
);
8436 /* An ordinary record type (with fixed-length fields) that describes
8437 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8438 beginning of this section]. Any necessary discriminants' values
8439 should be in DVAL, a record value; it may be NULL if the object
8440 at ADDR itself contains any necessary discriminant values.
8441 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8442 values from the record are needed. Except in the case that DVAL,
8443 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8444 unchecked) is replaced by a particular branch of the variant.
8446 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8447 is questionable and may be removed. It can arise during the
8448 processing of an unconstrained-array-of-record type where all the
8449 variant branches have exactly the same size. This is because in
8450 such cases, the compiler does not bother to use the XVS convention
8451 when encoding the record. I am currently dubious of this
8452 shortcut and suspect the compiler should be altered. FIXME. */
8454 static struct type
*
8455 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8456 CORE_ADDR address
, struct value
*dval
)
8458 struct type
*templ_type
;
8460 if (TYPE_FIXED_INSTANCE (type0
))
8463 templ_type
= dynamic_template_type (type0
);
8465 if (templ_type
!= NULL
)
8466 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8467 else if (variant_field_index (type0
) >= 0)
8469 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8471 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8476 TYPE_FIXED_INSTANCE (type0
) = 1;
8482 /* An ordinary record type (with fixed-length fields) that describes
8483 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8484 union type. Any necessary discriminants' values should be in DVAL,
8485 a record value. That is, this routine selects the appropriate
8486 branch of the union at ADDR according to the discriminant value
8487 indicated in the union's type name. Returns VAR_TYPE0 itself if
8488 it represents a variant subject to a pragma Unchecked_Union. */
8490 static struct type
*
8491 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8492 CORE_ADDR address
, struct value
*dval
)
8495 struct type
*templ_type
;
8496 struct type
*var_type
;
8498 if (var_type0
->code () == TYPE_CODE_PTR
)
8499 var_type
= TYPE_TARGET_TYPE (var_type0
);
8501 var_type
= var_type0
;
8503 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8505 if (templ_type
!= NULL
)
8506 var_type
= templ_type
;
8508 if (is_unchecked_variant (var_type
, value_type (dval
)))
8510 which
= ada_which_variant_applies (var_type
, dval
);
8513 return empty_record (var_type
);
8514 else if (is_dynamic_field (var_type
, which
))
8515 return to_fixed_record_type
8516 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8517 valaddr
, address
, dval
);
8518 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8520 to_fixed_record_type
8521 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8523 return TYPE_FIELD_TYPE (var_type
, which
);
8526 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8527 ENCODING_TYPE, a type following the GNAT conventions for discrete
8528 type encodings, only carries redundant information. */
8531 ada_is_redundant_range_encoding (struct type
*range_type
,
8532 struct type
*encoding_type
)
8534 const char *bounds_str
;
8538 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8540 if (get_base_type (range_type
)->code ()
8541 != get_base_type (encoding_type
)->code ())
8543 /* The compiler probably used a simple base type to describe
8544 the range type instead of the range's actual base type,
8545 expecting us to get the real base type from the encoding
8546 anyway. In this situation, the encoding cannot be ignored
8551 if (is_dynamic_type (range_type
))
8554 if (encoding_type
->name () == NULL
)
8557 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8558 if (bounds_str
== NULL
)
8561 n
= 8; /* Skip "___XDLU_". */
8562 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8564 if (TYPE_LOW_BOUND (range_type
) != lo
)
8567 n
+= 2; /* Skip the "__" separator between the two bounds. */
8568 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8570 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8576 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8577 a type following the GNAT encoding for describing array type
8578 indices, only carries redundant information. */
8581 ada_is_redundant_index_type_desc (struct type
*array_type
,
8582 struct type
*desc_type
)
8584 struct type
*this_layer
= check_typedef (array_type
);
8587 for (i
= 0; i
< desc_type
->num_fields (); i
++)
8589 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8590 TYPE_FIELD_TYPE (desc_type
, i
)))
8592 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8598 /* Assuming that TYPE0 is an array type describing the type of a value
8599 at ADDR, and that DVAL describes a record containing any
8600 discriminants used in TYPE0, returns a type for the value that
8601 contains no dynamic components (that is, no components whose sizes
8602 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8603 true, gives an error message if the resulting type's size is over
8606 static struct type
*
8607 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8610 struct type
*index_type_desc
;
8611 struct type
*result
;
8612 int constrained_packed_array_p
;
8613 static const char *xa_suffix
= "___XA";
8615 type0
= ada_check_typedef (type0
);
8616 if (TYPE_FIXED_INSTANCE (type0
))
8619 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8620 if (constrained_packed_array_p
)
8621 type0
= decode_constrained_packed_array_type (type0
);
8623 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8625 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8626 encoding suffixed with 'P' may still be generated. If so,
8627 it should be used to find the XA type. */
8629 if (index_type_desc
== NULL
)
8631 const char *type_name
= ada_type_name (type0
);
8633 if (type_name
!= NULL
)
8635 const int len
= strlen (type_name
);
8636 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8638 if (type_name
[len
- 1] == 'P')
8640 strcpy (name
, type_name
);
8641 strcpy (name
+ len
- 1, xa_suffix
);
8642 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8647 ada_fixup_array_indexes_type (index_type_desc
);
8648 if (index_type_desc
!= NULL
8649 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8651 /* Ignore this ___XA parallel type, as it does not bring any
8652 useful information. This allows us to avoid creating fixed
8653 versions of the array's index types, which would be identical
8654 to the original ones. This, in turn, can also help avoid
8655 the creation of fixed versions of the array itself. */
8656 index_type_desc
= NULL
;
8659 if (index_type_desc
== NULL
)
8661 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8663 /* NOTE: elt_type---the fixed version of elt_type0---should never
8664 depend on the contents of the array in properly constructed
8666 /* Create a fixed version of the array element type.
8667 We're not providing the address of an element here,
8668 and thus the actual object value cannot be inspected to do
8669 the conversion. This should not be a problem, since arrays of
8670 unconstrained objects are not allowed. In particular, all
8671 the elements of an array of a tagged type should all be of
8672 the same type specified in the debugging info. No need to
8673 consult the object tag. */
8674 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8676 /* Make sure we always create a new array type when dealing with
8677 packed array types, since we're going to fix-up the array
8678 type length and element bitsize a little further down. */
8679 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8682 result
= create_array_type (alloc_type_copy (type0
),
8683 elt_type
, TYPE_INDEX_TYPE (type0
));
8688 struct type
*elt_type0
;
8691 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8692 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8694 /* NOTE: result---the fixed version of elt_type0---should never
8695 depend on the contents of the array in properly constructed
8697 /* Create a fixed version of the array element type.
8698 We're not providing the address of an element here,
8699 and thus the actual object value cannot be inspected to do
8700 the conversion. This should not be a problem, since arrays of
8701 unconstrained objects are not allowed. In particular, all
8702 the elements of an array of a tagged type should all be of
8703 the same type specified in the debugging info. No need to
8704 consult the object tag. */
8706 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8709 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8711 struct type
*range_type
=
8712 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8714 result
= create_array_type (alloc_type_copy (elt_type0
),
8715 result
, range_type
);
8716 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8718 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8719 error (_("array type with dynamic size is larger than varsize-limit"));
8722 /* We want to preserve the type name. This can be useful when
8723 trying to get the type name of a value that has already been
8724 printed (for instance, if the user did "print VAR; whatis $". */
8725 result
->set_name (type0
->name ());
8727 if (constrained_packed_array_p
)
8729 /* So far, the resulting type has been created as if the original
8730 type was a regular (non-packed) array type. As a result, the
8731 bitsize of the array elements needs to be set again, and the array
8732 length needs to be recomputed based on that bitsize. */
8733 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8734 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8736 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8737 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8738 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8739 TYPE_LENGTH (result
)++;
8742 TYPE_FIXED_INSTANCE (result
) = 1;
8747 /* A standard type (containing no dynamically sized components)
8748 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8749 DVAL describes a record containing any discriminants used in TYPE0,
8750 and may be NULL if there are none, or if the object of type TYPE at
8751 ADDRESS or in VALADDR contains these discriminants.
8753 If CHECK_TAG is not null, in the case of tagged types, this function
8754 attempts to locate the object's tag and use it to compute the actual
8755 type. However, when ADDRESS is null, we cannot use it to determine the
8756 location of the tag, and therefore compute the tagged type's actual type.
8757 So we return the tagged type without consulting the tag. */
8759 static struct type
*
8760 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8761 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8763 type
= ada_check_typedef (type
);
8765 /* Only un-fixed types need to be handled here. */
8766 if (!HAVE_GNAT_AUX_INFO (type
))
8769 switch (type
->code ())
8773 case TYPE_CODE_STRUCT
:
8775 struct type
*static_type
= to_static_fixed_type (type
);
8776 struct type
*fixed_record_type
=
8777 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8779 /* If STATIC_TYPE is a tagged type and we know the object's address,
8780 then we can determine its tag, and compute the object's actual
8781 type from there. Note that we have to use the fixed record
8782 type (the parent part of the record may have dynamic fields
8783 and the way the location of _tag is expressed may depend on
8786 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8789 value_tag_from_contents_and_address
8793 struct type
*real_type
= type_from_tag (tag
);
8795 value_from_contents_and_address (fixed_record_type
,
8798 fixed_record_type
= value_type (obj
);
8799 if (real_type
!= NULL
)
8800 return to_fixed_record_type
8802 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8805 /* Check to see if there is a parallel ___XVZ variable.
8806 If there is, then it provides the actual size of our type. */
8807 else if (ada_type_name (fixed_record_type
) != NULL
)
8809 const char *name
= ada_type_name (fixed_record_type
);
8811 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8812 bool xvz_found
= false;
8815 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8818 xvz_found
= get_int_var_value (xvz_name
, size
);
8820 catch (const gdb_exception_error
&except
)
8822 /* We found the variable, but somehow failed to read
8823 its value. Rethrow the same error, but with a little
8824 bit more information, to help the user understand
8825 what went wrong (Eg: the variable might have been
8827 throw_error (except
.error
,
8828 _("unable to read value of %s (%s)"),
8829 xvz_name
, except
.what ());
8832 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8834 fixed_record_type
= copy_type (fixed_record_type
);
8835 TYPE_LENGTH (fixed_record_type
) = size
;
8837 /* The FIXED_RECORD_TYPE may have be a stub. We have
8838 observed this when the debugging info is STABS, and
8839 apparently it is something that is hard to fix.
8841 In practice, we don't need the actual type definition
8842 at all, because the presence of the XVZ variable allows us
8843 to assume that there must be a XVS type as well, which we
8844 should be able to use later, when we need the actual type
8847 In the meantime, pretend that the "fixed" type we are
8848 returning is NOT a stub, because this can cause trouble
8849 when using this type to create new types targeting it.
8850 Indeed, the associated creation routines often check
8851 whether the target type is a stub and will try to replace
8852 it, thus using a type with the wrong size. This, in turn,
8853 might cause the new type to have the wrong size too.
8854 Consider the case of an array, for instance, where the size
8855 of the array is computed from the number of elements in
8856 our array multiplied by the size of its element. */
8857 TYPE_STUB (fixed_record_type
) = 0;
8860 return fixed_record_type
;
8862 case TYPE_CODE_ARRAY
:
8863 return to_fixed_array_type (type
, dval
, 1);
8864 case TYPE_CODE_UNION
:
8868 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8872 /* The same as ada_to_fixed_type_1, except that it preserves the type
8873 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8875 The typedef layer needs be preserved in order to differentiate between
8876 arrays and array pointers when both types are implemented using the same
8877 fat pointer. In the array pointer case, the pointer is encoded as
8878 a typedef of the pointer type. For instance, considering:
8880 type String_Access is access String;
8881 S1 : String_Access := null;
8883 To the debugger, S1 is defined as a typedef of type String. But
8884 to the user, it is a pointer. So if the user tries to print S1,
8885 we should not dereference the array, but print the array address
8888 If we didn't preserve the typedef layer, we would lose the fact that
8889 the type is to be presented as a pointer (needs de-reference before
8890 being printed). And we would also use the source-level type name. */
8893 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8894 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8897 struct type
*fixed_type
=
8898 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8900 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8901 then preserve the typedef layer.
8903 Implementation note: We can only check the main-type portion of
8904 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8905 from TYPE now returns a type that has the same instance flags
8906 as TYPE. For instance, if TYPE is a "typedef const", and its
8907 target type is a "struct", then the typedef elimination will return
8908 a "const" version of the target type. See check_typedef for more
8909 details about how the typedef layer elimination is done.
8911 brobecker/2010-11-19: It seems to me that the only case where it is
8912 useful to preserve the typedef layer is when dealing with fat pointers.
8913 Perhaps, we could add a check for that and preserve the typedef layer
8914 only in that situation. But this seems unnecessary so far, probably
8915 because we call check_typedef/ada_check_typedef pretty much everywhere.
8917 if (type
->code () == TYPE_CODE_TYPEDEF
8918 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8919 == TYPE_MAIN_TYPE (fixed_type
)))
8925 /* A standard (static-sized) type corresponding as well as possible to
8926 TYPE0, but based on no runtime data. */
8928 static struct type
*
8929 to_static_fixed_type (struct type
*type0
)
8936 if (TYPE_FIXED_INSTANCE (type0
))
8939 type0
= ada_check_typedef (type0
);
8941 switch (type0
->code ())
8945 case TYPE_CODE_STRUCT
:
8946 type
= dynamic_template_type (type0
);
8948 return template_to_static_fixed_type (type
);
8950 return template_to_static_fixed_type (type0
);
8951 case TYPE_CODE_UNION
:
8952 type
= ada_find_parallel_type (type0
, "___XVU");
8954 return template_to_static_fixed_type (type
);
8956 return template_to_static_fixed_type (type0
);
8960 /* A static approximation of TYPE with all type wrappers removed. */
8962 static struct type
*
8963 static_unwrap_type (struct type
*type
)
8965 if (ada_is_aligner_type (type
))
8967 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8968 if (ada_type_name (type1
) == NULL
)
8969 type1
->set_name (ada_type_name (type
));
8971 return static_unwrap_type (type1
);
8975 struct type
*raw_real_type
= ada_get_base_type (type
);
8977 if (raw_real_type
== type
)
8980 return to_static_fixed_type (raw_real_type
);
8984 /* In some cases, incomplete and private types require
8985 cross-references that are not resolved as records (for example,
8987 type FooP is access Foo;
8989 type Foo is array ...;
8990 ). In these cases, since there is no mechanism for producing
8991 cross-references to such types, we instead substitute for FooP a
8992 stub enumeration type that is nowhere resolved, and whose tag is
8993 the name of the actual type. Call these types "non-record stubs". */
8995 /* A type equivalent to TYPE that is not a non-record stub, if one
8996 exists, otherwise TYPE. */
8999 ada_check_typedef (struct type
*type
)
9004 /* If our type is an access to an unconstrained array, which is encoded
9005 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
9006 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9007 what allows us to distinguish between fat pointers that represent
9008 array types, and fat pointers that represent array access types
9009 (in both cases, the compiler implements them as fat pointers). */
9010 if (ada_is_access_to_unconstrained_array (type
))
9013 type
= check_typedef (type
);
9014 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
9015 || !TYPE_STUB (type
)
9016 || type
->name () == NULL
)
9020 const char *name
= type
->name ();
9021 struct type
*type1
= ada_find_any_type (name
);
9026 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9027 stubs pointing to arrays, as we don't create symbols for array
9028 types, only for the typedef-to-array types). If that's the case,
9029 strip the typedef layer. */
9030 if (type1
->code () == TYPE_CODE_TYPEDEF
)
9031 type1
= ada_check_typedef (type1
);
9037 /* A value representing the data at VALADDR/ADDRESS as described by
9038 type TYPE0, but with a standard (static-sized) type that correctly
9039 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9040 type, then return VAL0 [this feature is simply to avoid redundant
9041 creation of struct values]. */
9043 static struct value
*
9044 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
9047 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
9049 if (type
== type0
&& val0
!= NULL
)
9052 if (VALUE_LVAL (val0
) != lval_memory
)
9054 /* Our value does not live in memory; it could be a convenience
9055 variable, for instance. Create a not_lval value using val0's
9057 return value_from_contents (type
, value_contents (val0
));
9060 return value_from_contents_and_address (type
, 0, address
);
9063 /* A value representing VAL, but with a standard (static-sized) type
9064 that correctly describes it. Does not necessarily create a new
9068 ada_to_fixed_value (struct value
*val
)
9070 val
= unwrap_value (val
);
9071 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
9078 /* Table mapping attribute numbers to names.
9079 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9081 static const char *attribute_names
[] = {
9099 ada_attribute_name (enum exp_opcode n
)
9101 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9102 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9104 return attribute_names
[0];
9107 /* Evaluate the 'POS attribute applied to ARG. */
9110 pos_atr (struct value
*arg
)
9112 struct value
*val
= coerce_ref (arg
);
9113 struct type
*type
= value_type (val
);
9116 if (!discrete_type_p (type
))
9117 error (_("'POS only defined on discrete types"));
9119 if (!discrete_position (type
, value_as_long (val
), &result
))
9120 error (_("enumeration value is invalid: can't find 'POS"));
9125 static struct value
*
9126 value_pos_atr (struct type
*type
, struct value
*arg
)
9128 return value_from_longest (type
, pos_atr (arg
));
9131 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9133 static struct value
*
9134 val_atr (struct type
*type
, LONGEST val
)
9136 gdb_assert (discrete_type_p (type
));
9137 if (type
->code () == TYPE_CODE_RANGE
)
9138 type
= TYPE_TARGET_TYPE (type
);
9139 if (type
->code () == TYPE_CODE_ENUM
)
9141 if (val
< 0 || val
>= type
->num_fields ())
9142 error (_("argument to 'VAL out of range"));
9143 val
= TYPE_FIELD_ENUMVAL (type
, val
);
9145 return value_from_longest (type
, val
);
9148 static struct value
*
9149 value_val_atr (struct type
*type
, struct value
*arg
)
9151 if (!discrete_type_p (type
))
9152 error (_("'VAL only defined on discrete types"));
9153 if (!integer_type_p (value_type (arg
)))
9154 error (_("'VAL requires integral argument"));
9156 return val_atr (type
, value_as_long (arg
));
9162 /* True if TYPE appears to be an Ada character type.
9163 [At the moment, this is true only for Character and Wide_Character;
9164 It is a heuristic test that could stand improvement]. */
9167 ada_is_character_type (struct type
*type
)
9171 /* If the type code says it's a character, then assume it really is,
9172 and don't check any further. */
9173 if (type
->code () == TYPE_CODE_CHAR
)
9176 /* Otherwise, assume it's a character type iff it is a discrete type
9177 with a known character type name. */
9178 name
= ada_type_name (type
);
9179 return (name
!= NULL
9180 && (type
->code () == TYPE_CODE_INT
9181 || type
->code () == TYPE_CODE_RANGE
)
9182 && (strcmp (name
, "character") == 0
9183 || strcmp (name
, "wide_character") == 0
9184 || strcmp (name
, "wide_wide_character") == 0
9185 || strcmp (name
, "unsigned char") == 0));
9188 /* True if TYPE appears to be an Ada string type. */
9191 ada_is_string_type (struct type
*type
)
9193 type
= ada_check_typedef (type
);
9195 && type
->code () != TYPE_CODE_PTR
9196 && (ada_is_simple_array_type (type
)
9197 || ada_is_array_descriptor_type (type
))
9198 && ada_array_arity (type
) == 1)
9200 struct type
*elttype
= ada_array_element_type (type
, 1);
9202 return ada_is_character_type (elttype
);
9208 /* The compiler sometimes provides a parallel XVS type for a given
9209 PAD type. Normally, it is safe to follow the PAD type directly,
9210 but older versions of the compiler have a bug that causes the offset
9211 of its "F" field to be wrong. Following that field in that case
9212 would lead to incorrect results, but this can be worked around
9213 by ignoring the PAD type and using the associated XVS type instead.
9215 Set to True if the debugger should trust the contents of PAD types.
9216 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9217 static bool trust_pad_over_xvs
= true;
9219 /* True if TYPE is a struct type introduced by the compiler to force the
9220 alignment of a value. Such types have a single field with a
9221 distinctive name. */
9224 ada_is_aligner_type (struct type
*type
)
9226 type
= ada_check_typedef (type
);
9228 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9231 return (type
->code () == TYPE_CODE_STRUCT
9232 && type
->num_fields () == 1
9233 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9236 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9237 the parallel type. */
9240 ada_get_base_type (struct type
*raw_type
)
9242 struct type
*real_type_namer
;
9243 struct type
*raw_real_type
;
9245 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
9248 if (ada_is_aligner_type (raw_type
))
9249 /* The encoding specifies that we should always use the aligner type.
9250 So, even if this aligner type has an associated XVS type, we should
9253 According to the compiler gurus, an XVS type parallel to an aligner
9254 type may exist because of a stabs limitation. In stabs, aligner
9255 types are empty because the field has a variable-sized type, and
9256 thus cannot actually be used as an aligner type. As a result,
9257 we need the associated parallel XVS type to decode the type.
9258 Since the policy in the compiler is to not change the internal
9259 representation based on the debugging info format, we sometimes
9260 end up having a redundant XVS type parallel to the aligner type. */
9263 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9264 if (real_type_namer
== NULL
9265 || real_type_namer
->code () != TYPE_CODE_STRUCT
9266 || real_type_namer
->num_fields () != 1)
9269 if (TYPE_FIELD_TYPE (real_type_namer
, 0)->code () != TYPE_CODE_REF
)
9271 /* This is an older encoding form where the base type needs to be
9272 looked up by name. We prefer the newer encoding because it is
9274 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9275 if (raw_real_type
== NULL
)
9278 return raw_real_type
;
9281 /* The field in our XVS type is a reference to the base type. */
9282 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9285 /* The type of value designated by TYPE, with all aligners removed. */
9288 ada_aligned_type (struct type
*type
)
9290 if (ada_is_aligner_type (type
))
9291 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9293 return ada_get_base_type (type
);
9297 /* The address of the aligned value in an object at address VALADDR
9298 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9301 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9303 if (ada_is_aligner_type (type
))
9304 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9306 TYPE_FIELD_BITPOS (type
,
9307 0) / TARGET_CHAR_BIT
);
9314 /* The printed representation of an enumeration literal with encoded
9315 name NAME. The value is good to the next call of ada_enum_name. */
9317 ada_enum_name (const char *name
)
9319 static char *result
;
9320 static size_t result_len
= 0;
9323 /* First, unqualify the enumeration name:
9324 1. Search for the last '.' character. If we find one, then skip
9325 all the preceding characters, the unqualified name starts
9326 right after that dot.
9327 2. Otherwise, we may be debugging on a target where the compiler
9328 translates dots into "__". Search forward for double underscores,
9329 but stop searching when we hit an overloading suffix, which is
9330 of the form "__" followed by digits. */
9332 tmp
= strrchr (name
, '.');
9337 while ((tmp
= strstr (name
, "__")) != NULL
)
9339 if (isdigit (tmp
[2]))
9350 if (name
[1] == 'U' || name
[1] == 'W')
9352 if (sscanf (name
+ 2, "%x", &v
) != 1)
9355 else if (((name
[1] >= '0' && name
[1] <= '9')
9356 || (name
[1] >= 'a' && name
[1] <= 'z'))
9359 GROW_VECT (result
, result_len
, 4);
9360 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9366 GROW_VECT (result
, result_len
, 16);
9367 if (isascii (v
) && isprint (v
))
9368 xsnprintf (result
, result_len
, "'%c'", v
);
9369 else if (name
[1] == 'U')
9370 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9372 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9378 tmp
= strstr (name
, "__");
9380 tmp
= strstr (name
, "$");
9383 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9384 strncpy (result
, name
, tmp
- name
);
9385 result
[tmp
- name
] = '\0';
9393 /* Evaluate the subexpression of EXP starting at *POS as for
9394 evaluate_type, updating *POS to point just past the evaluated
9397 static struct value
*
9398 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9400 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9403 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9406 static struct value
*
9407 unwrap_value (struct value
*val
)
9409 struct type
*type
= ada_check_typedef (value_type (val
));
9411 if (ada_is_aligner_type (type
))
9413 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9414 struct type
*val_type
= ada_check_typedef (value_type (v
));
9416 if (ada_type_name (val_type
) == NULL
)
9417 val_type
->set_name (ada_type_name (type
));
9419 return unwrap_value (v
);
9423 struct type
*raw_real_type
=
9424 ada_check_typedef (ada_get_base_type (type
));
9426 /* If there is no parallel XVS or XVE type, then the value is
9427 already unwrapped. Return it without further modification. */
9428 if ((type
== raw_real_type
)
9429 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9433 coerce_unspec_val_to_type
9434 (val
, ada_to_fixed_type (raw_real_type
, 0,
9435 value_address (val
),
9440 static struct value
*
9441 cast_from_fixed (struct type
*type
, struct value
*arg
)
9443 struct value
*scale
= ada_scaling_factor (value_type (arg
));
9444 arg
= value_cast (value_type (scale
), arg
);
9446 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9447 return value_cast (type
, arg
);
9450 static struct value
*
9451 cast_to_fixed (struct type
*type
, struct value
*arg
)
9453 if (type
== value_type (arg
))
9456 struct value
*scale
= ada_scaling_factor (type
);
9457 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg
)))
9458 arg
= cast_from_fixed (value_type (scale
), arg
);
9460 arg
= value_cast (value_type (scale
), arg
);
9462 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9463 return value_cast (type
, arg
);
9466 /* Given two array types T1 and T2, return nonzero iff both arrays
9467 contain the same number of elements. */
9470 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9472 LONGEST lo1
, hi1
, lo2
, hi2
;
9474 /* Get the array bounds in order to verify that the size of
9475 the two arrays match. */
9476 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9477 || !get_array_bounds (t2
, &lo2
, &hi2
))
9478 error (_("unable to determine array bounds"));
9480 /* To make things easier for size comparison, normalize a bit
9481 the case of empty arrays by making sure that the difference
9482 between upper bound and lower bound is always -1. */
9488 return (hi1
- lo1
== hi2
- lo2
);
9491 /* Assuming that VAL is an array of integrals, and TYPE represents
9492 an array with the same number of elements, but with wider integral
9493 elements, return an array "casted" to TYPE. In practice, this
9494 means that the returned array is built by casting each element
9495 of the original array into TYPE's (wider) element type. */
9497 static struct value
*
9498 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9500 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9505 /* Verify that both val and type are arrays of scalars, and
9506 that the size of val's elements is smaller than the size
9507 of type's element. */
9508 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9509 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9510 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9511 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9512 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9513 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9515 if (!get_array_bounds (type
, &lo
, &hi
))
9516 error (_("unable to determine array bounds"));
9518 res
= allocate_value (type
);
9520 /* Promote each array element. */
9521 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9523 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9525 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9526 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9532 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9533 return the converted value. */
9535 static struct value
*
9536 coerce_for_assign (struct type
*type
, struct value
*val
)
9538 struct type
*type2
= value_type (val
);
9543 type2
= ada_check_typedef (type2
);
9544 type
= ada_check_typedef (type
);
9546 if (type2
->code () == TYPE_CODE_PTR
9547 && type
->code () == TYPE_CODE_ARRAY
)
9549 val
= ada_value_ind (val
);
9550 type2
= value_type (val
);
9553 if (type2
->code () == TYPE_CODE_ARRAY
9554 && type
->code () == TYPE_CODE_ARRAY
)
9556 if (!ada_same_array_size_p (type
, type2
))
9557 error (_("cannot assign arrays of different length"));
9559 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9560 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9561 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9562 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9564 /* Allow implicit promotion of the array elements to
9566 return ada_promote_array_of_integrals (type
, val
);
9569 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9570 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9571 error (_("Incompatible types in assignment"));
9572 deprecated_set_value_type (val
, type
);
9577 static struct value
*
9578 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9581 struct type
*type1
, *type2
;
9584 arg1
= coerce_ref (arg1
);
9585 arg2
= coerce_ref (arg2
);
9586 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9587 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9589 if (type1
->code () != TYPE_CODE_INT
9590 || type2
->code () != TYPE_CODE_INT
)
9591 return value_binop (arg1
, arg2
, op
);
9600 return value_binop (arg1
, arg2
, op
);
9603 v2
= value_as_long (arg2
);
9605 error (_("second operand of %s must not be zero."), op_string (op
));
9607 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9608 return value_binop (arg1
, arg2
, op
);
9610 v1
= value_as_long (arg1
);
9615 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9616 v
+= v
> 0 ? -1 : 1;
9624 /* Should not reach this point. */
9628 val
= allocate_value (type1
);
9629 store_unsigned_integer (value_contents_raw (val
),
9630 TYPE_LENGTH (value_type (val
)),
9631 type_byte_order (type1
), v
);
9636 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9638 if (ada_is_direct_array_type (value_type (arg1
))
9639 || ada_is_direct_array_type (value_type (arg2
)))
9641 struct type
*arg1_type
, *arg2_type
;
9643 /* Automatically dereference any array reference before
9644 we attempt to perform the comparison. */
9645 arg1
= ada_coerce_ref (arg1
);
9646 arg2
= ada_coerce_ref (arg2
);
9648 arg1
= ada_coerce_to_simple_array (arg1
);
9649 arg2
= ada_coerce_to_simple_array (arg2
);
9651 arg1_type
= ada_check_typedef (value_type (arg1
));
9652 arg2_type
= ada_check_typedef (value_type (arg2
));
9654 if (arg1_type
->code () != TYPE_CODE_ARRAY
9655 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9656 error (_("Attempt to compare array with non-array"));
9657 /* FIXME: The following works only for types whose
9658 representations use all bits (no padding or undefined bits)
9659 and do not have user-defined equality. */
9660 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9661 && memcmp (value_contents (arg1
), value_contents (arg2
),
9662 TYPE_LENGTH (arg1_type
)) == 0);
9664 return value_equal (arg1
, arg2
);
9667 /* Total number of component associations in the aggregate starting at
9668 index PC in EXP. Assumes that index PC is the start of an
9672 num_component_specs (struct expression
*exp
, int pc
)
9676 m
= exp
->elts
[pc
+ 1].longconst
;
9679 for (i
= 0; i
< m
; i
+= 1)
9681 switch (exp
->elts
[pc
].opcode
)
9687 n
+= exp
->elts
[pc
+ 1].longconst
;
9690 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9695 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9696 component of LHS (a simple array or a record), updating *POS past
9697 the expression, assuming that LHS is contained in CONTAINER. Does
9698 not modify the inferior's memory, nor does it modify LHS (unless
9699 LHS == CONTAINER). */
9702 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9703 struct expression
*exp
, int *pos
)
9705 struct value
*mark
= value_mark ();
9707 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9709 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9711 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9712 struct value
*index_val
= value_from_longest (index_type
, index
);
9714 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9718 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9719 elt
= ada_to_fixed_value (elt
);
9722 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9723 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9725 value_assign_to_component (container
, elt
,
9726 ada_evaluate_subexp (NULL
, exp
, pos
,
9729 value_free_to_mark (mark
);
9732 /* Assuming that LHS represents an lvalue having a record or array
9733 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9734 of that aggregate's value to LHS, advancing *POS past the
9735 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9736 lvalue containing LHS (possibly LHS itself). Does not modify
9737 the inferior's memory, nor does it modify the contents of
9738 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9740 static struct value
*
9741 assign_aggregate (struct value
*container
,
9742 struct value
*lhs
, struct expression
*exp
,
9743 int *pos
, enum noside noside
)
9745 struct type
*lhs_type
;
9746 int n
= exp
->elts
[*pos
+1].longconst
;
9747 LONGEST low_index
, high_index
;
9750 int max_indices
, num_indices
;
9754 if (noside
!= EVAL_NORMAL
)
9756 for (i
= 0; i
< n
; i
+= 1)
9757 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9761 container
= ada_coerce_ref (container
);
9762 if (ada_is_direct_array_type (value_type (container
)))
9763 container
= ada_coerce_to_simple_array (container
);
9764 lhs
= ada_coerce_ref (lhs
);
9765 if (!deprecated_value_modifiable (lhs
))
9766 error (_("Left operand of assignment is not a modifiable lvalue."));
9768 lhs_type
= check_typedef (value_type (lhs
));
9769 if (ada_is_direct_array_type (lhs_type
))
9771 lhs
= ada_coerce_to_simple_array (lhs
);
9772 lhs_type
= check_typedef (value_type (lhs
));
9773 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9774 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9776 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9779 high_index
= num_visible_fields (lhs_type
) - 1;
9782 error (_("Left-hand side must be array or record."));
9784 num_specs
= num_component_specs (exp
, *pos
- 3);
9785 max_indices
= 4 * num_specs
+ 4;
9786 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9787 indices
[0] = indices
[1] = low_index
- 1;
9788 indices
[2] = indices
[3] = high_index
+ 1;
9791 for (i
= 0; i
< n
; i
+= 1)
9793 switch (exp
->elts
[*pos
].opcode
)
9796 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9797 &num_indices
, max_indices
,
9798 low_index
, high_index
);
9801 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9802 &num_indices
, max_indices
,
9803 low_index
, high_index
);
9807 error (_("Misplaced 'others' clause"));
9808 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9809 num_indices
, low_index
, high_index
);
9812 error (_("Internal error: bad aggregate clause"));
9819 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9820 construct at *POS, updating *POS past the construct, given that
9821 the positions are relative to lower bound LOW, where HIGH is the
9822 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9823 updating *NUM_INDICES as needed. CONTAINER is as for
9824 assign_aggregate. */
9826 aggregate_assign_positional (struct value
*container
,
9827 struct value
*lhs
, struct expression
*exp
,
9828 int *pos
, LONGEST
*indices
, int *num_indices
,
9829 int max_indices
, LONGEST low
, LONGEST high
)
9831 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9833 if (ind
- 1 == high
)
9834 warning (_("Extra components in aggregate ignored."));
9837 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9839 assign_component (container
, lhs
, ind
, exp
, pos
);
9842 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9845 /* Assign into the components of LHS indexed by the OP_CHOICES
9846 construct at *POS, updating *POS past the construct, given that
9847 the allowable indices are LOW..HIGH. Record the indices assigned
9848 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9849 needed. CONTAINER is as for assign_aggregate. */
9851 aggregate_assign_from_choices (struct value
*container
,
9852 struct value
*lhs
, struct expression
*exp
,
9853 int *pos
, LONGEST
*indices
, int *num_indices
,
9854 int max_indices
, LONGEST low
, LONGEST high
)
9857 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9858 int choice_pos
, expr_pc
;
9859 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9861 choice_pos
= *pos
+= 3;
9863 for (j
= 0; j
< n_choices
; j
+= 1)
9864 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9866 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9868 for (j
= 0; j
< n_choices
; j
+= 1)
9870 LONGEST lower
, upper
;
9871 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9873 if (op
== OP_DISCRETE_RANGE
)
9876 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9878 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9883 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9895 name
= &exp
->elts
[choice_pos
+ 2].string
;
9898 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9901 error (_("Invalid record component association."));
9903 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9905 if (! find_struct_field (name
, value_type (lhs
), 0,
9906 NULL
, NULL
, NULL
, NULL
, &ind
))
9907 error (_("Unknown component name: %s."), name
);
9908 lower
= upper
= ind
;
9911 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9912 error (_("Index in component association out of bounds."));
9914 add_component_interval (lower
, upper
, indices
, num_indices
,
9916 while (lower
<= upper
)
9921 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9927 /* Assign the value of the expression in the OP_OTHERS construct in
9928 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9929 have not been previously assigned. The index intervals already assigned
9930 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9931 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9933 aggregate_assign_others (struct value
*container
,
9934 struct value
*lhs
, struct expression
*exp
,
9935 int *pos
, LONGEST
*indices
, int num_indices
,
9936 LONGEST low
, LONGEST high
)
9939 int expr_pc
= *pos
+ 1;
9941 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9945 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9950 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9953 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9956 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9957 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9958 modifying *SIZE as needed. It is an error if *SIZE exceeds
9959 MAX_SIZE. The resulting intervals do not overlap. */
9961 add_component_interval (LONGEST low
, LONGEST high
,
9962 LONGEST
* indices
, int *size
, int max_size
)
9966 for (i
= 0; i
< *size
; i
+= 2) {
9967 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9971 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9972 if (high
< indices
[kh
])
9974 if (low
< indices
[i
])
9976 indices
[i
+ 1] = indices
[kh
- 1];
9977 if (high
> indices
[i
+ 1])
9978 indices
[i
+ 1] = high
;
9979 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9980 *size
-= kh
- i
- 2;
9983 else if (high
< indices
[i
])
9987 if (*size
== max_size
)
9988 error (_("Internal error: miscounted aggregate components."));
9990 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9991 indices
[j
] = indices
[j
- 2];
9993 indices
[i
+ 1] = high
;
9996 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9999 static struct value
*
10000 ada_value_cast (struct type
*type
, struct value
*arg2
)
10002 if (type
== ada_check_typedef (value_type (arg2
)))
10005 if (ada_is_gnat_encoded_fixed_point_type (type
))
10006 return cast_to_fixed (type
, arg2
);
10008 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10009 return cast_from_fixed (type
, arg2
);
10011 return value_cast (type
, arg2
);
10014 /* Evaluating Ada expressions, and printing their result.
10015 ------------------------------------------------------
10020 We usually evaluate an Ada expression in order to print its value.
10021 We also evaluate an expression in order to print its type, which
10022 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10023 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10024 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10025 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10028 Evaluating expressions is a little more complicated for Ada entities
10029 than it is for entities in languages such as C. The main reason for
10030 this is that Ada provides types whose definition might be dynamic.
10031 One example of such types is variant records. Or another example
10032 would be an array whose bounds can only be known at run time.
10034 The following description is a general guide as to what should be
10035 done (and what should NOT be done) in order to evaluate an expression
10036 involving such types, and when. This does not cover how the semantic
10037 information is encoded by GNAT as this is covered separatly. For the
10038 document used as the reference for the GNAT encoding, see exp_dbug.ads
10039 in the GNAT sources.
10041 Ideally, we should embed each part of this description next to its
10042 associated code. Unfortunately, the amount of code is so vast right
10043 now that it's hard to see whether the code handling a particular
10044 situation might be duplicated or not. One day, when the code is
10045 cleaned up, this guide might become redundant with the comments
10046 inserted in the code, and we might want to remove it.
10048 2. ``Fixing'' an Entity, the Simple Case:
10049 -----------------------------------------
10051 When evaluating Ada expressions, the tricky issue is that they may
10052 reference entities whose type contents and size are not statically
10053 known. Consider for instance a variant record:
10055 type Rec (Empty : Boolean := True) is record
10058 when False => Value : Integer;
10061 Yes : Rec := (Empty => False, Value => 1);
10062 No : Rec := (empty => True);
10064 The size and contents of that record depends on the value of the
10065 descriminant (Rec.Empty). At this point, neither the debugging
10066 information nor the associated type structure in GDB are able to
10067 express such dynamic types. So what the debugger does is to create
10068 "fixed" versions of the type that applies to the specific object.
10069 We also informally refer to this operation as "fixing" an object,
10070 which means creating its associated fixed type.
10072 Example: when printing the value of variable "Yes" above, its fixed
10073 type would look like this:
10080 On the other hand, if we printed the value of "No", its fixed type
10087 Things become a little more complicated when trying to fix an entity
10088 with a dynamic type that directly contains another dynamic type,
10089 such as an array of variant records, for instance. There are
10090 two possible cases: Arrays, and records.
10092 3. ``Fixing'' Arrays:
10093 ---------------------
10095 The type structure in GDB describes an array in terms of its bounds,
10096 and the type of its elements. By design, all elements in the array
10097 have the same type and we cannot represent an array of variant elements
10098 using the current type structure in GDB. When fixing an array,
10099 we cannot fix the array element, as we would potentially need one
10100 fixed type per element of the array. As a result, the best we can do
10101 when fixing an array is to produce an array whose bounds and size
10102 are correct (allowing us to read it from memory), but without having
10103 touched its element type. Fixing each element will be done later,
10104 when (if) necessary.
10106 Arrays are a little simpler to handle than records, because the same
10107 amount of memory is allocated for each element of the array, even if
10108 the amount of space actually used by each element differs from element
10109 to element. Consider for instance the following array of type Rec:
10111 type Rec_Array is array (1 .. 2) of Rec;
10113 The actual amount of memory occupied by each element might be different
10114 from element to element, depending on the value of their discriminant.
10115 But the amount of space reserved for each element in the array remains
10116 fixed regardless. So we simply need to compute that size using
10117 the debugging information available, from which we can then determine
10118 the array size (we multiply the number of elements of the array by
10119 the size of each element).
10121 The simplest case is when we have an array of a constrained element
10122 type. For instance, consider the following type declarations:
10124 type Bounded_String (Max_Size : Integer) is
10126 Buffer : String (1 .. Max_Size);
10128 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10130 In this case, the compiler describes the array as an array of
10131 variable-size elements (identified by its XVS suffix) for which
10132 the size can be read in the parallel XVZ variable.
10134 In the case of an array of an unconstrained element type, the compiler
10135 wraps the array element inside a private PAD type. This type should not
10136 be shown to the user, and must be "unwrap"'ed before printing. Note
10137 that we also use the adjective "aligner" in our code to designate
10138 these wrapper types.
10140 In some cases, the size allocated for each element is statically
10141 known. In that case, the PAD type already has the correct size,
10142 and the array element should remain unfixed.
10144 But there are cases when this size is not statically known.
10145 For instance, assuming that "Five" is an integer variable:
10147 type Dynamic is array (1 .. Five) of Integer;
10148 type Wrapper (Has_Length : Boolean := False) is record
10151 when True => Length : Integer;
10152 when False => null;
10155 type Wrapper_Array is array (1 .. 2) of Wrapper;
10157 Hello : Wrapper_Array := (others => (Has_Length => True,
10158 Data => (others => 17),
10162 The debugging info would describe variable Hello as being an
10163 array of a PAD type. The size of that PAD type is not statically
10164 known, but can be determined using a parallel XVZ variable.
10165 In that case, a copy of the PAD type with the correct size should
10166 be used for the fixed array.
10168 3. ``Fixing'' record type objects:
10169 ----------------------------------
10171 Things are slightly different from arrays in the case of dynamic
10172 record types. In this case, in order to compute the associated
10173 fixed type, we need to determine the size and offset of each of
10174 its components. This, in turn, requires us to compute the fixed
10175 type of each of these components.
10177 Consider for instance the example:
10179 type Bounded_String (Max_Size : Natural) is record
10180 Str : String (1 .. Max_Size);
10183 My_String : Bounded_String (Max_Size => 10);
10185 In that case, the position of field "Length" depends on the size
10186 of field Str, which itself depends on the value of the Max_Size
10187 discriminant. In order to fix the type of variable My_String,
10188 we need to fix the type of field Str. Therefore, fixing a variant
10189 record requires us to fix each of its components.
10191 However, if a component does not have a dynamic size, the component
10192 should not be fixed. In particular, fields that use a PAD type
10193 should not fixed. Here is an example where this might happen
10194 (assuming type Rec above):
10196 type Container (Big : Boolean) is record
10200 when True => Another : Integer;
10201 when False => null;
10204 My_Container : Container := (Big => False,
10205 First => (Empty => True),
10208 In that example, the compiler creates a PAD type for component First,
10209 whose size is constant, and then positions the component After just
10210 right after it. The offset of component After is therefore constant
10213 The debugger computes the position of each field based on an algorithm
10214 that uses, among other things, the actual position and size of the field
10215 preceding it. Let's now imagine that the user is trying to print
10216 the value of My_Container. If the type fixing was recursive, we would
10217 end up computing the offset of field After based on the size of the
10218 fixed version of field First. And since in our example First has
10219 only one actual field, the size of the fixed type is actually smaller
10220 than the amount of space allocated to that field, and thus we would
10221 compute the wrong offset of field After.
10223 To make things more complicated, we need to watch out for dynamic
10224 components of variant records (identified by the ___XVL suffix in
10225 the component name). Even if the target type is a PAD type, the size
10226 of that type might not be statically known. So the PAD type needs
10227 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10228 we might end up with the wrong size for our component. This can be
10229 observed with the following type declarations:
10231 type Octal is new Integer range 0 .. 7;
10232 type Octal_Array is array (Positive range <>) of Octal;
10233 pragma Pack (Octal_Array);
10235 type Octal_Buffer (Size : Positive) is record
10236 Buffer : Octal_Array (1 .. Size);
10240 In that case, Buffer is a PAD type whose size is unset and needs
10241 to be computed by fixing the unwrapped type.
10243 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10244 ----------------------------------------------------------
10246 Lastly, when should the sub-elements of an entity that remained unfixed
10247 thus far, be actually fixed?
10249 The answer is: Only when referencing that element. For instance
10250 when selecting one component of a record, this specific component
10251 should be fixed at that point in time. Or when printing the value
10252 of a record, each component should be fixed before its value gets
10253 printed. Similarly for arrays, the element of the array should be
10254 fixed when printing each element of the array, or when extracting
10255 one element out of that array. On the other hand, fixing should
10256 not be performed on the elements when taking a slice of an array!
10258 Note that one of the side effects of miscomputing the offset and
10259 size of each field is that we end up also miscomputing the size
10260 of the containing type. This can have adverse results when computing
10261 the value of an entity. GDB fetches the value of an entity based
10262 on the size of its type, and thus a wrong size causes GDB to fetch
10263 the wrong amount of memory. In the case where the computed size is
10264 too small, GDB fetches too little data to print the value of our
10265 entity. Results in this case are unpredictable, as we usually read
10266 past the buffer containing the data =:-o. */
10268 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10269 for that subexpression cast to TO_TYPE. Advance *POS over the
10273 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10274 enum noside noside
, struct type
*to_type
)
10278 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10279 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10284 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10286 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10287 return value_zero (to_type
, not_lval
);
10289 val
= evaluate_var_msym_value (noside
,
10290 exp
->elts
[pc
+ 1].objfile
,
10291 exp
->elts
[pc
+ 2].msymbol
);
10294 val
= evaluate_var_value (noside
,
10295 exp
->elts
[pc
+ 1].block
,
10296 exp
->elts
[pc
+ 2].symbol
);
10298 if (noside
== EVAL_SKIP
)
10299 return eval_skip_value (exp
);
10301 val
= ada_value_cast (to_type
, val
);
10303 /* Follow the Ada language semantics that do not allow taking
10304 an address of the result of a cast (view conversion in Ada). */
10305 if (VALUE_LVAL (val
) == lval_memory
)
10307 if (value_lazy (val
))
10308 value_fetch_lazy (val
);
10309 VALUE_LVAL (val
) = not_lval
;
10314 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10315 if (noside
== EVAL_SKIP
)
10316 return eval_skip_value (exp
);
10317 return ada_value_cast (to_type
, val
);
10320 /* Implement the evaluate_exp routine in the exp_descriptor structure
10321 for the Ada language. */
10323 static struct value
*
10324 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10325 int *pos
, enum noside noside
)
10327 enum exp_opcode op
;
10331 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10334 struct value
**argvec
;
10338 op
= exp
->elts
[pc
].opcode
;
10344 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10346 if (noside
== EVAL_NORMAL
)
10347 arg1
= unwrap_value (arg1
);
10349 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10350 then we need to perform the conversion manually, because
10351 evaluate_subexp_standard doesn't do it. This conversion is
10352 necessary in Ada because the different kinds of float/fixed
10353 types in Ada have different representations.
10355 Similarly, we need to perform the conversion from OP_LONG
10357 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10358 arg1
= ada_value_cast (expect_type
, arg1
);
10364 struct value
*result
;
10367 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10368 /* The result type will have code OP_STRING, bashed there from
10369 OP_ARRAY. Bash it back. */
10370 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10371 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10377 type
= exp
->elts
[pc
+ 1].type
;
10378 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10382 type
= exp
->elts
[pc
+ 1].type
;
10383 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10386 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10387 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10389 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10390 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10392 return ada_value_assign (arg1
, arg1
);
10394 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10395 except if the lhs of our assignment is a convenience variable.
10396 In the case of assigning to a convenience variable, the lhs
10397 should be exactly the result of the evaluation of the rhs. */
10398 type
= value_type (arg1
);
10399 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10401 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10402 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10404 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10408 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10409 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10410 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10412 (_("Fixed-point values must be assigned to fixed-point variables"));
10414 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10415 return ada_value_assign (arg1
, arg2
);
10418 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10419 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10420 if (noside
== EVAL_SKIP
)
10422 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10423 return (value_from_longest
10424 (value_type (arg1
),
10425 value_as_long (arg1
) + value_as_long (arg2
)));
10426 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10427 return (value_from_longest
10428 (value_type (arg2
),
10429 value_as_long (arg1
) + value_as_long (arg2
)));
10430 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10431 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10432 && value_type (arg1
) != value_type (arg2
))
10433 error (_("Operands of fixed-point addition must have the same type"));
10434 /* Do the addition, and cast the result to the type of the first
10435 argument. We cannot cast the result to a reference type, so if
10436 ARG1 is a reference type, find its underlying type. */
10437 type
= value_type (arg1
);
10438 while (type
->code () == TYPE_CODE_REF
)
10439 type
= TYPE_TARGET_TYPE (type
);
10440 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10441 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10444 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10445 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10446 if (noside
== EVAL_SKIP
)
10448 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10449 return (value_from_longest
10450 (value_type (arg1
),
10451 value_as_long (arg1
) - value_as_long (arg2
)));
10452 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10453 return (value_from_longest
10454 (value_type (arg2
),
10455 value_as_long (arg1
) - value_as_long (arg2
)));
10456 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10457 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10458 && value_type (arg1
) != value_type (arg2
))
10459 error (_("Operands of fixed-point subtraction "
10460 "must have the same type"));
10461 /* Do the substraction, and cast the result to the type of the first
10462 argument. We cannot cast the result to a reference type, so if
10463 ARG1 is a reference type, find its underlying type. */
10464 type
= value_type (arg1
);
10465 while (type
->code () == TYPE_CODE_REF
)
10466 type
= TYPE_TARGET_TYPE (type
);
10467 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10468 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10474 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10475 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10476 if (noside
== EVAL_SKIP
)
10478 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10480 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10481 return value_zero (value_type (arg1
), not_lval
);
10485 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10486 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10487 arg1
= cast_from_fixed (type
, arg1
);
10488 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10489 arg2
= cast_from_fixed (type
, arg2
);
10490 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10491 return ada_value_binop (arg1
, arg2
, op
);
10495 case BINOP_NOTEQUAL
:
10496 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10497 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10498 if (noside
== EVAL_SKIP
)
10500 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10504 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10505 tem
= ada_value_equal (arg1
, arg2
);
10507 if (op
== BINOP_NOTEQUAL
)
10509 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10510 return value_from_longest (type
, (LONGEST
) tem
);
10513 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10514 if (noside
== EVAL_SKIP
)
10516 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10517 return value_cast (value_type (arg1
), value_neg (arg1
));
10520 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10521 return value_neg (arg1
);
10524 case BINOP_LOGICAL_AND
:
10525 case BINOP_LOGICAL_OR
:
10526 case UNOP_LOGICAL_NOT
:
10531 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10532 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10533 return value_cast (type
, val
);
10536 case BINOP_BITWISE_AND
:
10537 case BINOP_BITWISE_IOR
:
10538 case BINOP_BITWISE_XOR
:
10542 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10544 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10546 return value_cast (value_type (arg1
), val
);
10552 if (noside
== EVAL_SKIP
)
10558 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10559 /* Only encountered when an unresolved symbol occurs in a
10560 context other than a function call, in which case, it is
10562 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10563 exp
->elts
[pc
+ 2].symbol
->print_name ());
10565 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10567 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10568 /* Check to see if this is a tagged type. We also need to handle
10569 the case where the type is a reference to a tagged type, but
10570 we have to be careful to exclude pointers to tagged types.
10571 The latter should be shown as usual (as a pointer), whereas
10572 a reference should mostly be transparent to the user. */
10573 if (ada_is_tagged_type (type
, 0)
10574 || (type
->code () == TYPE_CODE_REF
10575 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10577 /* Tagged types are a little special in the fact that the real
10578 type is dynamic and can only be determined by inspecting the
10579 object's tag. This means that we need to get the object's
10580 value first (EVAL_NORMAL) and then extract the actual object
10583 Note that we cannot skip the final step where we extract
10584 the object type from its tag, because the EVAL_NORMAL phase
10585 results in dynamic components being resolved into fixed ones.
10586 This can cause problems when trying to print the type
10587 description of tagged types whose parent has a dynamic size:
10588 We use the type name of the "_parent" component in order
10589 to print the name of the ancestor type in the type description.
10590 If that component had a dynamic size, the resolution into
10591 a fixed type would result in the loss of that type name,
10592 thus preventing us from printing the name of the ancestor
10593 type in the type description. */
10594 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10596 if (type
->code () != TYPE_CODE_REF
)
10598 struct type
*actual_type
;
10600 actual_type
= type_from_tag (ada_value_tag (arg1
));
10601 if (actual_type
== NULL
)
10602 /* If, for some reason, we were unable to determine
10603 the actual type from the tag, then use the static
10604 approximation that we just computed as a fallback.
10605 This can happen if the debugging information is
10606 incomplete, for instance. */
10607 actual_type
= type
;
10608 return value_zero (actual_type
, not_lval
);
10612 /* In the case of a ref, ada_coerce_ref takes care
10613 of determining the actual type. But the evaluation
10614 should return a ref as it should be valid to ask
10615 for its address; so rebuild a ref after coerce. */
10616 arg1
= ada_coerce_ref (arg1
);
10617 return value_ref (arg1
, TYPE_CODE_REF
);
10621 /* Records and unions for which GNAT encodings have been
10622 generated need to be statically fixed as well.
10623 Otherwise, non-static fixing produces a type where
10624 all dynamic properties are removed, which prevents "ptype"
10625 from being able to completely describe the type.
10626 For instance, a case statement in a variant record would be
10627 replaced by the relevant components based on the actual
10628 value of the discriminants. */
10629 if ((type
->code () == TYPE_CODE_STRUCT
10630 && dynamic_template_type (type
) != NULL
)
10631 || (type
->code () == TYPE_CODE_UNION
10632 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10635 return value_zero (to_static_fixed_type (type
), not_lval
);
10639 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10640 return ada_to_fixed_value (arg1
);
10645 /* Allocate arg vector, including space for the function to be
10646 called in argvec[0] and a terminating NULL. */
10647 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10648 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10650 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10651 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10652 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10653 exp
->elts
[pc
+ 5].symbol
->print_name ());
10656 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10657 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10660 if (noside
== EVAL_SKIP
)
10664 if (ada_is_constrained_packed_array_type
10665 (desc_base_type (value_type (argvec
[0]))))
10666 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10667 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10668 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10669 /* This is a packed array that has already been fixed, and
10670 therefore already coerced to a simple array. Nothing further
10673 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10675 /* Make sure we dereference references so that all the code below
10676 feels like it's really handling the referenced value. Wrapping
10677 types (for alignment) may be there, so make sure we strip them as
10679 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10681 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10682 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10683 argvec
[0] = value_addr (argvec
[0]);
10685 type
= ada_check_typedef (value_type (argvec
[0]));
10687 /* Ada allows us to implicitly dereference arrays when subscripting
10688 them. So, if this is an array typedef (encoding use for array
10689 access types encoded as fat pointers), strip it now. */
10690 if (type
->code () == TYPE_CODE_TYPEDEF
)
10691 type
= ada_typedef_target_type (type
);
10693 if (type
->code () == TYPE_CODE_PTR
)
10695 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10697 case TYPE_CODE_FUNC
:
10698 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10700 case TYPE_CODE_ARRAY
:
10702 case TYPE_CODE_STRUCT
:
10703 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10704 argvec
[0] = ada_value_ind (argvec
[0]);
10705 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10708 error (_("cannot subscript or call something of type `%s'"),
10709 ada_type_name (value_type (argvec
[0])));
10714 switch (type
->code ())
10716 case TYPE_CODE_FUNC
:
10717 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10719 if (TYPE_TARGET_TYPE (type
) == NULL
)
10720 error_call_unknown_return_type (NULL
);
10721 return allocate_value (TYPE_TARGET_TYPE (type
));
10723 return call_function_by_hand (argvec
[0], NULL
,
10724 gdb::make_array_view (argvec
+ 1,
10726 case TYPE_CODE_INTERNAL_FUNCTION
:
10727 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10728 /* We don't know anything about what the internal
10729 function might return, but we have to return
10731 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10734 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10735 argvec
[0], nargs
, argvec
+ 1);
10737 case TYPE_CODE_STRUCT
:
10741 arity
= ada_array_arity (type
);
10742 type
= ada_array_element_type (type
, nargs
);
10744 error (_("cannot subscript or call a record"));
10745 if (arity
!= nargs
)
10746 error (_("wrong number of subscripts; expecting %d"), arity
);
10747 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10748 return value_zero (ada_aligned_type (type
), lval_memory
);
10750 unwrap_value (ada_value_subscript
10751 (argvec
[0], nargs
, argvec
+ 1));
10753 case TYPE_CODE_ARRAY
:
10754 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10756 type
= ada_array_element_type (type
, nargs
);
10758 error (_("element type of array unknown"));
10760 return value_zero (ada_aligned_type (type
), lval_memory
);
10763 unwrap_value (ada_value_subscript
10764 (ada_coerce_to_simple_array (argvec
[0]),
10765 nargs
, argvec
+ 1));
10766 case TYPE_CODE_PTR
: /* Pointer to array */
10767 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10769 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10770 type
= ada_array_element_type (type
, nargs
);
10772 error (_("element type of array unknown"));
10774 return value_zero (ada_aligned_type (type
), lval_memory
);
10777 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10778 nargs
, argvec
+ 1));
10781 error (_("Attempt to index or call something other than an "
10782 "array or function"));
10787 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10788 struct value
*low_bound_val
=
10789 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10790 struct value
*high_bound_val
=
10791 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10793 LONGEST high_bound
;
10795 low_bound_val
= coerce_ref (low_bound_val
);
10796 high_bound_val
= coerce_ref (high_bound_val
);
10797 low_bound
= value_as_long (low_bound_val
);
10798 high_bound
= value_as_long (high_bound_val
);
10800 if (noside
== EVAL_SKIP
)
10803 /* If this is a reference to an aligner type, then remove all
10805 if (value_type (array
)->code () == TYPE_CODE_REF
10806 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10807 TYPE_TARGET_TYPE (value_type (array
)) =
10808 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10810 if (ada_is_constrained_packed_array_type (value_type (array
)))
10811 error (_("cannot slice a packed array"));
10813 /* If this is a reference to an array or an array lvalue,
10814 convert to a pointer. */
10815 if (value_type (array
)->code () == TYPE_CODE_REF
10816 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10817 && VALUE_LVAL (array
) == lval_memory
))
10818 array
= value_addr (array
);
10820 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10821 && ada_is_array_descriptor_type (ada_check_typedef
10822 (value_type (array
))))
10823 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10826 array
= ada_coerce_to_simple_array_ptr (array
);
10828 /* If we have more than one level of pointer indirection,
10829 dereference the value until we get only one level. */
10830 while (value_type (array
)->code () == TYPE_CODE_PTR
10831 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10833 array
= value_ind (array
);
10835 /* Make sure we really do have an array type before going further,
10836 to avoid a SEGV when trying to get the index type or the target
10837 type later down the road if the debug info generated by
10838 the compiler is incorrect or incomplete. */
10839 if (!ada_is_simple_array_type (value_type (array
)))
10840 error (_("cannot take slice of non-array"));
10842 if (ada_check_typedef (value_type (array
))->code ()
10845 struct type
*type0
= ada_check_typedef (value_type (array
));
10847 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10848 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10851 struct type
*arr_type0
=
10852 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10854 return ada_value_slice_from_ptr (array
, arr_type0
,
10855 longest_to_int (low_bound
),
10856 longest_to_int (high_bound
));
10859 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10861 else if (high_bound
< low_bound
)
10862 return empty_array (value_type (array
), low_bound
, high_bound
);
10864 return ada_value_slice (array
, longest_to_int (low_bound
),
10865 longest_to_int (high_bound
));
10868 case UNOP_IN_RANGE
:
10870 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10871 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10873 if (noside
== EVAL_SKIP
)
10876 switch (type
->code ())
10879 lim_warning (_("Membership test incompletely implemented; "
10880 "always returns true"));
10881 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10882 return value_from_longest (type
, (LONGEST
) 1);
10884 case TYPE_CODE_RANGE
:
10885 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10886 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10887 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10888 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10889 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10891 value_from_longest (type
,
10892 (value_less (arg1
, arg3
)
10893 || value_equal (arg1
, arg3
))
10894 && (value_less (arg2
, arg1
)
10895 || value_equal (arg2
, arg1
)));
10898 case BINOP_IN_BOUNDS
:
10900 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10901 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10903 if (noside
== EVAL_SKIP
)
10906 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10908 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10909 return value_zero (type
, not_lval
);
10912 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10914 type
= ada_index_type (value_type (arg2
), tem
, "range");
10916 type
= value_type (arg1
);
10918 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10919 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10921 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10922 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10923 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10925 value_from_longest (type
,
10926 (value_less (arg1
, arg3
)
10927 || value_equal (arg1
, arg3
))
10928 && (value_less (arg2
, arg1
)
10929 || value_equal (arg2
, arg1
)));
10931 case TERNOP_IN_RANGE
:
10932 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10933 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10934 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10936 if (noside
== EVAL_SKIP
)
10939 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10940 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10941 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10943 value_from_longest (type
,
10944 (value_less (arg1
, arg3
)
10945 || value_equal (arg1
, arg3
))
10946 && (value_less (arg2
, arg1
)
10947 || value_equal (arg2
, arg1
)));
10951 case OP_ATR_LENGTH
:
10953 struct type
*type_arg
;
10955 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10957 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10959 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10963 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10967 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10968 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10969 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10972 if (noside
== EVAL_SKIP
)
10974 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10976 if (type_arg
== NULL
)
10977 type_arg
= value_type (arg1
);
10979 if (ada_is_constrained_packed_array_type (type_arg
))
10980 type_arg
= decode_constrained_packed_array_type (type_arg
);
10982 if (!discrete_type_p (type_arg
))
10986 default: /* Should never happen. */
10987 error (_("unexpected attribute encountered"));
10990 type_arg
= ada_index_type (type_arg
, tem
,
10991 ada_attribute_name (op
));
10993 case OP_ATR_LENGTH
:
10994 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
10999 return value_zero (type_arg
, not_lval
);
11001 else if (type_arg
== NULL
)
11003 arg1
= ada_coerce_ref (arg1
);
11005 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
11006 arg1
= ada_coerce_to_simple_array (arg1
);
11008 if (op
== OP_ATR_LENGTH
)
11009 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11012 type
= ada_index_type (value_type (arg1
), tem
,
11013 ada_attribute_name (op
));
11015 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11020 default: /* Should never happen. */
11021 error (_("unexpected attribute encountered"));
11023 return value_from_longest
11024 (type
, ada_array_bound (arg1
, tem
, 0));
11026 return value_from_longest
11027 (type
, ada_array_bound (arg1
, tem
, 1));
11028 case OP_ATR_LENGTH
:
11029 return value_from_longest
11030 (type
, ada_array_length (arg1
, tem
));
11033 else if (discrete_type_p (type_arg
))
11035 struct type
*range_type
;
11036 const char *name
= ada_type_name (type_arg
);
11039 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
11040 range_type
= to_fixed_range_type (type_arg
, NULL
);
11041 if (range_type
== NULL
)
11042 range_type
= type_arg
;
11046 error (_("unexpected attribute encountered"));
11048 return value_from_longest
11049 (range_type
, ada_discrete_type_low_bound (range_type
));
11051 return value_from_longest
11052 (range_type
, ada_discrete_type_high_bound (range_type
));
11053 case OP_ATR_LENGTH
:
11054 error (_("the 'length attribute applies only to array types"));
11057 else if (type_arg
->code () == TYPE_CODE_FLT
)
11058 error (_("unimplemented type attribute"));
11063 if (ada_is_constrained_packed_array_type (type_arg
))
11064 type_arg
= decode_constrained_packed_array_type (type_arg
);
11066 if (op
== OP_ATR_LENGTH
)
11067 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11070 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11072 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11078 error (_("unexpected attribute encountered"));
11080 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11081 return value_from_longest (type
, low
);
11083 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11084 return value_from_longest (type
, high
);
11085 case OP_ATR_LENGTH
:
11086 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11087 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11088 return value_from_longest (type
, high
- low
+ 1);
11094 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11095 if (noside
== EVAL_SKIP
)
11098 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11099 return value_zero (ada_tag_type (arg1
), not_lval
);
11101 return ada_value_tag (arg1
);
11105 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11106 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11107 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11108 if (noside
== EVAL_SKIP
)
11110 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11111 return value_zero (value_type (arg1
), not_lval
);
11114 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11115 return value_binop (arg1
, arg2
,
11116 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11119 case OP_ATR_MODULUS
:
11121 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11123 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11124 if (noside
== EVAL_SKIP
)
11127 if (!ada_is_modular_type (type_arg
))
11128 error (_("'modulus must be applied to modular type"));
11130 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11131 ada_modulus (type_arg
));
11136 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11137 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11138 if (noside
== EVAL_SKIP
)
11140 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11141 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11142 return value_zero (type
, not_lval
);
11144 return value_pos_atr (type
, arg1
);
11147 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11148 type
= value_type (arg1
);
11150 /* If the argument is a reference, then dereference its type, since
11151 the user is really asking for the size of the actual object,
11152 not the size of the pointer. */
11153 if (type
->code () == TYPE_CODE_REF
)
11154 type
= TYPE_TARGET_TYPE (type
);
11156 if (noside
== EVAL_SKIP
)
11158 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11159 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11161 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11162 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11165 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11166 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11167 type
= exp
->elts
[pc
+ 2].type
;
11168 if (noside
== EVAL_SKIP
)
11170 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11171 return value_zero (type
, not_lval
);
11173 return value_val_atr (type
, arg1
);
11176 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11177 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11178 if (noside
== EVAL_SKIP
)
11180 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11181 return value_zero (value_type (arg1
), not_lval
);
11184 /* For integer exponentiation operations,
11185 only promote the first argument. */
11186 if (is_integral_type (value_type (arg2
)))
11187 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11189 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11191 return value_binop (arg1
, arg2
, op
);
11195 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11196 if (noside
== EVAL_SKIP
)
11202 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11203 if (noside
== EVAL_SKIP
)
11205 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11206 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11207 return value_neg (arg1
);
11212 preeval_pos
= *pos
;
11213 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11214 if (noside
== EVAL_SKIP
)
11216 type
= ada_check_typedef (value_type (arg1
));
11217 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11219 if (ada_is_array_descriptor_type (type
))
11220 /* GDB allows dereferencing GNAT array descriptors. */
11222 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11224 if (arrType
== NULL
)
11225 error (_("Attempt to dereference null array pointer."));
11226 return value_at_lazy (arrType
, 0);
11228 else if (type
->code () == TYPE_CODE_PTR
11229 || type
->code () == TYPE_CODE_REF
11230 /* In C you can dereference an array to get the 1st elt. */
11231 || type
->code () == TYPE_CODE_ARRAY
)
11233 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11234 only be determined by inspecting the object's tag.
11235 This means that we need to evaluate completely the
11236 expression in order to get its type. */
11238 if ((type
->code () == TYPE_CODE_REF
11239 || type
->code () == TYPE_CODE_PTR
)
11240 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11242 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11244 type
= value_type (ada_value_ind (arg1
));
11248 type
= to_static_fixed_type
11250 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11252 ada_ensure_varsize_limit (type
);
11253 return value_zero (type
, lval_memory
);
11255 else if (type
->code () == TYPE_CODE_INT
)
11257 /* GDB allows dereferencing an int. */
11258 if (expect_type
== NULL
)
11259 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11264 to_static_fixed_type (ada_aligned_type (expect_type
));
11265 return value_zero (expect_type
, lval_memory
);
11269 error (_("Attempt to take contents of a non-pointer value."));
11271 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11272 type
= ada_check_typedef (value_type (arg1
));
11274 if (type
->code () == TYPE_CODE_INT
)
11275 /* GDB allows dereferencing an int. If we were given
11276 the expect_type, then use that as the target type.
11277 Otherwise, assume that the target type is an int. */
11279 if (expect_type
!= NULL
)
11280 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11283 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11284 (CORE_ADDR
) value_as_address (arg1
));
11287 if (ada_is_array_descriptor_type (type
))
11288 /* GDB allows dereferencing GNAT array descriptors. */
11289 return ada_coerce_to_simple_array (arg1
);
11291 return ada_value_ind (arg1
);
11293 case STRUCTOP_STRUCT
:
11294 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11295 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11296 preeval_pos
= *pos
;
11297 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11298 if (noside
== EVAL_SKIP
)
11300 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11302 struct type
*type1
= value_type (arg1
);
11304 if (ada_is_tagged_type (type1
, 1))
11306 type
= ada_lookup_struct_elt_type (type1
,
11307 &exp
->elts
[pc
+ 2].string
,
11310 /* If the field is not found, check if it exists in the
11311 extension of this object's type. This means that we
11312 need to evaluate completely the expression. */
11316 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11318 arg1
= ada_value_struct_elt (arg1
,
11319 &exp
->elts
[pc
+ 2].string
,
11321 arg1
= unwrap_value (arg1
);
11322 type
= value_type (ada_to_fixed_value (arg1
));
11327 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11330 return value_zero (ada_aligned_type (type
), lval_memory
);
11334 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11335 arg1
= unwrap_value (arg1
);
11336 return ada_to_fixed_value (arg1
);
11340 /* The value is not supposed to be used. This is here to make it
11341 easier to accommodate expressions that contain types. */
11343 if (noside
== EVAL_SKIP
)
11345 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11346 return allocate_value (exp
->elts
[pc
+ 1].type
);
11348 error (_("Attempt to use a type name as an expression"));
11353 case OP_DISCRETE_RANGE
:
11354 case OP_POSITIONAL
:
11356 if (noside
== EVAL_NORMAL
)
11360 error (_("Undefined name, ambiguous name, or renaming used in "
11361 "component association: %s."), &exp
->elts
[pc
+2].string
);
11363 error (_("Aggregates only allowed on the right of an assignment"));
11365 internal_error (__FILE__
, __LINE__
,
11366 _("aggregate apparently mangled"));
11369 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11371 for (tem
= 0; tem
< nargs
; tem
+= 1)
11372 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11377 return eval_skip_value (exp
);
11383 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11384 type name that encodes the 'small and 'delta information.
11385 Otherwise, return NULL. */
11387 static const char *
11388 gnat_encoded_fixed_type_info (struct type
*type
)
11390 const char *name
= ada_type_name (type
);
11391 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: type
->code ();
11393 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11395 const char *tail
= strstr (name
, "___XF_");
11402 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11403 return gnat_encoded_fixed_type_info (TYPE_TARGET_TYPE (type
));
11408 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11411 ada_is_gnat_encoded_fixed_point_type (struct type
*type
)
11413 return gnat_encoded_fixed_type_info (type
) != NULL
;
11416 /* Return non-zero iff TYPE represents a System.Address type. */
11419 ada_is_system_address_type (struct type
*type
)
11421 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11424 /* Assuming that TYPE is the representation of an Ada fixed-point
11425 type, return the target floating-point type to be used to represent
11426 of this type during internal computation. */
11428 static struct type
*
11429 ada_scaling_type (struct type
*type
)
11431 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11434 /* Assuming that TYPE is the representation of an Ada fixed-point
11435 type, return its delta, or NULL if the type is malformed and the
11436 delta cannot be determined. */
11439 gnat_encoded_fixed_point_delta (struct type
*type
)
11441 const char *encoding
= gnat_encoded_fixed_type_info (type
);
11442 struct type
*scale_type
= ada_scaling_type (type
);
11444 long long num
, den
;
11446 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11449 return value_binop (value_from_longest (scale_type
, num
),
11450 value_from_longest (scale_type
, den
), BINOP_DIV
);
11453 /* Assuming that ada_is_gnat_encoded_fixed_point_type (TYPE), return
11454 the scaling factor ('SMALL value) associated with the type. */
11457 ada_scaling_factor (struct type
*type
)
11459 const char *encoding
= gnat_encoded_fixed_type_info (type
);
11460 struct type
*scale_type
= ada_scaling_type (type
);
11462 long long num0
, den0
, num1
, den1
;
11465 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11466 &num0
, &den0
, &num1
, &den1
);
11469 return value_from_longest (scale_type
, 1);
11471 return value_binop (value_from_longest (scale_type
, num1
),
11472 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11474 return value_binop (value_from_longest (scale_type
, num0
),
11475 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11482 /* Scan STR beginning at position K for a discriminant name, and
11483 return the value of that discriminant field of DVAL in *PX. If
11484 PNEW_K is not null, put the position of the character beyond the
11485 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11486 not alter *PX and *PNEW_K if unsuccessful. */
11489 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11492 static char *bound_buffer
= NULL
;
11493 static size_t bound_buffer_len
= 0;
11494 const char *pstart
, *pend
, *bound
;
11495 struct value
*bound_val
;
11497 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11501 pend
= strstr (pstart
, "__");
11505 k
+= strlen (bound
);
11509 int len
= pend
- pstart
;
11511 /* Strip __ and beyond. */
11512 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11513 strncpy (bound_buffer
, pstart
, len
);
11514 bound_buffer
[len
] = '\0';
11516 bound
= bound_buffer
;
11520 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11521 if (bound_val
== NULL
)
11524 *px
= value_as_long (bound_val
);
11525 if (pnew_k
!= NULL
)
11530 /* Value of variable named NAME in the current environment. If
11531 no such variable found, then if ERR_MSG is null, returns 0, and
11532 otherwise causes an error with message ERR_MSG. */
11534 static struct value
*
11535 get_var_value (const char *name
, const char *err_msg
)
11537 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11539 std::vector
<struct block_symbol
> syms
;
11540 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11541 get_selected_block (0),
11542 VAR_DOMAIN
, &syms
, 1);
11546 if (err_msg
== NULL
)
11549 error (("%s"), err_msg
);
11552 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11555 /* Value of integer variable named NAME in the current environment.
11556 If no such variable is found, returns false. Otherwise, sets VALUE
11557 to the variable's value and returns true. */
11560 get_int_var_value (const char *name
, LONGEST
&value
)
11562 struct value
*var_val
= get_var_value (name
, 0);
11567 value
= value_as_long (var_val
);
11572 /* Return a range type whose base type is that of the range type named
11573 NAME in the current environment, and whose bounds are calculated
11574 from NAME according to the GNAT range encoding conventions.
11575 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11576 corresponding range type from debug information; fall back to using it
11577 if symbol lookup fails. If a new type must be created, allocate it
11578 like ORIG_TYPE was. The bounds information, in general, is encoded
11579 in NAME, the base type given in the named range type. */
11581 static struct type
*
11582 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11585 struct type
*base_type
;
11586 const char *subtype_info
;
11588 gdb_assert (raw_type
!= NULL
);
11589 gdb_assert (raw_type
->name () != NULL
);
11591 if (raw_type
->code () == TYPE_CODE_RANGE
)
11592 base_type
= TYPE_TARGET_TYPE (raw_type
);
11594 base_type
= raw_type
;
11596 name
= raw_type
->name ();
11597 subtype_info
= strstr (name
, "___XD");
11598 if (subtype_info
== NULL
)
11600 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11601 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11603 if (L
< INT_MIN
|| U
> INT_MAX
)
11606 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11611 static char *name_buf
= NULL
;
11612 static size_t name_len
= 0;
11613 int prefix_len
= subtype_info
- name
;
11616 const char *bounds_str
;
11619 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11620 strncpy (name_buf
, name
, prefix_len
);
11621 name_buf
[prefix_len
] = '\0';
11624 bounds_str
= strchr (subtype_info
, '_');
11627 if (*subtype_info
== 'L')
11629 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11630 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11632 if (bounds_str
[n
] == '_')
11634 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11640 strcpy (name_buf
+ prefix_len
, "___L");
11641 if (!get_int_var_value (name_buf
, L
))
11643 lim_warning (_("Unknown lower bound, using 1."));
11648 if (*subtype_info
== 'U')
11650 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11651 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11656 strcpy (name_buf
+ prefix_len
, "___U");
11657 if (!get_int_var_value (name_buf
, U
))
11659 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11664 type
= create_static_range_type (alloc_type_copy (raw_type
),
11666 /* create_static_range_type alters the resulting type's length
11667 to match the size of the base_type, which is not what we want.
11668 Set it back to the original range type's length. */
11669 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11670 type
->set_name (name
);
11675 /* True iff NAME is the name of a range type. */
11678 ada_is_range_type_name (const char *name
)
11680 return (name
!= NULL
&& strstr (name
, "___XD"));
11684 /* Modular types */
11686 /* True iff TYPE is an Ada modular type. */
11689 ada_is_modular_type (struct type
*type
)
11691 struct type
*subranged_type
= get_base_type (type
);
11693 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11694 && subranged_type
->code () == TYPE_CODE_INT
11695 && TYPE_UNSIGNED (subranged_type
));
11698 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11701 ada_modulus (struct type
*type
)
11703 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11707 /* Ada exception catchpoint support:
11708 ---------------------------------
11710 We support 3 kinds of exception catchpoints:
11711 . catchpoints on Ada exceptions
11712 . catchpoints on unhandled Ada exceptions
11713 . catchpoints on failed assertions
11715 Exceptions raised during failed assertions, or unhandled exceptions
11716 could perfectly be caught with the general catchpoint on Ada exceptions.
11717 However, we can easily differentiate these two special cases, and having
11718 the option to distinguish these two cases from the rest can be useful
11719 to zero-in on certain situations.
11721 Exception catchpoints are a specialized form of breakpoint,
11722 since they rely on inserting breakpoints inside known routines
11723 of the GNAT runtime. The implementation therefore uses a standard
11724 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11727 Support in the runtime for exception catchpoints have been changed
11728 a few times already, and these changes affect the implementation
11729 of these catchpoints. In order to be able to support several
11730 variants of the runtime, we use a sniffer that will determine
11731 the runtime variant used by the program being debugged. */
11733 /* Ada's standard exceptions.
11735 The Ada 83 standard also defined Numeric_Error. But there so many
11736 situations where it was unclear from the Ada 83 Reference Manual
11737 (RM) whether Constraint_Error or Numeric_Error should be raised,
11738 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11739 Interpretation saying that anytime the RM says that Numeric_Error
11740 should be raised, the implementation may raise Constraint_Error.
11741 Ada 95 went one step further and pretty much removed Numeric_Error
11742 from the list of standard exceptions (it made it a renaming of
11743 Constraint_Error, to help preserve compatibility when compiling
11744 an Ada83 compiler). As such, we do not include Numeric_Error from
11745 this list of standard exceptions. */
11747 static const char *standard_exc
[] = {
11748 "constraint_error",
11754 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11756 /* A structure that describes how to support exception catchpoints
11757 for a given executable. */
11759 struct exception_support_info
11761 /* The name of the symbol to break on in order to insert
11762 a catchpoint on exceptions. */
11763 const char *catch_exception_sym
;
11765 /* The name of the symbol to break on in order to insert
11766 a catchpoint on unhandled exceptions. */
11767 const char *catch_exception_unhandled_sym
;
11769 /* The name of the symbol to break on in order to insert
11770 a catchpoint on failed assertions. */
11771 const char *catch_assert_sym
;
11773 /* The name of the symbol to break on in order to insert
11774 a catchpoint on exception handling. */
11775 const char *catch_handlers_sym
;
11777 /* Assuming that the inferior just triggered an unhandled exception
11778 catchpoint, this function is responsible for returning the address
11779 in inferior memory where the name of that exception is stored.
11780 Return zero if the address could not be computed. */
11781 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11784 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11785 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11787 /* The following exception support info structure describes how to
11788 implement exception catchpoints with the latest version of the
11789 Ada runtime (as of 2019-08-??). */
11791 static const struct exception_support_info default_exception_support_info
=
11793 "__gnat_debug_raise_exception", /* catch_exception_sym */
11794 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11795 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11796 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11797 ada_unhandled_exception_name_addr
11800 /* The following exception support info structure describes how to
11801 implement exception catchpoints with an earlier version of the
11802 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11804 static const struct exception_support_info exception_support_info_v0
=
11806 "__gnat_debug_raise_exception", /* catch_exception_sym */
11807 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11808 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11809 "__gnat_begin_handler", /* catch_handlers_sym */
11810 ada_unhandled_exception_name_addr
11813 /* The following exception support info structure describes how to
11814 implement exception catchpoints with a slightly older version
11815 of the Ada runtime. */
11817 static const struct exception_support_info exception_support_info_fallback
=
11819 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11820 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11821 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11822 "__gnat_begin_handler", /* catch_handlers_sym */
11823 ada_unhandled_exception_name_addr_from_raise
11826 /* Return nonzero if we can detect the exception support routines
11827 described in EINFO.
11829 This function errors out if an abnormal situation is detected
11830 (for instance, if we find the exception support routines, but
11831 that support is found to be incomplete). */
11834 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11836 struct symbol
*sym
;
11838 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11839 that should be compiled with debugging information. As a result, we
11840 expect to find that symbol in the symtabs. */
11842 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11845 /* Perhaps we did not find our symbol because the Ada runtime was
11846 compiled without debugging info, or simply stripped of it.
11847 It happens on some GNU/Linux distributions for instance, where
11848 users have to install a separate debug package in order to get
11849 the runtime's debugging info. In that situation, let the user
11850 know why we cannot insert an Ada exception catchpoint.
11852 Note: Just for the purpose of inserting our Ada exception
11853 catchpoint, we could rely purely on the associated minimal symbol.
11854 But we would be operating in degraded mode anyway, since we are
11855 still lacking the debugging info needed later on to extract
11856 the name of the exception being raised (this name is printed in
11857 the catchpoint message, and is also used when trying to catch
11858 a specific exception). We do not handle this case for now. */
11859 struct bound_minimal_symbol msym
11860 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11862 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11863 error (_("Your Ada runtime appears to be missing some debugging "
11864 "information.\nCannot insert Ada exception catchpoint "
11865 "in this configuration."));
11870 /* Make sure that the symbol we found corresponds to a function. */
11872 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11874 error (_("Symbol \"%s\" is not a function (class = %d)"),
11875 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11879 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11882 struct bound_minimal_symbol msym
11883 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11885 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11886 error (_("Your Ada runtime appears to be missing some debugging "
11887 "information.\nCannot insert Ada exception catchpoint "
11888 "in this configuration."));
11893 /* Make sure that the symbol we found corresponds to a function. */
11895 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11897 error (_("Symbol \"%s\" is not a function (class = %d)"),
11898 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11905 /* Inspect the Ada runtime and determine which exception info structure
11906 should be used to provide support for exception catchpoints.
11908 This function will always set the per-inferior exception_info,
11909 or raise an error. */
11912 ada_exception_support_info_sniffer (void)
11914 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11916 /* If the exception info is already known, then no need to recompute it. */
11917 if (data
->exception_info
!= NULL
)
11920 /* Check the latest (default) exception support info. */
11921 if (ada_has_this_exception_support (&default_exception_support_info
))
11923 data
->exception_info
= &default_exception_support_info
;
11927 /* Try the v0 exception suport info. */
11928 if (ada_has_this_exception_support (&exception_support_info_v0
))
11930 data
->exception_info
= &exception_support_info_v0
;
11934 /* Try our fallback exception suport info. */
11935 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11937 data
->exception_info
= &exception_support_info_fallback
;
11941 /* Sometimes, it is normal for us to not be able to find the routine
11942 we are looking for. This happens when the program is linked with
11943 the shared version of the GNAT runtime, and the program has not been
11944 started yet. Inform the user of these two possible causes if
11947 if (ada_update_initial_language (language_unknown
) != language_ada
)
11948 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11950 /* If the symbol does not exist, then check that the program is
11951 already started, to make sure that shared libraries have been
11952 loaded. If it is not started, this may mean that the symbol is
11953 in a shared library. */
11955 if (inferior_ptid
.pid () == 0)
11956 error (_("Unable to insert catchpoint. Try to start the program first."));
11958 /* At this point, we know that we are debugging an Ada program and
11959 that the inferior has been started, but we still are not able to
11960 find the run-time symbols. That can mean that we are in
11961 configurable run time mode, or that a-except as been optimized
11962 out by the linker... In any case, at this point it is not worth
11963 supporting this feature. */
11965 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11968 /* True iff FRAME is very likely to be that of a function that is
11969 part of the runtime system. This is all very heuristic, but is
11970 intended to be used as advice as to what frames are uninteresting
11974 is_known_support_routine (struct frame_info
*frame
)
11976 enum language func_lang
;
11978 const char *fullname
;
11980 /* If this code does not have any debugging information (no symtab),
11981 This cannot be any user code. */
11983 symtab_and_line sal
= find_frame_sal (frame
);
11984 if (sal
.symtab
== NULL
)
11987 /* If there is a symtab, but the associated source file cannot be
11988 located, then assume this is not user code: Selecting a frame
11989 for which we cannot display the code would not be very helpful
11990 for the user. This should also take care of case such as VxWorks
11991 where the kernel has some debugging info provided for a few units. */
11993 fullname
= symtab_to_fullname (sal
.symtab
);
11994 if (access (fullname
, R_OK
) != 0)
11997 /* Check the unit filename against the Ada runtime file naming.
11998 We also check the name of the objfile against the name of some
11999 known system libraries that sometimes come with debugging info
12002 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
12004 re_comp (known_runtime_file_name_patterns
[i
]);
12005 if (re_exec (lbasename (sal
.symtab
->filename
)))
12007 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
12008 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
12012 /* Check whether the function is a GNAT-generated entity. */
12014 gdb::unique_xmalloc_ptr
<char> func_name
12015 = find_frame_funname (frame
, &func_lang
, NULL
);
12016 if (func_name
== NULL
)
12019 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
12021 re_comp (known_auxiliary_function_name_patterns
[i
]);
12022 if (re_exec (func_name
.get ()))
12029 /* Find the first frame that contains debugging information and that is not
12030 part of the Ada run-time, starting from FI and moving upward. */
12033 ada_find_printable_frame (struct frame_info
*fi
)
12035 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
12037 if (!is_known_support_routine (fi
))
12046 /* Assuming that the inferior just triggered an unhandled exception
12047 catchpoint, return the address in inferior memory where the name
12048 of the exception is stored.
12050 Return zero if the address could not be computed. */
12053 ada_unhandled_exception_name_addr (void)
12055 return parse_and_eval_address ("e.full_name");
12058 /* Same as ada_unhandled_exception_name_addr, except that this function
12059 should be used when the inferior uses an older version of the runtime,
12060 where the exception name needs to be extracted from a specific frame
12061 several frames up in the callstack. */
12064 ada_unhandled_exception_name_addr_from_raise (void)
12067 struct frame_info
*fi
;
12068 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12070 /* To determine the name of this exception, we need to select
12071 the frame corresponding to RAISE_SYM_NAME. This frame is
12072 at least 3 levels up, so we simply skip the first 3 frames
12073 without checking the name of their associated function. */
12074 fi
= get_current_frame ();
12075 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
12077 fi
= get_prev_frame (fi
);
12081 enum language func_lang
;
12083 gdb::unique_xmalloc_ptr
<char> func_name
12084 = find_frame_funname (fi
, &func_lang
, NULL
);
12085 if (func_name
!= NULL
)
12087 if (strcmp (func_name
.get (),
12088 data
->exception_info
->catch_exception_sym
) == 0)
12089 break; /* We found the frame we were looking for... */
12091 fi
= get_prev_frame (fi
);
12098 return parse_and_eval_address ("id.full_name");
12101 /* Assuming the inferior just triggered an Ada exception catchpoint
12102 (of any type), return the address in inferior memory where the name
12103 of the exception is stored, if applicable.
12105 Assumes the selected frame is the current frame.
12107 Return zero if the address could not be computed, or if not relevant. */
12110 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12111 struct breakpoint
*b
)
12113 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12117 case ada_catch_exception
:
12118 return (parse_and_eval_address ("e.full_name"));
12121 case ada_catch_exception_unhandled
:
12122 return data
->exception_info
->unhandled_exception_name_addr ();
12125 case ada_catch_handlers
:
12126 return 0; /* The runtimes does not provide access to the exception
12130 case ada_catch_assert
:
12131 return 0; /* Exception name is not relevant in this case. */
12135 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12139 return 0; /* Should never be reached. */
12142 /* Assuming the inferior is stopped at an exception catchpoint,
12143 return the message which was associated to the exception, if
12144 available. Return NULL if the message could not be retrieved.
12146 Note: The exception message can be associated to an exception
12147 either through the use of the Raise_Exception function, or
12148 more simply (Ada 2005 and later), via:
12150 raise Exception_Name with "exception message";
12154 static gdb::unique_xmalloc_ptr
<char>
12155 ada_exception_message_1 (void)
12157 struct value
*e_msg_val
;
12160 /* For runtimes that support this feature, the exception message
12161 is passed as an unbounded string argument called "message". */
12162 e_msg_val
= parse_and_eval ("message");
12163 if (e_msg_val
== NULL
)
12164 return NULL
; /* Exception message not supported. */
12166 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
12167 gdb_assert (e_msg_val
!= NULL
);
12168 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
12170 /* If the message string is empty, then treat it as if there was
12171 no exception message. */
12172 if (e_msg_len
<= 0)
12175 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
12176 read_memory_string (value_address (e_msg_val
), e_msg
.get (), e_msg_len
+ 1);
12177 e_msg
.get ()[e_msg_len
] = '\0';
12182 /* Same as ada_exception_message_1, except that all exceptions are
12183 contained here (returning NULL instead). */
12185 static gdb::unique_xmalloc_ptr
<char>
12186 ada_exception_message (void)
12188 gdb::unique_xmalloc_ptr
<char> e_msg
;
12192 e_msg
= ada_exception_message_1 ();
12194 catch (const gdb_exception_error
&e
)
12196 e_msg
.reset (nullptr);
12202 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12203 any error that ada_exception_name_addr_1 might cause to be thrown.
12204 When an error is intercepted, a warning with the error message is printed,
12205 and zero is returned. */
12208 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12209 struct breakpoint
*b
)
12211 CORE_ADDR result
= 0;
12215 result
= ada_exception_name_addr_1 (ex
, b
);
12218 catch (const gdb_exception_error
&e
)
12220 warning (_("failed to get exception name: %s"), e
.what ());
12227 static std::string ada_exception_catchpoint_cond_string
12228 (const char *excep_string
,
12229 enum ada_exception_catchpoint_kind ex
);
12231 /* Ada catchpoints.
12233 In the case of catchpoints on Ada exceptions, the catchpoint will
12234 stop the target on every exception the program throws. When a user
12235 specifies the name of a specific exception, we translate this
12236 request into a condition expression (in text form), and then parse
12237 it into an expression stored in each of the catchpoint's locations.
12238 We then use this condition to check whether the exception that was
12239 raised is the one the user is interested in. If not, then the
12240 target is resumed again. We store the name of the requested
12241 exception, in order to be able to re-set the condition expression
12242 when symbols change. */
12244 /* An instance of this type is used to represent an Ada catchpoint
12245 breakpoint location. */
12247 class ada_catchpoint_location
: public bp_location
12250 ada_catchpoint_location (breakpoint
*owner
)
12251 : bp_location (owner
, bp_loc_software_breakpoint
)
12254 /* The condition that checks whether the exception that was raised
12255 is the specific exception the user specified on catchpoint
12257 expression_up excep_cond_expr
;
12260 /* An instance of this type is used to represent an Ada catchpoint. */
12262 struct ada_catchpoint
: public breakpoint
12264 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12269 /* The name of the specific exception the user specified. */
12270 std::string excep_string
;
12272 /* What kind of catchpoint this is. */
12273 enum ada_exception_catchpoint_kind m_kind
;
12276 /* Parse the exception condition string in the context of each of the
12277 catchpoint's locations, and store them for later evaluation. */
12280 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12281 enum ada_exception_catchpoint_kind ex
)
12283 struct bp_location
*bl
;
12285 /* Nothing to do if there's no specific exception to catch. */
12286 if (c
->excep_string
.empty ())
12289 /* Same if there are no locations... */
12290 if (c
->loc
== NULL
)
12293 /* Compute the condition expression in text form, from the specific
12294 expection we want to catch. */
12295 std::string cond_string
12296 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12298 /* Iterate over all the catchpoint's locations, and parse an
12299 expression for each. */
12300 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12302 struct ada_catchpoint_location
*ada_loc
12303 = (struct ada_catchpoint_location
*) bl
;
12306 if (!bl
->shlib_disabled
)
12310 s
= cond_string
.c_str ();
12313 exp
= parse_exp_1 (&s
, bl
->address
,
12314 block_for_pc (bl
->address
),
12317 catch (const gdb_exception_error
&e
)
12319 warning (_("failed to reevaluate internal exception condition "
12320 "for catchpoint %d: %s"),
12321 c
->number
, e
.what ());
12325 ada_loc
->excep_cond_expr
= std::move (exp
);
12329 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12330 structure for all exception catchpoint kinds. */
12332 static struct bp_location
*
12333 allocate_location_exception (struct breakpoint
*self
)
12335 return new ada_catchpoint_location (self
);
12338 /* Implement the RE_SET method in the breakpoint_ops structure for all
12339 exception catchpoint kinds. */
12342 re_set_exception (struct breakpoint
*b
)
12344 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12346 /* Call the base class's method. This updates the catchpoint's
12348 bkpt_breakpoint_ops
.re_set (b
);
12350 /* Reparse the exception conditional expressions. One for each
12352 create_excep_cond_exprs (c
, c
->m_kind
);
12355 /* Returns true if we should stop for this breakpoint hit. If the
12356 user specified a specific exception, we only want to cause a stop
12357 if the program thrown that exception. */
12360 should_stop_exception (const struct bp_location
*bl
)
12362 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12363 const struct ada_catchpoint_location
*ada_loc
12364 = (const struct ada_catchpoint_location
*) bl
;
12367 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12368 if (c
->m_kind
== ada_catch_assert
)
12369 clear_internalvar (var
);
12376 if (c
->m_kind
== ada_catch_handlers
)
12377 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12378 ".all.occurrence.id");
12382 struct value
*exc
= parse_and_eval (expr
);
12383 set_internalvar (var
, exc
);
12385 catch (const gdb_exception_error
&ex
)
12387 clear_internalvar (var
);
12391 /* With no specific exception, should always stop. */
12392 if (c
->excep_string
.empty ())
12395 if (ada_loc
->excep_cond_expr
== NULL
)
12397 /* We will have a NULL expression if back when we were creating
12398 the expressions, this location's had failed to parse. */
12405 struct value
*mark
;
12407 mark
= value_mark ();
12408 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12409 value_free_to_mark (mark
);
12411 catch (const gdb_exception
&ex
)
12413 exception_fprintf (gdb_stderr
, ex
,
12414 _("Error in testing exception condition:\n"));
12420 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12421 for all exception catchpoint kinds. */
12424 check_status_exception (bpstat bs
)
12426 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12429 /* Implement the PRINT_IT method in the breakpoint_ops structure
12430 for all exception catchpoint kinds. */
12432 static enum print_stop_action
12433 print_it_exception (bpstat bs
)
12435 struct ui_out
*uiout
= current_uiout
;
12436 struct breakpoint
*b
= bs
->breakpoint_at
;
12438 annotate_catchpoint (b
->number
);
12440 if (uiout
->is_mi_like_p ())
12442 uiout
->field_string ("reason",
12443 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12444 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12447 uiout
->text (b
->disposition
== disp_del
12448 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12449 uiout
->field_signed ("bkptno", b
->number
);
12450 uiout
->text (", ");
12452 /* ada_exception_name_addr relies on the selected frame being the
12453 current frame. Need to do this here because this function may be
12454 called more than once when printing a stop, and below, we'll
12455 select the first frame past the Ada run-time (see
12456 ada_find_printable_frame). */
12457 select_frame (get_current_frame ());
12459 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12462 case ada_catch_exception
:
12463 case ada_catch_exception_unhandled
:
12464 case ada_catch_handlers
:
12466 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12467 char exception_name
[256];
12471 read_memory (addr
, (gdb_byte
*) exception_name
,
12472 sizeof (exception_name
) - 1);
12473 exception_name
[sizeof (exception_name
) - 1] = '\0';
12477 /* For some reason, we were unable to read the exception
12478 name. This could happen if the Runtime was compiled
12479 without debugging info, for instance. In that case,
12480 just replace the exception name by the generic string
12481 "exception" - it will read as "an exception" in the
12482 notification we are about to print. */
12483 memcpy (exception_name
, "exception", sizeof ("exception"));
12485 /* In the case of unhandled exception breakpoints, we print
12486 the exception name as "unhandled EXCEPTION_NAME", to make
12487 it clearer to the user which kind of catchpoint just got
12488 hit. We used ui_out_text to make sure that this extra
12489 info does not pollute the exception name in the MI case. */
12490 if (c
->m_kind
== ada_catch_exception_unhandled
)
12491 uiout
->text ("unhandled ");
12492 uiout
->field_string ("exception-name", exception_name
);
12495 case ada_catch_assert
:
12496 /* In this case, the name of the exception is not really
12497 important. Just print "failed assertion" to make it clearer
12498 that his program just hit an assertion-failure catchpoint.
12499 We used ui_out_text because this info does not belong in
12501 uiout
->text ("failed assertion");
12505 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12506 if (exception_message
!= NULL
)
12508 uiout
->text (" (");
12509 uiout
->field_string ("exception-message", exception_message
.get ());
12513 uiout
->text (" at ");
12514 ada_find_printable_frame (get_current_frame ());
12516 return PRINT_SRC_AND_LOC
;
12519 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12520 for all exception catchpoint kinds. */
12523 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12525 struct ui_out
*uiout
= current_uiout
;
12526 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12527 struct value_print_options opts
;
12529 get_user_print_options (&opts
);
12531 if (opts
.addressprint
)
12532 uiout
->field_skip ("addr");
12534 annotate_field (5);
12537 case ada_catch_exception
:
12538 if (!c
->excep_string
.empty ())
12540 std::string msg
= string_printf (_("`%s' Ada exception"),
12541 c
->excep_string
.c_str ());
12543 uiout
->field_string ("what", msg
);
12546 uiout
->field_string ("what", "all Ada exceptions");
12550 case ada_catch_exception_unhandled
:
12551 uiout
->field_string ("what", "unhandled Ada exceptions");
12554 case ada_catch_handlers
:
12555 if (!c
->excep_string
.empty ())
12557 uiout
->field_fmt ("what",
12558 _("`%s' Ada exception handlers"),
12559 c
->excep_string
.c_str ());
12562 uiout
->field_string ("what", "all Ada exceptions handlers");
12565 case ada_catch_assert
:
12566 uiout
->field_string ("what", "failed Ada assertions");
12570 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12575 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12576 for all exception catchpoint kinds. */
12579 print_mention_exception (struct breakpoint
*b
)
12581 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12582 struct ui_out
*uiout
= current_uiout
;
12584 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12585 : _("Catchpoint "));
12586 uiout
->field_signed ("bkptno", b
->number
);
12587 uiout
->text (": ");
12591 case ada_catch_exception
:
12592 if (!c
->excep_string
.empty ())
12594 std::string info
= string_printf (_("`%s' Ada exception"),
12595 c
->excep_string
.c_str ());
12596 uiout
->text (info
.c_str ());
12599 uiout
->text (_("all Ada exceptions"));
12602 case ada_catch_exception_unhandled
:
12603 uiout
->text (_("unhandled Ada exceptions"));
12606 case ada_catch_handlers
:
12607 if (!c
->excep_string
.empty ())
12610 = string_printf (_("`%s' Ada exception handlers"),
12611 c
->excep_string
.c_str ());
12612 uiout
->text (info
.c_str ());
12615 uiout
->text (_("all Ada exceptions handlers"));
12618 case ada_catch_assert
:
12619 uiout
->text (_("failed Ada assertions"));
12623 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12628 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12629 for all exception catchpoint kinds. */
12632 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12634 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12638 case ada_catch_exception
:
12639 fprintf_filtered (fp
, "catch exception");
12640 if (!c
->excep_string
.empty ())
12641 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12644 case ada_catch_exception_unhandled
:
12645 fprintf_filtered (fp
, "catch exception unhandled");
12648 case ada_catch_handlers
:
12649 fprintf_filtered (fp
, "catch handlers");
12652 case ada_catch_assert
:
12653 fprintf_filtered (fp
, "catch assert");
12657 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12659 print_recreate_thread (b
, fp
);
12662 /* Virtual tables for various breakpoint types. */
12663 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12664 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12665 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12666 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12668 /* See ada-lang.h. */
12671 is_ada_exception_catchpoint (breakpoint
*bp
)
12673 return (bp
->ops
== &catch_exception_breakpoint_ops
12674 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12675 || bp
->ops
== &catch_assert_breakpoint_ops
12676 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12679 /* Split the arguments specified in a "catch exception" command.
12680 Set EX to the appropriate catchpoint type.
12681 Set EXCEP_STRING to the name of the specific exception if
12682 specified by the user.
12683 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12684 "catch handlers" command. False otherwise.
12685 If a condition is found at the end of the arguments, the condition
12686 expression is stored in COND_STRING (memory must be deallocated
12687 after use). Otherwise COND_STRING is set to NULL. */
12690 catch_ada_exception_command_split (const char *args
,
12691 bool is_catch_handlers_cmd
,
12692 enum ada_exception_catchpoint_kind
*ex
,
12693 std::string
*excep_string
,
12694 std::string
*cond_string
)
12696 std::string exception_name
;
12698 exception_name
= extract_arg (&args
);
12699 if (exception_name
== "if")
12701 /* This is not an exception name; this is the start of a condition
12702 expression for a catchpoint on all exceptions. So, "un-get"
12703 this token, and set exception_name to NULL. */
12704 exception_name
.clear ();
12708 /* Check to see if we have a condition. */
12710 args
= skip_spaces (args
);
12711 if (startswith (args
, "if")
12712 && (isspace (args
[2]) || args
[2] == '\0'))
12715 args
= skip_spaces (args
);
12717 if (args
[0] == '\0')
12718 error (_("Condition missing after `if' keyword"));
12719 *cond_string
= args
;
12721 args
+= strlen (args
);
12724 /* Check that we do not have any more arguments. Anything else
12727 if (args
[0] != '\0')
12728 error (_("Junk at end of expression"));
12730 if (is_catch_handlers_cmd
)
12732 /* Catch handling of exceptions. */
12733 *ex
= ada_catch_handlers
;
12734 *excep_string
= exception_name
;
12736 else if (exception_name
.empty ())
12738 /* Catch all exceptions. */
12739 *ex
= ada_catch_exception
;
12740 excep_string
->clear ();
12742 else if (exception_name
== "unhandled")
12744 /* Catch unhandled exceptions. */
12745 *ex
= ada_catch_exception_unhandled
;
12746 excep_string
->clear ();
12750 /* Catch a specific exception. */
12751 *ex
= ada_catch_exception
;
12752 *excep_string
= exception_name
;
12756 /* Return the name of the symbol on which we should break in order to
12757 implement a catchpoint of the EX kind. */
12759 static const char *
12760 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12762 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12764 gdb_assert (data
->exception_info
!= NULL
);
12768 case ada_catch_exception
:
12769 return (data
->exception_info
->catch_exception_sym
);
12771 case ada_catch_exception_unhandled
:
12772 return (data
->exception_info
->catch_exception_unhandled_sym
);
12774 case ada_catch_assert
:
12775 return (data
->exception_info
->catch_assert_sym
);
12777 case ada_catch_handlers
:
12778 return (data
->exception_info
->catch_handlers_sym
);
12781 internal_error (__FILE__
, __LINE__
,
12782 _("unexpected catchpoint kind (%d)"), ex
);
12786 /* Return the breakpoint ops "virtual table" used for catchpoints
12789 static const struct breakpoint_ops
*
12790 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12794 case ada_catch_exception
:
12795 return (&catch_exception_breakpoint_ops
);
12797 case ada_catch_exception_unhandled
:
12798 return (&catch_exception_unhandled_breakpoint_ops
);
12800 case ada_catch_assert
:
12801 return (&catch_assert_breakpoint_ops
);
12803 case ada_catch_handlers
:
12804 return (&catch_handlers_breakpoint_ops
);
12807 internal_error (__FILE__
, __LINE__
,
12808 _("unexpected catchpoint kind (%d)"), ex
);
12812 /* Return the condition that will be used to match the current exception
12813 being raised with the exception that the user wants to catch. This
12814 assumes that this condition is used when the inferior just triggered
12815 an exception catchpoint.
12816 EX: the type of catchpoints used for catching Ada exceptions. */
12819 ada_exception_catchpoint_cond_string (const char *excep_string
,
12820 enum ada_exception_catchpoint_kind ex
)
12823 bool is_standard_exc
= false;
12824 std::string result
;
12826 if (ex
== ada_catch_handlers
)
12828 /* For exception handlers catchpoints, the condition string does
12829 not use the same parameter as for the other exceptions. */
12830 result
= ("long_integer (GNAT_GCC_exception_Access"
12831 "(gcc_exception).all.occurrence.id)");
12834 result
= "long_integer (e)";
12836 /* The standard exceptions are a special case. They are defined in
12837 runtime units that have been compiled without debugging info; if
12838 EXCEP_STRING is the not-fully-qualified name of a standard
12839 exception (e.g. "constraint_error") then, during the evaluation
12840 of the condition expression, the symbol lookup on this name would
12841 *not* return this standard exception. The catchpoint condition
12842 may then be set only on user-defined exceptions which have the
12843 same not-fully-qualified name (e.g. my_package.constraint_error).
12845 To avoid this unexcepted behavior, these standard exceptions are
12846 systematically prefixed by "standard". This means that "catch
12847 exception constraint_error" is rewritten into "catch exception
12848 standard.constraint_error".
12850 If an exception named constraint_error is defined in another package of
12851 the inferior program, then the only way to specify this exception as a
12852 breakpoint condition is to use its fully-qualified named:
12853 e.g. my_package.constraint_error. */
12855 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12857 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12859 is_standard_exc
= true;
12866 if (is_standard_exc
)
12867 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12869 string_appendf (result
, "long_integer (&%s)", excep_string
);
12874 /* Return the symtab_and_line that should be used to insert an exception
12875 catchpoint of the TYPE kind.
12877 ADDR_STRING returns the name of the function where the real
12878 breakpoint that implements the catchpoints is set, depending on the
12879 type of catchpoint we need to create. */
12881 static struct symtab_and_line
12882 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12883 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12885 const char *sym_name
;
12886 struct symbol
*sym
;
12888 /* First, find out which exception support info to use. */
12889 ada_exception_support_info_sniffer ();
12891 /* Then lookup the function on which we will break in order to catch
12892 the Ada exceptions requested by the user. */
12893 sym_name
= ada_exception_sym_name (ex
);
12894 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12897 error (_("Catchpoint symbol not found: %s"), sym_name
);
12899 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12900 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12902 /* Set ADDR_STRING. */
12903 *addr_string
= sym_name
;
12906 *ops
= ada_exception_breakpoint_ops (ex
);
12908 return find_function_start_sal (sym
, 1);
12911 /* Create an Ada exception catchpoint.
12913 EX_KIND is the kind of exception catchpoint to be created.
12915 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12916 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12917 of the exception to which this catchpoint applies.
12919 COND_STRING, if not empty, is the catchpoint condition.
12921 TEMPFLAG, if nonzero, means that the underlying breakpoint
12922 should be temporary.
12924 FROM_TTY is the usual argument passed to all commands implementations. */
12927 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12928 enum ada_exception_catchpoint_kind ex_kind
,
12929 const std::string
&excep_string
,
12930 const std::string
&cond_string
,
12935 std::string addr_string
;
12936 const struct breakpoint_ops
*ops
= NULL
;
12937 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12939 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12940 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12941 ops
, tempflag
, disabled
, from_tty
);
12942 c
->excep_string
= excep_string
;
12943 create_excep_cond_exprs (c
.get (), ex_kind
);
12944 if (!cond_string
.empty ())
12945 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
);
12946 install_breakpoint (0, std::move (c
), 1);
12949 /* Implement the "catch exception" command. */
12952 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12953 struct cmd_list_element
*command
)
12955 const char *arg
= arg_entry
;
12956 struct gdbarch
*gdbarch
= get_current_arch ();
12958 enum ada_exception_catchpoint_kind ex_kind
;
12959 std::string excep_string
;
12960 std::string cond_string
;
12962 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12966 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12968 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12969 excep_string
, cond_string
,
12970 tempflag
, 1 /* enabled */,
12974 /* Implement the "catch handlers" command. */
12977 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12978 struct cmd_list_element
*command
)
12980 const char *arg
= arg_entry
;
12981 struct gdbarch
*gdbarch
= get_current_arch ();
12983 enum ada_exception_catchpoint_kind ex_kind
;
12984 std::string excep_string
;
12985 std::string cond_string
;
12987 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12991 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
12993 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12994 excep_string
, cond_string
,
12995 tempflag
, 1 /* enabled */,
12999 /* Completion function for the Ada "catch" commands. */
13002 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
13003 const char *text
, const char *word
)
13005 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
13007 for (const ada_exc_info
&info
: exceptions
)
13009 if (startswith (info
.name
, word
))
13010 tracker
.add_completion (make_unique_xstrdup (info
.name
));
13014 /* Split the arguments specified in a "catch assert" command.
13016 ARGS contains the command's arguments (or the empty string if
13017 no arguments were passed).
13019 If ARGS contains a condition, set COND_STRING to that condition
13020 (the memory needs to be deallocated after use). */
13023 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
13025 args
= skip_spaces (args
);
13027 /* Check whether a condition was provided. */
13028 if (startswith (args
, "if")
13029 && (isspace (args
[2]) || args
[2] == '\0'))
13032 args
= skip_spaces (args
);
13033 if (args
[0] == '\0')
13034 error (_("condition missing after `if' keyword"));
13035 cond_string
.assign (args
);
13038 /* Otherwise, there should be no other argument at the end of
13040 else if (args
[0] != '\0')
13041 error (_("Junk at end of arguments."));
13044 /* Implement the "catch assert" command. */
13047 catch_assert_command (const char *arg_entry
, int from_tty
,
13048 struct cmd_list_element
*command
)
13050 const char *arg
= arg_entry
;
13051 struct gdbarch
*gdbarch
= get_current_arch ();
13053 std::string cond_string
;
13055 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13059 catch_ada_assert_command_split (arg
, cond_string
);
13060 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
13062 tempflag
, 1 /* enabled */,
13066 /* Return non-zero if the symbol SYM is an Ada exception object. */
13069 ada_is_exception_sym (struct symbol
*sym
)
13071 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
13073 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
13074 && SYMBOL_CLASS (sym
) != LOC_BLOCK
13075 && SYMBOL_CLASS (sym
) != LOC_CONST
13076 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
13077 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
13080 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13081 Ada exception object. This matches all exceptions except the ones
13082 defined by the Ada language. */
13085 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13089 if (!ada_is_exception_sym (sym
))
13092 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13093 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
13094 return 0; /* A standard exception. */
13096 /* Numeric_Error is also a standard exception, so exclude it.
13097 See the STANDARD_EXC description for more details as to why
13098 this exception is not listed in that array. */
13099 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
13105 /* A helper function for std::sort, comparing two struct ada_exc_info
13108 The comparison is determined first by exception name, and then
13109 by exception address. */
13112 ada_exc_info::operator< (const ada_exc_info
&other
) const
13116 result
= strcmp (name
, other
.name
);
13119 if (result
== 0 && addr
< other
.addr
)
13125 ada_exc_info::operator== (const ada_exc_info
&other
) const
13127 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
13130 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13131 routine, but keeping the first SKIP elements untouched.
13133 All duplicates are also removed. */
13136 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
13139 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
13140 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
13141 exceptions
->end ());
13144 /* Add all exceptions defined by the Ada standard whose name match
13145 a regular expression.
13147 If PREG is not NULL, then this regexp_t object is used to
13148 perform the symbol name matching. Otherwise, no name-based
13149 filtering is performed.
13151 EXCEPTIONS is a vector of exceptions to which matching exceptions
13155 ada_add_standard_exceptions (compiled_regex
*preg
,
13156 std::vector
<ada_exc_info
> *exceptions
)
13160 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13163 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
13165 struct bound_minimal_symbol msymbol
13166 = ada_lookup_simple_minsym (standard_exc
[i
]);
13168 if (msymbol
.minsym
!= NULL
)
13170 struct ada_exc_info info
13171 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13173 exceptions
->push_back (info
);
13179 /* Add all Ada exceptions defined locally and accessible from the given
13182 If PREG is not NULL, then this regexp_t object is used to
13183 perform the symbol name matching. Otherwise, no name-based
13184 filtering is performed.
13186 EXCEPTIONS is a vector of exceptions to which matching exceptions
13190 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13191 struct frame_info
*frame
,
13192 std::vector
<ada_exc_info
> *exceptions
)
13194 const struct block
*block
= get_frame_block (frame
, 0);
13198 struct block_iterator iter
;
13199 struct symbol
*sym
;
13201 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13203 switch (SYMBOL_CLASS (sym
))
13210 if (ada_is_exception_sym (sym
))
13212 struct ada_exc_info info
= {sym
->print_name (),
13213 SYMBOL_VALUE_ADDRESS (sym
)};
13215 exceptions
->push_back (info
);
13219 if (BLOCK_FUNCTION (block
) != NULL
)
13221 block
= BLOCK_SUPERBLOCK (block
);
13225 /* Return true if NAME matches PREG or if PREG is NULL. */
13228 name_matches_regex (const char *name
, compiled_regex
*preg
)
13230 return (preg
== NULL
13231 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13234 /* Add all exceptions defined globally whose name name match
13235 a regular expression, excluding standard exceptions.
13237 The reason we exclude standard exceptions is that they need
13238 to be handled separately: Standard exceptions are defined inside
13239 a runtime unit which is normally not compiled with debugging info,
13240 and thus usually do not show up in our symbol search. However,
13241 if the unit was in fact built with debugging info, we need to
13242 exclude them because they would duplicate the entry we found
13243 during the special loop that specifically searches for those
13244 standard exceptions.
13246 If PREG is not NULL, then this regexp_t object is used to
13247 perform the symbol name matching. Otherwise, no name-based
13248 filtering is performed.
13250 EXCEPTIONS is a vector of exceptions to which matching exceptions
13254 ada_add_global_exceptions (compiled_regex
*preg
,
13255 std::vector
<ada_exc_info
> *exceptions
)
13257 /* In Ada, the symbol "search name" is a linkage name, whereas the
13258 regular expression used to do the matching refers to the natural
13259 name. So match against the decoded name. */
13260 expand_symtabs_matching (NULL
,
13261 lookup_name_info::match_any (),
13262 [&] (const char *search_name
)
13264 std::string decoded
= ada_decode (search_name
);
13265 return name_matches_regex (decoded
.c_str (), preg
);
13270 for (objfile
*objfile
: current_program_space
->objfiles ())
13272 for (compunit_symtab
*s
: objfile
->compunits ())
13274 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13277 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13279 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13280 struct block_iterator iter
;
13281 struct symbol
*sym
;
13283 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13284 if (ada_is_non_standard_exception_sym (sym
)
13285 && name_matches_regex (sym
->natural_name (), preg
))
13287 struct ada_exc_info info
13288 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13290 exceptions
->push_back (info
);
13297 /* Implements ada_exceptions_list with the regular expression passed
13298 as a regex_t, rather than a string.
13300 If not NULL, PREG is used to filter out exceptions whose names
13301 do not match. Otherwise, all exceptions are listed. */
13303 static std::vector
<ada_exc_info
>
13304 ada_exceptions_list_1 (compiled_regex
*preg
)
13306 std::vector
<ada_exc_info
> result
;
13309 /* First, list the known standard exceptions. These exceptions
13310 need to be handled separately, as they are usually defined in
13311 runtime units that have been compiled without debugging info. */
13313 ada_add_standard_exceptions (preg
, &result
);
13315 /* Next, find all exceptions whose scope is local and accessible
13316 from the currently selected frame. */
13318 if (has_stack_frames ())
13320 prev_len
= result
.size ();
13321 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13323 if (result
.size () > prev_len
)
13324 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13327 /* Add all exceptions whose scope is global. */
13329 prev_len
= result
.size ();
13330 ada_add_global_exceptions (preg
, &result
);
13331 if (result
.size () > prev_len
)
13332 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13337 /* Return a vector of ada_exc_info.
13339 If REGEXP is NULL, all exceptions are included in the result.
13340 Otherwise, it should contain a valid regular expression,
13341 and only the exceptions whose names match that regular expression
13342 are included in the result.
13344 The exceptions are sorted in the following order:
13345 - Standard exceptions (defined by the Ada language), in
13346 alphabetical order;
13347 - Exceptions only visible from the current frame, in
13348 alphabetical order;
13349 - Exceptions whose scope is global, in alphabetical order. */
13351 std::vector
<ada_exc_info
>
13352 ada_exceptions_list (const char *regexp
)
13354 if (regexp
== NULL
)
13355 return ada_exceptions_list_1 (NULL
);
13357 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13358 return ada_exceptions_list_1 (®
);
13361 /* Implement the "info exceptions" command. */
13364 info_exceptions_command (const char *regexp
, int from_tty
)
13366 struct gdbarch
*gdbarch
= get_current_arch ();
13368 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13370 if (regexp
!= NULL
)
13372 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13374 printf_filtered (_("All defined Ada exceptions:\n"));
13376 for (const ada_exc_info
&info
: exceptions
)
13377 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13381 /* Information about operators given special treatment in functions
13383 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13385 #define ADA_OPERATORS \
13386 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13387 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13388 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13389 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13390 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13391 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13392 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13393 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13394 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13395 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13396 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13397 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13398 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13399 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13400 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13401 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13402 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13403 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13404 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13407 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13410 switch (exp
->elts
[pc
- 1].opcode
)
13413 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13416 #define OP_DEFN(op, len, args, binop) \
13417 case op: *oplenp = len; *argsp = args; break;
13423 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13428 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13433 /* Implementation of the exp_descriptor method operator_check. */
13436 ada_operator_check (struct expression
*exp
, int pos
,
13437 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13440 const union exp_element
*const elts
= exp
->elts
;
13441 struct type
*type
= NULL
;
13443 switch (elts
[pos
].opcode
)
13445 case UNOP_IN_RANGE
:
13447 type
= elts
[pos
+ 1].type
;
13451 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13454 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13456 if (type
&& TYPE_OBJFILE (type
)
13457 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13463 static const char *
13464 ada_op_name (enum exp_opcode opcode
)
13469 return op_name_standard (opcode
);
13471 #define OP_DEFN(op, len, args, binop) case op: return #op;
13476 return "OP_AGGREGATE";
13478 return "OP_CHOICES";
13484 /* As for operator_length, but assumes PC is pointing at the first
13485 element of the operator, and gives meaningful results only for the
13486 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13489 ada_forward_operator_length (struct expression
*exp
, int pc
,
13490 int *oplenp
, int *argsp
)
13492 switch (exp
->elts
[pc
].opcode
)
13495 *oplenp
= *argsp
= 0;
13498 #define OP_DEFN(op, len, args, binop) \
13499 case op: *oplenp = len; *argsp = args; break;
13505 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13510 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13516 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13518 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13526 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13528 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13533 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13537 /* Ada attributes ('Foo). */
13540 case OP_ATR_LENGTH
:
13544 case OP_ATR_MODULUS
:
13551 case UNOP_IN_RANGE
:
13553 /* XXX: gdb_sprint_host_address, type_sprint */
13554 fprintf_filtered (stream
, _("Type @"));
13555 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13556 fprintf_filtered (stream
, " (");
13557 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13558 fprintf_filtered (stream
, ")");
13560 case BINOP_IN_BOUNDS
:
13561 fprintf_filtered (stream
, " (%d)",
13562 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13564 case TERNOP_IN_RANGE
:
13569 case OP_DISCRETE_RANGE
:
13570 case OP_POSITIONAL
:
13577 char *name
= &exp
->elts
[elt
+ 2].string
;
13578 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13580 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13585 return dump_subexp_body_standard (exp
, stream
, elt
);
13589 for (i
= 0; i
< nargs
; i
+= 1)
13590 elt
= dump_subexp (exp
, stream
, elt
);
13595 /* The Ada extension of print_subexp (q.v.). */
13598 ada_print_subexp (struct expression
*exp
, int *pos
,
13599 struct ui_file
*stream
, enum precedence prec
)
13601 int oplen
, nargs
, i
;
13603 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13605 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13612 print_subexp_standard (exp
, pos
, stream
, prec
);
13616 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13619 case BINOP_IN_BOUNDS
:
13620 /* XXX: sprint_subexp */
13621 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13622 fputs_filtered (" in ", stream
);
13623 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13624 fputs_filtered ("'range", stream
);
13625 if (exp
->elts
[pc
+ 1].longconst
> 1)
13626 fprintf_filtered (stream
, "(%ld)",
13627 (long) exp
->elts
[pc
+ 1].longconst
);
13630 case TERNOP_IN_RANGE
:
13631 if (prec
>= PREC_EQUAL
)
13632 fputs_filtered ("(", stream
);
13633 /* XXX: sprint_subexp */
13634 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13635 fputs_filtered (" in ", stream
);
13636 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13637 fputs_filtered (" .. ", stream
);
13638 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13639 if (prec
>= PREC_EQUAL
)
13640 fputs_filtered (")", stream
);
13645 case OP_ATR_LENGTH
:
13649 case OP_ATR_MODULUS
:
13654 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13656 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13657 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13658 &type_print_raw_options
);
13662 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13663 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13668 for (tem
= 1; tem
< nargs
; tem
+= 1)
13670 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13671 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13673 fputs_filtered (")", stream
);
13678 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13679 fputs_filtered ("'(", stream
);
13680 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13681 fputs_filtered (")", stream
);
13684 case UNOP_IN_RANGE
:
13685 /* XXX: sprint_subexp */
13686 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13687 fputs_filtered (" in ", stream
);
13688 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13689 &type_print_raw_options
);
13692 case OP_DISCRETE_RANGE
:
13693 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13694 fputs_filtered ("..", stream
);
13695 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13699 fputs_filtered ("others => ", stream
);
13700 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13704 for (i
= 0; i
< nargs
-1; i
+= 1)
13707 fputs_filtered ("|", stream
);
13708 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13710 fputs_filtered (" => ", stream
);
13711 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13714 case OP_POSITIONAL
:
13715 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13719 fputs_filtered ("(", stream
);
13720 for (i
= 0; i
< nargs
; i
+= 1)
13723 fputs_filtered (", ", stream
);
13724 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13726 fputs_filtered (")", stream
);
13731 /* Table mapping opcodes into strings for printing operators
13732 and precedences of the operators. */
13734 static const struct op_print ada_op_print_tab
[] = {
13735 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13736 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13737 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13738 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13739 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13740 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13741 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13742 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13743 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13744 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13745 {">", BINOP_GTR
, PREC_ORDER
, 0},
13746 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13747 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13748 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13749 {"+", BINOP_ADD
, PREC_ADD
, 0},
13750 {"-", BINOP_SUB
, PREC_ADD
, 0},
13751 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13752 {"*", BINOP_MUL
, PREC_MUL
, 0},
13753 {"/", BINOP_DIV
, PREC_MUL
, 0},
13754 {"rem", BINOP_REM
, PREC_MUL
, 0},
13755 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13756 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13757 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13758 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13759 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13760 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13761 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13762 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13763 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13764 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13765 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13766 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13769 enum ada_primitive_types
{
13770 ada_primitive_type_int
,
13771 ada_primitive_type_long
,
13772 ada_primitive_type_short
,
13773 ada_primitive_type_char
,
13774 ada_primitive_type_float
,
13775 ada_primitive_type_double
,
13776 ada_primitive_type_void
,
13777 ada_primitive_type_long_long
,
13778 ada_primitive_type_long_double
,
13779 ada_primitive_type_natural
,
13780 ada_primitive_type_positive
,
13781 ada_primitive_type_system_address
,
13782 ada_primitive_type_storage_offset
,
13783 nr_ada_primitive_types
13787 ada_language_arch_info (struct gdbarch
*gdbarch
,
13788 struct language_arch_info
*lai
)
13790 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13792 lai
->primitive_type_vector
13793 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13796 lai
->primitive_type_vector
[ada_primitive_type_int
]
13797 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13799 lai
->primitive_type_vector
[ada_primitive_type_long
]
13800 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13801 0, "long_integer");
13802 lai
->primitive_type_vector
[ada_primitive_type_short
]
13803 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13804 0, "short_integer");
13805 lai
->string_char_type
13806 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13807 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13808 lai
->primitive_type_vector
[ada_primitive_type_float
]
13809 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13810 "float", gdbarch_float_format (gdbarch
));
13811 lai
->primitive_type_vector
[ada_primitive_type_double
]
13812 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13813 "long_float", gdbarch_double_format (gdbarch
));
13814 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13815 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13816 0, "long_long_integer");
13817 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13818 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13819 "long_long_float", gdbarch_long_double_format (gdbarch
));
13820 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13821 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13823 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13824 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13826 lai
->primitive_type_vector
[ada_primitive_type_void
]
13827 = builtin
->builtin_void
;
13829 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13830 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13832 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13833 ->set_name ("system__address");
13835 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13836 type. This is a signed integral type whose size is the same as
13837 the size of addresses. */
13839 unsigned int addr_length
= TYPE_LENGTH
13840 (lai
->primitive_type_vector
[ada_primitive_type_system_address
]);
13842 lai
->primitive_type_vector
[ada_primitive_type_storage_offset
]
13843 = arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13847 lai
->bool_type_symbol
= NULL
;
13848 lai
->bool_type_default
= builtin
->builtin_bool
;
13851 /* Language vector */
13853 /* Not really used, but needed in the ada_language_defn. */
13856 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13858 ada_emit_char (c
, type
, stream
, quoter
, 1);
13862 parse (struct parser_state
*ps
)
13864 warnings_issued
= 0;
13865 return ada_parse (ps
);
13868 static const struct exp_descriptor ada_exp_descriptor
= {
13870 ada_operator_length
,
13871 ada_operator_check
,
13873 ada_dump_subexp_body
,
13874 ada_evaluate_subexp
13877 /* symbol_name_matcher_ftype adapter for wild_match. */
13880 do_wild_match (const char *symbol_search_name
,
13881 const lookup_name_info
&lookup_name
,
13882 completion_match_result
*comp_match_res
)
13884 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13887 /* symbol_name_matcher_ftype adapter for full_match. */
13890 do_full_match (const char *symbol_search_name
,
13891 const lookup_name_info
&lookup_name
,
13892 completion_match_result
*comp_match_res
)
13894 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13897 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13900 do_exact_match (const char *symbol_search_name
,
13901 const lookup_name_info
&lookup_name
,
13902 completion_match_result
*comp_match_res
)
13904 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13907 /* Build the Ada lookup name for LOOKUP_NAME. */
13909 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13911 gdb::string_view user_name
= lookup_name
.name ();
13913 if (user_name
[0] == '<')
13915 if (user_name
.back () == '>')
13917 = user_name
.substr (1, user_name
.size () - 2).to_string ();
13920 = user_name
.substr (1, user_name
.size () - 1).to_string ();
13921 m_encoded_p
= true;
13922 m_verbatim_p
= true;
13923 m_wild_match_p
= false;
13924 m_standard_p
= false;
13928 m_verbatim_p
= false;
13930 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13934 const char *folded
= ada_fold_name (user_name
);
13935 const char *encoded
= ada_encode_1 (folded
, false);
13936 if (encoded
!= NULL
)
13937 m_encoded_name
= encoded
;
13939 m_encoded_name
= user_name
.to_string ();
13942 m_encoded_name
= user_name
.to_string ();
13944 /* Handle the 'package Standard' special case. See description
13945 of m_standard_p. */
13946 if (startswith (m_encoded_name
.c_str (), "standard__"))
13948 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13949 m_standard_p
= true;
13952 m_standard_p
= false;
13954 /* If the name contains a ".", then the user is entering a fully
13955 qualified entity name, and the match must not be done in wild
13956 mode. Similarly, if the user wants to complete what looks
13957 like an encoded name, the match must not be done in wild
13958 mode. Also, in the standard__ special case always do
13959 non-wild matching. */
13961 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13964 && user_name
.find ('.') == std::string::npos
);
13968 /* symbol_name_matcher_ftype method for Ada. This only handles
13969 completion mode. */
13972 ada_symbol_name_matches (const char *symbol_search_name
,
13973 const lookup_name_info
&lookup_name
,
13974 completion_match_result
*comp_match_res
)
13976 return lookup_name
.ada ().matches (symbol_search_name
,
13977 lookup_name
.match_type (),
13981 /* A name matcher that matches the symbol name exactly, with
13985 literal_symbol_name_matcher (const char *symbol_search_name
,
13986 const lookup_name_info
&lookup_name
,
13987 completion_match_result
*comp_match_res
)
13989 gdb::string_view name_view
= lookup_name
.name ();
13991 if (lookup_name
.completion_mode ()
13992 ? (strncmp (symbol_search_name
, name_view
.data (),
13993 name_view
.size ()) == 0)
13994 : symbol_search_name
== name_view
)
13996 if (comp_match_res
!= NULL
)
13997 comp_match_res
->set_match (symbol_search_name
);
14004 /* Implement the "la_get_symbol_name_matcher" language_defn method for
14007 static symbol_name_matcher_ftype
*
14008 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
14010 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
14011 return literal_symbol_name_matcher
;
14013 if (lookup_name
.completion_mode ())
14014 return ada_symbol_name_matches
;
14017 if (lookup_name
.ada ().wild_match_p ())
14018 return do_wild_match
;
14019 else if (lookup_name
.ada ().verbatim_p ())
14020 return do_exact_match
;
14022 return do_full_match
;
14026 static const char *ada_extensions
[] =
14028 ".adb", ".ads", ".a", ".ada", ".dg", NULL
14031 /* Constant data that describes the Ada language. */
14033 extern const struct language_data ada_language_data
=
14035 "ada", /* Language name */
14039 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
14040 that's not quite what this means. */
14042 macro_expansion_no
,
14044 &ada_exp_descriptor
,
14047 ada_printchar
, /* Print a character constant */
14048 ada_printstr
, /* Function to print string constant */
14049 emit_char
, /* Function to print single char (not used) */
14050 ada_print_type
, /* Print a type using appropriate syntax */
14051 ada_print_typedef
, /* Print a typedef using appropriate syntax */
14052 ada_value_print_inner
, /* la_value_print_inner */
14053 ada_value_print
, /* Print a top-level value */
14054 NULL
, /* Language specific skip_trampoline */
14055 NULL
, /* name_of_this */
14056 true, /* la_store_sym_names_in_linkage_form_p */
14057 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
14058 basic_lookup_transparent_type
, /* lookup_transparent_type */
14059 ada_la_decode
, /* Language specific symbol demangler */
14060 ada_sniff_from_mangled_name
,
14061 NULL
, /* Language specific
14062 class_name_from_physname */
14063 ada_op_print_tab
, /* expression operators for printing */
14064 0, /* c-style arrays */
14065 1, /* String lower bound */
14066 ada_get_gdb_completer_word_break_characters
,
14067 ada_collect_symbol_completion_matches
,
14068 ada_language_arch_info
,
14069 ada_watch_location_expression
,
14070 ada_get_symbol_name_matcher
, /* la_get_symbol_name_matcher */
14071 ada_iterate_over_symbols
,
14072 default_search_name_hash
,
14076 ada_is_string_type
,
14077 "(...)" /* la_struct_too_deep_ellipsis */
14080 /* Class representing the Ada language. */
14082 class ada_language
: public language_defn
14086 : language_defn (language_ada
, ada_language_data
)
14089 /* Print an array element index using the Ada syntax. */
14091 void print_array_index (struct type
*index_type
,
14093 struct ui_file
*stream
,
14094 const value_print_options
*options
) const override
14096 struct value
*index_value
= val_atr (index_type
, index
);
14098 LA_VALUE_PRINT (index_value
, stream
, options
);
14099 fprintf_filtered (stream
, " => ");
14102 /* Implement the "read_var_value" language_defn method for Ada. */
14104 struct value
*read_var_value (struct symbol
*var
,
14105 const struct block
*var_block
,
14106 struct frame_info
*frame
) const override
14108 /* The only case where default_read_var_value is not sufficient
14109 is when VAR is a renaming... */
14110 if (frame
!= nullptr)
14112 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
14113 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
14114 return ada_read_renaming_var_value (var
, frame_block
);
14117 /* This is a typical case where we expect the default_read_var_value
14118 function to work. */
14119 return language_defn::read_var_value (var
, var_block
, frame
);
14123 /* Single instance of the Ada language class. */
14125 static ada_language ada_language_defn
;
14127 /* Command-list for the "set/show ada" prefix command. */
14128 static struct cmd_list_element
*set_ada_list
;
14129 static struct cmd_list_element
*show_ada_list
;
14132 initialize_ada_catchpoint_ops (void)
14134 struct breakpoint_ops
*ops
;
14136 initialize_breakpoint_ops ();
14138 ops
= &catch_exception_breakpoint_ops
;
14139 *ops
= bkpt_breakpoint_ops
;
14140 ops
->allocate_location
= allocate_location_exception
;
14141 ops
->re_set
= re_set_exception
;
14142 ops
->check_status
= check_status_exception
;
14143 ops
->print_it
= print_it_exception
;
14144 ops
->print_one
= print_one_exception
;
14145 ops
->print_mention
= print_mention_exception
;
14146 ops
->print_recreate
= print_recreate_exception
;
14148 ops
= &catch_exception_unhandled_breakpoint_ops
;
14149 *ops
= bkpt_breakpoint_ops
;
14150 ops
->allocate_location
= allocate_location_exception
;
14151 ops
->re_set
= re_set_exception
;
14152 ops
->check_status
= check_status_exception
;
14153 ops
->print_it
= print_it_exception
;
14154 ops
->print_one
= print_one_exception
;
14155 ops
->print_mention
= print_mention_exception
;
14156 ops
->print_recreate
= print_recreate_exception
;
14158 ops
= &catch_assert_breakpoint_ops
;
14159 *ops
= bkpt_breakpoint_ops
;
14160 ops
->allocate_location
= allocate_location_exception
;
14161 ops
->re_set
= re_set_exception
;
14162 ops
->check_status
= check_status_exception
;
14163 ops
->print_it
= print_it_exception
;
14164 ops
->print_one
= print_one_exception
;
14165 ops
->print_mention
= print_mention_exception
;
14166 ops
->print_recreate
= print_recreate_exception
;
14168 ops
= &catch_handlers_breakpoint_ops
;
14169 *ops
= bkpt_breakpoint_ops
;
14170 ops
->allocate_location
= allocate_location_exception
;
14171 ops
->re_set
= re_set_exception
;
14172 ops
->check_status
= check_status_exception
;
14173 ops
->print_it
= print_it_exception
;
14174 ops
->print_one
= print_one_exception
;
14175 ops
->print_mention
= print_mention_exception
;
14176 ops
->print_recreate
= print_recreate_exception
;
14179 /* This module's 'new_objfile' observer. */
14182 ada_new_objfile_observer (struct objfile
*objfile
)
14184 ada_clear_symbol_cache ();
14187 /* This module's 'free_objfile' observer. */
14190 ada_free_objfile_observer (struct objfile
*objfile
)
14192 ada_clear_symbol_cache ();
14195 void _initialize_ada_language ();
14197 _initialize_ada_language ()
14199 initialize_ada_catchpoint_ops ();
14201 add_basic_prefix_cmd ("ada", no_class
,
14202 _("Prefix command for changing Ada-specific settings."),
14203 &set_ada_list
, "set ada ", 0, &setlist
);
14205 add_show_prefix_cmd ("ada", no_class
,
14206 _("Generic command for showing Ada-specific settings."),
14207 &show_ada_list
, "show ada ", 0, &showlist
);
14209 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14210 &trust_pad_over_xvs
, _("\
14211 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14212 Show whether an optimization trusting PAD types over XVS types is activated."),
14214 This is related to the encoding used by the GNAT compiler. The debugger\n\
14215 should normally trust the contents of PAD types, but certain older versions\n\
14216 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14217 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14218 work around this bug. It is always safe to turn this option \"off\", but\n\
14219 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14220 this option to \"off\" unless necessary."),
14221 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14223 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14224 &print_signatures
, _("\
14225 Enable or disable the output of formal and return types for functions in the \
14226 overloads selection menu."), _("\
14227 Show whether the output of formal and return types for functions in the \
14228 overloads selection menu is activated."),
14229 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14231 add_catch_command ("exception", _("\
14232 Catch Ada exceptions, when raised.\n\
14233 Usage: catch exception [ARG] [if CONDITION]\n\
14234 Without any argument, stop when any Ada exception is raised.\n\
14235 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14236 being raised does not have a handler (and will therefore lead to the task's\n\
14238 Otherwise, the catchpoint only stops when the name of the exception being\n\
14239 raised is the same as ARG.\n\
14240 CONDITION is a boolean expression that is evaluated to see whether the\n\
14241 exception should cause a stop."),
14242 catch_ada_exception_command
,
14243 catch_ada_completer
,
14247 add_catch_command ("handlers", _("\
14248 Catch Ada exceptions, when handled.\n\
14249 Usage: catch handlers [ARG] [if CONDITION]\n\
14250 Without any argument, stop when any Ada exception is handled.\n\
14251 With an argument, catch only exceptions with the given name.\n\
14252 CONDITION is a boolean expression that is evaluated to see whether the\n\
14253 exception should cause a stop."),
14254 catch_ada_handlers_command
,
14255 catch_ada_completer
,
14258 add_catch_command ("assert", _("\
14259 Catch failed Ada assertions, when raised.\n\
14260 Usage: catch assert [if CONDITION]\n\
14261 CONDITION is a boolean expression that is evaluated to see whether the\n\
14262 exception should cause a stop."),
14263 catch_assert_command
,
14268 varsize_limit
= 65536;
14269 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14270 &varsize_limit
, _("\
14271 Set the maximum number of bytes allowed in a variable-size object."), _("\
14272 Show the maximum number of bytes allowed in a variable-size object."), _("\
14273 Attempts to access an object whose size is not a compile-time constant\n\
14274 and exceeds this limit will cause an error."),
14275 NULL
, NULL
, &setlist
, &showlist
);
14277 add_info ("exceptions", info_exceptions_command
,
14279 List all Ada exception names.\n\
14280 Usage: info exceptions [REGEXP]\n\
14281 If a regular expression is passed as an argument, only those matching\n\
14282 the regular expression are listed."));
14284 add_basic_prefix_cmd ("ada", class_maintenance
,
14285 _("Set Ada maintenance-related variables."),
14286 &maint_set_ada_cmdlist
, "maintenance set ada ",
14287 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14289 add_show_prefix_cmd ("ada", class_maintenance
,
14290 _("Show Ada maintenance-related variables."),
14291 &maint_show_ada_cmdlist
, "maintenance show ada ",
14292 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14294 add_setshow_boolean_cmd
14295 ("ignore-descriptive-types", class_maintenance
,
14296 &ada_ignore_descriptive_types_p
,
14297 _("Set whether descriptive types generated by GNAT should be ignored."),
14298 _("Show whether descriptive types generated by GNAT should be ignored."),
14300 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14301 DWARF attribute."),
14302 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14304 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14305 NULL
, xcalloc
, xfree
);
14307 /* The ada-lang observers. */
14308 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14309 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14310 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);