1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2020 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
23 #include "gdb_regex.h"
28 #include "expression.h"
29 #include "parser-defs.h"
35 #include "breakpoint.h"
38 #include "gdb_obstack.h"
40 #include "completer.h"
47 #include "observable.h"
49 #include "typeprint.h"
50 #include "namespace.h"
51 #include "cli/cli-style.h"
54 #include "mi/mi-common.h"
55 #include "arch-utils.h"
56 #include "cli/cli-utils.h"
57 #include "gdbsupport/function-view.h"
58 #include "gdbsupport/byte-vector.h"
61 /* Define whether or not the C operator '/' truncates towards zero for
62 differently signed operands (truncation direction is undefined in C).
63 Copied from valarith.c. */
65 #ifndef TRUNCATION_TOWARDS_ZERO
66 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
69 static struct type
*desc_base_type (struct type
*);
71 static struct type
*desc_bounds_type (struct type
*);
73 static struct value
*desc_bounds (struct value
*);
75 static int fat_pntr_bounds_bitpos (struct type
*);
77 static int fat_pntr_bounds_bitsize (struct type
*);
79 static struct type
*desc_data_target_type (struct type
*);
81 static struct value
*desc_data (struct value
*);
83 static int fat_pntr_data_bitpos (struct type
*);
85 static int fat_pntr_data_bitsize (struct type
*);
87 static struct value
*desc_one_bound (struct value
*, int, int);
89 static int desc_bound_bitpos (struct type
*, int, int);
91 static int desc_bound_bitsize (struct type
*, int, int);
93 static struct type
*desc_index_type (struct type
*, int);
95 static int desc_arity (struct type
*);
97 static int ada_type_match (struct type
*, struct type
*, int);
99 static int ada_args_match (struct symbol
*, struct value
**, int);
101 static struct value
*make_array_descriptor (struct type
*, struct value
*);
103 static void ada_add_block_symbols (struct obstack
*,
104 const struct block
*,
105 const lookup_name_info
&lookup_name
,
106 domain_enum
, struct objfile
*);
108 static void ada_add_all_symbols (struct obstack
*, const struct block
*,
109 const lookup_name_info
&lookup_name
,
110 domain_enum
, int, int *);
112 static int is_nonfunction (struct block_symbol
*, int);
114 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
115 const struct block
*);
117 static int num_defns_collected (struct obstack
*);
119 static struct block_symbol
*defns_collected (struct obstack
*, int);
121 static struct value
*resolve_subexp (expression_up
*, int *, int,
123 innermost_block_tracker
*);
125 static void replace_operator_with_call (expression_up
*, int, int, int,
126 struct symbol
*, const struct block
*);
128 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
130 static const char *ada_op_name (enum exp_opcode
);
132 static const char *ada_decoded_op_name (enum exp_opcode
);
134 static int numeric_type_p (struct type
*);
136 static int integer_type_p (struct type
*);
138 static int scalar_type_p (struct type
*);
140 static int discrete_type_p (struct type
*);
142 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
145 static struct value
*evaluate_subexp_type (struct expression
*, int *);
147 static struct type
*ada_find_parallel_type_with_name (struct type
*,
150 static int is_dynamic_field (struct type
*, int);
152 static struct type
*to_fixed_variant_branch_type (struct type
*,
154 CORE_ADDR
, struct value
*);
156 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
158 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
160 static struct type
*to_static_fixed_type (struct type
*);
161 static struct type
*static_unwrap_type (struct type
*type
);
163 static struct value
*unwrap_value (struct value
*);
165 static struct type
*constrained_packed_array_type (struct type
*, long *);
167 static struct type
*decode_constrained_packed_array_type (struct type
*);
169 static long decode_packed_array_bitsize (struct type
*);
171 static struct value
*decode_constrained_packed_array (struct value
*);
173 static int ada_is_packed_array_type (struct type
*);
175 static int ada_is_unconstrained_packed_array_type (struct type
*);
177 static struct value
*value_subscript_packed (struct value
*, int,
180 static struct value
*coerce_unspec_val_to_type (struct value
*,
183 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
185 static int equiv_types (struct type
*, struct type
*);
187 static int is_name_suffix (const char *);
189 static int advance_wild_match (const char **, const char *, int);
191 static bool wild_match (const char *name
, const char *patn
);
193 static struct value
*ada_coerce_ref (struct value
*);
195 static LONGEST
pos_atr (struct value
*);
197 static struct value
*value_pos_atr (struct type
*, struct value
*);
199 static struct value
*value_val_atr (struct type
*, struct value
*);
201 static struct symbol
*standard_lookup (const char *, const struct block
*,
204 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
207 static 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 static 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 V points to an array of S objects, make sure that it contains at
540 least M objects, updating V and S as necessary. */
542 #define GROW_VECT(v, s, m) \
543 if ((s) < (m)) (v) = (char *) grow_vect (v, &(s), m, sizeof *(v));
545 /* Assuming VECT points to an array of *SIZE objects of size
546 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
547 updating *SIZE as necessary and returning the (new) array. */
550 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
552 if (*size
< min_size
)
555 if (*size
< min_size
)
557 vect
= xrealloc (vect
, *size
* element_size
);
562 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
563 suffix of FIELD_NAME beginning "___". */
566 field_name_match (const char *field_name
, const char *target
)
568 int len
= strlen (target
);
571 (strncmp (field_name
, target
, len
) == 0
572 && (field_name
[len
] == '\0'
573 || (startswith (field_name
+ len
, "___")
574 && strcmp (field_name
+ strlen (field_name
) - 6,
579 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
580 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
581 and return its index. This function also handles fields whose name
582 have ___ suffixes because the compiler sometimes alters their name
583 by adding such a suffix to represent fields with certain constraints.
584 If the field could not be found, return a negative number if
585 MAYBE_MISSING is set. Otherwise raise an error. */
588 ada_get_field_index (const struct type
*type
, const char *field_name
,
592 struct type
*struct_type
= check_typedef ((struct type
*) type
);
594 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
595 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
599 error (_("Unable to find field %s in struct %s. Aborting"),
600 field_name
, TYPE_NAME (struct_type
));
605 /* The length of the prefix of NAME prior to any "___" suffix. */
608 ada_name_prefix_len (const char *name
)
614 const char *p
= strstr (name
, "___");
617 return strlen (name
);
623 /* Return non-zero if SUFFIX is a suffix of STR.
624 Return zero if STR is null. */
627 is_suffix (const char *str
, const char *suffix
)
634 len2
= strlen (suffix
);
635 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
638 /* The contents of value VAL, treated as a value of type TYPE. The
639 result is an lval in memory if VAL is. */
641 static struct value
*
642 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
644 type
= ada_check_typedef (type
);
645 if (value_type (val
) == type
)
649 struct value
*result
;
651 /* Make sure that the object size is not unreasonable before
652 trying to allocate some memory for it. */
653 ada_ensure_varsize_limit (type
);
656 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
657 result
= allocate_value_lazy (type
);
660 result
= allocate_value (type
);
661 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
663 set_value_component_location (result
, val
);
664 set_value_bitsize (result
, value_bitsize (val
));
665 set_value_bitpos (result
, value_bitpos (val
));
666 if (VALUE_LVAL (result
) == lval_memory
)
667 set_value_address (result
, value_address (val
));
672 static const gdb_byte
*
673 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
678 return valaddr
+ offset
;
682 cond_offset_target (CORE_ADDR address
, long offset
)
687 return address
+ offset
;
690 /* Issue a warning (as for the definition of warning in utils.c, but
691 with exactly one argument rather than ...), unless the limit on the
692 number of warnings has passed during the evaluation of the current
695 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
696 provided by "complaint". */
697 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
700 lim_warning (const char *format
, ...)
704 va_start (args
, format
);
705 warnings_issued
+= 1;
706 if (warnings_issued
<= warning_limit
)
707 vwarning (format
, args
);
712 /* Issue an error if the size of an object of type T is unreasonable,
713 i.e. if it would be a bad idea to allocate a value of this type in
717 ada_ensure_varsize_limit (const struct type
*type
)
719 if (TYPE_LENGTH (type
) > varsize_limit
)
720 error (_("object size is larger than varsize-limit"));
723 /* Maximum value of a SIZE-byte signed integer type. */
725 max_of_size (int size
)
727 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
729 return top_bit
| (top_bit
- 1);
732 /* Minimum value of a SIZE-byte signed integer type. */
734 min_of_size (int size
)
736 return -max_of_size (size
) - 1;
739 /* Maximum value of a SIZE-byte unsigned integer type. */
741 umax_of_size (int size
)
743 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
745 return top_bit
| (top_bit
- 1);
748 /* Maximum value of integral type T, as a signed quantity. */
750 max_of_type (struct type
*t
)
752 if (TYPE_UNSIGNED (t
))
753 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
755 return max_of_size (TYPE_LENGTH (t
));
758 /* Minimum value of integral type T, as a signed quantity. */
760 min_of_type (struct type
*t
)
762 if (TYPE_UNSIGNED (t
))
765 return min_of_size (TYPE_LENGTH (t
));
768 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
770 ada_discrete_type_high_bound (struct type
*type
)
772 type
= resolve_dynamic_type (type
, NULL
, 0);
773 switch (TYPE_CODE (type
))
775 case TYPE_CODE_RANGE
:
776 return TYPE_HIGH_BOUND (type
);
778 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
783 return max_of_type (type
);
785 error (_("Unexpected type in ada_discrete_type_high_bound."));
789 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
791 ada_discrete_type_low_bound (struct type
*type
)
793 type
= resolve_dynamic_type (type
, NULL
, 0);
794 switch (TYPE_CODE (type
))
796 case TYPE_CODE_RANGE
:
797 return TYPE_LOW_BOUND (type
);
799 return TYPE_FIELD_ENUMVAL (type
, 0);
804 return min_of_type (type
);
806 error (_("Unexpected type in ada_discrete_type_low_bound."));
810 /* The identity on non-range types. For range types, the underlying
811 non-range scalar type. */
814 get_base_type (struct type
*type
)
816 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
818 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
820 type
= TYPE_TARGET_TYPE (type
);
825 /* Return a decoded version of the given VALUE. This means returning
826 a value whose type is obtained by applying all the GNAT-specific
827 encodings, making the resulting type a static but standard description
828 of the initial type. */
831 ada_get_decoded_value (struct value
*value
)
833 struct type
*type
= ada_check_typedef (value_type (value
));
835 if (ada_is_array_descriptor_type (type
)
836 || (ada_is_constrained_packed_array_type (type
)
837 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
839 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
840 value
= ada_coerce_to_simple_array_ptr (value
);
842 value
= ada_coerce_to_simple_array (value
);
845 value
= ada_to_fixed_value (value
);
850 /* Same as ada_get_decoded_value, but with the given TYPE.
851 Because there is no associated actual value for this type,
852 the resulting type might be a best-effort approximation in
853 the case of dynamic types. */
856 ada_get_decoded_type (struct type
*type
)
858 type
= to_static_fixed_type (type
);
859 if (ada_is_constrained_packed_array_type (type
))
860 type
= ada_coerce_to_simple_array_type (type
);
866 /* Language Selection */
868 /* If the main program is in Ada, return language_ada, otherwise return LANG
869 (the main program is in Ada iif the adainit symbol is found). */
872 ada_update_initial_language (enum language lang
)
874 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
880 /* If the main procedure is written in Ada, then return its name.
881 The result is good until the next call. Return NULL if the main
882 procedure doesn't appear to be in Ada. */
887 struct bound_minimal_symbol msym
;
888 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
890 /* For Ada, the name of the main procedure is stored in a specific
891 string constant, generated by the binder. Look for that symbol,
892 extract its address, and then read that string. If we didn't find
893 that string, then most probably the main procedure is not written
895 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
897 if (msym
.minsym
!= NULL
)
899 CORE_ADDR main_program_name_addr
;
902 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
903 if (main_program_name_addr
== 0)
904 error (_("Invalid address for Ada main program name."));
906 target_read_string (main_program_name_addr
, &main_program_name
,
911 return main_program_name
.get ();
914 /* The main procedure doesn't seem to be in Ada. */
920 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
923 const struct ada_opname_map ada_opname_table
[] = {
924 {"Oadd", "\"+\"", BINOP_ADD
},
925 {"Osubtract", "\"-\"", BINOP_SUB
},
926 {"Omultiply", "\"*\"", BINOP_MUL
},
927 {"Odivide", "\"/\"", BINOP_DIV
},
928 {"Omod", "\"mod\"", BINOP_MOD
},
929 {"Orem", "\"rem\"", BINOP_REM
},
930 {"Oexpon", "\"**\"", BINOP_EXP
},
931 {"Olt", "\"<\"", BINOP_LESS
},
932 {"Ole", "\"<=\"", BINOP_LEQ
},
933 {"Ogt", "\">\"", BINOP_GTR
},
934 {"Oge", "\">=\"", BINOP_GEQ
},
935 {"Oeq", "\"=\"", BINOP_EQUAL
},
936 {"One", "\"/=\"", BINOP_NOTEQUAL
},
937 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
938 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
939 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
940 {"Oconcat", "\"&\"", BINOP_CONCAT
},
941 {"Oabs", "\"abs\"", UNOP_ABS
},
942 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
943 {"Oadd", "\"+\"", UNOP_PLUS
},
944 {"Osubtract", "\"-\"", UNOP_NEG
},
948 /* The "encoded" form of DECODED, according to GNAT conventions. The
949 result is valid until the next call to ada_encode. If
950 THROW_ERRORS, throw an error if invalid operator name is found.
951 Otherwise, return NULL in that case. */
954 ada_encode_1 (const char *decoded
, bool throw_errors
)
956 static char *encoding_buffer
= NULL
;
957 static size_t encoding_buffer_size
= 0;
964 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
965 2 * strlen (decoded
) + 10);
968 for (p
= decoded
; *p
!= '\0'; p
+= 1)
972 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
977 const struct ada_opname_map
*mapping
;
979 for (mapping
= ada_opname_table
;
980 mapping
->encoded
!= NULL
981 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
983 if (mapping
->encoded
== NULL
)
986 error (_("invalid Ada operator name: %s"), p
);
990 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
991 k
+= strlen (mapping
->encoded
);
996 encoding_buffer
[k
] = *p
;
1001 encoding_buffer
[k
] = '\0';
1002 return encoding_buffer
;
1005 /* The "encoded" form of DECODED, according to GNAT conventions.
1006 The result is valid until the next call to ada_encode. */
1009 ada_encode (const char *decoded
)
1011 return ada_encode_1 (decoded
, true);
1014 /* Return NAME folded to lower case, or, if surrounded by single
1015 quotes, unfolded, but with the quotes stripped away. Result good
1019 ada_fold_name (const char *name
)
1021 static char *fold_buffer
= NULL
;
1022 static size_t fold_buffer_size
= 0;
1024 int len
= strlen (name
);
1025 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1027 if (name
[0] == '\'')
1029 strncpy (fold_buffer
, name
+ 1, len
- 2);
1030 fold_buffer
[len
- 2] = '\000';
1036 for (i
= 0; i
<= len
; i
+= 1)
1037 fold_buffer
[i
] = tolower (name
[i
]);
1043 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1046 is_lower_alphanum (const char c
)
1048 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1051 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1052 This function saves in LEN the length of that same symbol name but
1053 without either of these suffixes:
1059 These are suffixes introduced by the compiler for entities such as
1060 nested subprogram for instance, in order to avoid name clashes.
1061 They do not serve any purpose for the debugger. */
1064 ada_remove_trailing_digits (const char *encoded
, int *len
)
1066 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1070 while (i
> 0 && isdigit (encoded
[i
]))
1072 if (i
>= 0 && encoded
[i
] == '.')
1074 else if (i
>= 0 && encoded
[i
] == '$')
1076 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1078 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1083 /* Remove the suffix introduced by the compiler for protected object
1087 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1089 /* Remove trailing N. */
1091 /* Protected entry subprograms are broken into two
1092 separate subprograms: The first one is unprotected, and has
1093 a 'N' suffix; the second is the protected version, and has
1094 the 'P' suffix. The second calls the first one after handling
1095 the protection. Since the P subprograms are internally generated,
1096 we leave these names undecoded, giving the user a clue that this
1097 entity is internal. */
1100 && encoded
[*len
- 1] == 'N'
1101 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1105 /* If ENCODED follows the GNAT entity encoding conventions, then return
1106 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1107 replaced by ENCODED. */
1110 ada_decode (const char *encoded
)
1116 std::string decoded
;
1118 /* With function descriptors on PPC64, the value of a symbol named
1119 ".FN", if it exists, is the entry point of the function "FN". */
1120 if (encoded
[0] == '.')
1123 /* The name of the Ada main procedure starts with "_ada_".
1124 This prefix is not part of the decoded name, so skip this part
1125 if we see this prefix. */
1126 if (startswith (encoded
, "_ada_"))
1129 /* If the name starts with '_', then it is not a properly encoded
1130 name, so do not attempt to decode it. Similarly, if the name
1131 starts with '<', the name should not be decoded. */
1132 if (encoded
[0] == '_' || encoded
[0] == '<')
1135 len0
= strlen (encoded
);
1137 ada_remove_trailing_digits (encoded
, &len0
);
1138 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1140 /* Remove the ___X.* suffix if present. Do not forget to verify that
1141 the suffix is located before the current "end" of ENCODED. We want
1142 to avoid re-matching parts of ENCODED that have previously been
1143 marked as discarded (by decrementing LEN0). */
1144 p
= strstr (encoded
, "___");
1145 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1153 /* Remove any trailing TKB suffix. It tells us that this symbol
1154 is for the body of a task, but that information does not actually
1155 appear in the decoded name. */
1157 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1160 /* Remove any trailing TB suffix. The TB suffix is slightly different
1161 from the TKB suffix because it is used for non-anonymous task
1164 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1167 /* Remove trailing "B" suffixes. */
1168 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1170 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1173 /* Make decoded big enough for possible expansion by operator name. */
1175 decoded
.resize (2 * len0
+ 1, 'X');
1177 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1179 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1182 while ((i
>= 0 && isdigit (encoded
[i
]))
1183 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1185 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1187 else if (encoded
[i
] == '$')
1191 /* The first few characters that are not alphabetic are not part
1192 of any encoding we use, so we can copy them over verbatim. */
1194 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1195 decoded
[j
] = encoded
[i
];
1200 /* Is this a symbol function? */
1201 if (at_start_name
&& encoded
[i
] == 'O')
1205 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1207 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1208 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1210 && !isalnum (encoded
[i
+ op_len
]))
1212 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1215 j
+= strlen (ada_opname_table
[k
].decoded
);
1219 if (ada_opname_table
[k
].encoded
!= NULL
)
1224 /* Replace "TK__" with "__", which will eventually be translated
1225 into "." (just below). */
1227 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1230 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1231 be translated into "." (just below). These are internal names
1232 generated for anonymous blocks inside which our symbol is nested. */
1234 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1235 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1236 && isdigit (encoded
[i
+4]))
1240 while (k
< len0
&& isdigit (encoded
[k
]))
1241 k
++; /* Skip any extra digit. */
1243 /* Double-check that the "__B_{DIGITS}+" sequence we found
1244 is indeed followed by "__". */
1245 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1249 /* Remove _E{DIGITS}+[sb] */
1251 /* Just as for protected object subprograms, there are 2 categories
1252 of subprograms created by the compiler for each entry. The first
1253 one implements the actual entry code, and has a suffix following
1254 the convention above; the second one implements the barrier and
1255 uses the same convention as above, except that the 'E' is replaced
1258 Just as above, we do not decode the name of barrier functions
1259 to give the user a clue that the code he is debugging has been
1260 internally generated. */
1262 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1263 && isdigit (encoded
[i
+2]))
1267 while (k
< len0
&& isdigit (encoded
[k
]))
1271 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1274 /* Just as an extra precaution, make sure that if this
1275 suffix is followed by anything else, it is a '_'.
1276 Otherwise, we matched this sequence by accident. */
1278 || (k
< len0
&& encoded
[k
] == '_'))
1283 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1284 the GNAT front-end in protected object subprograms. */
1287 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1289 /* Backtrack a bit up until we reach either the begining of
1290 the encoded name, or "__". Make sure that we only find
1291 digits or lowercase characters. */
1292 const char *ptr
= encoded
+ i
- 1;
1294 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1297 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1301 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1303 /* This is a X[bn]* sequence not separated from the previous
1304 part of the name with a non-alpha-numeric character (in other
1305 words, immediately following an alpha-numeric character), then
1306 verify that it is placed at the end of the encoded name. If
1307 not, then the encoding is not valid and we should abort the
1308 decoding. Otherwise, just skip it, it is used in body-nested
1312 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1316 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1318 /* Replace '__' by '.'. */
1326 /* It's a character part of the decoded name, so just copy it
1328 decoded
[j
] = encoded
[i
];
1335 /* Decoded names should never contain any uppercase character.
1336 Double-check this, and abort the decoding if we find one. */
1338 for (i
= 0; i
< decoded
.length(); ++i
)
1339 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1345 if (encoded
[0] == '<')
1348 decoded
= '<' + std::string(encoded
) + '>';
1353 /* Table for keeping permanent unique copies of decoded names. Once
1354 allocated, names in this table are never released. While this is a
1355 storage leak, it should not be significant unless there are massive
1356 changes in the set of decoded names in successive versions of a
1357 symbol table loaded during a single session. */
1358 static struct htab
*decoded_names_store
;
1360 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1361 in the language-specific part of GSYMBOL, if it has not been
1362 previously computed. Tries to save the decoded name in the same
1363 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1364 in any case, the decoded symbol has a lifetime at least that of
1366 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1367 const, but nevertheless modified to a semantically equivalent form
1368 when a decoded name is cached in it. */
1371 ada_decode_symbol (const struct general_symbol_info
*arg
)
1373 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1374 const char **resultp
=
1375 &gsymbol
->language_specific
.demangled_name
;
1377 if (!gsymbol
->ada_mangled
)
1379 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1380 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1382 gsymbol
->ada_mangled
= 1;
1384 if (obstack
!= NULL
)
1385 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1388 /* Sometimes, we can't find a corresponding objfile, in
1389 which case, we put the result on the heap. Since we only
1390 decode when needed, we hope this usually does not cause a
1391 significant memory leak (FIXME). */
1393 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1394 decoded
.c_str (), INSERT
);
1397 *slot
= xstrdup (decoded
.c_str ());
1406 ada_la_decode (const char *encoded
, int options
)
1408 return xstrdup (ada_decode (encoded
).c_str ());
1411 /* Implement la_sniff_from_mangled_name for Ada. */
1414 ada_sniff_from_mangled_name (const char *mangled
, char **out
)
1416 std::string demangled
= ada_decode (mangled
);
1420 if (demangled
!= mangled
&& demangled
[0] != '<')
1422 /* Set the gsymbol language to Ada, but still return 0.
1423 Two reasons for that:
1425 1. For Ada, we prefer computing the symbol's decoded name
1426 on the fly rather than pre-compute it, in order to save
1427 memory (Ada projects are typically very large).
1429 2. There are some areas in the definition of the GNAT
1430 encoding where, with a bit of bad luck, we might be able
1431 to decode a non-Ada symbol, generating an incorrect
1432 demangled name (Eg: names ending with "TB" for instance
1433 are identified as task bodies and so stripped from
1434 the decoded name returned).
1436 Returning 1, here, but not setting *DEMANGLED, helps us get a
1437 little bit of the best of both worlds. Because we're last,
1438 we should not affect any of the other languages that were
1439 able to demangle the symbol before us; we get to correctly
1440 tag Ada symbols as such; and even if we incorrectly tagged a
1441 non-Ada symbol, which should be rare, any routing through the
1442 Ada language should be transparent (Ada tries to behave much
1443 like C/C++ with non-Ada symbols). */
1454 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1455 generated by the GNAT compiler to describe the index type used
1456 for each dimension of an array, check whether it follows the latest
1457 known encoding. If not, fix it up to conform to the latest encoding.
1458 Otherwise, do nothing. This function also does nothing if
1459 INDEX_DESC_TYPE is NULL.
1461 The GNAT encoding used to describe the array index type evolved a bit.
1462 Initially, the information would be provided through the name of each
1463 field of the structure type only, while the type of these fields was
1464 described as unspecified and irrelevant. The debugger was then expected
1465 to perform a global type lookup using the name of that field in order
1466 to get access to the full index type description. Because these global
1467 lookups can be very expensive, the encoding was later enhanced to make
1468 the global lookup unnecessary by defining the field type as being
1469 the full index type description.
1471 The purpose of this routine is to allow us to support older versions
1472 of the compiler by detecting the use of the older encoding, and by
1473 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1474 we essentially replace each field's meaningless type by the associated
1478 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1482 if (index_desc_type
== NULL
)
1484 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1486 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1487 to check one field only, no need to check them all). If not, return
1490 If our INDEX_DESC_TYPE was generated using the older encoding,
1491 the field type should be a meaningless integer type whose name
1492 is not equal to the field name. */
1493 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1494 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1495 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1498 /* Fixup each field of INDEX_DESC_TYPE. */
1499 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1501 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1502 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1505 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1509 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1511 static const char *bound_name
[] = {
1512 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1513 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1516 /* Maximum number of array dimensions we are prepared to handle. */
1518 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1521 /* The desc_* routines return primitive portions of array descriptors
1524 /* The descriptor or array type, if any, indicated by TYPE; removes
1525 level of indirection, if needed. */
1527 static struct type
*
1528 desc_base_type (struct type
*type
)
1532 type
= ada_check_typedef (type
);
1533 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1534 type
= ada_typedef_target_type (type
);
1537 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1538 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1539 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1544 /* True iff TYPE indicates a "thin" array pointer type. */
1547 is_thin_pntr (struct type
*type
)
1550 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1551 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1554 /* The descriptor type for thin pointer type TYPE. */
1556 static struct type
*
1557 thin_descriptor_type (struct type
*type
)
1559 struct type
*base_type
= desc_base_type (type
);
1561 if (base_type
== NULL
)
1563 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1567 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1569 if (alt_type
== NULL
)
1576 /* A pointer to the array data for thin-pointer value VAL. */
1578 static struct value
*
1579 thin_data_pntr (struct value
*val
)
1581 struct type
*type
= ada_check_typedef (value_type (val
));
1582 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1584 data_type
= lookup_pointer_type (data_type
);
1586 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1587 return value_cast (data_type
, value_copy (val
));
1589 return value_from_longest (data_type
, value_address (val
));
1592 /* True iff TYPE indicates a "thick" array pointer type. */
1595 is_thick_pntr (struct type
*type
)
1597 type
= desc_base_type (type
);
1598 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1599 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1602 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1603 pointer to one, the type of its bounds data; otherwise, NULL. */
1605 static struct type
*
1606 desc_bounds_type (struct type
*type
)
1610 type
= desc_base_type (type
);
1614 else if (is_thin_pntr (type
))
1616 type
= thin_descriptor_type (type
);
1619 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1621 return ada_check_typedef (r
);
1623 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1625 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1627 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1632 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1633 one, a pointer to its bounds data. Otherwise NULL. */
1635 static struct value
*
1636 desc_bounds (struct value
*arr
)
1638 struct type
*type
= ada_check_typedef (value_type (arr
));
1640 if (is_thin_pntr (type
))
1642 struct type
*bounds_type
=
1643 desc_bounds_type (thin_descriptor_type (type
));
1646 if (bounds_type
== NULL
)
1647 error (_("Bad GNAT array descriptor"));
1649 /* NOTE: The following calculation is not really kosher, but
1650 since desc_type is an XVE-encoded type (and shouldn't be),
1651 the correct calculation is a real pain. FIXME (and fix GCC). */
1652 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1653 addr
= value_as_long (arr
);
1655 addr
= value_address (arr
);
1658 value_from_longest (lookup_pointer_type (bounds_type
),
1659 addr
- TYPE_LENGTH (bounds_type
));
1662 else if (is_thick_pntr (type
))
1664 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1665 _("Bad GNAT array descriptor"));
1666 struct type
*p_bounds_type
= value_type (p_bounds
);
1669 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1671 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1673 if (TYPE_STUB (target_type
))
1674 p_bounds
= value_cast (lookup_pointer_type
1675 (ada_check_typedef (target_type
)),
1679 error (_("Bad GNAT array descriptor"));
1687 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1688 position of the field containing the address of the bounds data. */
1691 fat_pntr_bounds_bitpos (struct type
*type
)
1693 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1696 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1697 size of the field containing the address of the bounds data. */
1700 fat_pntr_bounds_bitsize (struct type
*type
)
1702 type
= desc_base_type (type
);
1704 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1705 return TYPE_FIELD_BITSIZE (type
, 1);
1707 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1710 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1711 pointer to one, the type of its array data (a array-with-no-bounds type);
1712 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1715 static struct type
*
1716 desc_data_target_type (struct type
*type
)
1718 type
= desc_base_type (type
);
1720 /* NOTE: The following is bogus; see comment in desc_bounds. */
1721 if (is_thin_pntr (type
))
1722 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1723 else if (is_thick_pntr (type
))
1725 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1728 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1729 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1735 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1738 static struct value
*
1739 desc_data (struct value
*arr
)
1741 struct type
*type
= value_type (arr
);
1743 if (is_thin_pntr (type
))
1744 return thin_data_pntr (arr
);
1745 else if (is_thick_pntr (type
))
1746 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1747 _("Bad GNAT array descriptor"));
1753 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1754 position of the field containing the address of the data. */
1757 fat_pntr_data_bitpos (struct type
*type
)
1759 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1762 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1763 size of the field containing the address of the data. */
1766 fat_pntr_data_bitsize (struct type
*type
)
1768 type
= desc_base_type (type
);
1770 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1771 return TYPE_FIELD_BITSIZE (type
, 0);
1773 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1776 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1777 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1778 bound, if WHICH is 1. The first bound is I=1. */
1780 static struct value
*
1781 desc_one_bound (struct value
*bounds
, int i
, int which
)
1783 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1784 _("Bad GNAT array descriptor bounds"));
1787 /* If BOUNDS is an array-bounds structure type, return the bit position
1788 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1789 bound, if WHICH is 1. The first bound is I=1. */
1792 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1794 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1797 /* If BOUNDS is an array-bounds structure type, return the bit field size
1798 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1799 bound, if WHICH is 1. The first bound is I=1. */
1802 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1804 type
= desc_base_type (type
);
1806 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1807 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1809 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1812 /* If TYPE is the type of an array-bounds structure, the type of its
1813 Ith bound (numbering from 1). Otherwise, NULL. */
1815 static struct type
*
1816 desc_index_type (struct type
*type
, int i
)
1818 type
= desc_base_type (type
);
1820 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1821 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1826 /* The number of index positions in the array-bounds type TYPE.
1827 Return 0 if TYPE is NULL. */
1830 desc_arity (struct type
*type
)
1832 type
= desc_base_type (type
);
1835 return TYPE_NFIELDS (type
) / 2;
1839 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1840 an array descriptor type (representing an unconstrained array
1844 ada_is_direct_array_type (struct type
*type
)
1848 type
= ada_check_typedef (type
);
1849 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1850 || ada_is_array_descriptor_type (type
));
1853 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1857 ada_is_array_type (struct type
*type
)
1860 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1861 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1862 type
= TYPE_TARGET_TYPE (type
);
1863 return ada_is_direct_array_type (type
);
1866 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1869 ada_is_simple_array_type (struct type
*type
)
1873 type
= ada_check_typedef (type
);
1874 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1875 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1876 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1877 == TYPE_CODE_ARRAY
));
1880 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1883 ada_is_array_descriptor_type (struct type
*type
)
1885 struct type
*data_type
= desc_data_target_type (type
);
1889 type
= ada_check_typedef (type
);
1890 return (data_type
!= NULL
1891 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1892 && desc_arity (desc_bounds_type (type
)) > 0);
1895 /* Non-zero iff type is a partially mal-formed GNAT array
1896 descriptor. FIXME: This is to compensate for some problems with
1897 debugging output from GNAT. Re-examine periodically to see if it
1901 ada_is_bogus_array_descriptor (struct type
*type
)
1905 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1906 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1907 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1908 && !ada_is_array_descriptor_type (type
);
1912 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1913 (fat pointer) returns the type of the array data described---specifically,
1914 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1915 in from the descriptor; otherwise, they are left unspecified. If
1916 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1917 returns NULL. The result is simply the type of ARR if ARR is not
1920 static struct type
*
1921 ada_type_of_array (struct value
*arr
, int bounds
)
1923 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1924 return decode_constrained_packed_array_type (value_type (arr
));
1926 if (!ada_is_array_descriptor_type (value_type (arr
)))
1927 return value_type (arr
);
1931 struct type
*array_type
=
1932 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1934 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1935 TYPE_FIELD_BITSIZE (array_type
, 0) =
1936 decode_packed_array_bitsize (value_type (arr
));
1942 struct type
*elt_type
;
1944 struct value
*descriptor
;
1946 elt_type
= ada_array_element_type (value_type (arr
), -1);
1947 arity
= ada_array_arity (value_type (arr
));
1949 if (elt_type
== NULL
|| arity
== 0)
1950 return ada_check_typedef (value_type (arr
));
1952 descriptor
= desc_bounds (arr
);
1953 if (value_as_long (descriptor
) == 0)
1957 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1958 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1959 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1960 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1963 create_static_range_type (range_type
, value_type (low
),
1964 longest_to_int (value_as_long (low
)),
1965 longest_to_int (value_as_long (high
)));
1966 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1968 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1970 /* We need to store the element packed bitsize, as well as
1971 recompute the array size, because it was previously
1972 computed based on the unpacked element size. */
1973 LONGEST lo
= value_as_long (low
);
1974 LONGEST hi
= value_as_long (high
);
1976 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1977 decode_packed_array_bitsize (value_type (arr
));
1978 /* If the array has no element, then the size is already
1979 zero, and does not need to be recomputed. */
1983 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1985 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1990 return lookup_pointer_type (elt_type
);
1994 /* If ARR does not represent an array, returns ARR unchanged.
1995 Otherwise, returns either a standard GDB array with bounds set
1996 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1997 GDB array. Returns NULL if ARR is a null fat pointer. */
2000 ada_coerce_to_simple_array_ptr (struct value
*arr
)
2002 if (ada_is_array_descriptor_type (value_type (arr
)))
2004 struct type
*arrType
= ada_type_of_array (arr
, 1);
2006 if (arrType
== NULL
)
2008 return value_cast (arrType
, value_copy (desc_data (arr
)));
2010 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2011 return decode_constrained_packed_array (arr
);
2016 /* If ARR does not represent an array, returns ARR unchanged.
2017 Otherwise, returns a standard GDB array describing ARR (which may
2018 be ARR itself if it already is in the proper form). */
2021 ada_coerce_to_simple_array (struct value
*arr
)
2023 if (ada_is_array_descriptor_type (value_type (arr
)))
2025 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2028 error (_("Bounds unavailable for null array pointer."));
2029 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
2030 return value_ind (arrVal
);
2032 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2033 return decode_constrained_packed_array (arr
);
2038 /* If TYPE represents a GNAT array type, return it translated to an
2039 ordinary GDB array type (possibly with BITSIZE fields indicating
2040 packing). For other types, is the identity. */
2043 ada_coerce_to_simple_array_type (struct type
*type
)
2045 if (ada_is_constrained_packed_array_type (type
))
2046 return decode_constrained_packed_array_type (type
);
2048 if (ada_is_array_descriptor_type (type
))
2049 return ada_check_typedef (desc_data_target_type (type
));
2054 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2057 ada_is_packed_array_type (struct type
*type
)
2061 type
= desc_base_type (type
);
2062 type
= ada_check_typedef (type
);
2064 ada_type_name (type
) != NULL
2065 && strstr (ada_type_name (type
), "___XP") != NULL
;
2068 /* Non-zero iff TYPE represents a standard GNAT constrained
2069 packed-array type. */
2072 ada_is_constrained_packed_array_type (struct type
*type
)
2074 return ada_is_packed_array_type (type
)
2075 && !ada_is_array_descriptor_type (type
);
2078 /* Non-zero iff TYPE represents an array descriptor for a
2079 unconstrained packed-array type. */
2082 ada_is_unconstrained_packed_array_type (struct type
*type
)
2084 return ada_is_packed_array_type (type
)
2085 && ada_is_array_descriptor_type (type
);
2088 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2089 return the size of its elements in bits. */
2092 decode_packed_array_bitsize (struct type
*type
)
2094 const char *raw_name
;
2098 /* Access to arrays implemented as fat pointers are encoded as a typedef
2099 of the fat pointer type. We need the name of the fat pointer type
2100 to do the decoding, so strip the typedef layer. */
2101 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2102 type
= ada_typedef_target_type (type
);
2104 raw_name
= ada_type_name (ada_check_typedef (type
));
2106 raw_name
= ada_type_name (desc_base_type (type
));
2111 tail
= strstr (raw_name
, "___XP");
2112 gdb_assert (tail
!= NULL
);
2114 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2117 (_("could not understand bit size information on packed array"));
2124 /* Given that TYPE is a standard GDB array type with all bounds filled
2125 in, and that the element size of its ultimate scalar constituents
2126 (that is, either its elements, or, if it is an array of arrays, its
2127 elements' elements, etc.) is *ELT_BITS, return an identical type,
2128 but with the bit sizes of its elements (and those of any
2129 constituent arrays) recorded in the BITSIZE components of its
2130 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2133 Note that, for arrays whose index type has an XA encoding where
2134 a bound references a record discriminant, getting that discriminant,
2135 and therefore the actual value of that bound, is not possible
2136 because none of the given parameters gives us access to the record.
2137 This function assumes that it is OK in the context where it is being
2138 used to return an array whose bounds are still dynamic and where
2139 the length is arbitrary. */
2141 static struct type
*
2142 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2144 struct type
*new_elt_type
;
2145 struct type
*new_type
;
2146 struct type
*index_type_desc
;
2147 struct type
*index_type
;
2148 LONGEST low_bound
, high_bound
;
2150 type
= ada_check_typedef (type
);
2151 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2154 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2155 if (index_type_desc
)
2156 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2159 index_type
= TYPE_INDEX_TYPE (type
);
2161 new_type
= alloc_type_copy (type
);
2163 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2165 create_array_type (new_type
, new_elt_type
, index_type
);
2166 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2167 TYPE_NAME (new_type
) = ada_type_name (type
);
2169 if ((TYPE_CODE (check_typedef (index_type
)) == TYPE_CODE_RANGE
2170 && is_dynamic_type (check_typedef (index_type
)))
2171 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2172 low_bound
= high_bound
= 0;
2173 if (high_bound
< low_bound
)
2174 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2177 *elt_bits
*= (high_bound
- low_bound
+ 1);
2178 TYPE_LENGTH (new_type
) =
2179 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2182 TYPE_FIXED_INSTANCE (new_type
) = 1;
2186 /* The array type encoded by TYPE, where
2187 ada_is_constrained_packed_array_type (TYPE). */
2189 static struct type
*
2190 decode_constrained_packed_array_type (struct type
*type
)
2192 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2195 struct type
*shadow_type
;
2199 raw_name
= ada_type_name (desc_base_type (type
));
2204 name
= (char *) alloca (strlen (raw_name
) + 1);
2205 tail
= strstr (raw_name
, "___XP");
2206 type
= desc_base_type (type
);
2208 memcpy (name
, raw_name
, tail
- raw_name
);
2209 name
[tail
- raw_name
] = '\000';
2211 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2213 if (shadow_type
== NULL
)
2215 lim_warning (_("could not find bounds information on packed array"));
2218 shadow_type
= check_typedef (shadow_type
);
2220 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2222 lim_warning (_("could not understand bounds "
2223 "information on packed array"));
2227 bits
= decode_packed_array_bitsize (type
);
2228 return constrained_packed_array_type (shadow_type
, &bits
);
2231 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2232 array, returns a simple array that denotes that array. Its type is a
2233 standard GDB array type except that the BITSIZEs of the array
2234 target types are set to the number of bits in each element, and the
2235 type length is set appropriately. */
2237 static struct value
*
2238 decode_constrained_packed_array (struct value
*arr
)
2242 /* If our value is a pointer, then dereference it. Likewise if
2243 the value is a reference. Make sure that this operation does not
2244 cause the target type to be fixed, as this would indirectly cause
2245 this array to be decoded. The rest of the routine assumes that
2246 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2247 and "value_ind" routines to perform the dereferencing, as opposed
2248 to using "ada_coerce_ref" or "ada_value_ind". */
2249 arr
= coerce_ref (arr
);
2250 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2251 arr
= value_ind (arr
);
2253 type
= decode_constrained_packed_array_type (value_type (arr
));
2256 error (_("can't unpack array"));
2260 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2261 && ada_is_modular_type (value_type (arr
)))
2263 /* This is a (right-justified) modular type representing a packed
2264 array with no wrapper. In order to interpret the value through
2265 the (left-justified) packed array type we just built, we must
2266 first left-justify it. */
2267 int bit_size
, bit_pos
;
2270 mod
= ada_modulus (value_type (arr
)) - 1;
2277 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2278 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2279 bit_pos
/ HOST_CHAR_BIT
,
2280 bit_pos
% HOST_CHAR_BIT
,
2285 return coerce_unspec_val_to_type (arr
, type
);
2289 /* The value of the element of packed array ARR at the ARITY indices
2290 given in IND. ARR must be a simple array. */
2292 static struct value
*
2293 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2296 int bits
, elt_off
, bit_off
;
2297 long elt_total_bit_offset
;
2298 struct type
*elt_type
;
2302 elt_total_bit_offset
= 0;
2303 elt_type
= ada_check_typedef (value_type (arr
));
2304 for (i
= 0; i
< arity
; i
+= 1)
2306 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2307 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2309 (_("attempt to do packed indexing of "
2310 "something other than a packed array"));
2313 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2314 LONGEST lowerbound
, upperbound
;
2317 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2319 lim_warning (_("don't know bounds of array"));
2320 lowerbound
= upperbound
= 0;
2323 idx
= pos_atr (ind
[i
]);
2324 if (idx
< lowerbound
|| idx
> upperbound
)
2325 lim_warning (_("packed array index %ld out of bounds"),
2327 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2328 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2329 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2332 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2333 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2335 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2340 /* Non-zero iff TYPE includes negative integer values. */
2343 has_negatives (struct type
*type
)
2345 switch (TYPE_CODE (type
))
2350 return !TYPE_UNSIGNED (type
);
2351 case TYPE_CODE_RANGE
:
2352 return TYPE_LOW_BOUND (type
) - TYPE_RANGE_DATA (type
)->bias
< 0;
2356 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2357 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2358 the unpacked buffer.
2360 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2361 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2363 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2366 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2368 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2371 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2372 gdb_byte
*unpacked
, int unpacked_len
,
2373 int is_big_endian
, int is_signed_type
,
2376 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2377 int src_idx
; /* Index into the source area */
2378 int src_bytes_left
; /* Number of source bytes left to process. */
2379 int srcBitsLeft
; /* Number of source bits left to move */
2380 int unusedLS
; /* Number of bits in next significant
2381 byte of source that are unused */
2383 int unpacked_idx
; /* Index into the unpacked buffer */
2384 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2386 unsigned long accum
; /* Staging area for bits being transferred */
2387 int accumSize
; /* Number of meaningful bits in accum */
2390 /* Transmit bytes from least to most significant; delta is the direction
2391 the indices move. */
2392 int delta
= is_big_endian
? -1 : 1;
2394 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2396 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2397 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2398 bit_size
, unpacked_len
);
2400 srcBitsLeft
= bit_size
;
2401 src_bytes_left
= src_len
;
2402 unpacked_bytes_left
= unpacked_len
;
2407 src_idx
= src_len
- 1;
2409 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2413 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2419 unpacked_idx
= unpacked_len
- 1;
2423 /* Non-scalar values must be aligned at a byte boundary... */
2425 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2426 /* ... And are placed at the beginning (most-significant) bytes
2428 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2429 unpacked_bytes_left
= unpacked_idx
+ 1;
2434 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2436 src_idx
= unpacked_idx
= 0;
2437 unusedLS
= bit_offset
;
2440 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2445 while (src_bytes_left
> 0)
2447 /* Mask for removing bits of the next source byte that are not
2448 part of the value. */
2449 unsigned int unusedMSMask
=
2450 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2452 /* Sign-extend bits for this byte. */
2453 unsigned int signMask
= sign
& ~unusedMSMask
;
2456 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2457 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2458 if (accumSize
>= HOST_CHAR_BIT
)
2460 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2461 accumSize
-= HOST_CHAR_BIT
;
2462 accum
>>= HOST_CHAR_BIT
;
2463 unpacked_bytes_left
-= 1;
2464 unpacked_idx
+= delta
;
2466 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2468 src_bytes_left
-= 1;
2471 while (unpacked_bytes_left
> 0)
2473 accum
|= sign
<< accumSize
;
2474 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2475 accumSize
-= HOST_CHAR_BIT
;
2478 accum
>>= HOST_CHAR_BIT
;
2479 unpacked_bytes_left
-= 1;
2480 unpacked_idx
+= delta
;
2484 /* Create a new value of type TYPE from the contents of OBJ starting
2485 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2486 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2487 assigning through the result will set the field fetched from.
2488 VALADDR is ignored unless OBJ is NULL, in which case,
2489 VALADDR+OFFSET must address the start of storage containing the
2490 packed value. The value returned in this case is never an lval.
2491 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2494 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2495 long offset
, int bit_offset
, int bit_size
,
2499 const gdb_byte
*src
; /* First byte containing data to unpack */
2501 const int is_scalar
= is_scalar_type (type
);
2502 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2503 gdb::byte_vector staging
;
2505 type
= ada_check_typedef (type
);
2508 src
= valaddr
+ offset
;
2510 src
= value_contents (obj
) + offset
;
2512 if (is_dynamic_type (type
))
2514 /* The length of TYPE might by dynamic, so we need to resolve
2515 TYPE in order to know its actual size, which we then use
2516 to create the contents buffer of the value we return.
2517 The difficulty is that the data containing our object is
2518 packed, and therefore maybe not at a byte boundary. So, what
2519 we do, is unpack the data into a byte-aligned buffer, and then
2520 use that buffer as our object's value for resolving the type. */
2521 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2522 staging
.resize (staging_len
);
2524 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2525 staging
.data (), staging
.size (),
2526 is_big_endian
, has_negatives (type
),
2528 type
= resolve_dynamic_type (type
, staging
.data (), 0);
2529 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2531 /* This happens when the length of the object is dynamic,
2532 and is actually smaller than the space reserved for it.
2533 For instance, in an array of variant records, the bit_size
2534 we're given is the array stride, which is constant and
2535 normally equal to the maximum size of its element.
2536 But, in reality, each element only actually spans a portion
2538 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2544 v
= allocate_value (type
);
2545 src
= valaddr
+ offset
;
2547 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2549 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2552 v
= value_at (type
, value_address (obj
) + offset
);
2553 buf
= (gdb_byte
*) alloca (src_len
);
2554 read_memory (value_address (v
), buf
, src_len
);
2559 v
= allocate_value (type
);
2560 src
= value_contents (obj
) + offset
;
2565 long new_offset
= offset
;
2567 set_value_component_location (v
, obj
);
2568 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2569 set_value_bitsize (v
, bit_size
);
2570 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2573 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2575 set_value_offset (v
, new_offset
);
2577 /* Also set the parent value. This is needed when trying to
2578 assign a new value (in inferior memory). */
2579 set_value_parent (v
, obj
);
2582 set_value_bitsize (v
, bit_size
);
2583 unpacked
= value_contents_writeable (v
);
2587 memset (unpacked
, 0, TYPE_LENGTH (type
));
2591 if (staging
.size () == TYPE_LENGTH (type
))
2593 /* Small short-cut: If we've unpacked the data into a buffer
2594 of the same size as TYPE's length, then we can reuse that,
2595 instead of doing the unpacking again. */
2596 memcpy (unpacked
, staging
.data (), staging
.size ());
2599 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2600 unpacked
, TYPE_LENGTH (type
),
2601 is_big_endian
, has_negatives (type
), is_scalar
);
2606 /* Store the contents of FROMVAL into the location of TOVAL.
2607 Return a new value with the location of TOVAL and contents of
2608 FROMVAL. Handles assignment into packed fields that have
2609 floating-point or non-scalar types. */
2611 static struct value
*
2612 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2614 struct type
*type
= value_type (toval
);
2615 int bits
= value_bitsize (toval
);
2617 toval
= ada_coerce_ref (toval
);
2618 fromval
= ada_coerce_ref (fromval
);
2620 if (ada_is_direct_array_type (value_type (toval
)))
2621 toval
= ada_coerce_to_simple_array (toval
);
2622 if (ada_is_direct_array_type (value_type (fromval
)))
2623 fromval
= ada_coerce_to_simple_array (fromval
);
2625 if (!deprecated_value_modifiable (toval
))
2626 error (_("Left operand of assignment is not a modifiable lvalue."));
2628 if (VALUE_LVAL (toval
) == lval_memory
2630 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2631 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2633 int len
= (value_bitpos (toval
)
2634 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2636 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2638 CORE_ADDR to_addr
= value_address (toval
);
2640 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2641 fromval
= value_cast (type
, fromval
);
2643 read_memory (to_addr
, buffer
, len
);
2644 from_size
= value_bitsize (fromval
);
2646 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2648 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2649 ULONGEST from_offset
= 0;
2650 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2651 from_offset
= from_size
- bits
;
2652 copy_bitwise (buffer
, value_bitpos (toval
),
2653 value_contents (fromval
), from_offset
,
2654 bits
, is_big_endian
);
2655 write_memory_with_notification (to_addr
, buffer
, len
);
2657 val
= value_copy (toval
);
2658 memcpy (value_contents_raw (val
), value_contents (fromval
),
2659 TYPE_LENGTH (type
));
2660 deprecated_set_value_type (val
, type
);
2665 return value_assign (toval
, fromval
);
2669 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2670 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2671 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2672 COMPONENT, and not the inferior's memory. The current contents
2673 of COMPONENT are ignored.
2675 Although not part of the initial design, this function also works
2676 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2677 had a null address, and COMPONENT had an address which is equal to
2678 its offset inside CONTAINER. */
2681 value_assign_to_component (struct value
*container
, struct value
*component
,
2684 LONGEST offset_in_container
=
2685 (LONGEST
) (value_address (component
) - value_address (container
));
2686 int bit_offset_in_container
=
2687 value_bitpos (component
) - value_bitpos (container
);
2690 val
= value_cast (value_type (component
), val
);
2692 if (value_bitsize (component
) == 0)
2693 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2695 bits
= value_bitsize (component
);
2697 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2701 if (is_scalar_type (check_typedef (value_type (component
))))
2703 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2706 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2707 value_bitpos (container
) + bit_offset_in_container
,
2708 value_contents (val
), src_offset
, bits
, 1);
2711 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2712 value_bitpos (container
) + bit_offset_in_container
,
2713 value_contents (val
), 0, bits
, 0);
2716 /* Determine if TYPE is an access to an unconstrained array. */
2719 ada_is_access_to_unconstrained_array (struct type
*type
)
2721 return (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
2722 && is_thick_pntr (ada_typedef_target_type (type
)));
2725 /* The value of the element of array ARR at the ARITY indices given in IND.
2726 ARR may be either a simple array, GNAT array descriptor, or pointer
2730 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2734 struct type
*elt_type
;
2736 elt
= ada_coerce_to_simple_array (arr
);
2738 elt_type
= ada_check_typedef (value_type (elt
));
2739 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2740 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2741 return value_subscript_packed (elt
, arity
, ind
);
2743 for (k
= 0; k
< arity
; k
+= 1)
2745 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2747 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2748 error (_("too many subscripts (%d expected)"), k
);
2750 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2752 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2753 && TYPE_CODE (value_type (elt
)) != TYPE_CODE_TYPEDEF
)
2755 /* The element is a typedef to an unconstrained array,
2756 except that the value_subscript call stripped the
2757 typedef layer. The typedef layer is GNAT's way to
2758 specify that the element is, at the source level, an
2759 access to the unconstrained array, rather than the
2760 unconstrained array. So, we need to restore that
2761 typedef layer, which we can do by forcing the element's
2762 type back to its original type. Otherwise, the returned
2763 value is going to be printed as the array, rather
2764 than as an access. Another symptom of the same issue
2765 would be that an expression trying to dereference the
2766 element would also be improperly rejected. */
2767 deprecated_set_value_type (elt
, saved_elt_type
);
2770 elt_type
= ada_check_typedef (value_type (elt
));
2776 /* Assuming ARR is a pointer to a GDB array, the value of the element
2777 of *ARR at the ARITY indices given in IND.
2778 Does not read the entire array into memory.
2780 Note: Unlike what one would expect, this function is used instead of
2781 ada_value_subscript for basically all non-packed array types. The reason
2782 for this is that a side effect of doing our own pointer arithmetics instead
2783 of relying on value_subscript is that there is no implicit typedef peeling.
2784 This is important for arrays of array accesses, where it allows us to
2785 preserve the fact that the array's element is an array access, where the
2786 access part os encoded in a typedef layer. */
2788 static struct value
*
2789 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2792 struct value
*array_ind
= ada_value_ind (arr
);
2794 = check_typedef (value_enclosing_type (array_ind
));
2796 if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
2797 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2798 return value_subscript_packed (array_ind
, arity
, ind
);
2800 for (k
= 0; k
< arity
; k
+= 1)
2803 struct value
*lwb_value
;
2805 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2806 error (_("too many subscripts (%d expected)"), k
);
2807 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2809 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2810 lwb_value
= value_from_longest (value_type(ind
[k
]), lwb
);
2811 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - pos_atr (lwb_value
));
2812 type
= TYPE_TARGET_TYPE (type
);
2815 return value_ind (arr
);
2818 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2819 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2820 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2821 this array is LOW, as per Ada rules. */
2822 static struct value
*
2823 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2826 struct type
*type0
= ada_check_typedef (type
);
2827 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
));
2828 struct type
*index_type
2829 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2830 struct type
*slice_type
= create_array_type_with_stride
2831 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2832 get_dyn_prop (DYN_PROP_BYTE_STRIDE
, type0
),
2833 TYPE_FIELD_BITSIZE (type0
, 0));
2834 int base_low
= ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
));
2835 LONGEST base_low_pos
, low_pos
;
2838 if (!discrete_position (base_index_type
, low
, &low_pos
)
2839 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2841 warning (_("unable to get positions in slice, use bounds instead"));
2843 base_low_pos
= base_low
;
2846 base
= value_as_address (array_ptr
)
2847 + ((low_pos
- base_low_pos
)
2848 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2849 return value_at_lazy (slice_type
, base
);
2853 static struct value
*
2854 ada_value_slice (struct value
*array
, int low
, int high
)
2856 struct type
*type
= ada_check_typedef (value_type (array
));
2857 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2858 struct type
*index_type
2859 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2860 struct type
*slice_type
= create_array_type_with_stride
2861 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2862 get_dyn_prop (DYN_PROP_BYTE_STRIDE
, type
),
2863 TYPE_FIELD_BITSIZE (type
, 0));
2864 LONGEST low_pos
, high_pos
;
2866 if (!discrete_position (base_index_type
, low
, &low_pos
)
2867 || !discrete_position (base_index_type
, high
, &high_pos
))
2869 warning (_("unable to get positions in slice, use bounds instead"));
2874 return value_cast (slice_type
,
2875 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2878 /* If type is a record type in the form of a standard GNAT array
2879 descriptor, returns the number of dimensions for type. If arr is a
2880 simple array, returns the number of "array of"s that prefix its
2881 type designation. Otherwise, returns 0. */
2884 ada_array_arity (struct type
*type
)
2891 type
= desc_base_type (type
);
2894 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2895 return desc_arity (desc_bounds_type (type
));
2897 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2900 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2906 /* If TYPE is a record type in the form of a standard GNAT array
2907 descriptor or a simple array type, returns the element type for
2908 TYPE after indexing by NINDICES indices, or by all indices if
2909 NINDICES is -1. Otherwise, returns NULL. */
2912 ada_array_element_type (struct type
*type
, int nindices
)
2914 type
= desc_base_type (type
);
2916 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2919 struct type
*p_array_type
;
2921 p_array_type
= desc_data_target_type (type
);
2923 k
= ada_array_arity (type
);
2927 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2928 if (nindices
>= 0 && k
> nindices
)
2930 while (k
> 0 && p_array_type
!= NULL
)
2932 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2935 return p_array_type
;
2937 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2939 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2941 type
= TYPE_TARGET_TYPE (type
);
2950 /* The type of nth index in arrays of given type (n numbering from 1).
2951 Does not examine memory. Throws an error if N is invalid or TYPE
2952 is not an array type. NAME is the name of the Ada attribute being
2953 evaluated ('range, 'first, 'last, or 'length); it is used in building
2954 the error message. */
2956 static struct type
*
2957 ada_index_type (struct type
*type
, int n
, const char *name
)
2959 struct type
*result_type
;
2961 type
= desc_base_type (type
);
2963 if (n
< 0 || n
> ada_array_arity (type
))
2964 error (_("invalid dimension number to '%s"), name
);
2966 if (ada_is_simple_array_type (type
))
2970 for (i
= 1; i
< n
; i
+= 1)
2971 type
= TYPE_TARGET_TYPE (type
);
2972 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2973 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2974 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2975 perhaps stabsread.c would make more sense. */
2976 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2981 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2982 if (result_type
== NULL
)
2983 error (_("attempt to take bound of something that is not an array"));
2989 /* Given that arr is an array type, returns the lower bound of the
2990 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2991 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2992 array-descriptor type. It works for other arrays with bounds supplied
2993 by run-time quantities other than discriminants. */
2996 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2998 struct type
*type
, *index_type_desc
, *index_type
;
3001 gdb_assert (which
== 0 || which
== 1);
3003 if (ada_is_constrained_packed_array_type (arr_type
))
3004 arr_type
= decode_constrained_packed_array_type (arr_type
);
3006 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
3007 return (LONGEST
) - which
;
3009 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
3010 type
= TYPE_TARGET_TYPE (arr_type
);
3014 if (TYPE_FIXED_INSTANCE (type
))
3016 /* The array has already been fixed, so we do not need to
3017 check the parallel ___XA type again. That encoding has
3018 already been applied, so ignore it now. */
3019 index_type_desc
= NULL
;
3023 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3024 ada_fixup_array_indexes_type (index_type_desc
);
3027 if (index_type_desc
!= NULL
)
3028 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
3032 struct type
*elt_type
= check_typedef (type
);
3034 for (i
= 1; i
< n
; i
++)
3035 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3037 index_type
= TYPE_INDEX_TYPE (elt_type
);
3041 (LONGEST
) (which
== 0
3042 ? ada_discrete_type_low_bound (index_type
)
3043 : ada_discrete_type_high_bound (index_type
));
3046 /* Given that arr is an array value, returns the lower bound of the
3047 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3048 WHICH is 1. This routine will also work for arrays with bounds
3049 supplied by run-time quantities other than discriminants. */
3052 ada_array_bound (struct value
*arr
, int n
, int which
)
3054 struct type
*arr_type
;
3056 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3057 arr
= value_ind (arr
);
3058 arr_type
= value_enclosing_type (arr
);
3060 if (ada_is_constrained_packed_array_type (arr_type
))
3061 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3062 else if (ada_is_simple_array_type (arr_type
))
3063 return ada_array_bound_from_type (arr_type
, n
, which
);
3065 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3068 /* Given that arr is an array value, returns the length of the
3069 nth index. This routine will also work for arrays with bounds
3070 supplied by run-time quantities other than discriminants.
3071 Does not work for arrays indexed by enumeration types with representation
3072 clauses at the moment. */
3075 ada_array_length (struct value
*arr
, int n
)
3077 struct type
*arr_type
, *index_type
;
3080 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3081 arr
= value_ind (arr
);
3082 arr_type
= value_enclosing_type (arr
);
3084 if (ada_is_constrained_packed_array_type (arr_type
))
3085 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3087 if (ada_is_simple_array_type (arr_type
))
3089 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3090 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3094 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3095 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3098 arr_type
= check_typedef (arr_type
);
3099 index_type
= ada_index_type (arr_type
, n
, "length");
3100 if (index_type
!= NULL
)
3102 struct type
*base_type
;
3103 if (TYPE_CODE (index_type
) == TYPE_CODE_RANGE
)
3104 base_type
= TYPE_TARGET_TYPE (index_type
);
3106 base_type
= index_type
;
3108 low
= pos_atr (value_from_longest (base_type
, low
));
3109 high
= pos_atr (value_from_longest (base_type
, high
));
3111 return high
- low
+ 1;
3114 /* An array whose type is that of ARR_TYPE (an array type), with
3115 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3116 less than LOW, then LOW-1 is used. */
3118 static struct value
*
3119 empty_array (struct type
*arr_type
, int low
, int high
)
3121 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3122 struct type
*index_type
3123 = create_static_range_type
3124 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
,
3125 high
< low
? low
- 1 : high
);
3126 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3128 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3132 /* Name resolution */
3134 /* The "decoded" name for the user-definable Ada operator corresponding
3138 ada_decoded_op_name (enum exp_opcode op
)
3142 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3144 if (ada_opname_table
[i
].op
== op
)
3145 return ada_opname_table
[i
].decoded
;
3147 error (_("Could not find operator name for opcode"));
3150 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3151 in a listing of choices during disambiguation (see sort_choices, below).
3152 The idea is that overloadings of a subprogram name from the
3153 same package should sort in their source order. We settle for ordering
3154 such symbols by their trailing number (__N or $N). */
3157 encoded_ordered_before (const char *N0
, const char *N1
)
3161 else if (N0
== NULL
)
3167 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3169 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3171 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3172 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3177 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3180 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3182 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3183 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3185 return (strcmp (N0
, N1
) < 0);
3189 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3193 sort_choices (struct block_symbol syms
[], int nsyms
)
3197 for (i
= 1; i
< nsyms
; i
+= 1)
3199 struct block_symbol sym
= syms
[i
];
3202 for (j
= i
- 1; j
>= 0; j
-= 1)
3204 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3205 sym
.symbol
->linkage_name ()))
3207 syms
[j
+ 1] = syms
[j
];
3213 /* Whether GDB should display formals and return types for functions in the
3214 overloads selection menu. */
3215 static bool print_signatures
= true;
3217 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3218 all but functions, the signature is just the name of the symbol. For
3219 functions, this is the name of the function, the list of types for formals
3220 and the return type (if any). */
3223 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3224 const struct type_print_options
*flags
)
3226 struct type
*type
= SYMBOL_TYPE (sym
);
3228 fprintf_filtered (stream
, "%s", sym
->print_name ());
3229 if (!print_signatures
3231 || TYPE_CODE (type
) != TYPE_CODE_FUNC
)
3234 if (TYPE_NFIELDS (type
) > 0)
3238 fprintf_filtered (stream
, " (");
3239 for (i
= 0; i
< TYPE_NFIELDS (type
); ++i
)
3242 fprintf_filtered (stream
, "; ");
3243 ada_print_type (TYPE_FIELD_TYPE (type
, i
), NULL
, stream
, -1, 0,
3246 fprintf_filtered (stream
, ")");
3248 if (TYPE_TARGET_TYPE (type
) != NULL
3249 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) != TYPE_CODE_VOID
)
3251 fprintf_filtered (stream
, " return ");
3252 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3256 /* Read and validate a set of numeric choices from the user in the
3257 range 0 .. N_CHOICES-1. Place the results in increasing
3258 order in CHOICES[0 .. N-1], and return N.
3260 The user types choices as a sequence of numbers on one line
3261 separated by blanks, encoding them as follows:
3263 + A choice of 0 means to cancel the selection, throwing an error.
3264 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3265 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3267 The user is not allowed to choose more than MAX_RESULTS values.
3269 ANNOTATION_SUFFIX, if present, is used to annotate the input
3270 prompts (for use with the -f switch). */
3273 get_selections (int *choices
, int n_choices
, int max_results
,
3274 int is_all_choice
, const char *annotation_suffix
)
3279 int first_choice
= is_all_choice
? 2 : 1;
3281 prompt
= getenv ("PS2");
3285 args
= command_line_input (prompt
, annotation_suffix
);
3288 error_no_arg (_("one or more choice numbers"));
3292 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3293 order, as given in args. Choices are validated. */
3299 args
= skip_spaces (args
);
3300 if (*args
== '\0' && n_chosen
== 0)
3301 error_no_arg (_("one or more choice numbers"));
3302 else if (*args
== '\0')
3305 choice
= strtol (args
, &args2
, 10);
3306 if (args
== args2
|| choice
< 0
3307 || choice
> n_choices
+ first_choice
- 1)
3308 error (_("Argument must be choice number"));
3312 error (_("cancelled"));
3314 if (choice
< first_choice
)
3316 n_chosen
= n_choices
;
3317 for (j
= 0; j
< n_choices
; j
+= 1)
3321 choice
-= first_choice
;
3323 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3327 if (j
< 0 || choice
!= choices
[j
])
3331 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3332 choices
[k
+ 1] = choices
[k
];
3333 choices
[j
+ 1] = choice
;
3338 if (n_chosen
> max_results
)
3339 error (_("Select no more than %d of the above"), max_results
);
3344 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3345 by asking the user (if necessary), returning the number selected,
3346 and setting the first elements of SYMS items. Error if no symbols
3349 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3350 to be re-integrated one of these days. */
3353 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3356 int *chosen
= XALLOCAVEC (int , nsyms
);
3358 int first_choice
= (max_results
== 1) ? 1 : 2;
3359 const char *select_mode
= multiple_symbols_select_mode ();
3361 if (max_results
< 1)
3362 error (_("Request to select 0 symbols!"));
3366 if (select_mode
== multiple_symbols_cancel
)
3368 canceled because the command is ambiguous\n\
3369 See set/show multiple-symbol."));
3371 /* If select_mode is "all", then return all possible symbols.
3372 Only do that if more than one symbol can be selected, of course.
3373 Otherwise, display the menu as usual. */
3374 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3377 printf_filtered (_("[0] cancel\n"));
3378 if (max_results
> 1)
3379 printf_filtered (_("[1] all\n"));
3381 sort_choices (syms
, nsyms
);
3383 for (i
= 0; i
< nsyms
; i
+= 1)
3385 if (syms
[i
].symbol
== NULL
)
3388 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3390 struct symtab_and_line sal
=
3391 find_function_start_sal (syms
[i
].symbol
, 1);
3393 printf_filtered ("[%d] ", i
+ first_choice
);
3394 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3395 &type_print_raw_options
);
3396 if (sal
.symtab
== NULL
)
3397 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3398 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3402 styled_string (file_name_style
.style (),
3403 symtab_to_filename_for_display (sal
.symtab
)),
3410 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3411 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3412 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) == TYPE_CODE_ENUM
);
3413 struct symtab
*symtab
= NULL
;
3415 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3416 symtab
= symbol_symtab (syms
[i
].symbol
);
3418 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3420 printf_filtered ("[%d] ", i
+ first_choice
);
3421 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3422 &type_print_raw_options
);
3423 printf_filtered (_(" at %s:%d\n"),
3424 symtab_to_filename_for_display (symtab
),
3425 SYMBOL_LINE (syms
[i
].symbol
));
3427 else if (is_enumeral
3428 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].symbol
)) != NULL
)
3430 printf_filtered (("[%d] "), i
+ first_choice
);
3431 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3432 gdb_stdout
, -1, 0, &type_print_raw_options
);
3433 printf_filtered (_("'(%s) (enumeral)\n"),
3434 syms
[i
].symbol
->print_name ());
3438 printf_filtered ("[%d] ", i
+ first_choice
);
3439 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3440 &type_print_raw_options
);
3443 printf_filtered (is_enumeral
3444 ? _(" in %s (enumeral)\n")
3446 symtab_to_filename_for_display (symtab
));
3448 printf_filtered (is_enumeral
3449 ? _(" (enumeral)\n")
3455 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3458 for (i
= 0; i
< n_chosen
; i
+= 1)
3459 syms
[i
] = syms
[chosen
[i
]];
3464 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3465 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3466 undefined namespace) and converts operators that are
3467 user-defined into appropriate function calls. If CONTEXT_TYPE is
3468 non-null, it provides a preferred result type [at the moment, only
3469 type void has any effect---causing procedures to be preferred over
3470 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3471 return type is preferred. May change (expand) *EXP. */
3474 resolve (expression_up
*expp
, int void_context_p
, int parse_completion
,
3475 innermost_block_tracker
*tracker
)
3477 struct type
*context_type
= NULL
;
3481 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3483 resolve_subexp (expp
, &pc
, 1, context_type
, parse_completion
, tracker
);
3486 /* Resolve the operator of the subexpression beginning at
3487 position *POS of *EXPP. "Resolving" consists of replacing
3488 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3489 with their resolutions, replacing built-in operators with
3490 function calls to user-defined operators, where appropriate, and,
3491 when DEPROCEDURE_P is non-zero, converting function-valued variables
3492 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3493 are as in ada_resolve, above. */
3495 static struct value
*
3496 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3497 struct type
*context_type
, int parse_completion
,
3498 innermost_block_tracker
*tracker
)
3502 struct expression
*exp
; /* Convenience: == *expp. */
3503 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3504 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3505 int nargs
; /* Number of operands. */
3512 /* Pass one: resolve operands, saving their types and updating *pos,
3517 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3518 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3523 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3525 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3530 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3535 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3536 parse_completion
, tracker
);
3539 case OP_ATR_MODULUS
:
3549 case TERNOP_IN_RANGE
:
3550 case BINOP_IN_BOUNDS
:
3556 case OP_DISCRETE_RANGE
:
3558 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3567 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3569 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3571 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3589 case BINOP_LOGICAL_AND
:
3590 case BINOP_LOGICAL_OR
:
3591 case BINOP_BITWISE_AND
:
3592 case BINOP_BITWISE_IOR
:
3593 case BINOP_BITWISE_XOR
:
3596 case BINOP_NOTEQUAL
:
3603 case BINOP_SUBSCRIPT
:
3611 case UNOP_LOGICAL_NOT
:
3621 case OP_VAR_MSYM_VALUE
:
3628 case OP_INTERNALVAR
:
3638 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3641 case STRUCTOP_STRUCT
:
3642 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3655 error (_("Unexpected operator during name resolution"));
3658 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3659 for (i
= 0; i
< nargs
; i
+= 1)
3660 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
,
3665 /* Pass two: perform any resolution on principal operator. */
3672 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3674 std::vector
<struct block_symbol
> candidates
;
3678 ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3679 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3682 if (n_candidates
> 1)
3684 /* Types tend to get re-introduced locally, so if there
3685 are any local symbols that are not types, first filter
3688 for (j
= 0; j
< n_candidates
; j
+= 1)
3689 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3694 case LOC_REGPARM_ADDR
:
3702 if (j
< n_candidates
)
3705 while (j
< n_candidates
)
3707 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3709 candidates
[j
] = candidates
[n_candidates
- 1];
3718 if (n_candidates
== 0)
3719 error (_("No definition found for %s"),
3720 exp
->elts
[pc
+ 2].symbol
->print_name ());
3721 else if (n_candidates
== 1)
3723 else if (deprocedure_p
3724 && !is_nonfunction (candidates
.data (), n_candidates
))
3726 i
= ada_resolve_function
3727 (candidates
.data (), n_candidates
, NULL
, 0,
3728 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3729 context_type
, parse_completion
);
3731 error (_("Could not find a match for %s"),
3732 exp
->elts
[pc
+ 2].symbol
->print_name ());
3736 printf_filtered (_("Multiple matches for %s\n"),
3737 exp
->elts
[pc
+ 2].symbol
->print_name ());
3738 user_select_syms (candidates
.data (), n_candidates
, 1);
3742 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3743 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3744 tracker
->update (candidates
[i
]);
3748 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3751 replace_operator_with_call (expp
, pc
, 0, 4,
3752 exp
->elts
[pc
+ 2].symbol
,
3753 exp
->elts
[pc
+ 1].block
);
3760 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3761 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3763 std::vector
<struct block_symbol
> candidates
;
3767 ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3768 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3771 if (n_candidates
== 1)
3775 i
= ada_resolve_function
3776 (candidates
.data (), n_candidates
,
3778 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3779 context_type
, parse_completion
);
3781 error (_("Could not find a match for %s"),
3782 exp
->elts
[pc
+ 5].symbol
->print_name ());
3785 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3786 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3787 tracker
->update (candidates
[i
]);
3798 case BINOP_BITWISE_AND
:
3799 case BINOP_BITWISE_IOR
:
3800 case BINOP_BITWISE_XOR
:
3802 case BINOP_NOTEQUAL
:
3810 case UNOP_LOGICAL_NOT
:
3812 if (possible_user_operator_p (op
, argvec
))
3814 std::vector
<struct block_symbol
> candidates
;
3818 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3822 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3823 nargs
, ada_decoded_op_name (op
), NULL
,
3828 replace_operator_with_call (expp
, pc
, nargs
, 1,
3829 candidates
[i
].symbol
,
3830 candidates
[i
].block
);
3841 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3842 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3843 exp
->elts
[pc
+ 1].objfile
,
3844 exp
->elts
[pc
+ 2].msymbol
);
3846 return evaluate_subexp_type (exp
, pos
);
3849 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3850 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3852 /* The term "match" here is rather loose. The match is heuristic and
3856 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3858 ftype
= ada_check_typedef (ftype
);
3859 atype
= ada_check_typedef (atype
);
3861 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3862 ftype
= TYPE_TARGET_TYPE (ftype
);
3863 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3864 atype
= TYPE_TARGET_TYPE (atype
);
3866 switch (TYPE_CODE (ftype
))
3869 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3871 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3872 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3873 TYPE_TARGET_TYPE (atype
), 0);
3876 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3878 case TYPE_CODE_ENUM
:
3879 case TYPE_CODE_RANGE
:
3880 switch (TYPE_CODE (atype
))
3883 case TYPE_CODE_ENUM
:
3884 case TYPE_CODE_RANGE
:
3890 case TYPE_CODE_ARRAY
:
3891 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3892 || ada_is_array_descriptor_type (atype
));
3894 case TYPE_CODE_STRUCT
:
3895 if (ada_is_array_descriptor_type (ftype
))
3896 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3897 || ada_is_array_descriptor_type (atype
));
3899 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3900 && !ada_is_array_descriptor_type (atype
));
3902 case TYPE_CODE_UNION
:
3904 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3908 /* Return non-zero if the formals of FUNC "sufficiently match" the
3909 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3910 may also be an enumeral, in which case it is treated as a 0-
3911 argument function. */
3914 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3917 struct type
*func_type
= SYMBOL_TYPE (func
);
3919 if (SYMBOL_CLASS (func
) == LOC_CONST
3920 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3921 return (n_actuals
== 0);
3922 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3925 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3928 for (i
= 0; i
< n_actuals
; i
+= 1)
3930 if (actuals
[i
] == NULL
)
3934 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3936 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3938 if (!ada_type_match (ftype
, atype
, 1))
3945 /* False iff function type FUNC_TYPE definitely does not produce a value
3946 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3947 FUNC_TYPE is not a valid function type with a non-null return type
3948 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3951 return_match (struct type
*func_type
, struct type
*context_type
)
3953 struct type
*return_type
;
3955 if (func_type
== NULL
)
3958 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3959 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3961 return_type
= get_base_type (func_type
);
3962 if (return_type
== NULL
)
3965 context_type
= get_base_type (context_type
);
3967 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3968 return context_type
== NULL
|| return_type
== context_type
;
3969 else if (context_type
== NULL
)
3970 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3972 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3976 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3977 function (if any) that matches the types of the NARGS arguments in
3978 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3979 that returns that type, then eliminate matches that don't. If
3980 CONTEXT_TYPE is void and there is at least one match that does not
3981 return void, eliminate all matches that do.
3983 Asks the user if there is more than one match remaining. Returns -1
3984 if there is no such symbol or none is selected. NAME is used
3985 solely for messages. May re-arrange and modify SYMS in
3986 the process; the index returned is for the modified vector. */
3989 ada_resolve_function (struct block_symbol syms
[],
3990 int nsyms
, struct value
**args
, int nargs
,
3991 const char *name
, struct type
*context_type
,
3992 int parse_completion
)
3996 int m
; /* Number of hits */
3999 /* In the first pass of the loop, we only accept functions matching
4000 context_type. If none are found, we add a second pass of the loop
4001 where every function is accepted. */
4002 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
4004 for (k
= 0; k
< nsyms
; k
+= 1)
4006 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
4008 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
4009 && (fallback
|| return_match (type
, context_type
)))
4017 /* If we got multiple matches, ask the user which one to use. Don't do this
4018 interactive thing during completion, though, as the purpose of the
4019 completion is providing a list of all possible matches. Prompting the
4020 user to filter it down would be completely unexpected in this case. */
4023 else if (m
> 1 && !parse_completion
)
4025 printf_filtered (_("Multiple matches for %s\n"), name
);
4026 user_select_syms (syms
, m
, 1);
4032 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4033 on the function identified by SYM and BLOCK, and taking NARGS
4034 arguments. Update *EXPP as needed to hold more space. */
4037 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4038 int oplen
, struct symbol
*sym
,
4039 const struct block
*block
)
4041 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4042 symbol, -oplen for operator being replaced). */
4043 struct expression
*newexp
= (struct expression
*)
4044 xzalloc (sizeof (struct expression
)
4045 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
4046 struct expression
*exp
= expp
->get ();
4048 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4049 newexp
->language_defn
= exp
->language_defn
;
4050 newexp
->gdbarch
= exp
->gdbarch
;
4051 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4052 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4053 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4055 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4056 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4058 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4059 newexp
->elts
[pc
+ 4].block
= block
;
4060 newexp
->elts
[pc
+ 5].symbol
= sym
;
4062 expp
->reset (newexp
);
4065 /* Type-class predicates */
4067 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4071 numeric_type_p (struct type
*type
)
4077 switch (TYPE_CODE (type
))
4082 case TYPE_CODE_RANGE
:
4083 return (type
== TYPE_TARGET_TYPE (type
)
4084 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4091 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4094 integer_type_p (struct type
*type
)
4100 switch (TYPE_CODE (type
))
4104 case TYPE_CODE_RANGE
:
4105 return (type
== TYPE_TARGET_TYPE (type
)
4106 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4113 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4116 scalar_type_p (struct type
*type
)
4122 switch (TYPE_CODE (type
))
4125 case TYPE_CODE_RANGE
:
4126 case TYPE_CODE_ENUM
:
4135 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4138 discrete_type_p (struct type
*type
)
4144 switch (TYPE_CODE (type
))
4147 case TYPE_CODE_RANGE
:
4148 case TYPE_CODE_ENUM
:
4149 case TYPE_CODE_BOOL
:
4157 /* Returns non-zero if OP with operands in the vector ARGS could be
4158 a user-defined function. Errs on the side of pre-defined operators
4159 (i.e., result 0). */
4162 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4164 struct type
*type0
=
4165 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4166 struct type
*type1
=
4167 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4181 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4185 case BINOP_BITWISE_AND
:
4186 case BINOP_BITWISE_IOR
:
4187 case BINOP_BITWISE_XOR
:
4188 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4191 case BINOP_NOTEQUAL
:
4196 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4199 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4202 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4206 case UNOP_LOGICAL_NOT
:
4208 return (!numeric_type_p (type0
));
4217 1. In the following, we assume that a renaming type's name may
4218 have an ___XD suffix. It would be nice if this went away at some
4220 2. We handle both the (old) purely type-based representation of
4221 renamings and the (new) variable-based encoding. At some point,
4222 it is devoutly to be hoped that the former goes away
4223 (FIXME: hilfinger-2007-07-09).
4224 3. Subprogram renamings are not implemented, although the XRS
4225 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4227 /* If SYM encodes a renaming,
4229 <renaming> renames <renamed entity>,
4231 sets *LEN to the length of the renamed entity's name,
4232 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4233 the string describing the subcomponent selected from the renamed
4234 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4235 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4236 are undefined). Otherwise, returns a value indicating the category
4237 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4238 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4239 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4240 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4241 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4242 may be NULL, in which case they are not assigned.
4244 [Currently, however, GCC does not generate subprogram renamings.] */
4246 enum ada_renaming_category
4247 ada_parse_renaming (struct symbol
*sym
,
4248 const char **renamed_entity
, int *len
,
4249 const char **renaming_expr
)
4251 enum ada_renaming_category kind
;
4256 return ADA_NOT_RENAMING
;
4257 switch (SYMBOL_CLASS (sym
))
4260 return ADA_NOT_RENAMING
;
4264 case LOC_OPTIMIZED_OUT
:
4265 info
= strstr (sym
->linkage_name (), "___XR");
4267 return ADA_NOT_RENAMING
;
4271 kind
= ADA_OBJECT_RENAMING
;
4275 kind
= ADA_EXCEPTION_RENAMING
;
4279 kind
= ADA_PACKAGE_RENAMING
;
4283 kind
= ADA_SUBPROGRAM_RENAMING
;
4287 return ADA_NOT_RENAMING
;
4291 if (renamed_entity
!= NULL
)
4292 *renamed_entity
= info
;
4293 suffix
= strstr (info
, "___XE");
4294 if (suffix
== NULL
|| suffix
== info
)
4295 return ADA_NOT_RENAMING
;
4297 *len
= strlen (info
) - strlen (suffix
);
4299 if (renaming_expr
!= NULL
)
4300 *renaming_expr
= suffix
;
4304 /* Compute the value of the given RENAMING_SYM, which is expected to
4305 be a symbol encoding a renaming expression. BLOCK is the block
4306 used to evaluate the renaming. */
4308 static struct value
*
4309 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4310 const struct block
*block
)
4312 const char *sym_name
;
4314 sym_name
= renaming_sym
->linkage_name ();
4315 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4316 return evaluate_expression (expr
.get ());
4320 /* Evaluation: Function Calls */
4322 /* Return an lvalue containing the value VAL. This is the identity on
4323 lvalues, and otherwise has the side-effect of allocating memory
4324 in the inferior where a copy of the value contents is copied. */
4326 static struct value
*
4327 ensure_lval (struct value
*val
)
4329 if (VALUE_LVAL (val
) == not_lval
4330 || VALUE_LVAL (val
) == lval_internalvar
)
4332 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4333 const CORE_ADDR addr
=
4334 value_as_long (value_allocate_space_in_inferior (len
));
4336 VALUE_LVAL (val
) = lval_memory
;
4337 set_value_address (val
, addr
);
4338 write_memory (addr
, value_contents (val
), len
);
4344 /* Given ARG, a value of type (pointer or reference to a)*
4345 structure/union, extract the component named NAME from the ultimate
4346 target structure/union and return it as a value with its
4349 The routine searches for NAME among all members of the structure itself
4350 and (recursively) among all members of any wrapper members
4353 If NO_ERR, then simply return NULL in case of error, rather than
4356 static struct value
*
4357 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4359 struct type
*t
, *t1
;
4364 t1
= t
= ada_check_typedef (value_type (arg
));
4365 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
4367 t1
= TYPE_TARGET_TYPE (t
);
4370 t1
= ada_check_typedef (t1
);
4371 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
4373 arg
= coerce_ref (arg
);
4378 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
4380 t1
= TYPE_TARGET_TYPE (t
);
4383 t1
= ada_check_typedef (t1
);
4384 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
4386 arg
= value_ind (arg
);
4393 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
4397 v
= ada_search_struct_field (name
, arg
, 0, t
);
4400 int bit_offset
, bit_size
, byte_offset
;
4401 struct type
*field_type
;
4404 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
4405 address
= value_address (ada_value_ind (arg
));
4407 address
= value_address (ada_coerce_ref (arg
));
4409 /* Check to see if this is a tagged type. We also need to handle
4410 the case where the type is a reference to a tagged type, but
4411 we have to be careful to exclude pointers to tagged types.
4412 The latter should be shown as usual (as a pointer), whereas
4413 a reference should mostly be transparent to the user. */
4415 if (ada_is_tagged_type (t1
, 0)
4416 || (TYPE_CODE (t1
) == TYPE_CODE_REF
4417 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4419 /* We first try to find the searched field in the current type.
4420 If not found then let's look in the fixed type. */
4422 if (!find_struct_field (name
, t1
, 0,
4423 &field_type
, &byte_offset
, &bit_offset
,
4432 /* Convert to fixed type in all cases, so that we have proper
4433 offsets to each field in unconstrained record types. */
4434 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4435 address
, NULL
, check_tag
);
4437 if (find_struct_field (name
, t1
, 0,
4438 &field_type
, &byte_offset
, &bit_offset
,
4443 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
4444 arg
= ada_coerce_ref (arg
);
4446 arg
= ada_value_ind (arg
);
4447 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4448 bit_offset
, bit_size
,
4452 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4456 if (v
!= NULL
|| no_err
)
4459 error (_("There is no member named %s."), name
);
4465 error (_("Attempt to extract a component of "
4466 "a value that is not a record."));
4469 /* Return the value ACTUAL, converted to be an appropriate value for a
4470 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4471 allocating any necessary descriptors (fat pointers), or copies of
4472 values not residing in memory, updating it as needed. */
4475 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4477 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4478 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4479 struct type
*formal_target
=
4480 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4481 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4482 struct type
*actual_target
=
4483 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4484 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4486 if (ada_is_array_descriptor_type (formal_target
)
4487 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4488 return make_array_descriptor (formal_type
, actual
);
4489 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4490 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4492 struct value
*result
;
4494 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4495 && ada_is_array_descriptor_type (actual_target
))
4496 result
= desc_data (actual
);
4497 else if (TYPE_CODE (formal_type
) != TYPE_CODE_PTR
)
4499 if (VALUE_LVAL (actual
) != lval_memory
)
4503 actual_type
= ada_check_typedef (value_type (actual
));
4504 val
= allocate_value (actual_type
);
4505 memcpy ((char *) value_contents_raw (val
),
4506 (char *) value_contents (actual
),
4507 TYPE_LENGTH (actual_type
));
4508 actual
= ensure_lval (val
);
4510 result
= value_addr (actual
);
4514 return value_cast_pointers (formal_type
, result
, 0);
4516 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4517 return ada_value_ind (actual
);
4518 else if (ada_is_aligner_type (formal_type
))
4520 /* We need to turn this parameter into an aligner type
4522 struct value
*aligner
= allocate_value (formal_type
);
4523 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4525 value_assign_to_component (aligner
, component
, actual
);
4532 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4533 type TYPE. This is usually an inefficient no-op except on some targets
4534 (such as AVR) where the representation of a pointer and an address
4538 value_pointer (struct value
*value
, struct type
*type
)
4540 struct gdbarch
*gdbarch
= get_type_arch (type
);
4541 unsigned len
= TYPE_LENGTH (type
);
4542 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4545 addr
= value_address (value
);
4546 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4547 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4552 /* Push a descriptor of type TYPE for array value ARR on the stack at
4553 *SP, updating *SP to reflect the new descriptor. Return either
4554 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4555 to-descriptor type rather than a descriptor type), a struct value *
4556 representing a pointer to this descriptor. */
4558 static struct value
*
4559 make_array_descriptor (struct type
*type
, struct value
*arr
)
4561 struct type
*bounds_type
= desc_bounds_type (type
);
4562 struct type
*desc_type
= desc_base_type (type
);
4563 struct value
*descriptor
= allocate_value (desc_type
);
4564 struct value
*bounds
= allocate_value (bounds_type
);
4567 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4570 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4571 ada_array_bound (arr
, i
, 0),
4572 desc_bound_bitpos (bounds_type
, i
, 0),
4573 desc_bound_bitsize (bounds_type
, i
, 0));
4574 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4575 ada_array_bound (arr
, i
, 1),
4576 desc_bound_bitpos (bounds_type
, i
, 1),
4577 desc_bound_bitsize (bounds_type
, i
, 1));
4580 bounds
= ensure_lval (bounds
);
4582 modify_field (value_type (descriptor
),
4583 value_contents_writeable (descriptor
),
4584 value_pointer (ensure_lval (arr
),
4585 TYPE_FIELD_TYPE (desc_type
, 0)),
4586 fat_pntr_data_bitpos (desc_type
),
4587 fat_pntr_data_bitsize (desc_type
));
4589 modify_field (value_type (descriptor
),
4590 value_contents_writeable (descriptor
),
4591 value_pointer (bounds
,
4592 TYPE_FIELD_TYPE (desc_type
, 1)),
4593 fat_pntr_bounds_bitpos (desc_type
),
4594 fat_pntr_bounds_bitsize (desc_type
));
4596 descriptor
= ensure_lval (descriptor
);
4598 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4599 return value_addr (descriptor
);
4604 /* Symbol Cache Module */
4606 /* Performance measurements made as of 2010-01-15 indicate that
4607 this cache does bring some noticeable improvements. Depending
4608 on the type of entity being printed, the cache can make it as much
4609 as an order of magnitude faster than without it.
4611 The descriptive type DWARF extension has significantly reduced
4612 the need for this cache, at least when DWARF is being used. However,
4613 even in this case, some expensive name-based symbol searches are still
4614 sometimes necessary - to find an XVZ variable, mostly. */
4616 /* Initialize the contents of SYM_CACHE. */
4619 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4621 obstack_init (&sym_cache
->cache_space
);
4622 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4625 /* Free the memory used by SYM_CACHE. */
4628 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4630 obstack_free (&sym_cache
->cache_space
, NULL
);
4634 /* Return the symbol cache associated to the given program space PSPACE.
4635 If not allocated for this PSPACE yet, allocate and initialize one. */
4637 static struct ada_symbol_cache
*
4638 ada_get_symbol_cache (struct program_space
*pspace
)
4640 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4642 if (pspace_data
->sym_cache
== NULL
)
4644 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4645 ada_init_symbol_cache (pspace_data
->sym_cache
);
4648 return pspace_data
->sym_cache
;
4651 /* Clear all entries from the symbol cache. */
4654 ada_clear_symbol_cache (void)
4656 struct ada_symbol_cache
*sym_cache
4657 = ada_get_symbol_cache (current_program_space
);
4659 obstack_free (&sym_cache
->cache_space
, NULL
);
4660 ada_init_symbol_cache (sym_cache
);
4663 /* Search our cache for an entry matching NAME and DOMAIN.
4664 Return it if found, or NULL otherwise. */
4666 static struct cache_entry
**
4667 find_entry (const char *name
, domain_enum domain
)
4669 struct ada_symbol_cache
*sym_cache
4670 = ada_get_symbol_cache (current_program_space
);
4671 int h
= msymbol_hash (name
) % HASH_SIZE
;
4672 struct cache_entry
**e
;
4674 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4676 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4682 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4683 Return 1 if found, 0 otherwise.
4685 If an entry was found and SYM is not NULL, set *SYM to the entry's
4686 SYM. Same principle for BLOCK if not NULL. */
4689 lookup_cached_symbol (const char *name
, domain_enum domain
,
4690 struct symbol
**sym
, const struct block
**block
)
4692 struct cache_entry
**e
= find_entry (name
, domain
);
4699 *block
= (*e
)->block
;
4703 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4704 in domain DOMAIN, save this result in our symbol cache. */
4707 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4708 const struct block
*block
)
4710 struct ada_symbol_cache
*sym_cache
4711 = ada_get_symbol_cache (current_program_space
);
4713 struct cache_entry
*e
;
4715 /* Symbols for builtin types don't have a block.
4716 For now don't cache such symbols. */
4717 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4720 /* If the symbol is a local symbol, then do not cache it, as a search
4721 for that symbol depends on the context. To determine whether
4722 the symbol is local or not, we check the block where we found it
4723 against the global and static blocks of its associated symtab. */
4725 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4726 GLOBAL_BLOCK
) != block
4727 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4728 STATIC_BLOCK
) != block
)
4731 h
= msymbol_hash (name
) % HASH_SIZE
;
4732 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4733 e
->next
= sym_cache
->root
[h
];
4734 sym_cache
->root
[h
] = e
;
4735 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4743 /* Return the symbol name match type that should be used used when
4744 searching for all symbols matching LOOKUP_NAME.
4746 LOOKUP_NAME is expected to be a symbol name after transformation
4749 static symbol_name_match_type
4750 name_match_type_from_name (const char *lookup_name
)
4752 return (strstr (lookup_name
, "__") == NULL
4753 ? symbol_name_match_type::WILD
4754 : symbol_name_match_type::FULL
);
4757 /* Return the result of a standard (literal, C-like) lookup of NAME in
4758 given DOMAIN, visible from lexical block BLOCK. */
4760 static struct symbol
*
4761 standard_lookup (const char *name
, const struct block
*block
,
4764 /* Initialize it just to avoid a GCC false warning. */
4765 struct block_symbol sym
= {};
4767 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4769 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4770 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4775 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4776 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4777 since they contend in overloading in the same way. */
4779 is_nonfunction (struct block_symbol syms
[], int n
)
4783 for (i
= 0; i
< n
; i
+= 1)
4784 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_FUNC
4785 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
4786 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4792 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4793 struct types. Otherwise, they may not. */
4796 equiv_types (struct type
*type0
, struct type
*type1
)
4800 if (type0
== NULL
|| type1
== NULL
4801 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4803 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4804 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4805 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4806 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4812 /* True iff SYM0 represents the same entity as SYM1, or one that is
4813 no more defined than that of SYM1. */
4816 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4820 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4821 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4824 switch (SYMBOL_CLASS (sym0
))
4830 struct type
*type0
= SYMBOL_TYPE (sym0
);
4831 struct type
*type1
= SYMBOL_TYPE (sym1
);
4832 const char *name0
= sym0
->linkage_name ();
4833 const char *name1
= sym1
->linkage_name ();
4834 int len0
= strlen (name0
);
4837 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4838 && (equiv_types (type0
, type1
)
4839 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4840 && startswith (name1
+ len0
, "___XV")));
4843 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4844 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4848 const char *name0
= sym0
->linkage_name ();
4849 const char *name1
= sym1
->linkage_name ();
4850 return (strcmp (name0
, name1
) == 0
4851 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4859 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4860 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4863 add_defn_to_vec (struct obstack
*obstackp
,
4865 const struct block
*block
)
4868 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4870 /* Do not try to complete stub types, as the debugger is probably
4871 already scanning all symbols matching a certain name at the
4872 time when this function is called. Trying to replace the stub
4873 type by its associated full type will cause us to restart a scan
4874 which may lead to an infinite recursion. Instead, the client
4875 collecting the matching symbols will end up collecting several
4876 matches, with at least one of them complete. It can then filter
4877 out the stub ones if needed. */
4879 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4881 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4883 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4885 prevDefns
[i
].symbol
= sym
;
4886 prevDefns
[i
].block
= block
;
4892 struct block_symbol info
;
4896 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4900 /* Number of block_symbol structures currently collected in current vector in
4904 num_defns_collected (struct obstack
*obstackp
)
4906 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4909 /* Vector of block_symbol structures currently collected in current vector in
4910 OBSTACKP. If FINISH, close off the vector and return its final address. */
4912 static struct block_symbol
*
4913 defns_collected (struct obstack
*obstackp
, int finish
)
4916 return (struct block_symbol
*) obstack_finish (obstackp
);
4918 return (struct block_symbol
*) obstack_base (obstackp
);
4921 /* Return a bound minimal symbol matching NAME according to Ada
4922 decoding rules. Returns an invalid symbol if there is no such
4923 minimal symbol. Names prefixed with "standard__" are handled
4924 specially: "standard__" is first stripped off, and only static and
4925 global symbols are searched. */
4927 struct bound_minimal_symbol
4928 ada_lookup_simple_minsym (const char *name
)
4930 struct bound_minimal_symbol result
;
4932 memset (&result
, 0, sizeof (result
));
4934 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4935 lookup_name_info
lookup_name (name
, match_type
);
4937 symbol_name_matcher_ftype
*match_name
4938 = ada_get_symbol_name_matcher (lookup_name
);
4940 for (objfile
*objfile
: current_program_space
->objfiles ())
4942 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4944 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4945 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4947 result
.minsym
= msymbol
;
4948 result
.objfile
= objfile
;
4957 /* For all subprograms that statically enclose the subprogram of the
4958 selected frame, add symbols matching identifier NAME in DOMAIN
4959 and their blocks to the list of data in OBSTACKP, as for
4960 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4961 with a wildcard prefix. */
4964 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4965 const lookup_name_info
&lookup_name
,
4970 /* True if TYPE is definitely an artificial type supplied to a symbol
4971 for which no debugging information was given in the symbol file. */
4974 is_nondebugging_type (struct type
*type
)
4976 const char *name
= ada_type_name (type
);
4978 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4981 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4982 that are deemed "identical" for practical purposes.
4984 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4985 types and that their number of enumerals is identical (in other
4986 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4989 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4993 /* The heuristic we use here is fairly conservative. We consider
4994 that 2 enumerate types are identical if they have the same
4995 number of enumerals and that all enumerals have the same
4996 underlying value and name. */
4998 /* All enums in the type should have an identical underlying value. */
4999 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
5000 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
5003 /* All enumerals should also have the same name (modulo any numerical
5005 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
5007 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
5008 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
5009 int len_1
= strlen (name_1
);
5010 int len_2
= strlen (name_2
);
5012 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
5013 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
5015 || strncmp (TYPE_FIELD_NAME (type1
, i
),
5016 TYPE_FIELD_NAME (type2
, i
),
5024 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
5025 that are deemed "identical" for practical purposes. Sometimes,
5026 enumerals are not strictly identical, but their types are so similar
5027 that they can be considered identical.
5029 For instance, consider the following code:
5031 type Color is (Black, Red, Green, Blue, White);
5032 type RGB_Color is new Color range Red .. Blue;
5034 Type RGB_Color is a subrange of an implicit type which is a copy
5035 of type Color. If we call that implicit type RGB_ColorB ("B" is
5036 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5037 As a result, when an expression references any of the enumeral
5038 by name (Eg. "print green"), the expression is technically
5039 ambiguous and the user should be asked to disambiguate. But
5040 doing so would only hinder the user, since it wouldn't matter
5041 what choice he makes, the outcome would always be the same.
5042 So, for practical purposes, we consider them as the same. */
5045 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
5049 /* Before performing a thorough comparison check of each type,
5050 we perform a series of inexpensive checks. We expect that these
5051 checks will quickly fail in the vast majority of cases, and thus
5052 help prevent the unnecessary use of a more expensive comparison.
5053 Said comparison also expects us to make some of these checks
5054 (see ada_identical_enum_types_p). */
5056 /* Quick check: All symbols should have an enum type. */
5057 for (i
= 0; i
< syms
.size (); i
++)
5058 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
)
5061 /* Quick check: They should all have the same value. */
5062 for (i
= 1; i
< syms
.size (); i
++)
5063 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5066 /* Quick check: They should all have the same number of enumerals. */
5067 for (i
= 1; i
< syms
.size (); i
++)
5068 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].symbol
))
5069 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].symbol
)))
5072 /* All the sanity checks passed, so we might have a set of
5073 identical enumeration types. Perform a more complete
5074 comparison of the type of each symbol. */
5075 for (i
= 1; i
< syms
.size (); i
++)
5076 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5077 SYMBOL_TYPE (syms
[0].symbol
)))
5083 /* Remove any non-debugging symbols in SYMS that definitely
5084 duplicate other symbols in the list (The only case I know of where
5085 this happens is when object files containing stabs-in-ecoff are
5086 linked with files containing ordinary ecoff debugging symbols (or no
5087 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5088 Returns the number of items in the modified list. */
5091 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5095 /* We should never be called with less than 2 symbols, as there
5096 cannot be any extra symbol in that case. But it's easy to
5097 handle, since we have nothing to do in that case. */
5098 if (syms
->size () < 2)
5099 return syms
->size ();
5102 while (i
< syms
->size ())
5106 /* If two symbols have the same name and one of them is a stub type,
5107 the get rid of the stub. */
5109 if (TYPE_STUB (SYMBOL_TYPE ((*syms
)[i
].symbol
))
5110 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5112 for (j
= 0; j
< syms
->size (); j
++)
5115 && !TYPE_STUB (SYMBOL_TYPE ((*syms
)[j
].symbol
))
5116 && (*syms
)[j
].symbol
->linkage_name () != NULL
5117 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5118 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5123 /* Two symbols with the same name, same class and same address
5124 should be identical. */
5126 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5127 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5128 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5130 for (j
= 0; j
< syms
->size (); j
+= 1)
5133 && (*syms
)[j
].symbol
->linkage_name () != NULL
5134 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5135 (*syms
)[j
].symbol
->linkage_name ()) == 0
5136 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5137 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5138 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5139 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5145 syms
->erase (syms
->begin () + i
);
5150 /* If all the remaining symbols are identical enumerals, then
5151 just keep the first one and discard the rest.
5153 Unlike what we did previously, we do not discard any entry
5154 unless they are ALL identical. This is because the symbol
5155 comparison is not a strict comparison, but rather a practical
5156 comparison. If all symbols are considered identical, then
5157 we can just go ahead and use the first one and discard the rest.
5158 But if we cannot reduce the list to a single element, we have
5159 to ask the user to disambiguate anyways. And if we have to
5160 present a multiple-choice menu, it's less confusing if the list
5161 isn't missing some choices that were identical and yet distinct. */
5162 if (symbols_are_identical_enums (*syms
))
5165 return syms
->size ();
5168 /* Given a type that corresponds to a renaming entity, use the type name
5169 to extract the scope (package name or function name, fully qualified,
5170 and following the GNAT encoding convention) where this renaming has been
5174 xget_renaming_scope (struct type
*renaming_type
)
5176 /* The renaming types adhere to the following convention:
5177 <scope>__<rename>___<XR extension>.
5178 So, to extract the scope, we search for the "___XR" extension,
5179 and then backtrack until we find the first "__". */
5181 const char *name
= TYPE_NAME (renaming_type
);
5182 const char *suffix
= strstr (name
, "___XR");
5185 /* Now, backtrack a bit until we find the first "__". Start looking
5186 at suffix - 3, as the <rename> part is at least one character long. */
5188 for (last
= suffix
- 3; last
> name
; last
--)
5189 if (last
[0] == '_' && last
[1] == '_')
5192 /* Make a copy of scope and return it. */
5193 return std::string (name
, last
);
5196 /* Return nonzero if NAME corresponds to a package name. */
5199 is_package_name (const char *name
)
5201 /* Here, We take advantage of the fact that no symbols are generated
5202 for packages, while symbols are generated for each function.
5203 So the condition for NAME represent a package becomes equivalent
5204 to NAME not existing in our list of symbols. There is only one
5205 small complication with library-level functions (see below). */
5207 /* If it is a function that has not been defined at library level,
5208 then we should be able to look it up in the symbols. */
5209 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5212 /* Library-level function names start with "_ada_". See if function
5213 "_ada_" followed by NAME can be found. */
5215 /* Do a quick check that NAME does not contain "__", since library-level
5216 functions names cannot contain "__" in them. */
5217 if (strstr (name
, "__") != NULL
)
5220 std::string fun_name
= string_printf ("_ada_%s", name
);
5222 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5225 /* Return nonzero if SYM corresponds to a renaming entity that is
5226 not visible from FUNCTION_NAME. */
5229 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5231 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5234 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5236 /* If the rename has been defined in a package, then it is visible. */
5237 if (is_package_name (scope
.c_str ()))
5240 /* Check that the rename is in the current function scope by checking
5241 that its name starts with SCOPE. */
5243 /* If the function name starts with "_ada_", it means that it is
5244 a library-level function. Strip this prefix before doing the
5245 comparison, as the encoding for the renaming does not contain
5247 if (startswith (function_name
, "_ada_"))
5250 return !startswith (function_name
, scope
.c_str ());
5253 /* Remove entries from SYMS that corresponds to a renaming entity that
5254 is not visible from the function associated with CURRENT_BLOCK or
5255 that is superfluous due to the presence of more specific renaming
5256 information. Places surviving symbols in the initial entries of
5257 SYMS and returns the number of surviving symbols.
5260 First, in cases where an object renaming is implemented as a
5261 reference variable, GNAT may produce both the actual reference
5262 variable and the renaming encoding. In this case, we discard the
5265 Second, GNAT emits a type following a specified encoding for each renaming
5266 entity. Unfortunately, STABS currently does not support the definition
5267 of types that are local to a given lexical block, so all renamings types
5268 are emitted at library level. As a consequence, if an application
5269 contains two renaming entities using the same name, and a user tries to
5270 print the value of one of these entities, the result of the ada symbol
5271 lookup will also contain the wrong renaming type.
5273 This function partially covers for this limitation by attempting to
5274 remove from the SYMS list renaming symbols that should be visible
5275 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5276 method with the current information available. The implementation
5277 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5279 - When the user tries to print a rename in a function while there
5280 is another rename entity defined in a package: Normally, the
5281 rename in the function has precedence over the rename in the
5282 package, so the latter should be removed from the list. This is
5283 currently not the case.
5285 - This function will incorrectly remove valid renames if
5286 the CURRENT_BLOCK corresponds to a function which symbol name
5287 has been changed by an "Export" pragma. As a consequence,
5288 the user will be unable to print such rename entities. */
5291 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5292 const struct block
*current_block
)
5294 struct symbol
*current_function
;
5295 const char *current_function_name
;
5297 int is_new_style_renaming
;
5299 /* If there is both a renaming foo___XR... encoded as a variable and
5300 a simple variable foo in the same block, discard the latter.
5301 First, zero out such symbols, then compress. */
5302 is_new_style_renaming
= 0;
5303 for (i
= 0; i
< syms
->size (); i
+= 1)
5305 struct symbol
*sym
= (*syms
)[i
].symbol
;
5306 const struct block
*block
= (*syms
)[i
].block
;
5310 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5312 name
= sym
->linkage_name ();
5313 suffix
= strstr (name
, "___XR");
5317 int name_len
= suffix
- name
;
5320 is_new_style_renaming
= 1;
5321 for (j
= 0; j
< syms
->size (); j
+= 1)
5322 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5323 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5325 && block
== (*syms
)[j
].block
)
5326 (*syms
)[j
].symbol
= NULL
;
5329 if (is_new_style_renaming
)
5333 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5334 if ((*syms
)[j
].symbol
!= NULL
)
5336 (*syms
)[k
] = (*syms
)[j
];
5342 /* Extract the function name associated to CURRENT_BLOCK.
5343 Abort if unable to do so. */
5345 if (current_block
== NULL
)
5346 return syms
->size ();
5348 current_function
= block_linkage_function (current_block
);
5349 if (current_function
== NULL
)
5350 return syms
->size ();
5352 current_function_name
= current_function
->linkage_name ();
5353 if (current_function_name
== NULL
)
5354 return syms
->size ();
5356 /* Check each of the symbols, and remove it from the list if it is
5357 a type corresponding to a renaming that is out of the scope of
5358 the current block. */
5361 while (i
< syms
->size ())
5363 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5364 == ADA_OBJECT_RENAMING
5365 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5366 current_function_name
))
5367 syms
->erase (syms
->begin () + i
);
5372 return syms
->size ();
5375 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5376 whose name and domain match NAME and DOMAIN respectively.
5377 If no match was found, then extend the search to "enclosing"
5378 routines (in other words, if we're inside a nested function,
5379 search the symbols defined inside the enclosing functions).
5380 If WILD_MATCH_P is nonzero, perform the naming matching in
5381 "wild" mode (see function "wild_match" for more info).
5383 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5386 ada_add_local_symbols (struct obstack
*obstackp
,
5387 const lookup_name_info
&lookup_name
,
5388 const struct block
*block
, domain_enum domain
)
5390 int block_depth
= 0;
5392 while (block
!= NULL
)
5395 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5397 /* If we found a non-function match, assume that's the one. */
5398 if (is_nonfunction (defns_collected (obstackp
, 0),
5399 num_defns_collected (obstackp
)))
5402 block
= BLOCK_SUPERBLOCK (block
);
5405 /* If no luck so far, try to find NAME as a local symbol in some lexically
5406 enclosing subprogram. */
5407 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5408 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5411 /* An object of this type is used as the user_data argument when
5412 calling the map_matching_symbols method. */
5416 struct objfile
*objfile
;
5417 struct obstack
*obstackp
;
5418 struct symbol
*arg_sym
;
5422 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5423 to a list of symbols. DATA is a pointer to a struct match_data *
5424 containing the obstack that collects the symbol list, the file that SYM
5425 must come from, a flag indicating whether a non-argument symbol has
5426 been found in the current block, and the last argument symbol
5427 passed in SYM within the current block (if any). When SYM is null,
5428 marking the end of a block, the argument symbol is added if no
5429 other has been found. */
5432 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5433 struct match_data
*data
)
5435 const struct block
*block
= bsym
->block
;
5436 struct symbol
*sym
= bsym
->symbol
;
5440 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5441 add_defn_to_vec (data
->obstackp
,
5442 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5444 data
->found_sym
= 0;
5445 data
->arg_sym
= NULL
;
5449 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5451 else if (SYMBOL_IS_ARGUMENT (sym
))
5452 data
->arg_sym
= sym
;
5455 data
->found_sym
= 1;
5456 add_defn_to_vec (data
->obstackp
,
5457 fixup_symbol_section (sym
, data
->objfile
),
5464 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5465 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5466 symbols to OBSTACKP. Return whether we found such symbols. */
5469 ada_add_block_renamings (struct obstack
*obstackp
,
5470 const struct block
*block
,
5471 const lookup_name_info
&lookup_name
,
5474 struct using_direct
*renaming
;
5475 int defns_mark
= num_defns_collected (obstackp
);
5477 symbol_name_matcher_ftype
*name_match
5478 = ada_get_symbol_name_matcher (lookup_name
);
5480 for (renaming
= block_using (block
);
5482 renaming
= renaming
->next
)
5486 /* Avoid infinite recursions: skip this renaming if we are actually
5487 already traversing it.
5489 Currently, symbol lookup in Ada don't use the namespace machinery from
5490 C++/Fortran support: skip namespace imports that use them. */
5491 if (renaming
->searched
5492 || (renaming
->import_src
!= NULL
5493 && renaming
->import_src
[0] != '\0')
5494 || (renaming
->import_dest
!= NULL
5495 && renaming
->import_dest
[0] != '\0'))
5497 renaming
->searched
= 1;
5499 /* TODO: here, we perform another name-based symbol lookup, which can
5500 pull its own multiple overloads. In theory, we should be able to do
5501 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5502 not a simple name. But in order to do this, we would need to enhance
5503 the DWARF reader to associate a symbol to this renaming, instead of a
5504 name. So, for now, we do something simpler: re-use the C++/Fortran
5505 namespace machinery. */
5506 r_name
= (renaming
->alias
!= NULL
5508 : renaming
->declaration
);
5509 if (name_match (r_name
, lookup_name
, NULL
))
5511 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5512 lookup_name
.match_type ());
5513 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5516 renaming
->searched
= 0;
5518 return num_defns_collected (obstackp
) != defns_mark
;
5521 /* Implements compare_names, but only applying the comparision using
5522 the given CASING. */
5525 compare_names_with_case (const char *string1
, const char *string2
,
5526 enum case_sensitivity casing
)
5528 while (*string1
!= '\0' && *string2
!= '\0')
5532 if (isspace (*string1
) || isspace (*string2
))
5533 return strcmp_iw_ordered (string1
, string2
);
5535 if (casing
== case_sensitive_off
)
5537 c1
= tolower (*string1
);
5538 c2
= tolower (*string2
);
5555 return strcmp_iw_ordered (string1
, string2
);
5557 if (*string2
== '\0')
5559 if (is_name_suffix (string1
))
5566 if (*string2
== '(')
5567 return strcmp_iw_ordered (string1
, string2
);
5570 if (casing
== case_sensitive_off
)
5571 return tolower (*string1
) - tolower (*string2
);
5573 return *string1
- *string2
;
5578 /* Compare STRING1 to STRING2, with results as for strcmp.
5579 Compatible with strcmp_iw_ordered in that...
5581 strcmp_iw_ordered (STRING1, STRING2) <= 0
5585 compare_names (STRING1, STRING2) <= 0
5587 (they may differ as to what symbols compare equal). */
5590 compare_names (const char *string1
, const char *string2
)
5594 /* Similar to what strcmp_iw_ordered does, we need to perform
5595 a case-insensitive comparison first, and only resort to
5596 a second, case-sensitive, comparison if the first one was
5597 not sufficient to differentiate the two strings. */
5599 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5601 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5606 /* Convenience function to get at the Ada encoded lookup name for
5607 LOOKUP_NAME, as a C string. */
5610 ada_lookup_name (const lookup_name_info
&lookup_name
)
5612 return lookup_name
.ada ().lookup_name ().c_str ();
5615 /* Add to OBSTACKP all non-local symbols whose name and domain match
5616 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5617 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5618 symbols otherwise. */
5621 add_nonlocal_symbols (struct obstack
*obstackp
,
5622 const lookup_name_info
&lookup_name
,
5623 domain_enum domain
, int global
)
5625 struct match_data data
;
5627 memset (&data
, 0, sizeof data
);
5628 data
.obstackp
= obstackp
;
5630 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5632 auto callback
= [&] (struct block_symbol
*bsym
)
5634 return aux_add_nonlocal_symbols (bsym
, &data
);
5637 for (objfile
*objfile
: current_program_space
->objfiles ())
5639 data
.objfile
= objfile
;
5641 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5642 domain
, global
, callback
,
5644 ? NULL
: compare_names
));
5646 for (compunit_symtab
*cu
: objfile
->compunits ())
5648 const struct block
*global_block
5649 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5651 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5657 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5659 const char *name
= ada_lookup_name (lookup_name
);
5660 lookup_name_info
name1 (std::string ("<_ada_") + name
+ '>',
5661 symbol_name_match_type::FULL
);
5663 for (objfile
*objfile
: current_program_space
->objfiles ())
5665 data
.objfile
= objfile
;
5666 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5667 domain
, global
, callback
,
5673 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5674 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5675 returning the number of matches. Add these to OBSTACKP.
5677 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5678 symbol match within the nest of blocks whose innermost member is BLOCK,
5679 is the one match returned (no other matches in that or
5680 enclosing blocks is returned). If there are any matches in or
5681 surrounding BLOCK, then these alone are returned.
5683 Names prefixed with "standard__" are handled specially:
5684 "standard__" is first stripped off (by the lookup_name
5685 constructor), and only static and global symbols are searched.
5687 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5688 to lookup global symbols. */
5691 ada_add_all_symbols (struct obstack
*obstackp
,
5692 const struct block
*block
,
5693 const lookup_name_info
&lookup_name
,
5696 int *made_global_lookup_p
)
5700 if (made_global_lookup_p
)
5701 *made_global_lookup_p
= 0;
5703 /* Special case: If the user specifies a symbol name inside package
5704 Standard, do a non-wild matching of the symbol name without
5705 the "standard__" prefix. This was primarily introduced in order
5706 to allow the user to specifically access the standard exceptions
5707 using, for instance, Standard.Constraint_Error when Constraint_Error
5708 is ambiguous (due to the user defining its own Constraint_Error
5709 entity inside its program). */
5710 if (lookup_name
.ada ().standard_p ())
5713 /* Check the non-global symbols. If we have ANY match, then we're done. */
5718 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5721 /* In the !full_search case we're are being called by
5722 ada_iterate_over_symbols, and we don't want to search
5724 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5726 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5730 /* No non-global symbols found. Check our cache to see if we have
5731 already performed this search before. If we have, then return
5734 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5735 domain
, &sym
, &block
))
5738 add_defn_to_vec (obstackp
, sym
, block
);
5742 if (made_global_lookup_p
)
5743 *made_global_lookup_p
= 1;
5745 /* Search symbols from all global blocks. */
5747 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5749 /* Now add symbols from all per-file blocks if we've gotten no hits
5750 (not strictly correct, but perhaps better than an error). */
5752 if (num_defns_collected (obstackp
) == 0)
5753 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5756 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5757 is non-zero, enclosing scope and in global scopes, returning the number of
5759 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5760 found and the blocks and symbol tables (if any) in which they were
5763 When full_search is non-zero, any non-function/non-enumeral
5764 symbol match within the nest of blocks whose innermost member is BLOCK,
5765 is the one match returned (no other matches in that or
5766 enclosing blocks is returned). If there are any matches in or
5767 surrounding BLOCK, then these alone are returned.
5769 Names prefixed with "standard__" are handled specially: "standard__"
5770 is first stripped off, and only static and global symbols are searched. */
5773 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5774 const struct block
*block
,
5776 std::vector
<struct block_symbol
> *results
,
5779 int syms_from_global_search
;
5781 auto_obstack obstack
;
5783 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5784 domain
, full_search
, &syms_from_global_search
);
5786 ndefns
= num_defns_collected (&obstack
);
5788 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5789 for (int i
= 0; i
< ndefns
; ++i
)
5790 results
->push_back (base
[i
]);
5792 ndefns
= remove_extra_symbols (results
);
5794 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5795 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5797 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5798 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5799 (*results
)[0].symbol
, (*results
)[0].block
);
5801 ndefns
= remove_irrelevant_renamings (results
, block
);
5806 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5807 in global scopes, returning the number of matches, and filling *RESULTS
5808 with (SYM,BLOCK) tuples.
5810 See ada_lookup_symbol_list_worker for further details. */
5813 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5815 std::vector
<struct block_symbol
> *results
)
5817 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5818 lookup_name_info
lookup_name (name
, name_match_type
);
5820 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5823 /* Implementation of the la_iterate_over_symbols method. */
5826 ada_iterate_over_symbols
5827 (const struct block
*block
, const lookup_name_info
&name
,
5829 gdb::function_view
<symbol_found_callback_ftype
> callback
)
5832 std::vector
<struct block_symbol
> results
;
5834 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5836 for (i
= 0; i
< ndefs
; ++i
)
5838 if (!callback (&results
[i
]))
5845 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5846 to 1, but choosing the first symbol found if there are multiple
5849 The result is stored in *INFO, which must be non-NULL.
5850 If no match is found, INFO->SYM is set to NULL. */
5853 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5855 struct block_symbol
*info
)
5857 /* Since we already have an encoded name, wrap it in '<>' to force a
5858 verbatim match. Otherwise, if the name happens to not look like
5859 an encoded name (because it doesn't include a "__"),
5860 ada_lookup_name_info would re-encode/fold it again, and that
5861 would e.g., incorrectly lowercase object renaming names like
5862 "R28b" -> "r28b". */
5863 std::string verbatim
= std::string ("<") + name
+ '>';
5865 gdb_assert (info
!= NULL
);
5866 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5869 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5870 scope and in global scopes, or NULL if none. NAME is folded and
5871 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5872 choosing the first symbol if there are multiple choices. */
5875 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5878 std::vector
<struct block_symbol
> candidates
;
5881 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5883 if (n_candidates
== 0)
5886 block_symbol info
= candidates
[0];
5887 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5891 static struct block_symbol
5892 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5894 const struct block
*block
,
5895 const domain_enum domain
)
5897 struct block_symbol sym
;
5899 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
5900 if (sym
.symbol
!= NULL
)
5903 /* If we haven't found a match at this point, try the primitive
5904 types. In other languages, this search is performed before
5905 searching for global symbols in order to short-circuit that
5906 global-symbol search if it happens that the name corresponds
5907 to a primitive type. But we cannot do the same in Ada, because
5908 it is perfectly legitimate for a program to declare a type which
5909 has the same name as a standard type. If looking up a type in
5910 that situation, we have traditionally ignored the primitive type
5911 in favor of user-defined types. This is why, unlike most other
5912 languages, we search the primitive types this late and only after
5913 having searched the global symbols without success. */
5915 if (domain
== VAR_DOMAIN
)
5917 struct gdbarch
*gdbarch
;
5920 gdbarch
= target_gdbarch ();
5922 gdbarch
= block_gdbarch (block
);
5923 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5924 if (sym
.symbol
!= NULL
)
5932 /* True iff STR is a possible encoded suffix of a normal Ada name
5933 that is to be ignored for matching purposes. Suffixes of parallel
5934 names (e.g., XVE) are not included here. Currently, the possible suffixes
5935 are given by any of the regular expressions:
5937 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5938 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5939 TKB [subprogram suffix for task bodies]
5940 _E[0-9]+[bs]$ [protected object entry suffixes]
5941 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5943 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5944 match is performed. This sequence is used to differentiate homonyms,
5945 is an optional part of a valid name suffix. */
5948 is_name_suffix (const char *str
)
5951 const char *matching
;
5952 const int len
= strlen (str
);
5954 /* Skip optional leading __[0-9]+. */
5956 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5959 while (isdigit (str
[0]))
5965 if (str
[0] == '.' || str
[0] == '$')
5968 while (isdigit (matching
[0]))
5970 if (matching
[0] == '\0')
5976 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5979 while (isdigit (matching
[0]))
5981 if (matching
[0] == '\0')
5985 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5987 if (strcmp (str
, "TKB") == 0)
5991 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5992 with a N at the end. Unfortunately, the compiler uses the same
5993 convention for other internal types it creates. So treating
5994 all entity names that end with an "N" as a name suffix causes
5995 some regressions. For instance, consider the case of an enumerated
5996 type. To support the 'Image attribute, it creates an array whose
5998 Having a single character like this as a suffix carrying some
5999 information is a bit risky. Perhaps we should change the encoding
6000 to be something like "_N" instead. In the meantime, do not do
6001 the following check. */
6002 /* Protected Object Subprograms */
6003 if (len
== 1 && str
[0] == 'N')
6008 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
6011 while (isdigit (matching
[0]))
6013 if ((matching
[0] == 'b' || matching
[0] == 's')
6014 && matching
[1] == '\0')
6018 /* ??? We should not modify STR directly, as we are doing below. This
6019 is fine in this case, but may become problematic later if we find
6020 that this alternative did not work, and want to try matching
6021 another one from the begining of STR. Since we modified it, we
6022 won't be able to find the begining of the string anymore! */
6026 while (str
[0] != '_' && str
[0] != '\0')
6028 if (str
[0] != 'n' && str
[0] != 'b')
6034 if (str
[0] == '\000')
6039 if (str
[1] != '_' || str
[2] == '\000')
6043 if (strcmp (str
+ 3, "JM") == 0)
6045 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6046 the LJM suffix in favor of the JM one. But we will
6047 still accept LJM as a valid suffix for a reasonable
6048 amount of time, just to allow ourselves to debug programs
6049 compiled using an older version of GNAT. */
6050 if (strcmp (str
+ 3, "LJM") == 0)
6054 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
6055 || str
[4] == 'U' || str
[4] == 'P')
6057 if (str
[4] == 'R' && str
[5] != 'T')
6061 if (!isdigit (str
[2]))
6063 for (k
= 3; str
[k
] != '\0'; k
+= 1)
6064 if (!isdigit (str
[k
]) && str
[k
] != '_')
6068 if (str
[0] == '$' && isdigit (str
[1]))
6070 for (k
= 2; str
[k
] != '\0'; k
+= 1)
6071 if (!isdigit (str
[k
]) && str
[k
] != '_')
6078 /* Return non-zero if the string starting at NAME and ending before
6079 NAME_END contains no capital letters. */
6082 is_valid_name_for_wild_match (const char *name0
)
6084 std::string decoded_name
= ada_decode (name0
);
6087 /* If the decoded name starts with an angle bracket, it means that
6088 NAME0 does not follow the GNAT encoding format. It should then
6089 not be allowed as a possible wild match. */
6090 if (decoded_name
[0] == '<')
6093 for (i
=0; decoded_name
[i
] != '\0'; i
++)
6094 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6100 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6101 that could start a simple name. Assumes that *NAMEP points into
6102 the string beginning at NAME0. */
6105 advance_wild_match (const char **namep
, const char *name0
, int target0
)
6107 const char *name
= *namep
;
6117 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6120 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6125 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6126 || name
[2] == target0
))
6134 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6144 /* Return true iff NAME encodes a name of the form prefix.PATN.
6145 Ignores any informational suffixes of NAME (i.e., for which
6146 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6150 wild_match (const char *name
, const char *patn
)
6153 const char *name0
= name
;
6157 const char *match
= name
;
6161 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6164 if (*p
== '\0' && is_name_suffix (name
))
6165 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6167 if (name
[-1] == '_')
6170 if (!advance_wild_match (&name
, name0
, *patn
))
6175 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6176 any trailing suffixes that encode debugging information or leading
6177 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6178 information that is ignored). */
6181 full_match (const char *sym_name
, const char *search_name
)
6183 size_t search_name_len
= strlen (search_name
);
6185 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6186 && is_name_suffix (sym_name
+ search_name_len
))
6189 if (startswith (sym_name
, "_ada_")
6190 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6191 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6197 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6198 *defn_symbols, updating the list of symbols in OBSTACKP (if
6199 necessary). OBJFILE is the section containing BLOCK. */
6202 ada_add_block_symbols (struct obstack
*obstackp
,
6203 const struct block
*block
,
6204 const lookup_name_info
&lookup_name
,
6205 domain_enum domain
, struct objfile
*objfile
)
6207 struct block_iterator iter
;
6208 /* A matching argument symbol, if any. */
6209 struct symbol
*arg_sym
;
6210 /* Set true when we find a matching non-argument symbol. */
6216 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6218 sym
= block_iter_match_next (lookup_name
, &iter
))
6220 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6222 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6224 if (SYMBOL_IS_ARGUMENT (sym
))
6229 add_defn_to_vec (obstackp
,
6230 fixup_symbol_section (sym
, objfile
),
6237 /* Handle renamings. */
6239 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6242 if (!found_sym
&& arg_sym
!= NULL
)
6244 add_defn_to_vec (obstackp
,
6245 fixup_symbol_section (arg_sym
, objfile
),
6249 if (!lookup_name
.ada ().wild_match_p ())
6253 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6254 const char *name
= ada_lookup_name
.c_str ();
6255 size_t name_len
= ada_lookup_name
.size ();
6257 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6259 if (symbol_matches_domain (sym
->language (),
6260 SYMBOL_DOMAIN (sym
), domain
))
6264 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6267 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6269 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6274 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6276 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6278 if (SYMBOL_IS_ARGUMENT (sym
))
6283 add_defn_to_vec (obstackp
,
6284 fixup_symbol_section (sym
, objfile
),
6292 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6293 They aren't parameters, right? */
6294 if (!found_sym
&& arg_sym
!= NULL
)
6296 add_defn_to_vec (obstackp
,
6297 fixup_symbol_section (arg_sym
, objfile
),
6304 /* Symbol Completion */
6309 ada_lookup_name_info::matches
6310 (const char *sym_name
,
6311 symbol_name_match_type match_type
,
6312 completion_match_result
*comp_match_res
) const
6315 const char *text
= m_encoded_name
.c_str ();
6316 size_t text_len
= m_encoded_name
.size ();
6318 /* First, test against the fully qualified name of the symbol. */
6320 if (strncmp (sym_name
, text
, text_len
) == 0)
6323 std::string decoded_name
= ada_decode (sym_name
);
6324 if (match
&& !m_encoded_p
)
6326 /* One needed check before declaring a positive match is to verify
6327 that iff we are doing a verbatim match, the decoded version
6328 of the symbol name starts with '<'. Otherwise, this symbol name
6329 is not a suitable completion. */
6331 bool has_angle_bracket
= (decoded_name
[0] == '<');
6332 match
= (has_angle_bracket
== m_verbatim_p
);
6335 if (match
&& !m_verbatim_p
)
6337 /* When doing non-verbatim match, another check that needs to
6338 be done is to verify that the potentially matching symbol name
6339 does not include capital letters, because the ada-mode would
6340 not be able to understand these symbol names without the
6341 angle bracket notation. */
6344 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6349 /* Second: Try wild matching... */
6351 if (!match
&& m_wild_match_p
)
6353 /* Since we are doing wild matching, this means that TEXT
6354 may represent an unqualified symbol name. We therefore must
6355 also compare TEXT against the unqualified name of the symbol. */
6356 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6358 if (strncmp (sym_name
, text
, text_len
) == 0)
6362 /* Finally: If we found a match, prepare the result to return. */
6367 if (comp_match_res
!= NULL
)
6369 std::string
&match_str
= comp_match_res
->match
.storage ();
6372 match_str
= ada_decode (sym_name
);
6376 match_str
= add_angle_brackets (sym_name
);
6378 match_str
= sym_name
;
6382 comp_match_res
->set_match (match_str
.c_str ());
6388 /* Add the list of possible symbol names completing TEXT to TRACKER.
6389 WORD is the entire command on which completion is made. */
6392 ada_collect_symbol_completion_matches (completion_tracker
&tracker
,
6393 complete_symbol_mode mode
,
6394 symbol_name_match_type name_match_type
,
6395 const char *text
, const char *word
,
6396 enum type_code code
)
6399 const struct block
*b
, *surrounding_static_block
= 0;
6400 struct block_iterator iter
;
6402 gdb_assert (code
== TYPE_CODE_UNDEF
);
6404 lookup_name_info
lookup_name (text
, name_match_type
, true);
6406 /* First, look at the partial symtab symbols. */
6407 expand_symtabs_matching (NULL
,
6413 /* At this point scan through the misc symbol vectors and add each
6414 symbol you find to the list. Eventually we want to ignore
6415 anything that isn't a text symbol (everything else will be
6416 handled by the psymtab code above). */
6418 for (objfile
*objfile
: current_program_space
->objfiles ())
6420 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
6424 if (completion_skip_symbol (mode
, msymbol
))
6427 language symbol_language
= msymbol
->language ();
6429 /* Ada minimal symbols won't have their language set to Ada. If
6430 we let completion_list_add_name compare using the
6431 default/C-like matcher, then when completing e.g., symbols in a
6432 package named "pck", we'd match internal Ada symbols like
6433 "pckS", which are invalid in an Ada expression, unless you wrap
6434 them in '<' '>' to request a verbatim match.
6436 Unfortunately, some Ada encoded names successfully demangle as
6437 C++ symbols (using an old mangling scheme), such as "name__2Xn"
6438 -> "Xn::name(void)" and thus some Ada minimal symbols end up
6439 with the wrong language set. Paper over that issue here. */
6440 if (symbol_language
== language_auto
6441 || symbol_language
== language_cplus
)
6442 symbol_language
= language_ada
;
6444 completion_list_add_name (tracker
,
6446 msymbol
->linkage_name (),
6447 lookup_name
, text
, word
);
6451 /* Search upwards from currently selected frame (so that we can
6452 complete on local vars. */
6454 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6456 if (!BLOCK_SUPERBLOCK (b
))
6457 surrounding_static_block
= b
; /* For elmin of dups */
6459 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6461 if (completion_skip_symbol (mode
, sym
))
6464 completion_list_add_name (tracker
,
6466 sym
->linkage_name (),
6467 lookup_name
, text
, word
);
6471 /* Go through the symtabs and check the externs and statics for
6472 symbols which match. */
6474 for (objfile
*objfile
: current_program_space
->objfiles ())
6476 for (compunit_symtab
*s
: objfile
->compunits ())
6479 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6480 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6482 if (completion_skip_symbol (mode
, sym
))
6485 completion_list_add_name (tracker
,
6487 sym
->linkage_name (),
6488 lookup_name
, text
, word
);
6493 for (objfile
*objfile
: current_program_space
->objfiles ())
6495 for (compunit_symtab
*s
: objfile
->compunits ())
6498 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6499 /* Don't do this block twice. */
6500 if (b
== surrounding_static_block
)
6502 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6504 if (completion_skip_symbol (mode
, sym
))
6507 completion_list_add_name (tracker
,
6509 sym
->linkage_name (),
6510 lookup_name
, text
, word
);
6518 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6519 for tagged types. */
6522 ada_is_dispatch_table_ptr_type (struct type
*type
)
6526 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6529 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6533 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6536 /* Return non-zero if TYPE is an interface tag. */
6539 ada_is_interface_tag (struct type
*type
)
6541 const char *name
= TYPE_NAME (type
);
6546 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6549 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6550 to be invisible to users. */
6553 ada_is_ignored_field (struct type
*type
, int field_num
)
6555 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6558 /* Check the name of that field. */
6560 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6562 /* Anonymous field names should not be printed.
6563 brobecker/2007-02-20: I don't think this can actually happen
6564 but we don't want to print the value of anonymous fields anyway. */
6568 /* Normally, fields whose name start with an underscore ("_")
6569 are fields that have been internally generated by the compiler,
6570 and thus should not be printed. The "_parent" field is special,
6571 however: This is a field internally generated by the compiler
6572 for tagged types, and it contains the components inherited from
6573 the parent type. This field should not be printed as is, but
6574 should not be ignored either. */
6575 if (name
[0] == '_' && !startswith (name
, "_parent"))
6579 /* If this is the dispatch table of a tagged type or an interface tag,
6581 if (ada_is_tagged_type (type
, 1)
6582 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6583 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6586 /* Not a special field, so it should not be ignored. */
6590 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6591 pointer or reference type whose ultimate target has a tag field. */
6594 ada_is_tagged_type (struct type
*type
, int refok
)
6596 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6599 /* True iff TYPE represents the type of X'Tag */
6602 ada_is_tag_type (struct type
*type
)
6604 type
= ada_check_typedef (type
);
6606 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6610 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6612 return (name
!= NULL
6613 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6617 /* The type of the tag on VAL. */
6619 static struct type
*
6620 ada_tag_type (struct value
*val
)
6622 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6625 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6626 retired at Ada 05). */
6629 is_ada95_tag (struct value
*tag
)
6631 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6634 /* The value of the tag on VAL. */
6636 static struct value
*
6637 ada_value_tag (struct value
*val
)
6639 return ada_value_struct_elt (val
, "_tag", 0);
6642 /* The value of the tag on the object of type TYPE whose contents are
6643 saved at VALADDR, if it is non-null, or is at memory address
6646 static struct value
*
6647 value_tag_from_contents_and_address (struct type
*type
,
6648 const gdb_byte
*valaddr
,
6651 int tag_byte_offset
;
6652 struct type
*tag_type
;
6654 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6657 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6659 : valaddr
+ tag_byte_offset
);
6660 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6662 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6667 static struct type
*
6668 type_from_tag (struct value
*tag
)
6670 const char *type_name
= ada_tag_name (tag
);
6672 if (type_name
!= NULL
)
6673 return ada_find_any_type (ada_encode (type_name
));
6677 /* Given a value OBJ of a tagged type, return a value of this
6678 type at the base address of the object. The base address, as
6679 defined in Ada.Tags, it is the address of the primary tag of
6680 the object, and therefore where the field values of its full
6681 view can be fetched. */
6684 ada_tag_value_at_base_address (struct value
*obj
)
6687 LONGEST offset_to_top
= 0;
6688 struct type
*ptr_type
, *obj_type
;
6690 CORE_ADDR base_address
;
6692 obj_type
= value_type (obj
);
6694 /* It is the responsability of the caller to deref pointers. */
6696 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6697 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6700 tag
= ada_value_tag (obj
);
6704 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6706 if (is_ada95_tag (tag
))
6709 ptr_type
= language_lookup_primitive_type
6710 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6711 ptr_type
= lookup_pointer_type (ptr_type
);
6712 val
= value_cast (ptr_type
, tag
);
6716 /* It is perfectly possible that an exception be raised while
6717 trying to determine the base address, just like for the tag;
6718 see ada_tag_name for more details. We do not print the error
6719 message for the same reason. */
6723 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6726 catch (const gdb_exception_error
&e
)
6731 /* If offset is null, nothing to do. */
6733 if (offset_to_top
== 0)
6736 /* -1 is a special case in Ada.Tags; however, what should be done
6737 is not quite clear from the documentation. So do nothing for
6740 if (offset_to_top
== -1)
6743 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6744 from the base address. This was however incompatible with
6745 C++ dispatch table: C++ uses a *negative* value to *add*
6746 to the base address. Ada's convention has therefore been
6747 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6748 use the same convention. Here, we support both cases by
6749 checking the sign of OFFSET_TO_TOP. */
6751 if (offset_to_top
> 0)
6752 offset_to_top
= -offset_to_top
;
6754 base_address
= value_address (obj
) + offset_to_top
;
6755 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6757 /* Make sure that we have a proper tag at the new address.
6758 Otherwise, offset_to_top is bogus (which can happen when
6759 the object is not initialized yet). */
6764 obj_type
= type_from_tag (tag
);
6769 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6772 /* Return the "ada__tags__type_specific_data" type. */
6774 static struct type
*
6775 ada_get_tsd_type (struct inferior
*inf
)
6777 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6779 if (data
->tsd_type
== 0)
6780 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6781 return data
->tsd_type
;
6784 /* Return the TSD (type-specific data) associated to the given TAG.
6785 TAG is assumed to be the tag of a tagged-type entity.
6787 May return NULL if we are unable to get the TSD. */
6789 static struct value
*
6790 ada_get_tsd_from_tag (struct value
*tag
)
6795 /* First option: The TSD is simply stored as a field of our TAG.
6796 Only older versions of GNAT would use this format, but we have
6797 to test it first, because there are no visible markers for
6798 the current approach except the absence of that field. */
6800 val
= ada_value_struct_elt (tag
, "tsd", 1);
6804 /* Try the second representation for the dispatch table (in which
6805 there is no explicit 'tsd' field in the referent of the tag pointer,
6806 and instead the tsd pointer is stored just before the dispatch
6809 type
= ada_get_tsd_type (current_inferior());
6812 type
= lookup_pointer_type (lookup_pointer_type (type
));
6813 val
= value_cast (type
, tag
);
6816 return value_ind (value_ptradd (val
, -1));
6819 /* Given the TSD of a tag (type-specific data), return a string
6820 containing the name of the associated type.
6822 The returned value is good until the next call. May return NULL
6823 if we are unable to determine the tag name. */
6826 ada_tag_name_from_tsd (struct value
*tsd
)
6828 static char name
[1024];
6832 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6835 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6836 for (p
= name
; *p
!= '\0'; p
+= 1)
6842 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6845 Return NULL if the TAG is not an Ada tag, or if we were unable to
6846 determine the name of that tag. The result is good until the next
6850 ada_tag_name (struct value
*tag
)
6854 if (!ada_is_tag_type (value_type (tag
)))
6857 /* It is perfectly possible that an exception be raised while trying
6858 to determine the TAG's name, even under normal circumstances:
6859 The associated variable may be uninitialized or corrupted, for
6860 instance. We do not let any exception propagate past this point.
6861 instead we return NULL.
6863 We also do not print the error message either (which often is very
6864 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6865 the caller print a more meaningful message if necessary. */
6868 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6871 name
= ada_tag_name_from_tsd (tsd
);
6873 catch (const gdb_exception_error
&e
)
6880 /* The parent type of TYPE, or NULL if none. */
6883 ada_parent_type (struct type
*type
)
6887 type
= ada_check_typedef (type
);
6889 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6892 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6893 if (ada_is_parent_field (type
, i
))
6895 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6897 /* If the _parent field is a pointer, then dereference it. */
6898 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6899 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6900 /* If there is a parallel XVS type, get the actual base type. */
6901 parent_type
= ada_get_base_type (parent_type
);
6903 return ada_check_typedef (parent_type
);
6909 /* True iff field number FIELD_NUM of structure type TYPE contains the
6910 parent-type (inherited) fields of a derived type. Assumes TYPE is
6911 a structure type with at least FIELD_NUM+1 fields. */
6914 ada_is_parent_field (struct type
*type
, int field_num
)
6916 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6918 return (name
!= NULL
6919 && (startswith (name
, "PARENT")
6920 || startswith (name
, "_parent")));
6923 /* True iff field number FIELD_NUM of structure type TYPE is a
6924 transparent wrapper field (which should be silently traversed when doing
6925 field selection and flattened when printing). Assumes TYPE is a
6926 structure type with at least FIELD_NUM+1 fields. Such fields are always
6930 ada_is_wrapper_field (struct type
*type
, int field_num
)
6932 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6934 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6936 /* This happens in functions with "out" or "in out" parameters
6937 which are passed by copy. For such functions, GNAT describes
6938 the function's return type as being a struct where the return
6939 value is in a field called RETVAL, and where the other "out"
6940 or "in out" parameters are fields of that struct. This is not
6945 return (name
!= NULL
6946 && (startswith (name
, "PARENT")
6947 || strcmp (name
, "REP") == 0
6948 || startswith (name
, "_parent")
6949 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6952 /* True iff field number FIELD_NUM of structure or union type TYPE
6953 is a variant wrapper. Assumes TYPE is a structure type with at least
6954 FIELD_NUM+1 fields. */
6957 ada_is_variant_part (struct type
*type
, int field_num
)
6959 /* Only Ada types are eligible. */
6960 if (!ADA_TYPE_P (type
))
6963 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6965 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6966 || (is_dynamic_field (type
, field_num
)
6967 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6968 == TYPE_CODE_UNION
)));
6971 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6972 whose discriminants are contained in the record type OUTER_TYPE,
6973 returns the type of the controlling discriminant for the variant.
6974 May return NULL if the type could not be found. */
6977 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6979 const char *name
= ada_variant_discrim_name (var_type
);
6981 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6984 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6985 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6986 represents a 'when others' clause; otherwise 0. */
6989 ada_is_others_clause (struct type
*type
, int field_num
)
6991 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6993 return (name
!= NULL
&& name
[0] == 'O');
6996 /* Assuming that TYPE0 is the type of the variant part of a record,
6997 returns the name of the discriminant controlling the variant.
6998 The value is valid until the next call to ada_variant_discrim_name. */
7001 ada_variant_discrim_name (struct type
*type0
)
7003 static char *result
= NULL
;
7004 static size_t result_len
= 0;
7007 const char *discrim_end
;
7008 const char *discrim_start
;
7010 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
7011 type
= TYPE_TARGET_TYPE (type0
);
7015 name
= ada_type_name (type
);
7017 if (name
== NULL
|| name
[0] == '\000')
7020 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
7023 if (startswith (discrim_end
, "___XVN"))
7026 if (discrim_end
== name
)
7029 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
7032 if (discrim_start
== name
+ 1)
7034 if ((discrim_start
> name
+ 3
7035 && startswith (discrim_start
- 3, "___"))
7036 || discrim_start
[-1] == '.')
7040 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
7041 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
7042 result
[discrim_end
- discrim_start
] = '\0';
7046 /* Scan STR for a subtype-encoded number, beginning at position K.
7047 Put the position of the character just past the number scanned in
7048 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7049 Return 1 if there was a valid number at the given position, and 0
7050 otherwise. A "subtype-encoded" number consists of the absolute value
7051 in decimal, followed by the letter 'm' to indicate a negative number.
7052 Assumes 0m does not occur. */
7055 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
7059 if (!isdigit (str
[k
]))
7062 /* Do it the hard way so as not to make any assumption about
7063 the relationship of unsigned long (%lu scan format code) and
7066 while (isdigit (str
[k
]))
7068 RU
= RU
* 10 + (str
[k
] - '0');
7075 *R
= (-(LONGEST
) (RU
- 1)) - 1;
7081 /* NOTE on the above: Technically, C does not say what the results of
7082 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7083 number representable as a LONGEST (although either would probably work
7084 in most implementations). When RU>0, the locution in the then branch
7085 above is always equivalent to the negative of RU. */
7092 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7093 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7094 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7097 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
7099 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7113 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
7123 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
7124 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7126 if (val
>= L
&& val
<= U
)
7138 /* FIXME: Lots of redundancy below. Try to consolidate. */
7140 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7141 ARG_TYPE, extract and return the value of one of its (non-static)
7142 fields. FIELDNO says which field. Differs from value_primitive_field
7143 only in that it can handle packed values of arbitrary type. */
7145 static struct value
*
7146 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7147 struct type
*arg_type
)
7151 arg_type
= ada_check_typedef (arg_type
);
7152 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
7154 /* Handle packed fields. It might be that the field is not packed
7155 relative to its containing structure, but the structure itself is
7156 packed; in this case we must take the bit-field path. */
7157 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
7159 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7160 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7162 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7163 offset
+ bit_pos
/ 8,
7164 bit_pos
% 8, bit_size
, type
);
7167 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7170 /* Find field with name NAME in object of type TYPE. If found,
7171 set the following for each argument that is non-null:
7172 - *FIELD_TYPE_P to the field's type;
7173 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7174 an object of that type;
7175 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7176 - *BIT_SIZE_P to its size in bits if the field is packed, and
7178 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7179 fields up to but not including the desired field, or by the total
7180 number of fields if not found. A NULL value of NAME never
7181 matches; the function just counts visible fields in this case.
7183 Notice that we need to handle when a tagged record hierarchy
7184 has some components with the same name, like in this scenario:
7186 type Top_T is tagged record
7192 type Middle_T is new Top.Top_T with record
7193 N : Character := 'a';
7197 type Bottom_T is new Middle.Middle_T with record
7199 C : Character := '5';
7201 A : Character := 'J';
7204 Let's say we now have a variable declared and initialized as follow:
7206 TC : Top_A := new Bottom_T;
7208 And then we use this variable to call this function
7210 procedure Assign (Obj: in out Top_T; TV : Integer);
7214 Assign (Top_T (B), 12);
7216 Now, we're in the debugger, and we're inside that procedure
7217 then and we want to print the value of obj.c:
7219 Usually, the tagged record or one of the parent type owns the
7220 component to print and there's no issue but in this particular
7221 case, what does it mean to ask for Obj.C? Since the actual
7222 type for object is type Bottom_T, it could mean two things: type
7223 component C from the Middle_T view, but also component C from
7224 Bottom_T. So in that "undefined" case, when the component is
7225 not found in the non-resolved type (which includes all the
7226 components of the parent type), then resolve it and see if we
7227 get better luck once expanded.
7229 In the case of homonyms in the derived tagged type, we don't
7230 guaranty anything, and pick the one that's easiest for us
7233 Returns 1 if found, 0 otherwise. */
7236 find_struct_field (const char *name
, struct type
*type
, int offset
,
7237 struct type
**field_type_p
,
7238 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7242 int parent_offset
= -1;
7244 type
= ada_check_typedef (type
);
7246 if (field_type_p
!= NULL
)
7247 *field_type_p
= NULL
;
7248 if (byte_offset_p
!= NULL
)
7250 if (bit_offset_p
!= NULL
)
7252 if (bit_size_p
!= NULL
)
7255 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7257 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7258 int fld_offset
= offset
+ bit_pos
/ 8;
7259 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7261 if (t_field_name
== NULL
)
7264 else if (ada_is_parent_field (type
, i
))
7266 /* This is a field pointing us to the parent type of a tagged
7267 type. As hinted in this function's documentation, we give
7268 preference to fields in the current record first, so what
7269 we do here is just record the index of this field before
7270 we skip it. If it turns out we couldn't find our field
7271 in the current record, then we'll get back to it and search
7272 inside it whether the field might exist in the parent. */
7278 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7280 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7282 if (field_type_p
!= NULL
)
7283 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7284 if (byte_offset_p
!= NULL
)
7285 *byte_offset_p
= fld_offset
;
7286 if (bit_offset_p
!= NULL
)
7287 *bit_offset_p
= bit_pos
% 8;
7288 if (bit_size_p
!= NULL
)
7289 *bit_size_p
= bit_size
;
7292 else if (ada_is_wrapper_field (type
, i
))
7294 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7295 field_type_p
, byte_offset_p
, bit_offset_p
,
7296 bit_size_p
, index_p
))
7299 else if (ada_is_variant_part (type
, i
))
7301 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7304 struct type
*field_type
7305 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7307 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7309 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7311 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7312 field_type_p
, byte_offset_p
,
7313 bit_offset_p
, bit_size_p
, index_p
))
7317 else if (index_p
!= NULL
)
7321 /* Field not found so far. If this is a tagged type which
7322 has a parent, try finding that field in the parent now. */
7324 if (parent_offset
!= -1)
7326 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7327 int fld_offset
= offset
+ bit_pos
/ 8;
7329 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, parent_offset
),
7330 fld_offset
, field_type_p
, byte_offset_p
,
7331 bit_offset_p
, bit_size_p
, index_p
))
7338 /* Number of user-visible fields in record type TYPE. */
7341 num_visible_fields (struct type
*type
)
7346 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7350 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7351 and search in it assuming it has (class) type TYPE.
7352 If found, return value, else return NULL.
7354 Searches recursively through wrapper fields (e.g., '_parent').
7356 In the case of homonyms in the tagged types, please refer to the
7357 long explanation in find_struct_field's function documentation. */
7359 static struct value
*
7360 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7364 int parent_offset
= -1;
7366 type
= ada_check_typedef (type
);
7367 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7369 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7371 if (t_field_name
== NULL
)
7374 else if (ada_is_parent_field (type
, i
))
7376 /* This is a field pointing us to the parent type of a tagged
7377 type. As hinted in this function's documentation, we give
7378 preference to fields in the current record first, so what
7379 we do here is just record the index of this field before
7380 we skip it. If it turns out we couldn't find our field
7381 in the current record, then we'll get back to it and search
7382 inside it whether the field might exist in the parent. */
7388 else if (field_name_match (t_field_name
, name
))
7389 return ada_value_primitive_field (arg
, offset
, i
, type
);
7391 else if (ada_is_wrapper_field (type
, i
))
7393 struct value
*v
= /* Do not let indent join lines here. */
7394 ada_search_struct_field (name
, arg
,
7395 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7396 TYPE_FIELD_TYPE (type
, i
));
7402 else if (ada_is_variant_part (type
, i
))
7404 /* PNH: Do we ever get here? See find_struct_field. */
7406 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7408 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7410 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7412 struct value
*v
= ada_search_struct_field
/* Force line
7415 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7416 TYPE_FIELD_TYPE (field_type
, j
));
7424 /* Field not found so far. If this is a tagged type which
7425 has a parent, try finding that field in the parent now. */
7427 if (parent_offset
!= -1)
7429 struct value
*v
= ada_search_struct_field (
7430 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7431 TYPE_FIELD_TYPE (type
, parent_offset
));
7440 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7441 int, struct type
*);
7444 /* Return field #INDEX in ARG, where the index is that returned by
7445 * find_struct_field through its INDEX_P argument. Adjust the address
7446 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7447 * If found, return value, else return NULL. */
7449 static struct value
*
7450 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7453 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7457 /* Auxiliary function for ada_index_struct_field. Like
7458 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7461 static struct value
*
7462 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7466 type
= ada_check_typedef (type
);
7468 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7470 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7472 else if (ada_is_wrapper_field (type
, i
))
7474 struct value
*v
= /* Do not let indent join lines here. */
7475 ada_index_struct_field_1 (index_p
, arg
,
7476 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7477 TYPE_FIELD_TYPE (type
, i
));
7483 else if (ada_is_variant_part (type
, i
))
7485 /* PNH: Do we ever get here? See ada_search_struct_field,
7486 find_struct_field. */
7487 error (_("Cannot assign this kind of variant record"));
7489 else if (*index_p
== 0)
7490 return ada_value_primitive_field (arg
, offset
, i
, type
);
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 OUTER, determine which variant clause (field number in VAR_TYPE,
7665 numbering from 0) is applicable. Returns -1 if none are. */
7668 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7672 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7673 struct value
*discrim
;
7674 LONGEST discrim_val
;
7676 /* Using plain value_from_contents_and_address here causes problems
7677 because we will end up trying to resolve a type that is currently
7678 being constructed. */
7679 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7680 if (discrim
== NULL
)
7682 discrim_val
= value_as_long (discrim
);
7685 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7687 if (ada_is_others_clause (var_type
, i
))
7689 else if (ada_in_variant (discrim_val
, var_type
, i
))
7693 return others_clause
;
7698 /* Dynamic-Sized Records */
7700 /* Strategy: The type ostensibly attached to a value with dynamic size
7701 (i.e., a size that is not statically recorded in the debugging
7702 data) does not accurately reflect the size or layout of the value.
7703 Our strategy is to convert these values to values with accurate,
7704 conventional types that are constructed on the fly. */
7706 /* There is a subtle and tricky problem here. In general, we cannot
7707 determine the size of dynamic records without its data. However,
7708 the 'struct value' data structure, which GDB uses to represent
7709 quantities in the inferior process (the target), requires the size
7710 of the type at the time of its allocation in order to reserve space
7711 for GDB's internal copy of the data. That's why the
7712 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7713 rather than struct value*s.
7715 However, GDB's internal history variables ($1, $2, etc.) are
7716 struct value*s containing internal copies of the data that are not, in
7717 general, the same as the data at their corresponding addresses in
7718 the target. Fortunately, the types we give to these values are all
7719 conventional, fixed-size types (as per the strategy described
7720 above), so that we don't usually have to perform the
7721 'to_fixed_xxx_type' conversions to look at their values.
7722 Unfortunately, there is one exception: if one of the internal
7723 history variables is an array whose elements are unconstrained
7724 records, then we will need to create distinct fixed types for each
7725 element selected. */
7727 /* The upshot of all of this is that many routines take a (type, host
7728 address, target address) triple as arguments to represent a value.
7729 The host address, if non-null, is supposed to contain an internal
7730 copy of the relevant data; otherwise, the program is to consult the
7731 target at the target address. */
7733 /* Assuming that VAL0 represents a pointer value, the result of
7734 dereferencing it. Differs from value_ind in its treatment of
7735 dynamic-sized types. */
7738 ada_value_ind (struct value
*val0
)
7740 struct value
*val
= value_ind (val0
);
7742 if (ada_is_tagged_type (value_type (val
), 0))
7743 val
= ada_tag_value_at_base_address (val
);
7745 return ada_to_fixed_value (val
);
7748 /* The value resulting from dereferencing any "reference to"
7749 qualifiers on VAL0. */
7751 static struct value
*
7752 ada_coerce_ref (struct value
*val0
)
7754 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7756 struct value
*val
= val0
;
7758 val
= coerce_ref (val
);
7760 if (ada_is_tagged_type (value_type (val
), 0))
7761 val
= ada_tag_value_at_base_address (val
);
7763 return ada_to_fixed_value (val
);
7769 /* Return OFF rounded upward if necessary to a multiple of
7770 ALIGNMENT (a power of 2). */
7773 align_value (unsigned int off
, unsigned int alignment
)
7775 return (off
+ alignment
- 1) & ~(alignment
- 1);
7778 /* Return the bit alignment required for field #F of template type TYPE. */
7781 field_alignment (struct type
*type
, int f
)
7783 const char *name
= TYPE_FIELD_NAME (type
, f
);
7787 /* The field name should never be null, unless the debugging information
7788 is somehow malformed. In this case, we assume the field does not
7789 require any alignment. */
7793 len
= strlen (name
);
7795 if (!isdigit (name
[len
- 1]))
7798 if (isdigit (name
[len
- 2]))
7799 align_offset
= len
- 2;
7801 align_offset
= len
- 1;
7803 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7804 return TARGET_CHAR_BIT
;
7806 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7809 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7811 static struct symbol
*
7812 ada_find_any_type_symbol (const char *name
)
7816 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7817 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7820 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7824 /* Find a type named NAME. Ignores ambiguity. This routine will look
7825 solely for types defined by debug info, it will not search the GDB
7828 static struct type
*
7829 ada_find_any_type (const char *name
)
7831 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7834 return SYMBOL_TYPE (sym
);
7839 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7840 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7841 symbol, in which case it is returned. Otherwise, this looks for
7842 symbols whose name is that of NAME_SYM suffixed with "___XR".
7843 Return symbol if found, and NULL otherwise. */
7846 ada_is_renaming_symbol (struct symbol
*name_sym
)
7848 const char *name
= name_sym
->linkage_name ();
7849 return strstr (name
, "___XR") != NULL
;
7852 /* Because of GNAT encoding conventions, several GDB symbols may match a
7853 given type name. If the type denoted by TYPE0 is to be preferred to
7854 that of TYPE1 for purposes of type printing, return non-zero;
7855 otherwise return 0. */
7858 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7862 else if (type0
== NULL
)
7864 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7866 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7868 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7870 else if (ada_is_constrained_packed_array_type (type0
))
7872 else if (ada_is_array_descriptor_type (type0
)
7873 && !ada_is_array_descriptor_type (type1
))
7877 const char *type0_name
= TYPE_NAME (type0
);
7878 const char *type1_name
= TYPE_NAME (type1
);
7880 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7881 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7887 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7891 ada_type_name (struct type
*type
)
7895 return TYPE_NAME (type
);
7898 /* Search the list of "descriptive" types associated to TYPE for a type
7899 whose name is NAME. */
7901 static struct type
*
7902 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7904 struct type
*result
, *tmp
;
7906 if (ada_ignore_descriptive_types_p
)
7909 /* If there no descriptive-type info, then there is no parallel type
7911 if (!HAVE_GNAT_AUX_INFO (type
))
7914 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7915 while (result
!= NULL
)
7917 const char *result_name
= ada_type_name (result
);
7919 if (result_name
== NULL
)
7921 warning (_("unexpected null name on descriptive type"));
7925 /* If the names match, stop. */
7926 if (strcmp (result_name
, name
) == 0)
7929 /* Otherwise, look at the next item on the list, if any. */
7930 if (HAVE_GNAT_AUX_INFO (result
))
7931 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7935 /* If not found either, try after having resolved the typedef. */
7940 result
= check_typedef (result
);
7941 if (HAVE_GNAT_AUX_INFO (result
))
7942 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7948 /* If we didn't find a match, see whether this is a packed array. With
7949 older compilers, the descriptive type information is either absent or
7950 irrelevant when it comes to packed arrays so the above lookup fails.
7951 Fall back to using a parallel lookup by name in this case. */
7952 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7953 return ada_find_any_type (name
);
7958 /* Find a parallel type to TYPE with the specified NAME, using the
7959 descriptive type taken from the debugging information, if available,
7960 and otherwise using the (slower) name-based method. */
7962 static struct type
*
7963 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7965 struct type
*result
= NULL
;
7967 if (HAVE_GNAT_AUX_INFO (type
))
7968 result
= find_parallel_type_by_descriptive_type (type
, name
);
7970 result
= ada_find_any_type (name
);
7975 /* Same as above, but specify the name of the parallel type by appending
7976 SUFFIX to the name of TYPE. */
7979 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7982 const char *type_name
= ada_type_name (type
);
7985 if (type_name
== NULL
)
7988 len
= strlen (type_name
);
7990 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7992 strcpy (name
, type_name
);
7993 strcpy (name
+ len
, suffix
);
7995 return ada_find_parallel_type_with_name (type
, name
);
7998 /* If TYPE is a variable-size record type, return the corresponding template
7999 type describing its fields. Otherwise, return NULL. */
8001 static struct type
*
8002 dynamic_template_type (struct type
*type
)
8004 type
= ada_check_typedef (type
);
8006 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
8007 || ada_type_name (type
) == NULL
)
8011 int len
= strlen (ada_type_name (type
));
8013 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
8016 return ada_find_parallel_type (type
, "___XVE");
8020 /* Assuming that TEMPL_TYPE is a union or struct type, returns
8021 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
8024 is_dynamic_field (struct type
*templ_type
, int field_num
)
8026 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
8029 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
8030 && strstr (name
, "___XVL") != NULL
;
8033 /* The index of the variant field of TYPE, or -1 if TYPE does not
8034 represent a variant record type. */
8037 variant_field_index (struct type
*type
)
8041 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
8044 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
8046 if (ada_is_variant_part (type
, f
))
8052 /* A record type with no fields. */
8054 static struct type
*
8055 empty_record (struct type
*templ
)
8057 struct type
*type
= alloc_type_copy (templ
);
8059 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
8060 TYPE_NFIELDS (type
) = 0;
8061 TYPE_FIELDS (type
) = NULL
;
8062 INIT_NONE_SPECIFIC (type
);
8063 TYPE_NAME (type
) = "<empty>";
8064 TYPE_LENGTH (type
) = 0;
8068 /* An ordinary record type (with fixed-length fields) that describes
8069 the value of type TYPE at VALADDR or ADDRESS (see comments at
8070 the beginning of this section) VAL according to GNAT conventions.
8071 DVAL0 should describe the (portion of a) record that contains any
8072 necessary discriminants. It should be NULL if value_type (VAL) is
8073 an outer-level type (i.e., as opposed to a branch of a variant.) A
8074 variant field (unless unchecked) is replaced by a particular branch
8077 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8078 length are not statically known are discarded. As a consequence,
8079 VALADDR, ADDRESS and DVAL0 are ignored.
8081 NOTE: Limitations: For now, we assume that dynamic fields and
8082 variants occupy whole numbers of bytes. However, they need not be
8086 ada_template_to_fixed_record_type_1 (struct type
*type
,
8087 const gdb_byte
*valaddr
,
8088 CORE_ADDR address
, struct value
*dval0
,
8089 int keep_dynamic_fields
)
8091 struct value
*mark
= value_mark ();
8094 int nfields
, bit_len
;
8100 /* Compute the number of fields in this record type that are going
8101 to be processed: unless keep_dynamic_fields, this includes only
8102 fields whose position and length are static will be processed. */
8103 if (keep_dynamic_fields
)
8104 nfields
= TYPE_NFIELDS (type
);
8108 while (nfields
< TYPE_NFIELDS (type
)
8109 && !ada_is_variant_part (type
, nfields
)
8110 && !is_dynamic_field (type
, nfields
))
8114 rtype
= alloc_type_copy (type
);
8115 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8116 INIT_NONE_SPECIFIC (rtype
);
8117 TYPE_NFIELDS (rtype
) = nfields
;
8118 TYPE_FIELDS (rtype
) = (struct field
*)
8119 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8120 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
8121 TYPE_NAME (rtype
) = ada_type_name (type
);
8122 TYPE_FIXED_INSTANCE (rtype
) = 1;
8128 for (f
= 0; f
< nfields
; f
+= 1)
8130 off
= align_value (off
, field_alignment (type
, f
))
8131 + TYPE_FIELD_BITPOS (type
, f
);
8132 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
8133 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8135 if (ada_is_variant_part (type
, f
))
8140 else if (is_dynamic_field (type
, f
))
8142 const gdb_byte
*field_valaddr
= valaddr
;
8143 CORE_ADDR field_address
= address
;
8144 struct type
*field_type
=
8145 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8149 /* rtype's length is computed based on the run-time
8150 value of discriminants. If the discriminants are not
8151 initialized, the type size may be completely bogus and
8152 GDB may fail to allocate a value for it. So check the
8153 size first before creating the value. */
8154 ada_ensure_varsize_limit (rtype
);
8155 /* Using plain value_from_contents_and_address here
8156 causes problems because we will end up trying to
8157 resolve a type that is currently being
8159 dval
= value_from_contents_and_address_unresolved (rtype
,
8162 rtype
= value_type (dval
);
8167 /* If the type referenced by this field is an aligner type, we need
8168 to unwrap that aligner type, because its size might not be set.
8169 Keeping the aligner type would cause us to compute the wrong
8170 size for this field, impacting the offset of the all the fields
8171 that follow this one. */
8172 if (ada_is_aligner_type (field_type
))
8174 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8176 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8177 field_address
= cond_offset_target (field_address
, field_offset
);
8178 field_type
= ada_aligned_type (field_type
);
8181 field_valaddr
= cond_offset_host (field_valaddr
,
8182 off
/ TARGET_CHAR_BIT
);
8183 field_address
= cond_offset_target (field_address
,
8184 off
/ TARGET_CHAR_BIT
);
8186 /* Get the fixed type of the field. Note that, in this case,
8187 we do not want to get the real type out of the tag: if
8188 the current field is the parent part of a tagged record,
8189 we will get the tag of the object. Clearly wrong: the real
8190 type of the parent is not the real type of the child. We
8191 would end up in an infinite loop. */
8192 field_type
= ada_get_base_type (field_type
);
8193 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8194 field_address
, dval
, 0);
8195 /* If the field size is already larger than the maximum
8196 object size, then the record itself will necessarily
8197 be larger than the maximum object size. We need to make
8198 this check now, because the size might be so ridiculously
8199 large (due to an uninitialized variable in the inferior)
8200 that it would cause an overflow when adding it to the
8202 ada_ensure_varsize_limit (field_type
);
8204 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8205 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8206 /* The multiplication can potentially overflow. But because
8207 the field length has been size-checked just above, and
8208 assuming that the maximum size is a reasonable value,
8209 an overflow should not happen in practice. So rather than
8210 adding overflow recovery code to this already complex code,
8211 we just assume that it's not going to happen. */
8213 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8217 /* Note: If this field's type is a typedef, it is important
8218 to preserve the typedef layer.
8220 Otherwise, we might be transforming a typedef to a fat
8221 pointer (encoding a pointer to an unconstrained array),
8222 into a basic fat pointer (encoding an unconstrained
8223 array). As both types are implemented using the same
8224 structure, the typedef is the only clue which allows us
8225 to distinguish between the two options. Stripping it
8226 would prevent us from printing this field appropriately. */
8227 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8228 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8229 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8231 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8234 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8236 /* We need to be careful of typedefs when computing
8237 the length of our field. If this is a typedef,
8238 get the length of the target type, not the length
8240 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8241 field_type
= ada_typedef_target_type (field_type
);
8244 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8247 if (off
+ fld_bit_len
> bit_len
)
8248 bit_len
= off
+ fld_bit_len
;
8250 TYPE_LENGTH (rtype
) =
8251 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8254 /* We handle the variant part, if any, at the end because of certain
8255 odd cases in which it is re-ordered so as NOT to be the last field of
8256 the record. This can happen in the presence of representation
8258 if (variant_field
>= 0)
8260 struct type
*branch_type
;
8262 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8266 /* Using plain value_from_contents_and_address here causes
8267 problems because we will end up trying to resolve a type
8268 that is currently being constructed. */
8269 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8271 rtype
= value_type (dval
);
8277 to_fixed_variant_branch_type
8278 (TYPE_FIELD_TYPE (type
, variant_field
),
8279 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8280 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8281 if (branch_type
== NULL
)
8283 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8284 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8285 TYPE_NFIELDS (rtype
) -= 1;
8289 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8290 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8292 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8294 if (off
+ fld_bit_len
> bit_len
)
8295 bit_len
= off
+ fld_bit_len
;
8296 TYPE_LENGTH (rtype
) =
8297 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8301 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8302 should contain the alignment of that record, which should be a strictly
8303 positive value. If null or negative, then something is wrong, most
8304 probably in the debug info. In that case, we don't round up the size
8305 of the resulting type. If this record is not part of another structure,
8306 the current RTYPE length might be good enough for our purposes. */
8307 if (TYPE_LENGTH (type
) <= 0)
8309 if (TYPE_NAME (rtype
))
8310 warning (_("Invalid type size for `%s' detected: %s."),
8311 TYPE_NAME (rtype
), pulongest (TYPE_LENGTH (type
)));
8313 warning (_("Invalid type size for <unnamed> detected: %s."),
8314 pulongest (TYPE_LENGTH (type
)));
8318 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8319 TYPE_LENGTH (type
));
8322 value_free_to_mark (mark
);
8323 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8324 error (_("record type with dynamic size is larger than varsize-limit"));
8328 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8331 static struct type
*
8332 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8333 CORE_ADDR address
, struct value
*dval0
)
8335 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8339 /* An ordinary record type in which ___XVL-convention fields and
8340 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8341 static approximations, containing all possible fields. Uses
8342 no runtime values. Useless for use in values, but that's OK,
8343 since the results are used only for type determinations. Works on both
8344 structs and unions. Representation note: to save space, we memorize
8345 the result of this function in the TYPE_TARGET_TYPE of the
8348 static struct type
*
8349 template_to_static_fixed_type (struct type
*type0
)
8355 /* No need no do anything if the input type is already fixed. */
8356 if (TYPE_FIXED_INSTANCE (type0
))
8359 /* Likewise if we already have computed the static approximation. */
8360 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8361 return TYPE_TARGET_TYPE (type0
);
8363 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8365 nfields
= TYPE_NFIELDS (type0
);
8367 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8368 recompute all over next time. */
8369 TYPE_TARGET_TYPE (type0
) = type
;
8371 for (f
= 0; f
< nfields
; f
+= 1)
8373 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8374 struct type
*new_type
;
8376 if (is_dynamic_field (type0
, f
))
8378 field_type
= ada_check_typedef (field_type
);
8379 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8382 new_type
= static_unwrap_type (field_type
);
8384 if (new_type
!= field_type
)
8386 /* Clone TYPE0 only the first time we get a new field type. */
8389 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8390 TYPE_CODE (type
) = TYPE_CODE (type0
);
8391 INIT_NONE_SPECIFIC (type
);
8392 TYPE_NFIELDS (type
) = nfields
;
8393 TYPE_FIELDS (type
) = (struct field
*)
8394 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8395 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8396 sizeof (struct field
) * nfields
);
8397 TYPE_NAME (type
) = ada_type_name (type0
);
8398 TYPE_FIXED_INSTANCE (type
) = 1;
8399 TYPE_LENGTH (type
) = 0;
8401 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8402 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8409 /* Given an object of type TYPE whose contents are at VALADDR and
8410 whose address in memory is ADDRESS, returns a revision of TYPE,
8411 which should be a non-dynamic-sized record, in which the variant
8412 part, if any, is replaced with the appropriate branch. Looks
8413 for discriminant values in DVAL0, which can be NULL if the record
8414 contains the necessary discriminant values. */
8416 static struct type
*
8417 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8418 CORE_ADDR address
, struct value
*dval0
)
8420 struct value
*mark
= value_mark ();
8423 struct type
*branch_type
;
8424 int nfields
= TYPE_NFIELDS (type
);
8425 int variant_field
= variant_field_index (type
);
8427 if (variant_field
== -1)
8432 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8433 type
= value_type (dval
);
8438 rtype
= alloc_type_copy (type
);
8439 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8440 INIT_NONE_SPECIFIC (rtype
);
8441 TYPE_NFIELDS (rtype
) = nfields
;
8442 TYPE_FIELDS (rtype
) =
8443 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8444 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8445 sizeof (struct field
) * nfields
);
8446 TYPE_NAME (rtype
) = ada_type_name (type
);
8447 TYPE_FIXED_INSTANCE (rtype
) = 1;
8448 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8450 branch_type
= to_fixed_variant_branch_type
8451 (TYPE_FIELD_TYPE (type
, variant_field
),
8452 cond_offset_host (valaddr
,
8453 TYPE_FIELD_BITPOS (type
, variant_field
)
8455 cond_offset_target (address
,
8456 TYPE_FIELD_BITPOS (type
, variant_field
)
8457 / TARGET_CHAR_BIT
), dval
);
8458 if (branch_type
== NULL
)
8462 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8463 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8464 TYPE_NFIELDS (rtype
) -= 1;
8468 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8469 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8470 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8471 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8473 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8475 value_free_to_mark (mark
);
8479 /* An ordinary record type (with fixed-length fields) that describes
8480 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8481 beginning of this section]. Any necessary discriminants' values
8482 should be in DVAL, a record value; it may be NULL if the object
8483 at ADDR itself contains any necessary discriminant values.
8484 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8485 values from the record are needed. Except in the case that DVAL,
8486 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8487 unchecked) is replaced by a particular branch of the variant.
8489 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8490 is questionable and may be removed. It can arise during the
8491 processing of an unconstrained-array-of-record type where all the
8492 variant branches have exactly the same size. This is because in
8493 such cases, the compiler does not bother to use the XVS convention
8494 when encoding the record. I am currently dubious of this
8495 shortcut and suspect the compiler should be altered. FIXME. */
8497 static struct type
*
8498 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8499 CORE_ADDR address
, struct value
*dval
)
8501 struct type
*templ_type
;
8503 if (TYPE_FIXED_INSTANCE (type0
))
8506 templ_type
= dynamic_template_type (type0
);
8508 if (templ_type
!= NULL
)
8509 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8510 else if (variant_field_index (type0
) >= 0)
8512 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8514 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8519 TYPE_FIXED_INSTANCE (type0
) = 1;
8525 /* An ordinary record type (with fixed-length fields) that describes
8526 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8527 union type. Any necessary discriminants' values should be in DVAL,
8528 a record value. That is, this routine selects the appropriate
8529 branch of the union at ADDR according to the discriminant value
8530 indicated in the union's type name. Returns VAR_TYPE0 itself if
8531 it represents a variant subject to a pragma Unchecked_Union. */
8533 static struct type
*
8534 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8535 CORE_ADDR address
, struct value
*dval
)
8538 struct type
*templ_type
;
8539 struct type
*var_type
;
8541 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8542 var_type
= TYPE_TARGET_TYPE (var_type0
);
8544 var_type
= var_type0
;
8546 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8548 if (templ_type
!= NULL
)
8549 var_type
= templ_type
;
8551 if (is_unchecked_variant (var_type
, value_type (dval
)))
8553 which
= ada_which_variant_applies (var_type
, dval
);
8556 return empty_record (var_type
);
8557 else if (is_dynamic_field (var_type
, which
))
8558 return to_fixed_record_type
8559 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8560 valaddr
, address
, dval
);
8561 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8563 to_fixed_record_type
8564 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8566 return TYPE_FIELD_TYPE (var_type
, which
);
8569 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8570 ENCODING_TYPE, a type following the GNAT conventions for discrete
8571 type encodings, only carries redundant information. */
8574 ada_is_redundant_range_encoding (struct type
*range_type
,
8575 struct type
*encoding_type
)
8577 const char *bounds_str
;
8581 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8583 if (TYPE_CODE (get_base_type (range_type
))
8584 != TYPE_CODE (get_base_type (encoding_type
)))
8586 /* The compiler probably used a simple base type to describe
8587 the range type instead of the range's actual base type,
8588 expecting us to get the real base type from the encoding
8589 anyway. In this situation, the encoding cannot be ignored
8594 if (is_dynamic_type (range_type
))
8597 if (TYPE_NAME (encoding_type
) == NULL
)
8600 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8601 if (bounds_str
== NULL
)
8604 n
= 8; /* Skip "___XDLU_". */
8605 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8607 if (TYPE_LOW_BOUND (range_type
) != lo
)
8610 n
+= 2; /* Skip the "__" separator between the two bounds. */
8611 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8613 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8619 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8620 a type following the GNAT encoding for describing array type
8621 indices, only carries redundant information. */
8624 ada_is_redundant_index_type_desc (struct type
*array_type
,
8625 struct type
*desc_type
)
8627 struct type
*this_layer
= check_typedef (array_type
);
8630 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8632 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8633 TYPE_FIELD_TYPE (desc_type
, i
)))
8635 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8641 /* Assuming that TYPE0 is an array type describing the type of a value
8642 at ADDR, and that DVAL describes a record containing any
8643 discriminants used in TYPE0, returns a type for the value that
8644 contains no dynamic components (that is, no components whose sizes
8645 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8646 true, gives an error message if the resulting type's size is over
8649 static struct type
*
8650 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8653 struct type
*index_type_desc
;
8654 struct type
*result
;
8655 int constrained_packed_array_p
;
8656 static const char *xa_suffix
= "___XA";
8658 type0
= ada_check_typedef (type0
);
8659 if (TYPE_FIXED_INSTANCE (type0
))
8662 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8663 if (constrained_packed_array_p
)
8664 type0
= decode_constrained_packed_array_type (type0
);
8666 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8668 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8669 encoding suffixed with 'P' may still be generated. If so,
8670 it should be used to find the XA type. */
8672 if (index_type_desc
== NULL
)
8674 const char *type_name
= ada_type_name (type0
);
8676 if (type_name
!= NULL
)
8678 const int len
= strlen (type_name
);
8679 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8681 if (type_name
[len
- 1] == 'P')
8683 strcpy (name
, type_name
);
8684 strcpy (name
+ len
- 1, xa_suffix
);
8685 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8690 ada_fixup_array_indexes_type (index_type_desc
);
8691 if (index_type_desc
!= NULL
8692 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8694 /* Ignore this ___XA parallel type, as it does not bring any
8695 useful information. This allows us to avoid creating fixed
8696 versions of the array's index types, which would be identical
8697 to the original ones. This, in turn, can also help avoid
8698 the creation of fixed versions of the array itself. */
8699 index_type_desc
= NULL
;
8702 if (index_type_desc
== NULL
)
8704 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8706 /* NOTE: elt_type---the fixed version of elt_type0---should never
8707 depend on the contents of the array in properly constructed
8709 /* Create a fixed version of the array element type.
8710 We're not providing the address of an element here,
8711 and thus the actual object value cannot be inspected to do
8712 the conversion. This should not be a problem, since arrays of
8713 unconstrained objects are not allowed. In particular, all
8714 the elements of an array of a tagged type should all be of
8715 the same type specified in the debugging info. No need to
8716 consult the object tag. */
8717 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8719 /* Make sure we always create a new array type when dealing with
8720 packed array types, since we're going to fix-up the array
8721 type length and element bitsize a little further down. */
8722 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8725 result
= create_array_type (alloc_type_copy (type0
),
8726 elt_type
, TYPE_INDEX_TYPE (type0
));
8731 struct type
*elt_type0
;
8734 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8735 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8737 /* NOTE: result---the fixed version of elt_type0---should never
8738 depend on the contents of the array in properly constructed
8740 /* Create a fixed version of the array element type.
8741 We're not providing the address of an element here,
8742 and thus the actual object value cannot be inspected to do
8743 the conversion. This should not be a problem, since arrays of
8744 unconstrained objects are not allowed. In particular, all
8745 the elements of an array of a tagged type should all be of
8746 the same type specified in the debugging info. No need to
8747 consult the object tag. */
8749 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8752 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8754 struct type
*range_type
=
8755 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8757 result
= create_array_type (alloc_type_copy (elt_type0
),
8758 result
, range_type
);
8759 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8761 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8762 error (_("array type with dynamic size is larger than varsize-limit"));
8765 /* We want to preserve the type name. This can be useful when
8766 trying to get the type name of a value that has already been
8767 printed (for instance, if the user did "print VAR; whatis $". */
8768 TYPE_NAME (result
) = TYPE_NAME (type0
);
8770 if (constrained_packed_array_p
)
8772 /* So far, the resulting type has been created as if the original
8773 type was a regular (non-packed) array type. As a result, the
8774 bitsize of the array elements needs to be set again, and the array
8775 length needs to be recomputed based on that bitsize. */
8776 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8777 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8779 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8780 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8781 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8782 TYPE_LENGTH (result
)++;
8785 TYPE_FIXED_INSTANCE (result
) = 1;
8790 /* A standard type (containing no dynamically sized components)
8791 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8792 DVAL describes a record containing any discriminants used in TYPE0,
8793 and may be NULL if there are none, or if the object of type TYPE at
8794 ADDRESS or in VALADDR contains these discriminants.
8796 If CHECK_TAG is not null, in the case of tagged types, this function
8797 attempts to locate the object's tag and use it to compute the actual
8798 type. However, when ADDRESS is null, we cannot use it to determine the
8799 location of the tag, and therefore compute the tagged type's actual type.
8800 So we return the tagged type without consulting the tag. */
8802 static struct type
*
8803 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8804 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8806 type
= ada_check_typedef (type
);
8808 /* Only un-fixed types need to be handled here. */
8809 if (!HAVE_GNAT_AUX_INFO (type
))
8812 switch (TYPE_CODE (type
))
8816 case TYPE_CODE_STRUCT
:
8818 struct type
*static_type
= to_static_fixed_type (type
);
8819 struct type
*fixed_record_type
=
8820 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8822 /* If STATIC_TYPE is a tagged type and we know the object's address,
8823 then we can determine its tag, and compute the object's actual
8824 type from there. Note that we have to use the fixed record
8825 type (the parent part of the record may have dynamic fields
8826 and the way the location of _tag is expressed may depend on
8829 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8832 value_tag_from_contents_and_address
8836 struct type
*real_type
= type_from_tag (tag
);
8838 value_from_contents_and_address (fixed_record_type
,
8841 fixed_record_type
= value_type (obj
);
8842 if (real_type
!= NULL
)
8843 return to_fixed_record_type
8845 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8848 /* Check to see if there is a parallel ___XVZ variable.
8849 If there is, then it provides the actual size of our type. */
8850 else if (ada_type_name (fixed_record_type
) != NULL
)
8852 const char *name
= ada_type_name (fixed_record_type
);
8854 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8855 bool xvz_found
= false;
8858 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8861 xvz_found
= get_int_var_value (xvz_name
, size
);
8863 catch (const gdb_exception_error
&except
)
8865 /* We found the variable, but somehow failed to read
8866 its value. Rethrow the same error, but with a little
8867 bit more information, to help the user understand
8868 what went wrong (Eg: the variable might have been
8870 throw_error (except
.error
,
8871 _("unable to read value of %s (%s)"),
8872 xvz_name
, except
.what ());
8875 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8877 fixed_record_type
= copy_type (fixed_record_type
);
8878 TYPE_LENGTH (fixed_record_type
) = size
;
8880 /* The FIXED_RECORD_TYPE may have be a stub. We have
8881 observed this when the debugging info is STABS, and
8882 apparently it is something that is hard to fix.
8884 In practice, we don't need the actual type definition
8885 at all, because the presence of the XVZ variable allows us
8886 to assume that there must be a XVS type as well, which we
8887 should be able to use later, when we need the actual type
8890 In the meantime, pretend that the "fixed" type we are
8891 returning is NOT a stub, because this can cause trouble
8892 when using this type to create new types targeting it.
8893 Indeed, the associated creation routines often check
8894 whether the target type is a stub and will try to replace
8895 it, thus using a type with the wrong size. This, in turn,
8896 might cause the new type to have the wrong size too.
8897 Consider the case of an array, for instance, where the size
8898 of the array is computed from the number of elements in
8899 our array multiplied by the size of its element. */
8900 TYPE_STUB (fixed_record_type
) = 0;
8903 return fixed_record_type
;
8905 case TYPE_CODE_ARRAY
:
8906 return to_fixed_array_type (type
, dval
, 1);
8907 case TYPE_CODE_UNION
:
8911 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8915 /* The same as ada_to_fixed_type_1, except that it preserves the type
8916 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8918 The typedef layer needs be preserved in order to differentiate between
8919 arrays and array pointers when both types are implemented using the same
8920 fat pointer. In the array pointer case, the pointer is encoded as
8921 a typedef of the pointer type. For instance, considering:
8923 type String_Access is access String;
8924 S1 : String_Access := null;
8926 To the debugger, S1 is defined as a typedef of type String. But
8927 to the user, it is a pointer. So if the user tries to print S1,
8928 we should not dereference the array, but print the array address
8931 If we didn't preserve the typedef layer, we would lose the fact that
8932 the type is to be presented as a pointer (needs de-reference before
8933 being printed). And we would also use the source-level type name. */
8936 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8937 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8940 struct type
*fixed_type
=
8941 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8943 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8944 then preserve the typedef layer.
8946 Implementation note: We can only check the main-type portion of
8947 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8948 from TYPE now returns a type that has the same instance flags
8949 as TYPE. For instance, if TYPE is a "typedef const", and its
8950 target type is a "struct", then the typedef elimination will return
8951 a "const" version of the target type. See check_typedef for more
8952 details about how the typedef layer elimination is done.
8954 brobecker/2010-11-19: It seems to me that the only case where it is
8955 useful to preserve the typedef layer is when dealing with fat pointers.
8956 Perhaps, we could add a check for that and preserve the typedef layer
8957 only in that situation. But this seems unnecessary so far, probably
8958 because we call check_typedef/ada_check_typedef pretty much everywhere.
8960 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8961 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8962 == TYPE_MAIN_TYPE (fixed_type
)))
8968 /* A standard (static-sized) type corresponding as well as possible to
8969 TYPE0, but based on no runtime data. */
8971 static struct type
*
8972 to_static_fixed_type (struct type
*type0
)
8979 if (TYPE_FIXED_INSTANCE (type0
))
8982 type0
= ada_check_typedef (type0
);
8984 switch (TYPE_CODE (type0
))
8988 case TYPE_CODE_STRUCT
:
8989 type
= dynamic_template_type (type0
);
8991 return template_to_static_fixed_type (type
);
8993 return template_to_static_fixed_type (type0
);
8994 case TYPE_CODE_UNION
:
8995 type
= ada_find_parallel_type (type0
, "___XVU");
8997 return template_to_static_fixed_type (type
);
8999 return template_to_static_fixed_type (type0
);
9003 /* A static approximation of TYPE with all type wrappers removed. */
9005 static struct type
*
9006 static_unwrap_type (struct type
*type
)
9008 if (ada_is_aligner_type (type
))
9010 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
9011 if (ada_type_name (type1
) == NULL
)
9012 TYPE_NAME (type1
) = ada_type_name (type
);
9014 return static_unwrap_type (type1
);
9018 struct type
*raw_real_type
= ada_get_base_type (type
);
9020 if (raw_real_type
== type
)
9023 return to_static_fixed_type (raw_real_type
);
9027 /* In some cases, incomplete and private types require
9028 cross-references that are not resolved as records (for example,
9030 type FooP is access Foo;
9032 type Foo is array ...;
9033 ). In these cases, since there is no mechanism for producing
9034 cross-references to such types, we instead substitute for FooP a
9035 stub enumeration type that is nowhere resolved, and whose tag is
9036 the name of the actual type. Call these types "non-record stubs". */
9038 /* A type equivalent to TYPE that is not a non-record stub, if one
9039 exists, otherwise TYPE. */
9042 ada_check_typedef (struct type
*type
)
9047 /* If our type is an access to an unconstrained array, which is encoded
9048 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
9049 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9050 what allows us to distinguish between fat pointers that represent
9051 array types, and fat pointers that represent array access types
9052 (in both cases, the compiler implements them as fat pointers). */
9053 if (ada_is_access_to_unconstrained_array (type
))
9056 type
= check_typedef (type
);
9057 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
9058 || !TYPE_STUB (type
)
9059 || TYPE_NAME (type
) == NULL
)
9063 const char *name
= TYPE_NAME (type
);
9064 struct type
*type1
= ada_find_any_type (name
);
9069 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9070 stubs pointing to arrays, as we don't create symbols for array
9071 types, only for the typedef-to-array types). If that's the case,
9072 strip the typedef layer. */
9073 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
9074 type1
= ada_check_typedef (type1
);
9080 /* A value representing the data at VALADDR/ADDRESS as described by
9081 type TYPE0, but with a standard (static-sized) type that correctly
9082 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9083 type, then return VAL0 [this feature is simply to avoid redundant
9084 creation of struct values]. */
9086 static struct value
*
9087 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
9090 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
9092 if (type
== type0
&& val0
!= NULL
)
9095 if (VALUE_LVAL (val0
) != lval_memory
)
9097 /* Our value does not live in memory; it could be a convenience
9098 variable, for instance. Create a not_lval value using val0's
9100 return value_from_contents (type
, value_contents (val0
));
9103 return value_from_contents_and_address (type
, 0, address
);
9106 /* A value representing VAL, but with a standard (static-sized) type
9107 that correctly describes it. Does not necessarily create a new
9111 ada_to_fixed_value (struct value
*val
)
9113 val
= unwrap_value (val
);
9114 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
9121 /* Table mapping attribute numbers to names.
9122 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9124 static const char *attribute_names
[] = {
9142 ada_attribute_name (enum exp_opcode n
)
9144 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9145 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9147 return attribute_names
[0];
9150 /* Evaluate the 'POS attribute applied to ARG. */
9153 pos_atr (struct value
*arg
)
9155 struct value
*val
= coerce_ref (arg
);
9156 struct type
*type
= value_type (val
);
9159 if (!discrete_type_p (type
))
9160 error (_("'POS only defined on discrete types"));
9162 if (!discrete_position (type
, value_as_long (val
), &result
))
9163 error (_("enumeration value is invalid: can't find 'POS"));
9168 static struct value
*
9169 value_pos_atr (struct type
*type
, struct value
*arg
)
9171 return value_from_longest (type
, pos_atr (arg
));
9174 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9176 static struct value
*
9177 value_val_atr (struct type
*type
, struct value
*arg
)
9179 if (!discrete_type_p (type
))
9180 error (_("'VAL only defined on discrete types"));
9181 if (!integer_type_p (value_type (arg
)))
9182 error (_("'VAL requires integral argument"));
9184 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
9186 long pos
= value_as_long (arg
);
9188 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
9189 error (_("argument to 'VAL out of range"));
9190 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
9193 return value_from_longest (type
, value_as_long (arg
));
9199 /* True if TYPE appears to be an Ada character type.
9200 [At the moment, this is true only for Character and Wide_Character;
9201 It is a heuristic test that could stand improvement]. */
9204 ada_is_character_type (struct type
*type
)
9208 /* If the type code says it's a character, then assume it really is,
9209 and don't check any further. */
9210 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
9213 /* Otherwise, assume it's a character type iff it is a discrete type
9214 with a known character type name. */
9215 name
= ada_type_name (type
);
9216 return (name
!= NULL
9217 && (TYPE_CODE (type
) == TYPE_CODE_INT
9218 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9219 && (strcmp (name
, "character") == 0
9220 || strcmp (name
, "wide_character") == 0
9221 || strcmp (name
, "wide_wide_character") == 0
9222 || strcmp (name
, "unsigned char") == 0));
9225 /* True if TYPE appears to be an Ada string type. */
9228 ada_is_string_type (struct type
*type
)
9230 type
= ada_check_typedef (type
);
9232 && TYPE_CODE (type
) != TYPE_CODE_PTR
9233 && (ada_is_simple_array_type (type
)
9234 || ada_is_array_descriptor_type (type
))
9235 && ada_array_arity (type
) == 1)
9237 struct type
*elttype
= ada_array_element_type (type
, 1);
9239 return ada_is_character_type (elttype
);
9245 /* The compiler sometimes provides a parallel XVS type for a given
9246 PAD type. Normally, it is safe to follow the PAD type directly,
9247 but older versions of the compiler have a bug that causes the offset
9248 of its "F" field to be wrong. Following that field in that case
9249 would lead to incorrect results, but this can be worked around
9250 by ignoring the PAD type and using the associated XVS type instead.
9252 Set to True if the debugger should trust the contents of PAD types.
9253 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9254 static bool trust_pad_over_xvs
= true;
9256 /* True if TYPE is a struct type introduced by the compiler to force the
9257 alignment of a value. Such types have a single field with a
9258 distinctive name. */
9261 ada_is_aligner_type (struct type
*type
)
9263 type
= ada_check_typedef (type
);
9265 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9268 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9269 && TYPE_NFIELDS (type
) == 1
9270 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9273 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9274 the parallel type. */
9277 ada_get_base_type (struct type
*raw_type
)
9279 struct type
*real_type_namer
;
9280 struct type
*raw_real_type
;
9282 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9285 if (ada_is_aligner_type (raw_type
))
9286 /* The encoding specifies that we should always use the aligner type.
9287 So, even if this aligner type has an associated XVS type, we should
9290 According to the compiler gurus, an XVS type parallel to an aligner
9291 type may exist because of a stabs limitation. In stabs, aligner
9292 types are empty because the field has a variable-sized type, and
9293 thus cannot actually be used as an aligner type. As a result,
9294 we need the associated parallel XVS type to decode the type.
9295 Since the policy in the compiler is to not change the internal
9296 representation based on the debugging info format, we sometimes
9297 end up having a redundant XVS type parallel to the aligner type. */
9300 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9301 if (real_type_namer
== NULL
9302 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9303 || TYPE_NFIELDS (real_type_namer
) != 1)
9306 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9308 /* This is an older encoding form where the base type needs to be
9309 looked up by name. We prefer the newer encoding because it is
9311 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9312 if (raw_real_type
== NULL
)
9315 return raw_real_type
;
9318 /* The field in our XVS type is a reference to the base type. */
9319 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9322 /* The type of value designated by TYPE, with all aligners removed. */
9325 ada_aligned_type (struct type
*type
)
9327 if (ada_is_aligner_type (type
))
9328 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9330 return ada_get_base_type (type
);
9334 /* The address of the aligned value in an object at address VALADDR
9335 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9338 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9340 if (ada_is_aligner_type (type
))
9341 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9343 TYPE_FIELD_BITPOS (type
,
9344 0) / TARGET_CHAR_BIT
);
9351 /* The printed representation of an enumeration literal with encoded
9352 name NAME. The value is good to the next call of ada_enum_name. */
9354 ada_enum_name (const char *name
)
9356 static char *result
;
9357 static size_t result_len
= 0;
9360 /* First, unqualify the enumeration name:
9361 1. Search for the last '.' character. If we find one, then skip
9362 all the preceding characters, the unqualified name starts
9363 right after that dot.
9364 2. Otherwise, we may be debugging on a target where the compiler
9365 translates dots into "__". Search forward for double underscores,
9366 but stop searching when we hit an overloading suffix, which is
9367 of the form "__" followed by digits. */
9369 tmp
= strrchr (name
, '.');
9374 while ((tmp
= strstr (name
, "__")) != NULL
)
9376 if (isdigit (tmp
[2]))
9387 if (name
[1] == 'U' || name
[1] == 'W')
9389 if (sscanf (name
+ 2, "%x", &v
) != 1)
9392 else if (((name
[1] >= '0' && name
[1] <= '9')
9393 || (name
[1] >= 'a' && name
[1] <= 'z'))
9396 GROW_VECT (result
, result_len
, 4);
9397 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9403 GROW_VECT (result
, result_len
, 16);
9404 if (isascii (v
) && isprint (v
))
9405 xsnprintf (result
, result_len
, "'%c'", v
);
9406 else if (name
[1] == 'U')
9407 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9409 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9415 tmp
= strstr (name
, "__");
9417 tmp
= strstr (name
, "$");
9420 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9421 strncpy (result
, name
, tmp
- name
);
9422 result
[tmp
- name
] = '\0';
9430 /* Evaluate the subexpression of EXP starting at *POS as for
9431 evaluate_type, updating *POS to point just past the evaluated
9434 static struct value
*
9435 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9437 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9440 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9443 static struct value
*
9444 unwrap_value (struct value
*val
)
9446 struct type
*type
= ada_check_typedef (value_type (val
));
9448 if (ada_is_aligner_type (type
))
9450 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9451 struct type
*val_type
= ada_check_typedef (value_type (v
));
9453 if (ada_type_name (val_type
) == NULL
)
9454 TYPE_NAME (val_type
) = ada_type_name (type
);
9456 return unwrap_value (v
);
9460 struct type
*raw_real_type
=
9461 ada_check_typedef (ada_get_base_type (type
));
9463 /* If there is no parallel XVS or XVE type, then the value is
9464 already unwrapped. Return it without further modification. */
9465 if ((type
== raw_real_type
)
9466 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9470 coerce_unspec_val_to_type
9471 (val
, ada_to_fixed_type (raw_real_type
, 0,
9472 value_address (val
),
9477 static struct value
*
9478 cast_from_fixed (struct type
*type
, struct value
*arg
)
9480 struct value
*scale
= ada_scaling_factor (value_type (arg
));
9481 arg
= value_cast (value_type (scale
), arg
);
9483 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9484 return value_cast (type
, arg
);
9487 static struct value
*
9488 cast_to_fixed (struct type
*type
, struct value
*arg
)
9490 if (type
== value_type (arg
))
9493 struct value
*scale
= ada_scaling_factor (type
);
9494 if (ada_is_fixed_point_type (value_type (arg
)))
9495 arg
= cast_from_fixed (value_type (scale
), arg
);
9497 arg
= value_cast (value_type (scale
), arg
);
9499 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9500 return value_cast (type
, arg
);
9503 /* Given two array types T1 and T2, return nonzero iff both arrays
9504 contain the same number of elements. */
9507 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9509 LONGEST lo1
, hi1
, lo2
, hi2
;
9511 /* Get the array bounds in order to verify that the size of
9512 the two arrays match. */
9513 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9514 || !get_array_bounds (t2
, &lo2
, &hi2
))
9515 error (_("unable to determine array bounds"));
9517 /* To make things easier for size comparison, normalize a bit
9518 the case of empty arrays by making sure that the difference
9519 between upper bound and lower bound is always -1. */
9525 return (hi1
- lo1
== hi2
- lo2
);
9528 /* Assuming that VAL is an array of integrals, and TYPE represents
9529 an array with the same number of elements, but with wider integral
9530 elements, return an array "casted" to TYPE. In practice, this
9531 means that the returned array is built by casting each element
9532 of the original array into TYPE's (wider) element type. */
9534 static struct value
*
9535 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9537 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9542 /* Verify that both val and type are arrays of scalars, and
9543 that the size of val's elements is smaller than the size
9544 of type's element. */
9545 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9546 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9547 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9548 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9549 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9550 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9552 if (!get_array_bounds (type
, &lo
, &hi
))
9553 error (_("unable to determine array bounds"));
9555 res
= allocate_value (type
);
9557 /* Promote each array element. */
9558 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9560 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9562 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9563 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9569 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9570 return the converted value. */
9572 static struct value
*
9573 coerce_for_assign (struct type
*type
, struct value
*val
)
9575 struct type
*type2
= value_type (val
);
9580 type2
= ada_check_typedef (type2
);
9581 type
= ada_check_typedef (type
);
9583 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9584 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9586 val
= ada_value_ind (val
);
9587 type2
= value_type (val
);
9590 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9591 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9593 if (!ada_same_array_size_p (type
, type2
))
9594 error (_("cannot assign arrays of different length"));
9596 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9597 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9598 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9599 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9601 /* Allow implicit promotion of the array elements to
9603 return ada_promote_array_of_integrals (type
, val
);
9606 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9607 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9608 error (_("Incompatible types in assignment"));
9609 deprecated_set_value_type (val
, type
);
9614 static struct value
*
9615 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9618 struct type
*type1
, *type2
;
9621 arg1
= coerce_ref (arg1
);
9622 arg2
= coerce_ref (arg2
);
9623 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9624 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9626 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9627 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9628 return value_binop (arg1
, arg2
, op
);
9637 return value_binop (arg1
, arg2
, op
);
9640 v2
= value_as_long (arg2
);
9642 error (_("second operand of %s must not be zero."), op_string (op
));
9644 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9645 return value_binop (arg1
, arg2
, op
);
9647 v1
= value_as_long (arg1
);
9652 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9653 v
+= v
> 0 ? -1 : 1;
9661 /* Should not reach this point. */
9665 val
= allocate_value (type1
);
9666 store_unsigned_integer (value_contents_raw (val
),
9667 TYPE_LENGTH (value_type (val
)),
9668 type_byte_order (type1
), v
);
9673 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9675 if (ada_is_direct_array_type (value_type (arg1
))
9676 || ada_is_direct_array_type (value_type (arg2
)))
9678 struct type
*arg1_type
, *arg2_type
;
9680 /* Automatically dereference any array reference before
9681 we attempt to perform the comparison. */
9682 arg1
= ada_coerce_ref (arg1
);
9683 arg2
= ada_coerce_ref (arg2
);
9685 arg1
= ada_coerce_to_simple_array (arg1
);
9686 arg2
= ada_coerce_to_simple_array (arg2
);
9688 arg1_type
= ada_check_typedef (value_type (arg1
));
9689 arg2_type
= ada_check_typedef (value_type (arg2
));
9691 if (TYPE_CODE (arg1_type
) != TYPE_CODE_ARRAY
9692 || TYPE_CODE (arg2_type
) != TYPE_CODE_ARRAY
)
9693 error (_("Attempt to compare array with non-array"));
9694 /* FIXME: The following works only for types whose
9695 representations use all bits (no padding or undefined bits)
9696 and do not have user-defined equality. */
9697 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9698 && memcmp (value_contents (arg1
), value_contents (arg2
),
9699 TYPE_LENGTH (arg1_type
)) == 0);
9701 return value_equal (arg1
, arg2
);
9704 /* Total number of component associations in the aggregate starting at
9705 index PC in EXP. Assumes that index PC is the start of an
9709 num_component_specs (struct expression
*exp
, int pc
)
9713 m
= exp
->elts
[pc
+ 1].longconst
;
9716 for (i
= 0; i
< m
; i
+= 1)
9718 switch (exp
->elts
[pc
].opcode
)
9724 n
+= exp
->elts
[pc
+ 1].longconst
;
9727 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9732 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9733 component of LHS (a simple array or a record), updating *POS past
9734 the expression, assuming that LHS is contained in CONTAINER. Does
9735 not modify the inferior's memory, nor does it modify LHS (unless
9736 LHS == CONTAINER). */
9739 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9740 struct expression
*exp
, int *pos
)
9742 struct value
*mark
= value_mark ();
9744 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9746 if (TYPE_CODE (lhs_type
) == TYPE_CODE_ARRAY
)
9748 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9749 struct value
*index_val
= value_from_longest (index_type
, index
);
9751 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9755 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9756 elt
= ada_to_fixed_value (elt
);
9759 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9760 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9762 value_assign_to_component (container
, elt
,
9763 ada_evaluate_subexp (NULL
, exp
, pos
,
9766 value_free_to_mark (mark
);
9769 /* Assuming that LHS represents an lvalue having a record or array
9770 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9771 of that aggregate's value to LHS, advancing *POS past the
9772 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9773 lvalue containing LHS (possibly LHS itself). Does not modify
9774 the inferior's memory, nor does it modify the contents of
9775 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9777 static struct value
*
9778 assign_aggregate (struct value
*container
,
9779 struct value
*lhs
, struct expression
*exp
,
9780 int *pos
, enum noside noside
)
9782 struct type
*lhs_type
;
9783 int n
= exp
->elts
[*pos
+1].longconst
;
9784 LONGEST low_index
, high_index
;
9787 int max_indices
, num_indices
;
9791 if (noside
!= EVAL_NORMAL
)
9793 for (i
= 0; i
< n
; i
+= 1)
9794 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9798 container
= ada_coerce_ref (container
);
9799 if (ada_is_direct_array_type (value_type (container
)))
9800 container
= ada_coerce_to_simple_array (container
);
9801 lhs
= ada_coerce_ref (lhs
);
9802 if (!deprecated_value_modifiable (lhs
))
9803 error (_("Left operand of assignment is not a modifiable lvalue."));
9805 lhs_type
= check_typedef (value_type (lhs
));
9806 if (ada_is_direct_array_type (lhs_type
))
9808 lhs
= ada_coerce_to_simple_array (lhs
);
9809 lhs_type
= check_typedef (value_type (lhs
));
9810 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9811 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9813 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9816 high_index
= num_visible_fields (lhs_type
) - 1;
9819 error (_("Left-hand side must be array or record."));
9821 num_specs
= num_component_specs (exp
, *pos
- 3);
9822 max_indices
= 4 * num_specs
+ 4;
9823 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9824 indices
[0] = indices
[1] = low_index
- 1;
9825 indices
[2] = indices
[3] = high_index
+ 1;
9828 for (i
= 0; i
< n
; i
+= 1)
9830 switch (exp
->elts
[*pos
].opcode
)
9833 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9834 &num_indices
, max_indices
,
9835 low_index
, high_index
);
9838 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9839 &num_indices
, max_indices
,
9840 low_index
, high_index
);
9844 error (_("Misplaced 'others' clause"));
9845 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9846 num_indices
, low_index
, high_index
);
9849 error (_("Internal error: bad aggregate clause"));
9856 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9857 construct at *POS, updating *POS past the construct, given that
9858 the positions are relative to lower bound LOW, where HIGH is the
9859 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9860 updating *NUM_INDICES as needed. CONTAINER is as for
9861 assign_aggregate. */
9863 aggregate_assign_positional (struct value
*container
,
9864 struct value
*lhs
, struct expression
*exp
,
9865 int *pos
, LONGEST
*indices
, int *num_indices
,
9866 int max_indices
, LONGEST low
, LONGEST high
)
9868 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9870 if (ind
- 1 == high
)
9871 warning (_("Extra components in aggregate ignored."));
9874 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9876 assign_component (container
, lhs
, ind
, exp
, pos
);
9879 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9882 /* Assign into the components of LHS indexed by the OP_CHOICES
9883 construct at *POS, updating *POS past the construct, given that
9884 the allowable indices are LOW..HIGH. Record the indices assigned
9885 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9886 needed. CONTAINER is as for assign_aggregate. */
9888 aggregate_assign_from_choices (struct value
*container
,
9889 struct value
*lhs
, struct expression
*exp
,
9890 int *pos
, LONGEST
*indices
, int *num_indices
,
9891 int max_indices
, LONGEST low
, LONGEST high
)
9894 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9895 int choice_pos
, expr_pc
;
9896 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9898 choice_pos
= *pos
+= 3;
9900 for (j
= 0; j
< n_choices
; j
+= 1)
9901 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9903 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9905 for (j
= 0; j
< n_choices
; j
+= 1)
9907 LONGEST lower
, upper
;
9908 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9910 if (op
== OP_DISCRETE_RANGE
)
9913 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9915 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9920 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9932 name
= &exp
->elts
[choice_pos
+ 2].string
;
9935 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9938 error (_("Invalid record component association."));
9940 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9942 if (! find_struct_field (name
, value_type (lhs
), 0,
9943 NULL
, NULL
, NULL
, NULL
, &ind
))
9944 error (_("Unknown component name: %s."), name
);
9945 lower
= upper
= ind
;
9948 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9949 error (_("Index in component association out of bounds."));
9951 add_component_interval (lower
, upper
, indices
, num_indices
,
9953 while (lower
<= upper
)
9958 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9964 /* Assign the value of the expression in the OP_OTHERS construct in
9965 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9966 have not been previously assigned. The index intervals already assigned
9967 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9968 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9970 aggregate_assign_others (struct value
*container
,
9971 struct value
*lhs
, struct expression
*exp
,
9972 int *pos
, LONGEST
*indices
, int num_indices
,
9973 LONGEST low
, LONGEST high
)
9976 int expr_pc
= *pos
+ 1;
9978 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9982 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9987 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9990 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9993 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9994 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9995 modifying *SIZE as needed. It is an error if *SIZE exceeds
9996 MAX_SIZE. The resulting intervals do not overlap. */
9998 add_component_interval (LONGEST low
, LONGEST high
,
9999 LONGEST
* indices
, int *size
, int max_size
)
10003 for (i
= 0; i
< *size
; i
+= 2) {
10004 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
10008 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
10009 if (high
< indices
[kh
])
10011 if (low
< indices
[i
])
10013 indices
[i
+ 1] = indices
[kh
- 1];
10014 if (high
> indices
[i
+ 1])
10015 indices
[i
+ 1] = high
;
10016 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
10017 *size
-= kh
- i
- 2;
10020 else if (high
< indices
[i
])
10024 if (*size
== max_size
)
10025 error (_("Internal error: miscounted aggregate components."));
10027 for (j
= *size
-1; j
>= i
+2; j
-= 1)
10028 indices
[j
] = indices
[j
- 2];
10030 indices
[i
+ 1] = high
;
10033 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10036 static struct value
*
10037 ada_value_cast (struct type
*type
, struct value
*arg2
)
10039 if (type
== ada_check_typedef (value_type (arg2
)))
10042 if (ada_is_fixed_point_type (type
))
10043 return cast_to_fixed (type
, arg2
);
10045 if (ada_is_fixed_point_type (value_type (arg2
)))
10046 return cast_from_fixed (type
, arg2
);
10048 return value_cast (type
, arg2
);
10051 /* Evaluating Ada expressions, and printing their result.
10052 ------------------------------------------------------
10057 We usually evaluate an Ada expression in order to print its value.
10058 We also evaluate an expression in order to print its type, which
10059 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10060 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10061 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10062 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10065 Evaluating expressions is a little more complicated for Ada entities
10066 than it is for entities in languages such as C. The main reason for
10067 this is that Ada provides types whose definition might be dynamic.
10068 One example of such types is variant records. Or another example
10069 would be an array whose bounds can only be known at run time.
10071 The following description is a general guide as to what should be
10072 done (and what should NOT be done) in order to evaluate an expression
10073 involving such types, and when. This does not cover how the semantic
10074 information is encoded by GNAT as this is covered separatly. For the
10075 document used as the reference for the GNAT encoding, see exp_dbug.ads
10076 in the GNAT sources.
10078 Ideally, we should embed each part of this description next to its
10079 associated code. Unfortunately, the amount of code is so vast right
10080 now that it's hard to see whether the code handling a particular
10081 situation might be duplicated or not. One day, when the code is
10082 cleaned up, this guide might become redundant with the comments
10083 inserted in the code, and we might want to remove it.
10085 2. ``Fixing'' an Entity, the Simple Case:
10086 -----------------------------------------
10088 When evaluating Ada expressions, the tricky issue is that they may
10089 reference entities whose type contents and size are not statically
10090 known. Consider for instance a variant record:
10092 type Rec (Empty : Boolean := True) is record
10095 when False => Value : Integer;
10098 Yes : Rec := (Empty => False, Value => 1);
10099 No : Rec := (empty => True);
10101 The size and contents of that record depends on the value of the
10102 descriminant (Rec.Empty). At this point, neither the debugging
10103 information nor the associated type structure in GDB are able to
10104 express such dynamic types. So what the debugger does is to create
10105 "fixed" versions of the type that applies to the specific object.
10106 We also informally refer to this operation as "fixing" an object,
10107 which means creating its associated fixed type.
10109 Example: when printing the value of variable "Yes" above, its fixed
10110 type would look like this:
10117 On the other hand, if we printed the value of "No", its fixed type
10124 Things become a little more complicated when trying to fix an entity
10125 with a dynamic type that directly contains another dynamic type,
10126 such as an array of variant records, for instance. There are
10127 two possible cases: Arrays, and records.
10129 3. ``Fixing'' Arrays:
10130 ---------------------
10132 The type structure in GDB describes an array in terms of its bounds,
10133 and the type of its elements. By design, all elements in the array
10134 have the same type and we cannot represent an array of variant elements
10135 using the current type structure in GDB. When fixing an array,
10136 we cannot fix the array element, as we would potentially need one
10137 fixed type per element of the array. As a result, the best we can do
10138 when fixing an array is to produce an array whose bounds and size
10139 are correct (allowing us to read it from memory), but without having
10140 touched its element type. Fixing each element will be done later,
10141 when (if) necessary.
10143 Arrays are a little simpler to handle than records, because the same
10144 amount of memory is allocated for each element of the array, even if
10145 the amount of space actually used by each element differs from element
10146 to element. Consider for instance the following array of type Rec:
10148 type Rec_Array is array (1 .. 2) of Rec;
10150 The actual amount of memory occupied by each element might be different
10151 from element to element, depending on the value of their discriminant.
10152 But the amount of space reserved for each element in the array remains
10153 fixed regardless. So we simply need to compute that size using
10154 the debugging information available, from which we can then determine
10155 the array size (we multiply the number of elements of the array by
10156 the size of each element).
10158 The simplest case is when we have an array of a constrained element
10159 type. For instance, consider the following type declarations:
10161 type Bounded_String (Max_Size : Integer) is
10163 Buffer : String (1 .. Max_Size);
10165 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10167 In this case, the compiler describes the array as an array of
10168 variable-size elements (identified by its XVS suffix) for which
10169 the size can be read in the parallel XVZ variable.
10171 In the case of an array of an unconstrained element type, the compiler
10172 wraps the array element inside a private PAD type. This type should not
10173 be shown to the user, and must be "unwrap"'ed before printing. Note
10174 that we also use the adjective "aligner" in our code to designate
10175 these wrapper types.
10177 In some cases, the size allocated for each element is statically
10178 known. In that case, the PAD type already has the correct size,
10179 and the array element should remain unfixed.
10181 But there are cases when this size is not statically known.
10182 For instance, assuming that "Five" is an integer variable:
10184 type Dynamic is array (1 .. Five) of Integer;
10185 type Wrapper (Has_Length : Boolean := False) is record
10188 when True => Length : Integer;
10189 when False => null;
10192 type Wrapper_Array is array (1 .. 2) of Wrapper;
10194 Hello : Wrapper_Array := (others => (Has_Length => True,
10195 Data => (others => 17),
10199 The debugging info would describe variable Hello as being an
10200 array of a PAD type. The size of that PAD type is not statically
10201 known, but can be determined using a parallel XVZ variable.
10202 In that case, a copy of the PAD type with the correct size should
10203 be used for the fixed array.
10205 3. ``Fixing'' record type objects:
10206 ----------------------------------
10208 Things are slightly different from arrays in the case of dynamic
10209 record types. In this case, in order to compute the associated
10210 fixed type, we need to determine the size and offset of each of
10211 its components. This, in turn, requires us to compute the fixed
10212 type of each of these components.
10214 Consider for instance the example:
10216 type Bounded_String (Max_Size : Natural) is record
10217 Str : String (1 .. Max_Size);
10220 My_String : Bounded_String (Max_Size => 10);
10222 In that case, the position of field "Length" depends on the size
10223 of field Str, which itself depends on the value of the Max_Size
10224 discriminant. In order to fix the type of variable My_String,
10225 we need to fix the type of field Str. Therefore, fixing a variant
10226 record requires us to fix each of its components.
10228 However, if a component does not have a dynamic size, the component
10229 should not be fixed. In particular, fields that use a PAD type
10230 should not fixed. Here is an example where this might happen
10231 (assuming type Rec above):
10233 type Container (Big : Boolean) is record
10237 when True => Another : Integer;
10238 when False => null;
10241 My_Container : Container := (Big => False,
10242 First => (Empty => True),
10245 In that example, the compiler creates a PAD type for component First,
10246 whose size is constant, and then positions the component After just
10247 right after it. The offset of component After is therefore constant
10250 The debugger computes the position of each field based on an algorithm
10251 that uses, among other things, the actual position and size of the field
10252 preceding it. Let's now imagine that the user is trying to print
10253 the value of My_Container. If the type fixing was recursive, we would
10254 end up computing the offset of field After based on the size of the
10255 fixed version of field First. And since in our example First has
10256 only one actual field, the size of the fixed type is actually smaller
10257 than the amount of space allocated to that field, and thus we would
10258 compute the wrong offset of field After.
10260 To make things more complicated, we need to watch out for dynamic
10261 components of variant records (identified by the ___XVL suffix in
10262 the component name). Even if the target type is a PAD type, the size
10263 of that type might not be statically known. So the PAD type needs
10264 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10265 we might end up with the wrong size for our component. This can be
10266 observed with the following type declarations:
10268 type Octal is new Integer range 0 .. 7;
10269 type Octal_Array is array (Positive range <>) of Octal;
10270 pragma Pack (Octal_Array);
10272 type Octal_Buffer (Size : Positive) is record
10273 Buffer : Octal_Array (1 .. Size);
10277 In that case, Buffer is a PAD type whose size is unset and needs
10278 to be computed by fixing the unwrapped type.
10280 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10281 ----------------------------------------------------------
10283 Lastly, when should the sub-elements of an entity that remained unfixed
10284 thus far, be actually fixed?
10286 The answer is: Only when referencing that element. For instance
10287 when selecting one component of a record, this specific component
10288 should be fixed at that point in time. Or when printing the value
10289 of a record, each component should be fixed before its value gets
10290 printed. Similarly for arrays, the element of the array should be
10291 fixed when printing each element of the array, or when extracting
10292 one element out of that array. On the other hand, fixing should
10293 not be performed on the elements when taking a slice of an array!
10295 Note that one of the side effects of miscomputing the offset and
10296 size of each field is that we end up also miscomputing the size
10297 of the containing type. This can have adverse results when computing
10298 the value of an entity. GDB fetches the value of an entity based
10299 on the size of its type, and thus a wrong size causes GDB to fetch
10300 the wrong amount of memory. In the case where the computed size is
10301 too small, GDB fetches too little data to print the value of our
10302 entity. Results in this case are unpredictable, as we usually read
10303 past the buffer containing the data =:-o. */
10305 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10306 for that subexpression cast to TO_TYPE. Advance *POS over the
10310 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10311 enum noside noside
, struct type
*to_type
)
10315 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10316 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10321 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10323 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10324 return value_zero (to_type
, not_lval
);
10326 val
= evaluate_var_msym_value (noside
,
10327 exp
->elts
[pc
+ 1].objfile
,
10328 exp
->elts
[pc
+ 2].msymbol
);
10331 val
= evaluate_var_value (noside
,
10332 exp
->elts
[pc
+ 1].block
,
10333 exp
->elts
[pc
+ 2].symbol
);
10335 if (noside
== EVAL_SKIP
)
10336 return eval_skip_value (exp
);
10338 val
= ada_value_cast (to_type
, val
);
10340 /* Follow the Ada language semantics that do not allow taking
10341 an address of the result of a cast (view conversion in Ada). */
10342 if (VALUE_LVAL (val
) == lval_memory
)
10344 if (value_lazy (val
))
10345 value_fetch_lazy (val
);
10346 VALUE_LVAL (val
) = not_lval
;
10351 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10352 if (noside
== EVAL_SKIP
)
10353 return eval_skip_value (exp
);
10354 return ada_value_cast (to_type
, val
);
10357 /* Implement the evaluate_exp routine in the exp_descriptor structure
10358 for the Ada language. */
10360 static struct value
*
10361 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10362 int *pos
, enum noside noside
)
10364 enum exp_opcode op
;
10368 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10371 struct value
**argvec
;
10375 op
= exp
->elts
[pc
].opcode
;
10381 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10383 if (noside
== EVAL_NORMAL
)
10384 arg1
= unwrap_value (arg1
);
10386 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10387 then we need to perform the conversion manually, because
10388 evaluate_subexp_standard doesn't do it. This conversion is
10389 necessary in Ada because the different kinds of float/fixed
10390 types in Ada have different representations.
10392 Similarly, we need to perform the conversion from OP_LONG
10394 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10395 arg1
= ada_value_cast (expect_type
, arg1
);
10401 struct value
*result
;
10404 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10405 /* The result type will have code OP_STRING, bashed there from
10406 OP_ARRAY. Bash it back. */
10407 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10408 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10414 type
= exp
->elts
[pc
+ 1].type
;
10415 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10419 type
= exp
->elts
[pc
+ 1].type
;
10420 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10423 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10424 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10426 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10427 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10429 return ada_value_assign (arg1
, arg1
);
10431 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10432 except if the lhs of our assignment is a convenience variable.
10433 In the case of assigning to a convenience variable, the lhs
10434 should be exactly the result of the evaluation of the rhs. */
10435 type
= value_type (arg1
);
10436 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10438 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10439 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10441 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10445 else if (ada_is_fixed_point_type (value_type (arg1
)))
10446 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10447 else if (ada_is_fixed_point_type (value_type (arg2
)))
10449 (_("Fixed-point values must be assigned to fixed-point variables"));
10451 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10452 return ada_value_assign (arg1
, arg2
);
10455 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10456 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10457 if (noside
== EVAL_SKIP
)
10459 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10460 return (value_from_longest
10461 (value_type (arg1
),
10462 value_as_long (arg1
) + value_as_long (arg2
)));
10463 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10464 return (value_from_longest
10465 (value_type (arg2
),
10466 value_as_long (arg1
) + value_as_long (arg2
)));
10467 if ((ada_is_fixed_point_type (value_type (arg1
))
10468 || ada_is_fixed_point_type (value_type (arg2
)))
10469 && value_type (arg1
) != value_type (arg2
))
10470 error (_("Operands of fixed-point addition must have the same type"));
10471 /* Do the addition, and cast the result to the type of the first
10472 argument. We cannot cast the result to a reference type, so if
10473 ARG1 is a reference type, find its underlying type. */
10474 type
= value_type (arg1
);
10475 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10476 type
= TYPE_TARGET_TYPE (type
);
10477 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10478 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10481 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10482 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10483 if (noside
== EVAL_SKIP
)
10485 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10486 return (value_from_longest
10487 (value_type (arg1
),
10488 value_as_long (arg1
) - value_as_long (arg2
)));
10489 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10490 return (value_from_longest
10491 (value_type (arg2
),
10492 value_as_long (arg1
) - value_as_long (arg2
)));
10493 if ((ada_is_fixed_point_type (value_type (arg1
))
10494 || ada_is_fixed_point_type (value_type (arg2
)))
10495 && value_type (arg1
) != value_type (arg2
))
10496 error (_("Operands of fixed-point subtraction "
10497 "must have the same type"));
10498 /* Do the substraction, and cast the result to the type of the first
10499 argument. We cannot cast the result to a reference type, so if
10500 ARG1 is a reference type, find its underlying type. */
10501 type
= value_type (arg1
);
10502 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10503 type
= TYPE_TARGET_TYPE (type
);
10504 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10505 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10511 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10512 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10513 if (noside
== EVAL_SKIP
)
10515 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10517 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10518 return value_zero (value_type (arg1
), not_lval
);
10522 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10523 if (ada_is_fixed_point_type (value_type (arg1
)))
10524 arg1
= cast_from_fixed (type
, arg1
);
10525 if (ada_is_fixed_point_type (value_type (arg2
)))
10526 arg2
= cast_from_fixed (type
, arg2
);
10527 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10528 return ada_value_binop (arg1
, arg2
, op
);
10532 case BINOP_NOTEQUAL
:
10533 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10534 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10535 if (noside
== EVAL_SKIP
)
10537 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10541 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10542 tem
= ada_value_equal (arg1
, arg2
);
10544 if (op
== BINOP_NOTEQUAL
)
10546 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10547 return value_from_longest (type
, (LONGEST
) tem
);
10550 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10551 if (noside
== EVAL_SKIP
)
10553 else if (ada_is_fixed_point_type (value_type (arg1
)))
10554 return value_cast (value_type (arg1
), value_neg (arg1
));
10557 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10558 return value_neg (arg1
);
10561 case BINOP_LOGICAL_AND
:
10562 case BINOP_LOGICAL_OR
:
10563 case UNOP_LOGICAL_NOT
:
10568 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10569 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10570 return value_cast (type
, val
);
10573 case BINOP_BITWISE_AND
:
10574 case BINOP_BITWISE_IOR
:
10575 case BINOP_BITWISE_XOR
:
10579 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10581 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10583 return value_cast (value_type (arg1
), val
);
10589 if (noside
== EVAL_SKIP
)
10595 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10596 /* Only encountered when an unresolved symbol occurs in a
10597 context other than a function call, in which case, it is
10599 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10600 exp
->elts
[pc
+ 2].symbol
->print_name ());
10602 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10604 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10605 /* Check to see if this is a tagged type. We also need to handle
10606 the case where the type is a reference to a tagged type, but
10607 we have to be careful to exclude pointers to tagged types.
10608 The latter should be shown as usual (as a pointer), whereas
10609 a reference should mostly be transparent to the user. */
10610 if (ada_is_tagged_type (type
, 0)
10611 || (TYPE_CODE (type
) == TYPE_CODE_REF
10612 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10614 /* Tagged types are a little special in the fact that the real
10615 type is dynamic and can only be determined by inspecting the
10616 object's tag. This means that we need to get the object's
10617 value first (EVAL_NORMAL) and then extract the actual object
10620 Note that we cannot skip the final step where we extract
10621 the object type from its tag, because the EVAL_NORMAL phase
10622 results in dynamic components being resolved into fixed ones.
10623 This can cause problems when trying to print the type
10624 description of tagged types whose parent has a dynamic size:
10625 We use the type name of the "_parent" component in order
10626 to print the name of the ancestor type in the type description.
10627 If that component had a dynamic size, the resolution into
10628 a fixed type would result in the loss of that type name,
10629 thus preventing us from printing the name of the ancestor
10630 type in the type description. */
10631 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10633 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10635 struct type
*actual_type
;
10637 actual_type
= type_from_tag (ada_value_tag (arg1
));
10638 if (actual_type
== NULL
)
10639 /* If, for some reason, we were unable to determine
10640 the actual type from the tag, then use the static
10641 approximation that we just computed as a fallback.
10642 This can happen if the debugging information is
10643 incomplete, for instance. */
10644 actual_type
= type
;
10645 return value_zero (actual_type
, not_lval
);
10649 /* In the case of a ref, ada_coerce_ref takes care
10650 of determining the actual type. But the evaluation
10651 should return a ref as it should be valid to ask
10652 for its address; so rebuild a ref after coerce. */
10653 arg1
= ada_coerce_ref (arg1
);
10654 return value_ref (arg1
, TYPE_CODE_REF
);
10658 /* Records and unions for which GNAT encodings have been
10659 generated need to be statically fixed as well.
10660 Otherwise, non-static fixing produces a type where
10661 all dynamic properties are removed, which prevents "ptype"
10662 from being able to completely describe the type.
10663 For instance, a case statement in a variant record would be
10664 replaced by the relevant components based on the actual
10665 value of the discriminants. */
10666 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10667 && dynamic_template_type (type
) != NULL
)
10668 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10669 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10672 return value_zero (to_static_fixed_type (type
), not_lval
);
10676 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10677 return ada_to_fixed_value (arg1
);
10682 /* Allocate arg vector, including space for the function to be
10683 called in argvec[0] and a terminating NULL. */
10684 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10685 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10687 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10688 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10689 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10690 exp
->elts
[pc
+ 5].symbol
->print_name ());
10693 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10694 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10697 if (noside
== EVAL_SKIP
)
10701 if (ada_is_constrained_packed_array_type
10702 (desc_base_type (value_type (argvec
[0]))))
10703 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10704 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10705 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10706 /* This is a packed array that has already been fixed, and
10707 therefore already coerced to a simple array. Nothing further
10710 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
)
10712 /* Make sure we dereference references so that all the code below
10713 feels like it's really handling the referenced value. Wrapping
10714 types (for alignment) may be there, so make sure we strip them as
10716 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10718 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10719 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10720 argvec
[0] = value_addr (argvec
[0]);
10722 type
= ada_check_typedef (value_type (argvec
[0]));
10724 /* Ada allows us to implicitly dereference arrays when subscripting
10725 them. So, if this is an array typedef (encoding use for array
10726 access types encoded as fat pointers), strip it now. */
10727 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10728 type
= ada_typedef_target_type (type
);
10730 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10732 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10734 case TYPE_CODE_FUNC
:
10735 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10737 case TYPE_CODE_ARRAY
:
10739 case TYPE_CODE_STRUCT
:
10740 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10741 argvec
[0] = ada_value_ind (argvec
[0]);
10742 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10745 error (_("cannot subscript or call something of type `%s'"),
10746 ada_type_name (value_type (argvec
[0])));
10751 switch (TYPE_CODE (type
))
10753 case TYPE_CODE_FUNC
:
10754 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10756 if (TYPE_TARGET_TYPE (type
) == NULL
)
10757 error_call_unknown_return_type (NULL
);
10758 return allocate_value (TYPE_TARGET_TYPE (type
));
10760 return call_function_by_hand (argvec
[0], NULL
,
10761 gdb::make_array_view (argvec
+ 1,
10763 case TYPE_CODE_INTERNAL_FUNCTION
:
10764 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10765 /* We don't know anything about what the internal
10766 function might return, but we have to return
10768 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10771 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10772 argvec
[0], nargs
, argvec
+ 1);
10774 case TYPE_CODE_STRUCT
:
10778 arity
= ada_array_arity (type
);
10779 type
= ada_array_element_type (type
, nargs
);
10781 error (_("cannot subscript or call a record"));
10782 if (arity
!= nargs
)
10783 error (_("wrong number of subscripts; expecting %d"), arity
);
10784 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10785 return value_zero (ada_aligned_type (type
), lval_memory
);
10787 unwrap_value (ada_value_subscript
10788 (argvec
[0], nargs
, argvec
+ 1));
10790 case TYPE_CODE_ARRAY
:
10791 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10793 type
= ada_array_element_type (type
, nargs
);
10795 error (_("element type of array unknown"));
10797 return value_zero (ada_aligned_type (type
), lval_memory
);
10800 unwrap_value (ada_value_subscript
10801 (ada_coerce_to_simple_array (argvec
[0]),
10802 nargs
, argvec
+ 1));
10803 case TYPE_CODE_PTR
: /* Pointer to array */
10804 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10806 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10807 type
= ada_array_element_type (type
, nargs
);
10809 error (_("element type of array unknown"));
10811 return value_zero (ada_aligned_type (type
), lval_memory
);
10814 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10815 nargs
, argvec
+ 1));
10818 error (_("Attempt to index or call something other than an "
10819 "array or function"));
10824 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10825 struct value
*low_bound_val
=
10826 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10827 struct value
*high_bound_val
=
10828 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10830 LONGEST high_bound
;
10832 low_bound_val
= coerce_ref (low_bound_val
);
10833 high_bound_val
= coerce_ref (high_bound_val
);
10834 low_bound
= value_as_long (low_bound_val
);
10835 high_bound
= value_as_long (high_bound_val
);
10837 if (noside
== EVAL_SKIP
)
10840 /* If this is a reference to an aligner type, then remove all
10842 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10843 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10844 TYPE_TARGET_TYPE (value_type (array
)) =
10845 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10847 if (ada_is_constrained_packed_array_type (value_type (array
)))
10848 error (_("cannot slice a packed array"));
10850 /* If this is a reference to an array or an array lvalue,
10851 convert to a pointer. */
10852 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10853 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10854 && VALUE_LVAL (array
) == lval_memory
))
10855 array
= value_addr (array
);
10857 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10858 && ada_is_array_descriptor_type (ada_check_typedef
10859 (value_type (array
))))
10860 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10863 array
= ada_coerce_to_simple_array_ptr (array
);
10865 /* If we have more than one level of pointer indirection,
10866 dereference the value until we get only one level. */
10867 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10868 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10870 array
= value_ind (array
);
10872 /* Make sure we really do have an array type before going further,
10873 to avoid a SEGV when trying to get the index type or the target
10874 type later down the road if the debug info generated by
10875 the compiler is incorrect or incomplete. */
10876 if (!ada_is_simple_array_type (value_type (array
)))
10877 error (_("cannot take slice of non-array"));
10879 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10882 struct type
*type0
= ada_check_typedef (value_type (array
));
10884 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10885 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10888 struct type
*arr_type0
=
10889 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10891 return ada_value_slice_from_ptr (array
, arr_type0
,
10892 longest_to_int (low_bound
),
10893 longest_to_int (high_bound
));
10896 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10898 else if (high_bound
< low_bound
)
10899 return empty_array (value_type (array
), low_bound
, high_bound
);
10901 return ada_value_slice (array
, longest_to_int (low_bound
),
10902 longest_to_int (high_bound
));
10905 case UNOP_IN_RANGE
:
10907 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10908 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10910 if (noside
== EVAL_SKIP
)
10913 switch (TYPE_CODE (type
))
10916 lim_warning (_("Membership test incompletely implemented; "
10917 "always returns true"));
10918 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10919 return value_from_longest (type
, (LONGEST
) 1);
10921 case TYPE_CODE_RANGE
:
10922 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10923 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10924 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10925 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10926 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10928 value_from_longest (type
,
10929 (value_less (arg1
, arg3
)
10930 || value_equal (arg1
, arg3
))
10931 && (value_less (arg2
, arg1
)
10932 || value_equal (arg2
, arg1
)));
10935 case BINOP_IN_BOUNDS
:
10937 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10938 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10940 if (noside
== EVAL_SKIP
)
10943 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10945 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10946 return value_zero (type
, not_lval
);
10949 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10951 type
= ada_index_type (value_type (arg2
), tem
, "range");
10953 type
= value_type (arg1
);
10955 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10956 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10958 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10959 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10960 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10962 value_from_longest (type
,
10963 (value_less (arg1
, arg3
)
10964 || value_equal (arg1
, arg3
))
10965 && (value_less (arg2
, arg1
)
10966 || value_equal (arg2
, arg1
)));
10968 case TERNOP_IN_RANGE
:
10969 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10970 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10971 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10973 if (noside
== EVAL_SKIP
)
10976 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10977 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10978 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10980 value_from_longest (type
,
10981 (value_less (arg1
, arg3
)
10982 || value_equal (arg1
, arg3
))
10983 && (value_less (arg2
, arg1
)
10984 || value_equal (arg2
, arg1
)));
10988 case OP_ATR_LENGTH
:
10990 struct type
*type_arg
;
10992 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10994 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10996 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11000 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11004 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
11005 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
11006 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
11009 if (noside
== EVAL_SKIP
)
11011 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11013 if (type_arg
== NULL
)
11014 type_arg
= value_type (arg1
);
11016 if (ada_is_constrained_packed_array_type (type_arg
))
11017 type_arg
= decode_constrained_packed_array_type (type_arg
);
11019 if (!discrete_type_p (type_arg
))
11023 default: /* Should never happen. */
11024 error (_("unexpected attribute encountered"));
11027 type_arg
= ada_index_type (type_arg
, tem
,
11028 ada_attribute_name (op
));
11030 case OP_ATR_LENGTH
:
11031 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
11036 return value_zero (type_arg
, not_lval
);
11038 else if (type_arg
== NULL
)
11040 arg1
= ada_coerce_ref (arg1
);
11042 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
11043 arg1
= ada_coerce_to_simple_array (arg1
);
11045 if (op
== OP_ATR_LENGTH
)
11046 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11049 type
= ada_index_type (value_type (arg1
), tem
,
11050 ada_attribute_name (op
));
11052 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11057 default: /* Should never happen. */
11058 error (_("unexpected attribute encountered"));
11060 return value_from_longest
11061 (type
, ada_array_bound (arg1
, tem
, 0));
11063 return value_from_longest
11064 (type
, ada_array_bound (arg1
, tem
, 1));
11065 case OP_ATR_LENGTH
:
11066 return value_from_longest
11067 (type
, ada_array_length (arg1
, tem
));
11070 else if (discrete_type_p (type_arg
))
11072 struct type
*range_type
;
11073 const char *name
= ada_type_name (type_arg
);
11076 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
11077 range_type
= to_fixed_range_type (type_arg
, NULL
);
11078 if (range_type
== NULL
)
11079 range_type
= type_arg
;
11083 error (_("unexpected attribute encountered"));
11085 return value_from_longest
11086 (range_type
, ada_discrete_type_low_bound (range_type
));
11088 return value_from_longest
11089 (range_type
, ada_discrete_type_high_bound (range_type
));
11090 case OP_ATR_LENGTH
:
11091 error (_("the 'length attribute applies only to array types"));
11094 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
11095 error (_("unimplemented type attribute"));
11100 if (ada_is_constrained_packed_array_type (type_arg
))
11101 type_arg
= decode_constrained_packed_array_type (type_arg
);
11103 if (op
== OP_ATR_LENGTH
)
11104 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11107 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11109 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11115 error (_("unexpected attribute encountered"));
11117 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11118 return value_from_longest (type
, low
);
11120 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11121 return value_from_longest (type
, high
);
11122 case OP_ATR_LENGTH
:
11123 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11124 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11125 return value_from_longest (type
, high
- low
+ 1);
11131 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11132 if (noside
== EVAL_SKIP
)
11135 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11136 return value_zero (ada_tag_type (arg1
), not_lval
);
11138 return ada_value_tag (arg1
);
11142 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11143 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11144 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11145 if (noside
== EVAL_SKIP
)
11147 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11148 return value_zero (value_type (arg1
), not_lval
);
11151 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11152 return value_binop (arg1
, arg2
,
11153 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11156 case OP_ATR_MODULUS
:
11158 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11160 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11161 if (noside
== EVAL_SKIP
)
11164 if (!ada_is_modular_type (type_arg
))
11165 error (_("'modulus must be applied to modular type"));
11167 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11168 ada_modulus (type_arg
));
11173 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11174 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11175 if (noside
== EVAL_SKIP
)
11177 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11178 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11179 return value_zero (type
, not_lval
);
11181 return value_pos_atr (type
, arg1
);
11184 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11185 type
= value_type (arg1
);
11187 /* If the argument is a reference, then dereference its type, since
11188 the user is really asking for the size of the actual object,
11189 not the size of the pointer. */
11190 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
11191 type
= TYPE_TARGET_TYPE (type
);
11193 if (noside
== EVAL_SKIP
)
11195 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11196 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11198 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11199 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11202 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11203 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11204 type
= exp
->elts
[pc
+ 2].type
;
11205 if (noside
== EVAL_SKIP
)
11207 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11208 return value_zero (type
, not_lval
);
11210 return value_val_atr (type
, arg1
);
11213 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11214 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11215 if (noside
== EVAL_SKIP
)
11217 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11218 return value_zero (value_type (arg1
), not_lval
);
11221 /* For integer exponentiation operations,
11222 only promote the first argument. */
11223 if (is_integral_type (value_type (arg2
)))
11224 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11226 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11228 return value_binop (arg1
, arg2
, op
);
11232 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11233 if (noside
== EVAL_SKIP
)
11239 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11240 if (noside
== EVAL_SKIP
)
11242 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11243 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11244 return value_neg (arg1
);
11249 preeval_pos
= *pos
;
11250 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11251 if (noside
== EVAL_SKIP
)
11253 type
= ada_check_typedef (value_type (arg1
));
11254 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11256 if (ada_is_array_descriptor_type (type
))
11257 /* GDB allows dereferencing GNAT array descriptors. */
11259 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11261 if (arrType
== NULL
)
11262 error (_("Attempt to dereference null array pointer."));
11263 return value_at_lazy (arrType
, 0);
11265 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
11266 || TYPE_CODE (type
) == TYPE_CODE_REF
11267 /* In C you can dereference an array to get the 1st elt. */
11268 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
11270 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11271 only be determined by inspecting the object's tag.
11272 This means that we need to evaluate completely the
11273 expression in order to get its type. */
11275 if ((TYPE_CODE (type
) == TYPE_CODE_REF
11276 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
11277 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11279 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11281 type
= value_type (ada_value_ind (arg1
));
11285 type
= to_static_fixed_type
11287 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11289 ada_ensure_varsize_limit (type
);
11290 return value_zero (type
, lval_memory
);
11292 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11294 /* GDB allows dereferencing an int. */
11295 if (expect_type
== NULL
)
11296 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11301 to_static_fixed_type (ada_aligned_type (expect_type
));
11302 return value_zero (expect_type
, lval_memory
);
11306 error (_("Attempt to take contents of a non-pointer value."));
11308 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11309 type
= ada_check_typedef (value_type (arg1
));
11311 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11312 /* GDB allows dereferencing an int. If we were given
11313 the expect_type, then use that as the target type.
11314 Otherwise, assume that the target type is an int. */
11316 if (expect_type
!= NULL
)
11317 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11320 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11321 (CORE_ADDR
) value_as_address (arg1
));
11324 if (ada_is_array_descriptor_type (type
))
11325 /* GDB allows dereferencing GNAT array descriptors. */
11326 return ada_coerce_to_simple_array (arg1
);
11328 return ada_value_ind (arg1
);
11330 case STRUCTOP_STRUCT
:
11331 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11332 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11333 preeval_pos
= *pos
;
11334 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11335 if (noside
== EVAL_SKIP
)
11337 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11339 struct type
*type1
= value_type (arg1
);
11341 if (ada_is_tagged_type (type1
, 1))
11343 type
= ada_lookup_struct_elt_type (type1
,
11344 &exp
->elts
[pc
+ 2].string
,
11347 /* If the field is not found, check if it exists in the
11348 extension of this object's type. This means that we
11349 need to evaluate completely the expression. */
11353 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11355 arg1
= ada_value_struct_elt (arg1
,
11356 &exp
->elts
[pc
+ 2].string
,
11358 arg1
= unwrap_value (arg1
);
11359 type
= value_type (ada_to_fixed_value (arg1
));
11364 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11367 return value_zero (ada_aligned_type (type
), lval_memory
);
11371 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11372 arg1
= unwrap_value (arg1
);
11373 return ada_to_fixed_value (arg1
);
11377 /* The value is not supposed to be used. This is here to make it
11378 easier to accommodate expressions that contain types. */
11380 if (noside
== EVAL_SKIP
)
11382 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11383 return allocate_value (exp
->elts
[pc
+ 1].type
);
11385 error (_("Attempt to use a type name as an expression"));
11390 case OP_DISCRETE_RANGE
:
11391 case OP_POSITIONAL
:
11393 if (noside
== EVAL_NORMAL
)
11397 error (_("Undefined name, ambiguous name, or renaming used in "
11398 "component association: %s."), &exp
->elts
[pc
+2].string
);
11400 error (_("Aggregates only allowed on the right of an assignment"));
11402 internal_error (__FILE__
, __LINE__
,
11403 _("aggregate apparently mangled"));
11406 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11408 for (tem
= 0; tem
< nargs
; tem
+= 1)
11409 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11414 return eval_skip_value (exp
);
11420 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11421 type name that encodes the 'small and 'delta information.
11422 Otherwise, return NULL. */
11424 static const char *
11425 fixed_type_info (struct type
*type
)
11427 const char *name
= ada_type_name (type
);
11428 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11430 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11432 const char *tail
= strstr (name
, "___XF_");
11439 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11440 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11445 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11448 ada_is_fixed_point_type (struct type
*type
)
11450 return fixed_type_info (type
) != NULL
;
11453 /* Return non-zero iff TYPE represents a System.Address type. */
11456 ada_is_system_address_type (struct type
*type
)
11458 return (TYPE_NAME (type
)
11459 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11462 /* Assuming that TYPE is the representation of an Ada fixed-point
11463 type, return the target floating-point type to be used to represent
11464 of this type during internal computation. */
11466 static struct type
*
11467 ada_scaling_type (struct type
*type
)
11469 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11472 /* Assuming that TYPE is the representation of an Ada fixed-point
11473 type, return its delta, or NULL if the type is malformed and the
11474 delta cannot be determined. */
11477 ada_delta (struct type
*type
)
11479 const char *encoding
= fixed_type_info (type
);
11480 struct type
*scale_type
= ada_scaling_type (type
);
11482 long long num
, den
;
11484 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11487 return value_binop (value_from_longest (scale_type
, num
),
11488 value_from_longest (scale_type
, den
), BINOP_DIV
);
11491 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11492 factor ('SMALL value) associated with the type. */
11495 ada_scaling_factor (struct type
*type
)
11497 const char *encoding
= fixed_type_info (type
);
11498 struct type
*scale_type
= ada_scaling_type (type
);
11500 long long num0
, den0
, num1
, den1
;
11503 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11504 &num0
, &den0
, &num1
, &den1
);
11507 return value_from_longest (scale_type
, 1);
11509 return value_binop (value_from_longest (scale_type
, num1
),
11510 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11512 return value_binop (value_from_longest (scale_type
, num0
),
11513 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11520 /* Scan STR beginning at position K for a discriminant name, and
11521 return the value of that discriminant field of DVAL in *PX. If
11522 PNEW_K is not null, put the position of the character beyond the
11523 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11524 not alter *PX and *PNEW_K if unsuccessful. */
11527 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11530 static char *bound_buffer
= NULL
;
11531 static size_t bound_buffer_len
= 0;
11532 const char *pstart
, *pend
, *bound
;
11533 struct value
*bound_val
;
11535 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11539 pend
= strstr (pstart
, "__");
11543 k
+= strlen (bound
);
11547 int len
= pend
- pstart
;
11549 /* Strip __ and beyond. */
11550 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11551 strncpy (bound_buffer
, pstart
, len
);
11552 bound_buffer
[len
] = '\0';
11554 bound
= bound_buffer
;
11558 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11559 if (bound_val
== NULL
)
11562 *px
= value_as_long (bound_val
);
11563 if (pnew_k
!= NULL
)
11568 /* Value of variable named NAME in the current environment. If
11569 no such variable found, then if ERR_MSG is null, returns 0, and
11570 otherwise causes an error with message ERR_MSG. */
11572 static struct value
*
11573 get_var_value (const char *name
, const char *err_msg
)
11575 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11577 std::vector
<struct block_symbol
> syms
;
11578 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11579 get_selected_block (0),
11580 VAR_DOMAIN
, &syms
, 1);
11584 if (err_msg
== NULL
)
11587 error (("%s"), err_msg
);
11590 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11593 /* Value of integer variable named NAME in the current environment.
11594 If no such variable is found, returns false. Otherwise, sets VALUE
11595 to the variable's value and returns true. */
11598 get_int_var_value (const char *name
, LONGEST
&value
)
11600 struct value
*var_val
= get_var_value (name
, 0);
11605 value
= value_as_long (var_val
);
11610 /* Return a range type whose base type is that of the range type named
11611 NAME in the current environment, and whose bounds are calculated
11612 from NAME according to the GNAT range encoding conventions.
11613 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11614 corresponding range type from debug information; fall back to using it
11615 if symbol lookup fails. If a new type must be created, allocate it
11616 like ORIG_TYPE was. The bounds information, in general, is encoded
11617 in NAME, the base type given in the named range type. */
11619 static struct type
*
11620 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11623 struct type
*base_type
;
11624 const char *subtype_info
;
11626 gdb_assert (raw_type
!= NULL
);
11627 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11629 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11630 base_type
= TYPE_TARGET_TYPE (raw_type
);
11632 base_type
= raw_type
;
11634 name
= TYPE_NAME (raw_type
);
11635 subtype_info
= strstr (name
, "___XD");
11636 if (subtype_info
== NULL
)
11638 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11639 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11641 if (L
< INT_MIN
|| U
> INT_MAX
)
11644 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11649 static char *name_buf
= NULL
;
11650 static size_t name_len
= 0;
11651 int prefix_len
= subtype_info
- name
;
11654 const char *bounds_str
;
11657 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11658 strncpy (name_buf
, name
, prefix_len
);
11659 name_buf
[prefix_len
] = '\0';
11662 bounds_str
= strchr (subtype_info
, '_');
11665 if (*subtype_info
== 'L')
11667 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11668 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11670 if (bounds_str
[n
] == '_')
11672 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11678 strcpy (name_buf
+ prefix_len
, "___L");
11679 if (!get_int_var_value (name_buf
, L
))
11681 lim_warning (_("Unknown lower bound, using 1."));
11686 if (*subtype_info
== 'U')
11688 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11689 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11694 strcpy (name_buf
+ prefix_len
, "___U");
11695 if (!get_int_var_value (name_buf
, U
))
11697 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11702 type
= create_static_range_type (alloc_type_copy (raw_type
),
11704 /* create_static_range_type alters the resulting type's length
11705 to match the size of the base_type, which is not what we want.
11706 Set it back to the original range type's length. */
11707 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11708 TYPE_NAME (type
) = name
;
11713 /* True iff NAME is the name of a range type. */
11716 ada_is_range_type_name (const char *name
)
11718 return (name
!= NULL
&& strstr (name
, "___XD"));
11722 /* Modular types */
11724 /* True iff TYPE is an Ada modular type. */
11727 ada_is_modular_type (struct type
*type
)
11729 struct type
*subranged_type
= get_base_type (type
);
11731 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11732 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11733 && TYPE_UNSIGNED (subranged_type
));
11736 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11739 ada_modulus (struct type
*type
)
11741 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11745 /* Ada exception catchpoint support:
11746 ---------------------------------
11748 We support 3 kinds of exception catchpoints:
11749 . catchpoints on Ada exceptions
11750 . catchpoints on unhandled Ada exceptions
11751 . catchpoints on failed assertions
11753 Exceptions raised during failed assertions, or unhandled exceptions
11754 could perfectly be caught with the general catchpoint on Ada exceptions.
11755 However, we can easily differentiate these two special cases, and having
11756 the option to distinguish these two cases from the rest can be useful
11757 to zero-in on certain situations.
11759 Exception catchpoints are a specialized form of breakpoint,
11760 since they rely on inserting breakpoints inside known routines
11761 of the GNAT runtime. The implementation therefore uses a standard
11762 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11765 Support in the runtime for exception catchpoints have been changed
11766 a few times already, and these changes affect the implementation
11767 of these catchpoints. In order to be able to support several
11768 variants of the runtime, we use a sniffer that will determine
11769 the runtime variant used by the program being debugged. */
11771 /* Ada's standard exceptions.
11773 The Ada 83 standard also defined Numeric_Error. But there so many
11774 situations where it was unclear from the Ada 83 Reference Manual
11775 (RM) whether Constraint_Error or Numeric_Error should be raised,
11776 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11777 Interpretation saying that anytime the RM says that Numeric_Error
11778 should be raised, the implementation may raise Constraint_Error.
11779 Ada 95 went one step further and pretty much removed Numeric_Error
11780 from the list of standard exceptions (it made it a renaming of
11781 Constraint_Error, to help preserve compatibility when compiling
11782 an Ada83 compiler). As such, we do not include Numeric_Error from
11783 this list of standard exceptions. */
11785 static const char *standard_exc
[] = {
11786 "constraint_error",
11792 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11794 /* A structure that describes how to support exception catchpoints
11795 for a given executable. */
11797 struct exception_support_info
11799 /* The name of the symbol to break on in order to insert
11800 a catchpoint on exceptions. */
11801 const char *catch_exception_sym
;
11803 /* The name of the symbol to break on in order to insert
11804 a catchpoint on unhandled exceptions. */
11805 const char *catch_exception_unhandled_sym
;
11807 /* The name of the symbol to break on in order to insert
11808 a catchpoint on failed assertions. */
11809 const char *catch_assert_sym
;
11811 /* The name of the symbol to break on in order to insert
11812 a catchpoint on exception handling. */
11813 const char *catch_handlers_sym
;
11815 /* Assuming that the inferior just triggered an unhandled exception
11816 catchpoint, this function is responsible for returning the address
11817 in inferior memory where the name of that exception is stored.
11818 Return zero if the address could not be computed. */
11819 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11822 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11823 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11825 /* The following exception support info structure describes how to
11826 implement exception catchpoints with the latest version of the
11827 Ada runtime (as of 2019-08-??). */
11829 static const struct exception_support_info default_exception_support_info
=
11831 "__gnat_debug_raise_exception", /* catch_exception_sym */
11832 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11833 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11834 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11835 ada_unhandled_exception_name_addr
11838 /* The following exception support info structure describes how to
11839 implement exception catchpoints with an earlier version of the
11840 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11842 static const struct exception_support_info exception_support_info_v0
=
11844 "__gnat_debug_raise_exception", /* catch_exception_sym */
11845 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11846 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11847 "__gnat_begin_handler", /* catch_handlers_sym */
11848 ada_unhandled_exception_name_addr
11851 /* The following exception support info structure describes how to
11852 implement exception catchpoints with a slightly older version
11853 of the Ada runtime. */
11855 static const struct exception_support_info exception_support_info_fallback
=
11857 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11858 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11859 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11860 "__gnat_begin_handler", /* catch_handlers_sym */
11861 ada_unhandled_exception_name_addr_from_raise
11864 /* Return nonzero if we can detect the exception support routines
11865 described in EINFO.
11867 This function errors out if an abnormal situation is detected
11868 (for instance, if we find the exception support routines, but
11869 that support is found to be incomplete). */
11872 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11874 struct symbol
*sym
;
11876 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11877 that should be compiled with debugging information. As a result, we
11878 expect to find that symbol in the symtabs. */
11880 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11883 /* Perhaps we did not find our symbol because the Ada runtime was
11884 compiled without debugging info, or simply stripped of it.
11885 It happens on some GNU/Linux distributions for instance, where
11886 users have to install a separate debug package in order to get
11887 the runtime's debugging info. In that situation, let the user
11888 know why we cannot insert an Ada exception catchpoint.
11890 Note: Just for the purpose of inserting our Ada exception
11891 catchpoint, we could rely purely on the associated minimal symbol.
11892 But we would be operating in degraded mode anyway, since we are
11893 still lacking the debugging info needed later on to extract
11894 the name of the exception being raised (this name is printed in
11895 the catchpoint message, and is also used when trying to catch
11896 a specific exception). We do not handle this case for now. */
11897 struct bound_minimal_symbol msym
11898 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11900 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11901 error (_("Your Ada runtime appears to be missing some debugging "
11902 "information.\nCannot insert Ada exception catchpoint "
11903 "in this configuration."));
11908 /* Make sure that the symbol we found corresponds to a function. */
11910 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11912 error (_("Symbol \"%s\" is not a function (class = %d)"),
11913 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11917 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11920 struct bound_minimal_symbol msym
11921 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11923 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11924 error (_("Your Ada runtime appears to be missing some debugging "
11925 "information.\nCannot insert Ada exception catchpoint "
11926 "in this configuration."));
11931 /* Make sure that the symbol we found corresponds to a function. */
11933 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11935 error (_("Symbol \"%s\" is not a function (class = %d)"),
11936 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11943 /* Inspect the Ada runtime and determine which exception info structure
11944 should be used to provide support for exception catchpoints.
11946 This function will always set the per-inferior exception_info,
11947 or raise an error. */
11950 ada_exception_support_info_sniffer (void)
11952 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11954 /* If the exception info is already known, then no need to recompute it. */
11955 if (data
->exception_info
!= NULL
)
11958 /* Check the latest (default) exception support info. */
11959 if (ada_has_this_exception_support (&default_exception_support_info
))
11961 data
->exception_info
= &default_exception_support_info
;
11965 /* Try the v0 exception suport info. */
11966 if (ada_has_this_exception_support (&exception_support_info_v0
))
11968 data
->exception_info
= &exception_support_info_v0
;
11972 /* Try our fallback exception suport info. */
11973 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11975 data
->exception_info
= &exception_support_info_fallback
;
11979 /* Sometimes, it is normal for us to not be able to find the routine
11980 we are looking for. This happens when the program is linked with
11981 the shared version of the GNAT runtime, and the program has not been
11982 started yet. Inform the user of these two possible causes if
11985 if (ada_update_initial_language (language_unknown
) != language_ada
)
11986 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11988 /* If the symbol does not exist, then check that the program is
11989 already started, to make sure that shared libraries have been
11990 loaded. If it is not started, this may mean that the symbol is
11991 in a shared library. */
11993 if (inferior_ptid
.pid () == 0)
11994 error (_("Unable to insert catchpoint. Try to start the program first."));
11996 /* At this point, we know that we are debugging an Ada program and
11997 that the inferior has been started, but we still are not able to
11998 find the run-time symbols. That can mean that we are in
11999 configurable run time mode, or that a-except as been optimized
12000 out by the linker... In any case, at this point it is not worth
12001 supporting this feature. */
12003 error (_("Cannot insert Ada exception catchpoints in this configuration."));
12006 /* True iff FRAME is very likely to be that of a function that is
12007 part of the runtime system. This is all very heuristic, but is
12008 intended to be used as advice as to what frames are uninteresting
12012 is_known_support_routine (struct frame_info
*frame
)
12014 enum language func_lang
;
12016 const char *fullname
;
12018 /* If this code does not have any debugging information (no symtab),
12019 This cannot be any user code. */
12021 symtab_and_line sal
= find_frame_sal (frame
);
12022 if (sal
.symtab
== NULL
)
12025 /* If there is a symtab, but the associated source file cannot be
12026 located, then assume this is not user code: Selecting a frame
12027 for which we cannot display the code would not be very helpful
12028 for the user. This should also take care of case such as VxWorks
12029 where the kernel has some debugging info provided for a few units. */
12031 fullname
= symtab_to_fullname (sal
.symtab
);
12032 if (access (fullname
, R_OK
) != 0)
12035 /* Check the unit filename against the Ada runtime file naming.
12036 We also check the name of the objfile against the name of some
12037 known system libraries that sometimes come with debugging info
12040 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
12042 re_comp (known_runtime_file_name_patterns
[i
]);
12043 if (re_exec (lbasename (sal
.symtab
->filename
)))
12045 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
12046 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
12050 /* Check whether the function is a GNAT-generated entity. */
12052 gdb::unique_xmalloc_ptr
<char> func_name
12053 = find_frame_funname (frame
, &func_lang
, NULL
);
12054 if (func_name
== NULL
)
12057 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
12059 re_comp (known_auxiliary_function_name_patterns
[i
]);
12060 if (re_exec (func_name
.get ()))
12067 /* Find the first frame that contains debugging information and that is not
12068 part of the Ada run-time, starting from FI and moving upward. */
12071 ada_find_printable_frame (struct frame_info
*fi
)
12073 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
12075 if (!is_known_support_routine (fi
))
12084 /* Assuming that the inferior just triggered an unhandled exception
12085 catchpoint, return the address in inferior memory where the name
12086 of the exception is stored.
12088 Return zero if the address could not be computed. */
12091 ada_unhandled_exception_name_addr (void)
12093 return parse_and_eval_address ("e.full_name");
12096 /* Same as ada_unhandled_exception_name_addr, except that this function
12097 should be used when the inferior uses an older version of the runtime,
12098 where the exception name needs to be extracted from a specific frame
12099 several frames up in the callstack. */
12102 ada_unhandled_exception_name_addr_from_raise (void)
12105 struct frame_info
*fi
;
12106 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12108 /* To determine the name of this exception, we need to select
12109 the frame corresponding to RAISE_SYM_NAME. This frame is
12110 at least 3 levels up, so we simply skip the first 3 frames
12111 without checking the name of their associated function. */
12112 fi
= get_current_frame ();
12113 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
12115 fi
= get_prev_frame (fi
);
12119 enum language func_lang
;
12121 gdb::unique_xmalloc_ptr
<char> func_name
12122 = find_frame_funname (fi
, &func_lang
, NULL
);
12123 if (func_name
!= NULL
)
12125 if (strcmp (func_name
.get (),
12126 data
->exception_info
->catch_exception_sym
) == 0)
12127 break; /* We found the frame we were looking for... */
12129 fi
= get_prev_frame (fi
);
12136 return parse_and_eval_address ("id.full_name");
12139 /* Assuming the inferior just triggered an Ada exception catchpoint
12140 (of any type), return the address in inferior memory where the name
12141 of the exception is stored, if applicable.
12143 Assumes the selected frame is the current frame.
12145 Return zero if the address could not be computed, or if not relevant. */
12148 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12149 struct breakpoint
*b
)
12151 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12155 case ada_catch_exception
:
12156 return (parse_and_eval_address ("e.full_name"));
12159 case ada_catch_exception_unhandled
:
12160 return data
->exception_info
->unhandled_exception_name_addr ();
12163 case ada_catch_handlers
:
12164 return 0; /* The runtimes does not provide access to the exception
12168 case ada_catch_assert
:
12169 return 0; /* Exception name is not relevant in this case. */
12173 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12177 return 0; /* Should never be reached. */
12180 /* Assuming the inferior is stopped at an exception catchpoint,
12181 return the message which was associated to the exception, if
12182 available. Return NULL if the message could not be retrieved.
12184 Note: The exception message can be associated to an exception
12185 either through the use of the Raise_Exception function, or
12186 more simply (Ada 2005 and later), via:
12188 raise Exception_Name with "exception message";
12192 static gdb::unique_xmalloc_ptr
<char>
12193 ada_exception_message_1 (void)
12195 struct value
*e_msg_val
;
12198 /* For runtimes that support this feature, the exception message
12199 is passed as an unbounded string argument called "message". */
12200 e_msg_val
= parse_and_eval ("message");
12201 if (e_msg_val
== NULL
)
12202 return NULL
; /* Exception message not supported. */
12204 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
12205 gdb_assert (e_msg_val
!= NULL
);
12206 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
12208 /* If the message string is empty, then treat it as if there was
12209 no exception message. */
12210 if (e_msg_len
<= 0)
12213 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
12214 read_memory_string (value_address (e_msg_val
), e_msg
.get (), e_msg_len
+ 1);
12215 e_msg
.get ()[e_msg_len
] = '\0';
12220 /* Same as ada_exception_message_1, except that all exceptions are
12221 contained here (returning NULL instead). */
12223 static gdb::unique_xmalloc_ptr
<char>
12224 ada_exception_message (void)
12226 gdb::unique_xmalloc_ptr
<char> e_msg
;
12230 e_msg
= ada_exception_message_1 ();
12232 catch (const gdb_exception_error
&e
)
12234 e_msg
.reset (nullptr);
12240 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12241 any error that ada_exception_name_addr_1 might cause to be thrown.
12242 When an error is intercepted, a warning with the error message is printed,
12243 and zero is returned. */
12246 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12247 struct breakpoint
*b
)
12249 CORE_ADDR result
= 0;
12253 result
= ada_exception_name_addr_1 (ex
, b
);
12256 catch (const gdb_exception_error
&e
)
12258 warning (_("failed to get exception name: %s"), e
.what ());
12265 static std::string ada_exception_catchpoint_cond_string
12266 (const char *excep_string
,
12267 enum ada_exception_catchpoint_kind ex
);
12269 /* Ada catchpoints.
12271 In the case of catchpoints on Ada exceptions, the catchpoint will
12272 stop the target on every exception the program throws. When a user
12273 specifies the name of a specific exception, we translate this
12274 request into a condition expression (in text form), and then parse
12275 it into an expression stored in each of the catchpoint's locations.
12276 We then use this condition to check whether the exception that was
12277 raised is the one the user is interested in. If not, then the
12278 target is resumed again. We store the name of the requested
12279 exception, in order to be able to re-set the condition expression
12280 when symbols change. */
12282 /* An instance of this type is used to represent an Ada catchpoint
12283 breakpoint location. */
12285 class ada_catchpoint_location
: public bp_location
12288 ada_catchpoint_location (breakpoint
*owner
)
12289 : bp_location (owner
, bp_loc_software_breakpoint
)
12292 /* The condition that checks whether the exception that was raised
12293 is the specific exception the user specified on catchpoint
12295 expression_up excep_cond_expr
;
12298 /* An instance of this type is used to represent an Ada catchpoint. */
12300 struct ada_catchpoint
: public breakpoint
12302 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12307 /* The name of the specific exception the user specified. */
12308 std::string excep_string
;
12310 /* What kind of catchpoint this is. */
12311 enum ada_exception_catchpoint_kind m_kind
;
12314 /* Parse the exception condition string in the context of each of the
12315 catchpoint's locations, and store them for later evaluation. */
12318 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12319 enum ada_exception_catchpoint_kind ex
)
12321 struct bp_location
*bl
;
12323 /* Nothing to do if there's no specific exception to catch. */
12324 if (c
->excep_string
.empty ())
12327 /* Same if there are no locations... */
12328 if (c
->loc
== NULL
)
12331 /* Compute the condition expression in text form, from the specific
12332 expection we want to catch. */
12333 std::string cond_string
12334 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12336 /* Iterate over all the catchpoint's locations, and parse an
12337 expression for each. */
12338 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12340 struct ada_catchpoint_location
*ada_loc
12341 = (struct ada_catchpoint_location
*) bl
;
12344 if (!bl
->shlib_disabled
)
12348 s
= cond_string
.c_str ();
12351 exp
= parse_exp_1 (&s
, bl
->address
,
12352 block_for_pc (bl
->address
),
12355 catch (const gdb_exception_error
&e
)
12357 warning (_("failed to reevaluate internal exception condition "
12358 "for catchpoint %d: %s"),
12359 c
->number
, e
.what ());
12363 ada_loc
->excep_cond_expr
= std::move (exp
);
12367 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12368 structure for all exception catchpoint kinds. */
12370 static struct bp_location
*
12371 allocate_location_exception (struct breakpoint
*self
)
12373 return new ada_catchpoint_location (self
);
12376 /* Implement the RE_SET method in the breakpoint_ops structure for all
12377 exception catchpoint kinds. */
12380 re_set_exception (struct breakpoint
*b
)
12382 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12384 /* Call the base class's method. This updates the catchpoint's
12386 bkpt_breakpoint_ops
.re_set (b
);
12388 /* Reparse the exception conditional expressions. One for each
12390 create_excep_cond_exprs (c
, c
->m_kind
);
12393 /* Returns true if we should stop for this breakpoint hit. If the
12394 user specified a specific exception, we only want to cause a stop
12395 if the program thrown that exception. */
12398 should_stop_exception (const struct bp_location
*bl
)
12400 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12401 const struct ada_catchpoint_location
*ada_loc
12402 = (const struct ada_catchpoint_location
*) bl
;
12405 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12406 if (c
->m_kind
== ada_catch_assert
)
12407 clear_internalvar (var
);
12414 if (c
->m_kind
== ada_catch_handlers
)
12415 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12416 ".all.occurrence.id");
12420 struct value
*exc
= parse_and_eval (expr
);
12421 set_internalvar (var
, exc
);
12423 catch (const gdb_exception_error
&ex
)
12425 clear_internalvar (var
);
12429 /* With no specific exception, should always stop. */
12430 if (c
->excep_string
.empty ())
12433 if (ada_loc
->excep_cond_expr
== NULL
)
12435 /* We will have a NULL expression if back when we were creating
12436 the expressions, this location's had failed to parse. */
12443 struct value
*mark
;
12445 mark
= value_mark ();
12446 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12447 value_free_to_mark (mark
);
12449 catch (const gdb_exception
&ex
)
12451 exception_fprintf (gdb_stderr
, ex
,
12452 _("Error in testing exception condition:\n"));
12458 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12459 for all exception catchpoint kinds. */
12462 check_status_exception (bpstat bs
)
12464 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12467 /* Implement the PRINT_IT method in the breakpoint_ops structure
12468 for all exception catchpoint kinds. */
12470 static enum print_stop_action
12471 print_it_exception (bpstat bs
)
12473 struct ui_out
*uiout
= current_uiout
;
12474 struct breakpoint
*b
= bs
->breakpoint_at
;
12476 annotate_catchpoint (b
->number
);
12478 if (uiout
->is_mi_like_p ())
12480 uiout
->field_string ("reason",
12481 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12482 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12485 uiout
->text (b
->disposition
== disp_del
12486 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12487 uiout
->field_signed ("bkptno", b
->number
);
12488 uiout
->text (", ");
12490 /* ada_exception_name_addr relies on the selected frame being the
12491 current frame. Need to do this here because this function may be
12492 called more than once when printing a stop, and below, we'll
12493 select the first frame past the Ada run-time (see
12494 ada_find_printable_frame). */
12495 select_frame (get_current_frame ());
12497 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12500 case ada_catch_exception
:
12501 case ada_catch_exception_unhandled
:
12502 case ada_catch_handlers
:
12504 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12505 char exception_name
[256];
12509 read_memory (addr
, (gdb_byte
*) exception_name
,
12510 sizeof (exception_name
) - 1);
12511 exception_name
[sizeof (exception_name
) - 1] = '\0';
12515 /* For some reason, we were unable to read the exception
12516 name. This could happen if the Runtime was compiled
12517 without debugging info, for instance. In that case,
12518 just replace the exception name by the generic string
12519 "exception" - it will read as "an exception" in the
12520 notification we are about to print. */
12521 memcpy (exception_name
, "exception", sizeof ("exception"));
12523 /* In the case of unhandled exception breakpoints, we print
12524 the exception name as "unhandled EXCEPTION_NAME", to make
12525 it clearer to the user which kind of catchpoint just got
12526 hit. We used ui_out_text to make sure that this extra
12527 info does not pollute the exception name in the MI case. */
12528 if (c
->m_kind
== ada_catch_exception_unhandled
)
12529 uiout
->text ("unhandled ");
12530 uiout
->field_string ("exception-name", exception_name
);
12533 case ada_catch_assert
:
12534 /* In this case, the name of the exception is not really
12535 important. Just print "failed assertion" to make it clearer
12536 that his program just hit an assertion-failure catchpoint.
12537 We used ui_out_text because this info does not belong in
12539 uiout
->text ("failed assertion");
12543 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12544 if (exception_message
!= NULL
)
12546 uiout
->text (" (");
12547 uiout
->field_string ("exception-message", exception_message
.get ());
12551 uiout
->text (" at ");
12552 ada_find_printable_frame (get_current_frame ());
12554 return PRINT_SRC_AND_LOC
;
12557 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12558 for all exception catchpoint kinds. */
12561 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12563 struct ui_out
*uiout
= current_uiout
;
12564 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12565 struct value_print_options opts
;
12567 get_user_print_options (&opts
);
12569 if (opts
.addressprint
)
12570 uiout
->field_skip ("addr");
12572 annotate_field (5);
12575 case ada_catch_exception
:
12576 if (!c
->excep_string
.empty ())
12578 std::string msg
= string_printf (_("`%s' Ada exception"),
12579 c
->excep_string
.c_str ());
12581 uiout
->field_string ("what", msg
);
12584 uiout
->field_string ("what", "all Ada exceptions");
12588 case ada_catch_exception_unhandled
:
12589 uiout
->field_string ("what", "unhandled Ada exceptions");
12592 case ada_catch_handlers
:
12593 if (!c
->excep_string
.empty ())
12595 uiout
->field_fmt ("what",
12596 _("`%s' Ada exception handlers"),
12597 c
->excep_string
.c_str ());
12600 uiout
->field_string ("what", "all Ada exceptions handlers");
12603 case ada_catch_assert
:
12604 uiout
->field_string ("what", "failed Ada assertions");
12608 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12613 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12614 for all exception catchpoint kinds. */
12617 print_mention_exception (struct breakpoint
*b
)
12619 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12620 struct ui_out
*uiout
= current_uiout
;
12622 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12623 : _("Catchpoint "));
12624 uiout
->field_signed ("bkptno", b
->number
);
12625 uiout
->text (": ");
12629 case ada_catch_exception
:
12630 if (!c
->excep_string
.empty ())
12632 std::string info
= string_printf (_("`%s' Ada exception"),
12633 c
->excep_string
.c_str ());
12634 uiout
->text (info
.c_str ());
12637 uiout
->text (_("all Ada exceptions"));
12640 case ada_catch_exception_unhandled
:
12641 uiout
->text (_("unhandled Ada exceptions"));
12644 case ada_catch_handlers
:
12645 if (!c
->excep_string
.empty ())
12648 = string_printf (_("`%s' Ada exception handlers"),
12649 c
->excep_string
.c_str ());
12650 uiout
->text (info
.c_str ());
12653 uiout
->text (_("all Ada exceptions handlers"));
12656 case ada_catch_assert
:
12657 uiout
->text (_("failed Ada assertions"));
12661 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12666 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12667 for all exception catchpoint kinds. */
12670 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12672 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12676 case ada_catch_exception
:
12677 fprintf_filtered (fp
, "catch exception");
12678 if (!c
->excep_string
.empty ())
12679 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12682 case ada_catch_exception_unhandled
:
12683 fprintf_filtered (fp
, "catch exception unhandled");
12686 case ada_catch_handlers
:
12687 fprintf_filtered (fp
, "catch handlers");
12690 case ada_catch_assert
:
12691 fprintf_filtered (fp
, "catch assert");
12695 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12697 print_recreate_thread (b
, fp
);
12700 /* Virtual tables for various breakpoint types. */
12701 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12702 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12703 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12704 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12706 /* See ada-lang.h. */
12709 is_ada_exception_catchpoint (breakpoint
*bp
)
12711 return (bp
->ops
== &catch_exception_breakpoint_ops
12712 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12713 || bp
->ops
== &catch_assert_breakpoint_ops
12714 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12717 /* Split the arguments specified in a "catch exception" command.
12718 Set EX to the appropriate catchpoint type.
12719 Set EXCEP_STRING to the name of the specific exception if
12720 specified by the user.
12721 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12722 "catch handlers" command. False otherwise.
12723 If a condition is found at the end of the arguments, the condition
12724 expression is stored in COND_STRING (memory must be deallocated
12725 after use). Otherwise COND_STRING is set to NULL. */
12728 catch_ada_exception_command_split (const char *args
,
12729 bool is_catch_handlers_cmd
,
12730 enum ada_exception_catchpoint_kind
*ex
,
12731 std::string
*excep_string
,
12732 std::string
*cond_string
)
12734 std::string exception_name
;
12736 exception_name
= extract_arg (&args
);
12737 if (exception_name
== "if")
12739 /* This is not an exception name; this is the start of a condition
12740 expression for a catchpoint on all exceptions. So, "un-get"
12741 this token, and set exception_name to NULL. */
12742 exception_name
.clear ();
12746 /* Check to see if we have a condition. */
12748 args
= skip_spaces (args
);
12749 if (startswith (args
, "if")
12750 && (isspace (args
[2]) || args
[2] == '\0'))
12753 args
= skip_spaces (args
);
12755 if (args
[0] == '\0')
12756 error (_("Condition missing after `if' keyword"));
12757 *cond_string
= args
;
12759 args
+= strlen (args
);
12762 /* Check that we do not have any more arguments. Anything else
12765 if (args
[0] != '\0')
12766 error (_("Junk at end of expression"));
12768 if (is_catch_handlers_cmd
)
12770 /* Catch handling of exceptions. */
12771 *ex
= ada_catch_handlers
;
12772 *excep_string
= exception_name
;
12774 else if (exception_name
.empty ())
12776 /* Catch all exceptions. */
12777 *ex
= ada_catch_exception
;
12778 excep_string
->clear ();
12780 else if (exception_name
== "unhandled")
12782 /* Catch unhandled exceptions. */
12783 *ex
= ada_catch_exception_unhandled
;
12784 excep_string
->clear ();
12788 /* Catch a specific exception. */
12789 *ex
= ada_catch_exception
;
12790 *excep_string
= exception_name
;
12794 /* Return the name of the symbol on which we should break in order to
12795 implement a catchpoint of the EX kind. */
12797 static const char *
12798 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12800 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12802 gdb_assert (data
->exception_info
!= NULL
);
12806 case ada_catch_exception
:
12807 return (data
->exception_info
->catch_exception_sym
);
12809 case ada_catch_exception_unhandled
:
12810 return (data
->exception_info
->catch_exception_unhandled_sym
);
12812 case ada_catch_assert
:
12813 return (data
->exception_info
->catch_assert_sym
);
12815 case ada_catch_handlers
:
12816 return (data
->exception_info
->catch_handlers_sym
);
12819 internal_error (__FILE__
, __LINE__
,
12820 _("unexpected catchpoint kind (%d)"), ex
);
12824 /* Return the breakpoint ops "virtual table" used for catchpoints
12827 static const struct breakpoint_ops
*
12828 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12832 case ada_catch_exception
:
12833 return (&catch_exception_breakpoint_ops
);
12835 case ada_catch_exception_unhandled
:
12836 return (&catch_exception_unhandled_breakpoint_ops
);
12838 case ada_catch_assert
:
12839 return (&catch_assert_breakpoint_ops
);
12841 case ada_catch_handlers
:
12842 return (&catch_handlers_breakpoint_ops
);
12845 internal_error (__FILE__
, __LINE__
,
12846 _("unexpected catchpoint kind (%d)"), ex
);
12850 /* Return the condition that will be used to match the current exception
12851 being raised with the exception that the user wants to catch. This
12852 assumes that this condition is used when the inferior just triggered
12853 an exception catchpoint.
12854 EX: the type of catchpoints used for catching Ada exceptions. */
12857 ada_exception_catchpoint_cond_string (const char *excep_string
,
12858 enum ada_exception_catchpoint_kind ex
)
12861 bool is_standard_exc
= false;
12862 std::string result
;
12864 if (ex
== ada_catch_handlers
)
12866 /* For exception handlers catchpoints, the condition string does
12867 not use the same parameter as for the other exceptions. */
12868 result
= ("long_integer (GNAT_GCC_exception_Access"
12869 "(gcc_exception).all.occurrence.id)");
12872 result
= "long_integer (e)";
12874 /* The standard exceptions are a special case. They are defined in
12875 runtime units that have been compiled without debugging info; if
12876 EXCEP_STRING is the not-fully-qualified name of a standard
12877 exception (e.g. "constraint_error") then, during the evaluation
12878 of the condition expression, the symbol lookup on this name would
12879 *not* return this standard exception. The catchpoint condition
12880 may then be set only on user-defined exceptions which have the
12881 same not-fully-qualified name (e.g. my_package.constraint_error).
12883 To avoid this unexcepted behavior, these standard exceptions are
12884 systematically prefixed by "standard". This means that "catch
12885 exception constraint_error" is rewritten into "catch exception
12886 standard.constraint_error".
12888 If an exception named constraint_error is defined in another package of
12889 the inferior program, then the only way to specify this exception as a
12890 breakpoint condition is to use its fully-qualified named:
12891 e.g. my_package.constraint_error. */
12893 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12895 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12897 is_standard_exc
= true;
12904 if (is_standard_exc
)
12905 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12907 string_appendf (result
, "long_integer (&%s)", excep_string
);
12912 /* Return the symtab_and_line that should be used to insert an exception
12913 catchpoint of the TYPE kind.
12915 ADDR_STRING returns the name of the function where the real
12916 breakpoint that implements the catchpoints is set, depending on the
12917 type of catchpoint we need to create. */
12919 static struct symtab_and_line
12920 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12921 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12923 const char *sym_name
;
12924 struct symbol
*sym
;
12926 /* First, find out which exception support info to use. */
12927 ada_exception_support_info_sniffer ();
12929 /* Then lookup the function on which we will break in order to catch
12930 the Ada exceptions requested by the user. */
12931 sym_name
= ada_exception_sym_name (ex
);
12932 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12935 error (_("Catchpoint symbol not found: %s"), sym_name
);
12937 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12938 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12940 /* Set ADDR_STRING. */
12941 *addr_string
= sym_name
;
12944 *ops
= ada_exception_breakpoint_ops (ex
);
12946 return find_function_start_sal (sym
, 1);
12949 /* Create an Ada exception catchpoint.
12951 EX_KIND is the kind of exception catchpoint to be created.
12953 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12954 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12955 of the exception to which this catchpoint applies.
12957 COND_STRING, if not empty, is the catchpoint condition.
12959 TEMPFLAG, if nonzero, means that the underlying breakpoint
12960 should be temporary.
12962 FROM_TTY is the usual argument passed to all commands implementations. */
12965 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12966 enum ada_exception_catchpoint_kind ex_kind
,
12967 const std::string
&excep_string
,
12968 const std::string
&cond_string
,
12973 std::string addr_string
;
12974 const struct breakpoint_ops
*ops
= NULL
;
12975 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12977 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12978 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12979 ops
, tempflag
, disabled
, from_tty
);
12980 c
->excep_string
= excep_string
;
12981 create_excep_cond_exprs (c
.get (), ex_kind
);
12982 if (!cond_string
.empty ())
12983 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
);
12984 install_breakpoint (0, std::move (c
), 1);
12987 /* Implement the "catch exception" command. */
12990 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12991 struct cmd_list_element
*command
)
12993 const char *arg
= arg_entry
;
12994 struct gdbarch
*gdbarch
= get_current_arch ();
12996 enum ada_exception_catchpoint_kind ex_kind
;
12997 std::string excep_string
;
12998 std::string cond_string
;
13000 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13004 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
13006 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
13007 excep_string
, cond_string
,
13008 tempflag
, 1 /* enabled */,
13012 /* Implement the "catch handlers" command. */
13015 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
13016 struct cmd_list_element
*command
)
13018 const char *arg
= arg_entry
;
13019 struct gdbarch
*gdbarch
= get_current_arch ();
13021 enum ada_exception_catchpoint_kind ex_kind
;
13022 std::string excep_string
;
13023 std::string cond_string
;
13025 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13029 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
13031 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
13032 excep_string
, cond_string
,
13033 tempflag
, 1 /* enabled */,
13037 /* Completion function for the Ada "catch" commands. */
13040 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
13041 const char *text
, const char *word
)
13043 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
13045 for (const ada_exc_info
&info
: exceptions
)
13047 if (startswith (info
.name
, word
))
13048 tracker
.add_completion (make_unique_xstrdup (info
.name
));
13052 /* Split the arguments specified in a "catch assert" command.
13054 ARGS contains the command's arguments (or the empty string if
13055 no arguments were passed).
13057 If ARGS contains a condition, set COND_STRING to that condition
13058 (the memory needs to be deallocated after use). */
13061 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
13063 args
= skip_spaces (args
);
13065 /* Check whether a condition was provided. */
13066 if (startswith (args
, "if")
13067 && (isspace (args
[2]) || args
[2] == '\0'))
13070 args
= skip_spaces (args
);
13071 if (args
[0] == '\0')
13072 error (_("condition missing after `if' keyword"));
13073 cond_string
.assign (args
);
13076 /* Otherwise, there should be no other argument at the end of
13078 else if (args
[0] != '\0')
13079 error (_("Junk at end of arguments."));
13082 /* Implement the "catch assert" command. */
13085 catch_assert_command (const char *arg_entry
, int from_tty
,
13086 struct cmd_list_element
*command
)
13088 const char *arg
= arg_entry
;
13089 struct gdbarch
*gdbarch
= get_current_arch ();
13091 std::string cond_string
;
13093 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13097 catch_ada_assert_command_split (arg
, cond_string
);
13098 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
13100 tempflag
, 1 /* enabled */,
13104 /* Return non-zero if the symbol SYM is an Ada exception object. */
13107 ada_is_exception_sym (struct symbol
*sym
)
13109 const char *type_name
= TYPE_NAME (SYMBOL_TYPE (sym
));
13111 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
13112 && SYMBOL_CLASS (sym
) != LOC_BLOCK
13113 && SYMBOL_CLASS (sym
) != LOC_CONST
13114 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
13115 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
13118 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13119 Ada exception object. This matches all exceptions except the ones
13120 defined by the Ada language. */
13123 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13127 if (!ada_is_exception_sym (sym
))
13130 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13131 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
13132 return 0; /* A standard exception. */
13134 /* Numeric_Error is also a standard exception, so exclude it.
13135 See the STANDARD_EXC description for more details as to why
13136 this exception is not listed in that array. */
13137 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
13143 /* A helper function for std::sort, comparing two struct ada_exc_info
13146 The comparison is determined first by exception name, and then
13147 by exception address. */
13150 ada_exc_info::operator< (const ada_exc_info
&other
) const
13154 result
= strcmp (name
, other
.name
);
13157 if (result
== 0 && addr
< other
.addr
)
13163 ada_exc_info::operator== (const ada_exc_info
&other
) const
13165 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
13168 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13169 routine, but keeping the first SKIP elements untouched.
13171 All duplicates are also removed. */
13174 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
13177 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
13178 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
13179 exceptions
->end ());
13182 /* Add all exceptions defined by the Ada standard whose name match
13183 a regular expression.
13185 If PREG is not NULL, then this regexp_t object is used to
13186 perform the symbol name matching. Otherwise, no name-based
13187 filtering is performed.
13189 EXCEPTIONS is a vector of exceptions to which matching exceptions
13193 ada_add_standard_exceptions (compiled_regex
*preg
,
13194 std::vector
<ada_exc_info
> *exceptions
)
13198 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13201 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
13203 struct bound_minimal_symbol msymbol
13204 = ada_lookup_simple_minsym (standard_exc
[i
]);
13206 if (msymbol
.minsym
!= NULL
)
13208 struct ada_exc_info info
13209 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13211 exceptions
->push_back (info
);
13217 /* Add all Ada exceptions defined locally and accessible from the given
13220 If PREG is not NULL, then this regexp_t object is used to
13221 perform the symbol name matching. Otherwise, no name-based
13222 filtering is performed.
13224 EXCEPTIONS is a vector of exceptions to which matching exceptions
13228 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13229 struct frame_info
*frame
,
13230 std::vector
<ada_exc_info
> *exceptions
)
13232 const struct block
*block
= get_frame_block (frame
, 0);
13236 struct block_iterator iter
;
13237 struct symbol
*sym
;
13239 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13241 switch (SYMBOL_CLASS (sym
))
13248 if (ada_is_exception_sym (sym
))
13250 struct ada_exc_info info
= {sym
->print_name (),
13251 SYMBOL_VALUE_ADDRESS (sym
)};
13253 exceptions
->push_back (info
);
13257 if (BLOCK_FUNCTION (block
) != NULL
)
13259 block
= BLOCK_SUPERBLOCK (block
);
13263 /* Return true if NAME matches PREG or if PREG is NULL. */
13266 name_matches_regex (const char *name
, compiled_regex
*preg
)
13268 return (preg
== NULL
13269 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13272 /* Add all exceptions defined globally whose name name match
13273 a regular expression, excluding standard exceptions.
13275 The reason we exclude standard exceptions is that they need
13276 to be handled separately: Standard exceptions are defined inside
13277 a runtime unit which is normally not compiled with debugging info,
13278 and thus usually do not show up in our symbol search. However,
13279 if the unit was in fact built with debugging info, we need to
13280 exclude them because they would duplicate the entry we found
13281 during the special loop that specifically searches for those
13282 standard exceptions.
13284 If PREG is not NULL, then this regexp_t object is used to
13285 perform the symbol name matching. Otherwise, no name-based
13286 filtering is performed.
13288 EXCEPTIONS is a vector of exceptions to which matching exceptions
13292 ada_add_global_exceptions (compiled_regex
*preg
,
13293 std::vector
<ada_exc_info
> *exceptions
)
13295 /* In Ada, the symbol "search name" is a linkage name, whereas the
13296 regular expression used to do the matching refers to the natural
13297 name. So match against the decoded name. */
13298 expand_symtabs_matching (NULL
,
13299 lookup_name_info::match_any (),
13300 [&] (const char *search_name
)
13302 std::string decoded
= ada_decode (search_name
);
13303 return name_matches_regex (decoded
.c_str (), preg
);
13308 for (objfile
*objfile
: current_program_space
->objfiles ())
13310 for (compunit_symtab
*s
: objfile
->compunits ())
13312 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13315 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13317 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13318 struct block_iterator iter
;
13319 struct symbol
*sym
;
13321 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13322 if (ada_is_non_standard_exception_sym (sym
)
13323 && name_matches_regex (sym
->natural_name (), preg
))
13325 struct ada_exc_info info
13326 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13328 exceptions
->push_back (info
);
13335 /* Implements ada_exceptions_list with the regular expression passed
13336 as a regex_t, rather than a string.
13338 If not NULL, PREG is used to filter out exceptions whose names
13339 do not match. Otherwise, all exceptions are listed. */
13341 static std::vector
<ada_exc_info
>
13342 ada_exceptions_list_1 (compiled_regex
*preg
)
13344 std::vector
<ada_exc_info
> result
;
13347 /* First, list the known standard exceptions. These exceptions
13348 need to be handled separately, as they are usually defined in
13349 runtime units that have been compiled without debugging info. */
13351 ada_add_standard_exceptions (preg
, &result
);
13353 /* Next, find all exceptions whose scope is local and accessible
13354 from the currently selected frame. */
13356 if (has_stack_frames ())
13358 prev_len
= result
.size ();
13359 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13361 if (result
.size () > prev_len
)
13362 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13365 /* Add all exceptions whose scope is global. */
13367 prev_len
= result
.size ();
13368 ada_add_global_exceptions (preg
, &result
);
13369 if (result
.size () > prev_len
)
13370 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13375 /* Return a vector of ada_exc_info.
13377 If REGEXP is NULL, all exceptions are included in the result.
13378 Otherwise, it should contain a valid regular expression,
13379 and only the exceptions whose names match that regular expression
13380 are included in the result.
13382 The exceptions are sorted in the following order:
13383 - Standard exceptions (defined by the Ada language), in
13384 alphabetical order;
13385 - Exceptions only visible from the current frame, in
13386 alphabetical order;
13387 - Exceptions whose scope is global, in alphabetical order. */
13389 std::vector
<ada_exc_info
>
13390 ada_exceptions_list (const char *regexp
)
13392 if (regexp
== NULL
)
13393 return ada_exceptions_list_1 (NULL
);
13395 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13396 return ada_exceptions_list_1 (®
);
13399 /* Implement the "info exceptions" command. */
13402 info_exceptions_command (const char *regexp
, int from_tty
)
13404 struct gdbarch
*gdbarch
= get_current_arch ();
13406 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13408 if (regexp
!= NULL
)
13410 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13412 printf_filtered (_("All defined Ada exceptions:\n"));
13414 for (const ada_exc_info
&info
: exceptions
)
13415 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13419 /* Information about operators given special treatment in functions
13421 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13423 #define ADA_OPERATORS \
13424 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13425 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13426 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13427 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13428 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13429 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13430 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13431 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13432 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13433 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13434 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13435 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13436 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13437 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13438 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13439 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13440 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13441 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13442 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13445 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13448 switch (exp
->elts
[pc
- 1].opcode
)
13451 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13454 #define OP_DEFN(op, len, args, binop) \
13455 case op: *oplenp = len; *argsp = args; break;
13461 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13466 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13471 /* Implementation of the exp_descriptor method operator_check. */
13474 ada_operator_check (struct expression
*exp
, int pos
,
13475 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13478 const union exp_element
*const elts
= exp
->elts
;
13479 struct type
*type
= NULL
;
13481 switch (elts
[pos
].opcode
)
13483 case UNOP_IN_RANGE
:
13485 type
= elts
[pos
+ 1].type
;
13489 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13492 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13494 if (type
&& TYPE_OBJFILE (type
)
13495 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13501 static const char *
13502 ada_op_name (enum exp_opcode opcode
)
13507 return op_name_standard (opcode
);
13509 #define OP_DEFN(op, len, args, binop) case op: return #op;
13514 return "OP_AGGREGATE";
13516 return "OP_CHOICES";
13522 /* As for operator_length, but assumes PC is pointing at the first
13523 element of the operator, and gives meaningful results only for the
13524 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13527 ada_forward_operator_length (struct expression
*exp
, int pc
,
13528 int *oplenp
, int *argsp
)
13530 switch (exp
->elts
[pc
].opcode
)
13533 *oplenp
= *argsp
= 0;
13536 #define OP_DEFN(op, len, args, binop) \
13537 case op: *oplenp = len; *argsp = args; break;
13543 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13548 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13554 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13556 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13564 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13566 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13571 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13575 /* Ada attributes ('Foo). */
13578 case OP_ATR_LENGTH
:
13582 case OP_ATR_MODULUS
:
13589 case UNOP_IN_RANGE
:
13591 /* XXX: gdb_sprint_host_address, type_sprint */
13592 fprintf_filtered (stream
, _("Type @"));
13593 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13594 fprintf_filtered (stream
, " (");
13595 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13596 fprintf_filtered (stream
, ")");
13598 case BINOP_IN_BOUNDS
:
13599 fprintf_filtered (stream
, " (%d)",
13600 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13602 case TERNOP_IN_RANGE
:
13607 case OP_DISCRETE_RANGE
:
13608 case OP_POSITIONAL
:
13615 char *name
= &exp
->elts
[elt
+ 2].string
;
13616 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13618 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13623 return dump_subexp_body_standard (exp
, stream
, elt
);
13627 for (i
= 0; i
< nargs
; i
+= 1)
13628 elt
= dump_subexp (exp
, stream
, elt
);
13633 /* The Ada extension of print_subexp (q.v.). */
13636 ada_print_subexp (struct expression
*exp
, int *pos
,
13637 struct ui_file
*stream
, enum precedence prec
)
13639 int oplen
, nargs
, i
;
13641 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13643 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13650 print_subexp_standard (exp
, pos
, stream
, prec
);
13654 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13657 case BINOP_IN_BOUNDS
:
13658 /* XXX: sprint_subexp */
13659 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13660 fputs_filtered (" in ", stream
);
13661 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13662 fputs_filtered ("'range", stream
);
13663 if (exp
->elts
[pc
+ 1].longconst
> 1)
13664 fprintf_filtered (stream
, "(%ld)",
13665 (long) exp
->elts
[pc
+ 1].longconst
);
13668 case TERNOP_IN_RANGE
:
13669 if (prec
>= PREC_EQUAL
)
13670 fputs_filtered ("(", stream
);
13671 /* XXX: sprint_subexp */
13672 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13673 fputs_filtered (" in ", stream
);
13674 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13675 fputs_filtered (" .. ", stream
);
13676 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13677 if (prec
>= PREC_EQUAL
)
13678 fputs_filtered (")", stream
);
13683 case OP_ATR_LENGTH
:
13687 case OP_ATR_MODULUS
:
13692 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13694 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13695 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13696 &type_print_raw_options
);
13700 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13701 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13706 for (tem
= 1; tem
< nargs
; tem
+= 1)
13708 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13709 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13711 fputs_filtered (")", stream
);
13716 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13717 fputs_filtered ("'(", stream
);
13718 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13719 fputs_filtered (")", stream
);
13722 case UNOP_IN_RANGE
:
13723 /* XXX: sprint_subexp */
13724 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13725 fputs_filtered (" in ", stream
);
13726 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13727 &type_print_raw_options
);
13730 case OP_DISCRETE_RANGE
:
13731 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13732 fputs_filtered ("..", stream
);
13733 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13737 fputs_filtered ("others => ", stream
);
13738 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13742 for (i
= 0; i
< nargs
-1; i
+= 1)
13745 fputs_filtered ("|", stream
);
13746 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13748 fputs_filtered (" => ", stream
);
13749 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13752 case OP_POSITIONAL
:
13753 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13757 fputs_filtered ("(", stream
);
13758 for (i
= 0; i
< nargs
; i
+= 1)
13761 fputs_filtered (", ", stream
);
13762 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13764 fputs_filtered (")", stream
);
13769 /* Table mapping opcodes into strings for printing operators
13770 and precedences of the operators. */
13772 static const struct op_print ada_op_print_tab
[] = {
13773 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13774 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13775 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13776 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13777 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13778 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13779 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13780 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13781 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13782 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13783 {">", BINOP_GTR
, PREC_ORDER
, 0},
13784 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13785 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13786 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13787 {"+", BINOP_ADD
, PREC_ADD
, 0},
13788 {"-", BINOP_SUB
, PREC_ADD
, 0},
13789 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13790 {"*", BINOP_MUL
, PREC_MUL
, 0},
13791 {"/", BINOP_DIV
, PREC_MUL
, 0},
13792 {"rem", BINOP_REM
, PREC_MUL
, 0},
13793 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13794 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13795 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13796 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13797 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13798 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13799 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13800 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13801 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13802 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13803 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13804 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13807 enum ada_primitive_types
{
13808 ada_primitive_type_int
,
13809 ada_primitive_type_long
,
13810 ada_primitive_type_short
,
13811 ada_primitive_type_char
,
13812 ada_primitive_type_float
,
13813 ada_primitive_type_double
,
13814 ada_primitive_type_void
,
13815 ada_primitive_type_long_long
,
13816 ada_primitive_type_long_double
,
13817 ada_primitive_type_natural
,
13818 ada_primitive_type_positive
,
13819 ada_primitive_type_system_address
,
13820 ada_primitive_type_storage_offset
,
13821 nr_ada_primitive_types
13825 ada_language_arch_info (struct gdbarch
*gdbarch
,
13826 struct language_arch_info
*lai
)
13828 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13830 lai
->primitive_type_vector
13831 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13834 lai
->primitive_type_vector
[ada_primitive_type_int
]
13835 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13837 lai
->primitive_type_vector
[ada_primitive_type_long
]
13838 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13839 0, "long_integer");
13840 lai
->primitive_type_vector
[ada_primitive_type_short
]
13841 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13842 0, "short_integer");
13843 lai
->string_char_type
13844 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13845 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13846 lai
->primitive_type_vector
[ada_primitive_type_float
]
13847 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13848 "float", gdbarch_float_format (gdbarch
));
13849 lai
->primitive_type_vector
[ada_primitive_type_double
]
13850 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13851 "long_float", gdbarch_double_format (gdbarch
));
13852 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13853 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13854 0, "long_long_integer");
13855 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13856 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13857 "long_long_float", gdbarch_long_double_format (gdbarch
));
13858 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13859 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13861 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13862 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13864 lai
->primitive_type_vector
[ada_primitive_type_void
]
13865 = builtin
->builtin_void
;
13867 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13868 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13870 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13871 = "system__address";
13873 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13874 type. This is a signed integral type whose size is the same as
13875 the size of addresses. */
13877 unsigned int addr_length
= TYPE_LENGTH
13878 (lai
->primitive_type_vector
[ada_primitive_type_system_address
]);
13880 lai
->primitive_type_vector
[ada_primitive_type_storage_offset
]
13881 = arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13885 lai
->bool_type_symbol
= NULL
;
13886 lai
->bool_type_default
= builtin
->builtin_bool
;
13889 /* Language vector */
13891 /* Not really used, but needed in the ada_language_defn. */
13894 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13896 ada_emit_char (c
, type
, stream
, quoter
, 1);
13900 parse (struct parser_state
*ps
)
13902 warnings_issued
= 0;
13903 return ada_parse (ps
);
13906 static const struct exp_descriptor ada_exp_descriptor
= {
13908 ada_operator_length
,
13909 ada_operator_check
,
13911 ada_dump_subexp_body
,
13912 ada_evaluate_subexp
13915 /* symbol_name_matcher_ftype adapter for wild_match. */
13918 do_wild_match (const char *symbol_search_name
,
13919 const lookup_name_info
&lookup_name
,
13920 completion_match_result
*comp_match_res
)
13922 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13925 /* symbol_name_matcher_ftype adapter for full_match. */
13928 do_full_match (const char *symbol_search_name
,
13929 const lookup_name_info
&lookup_name
,
13930 completion_match_result
*comp_match_res
)
13932 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13935 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13938 do_exact_match (const char *symbol_search_name
,
13939 const lookup_name_info
&lookup_name
,
13940 completion_match_result
*comp_match_res
)
13942 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13945 /* Build the Ada lookup name for LOOKUP_NAME. */
13947 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13949 const std::string
&user_name
= lookup_name
.name ();
13951 if (user_name
[0] == '<')
13953 if (user_name
.back () == '>')
13954 m_encoded_name
= user_name
.substr (1, user_name
.size () - 2);
13956 m_encoded_name
= user_name
.substr (1, user_name
.size () - 1);
13957 m_encoded_p
= true;
13958 m_verbatim_p
= true;
13959 m_wild_match_p
= false;
13960 m_standard_p
= false;
13964 m_verbatim_p
= false;
13966 m_encoded_p
= user_name
.find ("__") != std::string::npos
;
13970 const char *folded
= ada_fold_name (user_name
.c_str ());
13971 const char *encoded
= ada_encode_1 (folded
, false);
13972 if (encoded
!= NULL
)
13973 m_encoded_name
= encoded
;
13975 m_encoded_name
= user_name
;
13978 m_encoded_name
= user_name
;
13980 /* Handle the 'package Standard' special case. See description
13981 of m_standard_p. */
13982 if (startswith (m_encoded_name
.c_str (), "standard__"))
13984 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13985 m_standard_p
= true;
13988 m_standard_p
= false;
13990 /* If the name contains a ".", then the user is entering a fully
13991 qualified entity name, and the match must not be done in wild
13992 mode. Similarly, if the user wants to complete what looks
13993 like an encoded name, the match must not be done in wild
13994 mode. Also, in the standard__ special case always do
13995 non-wild matching. */
13997 = (lookup_name
.match_type () != symbol_name_match_type::FULL
14000 && user_name
.find ('.') == std::string::npos
);
14004 /* symbol_name_matcher_ftype method for Ada. This only handles
14005 completion mode. */
14008 ada_symbol_name_matches (const char *symbol_search_name
,
14009 const lookup_name_info
&lookup_name
,
14010 completion_match_result
*comp_match_res
)
14012 return lookup_name
.ada ().matches (symbol_search_name
,
14013 lookup_name
.match_type (),
14017 /* A name matcher that matches the symbol name exactly, with
14021 literal_symbol_name_matcher (const char *symbol_search_name
,
14022 const lookup_name_info
&lookup_name
,
14023 completion_match_result
*comp_match_res
)
14025 const std::string
&name
= lookup_name
.name ();
14027 int cmp
= (lookup_name
.completion_mode ()
14028 ? strncmp (symbol_search_name
, name
.c_str (), name
.size ())
14029 : strcmp (symbol_search_name
, name
.c_str ()));
14032 if (comp_match_res
!= NULL
)
14033 comp_match_res
->set_match (symbol_search_name
);
14040 /* Implement the "la_get_symbol_name_matcher" language_defn method for
14043 static symbol_name_matcher_ftype
*
14044 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
14046 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
14047 return literal_symbol_name_matcher
;
14049 if (lookup_name
.completion_mode ())
14050 return ada_symbol_name_matches
;
14053 if (lookup_name
.ada ().wild_match_p ())
14054 return do_wild_match
;
14055 else if (lookup_name
.ada ().verbatim_p ())
14056 return do_exact_match
;
14058 return do_full_match
;
14062 /* Implement the "la_read_var_value" language_defn method for Ada. */
14064 static struct value
*
14065 ada_read_var_value (struct symbol
*var
, const struct block
*var_block
,
14066 struct frame_info
*frame
)
14068 /* The only case where default_read_var_value is not sufficient
14069 is when VAR is a renaming... */
14070 if (frame
!= nullptr)
14072 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
14073 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
14074 return ada_read_renaming_var_value (var
, frame_block
);
14077 /* This is a typical case where we expect the default_read_var_value
14078 function to work. */
14079 return default_read_var_value (var
, var_block
, frame
);
14082 static const char *ada_extensions
[] =
14084 ".adb", ".ads", ".a", ".ada", ".dg", NULL
14087 extern const struct language_defn ada_language_defn
= {
14088 "ada", /* Language name */
14092 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
14093 that's not quite what this means. */
14095 macro_expansion_no
,
14097 &ada_exp_descriptor
,
14100 ada_printchar
, /* Print a character constant */
14101 ada_printstr
, /* Function to print string constant */
14102 emit_char
, /* Function to print single char (not used) */
14103 ada_print_type
, /* Print a type using appropriate syntax */
14104 ada_print_typedef
, /* Print a typedef using appropriate syntax */
14105 ada_value_print_inner
, /* la_value_print_inner */
14106 ada_value_print
, /* Print a top-level value */
14107 ada_read_var_value
, /* la_read_var_value */
14108 NULL
, /* Language specific skip_trampoline */
14109 NULL
, /* name_of_this */
14110 true, /* la_store_sym_names_in_linkage_form_p */
14111 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
14112 basic_lookup_transparent_type
, /* lookup_transparent_type */
14113 ada_la_decode
, /* Language specific symbol demangler */
14114 ada_sniff_from_mangled_name
,
14115 NULL
, /* Language specific
14116 class_name_from_physname */
14117 ada_op_print_tab
, /* expression operators for printing */
14118 0, /* c-style arrays */
14119 1, /* String lower bound */
14120 ada_get_gdb_completer_word_break_characters
,
14121 ada_collect_symbol_completion_matches
,
14122 ada_language_arch_info
,
14123 ada_print_array_index
,
14124 default_pass_by_reference
,
14125 ada_watch_location_expression
,
14126 ada_get_symbol_name_matcher
, /* la_get_symbol_name_matcher */
14127 ada_iterate_over_symbols
,
14128 default_search_name_hash
,
14132 ada_is_string_type
,
14133 "(...)" /* la_struct_too_deep_ellipsis */
14136 /* Command-list for the "set/show ada" prefix command. */
14137 static struct cmd_list_element
*set_ada_list
;
14138 static struct cmd_list_element
*show_ada_list
;
14140 /* Implement the "set ada" prefix command. */
14143 set_ada_command (const char *arg
, int from_tty
)
14145 printf_unfiltered (_(\
14146 "\"set ada\" must be followed by the name of a setting.\n"));
14147 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
14150 /* Implement the "show ada" prefix command. */
14153 show_ada_command (const char *args
, int from_tty
)
14155 cmd_show_list (show_ada_list
, from_tty
, "");
14159 initialize_ada_catchpoint_ops (void)
14161 struct breakpoint_ops
*ops
;
14163 initialize_breakpoint_ops ();
14165 ops
= &catch_exception_breakpoint_ops
;
14166 *ops
= bkpt_breakpoint_ops
;
14167 ops
->allocate_location
= allocate_location_exception
;
14168 ops
->re_set
= re_set_exception
;
14169 ops
->check_status
= check_status_exception
;
14170 ops
->print_it
= print_it_exception
;
14171 ops
->print_one
= print_one_exception
;
14172 ops
->print_mention
= print_mention_exception
;
14173 ops
->print_recreate
= print_recreate_exception
;
14175 ops
= &catch_exception_unhandled_breakpoint_ops
;
14176 *ops
= bkpt_breakpoint_ops
;
14177 ops
->allocate_location
= allocate_location_exception
;
14178 ops
->re_set
= re_set_exception
;
14179 ops
->check_status
= check_status_exception
;
14180 ops
->print_it
= print_it_exception
;
14181 ops
->print_one
= print_one_exception
;
14182 ops
->print_mention
= print_mention_exception
;
14183 ops
->print_recreate
= print_recreate_exception
;
14185 ops
= &catch_assert_breakpoint_ops
;
14186 *ops
= bkpt_breakpoint_ops
;
14187 ops
->allocate_location
= allocate_location_exception
;
14188 ops
->re_set
= re_set_exception
;
14189 ops
->check_status
= check_status_exception
;
14190 ops
->print_it
= print_it_exception
;
14191 ops
->print_one
= print_one_exception
;
14192 ops
->print_mention
= print_mention_exception
;
14193 ops
->print_recreate
= print_recreate_exception
;
14195 ops
= &catch_handlers_breakpoint_ops
;
14196 *ops
= bkpt_breakpoint_ops
;
14197 ops
->allocate_location
= allocate_location_exception
;
14198 ops
->re_set
= re_set_exception
;
14199 ops
->check_status
= check_status_exception
;
14200 ops
->print_it
= print_it_exception
;
14201 ops
->print_one
= print_one_exception
;
14202 ops
->print_mention
= print_mention_exception
;
14203 ops
->print_recreate
= print_recreate_exception
;
14206 /* This module's 'new_objfile' observer. */
14209 ada_new_objfile_observer (struct objfile
*objfile
)
14211 ada_clear_symbol_cache ();
14214 /* This module's 'free_objfile' observer. */
14217 ada_free_objfile_observer (struct objfile
*objfile
)
14219 ada_clear_symbol_cache ();
14222 void _initialize_ada_language ();
14224 _initialize_ada_language ()
14226 initialize_ada_catchpoint_ops ();
14228 add_prefix_cmd ("ada", no_class
, set_ada_command
,
14229 _("Prefix command for changing Ada-specific settings."),
14230 &set_ada_list
, "set ada ", 0, &setlist
);
14232 add_prefix_cmd ("ada", no_class
, show_ada_command
,
14233 _("Generic command for showing Ada-specific settings."),
14234 &show_ada_list
, "show ada ", 0, &showlist
);
14236 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14237 &trust_pad_over_xvs
, _("\
14238 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14239 Show whether an optimization trusting PAD types over XVS types is activated."),
14241 This is related to the encoding used by the GNAT compiler. The debugger\n\
14242 should normally trust the contents of PAD types, but certain older versions\n\
14243 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14244 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14245 work around this bug. It is always safe to turn this option \"off\", but\n\
14246 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14247 this option to \"off\" unless necessary."),
14248 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14250 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14251 &print_signatures
, _("\
14252 Enable or disable the output of formal and return types for functions in the \
14253 overloads selection menu."), _("\
14254 Show whether the output of formal and return types for functions in the \
14255 overloads selection menu is activated."),
14256 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14258 add_catch_command ("exception", _("\
14259 Catch Ada exceptions, when raised.\n\
14260 Usage: catch exception [ARG] [if CONDITION]\n\
14261 Without any argument, stop when any Ada exception is raised.\n\
14262 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14263 being raised does not have a handler (and will therefore lead to the task's\n\
14265 Otherwise, the catchpoint only stops when the name of the exception being\n\
14266 raised is the same as ARG.\n\
14267 CONDITION is a boolean expression that is evaluated to see whether the\n\
14268 exception should cause a stop."),
14269 catch_ada_exception_command
,
14270 catch_ada_completer
,
14274 add_catch_command ("handlers", _("\
14275 Catch Ada exceptions, when handled.\n\
14276 Usage: catch handlers [ARG] [if CONDITION]\n\
14277 Without any argument, stop when any Ada exception is handled.\n\
14278 With an argument, catch only exceptions with the given name.\n\
14279 CONDITION is a boolean expression that is evaluated to see whether the\n\
14280 exception should cause a stop."),
14281 catch_ada_handlers_command
,
14282 catch_ada_completer
,
14285 add_catch_command ("assert", _("\
14286 Catch failed Ada assertions, when raised.\n\
14287 Usage: catch assert [if CONDITION]\n\
14288 CONDITION is a boolean expression that is evaluated to see whether the\n\
14289 exception should cause a stop."),
14290 catch_assert_command
,
14295 varsize_limit
= 65536;
14296 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14297 &varsize_limit
, _("\
14298 Set the maximum number of bytes allowed in a variable-size object."), _("\
14299 Show the maximum number of bytes allowed in a variable-size object."), _("\
14300 Attempts to access an object whose size is not a compile-time constant\n\
14301 and exceeds this limit will cause an error."),
14302 NULL
, NULL
, &setlist
, &showlist
);
14304 add_info ("exceptions", info_exceptions_command
,
14306 List all Ada exception names.\n\
14307 Usage: info exceptions [REGEXP]\n\
14308 If a regular expression is passed as an argument, only those matching\n\
14309 the regular expression are listed."));
14311 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
14312 _("Set Ada maintenance-related variables."),
14313 &maint_set_ada_cmdlist
, "maintenance set ada ",
14314 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14316 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
14317 _("Show Ada maintenance-related variables."),
14318 &maint_show_ada_cmdlist
, "maintenance show ada ",
14319 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14321 add_setshow_boolean_cmd
14322 ("ignore-descriptive-types", class_maintenance
,
14323 &ada_ignore_descriptive_types_p
,
14324 _("Set whether descriptive types generated by GNAT should be ignored."),
14325 _("Show whether descriptive types generated by GNAT should be ignored."),
14327 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14328 DWARF attribute."),
14329 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14331 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14332 NULL
, xcalloc
, xfree
);
14334 /* The ada-lang observers. */
14335 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14336 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14337 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);