1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2019 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
23 #include "gdb_regex.h"
28 #include "expression.h"
29 #include "parser-defs.h"
35 #include "breakpoint.h"
38 #include "gdb_obstack.h"
40 #include "completer.h"
47 #include "observable.h"
49 #include "typeprint.h"
50 #include "namespace.h"
51 #include "cli/cli-style.h"
54 #include "mi/mi-common.h"
55 #include "arch-utils.h"
56 #include "cli/cli-utils.h"
57 #include "gdbsupport/function-view.h"
58 #include "gdbsupport/byte-vector.h"
61 /* Define whether or not the C operator '/' truncates towards zero for
62 differently signed operands (truncation direction is undefined in C).
63 Copied from valarith.c. */
65 #ifndef TRUNCATION_TOWARDS_ZERO
66 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
69 static struct type
*desc_base_type (struct type
*);
71 static struct type
*desc_bounds_type (struct type
*);
73 static struct value
*desc_bounds (struct value
*);
75 static int fat_pntr_bounds_bitpos (struct type
*);
77 static int fat_pntr_bounds_bitsize (struct type
*);
79 static struct type
*desc_data_target_type (struct type
*);
81 static struct value
*desc_data (struct value
*);
83 static int fat_pntr_data_bitpos (struct type
*);
85 static int fat_pntr_data_bitsize (struct type
*);
87 static struct value
*desc_one_bound (struct value
*, int, int);
89 static int desc_bound_bitpos (struct type
*, int, int);
91 static int desc_bound_bitsize (struct type
*, int, int);
93 static struct type
*desc_index_type (struct type
*, int);
95 static int desc_arity (struct type
*);
97 static int ada_type_match (struct type
*, struct type
*, int);
99 static int ada_args_match (struct symbol
*, struct value
**, int);
101 static struct value
*make_array_descriptor (struct type
*, struct value
*);
103 static void ada_add_block_symbols (struct obstack
*,
104 const struct block
*,
105 const lookup_name_info
&lookup_name
,
106 domain_enum
, struct objfile
*);
108 static void ada_add_all_symbols (struct obstack
*, const struct block
*,
109 const lookup_name_info
&lookup_name
,
110 domain_enum
, int, int *);
112 static int is_nonfunction (struct block_symbol
*, int);
114 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
115 const struct block
*);
117 static int num_defns_collected (struct obstack
*);
119 static struct block_symbol
*defns_collected (struct obstack
*, int);
121 static struct value
*resolve_subexp (expression_up
*, int *, int,
123 innermost_block_tracker
*);
125 static void replace_operator_with_call (expression_up
*, int, int, int,
126 struct symbol
*, const struct block
*);
128 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
130 static const char *ada_op_name (enum exp_opcode
);
132 static const char *ada_decoded_op_name (enum exp_opcode
);
134 static int numeric_type_p (struct type
*);
136 static int integer_type_p (struct type
*);
138 static int scalar_type_p (struct type
*);
140 static int discrete_type_p (struct type
*);
142 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
145 static struct value
*evaluate_subexp_type (struct expression
*, int *);
147 static struct type
*ada_find_parallel_type_with_name (struct type
*,
150 static int is_dynamic_field (struct type
*, int);
152 static struct type
*to_fixed_variant_branch_type (struct type
*,
154 CORE_ADDR
, struct value
*);
156 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
158 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
160 static struct type
*to_static_fixed_type (struct type
*);
161 static struct type
*static_unwrap_type (struct type
*type
);
163 static struct value
*unwrap_value (struct value
*);
165 static struct type
*constrained_packed_array_type (struct type
*, long *);
167 static struct type
*decode_constrained_packed_array_type (struct type
*);
169 static long decode_packed_array_bitsize (struct type
*);
171 static struct value
*decode_constrained_packed_array (struct value
*);
173 static int ada_is_packed_array_type (struct type
*);
175 static int ada_is_unconstrained_packed_array_type (struct type
*);
177 static struct value
*value_subscript_packed (struct value
*, int,
180 static struct value
*coerce_unspec_val_to_type (struct value
*,
183 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
185 static int equiv_types (struct type
*, struct type
*);
187 static int is_name_suffix (const char *);
189 static int advance_wild_match (const char **, const char *, int);
191 static bool wild_match (const char *name
, const char *patn
);
193 static struct value
*ada_coerce_ref (struct value
*);
195 static LONGEST
pos_atr (struct value
*);
197 static struct value
*value_pos_atr (struct type
*, struct value
*);
199 static struct value
*value_val_atr (struct type
*, struct value
*);
201 static struct symbol
*standard_lookup (const char *, const struct block
*,
204 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
207 static struct value
*ada_value_primitive_field (struct value
*, int, int,
210 static int find_struct_field (const char *, struct type
*, int,
211 struct type
**, int *, int *, int *, int *);
213 static int ada_resolve_function (struct block_symbol
*, int,
214 struct value
**, int, const char *,
217 static int ada_is_direct_array_type (struct type
*);
219 static void ada_language_arch_info (struct gdbarch
*,
220 struct language_arch_info
*);
222 static struct value
*ada_index_struct_field (int, struct value
*, int,
225 static struct value
*assign_aggregate (struct value
*, struct value
*,
229 static void aggregate_assign_from_choices (struct value
*, struct value
*,
231 int *, LONGEST
*, int *,
232 int, LONGEST
, LONGEST
);
234 static void aggregate_assign_positional (struct value
*, struct value
*,
236 int *, LONGEST
*, int *, int,
240 static void aggregate_assign_others (struct value
*, struct value
*,
242 int *, LONGEST
*, int, LONGEST
, LONGEST
);
245 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
248 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
251 static void ada_forward_operator_length (struct expression
*, int, int *,
254 static struct type
*ada_find_any_type (const char *name
);
256 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
257 (const lookup_name_info
&lookup_name
);
261 /* The result of a symbol lookup to be stored in our symbol cache. */
265 /* The name used to perform the lookup. */
267 /* The namespace used during the lookup. */
269 /* The symbol returned by the lookup, or NULL if no matching symbol
272 /* The block where the symbol was found, or NULL if no matching
274 const struct block
*block
;
275 /* A pointer to the next entry with the same hash. */
276 struct cache_entry
*next
;
279 /* The Ada symbol cache, used to store the result of Ada-mode symbol
280 lookups in the course of executing the user's commands.
282 The cache is implemented using a simple, fixed-sized hash.
283 The size is fixed on the grounds that there are not likely to be
284 all that many symbols looked up during any given session, regardless
285 of the size of the symbol table. If we decide to go to a resizable
286 table, let's just use the stuff from libiberty instead. */
288 #define HASH_SIZE 1009
290 struct ada_symbol_cache
292 /* An obstack used to store the entries in our cache. */
293 struct obstack cache_space
;
295 /* The root of the hash table used to implement our symbol cache. */
296 struct cache_entry
*root
[HASH_SIZE
];
299 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
301 /* Maximum-sized dynamic type. */
302 static unsigned int varsize_limit
;
304 static const char ada_completer_word_break_characters
[] =
306 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
308 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
311 /* The name of the symbol to use to get the name of the main subprogram. */
312 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
313 = "__gnat_ada_main_program_name";
315 /* Limit on the number of warnings to raise per expression evaluation. */
316 static int warning_limit
= 2;
318 /* Number of warning messages issued; reset to 0 by cleanups after
319 expression evaluation. */
320 static int warnings_issued
= 0;
322 static const char *known_runtime_file_name_patterns
[] = {
323 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
326 static const char *known_auxiliary_function_name_patterns
[] = {
327 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
330 /* Maintenance-related settings for this module. */
332 static struct cmd_list_element
*maint_set_ada_cmdlist
;
333 static struct cmd_list_element
*maint_show_ada_cmdlist
;
335 /* Implement the "maintenance set ada" (prefix) command. */
338 maint_set_ada_cmd (const char *args
, int from_tty
)
340 help_list (maint_set_ada_cmdlist
, "maintenance set ada ", all_commands
,
344 /* Implement the "maintenance show ada" (prefix) command. */
347 maint_show_ada_cmd (const char *args
, int from_tty
)
349 cmd_show_list (maint_show_ada_cmdlist
, from_tty
, "");
352 /* The "maintenance ada set/show ignore-descriptive-type" value. */
354 static bool ada_ignore_descriptive_types_p
= false;
356 /* Inferior-specific data. */
358 /* Per-inferior data for this module. */
360 struct ada_inferior_data
362 /* The ada__tags__type_specific_data type, which is used when decoding
363 tagged types. With older versions of GNAT, this type was directly
364 accessible through a component ("tsd") in the object tag. But this
365 is no longer the case, so we cache it for each inferior. */
366 struct type
*tsd_type
= nullptr;
368 /* The exception_support_info data. This data is used to determine
369 how to implement support for Ada exception catchpoints in a given
371 const struct exception_support_info
*exception_info
= nullptr;
374 /* Our key to this module's inferior data. */
375 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
377 /* Return our inferior data for the given inferior (INF).
379 This function always returns a valid pointer to an allocated
380 ada_inferior_data structure. If INF's inferior data has not
381 been previously set, this functions creates a new one with all
382 fields set to zero, sets INF's inferior to it, and then returns
383 a pointer to that newly allocated ada_inferior_data. */
385 static struct ada_inferior_data
*
386 get_ada_inferior_data (struct inferior
*inf
)
388 struct ada_inferior_data
*data
;
390 data
= ada_inferior_data
.get (inf
);
392 data
= ada_inferior_data
.emplace (inf
);
397 /* Perform all necessary cleanups regarding our module's inferior data
398 that is required after the inferior INF just exited. */
401 ada_inferior_exit (struct inferior
*inf
)
403 ada_inferior_data
.clear (inf
);
407 /* program-space-specific data. */
409 /* This module's per-program-space data. */
410 struct ada_pspace_data
414 if (sym_cache
!= NULL
)
415 ada_free_symbol_cache (sym_cache
);
418 /* The Ada symbol cache. */
419 struct ada_symbol_cache
*sym_cache
= nullptr;
422 /* Key to our per-program-space data. */
423 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
425 /* Return this module's data for the given program space (PSPACE).
426 If not is found, add a zero'ed one now.
428 This function always returns a valid object. */
430 static struct ada_pspace_data
*
431 get_ada_pspace_data (struct program_space
*pspace
)
433 struct ada_pspace_data
*data
;
435 data
= ada_pspace_data_handle
.get (pspace
);
437 data
= ada_pspace_data_handle
.emplace (pspace
);
444 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
445 all typedef layers have been peeled. Otherwise, return TYPE.
447 Normally, we really expect a typedef type to only have 1 typedef layer.
448 In other words, we really expect the target type of a typedef type to be
449 a non-typedef type. This is particularly true for Ada units, because
450 the language does not have a typedef vs not-typedef distinction.
451 In that respect, the Ada compiler has been trying to eliminate as many
452 typedef definitions in the debugging information, since they generally
453 do not bring any extra information (we still use typedef under certain
454 circumstances related mostly to the GNAT encoding).
456 Unfortunately, we have seen situations where the debugging information
457 generated by the compiler leads to such multiple typedef layers. For
458 instance, consider the following example with stabs:
460 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
461 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
463 This is an error in the debugging information which causes type
464 pck__float_array___XUP to be defined twice, and the second time,
465 it is defined as a typedef of a typedef.
467 This is on the fringe of legality as far as debugging information is
468 concerned, and certainly unexpected. But it is easy to handle these
469 situations correctly, so we can afford to be lenient in this case. */
472 ada_typedef_target_type (struct type
*type
)
474 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
475 type
= TYPE_TARGET_TYPE (type
);
479 /* Given DECODED_NAME a string holding a symbol name in its
480 decoded form (ie using the Ada dotted notation), returns
481 its unqualified name. */
484 ada_unqualified_name (const char *decoded_name
)
488 /* If the decoded name starts with '<', it means that the encoded
489 name does not follow standard naming conventions, and thus that
490 it is not your typical Ada symbol name. Trying to unqualify it
491 is therefore pointless and possibly erroneous. */
492 if (decoded_name
[0] == '<')
495 result
= strrchr (decoded_name
, '.');
497 result
++; /* Skip the dot... */
499 result
= decoded_name
;
504 /* Return a string starting with '<', followed by STR, and '>'. */
507 add_angle_brackets (const char *str
)
509 return string_printf ("<%s>", str
);
513 ada_get_gdb_completer_word_break_characters (void)
515 return ada_completer_word_break_characters
;
518 /* Print an array element index using the Ada syntax. */
521 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
522 const struct value_print_options
*options
)
524 LA_VALUE_PRINT (index_value
, stream
, options
);
525 fprintf_filtered (stream
, " => ");
528 /* la_watch_location_expression for Ada. */
530 gdb::unique_xmalloc_ptr
<char>
531 ada_watch_location_expression (struct type
*type
, CORE_ADDR addr
)
533 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
534 std::string name
= type_to_string (type
);
535 return gdb::unique_xmalloc_ptr
<char>
536 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
539 /* Assuming VECT points to an array of *SIZE objects of size
540 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
541 updating *SIZE as necessary and returning the (new) array. */
544 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
546 if (*size
< min_size
)
549 if (*size
< min_size
)
551 vect
= xrealloc (vect
, *size
* element_size
);
556 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
557 suffix of FIELD_NAME beginning "___". */
560 field_name_match (const char *field_name
, const char *target
)
562 int len
= strlen (target
);
565 (strncmp (field_name
, target
, len
) == 0
566 && (field_name
[len
] == '\0'
567 || (startswith (field_name
+ len
, "___")
568 && strcmp (field_name
+ strlen (field_name
) - 6,
573 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
574 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
575 and return its index. This function also handles fields whose name
576 have ___ suffixes because the compiler sometimes alters their name
577 by adding such a suffix to represent fields with certain constraints.
578 If the field could not be found, return a negative number if
579 MAYBE_MISSING is set. Otherwise raise an error. */
582 ada_get_field_index (const struct type
*type
, const char *field_name
,
586 struct type
*struct_type
= check_typedef ((struct type
*) type
);
588 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
589 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
593 error (_("Unable to find field %s in struct %s. Aborting"),
594 field_name
, TYPE_NAME (struct_type
));
599 /* The length of the prefix of NAME prior to any "___" suffix. */
602 ada_name_prefix_len (const char *name
)
608 const char *p
= strstr (name
, "___");
611 return strlen (name
);
617 /* Return non-zero if SUFFIX is a suffix of STR.
618 Return zero if STR is null. */
621 is_suffix (const char *str
, const char *suffix
)
628 len2
= strlen (suffix
);
629 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
632 /* The contents of value VAL, treated as a value of type TYPE. The
633 result is an lval in memory if VAL is. */
635 static struct value
*
636 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
638 type
= ada_check_typedef (type
);
639 if (value_type (val
) == type
)
643 struct value
*result
;
645 /* Make sure that the object size is not unreasonable before
646 trying to allocate some memory for it. */
647 ada_ensure_varsize_limit (type
);
650 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
651 result
= allocate_value_lazy (type
);
654 result
= allocate_value (type
);
655 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
657 set_value_component_location (result
, val
);
658 set_value_bitsize (result
, value_bitsize (val
));
659 set_value_bitpos (result
, value_bitpos (val
));
660 if (VALUE_LVAL (result
) == lval_memory
)
661 set_value_address (result
, value_address (val
));
666 static const gdb_byte
*
667 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
672 return valaddr
+ offset
;
676 cond_offset_target (CORE_ADDR address
, long offset
)
681 return address
+ offset
;
684 /* Issue a warning (as for the definition of warning in utils.c, but
685 with exactly one argument rather than ...), unless the limit on the
686 number of warnings has passed during the evaluation of the current
689 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
690 provided by "complaint". */
691 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
694 lim_warning (const char *format
, ...)
698 va_start (args
, format
);
699 warnings_issued
+= 1;
700 if (warnings_issued
<= warning_limit
)
701 vwarning (format
, args
);
706 /* Issue an error if the size of an object of type T is unreasonable,
707 i.e. if it would be a bad idea to allocate a value of this type in
711 ada_ensure_varsize_limit (const struct type
*type
)
713 if (TYPE_LENGTH (type
) > varsize_limit
)
714 error (_("object size is larger than varsize-limit"));
717 /* Maximum value of a SIZE-byte signed integer type. */
719 max_of_size (int size
)
721 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
723 return top_bit
| (top_bit
- 1);
726 /* Minimum value of a SIZE-byte signed integer type. */
728 min_of_size (int size
)
730 return -max_of_size (size
) - 1;
733 /* Maximum value of a SIZE-byte unsigned integer type. */
735 umax_of_size (int size
)
737 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
739 return top_bit
| (top_bit
- 1);
742 /* Maximum value of integral type T, as a signed quantity. */
744 max_of_type (struct type
*t
)
746 if (TYPE_UNSIGNED (t
))
747 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
749 return max_of_size (TYPE_LENGTH (t
));
752 /* Minimum value of integral type T, as a signed quantity. */
754 min_of_type (struct type
*t
)
756 if (TYPE_UNSIGNED (t
))
759 return min_of_size (TYPE_LENGTH (t
));
762 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
764 ada_discrete_type_high_bound (struct type
*type
)
766 type
= resolve_dynamic_type (type
, NULL
, 0);
767 switch (TYPE_CODE (type
))
769 case TYPE_CODE_RANGE
:
770 return TYPE_HIGH_BOUND (type
);
772 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
777 return max_of_type (type
);
779 error (_("Unexpected type in ada_discrete_type_high_bound."));
783 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
785 ada_discrete_type_low_bound (struct type
*type
)
787 type
= resolve_dynamic_type (type
, NULL
, 0);
788 switch (TYPE_CODE (type
))
790 case TYPE_CODE_RANGE
:
791 return TYPE_LOW_BOUND (type
);
793 return TYPE_FIELD_ENUMVAL (type
, 0);
798 return min_of_type (type
);
800 error (_("Unexpected type in ada_discrete_type_low_bound."));
804 /* The identity on non-range types. For range types, the underlying
805 non-range scalar type. */
808 get_base_type (struct type
*type
)
810 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
812 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
814 type
= TYPE_TARGET_TYPE (type
);
819 /* Return a decoded version of the given VALUE. This means returning
820 a value whose type is obtained by applying all the GNAT-specific
821 encodings, making the resulting type a static but standard description
822 of the initial type. */
825 ada_get_decoded_value (struct value
*value
)
827 struct type
*type
= ada_check_typedef (value_type (value
));
829 if (ada_is_array_descriptor_type (type
)
830 || (ada_is_constrained_packed_array_type (type
)
831 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
833 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
834 value
= ada_coerce_to_simple_array_ptr (value
);
836 value
= ada_coerce_to_simple_array (value
);
839 value
= ada_to_fixed_value (value
);
844 /* Same as ada_get_decoded_value, but with the given TYPE.
845 Because there is no associated actual value for this type,
846 the resulting type might be a best-effort approximation in
847 the case of dynamic types. */
850 ada_get_decoded_type (struct type
*type
)
852 type
= to_static_fixed_type (type
);
853 if (ada_is_constrained_packed_array_type (type
))
854 type
= ada_coerce_to_simple_array_type (type
);
860 /* Language Selection */
862 /* If the main program is in Ada, return language_ada, otherwise return LANG
863 (the main program is in Ada iif the adainit symbol is found). */
866 ada_update_initial_language (enum language lang
)
868 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
874 /* If the main procedure is written in Ada, then return its name.
875 The result is good until the next call. Return NULL if the main
876 procedure doesn't appear to be in Ada. */
881 struct bound_minimal_symbol msym
;
882 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
884 /* For Ada, the name of the main procedure is stored in a specific
885 string constant, generated by the binder. Look for that symbol,
886 extract its address, and then read that string. If we didn't find
887 that string, then most probably the main procedure is not written
889 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
891 if (msym
.minsym
!= NULL
)
893 CORE_ADDR main_program_name_addr
;
896 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
897 if (main_program_name_addr
== 0)
898 error (_("Invalid address for Ada main program name."));
900 target_read_string (main_program_name_addr
, &main_program_name
,
905 return main_program_name
.get ();
908 /* The main procedure doesn't seem to be in Ada. */
914 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
917 const struct ada_opname_map ada_opname_table
[] = {
918 {"Oadd", "\"+\"", BINOP_ADD
},
919 {"Osubtract", "\"-\"", BINOP_SUB
},
920 {"Omultiply", "\"*\"", BINOP_MUL
},
921 {"Odivide", "\"/\"", BINOP_DIV
},
922 {"Omod", "\"mod\"", BINOP_MOD
},
923 {"Orem", "\"rem\"", BINOP_REM
},
924 {"Oexpon", "\"**\"", BINOP_EXP
},
925 {"Olt", "\"<\"", BINOP_LESS
},
926 {"Ole", "\"<=\"", BINOP_LEQ
},
927 {"Ogt", "\">\"", BINOP_GTR
},
928 {"Oge", "\">=\"", BINOP_GEQ
},
929 {"Oeq", "\"=\"", BINOP_EQUAL
},
930 {"One", "\"/=\"", BINOP_NOTEQUAL
},
931 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
932 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
933 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
934 {"Oconcat", "\"&\"", BINOP_CONCAT
},
935 {"Oabs", "\"abs\"", UNOP_ABS
},
936 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
937 {"Oadd", "\"+\"", UNOP_PLUS
},
938 {"Osubtract", "\"-\"", UNOP_NEG
},
942 /* The "encoded" form of DECODED, according to GNAT conventions. The
943 result is valid until the next call to ada_encode. If
944 THROW_ERRORS, throw an error if invalid operator name is found.
945 Otherwise, return NULL in that case. */
948 ada_encode_1 (const char *decoded
, bool throw_errors
)
950 static char *encoding_buffer
= NULL
;
951 static size_t encoding_buffer_size
= 0;
958 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
959 2 * strlen (decoded
) + 10);
962 for (p
= decoded
; *p
!= '\0'; p
+= 1)
966 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
971 const struct ada_opname_map
*mapping
;
973 for (mapping
= ada_opname_table
;
974 mapping
->encoded
!= NULL
975 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
977 if (mapping
->encoded
== NULL
)
980 error (_("invalid Ada operator name: %s"), p
);
984 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
985 k
+= strlen (mapping
->encoded
);
990 encoding_buffer
[k
] = *p
;
995 encoding_buffer
[k
] = '\0';
996 return encoding_buffer
;
999 /* The "encoded" form of DECODED, according to GNAT conventions.
1000 The result is valid until the next call to ada_encode. */
1003 ada_encode (const char *decoded
)
1005 return ada_encode_1 (decoded
, true);
1008 /* Return NAME folded to lower case, or, if surrounded by single
1009 quotes, unfolded, but with the quotes stripped away. Result good
1013 ada_fold_name (const char *name
)
1015 static char *fold_buffer
= NULL
;
1016 static size_t fold_buffer_size
= 0;
1018 int len
= strlen (name
);
1019 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1021 if (name
[0] == '\'')
1023 strncpy (fold_buffer
, name
+ 1, len
- 2);
1024 fold_buffer
[len
- 2] = '\000';
1030 for (i
= 0; i
<= len
; i
+= 1)
1031 fold_buffer
[i
] = tolower (name
[i
]);
1037 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1040 is_lower_alphanum (const char c
)
1042 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1045 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1046 This function saves in LEN the length of that same symbol name but
1047 without either of these suffixes:
1053 These are suffixes introduced by the compiler for entities such as
1054 nested subprogram for instance, in order to avoid name clashes.
1055 They do not serve any purpose for the debugger. */
1058 ada_remove_trailing_digits (const char *encoded
, int *len
)
1060 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1064 while (i
> 0 && isdigit (encoded
[i
]))
1066 if (i
>= 0 && encoded
[i
] == '.')
1068 else if (i
>= 0 && encoded
[i
] == '$')
1070 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1072 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1077 /* Remove the suffix introduced by the compiler for protected object
1081 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1083 /* Remove trailing N. */
1085 /* Protected entry subprograms are broken into two
1086 separate subprograms: The first one is unprotected, and has
1087 a 'N' suffix; the second is the protected version, and has
1088 the 'P' suffix. The second calls the first one after handling
1089 the protection. Since the P subprograms are internally generated,
1090 we leave these names undecoded, giving the user a clue that this
1091 entity is internal. */
1094 && encoded
[*len
- 1] == 'N'
1095 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1099 /* If ENCODED follows the GNAT entity encoding conventions, then return
1100 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1101 replaced by ENCODED. */
1104 ada_decode (const char *encoded
)
1110 std::string decoded
;
1112 /* With function descriptors on PPC64, the value of a symbol named
1113 ".FN", if it exists, is the entry point of the function "FN". */
1114 if (encoded
[0] == '.')
1117 /* The name of the Ada main procedure starts with "_ada_".
1118 This prefix is not part of the decoded name, so skip this part
1119 if we see this prefix. */
1120 if (startswith (encoded
, "_ada_"))
1123 /* If the name starts with '_', then it is not a properly encoded
1124 name, so do not attempt to decode it. Similarly, if the name
1125 starts with '<', the name should not be decoded. */
1126 if (encoded
[0] == '_' || encoded
[0] == '<')
1129 len0
= strlen (encoded
);
1131 ada_remove_trailing_digits (encoded
, &len0
);
1132 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1134 /* Remove the ___X.* suffix if present. Do not forget to verify that
1135 the suffix is located before the current "end" of ENCODED. We want
1136 to avoid re-matching parts of ENCODED that have previously been
1137 marked as discarded (by decrementing LEN0). */
1138 p
= strstr (encoded
, "___");
1139 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1147 /* Remove any trailing TKB suffix. It tells us that this symbol
1148 is for the body of a task, but that information does not actually
1149 appear in the decoded name. */
1151 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1154 /* Remove any trailing TB suffix. The TB suffix is slightly different
1155 from the TKB suffix because it is used for non-anonymous task
1158 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1161 /* Remove trailing "B" suffixes. */
1162 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1164 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1167 /* Make decoded big enough for possible expansion by operator name. */
1169 decoded
.resize (2 * len0
+ 1, 'X');
1171 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1173 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1176 while ((i
>= 0 && isdigit (encoded
[i
]))
1177 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1179 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1181 else if (encoded
[i
] == '$')
1185 /* The first few characters that are not alphabetic are not part
1186 of any encoding we use, so we can copy them over verbatim. */
1188 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1189 decoded
[j
] = encoded
[i
];
1194 /* Is this a symbol function? */
1195 if (at_start_name
&& encoded
[i
] == 'O')
1199 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1201 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1202 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1204 && !isalnum (encoded
[i
+ op_len
]))
1206 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1209 j
+= strlen (ada_opname_table
[k
].decoded
);
1213 if (ada_opname_table
[k
].encoded
!= NULL
)
1218 /* Replace "TK__" with "__", which will eventually be translated
1219 into "." (just below). */
1221 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1224 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1225 be translated into "." (just below). These are internal names
1226 generated for anonymous blocks inside which our symbol is nested. */
1228 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1229 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1230 && isdigit (encoded
[i
+4]))
1234 while (k
< len0
&& isdigit (encoded
[k
]))
1235 k
++; /* Skip any extra digit. */
1237 /* Double-check that the "__B_{DIGITS}+" sequence we found
1238 is indeed followed by "__". */
1239 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1243 /* Remove _E{DIGITS}+[sb] */
1245 /* Just as for protected object subprograms, there are 2 categories
1246 of subprograms created by the compiler for each entry. The first
1247 one implements the actual entry code, and has a suffix following
1248 the convention above; the second one implements the barrier and
1249 uses the same convention as above, except that the 'E' is replaced
1252 Just as above, we do not decode the name of barrier functions
1253 to give the user a clue that the code he is debugging has been
1254 internally generated. */
1256 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1257 && isdigit (encoded
[i
+2]))
1261 while (k
< len0
&& isdigit (encoded
[k
]))
1265 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1268 /* Just as an extra precaution, make sure that if this
1269 suffix is followed by anything else, it is a '_'.
1270 Otherwise, we matched this sequence by accident. */
1272 || (k
< len0
&& encoded
[k
] == '_'))
1277 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1278 the GNAT front-end in protected object subprograms. */
1281 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1283 /* Backtrack a bit up until we reach either the begining of
1284 the encoded name, or "__". Make sure that we only find
1285 digits or lowercase characters. */
1286 const char *ptr
= encoded
+ i
- 1;
1288 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1291 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1295 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1297 /* This is a X[bn]* sequence not separated from the previous
1298 part of the name with a non-alpha-numeric character (in other
1299 words, immediately following an alpha-numeric character), then
1300 verify that it is placed at the end of the encoded name. If
1301 not, then the encoding is not valid and we should abort the
1302 decoding. Otherwise, just skip it, it is used in body-nested
1306 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1310 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1312 /* Replace '__' by '.'. */
1320 /* It's a character part of the decoded name, so just copy it
1322 decoded
[j
] = encoded
[i
];
1329 /* Decoded names should never contain any uppercase character.
1330 Double-check this, and abort the decoding if we find one. */
1332 for (i
= 0; i
< decoded
.length(); ++i
)
1333 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1339 if (encoded
[0] == '<')
1342 decoded
= '<' + std::string(encoded
) + '>';
1347 /* Table for keeping permanent unique copies of decoded names. Once
1348 allocated, names in this table are never released. While this is a
1349 storage leak, it should not be significant unless there are massive
1350 changes in the set of decoded names in successive versions of a
1351 symbol table loaded during a single session. */
1352 static struct htab
*decoded_names_store
;
1354 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1355 in the language-specific part of GSYMBOL, if it has not been
1356 previously computed. Tries to save the decoded name in the same
1357 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1358 in any case, the decoded symbol has a lifetime at least that of
1360 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1361 const, but nevertheless modified to a semantically equivalent form
1362 when a decoded name is cached in it. */
1365 ada_decode_symbol (const struct general_symbol_info
*arg
)
1367 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1368 const char **resultp
=
1369 &gsymbol
->language_specific
.demangled_name
;
1371 if (!gsymbol
->ada_mangled
)
1373 std::string decoded
= ada_decode (gsymbol
->name
);
1374 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1376 gsymbol
->ada_mangled
= 1;
1378 if (obstack
!= NULL
)
1379 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1382 /* Sometimes, we can't find a corresponding objfile, in
1383 which case, we put the result on the heap. Since we only
1384 decode when needed, we hope this usually does not cause a
1385 significant memory leak (FIXME). */
1387 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1388 decoded
.c_str (), INSERT
);
1391 *slot
= xstrdup (decoded
.c_str ());
1400 ada_la_decode (const char *encoded
, int options
)
1402 return xstrdup (ada_decode (encoded
).c_str ());
1405 /* Implement la_sniff_from_mangled_name for Ada. */
1408 ada_sniff_from_mangled_name (const char *mangled
, char **out
)
1410 std::string demangled
= ada_decode (mangled
);
1414 if (demangled
!= mangled
&& demangled
[0] != '<')
1416 /* Set the gsymbol language to Ada, but still return 0.
1417 Two reasons for that:
1419 1. For Ada, we prefer computing the symbol's decoded name
1420 on the fly rather than pre-compute it, in order to save
1421 memory (Ada projects are typically very large).
1423 2. There are some areas in the definition of the GNAT
1424 encoding where, with a bit of bad luck, we might be able
1425 to decode a non-Ada symbol, generating an incorrect
1426 demangled name (Eg: names ending with "TB" for instance
1427 are identified as task bodies and so stripped from
1428 the decoded name returned).
1430 Returning 1, here, but not setting *DEMANGLED, helps us get a
1431 little bit of the best of both worlds. Because we're last,
1432 we should not affect any of the other languages that were
1433 able to demangle the symbol before us; we get to correctly
1434 tag Ada symbols as such; and even if we incorrectly tagged a
1435 non-Ada symbol, which should be rare, any routing through the
1436 Ada language should be transparent (Ada tries to behave much
1437 like C/C++ with non-Ada symbols). */
1448 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1449 generated by the GNAT compiler to describe the index type used
1450 for each dimension of an array, check whether it follows the latest
1451 known encoding. If not, fix it up to conform to the latest encoding.
1452 Otherwise, do nothing. This function also does nothing if
1453 INDEX_DESC_TYPE is NULL.
1455 The GNAT encoding used to describe the array index type evolved a bit.
1456 Initially, the information would be provided through the name of each
1457 field of the structure type only, while the type of these fields was
1458 described as unspecified and irrelevant. The debugger was then expected
1459 to perform a global type lookup using the name of that field in order
1460 to get access to the full index type description. Because these global
1461 lookups can be very expensive, the encoding was later enhanced to make
1462 the global lookup unnecessary by defining the field type as being
1463 the full index type description.
1465 The purpose of this routine is to allow us to support older versions
1466 of the compiler by detecting the use of the older encoding, and by
1467 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1468 we essentially replace each field's meaningless type by the associated
1472 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1476 if (index_desc_type
== NULL
)
1478 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1480 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1481 to check one field only, no need to check them all). If not, return
1484 If our INDEX_DESC_TYPE was generated using the older encoding,
1485 the field type should be a meaningless integer type whose name
1486 is not equal to the field name. */
1487 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1488 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1489 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1492 /* Fixup each field of INDEX_DESC_TYPE. */
1493 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1495 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1496 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1499 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1503 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1505 static const char *bound_name
[] = {
1506 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1507 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1510 /* Maximum number of array dimensions we are prepared to handle. */
1512 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1515 /* The desc_* routines return primitive portions of array descriptors
1518 /* The descriptor or array type, if any, indicated by TYPE; removes
1519 level of indirection, if needed. */
1521 static struct type
*
1522 desc_base_type (struct type
*type
)
1526 type
= ada_check_typedef (type
);
1527 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1528 type
= ada_typedef_target_type (type
);
1531 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1532 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1533 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1538 /* True iff TYPE indicates a "thin" array pointer type. */
1541 is_thin_pntr (struct type
*type
)
1544 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1545 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1548 /* The descriptor type for thin pointer type TYPE. */
1550 static struct type
*
1551 thin_descriptor_type (struct type
*type
)
1553 struct type
*base_type
= desc_base_type (type
);
1555 if (base_type
== NULL
)
1557 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1561 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1563 if (alt_type
== NULL
)
1570 /* A pointer to the array data for thin-pointer value VAL. */
1572 static struct value
*
1573 thin_data_pntr (struct value
*val
)
1575 struct type
*type
= ada_check_typedef (value_type (val
));
1576 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1578 data_type
= lookup_pointer_type (data_type
);
1580 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1581 return value_cast (data_type
, value_copy (val
));
1583 return value_from_longest (data_type
, value_address (val
));
1586 /* True iff TYPE indicates a "thick" array pointer type. */
1589 is_thick_pntr (struct type
*type
)
1591 type
= desc_base_type (type
);
1592 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1593 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1596 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1597 pointer to one, the type of its bounds data; otherwise, NULL. */
1599 static struct type
*
1600 desc_bounds_type (struct type
*type
)
1604 type
= desc_base_type (type
);
1608 else if (is_thin_pntr (type
))
1610 type
= thin_descriptor_type (type
);
1613 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1615 return ada_check_typedef (r
);
1617 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1619 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1621 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1626 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1627 one, a pointer to its bounds data. Otherwise NULL. */
1629 static struct value
*
1630 desc_bounds (struct value
*arr
)
1632 struct type
*type
= ada_check_typedef (value_type (arr
));
1634 if (is_thin_pntr (type
))
1636 struct type
*bounds_type
=
1637 desc_bounds_type (thin_descriptor_type (type
));
1640 if (bounds_type
== NULL
)
1641 error (_("Bad GNAT array descriptor"));
1643 /* NOTE: The following calculation is not really kosher, but
1644 since desc_type is an XVE-encoded type (and shouldn't be),
1645 the correct calculation is a real pain. FIXME (and fix GCC). */
1646 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1647 addr
= value_as_long (arr
);
1649 addr
= value_address (arr
);
1652 value_from_longest (lookup_pointer_type (bounds_type
),
1653 addr
- TYPE_LENGTH (bounds_type
));
1656 else if (is_thick_pntr (type
))
1658 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1659 _("Bad GNAT array descriptor"));
1660 struct type
*p_bounds_type
= value_type (p_bounds
);
1663 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1665 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1667 if (TYPE_STUB (target_type
))
1668 p_bounds
= value_cast (lookup_pointer_type
1669 (ada_check_typedef (target_type
)),
1673 error (_("Bad GNAT array descriptor"));
1681 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1682 position of the field containing the address of the bounds data. */
1685 fat_pntr_bounds_bitpos (struct type
*type
)
1687 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1690 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1691 size of the field containing the address of the bounds data. */
1694 fat_pntr_bounds_bitsize (struct type
*type
)
1696 type
= desc_base_type (type
);
1698 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1699 return TYPE_FIELD_BITSIZE (type
, 1);
1701 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1704 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1705 pointer to one, the type of its array data (a array-with-no-bounds type);
1706 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1709 static struct type
*
1710 desc_data_target_type (struct type
*type
)
1712 type
= desc_base_type (type
);
1714 /* NOTE: The following is bogus; see comment in desc_bounds. */
1715 if (is_thin_pntr (type
))
1716 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1717 else if (is_thick_pntr (type
))
1719 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1722 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1723 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1729 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1732 static struct value
*
1733 desc_data (struct value
*arr
)
1735 struct type
*type
= value_type (arr
);
1737 if (is_thin_pntr (type
))
1738 return thin_data_pntr (arr
);
1739 else if (is_thick_pntr (type
))
1740 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1741 _("Bad GNAT array descriptor"));
1747 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1748 position of the field containing the address of the data. */
1751 fat_pntr_data_bitpos (struct type
*type
)
1753 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1756 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1757 size of the field containing the address of the data. */
1760 fat_pntr_data_bitsize (struct type
*type
)
1762 type
= desc_base_type (type
);
1764 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1765 return TYPE_FIELD_BITSIZE (type
, 0);
1767 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1770 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1771 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1772 bound, if WHICH is 1. The first bound is I=1. */
1774 static struct value
*
1775 desc_one_bound (struct value
*bounds
, int i
, int which
)
1777 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1778 _("Bad GNAT array descriptor bounds"));
1781 /* If BOUNDS is an array-bounds structure type, return the bit position
1782 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1783 bound, if WHICH is 1. The first bound is I=1. */
1786 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1788 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1791 /* If BOUNDS is an array-bounds structure type, return the bit field size
1792 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1793 bound, if WHICH is 1. The first bound is I=1. */
1796 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1798 type
= desc_base_type (type
);
1800 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1801 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1803 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1806 /* If TYPE is the type of an array-bounds structure, the type of its
1807 Ith bound (numbering from 1). Otherwise, NULL. */
1809 static struct type
*
1810 desc_index_type (struct type
*type
, int i
)
1812 type
= desc_base_type (type
);
1814 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1815 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1820 /* The number of index positions in the array-bounds type TYPE.
1821 Return 0 if TYPE is NULL. */
1824 desc_arity (struct type
*type
)
1826 type
= desc_base_type (type
);
1829 return TYPE_NFIELDS (type
) / 2;
1833 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1834 an array descriptor type (representing an unconstrained array
1838 ada_is_direct_array_type (struct type
*type
)
1842 type
= ada_check_typedef (type
);
1843 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1844 || ada_is_array_descriptor_type (type
));
1847 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1851 ada_is_array_type (struct type
*type
)
1854 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1855 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1856 type
= TYPE_TARGET_TYPE (type
);
1857 return ada_is_direct_array_type (type
);
1860 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1863 ada_is_simple_array_type (struct type
*type
)
1867 type
= ada_check_typedef (type
);
1868 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1869 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1870 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1871 == TYPE_CODE_ARRAY
));
1874 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1877 ada_is_array_descriptor_type (struct type
*type
)
1879 struct type
*data_type
= desc_data_target_type (type
);
1883 type
= ada_check_typedef (type
);
1884 return (data_type
!= NULL
1885 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1886 && desc_arity (desc_bounds_type (type
)) > 0);
1889 /* Non-zero iff type is a partially mal-formed GNAT array
1890 descriptor. FIXME: This is to compensate for some problems with
1891 debugging output from GNAT. Re-examine periodically to see if it
1895 ada_is_bogus_array_descriptor (struct type
*type
)
1899 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1900 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1901 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1902 && !ada_is_array_descriptor_type (type
);
1906 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1907 (fat pointer) returns the type of the array data described---specifically,
1908 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1909 in from the descriptor; otherwise, they are left unspecified. If
1910 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1911 returns NULL. The result is simply the type of ARR if ARR is not
1914 ada_type_of_array (struct value
*arr
, int bounds
)
1916 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1917 return decode_constrained_packed_array_type (value_type (arr
));
1919 if (!ada_is_array_descriptor_type (value_type (arr
)))
1920 return value_type (arr
);
1924 struct type
*array_type
=
1925 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1927 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1928 TYPE_FIELD_BITSIZE (array_type
, 0) =
1929 decode_packed_array_bitsize (value_type (arr
));
1935 struct type
*elt_type
;
1937 struct value
*descriptor
;
1939 elt_type
= ada_array_element_type (value_type (arr
), -1);
1940 arity
= ada_array_arity (value_type (arr
));
1942 if (elt_type
== NULL
|| arity
== 0)
1943 return ada_check_typedef (value_type (arr
));
1945 descriptor
= desc_bounds (arr
);
1946 if (value_as_long (descriptor
) == 0)
1950 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1951 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1952 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1953 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1956 create_static_range_type (range_type
, value_type (low
),
1957 longest_to_int (value_as_long (low
)),
1958 longest_to_int (value_as_long (high
)));
1959 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1961 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1963 /* We need to store the element packed bitsize, as well as
1964 recompute the array size, because it was previously
1965 computed based on the unpacked element size. */
1966 LONGEST lo
= value_as_long (low
);
1967 LONGEST hi
= value_as_long (high
);
1969 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1970 decode_packed_array_bitsize (value_type (arr
));
1971 /* If the array has no element, then the size is already
1972 zero, and does not need to be recomputed. */
1976 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1978 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1983 return lookup_pointer_type (elt_type
);
1987 /* If ARR does not represent an array, returns ARR unchanged.
1988 Otherwise, returns either a standard GDB array with bounds set
1989 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1990 GDB array. Returns NULL if ARR is a null fat pointer. */
1993 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1995 if (ada_is_array_descriptor_type (value_type (arr
)))
1997 struct type
*arrType
= ada_type_of_array (arr
, 1);
1999 if (arrType
== NULL
)
2001 return value_cast (arrType
, value_copy (desc_data (arr
)));
2003 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2004 return decode_constrained_packed_array (arr
);
2009 /* If ARR does not represent an array, returns ARR unchanged.
2010 Otherwise, returns a standard GDB array describing ARR (which may
2011 be ARR itself if it already is in the proper form). */
2014 ada_coerce_to_simple_array (struct value
*arr
)
2016 if (ada_is_array_descriptor_type (value_type (arr
)))
2018 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2021 error (_("Bounds unavailable for null array pointer."));
2022 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
2023 return value_ind (arrVal
);
2025 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2026 return decode_constrained_packed_array (arr
);
2031 /* If TYPE represents a GNAT array type, return it translated to an
2032 ordinary GDB array type (possibly with BITSIZE fields indicating
2033 packing). For other types, is the identity. */
2036 ada_coerce_to_simple_array_type (struct type
*type
)
2038 if (ada_is_constrained_packed_array_type (type
))
2039 return decode_constrained_packed_array_type (type
);
2041 if (ada_is_array_descriptor_type (type
))
2042 return ada_check_typedef (desc_data_target_type (type
));
2047 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2050 ada_is_packed_array_type (struct type
*type
)
2054 type
= desc_base_type (type
);
2055 type
= ada_check_typedef (type
);
2057 ada_type_name (type
) != NULL
2058 && strstr (ada_type_name (type
), "___XP") != NULL
;
2061 /* Non-zero iff TYPE represents a standard GNAT constrained
2062 packed-array type. */
2065 ada_is_constrained_packed_array_type (struct type
*type
)
2067 return ada_is_packed_array_type (type
)
2068 && !ada_is_array_descriptor_type (type
);
2071 /* Non-zero iff TYPE represents an array descriptor for a
2072 unconstrained packed-array type. */
2075 ada_is_unconstrained_packed_array_type (struct type
*type
)
2077 return ada_is_packed_array_type (type
)
2078 && ada_is_array_descriptor_type (type
);
2081 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2082 return the size of its elements in bits. */
2085 decode_packed_array_bitsize (struct type
*type
)
2087 const char *raw_name
;
2091 /* Access to arrays implemented as fat pointers are encoded as a typedef
2092 of the fat pointer type. We need the name of the fat pointer type
2093 to do the decoding, so strip the typedef layer. */
2094 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2095 type
= ada_typedef_target_type (type
);
2097 raw_name
= ada_type_name (ada_check_typedef (type
));
2099 raw_name
= ada_type_name (desc_base_type (type
));
2104 tail
= strstr (raw_name
, "___XP");
2105 gdb_assert (tail
!= NULL
);
2107 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2110 (_("could not understand bit size information on packed array"));
2117 /* Given that TYPE is a standard GDB array type with all bounds filled
2118 in, and that the element size of its ultimate scalar constituents
2119 (that is, either its elements, or, if it is an array of arrays, its
2120 elements' elements, etc.) is *ELT_BITS, return an identical type,
2121 but with the bit sizes of its elements (and those of any
2122 constituent arrays) recorded in the BITSIZE components of its
2123 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2126 Note that, for arrays whose index type has an XA encoding where
2127 a bound references a record discriminant, getting that discriminant,
2128 and therefore the actual value of that bound, is not possible
2129 because none of the given parameters gives us access to the record.
2130 This function assumes that it is OK in the context where it is being
2131 used to return an array whose bounds are still dynamic and where
2132 the length is arbitrary. */
2134 static struct type
*
2135 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2137 struct type
*new_elt_type
;
2138 struct type
*new_type
;
2139 struct type
*index_type_desc
;
2140 struct type
*index_type
;
2141 LONGEST low_bound
, high_bound
;
2143 type
= ada_check_typedef (type
);
2144 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2147 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2148 if (index_type_desc
)
2149 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2152 index_type
= TYPE_INDEX_TYPE (type
);
2154 new_type
= alloc_type_copy (type
);
2156 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2158 create_array_type (new_type
, new_elt_type
, index_type
);
2159 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2160 TYPE_NAME (new_type
) = ada_type_name (type
);
2162 if ((TYPE_CODE (check_typedef (index_type
)) == TYPE_CODE_RANGE
2163 && is_dynamic_type (check_typedef (index_type
)))
2164 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2165 low_bound
= high_bound
= 0;
2166 if (high_bound
< low_bound
)
2167 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2170 *elt_bits
*= (high_bound
- low_bound
+ 1);
2171 TYPE_LENGTH (new_type
) =
2172 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2175 TYPE_FIXED_INSTANCE (new_type
) = 1;
2179 /* The array type encoded by TYPE, where
2180 ada_is_constrained_packed_array_type (TYPE). */
2182 static struct type
*
2183 decode_constrained_packed_array_type (struct type
*type
)
2185 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2188 struct type
*shadow_type
;
2192 raw_name
= ada_type_name (desc_base_type (type
));
2197 name
= (char *) alloca (strlen (raw_name
) + 1);
2198 tail
= strstr (raw_name
, "___XP");
2199 type
= desc_base_type (type
);
2201 memcpy (name
, raw_name
, tail
- raw_name
);
2202 name
[tail
- raw_name
] = '\000';
2204 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2206 if (shadow_type
== NULL
)
2208 lim_warning (_("could not find bounds information on packed array"));
2211 shadow_type
= check_typedef (shadow_type
);
2213 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2215 lim_warning (_("could not understand bounds "
2216 "information on packed array"));
2220 bits
= decode_packed_array_bitsize (type
);
2221 return constrained_packed_array_type (shadow_type
, &bits
);
2224 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2225 array, returns a simple array that denotes that array. Its type is a
2226 standard GDB array type except that the BITSIZEs of the array
2227 target types are set to the number of bits in each element, and the
2228 type length is set appropriately. */
2230 static struct value
*
2231 decode_constrained_packed_array (struct value
*arr
)
2235 /* If our value is a pointer, then dereference it. Likewise if
2236 the value is a reference. Make sure that this operation does not
2237 cause the target type to be fixed, as this would indirectly cause
2238 this array to be decoded. The rest of the routine assumes that
2239 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2240 and "value_ind" routines to perform the dereferencing, as opposed
2241 to using "ada_coerce_ref" or "ada_value_ind". */
2242 arr
= coerce_ref (arr
);
2243 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2244 arr
= value_ind (arr
);
2246 type
= decode_constrained_packed_array_type (value_type (arr
));
2249 error (_("can't unpack array"));
2253 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2254 && ada_is_modular_type (value_type (arr
)))
2256 /* This is a (right-justified) modular type representing a packed
2257 array with no wrapper. In order to interpret the value through
2258 the (left-justified) packed array type we just built, we must
2259 first left-justify it. */
2260 int bit_size
, bit_pos
;
2263 mod
= ada_modulus (value_type (arr
)) - 1;
2270 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2271 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2272 bit_pos
/ HOST_CHAR_BIT
,
2273 bit_pos
% HOST_CHAR_BIT
,
2278 return coerce_unspec_val_to_type (arr
, type
);
2282 /* The value of the element of packed array ARR at the ARITY indices
2283 given in IND. ARR must be a simple array. */
2285 static struct value
*
2286 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2289 int bits
, elt_off
, bit_off
;
2290 long elt_total_bit_offset
;
2291 struct type
*elt_type
;
2295 elt_total_bit_offset
= 0;
2296 elt_type
= ada_check_typedef (value_type (arr
));
2297 for (i
= 0; i
< arity
; i
+= 1)
2299 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2300 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2302 (_("attempt to do packed indexing of "
2303 "something other than a packed array"));
2306 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2307 LONGEST lowerbound
, upperbound
;
2310 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2312 lim_warning (_("don't know bounds of array"));
2313 lowerbound
= upperbound
= 0;
2316 idx
= pos_atr (ind
[i
]);
2317 if (idx
< lowerbound
|| idx
> upperbound
)
2318 lim_warning (_("packed array index %ld out of bounds"),
2320 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2321 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2322 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2325 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2326 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2328 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2333 /* Non-zero iff TYPE includes negative integer values. */
2336 has_negatives (struct type
*type
)
2338 switch (TYPE_CODE (type
))
2343 return !TYPE_UNSIGNED (type
);
2344 case TYPE_CODE_RANGE
:
2345 return TYPE_LOW_BOUND (type
) - TYPE_RANGE_DATA (type
)->bias
< 0;
2349 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2350 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2351 the unpacked buffer.
2353 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2354 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2356 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2359 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2361 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2364 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2365 gdb_byte
*unpacked
, int unpacked_len
,
2366 int is_big_endian
, int is_signed_type
,
2369 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2370 int src_idx
; /* Index into the source area */
2371 int src_bytes_left
; /* Number of source bytes left to process. */
2372 int srcBitsLeft
; /* Number of source bits left to move */
2373 int unusedLS
; /* Number of bits in next significant
2374 byte of source that are unused */
2376 int unpacked_idx
; /* Index into the unpacked buffer */
2377 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2379 unsigned long accum
; /* Staging area for bits being transferred */
2380 int accumSize
; /* Number of meaningful bits in accum */
2383 /* Transmit bytes from least to most significant; delta is the direction
2384 the indices move. */
2385 int delta
= is_big_endian
? -1 : 1;
2387 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2389 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2390 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2391 bit_size
, unpacked_len
);
2393 srcBitsLeft
= bit_size
;
2394 src_bytes_left
= src_len
;
2395 unpacked_bytes_left
= unpacked_len
;
2400 src_idx
= src_len
- 1;
2402 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2406 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2412 unpacked_idx
= unpacked_len
- 1;
2416 /* Non-scalar values must be aligned at a byte boundary... */
2418 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2419 /* ... And are placed at the beginning (most-significant) bytes
2421 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2422 unpacked_bytes_left
= unpacked_idx
+ 1;
2427 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2429 src_idx
= unpacked_idx
= 0;
2430 unusedLS
= bit_offset
;
2433 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2438 while (src_bytes_left
> 0)
2440 /* Mask for removing bits of the next source byte that are not
2441 part of the value. */
2442 unsigned int unusedMSMask
=
2443 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2445 /* Sign-extend bits for this byte. */
2446 unsigned int signMask
= sign
& ~unusedMSMask
;
2449 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2450 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2451 if (accumSize
>= HOST_CHAR_BIT
)
2453 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2454 accumSize
-= HOST_CHAR_BIT
;
2455 accum
>>= HOST_CHAR_BIT
;
2456 unpacked_bytes_left
-= 1;
2457 unpacked_idx
+= delta
;
2459 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2461 src_bytes_left
-= 1;
2464 while (unpacked_bytes_left
> 0)
2466 accum
|= sign
<< accumSize
;
2467 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2468 accumSize
-= HOST_CHAR_BIT
;
2471 accum
>>= HOST_CHAR_BIT
;
2472 unpacked_bytes_left
-= 1;
2473 unpacked_idx
+= delta
;
2477 /* Create a new value of type TYPE from the contents of OBJ starting
2478 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2479 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2480 assigning through the result will set the field fetched from.
2481 VALADDR is ignored unless OBJ is NULL, in which case,
2482 VALADDR+OFFSET must address the start of storage containing the
2483 packed value. The value returned in this case is never an lval.
2484 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2487 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2488 long offset
, int bit_offset
, int bit_size
,
2492 const gdb_byte
*src
; /* First byte containing data to unpack */
2494 const int is_scalar
= is_scalar_type (type
);
2495 const int is_big_endian
= gdbarch_bits_big_endian (get_type_arch (type
));
2496 gdb::byte_vector staging
;
2498 type
= ada_check_typedef (type
);
2501 src
= valaddr
+ offset
;
2503 src
= value_contents (obj
) + offset
;
2505 if (is_dynamic_type (type
))
2507 /* The length of TYPE might by dynamic, so we need to resolve
2508 TYPE in order to know its actual size, which we then use
2509 to create the contents buffer of the value we return.
2510 The difficulty is that the data containing our object is
2511 packed, and therefore maybe not at a byte boundary. So, what
2512 we do, is unpack the data into a byte-aligned buffer, and then
2513 use that buffer as our object's value for resolving the type. */
2514 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2515 staging
.resize (staging_len
);
2517 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2518 staging
.data (), staging
.size (),
2519 is_big_endian
, has_negatives (type
),
2521 type
= resolve_dynamic_type (type
, staging
.data (), 0);
2522 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2524 /* This happens when the length of the object is dynamic,
2525 and is actually smaller than the space reserved for it.
2526 For instance, in an array of variant records, the bit_size
2527 we're given is the array stride, which is constant and
2528 normally equal to the maximum size of its element.
2529 But, in reality, each element only actually spans a portion
2531 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2537 v
= allocate_value (type
);
2538 src
= valaddr
+ offset
;
2540 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2542 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2545 v
= value_at (type
, value_address (obj
) + offset
);
2546 buf
= (gdb_byte
*) alloca (src_len
);
2547 read_memory (value_address (v
), buf
, src_len
);
2552 v
= allocate_value (type
);
2553 src
= value_contents (obj
) + offset
;
2558 long new_offset
= offset
;
2560 set_value_component_location (v
, obj
);
2561 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2562 set_value_bitsize (v
, bit_size
);
2563 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2566 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2568 set_value_offset (v
, new_offset
);
2570 /* Also set the parent value. This is needed when trying to
2571 assign a new value (in inferior memory). */
2572 set_value_parent (v
, obj
);
2575 set_value_bitsize (v
, bit_size
);
2576 unpacked
= value_contents_writeable (v
);
2580 memset (unpacked
, 0, TYPE_LENGTH (type
));
2584 if (staging
.size () == TYPE_LENGTH (type
))
2586 /* Small short-cut: If we've unpacked the data into a buffer
2587 of the same size as TYPE's length, then we can reuse that,
2588 instead of doing the unpacking again. */
2589 memcpy (unpacked
, staging
.data (), staging
.size ());
2592 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2593 unpacked
, TYPE_LENGTH (type
),
2594 is_big_endian
, has_negatives (type
), is_scalar
);
2599 /* Store the contents of FROMVAL into the location of TOVAL.
2600 Return a new value with the location of TOVAL and contents of
2601 FROMVAL. Handles assignment into packed fields that have
2602 floating-point or non-scalar types. */
2604 static struct value
*
2605 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2607 struct type
*type
= value_type (toval
);
2608 int bits
= value_bitsize (toval
);
2610 toval
= ada_coerce_ref (toval
);
2611 fromval
= ada_coerce_ref (fromval
);
2613 if (ada_is_direct_array_type (value_type (toval
)))
2614 toval
= ada_coerce_to_simple_array (toval
);
2615 if (ada_is_direct_array_type (value_type (fromval
)))
2616 fromval
= ada_coerce_to_simple_array (fromval
);
2618 if (!deprecated_value_modifiable (toval
))
2619 error (_("Left operand of assignment is not a modifiable lvalue."));
2621 if (VALUE_LVAL (toval
) == lval_memory
2623 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2624 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2626 int len
= (value_bitpos (toval
)
2627 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2629 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2631 CORE_ADDR to_addr
= value_address (toval
);
2633 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2634 fromval
= value_cast (type
, fromval
);
2636 read_memory (to_addr
, buffer
, len
);
2637 from_size
= value_bitsize (fromval
);
2639 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2641 const int is_big_endian
= gdbarch_bits_big_endian (get_type_arch (type
));
2642 ULONGEST from_offset
= 0;
2643 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2644 from_offset
= from_size
- bits
;
2645 copy_bitwise (buffer
, value_bitpos (toval
),
2646 value_contents (fromval
), from_offset
,
2647 bits
, is_big_endian
);
2648 write_memory_with_notification (to_addr
, buffer
, len
);
2650 val
= value_copy (toval
);
2651 memcpy (value_contents_raw (val
), value_contents (fromval
),
2652 TYPE_LENGTH (type
));
2653 deprecated_set_value_type (val
, type
);
2658 return value_assign (toval
, fromval
);
2662 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2663 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2664 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2665 COMPONENT, and not the inferior's memory. The current contents
2666 of COMPONENT are ignored.
2668 Although not part of the initial design, this function also works
2669 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2670 had a null address, and COMPONENT had an address which is equal to
2671 its offset inside CONTAINER. */
2674 value_assign_to_component (struct value
*container
, struct value
*component
,
2677 LONGEST offset_in_container
=
2678 (LONGEST
) (value_address (component
) - value_address (container
));
2679 int bit_offset_in_container
=
2680 value_bitpos (component
) - value_bitpos (container
);
2683 val
= value_cast (value_type (component
), val
);
2685 if (value_bitsize (component
) == 0)
2686 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2688 bits
= value_bitsize (component
);
2690 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2694 if (is_scalar_type (check_typedef (value_type (component
))))
2696 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2699 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2700 value_bitpos (container
) + bit_offset_in_container
,
2701 value_contents (val
), src_offset
, bits
, 1);
2704 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2705 value_bitpos (container
) + bit_offset_in_container
,
2706 value_contents (val
), 0, bits
, 0);
2709 /* Determine if TYPE is an access to an unconstrained array. */
2712 ada_is_access_to_unconstrained_array (struct type
*type
)
2714 return (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
2715 && is_thick_pntr (ada_typedef_target_type (type
)));
2718 /* The value of the element of array ARR at the ARITY indices given in IND.
2719 ARR may be either a simple array, GNAT array descriptor, or pointer
2723 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2727 struct type
*elt_type
;
2729 elt
= ada_coerce_to_simple_array (arr
);
2731 elt_type
= ada_check_typedef (value_type (elt
));
2732 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2733 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2734 return value_subscript_packed (elt
, arity
, ind
);
2736 for (k
= 0; k
< arity
; k
+= 1)
2738 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2740 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2741 error (_("too many subscripts (%d expected)"), k
);
2743 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2745 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2746 && TYPE_CODE (value_type (elt
)) != TYPE_CODE_TYPEDEF
)
2748 /* The element is a typedef to an unconstrained array,
2749 except that the value_subscript call stripped the
2750 typedef layer. The typedef layer is GNAT's way to
2751 specify that the element is, at the source level, an
2752 access to the unconstrained array, rather than the
2753 unconstrained array. So, we need to restore that
2754 typedef layer, which we can do by forcing the element's
2755 type back to its original type. Otherwise, the returned
2756 value is going to be printed as the array, rather
2757 than as an access. Another symptom of the same issue
2758 would be that an expression trying to dereference the
2759 element would also be improperly rejected. */
2760 deprecated_set_value_type (elt
, saved_elt_type
);
2763 elt_type
= ada_check_typedef (value_type (elt
));
2769 /* Assuming ARR is a pointer to a GDB array, the value of the element
2770 of *ARR at the ARITY indices given in IND.
2771 Does not read the entire array into memory.
2773 Note: Unlike what one would expect, this function is used instead of
2774 ada_value_subscript for basically all non-packed array types. The reason
2775 for this is that a side effect of doing our own pointer arithmetics instead
2776 of relying on value_subscript is that there is no implicit typedef peeling.
2777 This is important for arrays of array accesses, where it allows us to
2778 preserve the fact that the array's element is an array access, where the
2779 access part os encoded in a typedef layer. */
2781 static struct value
*
2782 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2785 struct value
*array_ind
= ada_value_ind (arr
);
2787 = check_typedef (value_enclosing_type (array_ind
));
2789 if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
2790 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2791 return value_subscript_packed (array_ind
, arity
, ind
);
2793 for (k
= 0; k
< arity
; k
+= 1)
2796 struct value
*lwb_value
;
2798 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2799 error (_("too many subscripts (%d expected)"), k
);
2800 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2802 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2803 lwb_value
= value_from_longest (value_type(ind
[k
]), lwb
);
2804 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - pos_atr (lwb_value
));
2805 type
= TYPE_TARGET_TYPE (type
);
2808 return value_ind (arr
);
2811 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2812 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2813 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2814 this array is LOW, as per Ada rules. */
2815 static struct value
*
2816 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2819 struct type
*type0
= ada_check_typedef (type
);
2820 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
));
2821 struct type
*index_type
2822 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2823 struct type
*slice_type
= create_array_type_with_stride
2824 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2825 get_dyn_prop (DYN_PROP_BYTE_STRIDE
, type0
),
2826 TYPE_FIELD_BITSIZE (type0
, 0));
2827 int base_low
= ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
));
2828 LONGEST base_low_pos
, low_pos
;
2831 if (!discrete_position (base_index_type
, low
, &low_pos
)
2832 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2834 warning (_("unable to get positions in slice, use bounds instead"));
2836 base_low_pos
= base_low
;
2839 base
= value_as_address (array_ptr
)
2840 + ((low_pos
- base_low_pos
)
2841 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2842 return value_at_lazy (slice_type
, base
);
2846 static struct value
*
2847 ada_value_slice (struct value
*array
, int low
, int high
)
2849 struct type
*type
= ada_check_typedef (value_type (array
));
2850 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2851 struct type
*index_type
2852 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2853 struct type
*slice_type
= create_array_type_with_stride
2854 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2855 get_dyn_prop (DYN_PROP_BYTE_STRIDE
, type
),
2856 TYPE_FIELD_BITSIZE (type
, 0));
2857 LONGEST low_pos
, high_pos
;
2859 if (!discrete_position (base_index_type
, low
, &low_pos
)
2860 || !discrete_position (base_index_type
, high
, &high_pos
))
2862 warning (_("unable to get positions in slice, use bounds instead"));
2867 return value_cast (slice_type
,
2868 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2871 /* If type is a record type in the form of a standard GNAT array
2872 descriptor, returns the number of dimensions for type. If arr is a
2873 simple array, returns the number of "array of"s that prefix its
2874 type designation. Otherwise, returns 0. */
2877 ada_array_arity (struct type
*type
)
2884 type
= desc_base_type (type
);
2887 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2888 return desc_arity (desc_bounds_type (type
));
2890 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2893 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2899 /* If TYPE is a record type in the form of a standard GNAT array
2900 descriptor or a simple array type, returns the element type for
2901 TYPE after indexing by NINDICES indices, or by all indices if
2902 NINDICES is -1. Otherwise, returns NULL. */
2905 ada_array_element_type (struct type
*type
, int nindices
)
2907 type
= desc_base_type (type
);
2909 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2912 struct type
*p_array_type
;
2914 p_array_type
= desc_data_target_type (type
);
2916 k
= ada_array_arity (type
);
2920 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2921 if (nindices
>= 0 && k
> nindices
)
2923 while (k
> 0 && p_array_type
!= NULL
)
2925 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2928 return p_array_type
;
2930 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2932 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2934 type
= TYPE_TARGET_TYPE (type
);
2943 /* The type of nth index in arrays of given type (n numbering from 1).
2944 Does not examine memory. Throws an error if N is invalid or TYPE
2945 is not an array type. NAME is the name of the Ada attribute being
2946 evaluated ('range, 'first, 'last, or 'length); it is used in building
2947 the error message. */
2949 static struct type
*
2950 ada_index_type (struct type
*type
, int n
, const char *name
)
2952 struct type
*result_type
;
2954 type
= desc_base_type (type
);
2956 if (n
< 0 || n
> ada_array_arity (type
))
2957 error (_("invalid dimension number to '%s"), name
);
2959 if (ada_is_simple_array_type (type
))
2963 for (i
= 1; i
< n
; i
+= 1)
2964 type
= TYPE_TARGET_TYPE (type
);
2965 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2966 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2967 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2968 perhaps stabsread.c would make more sense. */
2969 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2974 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2975 if (result_type
== NULL
)
2976 error (_("attempt to take bound of something that is not an array"));
2982 /* Given that arr is an array type, returns the lower bound of the
2983 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2984 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2985 array-descriptor type. It works for other arrays with bounds supplied
2986 by run-time quantities other than discriminants. */
2989 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2991 struct type
*type
, *index_type_desc
, *index_type
;
2994 gdb_assert (which
== 0 || which
== 1);
2996 if (ada_is_constrained_packed_array_type (arr_type
))
2997 arr_type
= decode_constrained_packed_array_type (arr_type
);
2999 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
3000 return (LONGEST
) - which
;
3002 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
3003 type
= TYPE_TARGET_TYPE (arr_type
);
3007 if (TYPE_FIXED_INSTANCE (type
))
3009 /* The array has already been fixed, so we do not need to
3010 check the parallel ___XA type again. That encoding has
3011 already been applied, so ignore it now. */
3012 index_type_desc
= NULL
;
3016 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3017 ada_fixup_array_indexes_type (index_type_desc
);
3020 if (index_type_desc
!= NULL
)
3021 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
3025 struct type
*elt_type
= check_typedef (type
);
3027 for (i
= 1; i
< n
; i
++)
3028 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3030 index_type
= TYPE_INDEX_TYPE (elt_type
);
3034 (LONGEST
) (which
== 0
3035 ? ada_discrete_type_low_bound (index_type
)
3036 : ada_discrete_type_high_bound (index_type
));
3039 /* Given that arr is an array value, returns the lower bound of the
3040 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3041 WHICH is 1. This routine will also work for arrays with bounds
3042 supplied by run-time quantities other than discriminants. */
3045 ada_array_bound (struct value
*arr
, int n
, int which
)
3047 struct type
*arr_type
;
3049 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3050 arr
= value_ind (arr
);
3051 arr_type
= value_enclosing_type (arr
);
3053 if (ada_is_constrained_packed_array_type (arr_type
))
3054 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3055 else if (ada_is_simple_array_type (arr_type
))
3056 return ada_array_bound_from_type (arr_type
, n
, which
);
3058 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3061 /* Given that arr is an array value, returns the length of the
3062 nth index. This routine will also work for arrays with bounds
3063 supplied by run-time quantities other than discriminants.
3064 Does not work for arrays indexed by enumeration types with representation
3065 clauses at the moment. */
3068 ada_array_length (struct value
*arr
, int n
)
3070 struct type
*arr_type
, *index_type
;
3073 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3074 arr
= value_ind (arr
);
3075 arr_type
= value_enclosing_type (arr
);
3077 if (ada_is_constrained_packed_array_type (arr_type
))
3078 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3080 if (ada_is_simple_array_type (arr_type
))
3082 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3083 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3087 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3088 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3091 arr_type
= check_typedef (arr_type
);
3092 index_type
= ada_index_type (arr_type
, n
, "length");
3093 if (index_type
!= NULL
)
3095 struct type
*base_type
;
3096 if (TYPE_CODE (index_type
) == TYPE_CODE_RANGE
)
3097 base_type
= TYPE_TARGET_TYPE (index_type
);
3099 base_type
= index_type
;
3101 low
= pos_atr (value_from_longest (base_type
, low
));
3102 high
= pos_atr (value_from_longest (base_type
, high
));
3104 return high
- low
+ 1;
3107 /* An array whose type is that of ARR_TYPE (an array type), with
3108 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3109 less than LOW, then LOW-1 is used. */
3111 static struct value
*
3112 empty_array (struct type
*arr_type
, int low
, int high
)
3114 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3115 struct type
*index_type
3116 = create_static_range_type
3117 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
,
3118 high
< low
? low
- 1 : high
);
3119 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3121 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3125 /* Name resolution */
3127 /* The "decoded" name for the user-definable Ada operator corresponding
3131 ada_decoded_op_name (enum exp_opcode op
)
3135 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3137 if (ada_opname_table
[i
].op
== op
)
3138 return ada_opname_table
[i
].decoded
;
3140 error (_("Could not find operator name for opcode"));
3144 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3145 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3146 undefined namespace) and converts operators that are
3147 user-defined into appropriate function calls. If CONTEXT_TYPE is
3148 non-null, it provides a preferred result type [at the moment, only
3149 type void has any effect---causing procedures to be preferred over
3150 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3151 return type is preferred. May change (expand) *EXP. */
3154 resolve (expression_up
*expp
, int void_context_p
, int parse_completion
,
3155 innermost_block_tracker
*tracker
)
3157 struct type
*context_type
= NULL
;
3161 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3163 resolve_subexp (expp
, &pc
, 1, context_type
, parse_completion
, tracker
);
3166 /* Resolve the operator of the subexpression beginning at
3167 position *POS of *EXPP. "Resolving" consists of replacing
3168 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3169 with their resolutions, replacing built-in operators with
3170 function calls to user-defined operators, where appropriate, and,
3171 when DEPROCEDURE_P is non-zero, converting function-valued variables
3172 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3173 are as in ada_resolve, above. */
3175 static struct value
*
3176 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3177 struct type
*context_type
, int parse_completion
,
3178 innermost_block_tracker
*tracker
)
3182 struct expression
*exp
; /* Convenience: == *expp. */
3183 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3184 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3185 int nargs
; /* Number of operands. */
3192 /* Pass one: resolve operands, saving their types and updating *pos,
3197 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3198 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3203 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3205 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3210 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3215 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3216 parse_completion
, tracker
);
3219 case OP_ATR_MODULUS
:
3229 case TERNOP_IN_RANGE
:
3230 case BINOP_IN_BOUNDS
:
3236 case OP_DISCRETE_RANGE
:
3238 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3247 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3249 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3251 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3269 case BINOP_LOGICAL_AND
:
3270 case BINOP_LOGICAL_OR
:
3271 case BINOP_BITWISE_AND
:
3272 case BINOP_BITWISE_IOR
:
3273 case BINOP_BITWISE_XOR
:
3276 case BINOP_NOTEQUAL
:
3283 case BINOP_SUBSCRIPT
:
3291 case UNOP_LOGICAL_NOT
:
3301 case OP_VAR_MSYM_VALUE
:
3308 case OP_INTERNALVAR
:
3318 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3321 case STRUCTOP_STRUCT
:
3322 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3335 error (_("Unexpected operator during name resolution"));
3338 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3339 for (i
= 0; i
< nargs
; i
+= 1)
3340 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
,
3345 /* Pass two: perform any resolution on principal operator. */
3352 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3354 std::vector
<struct block_symbol
> candidates
;
3358 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3359 (exp
->elts
[pc
+ 2].symbol
),
3360 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3363 if (n_candidates
> 1)
3365 /* Types tend to get re-introduced locally, so if there
3366 are any local symbols that are not types, first filter
3369 for (j
= 0; j
< n_candidates
; j
+= 1)
3370 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3375 case LOC_REGPARM_ADDR
:
3383 if (j
< n_candidates
)
3386 while (j
< n_candidates
)
3388 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3390 candidates
[j
] = candidates
[n_candidates
- 1];
3399 if (n_candidates
== 0)
3400 error (_("No definition found for %s"),
3401 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3402 else if (n_candidates
== 1)
3404 else if (deprocedure_p
3405 && !is_nonfunction (candidates
.data (), n_candidates
))
3407 i
= ada_resolve_function
3408 (candidates
.data (), n_candidates
, NULL
, 0,
3409 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3410 context_type
, parse_completion
);
3412 error (_("Could not find a match for %s"),
3413 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3417 printf_filtered (_("Multiple matches for %s\n"),
3418 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3419 user_select_syms (candidates
.data (), n_candidates
, 1);
3423 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3424 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3425 tracker
->update (candidates
[i
]);
3429 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3432 replace_operator_with_call (expp
, pc
, 0, 4,
3433 exp
->elts
[pc
+ 2].symbol
,
3434 exp
->elts
[pc
+ 1].block
);
3441 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3442 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3444 std::vector
<struct block_symbol
> candidates
;
3448 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3449 (exp
->elts
[pc
+ 5].symbol
),
3450 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3453 if (n_candidates
== 1)
3457 i
= ada_resolve_function
3458 (candidates
.data (), n_candidates
,
3460 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3461 context_type
, parse_completion
);
3463 error (_("Could not find a match for %s"),
3464 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3467 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3468 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3469 tracker
->update (candidates
[i
]);
3480 case BINOP_BITWISE_AND
:
3481 case BINOP_BITWISE_IOR
:
3482 case BINOP_BITWISE_XOR
:
3484 case BINOP_NOTEQUAL
:
3492 case UNOP_LOGICAL_NOT
:
3494 if (possible_user_operator_p (op
, argvec
))
3496 std::vector
<struct block_symbol
> candidates
;
3500 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3504 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3505 nargs
, ada_decoded_op_name (op
), NULL
,
3510 replace_operator_with_call (expp
, pc
, nargs
, 1,
3511 candidates
[i
].symbol
,
3512 candidates
[i
].block
);
3523 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3524 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3525 exp
->elts
[pc
+ 1].objfile
,
3526 exp
->elts
[pc
+ 2].msymbol
);
3528 return evaluate_subexp_type (exp
, pos
);
3531 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3532 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3534 /* The term "match" here is rather loose. The match is heuristic and
3538 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3540 ftype
= ada_check_typedef (ftype
);
3541 atype
= ada_check_typedef (atype
);
3543 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3544 ftype
= TYPE_TARGET_TYPE (ftype
);
3545 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3546 atype
= TYPE_TARGET_TYPE (atype
);
3548 switch (TYPE_CODE (ftype
))
3551 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3553 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3554 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3555 TYPE_TARGET_TYPE (atype
), 0);
3558 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3560 case TYPE_CODE_ENUM
:
3561 case TYPE_CODE_RANGE
:
3562 switch (TYPE_CODE (atype
))
3565 case TYPE_CODE_ENUM
:
3566 case TYPE_CODE_RANGE
:
3572 case TYPE_CODE_ARRAY
:
3573 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3574 || ada_is_array_descriptor_type (atype
));
3576 case TYPE_CODE_STRUCT
:
3577 if (ada_is_array_descriptor_type (ftype
))
3578 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3579 || ada_is_array_descriptor_type (atype
));
3581 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3582 && !ada_is_array_descriptor_type (atype
));
3584 case TYPE_CODE_UNION
:
3586 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3590 /* Return non-zero if the formals of FUNC "sufficiently match" the
3591 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3592 may also be an enumeral, in which case it is treated as a 0-
3593 argument function. */
3596 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3599 struct type
*func_type
= SYMBOL_TYPE (func
);
3601 if (SYMBOL_CLASS (func
) == LOC_CONST
3602 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3603 return (n_actuals
== 0);
3604 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3607 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3610 for (i
= 0; i
< n_actuals
; i
+= 1)
3612 if (actuals
[i
] == NULL
)
3616 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3618 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3620 if (!ada_type_match (ftype
, atype
, 1))
3627 /* False iff function type FUNC_TYPE definitely does not produce a value
3628 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3629 FUNC_TYPE is not a valid function type with a non-null return type
3630 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3633 return_match (struct type
*func_type
, struct type
*context_type
)
3635 struct type
*return_type
;
3637 if (func_type
== NULL
)
3640 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3641 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3643 return_type
= get_base_type (func_type
);
3644 if (return_type
== NULL
)
3647 context_type
= get_base_type (context_type
);
3649 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3650 return context_type
== NULL
|| return_type
== context_type
;
3651 else if (context_type
== NULL
)
3652 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3654 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3658 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3659 function (if any) that matches the types of the NARGS arguments in
3660 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3661 that returns that type, then eliminate matches that don't. If
3662 CONTEXT_TYPE is void and there is at least one match that does not
3663 return void, eliminate all matches that do.
3665 Asks the user if there is more than one match remaining. Returns -1
3666 if there is no such symbol or none is selected. NAME is used
3667 solely for messages. May re-arrange and modify SYMS in
3668 the process; the index returned is for the modified vector. */
3671 ada_resolve_function (struct block_symbol syms
[],
3672 int nsyms
, struct value
**args
, int nargs
,
3673 const char *name
, struct type
*context_type
,
3674 int parse_completion
)
3678 int m
; /* Number of hits */
3681 /* In the first pass of the loop, we only accept functions matching
3682 context_type. If none are found, we add a second pass of the loop
3683 where every function is accepted. */
3684 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3686 for (k
= 0; k
< nsyms
; k
+= 1)
3688 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3690 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3691 && (fallback
|| return_match (type
, context_type
)))
3699 /* If we got multiple matches, ask the user which one to use. Don't do this
3700 interactive thing during completion, though, as the purpose of the
3701 completion is providing a list of all possible matches. Prompting the
3702 user to filter it down would be completely unexpected in this case. */
3705 else if (m
> 1 && !parse_completion
)
3707 printf_filtered (_("Multiple matches for %s\n"), name
);
3708 user_select_syms (syms
, m
, 1);
3714 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3715 in a listing of choices during disambiguation (see sort_choices, below).
3716 The idea is that overloadings of a subprogram name from the
3717 same package should sort in their source order. We settle for ordering
3718 such symbols by their trailing number (__N or $N). */
3721 encoded_ordered_before (const char *N0
, const char *N1
)
3725 else if (N0
== NULL
)
3731 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3733 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3735 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3736 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3741 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3744 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3746 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3747 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3749 return (strcmp (N0
, N1
) < 0);
3753 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3757 sort_choices (struct block_symbol syms
[], int nsyms
)
3761 for (i
= 1; i
< nsyms
; i
+= 1)
3763 struct block_symbol sym
= syms
[i
];
3766 for (j
= i
- 1; j
>= 0; j
-= 1)
3768 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].symbol
),
3769 SYMBOL_LINKAGE_NAME (sym
.symbol
)))
3771 syms
[j
+ 1] = syms
[j
];
3777 /* Whether GDB should display formals and return types for functions in the
3778 overloads selection menu. */
3779 static bool print_signatures
= true;
3781 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3782 all but functions, the signature is just the name of the symbol. For
3783 functions, this is the name of the function, the list of types for formals
3784 and the return type (if any). */
3787 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3788 const struct type_print_options
*flags
)
3790 struct type
*type
= SYMBOL_TYPE (sym
);
3792 fprintf_filtered (stream
, "%s", SYMBOL_PRINT_NAME (sym
));
3793 if (!print_signatures
3795 || TYPE_CODE (type
) != TYPE_CODE_FUNC
)
3798 if (TYPE_NFIELDS (type
) > 0)
3802 fprintf_filtered (stream
, " (");
3803 for (i
= 0; i
< TYPE_NFIELDS (type
); ++i
)
3806 fprintf_filtered (stream
, "; ");
3807 ada_print_type (TYPE_FIELD_TYPE (type
, i
), NULL
, stream
, -1, 0,
3810 fprintf_filtered (stream
, ")");
3812 if (TYPE_TARGET_TYPE (type
) != NULL
3813 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) != TYPE_CODE_VOID
)
3815 fprintf_filtered (stream
, " return ");
3816 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3820 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3821 by asking the user (if necessary), returning the number selected,
3822 and setting the first elements of SYMS items. Error if no symbols
3825 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3826 to be re-integrated one of these days. */
3829 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3832 int *chosen
= XALLOCAVEC (int , nsyms
);
3834 int first_choice
= (max_results
== 1) ? 1 : 2;
3835 const char *select_mode
= multiple_symbols_select_mode ();
3837 if (max_results
< 1)
3838 error (_("Request to select 0 symbols!"));
3842 if (select_mode
== multiple_symbols_cancel
)
3844 canceled because the command is ambiguous\n\
3845 See set/show multiple-symbol."));
3847 /* If select_mode is "all", then return all possible symbols.
3848 Only do that if more than one symbol can be selected, of course.
3849 Otherwise, display the menu as usual. */
3850 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3853 printf_filtered (_("[0] cancel\n"));
3854 if (max_results
> 1)
3855 printf_filtered (_("[1] all\n"));
3857 sort_choices (syms
, nsyms
);
3859 for (i
= 0; i
< nsyms
; i
+= 1)
3861 if (syms
[i
].symbol
== NULL
)
3864 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3866 struct symtab_and_line sal
=
3867 find_function_start_sal (syms
[i
].symbol
, 1);
3869 printf_filtered ("[%d] ", i
+ first_choice
);
3870 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3871 &type_print_raw_options
);
3872 if (sal
.symtab
== NULL
)
3873 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3874 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3878 styled_string (file_name_style
.style (),
3879 symtab_to_filename_for_display (sal
.symtab
)),
3886 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3887 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3888 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) == TYPE_CODE_ENUM
);
3889 struct symtab
*symtab
= NULL
;
3891 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3892 symtab
= symbol_symtab (syms
[i
].symbol
);
3894 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3896 printf_filtered ("[%d] ", i
+ first_choice
);
3897 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3898 &type_print_raw_options
);
3899 printf_filtered (_(" at %s:%d\n"),
3900 symtab_to_filename_for_display (symtab
),
3901 SYMBOL_LINE (syms
[i
].symbol
));
3903 else if (is_enumeral
3904 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].symbol
)) != NULL
)
3906 printf_filtered (("[%d] "), i
+ first_choice
);
3907 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3908 gdb_stdout
, -1, 0, &type_print_raw_options
);
3909 printf_filtered (_("'(%s) (enumeral)\n"),
3910 SYMBOL_PRINT_NAME (syms
[i
].symbol
));
3914 printf_filtered ("[%d] ", i
+ first_choice
);
3915 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3916 &type_print_raw_options
);
3919 printf_filtered (is_enumeral
3920 ? _(" in %s (enumeral)\n")
3922 symtab_to_filename_for_display (symtab
));
3924 printf_filtered (is_enumeral
3925 ? _(" (enumeral)\n")
3931 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3934 for (i
= 0; i
< n_chosen
; i
+= 1)
3935 syms
[i
] = syms
[chosen
[i
]];
3940 /* Read and validate a set of numeric choices from the user in the
3941 range 0 .. N_CHOICES-1. Place the results in increasing
3942 order in CHOICES[0 .. N-1], and return N.
3944 The user types choices as a sequence of numbers on one line
3945 separated by blanks, encoding them as follows:
3947 + A choice of 0 means to cancel the selection, throwing an error.
3948 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3949 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3951 The user is not allowed to choose more than MAX_RESULTS values.
3953 ANNOTATION_SUFFIX, if present, is used to annotate the input
3954 prompts (for use with the -f switch). */
3957 get_selections (int *choices
, int n_choices
, int max_results
,
3958 int is_all_choice
, const char *annotation_suffix
)
3963 int first_choice
= is_all_choice
? 2 : 1;
3965 prompt
= getenv ("PS2");
3969 args
= command_line_input (prompt
, annotation_suffix
);
3972 error_no_arg (_("one or more choice numbers"));
3976 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3977 order, as given in args. Choices are validated. */
3983 args
= skip_spaces (args
);
3984 if (*args
== '\0' && n_chosen
== 0)
3985 error_no_arg (_("one or more choice numbers"));
3986 else if (*args
== '\0')
3989 choice
= strtol (args
, &args2
, 10);
3990 if (args
== args2
|| choice
< 0
3991 || choice
> n_choices
+ first_choice
- 1)
3992 error (_("Argument must be choice number"));
3996 error (_("cancelled"));
3998 if (choice
< first_choice
)
4000 n_chosen
= n_choices
;
4001 for (j
= 0; j
< n_choices
; j
+= 1)
4005 choice
-= first_choice
;
4007 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
4011 if (j
< 0 || choice
!= choices
[j
])
4015 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
4016 choices
[k
+ 1] = choices
[k
];
4017 choices
[j
+ 1] = choice
;
4022 if (n_chosen
> max_results
)
4023 error (_("Select no more than %d of the above"), max_results
);
4028 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4029 on the function identified by SYM and BLOCK, and taking NARGS
4030 arguments. Update *EXPP as needed to hold more space. */
4033 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4034 int oplen
, struct symbol
*sym
,
4035 const struct block
*block
)
4037 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4038 symbol, -oplen for operator being replaced). */
4039 struct expression
*newexp
= (struct expression
*)
4040 xzalloc (sizeof (struct expression
)
4041 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
4042 struct expression
*exp
= expp
->get ();
4044 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4045 newexp
->language_defn
= exp
->language_defn
;
4046 newexp
->gdbarch
= exp
->gdbarch
;
4047 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4048 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4049 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4051 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4052 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4054 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4055 newexp
->elts
[pc
+ 4].block
= block
;
4056 newexp
->elts
[pc
+ 5].symbol
= sym
;
4058 expp
->reset (newexp
);
4061 /* Type-class predicates */
4063 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4067 numeric_type_p (struct type
*type
)
4073 switch (TYPE_CODE (type
))
4078 case TYPE_CODE_RANGE
:
4079 return (type
== TYPE_TARGET_TYPE (type
)
4080 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4087 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4090 integer_type_p (struct type
*type
)
4096 switch (TYPE_CODE (type
))
4100 case TYPE_CODE_RANGE
:
4101 return (type
== TYPE_TARGET_TYPE (type
)
4102 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4109 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4112 scalar_type_p (struct type
*type
)
4118 switch (TYPE_CODE (type
))
4121 case TYPE_CODE_RANGE
:
4122 case TYPE_CODE_ENUM
:
4131 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4134 discrete_type_p (struct type
*type
)
4140 switch (TYPE_CODE (type
))
4143 case TYPE_CODE_RANGE
:
4144 case TYPE_CODE_ENUM
:
4145 case TYPE_CODE_BOOL
:
4153 /* Returns non-zero if OP with operands in the vector ARGS could be
4154 a user-defined function. Errs on the side of pre-defined operators
4155 (i.e., result 0). */
4158 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4160 struct type
*type0
=
4161 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4162 struct type
*type1
=
4163 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4177 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4181 case BINOP_BITWISE_AND
:
4182 case BINOP_BITWISE_IOR
:
4183 case BINOP_BITWISE_XOR
:
4184 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4187 case BINOP_NOTEQUAL
:
4192 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4195 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4198 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4202 case UNOP_LOGICAL_NOT
:
4204 return (!numeric_type_p (type0
));
4213 1. In the following, we assume that a renaming type's name may
4214 have an ___XD suffix. It would be nice if this went away at some
4216 2. We handle both the (old) purely type-based representation of
4217 renamings and the (new) variable-based encoding. At some point,
4218 it is devoutly to be hoped that the former goes away
4219 (FIXME: hilfinger-2007-07-09).
4220 3. Subprogram renamings are not implemented, although the XRS
4221 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4223 /* If SYM encodes a renaming,
4225 <renaming> renames <renamed entity>,
4227 sets *LEN to the length of the renamed entity's name,
4228 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4229 the string describing the subcomponent selected from the renamed
4230 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4231 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4232 are undefined). Otherwise, returns a value indicating the category
4233 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4234 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4235 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4236 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4237 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4238 may be NULL, in which case they are not assigned.
4240 [Currently, however, GCC does not generate subprogram renamings.] */
4242 enum ada_renaming_category
4243 ada_parse_renaming (struct symbol
*sym
,
4244 const char **renamed_entity
, int *len
,
4245 const char **renaming_expr
)
4247 enum ada_renaming_category kind
;
4252 return ADA_NOT_RENAMING
;
4253 switch (SYMBOL_CLASS (sym
))
4256 return ADA_NOT_RENAMING
;
4260 case LOC_OPTIMIZED_OUT
:
4261 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4263 return ADA_NOT_RENAMING
;
4267 kind
= ADA_OBJECT_RENAMING
;
4271 kind
= ADA_EXCEPTION_RENAMING
;
4275 kind
= ADA_PACKAGE_RENAMING
;
4279 kind
= ADA_SUBPROGRAM_RENAMING
;
4283 return ADA_NOT_RENAMING
;
4287 if (renamed_entity
!= NULL
)
4288 *renamed_entity
= info
;
4289 suffix
= strstr (info
, "___XE");
4290 if (suffix
== NULL
|| suffix
== info
)
4291 return ADA_NOT_RENAMING
;
4293 *len
= strlen (info
) - strlen (suffix
);
4295 if (renaming_expr
!= NULL
)
4296 *renaming_expr
= suffix
;
4300 /* Compute the value of the given RENAMING_SYM, which is expected to
4301 be a symbol encoding a renaming expression. BLOCK is the block
4302 used to evaluate the renaming. */
4304 static struct value
*
4305 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4306 const struct block
*block
)
4308 const char *sym_name
;
4310 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4311 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4312 return evaluate_expression (expr
.get ());
4316 /* Evaluation: Function Calls */
4318 /* Return an lvalue containing the value VAL. This is the identity on
4319 lvalues, and otherwise has the side-effect of allocating memory
4320 in the inferior where a copy of the value contents is copied. */
4322 static struct value
*
4323 ensure_lval (struct value
*val
)
4325 if (VALUE_LVAL (val
) == not_lval
4326 || VALUE_LVAL (val
) == lval_internalvar
)
4328 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4329 const CORE_ADDR addr
=
4330 value_as_long (value_allocate_space_in_inferior (len
));
4332 VALUE_LVAL (val
) = lval_memory
;
4333 set_value_address (val
, addr
);
4334 write_memory (addr
, value_contents (val
), len
);
4340 /* Return the value ACTUAL, converted to be an appropriate value for a
4341 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4342 allocating any necessary descriptors (fat pointers), or copies of
4343 values not residing in memory, updating it as needed. */
4346 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4348 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4349 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4350 struct type
*formal_target
=
4351 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4352 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4353 struct type
*actual_target
=
4354 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4355 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4357 if (ada_is_array_descriptor_type (formal_target
)
4358 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4359 return make_array_descriptor (formal_type
, actual
);
4360 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4361 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4363 struct value
*result
;
4365 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4366 && ada_is_array_descriptor_type (actual_target
))
4367 result
= desc_data (actual
);
4368 else if (TYPE_CODE (formal_type
) != TYPE_CODE_PTR
)
4370 if (VALUE_LVAL (actual
) != lval_memory
)
4374 actual_type
= ada_check_typedef (value_type (actual
));
4375 val
= allocate_value (actual_type
);
4376 memcpy ((char *) value_contents_raw (val
),
4377 (char *) value_contents (actual
),
4378 TYPE_LENGTH (actual_type
));
4379 actual
= ensure_lval (val
);
4381 result
= value_addr (actual
);
4385 return value_cast_pointers (formal_type
, result
, 0);
4387 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4388 return ada_value_ind (actual
);
4389 else if (ada_is_aligner_type (formal_type
))
4391 /* We need to turn this parameter into an aligner type
4393 struct value
*aligner
= allocate_value (formal_type
);
4394 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4396 value_assign_to_component (aligner
, component
, actual
);
4403 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4404 type TYPE. This is usually an inefficient no-op except on some targets
4405 (such as AVR) where the representation of a pointer and an address
4409 value_pointer (struct value
*value
, struct type
*type
)
4411 struct gdbarch
*gdbarch
= get_type_arch (type
);
4412 unsigned len
= TYPE_LENGTH (type
);
4413 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4416 addr
= value_address (value
);
4417 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4418 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4423 /* Push a descriptor of type TYPE for array value ARR on the stack at
4424 *SP, updating *SP to reflect the new descriptor. Return either
4425 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4426 to-descriptor type rather than a descriptor type), a struct value *
4427 representing a pointer to this descriptor. */
4429 static struct value
*
4430 make_array_descriptor (struct type
*type
, struct value
*arr
)
4432 struct type
*bounds_type
= desc_bounds_type (type
);
4433 struct type
*desc_type
= desc_base_type (type
);
4434 struct value
*descriptor
= allocate_value (desc_type
);
4435 struct value
*bounds
= allocate_value (bounds_type
);
4438 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4441 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4442 ada_array_bound (arr
, i
, 0),
4443 desc_bound_bitpos (bounds_type
, i
, 0),
4444 desc_bound_bitsize (bounds_type
, i
, 0));
4445 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4446 ada_array_bound (arr
, i
, 1),
4447 desc_bound_bitpos (bounds_type
, i
, 1),
4448 desc_bound_bitsize (bounds_type
, i
, 1));
4451 bounds
= ensure_lval (bounds
);
4453 modify_field (value_type (descriptor
),
4454 value_contents_writeable (descriptor
),
4455 value_pointer (ensure_lval (arr
),
4456 TYPE_FIELD_TYPE (desc_type
, 0)),
4457 fat_pntr_data_bitpos (desc_type
),
4458 fat_pntr_data_bitsize (desc_type
));
4460 modify_field (value_type (descriptor
),
4461 value_contents_writeable (descriptor
),
4462 value_pointer (bounds
,
4463 TYPE_FIELD_TYPE (desc_type
, 1)),
4464 fat_pntr_bounds_bitpos (desc_type
),
4465 fat_pntr_bounds_bitsize (desc_type
));
4467 descriptor
= ensure_lval (descriptor
);
4469 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4470 return value_addr (descriptor
);
4475 /* Symbol Cache Module */
4477 /* Performance measurements made as of 2010-01-15 indicate that
4478 this cache does bring some noticeable improvements. Depending
4479 on the type of entity being printed, the cache can make it as much
4480 as an order of magnitude faster than without it.
4482 The descriptive type DWARF extension has significantly reduced
4483 the need for this cache, at least when DWARF is being used. However,
4484 even in this case, some expensive name-based symbol searches are still
4485 sometimes necessary - to find an XVZ variable, mostly. */
4487 /* Initialize the contents of SYM_CACHE. */
4490 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4492 obstack_init (&sym_cache
->cache_space
);
4493 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4496 /* Free the memory used by SYM_CACHE. */
4499 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4501 obstack_free (&sym_cache
->cache_space
, NULL
);
4505 /* Return the symbol cache associated to the given program space PSPACE.
4506 If not allocated for this PSPACE yet, allocate and initialize one. */
4508 static struct ada_symbol_cache
*
4509 ada_get_symbol_cache (struct program_space
*pspace
)
4511 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4513 if (pspace_data
->sym_cache
== NULL
)
4515 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4516 ada_init_symbol_cache (pspace_data
->sym_cache
);
4519 return pspace_data
->sym_cache
;
4522 /* Clear all entries from the symbol cache. */
4525 ada_clear_symbol_cache (void)
4527 struct ada_symbol_cache
*sym_cache
4528 = ada_get_symbol_cache (current_program_space
);
4530 obstack_free (&sym_cache
->cache_space
, NULL
);
4531 ada_init_symbol_cache (sym_cache
);
4534 /* Search our cache for an entry matching NAME and DOMAIN.
4535 Return it if found, or NULL otherwise. */
4537 static struct cache_entry
**
4538 find_entry (const char *name
, domain_enum domain
)
4540 struct ada_symbol_cache
*sym_cache
4541 = ada_get_symbol_cache (current_program_space
);
4542 int h
= msymbol_hash (name
) % HASH_SIZE
;
4543 struct cache_entry
**e
;
4545 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4547 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4553 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4554 Return 1 if found, 0 otherwise.
4556 If an entry was found and SYM is not NULL, set *SYM to the entry's
4557 SYM. Same principle for BLOCK if not NULL. */
4560 lookup_cached_symbol (const char *name
, domain_enum domain
,
4561 struct symbol
**sym
, const struct block
**block
)
4563 struct cache_entry
**e
= find_entry (name
, domain
);
4570 *block
= (*e
)->block
;
4574 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4575 in domain DOMAIN, save this result in our symbol cache. */
4578 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4579 const struct block
*block
)
4581 struct ada_symbol_cache
*sym_cache
4582 = ada_get_symbol_cache (current_program_space
);
4585 struct cache_entry
*e
;
4587 /* Symbols for builtin types don't have a block.
4588 For now don't cache such symbols. */
4589 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4592 /* If the symbol is a local symbol, then do not cache it, as a search
4593 for that symbol depends on the context. To determine whether
4594 the symbol is local or not, we check the block where we found it
4595 against the global and static blocks of its associated symtab. */
4597 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4598 GLOBAL_BLOCK
) != block
4599 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4600 STATIC_BLOCK
) != block
)
4603 h
= msymbol_hash (name
) % HASH_SIZE
;
4604 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4605 e
->next
= sym_cache
->root
[h
];
4606 sym_cache
->root
[h
] = e
;
4608 = (char *) obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4609 strcpy (copy
, name
);
4617 /* Return the symbol name match type that should be used used when
4618 searching for all symbols matching LOOKUP_NAME.
4620 LOOKUP_NAME is expected to be a symbol name after transformation
4623 static symbol_name_match_type
4624 name_match_type_from_name (const char *lookup_name
)
4626 return (strstr (lookup_name
, "__") == NULL
4627 ? symbol_name_match_type::WILD
4628 : symbol_name_match_type::FULL
);
4631 /* Return the result of a standard (literal, C-like) lookup of NAME in
4632 given DOMAIN, visible from lexical block BLOCK. */
4634 static struct symbol
*
4635 standard_lookup (const char *name
, const struct block
*block
,
4638 /* Initialize it just to avoid a GCC false warning. */
4639 struct block_symbol sym
= {};
4641 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4643 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4644 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4649 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4650 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4651 since they contend in overloading in the same way. */
4653 is_nonfunction (struct block_symbol syms
[], int n
)
4657 for (i
= 0; i
< n
; i
+= 1)
4658 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_FUNC
4659 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
4660 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4666 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4667 struct types. Otherwise, they may not. */
4670 equiv_types (struct type
*type0
, struct type
*type1
)
4674 if (type0
== NULL
|| type1
== NULL
4675 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4677 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4678 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4679 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4680 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4686 /* True iff SYM0 represents the same entity as SYM1, or one that is
4687 no more defined than that of SYM1. */
4690 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4694 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4695 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4698 switch (SYMBOL_CLASS (sym0
))
4704 struct type
*type0
= SYMBOL_TYPE (sym0
);
4705 struct type
*type1
= SYMBOL_TYPE (sym1
);
4706 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4707 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4708 int len0
= strlen (name0
);
4711 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4712 && (equiv_types (type0
, type1
)
4713 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4714 && startswith (name1
+ len0
, "___XV")));
4717 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4718 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4722 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4723 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4724 return (strcmp (name0
, name1
) == 0
4725 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4733 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4734 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4737 add_defn_to_vec (struct obstack
*obstackp
,
4739 const struct block
*block
)
4742 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4744 /* Do not try to complete stub types, as the debugger is probably
4745 already scanning all symbols matching a certain name at the
4746 time when this function is called. Trying to replace the stub
4747 type by its associated full type will cause us to restart a scan
4748 which may lead to an infinite recursion. Instead, the client
4749 collecting the matching symbols will end up collecting several
4750 matches, with at least one of them complete. It can then filter
4751 out the stub ones if needed. */
4753 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4755 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4757 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4759 prevDefns
[i
].symbol
= sym
;
4760 prevDefns
[i
].block
= block
;
4766 struct block_symbol info
;
4770 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4774 /* Number of block_symbol structures currently collected in current vector in
4778 num_defns_collected (struct obstack
*obstackp
)
4780 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4783 /* Vector of block_symbol structures currently collected in current vector in
4784 OBSTACKP. If FINISH, close off the vector and return its final address. */
4786 static struct block_symbol
*
4787 defns_collected (struct obstack
*obstackp
, int finish
)
4790 return (struct block_symbol
*) obstack_finish (obstackp
);
4792 return (struct block_symbol
*) obstack_base (obstackp
);
4795 /* Return a bound minimal symbol matching NAME according to Ada
4796 decoding rules. Returns an invalid symbol if there is no such
4797 minimal symbol. Names prefixed with "standard__" are handled
4798 specially: "standard__" is first stripped off, and only static and
4799 global symbols are searched. */
4801 struct bound_minimal_symbol
4802 ada_lookup_simple_minsym (const char *name
)
4804 struct bound_minimal_symbol result
;
4806 memset (&result
, 0, sizeof (result
));
4808 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4809 lookup_name_info
lookup_name (name
, match_type
);
4811 symbol_name_matcher_ftype
*match_name
4812 = ada_get_symbol_name_matcher (lookup_name
);
4814 for (objfile
*objfile
: current_program_space
->objfiles ())
4816 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4818 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), lookup_name
, NULL
)
4819 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4821 result
.minsym
= msymbol
;
4822 result
.objfile
= objfile
;
4831 /* For all subprograms that statically enclose the subprogram of the
4832 selected frame, add symbols matching identifier NAME in DOMAIN
4833 and their blocks to the list of data in OBSTACKP, as for
4834 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4835 with a wildcard prefix. */
4838 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4839 const lookup_name_info
&lookup_name
,
4844 /* True if TYPE is definitely an artificial type supplied to a symbol
4845 for which no debugging information was given in the symbol file. */
4848 is_nondebugging_type (struct type
*type
)
4850 const char *name
= ada_type_name (type
);
4852 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4855 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4856 that are deemed "identical" for practical purposes.
4858 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4859 types and that their number of enumerals is identical (in other
4860 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4863 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4867 /* The heuristic we use here is fairly conservative. We consider
4868 that 2 enumerate types are identical if they have the same
4869 number of enumerals and that all enumerals have the same
4870 underlying value and name. */
4872 /* All enums in the type should have an identical underlying value. */
4873 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4874 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4877 /* All enumerals should also have the same name (modulo any numerical
4879 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4881 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4882 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4883 int len_1
= strlen (name_1
);
4884 int len_2
= strlen (name_2
);
4886 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4887 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4889 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4890 TYPE_FIELD_NAME (type2
, i
),
4898 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4899 that are deemed "identical" for practical purposes. Sometimes,
4900 enumerals are not strictly identical, but their types are so similar
4901 that they can be considered identical.
4903 For instance, consider the following code:
4905 type Color is (Black, Red, Green, Blue, White);
4906 type RGB_Color is new Color range Red .. Blue;
4908 Type RGB_Color is a subrange of an implicit type which is a copy
4909 of type Color. If we call that implicit type RGB_ColorB ("B" is
4910 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4911 As a result, when an expression references any of the enumeral
4912 by name (Eg. "print green"), the expression is technically
4913 ambiguous and the user should be asked to disambiguate. But
4914 doing so would only hinder the user, since it wouldn't matter
4915 what choice he makes, the outcome would always be the same.
4916 So, for practical purposes, we consider them as the same. */
4919 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
4923 /* Before performing a thorough comparison check of each type,
4924 we perform a series of inexpensive checks. We expect that these
4925 checks will quickly fail in the vast majority of cases, and thus
4926 help prevent the unnecessary use of a more expensive comparison.
4927 Said comparison also expects us to make some of these checks
4928 (see ada_identical_enum_types_p). */
4930 /* Quick check: All symbols should have an enum type. */
4931 for (i
= 0; i
< syms
.size (); i
++)
4932 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
)
4935 /* Quick check: They should all have the same value. */
4936 for (i
= 1; i
< syms
.size (); i
++)
4937 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
4940 /* Quick check: They should all have the same number of enumerals. */
4941 for (i
= 1; i
< syms
.size (); i
++)
4942 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].symbol
))
4943 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].symbol
)))
4946 /* All the sanity checks passed, so we might have a set of
4947 identical enumeration types. Perform a more complete
4948 comparison of the type of each symbol. */
4949 for (i
= 1; i
< syms
.size (); i
++)
4950 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
4951 SYMBOL_TYPE (syms
[0].symbol
)))
4957 /* Remove any non-debugging symbols in SYMS that definitely
4958 duplicate other symbols in the list (The only case I know of where
4959 this happens is when object files containing stabs-in-ecoff are
4960 linked with files containing ordinary ecoff debugging symbols (or no
4961 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4962 Returns the number of items in the modified list. */
4965 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
4969 /* We should never be called with less than 2 symbols, as there
4970 cannot be any extra symbol in that case. But it's easy to
4971 handle, since we have nothing to do in that case. */
4972 if (syms
->size () < 2)
4973 return syms
->size ();
4976 while (i
< syms
->size ())
4980 /* If two symbols have the same name and one of them is a stub type,
4981 the get rid of the stub. */
4983 if (TYPE_STUB (SYMBOL_TYPE ((*syms
)[i
].symbol
))
4984 && SYMBOL_LINKAGE_NAME ((*syms
)[i
].symbol
) != NULL
)
4986 for (j
= 0; j
< syms
->size (); j
++)
4989 && !TYPE_STUB (SYMBOL_TYPE ((*syms
)[j
].symbol
))
4990 && SYMBOL_LINKAGE_NAME ((*syms
)[j
].symbol
) != NULL
4991 && strcmp (SYMBOL_LINKAGE_NAME ((*syms
)[i
].symbol
),
4992 SYMBOL_LINKAGE_NAME ((*syms
)[j
].symbol
)) == 0)
4997 /* Two symbols with the same name, same class and same address
4998 should be identical. */
5000 else if (SYMBOL_LINKAGE_NAME ((*syms
)[i
].symbol
) != NULL
5001 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5002 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5004 for (j
= 0; j
< syms
->size (); j
+= 1)
5007 && SYMBOL_LINKAGE_NAME ((*syms
)[j
].symbol
) != NULL
5008 && strcmp (SYMBOL_LINKAGE_NAME ((*syms
)[i
].symbol
),
5009 SYMBOL_LINKAGE_NAME ((*syms
)[j
].symbol
)) == 0
5010 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5011 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5012 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5013 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5019 syms
->erase (syms
->begin () + i
);
5024 /* If all the remaining symbols are identical enumerals, then
5025 just keep the first one and discard the rest.
5027 Unlike what we did previously, we do not discard any entry
5028 unless they are ALL identical. This is because the symbol
5029 comparison is not a strict comparison, but rather a practical
5030 comparison. If all symbols are considered identical, then
5031 we can just go ahead and use the first one and discard the rest.
5032 But if we cannot reduce the list to a single element, we have
5033 to ask the user to disambiguate anyways. And if we have to
5034 present a multiple-choice menu, it's less confusing if the list
5035 isn't missing some choices that were identical and yet distinct. */
5036 if (symbols_are_identical_enums (*syms
))
5039 return syms
->size ();
5042 /* Given a type that corresponds to a renaming entity, use the type name
5043 to extract the scope (package name or function name, fully qualified,
5044 and following the GNAT encoding convention) where this renaming has been
5048 xget_renaming_scope (struct type
*renaming_type
)
5050 /* The renaming types adhere to the following convention:
5051 <scope>__<rename>___<XR extension>.
5052 So, to extract the scope, we search for the "___XR" extension,
5053 and then backtrack until we find the first "__". */
5055 const char *name
= TYPE_NAME (renaming_type
);
5056 const char *suffix
= strstr (name
, "___XR");
5059 /* Now, backtrack a bit until we find the first "__". Start looking
5060 at suffix - 3, as the <rename> part is at least one character long. */
5062 for (last
= suffix
- 3; last
> name
; last
--)
5063 if (last
[0] == '_' && last
[1] == '_')
5066 /* Make a copy of scope and return it. */
5067 return std::string (name
, last
);
5070 /* Return nonzero if NAME corresponds to a package name. */
5073 is_package_name (const char *name
)
5075 /* Here, We take advantage of the fact that no symbols are generated
5076 for packages, while symbols are generated for each function.
5077 So the condition for NAME represent a package becomes equivalent
5078 to NAME not existing in our list of symbols. There is only one
5079 small complication with library-level functions (see below). */
5081 /* If it is a function that has not been defined at library level,
5082 then we should be able to look it up in the symbols. */
5083 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5086 /* Library-level function names start with "_ada_". See if function
5087 "_ada_" followed by NAME can be found. */
5089 /* Do a quick check that NAME does not contain "__", since library-level
5090 functions names cannot contain "__" in them. */
5091 if (strstr (name
, "__") != NULL
)
5094 std::string fun_name
= string_printf ("_ada_%s", name
);
5096 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5099 /* Return nonzero if SYM corresponds to a renaming entity that is
5100 not visible from FUNCTION_NAME. */
5103 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5105 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5108 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5110 /* If the rename has been defined in a package, then it is visible. */
5111 if (is_package_name (scope
.c_str ()))
5114 /* Check that the rename is in the current function scope by checking
5115 that its name starts with SCOPE. */
5117 /* If the function name starts with "_ada_", it means that it is
5118 a library-level function. Strip this prefix before doing the
5119 comparison, as the encoding for the renaming does not contain
5121 if (startswith (function_name
, "_ada_"))
5124 return !startswith (function_name
, scope
.c_str ());
5127 /* Remove entries from SYMS that corresponds to a renaming entity that
5128 is not visible from the function associated with CURRENT_BLOCK or
5129 that is superfluous due to the presence of more specific renaming
5130 information. Places surviving symbols in the initial entries of
5131 SYMS and returns the number of surviving symbols.
5134 First, in cases where an object renaming is implemented as a
5135 reference variable, GNAT may produce both the actual reference
5136 variable and the renaming encoding. In this case, we discard the
5139 Second, GNAT emits a type following a specified encoding for each renaming
5140 entity. Unfortunately, STABS currently does not support the definition
5141 of types that are local to a given lexical block, so all renamings types
5142 are emitted at library level. As a consequence, if an application
5143 contains two renaming entities using the same name, and a user tries to
5144 print the value of one of these entities, the result of the ada symbol
5145 lookup will also contain the wrong renaming type.
5147 This function partially covers for this limitation by attempting to
5148 remove from the SYMS list renaming symbols that should be visible
5149 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5150 method with the current information available. The implementation
5151 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5153 - When the user tries to print a rename in a function while there
5154 is another rename entity defined in a package: Normally, the
5155 rename in the function has precedence over the rename in the
5156 package, so the latter should be removed from the list. This is
5157 currently not the case.
5159 - This function will incorrectly remove valid renames if
5160 the CURRENT_BLOCK corresponds to a function which symbol name
5161 has been changed by an "Export" pragma. As a consequence,
5162 the user will be unable to print such rename entities. */
5165 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5166 const struct block
*current_block
)
5168 struct symbol
*current_function
;
5169 const char *current_function_name
;
5171 int is_new_style_renaming
;
5173 /* If there is both a renaming foo___XR... encoded as a variable and
5174 a simple variable foo in the same block, discard the latter.
5175 First, zero out such symbols, then compress. */
5176 is_new_style_renaming
= 0;
5177 for (i
= 0; i
< syms
->size (); i
+= 1)
5179 struct symbol
*sym
= (*syms
)[i
].symbol
;
5180 const struct block
*block
= (*syms
)[i
].block
;
5184 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5186 name
= SYMBOL_LINKAGE_NAME (sym
);
5187 suffix
= strstr (name
, "___XR");
5191 int name_len
= suffix
- name
;
5194 is_new_style_renaming
= 1;
5195 for (j
= 0; j
< syms
->size (); j
+= 1)
5196 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5197 && strncmp (name
, SYMBOL_LINKAGE_NAME ((*syms
)[j
].symbol
),
5199 && block
== (*syms
)[j
].block
)
5200 (*syms
)[j
].symbol
= NULL
;
5203 if (is_new_style_renaming
)
5207 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5208 if ((*syms
)[j
].symbol
!= NULL
)
5210 (*syms
)[k
] = (*syms
)[j
];
5216 /* Extract the function name associated to CURRENT_BLOCK.
5217 Abort if unable to do so. */
5219 if (current_block
== NULL
)
5220 return syms
->size ();
5222 current_function
= block_linkage_function (current_block
);
5223 if (current_function
== NULL
)
5224 return syms
->size ();
5226 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5227 if (current_function_name
== NULL
)
5228 return syms
->size ();
5230 /* Check each of the symbols, and remove it from the list if it is
5231 a type corresponding to a renaming that is out of the scope of
5232 the current block. */
5235 while (i
< syms
->size ())
5237 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5238 == ADA_OBJECT_RENAMING
5239 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5240 current_function_name
))
5241 syms
->erase (syms
->begin () + i
);
5246 return syms
->size ();
5249 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5250 whose name and domain match NAME and DOMAIN respectively.
5251 If no match was found, then extend the search to "enclosing"
5252 routines (in other words, if we're inside a nested function,
5253 search the symbols defined inside the enclosing functions).
5254 If WILD_MATCH_P is nonzero, perform the naming matching in
5255 "wild" mode (see function "wild_match" for more info).
5257 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5260 ada_add_local_symbols (struct obstack
*obstackp
,
5261 const lookup_name_info
&lookup_name
,
5262 const struct block
*block
, domain_enum domain
)
5264 int block_depth
= 0;
5266 while (block
!= NULL
)
5269 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5271 /* If we found a non-function match, assume that's the one. */
5272 if (is_nonfunction (defns_collected (obstackp
, 0),
5273 num_defns_collected (obstackp
)))
5276 block
= BLOCK_SUPERBLOCK (block
);
5279 /* If no luck so far, try to find NAME as a local symbol in some lexically
5280 enclosing subprogram. */
5281 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5282 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5285 /* An object of this type is used as the user_data argument when
5286 calling the map_matching_symbols method. */
5290 struct objfile
*objfile
;
5291 struct obstack
*obstackp
;
5292 struct symbol
*arg_sym
;
5296 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5297 to a list of symbols. DATA is a pointer to a struct match_data *
5298 containing the obstack that collects the symbol list, the file that SYM
5299 must come from, a flag indicating whether a non-argument symbol has
5300 been found in the current block, and the last argument symbol
5301 passed in SYM within the current block (if any). When SYM is null,
5302 marking the end of a block, the argument symbol is added if no
5303 other has been found. */
5306 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5307 struct match_data
*data
)
5309 const struct block
*block
= bsym
->block
;
5310 struct symbol
*sym
= bsym
->symbol
;
5314 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5315 add_defn_to_vec (data
->obstackp
,
5316 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5318 data
->found_sym
= 0;
5319 data
->arg_sym
= NULL
;
5323 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5325 else if (SYMBOL_IS_ARGUMENT (sym
))
5326 data
->arg_sym
= sym
;
5329 data
->found_sym
= 1;
5330 add_defn_to_vec (data
->obstackp
,
5331 fixup_symbol_section (sym
, data
->objfile
),
5338 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5339 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5340 symbols to OBSTACKP. Return whether we found such symbols. */
5343 ada_add_block_renamings (struct obstack
*obstackp
,
5344 const struct block
*block
,
5345 const lookup_name_info
&lookup_name
,
5348 struct using_direct
*renaming
;
5349 int defns_mark
= num_defns_collected (obstackp
);
5351 symbol_name_matcher_ftype
*name_match
5352 = ada_get_symbol_name_matcher (lookup_name
);
5354 for (renaming
= block_using (block
);
5356 renaming
= renaming
->next
)
5360 /* Avoid infinite recursions: skip this renaming if we are actually
5361 already traversing it.
5363 Currently, symbol lookup in Ada don't use the namespace machinery from
5364 C++/Fortran support: skip namespace imports that use them. */
5365 if (renaming
->searched
5366 || (renaming
->import_src
!= NULL
5367 && renaming
->import_src
[0] != '\0')
5368 || (renaming
->import_dest
!= NULL
5369 && renaming
->import_dest
[0] != '\0'))
5371 renaming
->searched
= 1;
5373 /* TODO: here, we perform another name-based symbol lookup, which can
5374 pull its own multiple overloads. In theory, we should be able to do
5375 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5376 not a simple name. But in order to do this, we would need to enhance
5377 the DWARF reader to associate a symbol to this renaming, instead of a
5378 name. So, for now, we do something simpler: re-use the C++/Fortran
5379 namespace machinery. */
5380 r_name
= (renaming
->alias
!= NULL
5382 : renaming
->declaration
);
5383 if (name_match (r_name
, lookup_name
, NULL
))
5385 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5386 lookup_name
.match_type ());
5387 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5390 renaming
->searched
= 0;
5392 return num_defns_collected (obstackp
) != defns_mark
;
5395 /* Implements compare_names, but only applying the comparision using
5396 the given CASING. */
5399 compare_names_with_case (const char *string1
, const char *string2
,
5400 enum case_sensitivity casing
)
5402 while (*string1
!= '\0' && *string2
!= '\0')
5406 if (isspace (*string1
) || isspace (*string2
))
5407 return strcmp_iw_ordered (string1
, string2
);
5409 if (casing
== case_sensitive_off
)
5411 c1
= tolower (*string1
);
5412 c2
= tolower (*string2
);
5429 return strcmp_iw_ordered (string1
, string2
);
5431 if (*string2
== '\0')
5433 if (is_name_suffix (string1
))
5440 if (*string2
== '(')
5441 return strcmp_iw_ordered (string1
, string2
);
5444 if (casing
== case_sensitive_off
)
5445 return tolower (*string1
) - tolower (*string2
);
5447 return *string1
- *string2
;
5452 /* Compare STRING1 to STRING2, with results as for strcmp.
5453 Compatible with strcmp_iw_ordered in that...
5455 strcmp_iw_ordered (STRING1, STRING2) <= 0
5459 compare_names (STRING1, STRING2) <= 0
5461 (they may differ as to what symbols compare equal). */
5464 compare_names (const char *string1
, const char *string2
)
5468 /* Similar to what strcmp_iw_ordered does, we need to perform
5469 a case-insensitive comparison first, and only resort to
5470 a second, case-sensitive, comparison if the first one was
5471 not sufficient to differentiate the two strings. */
5473 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5475 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5480 /* Convenience function to get at the Ada encoded lookup name for
5481 LOOKUP_NAME, as a C string. */
5484 ada_lookup_name (const lookup_name_info
&lookup_name
)
5486 return lookup_name
.ada ().lookup_name ().c_str ();
5489 /* Add to OBSTACKP all non-local symbols whose name and domain match
5490 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5491 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5492 symbols otherwise. */
5495 add_nonlocal_symbols (struct obstack
*obstackp
,
5496 const lookup_name_info
&lookup_name
,
5497 domain_enum domain
, int global
)
5499 struct match_data data
;
5501 memset (&data
, 0, sizeof data
);
5502 data
.obstackp
= obstackp
;
5504 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5506 auto callback
= [&] (struct block_symbol
*bsym
)
5508 return aux_add_nonlocal_symbols (bsym
, &data
);
5511 for (objfile
*objfile
: current_program_space
->objfiles ())
5513 data
.objfile
= objfile
;
5515 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5516 domain
, global
, callback
,
5518 ? NULL
: compare_names
));
5520 for (compunit_symtab
*cu
: objfile
->compunits ())
5522 const struct block
*global_block
5523 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5525 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5531 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5533 const char *name
= ada_lookup_name (lookup_name
);
5534 lookup_name_info
name1 (std::string ("<_ada_") + name
+ '>',
5535 symbol_name_match_type::FULL
);
5537 for (objfile
*objfile
: current_program_space
->objfiles ())
5539 data
.objfile
= objfile
;
5540 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5541 domain
, global
, callback
,
5547 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5548 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5549 returning the number of matches. Add these to OBSTACKP.
5551 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5552 symbol match within the nest of blocks whose innermost member is BLOCK,
5553 is the one match returned (no other matches in that or
5554 enclosing blocks is returned). If there are any matches in or
5555 surrounding BLOCK, then these alone are returned.
5557 Names prefixed with "standard__" are handled specially:
5558 "standard__" is first stripped off (by the lookup_name
5559 constructor), and only static and global symbols are searched.
5561 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5562 to lookup global symbols. */
5565 ada_add_all_symbols (struct obstack
*obstackp
,
5566 const struct block
*block
,
5567 const lookup_name_info
&lookup_name
,
5570 int *made_global_lookup_p
)
5574 if (made_global_lookup_p
)
5575 *made_global_lookup_p
= 0;
5577 /* Special case: If the user specifies a symbol name inside package
5578 Standard, do a non-wild matching of the symbol name without
5579 the "standard__" prefix. This was primarily introduced in order
5580 to allow the user to specifically access the standard exceptions
5581 using, for instance, Standard.Constraint_Error when Constraint_Error
5582 is ambiguous (due to the user defining its own Constraint_Error
5583 entity inside its program). */
5584 if (lookup_name
.ada ().standard_p ())
5587 /* Check the non-global symbols. If we have ANY match, then we're done. */
5592 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5595 /* In the !full_search case we're are being called by
5596 ada_iterate_over_symbols, and we don't want to search
5598 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5600 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5604 /* No non-global symbols found. Check our cache to see if we have
5605 already performed this search before. If we have, then return
5608 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5609 domain
, &sym
, &block
))
5612 add_defn_to_vec (obstackp
, sym
, block
);
5616 if (made_global_lookup_p
)
5617 *made_global_lookup_p
= 1;
5619 /* Search symbols from all global blocks. */
5621 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5623 /* Now add symbols from all per-file blocks if we've gotten no hits
5624 (not strictly correct, but perhaps better than an error). */
5626 if (num_defns_collected (obstackp
) == 0)
5627 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5630 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5631 is non-zero, enclosing scope and in global scopes, returning the number of
5633 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5634 found and the blocks and symbol tables (if any) in which they were
5637 When full_search is non-zero, any non-function/non-enumeral
5638 symbol match within the nest of blocks whose innermost member is BLOCK,
5639 is the one match returned (no other matches in that or
5640 enclosing blocks is returned). If there are any matches in or
5641 surrounding BLOCK, then these alone are returned.
5643 Names prefixed with "standard__" are handled specially: "standard__"
5644 is first stripped off, and only static and global symbols are searched. */
5647 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5648 const struct block
*block
,
5650 std::vector
<struct block_symbol
> *results
,
5653 int syms_from_global_search
;
5655 auto_obstack obstack
;
5657 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5658 domain
, full_search
, &syms_from_global_search
);
5660 ndefns
= num_defns_collected (&obstack
);
5662 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5663 for (int i
= 0; i
< ndefns
; ++i
)
5664 results
->push_back (base
[i
]);
5666 ndefns
= remove_extra_symbols (results
);
5668 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5669 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5671 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5672 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5673 (*results
)[0].symbol
, (*results
)[0].block
);
5675 ndefns
= remove_irrelevant_renamings (results
, block
);
5680 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5681 in global scopes, returning the number of matches, and filling *RESULTS
5682 with (SYM,BLOCK) tuples.
5684 See ada_lookup_symbol_list_worker for further details. */
5687 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5689 std::vector
<struct block_symbol
> *results
)
5691 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5692 lookup_name_info
lookup_name (name
, name_match_type
);
5694 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5697 /* Implementation of the la_iterate_over_symbols method. */
5700 ada_iterate_over_symbols
5701 (const struct block
*block
, const lookup_name_info
&name
,
5703 gdb::function_view
<symbol_found_callback_ftype
> callback
)
5706 std::vector
<struct block_symbol
> results
;
5708 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5710 for (i
= 0; i
< ndefs
; ++i
)
5712 if (!callback (&results
[i
]))
5719 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5720 to 1, but choosing the first symbol found if there are multiple
5723 The result is stored in *INFO, which must be non-NULL.
5724 If no match is found, INFO->SYM is set to NULL. */
5727 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5729 struct block_symbol
*info
)
5731 /* Since we already have an encoded name, wrap it in '<>' to force a
5732 verbatim match. Otherwise, if the name happens to not look like
5733 an encoded name (because it doesn't include a "__"),
5734 ada_lookup_name_info would re-encode/fold it again, and that
5735 would e.g., incorrectly lowercase object renaming names like
5736 "R28b" -> "r28b". */
5737 std::string verbatim
= std::string ("<") + name
+ '>';
5739 gdb_assert (info
!= NULL
);
5740 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5743 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5744 scope and in global scopes, or NULL if none. NAME is folded and
5745 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5746 choosing the first symbol if there are multiple choices. */
5749 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5752 std::vector
<struct block_symbol
> candidates
;
5755 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5757 if (n_candidates
== 0)
5760 block_symbol info
= candidates
[0];
5761 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5765 static struct block_symbol
5766 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5768 const struct block
*block
,
5769 const domain_enum domain
)
5771 struct block_symbol sym
;
5773 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
5774 if (sym
.symbol
!= NULL
)
5777 /* If we haven't found a match at this point, try the primitive
5778 types. In other languages, this search is performed before
5779 searching for global symbols in order to short-circuit that
5780 global-symbol search if it happens that the name corresponds
5781 to a primitive type. But we cannot do the same in Ada, because
5782 it is perfectly legitimate for a program to declare a type which
5783 has the same name as a standard type. If looking up a type in
5784 that situation, we have traditionally ignored the primitive type
5785 in favor of user-defined types. This is why, unlike most other
5786 languages, we search the primitive types this late and only after
5787 having searched the global symbols without success. */
5789 if (domain
== VAR_DOMAIN
)
5791 struct gdbarch
*gdbarch
;
5794 gdbarch
= target_gdbarch ();
5796 gdbarch
= block_gdbarch (block
);
5797 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5798 if (sym
.symbol
!= NULL
)
5806 /* True iff STR is a possible encoded suffix of a normal Ada name
5807 that is to be ignored for matching purposes. Suffixes of parallel
5808 names (e.g., XVE) are not included here. Currently, the possible suffixes
5809 are given by any of the regular expressions:
5811 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5812 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5813 TKB [subprogram suffix for task bodies]
5814 _E[0-9]+[bs]$ [protected object entry suffixes]
5815 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5817 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5818 match is performed. This sequence is used to differentiate homonyms,
5819 is an optional part of a valid name suffix. */
5822 is_name_suffix (const char *str
)
5825 const char *matching
;
5826 const int len
= strlen (str
);
5828 /* Skip optional leading __[0-9]+. */
5830 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5833 while (isdigit (str
[0]))
5839 if (str
[0] == '.' || str
[0] == '$')
5842 while (isdigit (matching
[0]))
5844 if (matching
[0] == '\0')
5850 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5853 while (isdigit (matching
[0]))
5855 if (matching
[0] == '\0')
5859 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5861 if (strcmp (str
, "TKB") == 0)
5865 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5866 with a N at the end. Unfortunately, the compiler uses the same
5867 convention for other internal types it creates. So treating
5868 all entity names that end with an "N" as a name suffix causes
5869 some regressions. For instance, consider the case of an enumerated
5870 type. To support the 'Image attribute, it creates an array whose
5872 Having a single character like this as a suffix carrying some
5873 information is a bit risky. Perhaps we should change the encoding
5874 to be something like "_N" instead. In the meantime, do not do
5875 the following check. */
5876 /* Protected Object Subprograms */
5877 if (len
== 1 && str
[0] == 'N')
5882 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5885 while (isdigit (matching
[0]))
5887 if ((matching
[0] == 'b' || matching
[0] == 's')
5888 && matching
[1] == '\0')
5892 /* ??? We should not modify STR directly, as we are doing below. This
5893 is fine in this case, but may become problematic later if we find
5894 that this alternative did not work, and want to try matching
5895 another one from the begining of STR. Since we modified it, we
5896 won't be able to find the begining of the string anymore! */
5900 while (str
[0] != '_' && str
[0] != '\0')
5902 if (str
[0] != 'n' && str
[0] != 'b')
5908 if (str
[0] == '\000')
5913 if (str
[1] != '_' || str
[2] == '\000')
5917 if (strcmp (str
+ 3, "JM") == 0)
5919 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5920 the LJM suffix in favor of the JM one. But we will
5921 still accept LJM as a valid suffix for a reasonable
5922 amount of time, just to allow ourselves to debug programs
5923 compiled using an older version of GNAT. */
5924 if (strcmp (str
+ 3, "LJM") == 0)
5928 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5929 || str
[4] == 'U' || str
[4] == 'P')
5931 if (str
[4] == 'R' && str
[5] != 'T')
5935 if (!isdigit (str
[2]))
5937 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5938 if (!isdigit (str
[k
]) && str
[k
] != '_')
5942 if (str
[0] == '$' && isdigit (str
[1]))
5944 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5945 if (!isdigit (str
[k
]) && str
[k
] != '_')
5952 /* Return non-zero if the string starting at NAME and ending before
5953 NAME_END contains no capital letters. */
5956 is_valid_name_for_wild_match (const char *name0
)
5958 std::string decoded_name
= ada_decode (name0
);
5961 /* If the decoded name starts with an angle bracket, it means that
5962 NAME0 does not follow the GNAT encoding format. It should then
5963 not be allowed as a possible wild match. */
5964 if (decoded_name
[0] == '<')
5967 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5968 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5974 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5975 that could start a simple name. Assumes that *NAMEP points into
5976 the string beginning at NAME0. */
5979 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5981 const char *name
= *namep
;
5991 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5994 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
5999 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6000 || name
[2] == target0
))
6008 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6018 /* Return true iff NAME encodes a name of the form prefix.PATN.
6019 Ignores any informational suffixes of NAME (i.e., for which
6020 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6024 wild_match (const char *name
, const char *patn
)
6027 const char *name0
= name
;
6031 const char *match
= name
;
6035 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6038 if (*p
== '\0' && is_name_suffix (name
))
6039 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6041 if (name
[-1] == '_')
6044 if (!advance_wild_match (&name
, name0
, *patn
))
6049 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6050 any trailing suffixes that encode debugging information or leading
6051 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6052 information that is ignored). */
6055 full_match (const char *sym_name
, const char *search_name
)
6057 size_t search_name_len
= strlen (search_name
);
6059 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6060 && is_name_suffix (sym_name
+ search_name_len
))
6063 if (startswith (sym_name
, "_ada_")
6064 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6065 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6071 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6072 *defn_symbols, updating the list of symbols in OBSTACKP (if
6073 necessary). OBJFILE is the section containing BLOCK. */
6076 ada_add_block_symbols (struct obstack
*obstackp
,
6077 const struct block
*block
,
6078 const lookup_name_info
&lookup_name
,
6079 domain_enum domain
, struct objfile
*objfile
)
6081 struct block_iterator iter
;
6082 /* A matching argument symbol, if any. */
6083 struct symbol
*arg_sym
;
6084 /* Set true when we find a matching non-argument symbol. */
6090 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6092 sym
= block_iter_match_next (lookup_name
, &iter
))
6094 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6095 SYMBOL_DOMAIN (sym
), domain
))
6097 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6099 if (SYMBOL_IS_ARGUMENT (sym
))
6104 add_defn_to_vec (obstackp
,
6105 fixup_symbol_section (sym
, objfile
),
6112 /* Handle renamings. */
6114 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6117 if (!found_sym
&& arg_sym
!= NULL
)
6119 add_defn_to_vec (obstackp
,
6120 fixup_symbol_section (arg_sym
, objfile
),
6124 if (!lookup_name
.ada ().wild_match_p ())
6128 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6129 const char *name
= ada_lookup_name
.c_str ();
6130 size_t name_len
= ada_lookup_name
.size ();
6132 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6134 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6135 SYMBOL_DOMAIN (sym
), domain
))
6139 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
6142 cmp
= !startswith (SYMBOL_LINKAGE_NAME (sym
), "_ada_");
6144 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
6149 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
6151 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6153 if (SYMBOL_IS_ARGUMENT (sym
))
6158 add_defn_to_vec (obstackp
,
6159 fixup_symbol_section (sym
, objfile
),
6167 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6168 They aren't parameters, right? */
6169 if (!found_sym
&& arg_sym
!= NULL
)
6171 add_defn_to_vec (obstackp
,
6172 fixup_symbol_section (arg_sym
, objfile
),
6179 /* Symbol Completion */
6184 ada_lookup_name_info::matches
6185 (const char *sym_name
,
6186 symbol_name_match_type match_type
,
6187 completion_match_result
*comp_match_res
) const
6190 const char *text
= m_encoded_name
.c_str ();
6191 size_t text_len
= m_encoded_name
.size ();
6193 /* First, test against the fully qualified name of the symbol. */
6195 if (strncmp (sym_name
, text
, text_len
) == 0)
6198 std::string decoded_name
= ada_decode (sym_name
);
6199 if (match
&& !m_encoded_p
)
6201 /* One needed check before declaring a positive match is to verify
6202 that iff we are doing a verbatim match, the decoded version
6203 of the symbol name starts with '<'. Otherwise, this symbol name
6204 is not a suitable completion. */
6206 bool has_angle_bracket
= (decoded_name
[0] == '<');
6207 match
= (has_angle_bracket
== m_verbatim_p
);
6210 if (match
&& !m_verbatim_p
)
6212 /* When doing non-verbatim match, another check that needs to
6213 be done is to verify that the potentially matching symbol name
6214 does not include capital letters, because the ada-mode would
6215 not be able to understand these symbol names without the
6216 angle bracket notation. */
6219 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6224 /* Second: Try wild matching... */
6226 if (!match
&& m_wild_match_p
)
6228 /* Since we are doing wild matching, this means that TEXT
6229 may represent an unqualified symbol name. We therefore must
6230 also compare TEXT against the unqualified name of the symbol. */
6231 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6233 if (strncmp (sym_name
, text
, text_len
) == 0)
6237 /* Finally: If we found a match, prepare the result to return. */
6242 if (comp_match_res
!= NULL
)
6244 std::string
&match_str
= comp_match_res
->match
.storage ();
6247 match_str
= ada_decode (sym_name
);
6251 match_str
= add_angle_brackets (sym_name
);
6253 match_str
= sym_name
;
6257 comp_match_res
->set_match (match_str
.c_str ());
6263 /* Add the list of possible symbol names completing TEXT to TRACKER.
6264 WORD is the entire command on which completion is made. */
6267 ada_collect_symbol_completion_matches (completion_tracker
&tracker
,
6268 complete_symbol_mode mode
,
6269 symbol_name_match_type name_match_type
,
6270 const char *text
, const char *word
,
6271 enum type_code code
)
6274 const struct block
*b
, *surrounding_static_block
= 0;
6275 struct block_iterator iter
;
6277 gdb_assert (code
== TYPE_CODE_UNDEF
);
6279 lookup_name_info
lookup_name (text
, name_match_type
, true);
6281 /* First, look at the partial symtab symbols. */
6282 expand_symtabs_matching (NULL
,
6288 /* At this point scan through the misc symbol vectors and add each
6289 symbol you find to the list. Eventually we want to ignore
6290 anything that isn't a text symbol (everything else will be
6291 handled by the psymtab code above). */
6293 for (objfile
*objfile
: current_program_space
->objfiles ())
6295 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
6299 if (completion_skip_symbol (mode
, msymbol
))
6302 language symbol_language
= MSYMBOL_LANGUAGE (msymbol
);
6304 /* Ada minimal symbols won't have their language set to Ada. If
6305 we let completion_list_add_name compare using the
6306 default/C-like matcher, then when completing e.g., symbols in a
6307 package named "pck", we'd match internal Ada symbols like
6308 "pckS", which are invalid in an Ada expression, unless you wrap
6309 them in '<' '>' to request a verbatim match.
6311 Unfortunately, some Ada encoded names successfully demangle as
6312 C++ symbols (using an old mangling scheme), such as "name__2Xn"
6313 -> "Xn::name(void)" and thus some Ada minimal symbols end up
6314 with the wrong language set. Paper over that issue here. */
6315 if (symbol_language
== language_auto
6316 || symbol_language
== language_cplus
)
6317 symbol_language
= language_ada
;
6319 completion_list_add_name (tracker
,
6321 MSYMBOL_LINKAGE_NAME (msymbol
),
6322 lookup_name
, text
, word
);
6326 /* Search upwards from currently selected frame (so that we can
6327 complete on local vars. */
6329 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6331 if (!BLOCK_SUPERBLOCK (b
))
6332 surrounding_static_block
= b
; /* For elmin of dups */
6334 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6336 if (completion_skip_symbol (mode
, sym
))
6339 completion_list_add_name (tracker
,
6340 SYMBOL_LANGUAGE (sym
),
6341 SYMBOL_LINKAGE_NAME (sym
),
6342 lookup_name
, text
, word
);
6346 /* Go through the symtabs and check the externs and statics for
6347 symbols which match. */
6349 for (objfile
*objfile
: current_program_space
->objfiles ())
6351 for (compunit_symtab
*s
: objfile
->compunits ())
6354 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6355 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6357 if (completion_skip_symbol (mode
, sym
))
6360 completion_list_add_name (tracker
,
6361 SYMBOL_LANGUAGE (sym
),
6362 SYMBOL_LINKAGE_NAME (sym
),
6363 lookup_name
, text
, word
);
6368 for (objfile
*objfile
: current_program_space
->objfiles ())
6370 for (compunit_symtab
*s
: objfile
->compunits ())
6373 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6374 /* Don't do this block twice. */
6375 if (b
== surrounding_static_block
)
6377 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6379 if (completion_skip_symbol (mode
, sym
))
6382 completion_list_add_name (tracker
,
6383 SYMBOL_LANGUAGE (sym
),
6384 SYMBOL_LINKAGE_NAME (sym
),
6385 lookup_name
, text
, word
);
6393 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6394 for tagged types. */
6397 ada_is_dispatch_table_ptr_type (struct type
*type
)
6401 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6404 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6408 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6411 /* Return non-zero if TYPE is an interface tag. */
6414 ada_is_interface_tag (struct type
*type
)
6416 const char *name
= TYPE_NAME (type
);
6421 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6424 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6425 to be invisible to users. */
6428 ada_is_ignored_field (struct type
*type
, int field_num
)
6430 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6433 /* Check the name of that field. */
6435 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6437 /* Anonymous field names should not be printed.
6438 brobecker/2007-02-20: I don't think this can actually happen
6439 but we don't want to print the value of anonymous fields anyway. */
6443 /* Normally, fields whose name start with an underscore ("_")
6444 are fields that have been internally generated by the compiler,
6445 and thus should not be printed. The "_parent" field is special,
6446 however: This is a field internally generated by the compiler
6447 for tagged types, and it contains the components inherited from
6448 the parent type. This field should not be printed as is, but
6449 should not be ignored either. */
6450 if (name
[0] == '_' && !startswith (name
, "_parent"))
6454 /* If this is the dispatch table of a tagged type or an interface tag,
6456 if (ada_is_tagged_type (type
, 1)
6457 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6458 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6461 /* Not a special field, so it should not be ignored. */
6465 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6466 pointer or reference type whose ultimate target has a tag field. */
6469 ada_is_tagged_type (struct type
*type
, int refok
)
6471 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6474 /* True iff TYPE represents the type of X'Tag */
6477 ada_is_tag_type (struct type
*type
)
6479 type
= ada_check_typedef (type
);
6481 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6485 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6487 return (name
!= NULL
6488 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6492 /* The type of the tag on VAL. */
6495 ada_tag_type (struct value
*val
)
6497 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6500 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6501 retired at Ada 05). */
6504 is_ada95_tag (struct value
*tag
)
6506 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6509 /* The value of the tag on VAL. */
6512 ada_value_tag (struct value
*val
)
6514 return ada_value_struct_elt (val
, "_tag", 0);
6517 /* The value of the tag on the object of type TYPE whose contents are
6518 saved at VALADDR, if it is non-null, or is at memory address
6521 static struct value
*
6522 value_tag_from_contents_and_address (struct type
*type
,
6523 const gdb_byte
*valaddr
,
6526 int tag_byte_offset
;
6527 struct type
*tag_type
;
6529 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6532 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6534 : valaddr
+ tag_byte_offset
);
6535 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6537 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6542 static struct type
*
6543 type_from_tag (struct value
*tag
)
6545 const char *type_name
= ada_tag_name (tag
);
6547 if (type_name
!= NULL
)
6548 return ada_find_any_type (ada_encode (type_name
));
6552 /* Given a value OBJ of a tagged type, return a value of this
6553 type at the base address of the object. The base address, as
6554 defined in Ada.Tags, it is the address of the primary tag of
6555 the object, and therefore where the field values of its full
6556 view can be fetched. */
6559 ada_tag_value_at_base_address (struct value
*obj
)
6562 LONGEST offset_to_top
= 0;
6563 struct type
*ptr_type
, *obj_type
;
6565 CORE_ADDR base_address
;
6567 obj_type
= value_type (obj
);
6569 /* It is the responsability of the caller to deref pointers. */
6571 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6572 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6575 tag
= ada_value_tag (obj
);
6579 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6581 if (is_ada95_tag (tag
))
6584 ptr_type
= language_lookup_primitive_type
6585 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6586 ptr_type
= lookup_pointer_type (ptr_type
);
6587 val
= value_cast (ptr_type
, tag
);
6591 /* It is perfectly possible that an exception be raised while
6592 trying to determine the base address, just like for the tag;
6593 see ada_tag_name for more details. We do not print the error
6594 message for the same reason. */
6598 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6601 catch (const gdb_exception_error
&e
)
6606 /* If offset is null, nothing to do. */
6608 if (offset_to_top
== 0)
6611 /* -1 is a special case in Ada.Tags; however, what should be done
6612 is not quite clear from the documentation. So do nothing for
6615 if (offset_to_top
== -1)
6618 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6619 from the base address. This was however incompatible with
6620 C++ dispatch table: C++ uses a *negative* value to *add*
6621 to the base address. Ada's convention has therefore been
6622 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6623 use the same convention. Here, we support both cases by
6624 checking the sign of OFFSET_TO_TOP. */
6626 if (offset_to_top
> 0)
6627 offset_to_top
= -offset_to_top
;
6629 base_address
= value_address (obj
) + offset_to_top
;
6630 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6632 /* Make sure that we have a proper tag at the new address.
6633 Otherwise, offset_to_top is bogus (which can happen when
6634 the object is not initialized yet). */
6639 obj_type
= type_from_tag (tag
);
6644 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6647 /* Return the "ada__tags__type_specific_data" type. */
6649 static struct type
*
6650 ada_get_tsd_type (struct inferior
*inf
)
6652 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6654 if (data
->tsd_type
== 0)
6655 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6656 return data
->tsd_type
;
6659 /* Return the TSD (type-specific data) associated to the given TAG.
6660 TAG is assumed to be the tag of a tagged-type entity.
6662 May return NULL if we are unable to get the TSD. */
6664 static struct value
*
6665 ada_get_tsd_from_tag (struct value
*tag
)
6670 /* First option: The TSD is simply stored as a field of our TAG.
6671 Only older versions of GNAT would use this format, but we have
6672 to test it first, because there are no visible markers for
6673 the current approach except the absence of that field. */
6675 val
= ada_value_struct_elt (tag
, "tsd", 1);
6679 /* Try the second representation for the dispatch table (in which
6680 there is no explicit 'tsd' field in the referent of the tag pointer,
6681 and instead the tsd pointer is stored just before the dispatch
6684 type
= ada_get_tsd_type (current_inferior());
6687 type
= lookup_pointer_type (lookup_pointer_type (type
));
6688 val
= value_cast (type
, tag
);
6691 return value_ind (value_ptradd (val
, -1));
6694 /* Given the TSD of a tag (type-specific data), return a string
6695 containing the name of the associated type.
6697 The returned value is good until the next call. May return NULL
6698 if we are unable to determine the tag name. */
6701 ada_tag_name_from_tsd (struct value
*tsd
)
6703 static char name
[1024];
6707 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6710 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6711 for (p
= name
; *p
!= '\0'; p
+= 1)
6717 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6720 Return NULL if the TAG is not an Ada tag, or if we were unable to
6721 determine the name of that tag. The result is good until the next
6725 ada_tag_name (struct value
*tag
)
6729 if (!ada_is_tag_type (value_type (tag
)))
6732 /* It is perfectly possible that an exception be raised while trying
6733 to determine the TAG's name, even under normal circumstances:
6734 The associated variable may be uninitialized or corrupted, for
6735 instance. We do not let any exception propagate past this point.
6736 instead we return NULL.
6738 We also do not print the error message either (which often is very
6739 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6740 the caller print a more meaningful message if necessary. */
6743 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6746 name
= ada_tag_name_from_tsd (tsd
);
6748 catch (const gdb_exception_error
&e
)
6755 /* The parent type of TYPE, or NULL if none. */
6758 ada_parent_type (struct type
*type
)
6762 type
= ada_check_typedef (type
);
6764 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6767 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6768 if (ada_is_parent_field (type
, i
))
6770 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6772 /* If the _parent field is a pointer, then dereference it. */
6773 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6774 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6775 /* If there is a parallel XVS type, get the actual base type. */
6776 parent_type
= ada_get_base_type (parent_type
);
6778 return ada_check_typedef (parent_type
);
6784 /* True iff field number FIELD_NUM of structure type TYPE contains the
6785 parent-type (inherited) fields of a derived type. Assumes TYPE is
6786 a structure type with at least FIELD_NUM+1 fields. */
6789 ada_is_parent_field (struct type
*type
, int field_num
)
6791 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6793 return (name
!= NULL
6794 && (startswith (name
, "PARENT")
6795 || startswith (name
, "_parent")));
6798 /* True iff field number FIELD_NUM of structure type TYPE is a
6799 transparent wrapper field (which should be silently traversed when doing
6800 field selection and flattened when printing). Assumes TYPE is a
6801 structure type with at least FIELD_NUM+1 fields. Such fields are always
6805 ada_is_wrapper_field (struct type
*type
, int field_num
)
6807 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6809 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6811 /* This happens in functions with "out" or "in out" parameters
6812 which are passed by copy. For such functions, GNAT describes
6813 the function's return type as being a struct where the return
6814 value is in a field called RETVAL, and where the other "out"
6815 or "in out" parameters are fields of that struct. This is not
6820 return (name
!= NULL
6821 && (startswith (name
, "PARENT")
6822 || strcmp (name
, "REP") == 0
6823 || startswith (name
, "_parent")
6824 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6827 /* True iff field number FIELD_NUM of structure or union type TYPE
6828 is a variant wrapper. Assumes TYPE is a structure type with at least
6829 FIELD_NUM+1 fields. */
6832 ada_is_variant_part (struct type
*type
, int field_num
)
6834 /* Only Ada types are eligible. */
6835 if (!ADA_TYPE_P (type
))
6838 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6840 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6841 || (is_dynamic_field (type
, field_num
)
6842 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6843 == TYPE_CODE_UNION
)));
6846 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6847 whose discriminants are contained in the record type OUTER_TYPE,
6848 returns the type of the controlling discriminant for the variant.
6849 May return NULL if the type could not be found. */
6852 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6854 const char *name
= ada_variant_discrim_name (var_type
);
6856 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6859 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6860 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6861 represents a 'when others' clause; otherwise 0. */
6864 ada_is_others_clause (struct type
*type
, int field_num
)
6866 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6868 return (name
!= NULL
&& name
[0] == 'O');
6871 /* Assuming that TYPE0 is the type of the variant part of a record,
6872 returns the name of the discriminant controlling the variant.
6873 The value is valid until the next call to ada_variant_discrim_name. */
6876 ada_variant_discrim_name (struct type
*type0
)
6878 static char *result
= NULL
;
6879 static size_t result_len
= 0;
6882 const char *discrim_end
;
6883 const char *discrim_start
;
6885 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6886 type
= TYPE_TARGET_TYPE (type0
);
6890 name
= ada_type_name (type
);
6892 if (name
== NULL
|| name
[0] == '\000')
6895 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6898 if (startswith (discrim_end
, "___XVN"))
6901 if (discrim_end
== name
)
6904 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6907 if (discrim_start
== name
+ 1)
6909 if ((discrim_start
> name
+ 3
6910 && startswith (discrim_start
- 3, "___"))
6911 || discrim_start
[-1] == '.')
6915 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6916 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6917 result
[discrim_end
- discrim_start
] = '\0';
6921 /* Scan STR for a subtype-encoded number, beginning at position K.
6922 Put the position of the character just past the number scanned in
6923 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6924 Return 1 if there was a valid number at the given position, and 0
6925 otherwise. A "subtype-encoded" number consists of the absolute value
6926 in decimal, followed by the letter 'm' to indicate a negative number.
6927 Assumes 0m does not occur. */
6930 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6934 if (!isdigit (str
[k
]))
6937 /* Do it the hard way so as not to make any assumption about
6938 the relationship of unsigned long (%lu scan format code) and
6941 while (isdigit (str
[k
]))
6943 RU
= RU
* 10 + (str
[k
] - '0');
6950 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6956 /* NOTE on the above: Technically, C does not say what the results of
6957 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6958 number representable as a LONGEST (although either would probably work
6959 in most implementations). When RU>0, the locution in the then branch
6960 above is always equivalent to the negative of RU. */
6967 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6968 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6969 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6972 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6974 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6988 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6998 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6999 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7001 if (val
>= L
&& val
<= U
)
7013 /* FIXME: Lots of redundancy below. Try to consolidate. */
7015 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7016 ARG_TYPE, extract and return the value of one of its (non-static)
7017 fields. FIELDNO says which field. Differs from value_primitive_field
7018 only in that it can handle packed values of arbitrary type. */
7020 static struct value
*
7021 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7022 struct type
*arg_type
)
7026 arg_type
= ada_check_typedef (arg_type
);
7027 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
7029 /* Handle packed fields. It might be that the field is not packed
7030 relative to its containing structure, but the structure itself is
7031 packed; in this case we must take the bit-field path. */
7032 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
7034 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7035 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7037 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7038 offset
+ bit_pos
/ 8,
7039 bit_pos
% 8, bit_size
, type
);
7042 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7045 /* Find field with name NAME in object of type TYPE. If found,
7046 set the following for each argument that is non-null:
7047 - *FIELD_TYPE_P to the field's type;
7048 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7049 an object of that type;
7050 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7051 - *BIT_SIZE_P to its size in bits if the field is packed, and
7053 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7054 fields up to but not including the desired field, or by the total
7055 number of fields if not found. A NULL value of NAME never
7056 matches; the function just counts visible fields in this case.
7058 Notice that we need to handle when a tagged record hierarchy
7059 has some components with the same name, like in this scenario:
7061 type Top_T is tagged record
7067 type Middle_T is new Top.Top_T with record
7068 N : Character := 'a';
7072 type Bottom_T is new Middle.Middle_T with record
7074 C : Character := '5';
7076 A : Character := 'J';
7079 Let's say we now have a variable declared and initialized as follow:
7081 TC : Top_A := new Bottom_T;
7083 And then we use this variable to call this function
7085 procedure Assign (Obj: in out Top_T; TV : Integer);
7089 Assign (Top_T (B), 12);
7091 Now, we're in the debugger, and we're inside that procedure
7092 then and we want to print the value of obj.c:
7094 Usually, the tagged record or one of the parent type owns the
7095 component to print and there's no issue but in this particular
7096 case, what does it mean to ask for Obj.C? Since the actual
7097 type for object is type Bottom_T, it could mean two things: type
7098 component C from the Middle_T view, but also component C from
7099 Bottom_T. So in that "undefined" case, when the component is
7100 not found in the non-resolved type (which includes all the
7101 components of the parent type), then resolve it and see if we
7102 get better luck once expanded.
7104 In the case of homonyms in the derived tagged type, we don't
7105 guaranty anything, and pick the one that's easiest for us
7108 Returns 1 if found, 0 otherwise. */
7111 find_struct_field (const char *name
, struct type
*type
, int offset
,
7112 struct type
**field_type_p
,
7113 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7117 int parent_offset
= -1;
7119 type
= ada_check_typedef (type
);
7121 if (field_type_p
!= NULL
)
7122 *field_type_p
= NULL
;
7123 if (byte_offset_p
!= NULL
)
7125 if (bit_offset_p
!= NULL
)
7127 if (bit_size_p
!= NULL
)
7130 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7132 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7133 int fld_offset
= offset
+ bit_pos
/ 8;
7134 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7136 if (t_field_name
== NULL
)
7139 else if (ada_is_parent_field (type
, i
))
7141 /* This is a field pointing us to the parent type of a tagged
7142 type. As hinted in this function's documentation, we give
7143 preference to fields in the current record first, so what
7144 we do here is just record the index of this field before
7145 we skip it. If it turns out we couldn't find our field
7146 in the current record, then we'll get back to it and search
7147 inside it whether the field might exist in the parent. */
7153 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7155 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7157 if (field_type_p
!= NULL
)
7158 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7159 if (byte_offset_p
!= NULL
)
7160 *byte_offset_p
= fld_offset
;
7161 if (bit_offset_p
!= NULL
)
7162 *bit_offset_p
= bit_pos
% 8;
7163 if (bit_size_p
!= NULL
)
7164 *bit_size_p
= bit_size
;
7167 else if (ada_is_wrapper_field (type
, i
))
7169 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7170 field_type_p
, byte_offset_p
, bit_offset_p
,
7171 bit_size_p
, index_p
))
7174 else if (ada_is_variant_part (type
, i
))
7176 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7179 struct type
*field_type
7180 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7182 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7184 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7186 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7187 field_type_p
, byte_offset_p
,
7188 bit_offset_p
, bit_size_p
, index_p
))
7192 else if (index_p
!= NULL
)
7196 /* Field not found so far. If this is a tagged type which
7197 has a parent, try finding that field in the parent now. */
7199 if (parent_offset
!= -1)
7201 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7202 int fld_offset
= offset
+ bit_pos
/ 8;
7204 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, parent_offset
),
7205 fld_offset
, field_type_p
, byte_offset_p
,
7206 bit_offset_p
, bit_size_p
, index_p
))
7213 /* Number of user-visible fields in record type TYPE. */
7216 num_visible_fields (struct type
*type
)
7221 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7225 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7226 and search in it assuming it has (class) type TYPE.
7227 If found, return value, else return NULL.
7229 Searches recursively through wrapper fields (e.g., '_parent').
7231 In the case of homonyms in the tagged types, please refer to the
7232 long explanation in find_struct_field's function documentation. */
7234 static struct value
*
7235 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7239 int parent_offset
= -1;
7241 type
= ada_check_typedef (type
);
7242 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7244 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7246 if (t_field_name
== NULL
)
7249 else if (ada_is_parent_field (type
, i
))
7251 /* This is a field pointing us to the parent type of a tagged
7252 type. As hinted in this function's documentation, we give
7253 preference to fields in the current record first, so what
7254 we do here is just record the index of this field before
7255 we skip it. If it turns out we couldn't find our field
7256 in the current record, then we'll get back to it and search
7257 inside it whether the field might exist in the parent. */
7263 else if (field_name_match (t_field_name
, name
))
7264 return ada_value_primitive_field (arg
, offset
, i
, type
);
7266 else if (ada_is_wrapper_field (type
, i
))
7268 struct value
*v
= /* Do not let indent join lines here. */
7269 ada_search_struct_field (name
, arg
,
7270 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7271 TYPE_FIELD_TYPE (type
, i
));
7277 else if (ada_is_variant_part (type
, i
))
7279 /* PNH: Do we ever get here? See find_struct_field. */
7281 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7283 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7285 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7287 struct value
*v
= ada_search_struct_field
/* Force line
7290 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7291 TYPE_FIELD_TYPE (field_type
, j
));
7299 /* Field not found so far. If this is a tagged type which
7300 has a parent, try finding that field in the parent now. */
7302 if (parent_offset
!= -1)
7304 struct value
*v
= ada_search_struct_field (
7305 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7306 TYPE_FIELD_TYPE (type
, parent_offset
));
7315 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7316 int, struct type
*);
7319 /* Return field #INDEX in ARG, where the index is that returned by
7320 * find_struct_field through its INDEX_P argument. Adjust the address
7321 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7322 * If found, return value, else return NULL. */
7324 static struct value
*
7325 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7328 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7332 /* Auxiliary function for ada_index_struct_field. Like
7333 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7336 static struct value
*
7337 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7341 type
= ada_check_typedef (type
);
7343 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7345 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7347 else if (ada_is_wrapper_field (type
, i
))
7349 struct value
*v
= /* Do not let indent join lines here. */
7350 ada_index_struct_field_1 (index_p
, arg
,
7351 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7352 TYPE_FIELD_TYPE (type
, i
));
7358 else if (ada_is_variant_part (type
, i
))
7360 /* PNH: Do we ever get here? See ada_search_struct_field,
7361 find_struct_field. */
7362 error (_("Cannot assign this kind of variant record"));
7364 else if (*index_p
== 0)
7365 return ada_value_primitive_field (arg
, offset
, i
, type
);
7372 /* Given ARG, a value of type (pointer or reference to a)*
7373 structure/union, extract the component named NAME from the ultimate
7374 target structure/union and return it as a value with its
7377 The routine searches for NAME among all members of the structure itself
7378 and (recursively) among all members of any wrapper members
7381 If NO_ERR, then simply return NULL in case of error, rather than
7385 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
7387 struct type
*t
, *t1
;
7392 t1
= t
= ada_check_typedef (value_type (arg
));
7393 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7395 t1
= TYPE_TARGET_TYPE (t
);
7398 t1
= ada_check_typedef (t1
);
7399 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7401 arg
= coerce_ref (arg
);
7406 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7408 t1
= TYPE_TARGET_TYPE (t
);
7411 t1
= ada_check_typedef (t1
);
7412 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7414 arg
= value_ind (arg
);
7421 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7425 v
= ada_search_struct_field (name
, arg
, 0, t
);
7428 int bit_offset
, bit_size
, byte_offset
;
7429 struct type
*field_type
;
7432 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7433 address
= value_address (ada_value_ind (arg
));
7435 address
= value_address (ada_coerce_ref (arg
));
7437 /* Check to see if this is a tagged type. We also need to handle
7438 the case where the type is a reference to a tagged type, but
7439 we have to be careful to exclude pointers to tagged types.
7440 The latter should be shown as usual (as a pointer), whereas
7441 a reference should mostly be transparent to the user. */
7443 if (ada_is_tagged_type (t1
, 0)
7444 || (TYPE_CODE (t1
) == TYPE_CODE_REF
7445 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
7447 /* We first try to find the searched field in the current type.
7448 If not found then let's look in the fixed type. */
7450 if (!find_struct_field (name
, t1
, 0,
7451 &field_type
, &byte_offset
, &bit_offset
,
7460 /* Convert to fixed type in all cases, so that we have proper
7461 offsets to each field in unconstrained record types. */
7462 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
7463 address
, NULL
, check_tag
);
7465 if (find_struct_field (name
, t1
, 0,
7466 &field_type
, &byte_offset
, &bit_offset
,
7471 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7472 arg
= ada_coerce_ref (arg
);
7474 arg
= ada_value_ind (arg
);
7475 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7476 bit_offset
, bit_size
,
7480 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7484 if (v
!= NULL
|| no_err
)
7487 error (_("There is no member named %s."), name
);
7493 error (_("Attempt to extract a component of "
7494 "a value that is not a record."));
7497 /* Return a string representation of type TYPE. */
7500 type_as_string (struct type
*type
)
7502 string_file tmp_stream
;
7504 type_print (type
, "", &tmp_stream
, -1);
7506 return std::move (tmp_stream
.string ());
7509 /* Given a type TYPE, look up the type of the component of type named NAME.
7510 If DISPP is non-null, add its byte displacement from the beginning of a
7511 structure (pointed to by a value) of type TYPE to *DISPP (does not
7512 work for packed fields).
7514 Matches any field whose name has NAME as a prefix, possibly
7517 TYPE can be either a struct or union. If REFOK, TYPE may also
7518 be a (pointer or reference)+ to a struct or union, and the
7519 ultimate target type will be searched.
7521 Looks recursively into variant clauses and parent types.
7523 In the case of homonyms in the tagged types, please refer to the
7524 long explanation in find_struct_field's function documentation.
7526 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7527 TYPE is not a type of the right kind. */
7529 static struct type
*
7530 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7534 int parent_offset
= -1;
7539 if (refok
&& type
!= NULL
)
7542 type
= ada_check_typedef (type
);
7543 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7544 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7546 type
= TYPE_TARGET_TYPE (type
);
7550 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7551 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7556 error (_("Type %s is not a structure or union type"),
7557 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7560 type
= to_static_fixed_type (type
);
7562 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7564 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7567 if (t_field_name
== NULL
)
7570 else if (ada_is_parent_field (type
, i
))
7572 /* This is a field pointing us to the parent type of a tagged
7573 type. As hinted in this function's documentation, we give
7574 preference to fields in the current record first, so what
7575 we do here is just record the index of this field before
7576 we skip it. If it turns out we couldn't find our field
7577 in the current record, then we'll get back to it and search
7578 inside it whether the field might exist in the parent. */
7584 else if (field_name_match (t_field_name
, name
))
7585 return TYPE_FIELD_TYPE (type
, i
);
7587 else if (ada_is_wrapper_field (type
, i
))
7589 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7595 else if (ada_is_variant_part (type
, i
))
7598 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7601 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7603 /* FIXME pnh 2008/01/26: We check for a field that is
7604 NOT wrapped in a struct, since the compiler sometimes
7605 generates these for unchecked variant types. Revisit
7606 if the compiler changes this practice. */
7607 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7609 if (v_field_name
!= NULL
7610 && field_name_match (v_field_name
, name
))
7611 t
= TYPE_FIELD_TYPE (field_type
, j
);
7613 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7624 /* Field not found so far. If this is a tagged type which
7625 has a parent, try finding that field in the parent now. */
7627 if (parent_offset
!= -1)
7631 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, parent_offset
),
7640 const char *name_str
= name
!= NULL
? name
: _("<null>");
7642 error (_("Type %s has no component named %s"),
7643 type_as_string (type
).c_str (), name_str
);
7649 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7650 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7651 represents an unchecked union (that is, the variant part of a
7652 record that is named in an Unchecked_Union pragma). */
7655 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7657 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7659 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7663 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7664 within a value of type OUTER_TYPE that is stored in GDB at
7665 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7666 numbering from 0) is applicable. Returns -1 if none are. */
7669 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7670 const gdb_byte
*outer_valaddr
)
7674 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7675 struct value
*outer
;
7676 struct value
*discrim
;
7677 LONGEST discrim_val
;
7679 /* Using plain value_from_contents_and_address here causes problems
7680 because we will end up trying to resolve a type that is currently
7681 being constructed. */
7682 outer
= value_from_contents_and_address_unresolved (outer_type
,
7684 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7685 if (discrim
== NULL
)
7687 discrim_val
= value_as_long (discrim
);
7690 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7692 if (ada_is_others_clause (var_type
, i
))
7694 else if (ada_in_variant (discrim_val
, var_type
, i
))
7698 return others_clause
;
7703 /* Dynamic-Sized Records */
7705 /* Strategy: The type ostensibly attached to a value with dynamic size
7706 (i.e., a size that is not statically recorded in the debugging
7707 data) does not accurately reflect the size or layout of the value.
7708 Our strategy is to convert these values to values with accurate,
7709 conventional types that are constructed on the fly. */
7711 /* There is a subtle and tricky problem here. In general, we cannot
7712 determine the size of dynamic records without its data. However,
7713 the 'struct value' data structure, which GDB uses to represent
7714 quantities in the inferior process (the target), requires the size
7715 of the type at the time of its allocation in order to reserve space
7716 for GDB's internal copy of the data. That's why the
7717 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7718 rather than struct value*s.
7720 However, GDB's internal history variables ($1, $2, etc.) are
7721 struct value*s containing internal copies of the data that are not, in
7722 general, the same as the data at their corresponding addresses in
7723 the target. Fortunately, the types we give to these values are all
7724 conventional, fixed-size types (as per the strategy described
7725 above), so that we don't usually have to perform the
7726 'to_fixed_xxx_type' conversions to look at their values.
7727 Unfortunately, there is one exception: if one of the internal
7728 history variables is an array whose elements are unconstrained
7729 records, then we will need to create distinct fixed types for each
7730 element selected. */
7732 /* The upshot of all of this is that many routines take a (type, host
7733 address, target address) triple as arguments to represent a value.
7734 The host address, if non-null, is supposed to contain an internal
7735 copy of the relevant data; otherwise, the program is to consult the
7736 target at the target address. */
7738 /* Assuming that VAL0 represents a pointer value, the result of
7739 dereferencing it. Differs from value_ind in its treatment of
7740 dynamic-sized types. */
7743 ada_value_ind (struct value
*val0
)
7745 struct value
*val
= value_ind (val0
);
7747 if (ada_is_tagged_type (value_type (val
), 0))
7748 val
= ada_tag_value_at_base_address (val
);
7750 return ada_to_fixed_value (val
);
7753 /* The value resulting from dereferencing any "reference to"
7754 qualifiers on VAL0. */
7756 static struct value
*
7757 ada_coerce_ref (struct value
*val0
)
7759 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7761 struct value
*val
= val0
;
7763 val
= coerce_ref (val
);
7765 if (ada_is_tagged_type (value_type (val
), 0))
7766 val
= ada_tag_value_at_base_address (val
);
7768 return ada_to_fixed_value (val
);
7774 /* Return OFF rounded upward if necessary to a multiple of
7775 ALIGNMENT (a power of 2). */
7778 align_value (unsigned int off
, unsigned int alignment
)
7780 return (off
+ alignment
- 1) & ~(alignment
- 1);
7783 /* Return the bit alignment required for field #F of template type TYPE. */
7786 field_alignment (struct type
*type
, int f
)
7788 const char *name
= TYPE_FIELD_NAME (type
, f
);
7792 /* The field name should never be null, unless the debugging information
7793 is somehow malformed. In this case, we assume the field does not
7794 require any alignment. */
7798 len
= strlen (name
);
7800 if (!isdigit (name
[len
- 1]))
7803 if (isdigit (name
[len
- 2]))
7804 align_offset
= len
- 2;
7806 align_offset
= len
- 1;
7808 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7809 return TARGET_CHAR_BIT
;
7811 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7814 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7816 static struct symbol
*
7817 ada_find_any_type_symbol (const char *name
)
7821 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7822 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7825 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7829 /* Find a type named NAME. Ignores ambiguity. This routine will look
7830 solely for types defined by debug info, it will not search the GDB
7833 static struct type
*
7834 ada_find_any_type (const char *name
)
7836 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7839 return SYMBOL_TYPE (sym
);
7844 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7845 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7846 symbol, in which case it is returned. Otherwise, this looks for
7847 symbols whose name is that of NAME_SYM suffixed with "___XR".
7848 Return symbol if found, and NULL otherwise. */
7851 ada_is_renaming_symbol (struct symbol
*name_sym
)
7853 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7854 return strstr (name
, "___XR") != NULL
;
7857 /* Because of GNAT encoding conventions, several GDB symbols may match a
7858 given type name. If the type denoted by TYPE0 is to be preferred to
7859 that of TYPE1 for purposes of type printing, return non-zero;
7860 otherwise return 0. */
7863 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7867 else if (type0
== NULL
)
7869 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7871 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7873 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7875 else if (ada_is_constrained_packed_array_type (type0
))
7877 else if (ada_is_array_descriptor_type (type0
)
7878 && !ada_is_array_descriptor_type (type1
))
7882 const char *type0_name
= TYPE_NAME (type0
);
7883 const char *type1_name
= TYPE_NAME (type1
);
7885 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7886 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7892 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7896 ada_type_name (struct type
*type
)
7900 return TYPE_NAME (type
);
7903 /* Search the list of "descriptive" types associated to TYPE for a type
7904 whose name is NAME. */
7906 static struct type
*
7907 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7909 struct type
*result
, *tmp
;
7911 if (ada_ignore_descriptive_types_p
)
7914 /* If there no descriptive-type info, then there is no parallel type
7916 if (!HAVE_GNAT_AUX_INFO (type
))
7919 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7920 while (result
!= NULL
)
7922 const char *result_name
= ada_type_name (result
);
7924 if (result_name
== NULL
)
7926 warning (_("unexpected null name on descriptive type"));
7930 /* If the names match, stop. */
7931 if (strcmp (result_name
, name
) == 0)
7934 /* Otherwise, look at the next item on the list, if any. */
7935 if (HAVE_GNAT_AUX_INFO (result
))
7936 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7940 /* If not found either, try after having resolved the typedef. */
7945 result
= check_typedef (result
);
7946 if (HAVE_GNAT_AUX_INFO (result
))
7947 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7953 /* If we didn't find a match, see whether this is a packed array. With
7954 older compilers, the descriptive type information is either absent or
7955 irrelevant when it comes to packed arrays so the above lookup fails.
7956 Fall back to using a parallel lookup by name in this case. */
7957 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7958 return ada_find_any_type (name
);
7963 /* Find a parallel type to TYPE with the specified NAME, using the
7964 descriptive type taken from the debugging information, if available,
7965 and otherwise using the (slower) name-based method. */
7967 static struct type
*
7968 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7970 struct type
*result
= NULL
;
7972 if (HAVE_GNAT_AUX_INFO (type
))
7973 result
= find_parallel_type_by_descriptive_type (type
, name
);
7975 result
= ada_find_any_type (name
);
7980 /* Same as above, but specify the name of the parallel type by appending
7981 SUFFIX to the name of TYPE. */
7984 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7987 const char *type_name
= ada_type_name (type
);
7990 if (type_name
== NULL
)
7993 len
= strlen (type_name
);
7995 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7997 strcpy (name
, type_name
);
7998 strcpy (name
+ len
, suffix
);
8000 return ada_find_parallel_type_with_name (type
, name
);
8003 /* If TYPE is a variable-size record type, return the corresponding template
8004 type describing its fields. Otherwise, return NULL. */
8006 static struct type
*
8007 dynamic_template_type (struct type
*type
)
8009 type
= ada_check_typedef (type
);
8011 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
8012 || ada_type_name (type
) == NULL
)
8016 int len
= strlen (ada_type_name (type
));
8018 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
8021 return ada_find_parallel_type (type
, "___XVE");
8025 /* Assuming that TEMPL_TYPE is a union or struct type, returns
8026 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
8029 is_dynamic_field (struct type
*templ_type
, int field_num
)
8031 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
8034 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
8035 && strstr (name
, "___XVL") != NULL
;
8038 /* The index of the variant field of TYPE, or -1 if TYPE does not
8039 represent a variant record type. */
8042 variant_field_index (struct type
*type
)
8046 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
8049 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
8051 if (ada_is_variant_part (type
, f
))
8057 /* A record type with no fields. */
8059 static struct type
*
8060 empty_record (struct type
*templ
)
8062 struct type
*type
= alloc_type_copy (templ
);
8064 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
8065 TYPE_NFIELDS (type
) = 0;
8066 TYPE_FIELDS (type
) = NULL
;
8067 INIT_NONE_SPECIFIC (type
);
8068 TYPE_NAME (type
) = "<empty>";
8069 TYPE_LENGTH (type
) = 0;
8073 /* An ordinary record type (with fixed-length fields) that describes
8074 the value of type TYPE at VALADDR or ADDRESS (see comments at
8075 the beginning of this section) VAL according to GNAT conventions.
8076 DVAL0 should describe the (portion of a) record that contains any
8077 necessary discriminants. It should be NULL if value_type (VAL) is
8078 an outer-level type (i.e., as opposed to a branch of a variant.) A
8079 variant field (unless unchecked) is replaced by a particular branch
8082 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8083 length are not statically known are discarded. As a consequence,
8084 VALADDR, ADDRESS and DVAL0 are ignored.
8086 NOTE: Limitations: For now, we assume that dynamic fields and
8087 variants occupy whole numbers of bytes. However, they need not be
8091 ada_template_to_fixed_record_type_1 (struct type
*type
,
8092 const gdb_byte
*valaddr
,
8093 CORE_ADDR address
, struct value
*dval0
,
8094 int keep_dynamic_fields
)
8096 struct value
*mark
= value_mark ();
8099 int nfields
, bit_len
;
8105 /* Compute the number of fields in this record type that are going
8106 to be processed: unless keep_dynamic_fields, this includes only
8107 fields whose position and length are static will be processed. */
8108 if (keep_dynamic_fields
)
8109 nfields
= TYPE_NFIELDS (type
);
8113 while (nfields
< TYPE_NFIELDS (type
)
8114 && !ada_is_variant_part (type
, nfields
)
8115 && !is_dynamic_field (type
, nfields
))
8119 rtype
= alloc_type_copy (type
);
8120 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8121 INIT_NONE_SPECIFIC (rtype
);
8122 TYPE_NFIELDS (rtype
) = nfields
;
8123 TYPE_FIELDS (rtype
) = (struct field
*)
8124 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8125 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
8126 TYPE_NAME (rtype
) = ada_type_name (type
);
8127 TYPE_FIXED_INSTANCE (rtype
) = 1;
8133 for (f
= 0; f
< nfields
; f
+= 1)
8135 off
= align_value (off
, field_alignment (type
, f
))
8136 + TYPE_FIELD_BITPOS (type
, f
);
8137 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
8138 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8140 if (ada_is_variant_part (type
, f
))
8145 else if (is_dynamic_field (type
, f
))
8147 const gdb_byte
*field_valaddr
= valaddr
;
8148 CORE_ADDR field_address
= address
;
8149 struct type
*field_type
=
8150 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8154 /* rtype's length is computed based on the run-time
8155 value of discriminants. If the discriminants are not
8156 initialized, the type size may be completely bogus and
8157 GDB may fail to allocate a value for it. So check the
8158 size first before creating the value. */
8159 ada_ensure_varsize_limit (rtype
);
8160 /* Using plain value_from_contents_and_address here
8161 causes problems because we will end up trying to
8162 resolve a type that is currently being
8164 dval
= value_from_contents_and_address_unresolved (rtype
,
8167 rtype
= value_type (dval
);
8172 /* If the type referenced by this field is an aligner type, we need
8173 to unwrap that aligner type, because its size might not be set.
8174 Keeping the aligner type would cause us to compute the wrong
8175 size for this field, impacting the offset of the all the fields
8176 that follow this one. */
8177 if (ada_is_aligner_type (field_type
))
8179 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8181 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8182 field_address
= cond_offset_target (field_address
, field_offset
);
8183 field_type
= ada_aligned_type (field_type
);
8186 field_valaddr
= cond_offset_host (field_valaddr
,
8187 off
/ TARGET_CHAR_BIT
);
8188 field_address
= cond_offset_target (field_address
,
8189 off
/ TARGET_CHAR_BIT
);
8191 /* Get the fixed type of the field. Note that, in this case,
8192 we do not want to get the real type out of the tag: if
8193 the current field is the parent part of a tagged record,
8194 we will get the tag of the object. Clearly wrong: the real
8195 type of the parent is not the real type of the child. We
8196 would end up in an infinite loop. */
8197 field_type
= ada_get_base_type (field_type
);
8198 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8199 field_address
, dval
, 0);
8200 /* If the field size is already larger than the maximum
8201 object size, then the record itself will necessarily
8202 be larger than the maximum object size. We need to make
8203 this check now, because the size might be so ridiculously
8204 large (due to an uninitialized variable in the inferior)
8205 that it would cause an overflow when adding it to the
8207 ada_ensure_varsize_limit (field_type
);
8209 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8210 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8211 /* The multiplication can potentially overflow. But because
8212 the field length has been size-checked just above, and
8213 assuming that the maximum size is a reasonable value,
8214 an overflow should not happen in practice. So rather than
8215 adding overflow recovery code to this already complex code,
8216 we just assume that it's not going to happen. */
8218 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8222 /* Note: If this field's type is a typedef, it is important
8223 to preserve the typedef layer.
8225 Otherwise, we might be transforming a typedef to a fat
8226 pointer (encoding a pointer to an unconstrained array),
8227 into a basic fat pointer (encoding an unconstrained
8228 array). As both types are implemented using the same
8229 structure, the typedef is the only clue which allows us
8230 to distinguish between the two options. Stripping it
8231 would prevent us from printing this field appropriately. */
8232 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8233 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8234 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8236 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8239 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8241 /* We need to be careful of typedefs when computing
8242 the length of our field. If this is a typedef,
8243 get the length of the target type, not the length
8245 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8246 field_type
= ada_typedef_target_type (field_type
);
8249 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8252 if (off
+ fld_bit_len
> bit_len
)
8253 bit_len
= off
+ fld_bit_len
;
8255 TYPE_LENGTH (rtype
) =
8256 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8259 /* We handle the variant part, if any, at the end because of certain
8260 odd cases in which it is re-ordered so as NOT to be the last field of
8261 the record. This can happen in the presence of representation
8263 if (variant_field
>= 0)
8265 struct type
*branch_type
;
8267 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8271 /* Using plain value_from_contents_and_address here causes
8272 problems because we will end up trying to resolve a type
8273 that is currently being constructed. */
8274 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8276 rtype
= value_type (dval
);
8282 to_fixed_variant_branch_type
8283 (TYPE_FIELD_TYPE (type
, variant_field
),
8284 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8285 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8286 if (branch_type
== NULL
)
8288 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8289 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8290 TYPE_NFIELDS (rtype
) -= 1;
8294 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8295 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8297 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8299 if (off
+ fld_bit_len
> bit_len
)
8300 bit_len
= off
+ fld_bit_len
;
8301 TYPE_LENGTH (rtype
) =
8302 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8306 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8307 should contain the alignment of that record, which should be a strictly
8308 positive value. If null or negative, then something is wrong, most
8309 probably in the debug info. In that case, we don't round up the size
8310 of the resulting type. If this record is not part of another structure,
8311 the current RTYPE length might be good enough for our purposes. */
8312 if (TYPE_LENGTH (type
) <= 0)
8314 if (TYPE_NAME (rtype
))
8315 warning (_("Invalid type size for `%s' detected: %s."),
8316 TYPE_NAME (rtype
), pulongest (TYPE_LENGTH (type
)));
8318 warning (_("Invalid type size for <unnamed> detected: %s."),
8319 pulongest (TYPE_LENGTH (type
)));
8323 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8324 TYPE_LENGTH (type
));
8327 value_free_to_mark (mark
);
8328 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8329 error (_("record type with dynamic size is larger than varsize-limit"));
8333 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8336 static struct type
*
8337 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8338 CORE_ADDR address
, struct value
*dval0
)
8340 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8344 /* An ordinary record type in which ___XVL-convention fields and
8345 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8346 static approximations, containing all possible fields. Uses
8347 no runtime values. Useless for use in values, but that's OK,
8348 since the results are used only for type determinations. Works on both
8349 structs and unions. Representation note: to save space, we memorize
8350 the result of this function in the TYPE_TARGET_TYPE of the
8353 static struct type
*
8354 template_to_static_fixed_type (struct type
*type0
)
8360 /* No need no do anything if the input type is already fixed. */
8361 if (TYPE_FIXED_INSTANCE (type0
))
8364 /* Likewise if we already have computed the static approximation. */
8365 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8366 return TYPE_TARGET_TYPE (type0
);
8368 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8370 nfields
= TYPE_NFIELDS (type0
);
8372 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8373 recompute all over next time. */
8374 TYPE_TARGET_TYPE (type0
) = type
;
8376 for (f
= 0; f
< nfields
; f
+= 1)
8378 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8379 struct type
*new_type
;
8381 if (is_dynamic_field (type0
, f
))
8383 field_type
= ada_check_typedef (field_type
);
8384 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8387 new_type
= static_unwrap_type (field_type
);
8389 if (new_type
!= field_type
)
8391 /* Clone TYPE0 only the first time we get a new field type. */
8394 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8395 TYPE_CODE (type
) = TYPE_CODE (type0
);
8396 INIT_NONE_SPECIFIC (type
);
8397 TYPE_NFIELDS (type
) = nfields
;
8398 TYPE_FIELDS (type
) = (struct field
*)
8399 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8400 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8401 sizeof (struct field
) * nfields
);
8402 TYPE_NAME (type
) = ada_type_name (type0
);
8403 TYPE_FIXED_INSTANCE (type
) = 1;
8404 TYPE_LENGTH (type
) = 0;
8406 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8407 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8414 /* Given an object of type TYPE whose contents are at VALADDR and
8415 whose address in memory is ADDRESS, returns a revision of TYPE,
8416 which should be a non-dynamic-sized record, in which the variant
8417 part, if any, is replaced with the appropriate branch. Looks
8418 for discriminant values in DVAL0, which can be NULL if the record
8419 contains the necessary discriminant values. */
8421 static struct type
*
8422 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8423 CORE_ADDR address
, struct value
*dval0
)
8425 struct value
*mark
= value_mark ();
8428 struct type
*branch_type
;
8429 int nfields
= TYPE_NFIELDS (type
);
8430 int variant_field
= variant_field_index (type
);
8432 if (variant_field
== -1)
8437 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8438 type
= value_type (dval
);
8443 rtype
= alloc_type_copy (type
);
8444 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8445 INIT_NONE_SPECIFIC (rtype
);
8446 TYPE_NFIELDS (rtype
) = nfields
;
8447 TYPE_FIELDS (rtype
) =
8448 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8449 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8450 sizeof (struct field
) * nfields
);
8451 TYPE_NAME (rtype
) = ada_type_name (type
);
8452 TYPE_FIXED_INSTANCE (rtype
) = 1;
8453 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8455 branch_type
= to_fixed_variant_branch_type
8456 (TYPE_FIELD_TYPE (type
, variant_field
),
8457 cond_offset_host (valaddr
,
8458 TYPE_FIELD_BITPOS (type
, variant_field
)
8460 cond_offset_target (address
,
8461 TYPE_FIELD_BITPOS (type
, variant_field
)
8462 / TARGET_CHAR_BIT
), dval
);
8463 if (branch_type
== NULL
)
8467 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8468 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8469 TYPE_NFIELDS (rtype
) -= 1;
8473 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8474 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8475 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8476 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8478 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8480 value_free_to_mark (mark
);
8484 /* An ordinary record type (with fixed-length fields) that describes
8485 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8486 beginning of this section]. Any necessary discriminants' values
8487 should be in DVAL, a record value; it may be NULL if the object
8488 at ADDR itself contains any necessary discriminant values.
8489 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8490 values from the record are needed. Except in the case that DVAL,
8491 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8492 unchecked) is replaced by a particular branch of the variant.
8494 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8495 is questionable and may be removed. It can arise during the
8496 processing of an unconstrained-array-of-record type where all the
8497 variant branches have exactly the same size. This is because in
8498 such cases, the compiler does not bother to use the XVS convention
8499 when encoding the record. I am currently dubious of this
8500 shortcut and suspect the compiler should be altered. FIXME. */
8502 static struct type
*
8503 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8504 CORE_ADDR address
, struct value
*dval
)
8506 struct type
*templ_type
;
8508 if (TYPE_FIXED_INSTANCE (type0
))
8511 templ_type
= dynamic_template_type (type0
);
8513 if (templ_type
!= NULL
)
8514 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8515 else if (variant_field_index (type0
) >= 0)
8517 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8519 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8524 TYPE_FIXED_INSTANCE (type0
) = 1;
8530 /* An ordinary record type (with fixed-length fields) that describes
8531 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8532 union type. Any necessary discriminants' values should be in DVAL,
8533 a record value. That is, this routine selects the appropriate
8534 branch of the union at ADDR according to the discriminant value
8535 indicated in the union's type name. Returns VAR_TYPE0 itself if
8536 it represents a variant subject to a pragma Unchecked_Union. */
8538 static struct type
*
8539 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8540 CORE_ADDR address
, struct value
*dval
)
8543 struct type
*templ_type
;
8544 struct type
*var_type
;
8546 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8547 var_type
= TYPE_TARGET_TYPE (var_type0
);
8549 var_type
= var_type0
;
8551 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8553 if (templ_type
!= NULL
)
8554 var_type
= templ_type
;
8556 if (is_unchecked_variant (var_type
, value_type (dval
)))
8559 ada_which_variant_applies (var_type
,
8560 value_type (dval
), value_contents (dval
));
8563 return empty_record (var_type
);
8564 else if (is_dynamic_field (var_type
, which
))
8565 return to_fixed_record_type
8566 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8567 valaddr
, address
, dval
);
8568 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8570 to_fixed_record_type
8571 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8573 return TYPE_FIELD_TYPE (var_type
, which
);
8576 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8577 ENCODING_TYPE, a type following the GNAT conventions for discrete
8578 type encodings, only carries redundant information. */
8581 ada_is_redundant_range_encoding (struct type
*range_type
,
8582 struct type
*encoding_type
)
8584 const char *bounds_str
;
8588 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8590 if (TYPE_CODE (get_base_type (range_type
))
8591 != TYPE_CODE (get_base_type (encoding_type
)))
8593 /* The compiler probably used a simple base type to describe
8594 the range type instead of the range's actual base type,
8595 expecting us to get the real base type from the encoding
8596 anyway. In this situation, the encoding cannot be ignored
8601 if (is_dynamic_type (range_type
))
8604 if (TYPE_NAME (encoding_type
) == NULL
)
8607 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8608 if (bounds_str
== NULL
)
8611 n
= 8; /* Skip "___XDLU_". */
8612 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8614 if (TYPE_LOW_BOUND (range_type
) != lo
)
8617 n
+= 2; /* Skip the "__" separator between the two bounds. */
8618 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8620 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8626 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8627 a type following the GNAT encoding for describing array type
8628 indices, only carries redundant information. */
8631 ada_is_redundant_index_type_desc (struct type
*array_type
,
8632 struct type
*desc_type
)
8634 struct type
*this_layer
= check_typedef (array_type
);
8637 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8639 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8640 TYPE_FIELD_TYPE (desc_type
, i
)))
8642 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8648 /* Assuming that TYPE0 is an array type describing the type of a value
8649 at ADDR, and that DVAL describes a record containing any
8650 discriminants used in TYPE0, returns a type for the value that
8651 contains no dynamic components (that is, no components whose sizes
8652 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8653 true, gives an error message if the resulting type's size is over
8656 static struct type
*
8657 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8660 struct type
*index_type_desc
;
8661 struct type
*result
;
8662 int constrained_packed_array_p
;
8663 static const char *xa_suffix
= "___XA";
8665 type0
= ada_check_typedef (type0
);
8666 if (TYPE_FIXED_INSTANCE (type0
))
8669 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8670 if (constrained_packed_array_p
)
8671 type0
= decode_constrained_packed_array_type (type0
);
8673 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8675 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8676 encoding suffixed with 'P' may still be generated. If so,
8677 it should be used to find the XA type. */
8679 if (index_type_desc
== NULL
)
8681 const char *type_name
= ada_type_name (type0
);
8683 if (type_name
!= NULL
)
8685 const int len
= strlen (type_name
);
8686 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8688 if (type_name
[len
- 1] == 'P')
8690 strcpy (name
, type_name
);
8691 strcpy (name
+ len
- 1, xa_suffix
);
8692 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8697 ada_fixup_array_indexes_type (index_type_desc
);
8698 if (index_type_desc
!= NULL
8699 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8701 /* Ignore this ___XA parallel type, as it does not bring any
8702 useful information. This allows us to avoid creating fixed
8703 versions of the array's index types, which would be identical
8704 to the original ones. This, in turn, can also help avoid
8705 the creation of fixed versions of the array itself. */
8706 index_type_desc
= NULL
;
8709 if (index_type_desc
== NULL
)
8711 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8713 /* NOTE: elt_type---the fixed version of elt_type0---should never
8714 depend on the contents of the array in properly constructed
8716 /* Create a fixed version of the array element type.
8717 We're not providing the address of an element here,
8718 and thus the actual object value cannot be inspected to do
8719 the conversion. This should not be a problem, since arrays of
8720 unconstrained objects are not allowed. In particular, all
8721 the elements of an array of a tagged type should all be of
8722 the same type specified in the debugging info. No need to
8723 consult the object tag. */
8724 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8726 /* Make sure we always create a new array type when dealing with
8727 packed array types, since we're going to fix-up the array
8728 type length and element bitsize a little further down. */
8729 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8732 result
= create_array_type (alloc_type_copy (type0
),
8733 elt_type
, TYPE_INDEX_TYPE (type0
));
8738 struct type
*elt_type0
;
8741 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8742 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8744 /* NOTE: result---the fixed version of elt_type0---should never
8745 depend on the contents of the array in properly constructed
8747 /* Create a fixed version of the array element type.
8748 We're not providing the address of an element here,
8749 and thus the actual object value cannot be inspected to do
8750 the conversion. This should not be a problem, since arrays of
8751 unconstrained objects are not allowed. In particular, all
8752 the elements of an array of a tagged type should all be of
8753 the same type specified in the debugging info. No need to
8754 consult the object tag. */
8756 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8759 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8761 struct type
*range_type
=
8762 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8764 result
= create_array_type (alloc_type_copy (elt_type0
),
8765 result
, range_type
);
8766 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8768 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8769 error (_("array type with dynamic size is larger than varsize-limit"));
8772 /* We want to preserve the type name. This can be useful when
8773 trying to get the type name of a value that has already been
8774 printed (for instance, if the user did "print VAR; whatis $". */
8775 TYPE_NAME (result
) = TYPE_NAME (type0
);
8777 if (constrained_packed_array_p
)
8779 /* So far, the resulting type has been created as if the original
8780 type was a regular (non-packed) array type. As a result, the
8781 bitsize of the array elements needs to be set again, and the array
8782 length needs to be recomputed based on that bitsize. */
8783 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8784 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8786 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8787 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8788 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8789 TYPE_LENGTH (result
)++;
8792 TYPE_FIXED_INSTANCE (result
) = 1;
8797 /* A standard type (containing no dynamically sized components)
8798 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8799 DVAL describes a record containing any discriminants used in TYPE0,
8800 and may be NULL if there are none, or if the object of type TYPE at
8801 ADDRESS or in VALADDR contains these discriminants.
8803 If CHECK_TAG is not null, in the case of tagged types, this function
8804 attempts to locate the object's tag and use it to compute the actual
8805 type. However, when ADDRESS is null, we cannot use it to determine the
8806 location of the tag, and therefore compute the tagged type's actual type.
8807 So we return the tagged type without consulting the tag. */
8809 static struct type
*
8810 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8811 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8813 type
= ada_check_typedef (type
);
8815 /* Only un-fixed types need to be handled here. */
8816 if (!HAVE_GNAT_AUX_INFO (type
))
8819 switch (TYPE_CODE (type
))
8823 case TYPE_CODE_STRUCT
:
8825 struct type
*static_type
= to_static_fixed_type (type
);
8826 struct type
*fixed_record_type
=
8827 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8829 /* If STATIC_TYPE is a tagged type and we know the object's address,
8830 then we can determine its tag, and compute the object's actual
8831 type from there. Note that we have to use the fixed record
8832 type (the parent part of the record may have dynamic fields
8833 and the way the location of _tag is expressed may depend on
8836 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8839 value_tag_from_contents_and_address
8843 struct type
*real_type
= type_from_tag (tag
);
8845 value_from_contents_and_address (fixed_record_type
,
8848 fixed_record_type
= value_type (obj
);
8849 if (real_type
!= NULL
)
8850 return to_fixed_record_type
8852 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8855 /* Check to see if there is a parallel ___XVZ variable.
8856 If there is, then it provides the actual size of our type. */
8857 else if (ada_type_name (fixed_record_type
) != NULL
)
8859 const char *name
= ada_type_name (fixed_record_type
);
8861 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8862 bool xvz_found
= false;
8865 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8868 xvz_found
= get_int_var_value (xvz_name
, size
);
8870 catch (const gdb_exception_error
&except
)
8872 /* We found the variable, but somehow failed to read
8873 its value. Rethrow the same error, but with a little
8874 bit more information, to help the user understand
8875 what went wrong (Eg: the variable might have been
8877 throw_error (except
.error
,
8878 _("unable to read value of %s (%s)"),
8879 xvz_name
, except
.what ());
8882 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8884 fixed_record_type
= copy_type (fixed_record_type
);
8885 TYPE_LENGTH (fixed_record_type
) = size
;
8887 /* The FIXED_RECORD_TYPE may have be a stub. We have
8888 observed this when the debugging info is STABS, and
8889 apparently it is something that is hard to fix.
8891 In practice, we don't need the actual type definition
8892 at all, because the presence of the XVZ variable allows us
8893 to assume that there must be a XVS type as well, which we
8894 should be able to use later, when we need the actual type
8897 In the meantime, pretend that the "fixed" type we are
8898 returning is NOT a stub, because this can cause trouble
8899 when using this type to create new types targeting it.
8900 Indeed, the associated creation routines often check
8901 whether the target type is a stub and will try to replace
8902 it, thus using a type with the wrong size. This, in turn,
8903 might cause the new type to have the wrong size too.
8904 Consider the case of an array, for instance, where the size
8905 of the array is computed from the number of elements in
8906 our array multiplied by the size of its element. */
8907 TYPE_STUB (fixed_record_type
) = 0;
8910 return fixed_record_type
;
8912 case TYPE_CODE_ARRAY
:
8913 return to_fixed_array_type (type
, dval
, 1);
8914 case TYPE_CODE_UNION
:
8918 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8922 /* The same as ada_to_fixed_type_1, except that it preserves the type
8923 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8925 The typedef layer needs be preserved in order to differentiate between
8926 arrays and array pointers when both types are implemented using the same
8927 fat pointer. In the array pointer case, the pointer is encoded as
8928 a typedef of the pointer type. For instance, considering:
8930 type String_Access is access String;
8931 S1 : String_Access := null;
8933 To the debugger, S1 is defined as a typedef of type String. But
8934 to the user, it is a pointer. So if the user tries to print S1,
8935 we should not dereference the array, but print the array address
8938 If we didn't preserve the typedef layer, we would lose the fact that
8939 the type is to be presented as a pointer (needs de-reference before
8940 being printed). And we would also use the source-level type name. */
8943 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8944 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8947 struct type
*fixed_type
=
8948 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8950 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8951 then preserve the typedef layer.
8953 Implementation note: We can only check the main-type portion of
8954 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8955 from TYPE now returns a type that has the same instance flags
8956 as TYPE. For instance, if TYPE is a "typedef const", and its
8957 target type is a "struct", then the typedef elimination will return
8958 a "const" version of the target type. See check_typedef for more
8959 details about how the typedef layer elimination is done.
8961 brobecker/2010-11-19: It seems to me that the only case where it is
8962 useful to preserve the typedef layer is when dealing with fat pointers.
8963 Perhaps, we could add a check for that and preserve the typedef layer
8964 only in that situation. But this seems unnecessary so far, probably
8965 because we call check_typedef/ada_check_typedef pretty much everywhere.
8967 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8968 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8969 == TYPE_MAIN_TYPE (fixed_type
)))
8975 /* A standard (static-sized) type corresponding as well as possible to
8976 TYPE0, but based on no runtime data. */
8978 static struct type
*
8979 to_static_fixed_type (struct type
*type0
)
8986 if (TYPE_FIXED_INSTANCE (type0
))
8989 type0
= ada_check_typedef (type0
);
8991 switch (TYPE_CODE (type0
))
8995 case TYPE_CODE_STRUCT
:
8996 type
= dynamic_template_type (type0
);
8998 return template_to_static_fixed_type (type
);
9000 return template_to_static_fixed_type (type0
);
9001 case TYPE_CODE_UNION
:
9002 type
= ada_find_parallel_type (type0
, "___XVU");
9004 return template_to_static_fixed_type (type
);
9006 return template_to_static_fixed_type (type0
);
9010 /* A static approximation of TYPE with all type wrappers removed. */
9012 static struct type
*
9013 static_unwrap_type (struct type
*type
)
9015 if (ada_is_aligner_type (type
))
9017 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
9018 if (ada_type_name (type1
) == NULL
)
9019 TYPE_NAME (type1
) = ada_type_name (type
);
9021 return static_unwrap_type (type1
);
9025 struct type
*raw_real_type
= ada_get_base_type (type
);
9027 if (raw_real_type
== type
)
9030 return to_static_fixed_type (raw_real_type
);
9034 /* In some cases, incomplete and private types require
9035 cross-references that are not resolved as records (for example,
9037 type FooP is access Foo;
9039 type Foo is array ...;
9040 ). In these cases, since there is no mechanism for producing
9041 cross-references to such types, we instead substitute for FooP a
9042 stub enumeration type that is nowhere resolved, and whose tag is
9043 the name of the actual type. Call these types "non-record stubs". */
9045 /* A type equivalent to TYPE that is not a non-record stub, if one
9046 exists, otherwise TYPE. */
9049 ada_check_typedef (struct type
*type
)
9054 /* If our type is an access to an unconstrained array, which is encoded
9055 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
9056 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9057 what allows us to distinguish between fat pointers that represent
9058 array types, and fat pointers that represent array access types
9059 (in both cases, the compiler implements them as fat pointers). */
9060 if (ada_is_access_to_unconstrained_array (type
))
9063 type
= check_typedef (type
);
9064 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
9065 || !TYPE_STUB (type
)
9066 || TYPE_NAME (type
) == NULL
)
9070 const char *name
= TYPE_NAME (type
);
9071 struct type
*type1
= ada_find_any_type (name
);
9076 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9077 stubs pointing to arrays, as we don't create symbols for array
9078 types, only for the typedef-to-array types). If that's the case,
9079 strip the typedef layer. */
9080 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
9081 type1
= ada_check_typedef (type1
);
9087 /* A value representing the data at VALADDR/ADDRESS as described by
9088 type TYPE0, but with a standard (static-sized) type that correctly
9089 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9090 type, then return VAL0 [this feature is simply to avoid redundant
9091 creation of struct values]. */
9093 static struct value
*
9094 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
9097 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
9099 if (type
== type0
&& val0
!= NULL
)
9102 if (VALUE_LVAL (val0
) != lval_memory
)
9104 /* Our value does not live in memory; it could be a convenience
9105 variable, for instance. Create a not_lval value using val0's
9107 return value_from_contents (type
, value_contents (val0
));
9110 return value_from_contents_and_address (type
, 0, address
);
9113 /* A value representing VAL, but with a standard (static-sized) type
9114 that correctly describes it. Does not necessarily create a new
9118 ada_to_fixed_value (struct value
*val
)
9120 val
= unwrap_value (val
);
9121 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
9128 /* Table mapping attribute numbers to names.
9129 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9131 static const char *attribute_names
[] = {
9149 ada_attribute_name (enum exp_opcode n
)
9151 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9152 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9154 return attribute_names
[0];
9157 /* Evaluate the 'POS attribute applied to ARG. */
9160 pos_atr (struct value
*arg
)
9162 struct value
*val
= coerce_ref (arg
);
9163 struct type
*type
= value_type (val
);
9166 if (!discrete_type_p (type
))
9167 error (_("'POS only defined on discrete types"));
9169 if (!discrete_position (type
, value_as_long (val
), &result
))
9170 error (_("enumeration value is invalid: can't find 'POS"));
9175 static struct value
*
9176 value_pos_atr (struct type
*type
, struct value
*arg
)
9178 return value_from_longest (type
, pos_atr (arg
));
9181 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9183 static struct value
*
9184 value_val_atr (struct type
*type
, struct value
*arg
)
9186 if (!discrete_type_p (type
))
9187 error (_("'VAL only defined on discrete types"));
9188 if (!integer_type_p (value_type (arg
)))
9189 error (_("'VAL requires integral argument"));
9191 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
9193 long pos
= value_as_long (arg
);
9195 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
9196 error (_("argument to 'VAL out of range"));
9197 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
9200 return value_from_longest (type
, value_as_long (arg
));
9206 /* True if TYPE appears to be an Ada character type.
9207 [At the moment, this is true only for Character and Wide_Character;
9208 It is a heuristic test that could stand improvement]. */
9211 ada_is_character_type (struct type
*type
)
9215 /* If the type code says it's a character, then assume it really is,
9216 and don't check any further. */
9217 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
9220 /* Otherwise, assume it's a character type iff it is a discrete type
9221 with a known character type name. */
9222 name
= ada_type_name (type
);
9223 return (name
!= NULL
9224 && (TYPE_CODE (type
) == TYPE_CODE_INT
9225 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9226 && (strcmp (name
, "character") == 0
9227 || strcmp (name
, "wide_character") == 0
9228 || strcmp (name
, "wide_wide_character") == 0
9229 || strcmp (name
, "unsigned char") == 0));
9232 /* True if TYPE appears to be an Ada string type. */
9235 ada_is_string_type (struct type
*type
)
9237 type
= ada_check_typedef (type
);
9239 && TYPE_CODE (type
) != TYPE_CODE_PTR
9240 && (ada_is_simple_array_type (type
)
9241 || ada_is_array_descriptor_type (type
))
9242 && ada_array_arity (type
) == 1)
9244 struct type
*elttype
= ada_array_element_type (type
, 1);
9246 return ada_is_character_type (elttype
);
9252 /* The compiler sometimes provides a parallel XVS type for a given
9253 PAD type. Normally, it is safe to follow the PAD type directly,
9254 but older versions of the compiler have a bug that causes the offset
9255 of its "F" field to be wrong. Following that field in that case
9256 would lead to incorrect results, but this can be worked around
9257 by ignoring the PAD type and using the associated XVS type instead.
9259 Set to True if the debugger should trust the contents of PAD types.
9260 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9261 static bool trust_pad_over_xvs
= true;
9263 /* True if TYPE is a struct type introduced by the compiler to force the
9264 alignment of a value. Such types have a single field with a
9265 distinctive name. */
9268 ada_is_aligner_type (struct type
*type
)
9270 type
= ada_check_typedef (type
);
9272 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9275 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9276 && TYPE_NFIELDS (type
) == 1
9277 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9280 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9281 the parallel type. */
9284 ada_get_base_type (struct type
*raw_type
)
9286 struct type
*real_type_namer
;
9287 struct type
*raw_real_type
;
9289 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9292 if (ada_is_aligner_type (raw_type
))
9293 /* The encoding specifies that we should always use the aligner type.
9294 So, even if this aligner type has an associated XVS type, we should
9297 According to the compiler gurus, an XVS type parallel to an aligner
9298 type may exist because of a stabs limitation. In stabs, aligner
9299 types are empty because the field has a variable-sized type, and
9300 thus cannot actually be used as an aligner type. As a result,
9301 we need the associated parallel XVS type to decode the type.
9302 Since the policy in the compiler is to not change the internal
9303 representation based on the debugging info format, we sometimes
9304 end up having a redundant XVS type parallel to the aligner type. */
9307 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9308 if (real_type_namer
== NULL
9309 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9310 || TYPE_NFIELDS (real_type_namer
) != 1)
9313 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9315 /* This is an older encoding form where the base type needs to be
9316 looked up by name. We prefer the newer encoding because it is
9318 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9319 if (raw_real_type
== NULL
)
9322 return raw_real_type
;
9325 /* The field in our XVS type is a reference to the base type. */
9326 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9329 /* The type of value designated by TYPE, with all aligners removed. */
9332 ada_aligned_type (struct type
*type
)
9334 if (ada_is_aligner_type (type
))
9335 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9337 return ada_get_base_type (type
);
9341 /* The address of the aligned value in an object at address VALADDR
9342 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9345 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9347 if (ada_is_aligner_type (type
))
9348 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9350 TYPE_FIELD_BITPOS (type
,
9351 0) / TARGET_CHAR_BIT
);
9358 /* The printed representation of an enumeration literal with encoded
9359 name NAME. The value is good to the next call of ada_enum_name. */
9361 ada_enum_name (const char *name
)
9363 static char *result
;
9364 static size_t result_len
= 0;
9367 /* First, unqualify the enumeration name:
9368 1. Search for the last '.' character. If we find one, then skip
9369 all the preceding characters, the unqualified name starts
9370 right after that dot.
9371 2. Otherwise, we may be debugging on a target where the compiler
9372 translates dots into "__". Search forward for double underscores,
9373 but stop searching when we hit an overloading suffix, which is
9374 of the form "__" followed by digits. */
9376 tmp
= strrchr (name
, '.');
9381 while ((tmp
= strstr (name
, "__")) != NULL
)
9383 if (isdigit (tmp
[2]))
9394 if (name
[1] == 'U' || name
[1] == 'W')
9396 if (sscanf (name
+ 2, "%x", &v
) != 1)
9399 else if (((name
[1] >= '0' && name
[1] <= '9')
9400 || (name
[1] >= 'a' && name
[1] <= 'z'))
9403 GROW_VECT (result
, result_len
, 4);
9404 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9410 GROW_VECT (result
, result_len
, 16);
9411 if (isascii (v
) && isprint (v
))
9412 xsnprintf (result
, result_len
, "'%c'", v
);
9413 else if (name
[1] == 'U')
9414 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9416 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9422 tmp
= strstr (name
, "__");
9424 tmp
= strstr (name
, "$");
9427 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9428 strncpy (result
, name
, tmp
- name
);
9429 result
[tmp
- name
] = '\0';
9437 /* Evaluate the subexpression of EXP starting at *POS as for
9438 evaluate_type, updating *POS to point just past the evaluated
9441 static struct value
*
9442 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9444 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9447 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9450 static struct value
*
9451 unwrap_value (struct value
*val
)
9453 struct type
*type
= ada_check_typedef (value_type (val
));
9455 if (ada_is_aligner_type (type
))
9457 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9458 struct type
*val_type
= ada_check_typedef (value_type (v
));
9460 if (ada_type_name (val_type
) == NULL
)
9461 TYPE_NAME (val_type
) = ada_type_name (type
);
9463 return unwrap_value (v
);
9467 struct type
*raw_real_type
=
9468 ada_check_typedef (ada_get_base_type (type
));
9470 /* If there is no parallel XVS or XVE type, then the value is
9471 already unwrapped. Return it without further modification. */
9472 if ((type
== raw_real_type
)
9473 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9477 coerce_unspec_val_to_type
9478 (val
, ada_to_fixed_type (raw_real_type
, 0,
9479 value_address (val
),
9484 static struct value
*
9485 cast_from_fixed (struct type
*type
, struct value
*arg
)
9487 struct value
*scale
= ada_scaling_factor (value_type (arg
));
9488 arg
= value_cast (value_type (scale
), arg
);
9490 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9491 return value_cast (type
, arg
);
9494 static struct value
*
9495 cast_to_fixed (struct type
*type
, struct value
*arg
)
9497 if (type
== value_type (arg
))
9500 struct value
*scale
= ada_scaling_factor (type
);
9501 if (ada_is_fixed_point_type (value_type (arg
)))
9502 arg
= cast_from_fixed (value_type (scale
), arg
);
9504 arg
= value_cast (value_type (scale
), arg
);
9506 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9507 return value_cast (type
, arg
);
9510 /* Given two array types T1 and T2, return nonzero iff both arrays
9511 contain the same number of elements. */
9514 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9516 LONGEST lo1
, hi1
, lo2
, hi2
;
9518 /* Get the array bounds in order to verify that the size of
9519 the two arrays match. */
9520 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9521 || !get_array_bounds (t2
, &lo2
, &hi2
))
9522 error (_("unable to determine array bounds"));
9524 /* To make things easier for size comparison, normalize a bit
9525 the case of empty arrays by making sure that the difference
9526 between upper bound and lower bound is always -1. */
9532 return (hi1
- lo1
== hi2
- lo2
);
9535 /* Assuming that VAL is an array of integrals, and TYPE represents
9536 an array with the same number of elements, but with wider integral
9537 elements, return an array "casted" to TYPE. In practice, this
9538 means that the returned array is built by casting each element
9539 of the original array into TYPE's (wider) element type. */
9541 static struct value
*
9542 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9544 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9549 /* Verify that both val and type are arrays of scalars, and
9550 that the size of val's elements is smaller than the size
9551 of type's element. */
9552 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9553 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9554 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9555 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9556 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9557 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9559 if (!get_array_bounds (type
, &lo
, &hi
))
9560 error (_("unable to determine array bounds"));
9562 res
= allocate_value (type
);
9564 /* Promote each array element. */
9565 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9567 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9569 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9570 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9576 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9577 return the converted value. */
9579 static struct value
*
9580 coerce_for_assign (struct type
*type
, struct value
*val
)
9582 struct type
*type2
= value_type (val
);
9587 type2
= ada_check_typedef (type2
);
9588 type
= ada_check_typedef (type
);
9590 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9591 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9593 val
= ada_value_ind (val
);
9594 type2
= value_type (val
);
9597 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9598 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9600 if (!ada_same_array_size_p (type
, type2
))
9601 error (_("cannot assign arrays of different length"));
9603 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9604 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9605 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9606 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9608 /* Allow implicit promotion of the array elements to
9610 return ada_promote_array_of_integrals (type
, val
);
9613 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9614 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9615 error (_("Incompatible types in assignment"));
9616 deprecated_set_value_type (val
, type
);
9621 static struct value
*
9622 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9625 struct type
*type1
, *type2
;
9628 arg1
= coerce_ref (arg1
);
9629 arg2
= coerce_ref (arg2
);
9630 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9631 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9633 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9634 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9635 return value_binop (arg1
, arg2
, op
);
9644 return value_binop (arg1
, arg2
, op
);
9647 v2
= value_as_long (arg2
);
9649 error (_("second operand of %s must not be zero."), op_string (op
));
9651 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9652 return value_binop (arg1
, arg2
, op
);
9654 v1
= value_as_long (arg1
);
9659 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9660 v
+= v
> 0 ? -1 : 1;
9668 /* Should not reach this point. */
9672 val
= allocate_value (type1
);
9673 store_unsigned_integer (value_contents_raw (val
),
9674 TYPE_LENGTH (value_type (val
)),
9675 gdbarch_byte_order (get_type_arch (type1
)), v
);
9680 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9682 if (ada_is_direct_array_type (value_type (arg1
))
9683 || ada_is_direct_array_type (value_type (arg2
)))
9685 struct type
*arg1_type
, *arg2_type
;
9687 /* Automatically dereference any array reference before
9688 we attempt to perform the comparison. */
9689 arg1
= ada_coerce_ref (arg1
);
9690 arg2
= ada_coerce_ref (arg2
);
9692 arg1
= ada_coerce_to_simple_array (arg1
);
9693 arg2
= ada_coerce_to_simple_array (arg2
);
9695 arg1_type
= ada_check_typedef (value_type (arg1
));
9696 arg2_type
= ada_check_typedef (value_type (arg2
));
9698 if (TYPE_CODE (arg1_type
) != TYPE_CODE_ARRAY
9699 || TYPE_CODE (arg2_type
) != TYPE_CODE_ARRAY
)
9700 error (_("Attempt to compare array with non-array"));
9701 /* FIXME: The following works only for types whose
9702 representations use all bits (no padding or undefined bits)
9703 and do not have user-defined equality. */
9704 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9705 && memcmp (value_contents (arg1
), value_contents (arg2
),
9706 TYPE_LENGTH (arg1_type
)) == 0);
9708 return value_equal (arg1
, arg2
);
9711 /* Total number of component associations in the aggregate starting at
9712 index PC in EXP. Assumes that index PC is the start of an
9716 num_component_specs (struct expression
*exp
, int pc
)
9720 m
= exp
->elts
[pc
+ 1].longconst
;
9723 for (i
= 0; i
< m
; i
+= 1)
9725 switch (exp
->elts
[pc
].opcode
)
9731 n
+= exp
->elts
[pc
+ 1].longconst
;
9734 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9739 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9740 component of LHS (a simple array or a record), updating *POS past
9741 the expression, assuming that LHS is contained in CONTAINER. Does
9742 not modify the inferior's memory, nor does it modify LHS (unless
9743 LHS == CONTAINER). */
9746 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9747 struct expression
*exp
, int *pos
)
9749 struct value
*mark
= value_mark ();
9751 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9753 if (TYPE_CODE (lhs_type
) == TYPE_CODE_ARRAY
)
9755 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9756 struct value
*index_val
= value_from_longest (index_type
, index
);
9758 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9762 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9763 elt
= ada_to_fixed_value (elt
);
9766 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9767 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9769 value_assign_to_component (container
, elt
,
9770 ada_evaluate_subexp (NULL
, exp
, pos
,
9773 value_free_to_mark (mark
);
9776 /* Assuming that LHS represents an lvalue having a record or array
9777 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9778 of that aggregate's value to LHS, advancing *POS past the
9779 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9780 lvalue containing LHS (possibly LHS itself). Does not modify
9781 the inferior's memory, nor does it modify the contents of
9782 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9784 static struct value
*
9785 assign_aggregate (struct value
*container
,
9786 struct value
*lhs
, struct expression
*exp
,
9787 int *pos
, enum noside noside
)
9789 struct type
*lhs_type
;
9790 int n
= exp
->elts
[*pos
+1].longconst
;
9791 LONGEST low_index
, high_index
;
9794 int max_indices
, num_indices
;
9798 if (noside
!= EVAL_NORMAL
)
9800 for (i
= 0; i
< n
; i
+= 1)
9801 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9805 container
= ada_coerce_ref (container
);
9806 if (ada_is_direct_array_type (value_type (container
)))
9807 container
= ada_coerce_to_simple_array (container
);
9808 lhs
= ada_coerce_ref (lhs
);
9809 if (!deprecated_value_modifiable (lhs
))
9810 error (_("Left operand of assignment is not a modifiable lvalue."));
9812 lhs_type
= check_typedef (value_type (lhs
));
9813 if (ada_is_direct_array_type (lhs_type
))
9815 lhs
= ada_coerce_to_simple_array (lhs
);
9816 lhs_type
= check_typedef (value_type (lhs
));
9817 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9818 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9820 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9823 high_index
= num_visible_fields (lhs_type
) - 1;
9826 error (_("Left-hand side must be array or record."));
9828 num_specs
= num_component_specs (exp
, *pos
- 3);
9829 max_indices
= 4 * num_specs
+ 4;
9830 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9831 indices
[0] = indices
[1] = low_index
- 1;
9832 indices
[2] = indices
[3] = high_index
+ 1;
9835 for (i
= 0; i
< n
; i
+= 1)
9837 switch (exp
->elts
[*pos
].opcode
)
9840 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9841 &num_indices
, max_indices
,
9842 low_index
, high_index
);
9845 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9846 &num_indices
, max_indices
,
9847 low_index
, high_index
);
9851 error (_("Misplaced 'others' clause"));
9852 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9853 num_indices
, low_index
, high_index
);
9856 error (_("Internal error: bad aggregate clause"));
9863 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9864 construct at *POS, updating *POS past the construct, given that
9865 the positions are relative to lower bound LOW, where HIGH is the
9866 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9867 updating *NUM_INDICES as needed. CONTAINER is as for
9868 assign_aggregate. */
9870 aggregate_assign_positional (struct value
*container
,
9871 struct value
*lhs
, struct expression
*exp
,
9872 int *pos
, LONGEST
*indices
, int *num_indices
,
9873 int max_indices
, LONGEST low
, LONGEST high
)
9875 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9877 if (ind
- 1 == high
)
9878 warning (_("Extra components in aggregate ignored."));
9881 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9883 assign_component (container
, lhs
, ind
, exp
, pos
);
9886 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9889 /* Assign into the components of LHS indexed by the OP_CHOICES
9890 construct at *POS, updating *POS past the construct, given that
9891 the allowable indices are LOW..HIGH. Record the indices assigned
9892 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9893 needed. CONTAINER is as for assign_aggregate. */
9895 aggregate_assign_from_choices (struct value
*container
,
9896 struct value
*lhs
, struct expression
*exp
,
9897 int *pos
, LONGEST
*indices
, int *num_indices
,
9898 int max_indices
, LONGEST low
, LONGEST high
)
9901 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9902 int choice_pos
, expr_pc
;
9903 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9905 choice_pos
= *pos
+= 3;
9907 for (j
= 0; j
< n_choices
; j
+= 1)
9908 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9910 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9912 for (j
= 0; j
< n_choices
; j
+= 1)
9914 LONGEST lower
, upper
;
9915 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9917 if (op
== OP_DISCRETE_RANGE
)
9920 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9922 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9927 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9939 name
= &exp
->elts
[choice_pos
+ 2].string
;
9942 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9945 error (_("Invalid record component association."));
9947 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9949 if (! find_struct_field (name
, value_type (lhs
), 0,
9950 NULL
, NULL
, NULL
, NULL
, &ind
))
9951 error (_("Unknown component name: %s."), name
);
9952 lower
= upper
= ind
;
9955 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9956 error (_("Index in component association out of bounds."));
9958 add_component_interval (lower
, upper
, indices
, num_indices
,
9960 while (lower
<= upper
)
9965 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9971 /* Assign the value of the expression in the OP_OTHERS construct in
9972 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9973 have not been previously assigned. The index intervals already assigned
9974 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9975 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9977 aggregate_assign_others (struct value
*container
,
9978 struct value
*lhs
, struct expression
*exp
,
9979 int *pos
, LONGEST
*indices
, int num_indices
,
9980 LONGEST low
, LONGEST high
)
9983 int expr_pc
= *pos
+ 1;
9985 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9989 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9994 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9997 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
10000 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
10001 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
10002 modifying *SIZE as needed. It is an error if *SIZE exceeds
10003 MAX_SIZE. The resulting intervals do not overlap. */
10005 add_component_interval (LONGEST low
, LONGEST high
,
10006 LONGEST
* indices
, int *size
, int max_size
)
10010 for (i
= 0; i
< *size
; i
+= 2) {
10011 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
10015 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
10016 if (high
< indices
[kh
])
10018 if (low
< indices
[i
])
10020 indices
[i
+ 1] = indices
[kh
- 1];
10021 if (high
> indices
[i
+ 1])
10022 indices
[i
+ 1] = high
;
10023 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
10024 *size
-= kh
- i
- 2;
10027 else if (high
< indices
[i
])
10031 if (*size
== max_size
)
10032 error (_("Internal error: miscounted aggregate components."));
10034 for (j
= *size
-1; j
>= i
+2; j
-= 1)
10035 indices
[j
] = indices
[j
- 2];
10037 indices
[i
+ 1] = high
;
10040 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10043 static struct value
*
10044 ada_value_cast (struct type
*type
, struct value
*arg2
)
10046 if (type
== ada_check_typedef (value_type (arg2
)))
10049 if (ada_is_fixed_point_type (type
))
10050 return cast_to_fixed (type
, arg2
);
10052 if (ada_is_fixed_point_type (value_type (arg2
)))
10053 return cast_from_fixed (type
, arg2
);
10055 return value_cast (type
, arg2
);
10058 /* Evaluating Ada expressions, and printing their result.
10059 ------------------------------------------------------
10064 We usually evaluate an Ada expression in order to print its value.
10065 We also evaluate an expression in order to print its type, which
10066 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10067 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10068 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10069 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10072 Evaluating expressions is a little more complicated for Ada entities
10073 than it is for entities in languages such as C. The main reason for
10074 this is that Ada provides types whose definition might be dynamic.
10075 One example of such types is variant records. Or another example
10076 would be an array whose bounds can only be known at run time.
10078 The following description is a general guide as to what should be
10079 done (and what should NOT be done) in order to evaluate an expression
10080 involving such types, and when. This does not cover how the semantic
10081 information is encoded by GNAT as this is covered separatly. For the
10082 document used as the reference for the GNAT encoding, see exp_dbug.ads
10083 in the GNAT sources.
10085 Ideally, we should embed each part of this description next to its
10086 associated code. Unfortunately, the amount of code is so vast right
10087 now that it's hard to see whether the code handling a particular
10088 situation might be duplicated or not. One day, when the code is
10089 cleaned up, this guide might become redundant with the comments
10090 inserted in the code, and we might want to remove it.
10092 2. ``Fixing'' an Entity, the Simple Case:
10093 -----------------------------------------
10095 When evaluating Ada expressions, the tricky issue is that they may
10096 reference entities whose type contents and size are not statically
10097 known. Consider for instance a variant record:
10099 type Rec (Empty : Boolean := True) is record
10102 when False => Value : Integer;
10105 Yes : Rec := (Empty => False, Value => 1);
10106 No : Rec := (empty => True);
10108 The size and contents of that record depends on the value of the
10109 descriminant (Rec.Empty). At this point, neither the debugging
10110 information nor the associated type structure in GDB are able to
10111 express such dynamic types. So what the debugger does is to create
10112 "fixed" versions of the type that applies to the specific object.
10113 We also informally refer to this operation as "fixing" an object,
10114 which means creating its associated fixed type.
10116 Example: when printing the value of variable "Yes" above, its fixed
10117 type would look like this:
10124 On the other hand, if we printed the value of "No", its fixed type
10131 Things become a little more complicated when trying to fix an entity
10132 with a dynamic type that directly contains another dynamic type,
10133 such as an array of variant records, for instance. There are
10134 two possible cases: Arrays, and records.
10136 3. ``Fixing'' Arrays:
10137 ---------------------
10139 The type structure in GDB describes an array in terms of its bounds,
10140 and the type of its elements. By design, all elements in the array
10141 have the same type and we cannot represent an array of variant elements
10142 using the current type structure in GDB. When fixing an array,
10143 we cannot fix the array element, as we would potentially need one
10144 fixed type per element of the array. As a result, the best we can do
10145 when fixing an array is to produce an array whose bounds and size
10146 are correct (allowing us to read it from memory), but without having
10147 touched its element type. Fixing each element will be done later,
10148 when (if) necessary.
10150 Arrays are a little simpler to handle than records, because the same
10151 amount of memory is allocated for each element of the array, even if
10152 the amount of space actually used by each element differs from element
10153 to element. Consider for instance the following array of type Rec:
10155 type Rec_Array is array (1 .. 2) of Rec;
10157 The actual amount of memory occupied by each element might be different
10158 from element to element, depending on the value of their discriminant.
10159 But the amount of space reserved for each element in the array remains
10160 fixed regardless. So we simply need to compute that size using
10161 the debugging information available, from which we can then determine
10162 the array size (we multiply the number of elements of the array by
10163 the size of each element).
10165 The simplest case is when we have an array of a constrained element
10166 type. For instance, consider the following type declarations:
10168 type Bounded_String (Max_Size : Integer) is
10170 Buffer : String (1 .. Max_Size);
10172 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10174 In this case, the compiler describes the array as an array of
10175 variable-size elements (identified by its XVS suffix) for which
10176 the size can be read in the parallel XVZ variable.
10178 In the case of an array of an unconstrained element type, the compiler
10179 wraps the array element inside a private PAD type. This type should not
10180 be shown to the user, and must be "unwrap"'ed before printing. Note
10181 that we also use the adjective "aligner" in our code to designate
10182 these wrapper types.
10184 In some cases, the size allocated for each element is statically
10185 known. In that case, the PAD type already has the correct size,
10186 and the array element should remain unfixed.
10188 But there are cases when this size is not statically known.
10189 For instance, assuming that "Five" is an integer variable:
10191 type Dynamic is array (1 .. Five) of Integer;
10192 type Wrapper (Has_Length : Boolean := False) is record
10195 when True => Length : Integer;
10196 when False => null;
10199 type Wrapper_Array is array (1 .. 2) of Wrapper;
10201 Hello : Wrapper_Array := (others => (Has_Length => True,
10202 Data => (others => 17),
10206 The debugging info would describe variable Hello as being an
10207 array of a PAD type. The size of that PAD type is not statically
10208 known, but can be determined using a parallel XVZ variable.
10209 In that case, a copy of the PAD type with the correct size should
10210 be used for the fixed array.
10212 3. ``Fixing'' record type objects:
10213 ----------------------------------
10215 Things are slightly different from arrays in the case of dynamic
10216 record types. In this case, in order to compute the associated
10217 fixed type, we need to determine the size and offset of each of
10218 its components. This, in turn, requires us to compute the fixed
10219 type of each of these components.
10221 Consider for instance the example:
10223 type Bounded_String (Max_Size : Natural) is record
10224 Str : String (1 .. Max_Size);
10227 My_String : Bounded_String (Max_Size => 10);
10229 In that case, the position of field "Length" depends on the size
10230 of field Str, which itself depends on the value of the Max_Size
10231 discriminant. In order to fix the type of variable My_String,
10232 we need to fix the type of field Str. Therefore, fixing a variant
10233 record requires us to fix each of its components.
10235 However, if a component does not have a dynamic size, the component
10236 should not be fixed. In particular, fields that use a PAD type
10237 should not fixed. Here is an example where this might happen
10238 (assuming type Rec above):
10240 type Container (Big : Boolean) is record
10244 when True => Another : Integer;
10245 when False => null;
10248 My_Container : Container := (Big => False,
10249 First => (Empty => True),
10252 In that example, the compiler creates a PAD type for component First,
10253 whose size is constant, and then positions the component After just
10254 right after it. The offset of component After is therefore constant
10257 The debugger computes the position of each field based on an algorithm
10258 that uses, among other things, the actual position and size of the field
10259 preceding it. Let's now imagine that the user is trying to print
10260 the value of My_Container. If the type fixing was recursive, we would
10261 end up computing the offset of field After based on the size of the
10262 fixed version of field First. And since in our example First has
10263 only one actual field, the size of the fixed type is actually smaller
10264 than the amount of space allocated to that field, and thus we would
10265 compute the wrong offset of field After.
10267 To make things more complicated, we need to watch out for dynamic
10268 components of variant records (identified by the ___XVL suffix in
10269 the component name). Even if the target type is a PAD type, the size
10270 of that type might not be statically known. So the PAD type needs
10271 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10272 we might end up with the wrong size for our component. This can be
10273 observed with the following type declarations:
10275 type Octal is new Integer range 0 .. 7;
10276 type Octal_Array is array (Positive range <>) of Octal;
10277 pragma Pack (Octal_Array);
10279 type Octal_Buffer (Size : Positive) is record
10280 Buffer : Octal_Array (1 .. Size);
10284 In that case, Buffer is a PAD type whose size is unset and needs
10285 to be computed by fixing the unwrapped type.
10287 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10288 ----------------------------------------------------------
10290 Lastly, when should the sub-elements of an entity that remained unfixed
10291 thus far, be actually fixed?
10293 The answer is: Only when referencing that element. For instance
10294 when selecting one component of a record, this specific component
10295 should be fixed at that point in time. Or when printing the value
10296 of a record, each component should be fixed before its value gets
10297 printed. Similarly for arrays, the element of the array should be
10298 fixed when printing each element of the array, or when extracting
10299 one element out of that array. On the other hand, fixing should
10300 not be performed on the elements when taking a slice of an array!
10302 Note that one of the side effects of miscomputing the offset and
10303 size of each field is that we end up also miscomputing the size
10304 of the containing type. This can have adverse results when computing
10305 the value of an entity. GDB fetches the value of an entity based
10306 on the size of its type, and thus a wrong size causes GDB to fetch
10307 the wrong amount of memory. In the case where the computed size is
10308 too small, GDB fetches too little data to print the value of our
10309 entity. Results in this case are unpredictable, as we usually read
10310 past the buffer containing the data =:-o. */
10312 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10313 for that subexpression cast to TO_TYPE. Advance *POS over the
10317 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10318 enum noside noside
, struct type
*to_type
)
10322 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10323 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10328 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10330 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10331 return value_zero (to_type
, not_lval
);
10333 val
= evaluate_var_msym_value (noside
,
10334 exp
->elts
[pc
+ 1].objfile
,
10335 exp
->elts
[pc
+ 2].msymbol
);
10338 val
= evaluate_var_value (noside
,
10339 exp
->elts
[pc
+ 1].block
,
10340 exp
->elts
[pc
+ 2].symbol
);
10342 if (noside
== EVAL_SKIP
)
10343 return eval_skip_value (exp
);
10345 val
= ada_value_cast (to_type
, val
);
10347 /* Follow the Ada language semantics that do not allow taking
10348 an address of the result of a cast (view conversion in Ada). */
10349 if (VALUE_LVAL (val
) == lval_memory
)
10351 if (value_lazy (val
))
10352 value_fetch_lazy (val
);
10353 VALUE_LVAL (val
) = not_lval
;
10358 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10359 if (noside
== EVAL_SKIP
)
10360 return eval_skip_value (exp
);
10361 return ada_value_cast (to_type
, val
);
10364 /* Implement the evaluate_exp routine in the exp_descriptor structure
10365 for the Ada language. */
10367 static struct value
*
10368 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10369 int *pos
, enum noside noside
)
10371 enum exp_opcode op
;
10375 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10378 struct value
**argvec
;
10382 op
= exp
->elts
[pc
].opcode
;
10388 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10390 if (noside
== EVAL_NORMAL
)
10391 arg1
= unwrap_value (arg1
);
10393 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10394 then we need to perform the conversion manually, because
10395 evaluate_subexp_standard doesn't do it. This conversion is
10396 necessary in Ada because the different kinds of float/fixed
10397 types in Ada have different representations.
10399 Similarly, we need to perform the conversion from OP_LONG
10401 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10402 arg1
= ada_value_cast (expect_type
, arg1
);
10408 struct value
*result
;
10411 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10412 /* The result type will have code OP_STRING, bashed there from
10413 OP_ARRAY. Bash it back. */
10414 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10415 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10421 type
= exp
->elts
[pc
+ 1].type
;
10422 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10426 type
= exp
->elts
[pc
+ 1].type
;
10427 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10430 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10431 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10433 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10434 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10436 return ada_value_assign (arg1
, arg1
);
10438 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10439 except if the lhs of our assignment is a convenience variable.
10440 In the case of assigning to a convenience variable, the lhs
10441 should be exactly the result of the evaluation of the rhs. */
10442 type
= value_type (arg1
);
10443 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10445 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10446 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10448 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10452 else if (ada_is_fixed_point_type (value_type (arg1
)))
10453 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10454 else if (ada_is_fixed_point_type (value_type (arg2
)))
10456 (_("Fixed-point values must be assigned to fixed-point variables"));
10458 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10459 return ada_value_assign (arg1
, arg2
);
10462 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10463 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10464 if (noside
== EVAL_SKIP
)
10466 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10467 return (value_from_longest
10468 (value_type (arg1
),
10469 value_as_long (arg1
) + value_as_long (arg2
)));
10470 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10471 return (value_from_longest
10472 (value_type (arg2
),
10473 value_as_long (arg1
) + value_as_long (arg2
)));
10474 if ((ada_is_fixed_point_type (value_type (arg1
))
10475 || ada_is_fixed_point_type (value_type (arg2
)))
10476 && value_type (arg1
) != value_type (arg2
))
10477 error (_("Operands of fixed-point addition must have the same type"));
10478 /* Do the addition, and cast the result to the type of the first
10479 argument. We cannot cast the result to a reference type, so if
10480 ARG1 is a reference type, find its underlying type. */
10481 type
= value_type (arg1
);
10482 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10483 type
= TYPE_TARGET_TYPE (type
);
10484 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10485 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10488 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10489 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10490 if (noside
== EVAL_SKIP
)
10492 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10493 return (value_from_longest
10494 (value_type (arg1
),
10495 value_as_long (arg1
) - value_as_long (arg2
)));
10496 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10497 return (value_from_longest
10498 (value_type (arg2
),
10499 value_as_long (arg1
) - value_as_long (arg2
)));
10500 if ((ada_is_fixed_point_type (value_type (arg1
))
10501 || ada_is_fixed_point_type (value_type (arg2
)))
10502 && value_type (arg1
) != value_type (arg2
))
10503 error (_("Operands of fixed-point subtraction "
10504 "must have the same type"));
10505 /* Do the substraction, and cast the result to the type of the first
10506 argument. We cannot cast the result to a reference type, so if
10507 ARG1 is a reference type, find its underlying type. */
10508 type
= value_type (arg1
);
10509 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10510 type
= TYPE_TARGET_TYPE (type
);
10511 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10512 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10518 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10519 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10520 if (noside
== EVAL_SKIP
)
10522 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10524 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10525 return value_zero (value_type (arg1
), not_lval
);
10529 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10530 if (ada_is_fixed_point_type (value_type (arg1
)))
10531 arg1
= cast_from_fixed (type
, arg1
);
10532 if (ada_is_fixed_point_type (value_type (arg2
)))
10533 arg2
= cast_from_fixed (type
, arg2
);
10534 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10535 return ada_value_binop (arg1
, arg2
, op
);
10539 case BINOP_NOTEQUAL
:
10540 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10541 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10542 if (noside
== EVAL_SKIP
)
10544 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10548 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10549 tem
= ada_value_equal (arg1
, arg2
);
10551 if (op
== BINOP_NOTEQUAL
)
10553 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10554 return value_from_longest (type
, (LONGEST
) tem
);
10557 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10558 if (noside
== EVAL_SKIP
)
10560 else if (ada_is_fixed_point_type (value_type (arg1
)))
10561 return value_cast (value_type (arg1
), value_neg (arg1
));
10564 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10565 return value_neg (arg1
);
10568 case BINOP_LOGICAL_AND
:
10569 case BINOP_LOGICAL_OR
:
10570 case UNOP_LOGICAL_NOT
:
10575 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10576 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10577 return value_cast (type
, val
);
10580 case BINOP_BITWISE_AND
:
10581 case BINOP_BITWISE_IOR
:
10582 case BINOP_BITWISE_XOR
:
10586 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10588 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10590 return value_cast (value_type (arg1
), val
);
10596 if (noside
== EVAL_SKIP
)
10602 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10603 /* Only encountered when an unresolved symbol occurs in a
10604 context other than a function call, in which case, it is
10606 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10607 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10609 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10611 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10612 /* Check to see if this is a tagged type. We also need to handle
10613 the case where the type is a reference to a tagged type, but
10614 we have to be careful to exclude pointers to tagged types.
10615 The latter should be shown as usual (as a pointer), whereas
10616 a reference should mostly be transparent to the user. */
10617 if (ada_is_tagged_type (type
, 0)
10618 || (TYPE_CODE (type
) == TYPE_CODE_REF
10619 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10621 /* Tagged types are a little special in the fact that the real
10622 type is dynamic and can only be determined by inspecting the
10623 object's tag. This means that we need to get the object's
10624 value first (EVAL_NORMAL) and then extract the actual object
10627 Note that we cannot skip the final step where we extract
10628 the object type from its tag, because the EVAL_NORMAL phase
10629 results in dynamic components being resolved into fixed ones.
10630 This can cause problems when trying to print the type
10631 description of tagged types whose parent has a dynamic size:
10632 We use the type name of the "_parent" component in order
10633 to print the name of the ancestor type in the type description.
10634 If that component had a dynamic size, the resolution into
10635 a fixed type would result in the loss of that type name,
10636 thus preventing us from printing the name of the ancestor
10637 type in the type description. */
10638 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10640 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10642 struct type
*actual_type
;
10644 actual_type
= type_from_tag (ada_value_tag (arg1
));
10645 if (actual_type
== NULL
)
10646 /* If, for some reason, we were unable to determine
10647 the actual type from the tag, then use the static
10648 approximation that we just computed as a fallback.
10649 This can happen if the debugging information is
10650 incomplete, for instance. */
10651 actual_type
= type
;
10652 return value_zero (actual_type
, not_lval
);
10656 /* In the case of a ref, ada_coerce_ref takes care
10657 of determining the actual type. But the evaluation
10658 should return a ref as it should be valid to ask
10659 for its address; so rebuild a ref after coerce. */
10660 arg1
= ada_coerce_ref (arg1
);
10661 return value_ref (arg1
, TYPE_CODE_REF
);
10665 /* Records and unions for which GNAT encodings have been
10666 generated need to be statically fixed as well.
10667 Otherwise, non-static fixing produces a type where
10668 all dynamic properties are removed, which prevents "ptype"
10669 from being able to completely describe the type.
10670 For instance, a case statement in a variant record would be
10671 replaced by the relevant components based on the actual
10672 value of the discriminants. */
10673 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10674 && dynamic_template_type (type
) != NULL
)
10675 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10676 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10679 return value_zero (to_static_fixed_type (type
), not_lval
);
10683 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10684 return ada_to_fixed_value (arg1
);
10689 /* Allocate arg vector, including space for the function to be
10690 called in argvec[0] and a terminating NULL. */
10691 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10692 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10694 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10695 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10696 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10697 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10700 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10701 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10704 if (noside
== EVAL_SKIP
)
10708 if (ada_is_constrained_packed_array_type
10709 (desc_base_type (value_type (argvec
[0]))))
10710 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10711 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10712 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10713 /* This is a packed array that has already been fixed, and
10714 therefore already coerced to a simple array. Nothing further
10717 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
)
10719 /* Make sure we dereference references so that all the code below
10720 feels like it's really handling the referenced value. Wrapping
10721 types (for alignment) may be there, so make sure we strip them as
10723 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10725 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10726 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10727 argvec
[0] = value_addr (argvec
[0]);
10729 type
= ada_check_typedef (value_type (argvec
[0]));
10731 /* Ada allows us to implicitly dereference arrays when subscripting
10732 them. So, if this is an array typedef (encoding use for array
10733 access types encoded as fat pointers), strip it now. */
10734 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10735 type
= ada_typedef_target_type (type
);
10737 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10739 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10741 case TYPE_CODE_FUNC
:
10742 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10744 case TYPE_CODE_ARRAY
:
10746 case TYPE_CODE_STRUCT
:
10747 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10748 argvec
[0] = ada_value_ind (argvec
[0]);
10749 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10752 error (_("cannot subscript or call something of type `%s'"),
10753 ada_type_name (value_type (argvec
[0])));
10758 switch (TYPE_CODE (type
))
10760 case TYPE_CODE_FUNC
:
10761 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10763 if (TYPE_TARGET_TYPE (type
) == NULL
)
10764 error_call_unknown_return_type (NULL
);
10765 return allocate_value (TYPE_TARGET_TYPE (type
));
10767 return call_function_by_hand (argvec
[0], NULL
,
10768 gdb::make_array_view (argvec
+ 1,
10770 case TYPE_CODE_INTERNAL_FUNCTION
:
10771 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10772 /* We don't know anything about what the internal
10773 function might return, but we have to return
10775 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10778 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10779 argvec
[0], nargs
, argvec
+ 1);
10781 case TYPE_CODE_STRUCT
:
10785 arity
= ada_array_arity (type
);
10786 type
= ada_array_element_type (type
, nargs
);
10788 error (_("cannot subscript or call a record"));
10789 if (arity
!= nargs
)
10790 error (_("wrong number of subscripts; expecting %d"), arity
);
10791 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10792 return value_zero (ada_aligned_type (type
), lval_memory
);
10794 unwrap_value (ada_value_subscript
10795 (argvec
[0], nargs
, argvec
+ 1));
10797 case TYPE_CODE_ARRAY
:
10798 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10800 type
= ada_array_element_type (type
, nargs
);
10802 error (_("element type of array unknown"));
10804 return value_zero (ada_aligned_type (type
), lval_memory
);
10807 unwrap_value (ada_value_subscript
10808 (ada_coerce_to_simple_array (argvec
[0]),
10809 nargs
, argvec
+ 1));
10810 case TYPE_CODE_PTR
: /* Pointer to array */
10811 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10813 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10814 type
= ada_array_element_type (type
, nargs
);
10816 error (_("element type of array unknown"));
10818 return value_zero (ada_aligned_type (type
), lval_memory
);
10821 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10822 nargs
, argvec
+ 1));
10825 error (_("Attempt to index or call something other than an "
10826 "array or function"));
10831 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10832 struct value
*low_bound_val
=
10833 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10834 struct value
*high_bound_val
=
10835 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10837 LONGEST high_bound
;
10839 low_bound_val
= coerce_ref (low_bound_val
);
10840 high_bound_val
= coerce_ref (high_bound_val
);
10841 low_bound
= value_as_long (low_bound_val
);
10842 high_bound
= value_as_long (high_bound_val
);
10844 if (noside
== EVAL_SKIP
)
10847 /* If this is a reference to an aligner type, then remove all
10849 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10850 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10851 TYPE_TARGET_TYPE (value_type (array
)) =
10852 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10854 if (ada_is_constrained_packed_array_type (value_type (array
)))
10855 error (_("cannot slice a packed array"));
10857 /* If this is a reference to an array or an array lvalue,
10858 convert to a pointer. */
10859 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10860 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10861 && VALUE_LVAL (array
) == lval_memory
))
10862 array
= value_addr (array
);
10864 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10865 && ada_is_array_descriptor_type (ada_check_typedef
10866 (value_type (array
))))
10867 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10870 array
= ada_coerce_to_simple_array_ptr (array
);
10872 /* If we have more than one level of pointer indirection,
10873 dereference the value until we get only one level. */
10874 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10875 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10877 array
= value_ind (array
);
10879 /* Make sure we really do have an array type before going further,
10880 to avoid a SEGV when trying to get the index type or the target
10881 type later down the road if the debug info generated by
10882 the compiler is incorrect or incomplete. */
10883 if (!ada_is_simple_array_type (value_type (array
)))
10884 error (_("cannot take slice of non-array"));
10886 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10889 struct type
*type0
= ada_check_typedef (value_type (array
));
10891 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10892 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10895 struct type
*arr_type0
=
10896 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10898 return ada_value_slice_from_ptr (array
, arr_type0
,
10899 longest_to_int (low_bound
),
10900 longest_to_int (high_bound
));
10903 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10905 else if (high_bound
< low_bound
)
10906 return empty_array (value_type (array
), low_bound
, high_bound
);
10908 return ada_value_slice (array
, longest_to_int (low_bound
),
10909 longest_to_int (high_bound
));
10912 case UNOP_IN_RANGE
:
10914 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10915 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10917 if (noside
== EVAL_SKIP
)
10920 switch (TYPE_CODE (type
))
10923 lim_warning (_("Membership test incompletely implemented; "
10924 "always returns true"));
10925 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10926 return value_from_longest (type
, (LONGEST
) 1);
10928 case TYPE_CODE_RANGE
:
10929 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10930 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10931 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10932 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10933 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10935 value_from_longest (type
,
10936 (value_less (arg1
, arg3
)
10937 || value_equal (arg1
, arg3
))
10938 && (value_less (arg2
, arg1
)
10939 || value_equal (arg2
, arg1
)));
10942 case BINOP_IN_BOUNDS
:
10944 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10945 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10947 if (noside
== EVAL_SKIP
)
10950 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10952 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10953 return value_zero (type
, not_lval
);
10956 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10958 type
= ada_index_type (value_type (arg2
), tem
, "range");
10960 type
= value_type (arg1
);
10962 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10963 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10965 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10966 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10967 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10969 value_from_longest (type
,
10970 (value_less (arg1
, arg3
)
10971 || value_equal (arg1
, arg3
))
10972 && (value_less (arg2
, arg1
)
10973 || value_equal (arg2
, arg1
)));
10975 case TERNOP_IN_RANGE
:
10976 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10977 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10978 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10980 if (noside
== EVAL_SKIP
)
10983 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10984 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10985 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10987 value_from_longest (type
,
10988 (value_less (arg1
, arg3
)
10989 || value_equal (arg1
, arg3
))
10990 && (value_less (arg2
, arg1
)
10991 || value_equal (arg2
, arg1
)));
10995 case OP_ATR_LENGTH
:
10997 struct type
*type_arg
;
10999 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
11001 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11003 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11007 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11011 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
11012 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
11013 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
11016 if (noside
== EVAL_SKIP
)
11018 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11020 if (type_arg
== NULL
)
11021 type_arg
= value_type (arg1
);
11023 if (ada_is_constrained_packed_array_type (type_arg
))
11024 type_arg
= decode_constrained_packed_array_type (type_arg
);
11026 if (!discrete_type_p (type_arg
))
11030 default: /* Should never happen. */
11031 error (_("unexpected attribute encountered"));
11034 type_arg
= ada_index_type (type_arg
, tem
,
11035 ada_attribute_name (op
));
11037 case OP_ATR_LENGTH
:
11038 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
11043 return value_zero (type_arg
, not_lval
);
11045 else if (type_arg
== NULL
)
11047 arg1
= ada_coerce_ref (arg1
);
11049 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
11050 arg1
= ada_coerce_to_simple_array (arg1
);
11052 if (op
== OP_ATR_LENGTH
)
11053 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11056 type
= ada_index_type (value_type (arg1
), tem
,
11057 ada_attribute_name (op
));
11059 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11064 default: /* Should never happen. */
11065 error (_("unexpected attribute encountered"));
11067 return value_from_longest
11068 (type
, ada_array_bound (arg1
, tem
, 0));
11070 return value_from_longest
11071 (type
, ada_array_bound (arg1
, tem
, 1));
11072 case OP_ATR_LENGTH
:
11073 return value_from_longest
11074 (type
, ada_array_length (arg1
, tem
));
11077 else if (discrete_type_p (type_arg
))
11079 struct type
*range_type
;
11080 const char *name
= ada_type_name (type_arg
);
11083 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
11084 range_type
= to_fixed_range_type (type_arg
, NULL
);
11085 if (range_type
== NULL
)
11086 range_type
= type_arg
;
11090 error (_("unexpected attribute encountered"));
11092 return value_from_longest
11093 (range_type
, ada_discrete_type_low_bound (range_type
));
11095 return value_from_longest
11096 (range_type
, ada_discrete_type_high_bound (range_type
));
11097 case OP_ATR_LENGTH
:
11098 error (_("the 'length attribute applies only to array types"));
11101 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
11102 error (_("unimplemented type attribute"));
11107 if (ada_is_constrained_packed_array_type (type_arg
))
11108 type_arg
= decode_constrained_packed_array_type (type_arg
);
11110 if (op
== OP_ATR_LENGTH
)
11111 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11114 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11116 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11122 error (_("unexpected attribute encountered"));
11124 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11125 return value_from_longest (type
, low
);
11127 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11128 return value_from_longest (type
, high
);
11129 case OP_ATR_LENGTH
:
11130 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11131 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11132 return value_from_longest (type
, high
- low
+ 1);
11138 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11139 if (noside
== EVAL_SKIP
)
11142 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11143 return value_zero (ada_tag_type (arg1
), not_lval
);
11145 return ada_value_tag (arg1
);
11149 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11150 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11151 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11152 if (noside
== EVAL_SKIP
)
11154 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11155 return value_zero (value_type (arg1
), not_lval
);
11158 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11159 return value_binop (arg1
, arg2
,
11160 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11163 case OP_ATR_MODULUS
:
11165 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11167 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11168 if (noside
== EVAL_SKIP
)
11171 if (!ada_is_modular_type (type_arg
))
11172 error (_("'modulus must be applied to modular type"));
11174 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11175 ada_modulus (type_arg
));
11180 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11181 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11182 if (noside
== EVAL_SKIP
)
11184 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11185 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11186 return value_zero (type
, not_lval
);
11188 return value_pos_atr (type
, arg1
);
11191 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11192 type
= value_type (arg1
);
11194 /* If the argument is a reference, then dereference its type, since
11195 the user is really asking for the size of the actual object,
11196 not the size of the pointer. */
11197 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
11198 type
= TYPE_TARGET_TYPE (type
);
11200 if (noside
== EVAL_SKIP
)
11202 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11203 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11205 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11206 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11209 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11210 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11211 type
= exp
->elts
[pc
+ 2].type
;
11212 if (noside
== EVAL_SKIP
)
11214 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11215 return value_zero (type
, not_lval
);
11217 return value_val_atr (type
, arg1
);
11220 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11221 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11222 if (noside
== EVAL_SKIP
)
11224 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11225 return value_zero (value_type (arg1
), not_lval
);
11228 /* For integer exponentiation operations,
11229 only promote the first argument. */
11230 if (is_integral_type (value_type (arg2
)))
11231 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11233 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11235 return value_binop (arg1
, arg2
, op
);
11239 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11240 if (noside
== EVAL_SKIP
)
11246 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11247 if (noside
== EVAL_SKIP
)
11249 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11250 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11251 return value_neg (arg1
);
11256 preeval_pos
= *pos
;
11257 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11258 if (noside
== EVAL_SKIP
)
11260 type
= ada_check_typedef (value_type (arg1
));
11261 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11263 if (ada_is_array_descriptor_type (type
))
11264 /* GDB allows dereferencing GNAT array descriptors. */
11266 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11268 if (arrType
== NULL
)
11269 error (_("Attempt to dereference null array pointer."));
11270 return value_at_lazy (arrType
, 0);
11272 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
11273 || TYPE_CODE (type
) == TYPE_CODE_REF
11274 /* In C you can dereference an array to get the 1st elt. */
11275 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
11277 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11278 only be determined by inspecting the object's tag.
11279 This means that we need to evaluate completely the
11280 expression in order to get its type. */
11282 if ((TYPE_CODE (type
) == TYPE_CODE_REF
11283 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
11284 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11286 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11288 type
= value_type (ada_value_ind (arg1
));
11292 type
= to_static_fixed_type
11294 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11296 ada_ensure_varsize_limit (type
);
11297 return value_zero (type
, lval_memory
);
11299 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11301 /* GDB allows dereferencing an int. */
11302 if (expect_type
== NULL
)
11303 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11308 to_static_fixed_type (ada_aligned_type (expect_type
));
11309 return value_zero (expect_type
, lval_memory
);
11313 error (_("Attempt to take contents of a non-pointer value."));
11315 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11316 type
= ada_check_typedef (value_type (arg1
));
11318 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11319 /* GDB allows dereferencing an int. If we were given
11320 the expect_type, then use that as the target type.
11321 Otherwise, assume that the target type is an int. */
11323 if (expect_type
!= NULL
)
11324 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11327 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11328 (CORE_ADDR
) value_as_address (arg1
));
11331 if (ada_is_array_descriptor_type (type
))
11332 /* GDB allows dereferencing GNAT array descriptors. */
11333 return ada_coerce_to_simple_array (arg1
);
11335 return ada_value_ind (arg1
);
11337 case STRUCTOP_STRUCT
:
11338 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11339 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11340 preeval_pos
= *pos
;
11341 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11342 if (noside
== EVAL_SKIP
)
11344 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11346 struct type
*type1
= value_type (arg1
);
11348 if (ada_is_tagged_type (type1
, 1))
11350 type
= ada_lookup_struct_elt_type (type1
,
11351 &exp
->elts
[pc
+ 2].string
,
11354 /* If the field is not found, check if it exists in the
11355 extension of this object's type. This means that we
11356 need to evaluate completely the expression. */
11360 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11362 arg1
= ada_value_struct_elt (arg1
,
11363 &exp
->elts
[pc
+ 2].string
,
11365 arg1
= unwrap_value (arg1
);
11366 type
= value_type (ada_to_fixed_value (arg1
));
11371 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11374 return value_zero (ada_aligned_type (type
), lval_memory
);
11378 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11379 arg1
= unwrap_value (arg1
);
11380 return ada_to_fixed_value (arg1
);
11384 /* The value is not supposed to be used. This is here to make it
11385 easier to accommodate expressions that contain types. */
11387 if (noside
== EVAL_SKIP
)
11389 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11390 return allocate_value (exp
->elts
[pc
+ 1].type
);
11392 error (_("Attempt to use a type name as an expression"));
11397 case OP_DISCRETE_RANGE
:
11398 case OP_POSITIONAL
:
11400 if (noside
== EVAL_NORMAL
)
11404 error (_("Undefined name, ambiguous name, or renaming used in "
11405 "component association: %s."), &exp
->elts
[pc
+2].string
);
11407 error (_("Aggregates only allowed on the right of an assignment"));
11409 internal_error (__FILE__
, __LINE__
,
11410 _("aggregate apparently mangled"));
11413 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11415 for (tem
= 0; tem
< nargs
; tem
+= 1)
11416 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11421 return eval_skip_value (exp
);
11427 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11428 type name that encodes the 'small and 'delta information.
11429 Otherwise, return NULL. */
11431 static const char *
11432 fixed_type_info (struct type
*type
)
11434 const char *name
= ada_type_name (type
);
11435 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11437 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11439 const char *tail
= strstr (name
, "___XF_");
11446 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11447 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11452 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11455 ada_is_fixed_point_type (struct type
*type
)
11457 return fixed_type_info (type
) != NULL
;
11460 /* Return non-zero iff TYPE represents a System.Address type. */
11463 ada_is_system_address_type (struct type
*type
)
11465 return (TYPE_NAME (type
)
11466 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11469 /* Assuming that TYPE is the representation of an Ada fixed-point
11470 type, return the target floating-point type to be used to represent
11471 of this type during internal computation. */
11473 static struct type
*
11474 ada_scaling_type (struct type
*type
)
11476 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11479 /* Assuming that TYPE is the representation of an Ada fixed-point
11480 type, return its delta, or NULL if the type is malformed and the
11481 delta cannot be determined. */
11484 ada_delta (struct type
*type
)
11486 const char *encoding
= fixed_type_info (type
);
11487 struct type
*scale_type
= ada_scaling_type (type
);
11489 long long num
, den
;
11491 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11494 return value_binop (value_from_longest (scale_type
, num
),
11495 value_from_longest (scale_type
, den
), BINOP_DIV
);
11498 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11499 factor ('SMALL value) associated with the type. */
11502 ada_scaling_factor (struct type
*type
)
11504 const char *encoding
= fixed_type_info (type
);
11505 struct type
*scale_type
= ada_scaling_type (type
);
11507 long long num0
, den0
, num1
, den1
;
11510 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11511 &num0
, &den0
, &num1
, &den1
);
11514 return value_from_longest (scale_type
, 1);
11516 return value_binop (value_from_longest (scale_type
, num1
),
11517 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11519 return value_binop (value_from_longest (scale_type
, num0
),
11520 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11527 /* Scan STR beginning at position K for a discriminant name, and
11528 return the value of that discriminant field of DVAL in *PX. If
11529 PNEW_K is not null, put the position of the character beyond the
11530 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11531 not alter *PX and *PNEW_K if unsuccessful. */
11534 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11537 static char *bound_buffer
= NULL
;
11538 static size_t bound_buffer_len
= 0;
11539 const char *pstart
, *pend
, *bound
;
11540 struct value
*bound_val
;
11542 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11546 pend
= strstr (pstart
, "__");
11550 k
+= strlen (bound
);
11554 int len
= pend
- pstart
;
11556 /* Strip __ and beyond. */
11557 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11558 strncpy (bound_buffer
, pstart
, len
);
11559 bound_buffer
[len
] = '\0';
11561 bound
= bound_buffer
;
11565 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11566 if (bound_val
== NULL
)
11569 *px
= value_as_long (bound_val
);
11570 if (pnew_k
!= NULL
)
11575 /* Value of variable named NAME in the current environment. If
11576 no such variable found, then if ERR_MSG is null, returns 0, and
11577 otherwise causes an error with message ERR_MSG. */
11579 static struct value
*
11580 get_var_value (const char *name
, const char *err_msg
)
11582 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11584 std::vector
<struct block_symbol
> syms
;
11585 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11586 get_selected_block (0),
11587 VAR_DOMAIN
, &syms
, 1);
11591 if (err_msg
== NULL
)
11594 error (("%s"), err_msg
);
11597 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11600 /* Value of integer variable named NAME in the current environment.
11601 If no such variable is found, returns false. Otherwise, sets VALUE
11602 to the variable's value and returns true. */
11605 get_int_var_value (const char *name
, LONGEST
&value
)
11607 struct value
*var_val
= get_var_value (name
, 0);
11612 value
= value_as_long (var_val
);
11617 /* Return a range type whose base type is that of the range type named
11618 NAME in the current environment, and whose bounds are calculated
11619 from NAME according to the GNAT range encoding conventions.
11620 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11621 corresponding range type from debug information; fall back to using it
11622 if symbol lookup fails. If a new type must be created, allocate it
11623 like ORIG_TYPE was. The bounds information, in general, is encoded
11624 in NAME, the base type given in the named range type. */
11626 static struct type
*
11627 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11630 struct type
*base_type
;
11631 const char *subtype_info
;
11633 gdb_assert (raw_type
!= NULL
);
11634 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11636 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11637 base_type
= TYPE_TARGET_TYPE (raw_type
);
11639 base_type
= raw_type
;
11641 name
= TYPE_NAME (raw_type
);
11642 subtype_info
= strstr (name
, "___XD");
11643 if (subtype_info
== NULL
)
11645 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11646 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11648 if (L
< INT_MIN
|| U
> INT_MAX
)
11651 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11656 static char *name_buf
= NULL
;
11657 static size_t name_len
= 0;
11658 int prefix_len
= subtype_info
- name
;
11661 const char *bounds_str
;
11664 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11665 strncpy (name_buf
, name
, prefix_len
);
11666 name_buf
[prefix_len
] = '\0';
11669 bounds_str
= strchr (subtype_info
, '_');
11672 if (*subtype_info
== 'L')
11674 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11675 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11677 if (bounds_str
[n
] == '_')
11679 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11685 strcpy (name_buf
+ prefix_len
, "___L");
11686 if (!get_int_var_value (name_buf
, L
))
11688 lim_warning (_("Unknown lower bound, using 1."));
11693 if (*subtype_info
== 'U')
11695 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11696 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11701 strcpy (name_buf
+ prefix_len
, "___U");
11702 if (!get_int_var_value (name_buf
, U
))
11704 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11709 type
= create_static_range_type (alloc_type_copy (raw_type
),
11711 /* create_static_range_type alters the resulting type's length
11712 to match the size of the base_type, which is not what we want.
11713 Set it back to the original range type's length. */
11714 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11715 TYPE_NAME (type
) = name
;
11720 /* True iff NAME is the name of a range type. */
11723 ada_is_range_type_name (const char *name
)
11725 return (name
!= NULL
&& strstr (name
, "___XD"));
11729 /* Modular types */
11731 /* True iff TYPE is an Ada modular type. */
11734 ada_is_modular_type (struct type
*type
)
11736 struct type
*subranged_type
= get_base_type (type
);
11738 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11739 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11740 && TYPE_UNSIGNED (subranged_type
));
11743 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11746 ada_modulus (struct type
*type
)
11748 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11752 /* Ada exception catchpoint support:
11753 ---------------------------------
11755 We support 3 kinds of exception catchpoints:
11756 . catchpoints on Ada exceptions
11757 . catchpoints on unhandled Ada exceptions
11758 . catchpoints on failed assertions
11760 Exceptions raised during failed assertions, or unhandled exceptions
11761 could perfectly be caught with the general catchpoint on Ada exceptions.
11762 However, we can easily differentiate these two special cases, and having
11763 the option to distinguish these two cases from the rest can be useful
11764 to zero-in on certain situations.
11766 Exception catchpoints are a specialized form of breakpoint,
11767 since they rely on inserting breakpoints inside known routines
11768 of the GNAT runtime. The implementation therefore uses a standard
11769 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11772 Support in the runtime for exception catchpoints have been changed
11773 a few times already, and these changes affect the implementation
11774 of these catchpoints. In order to be able to support several
11775 variants of the runtime, we use a sniffer that will determine
11776 the runtime variant used by the program being debugged. */
11778 /* Ada's standard exceptions.
11780 The Ada 83 standard also defined Numeric_Error. But there so many
11781 situations where it was unclear from the Ada 83 Reference Manual
11782 (RM) whether Constraint_Error or Numeric_Error should be raised,
11783 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11784 Interpretation saying that anytime the RM says that Numeric_Error
11785 should be raised, the implementation may raise Constraint_Error.
11786 Ada 95 went one step further and pretty much removed Numeric_Error
11787 from the list of standard exceptions (it made it a renaming of
11788 Constraint_Error, to help preserve compatibility when compiling
11789 an Ada83 compiler). As such, we do not include Numeric_Error from
11790 this list of standard exceptions. */
11792 static const char *standard_exc
[] = {
11793 "constraint_error",
11799 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11801 /* A structure that describes how to support exception catchpoints
11802 for a given executable. */
11804 struct exception_support_info
11806 /* The name of the symbol to break on in order to insert
11807 a catchpoint on exceptions. */
11808 const char *catch_exception_sym
;
11810 /* The name of the symbol to break on in order to insert
11811 a catchpoint on unhandled exceptions. */
11812 const char *catch_exception_unhandled_sym
;
11814 /* The name of the symbol to break on in order to insert
11815 a catchpoint on failed assertions. */
11816 const char *catch_assert_sym
;
11818 /* The name of the symbol to break on in order to insert
11819 a catchpoint on exception handling. */
11820 const char *catch_handlers_sym
;
11822 /* Assuming that the inferior just triggered an unhandled exception
11823 catchpoint, this function is responsible for returning the address
11824 in inferior memory where the name of that exception is stored.
11825 Return zero if the address could not be computed. */
11826 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11829 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11830 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11832 /* The following exception support info structure describes how to
11833 implement exception catchpoints with the latest version of the
11834 Ada runtime (as of 2019-08-??). */
11836 static const struct exception_support_info default_exception_support_info
=
11838 "__gnat_debug_raise_exception", /* catch_exception_sym */
11839 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11840 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11841 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11842 ada_unhandled_exception_name_addr
11845 /* The following exception support info structure describes how to
11846 implement exception catchpoints with an earlier version of the
11847 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11849 static const struct exception_support_info exception_support_info_v0
=
11851 "__gnat_debug_raise_exception", /* catch_exception_sym */
11852 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11853 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11854 "__gnat_begin_handler", /* catch_handlers_sym */
11855 ada_unhandled_exception_name_addr
11858 /* The following exception support info structure describes how to
11859 implement exception catchpoints with a slightly older version
11860 of the Ada runtime. */
11862 static const struct exception_support_info exception_support_info_fallback
=
11864 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11865 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11866 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11867 "__gnat_begin_handler", /* catch_handlers_sym */
11868 ada_unhandled_exception_name_addr_from_raise
11871 /* Return nonzero if we can detect the exception support routines
11872 described in EINFO.
11874 This function errors out if an abnormal situation is detected
11875 (for instance, if we find the exception support routines, but
11876 that support is found to be incomplete). */
11879 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11881 struct symbol
*sym
;
11883 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11884 that should be compiled with debugging information. As a result, we
11885 expect to find that symbol in the symtabs. */
11887 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11890 /* Perhaps we did not find our symbol because the Ada runtime was
11891 compiled without debugging info, or simply stripped of it.
11892 It happens on some GNU/Linux distributions for instance, where
11893 users have to install a separate debug package in order to get
11894 the runtime's debugging info. In that situation, let the user
11895 know why we cannot insert an Ada exception catchpoint.
11897 Note: Just for the purpose of inserting our Ada exception
11898 catchpoint, we could rely purely on the associated minimal symbol.
11899 But we would be operating in degraded mode anyway, since we are
11900 still lacking the debugging info needed later on to extract
11901 the name of the exception being raised (this name is printed in
11902 the catchpoint message, and is also used when trying to catch
11903 a specific exception). We do not handle this case for now. */
11904 struct bound_minimal_symbol msym
11905 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11907 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11908 error (_("Your Ada runtime appears to be missing some debugging "
11909 "information.\nCannot insert Ada exception catchpoint "
11910 "in this configuration."));
11915 /* Make sure that the symbol we found corresponds to a function. */
11917 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11919 error (_("Symbol \"%s\" is not a function (class = %d)"),
11920 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11924 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11927 struct bound_minimal_symbol msym
11928 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11930 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11931 error (_("Your Ada runtime appears to be missing some debugging "
11932 "information.\nCannot insert Ada exception catchpoint "
11933 "in this configuration."));
11938 /* Make sure that the symbol we found corresponds to a function. */
11940 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11942 error (_("Symbol \"%s\" is not a function (class = %d)"),
11943 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11950 /* Inspect the Ada runtime and determine which exception info structure
11951 should be used to provide support for exception catchpoints.
11953 This function will always set the per-inferior exception_info,
11954 or raise an error. */
11957 ada_exception_support_info_sniffer (void)
11959 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11961 /* If the exception info is already known, then no need to recompute it. */
11962 if (data
->exception_info
!= NULL
)
11965 /* Check the latest (default) exception support info. */
11966 if (ada_has_this_exception_support (&default_exception_support_info
))
11968 data
->exception_info
= &default_exception_support_info
;
11972 /* Try the v0 exception suport info. */
11973 if (ada_has_this_exception_support (&exception_support_info_v0
))
11975 data
->exception_info
= &exception_support_info_v0
;
11979 /* Try our fallback exception suport info. */
11980 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11982 data
->exception_info
= &exception_support_info_fallback
;
11986 /* Sometimes, it is normal for us to not be able to find the routine
11987 we are looking for. This happens when the program is linked with
11988 the shared version of the GNAT runtime, and the program has not been
11989 started yet. Inform the user of these two possible causes if
11992 if (ada_update_initial_language (language_unknown
) != language_ada
)
11993 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11995 /* If the symbol does not exist, then check that the program is
11996 already started, to make sure that shared libraries have been
11997 loaded. If it is not started, this may mean that the symbol is
11998 in a shared library. */
12000 if (inferior_ptid
.pid () == 0)
12001 error (_("Unable to insert catchpoint. Try to start the program first."));
12003 /* At this point, we know that we are debugging an Ada program and
12004 that the inferior has been started, but we still are not able to
12005 find the run-time symbols. That can mean that we are in
12006 configurable run time mode, or that a-except as been optimized
12007 out by the linker... In any case, at this point it is not worth
12008 supporting this feature. */
12010 error (_("Cannot insert Ada exception catchpoints in this configuration."));
12013 /* True iff FRAME is very likely to be that of a function that is
12014 part of the runtime system. This is all very heuristic, but is
12015 intended to be used as advice as to what frames are uninteresting
12019 is_known_support_routine (struct frame_info
*frame
)
12021 enum language func_lang
;
12023 const char *fullname
;
12025 /* If this code does not have any debugging information (no symtab),
12026 This cannot be any user code. */
12028 symtab_and_line sal
= find_frame_sal (frame
);
12029 if (sal
.symtab
== NULL
)
12032 /* If there is a symtab, but the associated source file cannot be
12033 located, then assume this is not user code: Selecting a frame
12034 for which we cannot display the code would not be very helpful
12035 for the user. This should also take care of case such as VxWorks
12036 where the kernel has some debugging info provided for a few units. */
12038 fullname
= symtab_to_fullname (sal
.symtab
);
12039 if (access (fullname
, R_OK
) != 0)
12042 /* Check the unit filename against the Ada runtime file naming.
12043 We also check the name of the objfile against the name of some
12044 known system libraries that sometimes come with debugging info
12047 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
12049 re_comp (known_runtime_file_name_patterns
[i
]);
12050 if (re_exec (lbasename (sal
.symtab
->filename
)))
12052 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
12053 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
12057 /* Check whether the function is a GNAT-generated entity. */
12059 gdb::unique_xmalloc_ptr
<char> func_name
12060 = find_frame_funname (frame
, &func_lang
, NULL
);
12061 if (func_name
== NULL
)
12064 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
12066 re_comp (known_auxiliary_function_name_patterns
[i
]);
12067 if (re_exec (func_name
.get ()))
12074 /* Find the first frame that contains debugging information and that is not
12075 part of the Ada run-time, starting from FI and moving upward. */
12078 ada_find_printable_frame (struct frame_info
*fi
)
12080 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
12082 if (!is_known_support_routine (fi
))
12091 /* Assuming that the inferior just triggered an unhandled exception
12092 catchpoint, return the address in inferior memory where the name
12093 of the exception is stored.
12095 Return zero if the address could not be computed. */
12098 ada_unhandled_exception_name_addr (void)
12100 return parse_and_eval_address ("e.full_name");
12103 /* Same as ada_unhandled_exception_name_addr, except that this function
12104 should be used when the inferior uses an older version of the runtime,
12105 where the exception name needs to be extracted from a specific frame
12106 several frames up in the callstack. */
12109 ada_unhandled_exception_name_addr_from_raise (void)
12112 struct frame_info
*fi
;
12113 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12115 /* To determine the name of this exception, we need to select
12116 the frame corresponding to RAISE_SYM_NAME. This frame is
12117 at least 3 levels up, so we simply skip the first 3 frames
12118 without checking the name of their associated function. */
12119 fi
= get_current_frame ();
12120 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
12122 fi
= get_prev_frame (fi
);
12126 enum language func_lang
;
12128 gdb::unique_xmalloc_ptr
<char> func_name
12129 = find_frame_funname (fi
, &func_lang
, NULL
);
12130 if (func_name
!= NULL
)
12132 if (strcmp (func_name
.get (),
12133 data
->exception_info
->catch_exception_sym
) == 0)
12134 break; /* We found the frame we were looking for... */
12136 fi
= get_prev_frame (fi
);
12143 return parse_and_eval_address ("id.full_name");
12146 /* Assuming the inferior just triggered an Ada exception catchpoint
12147 (of any type), return the address in inferior memory where the name
12148 of the exception is stored, if applicable.
12150 Assumes the selected frame is the current frame.
12152 Return zero if the address could not be computed, or if not relevant. */
12155 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12156 struct breakpoint
*b
)
12158 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12162 case ada_catch_exception
:
12163 return (parse_and_eval_address ("e.full_name"));
12166 case ada_catch_exception_unhandled
:
12167 return data
->exception_info
->unhandled_exception_name_addr ();
12170 case ada_catch_handlers
:
12171 return 0; /* The runtimes does not provide access to the exception
12175 case ada_catch_assert
:
12176 return 0; /* Exception name is not relevant in this case. */
12180 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12184 return 0; /* Should never be reached. */
12187 /* Assuming the inferior is stopped at an exception catchpoint,
12188 return the message which was associated to the exception, if
12189 available. Return NULL if the message could not be retrieved.
12191 Note: The exception message can be associated to an exception
12192 either through the use of the Raise_Exception function, or
12193 more simply (Ada 2005 and later), via:
12195 raise Exception_Name with "exception message";
12199 static gdb::unique_xmalloc_ptr
<char>
12200 ada_exception_message_1 (void)
12202 struct value
*e_msg_val
;
12205 /* For runtimes that support this feature, the exception message
12206 is passed as an unbounded string argument called "message". */
12207 e_msg_val
= parse_and_eval ("message");
12208 if (e_msg_val
== NULL
)
12209 return NULL
; /* Exception message not supported. */
12211 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
12212 gdb_assert (e_msg_val
!= NULL
);
12213 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
12215 /* If the message string is empty, then treat it as if there was
12216 no exception message. */
12217 if (e_msg_len
<= 0)
12220 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
12221 read_memory_string (value_address (e_msg_val
), e_msg
.get (), e_msg_len
+ 1);
12222 e_msg
.get ()[e_msg_len
] = '\0';
12227 /* Same as ada_exception_message_1, except that all exceptions are
12228 contained here (returning NULL instead). */
12230 static gdb::unique_xmalloc_ptr
<char>
12231 ada_exception_message (void)
12233 gdb::unique_xmalloc_ptr
<char> e_msg
;
12237 e_msg
= ada_exception_message_1 ();
12239 catch (const gdb_exception_error
&e
)
12241 e_msg
.reset (nullptr);
12247 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12248 any error that ada_exception_name_addr_1 might cause to be thrown.
12249 When an error is intercepted, a warning with the error message is printed,
12250 and zero is returned. */
12253 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12254 struct breakpoint
*b
)
12256 CORE_ADDR result
= 0;
12260 result
= ada_exception_name_addr_1 (ex
, b
);
12263 catch (const gdb_exception_error
&e
)
12265 warning (_("failed to get exception name: %s"), e
.what ());
12272 static std::string ada_exception_catchpoint_cond_string
12273 (const char *excep_string
,
12274 enum ada_exception_catchpoint_kind ex
);
12276 /* Ada catchpoints.
12278 In the case of catchpoints on Ada exceptions, the catchpoint will
12279 stop the target on every exception the program throws. When a user
12280 specifies the name of a specific exception, we translate this
12281 request into a condition expression (in text form), and then parse
12282 it into an expression stored in each of the catchpoint's locations.
12283 We then use this condition to check whether the exception that was
12284 raised is the one the user is interested in. If not, then the
12285 target is resumed again. We store the name of the requested
12286 exception, in order to be able to re-set the condition expression
12287 when symbols change. */
12289 /* An instance of this type is used to represent an Ada catchpoint
12290 breakpoint location. */
12292 class ada_catchpoint_location
: public bp_location
12295 ada_catchpoint_location (breakpoint
*owner
)
12296 : bp_location (owner
, bp_loc_software_breakpoint
)
12299 /* The condition that checks whether the exception that was raised
12300 is the specific exception the user specified on catchpoint
12302 expression_up excep_cond_expr
;
12305 /* An instance of this type is used to represent an Ada catchpoint. */
12307 struct ada_catchpoint
: public breakpoint
12309 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12314 /* The name of the specific exception the user specified. */
12315 std::string excep_string
;
12317 /* What kind of catchpoint this is. */
12318 enum ada_exception_catchpoint_kind m_kind
;
12321 /* Parse the exception condition string in the context of each of the
12322 catchpoint's locations, and store them for later evaluation. */
12325 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12326 enum ada_exception_catchpoint_kind ex
)
12328 struct bp_location
*bl
;
12330 /* Nothing to do if there's no specific exception to catch. */
12331 if (c
->excep_string
.empty ())
12334 /* Same if there are no locations... */
12335 if (c
->loc
== NULL
)
12338 /* Compute the condition expression in text form, from the specific
12339 expection we want to catch. */
12340 std::string cond_string
12341 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12343 /* Iterate over all the catchpoint's locations, and parse an
12344 expression for each. */
12345 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12347 struct ada_catchpoint_location
*ada_loc
12348 = (struct ada_catchpoint_location
*) bl
;
12351 if (!bl
->shlib_disabled
)
12355 s
= cond_string
.c_str ();
12358 exp
= parse_exp_1 (&s
, bl
->address
,
12359 block_for_pc (bl
->address
),
12362 catch (const gdb_exception_error
&e
)
12364 warning (_("failed to reevaluate internal exception condition "
12365 "for catchpoint %d: %s"),
12366 c
->number
, e
.what ());
12370 ada_loc
->excep_cond_expr
= std::move (exp
);
12374 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12375 structure for all exception catchpoint kinds. */
12377 static struct bp_location
*
12378 allocate_location_exception (struct breakpoint
*self
)
12380 return new ada_catchpoint_location (self
);
12383 /* Implement the RE_SET method in the breakpoint_ops structure for all
12384 exception catchpoint kinds. */
12387 re_set_exception (struct breakpoint
*b
)
12389 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12391 /* Call the base class's method. This updates the catchpoint's
12393 bkpt_breakpoint_ops
.re_set (b
);
12395 /* Reparse the exception conditional expressions. One for each
12397 create_excep_cond_exprs (c
, c
->m_kind
);
12400 /* Returns true if we should stop for this breakpoint hit. If the
12401 user specified a specific exception, we only want to cause a stop
12402 if the program thrown that exception. */
12405 should_stop_exception (const struct bp_location
*bl
)
12407 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12408 const struct ada_catchpoint_location
*ada_loc
12409 = (const struct ada_catchpoint_location
*) bl
;
12412 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12413 if (c
->m_kind
== ada_catch_assert
)
12414 clear_internalvar (var
);
12421 if (c
->m_kind
== ada_catch_handlers
)
12422 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12423 ".all.occurrence.id");
12427 struct value
*exc
= parse_and_eval (expr
);
12428 set_internalvar (var
, exc
);
12430 catch (const gdb_exception_error
&ex
)
12432 clear_internalvar (var
);
12436 /* With no specific exception, should always stop. */
12437 if (c
->excep_string
.empty ())
12440 if (ada_loc
->excep_cond_expr
== NULL
)
12442 /* We will have a NULL expression if back when we were creating
12443 the expressions, this location's had failed to parse. */
12450 struct value
*mark
;
12452 mark
= value_mark ();
12453 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12454 value_free_to_mark (mark
);
12456 catch (const gdb_exception
&ex
)
12458 exception_fprintf (gdb_stderr
, ex
,
12459 _("Error in testing exception condition:\n"));
12465 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12466 for all exception catchpoint kinds. */
12469 check_status_exception (bpstat bs
)
12471 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12474 /* Implement the PRINT_IT method in the breakpoint_ops structure
12475 for all exception catchpoint kinds. */
12477 static enum print_stop_action
12478 print_it_exception (bpstat bs
)
12480 struct ui_out
*uiout
= current_uiout
;
12481 struct breakpoint
*b
= bs
->breakpoint_at
;
12483 annotate_catchpoint (b
->number
);
12485 if (uiout
->is_mi_like_p ())
12487 uiout
->field_string ("reason",
12488 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12489 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12492 uiout
->text (b
->disposition
== disp_del
12493 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12494 uiout
->field_signed ("bkptno", b
->number
);
12495 uiout
->text (", ");
12497 /* ada_exception_name_addr relies on the selected frame being the
12498 current frame. Need to do this here because this function may be
12499 called more than once when printing a stop, and below, we'll
12500 select the first frame past the Ada run-time (see
12501 ada_find_printable_frame). */
12502 select_frame (get_current_frame ());
12504 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12507 case ada_catch_exception
:
12508 case ada_catch_exception_unhandled
:
12509 case ada_catch_handlers
:
12511 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12512 char exception_name
[256];
12516 read_memory (addr
, (gdb_byte
*) exception_name
,
12517 sizeof (exception_name
) - 1);
12518 exception_name
[sizeof (exception_name
) - 1] = '\0';
12522 /* For some reason, we were unable to read the exception
12523 name. This could happen if the Runtime was compiled
12524 without debugging info, for instance. In that case,
12525 just replace the exception name by the generic string
12526 "exception" - it will read as "an exception" in the
12527 notification we are about to print. */
12528 memcpy (exception_name
, "exception", sizeof ("exception"));
12530 /* In the case of unhandled exception breakpoints, we print
12531 the exception name as "unhandled EXCEPTION_NAME", to make
12532 it clearer to the user which kind of catchpoint just got
12533 hit. We used ui_out_text to make sure that this extra
12534 info does not pollute the exception name in the MI case. */
12535 if (c
->m_kind
== ada_catch_exception_unhandled
)
12536 uiout
->text ("unhandled ");
12537 uiout
->field_string ("exception-name", exception_name
);
12540 case ada_catch_assert
:
12541 /* In this case, the name of the exception is not really
12542 important. Just print "failed assertion" to make it clearer
12543 that his program just hit an assertion-failure catchpoint.
12544 We used ui_out_text because this info does not belong in
12546 uiout
->text ("failed assertion");
12550 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12551 if (exception_message
!= NULL
)
12553 uiout
->text (" (");
12554 uiout
->field_string ("exception-message", exception_message
.get ());
12558 uiout
->text (" at ");
12559 ada_find_printable_frame (get_current_frame ());
12561 return PRINT_SRC_AND_LOC
;
12564 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12565 for all exception catchpoint kinds. */
12568 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12570 struct ui_out
*uiout
= current_uiout
;
12571 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12572 struct value_print_options opts
;
12574 get_user_print_options (&opts
);
12576 if (opts
.addressprint
)
12577 uiout
->field_skip ("addr");
12579 annotate_field (5);
12582 case ada_catch_exception
:
12583 if (!c
->excep_string
.empty ())
12585 std::string msg
= string_printf (_("`%s' Ada exception"),
12586 c
->excep_string
.c_str ());
12588 uiout
->field_string ("what", msg
);
12591 uiout
->field_string ("what", "all Ada exceptions");
12595 case ada_catch_exception_unhandled
:
12596 uiout
->field_string ("what", "unhandled Ada exceptions");
12599 case ada_catch_handlers
:
12600 if (!c
->excep_string
.empty ())
12602 uiout
->field_fmt ("what",
12603 _("`%s' Ada exception handlers"),
12604 c
->excep_string
.c_str ());
12607 uiout
->field_string ("what", "all Ada exceptions handlers");
12610 case ada_catch_assert
:
12611 uiout
->field_string ("what", "failed Ada assertions");
12615 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12620 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12621 for all exception catchpoint kinds. */
12624 print_mention_exception (struct breakpoint
*b
)
12626 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12627 struct ui_out
*uiout
= current_uiout
;
12629 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12630 : _("Catchpoint "));
12631 uiout
->field_signed ("bkptno", b
->number
);
12632 uiout
->text (": ");
12636 case ada_catch_exception
:
12637 if (!c
->excep_string
.empty ())
12639 std::string info
= string_printf (_("`%s' Ada exception"),
12640 c
->excep_string
.c_str ());
12641 uiout
->text (info
.c_str ());
12644 uiout
->text (_("all Ada exceptions"));
12647 case ada_catch_exception_unhandled
:
12648 uiout
->text (_("unhandled Ada exceptions"));
12651 case ada_catch_handlers
:
12652 if (!c
->excep_string
.empty ())
12655 = string_printf (_("`%s' Ada exception handlers"),
12656 c
->excep_string
.c_str ());
12657 uiout
->text (info
.c_str ());
12660 uiout
->text (_("all Ada exceptions handlers"));
12663 case ada_catch_assert
:
12664 uiout
->text (_("failed Ada assertions"));
12668 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12673 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12674 for all exception catchpoint kinds. */
12677 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12679 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12683 case ada_catch_exception
:
12684 fprintf_filtered (fp
, "catch exception");
12685 if (!c
->excep_string
.empty ())
12686 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12689 case ada_catch_exception_unhandled
:
12690 fprintf_filtered (fp
, "catch exception unhandled");
12693 case ada_catch_handlers
:
12694 fprintf_filtered (fp
, "catch handlers");
12697 case ada_catch_assert
:
12698 fprintf_filtered (fp
, "catch assert");
12702 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12704 print_recreate_thread (b
, fp
);
12707 /* Virtual tables for various breakpoint types. */
12708 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12709 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12710 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12711 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12713 /* See ada-lang.h. */
12716 is_ada_exception_catchpoint (breakpoint
*bp
)
12718 return (bp
->ops
== &catch_exception_breakpoint_ops
12719 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12720 || bp
->ops
== &catch_assert_breakpoint_ops
12721 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12724 /* Split the arguments specified in a "catch exception" command.
12725 Set EX to the appropriate catchpoint type.
12726 Set EXCEP_STRING to the name of the specific exception if
12727 specified by the user.
12728 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12729 "catch handlers" command. False otherwise.
12730 If a condition is found at the end of the arguments, the condition
12731 expression is stored in COND_STRING (memory must be deallocated
12732 after use). Otherwise COND_STRING is set to NULL. */
12735 catch_ada_exception_command_split (const char *args
,
12736 bool is_catch_handlers_cmd
,
12737 enum ada_exception_catchpoint_kind
*ex
,
12738 std::string
*excep_string
,
12739 std::string
*cond_string
)
12741 std::string exception_name
;
12743 exception_name
= extract_arg (&args
);
12744 if (exception_name
== "if")
12746 /* This is not an exception name; this is the start of a condition
12747 expression for a catchpoint on all exceptions. So, "un-get"
12748 this token, and set exception_name to NULL. */
12749 exception_name
.clear ();
12753 /* Check to see if we have a condition. */
12755 args
= skip_spaces (args
);
12756 if (startswith (args
, "if")
12757 && (isspace (args
[2]) || args
[2] == '\0'))
12760 args
= skip_spaces (args
);
12762 if (args
[0] == '\0')
12763 error (_("Condition missing after `if' keyword"));
12764 *cond_string
= args
;
12766 args
+= strlen (args
);
12769 /* Check that we do not have any more arguments. Anything else
12772 if (args
[0] != '\0')
12773 error (_("Junk at end of expression"));
12775 if (is_catch_handlers_cmd
)
12777 /* Catch handling of exceptions. */
12778 *ex
= ada_catch_handlers
;
12779 *excep_string
= exception_name
;
12781 else if (exception_name
.empty ())
12783 /* Catch all exceptions. */
12784 *ex
= ada_catch_exception
;
12785 excep_string
->clear ();
12787 else if (exception_name
== "unhandled")
12789 /* Catch unhandled exceptions. */
12790 *ex
= ada_catch_exception_unhandled
;
12791 excep_string
->clear ();
12795 /* Catch a specific exception. */
12796 *ex
= ada_catch_exception
;
12797 *excep_string
= exception_name
;
12801 /* Return the name of the symbol on which we should break in order to
12802 implement a catchpoint of the EX kind. */
12804 static const char *
12805 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12807 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12809 gdb_assert (data
->exception_info
!= NULL
);
12813 case ada_catch_exception
:
12814 return (data
->exception_info
->catch_exception_sym
);
12816 case ada_catch_exception_unhandled
:
12817 return (data
->exception_info
->catch_exception_unhandled_sym
);
12819 case ada_catch_assert
:
12820 return (data
->exception_info
->catch_assert_sym
);
12822 case ada_catch_handlers
:
12823 return (data
->exception_info
->catch_handlers_sym
);
12826 internal_error (__FILE__
, __LINE__
,
12827 _("unexpected catchpoint kind (%d)"), ex
);
12831 /* Return the breakpoint ops "virtual table" used for catchpoints
12834 static const struct breakpoint_ops
*
12835 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12839 case ada_catch_exception
:
12840 return (&catch_exception_breakpoint_ops
);
12842 case ada_catch_exception_unhandled
:
12843 return (&catch_exception_unhandled_breakpoint_ops
);
12845 case ada_catch_assert
:
12846 return (&catch_assert_breakpoint_ops
);
12848 case ada_catch_handlers
:
12849 return (&catch_handlers_breakpoint_ops
);
12852 internal_error (__FILE__
, __LINE__
,
12853 _("unexpected catchpoint kind (%d)"), ex
);
12857 /* Return the condition that will be used to match the current exception
12858 being raised with the exception that the user wants to catch. This
12859 assumes that this condition is used when the inferior just triggered
12860 an exception catchpoint.
12861 EX: the type of catchpoints used for catching Ada exceptions. */
12864 ada_exception_catchpoint_cond_string (const char *excep_string
,
12865 enum ada_exception_catchpoint_kind ex
)
12868 bool is_standard_exc
= false;
12869 std::string result
;
12871 if (ex
== ada_catch_handlers
)
12873 /* For exception handlers catchpoints, the condition string does
12874 not use the same parameter as for the other exceptions. */
12875 result
= ("long_integer (GNAT_GCC_exception_Access"
12876 "(gcc_exception).all.occurrence.id)");
12879 result
= "long_integer (e)";
12881 /* The standard exceptions are a special case. They are defined in
12882 runtime units that have been compiled without debugging info; if
12883 EXCEP_STRING is the not-fully-qualified name of a standard
12884 exception (e.g. "constraint_error") then, during the evaluation
12885 of the condition expression, the symbol lookup on this name would
12886 *not* return this standard exception. The catchpoint condition
12887 may then be set only on user-defined exceptions which have the
12888 same not-fully-qualified name (e.g. my_package.constraint_error).
12890 To avoid this unexcepted behavior, these standard exceptions are
12891 systematically prefixed by "standard". This means that "catch
12892 exception constraint_error" is rewritten into "catch exception
12893 standard.constraint_error".
12895 If an exception named constraint_error is defined in another package of
12896 the inferior program, then the only way to specify this exception as a
12897 breakpoint condition is to use its fully-qualified named:
12898 e.g. my_package.constraint_error. */
12900 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12902 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12904 is_standard_exc
= true;
12911 if (is_standard_exc
)
12912 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12914 string_appendf (result
, "long_integer (&%s)", excep_string
);
12919 /* Return the symtab_and_line that should be used to insert an exception
12920 catchpoint of the TYPE kind.
12922 ADDR_STRING returns the name of the function where the real
12923 breakpoint that implements the catchpoints is set, depending on the
12924 type of catchpoint we need to create. */
12926 static struct symtab_and_line
12927 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12928 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12930 const char *sym_name
;
12931 struct symbol
*sym
;
12933 /* First, find out which exception support info to use. */
12934 ada_exception_support_info_sniffer ();
12936 /* Then lookup the function on which we will break in order to catch
12937 the Ada exceptions requested by the user. */
12938 sym_name
= ada_exception_sym_name (ex
);
12939 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12942 error (_("Catchpoint symbol not found: %s"), sym_name
);
12944 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12945 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12947 /* Set ADDR_STRING. */
12948 *addr_string
= sym_name
;
12951 *ops
= ada_exception_breakpoint_ops (ex
);
12953 return find_function_start_sal (sym
, 1);
12956 /* Create an Ada exception catchpoint.
12958 EX_KIND is the kind of exception catchpoint to be created.
12960 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12961 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12962 of the exception to which this catchpoint applies.
12964 COND_STRING, if not empty, is the catchpoint condition.
12966 TEMPFLAG, if nonzero, means that the underlying breakpoint
12967 should be temporary.
12969 FROM_TTY is the usual argument passed to all commands implementations. */
12972 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12973 enum ada_exception_catchpoint_kind ex_kind
,
12974 const std::string
&excep_string
,
12975 const std::string
&cond_string
,
12980 std::string addr_string
;
12981 const struct breakpoint_ops
*ops
= NULL
;
12982 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12984 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12985 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12986 ops
, tempflag
, disabled
, from_tty
);
12987 c
->excep_string
= excep_string
;
12988 create_excep_cond_exprs (c
.get (), ex_kind
);
12989 if (!cond_string
.empty ())
12990 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
);
12991 install_breakpoint (0, std::move (c
), 1);
12994 /* Implement the "catch exception" command. */
12997 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12998 struct cmd_list_element
*command
)
13000 const char *arg
= arg_entry
;
13001 struct gdbarch
*gdbarch
= get_current_arch ();
13003 enum ada_exception_catchpoint_kind ex_kind
;
13004 std::string excep_string
;
13005 std::string cond_string
;
13007 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13011 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
13013 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
13014 excep_string
, cond_string
,
13015 tempflag
, 1 /* enabled */,
13019 /* Implement the "catch handlers" command. */
13022 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
13023 struct cmd_list_element
*command
)
13025 const char *arg
= arg_entry
;
13026 struct gdbarch
*gdbarch
= get_current_arch ();
13028 enum ada_exception_catchpoint_kind ex_kind
;
13029 std::string excep_string
;
13030 std::string cond_string
;
13032 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13036 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
13038 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
13039 excep_string
, cond_string
,
13040 tempflag
, 1 /* enabled */,
13044 /* Completion function for the Ada "catch" commands. */
13047 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
13048 const char *text
, const char *word
)
13050 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
13052 for (const ada_exc_info
&info
: exceptions
)
13054 if (startswith (info
.name
, word
))
13055 tracker
.add_completion (make_unique_xstrdup (info
.name
));
13059 /* Split the arguments specified in a "catch assert" command.
13061 ARGS contains the command's arguments (or the empty string if
13062 no arguments were passed).
13064 If ARGS contains a condition, set COND_STRING to that condition
13065 (the memory needs to be deallocated after use). */
13068 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
13070 args
= skip_spaces (args
);
13072 /* Check whether a condition was provided. */
13073 if (startswith (args
, "if")
13074 && (isspace (args
[2]) || args
[2] == '\0'))
13077 args
= skip_spaces (args
);
13078 if (args
[0] == '\0')
13079 error (_("condition missing after `if' keyword"));
13080 cond_string
.assign (args
);
13083 /* Otherwise, there should be no other argument at the end of
13085 else if (args
[0] != '\0')
13086 error (_("Junk at end of arguments."));
13089 /* Implement the "catch assert" command. */
13092 catch_assert_command (const char *arg_entry
, int from_tty
,
13093 struct cmd_list_element
*command
)
13095 const char *arg
= arg_entry
;
13096 struct gdbarch
*gdbarch
= get_current_arch ();
13098 std::string cond_string
;
13100 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13104 catch_ada_assert_command_split (arg
, cond_string
);
13105 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
13107 tempflag
, 1 /* enabled */,
13111 /* Return non-zero if the symbol SYM is an Ada exception object. */
13114 ada_is_exception_sym (struct symbol
*sym
)
13116 const char *type_name
= TYPE_NAME (SYMBOL_TYPE (sym
));
13118 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
13119 && SYMBOL_CLASS (sym
) != LOC_BLOCK
13120 && SYMBOL_CLASS (sym
) != LOC_CONST
13121 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
13122 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
13125 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13126 Ada exception object. This matches all exceptions except the ones
13127 defined by the Ada language. */
13130 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13134 if (!ada_is_exception_sym (sym
))
13137 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13138 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
13139 return 0; /* A standard exception. */
13141 /* Numeric_Error is also a standard exception, so exclude it.
13142 See the STANDARD_EXC description for more details as to why
13143 this exception is not listed in that array. */
13144 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
13150 /* A helper function for std::sort, comparing two struct ada_exc_info
13153 The comparison is determined first by exception name, and then
13154 by exception address. */
13157 ada_exc_info::operator< (const ada_exc_info
&other
) const
13161 result
= strcmp (name
, other
.name
);
13164 if (result
== 0 && addr
< other
.addr
)
13170 ada_exc_info::operator== (const ada_exc_info
&other
) const
13172 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
13175 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13176 routine, but keeping the first SKIP elements untouched.
13178 All duplicates are also removed. */
13181 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
13184 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
13185 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
13186 exceptions
->end ());
13189 /* Add all exceptions defined by the Ada standard whose name match
13190 a regular expression.
13192 If PREG is not NULL, then this regexp_t object is used to
13193 perform the symbol name matching. Otherwise, no name-based
13194 filtering is performed.
13196 EXCEPTIONS is a vector of exceptions to which matching exceptions
13200 ada_add_standard_exceptions (compiled_regex
*preg
,
13201 std::vector
<ada_exc_info
> *exceptions
)
13205 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13208 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
13210 struct bound_minimal_symbol msymbol
13211 = ada_lookup_simple_minsym (standard_exc
[i
]);
13213 if (msymbol
.minsym
!= NULL
)
13215 struct ada_exc_info info
13216 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13218 exceptions
->push_back (info
);
13224 /* Add all Ada exceptions defined locally and accessible from the given
13227 If PREG is not NULL, then this regexp_t object is used to
13228 perform the symbol name matching. Otherwise, no name-based
13229 filtering is performed.
13231 EXCEPTIONS is a vector of exceptions to which matching exceptions
13235 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13236 struct frame_info
*frame
,
13237 std::vector
<ada_exc_info
> *exceptions
)
13239 const struct block
*block
= get_frame_block (frame
, 0);
13243 struct block_iterator iter
;
13244 struct symbol
*sym
;
13246 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13248 switch (SYMBOL_CLASS (sym
))
13255 if (ada_is_exception_sym (sym
))
13257 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
13258 SYMBOL_VALUE_ADDRESS (sym
)};
13260 exceptions
->push_back (info
);
13264 if (BLOCK_FUNCTION (block
) != NULL
)
13266 block
= BLOCK_SUPERBLOCK (block
);
13270 /* Return true if NAME matches PREG or if PREG is NULL. */
13273 name_matches_regex (const char *name
, compiled_regex
*preg
)
13275 return (preg
== NULL
13276 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13279 /* Add all exceptions defined globally whose name name match
13280 a regular expression, excluding standard exceptions.
13282 The reason we exclude standard exceptions is that they need
13283 to be handled separately: Standard exceptions are defined inside
13284 a runtime unit which is normally not compiled with debugging info,
13285 and thus usually do not show up in our symbol search. However,
13286 if the unit was in fact built with debugging info, we need to
13287 exclude them because they would duplicate the entry we found
13288 during the special loop that specifically searches for those
13289 standard exceptions.
13291 If PREG is not NULL, then this regexp_t object is used to
13292 perform the symbol name matching. Otherwise, no name-based
13293 filtering is performed.
13295 EXCEPTIONS is a vector of exceptions to which matching exceptions
13299 ada_add_global_exceptions (compiled_regex
*preg
,
13300 std::vector
<ada_exc_info
> *exceptions
)
13302 /* In Ada, the symbol "search name" is a linkage name, whereas the
13303 regular expression used to do the matching refers to the natural
13304 name. So match against the decoded name. */
13305 expand_symtabs_matching (NULL
,
13306 lookup_name_info::match_any (),
13307 [&] (const char *search_name
)
13309 std::string decoded
= ada_decode (search_name
);
13310 return name_matches_regex (decoded
.c_str (), preg
);
13315 for (objfile
*objfile
: current_program_space
->objfiles ())
13317 for (compunit_symtab
*s
: objfile
->compunits ())
13319 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13322 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13324 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13325 struct block_iterator iter
;
13326 struct symbol
*sym
;
13328 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13329 if (ada_is_non_standard_exception_sym (sym
)
13330 && name_matches_regex (SYMBOL_NATURAL_NAME (sym
), preg
))
13332 struct ada_exc_info info
13333 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
13335 exceptions
->push_back (info
);
13342 /* Implements ada_exceptions_list with the regular expression passed
13343 as a regex_t, rather than a string.
13345 If not NULL, PREG is used to filter out exceptions whose names
13346 do not match. Otherwise, all exceptions are listed. */
13348 static std::vector
<ada_exc_info
>
13349 ada_exceptions_list_1 (compiled_regex
*preg
)
13351 std::vector
<ada_exc_info
> result
;
13354 /* First, list the known standard exceptions. These exceptions
13355 need to be handled separately, as they are usually defined in
13356 runtime units that have been compiled without debugging info. */
13358 ada_add_standard_exceptions (preg
, &result
);
13360 /* Next, find all exceptions whose scope is local and accessible
13361 from the currently selected frame. */
13363 if (has_stack_frames ())
13365 prev_len
= result
.size ();
13366 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13368 if (result
.size () > prev_len
)
13369 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13372 /* Add all exceptions whose scope is global. */
13374 prev_len
= result
.size ();
13375 ada_add_global_exceptions (preg
, &result
);
13376 if (result
.size () > prev_len
)
13377 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13382 /* Return a vector of ada_exc_info.
13384 If REGEXP is NULL, all exceptions are included in the result.
13385 Otherwise, it should contain a valid regular expression,
13386 and only the exceptions whose names match that regular expression
13387 are included in the result.
13389 The exceptions are sorted in the following order:
13390 - Standard exceptions (defined by the Ada language), in
13391 alphabetical order;
13392 - Exceptions only visible from the current frame, in
13393 alphabetical order;
13394 - Exceptions whose scope is global, in alphabetical order. */
13396 std::vector
<ada_exc_info
>
13397 ada_exceptions_list (const char *regexp
)
13399 if (regexp
== NULL
)
13400 return ada_exceptions_list_1 (NULL
);
13402 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13403 return ada_exceptions_list_1 (®
);
13406 /* Implement the "info exceptions" command. */
13409 info_exceptions_command (const char *regexp
, int from_tty
)
13411 struct gdbarch
*gdbarch
= get_current_arch ();
13413 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13415 if (regexp
!= NULL
)
13417 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13419 printf_filtered (_("All defined Ada exceptions:\n"));
13421 for (const ada_exc_info
&info
: exceptions
)
13422 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13426 /* Information about operators given special treatment in functions
13428 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13430 #define ADA_OPERATORS \
13431 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13432 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13433 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13434 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13435 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13436 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13437 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13438 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13439 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13440 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13441 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13442 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13443 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13444 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13445 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13446 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13447 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13448 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13449 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13452 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13455 switch (exp
->elts
[pc
- 1].opcode
)
13458 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13461 #define OP_DEFN(op, len, args, binop) \
13462 case op: *oplenp = len; *argsp = args; break;
13468 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13473 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13478 /* Implementation of the exp_descriptor method operator_check. */
13481 ada_operator_check (struct expression
*exp
, int pos
,
13482 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13485 const union exp_element
*const elts
= exp
->elts
;
13486 struct type
*type
= NULL
;
13488 switch (elts
[pos
].opcode
)
13490 case UNOP_IN_RANGE
:
13492 type
= elts
[pos
+ 1].type
;
13496 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13499 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13501 if (type
&& TYPE_OBJFILE (type
)
13502 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13508 static const char *
13509 ada_op_name (enum exp_opcode opcode
)
13514 return op_name_standard (opcode
);
13516 #define OP_DEFN(op, len, args, binop) case op: return #op;
13521 return "OP_AGGREGATE";
13523 return "OP_CHOICES";
13529 /* As for operator_length, but assumes PC is pointing at the first
13530 element of the operator, and gives meaningful results only for the
13531 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13534 ada_forward_operator_length (struct expression
*exp
, int pc
,
13535 int *oplenp
, int *argsp
)
13537 switch (exp
->elts
[pc
].opcode
)
13540 *oplenp
= *argsp
= 0;
13543 #define OP_DEFN(op, len, args, binop) \
13544 case op: *oplenp = len; *argsp = args; break;
13550 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13555 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13561 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13563 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13571 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13573 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13578 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13582 /* Ada attributes ('Foo). */
13585 case OP_ATR_LENGTH
:
13589 case OP_ATR_MODULUS
:
13596 case UNOP_IN_RANGE
:
13598 /* XXX: gdb_sprint_host_address, type_sprint */
13599 fprintf_filtered (stream
, _("Type @"));
13600 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13601 fprintf_filtered (stream
, " (");
13602 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13603 fprintf_filtered (stream
, ")");
13605 case BINOP_IN_BOUNDS
:
13606 fprintf_filtered (stream
, " (%d)",
13607 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13609 case TERNOP_IN_RANGE
:
13614 case OP_DISCRETE_RANGE
:
13615 case OP_POSITIONAL
:
13622 char *name
= &exp
->elts
[elt
+ 2].string
;
13623 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13625 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13630 return dump_subexp_body_standard (exp
, stream
, elt
);
13634 for (i
= 0; i
< nargs
; i
+= 1)
13635 elt
= dump_subexp (exp
, stream
, elt
);
13640 /* The Ada extension of print_subexp (q.v.). */
13643 ada_print_subexp (struct expression
*exp
, int *pos
,
13644 struct ui_file
*stream
, enum precedence prec
)
13646 int oplen
, nargs
, i
;
13648 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13650 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13657 print_subexp_standard (exp
, pos
, stream
, prec
);
13661 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13664 case BINOP_IN_BOUNDS
:
13665 /* XXX: sprint_subexp */
13666 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13667 fputs_filtered (" in ", stream
);
13668 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13669 fputs_filtered ("'range", stream
);
13670 if (exp
->elts
[pc
+ 1].longconst
> 1)
13671 fprintf_filtered (stream
, "(%ld)",
13672 (long) exp
->elts
[pc
+ 1].longconst
);
13675 case TERNOP_IN_RANGE
:
13676 if (prec
>= PREC_EQUAL
)
13677 fputs_filtered ("(", stream
);
13678 /* XXX: sprint_subexp */
13679 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13680 fputs_filtered (" in ", stream
);
13681 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13682 fputs_filtered (" .. ", stream
);
13683 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13684 if (prec
>= PREC_EQUAL
)
13685 fputs_filtered (")", stream
);
13690 case OP_ATR_LENGTH
:
13694 case OP_ATR_MODULUS
:
13699 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13701 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13702 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13703 &type_print_raw_options
);
13707 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13708 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13713 for (tem
= 1; tem
< nargs
; tem
+= 1)
13715 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13716 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13718 fputs_filtered (")", stream
);
13723 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13724 fputs_filtered ("'(", stream
);
13725 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13726 fputs_filtered (")", stream
);
13729 case UNOP_IN_RANGE
:
13730 /* XXX: sprint_subexp */
13731 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13732 fputs_filtered (" in ", stream
);
13733 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13734 &type_print_raw_options
);
13737 case OP_DISCRETE_RANGE
:
13738 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13739 fputs_filtered ("..", stream
);
13740 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13744 fputs_filtered ("others => ", stream
);
13745 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13749 for (i
= 0; i
< nargs
-1; i
+= 1)
13752 fputs_filtered ("|", stream
);
13753 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13755 fputs_filtered (" => ", stream
);
13756 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13759 case OP_POSITIONAL
:
13760 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13764 fputs_filtered ("(", stream
);
13765 for (i
= 0; i
< nargs
; i
+= 1)
13768 fputs_filtered (", ", stream
);
13769 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13771 fputs_filtered (")", stream
);
13776 /* Table mapping opcodes into strings for printing operators
13777 and precedences of the operators. */
13779 static const struct op_print ada_op_print_tab
[] = {
13780 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13781 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13782 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13783 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13784 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13785 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13786 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13787 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13788 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13789 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13790 {">", BINOP_GTR
, PREC_ORDER
, 0},
13791 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13792 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13793 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13794 {"+", BINOP_ADD
, PREC_ADD
, 0},
13795 {"-", BINOP_SUB
, PREC_ADD
, 0},
13796 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13797 {"*", BINOP_MUL
, PREC_MUL
, 0},
13798 {"/", BINOP_DIV
, PREC_MUL
, 0},
13799 {"rem", BINOP_REM
, PREC_MUL
, 0},
13800 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13801 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13802 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13803 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13804 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13805 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13806 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13807 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13808 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13809 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13810 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13811 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13814 enum ada_primitive_types
{
13815 ada_primitive_type_int
,
13816 ada_primitive_type_long
,
13817 ada_primitive_type_short
,
13818 ada_primitive_type_char
,
13819 ada_primitive_type_float
,
13820 ada_primitive_type_double
,
13821 ada_primitive_type_void
,
13822 ada_primitive_type_long_long
,
13823 ada_primitive_type_long_double
,
13824 ada_primitive_type_natural
,
13825 ada_primitive_type_positive
,
13826 ada_primitive_type_system_address
,
13827 ada_primitive_type_storage_offset
,
13828 nr_ada_primitive_types
13832 ada_language_arch_info (struct gdbarch
*gdbarch
,
13833 struct language_arch_info
*lai
)
13835 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13837 lai
->primitive_type_vector
13838 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13841 lai
->primitive_type_vector
[ada_primitive_type_int
]
13842 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13844 lai
->primitive_type_vector
[ada_primitive_type_long
]
13845 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13846 0, "long_integer");
13847 lai
->primitive_type_vector
[ada_primitive_type_short
]
13848 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13849 0, "short_integer");
13850 lai
->string_char_type
13851 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13852 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13853 lai
->primitive_type_vector
[ada_primitive_type_float
]
13854 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13855 "float", gdbarch_float_format (gdbarch
));
13856 lai
->primitive_type_vector
[ada_primitive_type_double
]
13857 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13858 "long_float", gdbarch_double_format (gdbarch
));
13859 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13860 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13861 0, "long_long_integer");
13862 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13863 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13864 "long_long_float", gdbarch_long_double_format (gdbarch
));
13865 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13866 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13868 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13869 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13871 lai
->primitive_type_vector
[ada_primitive_type_void
]
13872 = builtin
->builtin_void
;
13874 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13875 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13877 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13878 = "system__address";
13880 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13881 type. This is a signed integral type whose size is the same as
13882 the size of addresses. */
13884 unsigned int addr_length
= TYPE_LENGTH
13885 (lai
->primitive_type_vector
[ada_primitive_type_system_address
]);
13887 lai
->primitive_type_vector
[ada_primitive_type_storage_offset
]
13888 = arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13892 lai
->bool_type_symbol
= NULL
;
13893 lai
->bool_type_default
= builtin
->builtin_bool
;
13896 /* Language vector */
13898 /* Not really used, but needed in the ada_language_defn. */
13901 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13903 ada_emit_char (c
, type
, stream
, quoter
, 1);
13907 parse (struct parser_state
*ps
)
13909 warnings_issued
= 0;
13910 return ada_parse (ps
);
13913 static const struct exp_descriptor ada_exp_descriptor
= {
13915 ada_operator_length
,
13916 ada_operator_check
,
13918 ada_dump_subexp_body
,
13919 ada_evaluate_subexp
13922 /* symbol_name_matcher_ftype adapter for wild_match. */
13925 do_wild_match (const char *symbol_search_name
,
13926 const lookup_name_info
&lookup_name
,
13927 completion_match_result
*comp_match_res
)
13929 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13932 /* symbol_name_matcher_ftype adapter for full_match. */
13935 do_full_match (const char *symbol_search_name
,
13936 const lookup_name_info
&lookup_name
,
13937 completion_match_result
*comp_match_res
)
13939 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13942 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13945 do_exact_match (const char *symbol_search_name
,
13946 const lookup_name_info
&lookup_name
,
13947 completion_match_result
*comp_match_res
)
13949 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13952 /* Build the Ada lookup name for LOOKUP_NAME. */
13954 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13956 const std::string
&user_name
= lookup_name
.name ();
13958 if (user_name
[0] == '<')
13960 if (user_name
.back () == '>')
13961 m_encoded_name
= user_name
.substr (1, user_name
.size () - 2);
13963 m_encoded_name
= user_name
.substr (1, user_name
.size () - 1);
13964 m_encoded_p
= true;
13965 m_verbatim_p
= true;
13966 m_wild_match_p
= false;
13967 m_standard_p
= false;
13971 m_verbatim_p
= false;
13973 m_encoded_p
= user_name
.find ("__") != std::string::npos
;
13977 const char *folded
= ada_fold_name (user_name
.c_str ());
13978 const char *encoded
= ada_encode_1 (folded
, false);
13979 if (encoded
!= NULL
)
13980 m_encoded_name
= encoded
;
13982 m_encoded_name
= user_name
;
13985 m_encoded_name
= user_name
;
13987 /* Handle the 'package Standard' special case. See description
13988 of m_standard_p. */
13989 if (startswith (m_encoded_name
.c_str (), "standard__"))
13991 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13992 m_standard_p
= true;
13995 m_standard_p
= false;
13997 /* If the name contains a ".", then the user is entering a fully
13998 qualified entity name, and the match must not be done in wild
13999 mode. Similarly, if the user wants to complete what looks
14000 like an encoded name, the match must not be done in wild
14001 mode. Also, in the standard__ special case always do
14002 non-wild matching. */
14004 = (lookup_name
.match_type () != symbol_name_match_type::FULL
14007 && user_name
.find ('.') == std::string::npos
);
14011 /* symbol_name_matcher_ftype method for Ada. This only handles
14012 completion mode. */
14015 ada_symbol_name_matches (const char *symbol_search_name
,
14016 const lookup_name_info
&lookup_name
,
14017 completion_match_result
*comp_match_res
)
14019 return lookup_name
.ada ().matches (symbol_search_name
,
14020 lookup_name
.match_type (),
14024 /* A name matcher that matches the symbol name exactly, with
14028 literal_symbol_name_matcher (const char *symbol_search_name
,
14029 const lookup_name_info
&lookup_name
,
14030 completion_match_result
*comp_match_res
)
14032 const std::string
&name
= lookup_name
.name ();
14034 int cmp
= (lookup_name
.completion_mode ()
14035 ? strncmp (symbol_search_name
, name
.c_str (), name
.size ())
14036 : strcmp (symbol_search_name
, name
.c_str ()));
14039 if (comp_match_res
!= NULL
)
14040 comp_match_res
->set_match (symbol_search_name
);
14047 /* Implement the "la_get_symbol_name_matcher" language_defn method for
14050 static symbol_name_matcher_ftype
*
14051 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
14053 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
14054 return literal_symbol_name_matcher
;
14056 if (lookup_name
.completion_mode ())
14057 return ada_symbol_name_matches
;
14060 if (lookup_name
.ada ().wild_match_p ())
14061 return do_wild_match
;
14062 else if (lookup_name
.ada ().verbatim_p ())
14063 return do_exact_match
;
14065 return do_full_match
;
14069 /* Implement the "la_read_var_value" language_defn method for Ada. */
14071 static struct value
*
14072 ada_read_var_value (struct symbol
*var
, const struct block
*var_block
,
14073 struct frame_info
*frame
)
14075 /* The only case where default_read_var_value is not sufficient
14076 is when VAR is a renaming... */
14077 if (frame
!= nullptr)
14079 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
14080 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
14081 return ada_read_renaming_var_value (var
, frame_block
);
14084 /* This is a typical case where we expect the default_read_var_value
14085 function to work. */
14086 return default_read_var_value (var
, var_block
, frame
);
14089 static const char *ada_extensions
[] =
14091 ".adb", ".ads", ".a", ".ada", ".dg", NULL
14094 extern const struct language_defn ada_language_defn
= {
14095 "ada", /* Language name */
14099 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
14100 that's not quite what this means. */
14102 macro_expansion_no
,
14104 &ada_exp_descriptor
,
14107 ada_printchar
, /* Print a character constant */
14108 ada_printstr
, /* Function to print string constant */
14109 emit_char
, /* Function to print single char (not used) */
14110 ada_print_type
, /* Print a type using appropriate syntax */
14111 ada_print_typedef
, /* Print a typedef using appropriate syntax */
14112 ada_val_print
, /* Print a value using appropriate syntax */
14113 ada_value_print
, /* Print a top-level value */
14114 ada_read_var_value
, /* la_read_var_value */
14115 NULL
, /* Language specific skip_trampoline */
14116 NULL
, /* name_of_this */
14117 true, /* la_store_sym_names_in_linkage_form_p */
14118 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
14119 basic_lookup_transparent_type
, /* lookup_transparent_type */
14120 ada_la_decode
, /* Language specific symbol demangler */
14121 ada_sniff_from_mangled_name
,
14122 NULL
, /* Language specific
14123 class_name_from_physname */
14124 ada_op_print_tab
, /* expression operators for printing */
14125 0, /* c-style arrays */
14126 1, /* String lower bound */
14127 ada_get_gdb_completer_word_break_characters
,
14128 ada_collect_symbol_completion_matches
,
14129 ada_language_arch_info
,
14130 ada_print_array_index
,
14131 default_pass_by_reference
,
14133 ada_watch_location_expression
,
14134 ada_get_symbol_name_matcher
, /* la_get_symbol_name_matcher */
14135 ada_iterate_over_symbols
,
14136 default_search_name_hash
,
14140 ada_is_string_type
,
14141 "(...)" /* la_struct_too_deep_ellipsis */
14144 /* Command-list for the "set/show ada" prefix command. */
14145 static struct cmd_list_element
*set_ada_list
;
14146 static struct cmd_list_element
*show_ada_list
;
14148 /* Implement the "set ada" prefix command. */
14151 set_ada_command (const char *arg
, int from_tty
)
14153 printf_unfiltered (_(\
14154 "\"set ada\" must be followed by the name of a setting.\n"));
14155 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
14158 /* Implement the "show ada" prefix command. */
14161 show_ada_command (const char *args
, int from_tty
)
14163 cmd_show_list (show_ada_list
, from_tty
, "");
14167 initialize_ada_catchpoint_ops (void)
14169 struct breakpoint_ops
*ops
;
14171 initialize_breakpoint_ops ();
14173 ops
= &catch_exception_breakpoint_ops
;
14174 *ops
= bkpt_breakpoint_ops
;
14175 ops
->allocate_location
= allocate_location_exception
;
14176 ops
->re_set
= re_set_exception
;
14177 ops
->check_status
= check_status_exception
;
14178 ops
->print_it
= print_it_exception
;
14179 ops
->print_one
= print_one_exception
;
14180 ops
->print_mention
= print_mention_exception
;
14181 ops
->print_recreate
= print_recreate_exception
;
14183 ops
= &catch_exception_unhandled_breakpoint_ops
;
14184 *ops
= bkpt_breakpoint_ops
;
14185 ops
->allocate_location
= allocate_location_exception
;
14186 ops
->re_set
= re_set_exception
;
14187 ops
->check_status
= check_status_exception
;
14188 ops
->print_it
= print_it_exception
;
14189 ops
->print_one
= print_one_exception
;
14190 ops
->print_mention
= print_mention_exception
;
14191 ops
->print_recreate
= print_recreate_exception
;
14193 ops
= &catch_assert_breakpoint_ops
;
14194 *ops
= bkpt_breakpoint_ops
;
14195 ops
->allocate_location
= allocate_location_exception
;
14196 ops
->re_set
= re_set_exception
;
14197 ops
->check_status
= check_status_exception
;
14198 ops
->print_it
= print_it_exception
;
14199 ops
->print_one
= print_one_exception
;
14200 ops
->print_mention
= print_mention_exception
;
14201 ops
->print_recreate
= print_recreate_exception
;
14203 ops
= &catch_handlers_breakpoint_ops
;
14204 *ops
= bkpt_breakpoint_ops
;
14205 ops
->allocate_location
= allocate_location_exception
;
14206 ops
->re_set
= re_set_exception
;
14207 ops
->check_status
= check_status_exception
;
14208 ops
->print_it
= print_it_exception
;
14209 ops
->print_one
= print_one_exception
;
14210 ops
->print_mention
= print_mention_exception
;
14211 ops
->print_recreate
= print_recreate_exception
;
14214 /* This module's 'new_objfile' observer. */
14217 ada_new_objfile_observer (struct objfile
*objfile
)
14219 ada_clear_symbol_cache ();
14222 /* This module's 'free_objfile' observer. */
14225 ada_free_objfile_observer (struct objfile
*objfile
)
14227 ada_clear_symbol_cache ();
14231 _initialize_ada_language (void)
14233 initialize_ada_catchpoint_ops ();
14235 add_prefix_cmd ("ada", no_class
, set_ada_command
,
14236 _("Prefix command for changing Ada-specific settings."),
14237 &set_ada_list
, "set ada ", 0, &setlist
);
14239 add_prefix_cmd ("ada", no_class
, show_ada_command
,
14240 _("Generic command for showing Ada-specific settings."),
14241 &show_ada_list
, "show ada ", 0, &showlist
);
14243 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14244 &trust_pad_over_xvs
, _("\
14245 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14246 Show whether an optimization trusting PAD types over XVS types is activated."),
14248 This is related to the encoding used by the GNAT compiler. The debugger\n\
14249 should normally trust the contents of PAD types, but certain older versions\n\
14250 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14251 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14252 work around this bug. It is always safe to turn this option \"off\", but\n\
14253 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14254 this option to \"off\" unless necessary."),
14255 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14257 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14258 &print_signatures
, _("\
14259 Enable or disable the output of formal and return types for functions in the \
14260 overloads selection menu."), _("\
14261 Show whether the output of formal and return types for functions in the \
14262 overloads selection menu is activated."),
14263 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14265 add_catch_command ("exception", _("\
14266 Catch Ada exceptions, when raised.\n\
14267 Usage: catch exception [ARG] [if CONDITION]\n\
14268 Without any argument, stop when any Ada exception is raised.\n\
14269 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14270 being raised does not have a handler (and will therefore lead to the task's\n\
14272 Otherwise, the catchpoint only stops when the name of the exception being\n\
14273 raised is the same as ARG.\n\
14274 CONDITION is a boolean expression that is evaluated to see whether the\n\
14275 exception should cause a stop."),
14276 catch_ada_exception_command
,
14277 catch_ada_completer
,
14281 add_catch_command ("handlers", _("\
14282 Catch Ada exceptions, when handled.\n\
14283 Usage: catch handlers [ARG] [if CONDITION]\n\
14284 Without any argument, stop when any Ada exception is handled.\n\
14285 With an argument, catch only exceptions with the given name.\n\
14286 CONDITION is a boolean expression that is evaluated to see whether the\n\
14287 exception should cause a stop."),
14288 catch_ada_handlers_command
,
14289 catch_ada_completer
,
14292 add_catch_command ("assert", _("\
14293 Catch failed Ada assertions, when raised.\n\
14294 Usage: catch assert [if CONDITION]\n\
14295 CONDITION is a boolean expression that is evaluated to see whether the\n\
14296 exception should cause a stop."),
14297 catch_assert_command
,
14302 varsize_limit
= 65536;
14303 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14304 &varsize_limit
, _("\
14305 Set the maximum number of bytes allowed in a variable-size object."), _("\
14306 Show the maximum number of bytes allowed in a variable-size object."), _("\
14307 Attempts to access an object whose size is not a compile-time constant\n\
14308 and exceeds this limit will cause an error."),
14309 NULL
, NULL
, &setlist
, &showlist
);
14311 add_info ("exceptions", info_exceptions_command
,
14313 List all Ada exception names.\n\
14314 Usage: info exceptions [REGEXP]\n\
14315 If a regular expression is passed as an argument, only those matching\n\
14316 the regular expression are listed."));
14318 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
14319 _("Set Ada maintenance-related variables."),
14320 &maint_set_ada_cmdlist
, "maintenance set ada ",
14321 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14323 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
14324 _("Show Ada maintenance-related variables."),
14325 &maint_show_ada_cmdlist
, "maintenance show ada ",
14326 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14328 add_setshow_boolean_cmd
14329 ("ignore-descriptive-types", class_maintenance
,
14330 &ada_ignore_descriptive_types_p
,
14331 _("Set whether descriptive types generated by GNAT should be ignored."),
14332 _("Show whether descriptive types generated by GNAT should be ignored."),
14334 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14335 DWARF attribute."),
14336 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14338 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14339 NULL
, xcalloc
, xfree
);
14341 /* The ada-lang observers. */
14342 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14343 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14344 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);