1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2020 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
23 #include "gdb_regex.h"
28 #include "expression.h"
29 #include "parser-defs.h"
35 #include "breakpoint.h"
38 #include "gdb_obstack.h"
40 #include "completer.h"
47 #include "observable.h"
49 #include "typeprint.h"
50 #include "namespace.h"
51 #include "cli/cli-style.h"
54 #include "mi/mi-common.h"
55 #include "arch-utils.h"
56 #include "cli/cli-utils.h"
57 #include "gdbsupport/function-view.h"
58 #include "gdbsupport/byte-vector.h"
61 /* Define whether or not the C operator '/' truncates towards zero for
62 differently signed operands (truncation direction is undefined in C).
63 Copied from valarith.c. */
65 #ifndef TRUNCATION_TOWARDS_ZERO
66 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
69 static struct type
*desc_base_type (struct type
*);
71 static struct type
*desc_bounds_type (struct type
*);
73 static struct value
*desc_bounds (struct value
*);
75 static int fat_pntr_bounds_bitpos (struct type
*);
77 static int fat_pntr_bounds_bitsize (struct type
*);
79 static struct type
*desc_data_target_type (struct type
*);
81 static struct value
*desc_data (struct value
*);
83 static int fat_pntr_data_bitpos (struct type
*);
85 static int fat_pntr_data_bitsize (struct type
*);
87 static struct value
*desc_one_bound (struct value
*, int, int);
89 static int desc_bound_bitpos (struct type
*, int, int);
91 static int desc_bound_bitsize (struct type
*, int, int);
93 static struct type
*desc_index_type (struct type
*, int);
95 static int desc_arity (struct type
*);
97 static int ada_type_match (struct type
*, struct type
*, int);
99 static int ada_args_match (struct symbol
*, struct value
**, int);
101 static struct value
*make_array_descriptor (struct type
*, struct value
*);
103 static void ada_add_block_symbols (struct obstack
*,
104 const struct block
*,
105 const lookup_name_info
&lookup_name
,
106 domain_enum
, struct objfile
*);
108 static void ada_add_all_symbols (struct obstack
*, const struct block
*,
109 const lookup_name_info
&lookup_name
,
110 domain_enum
, int, int *);
112 static int is_nonfunction (struct block_symbol
*, int);
114 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
115 const struct block
*);
117 static int num_defns_collected (struct obstack
*);
119 static struct block_symbol
*defns_collected (struct obstack
*, int);
121 static struct value
*resolve_subexp (expression_up
*, int *, int,
123 innermost_block_tracker
*);
125 static void replace_operator_with_call (expression_up
*, int, int, int,
126 struct symbol
*, const struct block
*);
128 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
130 static const char *ada_op_name (enum exp_opcode
);
132 static const char *ada_decoded_op_name (enum exp_opcode
);
134 static int numeric_type_p (struct type
*);
136 static int integer_type_p (struct type
*);
138 static int scalar_type_p (struct type
*);
140 static int discrete_type_p (struct type
*);
142 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
145 static struct value
*evaluate_subexp_type (struct expression
*, int *);
147 static struct type
*ada_find_parallel_type_with_name (struct type
*,
150 static int is_dynamic_field (struct type
*, int);
152 static struct type
*to_fixed_variant_branch_type (struct type
*,
154 CORE_ADDR
, struct value
*);
156 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
158 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
160 static struct type
*to_static_fixed_type (struct type
*);
161 static struct type
*static_unwrap_type (struct type
*type
);
163 static struct value
*unwrap_value (struct value
*);
165 static struct type
*constrained_packed_array_type (struct type
*, long *);
167 static struct type
*decode_constrained_packed_array_type (struct type
*);
169 static long decode_packed_array_bitsize (struct type
*);
171 static struct value
*decode_constrained_packed_array (struct value
*);
173 static int ada_is_packed_array_type (struct type
*);
175 static int ada_is_unconstrained_packed_array_type (struct type
*);
177 static struct value
*value_subscript_packed (struct value
*, int,
180 static struct value
*coerce_unspec_val_to_type (struct value
*,
183 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
185 static int equiv_types (struct type
*, struct type
*);
187 static int is_name_suffix (const char *);
189 static int advance_wild_match (const char **, const char *, int);
191 static bool wild_match (const char *name
, const char *patn
);
193 static struct value
*ada_coerce_ref (struct value
*);
195 static LONGEST
pos_atr (struct value
*);
197 static struct value
*value_pos_atr (struct type
*, struct value
*);
199 static struct value
*value_val_atr (struct type
*, struct value
*);
201 static struct symbol
*standard_lookup (const char *, const struct block
*,
204 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
207 static int find_struct_field (const char *, struct type
*, int,
208 struct type
**, int *, int *, int *, int *);
210 static int ada_resolve_function (struct block_symbol
*, int,
211 struct value
**, int, const char *,
214 static int ada_is_direct_array_type (struct type
*);
216 static void ada_language_arch_info (struct gdbarch
*,
217 struct language_arch_info
*);
219 static struct value
*ada_index_struct_field (int, struct value
*, int,
222 static struct value
*assign_aggregate (struct value
*, struct value
*,
226 static void aggregate_assign_from_choices (struct value
*, struct value
*,
228 int *, LONGEST
*, int *,
229 int, LONGEST
, LONGEST
);
231 static void aggregate_assign_positional (struct value
*, struct value
*,
233 int *, LONGEST
*, int *, int,
237 static void aggregate_assign_others (struct value
*, struct value
*,
239 int *, LONGEST
*, int, LONGEST
, LONGEST
);
242 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
245 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
248 static void ada_forward_operator_length (struct expression
*, int, int *,
251 static struct type
*ada_find_any_type (const char *name
);
253 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
254 (const lookup_name_info
&lookup_name
);
258 /* The result of a symbol lookup to be stored in our symbol cache. */
262 /* The name used to perform the lookup. */
264 /* The namespace used during the lookup. */
266 /* The symbol returned by the lookup, or NULL if no matching symbol
269 /* The block where the symbol was found, or NULL if no matching
271 const struct block
*block
;
272 /* A pointer to the next entry with the same hash. */
273 struct cache_entry
*next
;
276 /* The Ada symbol cache, used to store the result of Ada-mode symbol
277 lookups in the course of executing the user's commands.
279 The cache is implemented using a simple, fixed-sized hash.
280 The size is fixed on the grounds that there are not likely to be
281 all that many symbols looked up during any given session, regardless
282 of the size of the symbol table. If we decide to go to a resizable
283 table, let's just use the stuff from libiberty instead. */
285 #define HASH_SIZE 1009
287 struct ada_symbol_cache
289 /* An obstack used to store the entries in our cache. */
290 struct obstack cache_space
;
292 /* The root of the hash table used to implement our symbol cache. */
293 struct cache_entry
*root
[HASH_SIZE
];
296 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
298 /* Maximum-sized dynamic type. */
299 static unsigned int varsize_limit
;
301 static const char ada_completer_word_break_characters
[] =
303 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
305 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
308 /* The name of the symbol to use to get the name of the main subprogram. */
309 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
310 = "__gnat_ada_main_program_name";
312 /* Limit on the number of warnings to raise per expression evaluation. */
313 static int warning_limit
= 2;
315 /* Number of warning messages issued; reset to 0 by cleanups after
316 expression evaluation. */
317 static int warnings_issued
= 0;
319 static const char *known_runtime_file_name_patterns
[] = {
320 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
323 static const char *known_auxiliary_function_name_patterns
[] = {
324 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
327 /* Maintenance-related settings for this module. */
329 static struct cmd_list_element
*maint_set_ada_cmdlist
;
330 static struct cmd_list_element
*maint_show_ada_cmdlist
;
332 /* The "maintenance ada set/show ignore-descriptive-type" value. */
334 static bool ada_ignore_descriptive_types_p
= false;
336 /* Inferior-specific data. */
338 /* Per-inferior data for this module. */
340 struct ada_inferior_data
342 /* The ada__tags__type_specific_data type, which is used when decoding
343 tagged types. With older versions of GNAT, this type was directly
344 accessible through a component ("tsd") in the object tag. But this
345 is no longer the case, so we cache it for each inferior. */
346 struct type
*tsd_type
= nullptr;
348 /* The exception_support_info data. This data is used to determine
349 how to implement support for Ada exception catchpoints in a given
351 const struct exception_support_info
*exception_info
= nullptr;
354 /* Our key to this module's inferior data. */
355 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
357 /* Return our inferior data for the given inferior (INF).
359 This function always returns a valid pointer to an allocated
360 ada_inferior_data structure. If INF's inferior data has not
361 been previously set, this functions creates a new one with all
362 fields set to zero, sets INF's inferior to it, and then returns
363 a pointer to that newly allocated ada_inferior_data. */
365 static struct ada_inferior_data
*
366 get_ada_inferior_data (struct inferior
*inf
)
368 struct ada_inferior_data
*data
;
370 data
= ada_inferior_data
.get (inf
);
372 data
= ada_inferior_data
.emplace (inf
);
377 /* Perform all necessary cleanups regarding our module's inferior data
378 that is required after the inferior INF just exited. */
381 ada_inferior_exit (struct inferior
*inf
)
383 ada_inferior_data
.clear (inf
);
387 /* program-space-specific data. */
389 /* This module's per-program-space data. */
390 struct ada_pspace_data
394 if (sym_cache
!= NULL
)
395 ada_free_symbol_cache (sym_cache
);
398 /* The Ada symbol cache. */
399 struct ada_symbol_cache
*sym_cache
= nullptr;
402 /* Key to our per-program-space data. */
403 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
405 /* Return this module's data for the given program space (PSPACE).
406 If not is found, add a zero'ed one now.
408 This function always returns a valid object. */
410 static struct ada_pspace_data
*
411 get_ada_pspace_data (struct program_space
*pspace
)
413 struct ada_pspace_data
*data
;
415 data
= ada_pspace_data_handle
.get (pspace
);
417 data
= ada_pspace_data_handle
.emplace (pspace
);
424 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
425 all typedef layers have been peeled. Otherwise, return TYPE.
427 Normally, we really expect a typedef type to only have 1 typedef layer.
428 In other words, we really expect the target type of a typedef type to be
429 a non-typedef type. This is particularly true for Ada units, because
430 the language does not have a typedef vs not-typedef distinction.
431 In that respect, the Ada compiler has been trying to eliminate as many
432 typedef definitions in the debugging information, since they generally
433 do not bring any extra information (we still use typedef under certain
434 circumstances related mostly to the GNAT encoding).
436 Unfortunately, we have seen situations where the debugging information
437 generated by the compiler leads to such multiple typedef layers. For
438 instance, consider the following example with stabs:
440 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
441 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
443 This is an error in the debugging information which causes type
444 pck__float_array___XUP to be defined twice, and the second time,
445 it is defined as a typedef of a typedef.
447 This is on the fringe of legality as far as debugging information is
448 concerned, and certainly unexpected. But it is easy to handle these
449 situations correctly, so we can afford to be lenient in this case. */
452 ada_typedef_target_type (struct type
*type
)
454 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
455 type
= TYPE_TARGET_TYPE (type
);
459 /* Given DECODED_NAME a string holding a symbol name in its
460 decoded form (ie using the Ada dotted notation), returns
461 its unqualified name. */
464 ada_unqualified_name (const char *decoded_name
)
468 /* If the decoded name starts with '<', it means that the encoded
469 name does not follow standard naming conventions, and thus that
470 it is not your typical Ada symbol name. Trying to unqualify it
471 is therefore pointless and possibly erroneous. */
472 if (decoded_name
[0] == '<')
475 result
= strrchr (decoded_name
, '.');
477 result
++; /* Skip the dot... */
479 result
= decoded_name
;
484 /* Return a string starting with '<', followed by STR, and '>'. */
487 add_angle_brackets (const char *str
)
489 return string_printf ("<%s>", str
);
493 ada_get_gdb_completer_word_break_characters (void)
495 return ada_completer_word_break_characters
;
498 /* Print an array element index using the Ada syntax. */
501 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
502 const struct value_print_options
*options
)
504 LA_VALUE_PRINT (index_value
, stream
, options
);
505 fprintf_filtered (stream
, " => ");
508 /* la_watch_location_expression for Ada. */
510 static gdb::unique_xmalloc_ptr
<char>
511 ada_watch_location_expression (struct type
*type
, CORE_ADDR addr
)
513 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
514 std::string name
= type_to_string (type
);
515 return gdb::unique_xmalloc_ptr
<char>
516 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
519 /* Assuming V points to an array of S objects, make sure that it contains at
520 least M objects, updating V and S as necessary. */
522 #define GROW_VECT(v, s, m) \
523 if ((s) < (m)) (v) = (char *) grow_vect (v, &(s), m, sizeof *(v));
525 /* Assuming VECT points to an array of *SIZE objects of size
526 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
527 updating *SIZE as necessary and returning the (new) array. */
530 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
532 if (*size
< min_size
)
535 if (*size
< min_size
)
537 vect
= xrealloc (vect
, *size
* element_size
);
542 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
543 suffix of FIELD_NAME beginning "___". */
546 field_name_match (const char *field_name
, const char *target
)
548 int len
= strlen (target
);
551 (strncmp (field_name
, target
, len
) == 0
552 && (field_name
[len
] == '\0'
553 || (startswith (field_name
+ len
, "___")
554 && strcmp (field_name
+ strlen (field_name
) - 6,
559 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
560 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
561 and return its index. This function also handles fields whose name
562 have ___ suffixes because the compiler sometimes alters their name
563 by adding such a suffix to represent fields with certain constraints.
564 If the field could not be found, return a negative number if
565 MAYBE_MISSING is set. Otherwise raise an error. */
568 ada_get_field_index (const struct type
*type
, const char *field_name
,
572 struct type
*struct_type
= check_typedef ((struct type
*) type
);
574 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
575 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
579 error (_("Unable to find field %s in struct %s. Aborting"),
580 field_name
, TYPE_NAME (struct_type
));
585 /* The length of the prefix of NAME prior to any "___" suffix. */
588 ada_name_prefix_len (const char *name
)
594 const char *p
= strstr (name
, "___");
597 return strlen (name
);
603 /* Return non-zero if SUFFIX is a suffix of STR.
604 Return zero if STR is null. */
607 is_suffix (const char *str
, const char *suffix
)
614 len2
= strlen (suffix
);
615 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
618 /* The contents of value VAL, treated as a value of type TYPE. The
619 result is an lval in memory if VAL is. */
621 static struct value
*
622 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
624 type
= ada_check_typedef (type
);
625 if (value_type (val
) == type
)
629 struct value
*result
;
631 /* Make sure that the object size is not unreasonable before
632 trying to allocate some memory for it. */
633 ada_ensure_varsize_limit (type
);
636 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
637 result
= allocate_value_lazy (type
);
640 result
= allocate_value (type
);
641 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
643 set_value_component_location (result
, val
);
644 set_value_bitsize (result
, value_bitsize (val
));
645 set_value_bitpos (result
, value_bitpos (val
));
646 if (VALUE_LVAL (result
) == lval_memory
)
647 set_value_address (result
, value_address (val
));
652 static const gdb_byte
*
653 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
658 return valaddr
+ offset
;
662 cond_offset_target (CORE_ADDR address
, long offset
)
667 return address
+ offset
;
670 /* Issue a warning (as for the definition of warning in utils.c, but
671 with exactly one argument rather than ...), unless the limit on the
672 number of warnings has passed during the evaluation of the current
675 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
676 provided by "complaint". */
677 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
680 lim_warning (const char *format
, ...)
684 va_start (args
, format
);
685 warnings_issued
+= 1;
686 if (warnings_issued
<= warning_limit
)
687 vwarning (format
, args
);
692 /* Issue an error if the size of an object of type T is unreasonable,
693 i.e. if it would be a bad idea to allocate a value of this type in
697 ada_ensure_varsize_limit (const struct type
*type
)
699 if (TYPE_LENGTH (type
) > varsize_limit
)
700 error (_("object size is larger than varsize-limit"));
703 /* Maximum value of a SIZE-byte signed integer type. */
705 max_of_size (int size
)
707 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
709 return top_bit
| (top_bit
- 1);
712 /* Minimum value of a SIZE-byte signed integer type. */
714 min_of_size (int size
)
716 return -max_of_size (size
) - 1;
719 /* Maximum value of a SIZE-byte unsigned integer type. */
721 umax_of_size (int size
)
723 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
725 return top_bit
| (top_bit
- 1);
728 /* Maximum value of integral type T, as a signed quantity. */
730 max_of_type (struct type
*t
)
732 if (TYPE_UNSIGNED (t
))
733 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
735 return max_of_size (TYPE_LENGTH (t
));
738 /* Minimum value of integral type T, as a signed quantity. */
740 min_of_type (struct type
*t
)
742 if (TYPE_UNSIGNED (t
))
745 return min_of_size (TYPE_LENGTH (t
));
748 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
750 ada_discrete_type_high_bound (struct type
*type
)
752 type
= resolve_dynamic_type (type
, {}, 0);
753 switch (TYPE_CODE (type
))
755 case TYPE_CODE_RANGE
:
756 return TYPE_HIGH_BOUND (type
);
758 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
763 return max_of_type (type
);
765 error (_("Unexpected type in ada_discrete_type_high_bound."));
769 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
771 ada_discrete_type_low_bound (struct type
*type
)
773 type
= resolve_dynamic_type (type
, {}, 0);
774 switch (TYPE_CODE (type
))
776 case TYPE_CODE_RANGE
:
777 return TYPE_LOW_BOUND (type
);
779 return TYPE_FIELD_ENUMVAL (type
, 0);
784 return min_of_type (type
);
786 error (_("Unexpected type in ada_discrete_type_low_bound."));
790 /* The identity on non-range types. For range types, the underlying
791 non-range scalar type. */
794 get_base_type (struct type
*type
)
796 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
798 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
800 type
= TYPE_TARGET_TYPE (type
);
805 /* Return a decoded version of the given VALUE. This means returning
806 a value whose type is obtained by applying all the GNAT-specific
807 encodings, making the resulting type a static but standard description
808 of the initial type. */
811 ada_get_decoded_value (struct value
*value
)
813 struct type
*type
= ada_check_typedef (value_type (value
));
815 if (ada_is_array_descriptor_type (type
)
816 || (ada_is_constrained_packed_array_type (type
)
817 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
819 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
820 value
= ada_coerce_to_simple_array_ptr (value
);
822 value
= ada_coerce_to_simple_array (value
);
825 value
= ada_to_fixed_value (value
);
830 /* Same as ada_get_decoded_value, but with the given TYPE.
831 Because there is no associated actual value for this type,
832 the resulting type might be a best-effort approximation in
833 the case of dynamic types. */
836 ada_get_decoded_type (struct type
*type
)
838 type
= to_static_fixed_type (type
);
839 if (ada_is_constrained_packed_array_type (type
))
840 type
= ada_coerce_to_simple_array_type (type
);
846 /* Language Selection */
848 /* If the main program is in Ada, return language_ada, otherwise return LANG
849 (the main program is in Ada iif the adainit symbol is found). */
852 ada_update_initial_language (enum language lang
)
854 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
860 /* If the main procedure is written in Ada, then return its name.
861 The result is good until the next call. Return NULL if the main
862 procedure doesn't appear to be in Ada. */
867 struct bound_minimal_symbol msym
;
868 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
870 /* For Ada, the name of the main procedure is stored in a specific
871 string constant, generated by the binder. Look for that symbol,
872 extract its address, and then read that string. If we didn't find
873 that string, then most probably the main procedure is not written
875 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
877 if (msym
.minsym
!= NULL
)
879 CORE_ADDR main_program_name_addr
;
882 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
883 if (main_program_name_addr
== 0)
884 error (_("Invalid address for Ada main program name."));
886 target_read_string (main_program_name_addr
, &main_program_name
,
891 return main_program_name
.get ();
894 /* The main procedure doesn't seem to be in Ada. */
900 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
903 const struct ada_opname_map ada_opname_table
[] = {
904 {"Oadd", "\"+\"", BINOP_ADD
},
905 {"Osubtract", "\"-\"", BINOP_SUB
},
906 {"Omultiply", "\"*\"", BINOP_MUL
},
907 {"Odivide", "\"/\"", BINOP_DIV
},
908 {"Omod", "\"mod\"", BINOP_MOD
},
909 {"Orem", "\"rem\"", BINOP_REM
},
910 {"Oexpon", "\"**\"", BINOP_EXP
},
911 {"Olt", "\"<\"", BINOP_LESS
},
912 {"Ole", "\"<=\"", BINOP_LEQ
},
913 {"Ogt", "\">\"", BINOP_GTR
},
914 {"Oge", "\">=\"", BINOP_GEQ
},
915 {"Oeq", "\"=\"", BINOP_EQUAL
},
916 {"One", "\"/=\"", BINOP_NOTEQUAL
},
917 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
918 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
919 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
920 {"Oconcat", "\"&\"", BINOP_CONCAT
},
921 {"Oabs", "\"abs\"", UNOP_ABS
},
922 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
923 {"Oadd", "\"+\"", UNOP_PLUS
},
924 {"Osubtract", "\"-\"", UNOP_NEG
},
928 /* The "encoded" form of DECODED, according to GNAT conventions. The
929 result is valid until the next call to ada_encode. If
930 THROW_ERRORS, throw an error if invalid operator name is found.
931 Otherwise, return NULL in that case. */
934 ada_encode_1 (const char *decoded
, bool throw_errors
)
936 static char *encoding_buffer
= NULL
;
937 static size_t encoding_buffer_size
= 0;
944 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
945 2 * strlen (decoded
) + 10);
948 for (p
= decoded
; *p
!= '\0'; p
+= 1)
952 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
957 const struct ada_opname_map
*mapping
;
959 for (mapping
= ada_opname_table
;
960 mapping
->encoded
!= NULL
961 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
963 if (mapping
->encoded
== NULL
)
966 error (_("invalid Ada operator name: %s"), p
);
970 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
971 k
+= strlen (mapping
->encoded
);
976 encoding_buffer
[k
] = *p
;
981 encoding_buffer
[k
] = '\0';
982 return encoding_buffer
;
985 /* The "encoded" form of DECODED, according to GNAT conventions.
986 The result is valid until the next call to ada_encode. */
989 ada_encode (const char *decoded
)
991 return ada_encode_1 (decoded
, true);
994 /* Return NAME folded to lower case, or, if surrounded by single
995 quotes, unfolded, but with the quotes stripped away. Result good
999 ada_fold_name (gdb::string_view name
)
1001 static char *fold_buffer
= NULL
;
1002 static size_t fold_buffer_size
= 0;
1004 int len
= name
.size ();
1005 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1007 if (name
[0] == '\'')
1009 strncpy (fold_buffer
, name
.data () + 1, len
- 2);
1010 fold_buffer
[len
- 2] = '\000';
1016 for (i
= 0; i
<= len
; i
+= 1)
1017 fold_buffer
[i
] = tolower (name
[i
]);
1023 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1026 is_lower_alphanum (const char c
)
1028 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1031 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1032 This function saves in LEN the length of that same symbol name but
1033 without either of these suffixes:
1039 These are suffixes introduced by the compiler for entities such as
1040 nested subprogram for instance, in order to avoid name clashes.
1041 They do not serve any purpose for the debugger. */
1044 ada_remove_trailing_digits (const char *encoded
, int *len
)
1046 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1050 while (i
> 0 && isdigit (encoded
[i
]))
1052 if (i
>= 0 && encoded
[i
] == '.')
1054 else if (i
>= 0 && encoded
[i
] == '$')
1056 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1058 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1063 /* Remove the suffix introduced by the compiler for protected object
1067 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1069 /* Remove trailing N. */
1071 /* Protected entry subprograms are broken into two
1072 separate subprograms: The first one is unprotected, and has
1073 a 'N' suffix; the second is the protected version, and has
1074 the 'P' suffix. The second calls the first one after handling
1075 the protection. Since the P subprograms are internally generated,
1076 we leave these names undecoded, giving the user a clue that this
1077 entity is internal. */
1080 && encoded
[*len
- 1] == 'N'
1081 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1085 /* If ENCODED follows the GNAT entity encoding conventions, then return
1086 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1087 replaced by ENCODED. */
1090 ada_decode (const char *encoded
)
1096 std::string decoded
;
1098 /* With function descriptors on PPC64, the value of a symbol named
1099 ".FN", if it exists, is the entry point of the function "FN". */
1100 if (encoded
[0] == '.')
1103 /* The name of the Ada main procedure starts with "_ada_".
1104 This prefix is not part of the decoded name, so skip this part
1105 if we see this prefix. */
1106 if (startswith (encoded
, "_ada_"))
1109 /* If the name starts with '_', then it is not a properly encoded
1110 name, so do not attempt to decode it. Similarly, if the name
1111 starts with '<', the name should not be decoded. */
1112 if (encoded
[0] == '_' || encoded
[0] == '<')
1115 len0
= strlen (encoded
);
1117 ada_remove_trailing_digits (encoded
, &len0
);
1118 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1120 /* Remove the ___X.* suffix if present. Do not forget to verify that
1121 the suffix is located before the current "end" of ENCODED. We want
1122 to avoid re-matching parts of ENCODED that have previously been
1123 marked as discarded (by decrementing LEN0). */
1124 p
= strstr (encoded
, "___");
1125 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1133 /* Remove any trailing TKB suffix. It tells us that this symbol
1134 is for the body of a task, but that information does not actually
1135 appear in the decoded name. */
1137 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1140 /* Remove any trailing TB suffix. The TB suffix is slightly different
1141 from the TKB suffix because it is used for non-anonymous task
1144 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1147 /* Remove trailing "B" suffixes. */
1148 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1150 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1153 /* Make decoded big enough for possible expansion by operator name. */
1155 decoded
.resize (2 * len0
+ 1, 'X');
1157 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1159 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1162 while ((i
>= 0 && isdigit (encoded
[i
]))
1163 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1165 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1167 else if (encoded
[i
] == '$')
1171 /* The first few characters that are not alphabetic are not part
1172 of any encoding we use, so we can copy them over verbatim. */
1174 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1175 decoded
[j
] = encoded
[i
];
1180 /* Is this a symbol function? */
1181 if (at_start_name
&& encoded
[i
] == 'O')
1185 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1187 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1188 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1190 && !isalnum (encoded
[i
+ op_len
]))
1192 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1195 j
+= strlen (ada_opname_table
[k
].decoded
);
1199 if (ada_opname_table
[k
].encoded
!= NULL
)
1204 /* Replace "TK__" with "__", which will eventually be translated
1205 into "." (just below). */
1207 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1210 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1211 be translated into "." (just below). These are internal names
1212 generated for anonymous blocks inside which our symbol is nested. */
1214 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1215 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1216 && isdigit (encoded
[i
+4]))
1220 while (k
< len0
&& isdigit (encoded
[k
]))
1221 k
++; /* Skip any extra digit. */
1223 /* Double-check that the "__B_{DIGITS}+" sequence we found
1224 is indeed followed by "__". */
1225 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1229 /* Remove _E{DIGITS}+[sb] */
1231 /* Just as for protected object subprograms, there are 2 categories
1232 of subprograms created by the compiler for each entry. The first
1233 one implements the actual entry code, and has a suffix following
1234 the convention above; the second one implements the barrier and
1235 uses the same convention as above, except that the 'E' is replaced
1238 Just as above, we do not decode the name of barrier functions
1239 to give the user a clue that the code he is debugging has been
1240 internally generated. */
1242 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1243 && isdigit (encoded
[i
+2]))
1247 while (k
< len0
&& isdigit (encoded
[k
]))
1251 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1254 /* Just as an extra precaution, make sure that if this
1255 suffix is followed by anything else, it is a '_'.
1256 Otherwise, we matched this sequence by accident. */
1258 || (k
< len0
&& encoded
[k
] == '_'))
1263 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1264 the GNAT front-end in protected object subprograms. */
1267 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1269 /* Backtrack a bit up until we reach either the begining of
1270 the encoded name, or "__". Make sure that we only find
1271 digits or lowercase characters. */
1272 const char *ptr
= encoded
+ i
- 1;
1274 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1277 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1281 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1283 /* This is a X[bn]* sequence not separated from the previous
1284 part of the name with a non-alpha-numeric character (in other
1285 words, immediately following an alpha-numeric character), then
1286 verify that it is placed at the end of the encoded name. If
1287 not, then the encoding is not valid and we should abort the
1288 decoding. Otherwise, just skip it, it is used in body-nested
1292 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1296 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1298 /* Replace '__' by '.'. */
1306 /* It's a character part of the decoded name, so just copy it
1308 decoded
[j
] = encoded
[i
];
1315 /* Decoded names should never contain any uppercase character.
1316 Double-check this, and abort the decoding if we find one. */
1318 for (i
= 0; i
< decoded
.length(); ++i
)
1319 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1325 if (encoded
[0] == '<')
1328 decoded
= '<' + std::string(encoded
) + '>';
1333 /* Table for keeping permanent unique copies of decoded names. Once
1334 allocated, names in this table are never released. While this is a
1335 storage leak, it should not be significant unless there are massive
1336 changes in the set of decoded names in successive versions of a
1337 symbol table loaded during a single session. */
1338 static struct htab
*decoded_names_store
;
1340 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1341 in the language-specific part of GSYMBOL, if it has not been
1342 previously computed. Tries to save the decoded name in the same
1343 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1344 in any case, the decoded symbol has a lifetime at least that of
1346 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1347 const, but nevertheless modified to a semantically equivalent form
1348 when a decoded name is cached in it. */
1351 ada_decode_symbol (const struct general_symbol_info
*arg
)
1353 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1354 const char **resultp
=
1355 &gsymbol
->language_specific
.demangled_name
;
1357 if (!gsymbol
->ada_mangled
)
1359 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1360 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1362 gsymbol
->ada_mangled
= 1;
1364 if (obstack
!= NULL
)
1365 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1368 /* Sometimes, we can't find a corresponding objfile, in
1369 which case, we put the result on the heap. Since we only
1370 decode when needed, we hope this usually does not cause a
1371 significant memory leak (FIXME). */
1373 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1374 decoded
.c_str (), INSERT
);
1377 *slot
= xstrdup (decoded
.c_str ());
1386 ada_la_decode (const char *encoded
, int options
)
1388 return xstrdup (ada_decode (encoded
).c_str ());
1391 /* Implement la_sniff_from_mangled_name for Ada. */
1394 ada_sniff_from_mangled_name (const char *mangled
, char **out
)
1396 std::string demangled
= ada_decode (mangled
);
1400 if (demangled
!= mangled
&& demangled
[0] != '<')
1402 /* Set the gsymbol language to Ada, but still return 0.
1403 Two reasons for that:
1405 1. For Ada, we prefer computing the symbol's decoded name
1406 on the fly rather than pre-compute it, in order to save
1407 memory (Ada projects are typically very large).
1409 2. There are some areas in the definition of the GNAT
1410 encoding where, with a bit of bad luck, we might be able
1411 to decode a non-Ada symbol, generating an incorrect
1412 demangled name (Eg: names ending with "TB" for instance
1413 are identified as task bodies and so stripped from
1414 the decoded name returned).
1416 Returning 1, here, but not setting *DEMANGLED, helps us get a
1417 little bit of the best of both worlds. Because we're last,
1418 we should not affect any of the other languages that were
1419 able to demangle the symbol before us; we get to correctly
1420 tag Ada symbols as such; and even if we incorrectly tagged a
1421 non-Ada symbol, which should be rare, any routing through the
1422 Ada language should be transparent (Ada tries to behave much
1423 like C/C++ with non-Ada symbols). */
1434 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1435 generated by the GNAT compiler to describe the index type used
1436 for each dimension of an array, check whether it follows the latest
1437 known encoding. If not, fix it up to conform to the latest encoding.
1438 Otherwise, do nothing. This function also does nothing if
1439 INDEX_DESC_TYPE is NULL.
1441 The GNAT encoding used to describe the array index type evolved a bit.
1442 Initially, the information would be provided through the name of each
1443 field of the structure type only, while the type of these fields was
1444 described as unspecified and irrelevant. The debugger was then expected
1445 to perform a global type lookup using the name of that field in order
1446 to get access to the full index type description. Because these global
1447 lookups can be very expensive, the encoding was later enhanced to make
1448 the global lookup unnecessary by defining the field type as being
1449 the full index type description.
1451 The purpose of this routine is to allow us to support older versions
1452 of the compiler by detecting the use of the older encoding, and by
1453 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1454 we essentially replace each field's meaningless type by the associated
1458 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1462 if (index_desc_type
== NULL
)
1464 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1466 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1467 to check one field only, no need to check them all). If not, return
1470 If our INDEX_DESC_TYPE was generated using the older encoding,
1471 the field type should be a meaningless integer type whose name
1472 is not equal to the field name. */
1473 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1474 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1475 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1478 /* Fixup each field of INDEX_DESC_TYPE. */
1479 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1481 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1482 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1485 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1489 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1491 static const char *bound_name
[] = {
1492 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1493 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1496 /* Maximum number of array dimensions we are prepared to handle. */
1498 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1501 /* The desc_* routines return primitive portions of array descriptors
1504 /* The descriptor or array type, if any, indicated by TYPE; removes
1505 level of indirection, if needed. */
1507 static struct type
*
1508 desc_base_type (struct type
*type
)
1512 type
= ada_check_typedef (type
);
1513 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1514 type
= ada_typedef_target_type (type
);
1517 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1518 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1519 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1524 /* True iff TYPE indicates a "thin" array pointer type. */
1527 is_thin_pntr (struct type
*type
)
1530 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1531 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1534 /* The descriptor type for thin pointer type TYPE. */
1536 static struct type
*
1537 thin_descriptor_type (struct type
*type
)
1539 struct type
*base_type
= desc_base_type (type
);
1541 if (base_type
== NULL
)
1543 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1547 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1549 if (alt_type
== NULL
)
1556 /* A pointer to the array data for thin-pointer value VAL. */
1558 static struct value
*
1559 thin_data_pntr (struct value
*val
)
1561 struct type
*type
= ada_check_typedef (value_type (val
));
1562 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1564 data_type
= lookup_pointer_type (data_type
);
1566 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1567 return value_cast (data_type
, value_copy (val
));
1569 return value_from_longest (data_type
, value_address (val
));
1572 /* True iff TYPE indicates a "thick" array pointer type. */
1575 is_thick_pntr (struct type
*type
)
1577 type
= desc_base_type (type
);
1578 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1579 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1582 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1583 pointer to one, the type of its bounds data; otherwise, NULL. */
1585 static struct type
*
1586 desc_bounds_type (struct type
*type
)
1590 type
= desc_base_type (type
);
1594 else if (is_thin_pntr (type
))
1596 type
= thin_descriptor_type (type
);
1599 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1601 return ada_check_typedef (r
);
1603 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1605 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1607 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1612 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1613 one, a pointer to its bounds data. Otherwise NULL. */
1615 static struct value
*
1616 desc_bounds (struct value
*arr
)
1618 struct type
*type
= ada_check_typedef (value_type (arr
));
1620 if (is_thin_pntr (type
))
1622 struct type
*bounds_type
=
1623 desc_bounds_type (thin_descriptor_type (type
));
1626 if (bounds_type
== NULL
)
1627 error (_("Bad GNAT array descriptor"));
1629 /* NOTE: The following calculation is not really kosher, but
1630 since desc_type is an XVE-encoded type (and shouldn't be),
1631 the correct calculation is a real pain. FIXME (and fix GCC). */
1632 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1633 addr
= value_as_long (arr
);
1635 addr
= value_address (arr
);
1638 value_from_longest (lookup_pointer_type (bounds_type
),
1639 addr
- TYPE_LENGTH (bounds_type
));
1642 else if (is_thick_pntr (type
))
1644 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1645 _("Bad GNAT array descriptor"));
1646 struct type
*p_bounds_type
= value_type (p_bounds
);
1649 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1651 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1653 if (TYPE_STUB (target_type
))
1654 p_bounds
= value_cast (lookup_pointer_type
1655 (ada_check_typedef (target_type
)),
1659 error (_("Bad GNAT array descriptor"));
1667 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1668 position of the field containing the address of the bounds data. */
1671 fat_pntr_bounds_bitpos (struct type
*type
)
1673 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1676 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1677 size of the field containing the address of the bounds data. */
1680 fat_pntr_bounds_bitsize (struct type
*type
)
1682 type
= desc_base_type (type
);
1684 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1685 return TYPE_FIELD_BITSIZE (type
, 1);
1687 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1690 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1691 pointer to one, the type of its array data (a array-with-no-bounds type);
1692 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1695 static struct type
*
1696 desc_data_target_type (struct type
*type
)
1698 type
= desc_base_type (type
);
1700 /* NOTE: The following is bogus; see comment in desc_bounds. */
1701 if (is_thin_pntr (type
))
1702 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1703 else if (is_thick_pntr (type
))
1705 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1708 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1709 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1715 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1718 static struct value
*
1719 desc_data (struct value
*arr
)
1721 struct type
*type
= value_type (arr
);
1723 if (is_thin_pntr (type
))
1724 return thin_data_pntr (arr
);
1725 else if (is_thick_pntr (type
))
1726 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1727 _("Bad GNAT array descriptor"));
1733 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1734 position of the field containing the address of the data. */
1737 fat_pntr_data_bitpos (struct type
*type
)
1739 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1742 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1743 size of the field containing the address of the data. */
1746 fat_pntr_data_bitsize (struct type
*type
)
1748 type
= desc_base_type (type
);
1750 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1751 return TYPE_FIELD_BITSIZE (type
, 0);
1753 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1756 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1757 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1758 bound, if WHICH is 1. The first bound is I=1. */
1760 static struct value
*
1761 desc_one_bound (struct value
*bounds
, int i
, int which
)
1763 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1764 _("Bad GNAT array descriptor bounds"));
1767 /* If BOUNDS is an array-bounds structure type, return the bit position
1768 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1769 bound, if WHICH is 1. The first bound is I=1. */
1772 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1774 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1777 /* If BOUNDS is an array-bounds structure type, return the bit field size
1778 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1779 bound, if WHICH is 1. The first bound is I=1. */
1782 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1784 type
= desc_base_type (type
);
1786 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1787 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1789 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1792 /* If TYPE is the type of an array-bounds structure, the type of its
1793 Ith bound (numbering from 1). Otherwise, NULL. */
1795 static struct type
*
1796 desc_index_type (struct type
*type
, int i
)
1798 type
= desc_base_type (type
);
1800 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1801 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1806 /* The number of index positions in the array-bounds type TYPE.
1807 Return 0 if TYPE is NULL. */
1810 desc_arity (struct type
*type
)
1812 type
= desc_base_type (type
);
1815 return TYPE_NFIELDS (type
) / 2;
1819 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1820 an array descriptor type (representing an unconstrained array
1824 ada_is_direct_array_type (struct type
*type
)
1828 type
= ada_check_typedef (type
);
1829 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1830 || ada_is_array_descriptor_type (type
));
1833 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1837 ada_is_array_type (struct type
*type
)
1840 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1841 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1842 type
= TYPE_TARGET_TYPE (type
);
1843 return ada_is_direct_array_type (type
);
1846 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1849 ada_is_simple_array_type (struct type
*type
)
1853 type
= ada_check_typedef (type
);
1854 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1855 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1856 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1857 == TYPE_CODE_ARRAY
));
1860 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1863 ada_is_array_descriptor_type (struct type
*type
)
1865 struct type
*data_type
= desc_data_target_type (type
);
1869 type
= ada_check_typedef (type
);
1870 return (data_type
!= NULL
1871 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1872 && desc_arity (desc_bounds_type (type
)) > 0);
1875 /* Non-zero iff type is a partially mal-formed GNAT array
1876 descriptor. FIXME: This is to compensate for some problems with
1877 debugging output from GNAT. Re-examine periodically to see if it
1881 ada_is_bogus_array_descriptor (struct type
*type
)
1885 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1886 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1887 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1888 && !ada_is_array_descriptor_type (type
);
1892 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1893 (fat pointer) returns the type of the array data described---specifically,
1894 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1895 in from the descriptor; otherwise, they are left unspecified. If
1896 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1897 returns NULL. The result is simply the type of ARR if ARR is not
1900 static struct type
*
1901 ada_type_of_array (struct value
*arr
, int bounds
)
1903 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1904 return decode_constrained_packed_array_type (value_type (arr
));
1906 if (!ada_is_array_descriptor_type (value_type (arr
)))
1907 return value_type (arr
);
1911 struct type
*array_type
=
1912 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1914 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1915 TYPE_FIELD_BITSIZE (array_type
, 0) =
1916 decode_packed_array_bitsize (value_type (arr
));
1922 struct type
*elt_type
;
1924 struct value
*descriptor
;
1926 elt_type
= ada_array_element_type (value_type (arr
), -1);
1927 arity
= ada_array_arity (value_type (arr
));
1929 if (elt_type
== NULL
|| arity
== 0)
1930 return ada_check_typedef (value_type (arr
));
1932 descriptor
= desc_bounds (arr
);
1933 if (value_as_long (descriptor
) == 0)
1937 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1938 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1939 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1940 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1943 create_static_range_type (range_type
, value_type (low
),
1944 longest_to_int (value_as_long (low
)),
1945 longest_to_int (value_as_long (high
)));
1946 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1948 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1950 /* We need to store the element packed bitsize, as well as
1951 recompute the array size, because it was previously
1952 computed based on the unpacked element size. */
1953 LONGEST lo
= value_as_long (low
);
1954 LONGEST hi
= value_as_long (high
);
1956 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1957 decode_packed_array_bitsize (value_type (arr
));
1958 /* If the array has no element, then the size is already
1959 zero, and does not need to be recomputed. */
1963 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1965 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1970 return lookup_pointer_type (elt_type
);
1974 /* If ARR does not represent an array, returns ARR unchanged.
1975 Otherwise, returns either a standard GDB array with bounds set
1976 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1977 GDB array. Returns NULL if ARR is a null fat pointer. */
1980 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1982 if (ada_is_array_descriptor_type (value_type (arr
)))
1984 struct type
*arrType
= ada_type_of_array (arr
, 1);
1986 if (arrType
== NULL
)
1988 return value_cast (arrType
, value_copy (desc_data (arr
)));
1990 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1991 return decode_constrained_packed_array (arr
);
1996 /* If ARR does not represent an array, returns ARR unchanged.
1997 Otherwise, returns a standard GDB array describing ARR (which may
1998 be ARR itself if it already is in the proper form). */
2001 ada_coerce_to_simple_array (struct value
*arr
)
2003 if (ada_is_array_descriptor_type (value_type (arr
)))
2005 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2008 error (_("Bounds unavailable for null array pointer."));
2009 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
2010 return value_ind (arrVal
);
2012 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2013 return decode_constrained_packed_array (arr
);
2018 /* If TYPE represents a GNAT array type, return it translated to an
2019 ordinary GDB array type (possibly with BITSIZE fields indicating
2020 packing). For other types, is the identity. */
2023 ada_coerce_to_simple_array_type (struct type
*type
)
2025 if (ada_is_constrained_packed_array_type (type
))
2026 return decode_constrained_packed_array_type (type
);
2028 if (ada_is_array_descriptor_type (type
))
2029 return ada_check_typedef (desc_data_target_type (type
));
2034 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2037 ada_is_packed_array_type (struct type
*type
)
2041 type
= desc_base_type (type
);
2042 type
= ada_check_typedef (type
);
2044 ada_type_name (type
) != NULL
2045 && strstr (ada_type_name (type
), "___XP") != NULL
;
2048 /* Non-zero iff TYPE represents a standard GNAT constrained
2049 packed-array type. */
2052 ada_is_constrained_packed_array_type (struct type
*type
)
2054 return ada_is_packed_array_type (type
)
2055 && !ada_is_array_descriptor_type (type
);
2058 /* Non-zero iff TYPE represents an array descriptor for a
2059 unconstrained packed-array type. */
2062 ada_is_unconstrained_packed_array_type (struct type
*type
)
2064 return ada_is_packed_array_type (type
)
2065 && ada_is_array_descriptor_type (type
);
2068 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2069 return the size of its elements in bits. */
2072 decode_packed_array_bitsize (struct type
*type
)
2074 const char *raw_name
;
2078 /* Access to arrays implemented as fat pointers are encoded as a typedef
2079 of the fat pointer type. We need the name of the fat pointer type
2080 to do the decoding, so strip the typedef layer. */
2081 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2082 type
= ada_typedef_target_type (type
);
2084 raw_name
= ada_type_name (ada_check_typedef (type
));
2086 raw_name
= ada_type_name (desc_base_type (type
));
2091 tail
= strstr (raw_name
, "___XP");
2092 gdb_assert (tail
!= NULL
);
2094 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2097 (_("could not understand bit size information on packed array"));
2104 /* Given that TYPE is a standard GDB array type with all bounds filled
2105 in, and that the element size of its ultimate scalar constituents
2106 (that is, either its elements, or, if it is an array of arrays, its
2107 elements' elements, etc.) is *ELT_BITS, return an identical type,
2108 but with the bit sizes of its elements (and those of any
2109 constituent arrays) recorded in the BITSIZE components of its
2110 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2113 Note that, for arrays whose index type has an XA encoding where
2114 a bound references a record discriminant, getting that discriminant,
2115 and therefore the actual value of that bound, is not possible
2116 because none of the given parameters gives us access to the record.
2117 This function assumes that it is OK in the context where it is being
2118 used to return an array whose bounds are still dynamic and where
2119 the length is arbitrary. */
2121 static struct type
*
2122 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2124 struct type
*new_elt_type
;
2125 struct type
*new_type
;
2126 struct type
*index_type_desc
;
2127 struct type
*index_type
;
2128 LONGEST low_bound
, high_bound
;
2130 type
= ada_check_typedef (type
);
2131 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2134 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2135 if (index_type_desc
)
2136 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2139 index_type
= TYPE_INDEX_TYPE (type
);
2141 new_type
= alloc_type_copy (type
);
2143 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2145 create_array_type (new_type
, new_elt_type
, index_type
);
2146 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2147 TYPE_NAME (new_type
) = ada_type_name (type
);
2149 if ((TYPE_CODE (check_typedef (index_type
)) == TYPE_CODE_RANGE
2150 && is_dynamic_type (check_typedef (index_type
)))
2151 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2152 low_bound
= high_bound
= 0;
2153 if (high_bound
< low_bound
)
2154 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2157 *elt_bits
*= (high_bound
- low_bound
+ 1);
2158 TYPE_LENGTH (new_type
) =
2159 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2162 TYPE_FIXED_INSTANCE (new_type
) = 1;
2166 /* The array type encoded by TYPE, where
2167 ada_is_constrained_packed_array_type (TYPE). */
2169 static struct type
*
2170 decode_constrained_packed_array_type (struct type
*type
)
2172 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2175 struct type
*shadow_type
;
2179 raw_name
= ada_type_name (desc_base_type (type
));
2184 name
= (char *) alloca (strlen (raw_name
) + 1);
2185 tail
= strstr (raw_name
, "___XP");
2186 type
= desc_base_type (type
);
2188 memcpy (name
, raw_name
, tail
- raw_name
);
2189 name
[tail
- raw_name
] = '\000';
2191 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2193 if (shadow_type
== NULL
)
2195 lim_warning (_("could not find bounds information on packed array"));
2198 shadow_type
= check_typedef (shadow_type
);
2200 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2202 lim_warning (_("could not understand bounds "
2203 "information on packed array"));
2207 bits
= decode_packed_array_bitsize (type
);
2208 return constrained_packed_array_type (shadow_type
, &bits
);
2211 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2212 array, returns a simple array that denotes that array. Its type is a
2213 standard GDB array type except that the BITSIZEs of the array
2214 target types are set to the number of bits in each element, and the
2215 type length is set appropriately. */
2217 static struct value
*
2218 decode_constrained_packed_array (struct value
*arr
)
2222 /* If our value is a pointer, then dereference it. Likewise if
2223 the value is a reference. Make sure that this operation does not
2224 cause the target type to be fixed, as this would indirectly cause
2225 this array to be decoded. The rest of the routine assumes that
2226 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2227 and "value_ind" routines to perform the dereferencing, as opposed
2228 to using "ada_coerce_ref" or "ada_value_ind". */
2229 arr
= coerce_ref (arr
);
2230 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2231 arr
= value_ind (arr
);
2233 type
= decode_constrained_packed_array_type (value_type (arr
));
2236 error (_("can't unpack array"));
2240 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2241 && ada_is_modular_type (value_type (arr
)))
2243 /* This is a (right-justified) modular type representing a packed
2244 array with no wrapper. In order to interpret the value through
2245 the (left-justified) packed array type we just built, we must
2246 first left-justify it. */
2247 int bit_size
, bit_pos
;
2250 mod
= ada_modulus (value_type (arr
)) - 1;
2257 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2258 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2259 bit_pos
/ HOST_CHAR_BIT
,
2260 bit_pos
% HOST_CHAR_BIT
,
2265 return coerce_unspec_val_to_type (arr
, type
);
2269 /* The value of the element of packed array ARR at the ARITY indices
2270 given in IND. ARR must be a simple array. */
2272 static struct value
*
2273 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2276 int bits
, elt_off
, bit_off
;
2277 long elt_total_bit_offset
;
2278 struct type
*elt_type
;
2282 elt_total_bit_offset
= 0;
2283 elt_type
= ada_check_typedef (value_type (arr
));
2284 for (i
= 0; i
< arity
; i
+= 1)
2286 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2287 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2289 (_("attempt to do packed indexing of "
2290 "something other than a packed array"));
2293 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2294 LONGEST lowerbound
, upperbound
;
2297 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2299 lim_warning (_("don't know bounds of array"));
2300 lowerbound
= upperbound
= 0;
2303 idx
= pos_atr (ind
[i
]);
2304 if (idx
< lowerbound
|| idx
> upperbound
)
2305 lim_warning (_("packed array index %ld out of bounds"),
2307 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2308 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2309 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2312 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2313 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2315 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2320 /* Non-zero iff TYPE includes negative integer values. */
2323 has_negatives (struct type
*type
)
2325 switch (TYPE_CODE (type
))
2330 return !TYPE_UNSIGNED (type
);
2331 case TYPE_CODE_RANGE
:
2332 return TYPE_LOW_BOUND (type
) - TYPE_RANGE_DATA (type
)->bias
< 0;
2336 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2337 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2338 the unpacked buffer.
2340 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2341 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2343 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2346 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2348 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2351 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2352 gdb_byte
*unpacked
, int unpacked_len
,
2353 int is_big_endian
, int is_signed_type
,
2356 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2357 int src_idx
; /* Index into the source area */
2358 int src_bytes_left
; /* Number of source bytes left to process. */
2359 int srcBitsLeft
; /* Number of source bits left to move */
2360 int unusedLS
; /* Number of bits in next significant
2361 byte of source that are unused */
2363 int unpacked_idx
; /* Index into the unpacked buffer */
2364 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2366 unsigned long accum
; /* Staging area for bits being transferred */
2367 int accumSize
; /* Number of meaningful bits in accum */
2370 /* Transmit bytes from least to most significant; delta is the direction
2371 the indices move. */
2372 int delta
= is_big_endian
? -1 : 1;
2374 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2376 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2377 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2378 bit_size
, unpacked_len
);
2380 srcBitsLeft
= bit_size
;
2381 src_bytes_left
= src_len
;
2382 unpacked_bytes_left
= unpacked_len
;
2387 src_idx
= src_len
- 1;
2389 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2393 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2399 unpacked_idx
= unpacked_len
- 1;
2403 /* Non-scalar values must be aligned at a byte boundary... */
2405 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2406 /* ... And are placed at the beginning (most-significant) bytes
2408 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2409 unpacked_bytes_left
= unpacked_idx
+ 1;
2414 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2416 src_idx
= unpacked_idx
= 0;
2417 unusedLS
= bit_offset
;
2420 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2425 while (src_bytes_left
> 0)
2427 /* Mask for removing bits of the next source byte that are not
2428 part of the value. */
2429 unsigned int unusedMSMask
=
2430 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2432 /* Sign-extend bits for this byte. */
2433 unsigned int signMask
= sign
& ~unusedMSMask
;
2436 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2437 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2438 if (accumSize
>= HOST_CHAR_BIT
)
2440 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2441 accumSize
-= HOST_CHAR_BIT
;
2442 accum
>>= HOST_CHAR_BIT
;
2443 unpacked_bytes_left
-= 1;
2444 unpacked_idx
+= delta
;
2446 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2448 src_bytes_left
-= 1;
2451 while (unpacked_bytes_left
> 0)
2453 accum
|= sign
<< accumSize
;
2454 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2455 accumSize
-= HOST_CHAR_BIT
;
2458 accum
>>= HOST_CHAR_BIT
;
2459 unpacked_bytes_left
-= 1;
2460 unpacked_idx
+= delta
;
2464 /* Create a new value of type TYPE from the contents of OBJ starting
2465 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2466 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2467 assigning through the result will set the field fetched from.
2468 VALADDR is ignored unless OBJ is NULL, in which case,
2469 VALADDR+OFFSET must address the start of storage containing the
2470 packed value. The value returned in this case is never an lval.
2471 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2474 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2475 long offset
, int bit_offset
, int bit_size
,
2479 const gdb_byte
*src
; /* First byte containing data to unpack */
2481 const int is_scalar
= is_scalar_type (type
);
2482 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2483 gdb::byte_vector staging
;
2485 type
= ada_check_typedef (type
);
2488 src
= valaddr
+ offset
;
2490 src
= value_contents (obj
) + offset
;
2492 if (is_dynamic_type (type
))
2494 /* The length of TYPE might by dynamic, so we need to resolve
2495 TYPE in order to know its actual size, which we then use
2496 to create the contents buffer of the value we return.
2497 The difficulty is that the data containing our object is
2498 packed, and therefore maybe not at a byte boundary. So, what
2499 we do, is unpack the data into a byte-aligned buffer, and then
2500 use that buffer as our object's value for resolving the type. */
2501 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2502 staging
.resize (staging_len
);
2504 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2505 staging
.data (), staging
.size (),
2506 is_big_endian
, has_negatives (type
),
2508 type
= resolve_dynamic_type (type
, staging
, 0);
2509 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2511 /* This happens when the length of the object is dynamic,
2512 and is actually smaller than the space reserved for it.
2513 For instance, in an array of variant records, the bit_size
2514 we're given is the array stride, which is constant and
2515 normally equal to the maximum size of its element.
2516 But, in reality, each element only actually spans a portion
2518 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2524 v
= allocate_value (type
);
2525 src
= valaddr
+ offset
;
2527 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2529 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2532 v
= value_at (type
, value_address (obj
) + offset
);
2533 buf
= (gdb_byte
*) alloca (src_len
);
2534 read_memory (value_address (v
), buf
, src_len
);
2539 v
= allocate_value (type
);
2540 src
= value_contents (obj
) + offset
;
2545 long new_offset
= offset
;
2547 set_value_component_location (v
, obj
);
2548 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2549 set_value_bitsize (v
, bit_size
);
2550 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2553 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2555 set_value_offset (v
, new_offset
);
2557 /* Also set the parent value. This is needed when trying to
2558 assign a new value (in inferior memory). */
2559 set_value_parent (v
, obj
);
2562 set_value_bitsize (v
, bit_size
);
2563 unpacked
= value_contents_writeable (v
);
2567 memset (unpacked
, 0, TYPE_LENGTH (type
));
2571 if (staging
.size () == TYPE_LENGTH (type
))
2573 /* Small short-cut: If we've unpacked the data into a buffer
2574 of the same size as TYPE's length, then we can reuse that,
2575 instead of doing the unpacking again. */
2576 memcpy (unpacked
, staging
.data (), staging
.size ());
2579 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2580 unpacked
, TYPE_LENGTH (type
),
2581 is_big_endian
, has_negatives (type
), is_scalar
);
2586 /* Store the contents of FROMVAL into the location of TOVAL.
2587 Return a new value with the location of TOVAL and contents of
2588 FROMVAL. Handles assignment into packed fields that have
2589 floating-point or non-scalar types. */
2591 static struct value
*
2592 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2594 struct type
*type
= value_type (toval
);
2595 int bits
= value_bitsize (toval
);
2597 toval
= ada_coerce_ref (toval
);
2598 fromval
= ada_coerce_ref (fromval
);
2600 if (ada_is_direct_array_type (value_type (toval
)))
2601 toval
= ada_coerce_to_simple_array (toval
);
2602 if (ada_is_direct_array_type (value_type (fromval
)))
2603 fromval
= ada_coerce_to_simple_array (fromval
);
2605 if (!deprecated_value_modifiable (toval
))
2606 error (_("Left operand of assignment is not a modifiable lvalue."));
2608 if (VALUE_LVAL (toval
) == lval_memory
2610 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2611 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2613 int len
= (value_bitpos (toval
)
2614 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2616 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2618 CORE_ADDR to_addr
= value_address (toval
);
2620 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2621 fromval
= value_cast (type
, fromval
);
2623 read_memory (to_addr
, buffer
, len
);
2624 from_size
= value_bitsize (fromval
);
2626 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2628 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2629 ULONGEST from_offset
= 0;
2630 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2631 from_offset
= from_size
- bits
;
2632 copy_bitwise (buffer
, value_bitpos (toval
),
2633 value_contents (fromval
), from_offset
,
2634 bits
, is_big_endian
);
2635 write_memory_with_notification (to_addr
, buffer
, len
);
2637 val
= value_copy (toval
);
2638 memcpy (value_contents_raw (val
), value_contents (fromval
),
2639 TYPE_LENGTH (type
));
2640 deprecated_set_value_type (val
, type
);
2645 return value_assign (toval
, fromval
);
2649 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2650 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2651 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2652 COMPONENT, and not the inferior's memory. The current contents
2653 of COMPONENT are ignored.
2655 Although not part of the initial design, this function also works
2656 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2657 had a null address, and COMPONENT had an address which is equal to
2658 its offset inside CONTAINER. */
2661 value_assign_to_component (struct value
*container
, struct value
*component
,
2664 LONGEST offset_in_container
=
2665 (LONGEST
) (value_address (component
) - value_address (container
));
2666 int bit_offset_in_container
=
2667 value_bitpos (component
) - value_bitpos (container
);
2670 val
= value_cast (value_type (component
), val
);
2672 if (value_bitsize (component
) == 0)
2673 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2675 bits
= value_bitsize (component
);
2677 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2681 if (is_scalar_type (check_typedef (value_type (component
))))
2683 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2686 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2687 value_bitpos (container
) + bit_offset_in_container
,
2688 value_contents (val
), src_offset
, bits
, 1);
2691 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2692 value_bitpos (container
) + bit_offset_in_container
,
2693 value_contents (val
), 0, bits
, 0);
2696 /* Determine if TYPE is an access to an unconstrained array. */
2699 ada_is_access_to_unconstrained_array (struct type
*type
)
2701 return (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
2702 && is_thick_pntr (ada_typedef_target_type (type
)));
2705 /* The value of the element of array ARR at the ARITY indices given in IND.
2706 ARR may be either a simple array, GNAT array descriptor, or pointer
2710 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2714 struct type
*elt_type
;
2716 elt
= ada_coerce_to_simple_array (arr
);
2718 elt_type
= ada_check_typedef (value_type (elt
));
2719 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2720 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2721 return value_subscript_packed (elt
, arity
, ind
);
2723 for (k
= 0; k
< arity
; k
+= 1)
2725 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2727 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2728 error (_("too many subscripts (%d expected)"), k
);
2730 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2732 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2733 && TYPE_CODE (value_type (elt
)) != TYPE_CODE_TYPEDEF
)
2735 /* The element is a typedef to an unconstrained array,
2736 except that the value_subscript call stripped the
2737 typedef layer. The typedef layer is GNAT's way to
2738 specify that the element is, at the source level, an
2739 access to the unconstrained array, rather than the
2740 unconstrained array. So, we need to restore that
2741 typedef layer, which we can do by forcing the element's
2742 type back to its original type. Otherwise, the returned
2743 value is going to be printed as the array, rather
2744 than as an access. Another symptom of the same issue
2745 would be that an expression trying to dereference the
2746 element would also be improperly rejected. */
2747 deprecated_set_value_type (elt
, saved_elt_type
);
2750 elt_type
= ada_check_typedef (value_type (elt
));
2756 /* Assuming ARR is a pointer to a GDB array, the value of the element
2757 of *ARR at the ARITY indices given in IND.
2758 Does not read the entire array into memory.
2760 Note: Unlike what one would expect, this function is used instead of
2761 ada_value_subscript for basically all non-packed array types. The reason
2762 for this is that a side effect of doing our own pointer arithmetics instead
2763 of relying on value_subscript is that there is no implicit typedef peeling.
2764 This is important for arrays of array accesses, where it allows us to
2765 preserve the fact that the array's element is an array access, where the
2766 access part os encoded in a typedef layer. */
2768 static struct value
*
2769 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2772 struct value
*array_ind
= ada_value_ind (arr
);
2774 = check_typedef (value_enclosing_type (array_ind
));
2776 if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
2777 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2778 return value_subscript_packed (array_ind
, arity
, ind
);
2780 for (k
= 0; k
< arity
; k
+= 1)
2783 struct value
*lwb_value
;
2785 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2786 error (_("too many subscripts (%d expected)"), k
);
2787 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2789 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2790 lwb_value
= value_from_longest (value_type(ind
[k
]), lwb
);
2791 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - pos_atr (lwb_value
));
2792 type
= TYPE_TARGET_TYPE (type
);
2795 return value_ind (arr
);
2798 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2799 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2800 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2801 this array is LOW, as per Ada rules. */
2802 static struct value
*
2803 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2806 struct type
*type0
= ada_check_typedef (type
);
2807 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
));
2808 struct type
*index_type
2809 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2810 struct type
*slice_type
= create_array_type_with_stride
2811 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2812 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2813 TYPE_FIELD_BITSIZE (type0
, 0));
2814 int base_low
= ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
));
2815 LONGEST base_low_pos
, low_pos
;
2818 if (!discrete_position (base_index_type
, low
, &low_pos
)
2819 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2821 warning (_("unable to get positions in slice, use bounds instead"));
2823 base_low_pos
= base_low
;
2826 base
= value_as_address (array_ptr
)
2827 + ((low_pos
- base_low_pos
)
2828 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2829 return value_at_lazy (slice_type
, base
);
2833 static struct value
*
2834 ada_value_slice (struct value
*array
, int low
, int high
)
2836 struct type
*type
= ada_check_typedef (value_type (array
));
2837 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2838 struct type
*index_type
2839 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2840 struct type
*slice_type
= create_array_type_with_stride
2841 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2842 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2843 TYPE_FIELD_BITSIZE (type
, 0));
2844 LONGEST low_pos
, high_pos
;
2846 if (!discrete_position (base_index_type
, low
, &low_pos
)
2847 || !discrete_position (base_index_type
, high
, &high_pos
))
2849 warning (_("unable to get positions in slice, use bounds instead"));
2854 return value_cast (slice_type
,
2855 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2858 /* If type is a record type in the form of a standard GNAT array
2859 descriptor, returns the number of dimensions for type. If arr is a
2860 simple array, returns the number of "array of"s that prefix its
2861 type designation. Otherwise, returns 0. */
2864 ada_array_arity (struct type
*type
)
2871 type
= desc_base_type (type
);
2874 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2875 return desc_arity (desc_bounds_type (type
));
2877 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2880 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2886 /* If TYPE is a record type in the form of a standard GNAT array
2887 descriptor or a simple array type, returns the element type for
2888 TYPE after indexing by NINDICES indices, or by all indices if
2889 NINDICES is -1. Otherwise, returns NULL. */
2892 ada_array_element_type (struct type
*type
, int nindices
)
2894 type
= desc_base_type (type
);
2896 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2899 struct type
*p_array_type
;
2901 p_array_type
= desc_data_target_type (type
);
2903 k
= ada_array_arity (type
);
2907 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2908 if (nindices
>= 0 && k
> nindices
)
2910 while (k
> 0 && p_array_type
!= NULL
)
2912 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2915 return p_array_type
;
2917 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2919 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2921 type
= TYPE_TARGET_TYPE (type
);
2930 /* The type of nth index in arrays of given type (n numbering from 1).
2931 Does not examine memory. Throws an error if N is invalid or TYPE
2932 is not an array type. NAME is the name of the Ada attribute being
2933 evaluated ('range, 'first, 'last, or 'length); it is used in building
2934 the error message. */
2936 static struct type
*
2937 ada_index_type (struct type
*type
, int n
, const char *name
)
2939 struct type
*result_type
;
2941 type
= desc_base_type (type
);
2943 if (n
< 0 || n
> ada_array_arity (type
))
2944 error (_("invalid dimension number to '%s"), name
);
2946 if (ada_is_simple_array_type (type
))
2950 for (i
= 1; i
< n
; i
+= 1)
2951 type
= TYPE_TARGET_TYPE (type
);
2952 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2953 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2954 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2955 perhaps stabsread.c would make more sense. */
2956 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2961 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2962 if (result_type
== NULL
)
2963 error (_("attempt to take bound of something that is not an array"));
2969 /* Given that arr is an array type, returns the lower bound of the
2970 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2971 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2972 array-descriptor type. It works for other arrays with bounds supplied
2973 by run-time quantities other than discriminants. */
2976 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2978 struct type
*type
, *index_type_desc
, *index_type
;
2981 gdb_assert (which
== 0 || which
== 1);
2983 if (ada_is_constrained_packed_array_type (arr_type
))
2984 arr_type
= decode_constrained_packed_array_type (arr_type
);
2986 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2987 return (LONGEST
) - which
;
2989 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2990 type
= TYPE_TARGET_TYPE (arr_type
);
2994 if (TYPE_FIXED_INSTANCE (type
))
2996 /* The array has already been fixed, so we do not need to
2997 check the parallel ___XA type again. That encoding has
2998 already been applied, so ignore it now. */
2999 index_type_desc
= NULL
;
3003 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3004 ada_fixup_array_indexes_type (index_type_desc
);
3007 if (index_type_desc
!= NULL
)
3008 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
3012 struct type
*elt_type
= check_typedef (type
);
3014 for (i
= 1; i
< n
; i
++)
3015 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3017 index_type
= TYPE_INDEX_TYPE (elt_type
);
3021 (LONGEST
) (which
== 0
3022 ? ada_discrete_type_low_bound (index_type
)
3023 : ada_discrete_type_high_bound (index_type
));
3026 /* Given that arr is an array value, returns the lower bound of the
3027 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3028 WHICH is 1. This routine will also work for arrays with bounds
3029 supplied by run-time quantities other than discriminants. */
3032 ada_array_bound (struct value
*arr
, int n
, int which
)
3034 struct type
*arr_type
;
3036 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3037 arr
= value_ind (arr
);
3038 arr_type
= value_enclosing_type (arr
);
3040 if (ada_is_constrained_packed_array_type (arr_type
))
3041 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3042 else if (ada_is_simple_array_type (arr_type
))
3043 return ada_array_bound_from_type (arr_type
, n
, which
);
3045 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3048 /* Given that arr is an array value, returns the length of the
3049 nth index. This routine will also work for arrays with bounds
3050 supplied by run-time quantities other than discriminants.
3051 Does not work for arrays indexed by enumeration types with representation
3052 clauses at the moment. */
3055 ada_array_length (struct value
*arr
, int n
)
3057 struct type
*arr_type
, *index_type
;
3060 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3061 arr
= value_ind (arr
);
3062 arr_type
= value_enclosing_type (arr
);
3064 if (ada_is_constrained_packed_array_type (arr_type
))
3065 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3067 if (ada_is_simple_array_type (arr_type
))
3069 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3070 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3074 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3075 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3078 arr_type
= check_typedef (arr_type
);
3079 index_type
= ada_index_type (arr_type
, n
, "length");
3080 if (index_type
!= NULL
)
3082 struct type
*base_type
;
3083 if (TYPE_CODE (index_type
) == TYPE_CODE_RANGE
)
3084 base_type
= TYPE_TARGET_TYPE (index_type
);
3086 base_type
= index_type
;
3088 low
= pos_atr (value_from_longest (base_type
, low
));
3089 high
= pos_atr (value_from_longest (base_type
, high
));
3091 return high
- low
+ 1;
3094 /* An array whose type is that of ARR_TYPE (an array type), with
3095 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3096 less than LOW, then LOW-1 is used. */
3098 static struct value
*
3099 empty_array (struct type
*arr_type
, int low
, int high
)
3101 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3102 struct type
*index_type
3103 = create_static_range_type
3104 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
,
3105 high
< low
? low
- 1 : high
);
3106 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3108 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3112 /* Name resolution */
3114 /* The "decoded" name for the user-definable Ada operator corresponding
3118 ada_decoded_op_name (enum exp_opcode op
)
3122 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3124 if (ada_opname_table
[i
].op
== op
)
3125 return ada_opname_table
[i
].decoded
;
3127 error (_("Could not find operator name for opcode"));
3130 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3131 in a listing of choices during disambiguation (see sort_choices, below).
3132 The idea is that overloadings of a subprogram name from the
3133 same package should sort in their source order. We settle for ordering
3134 such symbols by their trailing number (__N or $N). */
3137 encoded_ordered_before (const char *N0
, const char *N1
)
3141 else if (N0
== NULL
)
3147 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3149 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3151 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3152 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3157 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3160 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3162 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3163 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3165 return (strcmp (N0
, N1
) < 0);
3169 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3173 sort_choices (struct block_symbol syms
[], int nsyms
)
3177 for (i
= 1; i
< nsyms
; i
+= 1)
3179 struct block_symbol sym
= syms
[i
];
3182 for (j
= i
- 1; j
>= 0; j
-= 1)
3184 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3185 sym
.symbol
->linkage_name ()))
3187 syms
[j
+ 1] = syms
[j
];
3193 /* Whether GDB should display formals and return types for functions in the
3194 overloads selection menu. */
3195 static bool print_signatures
= true;
3197 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3198 all but functions, the signature is just the name of the symbol. For
3199 functions, this is the name of the function, the list of types for formals
3200 and the return type (if any). */
3203 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3204 const struct type_print_options
*flags
)
3206 struct type
*type
= SYMBOL_TYPE (sym
);
3208 fprintf_filtered (stream
, "%s", sym
->print_name ());
3209 if (!print_signatures
3211 || TYPE_CODE (type
) != TYPE_CODE_FUNC
)
3214 if (TYPE_NFIELDS (type
) > 0)
3218 fprintf_filtered (stream
, " (");
3219 for (i
= 0; i
< TYPE_NFIELDS (type
); ++i
)
3222 fprintf_filtered (stream
, "; ");
3223 ada_print_type (TYPE_FIELD_TYPE (type
, i
), NULL
, stream
, -1, 0,
3226 fprintf_filtered (stream
, ")");
3228 if (TYPE_TARGET_TYPE (type
) != NULL
3229 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) != TYPE_CODE_VOID
)
3231 fprintf_filtered (stream
, " return ");
3232 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3236 /* Read and validate a set of numeric choices from the user in the
3237 range 0 .. N_CHOICES-1. Place the results in increasing
3238 order in CHOICES[0 .. N-1], and return N.
3240 The user types choices as a sequence of numbers on one line
3241 separated by blanks, encoding them as follows:
3243 + A choice of 0 means to cancel the selection, throwing an error.
3244 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3245 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3247 The user is not allowed to choose more than MAX_RESULTS values.
3249 ANNOTATION_SUFFIX, if present, is used to annotate the input
3250 prompts (for use with the -f switch). */
3253 get_selections (int *choices
, int n_choices
, int max_results
,
3254 int is_all_choice
, const char *annotation_suffix
)
3259 int first_choice
= is_all_choice
? 2 : 1;
3261 prompt
= getenv ("PS2");
3265 args
= command_line_input (prompt
, annotation_suffix
);
3268 error_no_arg (_("one or more choice numbers"));
3272 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3273 order, as given in args. Choices are validated. */
3279 args
= skip_spaces (args
);
3280 if (*args
== '\0' && n_chosen
== 0)
3281 error_no_arg (_("one or more choice numbers"));
3282 else if (*args
== '\0')
3285 choice
= strtol (args
, &args2
, 10);
3286 if (args
== args2
|| choice
< 0
3287 || choice
> n_choices
+ first_choice
- 1)
3288 error (_("Argument must be choice number"));
3292 error (_("cancelled"));
3294 if (choice
< first_choice
)
3296 n_chosen
= n_choices
;
3297 for (j
= 0; j
< n_choices
; j
+= 1)
3301 choice
-= first_choice
;
3303 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3307 if (j
< 0 || choice
!= choices
[j
])
3311 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3312 choices
[k
+ 1] = choices
[k
];
3313 choices
[j
+ 1] = choice
;
3318 if (n_chosen
> max_results
)
3319 error (_("Select no more than %d of the above"), max_results
);
3324 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3325 by asking the user (if necessary), returning the number selected,
3326 and setting the first elements of SYMS items. Error if no symbols
3329 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3330 to be re-integrated one of these days. */
3333 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3336 int *chosen
= XALLOCAVEC (int , nsyms
);
3338 int first_choice
= (max_results
== 1) ? 1 : 2;
3339 const char *select_mode
= multiple_symbols_select_mode ();
3341 if (max_results
< 1)
3342 error (_("Request to select 0 symbols!"));
3346 if (select_mode
== multiple_symbols_cancel
)
3348 canceled because the command is ambiguous\n\
3349 See set/show multiple-symbol."));
3351 /* If select_mode is "all", then return all possible symbols.
3352 Only do that if more than one symbol can be selected, of course.
3353 Otherwise, display the menu as usual. */
3354 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3357 printf_filtered (_("[0] cancel\n"));
3358 if (max_results
> 1)
3359 printf_filtered (_("[1] all\n"));
3361 sort_choices (syms
, nsyms
);
3363 for (i
= 0; i
< nsyms
; i
+= 1)
3365 if (syms
[i
].symbol
== NULL
)
3368 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3370 struct symtab_and_line sal
=
3371 find_function_start_sal (syms
[i
].symbol
, 1);
3373 printf_filtered ("[%d] ", i
+ first_choice
);
3374 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3375 &type_print_raw_options
);
3376 if (sal
.symtab
== NULL
)
3377 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3378 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3382 styled_string (file_name_style
.style (),
3383 symtab_to_filename_for_display (sal
.symtab
)),
3390 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3391 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3392 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) == TYPE_CODE_ENUM
);
3393 struct symtab
*symtab
= NULL
;
3395 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3396 symtab
= symbol_symtab (syms
[i
].symbol
);
3398 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3400 printf_filtered ("[%d] ", i
+ first_choice
);
3401 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3402 &type_print_raw_options
);
3403 printf_filtered (_(" at %s:%d\n"),
3404 symtab_to_filename_for_display (symtab
),
3405 SYMBOL_LINE (syms
[i
].symbol
));
3407 else if (is_enumeral
3408 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].symbol
)) != NULL
)
3410 printf_filtered (("[%d] "), i
+ first_choice
);
3411 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3412 gdb_stdout
, -1, 0, &type_print_raw_options
);
3413 printf_filtered (_("'(%s) (enumeral)\n"),
3414 syms
[i
].symbol
->print_name ());
3418 printf_filtered ("[%d] ", i
+ first_choice
);
3419 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3420 &type_print_raw_options
);
3423 printf_filtered (is_enumeral
3424 ? _(" in %s (enumeral)\n")
3426 symtab_to_filename_for_display (symtab
));
3428 printf_filtered (is_enumeral
3429 ? _(" (enumeral)\n")
3435 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3438 for (i
= 0; i
< n_chosen
; i
+= 1)
3439 syms
[i
] = syms
[chosen
[i
]];
3444 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3445 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3446 undefined namespace) and converts operators that are
3447 user-defined into appropriate function calls. If CONTEXT_TYPE is
3448 non-null, it provides a preferred result type [at the moment, only
3449 type void has any effect---causing procedures to be preferred over
3450 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3451 return type is preferred. May change (expand) *EXP. */
3454 resolve (expression_up
*expp
, int void_context_p
, int parse_completion
,
3455 innermost_block_tracker
*tracker
)
3457 struct type
*context_type
= NULL
;
3461 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3463 resolve_subexp (expp
, &pc
, 1, context_type
, parse_completion
, tracker
);
3466 /* Resolve the operator of the subexpression beginning at
3467 position *POS of *EXPP. "Resolving" consists of replacing
3468 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3469 with their resolutions, replacing built-in operators with
3470 function calls to user-defined operators, where appropriate, and,
3471 when DEPROCEDURE_P is non-zero, converting function-valued variables
3472 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3473 are as in ada_resolve, above. */
3475 static struct value
*
3476 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3477 struct type
*context_type
, int parse_completion
,
3478 innermost_block_tracker
*tracker
)
3482 struct expression
*exp
; /* Convenience: == *expp. */
3483 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3484 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3485 int nargs
; /* Number of operands. */
3492 /* Pass one: resolve operands, saving their types and updating *pos,
3497 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3498 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3503 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3505 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3510 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3515 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3516 parse_completion
, tracker
);
3519 case OP_ATR_MODULUS
:
3529 case TERNOP_IN_RANGE
:
3530 case BINOP_IN_BOUNDS
:
3536 case OP_DISCRETE_RANGE
:
3538 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3547 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3549 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3551 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3569 case BINOP_LOGICAL_AND
:
3570 case BINOP_LOGICAL_OR
:
3571 case BINOP_BITWISE_AND
:
3572 case BINOP_BITWISE_IOR
:
3573 case BINOP_BITWISE_XOR
:
3576 case BINOP_NOTEQUAL
:
3583 case BINOP_SUBSCRIPT
:
3591 case UNOP_LOGICAL_NOT
:
3601 case OP_VAR_MSYM_VALUE
:
3608 case OP_INTERNALVAR
:
3618 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3621 case STRUCTOP_STRUCT
:
3622 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3635 error (_("Unexpected operator during name resolution"));
3638 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3639 for (i
= 0; i
< nargs
; i
+= 1)
3640 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
,
3645 /* Pass two: perform any resolution on principal operator. */
3652 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3654 std::vector
<struct block_symbol
> candidates
;
3658 ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3659 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3662 if (n_candidates
> 1)
3664 /* Types tend to get re-introduced locally, so if there
3665 are any local symbols that are not types, first filter
3668 for (j
= 0; j
< n_candidates
; j
+= 1)
3669 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3674 case LOC_REGPARM_ADDR
:
3682 if (j
< n_candidates
)
3685 while (j
< n_candidates
)
3687 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3689 candidates
[j
] = candidates
[n_candidates
- 1];
3698 if (n_candidates
== 0)
3699 error (_("No definition found for %s"),
3700 exp
->elts
[pc
+ 2].symbol
->print_name ());
3701 else if (n_candidates
== 1)
3703 else if (deprocedure_p
3704 && !is_nonfunction (candidates
.data (), n_candidates
))
3706 i
= ada_resolve_function
3707 (candidates
.data (), n_candidates
, NULL
, 0,
3708 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3709 context_type
, parse_completion
);
3711 error (_("Could not find a match for %s"),
3712 exp
->elts
[pc
+ 2].symbol
->print_name ());
3716 printf_filtered (_("Multiple matches for %s\n"),
3717 exp
->elts
[pc
+ 2].symbol
->print_name ());
3718 user_select_syms (candidates
.data (), n_candidates
, 1);
3722 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3723 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3724 tracker
->update (candidates
[i
]);
3728 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3731 replace_operator_with_call (expp
, pc
, 0, 4,
3732 exp
->elts
[pc
+ 2].symbol
,
3733 exp
->elts
[pc
+ 1].block
);
3740 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3741 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3743 std::vector
<struct block_symbol
> candidates
;
3747 ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3748 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3751 if (n_candidates
== 1)
3755 i
= ada_resolve_function
3756 (candidates
.data (), n_candidates
,
3758 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3759 context_type
, parse_completion
);
3761 error (_("Could not find a match for %s"),
3762 exp
->elts
[pc
+ 5].symbol
->print_name ());
3765 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3766 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3767 tracker
->update (candidates
[i
]);
3778 case BINOP_BITWISE_AND
:
3779 case BINOP_BITWISE_IOR
:
3780 case BINOP_BITWISE_XOR
:
3782 case BINOP_NOTEQUAL
:
3790 case UNOP_LOGICAL_NOT
:
3792 if (possible_user_operator_p (op
, argvec
))
3794 std::vector
<struct block_symbol
> candidates
;
3798 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3802 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3803 nargs
, ada_decoded_op_name (op
), NULL
,
3808 replace_operator_with_call (expp
, pc
, nargs
, 1,
3809 candidates
[i
].symbol
,
3810 candidates
[i
].block
);
3821 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3822 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3823 exp
->elts
[pc
+ 1].objfile
,
3824 exp
->elts
[pc
+ 2].msymbol
);
3826 return evaluate_subexp_type (exp
, pos
);
3829 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3830 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3832 /* The term "match" here is rather loose. The match is heuristic and
3836 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3838 ftype
= ada_check_typedef (ftype
);
3839 atype
= ada_check_typedef (atype
);
3841 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3842 ftype
= TYPE_TARGET_TYPE (ftype
);
3843 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3844 atype
= TYPE_TARGET_TYPE (atype
);
3846 switch (TYPE_CODE (ftype
))
3849 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3851 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3852 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3853 TYPE_TARGET_TYPE (atype
), 0);
3856 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3858 case TYPE_CODE_ENUM
:
3859 case TYPE_CODE_RANGE
:
3860 switch (TYPE_CODE (atype
))
3863 case TYPE_CODE_ENUM
:
3864 case TYPE_CODE_RANGE
:
3870 case TYPE_CODE_ARRAY
:
3871 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3872 || ada_is_array_descriptor_type (atype
));
3874 case TYPE_CODE_STRUCT
:
3875 if (ada_is_array_descriptor_type (ftype
))
3876 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3877 || ada_is_array_descriptor_type (atype
));
3879 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3880 && !ada_is_array_descriptor_type (atype
));
3882 case TYPE_CODE_UNION
:
3884 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3888 /* Return non-zero if the formals of FUNC "sufficiently match" the
3889 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3890 may also be an enumeral, in which case it is treated as a 0-
3891 argument function. */
3894 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3897 struct type
*func_type
= SYMBOL_TYPE (func
);
3899 if (SYMBOL_CLASS (func
) == LOC_CONST
3900 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3901 return (n_actuals
== 0);
3902 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3905 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3908 for (i
= 0; i
< n_actuals
; i
+= 1)
3910 if (actuals
[i
] == NULL
)
3914 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3916 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3918 if (!ada_type_match (ftype
, atype
, 1))
3925 /* False iff function type FUNC_TYPE definitely does not produce a value
3926 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3927 FUNC_TYPE is not a valid function type with a non-null return type
3928 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3931 return_match (struct type
*func_type
, struct type
*context_type
)
3933 struct type
*return_type
;
3935 if (func_type
== NULL
)
3938 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3939 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3941 return_type
= get_base_type (func_type
);
3942 if (return_type
== NULL
)
3945 context_type
= get_base_type (context_type
);
3947 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3948 return context_type
== NULL
|| return_type
== context_type
;
3949 else if (context_type
== NULL
)
3950 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3952 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3956 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3957 function (if any) that matches the types of the NARGS arguments in
3958 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3959 that returns that type, then eliminate matches that don't. If
3960 CONTEXT_TYPE is void and there is at least one match that does not
3961 return void, eliminate all matches that do.
3963 Asks the user if there is more than one match remaining. Returns -1
3964 if there is no such symbol or none is selected. NAME is used
3965 solely for messages. May re-arrange and modify SYMS in
3966 the process; the index returned is for the modified vector. */
3969 ada_resolve_function (struct block_symbol syms
[],
3970 int nsyms
, struct value
**args
, int nargs
,
3971 const char *name
, struct type
*context_type
,
3972 int parse_completion
)
3976 int m
; /* Number of hits */
3979 /* In the first pass of the loop, we only accept functions matching
3980 context_type. If none are found, we add a second pass of the loop
3981 where every function is accepted. */
3982 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3984 for (k
= 0; k
< nsyms
; k
+= 1)
3986 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3988 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3989 && (fallback
|| return_match (type
, context_type
)))
3997 /* If we got multiple matches, ask the user which one to use. Don't do this
3998 interactive thing during completion, though, as the purpose of the
3999 completion is providing a list of all possible matches. Prompting the
4000 user to filter it down would be completely unexpected in this case. */
4003 else if (m
> 1 && !parse_completion
)
4005 printf_filtered (_("Multiple matches for %s\n"), name
);
4006 user_select_syms (syms
, m
, 1);
4012 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4013 on the function identified by SYM and BLOCK, and taking NARGS
4014 arguments. Update *EXPP as needed to hold more space. */
4017 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4018 int oplen
, struct symbol
*sym
,
4019 const struct block
*block
)
4021 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4022 symbol, -oplen for operator being replaced). */
4023 struct expression
*newexp
= (struct expression
*)
4024 xzalloc (sizeof (struct expression
)
4025 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
4026 struct expression
*exp
= expp
->get ();
4028 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4029 newexp
->language_defn
= exp
->language_defn
;
4030 newexp
->gdbarch
= exp
->gdbarch
;
4031 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4032 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4033 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4035 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4036 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4038 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4039 newexp
->elts
[pc
+ 4].block
= block
;
4040 newexp
->elts
[pc
+ 5].symbol
= sym
;
4042 expp
->reset (newexp
);
4045 /* Type-class predicates */
4047 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4051 numeric_type_p (struct type
*type
)
4057 switch (TYPE_CODE (type
))
4062 case TYPE_CODE_RANGE
:
4063 return (type
== TYPE_TARGET_TYPE (type
)
4064 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4071 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4074 integer_type_p (struct type
*type
)
4080 switch (TYPE_CODE (type
))
4084 case TYPE_CODE_RANGE
:
4085 return (type
== TYPE_TARGET_TYPE (type
)
4086 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4093 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4096 scalar_type_p (struct type
*type
)
4102 switch (TYPE_CODE (type
))
4105 case TYPE_CODE_RANGE
:
4106 case TYPE_CODE_ENUM
:
4115 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4118 discrete_type_p (struct type
*type
)
4124 switch (TYPE_CODE (type
))
4127 case TYPE_CODE_RANGE
:
4128 case TYPE_CODE_ENUM
:
4129 case TYPE_CODE_BOOL
:
4137 /* Returns non-zero if OP with operands in the vector ARGS could be
4138 a user-defined function. Errs on the side of pre-defined operators
4139 (i.e., result 0). */
4142 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4144 struct type
*type0
=
4145 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4146 struct type
*type1
=
4147 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4161 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4165 case BINOP_BITWISE_AND
:
4166 case BINOP_BITWISE_IOR
:
4167 case BINOP_BITWISE_XOR
:
4168 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4171 case BINOP_NOTEQUAL
:
4176 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4179 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4182 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4186 case UNOP_LOGICAL_NOT
:
4188 return (!numeric_type_p (type0
));
4197 1. In the following, we assume that a renaming type's name may
4198 have an ___XD suffix. It would be nice if this went away at some
4200 2. We handle both the (old) purely type-based representation of
4201 renamings and the (new) variable-based encoding. At some point,
4202 it is devoutly to be hoped that the former goes away
4203 (FIXME: hilfinger-2007-07-09).
4204 3. Subprogram renamings are not implemented, although the XRS
4205 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4207 /* If SYM encodes a renaming,
4209 <renaming> renames <renamed entity>,
4211 sets *LEN to the length of the renamed entity's name,
4212 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4213 the string describing the subcomponent selected from the renamed
4214 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4215 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4216 are undefined). Otherwise, returns a value indicating the category
4217 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4218 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4219 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4220 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4221 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4222 may be NULL, in which case they are not assigned.
4224 [Currently, however, GCC does not generate subprogram renamings.] */
4226 enum ada_renaming_category
4227 ada_parse_renaming (struct symbol
*sym
,
4228 const char **renamed_entity
, int *len
,
4229 const char **renaming_expr
)
4231 enum ada_renaming_category kind
;
4236 return ADA_NOT_RENAMING
;
4237 switch (SYMBOL_CLASS (sym
))
4240 return ADA_NOT_RENAMING
;
4244 case LOC_OPTIMIZED_OUT
:
4245 info
= strstr (sym
->linkage_name (), "___XR");
4247 return ADA_NOT_RENAMING
;
4251 kind
= ADA_OBJECT_RENAMING
;
4255 kind
= ADA_EXCEPTION_RENAMING
;
4259 kind
= ADA_PACKAGE_RENAMING
;
4263 kind
= ADA_SUBPROGRAM_RENAMING
;
4267 return ADA_NOT_RENAMING
;
4271 if (renamed_entity
!= NULL
)
4272 *renamed_entity
= info
;
4273 suffix
= strstr (info
, "___XE");
4274 if (suffix
== NULL
|| suffix
== info
)
4275 return ADA_NOT_RENAMING
;
4277 *len
= strlen (info
) - strlen (suffix
);
4279 if (renaming_expr
!= NULL
)
4280 *renaming_expr
= suffix
;
4284 /* Compute the value of the given RENAMING_SYM, which is expected to
4285 be a symbol encoding a renaming expression. BLOCK is the block
4286 used to evaluate the renaming. */
4288 static struct value
*
4289 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4290 const struct block
*block
)
4292 const char *sym_name
;
4294 sym_name
= renaming_sym
->linkage_name ();
4295 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4296 return evaluate_expression (expr
.get ());
4300 /* Evaluation: Function Calls */
4302 /* Return an lvalue containing the value VAL. This is the identity on
4303 lvalues, and otherwise has the side-effect of allocating memory
4304 in the inferior where a copy of the value contents is copied. */
4306 static struct value
*
4307 ensure_lval (struct value
*val
)
4309 if (VALUE_LVAL (val
) == not_lval
4310 || VALUE_LVAL (val
) == lval_internalvar
)
4312 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4313 const CORE_ADDR addr
=
4314 value_as_long (value_allocate_space_in_inferior (len
));
4316 VALUE_LVAL (val
) = lval_memory
;
4317 set_value_address (val
, addr
);
4318 write_memory (addr
, value_contents (val
), len
);
4324 /* Given ARG, a value of type (pointer or reference to a)*
4325 structure/union, extract the component named NAME from the ultimate
4326 target structure/union and return it as a value with its
4329 The routine searches for NAME among all members of the structure itself
4330 and (recursively) among all members of any wrapper members
4333 If NO_ERR, then simply return NULL in case of error, rather than
4336 static struct value
*
4337 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4339 struct type
*t
, *t1
;
4344 t1
= t
= ada_check_typedef (value_type (arg
));
4345 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
4347 t1
= TYPE_TARGET_TYPE (t
);
4350 t1
= ada_check_typedef (t1
);
4351 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
4353 arg
= coerce_ref (arg
);
4358 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
4360 t1
= TYPE_TARGET_TYPE (t
);
4363 t1
= ada_check_typedef (t1
);
4364 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
4366 arg
= value_ind (arg
);
4373 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
4377 v
= ada_search_struct_field (name
, arg
, 0, t
);
4380 int bit_offset
, bit_size
, byte_offset
;
4381 struct type
*field_type
;
4384 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
4385 address
= value_address (ada_value_ind (arg
));
4387 address
= value_address (ada_coerce_ref (arg
));
4389 /* Check to see if this is a tagged type. We also need to handle
4390 the case where the type is a reference to a tagged type, but
4391 we have to be careful to exclude pointers to tagged types.
4392 The latter should be shown as usual (as a pointer), whereas
4393 a reference should mostly be transparent to the user. */
4395 if (ada_is_tagged_type (t1
, 0)
4396 || (TYPE_CODE (t1
) == TYPE_CODE_REF
4397 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4399 /* We first try to find the searched field in the current type.
4400 If not found then let's look in the fixed type. */
4402 if (!find_struct_field (name
, t1
, 0,
4403 &field_type
, &byte_offset
, &bit_offset
,
4412 /* Convert to fixed type in all cases, so that we have proper
4413 offsets to each field in unconstrained record types. */
4414 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4415 address
, NULL
, check_tag
);
4417 if (find_struct_field (name
, t1
, 0,
4418 &field_type
, &byte_offset
, &bit_offset
,
4423 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
4424 arg
= ada_coerce_ref (arg
);
4426 arg
= ada_value_ind (arg
);
4427 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4428 bit_offset
, bit_size
,
4432 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4436 if (v
!= NULL
|| no_err
)
4439 error (_("There is no member named %s."), name
);
4445 error (_("Attempt to extract a component of "
4446 "a value that is not a record."));
4449 /* Return the value ACTUAL, converted to be an appropriate value for a
4450 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4451 allocating any necessary descriptors (fat pointers), or copies of
4452 values not residing in memory, updating it as needed. */
4455 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4457 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4458 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4459 struct type
*formal_target
=
4460 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4461 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4462 struct type
*actual_target
=
4463 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4464 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4466 if (ada_is_array_descriptor_type (formal_target
)
4467 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4468 return make_array_descriptor (formal_type
, actual
);
4469 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4470 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4472 struct value
*result
;
4474 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4475 && ada_is_array_descriptor_type (actual_target
))
4476 result
= desc_data (actual
);
4477 else if (TYPE_CODE (formal_type
) != TYPE_CODE_PTR
)
4479 if (VALUE_LVAL (actual
) != lval_memory
)
4483 actual_type
= ada_check_typedef (value_type (actual
));
4484 val
= allocate_value (actual_type
);
4485 memcpy ((char *) value_contents_raw (val
),
4486 (char *) value_contents (actual
),
4487 TYPE_LENGTH (actual_type
));
4488 actual
= ensure_lval (val
);
4490 result
= value_addr (actual
);
4494 return value_cast_pointers (formal_type
, result
, 0);
4496 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4497 return ada_value_ind (actual
);
4498 else if (ada_is_aligner_type (formal_type
))
4500 /* We need to turn this parameter into an aligner type
4502 struct value
*aligner
= allocate_value (formal_type
);
4503 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4505 value_assign_to_component (aligner
, component
, actual
);
4512 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4513 type TYPE. This is usually an inefficient no-op except on some targets
4514 (such as AVR) where the representation of a pointer and an address
4518 value_pointer (struct value
*value
, struct type
*type
)
4520 struct gdbarch
*gdbarch
= get_type_arch (type
);
4521 unsigned len
= TYPE_LENGTH (type
);
4522 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4525 addr
= value_address (value
);
4526 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4527 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4532 /* Push a descriptor of type TYPE for array value ARR on the stack at
4533 *SP, updating *SP to reflect the new descriptor. Return either
4534 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4535 to-descriptor type rather than a descriptor type), a struct value *
4536 representing a pointer to this descriptor. */
4538 static struct value
*
4539 make_array_descriptor (struct type
*type
, struct value
*arr
)
4541 struct type
*bounds_type
= desc_bounds_type (type
);
4542 struct type
*desc_type
= desc_base_type (type
);
4543 struct value
*descriptor
= allocate_value (desc_type
);
4544 struct value
*bounds
= allocate_value (bounds_type
);
4547 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4550 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4551 ada_array_bound (arr
, i
, 0),
4552 desc_bound_bitpos (bounds_type
, i
, 0),
4553 desc_bound_bitsize (bounds_type
, i
, 0));
4554 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4555 ada_array_bound (arr
, i
, 1),
4556 desc_bound_bitpos (bounds_type
, i
, 1),
4557 desc_bound_bitsize (bounds_type
, i
, 1));
4560 bounds
= ensure_lval (bounds
);
4562 modify_field (value_type (descriptor
),
4563 value_contents_writeable (descriptor
),
4564 value_pointer (ensure_lval (arr
),
4565 TYPE_FIELD_TYPE (desc_type
, 0)),
4566 fat_pntr_data_bitpos (desc_type
),
4567 fat_pntr_data_bitsize (desc_type
));
4569 modify_field (value_type (descriptor
),
4570 value_contents_writeable (descriptor
),
4571 value_pointer (bounds
,
4572 TYPE_FIELD_TYPE (desc_type
, 1)),
4573 fat_pntr_bounds_bitpos (desc_type
),
4574 fat_pntr_bounds_bitsize (desc_type
));
4576 descriptor
= ensure_lval (descriptor
);
4578 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4579 return value_addr (descriptor
);
4584 /* Symbol Cache Module */
4586 /* Performance measurements made as of 2010-01-15 indicate that
4587 this cache does bring some noticeable improvements. Depending
4588 on the type of entity being printed, the cache can make it as much
4589 as an order of magnitude faster than without it.
4591 The descriptive type DWARF extension has significantly reduced
4592 the need for this cache, at least when DWARF is being used. However,
4593 even in this case, some expensive name-based symbol searches are still
4594 sometimes necessary - to find an XVZ variable, mostly. */
4596 /* Initialize the contents of SYM_CACHE. */
4599 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4601 obstack_init (&sym_cache
->cache_space
);
4602 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4605 /* Free the memory used by SYM_CACHE. */
4608 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4610 obstack_free (&sym_cache
->cache_space
, NULL
);
4614 /* Return the symbol cache associated to the given program space PSPACE.
4615 If not allocated for this PSPACE yet, allocate and initialize one. */
4617 static struct ada_symbol_cache
*
4618 ada_get_symbol_cache (struct program_space
*pspace
)
4620 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4622 if (pspace_data
->sym_cache
== NULL
)
4624 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4625 ada_init_symbol_cache (pspace_data
->sym_cache
);
4628 return pspace_data
->sym_cache
;
4631 /* Clear all entries from the symbol cache. */
4634 ada_clear_symbol_cache (void)
4636 struct ada_symbol_cache
*sym_cache
4637 = ada_get_symbol_cache (current_program_space
);
4639 obstack_free (&sym_cache
->cache_space
, NULL
);
4640 ada_init_symbol_cache (sym_cache
);
4643 /* Search our cache for an entry matching NAME and DOMAIN.
4644 Return it if found, or NULL otherwise. */
4646 static struct cache_entry
**
4647 find_entry (const char *name
, domain_enum domain
)
4649 struct ada_symbol_cache
*sym_cache
4650 = ada_get_symbol_cache (current_program_space
);
4651 int h
= msymbol_hash (name
) % HASH_SIZE
;
4652 struct cache_entry
**e
;
4654 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4656 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4662 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4663 Return 1 if found, 0 otherwise.
4665 If an entry was found and SYM is not NULL, set *SYM to the entry's
4666 SYM. Same principle for BLOCK if not NULL. */
4669 lookup_cached_symbol (const char *name
, domain_enum domain
,
4670 struct symbol
**sym
, const struct block
**block
)
4672 struct cache_entry
**e
= find_entry (name
, domain
);
4679 *block
= (*e
)->block
;
4683 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4684 in domain DOMAIN, save this result in our symbol cache. */
4687 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4688 const struct block
*block
)
4690 struct ada_symbol_cache
*sym_cache
4691 = ada_get_symbol_cache (current_program_space
);
4693 struct cache_entry
*e
;
4695 /* Symbols for builtin types don't have a block.
4696 For now don't cache such symbols. */
4697 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4700 /* If the symbol is a local symbol, then do not cache it, as a search
4701 for that symbol depends on the context. To determine whether
4702 the symbol is local or not, we check the block where we found it
4703 against the global and static blocks of its associated symtab. */
4705 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4706 GLOBAL_BLOCK
) != block
4707 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4708 STATIC_BLOCK
) != block
)
4711 h
= msymbol_hash (name
) % HASH_SIZE
;
4712 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4713 e
->next
= sym_cache
->root
[h
];
4714 sym_cache
->root
[h
] = e
;
4715 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4723 /* Return the symbol name match type that should be used used when
4724 searching for all symbols matching LOOKUP_NAME.
4726 LOOKUP_NAME is expected to be a symbol name after transformation
4729 static symbol_name_match_type
4730 name_match_type_from_name (const char *lookup_name
)
4732 return (strstr (lookup_name
, "__") == NULL
4733 ? symbol_name_match_type::WILD
4734 : symbol_name_match_type::FULL
);
4737 /* Return the result of a standard (literal, C-like) lookup of NAME in
4738 given DOMAIN, visible from lexical block BLOCK. */
4740 static struct symbol
*
4741 standard_lookup (const char *name
, const struct block
*block
,
4744 /* Initialize it just to avoid a GCC false warning. */
4745 struct block_symbol sym
= {};
4747 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4749 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4750 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4755 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4756 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4757 since they contend in overloading in the same way. */
4759 is_nonfunction (struct block_symbol syms
[], int n
)
4763 for (i
= 0; i
< n
; i
+= 1)
4764 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_FUNC
4765 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
4766 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4772 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4773 struct types. Otherwise, they may not. */
4776 equiv_types (struct type
*type0
, struct type
*type1
)
4780 if (type0
== NULL
|| type1
== NULL
4781 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4783 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4784 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4785 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4786 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4792 /* True iff SYM0 represents the same entity as SYM1, or one that is
4793 no more defined than that of SYM1. */
4796 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4800 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4801 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4804 switch (SYMBOL_CLASS (sym0
))
4810 struct type
*type0
= SYMBOL_TYPE (sym0
);
4811 struct type
*type1
= SYMBOL_TYPE (sym1
);
4812 const char *name0
= sym0
->linkage_name ();
4813 const char *name1
= sym1
->linkage_name ();
4814 int len0
= strlen (name0
);
4817 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4818 && (equiv_types (type0
, type1
)
4819 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4820 && startswith (name1
+ len0
, "___XV")));
4823 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4824 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4828 const char *name0
= sym0
->linkage_name ();
4829 const char *name1
= sym1
->linkage_name ();
4830 return (strcmp (name0
, name1
) == 0
4831 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4839 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4840 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4843 add_defn_to_vec (struct obstack
*obstackp
,
4845 const struct block
*block
)
4848 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4850 /* Do not try to complete stub types, as the debugger is probably
4851 already scanning all symbols matching a certain name at the
4852 time when this function is called. Trying to replace the stub
4853 type by its associated full type will cause us to restart a scan
4854 which may lead to an infinite recursion. Instead, the client
4855 collecting the matching symbols will end up collecting several
4856 matches, with at least one of them complete. It can then filter
4857 out the stub ones if needed. */
4859 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4861 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4863 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4865 prevDefns
[i
].symbol
= sym
;
4866 prevDefns
[i
].block
= block
;
4872 struct block_symbol info
;
4876 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4880 /* Number of block_symbol structures currently collected in current vector in
4884 num_defns_collected (struct obstack
*obstackp
)
4886 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4889 /* Vector of block_symbol structures currently collected in current vector in
4890 OBSTACKP. If FINISH, close off the vector and return its final address. */
4892 static struct block_symbol
*
4893 defns_collected (struct obstack
*obstackp
, int finish
)
4896 return (struct block_symbol
*) obstack_finish (obstackp
);
4898 return (struct block_symbol
*) obstack_base (obstackp
);
4901 /* Return a bound minimal symbol matching NAME according to Ada
4902 decoding rules. Returns an invalid symbol if there is no such
4903 minimal symbol. Names prefixed with "standard__" are handled
4904 specially: "standard__" is first stripped off, and only static and
4905 global symbols are searched. */
4907 struct bound_minimal_symbol
4908 ada_lookup_simple_minsym (const char *name
)
4910 struct bound_minimal_symbol result
;
4912 memset (&result
, 0, sizeof (result
));
4914 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4915 lookup_name_info
lookup_name (name
, match_type
);
4917 symbol_name_matcher_ftype
*match_name
4918 = ada_get_symbol_name_matcher (lookup_name
);
4920 for (objfile
*objfile
: current_program_space
->objfiles ())
4922 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4924 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4925 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4927 result
.minsym
= msymbol
;
4928 result
.objfile
= objfile
;
4937 /* For all subprograms that statically enclose the subprogram of the
4938 selected frame, add symbols matching identifier NAME in DOMAIN
4939 and their blocks to the list of data in OBSTACKP, as for
4940 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4941 with a wildcard prefix. */
4944 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4945 const lookup_name_info
&lookup_name
,
4950 /* True if TYPE is definitely an artificial type supplied to a symbol
4951 for which no debugging information was given in the symbol file. */
4954 is_nondebugging_type (struct type
*type
)
4956 const char *name
= ada_type_name (type
);
4958 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4961 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4962 that are deemed "identical" for practical purposes.
4964 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4965 types and that their number of enumerals is identical (in other
4966 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4969 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4973 /* The heuristic we use here is fairly conservative. We consider
4974 that 2 enumerate types are identical if they have the same
4975 number of enumerals and that all enumerals have the same
4976 underlying value and name. */
4978 /* All enums in the type should have an identical underlying value. */
4979 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4980 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4983 /* All enumerals should also have the same name (modulo any numerical
4985 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4987 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4988 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4989 int len_1
= strlen (name_1
);
4990 int len_2
= strlen (name_2
);
4992 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4993 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4995 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4996 TYPE_FIELD_NAME (type2
, i
),
5004 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
5005 that are deemed "identical" for practical purposes. Sometimes,
5006 enumerals are not strictly identical, but their types are so similar
5007 that they can be considered identical.
5009 For instance, consider the following code:
5011 type Color is (Black, Red, Green, Blue, White);
5012 type RGB_Color is new Color range Red .. Blue;
5014 Type RGB_Color is a subrange of an implicit type which is a copy
5015 of type Color. If we call that implicit type RGB_ColorB ("B" is
5016 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5017 As a result, when an expression references any of the enumeral
5018 by name (Eg. "print green"), the expression is technically
5019 ambiguous and the user should be asked to disambiguate. But
5020 doing so would only hinder the user, since it wouldn't matter
5021 what choice he makes, the outcome would always be the same.
5022 So, for practical purposes, we consider them as the same. */
5025 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
5029 /* Before performing a thorough comparison check of each type,
5030 we perform a series of inexpensive checks. We expect that these
5031 checks will quickly fail in the vast majority of cases, and thus
5032 help prevent the unnecessary use of a more expensive comparison.
5033 Said comparison also expects us to make some of these checks
5034 (see ada_identical_enum_types_p). */
5036 /* Quick check: All symbols should have an enum type. */
5037 for (i
= 0; i
< syms
.size (); i
++)
5038 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
)
5041 /* Quick check: They should all have the same value. */
5042 for (i
= 1; i
< syms
.size (); i
++)
5043 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5046 /* Quick check: They should all have the same number of enumerals. */
5047 for (i
= 1; i
< syms
.size (); i
++)
5048 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].symbol
))
5049 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].symbol
)))
5052 /* All the sanity checks passed, so we might have a set of
5053 identical enumeration types. Perform a more complete
5054 comparison of the type of each symbol. */
5055 for (i
= 1; i
< syms
.size (); i
++)
5056 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5057 SYMBOL_TYPE (syms
[0].symbol
)))
5063 /* Remove any non-debugging symbols in SYMS that definitely
5064 duplicate other symbols in the list (The only case I know of where
5065 this happens is when object files containing stabs-in-ecoff are
5066 linked with files containing ordinary ecoff debugging symbols (or no
5067 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5068 Returns the number of items in the modified list. */
5071 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5075 /* We should never be called with less than 2 symbols, as there
5076 cannot be any extra symbol in that case. But it's easy to
5077 handle, since we have nothing to do in that case. */
5078 if (syms
->size () < 2)
5079 return syms
->size ();
5082 while (i
< syms
->size ())
5086 /* If two symbols have the same name and one of them is a stub type,
5087 the get rid of the stub. */
5089 if (TYPE_STUB (SYMBOL_TYPE ((*syms
)[i
].symbol
))
5090 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5092 for (j
= 0; j
< syms
->size (); j
++)
5095 && !TYPE_STUB (SYMBOL_TYPE ((*syms
)[j
].symbol
))
5096 && (*syms
)[j
].symbol
->linkage_name () != NULL
5097 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5098 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5103 /* Two symbols with the same name, same class and same address
5104 should be identical. */
5106 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5107 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5108 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5110 for (j
= 0; j
< syms
->size (); j
+= 1)
5113 && (*syms
)[j
].symbol
->linkage_name () != NULL
5114 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5115 (*syms
)[j
].symbol
->linkage_name ()) == 0
5116 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5117 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5118 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5119 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5125 syms
->erase (syms
->begin () + i
);
5130 /* If all the remaining symbols are identical enumerals, then
5131 just keep the first one and discard the rest.
5133 Unlike what we did previously, we do not discard any entry
5134 unless they are ALL identical. This is because the symbol
5135 comparison is not a strict comparison, but rather a practical
5136 comparison. If all symbols are considered identical, then
5137 we can just go ahead and use the first one and discard the rest.
5138 But if we cannot reduce the list to a single element, we have
5139 to ask the user to disambiguate anyways. And if we have to
5140 present a multiple-choice menu, it's less confusing if the list
5141 isn't missing some choices that were identical and yet distinct. */
5142 if (symbols_are_identical_enums (*syms
))
5145 return syms
->size ();
5148 /* Given a type that corresponds to a renaming entity, use the type name
5149 to extract the scope (package name or function name, fully qualified,
5150 and following the GNAT encoding convention) where this renaming has been
5154 xget_renaming_scope (struct type
*renaming_type
)
5156 /* The renaming types adhere to the following convention:
5157 <scope>__<rename>___<XR extension>.
5158 So, to extract the scope, we search for the "___XR" extension,
5159 and then backtrack until we find the first "__". */
5161 const char *name
= TYPE_NAME (renaming_type
);
5162 const char *suffix
= strstr (name
, "___XR");
5165 /* Now, backtrack a bit until we find the first "__". Start looking
5166 at suffix - 3, as the <rename> part is at least one character long. */
5168 for (last
= suffix
- 3; last
> name
; last
--)
5169 if (last
[0] == '_' && last
[1] == '_')
5172 /* Make a copy of scope and return it. */
5173 return std::string (name
, last
);
5176 /* Return nonzero if NAME corresponds to a package name. */
5179 is_package_name (const char *name
)
5181 /* Here, We take advantage of the fact that no symbols are generated
5182 for packages, while symbols are generated for each function.
5183 So the condition for NAME represent a package becomes equivalent
5184 to NAME not existing in our list of symbols. There is only one
5185 small complication with library-level functions (see below). */
5187 /* If it is a function that has not been defined at library level,
5188 then we should be able to look it up in the symbols. */
5189 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5192 /* Library-level function names start with "_ada_". See if function
5193 "_ada_" followed by NAME can be found. */
5195 /* Do a quick check that NAME does not contain "__", since library-level
5196 functions names cannot contain "__" in them. */
5197 if (strstr (name
, "__") != NULL
)
5200 std::string fun_name
= string_printf ("_ada_%s", name
);
5202 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5205 /* Return nonzero if SYM corresponds to a renaming entity that is
5206 not visible from FUNCTION_NAME. */
5209 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5211 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5214 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5216 /* If the rename has been defined in a package, then it is visible. */
5217 if (is_package_name (scope
.c_str ()))
5220 /* Check that the rename is in the current function scope by checking
5221 that its name starts with SCOPE. */
5223 /* If the function name starts with "_ada_", it means that it is
5224 a library-level function. Strip this prefix before doing the
5225 comparison, as the encoding for the renaming does not contain
5227 if (startswith (function_name
, "_ada_"))
5230 return !startswith (function_name
, scope
.c_str ());
5233 /* Remove entries from SYMS that corresponds to a renaming entity that
5234 is not visible from the function associated with CURRENT_BLOCK or
5235 that is superfluous due to the presence of more specific renaming
5236 information. Places surviving symbols in the initial entries of
5237 SYMS and returns the number of surviving symbols.
5240 First, in cases where an object renaming is implemented as a
5241 reference variable, GNAT may produce both the actual reference
5242 variable and the renaming encoding. In this case, we discard the
5245 Second, GNAT emits a type following a specified encoding for each renaming
5246 entity. Unfortunately, STABS currently does not support the definition
5247 of types that are local to a given lexical block, so all renamings types
5248 are emitted at library level. As a consequence, if an application
5249 contains two renaming entities using the same name, and a user tries to
5250 print the value of one of these entities, the result of the ada symbol
5251 lookup will also contain the wrong renaming type.
5253 This function partially covers for this limitation by attempting to
5254 remove from the SYMS list renaming symbols that should be visible
5255 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5256 method with the current information available. The implementation
5257 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5259 - When the user tries to print a rename in a function while there
5260 is another rename entity defined in a package: Normally, the
5261 rename in the function has precedence over the rename in the
5262 package, so the latter should be removed from the list. This is
5263 currently not the case.
5265 - This function will incorrectly remove valid renames if
5266 the CURRENT_BLOCK corresponds to a function which symbol name
5267 has been changed by an "Export" pragma. As a consequence,
5268 the user will be unable to print such rename entities. */
5271 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5272 const struct block
*current_block
)
5274 struct symbol
*current_function
;
5275 const char *current_function_name
;
5277 int is_new_style_renaming
;
5279 /* If there is both a renaming foo___XR... encoded as a variable and
5280 a simple variable foo in the same block, discard the latter.
5281 First, zero out such symbols, then compress. */
5282 is_new_style_renaming
= 0;
5283 for (i
= 0; i
< syms
->size (); i
+= 1)
5285 struct symbol
*sym
= (*syms
)[i
].symbol
;
5286 const struct block
*block
= (*syms
)[i
].block
;
5290 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5292 name
= sym
->linkage_name ();
5293 suffix
= strstr (name
, "___XR");
5297 int name_len
= suffix
- name
;
5300 is_new_style_renaming
= 1;
5301 for (j
= 0; j
< syms
->size (); j
+= 1)
5302 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5303 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5305 && block
== (*syms
)[j
].block
)
5306 (*syms
)[j
].symbol
= NULL
;
5309 if (is_new_style_renaming
)
5313 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5314 if ((*syms
)[j
].symbol
!= NULL
)
5316 (*syms
)[k
] = (*syms
)[j
];
5322 /* Extract the function name associated to CURRENT_BLOCK.
5323 Abort if unable to do so. */
5325 if (current_block
== NULL
)
5326 return syms
->size ();
5328 current_function
= block_linkage_function (current_block
);
5329 if (current_function
== NULL
)
5330 return syms
->size ();
5332 current_function_name
= current_function
->linkage_name ();
5333 if (current_function_name
== NULL
)
5334 return syms
->size ();
5336 /* Check each of the symbols, and remove it from the list if it is
5337 a type corresponding to a renaming that is out of the scope of
5338 the current block. */
5341 while (i
< syms
->size ())
5343 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5344 == ADA_OBJECT_RENAMING
5345 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5346 current_function_name
))
5347 syms
->erase (syms
->begin () + i
);
5352 return syms
->size ();
5355 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5356 whose name and domain match NAME and DOMAIN respectively.
5357 If no match was found, then extend the search to "enclosing"
5358 routines (in other words, if we're inside a nested function,
5359 search the symbols defined inside the enclosing functions).
5360 If WILD_MATCH_P is nonzero, perform the naming matching in
5361 "wild" mode (see function "wild_match" for more info).
5363 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5366 ada_add_local_symbols (struct obstack
*obstackp
,
5367 const lookup_name_info
&lookup_name
,
5368 const struct block
*block
, domain_enum domain
)
5370 int block_depth
= 0;
5372 while (block
!= NULL
)
5375 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5377 /* If we found a non-function match, assume that's the one. */
5378 if (is_nonfunction (defns_collected (obstackp
, 0),
5379 num_defns_collected (obstackp
)))
5382 block
= BLOCK_SUPERBLOCK (block
);
5385 /* If no luck so far, try to find NAME as a local symbol in some lexically
5386 enclosing subprogram. */
5387 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5388 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5391 /* An object of this type is used as the user_data argument when
5392 calling the map_matching_symbols method. */
5396 struct objfile
*objfile
;
5397 struct obstack
*obstackp
;
5398 struct symbol
*arg_sym
;
5402 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5403 to a list of symbols. DATA is a pointer to a struct match_data *
5404 containing the obstack that collects the symbol list, the file that SYM
5405 must come from, a flag indicating whether a non-argument symbol has
5406 been found in the current block, and the last argument symbol
5407 passed in SYM within the current block (if any). When SYM is null,
5408 marking the end of a block, the argument symbol is added if no
5409 other has been found. */
5412 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5413 struct match_data
*data
)
5415 const struct block
*block
= bsym
->block
;
5416 struct symbol
*sym
= bsym
->symbol
;
5420 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5421 add_defn_to_vec (data
->obstackp
,
5422 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5424 data
->found_sym
= 0;
5425 data
->arg_sym
= NULL
;
5429 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5431 else if (SYMBOL_IS_ARGUMENT (sym
))
5432 data
->arg_sym
= sym
;
5435 data
->found_sym
= 1;
5436 add_defn_to_vec (data
->obstackp
,
5437 fixup_symbol_section (sym
, data
->objfile
),
5444 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5445 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5446 symbols to OBSTACKP. Return whether we found such symbols. */
5449 ada_add_block_renamings (struct obstack
*obstackp
,
5450 const struct block
*block
,
5451 const lookup_name_info
&lookup_name
,
5454 struct using_direct
*renaming
;
5455 int defns_mark
= num_defns_collected (obstackp
);
5457 symbol_name_matcher_ftype
*name_match
5458 = ada_get_symbol_name_matcher (lookup_name
);
5460 for (renaming
= block_using (block
);
5462 renaming
= renaming
->next
)
5466 /* Avoid infinite recursions: skip this renaming if we are actually
5467 already traversing it.
5469 Currently, symbol lookup in Ada don't use the namespace machinery from
5470 C++/Fortran support: skip namespace imports that use them. */
5471 if (renaming
->searched
5472 || (renaming
->import_src
!= NULL
5473 && renaming
->import_src
[0] != '\0')
5474 || (renaming
->import_dest
!= NULL
5475 && renaming
->import_dest
[0] != '\0'))
5477 renaming
->searched
= 1;
5479 /* TODO: here, we perform another name-based symbol lookup, which can
5480 pull its own multiple overloads. In theory, we should be able to do
5481 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5482 not a simple name. But in order to do this, we would need to enhance
5483 the DWARF reader to associate a symbol to this renaming, instead of a
5484 name. So, for now, we do something simpler: re-use the C++/Fortran
5485 namespace machinery. */
5486 r_name
= (renaming
->alias
!= NULL
5488 : renaming
->declaration
);
5489 if (name_match (r_name
, lookup_name
, NULL
))
5491 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5492 lookup_name
.match_type ());
5493 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5496 renaming
->searched
= 0;
5498 return num_defns_collected (obstackp
) != defns_mark
;
5501 /* Implements compare_names, but only applying the comparision using
5502 the given CASING. */
5505 compare_names_with_case (const char *string1
, const char *string2
,
5506 enum case_sensitivity casing
)
5508 while (*string1
!= '\0' && *string2
!= '\0')
5512 if (isspace (*string1
) || isspace (*string2
))
5513 return strcmp_iw_ordered (string1
, string2
);
5515 if (casing
== case_sensitive_off
)
5517 c1
= tolower (*string1
);
5518 c2
= tolower (*string2
);
5535 return strcmp_iw_ordered (string1
, string2
);
5537 if (*string2
== '\0')
5539 if (is_name_suffix (string1
))
5546 if (*string2
== '(')
5547 return strcmp_iw_ordered (string1
, string2
);
5550 if (casing
== case_sensitive_off
)
5551 return tolower (*string1
) - tolower (*string2
);
5553 return *string1
- *string2
;
5558 /* Compare STRING1 to STRING2, with results as for strcmp.
5559 Compatible with strcmp_iw_ordered in that...
5561 strcmp_iw_ordered (STRING1, STRING2) <= 0
5565 compare_names (STRING1, STRING2) <= 0
5567 (they may differ as to what symbols compare equal). */
5570 compare_names (const char *string1
, const char *string2
)
5574 /* Similar to what strcmp_iw_ordered does, we need to perform
5575 a case-insensitive comparison first, and only resort to
5576 a second, case-sensitive, comparison if the first one was
5577 not sufficient to differentiate the two strings. */
5579 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5581 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5586 /* Convenience function to get at the Ada encoded lookup name for
5587 LOOKUP_NAME, as a C string. */
5590 ada_lookup_name (const lookup_name_info
&lookup_name
)
5592 return lookup_name
.ada ().lookup_name ().c_str ();
5595 /* Add to OBSTACKP all non-local symbols whose name and domain match
5596 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5597 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5598 symbols otherwise. */
5601 add_nonlocal_symbols (struct obstack
*obstackp
,
5602 const lookup_name_info
&lookup_name
,
5603 domain_enum domain
, int global
)
5605 struct match_data data
;
5607 memset (&data
, 0, sizeof data
);
5608 data
.obstackp
= obstackp
;
5610 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5612 auto callback
= [&] (struct block_symbol
*bsym
)
5614 return aux_add_nonlocal_symbols (bsym
, &data
);
5617 for (objfile
*objfile
: current_program_space
->objfiles ())
5619 data
.objfile
= objfile
;
5621 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5622 domain
, global
, callback
,
5624 ? NULL
: compare_names
));
5626 for (compunit_symtab
*cu
: objfile
->compunits ())
5628 const struct block
*global_block
5629 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5631 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5637 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5639 const char *name
= ada_lookup_name (lookup_name
);
5640 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5641 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5643 for (objfile
*objfile
: current_program_space
->objfiles ())
5645 data
.objfile
= objfile
;
5646 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5647 domain
, global
, callback
,
5653 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5654 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5655 returning the number of matches. Add these to OBSTACKP.
5657 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5658 symbol match within the nest of blocks whose innermost member is BLOCK,
5659 is the one match returned (no other matches in that or
5660 enclosing blocks is returned). If there are any matches in or
5661 surrounding BLOCK, then these alone are returned.
5663 Names prefixed with "standard__" are handled specially:
5664 "standard__" is first stripped off (by the lookup_name
5665 constructor), and only static and global symbols are searched.
5667 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5668 to lookup global symbols. */
5671 ada_add_all_symbols (struct obstack
*obstackp
,
5672 const struct block
*block
,
5673 const lookup_name_info
&lookup_name
,
5676 int *made_global_lookup_p
)
5680 if (made_global_lookup_p
)
5681 *made_global_lookup_p
= 0;
5683 /* Special case: If the user specifies a symbol name inside package
5684 Standard, do a non-wild matching of the symbol name without
5685 the "standard__" prefix. This was primarily introduced in order
5686 to allow the user to specifically access the standard exceptions
5687 using, for instance, Standard.Constraint_Error when Constraint_Error
5688 is ambiguous (due to the user defining its own Constraint_Error
5689 entity inside its program). */
5690 if (lookup_name
.ada ().standard_p ())
5693 /* Check the non-global symbols. If we have ANY match, then we're done. */
5698 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5701 /* In the !full_search case we're are being called by
5702 ada_iterate_over_symbols, and we don't want to search
5704 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5706 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5710 /* No non-global symbols found. Check our cache to see if we have
5711 already performed this search before. If we have, then return
5714 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5715 domain
, &sym
, &block
))
5718 add_defn_to_vec (obstackp
, sym
, block
);
5722 if (made_global_lookup_p
)
5723 *made_global_lookup_p
= 1;
5725 /* Search symbols from all global blocks. */
5727 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5729 /* Now add symbols from all per-file blocks if we've gotten no hits
5730 (not strictly correct, but perhaps better than an error). */
5732 if (num_defns_collected (obstackp
) == 0)
5733 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5736 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5737 is non-zero, enclosing scope and in global scopes, returning the number of
5739 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5740 found and the blocks and symbol tables (if any) in which they were
5743 When full_search is non-zero, any non-function/non-enumeral
5744 symbol match within the nest of blocks whose innermost member is BLOCK,
5745 is the one match returned (no other matches in that or
5746 enclosing blocks is returned). If there are any matches in or
5747 surrounding BLOCK, then these alone are returned.
5749 Names prefixed with "standard__" are handled specially: "standard__"
5750 is first stripped off, and only static and global symbols are searched. */
5753 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5754 const struct block
*block
,
5756 std::vector
<struct block_symbol
> *results
,
5759 int syms_from_global_search
;
5761 auto_obstack obstack
;
5763 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5764 domain
, full_search
, &syms_from_global_search
);
5766 ndefns
= num_defns_collected (&obstack
);
5768 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5769 for (int i
= 0; i
< ndefns
; ++i
)
5770 results
->push_back (base
[i
]);
5772 ndefns
= remove_extra_symbols (results
);
5774 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5775 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5777 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5778 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5779 (*results
)[0].symbol
, (*results
)[0].block
);
5781 ndefns
= remove_irrelevant_renamings (results
, block
);
5786 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5787 in global scopes, returning the number of matches, and filling *RESULTS
5788 with (SYM,BLOCK) tuples.
5790 See ada_lookup_symbol_list_worker for further details. */
5793 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5795 std::vector
<struct block_symbol
> *results
)
5797 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5798 lookup_name_info
lookup_name (name
, name_match_type
);
5800 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5803 /* Implementation of the la_iterate_over_symbols method. */
5806 ada_iterate_over_symbols
5807 (const struct block
*block
, const lookup_name_info
&name
,
5809 gdb::function_view
<symbol_found_callback_ftype
> callback
)
5812 std::vector
<struct block_symbol
> results
;
5814 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5816 for (i
= 0; i
< ndefs
; ++i
)
5818 if (!callback (&results
[i
]))
5825 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5826 to 1, but choosing the first symbol found if there are multiple
5829 The result is stored in *INFO, which must be non-NULL.
5830 If no match is found, INFO->SYM is set to NULL. */
5833 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5835 struct block_symbol
*info
)
5837 /* Since we already have an encoded name, wrap it in '<>' to force a
5838 verbatim match. Otherwise, if the name happens to not look like
5839 an encoded name (because it doesn't include a "__"),
5840 ada_lookup_name_info would re-encode/fold it again, and that
5841 would e.g., incorrectly lowercase object renaming names like
5842 "R28b" -> "r28b". */
5843 std::string verbatim
= std::string ("<") + name
+ '>';
5845 gdb_assert (info
!= NULL
);
5846 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5849 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5850 scope and in global scopes, or NULL if none. NAME is folded and
5851 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5852 choosing the first symbol if there are multiple choices. */
5855 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5858 std::vector
<struct block_symbol
> candidates
;
5861 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5863 if (n_candidates
== 0)
5866 block_symbol info
= candidates
[0];
5867 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5871 static struct block_symbol
5872 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5874 const struct block
*block
,
5875 const domain_enum domain
)
5877 struct block_symbol sym
;
5879 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
5880 if (sym
.symbol
!= NULL
)
5883 /* If we haven't found a match at this point, try the primitive
5884 types. In other languages, this search is performed before
5885 searching for global symbols in order to short-circuit that
5886 global-symbol search if it happens that the name corresponds
5887 to a primitive type. But we cannot do the same in Ada, because
5888 it is perfectly legitimate for a program to declare a type which
5889 has the same name as a standard type. If looking up a type in
5890 that situation, we have traditionally ignored the primitive type
5891 in favor of user-defined types. This is why, unlike most other
5892 languages, we search the primitive types this late and only after
5893 having searched the global symbols without success. */
5895 if (domain
== VAR_DOMAIN
)
5897 struct gdbarch
*gdbarch
;
5900 gdbarch
= target_gdbarch ();
5902 gdbarch
= block_gdbarch (block
);
5903 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5904 if (sym
.symbol
!= NULL
)
5912 /* True iff STR is a possible encoded suffix of a normal Ada name
5913 that is to be ignored for matching purposes. Suffixes of parallel
5914 names (e.g., XVE) are not included here. Currently, the possible suffixes
5915 are given by any of the regular expressions:
5917 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5918 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5919 TKB [subprogram suffix for task bodies]
5920 _E[0-9]+[bs]$ [protected object entry suffixes]
5921 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5923 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5924 match is performed. This sequence is used to differentiate homonyms,
5925 is an optional part of a valid name suffix. */
5928 is_name_suffix (const char *str
)
5931 const char *matching
;
5932 const int len
= strlen (str
);
5934 /* Skip optional leading __[0-9]+. */
5936 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5939 while (isdigit (str
[0]))
5945 if (str
[0] == '.' || str
[0] == '$')
5948 while (isdigit (matching
[0]))
5950 if (matching
[0] == '\0')
5956 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5959 while (isdigit (matching
[0]))
5961 if (matching
[0] == '\0')
5965 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5967 if (strcmp (str
, "TKB") == 0)
5971 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5972 with a N at the end. Unfortunately, the compiler uses the same
5973 convention for other internal types it creates. So treating
5974 all entity names that end with an "N" as a name suffix causes
5975 some regressions. For instance, consider the case of an enumerated
5976 type. To support the 'Image attribute, it creates an array whose
5978 Having a single character like this as a suffix carrying some
5979 information is a bit risky. Perhaps we should change the encoding
5980 to be something like "_N" instead. In the meantime, do not do
5981 the following check. */
5982 /* Protected Object Subprograms */
5983 if (len
== 1 && str
[0] == 'N')
5988 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5991 while (isdigit (matching
[0]))
5993 if ((matching
[0] == 'b' || matching
[0] == 's')
5994 && matching
[1] == '\0')
5998 /* ??? We should not modify STR directly, as we are doing below. This
5999 is fine in this case, but may become problematic later if we find
6000 that this alternative did not work, and want to try matching
6001 another one from the begining of STR. Since we modified it, we
6002 won't be able to find the begining of the string anymore! */
6006 while (str
[0] != '_' && str
[0] != '\0')
6008 if (str
[0] != 'n' && str
[0] != 'b')
6014 if (str
[0] == '\000')
6019 if (str
[1] != '_' || str
[2] == '\000')
6023 if (strcmp (str
+ 3, "JM") == 0)
6025 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6026 the LJM suffix in favor of the JM one. But we will
6027 still accept LJM as a valid suffix for a reasonable
6028 amount of time, just to allow ourselves to debug programs
6029 compiled using an older version of GNAT. */
6030 if (strcmp (str
+ 3, "LJM") == 0)
6034 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
6035 || str
[4] == 'U' || str
[4] == 'P')
6037 if (str
[4] == 'R' && str
[5] != 'T')
6041 if (!isdigit (str
[2]))
6043 for (k
= 3; str
[k
] != '\0'; k
+= 1)
6044 if (!isdigit (str
[k
]) && str
[k
] != '_')
6048 if (str
[0] == '$' && isdigit (str
[1]))
6050 for (k
= 2; str
[k
] != '\0'; k
+= 1)
6051 if (!isdigit (str
[k
]) && str
[k
] != '_')
6058 /* Return non-zero if the string starting at NAME and ending before
6059 NAME_END contains no capital letters. */
6062 is_valid_name_for_wild_match (const char *name0
)
6064 std::string decoded_name
= ada_decode (name0
);
6067 /* If the decoded name starts with an angle bracket, it means that
6068 NAME0 does not follow the GNAT encoding format. It should then
6069 not be allowed as a possible wild match. */
6070 if (decoded_name
[0] == '<')
6073 for (i
=0; decoded_name
[i
] != '\0'; i
++)
6074 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6080 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6081 that could start a simple name. Assumes that *NAMEP points into
6082 the string beginning at NAME0. */
6085 advance_wild_match (const char **namep
, const char *name0
, int target0
)
6087 const char *name
= *namep
;
6097 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6100 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6105 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6106 || name
[2] == target0
))
6114 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6124 /* Return true iff NAME encodes a name of the form prefix.PATN.
6125 Ignores any informational suffixes of NAME (i.e., for which
6126 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6130 wild_match (const char *name
, const char *patn
)
6133 const char *name0
= name
;
6137 const char *match
= name
;
6141 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6144 if (*p
== '\0' && is_name_suffix (name
))
6145 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6147 if (name
[-1] == '_')
6150 if (!advance_wild_match (&name
, name0
, *patn
))
6155 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6156 any trailing suffixes that encode debugging information or leading
6157 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6158 information that is ignored). */
6161 full_match (const char *sym_name
, const char *search_name
)
6163 size_t search_name_len
= strlen (search_name
);
6165 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6166 && is_name_suffix (sym_name
+ search_name_len
))
6169 if (startswith (sym_name
, "_ada_")
6170 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6171 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6177 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6178 *defn_symbols, updating the list of symbols in OBSTACKP (if
6179 necessary). OBJFILE is the section containing BLOCK. */
6182 ada_add_block_symbols (struct obstack
*obstackp
,
6183 const struct block
*block
,
6184 const lookup_name_info
&lookup_name
,
6185 domain_enum domain
, struct objfile
*objfile
)
6187 struct block_iterator iter
;
6188 /* A matching argument symbol, if any. */
6189 struct symbol
*arg_sym
;
6190 /* Set true when we find a matching non-argument symbol. */
6196 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6198 sym
= block_iter_match_next (lookup_name
, &iter
))
6200 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6202 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6204 if (SYMBOL_IS_ARGUMENT (sym
))
6209 add_defn_to_vec (obstackp
,
6210 fixup_symbol_section (sym
, objfile
),
6217 /* Handle renamings. */
6219 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6222 if (!found_sym
&& arg_sym
!= NULL
)
6224 add_defn_to_vec (obstackp
,
6225 fixup_symbol_section (arg_sym
, objfile
),
6229 if (!lookup_name
.ada ().wild_match_p ())
6233 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6234 const char *name
= ada_lookup_name
.c_str ();
6235 size_t name_len
= ada_lookup_name
.size ();
6237 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6239 if (symbol_matches_domain (sym
->language (),
6240 SYMBOL_DOMAIN (sym
), domain
))
6244 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6247 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6249 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6254 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6256 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6258 if (SYMBOL_IS_ARGUMENT (sym
))
6263 add_defn_to_vec (obstackp
,
6264 fixup_symbol_section (sym
, objfile
),
6272 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6273 They aren't parameters, right? */
6274 if (!found_sym
&& arg_sym
!= NULL
)
6276 add_defn_to_vec (obstackp
,
6277 fixup_symbol_section (arg_sym
, objfile
),
6284 /* Symbol Completion */
6289 ada_lookup_name_info::matches
6290 (const char *sym_name
,
6291 symbol_name_match_type match_type
,
6292 completion_match_result
*comp_match_res
) const
6295 const char *text
= m_encoded_name
.c_str ();
6296 size_t text_len
= m_encoded_name
.size ();
6298 /* First, test against the fully qualified name of the symbol. */
6300 if (strncmp (sym_name
, text
, text_len
) == 0)
6303 std::string decoded_name
= ada_decode (sym_name
);
6304 if (match
&& !m_encoded_p
)
6306 /* One needed check before declaring a positive match is to verify
6307 that iff we are doing a verbatim match, the decoded version
6308 of the symbol name starts with '<'. Otherwise, this symbol name
6309 is not a suitable completion. */
6311 bool has_angle_bracket
= (decoded_name
[0] == '<');
6312 match
= (has_angle_bracket
== m_verbatim_p
);
6315 if (match
&& !m_verbatim_p
)
6317 /* When doing non-verbatim match, another check that needs to
6318 be done is to verify that the potentially matching symbol name
6319 does not include capital letters, because the ada-mode would
6320 not be able to understand these symbol names without the
6321 angle bracket notation. */
6324 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6329 /* Second: Try wild matching... */
6331 if (!match
&& m_wild_match_p
)
6333 /* Since we are doing wild matching, this means that TEXT
6334 may represent an unqualified symbol name. We therefore must
6335 also compare TEXT against the unqualified name of the symbol. */
6336 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6338 if (strncmp (sym_name
, text
, text_len
) == 0)
6342 /* Finally: If we found a match, prepare the result to return. */
6347 if (comp_match_res
!= NULL
)
6349 std::string
&match_str
= comp_match_res
->match
.storage ();
6352 match_str
= ada_decode (sym_name
);
6356 match_str
= add_angle_brackets (sym_name
);
6358 match_str
= sym_name
;
6362 comp_match_res
->set_match (match_str
.c_str ());
6368 /* Add the list of possible symbol names completing TEXT to TRACKER.
6369 WORD is the entire command on which completion is made. */
6372 ada_collect_symbol_completion_matches (completion_tracker
&tracker
,
6373 complete_symbol_mode mode
,
6374 symbol_name_match_type name_match_type
,
6375 const char *text
, const char *word
,
6376 enum type_code code
)
6379 const struct block
*b
, *surrounding_static_block
= 0;
6380 struct block_iterator iter
;
6382 gdb_assert (code
== TYPE_CODE_UNDEF
);
6384 lookup_name_info
lookup_name (text
, name_match_type
, true);
6386 /* First, look at the partial symtab symbols. */
6387 expand_symtabs_matching (NULL
,
6393 /* At this point scan through the misc symbol vectors and add each
6394 symbol you find to the list. Eventually we want to ignore
6395 anything that isn't a text symbol (everything else will be
6396 handled by the psymtab code above). */
6398 for (objfile
*objfile
: current_program_space
->objfiles ())
6400 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
6404 if (completion_skip_symbol (mode
, msymbol
))
6407 language symbol_language
= msymbol
->language ();
6409 /* Ada minimal symbols won't have their language set to Ada. If
6410 we let completion_list_add_name compare using the
6411 default/C-like matcher, then when completing e.g., symbols in a
6412 package named "pck", we'd match internal Ada symbols like
6413 "pckS", which are invalid in an Ada expression, unless you wrap
6414 them in '<' '>' to request a verbatim match.
6416 Unfortunately, some Ada encoded names successfully demangle as
6417 C++ symbols (using an old mangling scheme), such as "name__2Xn"
6418 -> "Xn::name(void)" and thus some Ada minimal symbols end up
6419 with the wrong language set. Paper over that issue here. */
6420 if (symbol_language
== language_auto
6421 || symbol_language
== language_cplus
)
6422 symbol_language
= language_ada
;
6424 completion_list_add_name (tracker
,
6426 msymbol
->linkage_name (),
6427 lookup_name
, text
, word
);
6431 /* Search upwards from currently selected frame (so that we can
6432 complete on local vars. */
6434 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6436 if (!BLOCK_SUPERBLOCK (b
))
6437 surrounding_static_block
= b
; /* For elmin of dups */
6439 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6441 if (completion_skip_symbol (mode
, sym
))
6444 completion_list_add_name (tracker
,
6446 sym
->linkage_name (),
6447 lookup_name
, text
, word
);
6451 /* Go through the symtabs and check the externs and statics for
6452 symbols which match. */
6454 for (objfile
*objfile
: current_program_space
->objfiles ())
6456 for (compunit_symtab
*s
: objfile
->compunits ())
6459 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6460 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6462 if (completion_skip_symbol (mode
, sym
))
6465 completion_list_add_name (tracker
,
6467 sym
->linkage_name (),
6468 lookup_name
, text
, word
);
6473 for (objfile
*objfile
: current_program_space
->objfiles ())
6475 for (compunit_symtab
*s
: objfile
->compunits ())
6478 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6479 /* Don't do this block twice. */
6480 if (b
== surrounding_static_block
)
6482 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6484 if (completion_skip_symbol (mode
, sym
))
6487 completion_list_add_name (tracker
,
6489 sym
->linkage_name (),
6490 lookup_name
, text
, word
);
6498 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6499 for tagged types. */
6502 ada_is_dispatch_table_ptr_type (struct type
*type
)
6506 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6509 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6513 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6516 /* Return non-zero if TYPE is an interface tag. */
6519 ada_is_interface_tag (struct type
*type
)
6521 const char *name
= TYPE_NAME (type
);
6526 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6529 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6530 to be invisible to users. */
6533 ada_is_ignored_field (struct type
*type
, int field_num
)
6535 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6538 /* Check the name of that field. */
6540 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6542 /* Anonymous field names should not be printed.
6543 brobecker/2007-02-20: I don't think this can actually happen
6544 but we don't want to print the value of anonymous fields anyway. */
6548 /* Normally, fields whose name start with an underscore ("_")
6549 are fields that have been internally generated by the compiler,
6550 and thus should not be printed. The "_parent" field is special,
6551 however: This is a field internally generated by the compiler
6552 for tagged types, and it contains the components inherited from
6553 the parent type. This field should not be printed as is, but
6554 should not be ignored either. */
6555 if (name
[0] == '_' && !startswith (name
, "_parent"))
6559 /* If this is the dispatch table of a tagged type or an interface tag,
6561 if (ada_is_tagged_type (type
, 1)
6562 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6563 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6566 /* Not a special field, so it should not be ignored. */
6570 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6571 pointer or reference type whose ultimate target has a tag field. */
6574 ada_is_tagged_type (struct type
*type
, int refok
)
6576 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6579 /* True iff TYPE represents the type of X'Tag */
6582 ada_is_tag_type (struct type
*type
)
6584 type
= ada_check_typedef (type
);
6586 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6590 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6592 return (name
!= NULL
6593 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6597 /* The type of the tag on VAL. */
6599 static struct type
*
6600 ada_tag_type (struct value
*val
)
6602 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6605 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6606 retired at Ada 05). */
6609 is_ada95_tag (struct value
*tag
)
6611 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6614 /* The value of the tag on VAL. */
6616 static struct value
*
6617 ada_value_tag (struct value
*val
)
6619 return ada_value_struct_elt (val
, "_tag", 0);
6622 /* The value of the tag on the object of type TYPE whose contents are
6623 saved at VALADDR, if it is non-null, or is at memory address
6626 static struct value
*
6627 value_tag_from_contents_and_address (struct type
*type
,
6628 const gdb_byte
*valaddr
,
6631 int tag_byte_offset
;
6632 struct type
*tag_type
;
6634 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6637 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6639 : valaddr
+ tag_byte_offset
);
6640 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6642 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6647 static struct type
*
6648 type_from_tag (struct value
*tag
)
6650 const char *type_name
= ada_tag_name (tag
);
6652 if (type_name
!= NULL
)
6653 return ada_find_any_type (ada_encode (type_name
));
6657 /* Given a value OBJ of a tagged type, return a value of this
6658 type at the base address of the object. The base address, as
6659 defined in Ada.Tags, it is the address of the primary tag of
6660 the object, and therefore where the field values of its full
6661 view can be fetched. */
6664 ada_tag_value_at_base_address (struct value
*obj
)
6667 LONGEST offset_to_top
= 0;
6668 struct type
*ptr_type
, *obj_type
;
6670 CORE_ADDR base_address
;
6672 obj_type
= value_type (obj
);
6674 /* It is the responsability of the caller to deref pointers. */
6676 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6677 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6680 tag
= ada_value_tag (obj
);
6684 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6686 if (is_ada95_tag (tag
))
6689 ptr_type
= language_lookup_primitive_type
6690 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6691 ptr_type
= lookup_pointer_type (ptr_type
);
6692 val
= value_cast (ptr_type
, tag
);
6696 /* It is perfectly possible that an exception be raised while
6697 trying to determine the base address, just like for the tag;
6698 see ada_tag_name for more details. We do not print the error
6699 message for the same reason. */
6703 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6706 catch (const gdb_exception_error
&e
)
6711 /* If offset is null, nothing to do. */
6713 if (offset_to_top
== 0)
6716 /* -1 is a special case in Ada.Tags; however, what should be done
6717 is not quite clear from the documentation. So do nothing for
6720 if (offset_to_top
== -1)
6723 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6724 from the base address. This was however incompatible with
6725 C++ dispatch table: C++ uses a *negative* value to *add*
6726 to the base address. Ada's convention has therefore been
6727 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6728 use the same convention. Here, we support both cases by
6729 checking the sign of OFFSET_TO_TOP. */
6731 if (offset_to_top
> 0)
6732 offset_to_top
= -offset_to_top
;
6734 base_address
= value_address (obj
) + offset_to_top
;
6735 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6737 /* Make sure that we have a proper tag at the new address.
6738 Otherwise, offset_to_top is bogus (which can happen when
6739 the object is not initialized yet). */
6744 obj_type
= type_from_tag (tag
);
6749 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6752 /* Return the "ada__tags__type_specific_data" type. */
6754 static struct type
*
6755 ada_get_tsd_type (struct inferior
*inf
)
6757 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6759 if (data
->tsd_type
== 0)
6760 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6761 return data
->tsd_type
;
6764 /* Return the TSD (type-specific data) associated to the given TAG.
6765 TAG is assumed to be the tag of a tagged-type entity.
6767 May return NULL if we are unable to get the TSD. */
6769 static struct value
*
6770 ada_get_tsd_from_tag (struct value
*tag
)
6775 /* First option: The TSD is simply stored as a field of our TAG.
6776 Only older versions of GNAT would use this format, but we have
6777 to test it first, because there are no visible markers for
6778 the current approach except the absence of that field. */
6780 val
= ada_value_struct_elt (tag
, "tsd", 1);
6784 /* Try the second representation for the dispatch table (in which
6785 there is no explicit 'tsd' field in the referent of the tag pointer,
6786 and instead the tsd pointer is stored just before the dispatch
6789 type
= ada_get_tsd_type (current_inferior());
6792 type
= lookup_pointer_type (lookup_pointer_type (type
));
6793 val
= value_cast (type
, tag
);
6796 return value_ind (value_ptradd (val
, -1));
6799 /* Given the TSD of a tag (type-specific data), return a string
6800 containing the name of the associated type.
6802 The returned value is good until the next call. May return NULL
6803 if we are unable to determine the tag name. */
6806 ada_tag_name_from_tsd (struct value
*tsd
)
6808 static char name
[1024];
6812 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6815 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6816 for (p
= name
; *p
!= '\0'; p
+= 1)
6822 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6825 Return NULL if the TAG is not an Ada tag, or if we were unable to
6826 determine the name of that tag. The result is good until the next
6830 ada_tag_name (struct value
*tag
)
6834 if (!ada_is_tag_type (value_type (tag
)))
6837 /* It is perfectly possible that an exception be raised while trying
6838 to determine the TAG's name, even under normal circumstances:
6839 The associated variable may be uninitialized or corrupted, for
6840 instance. We do not let any exception propagate past this point.
6841 instead we return NULL.
6843 We also do not print the error message either (which often is very
6844 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6845 the caller print a more meaningful message if necessary. */
6848 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6851 name
= ada_tag_name_from_tsd (tsd
);
6853 catch (const gdb_exception_error
&e
)
6860 /* The parent type of TYPE, or NULL if none. */
6863 ada_parent_type (struct type
*type
)
6867 type
= ada_check_typedef (type
);
6869 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6872 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6873 if (ada_is_parent_field (type
, i
))
6875 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6877 /* If the _parent field is a pointer, then dereference it. */
6878 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6879 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6880 /* If there is a parallel XVS type, get the actual base type. */
6881 parent_type
= ada_get_base_type (parent_type
);
6883 return ada_check_typedef (parent_type
);
6889 /* True iff field number FIELD_NUM of structure type TYPE contains the
6890 parent-type (inherited) fields of a derived type. Assumes TYPE is
6891 a structure type with at least FIELD_NUM+1 fields. */
6894 ada_is_parent_field (struct type
*type
, int field_num
)
6896 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6898 return (name
!= NULL
6899 && (startswith (name
, "PARENT")
6900 || startswith (name
, "_parent")));
6903 /* True iff field number FIELD_NUM of structure type TYPE is a
6904 transparent wrapper field (which should be silently traversed when doing
6905 field selection and flattened when printing). Assumes TYPE is a
6906 structure type with at least FIELD_NUM+1 fields. Such fields are always
6910 ada_is_wrapper_field (struct type
*type
, int field_num
)
6912 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6914 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6916 /* This happens in functions with "out" or "in out" parameters
6917 which are passed by copy. For such functions, GNAT describes
6918 the function's return type as being a struct where the return
6919 value is in a field called RETVAL, and where the other "out"
6920 or "in out" parameters are fields of that struct. This is not
6925 return (name
!= NULL
6926 && (startswith (name
, "PARENT")
6927 || strcmp (name
, "REP") == 0
6928 || startswith (name
, "_parent")
6929 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6932 /* True iff field number FIELD_NUM of structure or union type TYPE
6933 is a variant wrapper. Assumes TYPE is a structure type with at least
6934 FIELD_NUM+1 fields. */
6937 ada_is_variant_part (struct type
*type
, int field_num
)
6939 /* Only Ada types are eligible. */
6940 if (!ADA_TYPE_P (type
))
6943 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6945 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6946 || (is_dynamic_field (type
, field_num
)
6947 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6948 == TYPE_CODE_UNION
)));
6951 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6952 whose discriminants are contained in the record type OUTER_TYPE,
6953 returns the type of the controlling discriminant for the variant.
6954 May return NULL if the type could not be found. */
6957 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6959 const char *name
= ada_variant_discrim_name (var_type
);
6961 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6964 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6965 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6966 represents a 'when others' clause; otherwise 0. */
6969 ada_is_others_clause (struct type
*type
, int field_num
)
6971 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6973 return (name
!= NULL
&& name
[0] == 'O');
6976 /* Assuming that TYPE0 is the type of the variant part of a record,
6977 returns the name of the discriminant controlling the variant.
6978 The value is valid until the next call to ada_variant_discrim_name. */
6981 ada_variant_discrim_name (struct type
*type0
)
6983 static char *result
= NULL
;
6984 static size_t result_len
= 0;
6987 const char *discrim_end
;
6988 const char *discrim_start
;
6990 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6991 type
= TYPE_TARGET_TYPE (type0
);
6995 name
= ada_type_name (type
);
6997 if (name
== NULL
|| name
[0] == '\000')
7000 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
7003 if (startswith (discrim_end
, "___XVN"))
7006 if (discrim_end
== name
)
7009 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
7012 if (discrim_start
== name
+ 1)
7014 if ((discrim_start
> name
+ 3
7015 && startswith (discrim_start
- 3, "___"))
7016 || discrim_start
[-1] == '.')
7020 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
7021 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
7022 result
[discrim_end
- discrim_start
] = '\0';
7026 /* Scan STR for a subtype-encoded number, beginning at position K.
7027 Put the position of the character just past the number scanned in
7028 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7029 Return 1 if there was a valid number at the given position, and 0
7030 otherwise. A "subtype-encoded" number consists of the absolute value
7031 in decimal, followed by the letter 'm' to indicate a negative number.
7032 Assumes 0m does not occur. */
7035 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
7039 if (!isdigit (str
[k
]))
7042 /* Do it the hard way so as not to make any assumption about
7043 the relationship of unsigned long (%lu scan format code) and
7046 while (isdigit (str
[k
]))
7048 RU
= RU
* 10 + (str
[k
] - '0');
7055 *R
= (-(LONGEST
) (RU
- 1)) - 1;
7061 /* NOTE on the above: Technically, C does not say what the results of
7062 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7063 number representable as a LONGEST (although either would probably work
7064 in most implementations). When RU>0, the locution in the then branch
7065 above is always equivalent to the negative of RU. */
7072 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7073 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7074 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7077 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
7079 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7093 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
7103 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
7104 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7106 if (val
>= L
&& val
<= U
)
7118 /* FIXME: Lots of redundancy below. Try to consolidate. */
7120 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7121 ARG_TYPE, extract and return the value of one of its (non-static)
7122 fields. FIELDNO says which field. Differs from value_primitive_field
7123 only in that it can handle packed values of arbitrary type. */
7126 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7127 struct type
*arg_type
)
7131 arg_type
= ada_check_typedef (arg_type
);
7132 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
7134 /* Handle packed fields. It might be that the field is not packed
7135 relative to its containing structure, but the structure itself is
7136 packed; in this case we must take the bit-field path. */
7137 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
7139 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7140 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7142 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7143 offset
+ bit_pos
/ 8,
7144 bit_pos
% 8, bit_size
, type
);
7147 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7150 /* Find field with name NAME in object of type TYPE. If found,
7151 set the following for each argument that is non-null:
7152 - *FIELD_TYPE_P to the field's type;
7153 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7154 an object of that type;
7155 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7156 - *BIT_SIZE_P to its size in bits if the field is packed, and
7158 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7159 fields up to but not including the desired field, or by the total
7160 number of fields if not found. A NULL value of NAME never
7161 matches; the function just counts visible fields in this case.
7163 Notice that we need to handle when a tagged record hierarchy
7164 has some components with the same name, like in this scenario:
7166 type Top_T is tagged record
7172 type Middle_T is new Top.Top_T with record
7173 N : Character := 'a';
7177 type Bottom_T is new Middle.Middle_T with record
7179 C : Character := '5';
7181 A : Character := 'J';
7184 Let's say we now have a variable declared and initialized as follow:
7186 TC : Top_A := new Bottom_T;
7188 And then we use this variable to call this function
7190 procedure Assign (Obj: in out Top_T; TV : Integer);
7194 Assign (Top_T (B), 12);
7196 Now, we're in the debugger, and we're inside that procedure
7197 then and we want to print the value of obj.c:
7199 Usually, the tagged record or one of the parent type owns the
7200 component to print and there's no issue but in this particular
7201 case, what does it mean to ask for Obj.C? Since the actual
7202 type for object is type Bottom_T, it could mean two things: type
7203 component C from the Middle_T view, but also component C from
7204 Bottom_T. So in that "undefined" case, when the component is
7205 not found in the non-resolved type (which includes all the
7206 components of the parent type), then resolve it and see if we
7207 get better luck once expanded.
7209 In the case of homonyms in the derived tagged type, we don't
7210 guaranty anything, and pick the one that's easiest for us
7213 Returns 1 if found, 0 otherwise. */
7216 find_struct_field (const char *name
, struct type
*type
, int offset
,
7217 struct type
**field_type_p
,
7218 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7222 int parent_offset
= -1;
7224 type
= ada_check_typedef (type
);
7226 if (field_type_p
!= NULL
)
7227 *field_type_p
= NULL
;
7228 if (byte_offset_p
!= NULL
)
7230 if (bit_offset_p
!= NULL
)
7232 if (bit_size_p
!= NULL
)
7235 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7237 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7238 int fld_offset
= offset
+ bit_pos
/ 8;
7239 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7241 if (t_field_name
== NULL
)
7244 else if (ada_is_parent_field (type
, i
))
7246 /* This is a field pointing us to the parent type of a tagged
7247 type. As hinted in this function's documentation, we give
7248 preference to fields in the current record first, so what
7249 we do here is just record the index of this field before
7250 we skip it. If it turns out we couldn't find our field
7251 in the current record, then we'll get back to it and search
7252 inside it whether the field might exist in the parent. */
7258 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7260 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7262 if (field_type_p
!= NULL
)
7263 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7264 if (byte_offset_p
!= NULL
)
7265 *byte_offset_p
= fld_offset
;
7266 if (bit_offset_p
!= NULL
)
7267 *bit_offset_p
= bit_pos
% 8;
7268 if (bit_size_p
!= NULL
)
7269 *bit_size_p
= bit_size
;
7272 else if (ada_is_wrapper_field (type
, i
))
7274 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7275 field_type_p
, byte_offset_p
, bit_offset_p
,
7276 bit_size_p
, index_p
))
7279 else if (ada_is_variant_part (type
, i
))
7281 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7284 struct type
*field_type
7285 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7287 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7289 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7291 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7292 field_type_p
, byte_offset_p
,
7293 bit_offset_p
, bit_size_p
, index_p
))
7297 else if (index_p
!= NULL
)
7301 /* Field not found so far. If this is a tagged type which
7302 has a parent, try finding that field in the parent now. */
7304 if (parent_offset
!= -1)
7306 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7307 int fld_offset
= offset
+ bit_pos
/ 8;
7309 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, parent_offset
),
7310 fld_offset
, field_type_p
, byte_offset_p
,
7311 bit_offset_p
, bit_size_p
, index_p
))
7318 /* Number of user-visible fields in record type TYPE. */
7321 num_visible_fields (struct type
*type
)
7326 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7330 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7331 and search in it assuming it has (class) type TYPE.
7332 If found, return value, else return NULL.
7334 Searches recursively through wrapper fields (e.g., '_parent').
7336 In the case of homonyms in the tagged types, please refer to the
7337 long explanation in find_struct_field's function documentation. */
7339 static struct value
*
7340 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7344 int parent_offset
= -1;
7346 type
= ada_check_typedef (type
);
7347 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7349 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7351 if (t_field_name
== NULL
)
7354 else if (ada_is_parent_field (type
, i
))
7356 /* This is a field pointing us to the parent type of a tagged
7357 type. As hinted in this function's documentation, we give
7358 preference to fields in the current record first, so what
7359 we do here is just record the index of this field before
7360 we skip it. If it turns out we couldn't find our field
7361 in the current record, then we'll get back to it and search
7362 inside it whether the field might exist in the parent. */
7368 else if (field_name_match (t_field_name
, name
))
7369 return ada_value_primitive_field (arg
, offset
, i
, type
);
7371 else if (ada_is_wrapper_field (type
, i
))
7373 struct value
*v
= /* Do not let indent join lines here. */
7374 ada_search_struct_field (name
, arg
,
7375 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7376 TYPE_FIELD_TYPE (type
, i
));
7382 else if (ada_is_variant_part (type
, i
))
7384 /* PNH: Do we ever get here? See find_struct_field. */
7386 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7388 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7390 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7392 struct value
*v
= ada_search_struct_field
/* Force line
7395 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7396 TYPE_FIELD_TYPE (field_type
, j
));
7404 /* Field not found so far. If this is a tagged type which
7405 has a parent, try finding that field in the parent now. */
7407 if (parent_offset
!= -1)
7409 struct value
*v
= ada_search_struct_field (
7410 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7411 TYPE_FIELD_TYPE (type
, parent_offset
));
7420 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7421 int, struct type
*);
7424 /* Return field #INDEX in ARG, where the index is that returned by
7425 * find_struct_field through its INDEX_P argument. Adjust the address
7426 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7427 * If found, return value, else return NULL. */
7429 static struct value
*
7430 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7433 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7437 /* Auxiliary function for ada_index_struct_field. Like
7438 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7441 static struct value
*
7442 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7446 type
= ada_check_typedef (type
);
7448 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7450 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7452 else if (ada_is_wrapper_field (type
, i
))
7454 struct value
*v
= /* Do not let indent join lines here. */
7455 ada_index_struct_field_1 (index_p
, arg
,
7456 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7457 TYPE_FIELD_TYPE (type
, i
));
7463 else if (ada_is_variant_part (type
, i
))
7465 /* PNH: Do we ever get here? See ada_search_struct_field,
7466 find_struct_field. */
7467 error (_("Cannot assign this kind of variant record"));
7469 else if (*index_p
== 0)
7470 return ada_value_primitive_field (arg
, offset
, i
, type
);
7477 /* Return a string representation of type TYPE. */
7480 type_as_string (struct type
*type
)
7482 string_file tmp_stream
;
7484 type_print (type
, "", &tmp_stream
, -1);
7486 return std::move (tmp_stream
.string ());
7489 /* Given a type TYPE, look up the type of the component of type named NAME.
7490 If DISPP is non-null, add its byte displacement from the beginning of a
7491 structure (pointed to by a value) of type TYPE to *DISPP (does not
7492 work for packed fields).
7494 Matches any field whose name has NAME as a prefix, possibly
7497 TYPE can be either a struct or union. If REFOK, TYPE may also
7498 be a (pointer or reference)+ to a struct or union, and the
7499 ultimate target type will be searched.
7501 Looks recursively into variant clauses and parent types.
7503 In the case of homonyms in the tagged types, please refer to the
7504 long explanation in find_struct_field's function documentation.
7506 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7507 TYPE is not a type of the right kind. */
7509 static struct type
*
7510 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7514 int parent_offset
= -1;
7519 if (refok
&& type
!= NULL
)
7522 type
= ada_check_typedef (type
);
7523 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7524 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7526 type
= TYPE_TARGET_TYPE (type
);
7530 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7531 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7536 error (_("Type %s is not a structure or union type"),
7537 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7540 type
= to_static_fixed_type (type
);
7542 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7544 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7547 if (t_field_name
== NULL
)
7550 else if (ada_is_parent_field (type
, i
))
7552 /* This is a field pointing us to the parent type of a tagged
7553 type. As hinted in this function's documentation, we give
7554 preference to fields in the current record first, so what
7555 we do here is just record the index of this field before
7556 we skip it. If it turns out we couldn't find our field
7557 in the current record, then we'll get back to it and search
7558 inside it whether the field might exist in the parent. */
7564 else if (field_name_match (t_field_name
, name
))
7565 return TYPE_FIELD_TYPE (type
, i
);
7567 else if (ada_is_wrapper_field (type
, i
))
7569 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7575 else if (ada_is_variant_part (type
, i
))
7578 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7581 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7583 /* FIXME pnh 2008/01/26: We check for a field that is
7584 NOT wrapped in a struct, since the compiler sometimes
7585 generates these for unchecked variant types. Revisit
7586 if the compiler changes this practice. */
7587 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7589 if (v_field_name
!= NULL
7590 && field_name_match (v_field_name
, name
))
7591 t
= TYPE_FIELD_TYPE (field_type
, j
);
7593 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7604 /* Field not found so far. If this is a tagged type which
7605 has a parent, try finding that field in the parent now. */
7607 if (parent_offset
!= -1)
7611 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, parent_offset
),
7620 const char *name_str
= name
!= NULL
? name
: _("<null>");
7622 error (_("Type %s has no component named %s"),
7623 type_as_string (type
).c_str (), name_str
);
7629 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7630 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7631 represents an unchecked union (that is, the variant part of a
7632 record that is named in an Unchecked_Union pragma). */
7635 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7637 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7639 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7643 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7644 within OUTER, determine which variant clause (field number in VAR_TYPE,
7645 numbering from 0) is applicable. Returns -1 if none are. */
7648 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7652 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7653 struct value
*discrim
;
7654 LONGEST discrim_val
;
7656 /* Using plain value_from_contents_and_address here causes problems
7657 because we will end up trying to resolve a type that is currently
7658 being constructed. */
7659 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7660 if (discrim
== NULL
)
7662 discrim_val
= value_as_long (discrim
);
7665 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7667 if (ada_is_others_clause (var_type
, i
))
7669 else if (ada_in_variant (discrim_val
, var_type
, i
))
7673 return others_clause
;
7678 /* Dynamic-Sized Records */
7680 /* Strategy: The type ostensibly attached to a value with dynamic size
7681 (i.e., a size that is not statically recorded in the debugging
7682 data) does not accurately reflect the size or layout of the value.
7683 Our strategy is to convert these values to values with accurate,
7684 conventional types that are constructed on the fly. */
7686 /* There is a subtle and tricky problem here. In general, we cannot
7687 determine the size of dynamic records without its data. However,
7688 the 'struct value' data structure, which GDB uses to represent
7689 quantities in the inferior process (the target), requires the size
7690 of the type at the time of its allocation in order to reserve space
7691 for GDB's internal copy of the data. That's why the
7692 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7693 rather than struct value*s.
7695 However, GDB's internal history variables ($1, $2, etc.) are
7696 struct value*s containing internal copies of the data that are not, in
7697 general, the same as the data at their corresponding addresses in
7698 the target. Fortunately, the types we give to these values are all
7699 conventional, fixed-size types (as per the strategy described
7700 above), so that we don't usually have to perform the
7701 'to_fixed_xxx_type' conversions to look at their values.
7702 Unfortunately, there is one exception: if one of the internal
7703 history variables is an array whose elements are unconstrained
7704 records, then we will need to create distinct fixed types for each
7705 element selected. */
7707 /* The upshot of all of this is that many routines take a (type, host
7708 address, target address) triple as arguments to represent a value.
7709 The host address, if non-null, is supposed to contain an internal
7710 copy of the relevant data; otherwise, the program is to consult the
7711 target at the target address. */
7713 /* Assuming that VAL0 represents a pointer value, the result of
7714 dereferencing it. Differs from value_ind in its treatment of
7715 dynamic-sized types. */
7718 ada_value_ind (struct value
*val0
)
7720 struct value
*val
= value_ind (val0
);
7722 if (ada_is_tagged_type (value_type (val
), 0))
7723 val
= ada_tag_value_at_base_address (val
);
7725 return ada_to_fixed_value (val
);
7728 /* The value resulting from dereferencing any "reference to"
7729 qualifiers on VAL0. */
7731 static struct value
*
7732 ada_coerce_ref (struct value
*val0
)
7734 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7736 struct value
*val
= val0
;
7738 val
= coerce_ref (val
);
7740 if (ada_is_tagged_type (value_type (val
), 0))
7741 val
= ada_tag_value_at_base_address (val
);
7743 return ada_to_fixed_value (val
);
7749 /* Return the bit alignment required for field #F of template type TYPE. */
7752 field_alignment (struct type
*type
, int f
)
7754 const char *name
= TYPE_FIELD_NAME (type
, f
);
7758 /* The field name should never be null, unless the debugging information
7759 is somehow malformed. In this case, we assume the field does not
7760 require any alignment. */
7764 len
= strlen (name
);
7766 if (!isdigit (name
[len
- 1]))
7769 if (isdigit (name
[len
- 2]))
7770 align_offset
= len
- 2;
7772 align_offset
= len
- 1;
7774 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7775 return TARGET_CHAR_BIT
;
7777 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7780 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7782 static struct symbol
*
7783 ada_find_any_type_symbol (const char *name
)
7787 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7788 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7791 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7795 /* Find a type named NAME. Ignores ambiguity. This routine will look
7796 solely for types defined by debug info, it will not search the GDB
7799 static struct type
*
7800 ada_find_any_type (const char *name
)
7802 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7805 return SYMBOL_TYPE (sym
);
7810 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7811 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7812 symbol, in which case it is returned. Otherwise, this looks for
7813 symbols whose name is that of NAME_SYM suffixed with "___XR".
7814 Return symbol if found, and NULL otherwise. */
7817 ada_is_renaming_symbol (struct symbol
*name_sym
)
7819 const char *name
= name_sym
->linkage_name ();
7820 return strstr (name
, "___XR") != NULL
;
7823 /* Because of GNAT encoding conventions, several GDB symbols may match a
7824 given type name. If the type denoted by TYPE0 is to be preferred to
7825 that of TYPE1 for purposes of type printing, return non-zero;
7826 otherwise return 0. */
7829 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7833 else if (type0
== NULL
)
7835 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7837 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7839 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7841 else if (ada_is_constrained_packed_array_type (type0
))
7843 else if (ada_is_array_descriptor_type (type0
)
7844 && !ada_is_array_descriptor_type (type1
))
7848 const char *type0_name
= TYPE_NAME (type0
);
7849 const char *type1_name
= TYPE_NAME (type1
);
7851 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7852 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7858 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7862 ada_type_name (struct type
*type
)
7866 return TYPE_NAME (type
);
7869 /* Search the list of "descriptive" types associated to TYPE for a type
7870 whose name is NAME. */
7872 static struct type
*
7873 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7875 struct type
*result
, *tmp
;
7877 if (ada_ignore_descriptive_types_p
)
7880 /* If there no descriptive-type info, then there is no parallel type
7882 if (!HAVE_GNAT_AUX_INFO (type
))
7885 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7886 while (result
!= NULL
)
7888 const char *result_name
= ada_type_name (result
);
7890 if (result_name
== NULL
)
7892 warning (_("unexpected null name on descriptive type"));
7896 /* If the names match, stop. */
7897 if (strcmp (result_name
, name
) == 0)
7900 /* Otherwise, look at the next item on the list, if any. */
7901 if (HAVE_GNAT_AUX_INFO (result
))
7902 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7906 /* If not found either, try after having resolved the typedef. */
7911 result
= check_typedef (result
);
7912 if (HAVE_GNAT_AUX_INFO (result
))
7913 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7919 /* If we didn't find a match, see whether this is a packed array. With
7920 older compilers, the descriptive type information is either absent or
7921 irrelevant when it comes to packed arrays so the above lookup fails.
7922 Fall back to using a parallel lookup by name in this case. */
7923 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7924 return ada_find_any_type (name
);
7929 /* Find a parallel type to TYPE with the specified NAME, using the
7930 descriptive type taken from the debugging information, if available,
7931 and otherwise using the (slower) name-based method. */
7933 static struct type
*
7934 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7936 struct type
*result
= NULL
;
7938 if (HAVE_GNAT_AUX_INFO (type
))
7939 result
= find_parallel_type_by_descriptive_type (type
, name
);
7941 result
= ada_find_any_type (name
);
7946 /* Same as above, but specify the name of the parallel type by appending
7947 SUFFIX to the name of TYPE. */
7950 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7953 const char *type_name
= ada_type_name (type
);
7956 if (type_name
== NULL
)
7959 len
= strlen (type_name
);
7961 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7963 strcpy (name
, type_name
);
7964 strcpy (name
+ len
, suffix
);
7966 return ada_find_parallel_type_with_name (type
, name
);
7969 /* If TYPE is a variable-size record type, return the corresponding template
7970 type describing its fields. Otherwise, return NULL. */
7972 static struct type
*
7973 dynamic_template_type (struct type
*type
)
7975 type
= ada_check_typedef (type
);
7977 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7978 || ada_type_name (type
) == NULL
)
7982 int len
= strlen (ada_type_name (type
));
7984 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7987 return ada_find_parallel_type (type
, "___XVE");
7991 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7992 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7995 is_dynamic_field (struct type
*templ_type
, int field_num
)
7997 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
8000 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
8001 && strstr (name
, "___XVL") != NULL
;
8004 /* The index of the variant field of TYPE, or -1 if TYPE does not
8005 represent a variant record type. */
8008 variant_field_index (struct type
*type
)
8012 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
8015 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
8017 if (ada_is_variant_part (type
, f
))
8023 /* A record type with no fields. */
8025 static struct type
*
8026 empty_record (struct type
*templ
)
8028 struct type
*type
= alloc_type_copy (templ
);
8030 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
8031 TYPE_NFIELDS (type
) = 0;
8032 TYPE_FIELDS (type
) = NULL
;
8033 INIT_NONE_SPECIFIC (type
);
8034 TYPE_NAME (type
) = "<empty>";
8035 TYPE_LENGTH (type
) = 0;
8039 /* An ordinary record type (with fixed-length fields) that describes
8040 the value of type TYPE at VALADDR or ADDRESS (see comments at
8041 the beginning of this section) VAL according to GNAT conventions.
8042 DVAL0 should describe the (portion of a) record that contains any
8043 necessary discriminants. It should be NULL if value_type (VAL) is
8044 an outer-level type (i.e., as opposed to a branch of a variant.) A
8045 variant field (unless unchecked) is replaced by a particular branch
8048 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8049 length are not statically known are discarded. As a consequence,
8050 VALADDR, ADDRESS and DVAL0 are ignored.
8052 NOTE: Limitations: For now, we assume that dynamic fields and
8053 variants occupy whole numbers of bytes. However, they need not be
8057 ada_template_to_fixed_record_type_1 (struct type
*type
,
8058 const gdb_byte
*valaddr
,
8059 CORE_ADDR address
, struct value
*dval0
,
8060 int keep_dynamic_fields
)
8062 struct value
*mark
= value_mark ();
8065 int nfields
, bit_len
;
8071 /* Compute the number of fields in this record type that are going
8072 to be processed: unless keep_dynamic_fields, this includes only
8073 fields whose position and length are static will be processed. */
8074 if (keep_dynamic_fields
)
8075 nfields
= TYPE_NFIELDS (type
);
8079 while (nfields
< TYPE_NFIELDS (type
)
8080 && !ada_is_variant_part (type
, nfields
)
8081 && !is_dynamic_field (type
, nfields
))
8085 rtype
= alloc_type_copy (type
);
8086 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8087 INIT_NONE_SPECIFIC (rtype
);
8088 TYPE_NFIELDS (rtype
) = nfields
;
8089 TYPE_FIELDS (rtype
) = (struct field
*)
8090 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8091 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
8092 TYPE_NAME (rtype
) = ada_type_name (type
);
8093 TYPE_FIXED_INSTANCE (rtype
) = 1;
8099 for (f
= 0; f
< nfields
; f
+= 1)
8101 off
= align_up (off
, field_alignment (type
, f
))
8102 + TYPE_FIELD_BITPOS (type
, f
);
8103 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
8104 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8106 if (ada_is_variant_part (type
, f
))
8111 else if (is_dynamic_field (type
, f
))
8113 const gdb_byte
*field_valaddr
= valaddr
;
8114 CORE_ADDR field_address
= address
;
8115 struct type
*field_type
=
8116 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8120 /* rtype's length is computed based on the run-time
8121 value of discriminants. If the discriminants are not
8122 initialized, the type size may be completely bogus and
8123 GDB may fail to allocate a value for it. So check the
8124 size first before creating the value. */
8125 ada_ensure_varsize_limit (rtype
);
8126 /* Using plain value_from_contents_and_address here
8127 causes problems because we will end up trying to
8128 resolve a type that is currently being
8130 dval
= value_from_contents_and_address_unresolved (rtype
,
8133 rtype
= value_type (dval
);
8138 /* If the type referenced by this field is an aligner type, we need
8139 to unwrap that aligner type, because its size might not be set.
8140 Keeping the aligner type would cause us to compute the wrong
8141 size for this field, impacting the offset of the all the fields
8142 that follow this one. */
8143 if (ada_is_aligner_type (field_type
))
8145 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8147 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8148 field_address
= cond_offset_target (field_address
, field_offset
);
8149 field_type
= ada_aligned_type (field_type
);
8152 field_valaddr
= cond_offset_host (field_valaddr
,
8153 off
/ TARGET_CHAR_BIT
);
8154 field_address
= cond_offset_target (field_address
,
8155 off
/ TARGET_CHAR_BIT
);
8157 /* Get the fixed type of the field. Note that, in this case,
8158 we do not want to get the real type out of the tag: if
8159 the current field is the parent part of a tagged record,
8160 we will get the tag of the object. Clearly wrong: the real
8161 type of the parent is not the real type of the child. We
8162 would end up in an infinite loop. */
8163 field_type
= ada_get_base_type (field_type
);
8164 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8165 field_address
, dval
, 0);
8166 /* If the field size is already larger than the maximum
8167 object size, then the record itself will necessarily
8168 be larger than the maximum object size. We need to make
8169 this check now, because the size might be so ridiculously
8170 large (due to an uninitialized variable in the inferior)
8171 that it would cause an overflow when adding it to the
8173 ada_ensure_varsize_limit (field_type
);
8175 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8176 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8177 /* The multiplication can potentially overflow. But because
8178 the field length has been size-checked just above, and
8179 assuming that the maximum size is a reasonable value,
8180 an overflow should not happen in practice. So rather than
8181 adding overflow recovery code to this already complex code,
8182 we just assume that it's not going to happen. */
8184 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8188 /* Note: If this field's type is a typedef, it is important
8189 to preserve the typedef layer.
8191 Otherwise, we might be transforming a typedef to a fat
8192 pointer (encoding a pointer to an unconstrained array),
8193 into a basic fat pointer (encoding an unconstrained
8194 array). As both types are implemented using the same
8195 structure, the typedef is the only clue which allows us
8196 to distinguish between the two options. Stripping it
8197 would prevent us from printing this field appropriately. */
8198 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8199 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8200 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8202 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8205 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8207 /* We need to be careful of typedefs when computing
8208 the length of our field. If this is a typedef,
8209 get the length of the target type, not the length
8211 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8212 field_type
= ada_typedef_target_type (field_type
);
8215 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8218 if (off
+ fld_bit_len
> bit_len
)
8219 bit_len
= off
+ fld_bit_len
;
8221 TYPE_LENGTH (rtype
) =
8222 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8225 /* We handle the variant part, if any, at the end because of certain
8226 odd cases in which it is re-ordered so as NOT to be the last field of
8227 the record. This can happen in the presence of representation
8229 if (variant_field
>= 0)
8231 struct type
*branch_type
;
8233 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8237 /* Using plain value_from_contents_and_address here causes
8238 problems because we will end up trying to resolve a type
8239 that is currently being constructed. */
8240 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8242 rtype
= value_type (dval
);
8248 to_fixed_variant_branch_type
8249 (TYPE_FIELD_TYPE (type
, variant_field
),
8250 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8251 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8252 if (branch_type
== NULL
)
8254 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8255 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8256 TYPE_NFIELDS (rtype
) -= 1;
8260 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8261 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8263 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8265 if (off
+ fld_bit_len
> bit_len
)
8266 bit_len
= off
+ fld_bit_len
;
8267 TYPE_LENGTH (rtype
) =
8268 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8272 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8273 should contain the alignment of that record, which should be a strictly
8274 positive value. If null or negative, then something is wrong, most
8275 probably in the debug info. In that case, we don't round up the size
8276 of the resulting type. If this record is not part of another structure,
8277 the current RTYPE length might be good enough for our purposes. */
8278 if (TYPE_LENGTH (type
) <= 0)
8280 if (TYPE_NAME (rtype
))
8281 warning (_("Invalid type size for `%s' detected: %s."),
8282 TYPE_NAME (rtype
), pulongest (TYPE_LENGTH (type
)));
8284 warning (_("Invalid type size for <unnamed> detected: %s."),
8285 pulongest (TYPE_LENGTH (type
)));
8289 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
8290 TYPE_LENGTH (type
));
8293 value_free_to_mark (mark
);
8294 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8295 error (_("record type with dynamic size is larger than varsize-limit"));
8299 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8302 static struct type
*
8303 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8304 CORE_ADDR address
, struct value
*dval0
)
8306 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8310 /* An ordinary record type in which ___XVL-convention fields and
8311 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8312 static approximations, containing all possible fields. Uses
8313 no runtime values. Useless for use in values, but that's OK,
8314 since the results are used only for type determinations. Works on both
8315 structs and unions. Representation note: to save space, we memorize
8316 the result of this function in the TYPE_TARGET_TYPE of the
8319 static struct type
*
8320 template_to_static_fixed_type (struct type
*type0
)
8326 /* No need no do anything if the input type is already fixed. */
8327 if (TYPE_FIXED_INSTANCE (type0
))
8330 /* Likewise if we already have computed the static approximation. */
8331 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8332 return TYPE_TARGET_TYPE (type0
);
8334 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8336 nfields
= TYPE_NFIELDS (type0
);
8338 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8339 recompute all over next time. */
8340 TYPE_TARGET_TYPE (type0
) = type
;
8342 for (f
= 0; f
< nfields
; f
+= 1)
8344 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8345 struct type
*new_type
;
8347 if (is_dynamic_field (type0
, f
))
8349 field_type
= ada_check_typedef (field_type
);
8350 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8353 new_type
= static_unwrap_type (field_type
);
8355 if (new_type
!= field_type
)
8357 /* Clone TYPE0 only the first time we get a new field type. */
8360 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8361 TYPE_CODE (type
) = TYPE_CODE (type0
);
8362 INIT_NONE_SPECIFIC (type
);
8363 TYPE_NFIELDS (type
) = nfields
;
8364 TYPE_FIELDS (type
) = (struct field
*)
8365 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8366 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8367 sizeof (struct field
) * nfields
);
8368 TYPE_NAME (type
) = ada_type_name (type0
);
8369 TYPE_FIXED_INSTANCE (type
) = 1;
8370 TYPE_LENGTH (type
) = 0;
8372 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8373 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8380 /* Given an object of type TYPE whose contents are at VALADDR and
8381 whose address in memory is ADDRESS, returns a revision of TYPE,
8382 which should be a non-dynamic-sized record, in which the variant
8383 part, if any, is replaced with the appropriate branch. Looks
8384 for discriminant values in DVAL0, which can be NULL if the record
8385 contains the necessary discriminant values. */
8387 static struct type
*
8388 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8389 CORE_ADDR address
, struct value
*dval0
)
8391 struct value
*mark
= value_mark ();
8394 struct type
*branch_type
;
8395 int nfields
= TYPE_NFIELDS (type
);
8396 int variant_field
= variant_field_index (type
);
8398 if (variant_field
== -1)
8403 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8404 type
= value_type (dval
);
8409 rtype
= alloc_type_copy (type
);
8410 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8411 INIT_NONE_SPECIFIC (rtype
);
8412 TYPE_NFIELDS (rtype
) = nfields
;
8413 TYPE_FIELDS (rtype
) =
8414 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8415 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8416 sizeof (struct field
) * nfields
);
8417 TYPE_NAME (rtype
) = ada_type_name (type
);
8418 TYPE_FIXED_INSTANCE (rtype
) = 1;
8419 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8421 branch_type
= to_fixed_variant_branch_type
8422 (TYPE_FIELD_TYPE (type
, variant_field
),
8423 cond_offset_host (valaddr
,
8424 TYPE_FIELD_BITPOS (type
, variant_field
)
8426 cond_offset_target (address
,
8427 TYPE_FIELD_BITPOS (type
, variant_field
)
8428 / TARGET_CHAR_BIT
), dval
);
8429 if (branch_type
== NULL
)
8433 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8434 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8435 TYPE_NFIELDS (rtype
) -= 1;
8439 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8440 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8441 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8442 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8444 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8446 value_free_to_mark (mark
);
8450 /* An ordinary record type (with fixed-length fields) that describes
8451 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8452 beginning of this section]. Any necessary discriminants' values
8453 should be in DVAL, a record value; it may be NULL if the object
8454 at ADDR itself contains any necessary discriminant values.
8455 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8456 values from the record are needed. Except in the case that DVAL,
8457 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8458 unchecked) is replaced by a particular branch of the variant.
8460 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8461 is questionable and may be removed. It can arise during the
8462 processing of an unconstrained-array-of-record type where all the
8463 variant branches have exactly the same size. This is because in
8464 such cases, the compiler does not bother to use the XVS convention
8465 when encoding the record. I am currently dubious of this
8466 shortcut and suspect the compiler should be altered. FIXME. */
8468 static struct type
*
8469 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8470 CORE_ADDR address
, struct value
*dval
)
8472 struct type
*templ_type
;
8474 if (TYPE_FIXED_INSTANCE (type0
))
8477 templ_type
= dynamic_template_type (type0
);
8479 if (templ_type
!= NULL
)
8480 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8481 else if (variant_field_index (type0
) >= 0)
8483 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8485 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8490 TYPE_FIXED_INSTANCE (type0
) = 1;
8496 /* An ordinary record type (with fixed-length fields) that describes
8497 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8498 union type. Any necessary discriminants' values should be in DVAL,
8499 a record value. That is, this routine selects the appropriate
8500 branch of the union at ADDR according to the discriminant value
8501 indicated in the union's type name. Returns VAR_TYPE0 itself if
8502 it represents a variant subject to a pragma Unchecked_Union. */
8504 static struct type
*
8505 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8506 CORE_ADDR address
, struct value
*dval
)
8509 struct type
*templ_type
;
8510 struct type
*var_type
;
8512 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8513 var_type
= TYPE_TARGET_TYPE (var_type0
);
8515 var_type
= var_type0
;
8517 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8519 if (templ_type
!= NULL
)
8520 var_type
= templ_type
;
8522 if (is_unchecked_variant (var_type
, value_type (dval
)))
8524 which
= ada_which_variant_applies (var_type
, dval
);
8527 return empty_record (var_type
);
8528 else if (is_dynamic_field (var_type
, which
))
8529 return to_fixed_record_type
8530 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8531 valaddr
, address
, dval
);
8532 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8534 to_fixed_record_type
8535 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8537 return TYPE_FIELD_TYPE (var_type
, which
);
8540 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8541 ENCODING_TYPE, a type following the GNAT conventions for discrete
8542 type encodings, only carries redundant information. */
8545 ada_is_redundant_range_encoding (struct type
*range_type
,
8546 struct type
*encoding_type
)
8548 const char *bounds_str
;
8552 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8554 if (TYPE_CODE (get_base_type (range_type
))
8555 != TYPE_CODE (get_base_type (encoding_type
)))
8557 /* The compiler probably used a simple base type to describe
8558 the range type instead of the range's actual base type,
8559 expecting us to get the real base type from the encoding
8560 anyway. In this situation, the encoding cannot be ignored
8565 if (is_dynamic_type (range_type
))
8568 if (TYPE_NAME (encoding_type
) == NULL
)
8571 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8572 if (bounds_str
== NULL
)
8575 n
= 8; /* Skip "___XDLU_". */
8576 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8578 if (TYPE_LOW_BOUND (range_type
) != lo
)
8581 n
+= 2; /* Skip the "__" separator between the two bounds. */
8582 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8584 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8590 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8591 a type following the GNAT encoding for describing array type
8592 indices, only carries redundant information. */
8595 ada_is_redundant_index_type_desc (struct type
*array_type
,
8596 struct type
*desc_type
)
8598 struct type
*this_layer
= check_typedef (array_type
);
8601 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8603 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8604 TYPE_FIELD_TYPE (desc_type
, i
)))
8606 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8612 /* Assuming that TYPE0 is an array type describing the type of a value
8613 at ADDR, and that DVAL describes a record containing any
8614 discriminants used in TYPE0, returns a type for the value that
8615 contains no dynamic components (that is, no components whose sizes
8616 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8617 true, gives an error message if the resulting type's size is over
8620 static struct type
*
8621 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8624 struct type
*index_type_desc
;
8625 struct type
*result
;
8626 int constrained_packed_array_p
;
8627 static const char *xa_suffix
= "___XA";
8629 type0
= ada_check_typedef (type0
);
8630 if (TYPE_FIXED_INSTANCE (type0
))
8633 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8634 if (constrained_packed_array_p
)
8635 type0
= decode_constrained_packed_array_type (type0
);
8637 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8639 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8640 encoding suffixed with 'P' may still be generated. If so,
8641 it should be used to find the XA type. */
8643 if (index_type_desc
== NULL
)
8645 const char *type_name
= ada_type_name (type0
);
8647 if (type_name
!= NULL
)
8649 const int len
= strlen (type_name
);
8650 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8652 if (type_name
[len
- 1] == 'P')
8654 strcpy (name
, type_name
);
8655 strcpy (name
+ len
- 1, xa_suffix
);
8656 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8661 ada_fixup_array_indexes_type (index_type_desc
);
8662 if (index_type_desc
!= NULL
8663 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8665 /* Ignore this ___XA parallel type, as it does not bring any
8666 useful information. This allows us to avoid creating fixed
8667 versions of the array's index types, which would be identical
8668 to the original ones. This, in turn, can also help avoid
8669 the creation of fixed versions of the array itself. */
8670 index_type_desc
= NULL
;
8673 if (index_type_desc
== NULL
)
8675 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8677 /* NOTE: elt_type---the fixed version of elt_type0---should never
8678 depend on the contents of the array in properly constructed
8680 /* Create a fixed version of the array element type.
8681 We're not providing the address of an element here,
8682 and thus the actual object value cannot be inspected to do
8683 the conversion. This should not be a problem, since arrays of
8684 unconstrained objects are not allowed. In particular, all
8685 the elements of an array of a tagged type should all be of
8686 the same type specified in the debugging info. No need to
8687 consult the object tag. */
8688 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8690 /* Make sure we always create a new array type when dealing with
8691 packed array types, since we're going to fix-up the array
8692 type length and element bitsize a little further down. */
8693 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8696 result
= create_array_type (alloc_type_copy (type0
),
8697 elt_type
, TYPE_INDEX_TYPE (type0
));
8702 struct type
*elt_type0
;
8705 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8706 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8708 /* NOTE: result---the fixed version of elt_type0---should never
8709 depend on the contents of the array in properly constructed
8711 /* Create a fixed version of the array element type.
8712 We're not providing the address of an element here,
8713 and thus the actual object value cannot be inspected to do
8714 the conversion. This should not be a problem, since arrays of
8715 unconstrained objects are not allowed. In particular, all
8716 the elements of an array of a tagged type should all be of
8717 the same type specified in the debugging info. No need to
8718 consult the object tag. */
8720 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8723 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8725 struct type
*range_type
=
8726 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8728 result
= create_array_type (alloc_type_copy (elt_type0
),
8729 result
, range_type
);
8730 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8732 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8733 error (_("array type with dynamic size is larger than varsize-limit"));
8736 /* We want to preserve the type name. This can be useful when
8737 trying to get the type name of a value that has already been
8738 printed (for instance, if the user did "print VAR; whatis $". */
8739 TYPE_NAME (result
) = TYPE_NAME (type0
);
8741 if (constrained_packed_array_p
)
8743 /* So far, the resulting type has been created as if the original
8744 type was a regular (non-packed) array type. As a result, the
8745 bitsize of the array elements needs to be set again, and the array
8746 length needs to be recomputed based on that bitsize. */
8747 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8748 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8750 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8751 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8752 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8753 TYPE_LENGTH (result
)++;
8756 TYPE_FIXED_INSTANCE (result
) = 1;
8761 /* A standard type (containing no dynamically sized components)
8762 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8763 DVAL describes a record containing any discriminants used in TYPE0,
8764 and may be NULL if there are none, or if the object of type TYPE at
8765 ADDRESS or in VALADDR contains these discriminants.
8767 If CHECK_TAG is not null, in the case of tagged types, this function
8768 attempts to locate the object's tag and use it to compute the actual
8769 type. However, when ADDRESS is null, we cannot use it to determine the
8770 location of the tag, and therefore compute the tagged type's actual type.
8771 So we return the tagged type without consulting the tag. */
8773 static struct type
*
8774 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8775 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8777 type
= ada_check_typedef (type
);
8779 /* Only un-fixed types need to be handled here. */
8780 if (!HAVE_GNAT_AUX_INFO (type
))
8783 switch (TYPE_CODE (type
))
8787 case TYPE_CODE_STRUCT
:
8789 struct type
*static_type
= to_static_fixed_type (type
);
8790 struct type
*fixed_record_type
=
8791 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8793 /* If STATIC_TYPE is a tagged type and we know the object's address,
8794 then we can determine its tag, and compute the object's actual
8795 type from there. Note that we have to use the fixed record
8796 type (the parent part of the record may have dynamic fields
8797 and the way the location of _tag is expressed may depend on
8800 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8803 value_tag_from_contents_and_address
8807 struct type
*real_type
= type_from_tag (tag
);
8809 value_from_contents_and_address (fixed_record_type
,
8812 fixed_record_type
= value_type (obj
);
8813 if (real_type
!= NULL
)
8814 return to_fixed_record_type
8816 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8819 /* Check to see if there is a parallel ___XVZ variable.
8820 If there is, then it provides the actual size of our type. */
8821 else if (ada_type_name (fixed_record_type
) != NULL
)
8823 const char *name
= ada_type_name (fixed_record_type
);
8825 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8826 bool xvz_found
= false;
8829 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8832 xvz_found
= get_int_var_value (xvz_name
, size
);
8834 catch (const gdb_exception_error
&except
)
8836 /* We found the variable, but somehow failed to read
8837 its value. Rethrow the same error, but with a little
8838 bit more information, to help the user understand
8839 what went wrong (Eg: the variable might have been
8841 throw_error (except
.error
,
8842 _("unable to read value of %s (%s)"),
8843 xvz_name
, except
.what ());
8846 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8848 fixed_record_type
= copy_type (fixed_record_type
);
8849 TYPE_LENGTH (fixed_record_type
) = size
;
8851 /* The FIXED_RECORD_TYPE may have be a stub. We have
8852 observed this when the debugging info is STABS, and
8853 apparently it is something that is hard to fix.
8855 In practice, we don't need the actual type definition
8856 at all, because the presence of the XVZ variable allows us
8857 to assume that there must be a XVS type as well, which we
8858 should be able to use later, when we need the actual type
8861 In the meantime, pretend that the "fixed" type we are
8862 returning is NOT a stub, because this can cause trouble
8863 when using this type to create new types targeting it.
8864 Indeed, the associated creation routines often check
8865 whether the target type is a stub and will try to replace
8866 it, thus using a type with the wrong size. This, in turn,
8867 might cause the new type to have the wrong size too.
8868 Consider the case of an array, for instance, where the size
8869 of the array is computed from the number of elements in
8870 our array multiplied by the size of its element. */
8871 TYPE_STUB (fixed_record_type
) = 0;
8874 return fixed_record_type
;
8876 case TYPE_CODE_ARRAY
:
8877 return to_fixed_array_type (type
, dval
, 1);
8878 case TYPE_CODE_UNION
:
8882 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8886 /* The same as ada_to_fixed_type_1, except that it preserves the type
8887 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8889 The typedef layer needs be preserved in order to differentiate between
8890 arrays and array pointers when both types are implemented using the same
8891 fat pointer. In the array pointer case, the pointer is encoded as
8892 a typedef of the pointer type. For instance, considering:
8894 type String_Access is access String;
8895 S1 : String_Access := null;
8897 To the debugger, S1 is defined as a typedef of type String. But
8898 to the user, it is a pointer. So if the user tries to print S1,
8899 we should not dereference the array, but print the array address
8902 If we didn't preserve the typedef layer, we would lose the fact that
8903 the type is to be presented as a pointer (needs de-reference before
8904 being printed). And we would also use the source-level type name. */
8907 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8908 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8911 struct type
*fixed_type
=
8912 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8914 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8915 then preserve the typedef layer.
8917 Implementation note: We can only check the main-type portion of
8918 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8919 from TYPE now returns a type that has the same instance flags
8920 as TYPE. For instance, if TYPE is a "typedef const", and its
8921 target type is a "struct", then the typedef elimination will return
8922 a "const" version of the target type. See check_typedef for more
8923 details about how the typedef layer elimination is done.
8925 brobecker/2010-11-19: It seems to me that the only case where it is
8926 useful to preserve the typedef layer is when dealing with fat pointers.
8927 Perhaps, we could add a check for that and preserve the typedef layer
8928 only in that situation. But this seems unnecessary so far, probably
8929 because we call check_typedef/ada_check_typedef pretty much everywhere.
8931 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8932 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8933 == TYPE_MAIN_TYPE (fixed_type
)))
8939 /* A standard (static-sized) type corresponding as well as possible to
8940 TYPE0, but based on no runtime data. */
8942 static struct type
*
8943 to_static_fixed_type (struct type
*type0
)
8950 if (TYPE_FIXED_INSTANCE (type0
))
8953 type0
= ada_check_typedef (type0
);
8955 switch (TYPE_CODE (type0
))
8959 case TYPE_CODE_STRUCT
:
8960 type
= dynamic_template_type (type0
);
8962 return template_to_static_fixed_type (type
);
8964 return template_to_static_fixed_type (type0
);
8965 case TYPE_CODE_UNION
:
8966 type
= ada_find_parallel_type (type0
, "___XVU");
8968 return template_to_static_fixed_type (type
);
8970 return template_to_static_fixed_type (type0
);
8974 /* A static approximation of TYPE with all type wrappers removed. */
8976 static struct type
*
8977 static_unwrap_type (struct type
*type
)
8979 if (ada_is_aligner_type (type
))
8981 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8982 if (ada_type_name (type1
) == NULL
)
8983 TYPE_NAME (type1
) = ada_type_name (type
);
8985 return static_unwrap_type (type1
);
8989 struct type
*raw_real_type
= ada_get_base_type (type
);
8991 if (raw_real_type
== type
)
8994 return to_static_fixed_type (raw_real_type
);
8998 /* In some cases, incomplete and private types require
8999 cross-references that are not resolved as records (for example,
9001 type FooP is access Foo;
9003 type Foo is array ...;
9004 ). In these cases, since there is no mechanism for producing
9005 cross-references to such types, we instead substitute for FooP a
9006 stub enumeration type that is nowhere resolved, and whose tag is
9007 the name of the actual type. Call these types "non-record stubs". */
9009 /* A type equivalent to TYPE that is not a non-record stub, if one
9010 exists, otherwise TYPE. */
9013 ada_check_typedef (struct type
*type
)
9018 /* If our type is an access to an unconstrained array, which is encoded
9019 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
9020 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9021 what allows us to distinguish between fat pointers that represent
9022 array types, and fat pointers that represent array access types
9023 (in both cases, the compiler implements them as fat pointers). */
9024 if (ada_is_access_to_unconstrained_array (type
))
9027 type
= check_typedef (type
);
9028 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
9029 || !TYPE_STUB (type
)
9030 || TYPE_NAME (type
) == NULL
)
9034 const char *name
= TYPE_NAME (type
);
9035 struct type
*type1
= ada_find_any_type (name
);
9040 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9041 stubs pointing to arrays, as we don't create symbols for array
9042 types, only for the typedef-to-array types). If that's the case,
9043 strip the typedef layer. */
9044 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
9045 type1
= ada_check_typedef (type1
);
9051 /* A value representing the data at VALADDR/ADDRESS as described by
9052 type TYPE0, but with a standard (static-sized) type that correctly
9053 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9054 type, then return VAL0 [this feature is simply to avoid redundant
9055 creation of struct values]. */
9057 static struct value
*
9058 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
9061 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
9063 if (type
== type0
&& val0
!= NULL
)
9066 if (VALUE_LVAL (val0
) != lval_memory
)
9068 /* Our value does not live in memory; it could be a convenience
9069 variable, for instance. Create a not_lval value using val0's
9071 return value_from_contents (type
, value_contents (val0
));
9074 return value_from_contents_and_address (type
, 0, address
);
9077 /* A value representing VAL, but with a standard (static-sized) type
9078 that correctly describes it. Does not necessarily create a new
9082 ada_to_fixed_value (struct value
*val
)
9084 val
= unwrap_value (val
);
9085 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
9092 /* Table mapping attribute numbers to names.
9093 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9095 static const char *attribute_names
[] = {
9113 ada_attribute_name (enum exp_opcode n
)
9115 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9116 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9118 return attribute_names
[0];
9121 /* Evaluate the 'POS attribute applied to ARG. */
9124 pos_atr (struct value
*arg
)
9126 struct value
*val
= coerce_ref (arg
);
9127 struct type
*type
= value_type (val
);
9130 if (!discrete_type_p (type
))
9131 error (_("'POS only defined on discrete types"));
9133 if (!discrete_position (type
, value_as_long (val
), &result
))
9134 error (_("enumeration value is invalid: can't find 'POS"));
9139 static struct value
*
9140 value_pos_atr (struct type
*type
, struct value
*arg
)
9142 return value_from_longest (type
, pos_atr (arg
));
9145 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9147 static struct value
*
9148 value_val_atr (struct type
*type
, struct value
*arg
)
9150 if (!discrete_type_p (type
))
9151 error (_("'VAL only defined on discrete types"));
9152 if (!integer_type_p (value_type (arg
)))
9153 error (_("'VAL requires integral argument"));
9155 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
9157 long pos
= value_as_long (arg
);
9159 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
9160 error (_("argument to 'VAL out of range"));
9161 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
9164 return value_from_longest (type
, value_as_long (arg
));
9170 /* True if TYPE appears to be an Ada character type.
9171 [At the moment, this is true only for Character and Wide_Character;
9172 It is a heuristic test that could stand improvement]. */
9175 ada_is_character_type (struct type
*type
)
9179 /* If the type code says it's a character, then assume it really is,
9180 and don't check any further. */
9181 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
9184 /* Otherwise, assume it's a character type iff it is a discrete type
9185 with a known character type name. */
9186 name
= ada_type_name (type
);
9187 return (name
!= NULL
9188 && (TYPE_CODE (type
) == TYPE_CODE_INT
9189 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9190 && (strcmp (name
, "character") == 0
9191 || strcmp (name
, "wide_character") == 0
9192 || strcmp (name
, "wide_wide_character") == 0
9193 || strcmp (name
, "unsigned char") == 0));
9196 /* True if TYPE appears to be an Ada string type. */
9199 ada_is_string_type (struct type
*type
)
9201 type
= ada_check_typedef (type
);
9203 && TYPE_CODE (type
) != TYPE_CODE_PTR
9204 && (ada_is_simple_array_type (type
)
9205 || ada_is_array_descriptor_type (type
))
9206 && ada_array_arity (type
) == 1)
9208 struct type
*elttype
= ada_array_element_type (type
, 1);
9210 return ada_is_character_type (elttype
);
9216 /* The compiler sometimes provides a parallel XVS type for a given
9217 PAD type. Normally, it is safe to follow the PAD type directly,
9218 but older versions of the compiler have a bug that causes the offset
9219 of its "F" field to be wrong. Following that field in that case
9220 would lead to incorrect results, but this can be worked around
9221 by ignoring the PAD type and using the associated XVS type instead.
9223 Set to True if the debugger should trust the contents of PAD types.
9224 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9225 static bool trust_pad_over_xvs
= true;
9227 /* True if TYPE is a struct type introduced by the compiler to force the
9228 alignment of a value. Such types have a single field with a
9229 distinctive name. */
9232 ada_is_aligner_type (struct type
*type
)
9234 type
= ada_check_typedef (type
);
9236 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9239 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9240 && TYPE_NFIELDS (type
) == 1
9241 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9244 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9245 the parallel type. */
9248 ada_get_base_type (struct type
*raw_type
)
9250 struct type
*real_type_namer
;
9251 struct type
*raw_real_type
;
9253 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9256 if (ada_is_aligner_type (raw_type
))
9257 /* The encoding specifies that we should always use the aligner type.
9258 So, even if this aligner type has an associated XVS type, we should
9261 According to the compiler gurus, an XVS type parallel to an aligner
9262 type may exist because of a stabs limitation. In stabs, aligner
9263 types are empty because the field has a variable-sized type, and
9264 thus cannot actually be used as an aligner type. As a result,
9265 we need the associated parallel XVS type to decode the type.
9266 Since the policy in the compiler is to not change the internal
9267 representation based on the debugging info format, we sometimes
9268 end up having a redundant XVS type parallel to the aligner type. */
9271 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9272 if (real_type_namer
== NULL
9273 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9274 || TYPE_NFIELDS (real_type_namer
) != 1)
9277 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9279 /* This is an older encoding form where the base type needs to be
9280 looked up by name. We prefer the newer encoding because it is
9282 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9283 if (raw_real_type
== NULL
)
9286 return raw_real_type
;
9289 /* The field in our XVS type is a reference to the base type. */
9290 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9293 /* The type of value designated by TYPE, with all aligners removed. */
9296 ada_aligned_type (struct type
*type
)
9298 if (ada_is_aligner_type (type
))
9299 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9301 return ada_get_base_type (type
);
9305 /* The address of the aligned value in an object at address VALADDR
9306 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9309 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9311 if (ada_is_aligner_type (type
))
9312 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9314 TYPE_FIELD_BITPOS (type
,
9315 0) / TARGET_CHAR_BIT
);
9322 /* The printed representation of an enumeration literal with encoded
9323 name NAME. The value is good to the next call of ada_enum_name. */
9325 ada_enum_name (const char *name
)
9327 static char *result
;
9328 static size_t result_len
= 0;
9331 /* First, unqualify the enumeration name:
9332 1. Search for the last '.' character. If we find one, then skip
9333 all the preceding characters, the unqualified name starts
9334 right after that dot.
9335 2. Otherwise, we may be debugging on a target where the compiler
9336 translates dots into "__". Search forward for double underscores,
9337 but stop searching when we hit an overloading suffix, which is
9338 of the form "__" followed by digits. */
9340 tmp
= strrchr (name
, '.');
9345 while ((tmp
= strstr (name
, "__")) != NULL
)
9347 if (isdigit (tmp
[2]))
9358 if (name
[1] == 'U' || name
[1] == 'W')
9360 if (sscanf (name
+ 2, "%x", &v
) != 1)
9363 else if (((name
[1] >= '0' && name
[1] <= '9')
9364 || (name
[1] >= 'a' && name
[1] <= 'z'))
9367 GROW_VECT (result
, result_len
, 4);
9368 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9374 GROW_VECT (result
, result_len
, 16);
9375 if (isascii (v
) && isprint (v
))
9376 xsnprintf (result
, result_len
, "'%c'", v
);
9377 else if (name
[1] == 'U')
9378 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9380 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9386 tmp
= strstr (name
, "__");
9388 tmp
= strstr (name
, "$");
9391 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9392 strncpy (result
, name
, tmp
- name
);
9393 result
[tmp
- name
] = '\0';
9401 /* Evaluate the subexpression of EXP starting at *POS as for
9402 evaluate_type, updating *POS to point just past the evaluated
9405 static struct value
*
9406 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9408 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9411 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9414 static struct value
*
9415 unwrap_value (struct value
*val
)
9417 struct type
*type
= ada_check_typedef (value_type (val
));
9419 if (ada_is_aligner_type (type
))
9421 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9422 struct type
*val_type
= ada_check_typedef (value_type (v
));
9424 if (ada_type_name (val_type
) == NULL
)
9425 TYPE_NAME (val_type
) = ada_type_name (type
);
9427 return unwrap_value (v
);
9431 struct type
*raw_real_type
=
9432 ada_check_typedef (ada_get_base_type (type
));
9434 /* If there is no parallel XVS or XVE type, then the value is
9435 already unwrapped. Return it without further modification. */
9436 if ((type
== raw_real_type
)
9437 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9441 coerce_unspec_val_to_type
9442 (val
, ada_to_fixed_type (raw_real_type
, 0,
9443 value_address (val
),
9448 static struct value
*
9449 cast_from_fixed (struct type
*type
, struct value
*arg
)
9451 struct value
*scale
= ada_scaling_factor (value_type (arg
));
9452 arg
= value_cast (value_type (scale
), arg
);
9454 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9455 return value_cast (type
, arg
);
9458 static struct value
*
9459 cast_to_fixed (struct type
*type
, struct value
*arg
)
9461 if (type
== value_type (arg
))
9464 struct value
*scale
= ada_scaling_factor (type
);
9465 if (ada_is_fixed_point_type (value_type (arg
)))
9466 arg
= cast_from_fixed (value_type (scale
), arg
);
9468 arg
= value_cast (value_type (scale
), arg
);
9470 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9471 return value_cast (type
, arg
);
9474 /* Given two array types T1 and T2, return nonzero iff both arrays
9475 contain the same number of elements. */
9478 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9480 LONGEST lo1
, hi1
, lo2
, hi2
;
9482 /* Get the array bounds in order to verify that the size of
9483 the two arrays match. */
9484 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9485 || !get_array_bounds (t2
, &lo2
, &hi2
))
9486 error (_("unable to determine array bounds"));
9488 /* To make things easier for size comparison, normalize a bit
9489 the case of empty arrays by making sure that the difference
9490 between upper bound and lower bound is always -1. */
9496 return (hi1
- lo1
== hi2
- lo2
);
9499 /* Assuming that VAL is an array of integrals, and TYPE represents
9500 an array with the same number of elements, but with wider integral
9501 elements, return an array "casted" to TYPE. In practice, this
9502 means that the returned array is built by casting each element
9503 of the original array into TYPE's (wider) element type. */
9505 static struct value
*
9506 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9508 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9513 /* Verify that both val and type are arrays of scalars, and
9514 that the size of val's elements is smaller than the size
9515 of type's element. */
9516 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9517 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9518 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9519 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9520 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9521 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9523 if (!get_array_bounds (type
, &lo
, &hi
))
9524 error (_("unable to determine array bounds"));
9526 res
= allocate_value (type
);
9528 /* Promote each array element. */
9529 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9531 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9533 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9534 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9540 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9541 return the converted value. */
9543 static struct value
*
9544 coerce_for_assign (struct type
*type
, struct value
*val
)
9546 struct type
*type2
= value_type (val
);
9551 type2
= ada_check_typedef (type2
);
9552 type
= ada_check_typedef (type
);
9554 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9555 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9557 val
= ada_value_ind (val
);
9558 type2
= value_type (val
);
9561 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9562 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9564 if (!ada_same_array_size_p (type
, type2
))
9565 error (_("cannot assign arrays of different length"));
9567 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9568 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9569 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9570 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9572 /* Allow implicit promotion of the array elements to
9574 return ada_promote_array_of_integrals (type
, val
);
9577 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9578 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9579 error (_("Incompatible types in assignment"));
9580 deprecated_set_value_type (val
, type
);
9585 static struct value
*
9586 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9589 struct type
*type1
, *type2
;
9592 arg1
= coerce_ref (arg1
);
9593 arg2
= coerce_ref (arg2
);
9594 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9595 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9597 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9598 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9599 return value_binop (arg1
, arg2
, op
);
9608 return value_binop (arg1
, arg2
, op
);
9611 v2
= value_as_long (arg2
);
9613 error (_("second operand of %s must not be zero."), op_string (op
));
9615 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9616 return value_binop (arg1
, arg2
, op
);
9618 v1
= value_as_long (arg1
);
9623 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9624 v
+= v
> 0 ? -1 : 1;
9632 /* Should not reach this point. */
9636 val
= allocate_value (type1
);
9637 store_unsigned_integer (value_contents_raw (val
),
9638 TYPE_LENGTH (value_type (val
)),
9639 type_byte_order (type1
), v
);
9644 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9646 if (ada_is_direct_array_type (value_type (arg1
))
9647 || ada_is_direct_array_type (value_type (arg2
)))
9649 struct type
*arg1_type
, *arg2_type
;
9651 /* Automatically dereference any array reference before
9652 we attempt to perform the comparison. */
9653 arg1
= ada_coerce_ref (arg1
);
9654 arg2
= ada_coerce_ref (arg2
);
9656 arg1
= ada_coerce_to_simple_array (arg1
);
9657 arg2
= ada_coerce_to_simple_array (arg2
);
9659 arg1_type
= ada_check_typedef (value_type (arg1
));
9660 arg2_type
= ada_check_typedef (value_type (arg2
));
9662 if (TYPE_CODE (arg1_type
) != TYPE_CODE_ARRAY
9663 || TYPE_CODE (arg2_type
) != TYPE_CODE_ARRAY
)
9664 error (_("Attempt to compare array with non-array"));
9665 /* FIXME: The following works only for types whose
9666 representations use all bits (no padding or undefined bits)
9667 and do not have user-defined equality. */
9668 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9669 && memcmp (value_contents (arg1
), value_contents (arg2
),
9670 TYPE_LENGTH (arg1_type
)) == 0);
9672 return value_equal (arg1
, arg2
);
9675 /* Total number of component associations in the aggregate starting at
9676 index PC in EXP. Assumes that index PC is the start of an
9680 num_component_specs (struct expression
*exp
, int pc
)
9684 m
= exp
->elts
[pc
+ 1].longconst
;
9687 for (i
= 0; i
< m
; i
+= 1)
9689 switch (exp
->elts
[pc
].opcode
)
9695 n
+= exp
->elts
[pc
+ 1].longconst
;
9698 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9703 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9704 component of LHS (a simple array or a record), updating *POS past
9705 the expression, assuming that LHS is contained in CONTAINER. Does
9706 not modify the inferior's memory, nor does it modify LHS (unless
9707 LHS == CONTAINER). */
9710 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9711 struct expression
*exp
, int *pos
)
9713 struct value
*mark
= value_mark ();
9715 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9717 if (TYPE_CODE (lhs_type
) == TYPE_CODE_ARRAY
)
9719 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9720 struct value
*index_val
= value_from_longest (index_type
, index
);
9722 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9726 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9727 elt
= ada_to_fixed_value (elt
);
9730 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9731 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9733 value_assign_to_component (container
, elt
,
9734 ada_evaluate_subexp (NULL
, exp
, pos
,
9737 value_free_to_mark (mark
);
9740 /* Assuming that LHS represents an lvalue having a record or array
9741 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9742 of that aggregate's value to LHS, advancing *POS past the
9743 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9744 lvalue containing LHS (possibly LHS itself). Does not modify
9745 the inferior's memory, nor does it modify the contents of
9746 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9748 static struct value
*
9749 assign_aggregate (struct value
*container
,
9750 struct value
*lhs
, struct expression
*exp
,
9751 int *pos
, enum noside noside
)
9753 struct type
*lhs_type
;
9754 int n
= exp
->elts
[*pos
+1].longconst
;
9755 LONGEST low_index
, high_index
;
9758 int max_indices
, num_indices
;
9762 if (noside
!= EVAL_NORMAL
)
9764 for (i
= 0; i
< n
; i
+= 1)
9765 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9769 container
= ada_coerce_ref (container
);
9770 if (ada_is_direct_array_type (value_type (container
)))
9771 container
= ada_coerce_to_simple_array (container
);
9772 lhs
= ada_coerce_ref (lhs
);
9773 if (!deprecated_value_modifiable (lhs
))
9774 error (_("Left operand of assignment is not a modifiable lvalue."));
9776 lhs_type
= check_typedef (value_type (lhs
));
9777 if (ada_is_direct_array_type (lhs_type
))
9779 lhs
= ada_coerce_to_simple_array (lhs
);
9780 lhs_type
= check_typedef (value_type (lhs
));
9781 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9782 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9784 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9787 high_index
= num_visible_fields (lhs_type
) - 1;
9790 error (_("Left-hand side must be array or record."));
9792 num_specs
= num_component_specs (exp
, *pos
- 3);
9793 max_indices
= 4 * num_specs
+ 4;
9794 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9795 indices
[0] = indices
[1] = low_index
- 1;
9796 indices
[2] = indices
[3] = high_index
+ 1;
9799 for (i
= 0; i
< n
; i
+= 1)
9801 switch (exp
->elts
[*pos
].opcode
)
9804 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9805 &num_indices
, max_indices
,
9806 low_index
, high_index
);
9809 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9810 &num_indices
, max_indices
,
9811 low_index
, high_index
);
9815 error (_("Misplaced 'others' clause"));
9816 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9817 num_indices
, low_index
, high_index
);
9820 error (_("Internal error: bad aggregate clause"));
9827 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9828 construct at *POS, updating *POS past the construct, given that
9829 the positions are relative to lower bound LOW, where HIGH is the
9830 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9831 updating *NUM_INDICES as needed. CONTAINER is as for
9832 assign_aggregate. */
9834 aggregate_assign_positional (struct value
*container
,
9835 struct value
*lhs
, struct expression
*exp
,
9836 int *pos
, LONGEST
*indices
, int *num_indices
,
9837 int max_indices
, LONGEST low
, LONGEST high
)
9839 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9841 if (ind
- 1 == high
)
9842 warning (_("Extra components in aggregate ignored."));
9845 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9847 assign_component (container
, lhs
, ind
, exp
, pos
);
9850 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9853 /* Assign into the components of LHS indexed by the OP_CHOICES
9854 construct at *POS, updating *POS past the construct, given that
9855 the allowable indices are LOW..HIGH. Record the indices assigned
9856 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9857 needed. CONTAINER is as for assign_aggregate. */
9859 aggregate_assign_from_choices (struct value
*container
,
9860 struct value
*lhs
, struct expression
*exp
,
9861 int *pos
, LONGEST
*indices
, int *num_indices
,
9862 int max_indices
, LONGEST low
, LONGEST high
)
9865 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9866 int choice_pos
, expr_pc
;
9867 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9869 choice_pos
= *pos
+= 3;
9871 for (j
= 0; j
< n_choices
; j
+= 1)
9872 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9874 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9876 for (j
= 0; j
< n_choices
; j
+= 1)
9878 LONGEST lower
, upper
;
9879 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9881 if (op
== OP_DISCRETE_RANGE
)
9884 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9886 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9891 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9903 name
= &exp
->elts
[choice_pos
+ 2].string
;
9906 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9909 error (_("Invalid record component association."));
9911 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9913 if (! find_struct_field (name
, value_type (lhs
), 0,
9914 NULL
, NULL
, NULL
, NULL
, &ind
))
9915 error (_("Unknown component name: %s."), name
);
9916 lower
= upper
= ind
;
9919 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9920 error (_("Index in component association out of bounds."));
9922 add_component_interval (lower
, upper
, indices
, num_indices
,
9924 while (lower
<= upper
)
9929 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9935 /* Assign the value of the expression in the OP_OTHERS construct in
9936 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9937 have not been previously assigned. The index intervals already assigned
9938 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9939 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9941 aggregate_assign_others (struct value
*container
,
9942 struct value
*lhs
, struct expression
*exp
,
9943 int *pos
, LONGEST
*indices
, int num_indices
,
9944 LONGEST low
, LONGEST high
)
9947 int expr_pc
= *pos
+ 1;
9949 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9953 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9958 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9961 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9964 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9965 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9966 modifying *SIZE as needed. It is an error if *SIZE exceeds
9967 MAX_SIZE. The resulting intervals do not overlap. */
9969 add_component_interval (LONGEST low
, LONGEST high
,
9970 LONGEST
* indices
, int *size
, int max_size
)
9974 for (i
= 0; i
< *size
; i
+= 2) {
9975 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9979 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9980 if (high
< indices
[kh
])
9982 if (low
< indices
[i
])
9984 indices
[i
+ 1] = indices
[kh
- 1];
9985 if (high
> indices
[i
+ 1])
9986 indices
[i
+ 1] = high
;
9987 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9988 *size
-= kh
- i
- 2;
9991 else if (high
< indices
[i
])
9995 if (*size
== max_size
)
9996 error (_("Internal error: miscounted aggregate components."));
9998 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9999 indices
[j
] = indices
[j
- 2];
10001 indices
[i
+ 1] = high
;
10004 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10007 static struct value
*
10008 ada_value_cast (struct type
*type
, struct value
*arg2
)
10010 if (type
== ada_check_typedef (value_type (arg2
)))
10013 if (ada_is_fixed_point_type (type
))
10014 return cast_to_fixed (type
, arg2
);
10016 if (ada_is_fixed_point_type (value_type (arg2
)))
10017 return cast_from_fixed (type
, arg2
);
10019 return value_cast (type
, arg2
);
10022 /* Evaluating Ada expressions, and printing their result.
10023 ------------------------------------------------------
10028 We usually evaluate an Ada expression in order to print its value.
10029 We also evaluate an expression in order to print its type, which
10030 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10031 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10032 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10033 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10036 Evaluating expressions is a little more complicated for Ada entities
10037 than it is for entities in languages such as C. The main reason for
10038 this is that Ada provides types whose definition might be dynamic.
10039 One example of such types is variant records. Or another example
10040 would be an array whose bounds can only be known at run time.
10042 The following description is a general guide as to what should be
10043 done (and what should NOT be done) in order to evaluate an expression
10044 involving such types, and when. This does not cover how the semantic
10045 information is encoded by GNAT as this is covered separatly. For the
10046 document used as the reference for the GNAT encoding, see exp_dbug.ads
10047 in the GNAT sources.
10049 Ideally, we should embed each part of this description next to its
10050 associated code. Unfortunately, the amount of code is so vast right
10051 now that it's hard to see whether the code handling a particular
10052 situation might be duplicated or not. One day, when the code is
10053 cleaned up, this guide might become redundant with the comments
10054 inserted in the code, and we might want to remove it.
10056 2. ``Fixing'' an Entity, the Simple Case:
10057 -----------------------------------------
10059 When evaluating Ada expressions, the tricky issue is that they may
10060 reference entities whose type contents and size are not statically
10061 known. Consider for instance a variant record:
10063 type Rec (Empty : Boolean := True) is record
10066 when False => Value : Integer;
10069 Yes : Rec := (Empty => False, Value => 1);
10070 No : Rec := (empty => True);
10072 The size and contents of that record depends on the value of the
10073 descriminant (Rec.Empty). At this point, neither the debugging
10074 information nor the associated type structure in GDB are able to
10075 express such dynamic types. So what the debugger does is to create
10076 "fixed" versions of the type that applies to the specific object.
10077 We also informally refer to this operation as "fixing" an object,
10078 which means creating its associated fixed type.
10080 Example: when printing the value of variable "Yes" above, its fixed
10081 type would look like this:
10088 On the other hand, if we printed the value of "No", its fixed type
10095 Things become a little more complicated when trying to fix an entity
10096 with a dynamic type that directly contains another dynamic type,
10097 such as an array of variant records, for instance. There are
10098 two possible cases: Arrays, and records.
10100 3. ``Fixing'' Arrays:
10101 ---------------------
10103 The type structure in GDB describes an array in terms of its bounds,
10104 and the type of its elements. By design, all elements in the array
10105 have the same type and we cannot represent an array of variant elements
10106 using the current type structure in GDB. When fixing an array,
10107 we cannot fix the array element, as we would potentially need one
10108 fixed type per element of the array. As a result, the best we can do
10109 when fixing an array is to produce an array whose bounds and size
10110 are correct (allowing us to read it from memory), but without having
10111 touched its element type. Fixing each element will be done later,
10112 when (if) necessary.
10114 Arrays are a little simpler to handle than records, because the same
10115 amount of memory is allocated for each element of the array, even if
10116 the amount of space actually used by each element differs from element
10117 to element. Consider for instance the following array of type Rec:
10119 type Rec_Array is array (1 .. 2) of Rec;
10121 The actual amount of memory occupied by each element might be different
10122 from element to element, depending on the value of their discriminant.
10123 But the amount of space reserved for each element in the array remains
10124 fixed regardless. So we simply need to compute that size using
10125 the debugging information available, from which we can then determine
10126 the array size (we multiply the number of elements of the array by
10127 the size of each element).
10129 The simplest case is when we have an array of a constrained element
10130 type. For instance, consider the following type declarations:
10132 type Bounded_String (Max_Size : Integer) is
10134 Buffer : String (1 .. Max_Size);
10136 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10138 In this case, the compiler describes the array as an array of
10139 variable-size elements (identified by its XVS suffix) for which
10140 the size can be read in the parallel XVZ variable.
10142 In the case of an array of an unconstrained element type, the compiler
10143 wraps the array element inside a private PAD type. This type should not
10144 be shown to the user, and must be "unwrap"'ed before printing. Note
10145 that we also use the adjective "aligner" in our code to designate
10146 these wrapper types.
10148 In some cases, the size allocated for each element is statically
10149 known. In that case, the PAD type already has the correct size,
10150 and the array element should remain unfixed.
10152 But there are cases when this size is not statically known.
10153 For instance, assuming that "Five" is an integer variable:
10155 type Dynamic is array (1 .. Five) of Integer;
10156 type Wrapper (Has_Length : Boolean := False) is record
10159 when True => Length : Integer;
10160 when False => null;
10163 type Wrapper_Array is array (1 .. 2) of Wrapper;
10165 Hello : Wrapper_Array := (others => (Has_Length => True,
10166 Data => (others => 17),
10170 The debugging info would describe variable Hello as being an
10171 array of a PAD type. The size of that PAD type is not statically
10172 known, but can be determined using a parallel XVZ variable.
10173 In that case, a copy of the PAD type with the correct size should
10174 be used for the fixed array.
10176 3. ``Fixing'' record type objects:
10177 ----------------------------------
10179 Things are slightly different from arrays in the case of dynamic
10180 record types. In this case, in order to compute the associated
10181 fixed type, we need to determine the size and offset of each of
10182 its components. This, in turn, requires us to compute the fixed
10183 type of each of these components.
10185 Consider for instance the example:
10187 type Bounded_String (Max_Size : Natural) is record
10188 Str : String (1 .. Max_Size);
10191 My_String : Bounded_String (Max_Size => 10);
10193 In that case, the position of field "Length" depends on the size
10194 of field Str, which itself depends on the value of the Max_Size
10195 discriminant. In order to fix the type of variable My_String,
10196 we need to fix the type of field Str. Therefore, fixing a variant
10197 record requires us to fix each of its components.
10199 However, if a component does not have a dynamic size, the component
10200 should not be fixed. In particular, fields that use a PAD type
10201 should not fixed. Here is an example where this might happen
10202 (assuming type Rec above):
10204 type Container (Big : Boolean) is record
10208 when True => Another : Integer;
10209 when False => null;
10212 My_Container : Container := (Big => False,
10213 First => (Empty => True),
10216 In that example, the compiler creates a PAD type for component First,
10217 whose size is constant, and then positions the component After just
10218 right after it. The offset of component After is therefore constant
10221 The debugger computes the position of each field based on an algorithm
10222 that uses, among other things, the actual position and size of the field
10223 preceding it. Let's now imagine that the user is trying to print
10224 the value of My_Container. If the type fixing was recursive, we would
10225 end up computing the offset of field After based on the size of the
10226 fixed version of field First. And since in our example First has
10227 only one actual field, the size of the fixed type is actually smaller
10228 than the amount of space allocated to that field, and thus we would
10229 compute the wrong offset of field After.
10231 To make things more complicated, we need to watch out for dynamic
10232 components of variant records (identified by the ___XVL suffix in
10233 the component name). Even if the target type is a PAD type, the size
10234 of that type might not be statically known. So the PAD type needs
10235 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10236 we might end up with the wrong size for our component. This can be
10237 observed with the following type declarations:
10239 type Octal is new Integer range 0 .. 7;
10240 type Octal_Array is array (Positive range <>) of Octal;
10241 pragma Pack (Octal_Array);
10243 type Octal_Buffer (Size : Positive) is record
10244 Buffer : Octal_Array (1 .. Size);
10248 In that case, Buffer is a PAD type whose size is unset and needs
10249 to be computed by fixing the unwrapped type.
10251 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10252 ----------------------------------------------------------
10254 Lastly, when should the sub-elements of an entity that remained unfixed
10255 thus far, be actually fixed?
10257 The answer is: Only when referencing that element. For instance
10258 when selecting one component of a record, this specific component
10259 should be fixed at that point in time. Or when printing the value
10260 of a record, each component should be fixed before its value gets
10261 printed. Similarly for arrays, the element of the array should be
10262 fixed when printing each element of the array, or when extracting
10263 one element out of that array. On the other hand, fixing should
10264 not be performed on the elements when taking a slice of an array!
10266 Note that one of the side effects of miscomputing the offset and
10267 size of each field is that we end up also miscomputing the size
10268 of the containing type. This can have adverse results when computing
10269 the value of an entity. GDB fetches the value of an entity based
10270 on the size of its type, and thus a wrong size causes GDB to fetch
10271 the wrong amount of memory. In the case where the computed size is
10272 too small, GDB fetches too little data to print the value of our
10273 entity. Results in this case are unpredictable, as we usually read
10274 past the buffer containing the data =:-o. */
10276 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10277 for that subexpression cast to TO_TYPE. Advance *POS over the
10281 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10282 enum noside noside
, struct type
*to_type
)
10286 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10287 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10292 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10294 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10295 return value_zero (to_type
, not_lval
);
10297 val
= evaluate_var_msym_value (noside
,
10298 exp
->elts
[pc
+ 1].objfile
,
10299 exp
->elts
[pc
+ 2].msymbol
);
10302 val
= evaluate_var_value (noside
,
10303 exp
->elts
[pc
+ 1].block
,
10304 exp
->elts
[pc
+ 2].symbol
);
10306 if (noside
== EVAL_SKIP
)
10307 return eval_skip_value (exp
);
10309 val
= ada_value_cast (to_type
, val
);
10311 /* Follow the Ada language semantics that do not allow taking
10312 an address of the result of a cast (view conversion in Ada). */
10313 if (VALUE_LVAL (val
) == lval_memory
)
10315 if (value_lazy (val
))
10316 value_fetch_lazy (val
);
10317 VALUE_LVAL (val
) = not_lval
;
10322 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10323 if (noside
== EVAL_SKIP
)
10324 return eval_skip_value (exp
);
10325 return ada_value_cast (to_type
, val
);
10328 /* Implement the evaluate_exp routine in the exp_descriptor structure
10329 for the Ada language. */
10331 static struct value
*
10332 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10333 int *pos
, enum noside noside
)
10335 enum exp_opcode op
;
10339 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10342 struct value
**argvec
;
10346 op
= exp
->elts
[pc
].opcode
;
10352 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10354 if (noside
== EVAL_NORMAL
)
10355 arg1
= unwrap_value (arg1
);
10357 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10358 then we need to perform the conversion manually, because
10359 evaluate_subexp_standard doesn't do it. This conversion is
10360 necessary in Ada because the different kinds of float/fixed
10361 types in Ada have different representations.
10363 Similarly, we need to perform the conversion from OP_LONG
10365 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10366 arg1
= ada_value_cast (expect_type
, arg1
);
10372 struct value
*result
;
10375 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10376 /* The result type will have code OP_STRING, bashed there from
10377 OP_ARRAY. Bash it back. */
10378 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10379 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10385 type
= exp
->elts
[pc
+ 1].type
;
10386 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10390 type
= exp
->elts
[pc
+ 1].type
;
10391 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10394 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10395 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10397 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10398 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10400 return ada_value_assign (arg1
, arg1
);
10402 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10403 except if the lhs of our assignment is a convenience variable.
10404 In the case of assigning to a convenience variable, the lhs
10405 should be exactly the result of the evaluation of the rhs. */
10406 type
= value_type (arg1
);
10407 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10409 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10410 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10412 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10416 else if (ada_is_fixed_point_type (value_type (arg1
)))
10417 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10418 else if (ada_is_fixed_point_type (value_type (arg2
)))
10420 (_("Fixed-point values must be assigned to fixed-point variables"));
10422 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10423 return ada_value_assign (arg1
, arg2
);
10426 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10427 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10428 if (noside
== EVAL_SKIP
)
10430 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10431 return (value_from_longest
10432 (value_type (arg1
),
10433 value_as_long (arg1
) + value_as_long (arg2
)));
10434 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10435 return (value_from_longest
10436 (value_type (arg2
),
10437 value_as_long (arg1
) + value_as_long (arg2
)));
10438 if ((ada_is_fixed_point_type (value_type (arg1
))
10439 || ada_is_fixed_point_type (value_type (arg2
)))
10440 && value_type (arg1
) != value_type (arg2
))
10441 error (_("Operands of fixed-point addition must have the same type"));
10442 /* Do the addition, and cast the result to the type of the first
10443 argument. We cannot cast the result to a reference type, so if
10444 ARG1 is a reference type, find its underlying type. */
10445 type
= value_type (arg1
);
10446 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10447 type
= TYPE_TARGET_TYPE (type
);
10448 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10449 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10452 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10453 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10454 if (noside
== EVAL_SKIP
)
10456 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10457 return (value_from_longest
10458 (value_type (arg1
),
10459 value_as_long (arg1
) - value_as_long (arg2
)));
10460 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10461 return (value_from_longest
10462 (value_type (arg2
),
10463 value_as_long (arg1
) - value_as_long (arg2
)));
10464 if ((ada_is_fixed_point_type (value_type (arg1
))
10465 || ada_is_fixed_point_type (value_type (arg2
)))
10466 && value_type (arg1
) != value_type (arg2
))
10467 error (_("Operands of fixed-point subtraction "
10468 "must have the same type"));
10469 /* Do the substraction, and cast the result to the type of the first
10470 argument. We cannot cast the result to a reference type, so if
10471 ARG1 is a reference type, find its underlying type. */
10472 type
= value_type (arg1
);
10473 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10474 type
= TYPE_TARGET_TYPE (type
);
10475 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10476 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10482 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10483 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10484 if (noside
== EVAL_SKIP
)
10486 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10488 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10489 return value_zero (value_type (arg1
), not_lval
);
10493 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10494 if (ada_is_fixed_point_type (value_type (arg1
)))
10495 arg1
= cast_from_fixed (type
, arg1
);
10496 if (ada_is_fixed_point_type (value_type (arg2
)))
10497 arg2
= cast_from_fixed (type
, arg2
);
10498 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10499 return ada_value_binop (arg1
, arg2
, op
);
10503 case BINOP_NOTEQUAL
:
10504 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10505 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10506 if (noside
== EVAL_SKIP
)
10508 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10512 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10513 tem
= ada_value_equal (arg1
, arg2
);
10515 if (op
== BINOP_NOTEQUAL
)
10517 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10518 return value_from_longest (type
, (LONGEST
) tem
);
10521 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10522 if (noside
== EVAL_SKIP
)
10524 else if (ada_is_fixed_point_type (value_type (arg1
)))
10525 return value_cast (value_type (arg1
), value_neg (arg1
));
10528 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10529 return value_neg (arg1
);
10532 case BINOP_LOGICAL_AND
:
10533 case BINOP_LOGICAL_OR
:
10534 case UNOP_LOGICAL_NOT
:
10539 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10540 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10541 return value_cast (type
, val
);
10544 case BINOP_BITWISE_AND
:
10545 case BINOP_BITWISE_IOR
:
10546 case BINOP_BITWISE_XOR
:
10550 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10552 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10554 return value_cast (value_type (arg1
), val
);
10560 if (noside
== EVAL_SKIP
)
10566 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10567 /* Only encountered when an unresolved symbol occurs in a
10568 context other than a function call, in which case, it is
10570 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10571 exp
->elts
[pc
+ 2].symbol
->print_name ());
10573 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10575 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10576 /* Check to see if this is a tagged type. We also need to handle
10577 the case where the type is a reference to a tagged type, but
10578 we have to be careful to exclude pointers to tagged types.
10579 The latter should be shown as usual (as a pointer), whereas
10580 a reference should mostly be transparent to the user. */
10581 if (ada_is_tagged_type (type
, 0)
10582 || (TYPE_CODE (type
) == TYPE_CODE_REF
10583 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10585 /* Tagged types are a little special in the fact that the real
10586 type is dynamic and can only be determined by inspecting the
10587 object's tag. This means that we need to get the object's
10588 value first (EVAL_NORMAL) and then extract the actual object
10591 Note that we cannot skip the final step where we extract
10592 the object type from its tag, because the EVAL_NORMAL phase
10593 results in dynamic components being resolved into fixed ones.
10594 This can cause problems when trying to print the type
10595 description of tagged types whose parent has a dynamic size:
10596 We use the type name of the "_parent" component in order
10597 to print the name of the ancestor type in the type description.
10598 If that component had a dynamic size, the resolution into
10599 a fixed type would result in the loss of that type name,
10600 thus preventing us from printing the name of the ancestor
10601 type in the type description. */
10602 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10604 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10606 struct type
*actual_type
;
10608 actual_type
= type_from_tag (ada_value_tag (arg1
));
10609 if (actual_type
== NULL
)
10610 /* If, for some reason, we were unable to determine
10611 the actual type from the tag, then use the static
10612 approximation that we just computed as a fallback.
10613 This can happen if the debugging information is
10614 incomplete, for instance. */
10615 actual_type
= type
;
10616 return value_zero (actual_type
, not_lval
);
10620 /* In the case of a ref, ada_coerce_ref takes care
10621 of determining the actual type. But the evaluation
10622 should return a ref as it should be valid to ask
10623 for its address; so rebuild a ref after coerce. */
10624 arg1
= ada_coerce_ref (arg1
);
10625 return value_ref (arg1
, TYPE_CODE_REF
);
10629 /* Records and unions for which GNAT encodings have been
10630 generated need to be statically fixed as well.
10631 Otherwise, non-static fixing produces a type where
10632 all dynamic properties are removed, which prevents "ptype"
10633 from being able to completely describe the type.
10634 For instance, a case statement in a variant record would be
10635 replaced by the relevant components based on the actual
10636 value of the discriminants. */
10637 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10638 && dynamic_template_type (type
) != NULL
)
10639 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10640 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10643 return value_zero (to_static_fixed_type (type
), not_lval
);
10647 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10648 return ada_to_fixed_value (arg1
);
10653 /* Allocate arg vector, including space for the function to be
10654 called in argvec[0] and a terminating NULL. */
10655 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10656 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10658 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10659 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10660 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10661 exp
->elts
[pc
+ 5].symbol
->print_name ());
10664 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10665 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10668 if (noside
== EVAL_SKIP
)
10672 if (ada_is_constrained_packed_array_type
10673 (desc_base_type (value_type (argvec
[0]))))
10674 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10675 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10676 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10677 /* This is a packed array that has already been fixed, and
10678 therefore already coerced to a simple array. Nothing further
10681 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
)
10683 /* Make sure we dereference references so that all the code below
10684 feels like it's really handling the referenced value. Wrapping
10685 types (for alignment) may be there, so make sure we strip them as
10687 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10689 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10690 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10691 argvec
[0] = value_addr (argvec
[0]);
10693 type
= ada_check_typedef (value_type (argvec
[0]));
10695 /* Ada allows us to implicitly dereference arrays when subscripting
10696 them. So, if this is an array typedef (encoding use for array
10697 access types encoded as fat pointers), strip it now. */
10698 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10699 type
= ada_typedef_target_type (type
);
10701 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10703 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10705 case TYPE_CODE_FUNC
:
10706 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10708 case TYPE_CODE_ARRAY
:
10710 case TYPE_CODE_STRUCT
:
10711 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10712 argvec
[0] = ada_value_ind (argvec
[0]);
10713 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10716 error (_("cannot subscript or call something of type `%s'"),
10717 ada_type_name (value_type (argvec
[0])));
10722 switch (TYPE_CODE (type
))
10724 case TYPE_CODE_FUNC
:
10725 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10727 if (TYPE_TARGET_TYPE (type
) == NULL
)
10728 error_call_unknown_return_type (NULL
);
10729 return allocate_value (TYPE_TARGET_TYPE (type
));
10731 return call_function_by_hand (argvec
[0], NULL
,
10732 gdb::make_array_view (argvec
+ 1,
10734 case TYPE_CODE_INTERNAL_FUNCTION
:
10735 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10736 /* We don't know anything about what the internal
10737 function might return, but we have to return
10739 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10742 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10743 argvec
[0], nargs
, argvec
+ 1);
10745 case TYPE_CODE_STRUCT
:
10749 arity
= ada_array_arity (type
);
10750 type
= ada_array_element_type (type
, nargs
);
10752 error (_("cannot subscript or call a record"));
10753 if (arity
!= nargs
)
10754 error (_("wrong number of subscripts; expecting %d"), arity
);
10755 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10756 return value_zero (ada_aligned_type (type
), lval_memory
);
10758 unwrap_value (ada_value_subscript
10759 (argvec
[0], nargs
, argvec
+ 1));
10761 case TYPE_CODE_ARRAY
:
10762 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10764 type
= ada_array_element_type (type
, nargs
);
10766 error (_("element type of array unknown"));
10768 return value_zero (ada_aligned_type (type
), lval_memory
);
10771 unwrap_value (ada_value_subscript
10772 (ada_coerce_to_simple_array (argvec
[0]),
10773 nargs
, argvec
+ 1));
10774 case TYPE_CODE_PTR
: /* Pointer to array */
10775 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10777 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10778 type
= ada_array_element_type (type
, nargs
);
10780 error (_("element type of array unknown"));
10782 return value_zero (ada_aligned_type (type
), lval_memory
);
10785 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10786 nargs
, argvec
+ 1));
10789 error (_("Attempt to index or call something other than an "
10790 "array or function"));
10795 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10796 struct value
*low_bound_val
=
10797 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10798 struct value
*high_bound_val
=
10799 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10801 LONGEST high_bound
;
10803 low_bound_val
= coerce_ref (low_bound_val
);
10804 high_bound_val
= coerce_ref (high_bound_val
);
10805 low_bound
= value_as_long (low_bound_val
);
10806 high_bound
= value_as_long (high_bound_val
);
10808 if (noside
== EVAL_SKIP
)
10811 /* If this is a reference to an aligner type, then remove all
10813 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10814 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10815 TYPE_TARGET_TYPE (value_type (array
)) =
10816 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10818 if (ada_is_constrained_packed_array_type (value_type (array
)))
10819 error (_("cannot slice a packed array"));
10821 /* If this is a reference to an array or an array lvalue,
10822 convert to a pointer. */
10823 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10824 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10825 && VALUE_LVAL (array
) == lval_memory
))
10826 array
= value_addr (array
);
10828 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10829 && ada_is_array_descriptor_type (ada_check_typedef
10830 (value_type (array
))))
10831 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10834 array
= ada_coerce_to_simple_array_ptr (array
);
10836 /* If we have more than one level of pointer indirection,
10837 dereference the value until we get only one level. */
10838 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10839 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10841 array
= value_ind (array
);
10843 /* Make sure we really do have an array type before going further,
10844 to avoid a SEGV when trying to get the index type or the target
10845 type later down the road if the debug info generated by
10846 the compiler is incorrect or incomplete. */
10847 if (!ada_is_simple_array_type (value_type (array
)))
10848 error (_("cannot take slice of non-array"));
10850 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10853 struct type
*type0
= ada_check_typedef (value_type (array
));
10855 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10856 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10859 struct type
*arr_type0
=
10860 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10862 return ada_value_slice_from_ptr (array
, arr_type0
,
10863 longest_to_int (low_bound
),
10864 longest_to_int (high_bound
));
10867 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10869 else if (high_bound
< low_bound
)
10870 return empty_array (value_type (array
), low_bound
, high_bound
);
10872 return ada_value_slice (array
, longest_to_int (low_bound
),
10873 longest_to_int (high_bound
));
10876 case UNOP_IN_RANGE
:
10878 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10879 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10881 if (noside
== EVAL_SKIP
)
10884 switch (TYPE_CODE (type
))
10887 lim_warning (_("Membership test incompletely implemented; "
10888 "always returns true"));
10889 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10890 return value_from_longest (type
, (LONGEST
) 1);
10892 case TYPE_CODE_RANGE
:
10893 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10894 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10895 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10896 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10897 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10899 value_from_longest (type
,
10900 (value_less (arg1
, arg3
)
10901 || value_equal (arg1
, arg3
))
10902 && (value_less (arg2
, arg1
)
10903 || value_equal (arg2
, arg1
)));
10906 case BINOP_IN_BOUNDS
:
10908 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10909 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10911 if (noside
== EVAL_SKIP
)
10914 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10916 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10917 return value_zero (type
, not_lval
);
10920 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10922 type
= ada_index_type (value_type (arg2
), tem
, "range");
10924 type
= value_type (arg1
);
10926 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10927 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10929 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10930 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10931 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10933 value_from_longest (type
,
10934 (value_less (arg1
, arg3
)
10935 || value_equal (arg1
, arg3
))
10936 && (value_less (arg2
, arg1
)
10937 || value_equal (arg2
, arg1
)));
10939 case TERNOP_IN_RANGE
:
10940 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10941 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10942 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10944 if (noside
== EVAL_SKIP
)
10947 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10948 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10949 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10951 value_from_longest (type
,
10952 (value_less (arg1
, arg3
)
10953 || value_equal (arg1
, arg3
))
10954 && (value_less (arg2
, arg1
)
10955 || value_equal (arg2
, arg1
)));
10959 case OP_ATR_LENGTH
:
10961 struct type
*type_arg
;
10963 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10965 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10967 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10971 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10975 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10976 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10977 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10980 if (noside
== EVAL_SKIP
)
10982 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10984 if (type_arg
== NULL
)
10985 type_arg
= value_type (arg1
);
10987 if (ada_is_constrained_packed_array_type (type_arg
))
10988 type_arg
= decode_constrained_packed_array_type (type_arg
);
10990 if (!discrete_type_p (type_arg
))
10994 default: /* Should never happen. */
10995 error (_("unexpected attribute encountered"));
10998 type_arg
= ada_index_type (type_arg
, tem
,
10999 ada_attribute_name (op
));
11001 case OP_ATR_LENGTH
:
11002 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
11007 return value_zero (type_arg
, not_lval
);
11009 else if (type_arg
== NULL
)
11011 arg1
= ada_coerce_ref (arg1
);
11013 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
11014 arg1
= ada_coerce_to_simple_array (arg1
);
11016 if (op
== OP_ATR_LENGTH
)
11017 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11020 type
= ada_index_type (value_type (arg1
), tem
,
11021 ada_attribute_name (op
));
11023 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11028 default: /* Should never happen. */
11029 error (_("unexpected attribute encountered"));
11031 return value_from_longest
11032 (type
, ada_array_bound (arg1
, tem
, 0));
11034 return value_from_longest
11035 (type
, ada_array_bound (arg1
, tem
, 1));
11036 case OP_ATR_LENGTH
:
11037 return value_from_longest
11038 (type
, ada_array_length (arg1
, tem
));
11041 else if (discrete_type_p (type_arg
))
11043 struct type
*range_type
;
11044 const char *name
= ada_type_name (type_arg
);
11047 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
11048 range_type
= to_fixed_range_type (type_arg
, NULL
);
11049 if (range_type
== NULL
)
11050 range_type
= type_arg
;
11054 error (_("unexpected attribute encountered"));
11056 return value_from_longest
11057 (range_type
, ada_discrete_type_low_bound (range_type
));
11059 return value_from_longest
11060 (range_type
, ada_discrete_type_high_bound (range_type
));
11061 case OP_ATR_LENGTH
:
11062 error (_("the 'length attribute applies only to array types"));
11065 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
11066 error (_("unimplemented type attribute"));
11071 if (ada_is_constrained_packed_array_type (type_arg
))
11072 type_arg
= decode_constrained_packed_array_type (type_arg
);
11074 if (op
== OP_ATR_LENGTH
)
11075 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11078 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11080 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11086 error (_("unexpected attribute encountered"));
11088 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11089 return value_from_longest (type
, low
);
11091 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11092 return value_from_longest (type
, high
);
11093 case OP_ATR_LENGTH
:
11094 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11095 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11096 return value_from_longest (type
, high
- low
+ 1);
11102 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11103 if (noside
== EVAL_SKIP
)
11106 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11107 return value_zero (ada_tag_type (arg1
), not_lval
);
11109 return ada_value_tag (arg1
);
11113 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11114 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11115 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11116 if (noside
== EVAL_SKIP
)
11118 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11119 return value_zero (value_type (arg1
), not_lval
);
11122 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11123 return value_binop (arg1
, arg2
,
11124 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11127 case OP_ATR_MODULUS
:
11129 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11131 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11132 if (noside
== EVAL_SKIP
)
11135 if (!ada_is_modular_type (type_arg
))
11136 error (_("'modulus must be applied to modular type"));
11138 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11139 ada_modulus (type_arg
));
11144 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11145 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11146 if (noside
== EVAL_SKIP
)
11148 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11149 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11150 return value_zero (type
, not_lval
);
11152 return value_pos_atr (type
, arg1
);
11155 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11156 type
= value_type (arg1
);
11158 /* If the argument is a reference, then dereference its type, since
11159 the user is really asking for the size of the actual object,
11160 not the size of the pointer. */
11161 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
11162 type
= TYPE_TARGET_TYPE (type
);
11164 if (noside
== EVAL_SKIP
)
11166 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11167 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11169 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11170 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11173 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11174 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11175 type
= exp
->elts
[pc
+ 2].type
;
11176 if (noside
== EVAL_SKIP
)
11178 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11179 return value_zero (type
, not_lval
);
11181 return value_val_atr (type
, arg1
);
11184 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11185 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11186 if (noside
== EVAL_SKIP
)
11188 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11189 return value_zero (value_type (arg1
), not_lval
);
11192 /* For integer exponentiation operations,
11193 only promote the first argument. */
11194 if (is_integral_type (value_type (arg2
)))
11195 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11197 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11199 return value_binop (arg1
, arg2
, op
);
11203 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11204 if (noside
== EVAL_SKIP
)
11210 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11211 if (noside
== EVAL_SKIP
)
11213 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11214 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11215 return value_neg (arg1
);
11220 preeval_pos
= *pos
;
11221 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11222 if (noside
== EVAL_SKIP
)
11224 type
= ada_check_typedef (value_type (arg1
));
11225 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11227 if (ada_is_array_descriptor_type (type
))
11228 /* GDB allows dereferencing GNAT array descriptors. */
11230 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11232 if (arrType
== NULL
)
11233 error (_("Attempt to dereference null array pointer."));
11234 return value_at_lazy (arrType
, 0);
11236 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
11237 || TYPE_CODE (type
) == TYPE_CODE_REF
11238 /* In C you can dereference an array to get the 1st elt. */
11239 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
11241 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11242 only be determined by inspecting the object's tag.
11243 This means that we need to evaluate completely the
11244 expression in order to get its type. */
11246 if ((TYPE_CODE (type
) == TYPE_CODE_REF
11247 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
11248 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11250 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11252 type
= value_type (ada_value_ind (arg1
));
11256 type
= to_static_fixed_type
11258 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11260 ada_ensure_varsize_limit (type
);
11261 return value_zero (type
, lval_memory
);
11263 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11265 /* GDB allows dereferencing an int. */
11266 if (expect_type
== NULL
)
11267 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11272 to_static_fixed_type (ada_aligned_type (expect_type
));
11273 return value_zero (expect_type
, lval_memory
);
11277 error (_("Attempt to take contents of a non-pointer value."));
11279 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11280 type
= ada_check_typedef (value_type (arg1
));
11282 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11283 /* GDB allows dereferencing an int. If we were given
11284 the expect_type, then use that as the target type.
11285 Otherwise, assume that the target type is an int. */
11287 if (expect_type
!= NULL
)
11288 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11291 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11292 (CORE_ADDR
) value_as_address (arg1
));
11295 if (ada_is_array_descriptor_type (type
))
11296 /* GDB allows dereferencing GNAT array descriptors. */
11297 return ada_coerce_to_simple_array (arg1
);
11299 return ada_value_ind (arg1
);
11301 case STRUCTOP_STRUCT
:
11302 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11303 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11304 preeval_pos
= *pos
;
11305 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11306 if (noside
== EVAL_SKIP
)
11308 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11310 struct type
*type1
= value_type (arg1
);
11312 if (ada_is_tagged_type (type1
, 1))
11314 type
= ada_lookup_struct_elt_type (type1
,
11315 &exp
->elts
[pc
+ 2].string
,
11318 /* If the field is not found, check if it exists in the
11319 extension of this object's type. This means that we
11320 need to evaluate completely the expression. */
11324 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11326 arg1
= ada_value_struct_elt (arg1
,
11327 &exp
->elts
[pc
+ 2].string
,
11329 arg1
= unwrap_value (arg1
);
11330 type
= value_type (ada_to_fixed_value (arg1
));
11335 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11338 return value_zero (ada_aligned_type (type
), lval_memory
);
11342 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11343 arg1
= unwrap_value (arg1
);
11344 return ada_to_fixed_value (arg1
);
11348 /* The value is not supposed to be used. This is here to make it
11349 easier to accommodate expressions that contain types. */
11351 if (noside
== EVAL_SKIP
)
11353 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11354 return allocate_value (exp
->elts
[pc
+ 1].type
);
11356 error (_("Attempt to use a type name as an expression"));
11361 case OP_DISCRETE_RANGE
:
11362 case OP_POSITIONAL
:
11364 if (noside
== EVAL_NORMAL
)
11368 error (_("Undefined name, ambiguous name, or renaming used in "
11369 "component association: %s."), &exp
->elts
[pc
+2].string
);
11371 error (_("Aggregates only allowed on the right of an assignment"));
11373 internal_error (__FILE__
, __LINE__
,
11374 _("aggregate apparently mangled"));
11377 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11379 for (tem
= 0; tem
< nargs
; tem
+= 1)
11380 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11385 return eval_skip_value (exp
);
11391 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11392 type name that encodes the 'small and 'delta information.
11393 Otherwise, return NULL. */
11395 static const char *
11396 fixed_type_info (struct type
*type
)
11398 const char *name
= ada_type_name (type
);
11399 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11401 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11403 const char *tail
= strstr (name
, "___XF_");
11410 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11411 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11416 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11419 ada_is_fixed_point_type (struct type
*type
)
11421 return fixed_type_info (type
) != NULL
;
11424 /* Return non-zero iff TYPE represents a System.Address type. */
11427 ada_is_system_address_type (struct type
*type
)
11429 return (TYPE_NAME (type
)
11430 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11433 /* Assuming that TYPE is the representation of an Ada fixed-point
11434 type, return the target floating-point type to be used to represent
11435 of this type during internal computation. */
11437 static struct type
*
11438 ada_scaling_type (struct type
*type
)
11440 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11443 /* Assuming that TYPE is the representation of an Ada fixed-point
11444 type, return its delta, or NULL if the type is malformed and the
11445 delta cannot be determined. */
11448 ada_delta (struct type
*type
)
11450 const char *encoding
= fixed_type_info (type
);
11451 struct type
*scale_type
= ada_scaling_type (type
);
11453 long long num
, den
;
11455 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11458 return value_binop (value_from_longest (scale_type
, num
),
11459 value_from_longest (scale_type
, den
), BINOP_DIV
);
11462 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11463 factor ('SMALL value) associated with the type. */
11466 ada_scaling_factor (struct type
*type
)
11468 const char *encoding
= fixed_type_info (type
);
11469 struct type
*scale_type
= ada_scaling_type (type
);
11471 long long num0
, den0
, num1
, den1
;
11474 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11475 &num0
, &den0
, &num1
, &den1
);
11478 return value_from_longest (scale_type
, 1);
11480 return value_binop (value_from_longest (scale_type
, num1
),
11481 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11483 return value_binop (value_from_longest (scale_type
, num0
),
11484 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11491 /* Scan STR beginning at position K for a discriminant name, and
11492 return the value of that discriminant field of DVAL in *PX. If
11493 PNEW_K is not null, put the position of the character beyond the
11494 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11495 not alter *PX and *PNEW_K if unsuccessful. */
11498 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11501 static char *bound_buffer
= NULL
;
11502 static size_t bound_buffer_len
= 0;
11503 const char *pstart
, *pend
, *bound
;
11504 struct value
*bound_val
;
11506 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11510 pend
= strstr (pstart
, "__");
11514 k
+= strlen (bound
);
11518 int len
= pend
- pstart
;
11520 /* Strip __ and beyond. */
11521 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11522 strncpy (bound_buffer
, pstart
, len
);
11523 bound_buffer
[len
] = '\0';
11525 bound
= bound_buffer
;
11529 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11530 if (bound_val
== NULL
)
11533 *px
= value_as_long (bound_val
);
11534 if (pnew_k
!= NULL
)
11539 /* Value of variable named NAME in the current environment. If
11540 no such variable found, then if ERR_MSG is null, returns 0, and
11541 otherwise causes an error with message ERR_MSG. */
11543 static struct value
*
11544 get_var_value (const char *name
, const char *err_msg
)
11546 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11548 std::vector
<struct block_symbol
> syms
;
11549 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11550 get_selected_block (0),
11551 VAR_DOMAIN
, &syms
, 1);
11555 if (err_msg
== NULL
)
11558 error (("%s"), err_msg
);
11561 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11564 /* Value of integer variable named NAME in the current environment.
11565 If no such variable is found, returns false. Otherwise, sets VALUE
11566 to the variable's value and returns true. */
11569 get_int_var_value (const char *name
, LONGEST
&value
)
11571 struct value
*var_val
= get_var_value (name
, 0);
11576 value
= value_as_long (var_val
);
11581 /* Return a range type whose base type is that of the range type named
11582 NAME in the current environment, and whose bounds are calculated
11583 from NAME according to the GNAT range encoding conventions.
11584 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11585 corresponding range type from debug information; fall back to using it
11586 if symbol lookup fails. If a new type must be created, allocate it
11587 like ORIG_TYPE was. The bounds information, in general, is encoded
11588 in NAME, the base type given in the named range type. */
11590 static struct type
*
11591 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11594 struct type
*base_type
;
11595 const char *subtype_info
;
11597 gdb_assert (raw_type
!= NULL
);
11598 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11600 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11601 base_type
= TYPE_TARGET_TYPE (raw_type
);
11603 base_type
= raw_type
;
11605 name
= TYPE_NAME (raw_type
);
11606 subtype_info
= strstr (name
, "___XD");
11607 if (subtype_info
== NULL
)
11609 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11610 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11612 if (L
< INT_MIN
|| U
> INT_MAX
)
11615 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11620 static char *name_buf
= NULL
;
11621 static size_t name_len
= 0;
11622 int prefix_len
= subtype_info
- name
;
11625 const char *bounds_str
;
11628 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11629 strncpy (name_buf
, name
, prefix_len
);
11630 name_buf
[prefix_len
] = '\0';
11633 bounds_str
= strchr (subtype_info
, '_');
11636 if (*subtype_info
== 'L')
11638 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11639 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11641 if (bounds_str
[n
] == '_')
11643 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11649 strcpy (name_buf
+ prefix_len
, "___L");
11650 if (!get_int_var_value (name_buf
, L
))
11652 lim_warning (_("Unknown lower bound, using 1."));
11657 if (*subtype_info
== 'U')
11659 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11660 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11665 strcpy (name_buf
+ prefix_len
, "___U");
11666 if (!get_int_var_value (name_buf
, U
))
11668 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11673 type
= create_static_range_type (alloc_type_copy (raw_type
),
11675 /* create_static_range_type alters the resulting type's length
11676 to match the size of the base_type, which is not what we want.
11677 Set it back to the original range type's length. */
11678 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11679 TYPE_NAME (type
) = name
;
11684 /* True iff NAME is the name of a range type. */
11687 ada_is_range_type_name (const char *name
)
11689 return (name
!= NULL
&& strstr (name
, "___XD"));
11693 /* Modular types */
11695 /* True iff TYPE is an Ada modular type. */
11698 ada_is_modular_type (struct type
*type
)
11700 struct type
*subranged_type
= get_base_type (type
);
11702 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11703 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11704 && TYPE_UNSIGNED (subranged_type
));
11707 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11710 ada_modulus (struct type
*type
)
11712 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11716 /* Ada exception catchpoint support:
11717 ---------------------------------
11719 We support 3 kinds of exception catchpoints:
11720 . catchpoints on Ada exceptions
11721 . catchpoints on unhandled Ada exceptions
11722 . catchpoints on failed assertions
11724 Exceptions raised during failed assertions, or unhandled exceptions
11725 could perfectly be caught with the general catchpoint on Ada exceptions.
11726 However, we can easily differentiate these two special cases, and having
11727 the option to distinguish these two cases from the rest can be useful
11728 to zero-in on certain situations.
11730 Exception catchpoints are a specialized form of breakpoint,
11731 since they rely on inserting breakpoints inside known routines
11732 of the GNAT runtime. The implementation therefore uses a standard
11733 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11736 Support in the runtime for exception catchpoints have been changed
11737 a few times already, and these changes affect the implementation
11738 of these catchpoints. In order to be able to support several
11739 variants of the runtime, we use a sniffer that will determine
11740 the runtime variant used by the program being debugged. */
11742 /* Ada's standard exceptions.
11744 The Ada 83 standard also defined Numeric_Error. But there so many
11745 situations where it was unclear from the Ada 83 Reference Manual
11746 (RM) whether Constraint_Error or Numeric_Error should be raised,
11747 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11748 Interpretation saying that anytime the RM says that Numeric_Error
11749 should be raised, the implementation may raise Constraint_Error.
11750 Ada 95 went one step further and pretty much removed Numeric_Error
11751 from the list of standard exceptions (it made it a renaming of
11752 Constraint_Error, to help preserve compatibility when compiling
11753 an Ada83 compiler). As such, we do not include Numeric_Error from
11754 this list of standard exceptions. */
11756 static const char *standard_exc
[] = {
11757 "constraint_error",
11763 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11765 /* A structure that describes how to support exception catchpoints
11766 for a given executable. */
11768 struct exception_support_info
11770 /* The name of the symbol to break on in order to insert
11771 a catchpoint on exceptions. */
11772 const char *catch_exception_sym
;
11774 /* The name of the symbol to break on in order to insert
11775 a catchpoint on unhandled exceptions. */
11776 const char *catch_exception_unhandled_sym
;
11778 /* The name of the symbol to break on in order to insert
11779 a catchpoint on failed assertions. */
11780 const char *catch_assert_sym
;
11782 /* The name of the symbol to break on in order to insert
11783 a catchpoint on exception handling. */
11784 const char *catch_handlers_sym
;
11786 /* Assuming that the inferior just triggered an unhandled exception
11787 catchpoint, this function is responsible for returning the address
11788 in inferior memory where the name of that exception is stored.
11789 Return zero if the address could not be computed. */
11790 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11793 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11794 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11796 /* The following exception support info structure describes how to
11797 implement exception catchpoints with the latest version of the
11798 Ada runtime (as of 2019-08-??). */
11800 static const struct exception_support_info default_exception_support_info
=
11802 "__gnat_debug_raise_exception", /* catch_exception_sym */
11803 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11804 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11805 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11806 ada_unhandled_exception_name_addr
11809 /* The following exception support info structure describes how to
11810 implement exception catchpoints with an earlier version of the
11811 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11813 static const struct exception_support_info exception_support_info_v0
=
11815 "__gnat_debug_raise_exception", /* catch_exception_sym */
11816 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11817 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11818 "__gnat_begin_handler", /* catch_handlers_sym */
11819 ada_unhandled_exception_name_addr
11822 /* The following exception support info structure describes how to
11823 implement exception catchpoints with a slightly older version
11824 of the Ada runtime. */
11826 static const struct exception_support_info exception_support_info_fallback
=
11828 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11829 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11830 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11831 "__gnat_begin_handler", /* catch_handlers_sym */
11832 ada_unhandled_exception_name_addr_from_raise
11835 /* Return nonzero if we can detect the exception support routines
11836 described in EINFO.
11838 This function errors out if an abnormal situation is detected
11839 (for instance, if we find the exception support routines, but
11840 that support is found to be incomplete). */
11843 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11845 struct symbol
*sym
;
11847 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11848 that should be compiled with debugging information. As a result, we
11849 expect to find that symbol in the symtabs. */
11851 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11854 /* Perhaps we did not find our symbol because the Ada runtime was
11855 compiled without debugging info, or simply stripped of it.
11856 It happens on some GNU/Linux distributions for instance, where
11857 users have to install a separate debug package in order to get
11858 the runtime's debugging info. In that situation, let the user
11859 know why we cannot insert an Ada exception catchpoint.
11861 Note: Just for the purpose of inserting our Ada exception
11862 catchpoint, we could rely purely on the associated minimal symbol.
11863 But we would be operating in degraded mode anyway, since we are
11864 still lacking the debugging info needed later on to extract
11865 the name of the exception being raised (this name is printed in
11866 the catchpoint message, and is also used when trying to catch
11867 a specific exception). We do not handle this case for now. */
11868 struct bound_minimal_symbol msym
11869 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11871 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11872 error (_("Your Ada runtime appears to be missing some debugging "
11873 "information.\nCannot insert Ada exception catchpoint "
11874 "in this configuration."));
11879 /* Make sure that the symbol we found corresponds to a function. */
11881 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11883 error (_("Symbol \"%s\" is not a function (class = %d)"),
11884 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11888 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11891 struct bound_minimal_symbol msym
11892 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11894 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11895 error (_("Your Ada runtime appears to be missing some debugging "
11896 "information.\nCannot insert Ada exception catchpoint "
11897 "in this configuration."));
11902 /* Make sure that the symbol we found corresponds to a function. */
11904 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11906 error (_("Symbol \"%s\" is not a function (class = %d)"),
11907 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11914 /* Inspect the Ada runtime and determine which exception info structure
11915 should be used to provide support for exception catchpoints.
11917 This function will always set the per-inferior exception_info,
11918 or raise an error. */
11921 ada_exception_support_info_sniffer (void)
11923 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11925 /* If the exception info is already known, then no need to recompute it. */
11926 if (data
->exception_info
!= NULL
)
11929 /* Check the latest (default) exception support info. */
11930 if (ada_has_this_exception_support (&default_exception_support_info
))
11932 data
->exception_info
= &default_exception_support_info
;
11936 /* Try the v0 exception suport info. */
11937 if (ada_has_this_exception_support (&exception_support_info_v0
))
11939 data
->exception_info
= &exception_support_info_v0
;
11943 /* Try our fallback exception suport info. */
11944 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11946 data
->exception_info
= &exception_support_info_fallback
;
11950 /* Sometimes, it is normal for us to not be able to find the routine
11951 we are looking for. This happens when the program is linked with
11952 the shared version of the GNAT runtime, and the program has not been
11953 started yet. Inform the user of these two possible causes if
11956 if (ada_update_initial_language (language_unknown
) != language_ada
)
11957 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11959 /* If the symbol does not exist, then check that the program is
11960 already started, to make sure that shared libraries have been
11961 loaded. If it is not started, this may mean that the symbol is
11962 in a shared library. */
11964 if (inferior_ptid
.pid () == 0)
11965 error (_("Unable to insert catchpoint. Try to start the program first."));
11967 /* At this point, we know that we are debugging an Ada program and
11968 that the inferior has been started, but we still are not able to
11969 find the run-time symbols. That can mean that we are in
11970 configurable run time mode, or that a-except as been optimized
11971 out by the linker... In any case, at this point it is not worth
11972 supporting this feature. */
11974 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11977 /* True iff FRAME is very likely to be that of a function that is
11978 part of the runtime system. This is all very heuristic, but is
11979 intended to be used as advice as to what frames are uninteresting
11983 is_known_support_routine (struct frame_info
*frame
)
11985 enum language func_lang
;
11987 const char *fullname
;
11989 /* If this code does not have any debugging information (no symtab),
11990 This cannot be any user code. */
11992 symtab_and_line sal
= find_frame_sal (frame
);
11993 if (sal
.symtab
== NULL
)
11996 /* If there is a symtab, but the associated source file cannot be
11997 located, then assume this is not user code: Selecting a frame
11998 for which we cannot display the code would not be very helpful
11999 for the user. This should also take care of case such as VxWorks
12000 where the kernel has some debugging info provided for a few units. */
12002 fullname
= symtab_to_fullname (sal
.symtab
);
12003 if (access (fullname
, R_OK
) != 0)
12006 /* Check the unit filename against the Ada runtime file naming.
12007 We also check the name of the objfile against the name of some
12008 known system libraries that sometimes come with debugging info
12011 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
12013 re_comp (known_runtime_file_name_patterns
[i
]);
12014 if (re_exec (lbasename (sal
.symtab
->filename
)))
12016 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
12017 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
12021 /* Check whether the function is a GNAT-generated entity. */
12023 gdb::unique_xmalloc_ptr
<char> func_name
12024 = find_frame_funname (frame
, &func_lang
, NULL
);
12025 if (func_name
== NULL
)
12028 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
12030 re_comp (known_auxiliary_function_name_patterns
[i
]);
12031 if (re_exec (func_name
.get ()))
12038 /* Find the first frame that contains debugging information and that is not
12039 part of the Ada run-time, starting from FI and moving upward. */
12042 ada_find_printable_frame (struct frame_info
*fi
)
12044 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
12046 if (!is_known_support_routine (fi
))
12055 /* Assuming that the inferior just triggered an unhandled exception
12056 catchpoint, return the address in inferior memory where the name
12057 of the exception is stored.
12059 Return zero if the address could not be computed. */
12062 ada_unhandled_exception_name_addr (void)
12064 return parse_and_eval_address ("e.full_name");
12067 /* Same as ada_unhandled_exception_name_addr, except that this function
12068 should be used when the inferior uses an older version of the runtime,
12069 where the exception name needs to be extracted from a specific frame
12070 several frames up in the callstack. */
12073 ada_unhandled_exception_name_addr_from_raise (void)
12076 struct frame_info
*fi
;
12077 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12079 /* To determine the name of this exception, we need to select
12080 the frame corresponding to RAISE_SYM_NAME. This frame is
12081 at least 3 levels up, so we simply skip the first 3 frames
12082 without checking the name of their associated function. */
12083 fi
= get_current_frame ();
12084 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
12086 fi
= get_prev_frame (fi
);
12090 enum language func_lang
;
12092 gdb::unique_xmalloc_ptr
<char> func_name
12093 = find_frame_funname (fi
, &func_lang
, NULL
);
12094 if (func_name
!= NULL
)
12096 if (strcmp (func_name
.get (),
12097 data
->exception_info
->catch_exception_sym
) == 0)
12098 break; /* We found the frame we were looking for... */
12100 fi
= get_prev_frame (fi
);
12107 return parse_and_eval_address ("id.full_name");
12110 /* Assuming the inferior just triggered an Ada exception catchpoint
12111 (of any type), return the address in inferior memory where the name
12112 of the exception is stored, if applicable.
12114 Assumes the selected frame is the current frame.
12116 Return zero if the address could not be computed, or if not relevant. */
12119 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12120 struct breakpoint
*b
)
12122 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12126 case ada_catch_exception
:
12127 return (parse_and_eval_address ("e.full_name"));
12130 case ada_catch_exception_unhandled
:
12131 return data
->exception_info
->unhandled_exception_name_addr ();
12134 case ada_catch_handlers
:
12135 return 0; /* The runtimes does not provide access to the exception
12139 case ada_catch_assert
:
12140 return 0; /* Exception name is not relevant in this case. */
12144 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12148 return 0; /* Should never be reached. */
12151 /* Assuming the inferior is stopped at an exception catchpoint,
12152 return the message which was associated to the exception, if
12153 available. Return NULL if the message could not be retrieved.
12155 Note: The exception message can be associated to an exception
12156 either through the use of the Raise_Exception function, or
12157 more simply (Ada 2005 and later), via:
12159 raise Exception_Name with "exception message";
12163 static gdb::unique_xmalloc_ptr
<char>
12164 ada_exception_message_1 (void)
12166 struct value
*e_msg_val
;
12169 /* For runtimes that support this feature, the exception message
12170 is passed as an unbounded string argument called "message". */
12171 e_msg_val
= parse_and_eval ("message");
12172 if (e_msg_val
== NULL
)
12173 return NULL
; /* Exception message not supported. */
12175 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
12176 gdb_assert (e_msg_val
!= NULL
);
12177 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
12179 /* If the message string is empty, then treat it as if there was
12180 no exception message. */
12181 if (e_msg_len
<= 0)
12184 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
12185 read_memory_string (value_address (e_msg_val
), e_msg
.get (), e_msg_len
+ 1);
12186 e_msg
.get ()[e_msg_len
] = '\0';
12191 /* Same as ada_exception_message_1, except that all exceptions are
12192 contained here (returning NULL instead). */
12194 static gdb::unique_xmalloc_ptr
<char>
12195 ada_exception_message (void)
12197 gdb::unique_xmalloc_ptr
<char> e_msg
;
12201 e_msg
= ada_exception_message_1 ();
12203 catch (const gdb_exception_error
&e
)
12205 e_msg
.reset (nullptr);
12211 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12212 any error that ada_exception_name_addr_1 might cause to be thrown.
12213 When an error is intercepted, a warning with the error message is printed,
12214 and zero is returned. */
12217 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12218 struct breakpoint
*b
)
12220 CORE_ADDR result
= 0;
12224 result
= ada_exception_name_addr_1 (ex
, b
);
12227 catch (const gdb_exception_error
&e
)
12229 warning (_("failed to get exception name: %s"), e
.what ());
12236 static std::string ada_exception_catchpoint_cond_string
12237 (const char *excep_string
,
12238 enum ada_exception_catchpoint_kind ex
);
12240 /* Ada catchpoints.
12242 In the case of catchpoints on Ada exceptions, the catchpoint will
12243 stop the target on every exception the program throws. When a user
12244 specifies the name of a specific exception, we translate this
12245 request into a condition expression (in text form), and then parse
12246 it into an expression stored in each of the catchpoint's locations.
12247 We then use this condition to check whether the exception that was
12248 raised is the one the user is interested in. If not, then the
12249 target is resumed again. We store the name of the requested
12250 exception, in order to be able to re-set the condition expression
12251 when symbols change. */
12253 /* An instance of this type is used to represent an Ada catchpoint
12254 breakpoint location. */
12256 class ada_catchpoint_location
: public bp_location
12259 ada_catchpoint_location (breakpoint
*owner
)
12260 : bp_location (owner
, bp_loc_software_breakpoint
)
12263 /* The condition that checks whether the exception that was raised
12264 is the specific exception the user specified on catchpoint
12266 expression_up excep_cond_expr
;
12269 /* An instance of this type is used to represent an Ada catchpoint. */
12271 struct ada_catchpoint
: public breakpoint
12273 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12278 /* The name of the specific exception the user specified. */
12279 std::string excep_string
;
12281 /* What kind of catchpoint this is. */
12282 enum ada_exception_catchpoint_kind m_kind
;
12285 /* Parse the exception condition string in the context of each of the
12286 catchpoint's locations, and store them for later evaluation. */
12289 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12290 enum ada_exception_catchpoint_kind ex
)
12292 struct bp_location
*bl
;
12294 /* Nothing to do if there's no specific exception to catch. */
12295 if (c
->excep_string
.empty ())
12298 /* Same if there are no locations... */
12299 if (c
->loc
== NULL
)
12302 /* Compute the condition expression in text form, from the specific
12303 expection we want to catch. */
12304 std::string cond_string
12305 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12307 /* Iterate over all the catchpoint's locations, and parse an
12308 expression for each. */
12309 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12311 struct ada_catchpoint_location
*ada_loc
12312 = (struct ada_catchpoint_location
*) bl
;
12315 if (!bl
->shlib_disabled
)
12319 s
= cond_string
.c_str ();
12322 exp
= parse_exp_1 (&s
, bl
->address
,
12323 block_for_pc (bl
->address
),
12326 catch (const gdb_exception_error
&e
)
12328 warning (_("failed to reevaluate internal exception condition "
12329 "for catchpoint %d: %s"),
12330 c
->number
, e
.what ());
12334 ada_loc
->excep_cond_expr
= std::move (exp
);
12338 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12339 structure for all exception catchpoint kinds. */
12341 static struct bp_location
*
12342 allocate_location_exception (struct breakpoint
*self
)
12344 return new ada_catchpoint_location (self
);
12347 /* Implement the RE_SET method in the breakpoint_ops structure for all
12348 exception catchpoint kinds. */
12351 re_set_exception (struct breakpoint
*b
)
12353 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12355 /* Call the base class's method. This updates the catchpoint's
12357 bkpt_breakpoint_ops
.re_set (b
);
12359 /* Reparse the exception conditional expressions. One for each
12361 create_excep_cond_exprs (c
, c
->m_kind
);
12364 /* Returns true if we should stop for this breakpoint hit. If the
12365 user specified a specific exception, we only want to cause a stop
12366 if the program thrown that exception. */
12369 should_stop_exception (const struct bp_location
*bl
)
12371 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12372 const struct ada_catchpoint_location
*ada_loc
12373 = (const struct ada_catchpoint_location
*) bl
;
12376 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12377 if (c
->m_kind
== ada_catch_assert
)
12378 clear_internalvar (var
);
12385 if (c
->m_kind
== ada_catch_handlers
)
12386 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12387 ".all.occurrence.id");
12391 struct value
*exc
= parse_and_eval (expr
);
12392 set_internalvar (var
, exc
);
12394 catch (const gdb_exception_error
&ex
)
12396 clear_internalvar (var
);
12400 /* With no specific exception, should always stop. */
12401 if (c
->excep_string
.empty ())
12404 if (ada_loc
->excep_cond_expr
== NULL
)
12406 /* We will have a NULL expression if back when we were creating
12407 the expressions, this location's had failed to parse. */
12414 struct value
*mark
;
12416 mark
= value_mark ();
12417 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12418 value_free_to_mark (mark
);
12420 catch (const gdb_exception
&ex
)
12422 exception_fprintf (gdb_stderr
, ex
,
12423 _("Error in testing exception condition:\n"));
12429 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12430 for all exception catchpoint kinds. */
12433 check_status_exception (bpstat bs
)
12435 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12438 /* Implement the PRINT_IT method in the breakpoint_ops structure
12439 for all exception catchpoint kinds. */
12441 static enum print_stop_action
12442 print_it_exception (bpstat bs
)
12444 struct ui_out
*uiout
= current_uiout
;
12445 struct breakpoint
*b
= bs
->breakpoint_at
;
12447 annotate_catchpoint (b
->number
);
12449 if (uiout
->is_mi_like_p ())
12451 uiout
->field_string ("reason",
12452 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12453 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12456 uiout
->text (b
->disposition
== disp_del
12457 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12458 uiout
->field_signed ("bkptno", b
->number
);
12459 uiout
->text (", ");
12461 /* ada_exception_name_addr relies on the selected frame being the
12462 current frame. Need to do this here because this function may be
12463 called more than once when printing a stop, and below, we'll
12464 select the first frame past the Ada run-time (see
12465 ada_find_printable_frame). */
12466 select_frame (get_current_frame ());
12468 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12471 case ada_catch_exception
:
12472 case ada_catch_exception_unhandled
:
12473 case ada_catch_handlers
:
12475 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12476 char exception_name
[256];
12480 read_memory (addr
, (gdb_byte
*) exception_name
,
12481 sizeof (exception_name
) - 1);
12482 exception_name
[sizeof (exception_name
) - 1] = '\0';
12486 /* For some reason, we were unable to read the exception
12487 name. This could happen if the Runtime was compiled
12488 without debugging info, for instance. In that case,
12489 just replace the exception name by the generic string
12490 "exception" - it will read as "an exception" in the
12491 notification we are about to print. */
12492 memcpy (exception_name
, "exception", sizeof ("exception"));
12494 /* In the case of unhandled exception breakpoints, we print
12495 the exception name as "unhandled EXCEPTION_NAME", to make
12496 it clearer to the user which kind of catchpoint just got
12497 hit. We used ui_out_text to make sure that this extra
12498 info does not pollute the exception name in the MI case. */
12499 if (c
->m_kind
== ada_catch_exception_unhandled
)
12500 uiout
->text ("unhandled ");
12501 uiout
->field_string ("exception-name", exception_name
);
12504 case ada_catch_assert
:
12505 /* In this case, the name of the exception is not really
12506 important. Just print "failed assertion" to make it clearer
12507 that his program just hit an assertion-failure catchpoint.
12508 We used ui_out_text because this info does not belong in
12510 uiout
->text ("failed assertion");
12514 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12515 if (exception_message
!= NULL
)
12517 uiout
->text (" (");
12518 uiout
->field_string ("exception-message", exception_message
.get ());
12522 uiout
->text (" at ");
12523 ada_find_printable_frame (get_current_frame ());
12525 return PRINT_SRC_AND_LOC
;
12528 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12529 for all exception catchpoint kinds. */
12532 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12534 struct ui_out
*uiout
= current_uiout
;
12535 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12536 struct value_print_options opts
;
12538 get_user_print_options (&opts
);
12540 if (opts
.addressprint
)
12541 uiout
->field_skip ("addr");
12543 annotate_field (5);
12546 case ada_catch_exception
:
12547 if (!c
->excep_string
.empty ())
12549 std::string msg
= string_printf (_("`%s' Ada exception"),
12550 c
->excep_string
.c_str ());
12552 uiout
->field_string ("what", msg
);
12555 uiout
->field_string ("what", "all Ada exceptions");
12559 case ada_catch_exception_unhandled
:
12560 uiout
->field_string ("what", "unhandled Ada exceptions");
12563 case ada_catch_handlers
:
12564 if (!c
->excep_string
.empty ())
12566 uiout
->field_fmt ("what",
12567 _("`%s' Ada exception handlers"),
12568 c
->excep_string
.c_str ());
12571 uiout
->field_string ("what", "all Ada exceptions handlers");
12574 case ada_catch_assert
:
12575 uiout
->field_string ("what", "failed Ada assertions");
12579 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12584 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12585 for all exception catchpoint kinds. */
12588 print_mention_exception (struct breakpoint
*b
)
12590 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12591 struct ui_out
*uiout
= current_uiout
;
12593 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12594 : _("Catchpoint "));
12595 uiout
->field_signed ("bkptno", b
->number
);
12596 uiout
->text (": ");
12600 case ada_catch_exception
:
12601 if (!c
->excep_string
.empty ())
12603 std::string info
= string_printf (_("`%s' Ada exception"),
12604 c
->excep_string
.c_str ());
12605 uiout
->text (info
.c_str ());
12608 uiout
->text (_("all Ada exceptions"));
12611 case ada_catch_exception_unhandled
:
12612 uiout
->text (_("unhandled Ada exceptions"));
12615 case ada_catch_handlers
:
12616 if (!c
->excep_string
.empty ())
12619 = string_printf (_("`%s' Ada exception handlers"),
12620 c
->excep_string
.c_str ());
12621 uiout
->text (info
.c_str ());
12624 uiout
->text (_("all Ada exceptions handlers"));
12627 case ada_catch_assert
:
12628 uiout
->text (_("failed Ada assertions"));
12632 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12637 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12638 for all exception catchpoint kinds. */
12641 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12643 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12647 case ada_catch_exception
:
12648 fprintf_filtered (fp
, "catch exception");
12649 if (!c
->excep_string
.empty ())
12650 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12653 case ada_catch_exception_unhandled
:
12654 fprintf_filtered (fp
, "catch exception unhandled");
12657 case ada_catch_handlers
:
12658 fprintf_filtered (fp
, "catch handlers");
12661 case ada_catch_assert
:
12662 fprintf_filtered (fp
, "catch assert");
12666 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12668 print_recreate_thread (b
, fp
);
12671 /* Virtual tables for various breakpoint types. */
12672 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12673 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12674 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12675 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12677 /* See ada-lang.h. */
12680 is_ada_exception_catchpoint (breakpoint
*bp
)
12682 return (bp
->ops
== &catch_exception_breakpoint_ops
12683 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12684 || bp
->ops
== &catch_assert_breakpoint_ops
12685 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12688 /* Split the arguments specified in a "catch exception" command.
12689 Set EX to the appropriate catchpoint type.
12690 Set EXCEP_STRING to the name of the specific exception if
12691 specified by the user.
12692 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12693 "catch handlers" command. False otherwise.
12694 If a condition is found at the end of the arguments, the condition
12695 expression is stored in COND_STRING (memory must be deallocated
12696 after use). Otherwise COND_STRING is set to NULL. */
12699 catch_ada_exception_command_split (const char *args
,
12700 bool is_catch_handlers_cmd
,
12701 enum ada_exception_catchpoint_kind
*ex
,
12702 std::string
*excep_string
,
12703 std::string
*cond_string
)
12705 std::string exception_name
;
12707 exception_name
= extract_arg (&args
);
12708 if (exception_name
== "if")
12710 /* This is not an exception name; this is the start of a condition
12711 expression for a catchpoint on all exceptions. So, "un-get"
12712 this token, and set exception_name to NULL. */
12713 exception_name
.clear ();
12717 /* Check to see if we have a condition. */
12719 args
= skip_spaces (args
);
12720 if (startswith (args
, "if")
12721 && (isspace (args
[2]) || args
[2] == '\0'))
12724 args
= skip_spaces (args
);
12726 if (args
[0] == '\0')
12727 error (_("Condition missing after `if' keyword"));
12728 *cond_string
= args
;
12730 args
+= strlen (args
);
12733 /* Check that we do not have any more arguments. Anything else
12736 if (args
[0] != '\0')
12737 error (_("Junk at end of expression"));
12739 if (is_catch_handlers_cmd
)
12741 /* Catch handling of exceptions. */
12742 *ex
= ada_catch_handlers
;
12743 *excep_string
= exception_name
;
12745 else if (exception_name
.empty ())
12747 /* Catch all exceptions. */
12748 *ex
= ada_catch_exception
;
12749 excep_string
->clear ();
12751 else if (exception_name
== "unhandled")
12753 /* Catch unhandled exceptions. */
12754 *ex
= ada_catch_exception_unhandled
;
12755 excep_string
->clear ();
12759 /* Catch a specific exception. */
12760 *ex
= ada_catch_exception
;
12761 *excep_string
= exception_name
;
12765 /* Return the name of the symbol on which we should break in order to
12766 implement a catchpoint of the EX kind. */
12768 static const char *
12769 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12771 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12773 gdb_assert (data
->exception_info
!= NULL
);
12777 case ada_catch_exception
:
12778 return (data
->exception_info
->catch_exception_sym
);
12780 case ada_catch_exception_unhandled
:
12781 return (data
->exception_info
->catch_exception_unhandled_sym
);
12783 case ada_catch_assert
:
12784 return (data
->exception_info
->catch_assert_sym
);
12786 case ada_catch_handlers
:
12787 return (data
->exception_info
->catch_handlers_sym
);
12790 internal_error (__FILE__
, __LINE__
,
12791 _("unexpected catchpoint kind (%d)"), ex
);
12795 /* Return the breakpoint ops "virtual table" used for catchpoints
12798 static const struct breakpoint_ops
*
12799 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12803 case ada_catch_exception
:
12804 return (&catch_exception_breakpoint_ops
);
12806 case ada_catch_exception_unhandled
:
12807 return (&catch_exception_unhandled_breakpoint_ops
);
12809 case ada_catch_assert
:
12810 return (&catch_assert_breakpoint_ops
);
12812 case ada_catch_handlers
:
12813 return (&catch_handlers_breakpoint_ops
);
12816 internal_error (__FILE__
, __LINE__
,
12817 _("unexpected catchpoint kind (%d)"), ex
);
12821 /* Return the condition that will be used to match the current exception
12822 being raised with the exception that the user wants to catch. This
12823 assumes that this condition is used when the inferior just triggered
12824 an exception catchpoint.
12825 EX: the type of catchpoints used for catching Ada exceptions. */
12828 ada_exception_catchpoint_cond_string (const char *excep_string
,
12829 enum ada_exception_catchpoint_kind ex
)
12832 bool is_standard_exc
= false;
12833 std::string result
;
12835 if (ex
== ada_catch_handlers
)
12837 /* For exception handlers catchpoints, the condition string does
12838 not use the same parameter as for the other exceptions. */
12839 result
= ("long_integer (GNAT_GCC_exception_Access"
12840 "(gcc_exception).all.occurrence.id)");
12843 result
= "long_integer (e)";
12845 /* The standard exceptions are a special case. They are defined in
12846 runtime units that have been compiled without debugging info; if
12847 EXCEP_STRING is the not-fully-qualified name of a standard
12848 exception (e.g. "constraint_error") then, during the evaluation
12849 of the condition expression, the symbol lookup on this name would
12850 *not* return this standard exception. The catchpoint condition
12851 may then be set only on user-defined exceptions which have the
12852 same not-fully-qualified name (e.g. my_package.constraint_error).
12854 To avoid this unexcepted behavior, these standard exceptions are
12855 systematically prefixed by "standard". This means that "catch
12856 exception constraint_error" is rewritten into "catch exception
12857 standard.constraint_error".
12859 If an exception named constraint_error is defined in another package of
12860 the inferior program, then the only way to specify this exception as a
12861 breakpoint condition is to use its fully-qualified named:
12862 e.g. my_package.constraint_error. */
12864 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12866 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12868 is_standard_exc
= true;
12875 if (is_standard_exc
)
12876 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12878 string_appendf (result
, "long_integer (&%s)", excep_string
);
12883 /* Return the symtab_and_line that should be used to insert an exception
12884 catchpoint of the TYPE kind.
12886 ADDR_STRING returns the name of the function where the real
12887 breakpoint that implements the catchpoints is set, depending on the
12888 type of catchpoint we need to create. */
12890 static struct symtab_and_line
12891 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12892 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12894 const char *sym_name
;
12895 struct symbol
*sym
;
12897 /* First, find out which exception support info to use. */
12898 ada_exception_support_info_sniffer ();
12900 /* Then lookup the function on which we will break in order to catch
12901 the Ada exceptions requested by the user. */
12902 sym_name
= ada_exception_sym_name (ex
);
12903 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12906 error (_("Catchpoint symbol not found: %s"), sym_name
);
12908 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12909 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12911 /* Set ADDR_STRING. */
12912 *addr_string
= sym_name
;
12915 *ops
= ada_exception_breakpoint_ops (ex
);
12917 return find_function_start_sal (sym
, 1);
12920 /* Create an Ada exception catchpoint.
12922 EX_KIND is the kind of exception catchpoint to be created.
12924 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12925 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12926 of the exception to which this catchpoint applies.
12928 COND_STRING, if not empty, is the catchpoint condition.
12930 TEMPFLAG, if nonzero, means that the underlying breakpoint
12931 should be temporary.
12933 FROM_TTY is the usual argument passed to all commands implementations. */
12936 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12937 enum ada_exception_catchpoint_kind ex_kind
,
12938 const std::string
&excep_string
,
12939 const std::string
&cond_string
,
12944 std::string addr_string
;
12945 const struct breakpoint_ops
*ops
= NULL
;
12946 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12948 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12949 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12950 ops
, tempflag
, disabled
, from_tty
);
12951 c
->excep_string
= excep_string
;
12952 create_excep_cond_exprs (c
.get (), ex_kind
);
12953 if (!cond_string
.empty ())
12954 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
);
12955 install_breakpoint (0, std::move (c
), 1);
12958 /* Implement the "catch exception" command. */
12961 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12962 struct cmd_list_element
*command
)
12964 const char *arg
= arg_entry
;
12965 struct gdbarch
*gdbarch
= get_current_arch ();
12967 enum ada_exception_catchpoint_kind ex_kind
;
12968 std::string excep_string
;
12969 std::string cond_string
;
12971 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12975 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12977 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12978 excep_string
, cond_string
,
12979 tempflag
, 1 /* enabled */,
12983 /* Implement the "catch handlers" command. */
12986 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12987 struct cmd_list_element
*command
)
12989 const char *arg
= arg_entry
;
12990 struct gdbarch
*gdbarch
= get_current_arch ();
12992 enum ada_exception_catchpoint_kind ex_kind
;
12993 std::string excep_string
;
12994 std::string cond_string
;
12996 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13000 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
13002 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
13003 excep_string
, cond_string
,
13004 tempflag
, 1 /* enabled */,
13008 /* Completion function for the Ada "catch" commands. */
13011 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
13012 const char *text
, const char *word
)
13014 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
13016 for (const ada_exc_info
&info
: exceptions
)
13018 if (startswith (info
.name
, word
))
13019 tracker
.add_completion (make_unique_xstrdup (info
.name
));
13023 /* Split the arguments specified in a "catch assert" command.
13025 ARGS contains the command's arguments (or the empty string if
13026 no arguments were passed).
13028 If ARGS contains a condition, set COND_STRING to that condition
13029 (the memory needs to be deallocated after use). */
13032 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
13034 args
= skip_spaces (args
);
13036 /* Check whether a condition was provided. */
13037 if (startswith (args
, "if")
13038 && (isspace (args
[2]) || args
[2] == '\0'))
13041 args
= skip_spaces (args
);
13042 if (args
[0] == '\0')
13043 error (_("condition missing after `if' keyword"));
13044 cond_string
.assign (args
);
13047 /* Otherwise, there should be no other argument at the end of
13049 else if (args
[0] != '\0')
13050 error (_("Junk at end of arguments."));
13053 /* Implement the "catch assert" command. */
13056 catch_assert_command (const char *arg_entry
, int from_tty
,
13057 struct cmd_list_element
*command
)
13059 const char *arg
= arg_entry
;
13060 struct gdbarch
*gdbarch
= get_current_arch ();
13062 std::string cond_string
;
13064 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13068 catch_ada_assert_command_split (arg
, cond_string
);
13069 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
13071 tempflag
, 1 /* enabled */,
13075 /* Return non-zero if the symbol SYM is an Ada exception object. */
13078 ada_is_exception_sym (struct symbol
*sym
)
13080 const char *type_name
= TYPE_NAME (SYMBOL_TYPE (sym
));
13082 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
13083 && SYMBOL_CLASS (sym
) != LOC_BLOCK
13084 && SYMBOL_CLASS (sym
) != LOC_CONST
13085 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
13086 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
13089 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13090 Ada exception object. This matches all exceptions except the ones
13091 defined by the Ada language. */
13094 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13098 if (!ada_is_exception_sym (sym
))
13101 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13102 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
13103 return 0; /* A standard exception. */
13105 /* Numeric_Error is also a standard exception, so exclude it.
13106 See the STANDARD_EXC description for more details as to why
13107 this exception is not listed in that array. */
13108 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
13114 /* A helper function for std::sort, comparing two struct ada_exc_info
13117 The comparison is determined first by exception name, and then
13118 by exception address. */
13121 ada_exc_info::operator< (const ada_exc_info
&other
) const
13125 result
= strcmp (name
, other
.name
);
13128 if (result
== 0 && addr
< other
.addr
)
13134 ada_exc_info::operator== (const ada_exc_info
&other
) const
13136 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
13139 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13140 routine, but keeping the first SKIP elements untouched.
13142 All duplicates are also removed. */
13145 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
13148 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
13149 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
13150 exceptions
->end ());
13153 /* Add all exceptions defined by the Ada standard whose name match
13154 a regular expression.
13156 If PREG is not NULL, then this regexp_t object is used to
13157 perform the symbol name matching. Otherwise, no name-based
13158 filtering is performed.
13160 EXCEPTIONS is a vector of exceptions to which matching exceptions
13164 ada_add_standard_exceptions (compiled_regex
*preg
,
13165 std::vector
<ada_exc_info
> *exceptions
)
13169 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13172 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
13174 struct bound_minimal_symbol msymbol
13175 = ada_lookup_simple_minsym (standard_exc
[i
]);
13177 if (msymbol
.minsym
!= NULL
)
13179 struct ada_exc_info info
13180 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13182 exceptions
->push_back (info
);
13188 /* Add all Ada exceptions defined locally and accessible from the given
13191 If PREG is not NULL, then this regexp_t object is used to
13192 perform the symbol name matching. Otherwise, no name-based
13193 filtering is performed.
13195 EXCEPTIONS is a vector of exceptions to which matching exceptions
13199 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13200 struct frame_info
*frame
,
13201 std::vector
<ada_exc_info
> *exceptions
)
13203 const struct block
*block
= get_frame_block (frame
, 0);
13207 struct block_iterator iter
;
13208 struct symbol
*sym
;
13210 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13212 switch (SYMBOL_CLASS (sym
))
13219 if (ada_is_exception_sym (sym
))
13221 struct ada_exc_info info
= {sym
->print_name (),
13222 SYMBOL_VALUE_ADDRESS (sym
)};
13224 exceptions
->push_back (info
);
13228 if (BLOCK_FUNCTION (block
) != NULL
)
13230 block
= BLOCK_SUPERBLOCK (block
);
13234 /* Return true if NAME matches PREG or if PREG is NULL. */
13237 name_matches_regex (const char *name
, compiled_regex
*preg
)
13239 return (preg
== NULL
13240 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13243 /* Add all exceptions defined globally whose name name match
13244 a regular expression, excluding standard exceptions.
13246 The reason we exclude standard exceptions is that they need
13247 to be handled separately: Standard exceptions are defined inside
13248 a runtime unit which is normally not compiled with debugging info,
13249 and thus usually do not show up in our symbol search. However,
13250 if the unit was in fact built with debugging info, we need to
13251 exclude them because they would duplicate the entry we found
13252 during the special loop that specifically searches for those
13253 standard exceptions.
13255 If PREG is not NULL, then this regexp_t object is used to
13256 perform the symbol name matching. Otherwise, no name-based
13257 filtering is performed.
13259 EXCEPTIONS is a vector of exceptions to which matching exceptions
13263 ada_add_global_exceptions (compiled_regex
*preg
,
13264 std::vector
<ada_exc_info
> *exceptions
)
13266 /* In Ada, the symbol "search name" is a linkage name, whereas the
13267 regular expression used to do the matching refers to the natural
13268 name. So match against the decoded name. */
13269 expand_symtabs_matching (NULL
,
13270 lookup_name_info::match_any (),
13271 [&] (const char *search_name
)
13273 std::string decoded
= ada_decode (search_name
);
13274 return name_matches_regex (decoded
.c_str (), preg
);
13279 for (objfile
*objfile
: current_program_space
->objfiles ())
13281 for (compunit_symtab
*s
: objfile
->compunits ())
13283 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13286 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13288 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13289 struct block_iterator iter
;
13290 struct symbol
*sym
;
13292 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13293 if (ada_is_non_standard_exception_sym (sym
)
13294 && name_matches_regex (sym
->natural_name (), preg
))
13296 struct ada_exc_info info
13297 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13299 exceptions
->push_back (info
);
13306 /* Implements ada_exceptions_list with the regular expression passed
13307 as a regex_t, rather than a string.
13309 If not NULL, PREG is used to filter out exceptions whose names
13310 do not match. Otherwise, all exceptions are listed. */
13312 static std::vector
<ada_exc_info
>
13313 ada_exceptions_list_1 (compiled_regex
*preg
)
13315 std::vector
<ada_exc_info
> result
;
13318 /* First, list the known standard exceptions. These exceptions
13319 need to be handled separately, as they are usually defined in
13320 runtime units that have been compiled without debugging info. */
13322 ada_add_standard_exceptions (preg
, &result
);
13324 /* Next, find all exceptions whose scope is local and accessible
13325 from the currently selected frame. */
13327 if (has_stack_frames ())
13329 prev_len
= result
.size ();
13330 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13332 if (result
.size () > prev_len
)
13333 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13336 /* Add all exceptions whose scope is global. */
13338 prev_len
= result
.size ();
13339 ada_add_global_exceptions (preg
, &result
);
13340 if (result
.size () > prev_len
)
13341 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13346 /* Return a vector of ada_exc_info.
13348 If REGEXP is NULL, all exceptions are included in the result.
13349 Otherwise, it should contain a valid regular expression,
13350 and only the exceptions whose names match that regular expression
13351 are included in the result.
13353 The exceptions are sorted in the following order:
13354 - Standard exceptions (defined by the Ada language), in
13355 alphabetical order;
13356 - Exceptions only visible from the current frame, in
13357 alphabetical order;
13358 - Exceptions whose scope is global, in alphabetical order. */
13360 std::vector
<ada_exc_info
>
13361 ada_exceptions_list (const char *regexp
)
13363 if (regexp
== NULL
)
13364 return ada_exceptions_list_1 (NULL
);
13366 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13367 return ada_exceptions_list_1 (®
);
13370 /* Implement the "info exceptions" command. */
13373 info_exceptions_command (const char *regexp
, int from_tty
)
13375 struct gdbarch
*gdbarch
= get_current_arch ();
13377 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13379 if (regexp
!= NULL
)
13381 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13383 printf_filtered (_("All defined Ada exceptions:\n"));
13385 for (const ada_exc_info
&info
: exceptions
)
13386 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13390 /* Information about operators given special treatment in functions
13392 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13394 #define ADA_OPERATORS \
13395 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13396 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13397 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13398 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13399 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13400 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13401 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13402 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13403 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13404 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13405 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13406 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13407 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13408 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13409 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13410 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13411 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13412 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13413 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13416 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13419 switch (exp
->elts
[pc
- 1].opcode
)
13422 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13425 #define OP_DEFN(op, len, args, binop) \
13426 case op: *oplenp = len; *argsp = args; break;
13432 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13437 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13442 /* Implementation of the exp_descriptor method operator_check. */
13445 ada_operator_check (struct expression
*exp
, int pos
,
13446 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13449 const union exp_element
*const elts
= exp
->elts
;
13450 struct type
*type
= NULL
;
13452 switch (elts
[pos
].opcode
)
13454 case UNOP_IN_RANGE
:
13456 type
= elts
[pos
+ 1].type
;
13460 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13463 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13465 if (type
&& TYPE_OBJFILE (type
)
13466 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13472 static const char *
13473 ada_op_name (enum exp_opcode opcode
)
13478 return op_name_standard (opcode
);
13480 #define OP_DEFN(op, len, args, binop) case op: return #op;
13485 return "OP_AGGREGATE";
13487 return "OP_CHOICES";
13493 /* As for operator_length, but assumes PC is pointing at the first
13494 element of the operator, and gives meaningful results only for the
13495 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13498 ada_forward_operator_length (struct expression
*exp
, int pc
,
13499 int *oplenp
, int *argsp
)
13501 switch (exp
->elts
[pc
].opcode
)
13504 *oplenp
= *argsp
= 0;
13507 #define OP_DEFN(op, len, args, binop) \
13508 case op: *oplenp = len; *argsp = args; break;
13514 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13519 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13525 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13527 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13535 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13537 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13542 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13546 /* Ada attributes ('Foo). */
13549 case OP_ATR_LENGTH
:
13553 case OP_ATR_MODULUS
:
13560 case UNOP_IN_RANGE
:
13562 /* XXX: gdb_sprint_host_address, type_sprint */
13563 fprintf_filtered (stream
, _("Type @"));
13564 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13565 fprintf_filtered (stream
, " (");
13566 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13567 fprintf_filtered (stream
, ")");
13569 case BINOP_IN_BOUNDS
:
13570 fprintf_filtered (stream
, " (%d)",
13571 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13573 case TERNOP_IN_RANGE
:
13578 case OP_DISCRETE_RANGE
:
13579 case OP_POSITIONAL
:
13586 char *name
= &exp
->elts
[elt
+ 2].string
;
13587 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13589 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13594 return dump_subexp_body_standard (exp
, stream
, elt
);
13598 for (i
= 0; i
< nargs
; i
+= 1)
13599 elt
= dump_subexp (exp
, stream
, elt
);
13604 /* The Ada extension of print_subexp (q.v.). */
13607 ada_print_subexp (struct expression
*exp
, int *pos
,
13608 struct ui_file
*stream
, enum precedence prec
)
13610 int oplen
, nargs
, i
;
13612 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13614 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13621 print_subexp_standard (exp
, pos
, stream
, prec
);
13625 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13628 case BINOP_IN_BOUNDS
:
13629 /* XXX: sprint_subexp */
13630 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13631 fputs_filtered (" in ", stream
);
13632 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13633 fputs_filtered ("'range", stream
);
13634 if (exp
->elts
[pc
+ 1].longconst
> 1)
13635 fprintf_filtered (stream
, "(%ld)",
13636 (long) exp
->elts
[pc
+ 1].longconst
);
13639 case TERNOP_IN_RANGE
:
13640 if (prec
>= PREC_EQUAL
)
13641 fputs_filtered ("(", stream
);
13642 /* XXX: sprint_subexp */
13643 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13644 fputs_filtered (" in ", stream
);
13645 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13646 fputs_filtered (" .. ", stream
);
13647 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13648 if (prec
>= PREC_EQUAL
)
13649 fputs_filtered (")", stream
);
13654 case OP_ATR_LENGTH
:
13658 case OP_ATR_MODULUS
:
13663 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13665 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13666 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13667 &type_print_raw_options
);
13671 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13672 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13677 for (tem
= 1; tem
< nargs
; tem
+= 1)
13679 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13680 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13682 fputs_filtered (")", stream
);
13687 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13688 fputs_filtered ("'(", stream
);
13689 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13690 fputs_filtered (")", stream
);
13693 case UNOP_IN_RANGE
:
13694 /* XXX: sprint_subexp */
13695 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13696 fputs_filtered (" in ", stream
);
13697 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13698 &type_print_raw_options
);
13701 case OP_DISCRETE_RANGE
:
13702 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13703 fputs_filtered ("..", stream
);
13704 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13708 fputs_filtered ("others => ", stream
);
13709 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13713 for (i
= 0; i
< nargs
-1; i
+= 1)
13716 fputs_filtered ("|", stream
);
13717 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13719 fputs_filtered (" => ", stream
);
13720 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13723 case OP_POSITIONAL
:
13724 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13728 fputs_filtered ("(", stream
);
13729 for (i
= 0; i
< nargs
; i
+= 1)
13732 fputs_filtered (", ", stream
);
13733 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13735 fputs_filtered (")", stream
);
13740 /* Table mapping opcodes into strings for printing operators
13741 and precedences of the operators. */
13743 static const struct op_print ada_op_print_tab
[] = {
13744 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13745 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13746 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13747 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13748 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13749 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13750 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13751 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13752 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13753 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13754 {">", BINOP_GTR
, PREC_ORDER
, 0},
13755 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13756 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13757 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13758 {"+", BINOP_ADD
, PREC_ADD
, 0},
13759 {"-", BINOP_SUB
, PREC_ADD
, 0},
13760 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13761 {"*", BINOP_MUL
, PREC_MUL
, 0},
13762 {"/", BINOP_DIV
, PREC_MUL
, 0},
13763 {"rem", BINOP_REM
, PREC_MUL
, 0},
13764 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13765 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13766 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13767 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13768 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13769 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13770 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13771 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13772 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13773 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13774 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13775 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13778 enum ada_primitive_types
{
13779 ada_primitive_type_int
,
13780 ada_primitive_type_long
,
13781 ada_primitive_type_short
,
13782 ada_primitive_type_char
,
13783 ada_primitive_type_float
,
13784 ada_primitive_type_double
,
13785 ada_primitive_type_void
,
13786 ada_primitive_type_long_long
,
13787 ada_primitive_type_long_double
,
13788 ada_primitive_type_natural
,
13789 ada_primitive_type_positive
,
13790 ada_primitive_type_system_address
,
13791 ada_primitive_type_storage_offset
,
13792 nr_ada_primitive_types
13796 ada_language_arch_info (struct gdbarch
*gdbarch
,
13797 struct language_arch_info
*lai
)
13799 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13801 lai
->primitive_type_vector
13802 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13805 lai
->primitive_type_vector
[ada_primitive_type_int
]
13806 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13808 lai
->primitive_type_vector
[ada_primitive_type_long
]
13809 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13810 0, "long_integer");
13811 lai
->primitive_type_vector
[ada_primitive_type_short
]
13812 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13813 0, "short_integer");
13814 lai
->string_char_type
13815 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13816 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13817 lai
->primitive_type_vector
[ada_primitive_type_float
]
13818 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13819 "float", gdbarch_float_format (gdbarch
));
13820 lai
->primitive_type_vector
[ada_primitive_type_double
]
13821 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13822 "long_float", gdbarch_double_format (gdbarch
));
13823 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13824 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13825 0, "long_long_integer");
13826 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13827 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13828 "long_long_float", gdbarch_long_double_format (gdbarch
));
13829 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13830 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13832 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13833 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13835 lai
->primitive_type_vector
[ada_primitive_type_void
]
13836 = builtin
->builtin_void
;
13838 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13839 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13841 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13842 = "system__address";
13844 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13845 type. This is a signed integral type whose size is the same as
13846 the size of addresses. */
13848 unsigned int addr_length
= TYPE_LENGTH
13849 (lai
->primitive_type_vector
[ada_primitive_type_system_address
]);
13851 lai
->primitive_type_vector
[ada_primitive_type_storage_offset
]
13852 = arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13856 lai
->bool_type_symbol
= NULL
;
13857 lai
->bool_type_default
= builtin
->builtin_bool
;
13860 /* Language vector */
13862 /* Not really used, but needed in the ada_language_defn. */
13865 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13867 ada_emit_char (c
, type
, stream
, quoter
, 1);
13871 parse (struct parser_state
*ps
)
13873 warnings_issued
= 0;
13874 return ada_parse (ps
);
13877 static const struct exp_descriptor ada_exp_descriptor
= {
13879 ada_operator_length
,
13880 ada_operator_check
,
13882 ada_dump_subexp_body
,
13883 ada_evaluate_subexp
13886 /* symbol_name_matcher_ftype adapter for wild_match. */
13889 do_wild_match (const char *symbol_search_name
,
13890 const lookup_name_info
&lookup_name
,
13891 completion_match_result
*comp_match_res
)
13893 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13896 /* symbol_name_matcher_ftype adapter for full_match. */
13899 do_full_match (const char *symbol_search_name
,
13900 const lookup_name_info
&lookup_name
,
13901 completion_match_result
*comp_match_res
)
13903 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13906 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13909 do_exact_match (const char *symbol_search_name
,
13910 const lookup_name_info
&lookup_name
,
13911 completion_match_result
*comp_match_res
)
13913 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13916 /* Build the Ada lookup name for LOOKUP_NAME. */
13918 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13920 gdb::string_view user_name
= lookup_name
.name ();
13922 if (user_name
[0] == '<')
13924 if (user_name
.back () == '>')
13926 = user_name
.substr (1, user_name
.size () - 2).to_string ();
13929 = user_name
.substr (1, user_name
.size () - 1).to_string ();
13930 m_encoded_p
= true;
13931 m_verbatim_p
= true;
13932 m_wild_match_p
= false;
13933 m_standard_p
= false;
13937 m_verbatim_p
= false;
13939 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13943 const char *folded
= ada_fold_name (user_name
);
13944 const char *encoded
= ada_encode_1 (folded
, false);
13945 if (encoded
!= NULL
)
13946 m_encoded_name
= encoded
;
13948 m_encoded_name
= user_name
.to_string ();
13951 m_encoded_name
= user_name
.to_string ();
13953 /* Handle the 'package Standard' special case. See description
13954 of m_standard_p. */
13955 if (startswith (m_encoded_name
.c_str (), "standard__"))
13957 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13958 m_standard_p
= true;
13961 m_standard_p
= false;
13963 /* If the name contains a ".", then the user is entering a fully
13964 qualified entity name, and the match must not be done in wild
13965 mode. Similarly, if the user wants to complete what looks
13966 like an encoded name, the match must not be done in wild
13967 mode. Also, in the standard__ special case always do
13968 non-wild matching. */
13970 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13973 && user_name
.find ('.') == std::string::npos
);
13977 /* symbol_name_matcher_ftype method for Ada. This only handles
13978 completion mode. */
13981 ada_symbol_name_matches (const char *symbol_search_name
,
13982 const lookup_name_info
&lookup_name
,
13983 completion_match_result
*comp_match_res
)
13985 return lookup_name
.ada ().matches (symbol_search_name
,
13986 lookup_name
.match_type (),
13990 /* A name matcher that matches the symbol name exactly, with
13994 literal_symbol_name_matcher (const char *symbol_search_name
,
13995 const lookup_name_info
&lookup_name
,
13996 completion_match_result
*comp_match_res
)
13998 gdb::string_view name_view
= lookup_name
.name ();
14000 if (lookup_name
.completion_mode ()
14001 ? (strncmp (symbol_search_name
, name_view
.data (),
14002 name_view
.size ()) == 0)
14003 : symbol_search_name
== name_view
)
14005 if (comp_match_res
!= NULL
)
14006 comp_match_res
->set_match (symbol_search_name
);
14013 /* Implement the "la_get_symbol_name_matcher" language_defn method for
14016 static symbol_name_matcher_ftype
*
14017 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
14019 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
14020 return literal_symbol_name_matcher
;
14022 if (lookup_name
.completion_mode ())
14023 return ada_symbol_name_matches
;
14026 if (lookup_name
.ada ().wild_match_p ())
14027 return do_wild_match
;
14028 else if (lookup_name
.ada ().verbatim_p ())
14029 return do_exact_match
;
14031 return do_full_match
;
14035 /* Implement the "la_read_var_value" language_defn method for Ada. */
14037 static struct value
*
14038 ada_read_var_value (struct symbol
*var
, const struct block
*var_block
,
14039 struct frame_info
*frame
)
14041 /* The only case where default_read_var_value is not sufficient
14042 is when VAR is a renaming... */
14043 if (frame
!= nullptr)
14045 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
14046 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
14047 return ada_read_renaming_var_value (var
, frame_block
);
14050 /* This is a typical case where we expect the default_read_var_value
14051 function to work. */
14052 return default_read_var_value (var
, var_block
, frame
);
14055 static const char *ada_extensions
[] =
14057 ".adb", ".ads", ".a", ".ada", ".dg", NULL
14060 extern const struct language_defn ada_language_defn
= {
14061 "ada", /* Language name */
14065 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
14066 that's not quite what this means. */
14068 macro_expansion_no
,
14070 &ada_exp_descriptor
,
14073 ada_printchar
, /* Print a character constant */
14074 ada_printstr
, /* Function to print string constant */
14075 emit_char
, /* Function to print single char (not used) */
14076 ada_print_type
, /* Print a type using appropriate syntax */
14077 ada_print_typedef
, /* Print a typedef using appropriate syntax */
14078 ada_value_print_inner
, /* la_value_print_inner */
14079 ada_value_print
, /* Print a top-level value */
14080 ada_read_var_value
, /* la_read_var_value */
14081 NULL
, /* Language specific skip_trampoline */
14082 NULL
, /* name_of_this */
14083 true, /* la_store_sym_names_in_linkage_form_p */
14084 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
14085 basic_lookup_transparent_type
, /* lookup_transparent_type */
14086 ada_la_decode
, /* Language specific symbol demangler */
14087 ada_sniff_from_mangled_name
,
14088 NULL
, /* Language specific
14089 class_name_from_physname */
14090 ada_op_print_tab
, /* expression operators for printing */
14091 0, /* c-style arrays */
14092 1, /* String lower bound */
14093 ada_get_gdb_completer_word_break_characters
,
14094 ada_collect_symbol_completion_matches
,
14095 ada_language_arch_info
,
14096 ada_print_array_index
,
14097 default_pass_by_reference
,
14098 ada_watch_location_expression
,
14099 ada_get_symbol_name_matcher
, /* la_get_symbol_name_matcher */
14100 ada_iterate_over_symbols
,
14101 default_search_name_hash
,
14105 ada_is_string_type
,
14106 "(...)" /* la_struct_too_deep_ellipsis */
14109 /* Command-list for the "set/show ada" prefix command. */
14110 static struct cmd_list_element
*set_ada_list
;
14111 static struct cmd_list_element
*show_ada_list
;
14114 initialize_ada_catchpoint_ops (void)
14116 struct breakpoint_ops
*ops
;
14118 initialize_breakpoint_ops ();
14120 ops
= &catch_exception_breakpoint_ops
;
14121 *ops
= bkpt_breakpoint_ops
;
14122 ops
->allocate_location
= allocate_location_exception
;
14123 ops
->re_set
= re_set_exception
;
14124 ops
->check_status
= check_status_exception
;
14125 ops
->print_it
= print_it_exception
;
14126 ops
->print_one
= print_one_exception
;
14127 ops
->print_mention
= print_mention_exception
;
14128 ops
->print_recreate
= print_recreate_exception
;
14130 ops
= &catch_exception_unhandled_breakpoint_ops
;
14131 *ops
= bkpt_breakpoint_ops
;
14132 ops
->allocate_location
= allocate_location_exception
;
14133 ops
->re_set
= re_set_exception
;
14134 ops
->check_status
= check_status_exception
;
14135 ops
->print_it
= print_it_exception
;
14136 ops
->print_one
= print_one_exception
;
14137 ops
->print_mention
= print_mention_exception
;
14138 ops
->print_recreate
= print_recreate_exception
;
14140 ops
= &catch_assert_breakpoint_ops
;
14141 *ops
= bkpt_breakpoint_ops
;
14142 ops
->allocate_location
= allocate_location_exception
;
14143 ops
->re_set
= re_set_exception
;
14144 ops
->check_status
= check_status_exception
;
14145 ops
->print_it
= print_it_exception
;
14146 ops
->print_one
= print_one_exception
;
14147 ops
->print_mention
= print_mention_exception
;
14148 ops
->print_recreate
= print_recreate_exception
;
14150 ops
= &catch_handlers_breakpoint_ops
;
14151 *ops
= bkpt_breakpoint_ops
;
14152 ops
->allocate_location
= allocate_location_exception
;
14153 ops
->re_set
= re_set_exception
;
14154 ops
->check_status
= check_status_exception
;
14155 ops
->print_it
= print_it_exception
;
14156 ops
->print_one
= print_one_exception
;
14157 ops
->print_mention
= print_mention_exception
;
14158 ops
->print_recreate
= print_recreate_exception
;
14161 /* This module's 'new_objfile' observer. */
14164 ada_new_objfile_observer (struct objfile
*objfile
)
14166 ada_clear_symbol_cache ();
14169 /* This module's 'free_objfile' observer. */
14172 ada_free_objfile_observer (struct objfile
*objfile
)
14174 ada_clear_symbol_cache ();
14177 void _initialize_ada_language ();
14179 _initialize_ada_language ()
14181 initialize_ada_catchpoint_ops ();
14183 add_basic_prefix_cmd ("ada", no_class
,
14184 _("Prefix command for changing Ada-specific settings."),
14185 &set_ada_list
, "set ada ", 0, &setlist
);
14187 add_show_prefix_cmd ("ada", no_class
,
14188 _("Generic command for showing Ada-specific settings."),
14189 &show_ada_list
, "show ada ", 0, &showlist
);
14191 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14192 &trust_pad_over_xvs
, _("\
14193 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14194 Show whether an optimization trusting PAD types over XVS types is activated."),
14196 This is related to the encoding used by the GNAT compiler. The debugger\n\
14197 should normally trust the contents of PAD types, but certain older versions\n\
14198 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14199 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14200 work around this bug. It is always safe to turn this option \"off\", but\n\
14201 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14202 this option to \"off\" unless necessary."),
14203 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14205 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14206 &print_signatures
, _("\
14207 Enable or disable the output of formal and return types for functions in the \
14208 overloads selection menu."), _("\
14209 Show whether the output of formal and return types for functions in the \
14210 overloads selection menu is activated."),
14211 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14213 add_catch_command ("exception", _("\
14214 Catch Ada exceptions, when raised.\n\
14215 Usage: catch exception [ARG] [if CONDITION]\n\
14216 Without any argument, stop when any Ada exception is raised.\n\
14217 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14218 being raised does not have a handler (and will therefore lead to the task's\n\
14220 Otherwise, the catchpoint only stops when the name of the exception being\n\
14221 raised is the same as ARG.\n\
14222 CONDITION is a boolean expression that is evaluated to see whether the\n\
14223 exception should cause a stop."),
14224 catch_ada_exception_command
,
14225 catch_ada_completer
,
14229 add_catch_command ("handlers", _("\
14230 Catch Ada exceptions, when handled.\n\
14231 Usage: catch handlers [ARG] [if CONDITION]\n\
14232 Without any argument, stop when any Ada exception is handled.\n\
14233 With an argument, catch only exceptions with the given name.\n\
14234 CONDITION is a boolean expression that is evaluated to see whether the\n\
14235 exception should cause a stop."),
14236 catch_ada_handlers_command
,
14237 catch_ada_completer
,
14240 add_catch_command ("assert", _("\
14241 Catch failed Ada assertions, when raised.\n\
14242 Usage: catch assert [if CONDITION]\n\
14243 CONDITION is a boolean expression that is evaluated to see whether the\n\
14244 exception should cause a stop."),
14245 catch_assert_command
,
14250 varsize_limit
= 65536;
14251 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14252 &varsize_limit
, _("\
14253 Set the maximum number of bytes allowed in a variable-size object."), _("\
14254 Show the maximum number of bytes allowed in a variable-size object."), _("\
14255 Attempts to access an object whose size is not a compile-time constant\n\
14256 and exceeds this limit will cause an error."),
14257 NULL
, NULL
, &setlist
, &showlist
);
14259 add_info ("exceptions", info_exceptions_command
,
14261 List all Ada exception names.\n\
14262 Usage: info exceptions [REGEXP]\n\
14263 If a regular expression is passed as an argument, only those matching\n\
14264 the regular expression are listed."));
14266 add_basic_prefix_cmd ("ada", class_maintenance
,
14267 _("Set Ada maintenance-related variables."),
14268 &maint_set_ada_cmdlist
, "maintenance set ada ",
14269 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14271 add_show_prefix_cmd ("ada", class_maintenance
,
14272 _("Show Ada maintenance-related variables."),
14273 &maint_show_ada_cmdlist
, "maintenance show ada ",
14274 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14276 add_setshow_boolean_cmd
14277 ("ignore-descriptive-types", class_maintenance
,
14278 &ada_ignore_descriptive_types_p
,
14279 _("Set whether descriptive types generated by GNAT should be ignored."),
14280 _("Show whether descriptive types generated by GNAT should be ignored."),
14282 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14283 DWARF attribute."),
14284 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14286 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14287 NULL
, xcalloc
, xfree
);
14289 /* The ada-lang observers. */
14290 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14291 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14292 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);