1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2018 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/>. */
24 #include "gdb_regex.h"
29 #include "expression.h"
30 #include "parser-defs.h"
37 #include "breakpoint.h"
40 #include "gdb_obstack.h"
42 #include "completer.h"
47 #include "dictionary.h"
55 #include "typeprint.h"
56 #include "namespace.h"
60 #include "mi/mi-common.h"
61 #include "arch-utils.h"
62 #include "cli/cli-utils.h"
63 #include "common/function-view.h"
64 #include "common/byte-vector.h"
67 /* Define whether or not the C operator '/' truncates towards zero for
68 differently signed operands (truncation direction is undefined in C).
69 Copied from valarith.c. */
71 #ifndef TRUNCATION_TOWARDS_ZERO
72 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
75 static struct type
*desc_base_type (struct type
*);
77 static struct type
*desc_bounds_type (struct type
*);
79 static struct value
*desc_bounds (struct value
*);
81 static int fat_pntr_bounds_bitpos (struct type
*);
83 static int fat_pntr_bounds_bitsize (struct type
*);
85 static struct type
*desc_data_target_type (struct type
*);
87 static struct value
*desc_data (struct value
*);
89 static int fat_pntr_data_bitpos (struct type
*);
91 static int fat_pntr_data_bitsize (struct type
*);
93 static struct value
*desc_one_bound (struct value
*, int, int);
95 static int desc_bound_bitpos (struct type
*, int, int);
97 static int desc_bound_bitsize (struct type
*, int, int);
99 static struct type
*desc_index_type (struct type
*, int);
101 static int desc_arity (struct type
*);
103 static int ada_type_match (struct type
*, struct type
*, int);
105 static int ada_args_match (struct symbol
*, struct value
**, int);
107 static struct value
*make_array_descriptor (struct type
*, struct value
*);
109 static void ada_add_block_symbols (struct obstack
*,
110 const struct block
*,
111 const lookup_name_info
&lookup_name
,
112 domain_enum
, struct objfile
*);
114 static void ada_add_all_symbols (struct obstack
*, const struct block
*,
115 const lookup_name_info
&lookup_name
,
116 domain_enum
, int, int *);
118 static int is_nonfunction (struct block_symbol
*, int);
120 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
121 const struct block
*);
123 static int num_defns_collected (struct obstack
*);
125 static struct block_symbol
*defns_collected (struct obstack
*, int);
127 static struct value
*resolve_subexp (expression_up
*, int *, int,
130 static void replace_operator_with_call (expression_up
*, int, int, int,
131 struct symbol
*, const struct block
*);
133 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
135 static const char *ada_op_name (enum exp_opcode
);
137 static const char *ada_decoded_op_name (enum exp_opcode
);
139 static int numeric_type_p (struct type
*);
141 static int integer_type_p (struct type
*);
143 static int scalar_type_p (struct type
*);
145 static int discrete_type_p (struct type
*);
147 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
152 static struct symbol
*find_old_style_renaming_symbol (const char *,
153 const struct block
*);
155 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
158 static struct value
*evaluate_subexp_type (struct expression
*, int *);
160 static struct type
*ada_find_parallel_type_with_name (struct type
*,
163 static int is_dynamic_field (struct type
*, int);
165 static struct type
*to_fixed_variant_branch_type (struct type
*,
167 CORE_ADDR
, struct value
*);
169 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
171 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
173 static struct type
*to_static_fixed_type (struct type
*);
174 static struct type
*static_unwrap_type (struct type
*type
);
176 static struct value
*unwrap_value (struct value
*);
178 static struct type
*constrained_packed_array_type (struct type
*, long *);
180 static struct type
*decode_constrained_packed_array_type (struct type
*);
182 static long decode_packed_array_bitsize (struct type
*);
184 static struct value
*decode_constrained_packed_array (struct value
*);
186 static int ada_is_packed_array_type (struct type
*);
188 static int ada_is_unconstrained_packed_array_type (struct type
*);
190 static struct value
*value_subscript_packed (struct value
*, int,
193 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
195 static struct value
*coerce_unspec_val_to_type (struct value
*,
198 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
200 static int equiv_types (struct type
*, struct type
*);
202 static int is_name_suffix (const char *);
204 static int advance_wild_match (const char **, const char *, int);
206 static bool wild_match (const char *name
, const char *patn
);
208 static struct value
*ada_coerce_ref (struct value
*);
210 static LONGEST
pos_atr (struct value
*);
212 static struct value
*value_pos_atr (struct type
*, struct value
*);
214 static struct value
*value_val_atr (struct type
*, struct value
*);
216 static struct symbol
*standard_lookup (const char *, const struct block
*,
219 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
222 static struct value
*ada_value_primitive_field (struct value
*, int, int,
225 static int find_struct_field (const char *, struct type
*, int,
226 struct type
**, int *, int *, int *, int *);
228 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
231 static int ada_resolve_function (struct block_symbol
*, int,
232 struct value
**, int, const char *,
235 static int ada_is_direct_array_type (struct type
*);
237 static void ada_language_arch_info (struct gdbarch
*,
238 struct language_arch_info
*);
240 static struct value
*ada_index_struct_field (int, struct value
*, int,
243 static struct value
*assign_aggregate (struct value
*, struct value
*,
247 static void aggregate_assign_from_choices (struct value
*, struct value
*,
249 int *, LONGEST
*, int *,
250 int, LONGEST
, LONGEST
);
252 static void aggregate_assign_positional (struct value
*, struct value
*,
254 int *, LONGEST
*, int *, int,
258 static void aggregate_assign_others (struct value
*, struct value
*,
260 int *, LONGEST
*, int, LONGEST
, LONGEST
);
263 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
266 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
269 static void ada_forward_operator_length (struct expression
*, int, int *,
272 static struct type
*ada_find_any_type (const char *name
);
274 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
275 (const lookup_name_info
&lookup_name
);
279 /* The result of a symbol lookup to be stored in our symbol cache. */
283 /* The name used to perform the lookup. */
285 /* The namespace used during the lookup. */
287 /* The symbol returned by the lookup, or NULL if no matching symbol
290 /* The block where the symbol was found, or NULL if no matching
292 const struct block
*block
;
293 /* A pointer to the next entry with the same hash. */
294 struct cache_entry
*next
;
297 /* The Ada symbol cache, used to store the result of Ada-mode symbol
298 lookups in the course of executing the user's commands.
300 The cache is implemented using a simple, fixed-sized hash.
301 The size is fixed on the grounds that there are not likely to be
302 all that many symbols looked up during any given session, regardless
303 of the size of the symbol table. If we decide to go to a resizable
304 table, let's just use the stuff from libiberty instead. */
306 #define HASH_SIZE 1009
308 struct ada_symbol_cache
310 /* An obstack used to store the entries in our cache. */
311 struct obstack cache_space
;
313 /* The root of the hash table used to implement our symbol cache. */
314 struct cache_entry
*root
[HASH_SIZE
];
317 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
319 /* Maximum-sized dynamic type. */
320 static unsigned int varsize_limit
;
322 static const char ada_completer_word_break_characters
[] =
324 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
326 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
329 /* The name of the symbol to use to get the name of the main subprogram. */
330 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
331 = "__gnat_ada_main_program_name";
333 /* Limit on the number of warnings to raise per expression evaluation. */
334 static int warning_limit
= 2;
336 /* Number of warning messages issued; reset to 0 by cleanups after
337 expression evaluation. */
338 static int warnings_issued
= 0;
340 static const char *known_runtime_file_name_patterns
[] = {
341 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
344 static const char *known_auxiliary_function_name_patterns
[] = {
345 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
348 /* Maintenance-related settings for this module. */
350 static struct cmd_list_element
*maint_set_ada_cmdlist
;
351 static struct cmd_list_element
*maint_show_ada_cmdlist
;
353 /* Implement the "maintenance set ada" (prefix) command. */
356 maint_set_ada_cmd (const char *args
, int from_tty
)
358 help_list (maint_set_ada_cmdlist
, "maintenance set ada ", all_commands
,
362 /* Implement the "maintenance show ada" (prefix) command. */
365 maint_show_ada_cmd (const char *args
, int from_tty
)
367 cmd_show_list (maint_show_ada_cmdlist
, from_tty
, "");
370 /* The "maintenance ada set/show ignore-descriptive-type" value. */
372 static int ada_ignore_descriptive_types_p
= 0;
374 /* Inferior-specific data. */
376 /* Per-inferior data for this module. */
378 struct ada_inferior_data
380 /* The ada__tags__type_specific_data type, which is used when decoding
381 tagged types. With older versions of GNAT, this type was directly
382 accessible through a component ("tsd") in the object tag. But this
383 is no longer the case, so we cache it for each inferior. */
384 struct type
*tsd_type
;
386 /* The exception_support_info data. This data is used to determine
387 how to implement support for Ada exception catchpoints in a given
389 const struct exception_support_info
*exception_info
;
392 /* Our key to this module's inferior data. */
393 static const struct inferior_data
*ada_inferior_data
;
395 /* A cleanup routine for our inferior data. */
397 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
399 struct ada_inferior_data
*data
;
401 data
= (struct ada_inferior_data
*) inferior_data (inf
, ada_inferior_data
);
406 /* Return our inferior data for the given inferior (INF).
408 This function always returns a valid pointer to an allocated
409 ada_inferior_data structure. If INF's inferior data has not
410 been previously set, this functions creates a new one with all
411 fields set to zero, sets INF's inferior to it, and then returns
412 a pointer to that newly allocated ada_inferior_data. */
414 static struct ada_inferior_data
*
415 get_ada_inferior_data (struct inferior
*inf
)
417 struct ada_inferior_data
*data
;
419 data
= (struct ada_inferior_data
*) inferior_data (inf
, ada_inferior_data
);
422 data
= XCNEW (struct ada_inferior_data
);
423 set_inferior_data (inf
, ada_inferior_data
, data
);
429 /* Perform all necessary cleanups regarding our module's inferior data
430 that is required after the inferior INF just exited. */
433 ada_inferior_exit (struct inferior
*inf
)
435 ada_inferior_data_cleanup (inf
, NULL
);
436 set_inferior_data (inf
, ada_inferior_data
, NULL
);
440 /* program-space-specific data. */
442 /* This module's per-program-space data. */
443 struct ada_pspace_data
445 /* The Ada symbol cache. */
446 struct ada_symbol_cache
*sym_cache
;
449 /* Key to our per-program-space data. */
450 static const struct program_space_data
*ada_pspace_data_handle
;
452 /* Return this module's data for the given program space (PSPACE).
453 If not is found, add a zero'ed one now.
455 This function always returns a valid object. */
457 static struct ada_pspace_data
*
458 get_ada_pspace_data (struct program_space
*pspace
)
460 struct ada_pspace_data
*data
;
462 data
= ((struct ada_pspace_data
*)
463 program_space_data (pspace
, ada_pspace_data_handle
));
466 data
= XCNEW (struct ada_pspace_data
);
467 set_program_space_data (pspace
, ada_pspace_data_handle
, data
);
473 /* The cleanup callback for this module's per-program-space data. */
476 ada_pspace_data_cleanup (struct program_space
*pspace
, void *data
)
478 struct ada_pspace_data
*pspace_data
= (struct ada_pspace_data
*) data
;
480 if (pspace_data
->sym_cache
!= NULL
)
481 ada_free_symbol_cache (pspace_data
->sym_cache
);
487 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
488 all typedef layers have been peeled. Otherwise, return TYPE.
490 Normally, we really expect a typedef type to only have 1 typedef layer.
491 In other words, we really expect the target type of a typedef type to be
492 a non-typedef type. This is particularly true for Ada units, because
493 the language does not have a typedef vs not-typedef distinction.
494 In that respect, the Ada compiler has been trying to eliminate as many
495 typedef definitions in the debugging information, since they generally
496 do not bring any extra information (we still use typedef under certain
497 circumstances related mostly to the GNAT encoding).
499 Unfortunately, we have seen situations where the debugging information
500 generated by the compiler leads to such multiple typedef layers. For
501 instance, consider the following example with stabs:
503 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
504 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
506 This is an error in the debugging information which causes type
507 pck__float_array___XUP to be defined twice, and the second time,
508 it is defined as a typedef of a typedef.
510 This is on the fringe of legality as far as debugging information is
511 concerned, and certainly unexpected. But it is easy to handle these
512 situations correctly, so we can afford to be lenient in this case. */
515 ada_typedef_target_type (struct type
*type
)
517 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
518 type
= TYPE_TARGET_TYPE (type
);
522 /* Given DECODED_NAME a string holding a symbol name in its
523 decoded form (ie using the Ada dotted notation), returns
524 its unqualified name. */
527 ada_unqualified_name (const char *decoded_name
)
531 /* If the decoded name starts with '<', it means that the encoded
532 name does not follow standard naming conventions, and thus that
533 it is not your typical Ada symbol name. Trying to unqualify it
534 is therefore pointless and possibly erroneous. */
535 if (decoded_name
[0] == '<')
538 result
= strrchr (decoded_name
, '.');
540 result
++; /* Skip the dot... */
542 result
= decoded_name
;
547 /* Return a string starting with '<', followed by STR, and '>'.
548 The result is good until the next call. */
551 add_angle_brackets (const char *str
)
553 static char *result
= NULL
;
556 result
= xstrprintf ("<%s>", str
);
561 ada_get_gdb_completer_word_break_characters (void)
563 return ada_completer_word_break_characters
;
566 /* Print an array element index using the Ada syntax. */
569 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
570 const struct value_print_options
*options
)
572 LA_VALUE_PRINT (index_value
, stream
, options
);
573 fprintf_filtered (stream
, " => ");
576 /* Assuming VECT points to an array of *SIZE objects of size
577 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
578 updating *SIZE as necessary and returning the (new) array. */
581 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
583 if (*size
< min_size
)
586 if (*size
< min_size
)
588 vect
= xrealloc (vect
, *size
* element_size
);
593 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
594 suffix of FIELD_NAME beginning "___". */
597 field_name_match (const char *field_name
, const char *target
)
599 int len
= strlen (target
);
602 (strncmp (field_name
, target
, len
) == 0
603 && (field_name
[len
] == '\0'
604 || (startswith (field_name
+ len
, "___")
605 && strcmp (field_name
+ strlen (field_name
) - 6,
610 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
611 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
612 and return its index. This function also handles fields whose name
613 have ___ suffixes because the compiler sometimes alters their name
614 by adding such a suffix to represent fields with certain constraints.
615 If the field could not be found, return a negative number if
616 MAYBE_MISSING is set. Otherwise raise an error. */
619 ada_get_field_index (const struct type
*type
, const char *field_name
,
623 struct type
*struct_type
= check_typedef ((struct type
*) type
);
625 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
626 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
630 error (_("Unable to find field %s in struct %s. Aborting"),
631 field_name
, TYPE_NAME (struct_type
));
636 /* The length of the prefix of NAME prior to any "___" suffix. */
639 ada_name_prefix_len (const char *name
)
645 const char *p
= strstr (name
, "___");
648 return strlen (name
);
654 /* Return non-zero if SUFFIX is a suffix of STR.
655 Return zero if STR is null. */
658 is_suffix (const char *str
, const char *suffix
)
665 len2
= strlen (suffix
);
666 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
669 /* The contents of value VAL, treated as a value of type TYPE. The
670 result is an lval in memory if VAL is. */
672 static struct value
*
673 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
675 type
= ada_check_typedef (type
);
676 if (value_type (val
) == type
)
680 struct value
*result
;
682 /* Make sure that the object size is not unreasonable before
683 trying to allocate some memory for it. */
684 ada_ensure_varsize_limit (type
);
687 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
688 result
= allocate_value_lazy (type
);
691 result
= allocate_value (type
);
692 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
694 set_value_component_location (result
, val
);
695 set_value_bitsize (result
, value_bitsize (val
));
696 set_value_bitpos (result
, value_bitpos (val
));
697 set_value_address (result
, value_address (val
));
702 static const gdb_byte
*
703 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
708 return valaddr
+ offset
;
712 cond_offset_target (CORE_ADDR address
, long offset
)
717 return address
+ offset
;
720 /* Issue a warning (as for the definition of warning in utils.c, but
721 with exactly one argument rather than ...), unless the limit on the
722 number of warnings has passed during the evaluation of the current
725 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
726 provided by "complaint". */
727 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
730 lim_warning (const char *format
, ...)
734 va_start (args
, format
);
735 warnings_issued
+= 1;
736 if (warnings_issued
<= warning_limit
)
737 vwarning (format
, args
);
742 /* Issue an error if the size of an object of type T is unreasonable,
743 i.e. if it would be a bad idea to allocate a value of this type in
747 ada_ensure_varsize_limit (const struct type
*type
)
749 if (TYPE_LENGTH (type
) > varsize_limit
)
750 error (_("object size is larger than varsize-limit"));
753 /* Maximum value of a SIZE-byte signed integer type. */
755 max_of_size (int size
)
757 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
759 return top_bit
| (top_bit
- 1);
762 /* Minimum value of a SIZE-byte signed integer type. */
764 min_of_size (int size
)
766 return -max_of_size (size
) - 1;
769 /* Maximum value of a SIZE-byte unsigned integer type. */
771 umax_of_size (int size
)
773 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
775 return top_bit
| (top_bit
- 1);
778 /* Maximum value of integral type T, as a signed quantity. */
780 max_of_type (struct type
*t
)
782 if (TYPE_UNSIGNED (t
))
783 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
785 return max_of_size (TYPE_LENGTH (t
));
788 /* Minimum value of integral type T, as a signed quantity. */
790 min_of_type (struct type
*t
)
792 if (TYPE_UNSIGNED (t
))
795 return min_of_size (TYPE_LENGTH (t
));
798 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
800 ada_discrete_type_high_bound (struct type
*type
)
802 type
= resolve_dynamic_type (type
, NULL
, 0);
803 switch (TYPE_CODE (type
))
805 case TYPE_CODE_RANGE
:
806 return TYPE_HIGH_BOUND (type
);
808 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
813 return max_of_type (type
);
815 error (_("Unexpected type in ada_discrete_type_high_bound."));
819 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
821 ada_discrete_type_low_bound (struct type
*type
)
823 type
= resolve_dynamic_type (type
, NULL
, 0);
824 switch (TYPE_CODE (type
))
826 case TYPE_CODE_RANGE
:
827 return TYPE_LOW_BOUND (type
);
829 return TYPE_FIELD_ENUMVAL (type
, 0);
834 return min_of_type (type
);
836 error (_("Unexpected type in ada_discrete_type_low_bound."));
840 /* The identity on non-range types. For range types, the underlying
841 non-range scalar type. */
844 get_base_type (struct type
*type
)
846 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
848 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
850 type
= TYPE_TARGET_TYPE (type
);
855 /* Return a decoded version of the given VALUE. This means returning
856 a value whose type is obtained by applying all the GNAT-specific
857 encondings, making the resulting type a static but standard description
858 of the initial type. */
861 ada_get_decoded_value (struct value
*value
)
863 struct type
*type
= ada_check_typedef (value_type (value
));
865 if (ada_is_array_descriptor_type (type
)
866 || (ada_is_constrained_packed_array_type (type
)
867 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
869 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
870 value
= ada_coerce_to_simple_array_ptr (value
);
872 value
= ada_coerce_to_simple_array (value
);
875 value
= ada_to_fixed_value (value
);
880 /* Same as ada_get_decoded_value, but with the given TYPE.
881 Because there is no associated actual value for this type,
882 the resulting type might be a best-effort approximation in
883 the case of dynamic types. */
886 ada_get_decoded_type (struct type
*type
)
888 type
= to_static_fixed_type (type
);
889 if (ada_is_constrained_packed_array_type (type
))
890 type
= ada_coerce_to_simple_array_type (type
);
896 /* Language Selection */
898 /* If the main program is in Ada, return language_ada, otherwise return LANG
899 (the main program is in Ada iif the adainit symbol is found). */
902 ada_update_initial_language (enum language lang
)
904 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
905 (struct objfile
*) NULL
).minsym
!= NULL
)
911 /* If the main procedure is written in Ada, then return its name.
912 The result is good until the next call. Return NULL if the main
913 procedure doesn't appear to be in Ada. */
918 struct bound_minimal_symbol msym
;
919 static char *main_program_name
= NULL
;
921 /* For Ada, the name of the main procedure is stored in a specific
922 string constant, generated by the binder. Look for that symbol,
923 extract its address, and then read that string. If we didn't find
924 that string, then most probably the main procedure is not written
926 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
928 if (msym
.minsym
!= NULL
)
930 CORE_ADDR main_program_name_addr
;
933 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
934 if (main_program_name_addr
== 0)
935 error (_("Invalid address for Ada main program name."));
937 xfree (main_program_name
);
938 target_read_string (main_program_name_addr
, &main_program_name
,
943 return main_program_name
;
946 /* The main procedure doesn't seem to be in Ada. */
952 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
955 const struct ada_opname_map ada_opname_table
[] = {
956 {"Oadd", "\"+\"", BINOP_ADD
},
957 {"Osubtract", "\"-\"", BINOP_SUB
},
958 {"Omultiply", "\"*\"", BINOP_MUL
},
959 {"Odivide", "\"/\"", BINOP_DIV
},
960 {"Omod", "\"mod\"", BINOP_MOD
},
961 {"Orem", "\"rem\"", BINOP_REM
},
962 {"Oexpon", "\"**\"", BINOP_EXP
},
963 {"Olt", "\"<\"", BINOP_LESS
},
964 {"Ole", "\"<=\"", BINOP_LEQ
},
965 {"Ogt", "\">\"", BINOP_GTR
},
966 {"Oge", "\">=\"", BINOP_GEQ
},
967 {"Oeq", "\"=\"", BINOP_EQUAL
},
968 {"One", "\"/=\"", BINOP_NOTEQUAL
},
969 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
970 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
971 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
972 {"Oconcat", "\"&\"", BINOP_CONCAT
},
973 {"Oabs", "\"abs\"", UNOP_ABS
},
974 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
975 {"Oadd", "\"+\"", UNOP_PLUS
},
976 {"Osubtract", "\"-\"", UNOP_NEG
},
980 /* The "encoded" form of DECODED, according to GNAT conventions. The
981 result is valid until the next call to ada_encode. If
982 THROW_ERRORS, throw an error if invalid operator name is found.
983 Otherwise, return NULL in that case. */
986 ada_encode_1 (const char *decoded
, bool throw_errors
)
988 static char *encoding_buffer
= NULL
;
989 static size_t encoding_buffer_size
= 0;
996 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
997 2 * strlen (decoded
) + 10);
1000 for (p
= decoded
; *p
!= '\0'; p
+= 1)
1004 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
1009 const struct ada_opname_map
*mapping
;
1011 for (mapping
= ada_opname_table
;
1012 mapping
->encoded
!= NULL
1013 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
1015 if (mapping
->encoded
== NULL
)
1018 error (_("invalid Ada operator name: %s"), p
);
1022 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
1023 k
+= strlen (mapping
->encoded
);
1028 encoding_buffer
[k
] = *p
;
1033 encoding_buffer
[k
] = '\0';
1034 return encoding_buffer
;
1037 /* The "encoded" form of DECODED, according to GNAT conventions.
1038 The result is valid until the next call to ada_encode. */
1041 ada_encode (const char *decoded
)
1043 return ada_encode_1 (decoded
, true);
1046 /* Return NAME folded to lower case, or, if surrounded by single
1047 quotes, unfolded, but with the quotes stripped away. Result good
1051 ada_fold_name (const char *name
)
1053 static char *fold_buffer
= NULL
;
1054 static size_t fold_buffer_size
= 0;
1056 int len
= strlen (name
);
1057 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1059 if (name
[0] == '\'')
1061 strncpy (fold_buffer
, name
+ 1, len
- 2);
1062 fold_buffer
[len
- 2] = '\000';
1068 for (i
= 0; i
<= len
; i
+= 1)
1069 fold_buffer
[i
] = tolower (name
[i
]);
1075 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1078 is_lower_alphanum (const char c
)
1080 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1083 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1084 This function saves in LEN the length of that same symbol name but
1085 without either of these suffixes:
1091 These are suffixes introduced by the compiler for entities such as
1092 nested subprogram for instance, in order to avoid name clashes.
1093 They do not serve any purpose for the debugger. */
1096 ada_remove_trailing_digits (const char *encoded
, int *len
)
1098 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1102 while (i
> 0 && isdigit (encoded
[i
]))
1104 if (i
>= 0 && encoded
[i
] == '.')
1106 else if (i
>= 0 && encoded
[i
] == '$')
1108 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1110 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1115 /* Remove the suffix introduced by the compiler for protected object
1119 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1121 /* Remove trailing N. */
1123 /* Protected entry subprograms are broken into two
1124 separate subprograms: The first one is unprotected, and has
1125 a 'N' suffix; the second is the protected version, and has
1126 the 'P' suffix. The second calls the first one after handling
1127 the protection. Since the P subprograms are internally generated,
1128 we leave these names undecoded, giving the user a clue that this
1129 entity is internal. */
1132 && encoded
[*len
- 1] == 'N'
1133 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1137 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1140 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
1144 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
1147 if (encoded
[i
] != 'X')
1153 if (isalnum (encoded
[i
-1]))
1157 /* If ENCODED follows the GNAT entity encoding conventions, then return
1158 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1159 replaced by ENCODED.
1161 The resulting string is valid until the next call of ada_decode.
1162 If the string is unchanged by decoding, the original string pointer
1166 ada_decode (const char *encoded
)
1173 static char *decoding_buffer
= NULL
;
1174 static size_t decoding_buffer_size
= 0;
1176 /* The name of the Ada main procedure starts with "_ada_".
1177 This prefix is not part of the decoded name, so skip this part
1178 if we see this prefix. */
1179 if (startswith (encoded
, "_ada_"))
1182 /* If the name starts with '_', then it is not a properly encoded
1183 name, so do not attempt to decode it. Similarly, if the name
1184 starts with '<', the name should not be decoded. */
1185 if (encoded
[0] == '_' || encoded
[0] == '<')
1188 len0
= strlen (encoded
);
1190 ada_remove_trailing_digits (encoded
, &len0
);
1191 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1193 /* Remove the ___X.* suffix if present. Do not forget to verify that
1194 the suffix is located before the current "end" of ENCODED. We want
1195 to avoid re-matching parts of ENCODED that have previously been
1196 marked as discarded (by decrementing LEN0). */
1197 p
= strstr (encoded
, "___");
1198 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1206 /* Remove any trailing TKB suffix. It tells us that this symbol
1207 is for the body of a task, but that information does not actually
1208 appear in the decoded name. */
1210 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1213 /* Remove any trailing TB suffix. The TB suffix is slightly different
1214 from the TKB suffix because it is used for non-anonymous task
1217 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1220 /* Remove trailing "B" suffixes. */
1221 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1223 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1226 /* Make decoded big enough for possible expansion by operator name. */
1228 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1229 decoded
= decoding_buffer
;
1231 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1233 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1236 while ((i
>= 0 && isdigit (encoded
[i
]))
1237 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1239 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1241 else if (encoded
[i
] == '$')
1245 /* The first few characters that are not alphabetic are not part
1246 of any encoding we use, so we can copy them over verbatim. */
1248 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1249 decoded
[j
] = encoded
[i
];
1254 /* Is this a symbol function? */
1255 if (at_start_name
&& encoded
[i
] == 'O')
1259 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1261 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1262 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1264 && !isalnum (encoded
[i
+ op_len
]))
1266 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1269 j
+= strlen (ada_opname_table
[k
].decoded
);
1273 if (ada_opname_table
[k
].encoded
!= NULL
)
1278 /* Replace "TK__" with "__", which will eventually be translated
1279 into "." (just below). */
1281 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1284 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1285 be translated into "." (just below). These are internal names
1286 generated for anonymous blocks inside which our symbol is nested. */
1288 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1289 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1290 && isdigit (encoded
[i
+4]))
1294 while (k
< len0
&& isdigit (encoded
[k
]))
1295 k
++; /* Skip any extra digit. */
1297 /* Double-check that the "__B_{DIGITS}+" sequence we found
1298 is indeed followed by "__". */
1299 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1303 /* Remove _E{DIGITS}+[sb] */
1305 /* Just as for protected object subprograms, there are 2 categories
1306 of subprograms created by the compiler for each entry. The first
1307 one implements the actual entry code, and has a suffix following
1308 the convention above; the second one implements the barrier and
1309 uses the same convention as above, except that the 'E' is replaced
1312 Just as above, we do not decode the name of barrier functions
1313 to give the user a clue that the code he is debugging has been
1314 internally generated. */
1316 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1317 && isdigit (encoded
[i
+2]))
1321 while (k
< len0
&& isdigit (encoded
[k
]))
1325 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1328 /* Just as an extra precaution, make sure that if this
1329 suffix is followed by anything else, it is a '_'.
1330 Otherwise, we matched this sequence by accident. */
1332 || (k
< len0
&& encoded
[k
] == '_'))
1337 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1338 the GNAT front-end in protected object subprograms. */
1341 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1343 /* Backtrack a bit up until we reach either the begining of
1344 the encoded name, or "__". Make sure that we only find
1345 digits or lowercase characters. */
1346 const char *ptr
= encoded
+ i
- 1;
1348 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1351 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1355 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1357 /* This is a X[bn]* sequence not separated from the previous
1358 part of the name with a non-alpha-numeric character (in other
1359 words, immediately following an alpha-numeric character), then
1360 verify that it is placed at the end of the encoded name. If
1361 not, then the encoding is not valid and we should abort the
1362 decoding. Otherwise, just skip it, it is used in body-nested
1366 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1370 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1372 /* Replace '__' by '.'. */
1380 /* It's a character part of the decoded name, so just copy it
1382 decoded
[j
] = encoded
[i
];
1387 decoded
[j
] = '\000';
1389 /* Decoded names should never contain any uppercase character.
1390 Double-check this, and abort the decoding if we find one. */
1392 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1393 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1396 if (strcmp (decoded
, encoded
) == 0)
1402 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1403 decoded
= decoding_buffer
;
1404 if (encoded
[0] == '<')
1405 strcpy (decoded
, encoded
);
1407 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1412 /* Table for keeping permanent unique copies of decoded names. Once
1413 allocated, names in this table are never released. While this is a
1414 storage leak, it should not be significant unless there are massive
1415 changes in the set of decoded names in successive versions of a
1416 symbol table loaded during a single session. */
1417 static struct htab
*decoded_names_store
;
1419 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1420 in the language-specific part of GSYMBOL, if it has not been
1421 previously computed. Tries to save the decoded name in the same
1422 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1423 in any case, the decoded symbol has a lifetime at least that of
1425 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1426 const, but nevertheless modified to a semantically equivalent form
1427 when a decoded name is cached in it. */
1430 ada_decode_symbol (const struct general_symbol_info
*arg
)
1432 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1433 const char **resultp
=
1434 &gsymbol
->language_specific
.demangled_name
;
1436 if (!gsymbol
->ada_mangled
)
1438 const char *decoded
= ada_decode (gsymbol
->name
);
1439 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1441 gsymbol
->ada_mangled
= 1;
1443 if (obstack
!= NULL
)
1445 = (const char *) obstack_copy0 (obstack
, decoded
, strlen (decoded
));
1448 /* Sometimes, we can't find a corresponding objfile, in
1449 which case, we put the result on the heap. Since we only
1450 decode when needed, we hope this usually does not cause a
1451 significant memory leak (FIXME). */
1453 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1457 *slot
= xstrdup (decoded
);
1466 ada_la_decode (const char *encoded
, int options
)
1468 return xstrdup (ada_decode (encoded
));
1471 /* Implement la_sniff_from_mangled_name for Ada. */
1474 ada_sniff_from_mangled_name (const char *mangled
, char **out
)
1476 const char *demangled
= ada_decode (mangled
);
1480 if (demangled
!= mangled
&& demangled
!= NULL
&& demangled
[0] != '<')
1482 /* Set the gsymbol language to Ada, but still return 0.
1483 Two reasons for that:
1485 1. For Ada, we prefer computing the symbol's decoded name
1486 on the fly rather than pre-compute it, in order to save
1487 memory (Ada projects are typically very large).
1489 2. There are some areas in the definition of the GNAT
1490 encoding where, with a bit of bad luck, we might be able
1491 to decode a non-Ada symbol, generating an incorrect
1492 demangled name (Eg: names ending with "TB" for instance
1493 are identified as task bodies and so stripped from
1494 the decoded name returned).
1496 Returning 1, here, but not setting *DEMANGLED, helps us get a
1497 little bit of the best of both worlds. Because we're last,
1498 we should not affect any of the other languages that were
1499 able to demangle the symbol before us; we get to correctly
1500 tag Ada symbols as such; and even if we incorrectly tagged a
1501 non-Ada symbol, which should be rare, any routing through the
1502 Ada language should be transparent (Ada tries to behave much
1503 like C/C++ with non-Ada symbols). */
1514 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1515 generated by the GNAT compiler to describe the index type used
1516 for each dimension of an array, check whether it follows the latest
1517 known encoding. If not, fix it up to conform to the latest encoding.
1518 Otherwise, do nothing. This function also does nothing if
1519 INDEX_DESC_TYPE is NULL.
1521 The GNAT encoding used to describle the array index type evolved a bit.
1522 Initially, the information would be provided through the name of each
1523 field of the structure type only, while the type of these fields was
1524 described as unspecified and irrelevant. The debugger was then expected
1525 to perform a global type lookup using the name of that field in order
1526 to get access to the full index type description. Because these global
1527 lookups can be very expensive, the encoding was later enhanced to make
1528 the global lookup unnecessary by defining the field type as being
1529 the full index type description.
1531 The purpose of this routine is to allow us to support older versions
1532 of the compiler by detecting the use of the older encoding, and by
1533 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1534 we essentially replace each field's meaningless type by the associated
1538 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1542 if (index_desc_type
== NULL
)
1544 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1546 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1547 to check one field only, no need to check them all). If not, return
1550 If our INDEX_DESC_TYPE was generated using the older encoding,
1551 the field type should be a meaningless integer type whose name
1552 is not equal to the field name. */
1553 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1554 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1555 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1558 /* Fixup each field of INDEX_DESC_TYPE. */
1559 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1561 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1562 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1565 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1569 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1571 static const char *bound_name
[] = {
1572 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1573 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1576 /* Maximum number of array dimensions we are prepared to handle. */
1578 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1581 /* The desc_* routines return primitive portions of array descriptors
1584 /* The descriptor or array type, if any, indicated by TYPE; removes
1585 level of indirection, if needed. */
1587 static struct type
*
1588 desc_base_type (struct type
*type
)
1592 type
= ada_check_typedef (type
);
1593 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1594 type
= ada_typedef_target_type (type
);
1597 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1598 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1599 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1604 /* True iff TYPE indicates a "thin" array pointer type. */
1607 is_thin_pntr (struct type
*type
)
1610 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1611 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1614 /* The descriptor type for thin pointer type TYPE. */
1616 static struct type
*
1617 thin_descriptor_type (struct type
*type
)
1619 struct type
*base_type
= desc_base_type (type
);
1621 if (base_type
== NULL
)
1623 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1627 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1629 if (alt_type
== NULL
)
1636 /* A pointer to the array data for thin-pointer value VAL. */
1638 static struct value
*
1639 thin_data_pntr (struct value
*val
)
1641 struct type
*type
= ada_check_typedef (value_type (val
));
1642 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1644 data_type
= lookup_pointer_type (data_type
);
1646 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1647 return value_cast (data_type
, value_copy (val
));
1649 return value_from_longest (data_type
, value_address (val
));
1652 /* True iff TYPE indicates a "thick" array pointer type. */
1655 is_thick_pntr (struct type
*type
)
1657 type
= desc_base_type (type
);
1658 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1659 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1662 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1663 pointer to one, the type of its bounds data; otherwise, NULL. */
1665 static struct type
*
1666 desc_bounds_type (struct type
*type
)
1670 type
= desc_base_type (type
);
1674 else if (is_thin_pntr (type
))
1676 type
= thin_descriptor_type (type
);
1679 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1681 return ada_check_typedef (r
);
1683 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1685 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1687 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1692 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1693 one, a pointer to its bounds data. Otherwise NULL. */
1695 static struct value
*
1696 desc_bounds (struct value
*arr
)
1698 struct type
*type
= ada_check_typedef (value_type (arr
));
1700 if (is_thin_pntr (type
))
1702 struct type
*bounds_type
=
1703 desc_bounds_type (thin_descriptor_type (type
));
1706 if (bounds_type
== NULL
)
1707 error (_("Bad GNAT array descriptor"));
1709 /* NOTE: The following calculation is not really kosher, but
1710 since desc_type is an XVE-encoded type (and shouldn't be),
1711 the correct calculation is a real pain. FIXME (and fix GCC). */
1712 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1713 addr
= value_as_long (arr
);
1715 addr
= value_address (arr
);
1718 value_from_longest (lookup_pointer_type (bounds_type
),
1719 addr
- TYPE_LENGTH (bounds_type
));
1722 else if (is_thick_pntr (type
))
1724 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1725 _("Bad GNAT array descriptor"));
1726 struct type
*p_bounds_type
= value_type (p_bounds
);
1729 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1731 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1733 if (TYPE_STUB (target_type
))
1734 p_bounds
= value_cast (lookup_pointer_type
1735 (ada_check_typedef (target_type
)),
1739 error (_("Bad GNAT array descriptor"));
1747 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1748 position of the field containing the address of the bounds data. */
1751 fat_pntr_bounds_bitpos (struct type
*type
)
1753 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1756 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1757 size of the field containing the address of the bounds data. */
1760 fat_pntr_bounds_bitsize (struct type
*type
)
1762 type
= desc_base_type (type
);
1764 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1765 return TYPE_FIELD_BITSIZE (type
, 1);
1767 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1770 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1771 pointer to one, the type of its array data (a array-with-no-bounds type);
1772 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1775 static struct type
*
1776 desc_data_target_type (struct type
*type
)
1778 type
= desc_base_type (type
);
1780 /* NOTE: The following is bogus; see comment in desc_bounds. */
1781 if (is_thin_pntr (type
))
1782 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1783 else if (is_thick_pntr (type
))
1785 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1788 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1789 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1795 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1798 static struct value
*
1799 desc_data (struct value
*arr
)
1801 struct type
*type
= value_type (arr
);
1803 if (is_thin_pntr (type
))
1804 return thin_data_pntr (arr
);
1805 else if (is_thick_pntr (type
))
1806 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1807 _("Bad GNAT array descriptor"));
1813 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1814 position of the field containing the address of the data. */
1817 fat_pntr_data_bitpos (struct type
*type
)
1819 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1822 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1823 size of the field containing the address of the data. */
1826 fat_pntr_data_bitsize (struct type
*type
)
1828 type
= desc_base_type (type
);
1830 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1831 return TYPE_FIELD_BITSIZE (type
, 0);
1833 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1836 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1837 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1838 bound, if WHICH is 1. The first bound is I=1. */
1840 static struct value
*
1841 desc_one_bound (struct value
*bounds
, int i
, int which
)
1843 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1844 _("Bad GNAT array descriptor bounds"));
1847 /* If BOUNDS is an array-bounds structure type, return the bit position
1848 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1849 bound, if WHICH is 1. The first bound is I=1. */
1852 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1854 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1857 /* If BOUNDS is an array-bounds structure type, return the bit field size
1858 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1859 bound, if WHICH is 1. The first bound is I=1. */
1862 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1864 type
= desc_base_type (type
);
1866 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1867 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1869 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1872 /* If TYPE is the type of an array-bounds structure, the type of its
1873 Ith bound (numbering from 1). Otherwise, NULL. */
1875 static struct type
*
1876 desc_index_type (struct type
*type
, int i
)
1878 type
= desc_base_type (type
);
1880 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1881 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1886 /* The number of index positions in the array-bounds type TYPE.
1887 Return 0 if TYPE is NULL. */
1890 desc_arity (struct type
*type
)
1892 type
= desc_base_type (type
);
1895 return TYPE_NFIELDS (type
) / 2;
1899 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1900 an array descriptor type (representing an unconstrained array
1904 ada_is_direct_array_type (struct type
*type
)
1908 type
= ada_check_typedef (type
);
1909 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1910 || ada_is_array_descriptor_type (type
));
1913 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1917 ada_is_array_type (struct type
*type
)
1920 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1921 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1922 type
= TYPE_TARGET_TYPE (type
);
1923 return ada_is_direct_array_type (type
);
1926 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1929 ada_is_simple_array_type (struct type
*type
)
1933 type
= ada_check_typedef (type
);
1934 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1935 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1936 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1937 == TYPE_CODE_ARRAY
));
1940 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1943 ada_is_array_descriptor_type (struct type
*type
)
1945 struct type
*data_type
= desc_data_target_type (type
);
1949 type
= ada_check_typedef (type
);
1950 return (data_type
!= NULL
1951 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1952 && desc_arity (desc_bounds_type (type
)) > 0);
1955 /* Non-zero iff type is a partially mal-formed GNAT array
1956 descriptor. FIXME: This is to compensate for some problems with
1957 debugging output from GNAT. Re-examine periodically to see if it
1961 ada_is_bogus_array_descriptor (struct type
*type
)
1965 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1966 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1967 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1968 && !ada_is_array_descriptor_type (type
);
1972 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1973 (fat pointer) returns the type of the array data described---specifically,
1974 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1975 in from the descriptor; otherwise, they are left unspecified. If
1976 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1977 returns NULL. The result is simply the type of ARR if ARR is not
1980 ada_type_of_array (struct value
*arr
, int bounds
)
1982 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1983 return decode_constrained_packed_array_type (value_type (arr
));
1985 if (!ada_is_array_descriptor_type (value_type (arr
)))
1986 return value_type (arr
);
1990 struct type
*array_type
=
1991 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1993 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1994 TYPE_FIELD_BITSIZE (array_type
, 0) =
1995 decode_packed_array_bitsize (value_type (arr
));
2001 struct type
*elt_type
;
2003 struct value
*descriptor
;
2005 elt_type
= ada_array_element_type (value_type (arr
), -1);
2006 arity
= ada_array_arity (value_type (arr
));
2008 if (elt_type
== NULL
|| arity
== 0)
2009 return ada_check_typedef (value_type (arr
));
2011 descriptor
= desc_bounds (arr
);
2012 if (value_as_long (descriptor
) == 0)
2016 struct type
*range_type
= alloc_type_copy (value_type (arr
));
2017 struct type
*array_type
= alloc_type_copy (value_type (arr
));
2018 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
2019 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
2022 create_static_range_type (range_type
, value_type (low
),
2023 longest_to_int (value_as_long (low
)),
2024 longest_to_int (value_as_long (high
)));
2025 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
2027 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
2029 /* We need to store the element packed bitsize, as well as
2030 recompute the array size, because it was previously
2031 computed based on the unpacked element size. */
2032 LONGEST lo
= value_as_long (low
);
2033 LONGEST hi
= value_as_long (high
);
2035 TYPE_FIELD_BITSIZE (elt_type
, 0) =
2036 decode_packed_array_bitsize (value_type (arr
));
2037 /* If the array has no element, then the size is already
2038 zero, and does not need to be recomputed. */
2042 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
2044 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
2049 return lookup_pointer_type (elt_type
);
2053 /* If ARR does not represent an array, returns ARR unchanged.
2054 Otherwise, returns either a standard GDB array with bounds set
2055 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2056 GDB array. Returns NULL if ARR is a null fat pointer. */
2059 ada_coerce_to_simple_array_ptr (struct value
*arr
)
2061 if (ada_is_array_descriptor_type (value_type (arr
)))
2063 struct type
*arrType
= ada_type_of_array (arr
, 1);
2065 if (arrType
== NULL
)
2067 return value_cast (arrType
, value_copy (desc_data (arr
)));
2069 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2070 return decode_constrained_packed_array (arr
);
2075 /* If ARR does not represent an array, returns ARR unchanged.
2076 Otherwise, returns a standard GDB array describing ARR (which may
2077 be ARR itself if it already is in the proper form). */
2080 ada_coerce_to_simple_array (struct value
*arr
)
2082 if (ada_is_array_descriptor_type (value_type (arr
)))
2084 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2087 error (_("Bounds unavailable for null array pointer."));
2088 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
2089 return value_ind (arrVal
);
2091 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2092 return decode_constrained_packed_array (arr
);
2097 /* If TYPE represents a GNAT array type, return it translated to an
2098 ordinary GDB array type (possibly with BITSIZE fields indicating
2099 packing). For other types, is the identity. */
2102 ada_coerce_to_simple_array_type (struct type
*type
)
2104 if (ada_is_constrained_packed_array_type (type
))
2105 return decode_constrained_packed_array_type (type
);
2107 if (ada_is_array_descriptor_type (type
))
2108 return ada_check_typedef (desc_data_target_type (type
));
2113 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2116 ada_is_packed_array_type (struct type
*type
)
2120 type
= desc_base_type (type
);
2121 type
= ada_check_typedef (type
);
2123 ada_type_name (type
) != NULL
2124 && strstr (ada_type_name (type
), "___XP") != NULL
;
2127 /* Non-zero iff TYPE represents a standard GNAT constrained
2128 packed-array type. */
2131 ada_is_constrained_packed_array_type (struct type
*type
)
2133 return ada_is_packed_array_type (type
)
2134 && !ada_is_array_descriptor_type (type
);
2137 /* Non-zero iff TYPE represents an array descriptor for a
2138 unconstrained packed-array type. */
2141 ada_is_unconstrained_packed_array_type (struct type
*type
)
2143 return ada_is_packed_array_type (type
)
2144 && ada_is_array_descriptor_type (type
);
2147 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2148 return the size of its elements in bits. */
2151 decode_packed_array_bitsize (struct type
*type
)
2153 const char *raw_name
;
2157 /* Access to arrays implemented as fat pointers are encoded as a typedef
2158 of the fat pointer type. We need the name of the fat pointer type
2159 to do the decoding, so strip the typedef layer. */
2160 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2161 type
= ada_typedef_target_type (type
);
2163 raw_name
= ada_type_name (ada_check_typedef (type
));
2165 raw_name
= ada_type_name (desc_base_type (type
));
2170 tail
= strstr (raw_name
, "___XP");
2171 gdb_assert (tail
!= NULL
);
2173 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2176 (_("could not understand bit size information on packed array"));
2183 /* Given that TYPE is a standard GDB array type with all bounds filled
2184 in, and that the element size of its ultimate scalar constituents
2185 (that is, either its elements, or, if it is an array of arrays, its
2186 elements' elements, etc.) is *ELT_BITS, return an identical type,
2187 but with the bit sizes of its elements (and those of any
2188 constituent arrays) recorded in the BITSIZE components of its
2189 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2192 Note that, for arrays whose index type has an XA encoding where
2193 a bound references a record discriminant, getting that discriminant,
2194 and therefore the actual value of that bound, is not possible
2195 because none of the given parameters gives us access to the record.
2196 This function assumes that it is OK in the context where it is being
2197 used to return an array whose bounds are still dynamic and where
2198 the length is arbitrary. */
2200 static struct type
*
2201 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2203 struct type
*new_elt_type
;
2204 struct type
*new_type
;
2205 struct type
*index_type_desc
;
2206 struct type
*index_type
;
2207 LONGEST low_bound
, high_bound
;
2209 type
= ada_check_typedef (type
);
2210 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2213 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2214 if (index_type_desc
)
2215 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2218 index_type
= TYPE_INDEX_TYPE (type
);
2220 new_type
= alloc_type_copy (type
);
2222 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2224 create_array_type (new_type
, new_elt_type
, index_type
);
2225 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2226 TYPE_NAME (new_type
) = ada_type_name (type
);
2228 if ((TYPE_CODE (check_typedef (index_type
)) == TYPE_CODE_RANGE
2229 && is_dynamic_type (check_typedef (index_type
)))
2230 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2231 low_bound
= high_bound
= 0;
2232 if (high_bound
< low_bound
)
2233 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2236 *elt_bits
*= (high_bound
- low_bound
+ 1);
2237 TYPE_LENGTH (new_type
) =
2238 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2241 TYPE_FIXED_INSTANCE (new_type
) = 1;
2245 /* The array type encoded by TYPE, where
2246 ada_is_constrained_packed_array_type (TYPE). */
2248 static struct type
*
2249 decode_constrained_packed_array_type (struct type
*type
)
2251 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2254 struct type
*shadow_type
;
2258 raw_name
= ada_type_name (desc_base_type (type
));
2263 name
= (char *) alloca (strlen (raw_name
) + 1);
2264 tail
= strstr (raw_name
, "___XP");
2265 type
= desc_base_type (type
);
2267 memcpy (name
, raw_name
, tail
- raw_name
);
2268 name
[tail
- raw_name
] = '\000';
2270 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2272 if (shadow_type
== NULL
)
2274 lim_warning (_("could not find bounds information on packed array"));
2277 shadow_type
= check_typedef (shadow_type
);
2279 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2281 lim_warning (_("could not understand bounds "
2282 "information on packed array"));
2286 bits
= decode_packed_array_bitsize (type
);
2287 return constrained_packed_array_type (shadow_type
, &bits
);
2290 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2291 array, returns a simple array that denotes that array. Its type is a
2292 standard GDB array type except that the BITSIZEs of the array
2293 target types are set to the number of bits in each element, and the
2294 type length is set appropriately. */
2296 static struct value
*
2297 decode_constrained_packed_array (struct value
*arr
)
2301 /* If our value is a pointer, then dereference it. Likewise if
2302 the value is a reference. Make sure that this operation does not
2303 cause the target type to be fixed, as this would indirectly cause
2304 this array to be decoded. The rest of the routine assumes that
2305 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2306 and "value_ind" routines to perform the dereferencing, as opposed
2307 to using "ada_coerce_ref" or "ada_value_ind". */
2308 arr
= coerce_ref (arr
);
2309 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2310 arr
= value_ind (arr
);
2312 type
= decode_constrained_packed_array_type (value_type (arr
));
2315 error (_("can't unpack array"));
2319 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2320 && ada_is_modular_type (value_type (arr
)))
2322 /* This is a (right-justified) modular type representing a packed
2323 array with no wrapper. In order to interpret the value through
2324 the (left-justified) packed array type we just built, we must
2325 first left-justify it. */
2326 int bit_size
, bit_pos
;
2329 mod
= ada_modulus (value_type (arr
)) - 1;
2336 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2337 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2338 bit_pos
/ HOST_CHAR_BIT
,
2339 bit_pos
% HOST_CHAR_BIT
,
2344 return coerce_unspec_val_to_type (arr
, type
);
2348 /* The value of the element of packed array ARR at the ARITY indices
2349 given in IND. ARR must be a simple array. */
2351 static struct value
*
2352 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2355 int bits
, elt_off
, bit_off
;
2356 long elt_total_bit_offset
;
2357 struct type
*elt_type
;
2361 elt_total_bit_offset
= 0;
2362 elt_type
= ada_check_typedef (value_type (arr
));
2363 for (i
= 0; i
< arity
; i
+= 1)
2365 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2366 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2368 (_("attempt to do packed indexing of "
2369 "something other than a packed array"));
2372 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2373 LONGEST lowerbound
, upperbound
;
2376 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2378 lim_warning (_("don't know bounds of array"));
2379 lowerbound
= upperbound
= 0;
2382 idx
= pos_atr (ind
[i
]);
2383 if (idx
< lowerbound
|| idx
> upperbound
)
2384 lim_warning (_("packed array index %ld out of bounds"),
2386 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2387 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2388 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2391 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2392 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2394 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2399 /* Non-zero iff TYPE includes negative integer values. */
2402 has_negatives (struct type
*type
)
2404 switch (TYPE_CODE (type
))
2409 return !TYPE_UNSIGNED (type
);
2410 case TYPE_CODE_RANGE
:
2411 return TYPE_LOW_BOUND (type
) < 0;
2415 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2416 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2417 the unpacked buffer.
2419 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2420 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2422 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2425 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2427 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2430 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2431 gdb_byte
*unpacked
, int unpacked_len
,
2432 int is_big_endian
, int is_signed_type
,
2435 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2436 int src_idx
; /* Index into the source area */
2437 int src_bytes_left
; /* Number of source bytes left to process. */
2438 int srcBitsLeft
; /* Number of source bits left to move */
2439 int unusedLS
; /* Number of bits in next significant
2440 byte of source that are unused */
2442 int unpacked_idx
; /* Index into the unpacked buffer */
2443 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2445 unsigned long accum
; /* Staging area for bits being transferred */
2446 int accumSize
; /* Number of meaningful bits in accum */
2449 /* Transmit bytes from least to most significant; delta is the direction
2450 the indices move. */
2451 int delta
= is_big_endian
? -1 : 1;
2453 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2455 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2456 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2457 bit_size
, unpacked_len
);
2459 srcBitsLeft
= bit_size
;
2460 src_bytes_left
= src_len
;
2461 unpacked_bytes_left
= unpacked_len
;
2466 src_idx
= src_len
- 1;
2468 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2472 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2478 unpacked_idx
= unpacked_len
- 1;
2482 /* Non-scalar values must be aligned at a byte boundary... */
2484 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2485 /* ... And are placed at the beginning (most-significant) bytes
2487 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2488 unpacked_bytes_left
= unpacked_idx
+ 1;
2493 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2495 src_idx
= unpacked_idx
= 0;
2496 unusedLS
= bit_offset
;
2499 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2504 while (src_bytes_left
> 0)
2506 /* Mask for removing bits of the next source byte that are not
2507 part of the value. */
2508 unsigned int unusedMSMask
=
2509 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2511 /* Sign-extend bits for this byte. */
2512 unsigned int signMask
= sign
& ~unusedMSMask
;
2515 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2516 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2517 if (accumSize
>= HOST_CHAR_BIT
)
2519 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2520 accumSize
-= HOST_CHAR_BIT
;
2521 accum
>>= HOST_CHAR_BIT
;
2522 unpacked_bytes_left
-= 1;
2523 unpacked_idx
+= delta
;
2525 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2527 src_bytes_left
-= 1;
2530 while (unpacked_bytes_left
> 0)
2532 accum
|= sign
<< accumSize
;
2533 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2534 accumSize
-= HOST_CHAR_BIT
;
2537 accum
>>= HOST_CHAR_BIT
;
2538 unpacked_bytes_left
-= 1;
2539 unpacked_idx
+= delta
;
2543 /* Create a new value of type TYPE from the contents of OBJ starting
2544 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2545 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2546 assigning through the result will set the field fetched from.
2547 VALADDR is ignored unless OBJ is NULL, in which case,
2548 VALADDR+OFFSET must address the start of storage containing the
2549 packed value. The value returned in this case is never an lval.
2550 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2553 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2554 long offset
, int bit_offset
, int bit_size
,
2558 const gdb_byte
*src
; /* First byte containing data to unpack */
2560 const int is_scalar
= is_scalar_type (type
);
2561 const int is_big_endian
= gdbarch_bits_big_endian (get_type_arch (type
));
2562 gdb::byte_vector staging
;
2564 type
= ada_check_typedef (type
);
2567 src
= valaddr
+ offset
;
2569 src
= value_contents (obj
) + offset
;
2571 if (is_dynamic_type (type
))
2573 /* The length of TYPE might by dynamic, so we need to resolve
2574 TYPE in order to know its actual size, which we then use
2575 to create the contents buffer of the value we return.
2576 The difficulty is that the data containing our object is
2577 packed, and therefore maybe not at a byte boundary. So, what
2578 we do, is unpack the data into a byte-aligned buffer, and then
2579 use that buffer as our object's value for resolving the type. */
2580 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2581 staging
.resize (staging_len
);
2583 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2584 staging
.data (), staging
.size (),
2585 is_big_endian
, has_negatives (type
),
2587 type
= resolve_dynamic_type (type
, staging
.data (), 0);
2588 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2590 /* This happens when the length of the object is dynamic,
2591 and is actually smaller than the space reserved for it.
2592 For instance, in an array of variant records, the bit_size
2593 we're given is the array stride, which is constant and
2594 normally equal to the maximum size of its element.
2595 But, in reality, each element only actually spans a portion
2597 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2603 v
= allocate_value (type
);
2604 src
= valaddr
+ offset
;
2606 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2608 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2611 v
= value_at (type
, value_address (obj
) + offset
);
2612 buf
= (gdb_byte
*) alloca (src_len
);
2613 read_memory (value_address (v
), buf
, src_len
);
2618 v
= allocate_value (type
);
2619 src
= value_contents (obj
) + offset
;
2624 long new_offset
= offset
;
2626 set_value_component_location (v
, obj
);
2627 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2628 set_value_bitsize (v
, bit_size
);
2629 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2632 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2634 set_value_offset (v
, new_offset
);
2636 /* Also set the parent value. This is needed when trying to
2637 assign a new value (in inferior memory). */
2638 set_value_parent (v
, obj
);
2641 set_value_bitsize (v
, bit_size
);
2642 unpacked
= value_contents_writeable (v
);
2646 memset (unpacked
, 0, TYPE_LENGTH (type
));
2650 if (staging
.size () == TYPE_LENGTH (type
))
2652 /* Small short-cut: If we've unpacked the data into a buffer
2653 of the same size as TYPE's length, then we can reuse that,
2654 instead of doing the unpacking again. */
2655 memcpy (unpacked
, staging
.data (), staging
.size ());
2658 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2659 unpacked
, TYPE_LENGTH (type
),
2660 is_big_endian
, has_negatives (type
), is_scalar
);
2665 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2666 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2669 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2670 int src_offset
, int n
, int bits_big_endian_p
)
2672 unsigned int accum
, mask
;
2673 int accum_bits
, chunk_size
;
2675 target
+= targ_offset
/ HOST_CHAR_BIT
;
2676 targ_offset
%= HOST_CHAR_BIT
;
2677 source
+= src_offset
/ HOST_CHAR_BIT
;
2678 src_offset
%= HOST_CHAR_BIT
;
2679 if (bits_big_endian_p
)
2681 accum
= (unsigned char) *source
;
2683 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2689 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2690 accum_bits
+= HOST_CHAR_BIT
;
2692 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2695 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2696 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2699 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2701 accum_bits
-= chunk_size
;
2708 accum
= (unsigned char) *source
>> src_offset
;
2710 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2714 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2715 accum_bits
+= HOST_CHAR_BIT
;
2717 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2720 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2721 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2723 accum_bits
-= chunk_size
;
2724 accum
>>= chunk_size
;
2731 /* Store the contents of FROMVAL into the location of TOVAL.
2732 Return a new value with the location of TOVAL and contents of
2733 FROMVAL. Handles assignment into packed fields that have
2734 floating-point or non-scalar types. */
2736 static struct value
*
2737 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2739 struct type
*type
= value_type (toval
);
2740 int bits
= value_bitsize (toval
);
2742 toval
= ada_coerce_ref (toval
);
2743 fromval
= ada_coerce_ref (fromval
);
2745 if (ada_is_direct_array_type (value_type (toval
)))
2746 toval
= ada_coerce_to_simple_array (toval
);
2747 if (ada_is_direct_array_type (value_type (fromval
)))
2748 fromval
= ada_coerce_to_simple_array (fromval
);
2750 if (!deprecated_value_modifiable (toval
))
2751 error (_("Left operand of assignment is not a modifiable lvalue."));
2753 if (VALUE_LVAL (toval
) == lval_memory
2755 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2756 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2758 int len
= (value_bitpos (toval
)
2759 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2761 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2763 CORE_ADDR to_addr
= value_address (toval
);
2765 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2766 fromval
= value_cast (type
, fromval
);
2768 read_memory (to_addr
, buffer
, len
);
2769 from_size
= value_bitsize (fromval
);
2771 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2772 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2773 move_bits (buffer
, value_bitpos (toval
),
2774 value_contents (fromval
), from_size
- bits
, bits
, 1);
2776 move_bits (buffer
, value_bitpos (toval
),
2777 value_contents (fromval
), 0, bits
, 0);
2778 write_memory_with_notification (to_addr
, buffer
, len
);
2780 val
= value_copy (toval
);
2781 memcpy (value_contents_raw (val
), value_contents (fromval
),
2782 TYPE_LENGTH (type
));
2783 deprecated_set_value_type (val
, type
);
2788 return value_assign (toval
, fromval
);
2792 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2793 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2794 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2795 COMPONENT, and not the inferior's memory. The current contents
2796 of COMPONENT are ignored.
2798 Although not part of the initial design, this function also works
2799 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2800 had a null address, and COMPONENT had an address which is equal to
2801 its offset inside CONTAINER. */
2804 value_assign_to_component (struct value
*container
, struct value
*component
,
2807 LONGEST offset_in_container
=
2808 (LONGEST
) (value_address (component
) - value_address (container
));
2809 int bit_offset_in_container
=
2810 value_bitpos (component
) - value_bitpos (container
);
2813 val
= value_cast (value_type (component
), val
);
2815 if (value_bitsize (component
) == 0)
2816 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2818 bits
= value_bitsize (component
);
2820 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2821 move_bits (value_contents_writeable (container
) + offset_in_container
,
2822 value_bitpos (container
) + bit_offset_in_container
,
2823 value_contents (val
),
2824 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2827 move_bits (value_contents_writeable (container
) + offset_in_container
,
2828 value_bitpos (container
) + bit_offset_in_container
,
2829 value_contents (val
), 0, bits
, 0);
2832 /* The value of the element of array ARR at the ARITY indices given in IND.
2833 ARR may be either a simple array, GNAT array descriptor, or pointer
2837 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2841 struct type
*elt_type
;
2843 elt
= ada_coerce_to_simple_array (arr
);
2845 elt_type
= ada_check_typedef (value_type (elt
));
2846 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2847 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2848 return value_subscript_packed (elt
, arity
, ind
);
2850 for (k
= 0; k
< arity
; k
+= 1)
2852 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2853 error (_("too many subscripts (%d expected)"), k
);
2854 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2859 /* Assuming ARR is a pointer to a GDB array, the value of the element
2860 of *ARR at the ARITY indices given in IND.
2861 Does not read the entire array into memory.
2863 Note: Unlike what one would expect, this function is used instead of
2864 ada_value_subscript for basically all non-packed array types. The reason
2865 for this is that a side effect of doing our own pointer arithmetics instead
2866 of relying on value_subscript is that there is no implicit typedef peeling.
2867 This is important for arrays of array accesses, where it allows us to
2868 preserve the fact that the array's element is an array access, where the
2869 access part os encoded in a typedef layer. */
2871 static struct value
*
2872 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2875 struct value
*array_ind
= ada_value_ind (arr
);
2877 = check_typedef (value_enclosing_type (array_ind
));
2879 if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
2880 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2881 return value_subscript_packed (array_ind
, arity
, ind
);
2883 for (k
= 0; k
< arity
; k
+= 1)
2886 struct value
*lwb_value
;
2888 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2889 error (_("too many subscripts (%d expected)"), k
);
2890 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2892 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2893 lwb_value
= value_from_longest (value_type(ind
[k
]), lwb
);
2894 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - pos_atr (lwb_value
));
2895 type
= TYPE_TARGET_TYPE (type
);
2898 return value_ind (arr
);
2901 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2902 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2903 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2904 this array is LOW, as per Ada rules. */
2905 static struct value
*
2906 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2909 struct type
*type0
= ada_check_typedef (type
);
2910 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
));
2911 struct type
*index_type
2912 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2913 struct type
*slice_type
= create_array_type_with_stride
2914 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2915 get_dyn_prop (DYN_PROP_BYTE_STRIDE
, type0
),
2916 TYPE_FIELD_BITSIZE (type0
, 0));
2917 int base_low
= ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
));
2918 LONGEST base_low_pos
, low_pos
;
2921 if (!discrete_position (base_index_type
, low
, &low_pos
)
2922 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2924 warning (_("unable to get positions in slice, use bounds instead"));
2926 base_low_pos
= base_low
;
2929 base
= value_as_address (array_ptr
)
2930 + ((low_pos
- base_low_pos
)
2931 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2932 return value_at_lazy (slice_type
, base
);
2936 static struct value
*
2937 ada_value_slice (struct value
*array
, int low
, int high
)
2939 struct type
*type
= ada_check_typedef (value_type (array
));
2940 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2941 struct type
*index_type
2942 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2943 struct type
*slice_type
= create_array_type_with_stride
2944 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2945 get_dyn_prop (DYN_PROP_BYTE_STRIDE
, type
),
2946 TYPE_FIELD_BITSIZE (type
, 0));
2947 LONGEST low_pos
, high_pos
;
2949 if (!discrete_position (base_index_type
, low
, &low_pos
)
2950 || !discrete_position (base_index_type
, high
, &high_pos
))
2952 warning (_("unable to get positions in slice, use bounds instead"));
2957 return value_cast (slice_type
,
2958 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2961 /* If type is a record type in the form of a standard GNAT array
2962 descriptor, returns the number of dimensions for type. If arr is a
2963 simple array, returns the number of "array of"s that prefix its
2964 type designation. Otherwise, returns 0. */
2967 ada_array_arity (struct type
*type
)
2974 type
= desc_base_type (type
);
2977 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2978 return desc_arity (desc_bounds_type (type
));
2980 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2983 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2989 /* If TYPE is a record type in the form of a standard GNAT array
2990 descriptor or a simple array type, returns the element type for
2991 TYPE after indexing by NINDICES indices, or by all indices if
2992 NINDICES is -1. Otherwise, returns NULL. */
2995 ada_array_element_type (struct type
*type
, int nindices
)
2997 type
= desc_base_type (type
);
2999 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
3002 struct type
*p_array_type
;
3004 p_array_type
= desc_data_target_type (type
);
3006 k
= ada_array_arity (type
);
3010 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
3011 if (nindices
>= 0 && k
> nindices
)
3013 while (k
> 0 && p_array_type
!= NULL
)
3015 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
3018 return p_array_type
;
3020 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
3022 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
3024 type
= TYPE_TARGET_TYPE (type
);
3033 /* The type of nth index in arrays of given type (n numbering from 1).
3034 Does not examine memory. Throws an error if N is invalid or TYPE
3035 is not an array type. NAME is the name of the Ada attribute being
3036 evaluated ('range, 'first, 'last, or 'length); it is used in building
3037 the error message. */
3039 static struct type
*
3040 ada_index_type (struct type
*type
, int n
, const char *name
)
3042 struct type
*result_type
;
3044 type
= desc_base_type (type
);
3046 if (n
< 0 || n
> ada_array_arity (type
))
3047 error (_("invalid dimension number to '%s"), name
);
3049 if (ada_is_simple_array_type (type
))
3053 for (i
= 1; i
< n
; i
+= 1)
3054 type
= TYPE_TARGET_TYPE (type
);
3055 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
3056 /* FIXME: The stabs type r(0,0);bound;bound in an array type
3057 has a target type of TYPE_CODE_UNDEF. We compensate here, but
3058 perhaps stabsread.c would make more sense. */
3059 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
3064 result_type
= desc_index_type (desc_bounds_type (type
), n
);
3065 if (result_type
== NULL
)
3066 error (_("attempt to take bound of something that is not an array"));
3072 /* Given that arr is an array type, returns the lower bound of the
3073 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
3074 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
3075 array-descriptor type. It works for other arrays with bounds supplied
3076 by run-time quantities other than discriminants. */
3079 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
3081 struct type
*type
, *index_type_desc
, *index_type
;
3084 gdb_assert (which
== 0 || which
== 1);
3086 if (ada_is_constrained_packed_array_type (arr_type
))
3087 arr_type
= decode_constrained_packed_array_type (arr_type
);
3089 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
3090 return (LONGEST
) - which
;
3092 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
3093 type
= TYPE_TARGET_TYPE (arr_type
);
3097 if (TYPE_FIXED_INSTANCE (type
))
3099 /* The array has already been fixed, so we do not need to
3100 check the parallel ___XA type again. That encoding has
3101 already been applied, so ignore it now. */
3102 index_type_desc
= NULL
;
3106 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3107 ada_fixup_array_indexes_type (index_type_desc
);
3110 if (index_type_desc
!= NULL
)
3111 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
3115 struct type
*elt_type
= check_typedef (type
);
3117 for (i
= 1; i
< n
; i
++)
3118 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3120 index_type
= TYPE_INDEX_TYPE (elt_type
);
3124 (LONGEST
) (which
== 0
3125 ? ada_discrete_type_low_bound (index_type
)
3126 : ada_discrete_type_high_bound (index_type
));
3129 /* Given that arr is an array value, returns the lower bound of the
3130 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3131 WHICH is 1. This routine will also work for arrays with bounds
3132 supplied by run-time quantities other than discriminants. */
3135 ada_array_bound (struct value
*arr
, int n
, int which
)
3137 struct type
*arr_type
;
3139 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3140 arr
= value_ind (arr
);
3141 arr_type
= value_enclosing_type (arr
);
3143 if (ada_is_constrained_packed_array_type (arr_type
))
3144 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3145 else if (ada_is_simple_array_type (arr_type
))
3146 return ada_array_bound_from_type (arr_type
, n
, which
);
3148 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3151 /* Given that arr is an array value, returns the length of the
3152 nth index. This routine will also work for arrays with bounds
3153 supplied by run-time quantities other than discriminants.
3154 Does not work for arrays indexed by enumeration types with representation
3155 clauses at the moment. */
3158 ada_array_length (struct value
*arr
, int n
)
3160 struct type
*arr_type
, *index_type
;
3163 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3164 arr
= value_ind (arr
);
3165 arr_type
= value_enclosing_type (arr
);
3167 if (ada_is_constrained_packed_array_type (arr_type
))
3168 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3170 if (ada_is_simple_array_type (arr_type
))
3172 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3173 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3177 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3178 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3181 arr_type
= check_typedef (arr_type
);
3182 index_type
= TYPE_INDEX_TYPE (arr_type
);
3183 if (index_type
!= NULL
)
3185 struct type
*base_type
;
3186 if (TYPE_CODE (index_type
) == TYPE_CODE_RANGE
)
3187 base_type
= TYPE_TARGET_TYPE (index_type
);
3189 base_type
= index_type
;
3191 low
= pos_atr (value_from_longest (base_type
, low
));
3192 high
= pos_atr (value_from_longest (base_type
, high
));
3194 return high
- low
+ 1;
3197 /* An empty array whose type is that of ARR_TYPE (an array type),
3198 with bounds LOW to LOW-1. */
3200 static struct value
*
3201 empty_array (struct type
*arr_type
, int low
)
3203 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3204 struct type
*index_type
3205 = create_static_range_type
3206 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
, low
- 1);
3207 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3209 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3213 /* Name resolution */
3215 /* The "decoded" name for the user-definable Ada operator corresponding
3219 ada_decoded_op_name (enum exp_opcode op
)
3223 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3225 if (ada_opname_table
[i
].op
== op
)
3226 return ada_opname_table
[i
].decoded
;
3228 error (_("Could not find operator name for opcode"));
3232 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3233 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3234 undefined namespace) and converts operators that are
3235 user-defined into appropriate function calls. If CONTEXT_TYPE is
3236 non-null, it provides a preferred result type [at the moment, only
3237 type void has any effect---causing procedures to be preferred over
3238 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3239 return type is preferred. May change (expand) *EXP. */
3242 resolve (expression_up
*expp
, int void_context_p
)
3244 struct type
*context_type
= NULL
;
3248 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3250 resolve_subexp (expp
, &pc
, 1, context_type
);
3253 /* Resolve the operator of the subexpression beginning at
3254 position *POS of *EXPP. "Resolving" consists of replacing
3255 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3256 with their resolutions, replacing built-in operators with
3257 function calls to user-defined operators, where appropriate, and,
3258 when DEPROCEDURE_P is non-zero, converting function-valued variables
3259 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3260 are as in ada_resolve, above. */
3262 static struct value
*
3263 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3264 struct type
*context_type
)
3268 struct expression
*exp
; /* Convenience: == *expp. */
3269 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3270 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3271 int nargs
; /* Number of operands. */
3273 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
3279 /* Pass one: resolve operands, saving their types and updating *pos,
3284 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3285 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3290 resolve_subexp (expp
, pos
, 0, NULL
);
3292 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3297 resolve_subexp (expp
, pos
, 0, NULL
);
3302 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
3305 case OP_ATR_MODULUS
:
3315 case TERNOP_IN_RANGE
:
3316 case BINOP_IN_BOUNDS
:
3322 case OP_DISCRETE_RANGE
:
3324 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3333 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3335 resolve_subexp (expp
, pos
, 1, NULL
);
3337 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3354 case BINOP_LOGICAL_AND
:
3355 case BINOP_LOGICAL_OR
:
3356 case BINOP_BITWISE_AND
:
3357 case BINOP_BITWISE_IOR
:
3358 case BINOP_BITWISE_XOR
:
3361 case BINOP_NOTEQUAL
:
3368 case BINOP_SUBSCRIPT
:
3376 case UNOP_LOGICAL_NOT
:
3386 case OP_VAR_MSYM_VALUE
:
3393 case OP_INTERNALVAR
:
3403 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3406 case STRUCTOP_STRUCT
:
3407 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3420 error (_("Unexpected operator during name resolution"));
3423 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3424 for (i
= 0; i
< nargs
; i
+= 1)
3425 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3429 /* Pass two: perform any resolution on principal operator. */
3436 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3438 struct block_symbol
*candidates
;
3442 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3443 (exp
->elts
[pc
+ 2].symbol
),
3444 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3446 make_cleanup (xfree
, candidates
);
3448 if (n_candidates
> 1)
3450 /* Types tend to get re-introduced locally, so if there
3451 are any local symbols that are not types, first filter
3454 for (j
= 0; j
< n_candidates
; j
+= 1)
3455 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3460 case LOC_REGPARM_ADDR
:
3468 if (j
< n_candidates
)
3471 while (j
< n_candidates
)
3473 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3475 candidates
[j
] = candidates
[n_candidates
- 1];
3484 if (n_candidates
== 0)
3485 error (_("No definition found for %s"),
3486 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3487 else if (n_candidates
== 1)
3489 else if (deprocedure_p
3490 && !is_nonfunction (candidates
, n_candidates
))
3492 i
= ada_resolve_function
3493 (candidates
, n_candidates
, NULL
, 0,
3494 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3497 error (_("Could not find a match for %s"),
3498 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3502 printf_filtered (_("Multiple matches for %s\n"),
3503 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3504 user_select_syms (candidates
, n_candidates
, 1);
3508 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3509 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3510 if (innermost_block
== NULL
3511 || contained_in (candidates
[i
].block
, innermost_block
))
3512 innermost_block
= candidates
[i
].block
;
3516 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3519 replace_operator_with_call (expp
, pc
, 0, 0,
3520 exp
->elts
[pc
+ 2].symbol
,
3521 exp
->elts
[pc
+ 1].block
);
3528 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3529 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3531 struct block_symbol
*candidates
;
3535 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3536 (exp
->elts
[pc
+ 5].symbol
),
3537 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3539 make_cleanup (xfree
, candidates
);
3541 if (n_candidates
== 1)
3545 i
= ada_resolve_function
3546 (candidates
, n_candidates
,
3548 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3551 error (_("Could not find a match for %s"),
3552 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3555 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3556 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3557 if (innermost_block
== NULL
3558 || contained_in (candidates
[i
].block
, innermost_block
))
3559 innermost_block
= candidates
[i
].block
;
3570 case BINOP_BITWISE_AND
:
3571 case BINOP_BITWISE_IOR
:
3572 case BINOP_BITWISE_XOR
:
3574 case BINOP_NOTEQUAL
:
3582 case UNOP_LOGICAL_NOT
:
3584 if (possible_user_operator_p (op
, argvec
))
3586 struct block_symbol
*candidates
;
3590 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3591 (struct block
*) NULL
, VAR_DOMAIN
,
3593 make_cleanup (xfree
, candidates
);
3595 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3596 ada_decoded_op_name (op
), NULL
);
3600 replace_operator_with_call (expp
, pc
, nargs
, 1,
3601 candidates
[i
].symbol
,
3602 candidates
[i
].block
);
3609 do_cleanups (old_chain
);
3614 do_cleanups (old_chain
);
3615 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3616 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3617 exp
->elts
[pc
+ 1].objfile
,
3618 exp
->elts
[pc
+ 2].msymbol
);
3620 return evaluate_subexp_type (exp
, pos
);
3623 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3624 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3626 /* The term "match" here is rather loose. The match is heuristic and
3630 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3632 ftype
= ada_check_typedef (ftype
);
3633 atype
= ada_check_typedef (atype
);
3635 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3636 ftype
= TYPE_TARGET_TYPE (ftype
);
3637 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3638 atype
= TYPE_TARGET_TYPE (atype
);
3640 switch (TYPE_CODE (ftype
))
3643 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3645 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3646 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3647 TYPE_TARGET_TYPE (atype
), 0);
3650 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3652 case TYPE_CODE_ENUM
:
3653 case TYPE_CODE_RANGE
:
3654 switch (TYPE_CODE (atype
))
3657 case TYPE_CODE_ENUM
:
3658 case TYPE_CODE_RANGE
:
3664 case TYPE_CODE_ARRAY
:
3665 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3666 || ada_is_array_descriptor_type (atype
));
3668 case TYPE_CODE_STRUCT
:
3669 if (ada_is_array_descriptor_type (ftype
))
3670 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3671 || ada_is_array_descriptor_type (atype
));
3673 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3674 && !ada_is_array_descriptor_type (atype
));
3676 case TYPE_CODE_UNION
:
3678 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3682 /* Return non-zero if the formals of FUNC "sufficiently match" the
3683 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3684 may also be an enumeral, in which case it is treated as a 0-
3685 argument function. */
3688 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3691 struct type
*func_type
= SYMBOL_TYPE (func
);
3693 if (SYMBOL_CLASS (func
) == LOC_CONST
3694 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3695 return (n_actuals
== 0);
3696 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3699 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3702 for (i
= 0; i
< n_actuals
; i
+= 1)
3704 if (actuals
[i
] == NULL
)
3708 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3710 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3712 if (!ada_type_match (ftype
, atype
, 1))
3719 /* False iff function type FUNC_TYPE definitely does not produce a value
3720 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3721 FUNC_TYPE is not a valid function type with a non-null return type
3722 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3725 return_match (struct type
*func_type
, struct type
*context_type
)
3727 struct type
*return_type
;
3729 if (func_type
== NULL
)
3732 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3733 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3735 return_type
= get_base_type (func_type
);
3736 if (return_type
== NULL
)
3739 context_type
= get_base_type (context_type
);
3741 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3742 return context_type
== NULL
|| return_type
== context_type
;
3743 else if (context_type
== NULL
)
3744 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3746 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3750 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3751 function (if any) that matches the types of the NARGS arguments in
3752 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3753 that returns that type, then eliminate matches that don't. If
3754 CONTEXT_TYPE is void and there is at least one match that does not
3755 return void, eliminate all matches that do.
3757 Asks the user if there is more than one match remaining. Returns -1
3758 if there is no such symbol or none is selected. NAME is used
3759 solely for messages. May re-arrange and modify SYMS in
3760 the process; the index returned is for the modified vector. */
3763 ada_resolve_function (struct block_symbol syms
[],
3764 int nsyms
, struct value
**args
, int nargs
,
3765 const char *name
, struct type
*context_type
)
3769 int m
; /* Number of hits */
3772 /* In the first pass of the loop, we only accept functions matching
3773 context_type. If none are found, we add a second pass of the loop
3774 where every function is accepted. */
3775 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3777 for (k
= 0; k
< nsyms
; k
+= 1)
3779 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3781 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3782 && (fallback
|| return_match (type
, context_type
)))
3790 /* If we got multiple matches, ask the user which one to use. Don't do this
3791 interactive thing during completion, though, as the purpose of the
3792 completion is providing a list of all possible matches. Prompting the
3793 user to filter it down would be completely unexpected in this case. */
3796 else if (m
> 1 && !parse_completion
)
3798 printf_filtered (_("Multiple matches for %s\n"), name
);
3799 user_select_syms (syms
, m
, 1);
3805 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3806 in a listing of choices during disambiguation (see sort_choices, below).
3807 The idea is that overloadings of a subprogram name from the
3808 same package should sort in their source order. We settle for ordering
3809 such symbols by their trailing number (__N or $N). */
3812 encoded_ordered_before (const char *N0
, const char *N1
)
3816 else if (N0
== NULL
)
3822 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3824 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3826 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3827 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3832 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3835 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3837 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3838 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3840 return (strcmp (N0
, N1
) < 0);
3844 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3848 sort_choices (struct block_symbol syms
[], int nsyms
)
3852 for (i
= 1; i
< nsyms
; i
+= 1)
3854 struct block_symbol sym
= syms
[i
];
3857 for (j
= i
- 1; j
>= 0; j
-= 1)
3859 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].symbol
),
3860 SYMBOL_LINKAGE_NAME (sym
.symbol
)))
3862 syms
[j
+ 1] = syms
[j
];
3868 /* Whether GDB should display formals and return types for functions in the
3869 overloads selection menu. */
3870 static int print_signatures
= 1;
3872 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3873 all but functions, the signature is just the name of the symbol. For
3874 functions, this is the name of the function, the list of types for formals
3875 and the return type (if any). */
3878 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3879 const struct type_print_options
*flags
)
3881 struct type
*type
= SYMBOL_TYPE (sym
);
3883 fprintf_filtered (stream
, "%s", SYMBOL_PRINT_NAME (sym
));
3884 if (!print_signatures
3886 || TYPE_CODE (type
) != TYPE_CODE_FUNC
)
3889 if (TYPE_NFIELDS (type
) > 0)
3893 fprintf_filtered (stream
, " (");
3894 for (i
= 0; i
< TYPE_NFIELDS (type
); ++i
)
3897 fprintf_filtered (stream
, "; ");
3898 ada_print_type (TYPE_FIELD_TYPE (type
, i
), NULL
, stream
, -1, 0,
3901 fprintf_filtered (stream
, ")");
3903 if (TYPE_TARGET_TYPE (type
) != NULL
3904 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) != TYPE_CODE_VOID
)
3906 fprintf_filtered (stream
, " return ");
3907 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3911 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3912 by asking the user (if necessary), returning the number selected,
3913 and setting the first elements of SYMS items. Error if no symbols
3916 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3917 to be re-integrated one of these days. */
3920 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3923 int *chosen
= XALLOCAVEC (int , nsyms
);
3925 int first_choice
= (max_results
== 1) ? 1 : 2;
3926 const char *select_mode
= multiple_symbols_select_mode ();
3928 if (max_results
< 1)
3929 error (_("Request to select 0 symbols!"));
3933 if (select_mode
== multiple_symbols_cancel
)
3935 canceled because the command is ambiguous\n\
3936 See set/show multiple-symbol."));
3938 /* If select_mode is "all", then return all possible symbols.
3939 Only do that if more than one symbol can be selected, of course.
3940 Otherwise, display the menu as usual. */
3941 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3944 printf_unfiltered (_("[0] cancel\n"));
3945 if (max_results
> 1)
3946 printf_unfiltered (_("[1] all\n"));
3948 sort_choices (syms
, nsyms
);
3950 for (i
= 0; i
< nsyms
; i
+= 1)
3952 if (syms
[i
].symbol
== NULL
)
3955 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3957 struct symtab_and_line sal
=
3958 find_function_start_sal (syms
[i
].symbol
, 1);
3960 printf_unfiltered ("[%d] ", i
+ first_choice
);
3961 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3962 &type_print_raw_options
);
3963 if (sal
.symtab
== NULL
)
3964 printf_unfiltered (_(" at <no source file available>:%d\n"),
3967 printf_unfiltered (_(" at %s:%d\n"),
3968 symtab_to_filename_for_display (sal
.symtab
),
3975 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3976 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3977 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) == TYPE_CODE_ENUM
);
3978 struct symtab
*symtab
= NULL
;
3980 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3981 symtab
= symbol_symtab (syms
[i
].symbol
);
3983 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3985 printf_unfiltered ("[%d] ", i
+ first_choice
);
3986 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3987 &type_print_raw_options
);
3988 printf_unfiltered (_(" at %s:%d\n"),
3989 symtab_to_filename_for_display (symtab
),
3990 SYMBOL_LINE (syms
[i
].symbol
));
3992 else if (is_enumeral
3993 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].symbol
)) != NULL
)
3995 printf_unfiltered (("[%d] "), i
+ first_choice
);
3996 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3997 gdb_stdout
, -1, 0, &type_print_raw_options
);
3998 printf_unfiltered (_("'(%s) (enumeral)\n"),
3999 SYMBOL_PRINT_NAME (syms
[i
].symbol
));
4003 printf_unfiltered ("[%d] ", i
+ first_choice
);
4004 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
4005 &type_print_raw_options
);
4008 printf_unfiltered (is_enumeral
4009 ? _(" in %s (enumeral)\n")
4011 symtab_to_filename_for_display (symtab
));
4013 printf_unfiltered (is_enumeral
4014 ? _(" (enumeral)\n")
4020 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
4023 for (i
= 0; i
< n_chosen
; i
+= 1)
4024 syms
[i
] = syms
[chosen
[i
]];
4029 /* Read and validate a set of numeric choices from the user in the
4030 range 0 .. N_CHOICES-1. Place the results in increasing
4031 order in CHOICES[0 .. N-1], and return N.
4033 The user types choices as a sequence of numbers on one line
4034 separated by blanks, encoding them as follows:
4036 + A choice of 0 means to cancel the selection, throwing an error.
4037 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
4038 + The user chooses k by typing k+IS_ALL_CHOICE+1.
4040 The user is not allowed to choose more than MAX_RESULTS values.
4042 ANNOTATION_SUFFIX, if present, is used to annotate the input
4043 prompts (for use with the -f switch). */
4046 get_selections (int *choices
, int n_choices
, int max_results
,
4047 int is_all_choice
, const char *annotation_suffix
)
4052 int first_choice
= is_all_choice
? 2 : 1;
4054 prompt
= getenv ("PS2");
4058 args
= command_line_input (prompt
, 0, annotation_suffix
);
4061 error_no_arg (_("one or more choice numbers"));
4065 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
4066 order, as given in args. Choices are validated. */
4072 args
= skip_spaces (args
);
4073 if (*args
== '\0' && n_chosen
== 0)
4074 error_no_arg (_("one or more choice numbers"));
4075 else if (*args
== '\0')
4078 choice
= strtol (args
, &args2
, 10);
4079 if (args
== args2
|| choice
< 0
4080 || choice
> n_choices
+ first_choice
- 1)
4081 error (_("Argument must be choice number"));
4085 error (_("cancelled"));
4087 if (choice
< first_choice
)
4089 n_chosen
= n_choices
;
4090 for (j
= 0; j
< n_choices
; j
+= 1)
4094 choice
-= first_choice
;
4096 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
4100 if (j
< 0 || choice
!= choices
[j
])
4104 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
4105 choices
[k
+ 1] = choices
[k
];
4106 choices
[j
+ 1] = choice
;
4111 if (n_chosen
> max_results
)
4112 error (_("Select no more than %d of the above"), max_results
);
4117 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4118 on the function identified by SYM and BLOCK, and taking NARGS
4119 arguments. Update *EXPP as needed to hold more space. */
4122 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4123 int oplen
, struct symbol
*sym
,
4124 const struct block
*block
)
4126 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4127 symbol, -oplen for operator being replaced). */
4128 struct expression
*newexp
= (struct expression
*)
4129 xzalloc (sizeof (struct expression
)
4130 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
4131 struct expression
*exp
= expp
->get ();
4133 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4134 newexp
->language_defn
= exp
->language_defn
;
4135 newexp
->gdbarch
= exp
->gdbarch
;
4136 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4137 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4138 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4140 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4141 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4143 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4144 newexp
->elts
[pc
+ 4].block
= block
;
4145 newexp
->elts
[pc
+ 5].symbol
= sym
;
4147 expp
->reset (newexp
);
4150 /* Type-class predicates */
4152 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4156 numeric_type_p (struct type
*type
)
4162 switch (TYPE_CODE (type
))
4167 case TYPE_CODE_RANGE
:
4168 return (type
== TYPE_TARGET_TYPE (type
)
4169 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4176 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4179 integer_type_p (struct type
*type
)
4185 switch (TYPE_CODE (type
))
4189 case TYPE_CODE_RANGE
:
4190 return (type
== TYPE_TARGET_TYPE (type
)
4191 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4198 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4201 scalar_type_p (struct type
*type
)
4207 switch (TYPE_CODE (type
))
4210 case TYPE_CODE_RANGE
:
4211 case TYPE_CODE_ENUM
:
4220 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4223 discrete_type_p (struct type
*type
)
4229 switch (TYPE_CODE (type
))
4232 case TYPE_CODE_RANGE
:
4233 case TYPE_CODE_ENUM
:
4234 case TYPE_CODE_BOOL
:
4242 /* Returns non-zero if OP with operands in the vector ARGS could be
4243 a user-defined function. Errs on the side of pre-defined operators
4244 (i.e., result 0). */
4247 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4249 struct type
*type0
=
4250 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4251 struct type
*type1
=
4252 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4266 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4270 case BINOP_BITWISE_AND
:
4271 case BINOP_BITWISE_IOR
:
4272 case BINOP_BITWISE_XOR
:
4273 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4276 case BINOP_NOTEQUAL
:
4281 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4284 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4287 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4291 case UNOP_LOGICAL_NOT
:
4293 return (!numeric_type_p (type0
));
4302 1. In the following, we assume that a renaming type's name may
4303 have an ___XD suffix. It would be nice if this went away at some
4305 2. We handle both the (old) purely type-based representation of
4306 renamings and the (new) variable-based encoding. At some point,
4307 it is devoutly to be hoped that the former goes away
4308 (FIXME: hilfinger-2007-07-09).
4309 3. Subprogram renamings are not implemented, although the XRS
4310 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4312 /* If SYM encodes a renaming,
4314 <renaming> renames <renamed entity>,
4316 sets *LEN to the length of the renamed entity's name,
4317 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4318 the string describing the subcomponent selected from the renamed
4319 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4320 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4321 are undefined). Otherwise, returns a value indicating the category
4322 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4323 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4324 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4325 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4326 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4327 may be NULL, in which case they are not assigned.
4329 [Currently, however, GCC does not generate subprogram renamings.] */
4331 enum ada_renaming_category
4332 ada_parse_renaming (struct symbol
*sym
,
4333 const char **renamed_entity
, int *len
,
4334 const char **renaming_expr
)
4336 enum ada_renaming_category kind
;
4341 return ADA_NOT_RENAMING
;
4342 switch (SYMBOL_CLASS (sym
))
4345 return ADA_NOT_RENAMING
;
4347 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
4348 renamed_entity
, len
, renaming_expr
);
4352 case LOC_OPTIMIZED_OUT
:
4353 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4355 return ADA_NOT_RENAMING
;
4359 kind
= ADA_OBJECT_RENAMING
;
4363 kind
= ADA_EXCEPTION_RENAMING
;
4367 kind
= ADA_PACKAGE_RENAMING
;
4371 kind
= ADA_SUBPROGRAM_RENAMING
;
4375 return ADA_NOT_RENAMING
;
4379 if (renamed_entity
!= NULL
)
4380 *renamed_entity
= info
;
4381 suffix
= strstr (info
, "___XE");
4382 if (suffix
== NULL
|| suffix
== info
)
4383 return ADA_NOT_RENAMING
;
4385 *len
= strlen (info
) - strlen (suffix
);
4387 if (renaming_expr
!= NULL
)
4388 *renaming_expr
= suffix
;
4392 /* Assuming TYPE encodes a renaming according to the old encoding in
4393 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4394 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4395 ADA_NOT_RENAMING otherwise. */
4396 static enum ada_renaming_category
4397 parse_old_style_renaming (struct type
*type
,
4398 const char **renamed_entity
, int *len
,
4399 const char **renaming_expr
)
4401 enum ada_renaming_category kind
;
4406 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4407 || TYPE_NFIELDS (type
) != 1)
4408 return ADA_NOT_RENAMING
;
4410 name
= type_name_no_tag (type
);
4412 return ADA_NOT_RENAMING
;
4414 name
= strstr (name
, "___XR");
4416 return ADA_NOT_RENAMING
;
4421 kind
= ADA_OBJECT_RENAMING
;
4424 kind
= ADA_EXCEPTION_RENAMING
;
4427 kind
= ADA_PACKAGE_RENAMING
;
4430 kind
= ADA_SUBPROGRAM_RENAMING
;
4433 return ADA_NOT_RENAMING
;
4436 info
= TYPE_FIELD_NAME (type
, 0);
4438 return ADA_NOT_RENAMING
;
4439 if (renamed_entity
!= NULL
)
4440 *renamed_entity
= info
;
4441 suffix
= strstr (info
, "___XE");
4442 if (renaming_expr
!= NULL
)
4443 *renaming_expr
= suffix
+ 5;
4444 if (suffix
== NULL
|| suffix
== info
)
4445 return ADA_NOT_RENAMING
;
4447 *len
= suffix
- info
;
4451 /* Compute the value of the given RENAMING_SYM, which is expected to
4452 be a symbol encoding a renaming expression. BLOCK is the block
4453 used to evaluate the renaming. */
4455 static struct value
*
4456 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4457 const struct block
*block
)
4459 const char *sym_name
;
4461 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4462 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4463 return evaluate_expression (expr
.get ());
4467 /* Evaluation: Function Calls */
4469 /* Return an lvalue containing the value VAL. This is the identity on
4470 lvalues, and otherwise has the side-effect of allocating memory
4471 in the inferior where a copy of the value contents is copied. */
4473 static struct value
*
4474 ensure_lval (struct value
*val
)
4476 if (VALUE_LVAL (val
) == not_lval
4477 || VALUE_LVAL (val
) == lval_internalvar
)
4479 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4480 const CORE_ADDR addr
=
4481 value_as_long (value_allocate_space_in_inferior (len
));
4483 VALUE_LVAL (val
) = lval_memory
;
4484 set_value_address (val
, addr
);
4485 write_memory (addr
, value_contents (val
), len
);
4491 /* Return the value ACTUAL, converted to be an appropriate value for a
4492 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4493 allocating any necessary descriptors (fat pointers), or copies of
4494 values not residing in memory, updating it as needed. */
4497 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4499 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4500 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4501 struct type
*formal_target
=
4502 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4503 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4504 struct type
*actual_target
=
4505 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4506 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4508 if (ada_is_array_descriptor_type (formal_target
)
4509 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4510 return make_array_descriptor (formal_type
, actual
);
4511 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4512 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4514 struct value
*result
;
4516 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4517 && ada_is_array_descriptor_type (actual_target
))
4518 result
= desc_data (actual
);
4519 else if (TYPE_CODE (formal_type
) != TYPE_CODE_PTR
)
4521 if (VALUE_LVAL (actual
) != lval_memory
)
4525 actual_type
= ada_check_typedef (value_type (actual
));
4526 val
= allocate_value (actual_type
);
4527 memcpy ((char *) value_contents_raw (val
),
4528 (char *) value_contents (actual
),
4529 TYPE_LENGTH (actual_type
));
4530 actual
= ensure_lval (val
);
4532 result
= value_addr (actual
);
4536 return value_cast_pointers (formal_type
, result
, 0);
4538 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4539 return ada_value_ind (actual
);
4540 else if (ada_is_aligner_type (formal_type
))
4542 /* We need to turn this parameter into an aligner type
4544 struct value
*aligner
= allocate_value (formal_type
);
4545 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4547 value_assign_to_component (aligner
, component
, actual
);
4554 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4555 type TYPE. This is usually an inefficient no-op except on some targets
4556 (such as AVR) where the representation of a pointer and an address
4560 value_pointer (struct value
*value
, struct type
*type
)
4562 struct gdbarch
*gdbarch
= get_type_arch (type
);
4563 unsigned len
= TYPE_LENGTH (type
);
4564 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4567 addr
= value_address (value
);
4568 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4569 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4574 /* Push a descriptor of type TYPE for array value ARR on the stack at
4575 *SP, updating *SP to reflect the new descriptor. Return either
4576 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4577 to-descriptor type rather than a descriptor type), a struct value *
4578 representing a pointer to this descriptor. */
4580 static struct value
*
4581 make_array_descriptor (struct type
*type
, struct value
*arr
)
4583 struct type
*bounds_type
= desc_bounds_type (type
);
4584 struct type
*desc_type
= desc_base_type (type
);
4585 struct value
*descriptor
= allocate_value (desc_type
);
4586 struct value
*bounds
= allocate_value (bounds_type
);
4589 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4592 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4593 ada_array_bound (arr
, i
, 0),
4594 desc_bound_bitpos (bounds_type
, i
, 0),
4595 desc_bound_bitsize (bounds_type
, i
, 0));
4596 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4597 ada_array_bound (arr
, i
, 1),
4598 desc_bound_bitpos (bounds_type
, i
, 1),
4599 desc_bound_bitsize (bounds_type
, i
, 1));
4602 bounds
= ensure_lval (bounds
);
4604 modify_field (value_type (descriptor
),
4605 value_contents_writeable (descriptor
),
4606 value_pointer (ensure_lval (arr
),
4607 TYPE_FIELD_TYPE (desc_type
, 0)),
4608 fat_pntr_data_bitpos (desc_type
),
4609 fat_pntr_data_bitsize (desc_type
));
4611 modify_field (value_type (descriptor
),
4612 value_contents_writeable (descriptor
),
4613 value_pointer (bounds
,
4614 TYPE_FIELD_TYPE (desc_type
, 1)),
4615 fat_pntr_bounds_bitpos (desc_type
),
4616 fat_pntr_bounds_bitsize (desc_type
));
4618 descriptor
= ensure_lval (descriptor
);
4620 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4621 return value_addr (descriptor
);
4626 /* Symbol Cache Module */
4628 /* Performance measurements made as of 2010-01-15 indicate that
4629 this cache does bring some noticeable improvements. Depending
4630 on the type of entity being printed, the cache can make it as much
4631 as an order of magnitude faster than without it.
4633 The descriptive type DWARF extension has significantly reduced
4634 the need for this cache, at least when DWARF is being used. However,
4635 even in this case, some expensive name-based symbol searches are still
4636 sometimes necessary - to find an XVZ variable, mostly. */
4638 /* Initialize the contents of SYM_CACHE. */
4641 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4643 obstack_init (&sym_cache
->cache_space
);
4644 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4647 /* Free the memory used by SYM_CACHE. */
4650 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4652 obstack_free (&sym_cache
->cache_space
, NULL
);
4656 /* Return the symbol cache associated to the given program space PSPACE.
4657 If not allocated for this PSPACE yet, allocate and initialize one. */
4659 static struct ada_symbol_cache
*
4660 ada_get_symbol_cache (struct program_space
*pspace
)
4662 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4664 if (pspace_data
->sym_cache
== NULL
)
4666 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4667 ada_init_symbol_cache (pspace_data
->sym_cache
);
4670 return pspace_data
->sym_cache
;
4673 /* Clear all entries from the symbol cache. */
4676 ada_clear_symbol_cache (void)
4678 struct ada_symbol_cache
*sym_cache
4679 = ada_get_symbol_cache (current_program_space
);
4681 obstack_free (&sym_cache
->cache_space
, NULL
);
4682 ada_init_symbol_cache (sym_cache
);
4685 /* Search our cache for an entry matching NAME and DOMAIN.
4686 Return it if found, or NULL otherwise. */
4688 static struct cache_entry
**
4689 find_entry (const char *name
, domain_enum domain
)
4691 struct ada_symbol_cache
*sym_cache
4692 = ada_get_symbol_cache (current_program_space
);
4693 int h
= msymbol_hash (name
) % HASH_SIZE
;
4694 struct cache_entry
**e
;
4696 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4698 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4704 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4705 Return 1 if found, 0 otherwise.
4707 If an entry was found and SYM is not NULL, set *SYM to the entry's
4708 SYM. Same principle for BLOCK if not NULL. */
4711 lookup_cached_symbol (const char *name
, domain_enum domain
,
4712 struct symbol
**sym
, const struct block
**block
)
4714 struct cache_entry
**e
= find_entry (name
, domain
);
4721 *block
= (*e
)->block
;
4725 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4726 in domain DOMAIN, save this result in our symbol cache. */
4729 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4730 const struct block
*block
)
4732 struct ada_symbol_cache
*sym_cache
4733 = ada_get_symbol_cache (current_program_space
);
4736 struct cache_entry
*e
;
4738 /* Symbols for builtin types don't have a block.
4739 For now don't cache such symbols. */
4740 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4743 /* If the symbol is a local symbol, then do not cache it, as a search
4744 for that symbol depends on the context. To determine whether
4745 the symbol is local or not, we check the block where we found it
4746 against the global and static blocks of its associated symtab. */
4748 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4749 GLOBAL_BLOCK
) != block
4750 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4751 STATIC_BLOCK
) != block
)
4754 h
= msymbol_hash (name
) % HASH_SIZE
;
4755 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4757 e
->next
= sym_cache
->root
[h
];
4758 sym_cache
->root
[h
] = e
;
4760 = (char *) obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4761 strcpy (copy
, name
);
4769 /* Return the symbol name match type that should be used used when
4770 searching for all symbols matching LOOKUP_NAME.
4772 LOOKUP_NAME is expected to be a symbol name after transformation
4773 for Ada lookups (see ada_name_for_lookup). */
4775 static symbol_name_match_type
4776 name_match_type_from_name (const char *lookup_name
)
4778 return (strstr (lookup_name
, "__") == NULL
4779 ? symbol_name_match_type::WILD
4780 : symbol_name_match_type::FULL
);
4783 /* Return the result of a standard (literal, C-like) lookup of NAME in
4784 given DOMAIN, visible from lexical block BLOCK. */
4786 static struct symbol
*
4787 standard_lookup (const char *name
, const struct block
*block
,
4790 /* Initialize it just to avoid a GCC false warning. */
4791 struct block_symbol sym
= {NULL
, NULL
};
4793 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4795 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4796 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4801 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4802 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4803 since they contend in overloading in the same way. */
4805 is_nonfunction (struct block_symbol syms
[], int n
)
4809 for (i
= 0; i
< n
; i
+= 1)
4810 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_FUNC
4811 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
4812 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4818 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4819 struct types. Otherwise, they may not. */
4822 equiv_types (struct type
*type0
, struct type
*type1
)
4826 if (type0
== NULL
|| type1
== NULL
4827 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4829 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4830 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4831 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4832 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4838 /* True iff SYM0 represents the same entity as SYM1, or one that is
4839 no more defined than that of SYM1. */
4842 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4846 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4847 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4850 switch (SYMBOL_CLASS (sym0
))
4856 struct type
*type0
= SYMBOL_TYPE (sym0
);
4857 struct type
*type1
= SYMBOL_TYPE (sym1
);
4858 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4859 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4860 int len0
= strlen (name0
);
4863 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4864 && (equiv_types (type0
, type1
)
4865 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4866 && startswith (name1
+ len0
, "___XV")));
4869 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4870 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4876 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4877 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4880 add_defn_to_vec (struct obstack
*obstackp
,
4882 const struct block
*block
)
4885 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4887 /* Do not try to complete stub types, as the debugger is probably
4888 already scanning all symbols matching a certain name at the
4889 time when this function is called. Trying to replace the stub
4890 type by its associated full type will cause us to restart a scan
4891 which may lead to an infinite recursion. Instead, the client
4892 collecting the matching symbols will end up collecting several
4893 matches, with at least one of them complete. It can then filter
4894 out the stub ones if needed. */
4896 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4898 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4900 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4902 prevDefns
[i
].symbol
= sym
;
4903 prevDefns
[i
].block
= block
;
4909 struct block_symbol info
;
4913 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4917 /* Number of block_symbol structures currently collected in current vector in
4921 num_defns_collected (struct obstack
*obstackp
)
4923 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4926 /* Vector of block_symbol structures currently collected in current vector in
4927 OBSTACKP. If FINISH, close off the vector and return its final address. */
4929 static struct block_symbol
*
4930 defns_collected (struct obstack
*obstackp
, int finish
)
4933 return (struct block_symbol
*) obstack_finish (obstackp
);
4935 return (struct block_symbol
*) obstack_base (obstackp
);
4938 /* Return a bound minimal symbol matching NAME according to Ada
4939 decoding rules. Returns an invalid symbol if there is no such
4940 minimal symbol. Names prefixed with "standard__" are handled
4941 specially: "standard__" is first stripped off, and only static and
4942 global symbols are searched. */
4944 struct bound_minimal_symbol
4945 ada_lookup_simple_minsym (const char *name
)
4947 struct bound_minimal_symbol result
;
4948 struct objfile
*objfile
;
4949 struct minimal_symbol
*msymbol
;
4951 memset (&result
, 0, sizeof (result
));
4953 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4954 lookup_name_info
lookup_name (name
, match_type
);
4956 symbol_name_matcher_ftype
*match_name
4957 = ada_get_symbol_name_matcher (lookup_name
);
4959 ALL_MSYMBOLS (objfile
, msymbol
)
4961 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), lookup_name
, NULL
)
4962 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4964 result
.minsym
= msymbol
;
4965 result
.objfile
= objfile
;
4973 /* For all subprograms that statically enclose the subprogram of the
4974 selected frame, add symbols matching identifier NAME in DOMAIN
4975 and their blocks to the list of data in OBSTACKP, as for
4976 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4977 with a wildcard prefix. */
4980 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4981 const lookup_name_info
&lookup_name
,
4986 /* True if TYPE is definitely an artificial type supplied to a symbol
4987 for which no debugging information was given in the symbol file. */
4990 is_nondebugging_type (struct type
*type
)
4992 const char *name
= ada_type_name (type
);
4994 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4997 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4998 that are deemed "identical" for practical purposes.
5000 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
5001 types and that their number of enumerals is identical (in other
5002 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
5005 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
5009 /* The heuristic we use here is fairly conservative. We consider
5010 that 2 enumerate types are identical if they have the same
5011 number of enumerals and that all enumerals have the same
5012 underlying value and name. */
5014 /* All enums in the type should have an identical underlying value. */
5015 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
5016 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
5019 /* All enumerals should also have the same name (modulo any numerical
5021 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
5023 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
5024 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
5025 int len_1
= strlen (name_1
);
5026 int len_2
= strlen (name_2
);
5028 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
5029 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
5031 || strncmp (TYPE_FIELD_NAME (type1
, i
),
5032 TYPE_FIELD_NAME (type2
, i
),
5040 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
5041 that are deemed "identical" for practical purposes. Sometimes,
5042 enumerals are not strictly identical, but their types are so similar
5043 that they can be considered identical.
5045 For instance, consider the following code:
5047 type Color is (Black, Red, Green, Blue, White);
5048 type RGB_Color is new Color range Red .. Blue;
5050 Type RGB_Color is a subrange of an implicit type which is a copy
5051 of type Color. If we call that implicit type RGB_ColorB ("B" is
5052 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5053 As a result, when an expression references any of the enumeral
5054 by name (Eg. "print green"), the expression is technically
5055 ambiguous and the user should be asked to disambiguate. But
5056 doing so would only hinder the user, since it wouldn't matter
5057 what choice he makes, the outcome would always be the same.
5058 So, for practical purposes, we consider them as the same. */
5061 symbols_are_identical_enums (struct block_symbol
*syms
, int nsyms
)
5065 /* Before performing a thorough comparison check of each type,
5066 we perform a series of inexpensive checks. We expect that these
5067 checks will quickly fail in the vast majority of cases, and thus
5068 help prevent the unnecessary use of a more expensive comparison.
5069 Said comparison also expects us to make some of these checks
5070 (see ada_identical_enum_types_p). */
5072 /* Quick check: All symbols should have an enum type. */
5073 for (i
= 0; i
< nsyms
; i
++)
5074 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
)
5077 /* Quick check: They should all have the same value. */
5078 for (i
= 1; i
< nsyms
; i
++)
5079 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5082 /* Quick check: They should all have the same number of enumerals. */
5083 for (i
= 1; i
< nsyms
; i
++)
5084 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].symbol
))
5085 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].symbol
)))
5088 /* All the sanity checks passed, so we might have a set of
5089 identical enumeration types. Perform a more complete
5090 comparison of the type of each symbol. */
5091 for (i
= 1; i
< nsyms
; i
++)
5092 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5093 SYMBOL_TYPE (syms
[0].symbol
)))
5099 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
5100 duplicate other symbols in the list (The only case I know of where
5101 this happens is when object files containing stabs-in-ecoff are
5102 linked with files containing ordinary ecoff debugging symbols (or no
5103 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5104 Returns the number of items in the modified list. */
5107 remove_extra_symbols (struct block_symbol
*syms
, int nsyms
)
5111 /* We should never be called with less than 2 symbols, as there
5112 cannot be any extra symbol in that case. But it's easy to
5113 handle, since we have nothing to do in that case. */
5122 /* If two symbols have the same name and one of them is a stub type,
5123 the get rid of the stub. */
5125 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].symbol
))
5126 && SYMBOL_LINKAGE_NAME (syms
[i
].symbol
) != NULL
)
5128 for (j
= 0; j
< nsyms
; j
++)
5131 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].symbol
))
5132 && SYMBOL_LINKAGE_NAME (syms
[j
].symbol
) != NULL
5133 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
),
5134 SYMBOL_LINKAGE_NAME (syms
[j
].symbol
)) == 0)
5139 /* Two symbols with the same name, same class and same address
5140 should be identical. */
5142 else if (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
) != NULL
5143 && SYMBOL_CLASS (syms
[i
].symbol
) == LOC_STATIC
5144 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].symbol
)))
5146 for (j
= 0; j
< nsyms
; j
+= 1)
5149 && SYMBOL_LINKAGE_NAME (syms
[j
].symbol
) != NULL
5150 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
),
5151 SYMBOL_LINKAGE_NAME (syms
[j
].symbol
)) == 0
5152 && SYMBOL_CLASS (syms
[i
].symbol
)
5153 == SYMBOL_CLASS (syms
[j
].symbol
)
5154 && SYMBOL_VALUE_ADDRESS (syms
[i
].symbol
)
5155 == SYMBOL_VALUE_ADDRESS (syms
[j
].symbol
))
5162 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5163 syms
[j
- 1] = syms
[j
];
5170 /* If all the remaining symbols are identical enumerals, then
5171 just keep the first one and discard the rest.
5173 Unlike what we did previously, we do not discard any entry
5174 unless they are ALL identical. This is because the symbol
5175 comparison is not a strict comparison, but rather a practical
5176 comparison. If all symbols are considered identical, then
5177 we can just go ahead and use the first one and discard the rest.
5178 But if we cannot reduce the list to a single element, we have
5179 to ask the user to disambiguate anyways. And if we have to
5180 present a multiple-choice menu, it's less confusing if the list
5181 isn't missing some choices that were identical and yet distinct. */
5182 if (symbols_are_identical_enums (syms
, nsyms
))
5188 /* Given a type that corresponds to a renaming entity, use the type name
5189 to extract the scope (package name or function name, fully qualified,
5190 and following the GNAT encoding convention) where this renaming has been
5191 defined. The string returned needs to be deallocated after use. */
5194 xget_renaming_scope (struct type
*renaming_type
)
5196 /* The renaming types adhere to the following convention:
5197 <scope>__<rename>___<XR extension>.
5198 So, to extract the scope, we search for the "___XR" extension,
5199 and then backtrack until we find the first "__". */
5201 const char *name
= type_name_no_tag (renaming_type
);
5202 const char *suffix
= strstr (name
, "___XR");
5207 /* Now, backtrack a bit until we find the first "__". Start looking
5208 at suffix - 3, as the <rename> part is at least one character long. */
5210 for (last
= suffix
- 3; last
> name
; last
--)
5211 if (last
[0] == '_' && last
[1] == '_')
5214 /* Make a copy of scope and return it. */
5216 scope_len
= last
- name
;
5217 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
5219 strncpy (scope
, name
, scope_len
);
5220 scope
[scope_len
] = '\0';
5225 /* Return nonzero if NAME corresponds to a package name. */
5228 is_package_name (const char *name
)
5230 /* Here, We take advantage of the fact that no symbols are generated
5231 for packages, while symbols are generated for each function.
5232 So the condition for NAME represent a package becomes equivalent
5233 to NAME not existing in our list of symbols. There is only one
5234 small complication with library-level functions (see below). */
5238 /* If it is a function that has not been defined at library level,
5239 then we should be able to look it up in the symbols. */
5240 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5243 /* Library-level function names start with "_ada_". See if function
5244 "_ada_" followed by NAME can be found. */
5246 /* Do a quick check that NAME does not contain "__", since library-level
5247 functions names cannot contain "__" in them. */
5248 if (strstr (name
, "__") != NULL
)
5251 fun_name
= xstrprintf ("_ada_%s", name
);
5253 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
5256 /* Return nonzero if SYM corresponds to a renaming entity that is
5257 not visible from FUNCTION_NAME. */
5260 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5263 struct cleanup
*old_chain
;
5265 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5268 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5269 old_chain
= make_cleanup (xfree
, scope
);
5271 /* If the rename has been defined in a package, then it is visible. */
5272 if (is_package_name (scope
))
5274 do_cleanups (old_chain
);
5278 /* Check that the rename is in the current function scope by checking
5279 that its name starts with SCOPE. */
5281 /* If the function name starts with "_ada_", it means that it is
5282 a library-level function. Strip this prefix before doing the
5283 comparison, as the encoding for the renaming does not contain
5285 if (startswith (function_name
, "_ada_"))
5289 int is_invisible
= !startswith (function_name
, scope
);
5291 do_cleanups (old_chain
);
5292 return is_invisible
;
5296 /* Remove entries from SYMS that corresponds to a renaming entity that
5297 is not visible from the function associated with CURRENT_BLOCK or
5298 that is superfluous due to the presence of more specific renaming
5299 information. Places surviving symbols in the initial entries of
5300 SYMS and returns the number of surviving symbols.
5303 First, in cases where an object renaming is implemented as a
5304 reference variable, GNAT may produce both the actual reference
5305 variable and the renaming encoding. In this case, we discard the
5308 Second, GNAT emits a type following a specified encoding for each renaming
5309 entity. Unfortunately, STABS currently does not support the definition
5310 of types that are local to a given lexical block, so all renamings types
5311 are emitted at library level. As a consequence, if an application
5312 contains two renaming entities using the same name, and a user tries to
5313 print the value of one of these entities, the result of the ada symbol
5314 lookup will also contain the wrong renaming type.
5316 This function partially covers for this limitation by attempting to
5317 remove from the SYMS list renaming symbols that should be visible
5318 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5319 method with the current information available. The implementation
5320 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5322 - When the user tries to print a rename in a function while there
5323 is another rename entity defined in a package: Normally, the
5324 rename in the function has precedence over the rename in the
5325 package, so the latter should be removed from the list. This is
5326 currently not the case.
5328 - This function will incorrectly remove valid renames if
5329 the CURRENT_BLOCK corresponds to a function which symbol name
5330 has been changed by an "Export" pragma. As a consequence,
5331 the user will be unable to print such rename entities. */
5334 remove_irrelevant_renamings (struct block_symbol
*syms
,
5335 int nsyms
, const struct block
*current_block
)
5337 struct symbol
*current_function
;
5338 const char *current_function_name
;
5340 int is_new_style_renaming
;
5342 /* If there is both a renaming foo___XR... encoded as a variable and
5343 a simple variable foo in the same block, discard the latter.
5344 First, zero out such symbols, then compress. */
5345 is_new_style_renaming
= 0;
5346 for (i
= 0; i
< nsyms
; i
+= 1)
5348 struct symbol
*sym
= syms
[i
].symbol
;
5349 const struct block
*block
= syms
[i
].block
;
5353 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5355 name
= SYMBOL_LINKAGE_NAME (sym
);
5356 suffix
= strstr (name
, "___XR");
5360 int name_len
= suffix
- name
;
5363 is_new_style_renaming
= 1;
5364 for (j
= 0; j
< nsyms
; j
+= 1)
5365 if (i
!= j
&& syms
[j
].symbol
!= NULL
5366 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].symbol
),
5368 && block
== syms
[j
].block
)
5369 syms
[j
].symbol
= NULL
;
5372 if (is_new_style_renaming
)
5376 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5377 if (syms
[j
].symbol
!= NULL
)
5385 /* Extract the function name associated to CURRENT_BLOCK.
5386 Abort if unable to do so. */
5388 if (current_block
== NULL
)
5391 current_function
= block_linkage_function (current_block
);
5392 if (current_function
== NULL
)
5395 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5396 if (current_function_name
== NULL
)
5399 /* Check each of the symbols, and remove it from the list if it is
5400 a type corresponding to a renaming that is out of the scope of
5401 the current block. */
5406 if (ada_parse_renaming (syms
[i
].symbol
, NULL
, NULL
, NULL
)
5407 == ADA_OBJECT_RENAMING
5408 && old_renaming_is_invisible (syms
[i
].symbol
, current_function_name
))
5412 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5413 syms
[j
- 1] = syms
[j
];
5423 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5424 whose name and domain match NAME and DOMAIN respectively.
5425 If no match was found, then extend the search to "enclosing"
5426 routines (in other words, if we're inside a nested function,
5427 search the symbols defined inside the enclosing functions).
5428 If WILD_MATCH_P is nonzero, perform the naming matching in
5429 "wild" mode (see function "wild_match" for more info).
5431 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5434 ada_add_local_symbols (struct obstack
*obstackp
,
5435 const lookup_name_info
&lookup_name
,
5436 const struct block
*block
, domain_enum domain
)
5438 int block_depth
= 0;
5440 while (block
!= NULL
)
5443 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5445 /* If we found a non-function match, assume that's the one. */
5446 if (is_nonfunction (defns_collected (obstackp
, 0),
5447 num_defns_collected (obstackp
)))
5450 block
= BLOCK_SUPERBLOCK (block
);
5453 /* If no luck so far, try to find NAME as a local symbol in some lexically
5454 enclosing subprogram. */
5455 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5456 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5459 /* An object of this type is used as the user_data argument when
5460 calling the map_matching_symbols method. */
5464 struct objfile
*objfile
;
5465 struct obstack
*obstackp
;
5466 struct symbol
*arg_sym
;
5470 /* A callback for add_nonlocal_symbols that adds SYM, found in BLOCK,
5471 to a list of symbols. DATA0 is a pointer to a struct match_data *
5472 containing the obstack that collects the symbol list, the file that SYM
5473 must come from, a flag indicating whether a non-argument symbol has
5474 been found in the current block, and the last argument symbol
5475 passed in SYM within the current block (if any). When SYM is null,
5476 marking the end of a block, the argument symbol is added if no
5477 other has been found. */
5480 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5482 struct match_data
*data
= (struct match_data
*) data0
;
5486 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5487 add_defn_to_vec (data
->obstackp
,
5488 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5490 data
->found_sym
= 0;
5491 data
->arg_sym
= NULL
;
5495 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5497 else if (SYMBOL_IS_ARGUMENT (sym
))
5498 data
->arg_sym
= sym
;
5501 data
->found_sym
= 1;
5502 add_defn_to_vec (data
->obstackp
,
5503 fixup_symbol_section (sym
, data
->objfile
),
5510 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5511 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5512 symbols to OBSTACKP. Return whether we found such symbols. */
5515 ada_add_block_renamings (struct obstack
*obstackp
,
5516 const struct block
*block
,
5517 const lookup_name_info
&lookup_name
,
5520 struct using_direct
*renaming
;
5521 int defns_mark
= num_defns_collected (obstackp
);
5523 symbol_name_matcher_ftype
*name_match
5524 = ada_get_symbol_name_matcher (lookup_name
);
5526 for (renaming
= block_using (block
);
5528 renaming
= renaming
->next
)
5532 /* Avoid infinite recursions: skip this renaming if we are actually
5533 already traversing it.
5535 Currently, symbol lookup in Ada don't use the namespace machinery from
5536 C++/Fortran support: skip namespace imports that use them. */
5537 if (renaming
->searched
5538 || (renaming
->import_src
!= NULL
5539 && renaming
->import_src
[0] != '\0')
5540 || (renaming
->import_dest
!= NULL
5541 && renaming
->import_dest
[0] != '\0'))
5543 renaming
->searched
= 1;
5545 /* TODO: here, we perform another name-based symbol lookup, which can
5546 pull its own multiple overloads. In theory, we should be able to do
5547 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5548 not a simple name. But in order to do this, we would need to enhance
5549 the DWARF reader to associate a symbol to this renaming, instead of a
5550 name. So, for now, we do something simpler: re-use the C++/Fortran
5551 namespace machinery. */
5552 r_name
= (renaming
->alias
!= NULL
5554 : renaming
->declaration
);
5555 if (name_match (r_name
, lookup_name
, NULL
))
5557 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5558 lookup_name
.match_type ());
5559 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5562 renaming
->searched
= 0;
5564 return num_defns_collected (obstackp
) != defns_mark
;
5567 /* Implements compare_names, but only applying the comparision using
5568 the given CASING. */
5571 compare_names_with_case (const char *string1
, const char *string2
,
5572 enum case_sensitivity casing
)
5574 while (*string1
!= '\0' && *string2
!= '\0')
5578 if (isspace (*string1
) || isspace (*string2
))
5579 return strcmp_iw_ordered (string1
, string2
);
5581 if (casing
== case_sensitive_off
)
5583 c1
= tolower (*string1
);
5584 c2
= tolower (*string2
);
5601 return strcmp_iw_ordered (string1
, string2
);
5603 if (*string2
== '\0')
5605 if (is_name_suffix (string1
))
5612 if (*string2
== '(')
5613 return strcmp_iw_ordered (string1
, string2
);
5616 if (casing
== case_sensitive_off
)
5617 return tolower (*string1
) - tolower (*string2
);
5619 return *string1
- *string2
;
5624 /* Compare STRING1 to STRING2, with results as for strcmp.
5625 Compatible with strcmp_iw_ordered in that...
5627 strcmp_iw_ordered (STRING1, STRING2) <= 0
5631 compare_names (STRING1, STRING2) <= 0
5633 (they may differ as to what symbols compare equal). */
5636 compare_names (const char *string1
, const char *string2
)
5640 /* Similar to what strcmp_iw_ordered does, we need to perform
5641 a case-insensitive comparison first, and only resort to
5642 a second, case-sensitive, comparison if the first one was
5643 not sufficient to differentiate the two strings. */
5645 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5647 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5652 /* Convenience function to get at the Ada encoded lookup name for
5653 LOOKUP_NAME, as a C string. */
5656 ada_lookup_name (const lookup_name_info
&lookup_name
)
5658 return lookup_name
.ada ().lookup_name ().c_str ();
5661 /* Add to OBSTACKP all non-local symbols whose name and domain match
5662 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5663 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5664 symbols otherwise. */
5667 add_nonlocal_symbols (struct obstack
*obstackp
,
5668 const lookup_name_info
&lookup_name
,
5669 domain_enum domain
, int global
)
5671 struct objfile
*objfile
;
5672 struct compunit_symtab
*cu
;
5673 struct match_data data
;
5675 memset (&data
, 0, sizeof data
);
5676 data
.obstackp
= obstackp
;
5678 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5680 ALL_OBJFILES (objfile
)
5682 data
.objfile
= objfile
;
5685 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
.name ().c_str (),
5687 aux_add_nonlocal_symbols
, &data
,
5688 symbol_name_match_type::WILD
,
5691 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
.name ().c_str (),
5693 aux_add_nonlocal_symbols
, &data
,
5694 symbol_name_match_type::FULL
,
5697 ALL_OBJFILE_COMPUNITS (objfile
, cu
)
5699 const struct block
*global_block
5700 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5702 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5708 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5710 const char *name
= ada_lookup_name (lookup_name
);
5711 std::string name1
= std::string ("<_ada_") + name
+ '>';
5713 ALL_OBJFILES (objfile
)
5715 data
.objfile
= objfile
;
5716 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
.c_str (),
5718 aux_add_nonlocal_symbols
,
5720 symbol_name_match_type::FULL
,
5726 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5727 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5728 returning the number of matches. Add these to OBSTACKP.
5730 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5731 symbol match within the nest of blocks whose innermost member is BLOCK,
5732 is the one match returned (no other matches in that or
5733 enclosing blocks is returned). If there are any matches in or
5734 surrounding BLOCK, then these alone are returned.
5736 Names prefixed with "standard__" are handled specially:
5737 "standard__" is first stripped off (by the lookup_name
5738 constructor), and only static and global symbols are searched.
5740 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5741 to lookup global symbols. */
5744 ada_add_all_symbols (struct obstack
*obstackp
,
5745 const struct block
*block
,
5746 const lookup_name_info
&lookup_name
,
5749 int *made_global_lookup_p
)
5753 if (made_global_lookup_p
)
5754 *made_global_lookup_p
= 0;
5756 /* Special case: If the user specifies a symbol name inside package
5757 Standard, do a non-wild matching of the symbol name without
5758 the "standard__" prefix. This was primarily introduced in order
5759 to allow the user to specifically access the standard exceptions
5760 using, for instance, Standard.Constraint_Error when Constraint_Error
5761 is ambiguous (due to the user defining its own Constraint_Error
5762 entity inside its program). */
5763 if (lookup_name
.ada ().standard_p ())
5766 /* Check the non-global symbols. If we have ANY match, then we're done. */
5771 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5774 /* In the !full_search case we're are being called by
5775 ada_iterate_over_symbols, and we don't want to search
5777 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5779 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5783 /* No non-global symbols found. Check our cache to see if we have
5784 already performed this search before. If we have, then return
5787 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5788 domain
, &sym
, &block
))
5791 add_defn_to_vec (obstackp
, sym
, block
);
5795 if (made_global_lookup_p
)
5796 *made_global_lookup_p
= 1;
5798 /* Search symbols from all global blocks. */
5800 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5802 /* Now add symbols from all per-file blocks if we've gotten no hits
5803 (not strictly correct, but perhaps better than an error). */
5805 if (num_defns_collected (obstackp
) == 0)
5806 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5809 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5810 is non-zero, enclosing scope and in global scopes, returning the number of
5812 Sets *RESULTS to point to a newly allocated vector of (SYM,BLOCK) tuples,
5813 indicating the symbols found and the blocks and symbol tables (if
5814 any) in which they were found. This vector should be freed when
5817 When full_search is non-zero, any non-function/non-enumeral
5818 symbol match within the nest of blocks whose innermost member is BLOCK,
5819 is the one match returned (no other matches in that or
5820 enclosing blocks is returned). If there are any matches in or
5821 surrounding BLOCK, then these alone are returned.
5823 Names prefixed with "standard__" are handled specially: "standard__"
5824 is first stripped off, and only static and global symbols are searched. */
5827 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5828 const struct block
*block
,
5830 struct block_symbol
**results
,
5833 int syms_from_global_search
;
5836 auto_obstack obstack
;
5838 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5839 domain
, full_search
, &syms_from_global_search
);
5841 ndefns
= num_defns_collected (&obstack
);
5843 results_size
= obstack_object_size (&obstack
);
5844 *results
= (struct block_symbol
*) malloc (results_size
);
5845 memcpy (*results
, defns_collected (&obstack
, 1), results_size
);
5847 ndefns
= remove_extra_symbols (*results
, ndefns
);
5849 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5850 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5852 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5853 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5854 (*results
)[0].symbol
, (*results
)[0].block
);
5856 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block
);
5861 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5862 in global scopes, returning the number of matches, and setting *RESULTS
5863 to a newly-allocated vector of (SYM,BLOCK) tuples. This newly-allocated
5864 vector should be freed when no longer useful.
5866 See ada_lookup_symbol_list_worker for further details. */
5869 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5870 domain_enum domain
, struct block_symbol
**results
)
5872 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5873 lookup_name_info
lookup_name (name
, name_match_type
);
5875 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5878 /* Implementation of the la_iterate_over_symbols method. */
5881 ada_iterate_over_symbols
5882 (const struct block
*block
, const lookup_name_info
&name
,
5884 gdb::function_view
<symbol_found_callback_ftype
> callback
)
5887 struct block_symbol
*results
;
5888 struct cleanup
*old_chain
;
5890 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5891 old_chain
= make_cleanup (xfree
, results
);
5893 for (i
= 0; i
< ndefs
; ++i
)
5895 if (!callback (results
[i
].symbol
))
5899 do_cleanups (old_chain
);
5902 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5903 to 1, but choosing the first symbol found if there are multiple
5906 The result is stored in *INFO, which must be non-NULL.
5907 If no match is found, INFO->SYM is set to NULL. */
5910 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5912 struct block_symbol
*info
)
5914 struct block_symbol
*candidates
;
5916 struct cleanup
*old_chain
;
5918 /* Since we already have an encoded name, wrap it in '<>' to force a
5919 verbatim match. Otherwise, if the name happens to not look like
5920 an encoded name (because it doesn't include a "__"),
5921 ada_lookup_name_info would re-encode/fold it again, and that
5922 would e.g., incorrectly lowercase object renaming names like
5923 "R28b" -> "r28b". */
5924 std::string verbatim
= std::string ("<") + name
+ '>';
5926 gdb_assert (info
!= NULL
);
5927 memset (info
, 0, sizeof (struct block_symbol
));
5929 n_candidates
= ada_lookup_symbol_list (verbatim
.c_str (), block
,
5930 domain
, &candidates
);
5931 old_chain
= make_cleanup (xfree
, candidates
);
5933 if (n_candidates
== 0)
5935 do_cleanups (old_chain
);
5939 *info
= candidates
[0];
5940 info
->symbol
= fixup_symbol_section (info
->symbol
, NULL
);
5942 do_cleanups (old_chain
);
5945 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5946 scope and in global scopes, or NULL if none. NAME is folded and
5947 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5948 choosing the first symbol if there are multiple choices.
5949 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5952 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5953 domain_enum domain
, int *is_a_field_of_this
)
5955 struct block_symbol info
;
5957 if (is_a_field_of_this
!= NULL
)
5958 *is_a_field_of_this
= 0;
5960 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5961 block0
, domain
, &info
);
5965 static struct block_symbol
5966 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5968 const struct block
*block
,
5969 const domain_enum domain
)
5971 struct block_symbol sym
;
5973 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5974 if (sym
.symbol
!= NULL
)
5977 /* If we haven't found a match at this point, try the primitive
5978 types. In other languages, this search is performed before
5979 searching for global symbols in order to short-circuit that
5980 global-symbol search if it happens that the name corresponds
5981 to a primitive type. But we cannot do the same in Ada, because
5982 it is perfectly legitimate for a program to declare a type which
5983 has the same name as a standard type. If looking up a type in
5984 that situation, we have traditionally ignored the primitive type
5985 in favor of user-defined types. This is why, unlike most other
5986 languages, we search the primitive types this late and only after
5987 having searched the global symbols without success. */
5989 if (domain
== VAR_DOMAIN
)
5991 struct gdbarch
*gdbarch
;
5994 gdbarch
= target_gdbarch ();
5996 gdbarch
= block_gdbarch (block
);
5997 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5998 if (sym
.symbol
!= NULL
)
6002 return (struct block_symbol
) {NULL
, NULL
};
6006 /* True iff STR is a possible encoded suffix of a normal Ada name
6007 that is to be ignored for matching purposes. Suffixes of parallel
6008 names (e.g., XVE) are not included here. Currently, the possible suffixes
6009 are given by any of the regular expressions:
6011 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
6012 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
6013 TKB [subprogram suffix for task bodies]
6014 _E[0-9]+[bs]$ [protected object entry suffixes]
6015 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
6017 Also, any leading "__[0-9]+" sequence is skipped before the suffix
6018 match is performed. This sequence is used to differentiate homonyms,
6019 is an optional part of a valid name suffix. */
6022 is_name_suffix (const char *str
)
6025 const char *matching
;
6026 const int len
= strlen (str
);
6028 /* Skip optional leading __[0-9]+. */
6030 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
6033 while (isdigit (str
[0]))
6039 if (str
[0] == '.' || str
[0] == '$')
6042 while (isdigit (matching
[0]))
6044 if (matching
[0] == '\0')
6050 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
6053 while (isdigit (matching
[0]))
6055 if (matching
[0] == '\0')
6059 /* "TKB" suffixes are used for subprograms implementing task bodies. */
6061 if (strcmp (str
, "TKB") == 0)
6065 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
6066 with a N at the end. Unfortunately, the compiler uses the same
6067 convention for other internal types it creates. So treating
6068 all entity names that end with an "N" as a name suffix causes
6069 some regressions. For instance, consider the case of an enumerated
6070 type. To support the 'Image attribute, it creates an array whose
6072 Having a single character like this as a suffix carrying some
6073 information is a bit risky. Perhaps we should change the encoding
6074 to be something like "_N" instead. In the meantime, do not do
6075 the following check. */
6076 /* Protected Object Subprograms */
6077 if (len
== 1 && str
[0] == 'N')
6082 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
6085 while (isdigit (matching
[0]))
6087 if ((matching
[0] == 'b' || matching
[0] == 's')
6088 && matching
[1] == '\0')
6092 /* ??? We should not modify STR directly, as we are doing below. This
6093 is fine in this case, but may become problematic later if we find
6094 that this alternative did not work, and want to try matching
6095 another one from the begining of STR. Since we modified it, we
6096 won't be able to find the begining of the string anymore! */
6100 while (str
[0] != '_' && str
[0] != '\0')
6102 if (str
[0] != 'n' && str
[0] != 'b')
6108 if (str
[0] == '\000')
6113 if (str
[1] != '_' || str
[2] == '\000')
6117 if (strcmp (str
+ 3, "JM") == 0)
6119 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6120 the LJM suffix in favor of the JM one. But we will
6121 still accept LJM as a valid suffix for a reasonable
6122 amount of time, just to allow ourselves to debug programs
6123 compiled using an older version of GNAT. */
6124 if (strcmp (str
+ 3, "LJM") == 0)
6128 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
6129 || str
[4] == 'U' || str
[4] == 'P')
6131 if (str
[4] == 'R' && str
[5] != 'T')
6135 if (!isdigit (str
[2]))
6137 for (k
= 3; str
[k
] != '\0'; k
+= 1)
6138 if (!isdigit (str
[k
]) && str
[k
] != '_')
6142 if (str
[0] == '$' && isdigit (str
[1]))
6144 for (k
= 2; str
[k
] != '\0'; k
+= 1)
6145 if (!isdigit (str
[k
]) && str
[k
] != '_')
6152 /* Return non-zero if the string starting at NAME and ending before
6153 NAME_END contains no capital letters. */
6156 is_valid_name_for_wild_match (const char *name0
)
6158 const char *decoded_name
= ada_decode (name0
);
6161 /* If the decoded name starts with an angle bracket, it means that
6162 NAME0 does not follow the GNAT encoding format. It should then
6163 not be allowed as a possible wild match. */
6164 if (decoded_name
[0] == '<')
6167 for (i
=0; decoded_name
[i
] != '\0'; i
++)
6168 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6174 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6175 that could start a simple name. Assumes that *NAMEP points into
6176 the string beginning at NAME0. */
6179 advance_wild_match (const char **namep
, const char *name0
, int target0
)
6181 const char *name
= *namep
;
6191 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6194 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6199 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6200 || name
[2] == target0
))
6208 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6218 /* Return true iff NAME encodes a name of the form prefix.PATN.
6219 Ignores any informational suffixes of NAME (i.e., for which
6220 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6224 wild_match (const char *name
, const char *patn
)
6227 const char *name0
= name
;
6231 const char *match
= name
;
6235 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6238 if (*p
== '\0' && is_name_suffix (name
))
6239 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6241 if (name
[-1] == '_')
6244 if (!advance_wild_match (&name
, name0
, *patn
))
6249 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6250 any trailing suffixes that encode debugging information or leading
6251 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6252 information that is ignored). */
6255 full_match (const char *sym_name
, const char *search_name
)
6257 size_t search_name_len
= strlen (search_name
);
6259 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6260 && is_name_suffix (sym_name
+ search_name_len
))
6263 if (startswith (sym_name
, "_ada_")
6264 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6265 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6271 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6272 *defn_symbols, updating the list of symbols in OBSTACKP (if
6273 necessary). OBJFILE is the section containing BLOCK. */
6276 ada_add_block_symbols (struct obstack
*obstackp
,
6277 const struct block
*block
,
6278 const lookup_name_info
&lookup_name
,
6279 domain_enum domain
, struct objfile
*objfile
)
6281 struct block_iterator iter
;
6282 /* A matching argument symbol, if any. */
6283 struct symbol
*arg_sym
;
6284 /* Set true when we find a matching non-argument symbol. */
6290 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6292 sym
= block_iter_match_next (lookup_name
, &iter
))
6294 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6295 SYMBOL_DOMAIN (sym
), domain
))
6297 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6299 if (SYMBOL_IS_ARGUMENT (sym
))
6304 add_defn_to_vec (obstackp
,
6305 fixup_symbol_section (sym
, objfile
),
6312 /* Handle renamings. */
6314 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6317 if (!found_sym
&& arg_sym
!= NULL
)
6319 add_defn_to_vec (obstackp
,
6320 fixup_symbol_section (arg_sym
, objfile
),
6324 if (!lookup_name
.ada ().wild_match_p ())
6328 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6329 const char *name
= ada_lookup_name
.c_str ();
6330 size_t name_len
= ada_lookup_name
.size ();
6332 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6334 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6335 SYMBOL_DOMAIN (sym
), domain
))
6339 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
6342 cmp
= !startswith (SYMBOL_LINKAGE_NAME (sym
), "_ada_");
6344 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
6349 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
6351 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6353 if (SYMBOL_IS_ARGUMENT (sym
))
6358 add_defn_to_vec (obstackp
,
6359 fixup_symbol_section (sym
, objfile
),
6367 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6368 They aren't parameters, right? */
6369 if (!found_sym
&& arg_sym
!= NULL
)
6371 add_defn_to_vec (obstackp
,
6372 fixup_symbol_section (arg_sym
, objfile
),
6379 /* Symbol Completion */
6384 ada_lookup_name_info::matches
6385 (const char *sym_name
,
6386 symbol_name_match_type match_type
,
6387 completion_match_result
*comp_match_res
) const
6390 const char *text
= m_encoded_name
.c_str ();
6391 size_t text_len
= m_encoded_name
.size ();
6393 /* First, test against the fully qualified name of the symbol. */
6395 if (strncmp (sym_name
, text
, text_len
) == 0)
6398 if (match
&& !m_encoded_p
)
6400 /* One needed check before declaring a positive match is to verify
6401 that iff we are doing a verbatim match, the decoded version
6402 of the symbol name starts with '<'. Otherwise, this symbol name
6403 is not a suitable completion. */
6404 const char *sym_name_copy
= sym_name
;
6405 bool has_angle_bracket
;
6407 sym_name
= ada_decode (sym_name
);
6408 has_angle_bracket
= (sym_name
[0] == '<');
6409 match
= (has_angle_bracket
== m_verbatim_p
);
6410 sym_name
= sym_name_copy
;
6413 if (match
&& !m_verbatim_p
)
6415 /* When doing non-verbatim match, another check that needs to
6416 be done is to verify that the potentially matching symbol name
6417 does not include capital letters, because the ada-mode would
6418 not be able to understand these symbol names without the
6419 angle bracket notation. */
6422 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6427 /* Second: Try wild matching... */
6429 if (!match
&& m_wild_match_p
)
6431 /* Since we are doing wild matching, this means that TEXT
6432 may represent an unqualified symbol name. We therefore must
6433 also compare TEXT against the unqualified name of the symbol. */
6434 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6436 if (strncmp (sym_name
, text
, text_len
) == 0)
6440 /* Finally: If we found a match, prepare the result to return. */
6445 if (comp_match_res
!= NULL
)
6447 std::string
&match_str
= comp_match_res
->match
.storage ();
6450 match_str
= ada_decode (sym_name
);
6454 match_str
= add_angle_brackets (sym_name
);
6456 match_str
= sym_name
;
6460 comp_match_res
->set_match (match_str
.c_str ());
6466 /* Add the list of possible symbol names completing TEXT to TRACKER.
6467 WORD is the entire command on which completion is made. */
6470 ada_collect_symbol_completion_matches (completion_tracker
&tracker
,
6471 complete_symbol_mode mode
,
6472 symbol_name_match_type name_match_type
,
6473 const char *text
, const char *word
,
6474 enum type_code code
)
6477 struct compunit_symtab
*s
;
6478 struct minimal_symbol
*msymbol
;
6479 struct objfile
*objfile
;
6480 const struct block
*b
, *surrounding_static_block
= 0;
6481 struct block_iterator iter
;
6482 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6484 gdb_assert (code
== TYPE_CODE_UNDEF
);
6486 lookup_name_info
lookup_name (text
, name_match_type
, true);
6488 /* First, look at the partial symtab symbols. */
6489 expand_symtabs_matching (NULL
,
6495 /* At this point scan through the misc symbol vectors and add each
6496 symbol you find to the list. Eventually we want to ignore
6497 anything that isn't a text symbol (everything else will be
6498 handled by the psymtab code above). */
6500 ALL_MSYMBOLS (objfile
, msymbol
)
6504 if (completion_skip_symbol (mode
, msymbol
))
6507 completion_list_add_name (tracker
,
6508 MSYMBOL_LANGUAGE (msymbol
),
6509 MSYMBOL_LINKAGE_NAME (msymbol
),
6510 lookup_name
, text
, word
);
6513 /* Search upwards from currently selected frame (so that we can
6514 complete on local vars. */
6516 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6518 if (!BLOCK_SUPERBLOCK (b
))
6519 surrounding_static_block
= b
; /* For elmin of dups */
6521 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6523 if (completion_skip_symbol (mode
, sym
))
6526 completion_list_add_name (tracker
,
6527 SYMBOL_LANGUAGE (sym
),
6528 SYMBOL_LINKAGE_NAME (sym
),
6529 lookup_name
, text
, word
);
6533 /* Go through the symtabs and check the externs and statics for
6534 symbols which match. */
6536 ALL_COMPUNITS (objfile
, s
)
6539 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6540 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6542 if (completion_skip_symbol (mode
, sym
))
6545 completion_list_add_name (tracker
,
6546 SYMBOL_LANGUAGE (sym
),
6547 SYMBOL_LINKAGE_NAME (sym
),
6548 lookup_name
, text
, word
);
6552 ALL_COMPUNITS (objfile
, s
)
6555 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6556 /* Don't do this block twice. */
6557 if (b
== surrounding_static_block
)
6559 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6561 if (completion_skip_symbol (mode
, sym
))
6564 completion_list_add_name (tracker
,
6565 SYMBOL_LANGUAGE (sym
),
6566 SYMBOL_LINKAGE_NAME (sym
),
6567 lookup_name
, text
, word
);
6571 do_cleanups (old_chain
);
6576 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6577 for tagged types. */
6580 ada_is_dispatch_table_ptr_type (struct type
*type
)
6584 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6587 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6591 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6594 /* Return non-zero if TYPE is an interface tag. */
6597 ada_is_interface_tag (struct type
*type
)
6599 const char *name
= TYPE_NAME (type
);
6604 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6607 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6608 to be invisible to users. */
6611 ada_is_ignored_field (struct type
*type
, int field_num
)
6613 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6616 /* Check the name of that field. */
6618 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6620 /* Anonymous field names should not be printed.
6621 brobecker/2007-02-20: I don't think this can actually happen
6622 but we don't want to print the value of annonymous fields anyway. */
6626 /* Normally, fields whose name start with an underscore ("_")
6627 are fields that have been internally generated by the compiler,
6628 and thus should not be printed. The "_parent" field is special,
6629 however: This is a field internally generated by the compiler
6630 for tagged types, and it contains the components inherited from
6631 the parent type. This field should not be printed as is, but
6632 should not be ignored either. */
6633 if (name
[0] == '_' && !startswith (name
, "_parent"))
6637 /* If this is the dispatch table of a tagged type or an interface tag,
6639 if (ada_is_tagged_type (type
, 1)
6640 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6641 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6644 /* Not a special field, so it should not be ignored. */
6648 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6649 pointer or reference type whose ultimate target has a tag field. */
6652 ada_is_tagged_type (struct type
*type
, int refok
)
6654 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6657 /* True iff TYPE represents the type of X'Tag */
6660 ada_is_tag_type (struct type
*type
)
6662 type
= ada_check_typedef (type
);
6664 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6668 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6670 return (name
!= NULL
6671 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6675 /* The type of the tag on VAL. */
6678 ada_tag_type (struct value
*val
)
6680 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6683 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6684 retired at Ada 05). */
6687 is_ada95_tag (struct value
*tag
)
6689 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6692 /* The value of the tag on VAL. */
6695 ada_value_tag (struct value
*val
)
6697 return ada_value_struct_elt (val
, "_tag", 0);
6700 /* The value of the tag on the object of type TYPE whose contents are
6701 saved at VALADDR, if it is non-null, or is at memory address
6704 static struct value
*
6705 value_tag_from_contents_and_address (struct type
*type
,
6706 const gdb_byte
*valaddr
,
6709 int tag_byte_offset
;
6710 struct type
*tag_type
;
6712 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6715 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6717 : valaddr
+ tag_byte_offset
);
6718 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6720 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6725 static struct type
*
6726 type_from_tag (struct value
*tag
)
6728 const char *type_name
= ada_tag_name (tag
);
6730 if (type_name
!= NULL
)
6731 return ada_find_any_type (ada_encode (type_name
));
6735 /* Given a value OBJ of a tagged type, return a value of this
6736 type at the base address of the object. The base address, as
6737 defined in Ada.Tags, it is the address of the primary tag of
6738 the object, and therefore where the field values of its full
6739 view can be fetched. */
6742 ada_tag_value_at_base_address (struct value
*obj
)
6745 LONGEST offset_to_top
= 0;
6746 struct type
*ptr_type
, *obj_type
;
6748 CORE_ADDR base_address
;
6750 obj_type
= value_type (obj
);
6752 /* It is the responsability of the caller to deref pointers. */
6754 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6755 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6758 tag
= ada_value_tag (obj
);
6762 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6764 if (is_ada95_tag (tag
))
6767 ptr_type
= language_lookup_primitive_type
6768 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6769 ptr_type
= lookup_pointer_type (ptr_type
);
6770 val
= value_cast (ptr_type
, tag
);
6774 /* It is perfectly possible that an exception be raised while
6775 trying to determine the base address, just like for the tag;
6776 see ada_tag_name for more details. We do not print the error
6777 message for the same reason. */
6781 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6784 CATCH (e
, RETURN_MASK_ERROR
)
6790 /* If offset is null, nothing to do. */
6792 if (offset_to_top
== 0)
6795 /* -1 is a special case in Ada.Tags; however, what should be done
6796 is not quite clear from the documentation. So do nothing for
6799 if (offset_to_top
== -1)
6802 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6803 from the base address. This was however incompatible with
6804 C++ dispatch table: C++ uses a *negative* value to *add*
6805 to the base address. Ada's convention has therefore been
6806 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6807 use the same convention. Here, we support both cases by
6808 checking the sign of OFFSET_TO_TOP. */
6810 if (offset_to_top
> 0)
6811 offset_to_top
= -offset_to_top
;
6813 base_address
= value_address (obj
) + offset_to_top
;
6814 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6816 /* Make sure that we have a proper tag at the new address.
6817 Otherwise, offset_to_top is bogus (which can happen when
6818 the object is not initialized yet). */
6823 obj_type
= type_from_tag (tag
);
6828 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6831 /* Return the "ada__tags__type_specific_data" type. */
6833 static struct type
*
6834 ada_get_tsd_type (struct inferior
*inf
)
6836 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6838 if (data
->tsd_type
== 0)
6839 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6840 return data
->tsd_type
;
6843 /* Return the TSD (type-specific data) associated to the given TAG.
6844 TAG is assumed to be the tag of a tagged-type entity.
6846 May return NULL if we are unable to get the TSD. */
6848 static struct value
*
6849 ada_get_tsd_from_tag (struct value
*tag
)
6854 /* First option: The TSD is simply stored as a field of our TAG.
6855 Only older versions of GNAT would use this format, but we have
6856 to test it first, because there are no visible markers for
6857 the current approach except the absence of that field. */
6859 val
= ada_value_struct_elt (tag
, "tsd", 1);
6863 /* Try the second representation for the dispatch table (in which
6864 there is no explicit 'tsd' field in the referent of the tag pointer,
6865 and instead the tsd pointer is stored just before the dispatch
6868 type
= ada_get_tsd_type (current_inferior());
6871 type
= lookup_pointer_type (lookup_pointer_type (type
));
6872 val
= value_cast (type
, tag
);
6875 return value_ind (value_ptradd (val
, -1));
6878 /* Given the TSD of a tag (type-specific data), return a string
6879 containing the name of the associated type.
6881 The returned value is good until the next call. May return NULL
6882 if we are unable to determine the tag name. */
6885 ada_tag_name_from_tsd (struct value
*tsd
)
6887 static char name
[1024];
6891 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6894 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6895 for (p
= name
; *p
!= '\0'; p
+= 1)
6901 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6904 Return NULL if the TAG is not an Ada tag, or if we were unable to
6905 determine the name of that tag. The result is good until the next
6909 ada_tag_name (struct value
*tag
)
6913 if (!ada_is_tag_type (value_type (tag
)))
6916 /* It is perfectly possible that an exception be raised while trying
6917 to determine the TAG's name, even under normal circumstances:
6918 The associated variable may be uninitialized or corrupted, for
6919 instance. We do not let any exception propagate past this point.
6920 instead we return NULL.
6922 We also do not print the error message either (which often is very
6923 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6924 the caller print a more meaningful message if necessary. */
6927 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6930 name
= ada_tag_name_from_tsd (tsd
);
6932 CATCH (e
, RETURN_MASK_ERROR
)
6940 /* The parent type of TYPE, or NULL if none. */
6943 ada_parent_type (struct type
*type
)
6947 type
= ada_check_typedef (type
);
6949 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6952 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6953 if (ada_is_parent_field (type
, i
))
6955 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6957 /* If the _parent field is a pointer, then dereference it. */
6958 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6959 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6960 /* If there is a parallel XVS type, get the actual base type. */
6961 parent_type
= ada_get_base_type (parent_type
);
6963 return ada_check_typedef (parent_type
);
6969 /* True iff field number FIELD_NUM of structure type TYPE contains the
6970 parent-type (inherited) fields of a derived type. Assumes TYPE is
6971 a structure type with at least FIELD_NUM+1 fields. */
6974 ada_is_parent_field (struct type
*type
, int field_num
)
6976 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6978 return (name
!= NULL
6979 && (startswith (name
, "PARENT")
6980 || startswith (name
, "_parent")));
6983 /* True iff field number FIELD_NUM of structure type TYPE is a
6984 transparent wrapper field (which should be silently traversed when doing
6985 field selection and flattened when printing). Assumes TYPE is a
6986 structure type with at least FIELD_NUM+1 fields. Such fields are always
6990 ada_is_wrapper_field (struct type
*type
, int field_num
)
6992 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6994 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6996 /* This happens in functions with "out" or "in out" parameters
6997 which are passed by copy. For such functions, GNAT describes
6998 the function's return type as being a struct where the return
6999 value is in a field called RETVAL, and where the other "out"
7000 or "in out" parameters are fields of that struct. This is not
7005 return (name
!= NULL
7006 && (startswith (name
, "PARENT")
7007 || strcmp (name
, "REP") == 0
7008 || startswith (name
, "_parent")
7009 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
7012 /* True iff field number FIELD_NUM of structure or union type TYPE
7013 is a variant wrapper. Assumes TYPE is a structure type with at least
7014 FIELD_NUM+1 fields. */
7017 ada_is_variant_part (struct type
*type
, int field_num
)
7019 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
7021 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
7022 || (is_dynamic_field (type
, field_num
)
7023 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
7024 == TYPE_CODE_UNION
)));
7027 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
7028 whose discriminants are contained in the record type OUTER_TYPE,
7029 returns the type of the controlling discriminant for the variant.
7030 May return NULL if the type could not be found. */
7033 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
7035 const char *name
= ada_variant_discrim_name (var_type
);
7037 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
7040 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
7041 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
7042 represents a 'when others' clause; otherwise 0. */
7045 ada_is_others_clause (struct type
*type
, int field_num
)
7047 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7049 return (name
!= NULL
&& name
[0] == 'O');
7052 /* Assuming that TYPE0 is the type of the variant part of a record,
7053 returns the name of the discriminant controlling the variant.
7054 The value is valid until the next call to ada_variant_discrim_name. */
7057 ada_variant_discrim_name (struct type
*type0
)
7059 static char *result
= NULL
;
7060 static size_t result_len
= 0;
7063 const char *discrim_end
;
7064 const char *discrim_start
;
7066 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
7067 type
= TYPE_TARGET_TYPE (type0
);
7071 name
= ada_type_name (type
);
7073 if (name
== NULL
|| name
[0] == '\000')
7076 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
7079 if (startswith (discrim_end
, "___XVN"))
7082 if (discrim_end
== name
)
7085 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
7088 if (discrim_start
== name
+ 1)
7090 if ((discrim_start
> name
+ 3
7091 && startswith (discrim_start
- 3, "___"))
7092 || discrim_start
[-1] == '.')
7096 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
7097 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
7098 result
[discrim_end
- discrim_start
] = '\0';
7102 /* Scan STR for a subtype-encoded number, beginning at position K.
7103 Put the position of the character just past the number scanned in
7104 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7105 Return 1 if there was a valid number at the given position, and 0
7106 otherwise. A "subtype-encoded" number consists of the absolute value
7107 in decimal, followed by the letter 'm' to indicate a negative number.
7108 Assumes 0m does not occur. */
7111 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
7115 if (!isdigit (str
[k
]))
7118 /* Do it the hard way so as not to make any assumption about
7119 the relationship of unsigned long (%lu scan format code) and
7122 while (isdigit (str
[k
]))
7124 RU
= RU
* 10 + (str
[k
] - '0');
7131 *R
= (-(LONGEST
) (RU
- 1)) - 1;
7137 /* NOTE on the above: Technically, C does not say what the results of
7138 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7139 number representable as a LONGEST (although either would probably work
7140 in most implementations). When RU>0, the locution in the then branch
7141 above is always equivalent to the negative of RU. */
7148 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7149 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7150 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7153 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
7155 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7169 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
7179 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
7180 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7182 if (val
>= L
&& val
<= U
)
7194 /* FIXME: Lots of redundancy below. Try to consolidate. */
7196 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7197 ARG_TYPE, extract and return the value of one of its (non-static)
7198 fields. FIELDNO says which field. Differs from value_primitive_field
7199 only in that it can handle packed values of arbitrary type. */
7201 static struct value
*
7202 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7203 struct type
*arg_type
)
7207 arg_type
= ada_check_typedef (arg_type
);
7208 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
7210 /* Handle packed fields. */
7212 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
7214 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7215 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7217 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7218 offset
+ bit_pos
/ 8,
7219 bit_pos
% 8, bit_size
, type
);
7222 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7225 /* Find field with name NAME in object of type TYPE. If found,
7226 set the following for each argument that is non-null:
7227 - *FIELD_TYPE_P to the field's type;
7228 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7229 an object of that type;
7230 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7231 - *BIT_SIZE_P to its size in bits if the field is packed, and
7233 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7234 fields up to but not including the desired field, or by the total
7235 number of fields if not found. A NULL value of NAME never
7236 matches; the function just counts visible fields in this case.
7238 Notice that we need to handle when a tagged record hierarchy
7239 has some components with the same name, like in this scenario:
7241 type Top_T is tagged record
7247 type Middle_T is new Top.Top_T with record
7248 N : Character := 'a';
7252 type Bottom_T is new Middle.Middle_T with record
7254 C : Character := '5';
7256 A : Character := 'J';
7259 Let's say we now have a variable declared and initialized as follow:
7261 TC : Top_A := new Bottom_T;
7263 And then we use this variable to call this function
7265 procedure Assign (Obj: in out Top_T; TV : Integer);
7269 Assign (Top_T (B), 12);
7271 Now, we're in the debugger, and we're inside that procedure
7272 then and we want to print the value of obj.c:
7274 Usually, the tagged record or one of the parent type owns the
7275 component to print and there's no issue but in this particular
7276 case, what does it mean to ask for Obj.C? Since the actual
7277 type for object is type Bottom_T, it could mean two things: type
7278 component C from the Middle_T view, but also component C from
7279 Bottom_T. So in that "undefined" case, when the component is
7280 not found in the non-resolved type (which includes all the
7281 components of the parent type), then resolve it and see if we
7282 get better luck once expanded.
7284 In the case of homonyms in the derived tagged type, we don't
7285 guaranty anything, and pick the one that's easiest for us
7288 Returns 1 if found, 0 otherwise. */
7291 find_struct_field (const char *name
, struct type
*type
, int offset
,
7292 struct type
**field_type_p
,
7293 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7297 int parent_offset
= -1;
7299 type
= ada_check_typedef (type
);
7301 if (field_type_p
!= NULL
)
7302 *field_type_p
= NULL
;
7303 if (byte_offset_p
!= NULL
)
7305 if (bit_offset_p
!= NULL
)
7307 if (bit_size_p
!= NULL
)
7310 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7312 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7313 int fld_offset
= offset
+ bit_pos
/ 8;
7314 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7316 if (t_field_name
== NULL
)
7319 else if (ada_is_parent_field (type
, i
))
7321 /* This is a field pointing us to the parent type of a tagged
7322 type. As hinted in this function's documentation, we give
7323 preference to fields in the current record first, so what
7324 we do here is just record the index of this field before
7325 we skip it. If it turns out we couldn't find our field
7326 in the current record, then we'll get back to it and search
7327 inside it whether the field might exist in the parent. */
7333 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7335 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7337 if (field_type_p
!= NULL
)
7338 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7339 if (byte_offset_p
!= NULL
)
7340 *byte_offset_p
= fld_offset
;
7341 if (bit_offset_p
!= NULL
)
7342 *bit_offset_p
= bit_pos
% 8;
7343 if (bit_size_p
!= NULL
)
7344 *bit_size_p
= bit_size
;
7347 else if (ada_is_wrapper_field (type
, i
))
7349 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7350 field_type_p
, byte_offset_p
, bit_offset_p
,
7351 bit_size_p
, index_p
))
7354 else if (ada_is_variant_part (type
, i
))
7356 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7359 struct type
*field_type
7360 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7362 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7364 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7366 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7367 field_type_p
, byte_offset_p
,
7368 bit_offset_p
, bit_size_p
, index_p
))
7372 else if (index_p
!= NULL
)
7376 /* Field not found so far. If this is a tagged type which
7377 has a parent, try finding that field in the parent now. */
7379 if (parent_offset
!= -1)
7381 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7382 int fld_offset
= offset
+ bit_pos
/ 8;
7384 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, parent_offset
),
7385 fld_offset
, field_type_p
, byte_offset_p
,
7386 bit_offset_p
, bit_size_p
, index_p
))
7393 /* Number of user-visible fields in record type TYPE. */
7396 num_visible_fields (struct type
*type
)
7401 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7405 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7406 and search in it assuming it has (class) type TYPE.
7407 If found, return value, else return NULL.
7409 Searches recursively through wrapper fields (e.g., '_parent').
7411 In the case of homonyms in the tagged types, please refer to the
7412 long explanation in find_struct_field's function documentation. */
7414 static struct value
*
7415 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7419 int parent_offset
= -1;
7421 type
= ada_check_typedef (type
);
7422 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7424 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7426 if (t_field_name
== NULL
)
7429 else if (ada_is_parent_field (type
, i
))
7431 /* This is a field pointing us to the parent type of a tagged
7432 type. As hinted in this function's documentation, we give
7433 preference to fields in the current record first, so what
7434 we do here is just record the index of this field before
7435 we skip it. If it turns out we couldn't find our field
7436 in the current record, then we'll get back to it and search
7437 inside it whether the field might exist in the parent. */
7443 else if (field_name_match (t_field_name
, name
))
7444 return ada_value_primitive_field (arg
, offset
, i
, type
);
7446 else if (ada_is_wrapper_field (type
, i
))
7448 struct value
*v
= /* Do not let indent join lines here. */
7449 ada_search_struct_field (name
, arg
,
7450 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7451 TYPE_FIELD_TYPE (type
, i
));
7457 else if (ada_is_variant_part (type
, i
))
7459 /* PNH: Do we ever get here? See find_struct_field. */
7461 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7463 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7465 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7467 struct value
*v
= ada_search_struct_field
/* Force line
7470 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7471 TYPE_FIELD_TYPE (field_type
, j
));
7479 /* Field not found so far. If this is a tagged type which
7480 has a parent, try finding that field in the parent now. */
7482 if (parent_offset
!= -1)
7484 struct value
*v
= ada_search_struct_field (
7485 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7486 TYPE_FIELD_TYPE (type
, parent_offset
));
7495 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7496 int, struct type
*);
7499 /* Return field #INDEX in ARG, where the index is that returned by
7500 * find_struct_field through its INDEX_P argument. Adjust the address
7501 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7502 * If found, return value, else return NULL. */
7504 static struct value
*
7505 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7508 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7512 /* Auxiliary function for ada_index_struct_field. Like
7513 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7516 static struct value
*
7517 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7521 type
= ada_check_typedef (type
);
7523 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7525 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7527 else if (ada_is_wrapper_field (type
, i
))
7529 struct value
*v
= /* Do not let indent join lines here. */
7530 ada_index_struct_field_1 (index_p
, arg
,
7531 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7532 TYPE_FIELD_TYPE (type
, i
));
7538 else if (ada_is_variant_part (type
, i
))
7540 /* PNH: Do we ever get here? See ada_search_struct_field,
7541 find_struct_field. */
7542 error (_("Cannot assign this kind of variant record"));
7544 else if (*index_p
== 0)
7545 return ada_value_primitive_field (arg
, offset
, i
, type
);
7552 /* Given ARG, a value of type (pointer or reference to a)*
7553 structure/union, extract the component named NAME from the ultimate
7554 target structure/union and return it as a value with its
7557 The routine searches for NAME among all members of the structure itself
7558 and (recursively) among all members of any wrapper members
7561 If NO_ERR, then simply return NULL in case of error, rather than
7565 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
7567 struct type
*t
, *t1
;
7571 t1
= t
= ada_check_typedef (value_type (arg
));
7572 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7574 t1
= TYPE_TARGET_TYPE (t
);
7577 t1
= ada_check_typedef (t1
);
7578 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7580 arg
= coerce_ref (arg
);
7585 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7587 t1
= TYPE_TARGET_TYPE (t
);
7590 t1
= ada_check_typedef (t1
);
7591 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7593 arg
= value_ind (arg
);
7600 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7604 v
= ada_search_struct_field (name
, arg
, 0, t
);
7607 int bit_offset
, bit_size
, byte_offset
;
7608 struct type
*field_type
;
7611 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7612 address
= value_address (ada_value_ind (arg
));
7614 address
= value_address (ada_coerce_ref (arg
));
7616 /* Check to see if this is a tagged type. We also need to handle
7617 the case where the type is a reference to a tagged type, but
7618 we have to be careful to exclude pointers to tagged types.
7619 The latter should be shown as usual (as a pointer), whereas
7620 a reference should mostly be transparent to the user. */
7622 if (ada_is_tagged_type (t1
, 0)
7623 || (TYPE_CODE (t1
) == TYPE_CODE_REF
7624 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
7626 /* We first try to find the searched field in the current type.
7627 If not found then let's look in the fixed type. */
7629 if (!find_struct_field (name
, t1
, 0,
7630 &field_type
, &byte_offset
, &bit_offset
,
7632 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
7636 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
7639 if (find_struct_field (name
, t1
, 0,
7640 &field_type
, &byte_offset
, &bit_offset
,
7645 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7646 arg
= ada_coerce_ref (arg
);
7648 arg
= ada_value_ind (arg
);
7649 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7650 bit_offset
, bit_size
,
7654 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7658 if (v
!= NULL
|| no_err
)
7661 error (_("There is no member named %s."), name
);
7667 error (_("Attempt to extract a component of "
7668 "a value that is not a record."));
7671 /* Return a string representation of type TYPE. */
7674 type_as_string (struct type
*type
)
7676 string_file tmp_stream
;
7678 type_print (type
, "", &tmp_stream
, -1);
7680 return std::move (tmp_stream
.string ());
7683 /* Given a type TYPE, look up the type of the component of type named NAME.
7684 If DISPP is non-null, add its byte displacement from the beginning of a
7685 structure (pointed to by a value) of type TYPE to *DISPP (does not
7686 work for packed fields).
7688 Matches any field whose name has NAME as a prefix, possibly
7691 TYPE can be either a struct or union. If REFOK, TYPE may also
7692 be a (pointer or reference)+ to a struct or union, and the
7693 ultimate target type will be searched.
7695 Looks recursively into variant clauses and parent types.
7697 In the case of homonyms in the tagged types, please refer to the
7698 long explanation in find_struct_field's function documentation.
7700 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7701 TYPE is not a type of the right kind. */
7703 static struct type
*
7704 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7708 int parent_offset
= -1;
7713 if (refok
&& type
!= NULL
)
7716 type
= ada_check_typedef (type
);
7717 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7718 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7720 type
= TYPE_TARGET_TYPE (type
);
7724 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7725 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7730 error (_("Type %s is not a structure or union type"),
7731 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7734 type
= to_static_fixed_type (type
);
7736 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7738 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7741 if (t_field_name
== NULL
)
7744 else if (ada_is_parent_field (type
, i
))
7746 /* This is a field pointing us to the parent type of a tagged
7747 type. As hinted in this function's documentation, we give
7748 preference to fields in the current record first, so what
7749 we do here is just record the index of this field before
7750 we skip it. If it turns out we couldn't find our field
7751 in the current record, then we'll get back to it and search
7752 inside it whether the field might exist in the parent. */
7758 else if (field_name_match (t_field_name
, name
))
7759 return TYPE_FIELD_TYPE (type
, i
);
7761 else if (ada_is_wrapper_field (type
, i
))
7763 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7769 else if (ada_is_variant_part (type
, i
))
7772 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7775 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7777 /* FIXME pnh 2008/01/26: We check for a field that is
7778 NOT wrapped in a struct, since the compiler sometimes
7779 generates these for unchecked variant types. Revisit
7780 if the compiler changes this practice. */
7781 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7783 if (v_field_name
!= NULL
7784 && field_name_match (v_field_name
, name
))
7785 t
= TYPE_FIELD_TYPE (field_type
, j
);
7787 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7798 /* Field not found so far. If this is a tagged type which
7799 has a parent, try finding that field in the parent now. */
7801 if (parent_offset
!= -1)
7805 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, parent_offset
),
7814 const char *name_str
= name
!= NULL
? name
: _("<null>");
7816 error (_("Type %s has no component named %s"),
7817 type_as_string (type
).c_str (), name_str
);
7823 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7824 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7825 represents an unchecked union (that is, the variant part of a
7826 record that is named in an Unchecked_Union pragma). */
7829 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7831 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7833 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7837 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7838 within a value of type OUTER_TYPE that is stored in GDB at
7839 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7840 numbering from 0) is applicable. Returns -1 if none are. */
7843 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7844 const gdb_byte
*outer_valaddr
)
7848 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7849 struct value
*outer
;
7850 struct value
*discrim
;
7851 LONGEST discrim_val
;
7853 /* Using plain value_from_contents_and_address here causes problems
7854 because we will end up trying to resolve a type that is currently
7855 being constructed. */
7856 outer
= value_from_contents_and_address_unresolved (outer_type
,
7858 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7859 if (discrim
== NULL
)
7861 discrim_val
= value_as_long (discrim
);
7864 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7866 if (ada_is_others_clause (var_type
, i
))
7868 else if (ada_in_variant (discrim_val
, var_type
, i
))
7872 return others_clause
;
7877 /* Dynamic-Sized Records */
7879 /* Strategy: The type ostensibly attached to a value with dynamic size
7880 (i.e., a size that is not statically recorded in the debugging
7881 data) does not accurately reflect the size or layout of the value.
7882 Our strategy is to convert these values to values with accurate,
7883 conventional types that are constructed on the fly. */
7885 /* There is a subtle and tricky problem here. In general, we cannot
7886 determine the size of dynamic records without its data. However,
7887 the 'struct value' data structure, which GDB uses to represent
7888 quantities in the inferior process (the target), requires the size
7889 of the type at the time of its allocation in order to reserve space
7890 for GDB's internal copy of the data. That's why the
7891 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7892 rather than struct value*s.
7894 However, GDB's internal history variables ($1, $2, etc.) are
7895 struct value*s containing internal copies of the data that are not, in
7896 general, the same as the data at their corresponding addresses in
7897 the target. Fortunately, the types we give to these values are all
7898 conventional, fixed-size types (as per the strategy described
7899 above), so that we don't usually have to perform the
7900 'to_fixed_xxx_type' conversions to look at their values.
7901 Unfortunately, there is one exception: if one of the internal
7902 history variables is an array whose elements are unconstrained
7903 records, then we will need to create distinct fixed types for each
7904 element selected. */
7906 /* The upshot of all of this is that many routines take a (type, host
7907 address, target address) triple as arguments to represent a value.
7908 The host address, if non-null, is supposed to contain an internal
7909 copy of the relevant data; otherwise, the program is to consult the
7910 target at the target address. */
7912 /* Assuming that VAL0 represents a pointer value, the result of
7913 dereferencing it. Differs from value_ind in its treatment of
7914 dynamic-sized types. */
7917 ada_value_ind (struct value
*val0
)
7919 struct value
*val
= value_ind (val0
);
7921 if (ada_is_tagged_type (value_type (val
), 0))
7922 val
= ada_tag_value_at_base_address (val
);
7924 return ada_to_fixed_value (val
);
7927 /* The value resulting from dereferencing any "reference to"
7928 qualifiers on VAL0. */
7930 static struct value
*
7931 ada_coerce_ref (struct value
*val0
)
7933 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7935 struct value
*val
= val0
;
7937 val
= coerce_ref (val
);
7939 if (ada_is_tagged_type (value_type (val
), 0))
7940 val
= ada_tag_value_at_base_address (val
);
7942 return ada_to_fixed_value (val
);
7948 /* Return OFF rounded upward if necessary to a multiple of
7949 ALIGNMENT (a power of 2). */
7952 align_value (unsigned int off
, unsigned int alignment
)
7954 return (off
+ alignment
- 1) & ~(alignment
- 1);
7957 /* Return the bit alignment required for field #F of template type TYPE. */
7960 field_alignment (struct type
*type
, int f
)
7962 const char *name
= TYPE_FIELD_NAME (type
, f
);
7966 /* The field name should never be null, unless the debugging information
7967 is somehow malformed. In this case, we assume the field does not
7968 require any alignment. */
7972 len
= strlen (name
);
7974 if (!isdigit (name
[len
- 1]))
7977 if (isdigit (name
[len
- 2]))
7978 align_offset
= len
- 2;
7980 align_offset
= len
- 1;
7982 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7983 return TARGET_CHAR_BIT
;
7985 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7988 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7990 static struct symbol
*
7991 ada_find_any_type_symbol (const char *name
)
7995 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7996 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7999 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
8003 /* Find a type named NAME. Ignores ambiguity. This routine will look
8004 solely for types defined by debug info, it will not search the GDB
8007 static struct type
*
8008 ada_find_any_type (const char *name
)
8010 struct symbol
*sym
= ada_find_any_type_symbol (name
);
8013 return SYMBOL_TYPE (sym
);
8018 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
8019 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
8020 symbol, in which case it is returned. Otherwise, this looks for
8021 symbols whose name is that of NAME_SYM suffixed with "___XR".
8022 Return symbol if found, and NULL otherwise. */
8025 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
8027 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
8030 if (strstr (name
, "___XR") != NULL
)
8033 sym
= find_old_style_renaming_symbol (name
, block
);
8038 /* Not right yet. FIXME pnh 7/20/2007. */
8039 sym
= ada_find_any_type_symbol (name
);
8040 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
8046 static struct symbol
*
8047 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
8049 const struct symbol
*function_sym
= block_linkage_function (block
);
8052 if (function_sym
!= NULL
)
8054 /* If the symbol is defined inside a function, NAME is not fully
8055 qualified. This means we need to prepend the function name
8056 as well as adding the ``___XR'' suffix to build the name of
8057 the associated renaming symbol. */
8058 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
8059 /* Function names sometimes contain suffixes used
8060 for instance to qualify nested subprograms. When building
8061 the XR type name, we need to make sure that this suffix is
8062 not included. So do not include any suffix in the function
8063 name length below. */
8064 int function_name_len
= ada_name_prefix_len (function_name
);
8065 const int rename_len
= function_name_len
+ 2 /* "__" */
8066 + strlen (name
) + 6 /* "___XR\0" */ ;
8068 /* Strip the suffix if necessary. */
8069 ada_remove_trailing_digits (function_name
, &function_name_len
);
8070 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
8071 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
8073 /* Library-level functions are a special case, as GNAT adds
8074 a ``_ada_'' prefix to the function name to avoid namespace
8075 pollution. However, the renaming symbols themselves do not
8076 have this prefix, so we need to skip this prefix if present. */
8077 if (function_name_len
> 5 /* "_ada_" */
8078 && strstr (function_name
, "_ada_") == function_name
)
8081 function_name_len
-= 5;
8084 rename
= (char *) alloca (rename_len
* sizeof (char));
8085 strncpy (rename
, function_name
, function_name_len
);
8086 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
8091 const int rename_len
= strlen (name
) + 6;
8093 rename
= (char *) alloca (rename_len
* sizeof (char));
8094 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
8097 return ada_find_any_type_symbol (rename
);
8100 /* Because of GNAT encoding conventions, several GDB symbols may match a
8101 given type name. If the type denoted by TYPE0 is to be preferred to
8102 that of TYPE1 for purposes of type printing, return non-zero;
8103 otherwise return 0. */
8106 ada_prefer_type (struct type
*type0
, struct type
*type1
)
8110 else if (type0
== NULL
)
8112 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
8114 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
8116 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
8118 else if (ada_is_constrained_packed_array_type (type0
))
8120 else if (ada_is_array_descriptor_type (type0
)
8121 && !ada_is_array_descriptor_type (type1
))
8125 const char *type0_name
= type_name_no_tag (type0
);
8126 const char *type1_name
= type_name_no_tag (type1
);
8128 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
8129 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
8135 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
8136 null, its TYPE_TAG_NAME. Null if TYPE is null. */
8139 ada_type_name (struct type
*type
)
8143 else if (TYPE_NAME (type
) != NULL
)
8144 return TYPE_NAME (type
);
8146 return TYPE_TAG_NAME (type
);
8149 /* Search the list of "descriptive" types associated to TYPE for a type
8150 whose name is NAME. */
8152 static struct type
*
8153 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
8155 struct type
*result
, *tmp
;
8157 if (ada_ignore_descriptive_types_p
)
8160 /* If there no descriptive-type info, then there is no parallel type
8162 if (!HAVE_GNAT_AUX_INFO (type
))
8165 result
= TYPE_DESCRIPTIVE_TYPE (type
);
8166 while (result
!= NULL
)
8168 const char *result_name
= ada_type_name (result
);
8170 if (result_name
== NULL
)
8172 warning (_("unexpected null name on descriptive type"));
8176 /* If the names match, stop. */
8177 if (strcmp (result_name
, name
) == 0)
8180 /* Otherwise, look at the next item on the list, if any. */
8181 if (HAVE_GNAT_AUX_INFO (result
))
8182 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
8186 /* If not found either, try after having resolved the typedef. */
8191 result
= check_typedef (result
);
8192 if (HAVE_GNAT_AUX_INFO (result
))
8193 result
= TYPE_DESCRIPTIVE_TYPE (result
);
8199 /* If we didn't find a match, see whether this is a packed array. With
8200 older compilers, the descriptive type information is either absent or
8201 irrelevant when it comes to packed arrays so the above lookup fails.
8202 Fall back to using a parallel lookup by name in this case. */
8203 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
8204 return ada_find_any_type (name
);
8209 /* Find a parallel type to TYPE with the specified NAME, using the
8210 descriptive type taken from the debugging information, if available,
8211 and otherwise using the (slower) name-based method. */
8213 static struct type
*
8214 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
8216 struct type
*result
= NULL
;
8218 if (HAVE_GNAT_AUX_INFO (type
))
8219 result
= find_parallel_type_by_descriptive_type (type
, name
);
8221 result
= ada_find_any_type (name
);
8226 /* Same as above, but specify the name of the parallel type by appending
8227 SUFFIX to the name of TYPE. */
8230 ada_find_parallel_type (struct type
*type
, const char *suffix
)
8233 const char *type_name
= ada_type_name (type
);
8236 if (type_name
== NULL
)
8239 len
= strlen (type_name
);
8241 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
8243 strcpy (name
, type_name
);
8244 strcpy (name
+ len
, suffix
);
8246 return ada_find_parallel_type_with_name (type
, name
);
8249 /* If TYPE is a variable-size record type, return the corresponding template
8250 type describing its fields. Otherwise, return NULL. */
8252 static struct type
*
8253 dynamic_template_type (struct type
*type
)
8255 type
= ada_check_typedef (type
);
8257 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
8258 || ada_type_name (type
) == NULL
)
8262 int len
= strlen (ada_type_name (type
));
8264 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
8267 return ada_find_parallel_type (type
, "___XVE");
8271 /* Assuming that TEMPL_TYPE is a union or struct type, returns
8272 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
8275 is_dynamic_field (struct type
*templ_type
, int field_num
)
8277 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
8280 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
8281 && strstr (name
, "___XVL") != NULL
;
8284 /* The index of the variant field of TYPE, or -1 if TYPE does not
8285 represent a variant record type. */
8288 variant_field_index (struct type
*type
)
8292 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
8295 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
8297 if (ada_is_variant_part (type
, f
))
8303 /* A record type with no fields. */
8305 static struct type
*
8306 empty_record (struct type
*templ
)
8308 struct type
*type
= alloc_type_copy (templ
);
8310 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
8311 TYPE_NFIELDS (type
) = 0;
8312 TYPE_FIELDS (type
) = NULL
;
8313 INIT_CPLUS_SPECIFIC (type
);
8314 TYPE_NAME (type
) = "<empty>";
8315 TYPE_TAG_NAME (type
) = NULL
;
8316 TYPE_LENGTH (type
) = 0;
8320 /* An ordinary record type (with fixed-length fields) that describes
8321 the value of type TYPE at VALADDR or ADDRESS (see comments at
8322 the beginning of this section) VAL according to GNAT conventions.
8323 DVAL0 should describe the (portion of a) record that contains any
8324 necessary discriminants. It should be NULL if value_type (VAL) is
8325 an outer-level type (i.e., as opposed to a branch of a variant.) A
8326 variant field (unless unchecked) is replaced by a particular branch
8329 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8330 length are not statically known are discarded. As a consequence,
8331 VALADDR, ADDRESS and DVAL0 are ignored.
8333 NOTE: Limitations: For now, we assume that dynamic fields and
8334 variants occupy whole numbers of bytes. However, they need not be
8338 ada_template_to_fixed_record_type_1 (struct type
*type
,
8339 const gdb_byte
*valaddr
,
8340 CORE_ADDR address
, struct value
*dval0
,
8341 int keep_dynamic_fields
)
8343 struct value
*mark
= value_mark ();
8346 int nfields
, bit_len
;
8352 /* Compute the number of fields in this record type that are going
8353 to be processed: unless keep_dynamic_fields, this includes only
8354 fields whose position and length are static will be processed. */
8355 if (keep_dynamic_fields
)
8356 nfields
= TYPE_NFIELDS (type
);
8360 while (nfields
< TYPE_NFIELDS (type
)
8361 && !ada_is_variant_part (type
, nfields
)
8362 && !is_dynamic_field (type
, nfields
))
8366 rtype
= alloc_type_copy (type
);
8367 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8368 INIT_CPLUS_SPECIFIC (rtype
);
8369 TYPE_NFIELDS (rtype
) = nfields
;
8370 TYPE_FIELDS (rtype
) = (struct field
*)
8371 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8372 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
8373 TYPE_NAME (rtype
) = ada_type_name (type
);
8374 TYPE_TAG_NAME (rtype
) = NULL
;
8375 TYPE_FIXED_INSTANCE (rtype
) = 1;
8381 for (f
= 0; f
< nfields
; f
+= 1)
8383 off
= align_value (off
, field_alignment (type
, f
))
8384 + TYPE_FIELD_BITPOS (type
, f
);
8385 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
8386 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8388 if (ada_is_variant_part (type
, f
))
8393 else if (is_dynamic_field (type
, f
))
8395 const gdb_byte
*field_valaddr
= valaddr
;
8396 CORE_ADDR field_address
= address
;
8397 struct type
*field_type
=
8398 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8402 /* rtype's length is computed based on the run-time
8403 value of discriminants. If the discriminants are not
8404 initialized, the type size may be completely bogus and
8405 GDB may fail to allocate a value for it. So check the
8406 size first before creating the value. */
8407 ada_ensure_varsize_limit (rtype
);
8408 /* Using plain value_from_contents_and_address here
8409 causes problems because we will end up trying to
8410 resolve a type that is currently being
8412 dval
= value_from_contents_and_address_unresolved (rtype
,
8415 rtype
= value_type (dval
);
8420 /* If the type referenced by this field is an aligner type, we need
8421 to unwrap that aligner type, because its size might not be set.
8422 Keeping the aligner type would cause us to compute the wrong
8423 size for this field, impacting the offset of the all the fields
8424 that follow this one. */
8425 if (ada_is_aligner_type (field_type
))
8427 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8429 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8430 field_address
= cond_offset_target (field_address
, field_offset
);
8431 field_type
= ada_aligned_type (field_type
);
8434 field_valaddr
= cond_offset_host (field_valaddr
,
8435 off
/ TARGET_CHAR_BIT
);
8436 field_address
= cond_offset_target (field_address
,
8437 off
/ TARGET_CHAR_BIT
);
8439 /* Get the fixed type of the field. Note that, in this case,
8440 we do not want to get the real type out of the tag: if
8441 the current field is the parent part of a tagged record,
8442 we will get the tag of the object. Clearly wrong: the real
8443 type of the parent is not the real type of the child. We
8444 would end up in an infinite loop. */
8445 field_type
= ada_get_base_type (field_type
);
8446 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8447 field_address
, dval
, 0);
8448 /* If the field size is already larger than the maximum
8449 object size, then the record itself will necessarily
8450 be larger than the maximum object size. We need to make
8451 this check now, because the size might be so ridiculously
8452 large (due to an uninitialized variable in the inferior)
8453 that it would cause an overflow when adding it to the
8455 ada_ensure_varsize_limit (field_type
);
8457 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8458 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8459 /* The multiplication can potentially overflow. But because
8460 the field length has been size-checked just above, and
8461 assuming that the maximum size is a reasonable value,
8462 an overflow should not happen in practice. So rather than
8463 adding overflow recovery code to this already complex code,
8464 we just assume that it's not going to happen. */
8466 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8470 /* Note: If this field's type is a typedef, it is important
8471 to preserve the typedef layer.
8473 Otherwise, we might be transforming a typedef to a fat
8474 pointer (encoding a pointer to an unconstrained array),
8475 into a basic fat pointer (encoding an unconstrained
8476 array). As both types are implemented using the same
8477 structure, the typedef is the only clue which allows us
8478 to distinguish between the two options. Stripping it
8479 would prevent us from printing this field appropriately. */
8480 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8481 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8482 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8484 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8487 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8489 /* We need to be careful of typedefs when computing
8490 the length of our field. If this is a typedef,
8491 get the length of the target type, not the length
8493 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8494 field_type
= ada_typedef_target_type (field_type
);
8497 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8500 if (off
+ fld_bit_len
> bit_len
)
8501 bit_len
= off
+ fld_bit_len
;
8503 TYPE_LENGTH (rtype
) =
8504 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8507 /* We handle the variant part, if any, at the end because of certain
8508 odd cases in which it is re-ordered so as NOT to be the last field of
8509 the record. This can happen in the presence of representation
8511 if (variant_field
>= 0)
8513 struct type
*branch_type
;
8515 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8519 /* Using plain value_from_contents_and_address here causes
8520 problems because we will end up trying to resolve a type
8521 that is currently being constructed. */
8522 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8524 rtype
= value_type (dval
);
8530 to_fixed_variant_branch_type
8531 (TYPE_FIELD_TYPE (type
, variant_field
),
8532 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8533 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8534 if (branch_type
== NULL
)
8536 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8537 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8538 TYPE_NFIELDS (rtype
) -= 1;
8542 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8543 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8545 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8547 if (off
+ fld_bit_len
> bit_len
)
8548 bit_len
= off
+ fld_bit_len
;
8549 TYPE_LENGTH (rtype
) =
8550 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8554 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8555 should contain the alignment of that record, which should be a strictly
8556 positive value. If null or negative, then something is wrong, most
8557 probably in the debug info. In that case, we don't round up the size
8558 of the resulting type. If this record is not part of another structure,
8559 the current RTYPE length might be good enough for our purposes. */
8560 if (TYPE_LENGTH (type
) <= 0)
8562 if (TYPE_NAME (rtype
))
8563 warning (_("Invalid type size for `%s' detected: %d."),
8564 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8566 warning (_("Invalid type size for <unnamed> detected: %d."),
8567 TYPE_LENGTH (type
));
8571 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8572 TYPE_LENGTH (type
));
8575 value_free_to_mark (mark
);
8576 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8577 error (_("record type with dynamic size is larger than varsize-limit"));
8581 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8584 static struct type
*
8585 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8586 CORE_ADDR address
, struct value
*dval0
)
8588 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8592 /* An ordinary record type in which ___XVL-convention fields and
8593 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8594 static approximations, containing all possible fields. Uses
8595 no runtime values. Useless for use in values, but that's OK,
8596 since the results are used only for type determinations. Works on both
8597 structs and unions. Representation note: to save space, we memorize
8598 the result of this function in the TYPE_TARGET_TYPE of the
8601 static struct type
*
8602 template_to_static_fixed_type (struct type
*type0
)
8608 /* No need no do anything if the input type is already fixed. */
8609 if (TYPE_FIXED_INSTANCE (type0
))
8612 /* Likewise if we already have computed the static approximation. */
8613 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8614 return TYPE_TARGET_TYPE (type0
);
8616 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8618 nfields
= TYPE_NFIELDS (type0
);
8620 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8621 recompute all over next time. */
8622 TYPE_TARGET_TYPE (type0
) = type
;
8624 for (f
= 0; f
< nfields
; f
+= 1)
8626 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8627 struct type
*new_type
;
8629 if (is_dynamic_field (type0
, f
))
8631 field_type
= ada_check_typedef (field_type
);
8632 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8635 new_type
= static_unwrap_type (field_type
);
8637 if (new_type
!= field_type
)
8639 /* Clone TYPE0 only the first time we get a new field type. */
8642 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8643 TYPE_CODE (type
) = TYPE_CODE (type0
);
8644 INIT_CPLUS_SPECIFIC (type
);
8645 TYPE_NFIELDS (type
) = nfields
;
8646 TYPE_FIELDS (type
) = (struct field
*)
8647 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8648 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8649 sizeof (struct field
) * nfields
);
8650 TYPE_NAME (type
) = ada_type_name (type0
);
8651 TYPE_TAG_NAME (type
) = NULL
;
8652 TYPE_FIXED_INSTANCE (type
) = 1;
8653 TYPE_LENGTH (type
) = 0;
8655 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8656 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8663 /* Given an object of type TYPE whose contents are at VALADDR and
8664 whose address in memory is ADDRESS, returns a revision of TYPE,
8665 which should be a non-dynamic-sized record, in which the variant
8666 part, if any, is replaced with the appropriate branch. Looks
8667 for discriminant values in DVAL0, which can be NULL if the record
8668 contains the necessary discriminant values. */
8670 static struct type
*
8671 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8672 CORE_ADDR address
, struct value
*dval0
)
8674 struct value
*mark
= value_mark ();
8677 struct type
*branch_type
;
8678 int nfields
= TYPE_NFIELDS (type
);
8679 int variant_field
= variant_field_index (type
);
8681 if (variant_field
== -1)
8686 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8687 type
= value_type (dval
);
8692 rtype
= alloc_type_copy (type
);
8693 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8694 INIT_CPLUS_SPECIFIC (rtype
);
8695 TYPE_NFIELDS (rtype
) = nfields
;
8696 TYPE_FIELDS (rtype
) =
8697 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8698 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8699 sizeof (struct field
) * nfields
);
8700 TYPE_NAME (rtype
) = ada_type_name (type
);
8701 TYPE_TAG_NAME (rtype
) = NULL
;
8702 TYPE_FIXED_INSTANCE (rtype
) = 1;
8703 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8705 branch_type
= to_fixed_variant_branch_type
8706 (TYPE_FIELD_TYPE (type
, variant_field
),
8707 cond_offset_host (valaddr
,
8708 TYPE_FIELD_BITPOS (type
, variant_field
)
8710 cond_offset_target (address
,
8711 TYPE_FIELD_BITPOS (type
, variant_field
)
8712 / TARGET_CHAR_BIT
), dval
);
8713 if (branch_type
== NULL
)
8717 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8718 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8719 TYPE_NFIELDS (rtype
) -= 1;
8723 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8724 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8725 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8726 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8728 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8730 value_free_to_mark (mark
);
8734 /* An ordinary record type (with fixed-length fields) that describes
8735 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8736 beginning of this section]. Any necessary discriminants' values
8737 should be in DVAL, a record value; it may be NULL if the object
8738 at ADDR itself contains any necessary discriminant values.
8739 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8740 values from the record are needed. Except in the case that DVAL,
8741 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8742 unchecked) is replaced by a particular branch of the variant.
8744 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8745 is questionable and may be removed. It can arise during the
8746 processing of an unconstrained-array-of-record type where all the
8747 variant branches have exactly the same size. This is because in
8748 such cases, the compiler does not bother to use the XVS convention
8749 when encoding the record. I am currently dubious of this
8750 shortcut and suspect the compiler should be altered. FIXME. */
8752 static struct type
*
8753 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8754 CORE_ADDR address
, struct value
*dval
)
8756 struct type
*templ_type
;
8758 if (TYPE_FIXED_INSTANCE (type0
))
8761 templ_type
= dynamic_template_type (type0
);
8763 if (templ_type
!= NULL
)
8764 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8765 else if (variant_field_index (type0
) >= 0)
8767 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8769 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8774 TYPE_FIXED_INSTANCE (type0
) = 1;
8780 /* An ordinary record type (with fixed-length fields) that describes
8781 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8782 union type. Any necessary discriminants' values should be in DVAL,
8783 a record value. That is, this routine selects the appropriate
8784 branch of the union at ADDR according to the discriminant value
8785 indicated in the union's type name. Returns VAR_TYPE0 itself if
8786 it represents a variant subject to a pragma Unchecked_Union. */
8788 static struct type
*
8789 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8790 CORE_ADDR address
, struct value
*dval
)
8793 struct type
*templ_type
;
8794 struct type
*var_type
;
8796 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8797 var_type
= TYPE_TARGET_TYPE (var_type0
);
8799 var_type
= var_type0
;
8801 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8803 if (templ_type
!= NULL
)
8804 var_type
= templ_type
;
8806 if (is_unchecked_variant (var_type
, value_type (dval
)))
8809 ada_which_variant_applies (var_type
,
8810 value_type (dval
), value_contents (dval
));
8813 return empty_record (var_type
);
8814 else if (is_dynamic_field (var_type
, which
))
8815 return to_fixed_record_type
8816 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8817 valaddr
, address
, dval
);
8818 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8820 to_fixed_record_type
8821 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8823 return TYPE_FIELD_TYPE (var_type
, which
);
8826 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8827 ENCODING_TYPE, a type following the GNAT conventions for discrete
8828 type encodings, only carries redundant information. */
8831 ada_is_redundant_range_encoding (struct type
*range_type
,
8832 struct type
*encoding_type
)
8834 const char *bounds_str
;
8838 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8840 if (TYPE_CODE (get_base_type (range_type
))
8841 != TYPE_CODE (get_base_type (encoding_type
)))
8843 /* The compiler probably used a simple base type to describe
8844 the range type instead of the range's actual base type,
8845 expecting us to get the real base type from the encoding
8846 anyway. In this situation, the encoding cannot be ignored
8851 if (is_dynamic_type (range_type
))
8854 if (TYPE_NAME (encoding_type
) == NULL
)
8857 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8858 if (bounds_str
== NULL
)
8861 n
= 8; /* Skip "___XDLU_". */
8862 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8864 if (TYPE_LOW_BOUND (range_type
) != lo
)
8867 n
+= 2; /* Skip the "__" separator between the two bounds. */
8868 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8870 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8876 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8877 a type following the GNAT encoding for describing array type
8878 indices, only carries redundant information. */
8881 ada_is_redundant_index_type_desc (struct type
*array_type
,
8882 struct type
*desc_type
)
8884 struct type
*this_layer
= check_typedef (array_type
);
8887 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8889 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8890 TYPE_FIELD_TYPE (desc_type
, i
)))
8892 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8898 /* Assuming that TYPE0 is an array type describing the type of a value
8899 at ADDR, and that DVAL describes a record containing any
8900 discriminants used in TYPE0, returns a type for the value that
8901 contains no dynamic components (that is, no components whose sizes
8902 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8903 true, gives an error message if the resulting type's size is over
8906 static struct type
*
8907 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8910 struct type
*index_type_desc
;
8911 struct type
*result
;
8912 int constrained_packed_array_p
;
8913 static const char *xa_suffix
= "___XA";
8915 type0
= ada_check_typedef (type0
);
8916 if (TYPE_FIXED_INSTANCE (type0
))
8919 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8920 if (constrained_packed_array_p
)
8921 type0
= decode_constrained_packed_array_type (type0
);
8923 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8925 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8926 encoding suffixed with 'P' may still be generated. If so,
8927 it should be used to find the XA type. */
8929 if (index_type_desc
== NULL
)
8931 const char *type_name
= ada_type_name (type0
);
8933 if (type_name
!= NULL
)
8935 const int len
= strlen (type_name
);
8936 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8938 if (type_name
[len
- 1] == 'P')
8940 strcpy (name
, type_name
);
8941 strcpy (name
+ len
- 1, xa_suffix
);
8942 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8947 ada_fixup_array_indexes_type (index_type_desc
);
8948 if (index_type_desc
!= NULL
8949 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8951 /* Ignore this ___XA parallel type, as it does not bring any
8952 useful information. This allows us to avoid creating fixed
8953 versions of the array's index types, which would be identical
8954 to the original ones. This, in turn, can also help avoid
8955 the creation of fixed versions of the array itself. */
8956 index_type_desc
= NULL
;
8959 if (index_type_desc
== NULL
)
8961 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8963 /* NOTE: elt_type---the fixed version of elt_type0---should never
8964 depend on the contents of the array in properly constructed
8966 /* Create a fixed version of the array element type.
8967 We're not providing the address of an element here,
8968 and thus the actual object value cannot be inspected to do
8969 the conversion. This should not be a problem, since arrays of
8970 unconstrained objects are not allowed. In particular, all
8971 the elements of an array of a tagged type should all be of
8972 the same type specified in the debugging info. No need to
8973 consult the object tag. */
8974 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8976 /* Make sure we always create a new array type when dealing with
8977 packed array types, since we're going to fix-up the array
8978 type length and element bitsize a little further down. */
8979 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8982 result
= create_array_type (alloc_type_copy (type0
),
8983 elt_type
, TYPE_INDEX_TYPE (type0
));
8988 struct type
*elt_type0
;
8991 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8992 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8994 /* NOTE: result---the fixed version of elt_type0---should never
8995 depend on the contents of the array in properly constructed
8997 /* Create a fixed version of the array element type.
8998 We're not providing the address of an element here,
8999 and thus the actual object value cannot be inspected to do
9000 the conversion. This should not be a problem, since arrays of
9001 unconstrained objects are not allowed. In particular, all
9002 the elements of an array of a tagged type should all be of
9003 the same type specified in the debugging info. No need to
9004 consult the object tag. */
9006 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
9009 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
9011 struct type
*range_type
=
9012 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
9014 result
= create_array_type (alloc_type_copy (elt_type0
),
9015 result
, range_type
);
9016 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
9018 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
9019 error (_("array type with dynamic size is larger than varsize-limit"));
9022 /* We want to preserve the type name. This can be useful when
9023 trying to get the type name of a value that has already been
9024 printed (for instance, if the user did "print VAR; whatis $". */
9025 TYPE_NAME (result
) = TYPE_NAME (type0
);
9027 if (constrained_packed_array_p
)
9029 /* So far, the resulting type has been created as if the original
9030 type was a regular (non-packed) array type. As a result, the
9031 bitsize of the array elements needs to be set again, and the array
9032 length needs to be recomputed based on that bitsize. */
9033 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
9034 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
9036 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
9037 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
9038 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
9039 TYPE_LENGTH (result
)++;
9042 TYPE_FIXED_INSTANCE (result
) = 1;
9047 /* A standard type (containing no dynamically sized components)
9048 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
9049 DVAL describes a record containing any discriminants used in TYPE0,
9050 and may be NULL if there are none, or if the object of type TYPE at
9051 ADDRESS or in VALADDR contains these discriminants.
9053 If CHECK_TAG is not null, in the case of tagged types, this function
9054 attempts to locate the object's tag and use it to compute the actual
9055 type. However, when ADDRESS is null, we cannot use it to determine the
9056 location of the tag, and therefore compute the tagged type's actual type.
9057 So we return the tagged type without consulting the tag. */
9059 static struct type
*
9060 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
9061 CORE_ADDR address
, struct value
*dval
, int check_tag
)
9063 type
= ada_check_typedef (type
);
9064 switch (TYPE_CODE (type
))
9068 case TYPE_CODE_STRUCT
:
9070 struct type
*static_type
= to_static_fixed_type (type
);
9071 struct type
*fixed_record_type
=
9072 to_fixed_record_type (type
, valaddr
, address
, NULL
);
9074 /* If STATIC_TYPE is a tagged type and we know the object's address,
9075 then we can determine its tag, and compute the object's actual
9076 type from there. Note that we have to use the fixed record
9077 type (the parent part of the record may have dynamic fields
9078 and the way the location of _tag is expressed may depend on
9081 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
9084 value_tag_from_contents_and_address
9088 struct type
*real_type
= type_from_tag (tag
);
9090 value_from_contents_and_address (fixed_record_type
,
9093 fixed_record_type
= value_type (obj
);
9094 if (real_type
!= NULL
)
9095 return to_fixed_record_type
9097 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
9100 /* Check to see if there is a parallel ___XVZ variable.
9101 If there is, then it provides the actual size of our type. */
9102 else if (ada_type_name (fixed_record_type
) != NULL
)
9104 const char *name
= ada_type_name (fixed_record_type
);
9106 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
9107 bool xvz_found
= false;
9110 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
9113 xvz_found
= get_int_var_value (xvz_name
, size
);
9115 CATCH (except
, RETURN_MASK_ERROR
)
9117 /* We found the variable, but somehow failed to read
9118 its value. Rethrow the same error, but with a little
9119 bit more information, to help the user understand
9120 what went wrong (Eg: the variable might have been
9122 throw_error (except
.error
,
9123 _("unable to read value of %s (%s)"),
9124 xvz_name
, except
.message
);
9128 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
9130 fixed_record_type
= copy_type (fixed_record_type
);
9131 TYPE_LENGTH (fixed_record_type
) = size
;
9133 /* The FIXED_RECORD_TYPE may have be a stub. We have
9134 observed this when the debugging info is STABS, and
9135 apparently it is something that is hard to fix.
9137 In practice, we don't need the actual type definition
9138 at all, because the presence of the XVZ variable allows us
9139 to assume that there must be a XVS type as well, which we
9140 should be able to use later, when we need the actual type
9143 In the meantime, pretend that the "fixed" type we are
9144 returning is NOT a stub, because this can cause trouble
9145 when using this type to create new types targeting it.
9146 Indeed, the associated creation routines often check
9147 whether the target type is a stub and will try to replace
9148 it, thus using a type with the wrong size. This, in turn,
9149 might cause the new type to have the wrong size too.
9150 Consider the case of an array, for instance, where the size
9151 of the array is computed from the number of elements in
9152 our array multiplied by the size of its element. */
9153 TYPE_STUB (fixed_record_type
) = 0;
9156 return fixed_record_type
;
9158 case TYPE_CODE_ARRAY
:
9159 return to_fixed_array_type (type
, dval
, 1);
9160 case TYPE_CODE_UNION
:
9164 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
9168 /* The same as ada_to_fixed_type_1, except that it preserves the type
9169 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
9171 The typedef layer needs be preserved in order to differentiate between
9172 arrays and array pointers when both types are implemented using the same
9173 fat pointer. In the array pointer case, the pointer is encoded as
9174 a typedef of the pointer type. For instance, considering:
9176 type String_Access is access String;
9177 S1 : String_Access := null;
9179 To the debugger, S1 is defined as a typedef of type String. But
9180 to the user, it is a pointer. So if the user tries to print S1,
9181 we should not dereference the array, but print the array address
9184 If we didn't preserve the typedef layer, we would lose the fact that
9185 the type is to be presented as a pointer (needs de-reference before
9186 being printed). And we would also use the source-level type name. */
9189 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
9190 CORE_ADDR address
, struct value
*dval
, int check_tag
)
9193 struct type
*fixed_type
=
9194 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
9196 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
9197 then preserve the typedef layer.
9199 Implementation note: We can only check the main-type portion of
9200 the TYPE and FIXED_TYPE, because eliminating the typedef layer
9201 from TYPE now returns a type that has the same instance flags
9202 as TYPE. For instance, if TYPE is a "typedef const", and its
9203 target type is a "struct", then the typedef elimination will return
9204 a "const" version of the target type. See check_typedef for more
9205 details about how the typedef layer elimination is done.
9207 brobecker/2010-11-19: It seems to me that the only case where it is
9208 useful to preserve the typedef layer is when dealing with fat pointers.
9209 Perhaps, we could add a check for that and preserve the typedef layer
9210 only in that situation. But this seems unecessary so far, probably
9211 because we call check_typedef/ada_check_typedef pretty much everywhere.
9213 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
9214 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
9215 == TYPE_MAIN_TYPE (fixed_type
)))
9221 /* A standard (static-sized) type corresponding as well as possible to
9222 TYPE0, but based on no runtime data. */
9224 static struct type
*
9225 to_static_fixed_type (struct type
*type0
)
9232 if (TYPE_FIXED_INSTANCE (type0
))
9235 type0
= ada_check_typedef (type0
);
9237 switch (TYPE_CODE (type0
))
9241 case TYPE_CODE_STRUCT
:
9242 type
= dynamic_template_type (type0
);
9244 return template_to_static_fixed_type (type
);
9246 return template_to_static_fixed_type (type0
);
9247 case TYPE_CODE_UNION
:
9248 type
= ada_find_parallel_type (type0
, "___XVU");
9250 return template_to_static_fixed_type (type
);
9252 return template_to_static_fixed_type (type0
);
9256 /* A static approximation of TYPE with all type wrappers removed. */
9258 static struct type
*
9259 static_unwrap_type (struct type
*type
)
9261 if (ada_is_aligner_type (type
))
9263 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
9264 if (ada_type_name (type1
) == NULL
)
9265 TYPE_NAME (type1
) = ada_type_name (type
);
9267 return static_unwrap_type (type1
);
9271 struct type
*raw_real_type
= ada_get_base_type (type
);
9273 if (raw_real_type
== type
)
9276 return to_static_fixed_type (raw_real_type
);
9280 /* In some cases, incomplete and private types require
9281 cross-references that are not resolved as records (for example,
9283 type FooP is access Foo;
9285 type Foo is array ...;
9286 ). In these cases, since there is no mechanism for producing
9287 cross-references to such types, we instead substitute for FooP a
9288 stub enumeration type that is nowhere resolved, and whose tag is
9289 the name of the actual type. Call these types "non-record stubs". */
9291 /* A type equivalent to TYPE that is not a non-record stub, if one
9292 exists, otherwise TYPE. */
9295 ada_check_typedef (struct type
*type
)
9300 /* If our type is a typedef type of a fat pointer, then we're done.
9301 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9302 what allows us to distinguish between fat pointers that represent
9303 array types, and fat pointers that represent array access types
9304 (in both cases, the compiler implements them as fat pointers). */
9305 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
9306 && is_thick_pntr (ada_typedef_target_type (type
)))
9309 type
= check_typedef (type
);
9310 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
9311 || !TYPE_STUB (type
)
9312 || TYPE_TAG_NAME (type
) == NULL
)
9316 const char *name
= TYPE_TAG_NAME (type
);
9317 struct type
*type1
= ada_find_any_type (name
);
9322 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9323 stubs pointing to arrays, as we don't create symbols for array
9324 types, only for the typedef-to-array types). If that's the case,
9325 strip the typedef layer. */
9326 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
9327 type1
= ada_check_typedef (type1
);
9333 /* A value representing the data at VALADDR/ADDRESS as described by
9334 type TYPE0, but with a standard (static-sized) type that correctly
9335 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9336 type, then return VAL0 [this feature is simply to avoid redundant
9337 creation of struct values]. */
9339 static struct value
*
9340 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
9343 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
9345 if (type
== type0
&& val0
!= NULL
)
9348 return value_from_contents_and_address (type
, 0, address
);
9351 /* A value representing VAL, but with a standard (static-sized) type
9352 that correctly describes it. Does not necessarily create a new
9356 ada_to_fixed_value (struct value
*val
)
9358 val
= unwrap_value (val
);
9359 val
= ada_to_fixed_value_create (value_type (val
),
9360 value_address (val
),
9368 /* Table mapping attribute numbers to names.
9369 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9371 static const char *attribute_names
[] = {
9389 ada_attribute_name (enum exp_opcode n
)
9391 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9392 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9394 return attribute_names
[0];
9397 /* Evaluate the 'POS attribute applied to ARG. */
9400 pos_atr (struct value
*arg
)
9402 struct value
*val
= coerce_ref (arg
);
9403 struct type
*type
= value_type (val
);
9406 if (!discrete_type_p (type
))
9407 error (_("'POS only defined on discrete types"));
9409 if (!discrete_position (type
, value_as_long (val
), &result
))
9410 error (_("enumeration value is invalid: can't find 'POS"));
9415 static struct value
*
9416 value_pos_atr (struct type
*type
, struct value
*arg
)
9418 return value_from_longest (type
, pos_atr (arg
));
9421 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9423 static struct value
*
9424 value_val_atr (struct type
*type
, struct value
*arg
)
9426 if (!discrete_type_p (type
))
9427 error (_("'VAL only defined on discrete types"));
9428 if (!integer_type_p (value_type (arg
)))
9429 error (_("'VAL requires integral argument"));
9431 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
9433 long pos
= value_as_long (arg
);
9435 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
9436 error (_("argument to 'VAL out of range"));
9437 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
9440 return value_from_longest (type
, value_as_long (arg
));
9446 /* True if TYPE appears to be an Ada character type.
9447 [At the moment, this is true only for Character and Wide_Character;
9448 It is a heuristic test that could stand improvement]. */
9451 ada_is_character_type (struct type
*type
)
9455 /* If the type code says it's a character, then assume it really is,
9456 and don't check any further. */
9457 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
9460 /* Otherwise, assume it's a character type iff it is a discrete type
9461 with a known character type name. */
9462 name
= ada_type_name (type
);
9463 return (name
!= NULL
9464 && (TYPE_CODE (type
) == TYPE_CODE_INT
9465 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9466 && (strcmp (name
, "character") == 0
9467 || strcmp (name
, "wide_character") == 0
9468 || strcmp (name
, "wide_wide_character") == 0
9469 || strcmp (name
, "unsigned char") == 0));
9472 /* True if TYPE appears to be an Ada string type. */
9475 ada_is_string_type (struct type
*type
)
9477 type
= ada_check_typedef (type
);
9479 && TYPE_CODE (type
) != TYPE_CODE_PTR
9480 && (ada_is_simple_array_type (type
)
9481 || ada_is_array_descriptor_type (type
))
9482 && ada_array_arity (type
) == 1)
9484 struct type
*elttype
= ada_array_element_type (type
, 1);
9486 return ada_is_character_type (elttype
);
9492 /* The compiler sometimes provides a parallel XVS type for a given
9493 PAD type. Normally, it is safe to follow the PAD type directly,
9494 but older versions of the compiler have a bug that causes the offset
9495 of its "F" field to be wrong. Following that field in that case
9496 would lead to incorrect results, but this can be worked around
9497 by ignoring the PAD type and using the associated XVS type instead.
9499 Set to True if the debugger should trust the contents of PAD types.
9500 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9501 static int trust_pad_over_xvs
= 1;
9503 /* True if TYPE is a struct type introduced by the compiler to force the
9504 alignment of a value. Such types have a single field with a
9505 distinctive name. */
9508 ada_is_aligner_type (struct type
*type
)
9510 type
= ada_check_typedef (type
);
9512 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9515 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9516 && TYPE_NFIELDS (type
) == 1
9517 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9520 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9521 the parallel type. */
9524 ada_get_base_type (struct type
*raw_type
)
9526 struct type
*real_type_namer
;
9527 struct type
*raw_real_type
;
9529 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9532 if (ada_is_aligner_type (raw_type
))
9533 /* The encoding specifies that we should always use the aligner type.
9534 So, even if this aligner type has an associated XVS type, we should
9537 According to the compiler gurus, an XVS type parallel to an aligner
9538 type may exist because of a stabs limitation. In stabs, aligner
9539 types are empty because the field has a variable-sized type, and
9540 thus cannot actually be used as an aligner type. As a result,
9541 we need the associated parallel XVS type to decode the type.
9542 Since the policy in the compiler is to not change the internal
9543 representation based on the debugging info format, we sometimes
9544 end up having a redundant XVS type parallel to the aligner type. */
9547 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9548 if (real_type_namer
== NULL
9549 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9550 || TYPE_NFIELDS (real_type_namer
) != 1)
9553 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9555 /* This is an older encoding form where the base type needs to be
9556 looked up by name. We prefer the newer enconding because it is
9558 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9559 if (raw_real_type
== NULL
)
9562 return raw_real_type
;
9565 /* The field in our XVS type is a reference to the base type. */
9566 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9569 /* The type of value designated by TYPE, with all aligners removed. */
9572 ada_aligned_type (struct type
*type
)
9574 if (ada_is_aligner_type (type
))
9575 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9577 return ada_get_base_type (type
);
9581 /* The address of the aligned value in an object at address VALADDR
9582 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9585 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9587 if (ada_is_aligner_type (type
))
9588 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9590 TYPE_FIELD_BITPOS (type
,
9591 0) / TARGET_CHAR_BIT
);
9598 /* The printed representation of an enumeration literal with encoded
9599 name NAME. The value is good to the next call of ada_enum_name. */
9601 ada_enum_name (const char *name
)
9603 static char *result
;
9604 static size_t result_len
= 0;
9607 /* First, unqualify the enumeration name:
9608 1. Search for the last '.' character. If we find one, then skip
9609 all the preceding characters, the unqualified name starts
9610 right after that dot.
9611 2. Otherwise, we may be debugging on a target where the compiler
9612 translates dots into "__". Search forward for double underscores,
9613 but stop searching when we hit an overloading suffix, which is
9614 of the form "__" followed by digits. */
9616 tmp
= strrchr (name
, '.');
9621 while ((tmp
= strstr (name
, "__")) != NULL
)
9623 if (isdigit (tmp
[2]))
9634 if (name
[1] == 'U' || name
[1] == 'W')
9636 if (sscanf (name
+ 2, "%x", &v
) != 1)
9642 GROW_VECT (result
, result_len
, 16);
9643 if (isascii (v
) && isprint (v
))
9644 xsnprintf (result
, result_len
, "'%c'", v
);
9645 else if (name
[1] == 'U')
9646 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9648 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9654 tmp
= strstr (name
, "__");
9656 tmp
= strstr (name
, "$");
9659 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9660 strncpy (result
, name
, tmp
- name
);
9661 result
[tmp
- name
] = '\0';
9669 /* Evaluate the subexpression of EXP starting at *POS as for
9670 evaluate_type, updating *POS to point just past the evaluated
9673 static struct value
*
9674 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9676 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9679 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9682 static struct value
*
9683 unwrap_value (struct value
*val
)
9685 struct type
*type
= ada_check_typedef (value_type (val
));
9687 if (ada_is_aligner_type (type
))
9689 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9690 struct type
*val_type
= ada_check_typedef (value_type (v
));
9692 if (ada_type_name (val_type
) == NULL
)
9693 TYPE_NAME (val_type
) = ada_type_name (type
);
9695 return unwrap_value (v
);
9699 struct type
*raw_real_type
=
9700 ada_check_typedef (ada_get_base_type (type
));
9702 /* If there is no parallel XVS or XVE type, then the value is
9703 already unwrapped. Return it without further modification. */
9704 if ((type
== raw_real_type
)
9705 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9709 coerce_unspec_val_to_type
9710 (val
, ada_to_fixed_type (raw_real_type
, 0,
9711 value_address (val
),
9716 static struct value
*
9717 cast_from_fixed (struct type
*type
, struct value
*arg
)
9719 struct value
*scale
= ada_scaling_factor (value_type (arg
));
9720 arg
= value_cast (value_type (scale
), arg
);
9722 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9723 return value_cast (type
, arg
);
9726 static struct value
*
9727 cast_to_fixed (struct type
*type
, struct value
*arg
)
9729 if (type
== value_type (arg
))
9732 struct value
*scale
= ada_scaling_factor (type
);
9733 if (ada_is_fixed_point_type (value_type (arg
)))
9734 arg
= cast_from_fixed (value_type (scale
), arg
);
9736 arg
= value_cast (value_type (scale
), arg
);
9738 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9739 return value_cast (type
, arg
);
9742 /* Given two array types T1 and T2, return nonzero iff both arrays
9743 contain the same number of elements. */
9746 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9748 LONGEST lo1
, hi1
, lo2
, hi2
;
9750 /* Get the array bounds in order to verify that the size of
9751 the two arrays match. */
9752 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9753 || !get_array_bounds (t2
, &lo2
, &hi2
))
9754 error (_("unable to determine array bounds"));
9756 /* To make things easier for size comparison, normalize a bit
9757 the case of empty arrays by making sure that the difference
9758 between upper bound and lower bound is always -1. */
9764 return (hi1
- lo1
== hi2
- lo2
);
9767 /* Assuming that VAL is an array of integrals, and TYPE represents
9768 an array with the same number of elements, but with wider integral
9769 elements, return an array "casted" to TYPE. In practice, this
9770 means that the returned array is built by casting each element
9771 of the original array into TYPE's (wider) element type. */
9773 static struct value
*
9774 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9776 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9781 /* Verify that both val and type are arrays of scalars, and
9782 that the size of val's elements is smaller than the size
9783 of type's element. */
9784 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9785 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9786 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9787 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9788 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9789 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9791 if (!get_array_bounds (type
, &lo
, &hi
))
9792 error (_("unable to determine array bounds"));
9794 res
= allocate_value (type
);
9796 /* Promote each array element. */
9797 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9799 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9801 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9802 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9808 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9809 return the converted value. */
9811 static struct value
*
9812 coerce_for_assign (struct type
*type
, struct value
*val
)
9814 struct type
*type2
= value_type (val
);
9819 type2
= ada_check_typedef (type2
);
9820 type
= ada_check_typedef (type
);
9822 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9823 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9825 val
= ada_value_ind (val
);
9826 type2
= value_type (val
);
9829 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9830 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9832 if (!ada_same_array_size_p (type
, type2
))
9833 error (_("cannot assign arrays of different length"));
9835 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9836 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9837 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9838 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9840 /* Allow implicit promotion of the array elements to
9842 return ada_promote_array_of_integrals (type
, val
);
9845 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9846 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9847 error (_("Incompatible types in assignment"));
9848 deprecated_set_value_type (val
, type
);
9853 static struct value
*
9854 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9857 struct type
*type1
, *type2
;
9860 arg1
= coerce_ref (arg1
);
9861 arg2
= coerce_ref (arg2
);
9862 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9863 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9865 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9866 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9867 return value_binop (arg1
, arg2
, op
);
9876 return value_binop (arg1
, arg2
, op
);
9879 v2
= value_as_long (arg2
);
9881 error (_("second operand of %s must not be zero."), op_string (op
));
9883 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9884 return value_binop (arg1
, arg2
, op
);
9886 v1
= value_as_long (arg1
);
9891 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9892 v
+= v
> 0 ? -1 : 1;
9900 /* Should not reach this point. */
9904 val
= allocate_value (type1
);
9905 store_unsigned_integer (value_contents_raw (val
),
9906 TYPE_LENGTH (value_type (val
)),
9907 gdbarch_byte_order (get_type_arch (type1
)), v
);
9912 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9914 if (ada_is_direct_array_type (value_type (arg1
))
9915 || ada_is_direct_array_type (value_type (arg2
)))
9917 struct type
*arg1_type
, *arg2_type
;
9919 /* Automatically dereference any array reference before
9920 we attempt to perform the comparison. */
9921 arg1
= ada_coerce_ref (arg1
);
9922 arg2
= ada_coerce_ref (arg2
);
9924 arg1
= ada_coerce_to_simple_array (arg1
);
9925 arg2
= ada_coerce_to_simple_array (arg2
);
9927 arg1_type
= ada_check_typedef (value_type (arg1
));
9928 arg2_type
= ada_check_typedef (value_type (arg2
));
9930 if (TYPE_CODE (arg1_type
) != TYPE_CODE_ARRAY
9931 || TYPE_CODE (arg2_type
) != TYPE_CODE_ARRAY
)
9932 error (_("Attempt to compare array with non-array"));
9933 /* FIXME: The following works only for types whose
9934 representations use all bits (no padding or undefined bits)
9935 and do not have user-defined equality. */
9936 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9937 && memcmp (value_contents (arg1
), value_contents (arg2
),
9938 TYPE_LENGTH (arg1_type
)) == 0);
9940 return value_equal (arg1
, arg2
);
9943 /* Total number of component associations in the aggregate starting at
9944 index PC in EXP. Assumes that index PC is the start of an
9948 num_component_specs (struct expression
*exp
, int pc
)
9952 m
= exp
->elts
[pc
+ 1].longconst
;
9955 for (i
= 0; i
< m
; i
+= 1)
9957 switch (exp
->elts
[pc
].opcode
)
9963 n
+= exp
->elts
[pc
+ 1].longconst
;
9966 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9971 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9972 component of LHS (a simple array or a record), updating *POS past
9973 the expression, assuming that LHS is contained in CONTAINER. Does
9974 not modify the inferior's memory, nor does it modify LHS (unless
9975 LHS == CONTAINER). */
9978 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9979 struct expression
*exp
, int *pos
)
9981 struct value
*mark
= value_mark ();
9983 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9985 if (TYPE_CODE (lhs_type
) == TYPE_CODE_ARRAY
)
9987 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9988 struct value
*index_val
= value_from_longest (index_type
, index
);
9990 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9994 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9995 elt
= ada_to_fixed_value (elt
);
9998 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9999 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
10001 value_assign_to_component (container
, elt
,
10002 ada_evaluate_subexp (NULL
, exp
, pos
,
10005 value_free_to_mark (mark
);
10008 /* Assuming that LHS represents an lvalue having a record or array
10009 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
10010 of that aggregate's value to LHS, advancing *POS past the
10011 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
10012 lvalue containing LHS (possibly LHS itself). Does not modify
10013 the inferior's memory, nor does it modify the contents of
10014 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
10016 static struct value
*
10017 assign_aggregate (struct value
*container
,
10018 struct value
*lhs
, struct expression
*exp
,
10019 int *pos
, enum noside noside
)
10021 struct type
*lhs_type
;
10022 int n
= exp
->elts
[*pos
+1].longconst
;
10023 LONGEST low_index
, high_index
;
10026 int max_indices
, num_indices
;
10030 if (noside
!= EVAL_NORMAL
)
10032 for (i
= 0; i
< n
; i
+= 1)
10033 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
10037 container
= ada_coerce_ref (container
);
10038 if (ada_is_direct_array_type (value_type (container
)))
10039 container
= ada_coerce_to_simple_array (container
);
10040 lhs
= ada_coerce_ref (lhs
);
10041 if (!deprecated_value_modifiable (lhs
))
10042 error (_("Left operand of assignment is not a modifiable lvalue."));
10044 lhs_type
= check_typedef (value_type (lhs
));
10045 if (ada_is_direct_array_type (lhs_type
))
10047 lhs
= ada_coerce_to_simple_array (lhs
);
10048 lhs_type
= check_typedef (value_type (lhs
));
10049 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
10050 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
10052 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
10055 high_index
= num_visible_fields (lhs_type
) - 1;
10058 error (_("Left-hand side must be array or record."));
10060 num_specs
= num_component_specs (exp
, *pos
- 3);
10061 max_indices
= 4 * num_specs
+ 4;
10062 indices
= XALLOCAVEC (LONGEST
, max_indices
);
10063 indices
[0] = indices
[1] = low_index
- 1;
10064 indices
[2] = indices
[3] = high_index
+ 1;
10067 for (i
= 0; i
< n
; i
+= 1)
10069 switch (exp
->elts
[*pos
].opcode
)
10072 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
10073 &num_indices
, max_indices
,
10074 low_index
, high_index
);
10076 case OP_POSITIONAL
:
10077 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
10078 &num_indices
, max_indices
,
10079 low_index
, high_index
);
10083 error (_("Misplaced 'others' clause"));
10084 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
10085 num_indices
, low_index
, high_index
);
10088 error (_("Internal error: bad aggregate clause"));
10095 /* Assign into the component of LHS indexed by the OP_POSITIONAL
10096 construct at *POS, updating *POS past the construct, given that
10097 the positions are relative to lower bound LOW, where HIGH is the
10098 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
10099 updating *NUM_INDICES as needed. CONTAINER is as for
10100 assign_aggregate. */
10102 aggregate_assign_positional (struct value
*container
,
10103 struct value
*lhs
, struct expression
*exp
,
10104 int *pos
, LONGEST
*indices
, int *num_indices
,
10105 int max_indices
, LONGEST low
, LONGEST high
)
10107 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
10109 if (ind
- 1 == high
)
10110 warning (_("Extra components in aggregate ignored."));
10113 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
10115 assign_component (container
, lhs
, ind
, exp
, pos
);
10118 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
10121 /* Assign into the components of LHS indexed by the OP_CHOICES
10122 construct at *POS, updating *POS past the construct, given that
10123 the allowable indices are LOW..HIGH. Record the indices assigned
10124 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
10125 needed. CONTAINER is as for assign_aggregate. */
10127 aggregate_assign_from_choices (struct value
*container
,
10128 struct value
*lhs
, struct expression
*exp
,
10129 int *pos
, LONGEST
*indices
, int *num_indices
,
10130 int max_indices
, LONGEST low
, LONGEST high
)
10133 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
10134 int choice_pos
, expr_pc
;
10135 int is_array
= ada_is_direct_array_type (value_type (lhs
));
10137 choice_pos
= *pos
+= 3;
10139 for (j
= 0; j
< n_choices
; j
+= 1)
10140 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
10142 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
10144 for (j
= 0; j
< n_choices
; j
+= 1)
10146 LONGEST lower
, upper
;
10147 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
10149 if (op
== OP_DISCRETE_RANGE
)
10152 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
10154 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
10159 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
10171 name
= &exp
->elts
[choice_pos
+ 2].string
;
10174 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
10177 error (_("Invalid record component association."));
10179 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
10181 if (! find_struct_field (name
, value_type (lhs
), 0,
10182 NULL
, NULL
, NULL
, NULL
, &ind
))
10183 error (_("Unknown component name: %s."), name
);
10184 lower
= upper
= ind
;
10187 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
10188 error (_("Index in component association out of bounds."));
10190 add_component_interval (lower
, upper
, indices
, num_indices
,
10192 while (lower
<= upper
)
10197 assign_component (container
, lhs
, lower
, exp
, &pos1
);
10203 /* Assign the value of the expression in the OP_OTHERS construct in
10204 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
10205 have not been previously assigned. The index intervals already assigned
10206 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
10207 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
10209 aggregate_assign_others (struct value
*container
,
10210 struct value
*lhs
, struct expression
*exp
,
10211 int *pos
, LONGEST
*indices
, int num_indices
,
10212 LONGEST low
, LONGEST high
)
10215 int expr_pc
= *pos
+ 1;
10217 for (i
= 0; i
< num_indices
- 2; i
+= 2)
10221 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
10225 localpos
= expr_pc
;
10226 assign_component (container
, lhs
, ind
, exp
, &localpos
);
10229 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
10232 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
10233 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
10234 modifying *SIZE as needed. It is an error if *SIZE exceeds
10235 MAX_SIZE. The resulting intervals do not overlap. */
10237 add_component_interval (LONGEST low
, LONGEST high
,
10238 LONGEST
* indices
, int *size
, int max_size
)
10242 for (i
= 0; i
< *size
; i
+= 2) {
10243 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
10247 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
10248 if (high
< indices
[kh
])
10250 if (low
< indices
[i
])
10252 indices
[i
+ 1] = indices
[kh
- 1];
10253 if (high
> indices
[i
+ 1])
10254 indices
[i
+ 1] = high
;
10255 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
10256 *size
-= kh
- i
- 2;
10259 else if (high
< indices
[i
])
10263 if (*size
== max_size
)
10264 error (_("Internal error: miscounted aggregate components."));
10266 for (j
= *size
-1; j
>= i
+2; j
-= 1)
10267 indices
[j
] = indices
[j
- 2];
10269 indices
[i
+ 1] = high
;
10272 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10275 static struct value
*
10276 ada_value_cast (struct type
*type
, struct value
*arg2
)
10278 if (type
== ada_check_typedef (value_type (arg2
)))
10281 if (ada_is_fixed_point_type (type
))
10282 return (cast_to_fixed (type
, arg2
));
10284 if (ada_is_fixed_point_type (value_type (arg2
)))
10285 return cast_from_fixed (type
, arg2
);
10287 return value_cast (type
, arg2
);
10290 /* Evaluating Ada expressions, and printing their result.
10291 ------------------------------------------------------
10296 We usually evaluate an Ada expression in order to print its value.
10297 We also evaluate an expression in order to print its type, which
10298 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10299 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10300 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10301 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10304 Evaluating expressions is a little more complicated for Ada entities
10305 than it is for entities in languages such as C. The main reason for
10306 this is that Ada provides types whose definition might be dynamic.
10307 One example of such types is variant records. Or another example
10308 would be an array whose bounds can only be known at run time.
10310 The following description is a general guide as to what should be
10311 done (and what should NOT be done) in order to evaluate an expression
10312 involving such types, and when. This does not cover how the semantic
10313 information is encoded by GNAT as this is covered separatly. For the
10314 document used as the reference for the GNAT encoding, see exp_dbug.ads
10315 in the GNAT sources.
10317 Ideally, we should embed each part of this description next to its
10318 associated code. Unfortunately, the amount of code is so vast right
10319 now that it's hard to see whether the code handling a particular
10320 situation might be duplicated or not. One day, when the code is
10321 cleaned up, this guide might become redundant with the comments
10322 inserted in the code, and we might want to remove it.
10324 2. ``Fixing'' an Entity, the Simple Case:
10325 -----------------------------------------
10327 When evaluating Ada expressions, the tricky issue is that they may
10328 reference entities whose type contents and size are not statically
10329 known. Consider for instance a variant record:
10331 type Rec (Empty : Boolean := True) is record
10334 when False => Value : Integer;
10337 Yes : Rec := (Empty => False, Value => 1);
10338 No : Rec := (empty => True);
10340 The size and contents of that record depends on the value of the
10341 descriminant (Rec.Empty). At this point, neither the debugging
10342 information nor the associated type structure in GDB are able to
10343 express such dynamic types. So what the debugger does is to create
10344 "fixed" versions of the type that applies to the specific object.
10345 We also informally refer to this opperation as "fixing" an object,
10346 which means creating its associated fixed type.
10348 Example: when printing the value of variable "Yes" above, its fixed
10349 type would look like this:
10356 On the other hand, if we printed the value of "No", its fixed type
10363 Things become a little more complicated when trying to fix an entity
10364 with a dynamic type that directly contains another dynamic type,
10365 such as an array of variant records, for instance. There are
10366 two possible cases: Arrays, and records.
10368 3. ``Fixing'' Arrays:
10369 ---------------------
10371 The type structure in GDB describes an array in terms of its bounds,
10372 and the type of its elements. By design, all elements in the array
10373 have the same type and we cannot represent an array of variant elements
10374 using the current type structure in GDB. When fixing an array,
10375 we cannot fix the array element, as we would potentially need one
10376 fixed type per element of the array. As a result, the best we can do
10377 when fixing an array is to produce an array whose bounds and size
10378 are correct (allowing us to read it from memory), but without having
10379 touched its element type. Fixing each element will be done later,
10380 when (if) necessary.
10382 Arrays are a little simpler to handle than records, because the same
10383 amount of memory is allocated for each element of the array, even if
10384 the amount of space actually used by each element differs from element
10385 to element. Consider for instance the following array of type Rec:
10387 type Rec_Array is array (1 .. 2) of Rec;
10389 The actual amount of memory occupied by each element might be different
10390 from element to element, depending on the value of their discriminant.
10391 But the amount of space reserved for each element in the array remains
10392 fixed regardless. So we simply need to compute that size using
10393 the debugging information available, from which we can then determine
10394 the array size (we multiply the number of elements of the array by
10395 the size of each element).
10397 The simplest case is when we have an array of a constrained element
10398 type. For instance, consider the following type declarations:
10400 type Bounded_String (Max_Size : Integer) is
10402 Buffer : String (1 .. Max_Size);
10404 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10406 In this case, the compiler describes the array as an array of
10407 variable-size elements (identified by its XVS suffix) for which
10408 the size can be read in the parallel XVZ variable.
10410 In the case of an array of an unconstrained element type, the compiler
10411 wraps the array element inside a private PAD type. This type should not
10412 be shown to the user, and must be "unwrap"'ed before printing. Note
10413 that we also use the adjective "aligner" in our code to designate
10414 these wrapper types.
10416 In some cases, the size allocated for each element is statically
10417 known. In that case, the PAD type already has the correct size,
10418 and the array element should remain unfixed.
10420 But there are cases when this size is not statically known.
10421 For instance, assuming that "Five" is an integer variable:
10423 type Dynamic is array (1 .. Five) of Integer;
10424 type Wrapper (Has_Length : Boolean := False) is record
10427 when True => Length : Integer;
10428 when False => null;
10431 type Wrapper_Array is array (1 .. 2) of Wrapper;
10433 Hello : Wrapper_Array := (others => (Has_Length => True,
10434 Data => (others => 17),
10438 The debugging info would describe variable Hello as being an
10439 array of a PAD type. The size of that PAD type is not statically
10440 known, but can be determined using a parallel XVZ variable.
10441 In that case, a copy of the PAD type with the correct size should
10442 be used for the fixed array.
10444 3. ``Fixing'' record type objects:
10445 ----------------------------------
10447 Things are slightly different from arrays in the case of dynamic
10448 record types. In this case, in order to compute the associated
10449 fixed type, we need to determine the size and offset of each of
10450 its components. This, in turn, requires us to compute the fixed
10451 type of each of these components.
10453 Consider for instance the example:
10455 type Bounded_String (Max_Size : Natural) is record
10456 Str : String (1 .. Max_Size);
10459 My_String : Bounded_String (Max_Size => 10);
10461 In that case, the position of field "Length" depends on the size
10462 of field Str, which itself depends on the value of the Max_Size
10463 discriminant. In order to fix the type of variable My_String,
10464 we need to fix the type of field Str. Therefore, fixing a variant
10465 record requires us to fix each of its components.
10467 However, if a component does not have a dynamic size, the component
10468 should not be fixed. In particular, fields that use a PAD type
10469 should not fixed. Here is an example where this might happen
10470 (assuming type Rec above):
10472 type Container (Big : Boolean) is record
10476 when True => Another : Integer;
10477 when False => null;
10480 My_Container : Container := (Big => False,
10481 First => (Empty => True),
10484 In that example, the compiler creates a PAD type for component First,
10485 whose size is constant, and then positions the component After just
10486 right after it. The offset of component After is therefore constant
10489 The debugger computes the position of each field based on an algorithm
10490 that uses, among other things, the actual position and size of the field
10491 preceding it. Let's now imagine that the user is trying to print
10492 the value of My_Container. If the type fixing was recursive, we would
10493 end up computing the offset of field After based on the size of the
10494 fixed version of field First. And since in our example First has
10495 only one actual field, the size of the fixed type is actually smaller
10496 than the amount of space allocated to that field, and thus we would
10497 compute the wrong offset of field After.
10499 To make things more complicated, we need to watch out for dynamic
10500 components of variant records (identified by the ___XVL suffix in
10501 the component name). Even if the target type is a PAD type, the size
10502 of that type might not be statically known. So the PAD type needs
10503 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10504 we might end up with the wrong size for our component. This can be
10505 observed with the following type declarations:
10507 type Octal is new Integer range 0 .. 7;
10508 type Octal_Array is array (Positive range <>) of Octal;
10509 pragma Pack (Octal_Array);
10511 type Octal_Buffer (Size : Positive) is record
10512 Buffer : Octal_Array (1 .. Size);
10516 In that case, Buffer is a PAD type whose size is unset and needs
10517 to be computed by fixing the unwrapped type.
10519 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10520 ----------------------------------------------------------
10522 Lastly, when should the sub-elements of an entity that remained unfixed
10523 thus far, be actually fixed?
10525 The answer is: Only when referencing that element. For instance
10526 when selecting one component of a record, this specific component
10527 should be fixed at that point in time. Or when printing the value
10528 of a record, each component should be fixed before its value gets
10529 printed. Similarly for arrays, the element of the array should be
10530 fixed when printing each element of the array, or when extracting
10531 one element out of that array. On the other hand, fixing should
10532 not be performed on the elements when taking a slice of an array!
10534 Note that one of the side effects of miscomputing the offset and
10535 size of each field is that we end up also miscomputing the size
10536 of the containing type. This can have adverse results when computing
10537 the value of an entity. GDB fetches the value of an entity based
10538 on the size of its type, and thus a wrong size causes GDB to fetch
10539 the wrong amount of memory. In the case where the computed size is
10540 too small, GDB fetches too little data to print the value of our
10541 entity. Results in this case are unpredictable, as we usually read
10542 past the buffer containing the data =:-o. */
10544 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10545 for that subexpression cast to TO_TYPE. Advance *POS over the
10549 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10550 enum noside noside
, struct type
*to_type
)
10554 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10555 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10560 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10562 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10563 return value_zero (to_type
, not_lval
);
10565 val
= evaluate_var_msym_value (noside
,
10566 exp
->elts
[pc
+ 1].objfile
,
10567 exp
->elts
[pc
+ 2].msymbol
);
10570 val
= evaluate_var_value (noside
,
10571 exp
->elts
[pc
+ 1].block
,
10572 exp
->elts
[pc
+ 2].symbol
);
10574 if (noside
== EVAL_SKIP
)
10575 return eval_skip_value (exp
);
10577 val
= ada_value_cast (to_type
, val
);
10579 /* Follow the Ada language semantics that do not allow taking
10580 an address of the result of a cast (view conversion in Ada). */
10581 if (VALUE_LVAL (val
) == lval_memory
)
10583 if (value_lazy (val
))
10584 value_fetch_lazy (val
);
10585 VALUE_LVAL (val
) = not_lval
;
10590 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10591 if (noside
== EVAL_SKIP
)
10592 return eval_skip_value (exp
);
10593 return ada_value_cast (to_type
, val
);
10596 /* Implement the evaluate_exp routine in the exp_descriptor structure
10597 for the Ada language. */
10599 static struct value
*
10600 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10601 int *pos
, enum noside noside
)
10603 enum exp_opcode op
;
10607 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10610 struct value
**argvec
;
10614 op
= exp
->elts
[pc
].opcode
;
10620 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10622 if (noside
== EVAL_NORMAL
)
10623 arg1
= unwrap_value (arg1
);
10625 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10626 then we need to perform the conversion manually, because
10627 evaluate_subexp_standard doesn't do it. This conversion is
10628 necessary in Ada because the different kinds of float/fixed
10629 types in Ada have different representations.
10631 Similarly, we need to perform the conversion from OP_LONG
10633 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10634 arg1
= ada_value_cast (expect_type
, arg1
);
10640 struct value
*result
;
10643 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10644 /* The result type will have code OP_STRING, bashed there from
10645 OP_ARRAY. Bash it back. */
10646 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10647 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10653 type
= exp
->elts
[pc
+ 1].type
;
10654 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10658 type
= exp
->elts
[pc
+ 1].type
;
10659 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10662 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10663 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10665 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10666 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10668 return ada_value_assign (arg1
, arg1
);
10670 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10671 except if the lhs of our assignment is a convenience variable.
10672 In the case of assigning to a convenience variable, the lhs
10673 should be exactly the result of the evaluation of the rhs. */
10674 type
= value_type (arg1
);
10675 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10677 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10678 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10680 if (ada_is_fixed_point_type (value_type (arg1
)))
10681 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10682 else if (ada_is_fixed_point_type (value_type (arg2
)))
10684 (_("Fixed-point values must be assigned to fixed-point variables"));
10686 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10687 return ada_value_assign (arg1
, arg2
);
10690 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10691 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10692 if (noside
== EVAL_SKIP
)
10694 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10695 return (value_from_longest
10696 (value_type (arg1
),
10697 value_as_long (arg1
) + value_as_long (arg2
)));
10698 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10699 return (value_from_longest
10700 (value_type (arg2
),
10701 value_as_long (arg1
) + value_as_long (arg2
)));
10702 if ((ada_is_fixed_point_type (value_type (arg1
))
10703 || ada_is_fixed_point_type (value_type (arg2
)))
10704 && value_type (arg1
) != value_type (arg2
))
10705 error (_("Operands of fixed-point addition must have the same type"));
10706 /* Do the addition, and cast the result to the type of the first
10707 argument. We cannot cast the result to a reference type, so if
10708 ARG1 is a reference type, find its underlying type. */
10709 type
= value_type (arg1
);
10710 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10711 type
= TYPE_TARGET_TYPE (type
);
10712 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10713 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10716 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10717 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10718 if (noside
== EVAL_SKIP
)
10720 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10721 return (value_from_longest
10722 (value_type (arg1
),
10723 value_as_long (arg1
) - value_as_long (arg2
)));
10724 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10725 return (value_from_longest
10726 (value_type (arg2
),
10727 value_as_long (arg1
) - value_as_long (arg2
)));
10728 if ((ada_is_fixed_point_type (value_type (arg1
))
10729 || ada_is_fixed_point_type (value_type (arg2
)))
10730 && value_type (arg1
) != value_type (arg2
))
10731 error (_("Operands of fixed-point subtraction "
10732 "must have the same type"));
10733 /* Do the substraction, and cast the result to the type of the first
10734 argument. We cannot cast the result to a reference type, so if
10735 ARG1 is a reference type, find its underlying type. */
10736 type
= value_type (arg1
);
10737 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10738 type
= TYPE_TARGET_TYPE (type
);
10739 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10740 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10746 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10747 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10748 if (noside
== EVAL_SKIP
)
10750 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10752 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10753 return value_zero (value_type (arg1
), not_lval
);
10757 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10758 if (ada_is_fixed_point_type (value_type (arg1
)))
10759 arg1
= cast_from_fixed (type
, arg1
);
10760 if (ada_is_fixed_point_type (value_type (arg2
)))
10761 arg2
= cast_from_fixed (type
, arg2
);
10762 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10763 return ada_value_binop (arg1
, arg2
, op
);
10767 case BINOP_NOTEQUAL
:
10768 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10769 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10770 if (noside
== EVAL_SKIP
)
10772 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10776 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10777 tem
= ada_value_equal (arg1
, arg2
);
10779 if (op
== BINOP_NOTEQUAL
)
10781 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10782 return value_from_longest (type
, (LONGEST
) tem
);
10785 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10786 if (noside
== EVAL_SKIP
)
10788 else if (ada_is_fixed_point_type (value_type (arg1
)))
10789 return value_cast (value_type (arg1
), value_neg (arg1
));
10792 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10793 return value_neg (arg1
);
10796 case BINOP_LOGICAL_AND
:
10797 case BINOP_LOGICAL_OR
:
10798 case UNOP_LOGICAL_NOT
:
10803 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10804 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10805 return value_cast (type
, val
);
10808 case BINOP_BITWISE_AND
:
10809 case BINOP_BITWISE_IOR
:
10810 case BINOP_BITWISE_XOR
:
10814 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10816 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10818 return value_cast (value_type (arg1
), val
);
10824 if (noside
== EVAL_SKIP
)
10830 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10831 /* Only encountered when an unresolved symbol occurs in a
10832 context other than a function call, in which case, it is
10834 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10835 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10837 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10839 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10840 /* Check to see if this is a tagged type. We also need to handle
10841 the case where the type is a reference to a tagged type, but
10842 we have to be careful to exclude pointers to tagged types.
10843 The latter should be shown as usual (as a pointer), whereas
10844 a reference should mostly be transparent to the user. */
10845 if (ada_is_tagged_type (type
, 0)
10846 || (TYPE_CODE (type
) == TYPE_CODE_REF
10847 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10849 /* Tagged types are a little special in the fact that the real
10850 type is dynamic and can only be determined by inspecting the
10851 object's tag. This means that we need to get the object's
10852 value first (EVAL_NORMAL) and then extract the actual object
10855 Note that we cannot skip the final step where we extract
10856 the object type from its tag, because the EVAL_NORMAL phase
10857 results in dynamic components being resolved into fixed ones.
10858 This can cause problems when trying to print the type
10859 description of tagged types whose parent has a dynamic size:
10860 We use the type name of the "_parent" component in order
10861 to print the name of the ancestor type in the type description.
10862 If that component had a dynamic size, the resolution into
10863 a fixed type would result in the loss of that type name,
10864 thus preventing us from printing the name of the ancestor
10865 type in the type description. */
10866 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10868 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10870 struct type
*actual_type
;
10872 actual_type
= type_from_tag (ada_value_tag (arg1
));
10873 if (actual_type
== NULL
)
10874 /* If, for some reason, we were unable to determine
10875 the actual type from the tag, then use the static
10876 approximation that we just computed as a fallback.
10877 This can happen if the debugging information is
10878 incomplete, for instance. */
10879 actual_type
= type
;
10880 return value_zero (actual_type
, not_lval
);
10884 /* In the case of a ref, ada_coerce_ref takes care
10885 of determining the actual type. But the evaluation
10886 should return a ref as it should be valid to ask
10887 for its address; so rebuild a ref after coerce. */
10888 arg1
= ada_coerce_ref (arg1
);
10889 return value_ref (arg1
, TYPE_CODE_REF
);
10893 /* Records and unions for which GNAT encodings have been
10894 generated need to be statically fixed as well.
10895 Otherwise, non-static fixing produces a type where
10896 all dynamic properties are removed, which prevents "ptype"
10897 from being able to completely describe the type.
10898 For instance, a case statement in a variant record would be
10899 replaced by the relevant components based on the actual
10900 value of the discriminants. */
10901 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10902 && dynamic_template_type (type
) != NULL
)
10903 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10904 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10907 return value_zero (to_static_fixed_type (type
), not_lval
);
10911 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10912 return ada_to_fixed_value (arg1
);
10917 /* Allocate arg vector, including space for the function to be
10918 called in argvec[0] and a terminating NULL. */
10919 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10920 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10922 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10923 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10924 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10925 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10928 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10929 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10932 if (noside
== EVAL_SKIP
)
10936 if (ada_is_constrained_packed_array_type
10937 (desc_base_type (value_type (argvec
[0]))))
10938 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10939 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10940 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10941 /* This is a packed array that has already been fixed, and
10942 therefore already coerced to a simple array. Nothing further
10945 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
)
10947 /* Make sure we dereference references so that all the code below
10948 feels like it's really handling the referenced value. Wrapping
10949 types (for alignment) may be there, so make sure we strip them as
10951 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10953 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10954 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10955 argvec
[0] = value_addr (argvec
[0]);
10957 type
= ada_check_typedef (value_type (argvec
[0]));
10959 /* Ada allows us to implicitly dereference arrays when subscripting
10960 them. So, if this is an array typedef (encoding use for array
10961 access types encoded as fat pointers), strip it now. */
10962 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10963 type
= ada_typedef_target_type (type
);
10965 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10967 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10969 case TYPE_CODE_FUNC
:
10970 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10972 case TYPE_CODE_ARRAY
:
10974 case TYPE_CODE_STRUCT
:
10975 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10976 argvec
[0] = ada_value_ind (argvec
[0]);
10977 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10980 error (_("cannot subscript or call something of type `%s'"),
10981 ada_type_name (value_type (argvec
[0])));
10986 switch (TYPE_CODE (type
))
10988 case TYPE_CODE_FUNC
:
10989 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10991 if (TYPE_TARGET_TYPE (type
) == NULL
)
10992 error_call_unknown_return_type (NULL
);
10993 return allocate_value (TYPE_TARGET_TYPE (type
));
10995 return call_function_by_hand (argvec
[0], NULL
, nargs
, argvec
+ 1);
10996 case TYPE_CODE_INTERNAL_FUNCTION
:
10997 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10998 /* We don't know anything about what the internal
10999 function might return, but we have to return
11001 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11004 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
11005 argvec
[0], nargs
, argvec
+ 1);
11007 case TYPE_CODE_STRUCT
:
11011 arity
= ada_array_arity (type
);
11012 type
= ada_array_element_type (type
, nargs
);
11014 error (_("cannot subscript or call a record"));
11015 if (arity
!= nargs
)
11016 error (_("wrong number of subscripts; expecting %d"), arity
);
11017 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11018 return value_zero (ada_aligned_type (type
), lval_memory
);
11020 unwrap_value (ada_value_subscript
11021 (argvec
[0], nargs
, argvec
+ 1));
11023 case TYPE_CODE_ARRAY
:
11024 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11026 type
= ada_array_element_type (type
, nargs
);
11028 error (_("element type of array unknown"));
11030 return value_zero (ada_aligned_type (type
), lval_memory
);
11033 unwrap_value (ada_value_subscript
11034 (ada_coerce_to_simple_array (argvec
[0]),
11035 nargs
, argvec
+ 1));
11036 case TYPE_CODE_PTR
: /* Pointer to array */
11037 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11039 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
11040 type
= ada_array_element_type (type
, nargs
);
11042 error (_("element type of array unknown"));
11044 return value_zero (ada_aligned_type (type
), lval_memory
);
11047 unwrap_value (ada_value_ptr_subscript (argvec
[0],
11048 nargs
, argvec
+ 1));
11051 error (_("Attempt to index or call something other than an "
11052 "array or function"));
11057 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11058 struct value
*low_bound_val
=
11059 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11060 struct value
*high_bound_val
=
11061 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11063 LONGEST high_bound
;
11065 low_bound_val
= coerce_ref (low_bound_val
);
11066 high_bound_val
= coerce_ref (high_bound_val
);
11067 low_bound
= value_as_long (low_bound_val
);
11068 high_bound
= value_as_long (high_bound_val
);
11070 if (noside
== EVAL_SKIP
)
11073 /* If this is a reference to an aligner type, then remove all
11075 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
11076 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
11077 TYPE_TARGET_TYPE (value_type (array
)) =
11078 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
11080 if (ada_is_constrained_packed_array_type (value_type (array
)))
11081 error (_("cannot slice a packed array"));
11083 /* If this is a reference to an array or an array lvalue,
11084 convert to a pointer. */
11085 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
11086 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
11087 && VALUE_LVAL (array
) == lval_memory
))
11088 array
= value_addr (array
);
11090 if (noside
== EVAL_AVOID_SIDE_EFFECTS
11091 && ada_is_array_descriptor_type (ada_check_typedef
11092 (value_type (array
))))
11093 return empty_array (ada_type_of_array (array
, 0), low_bound
);
11095 array
= ada_coerce_to_simple_array_ptr (array
);
11097 /* If we have more than one level of pointer indirection,
11098 dereference the value until we get only one level. */
11099 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
11100 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
11102 array
= value_ind (array
);
11104 /* Make sure we really do have an array type before going further,
11105 to avoid a SEGV when trying to get the index type or the target
11106 type later down the road if the debug info generated by
11107 the compiler is incorrect or incomplete. */
11108 if (!ada_is_simple_array_type (value_type (array
)))
11109 error (_("cannot take slice of non-array"));
11111 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
11114 struct type
*type0
= ada_check_typedef (value_type (array
));
11116 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
11117 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
11120 struct type
*arr_type0
=
11121 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
11123 return ada_value_slice_from_ptr (array
, arr_type0
,
11124 longest_to_int (low_bound
),
11125 longest_to_int (high_bound
));
11128 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11130 else if (high_bound
< low_bound
)
11131 return empty_array (value_type (array
), low_bound
);
11133 return ada_value_slice (array
, longest_to_int (low_bound
),
11134 longest_to_int (high_bound
));
11137 case UNOP_IN_RANGE
:
11139 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11140 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
11142 if (noside
== EVAL_SKIP
)
11145 switch (TYPE_CODE (type
))
11148 lim_warning (_("Membership test incompletely implemented; "
11149 "always returns true"));
11150 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
11151 return value_from_longest (type
, (LONGEST
) 1);
11153 case TYPE_CODE_RANGE
:
11154 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
11155 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
11156 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11157 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
11158 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
11160 value_from_longest (type
,
11161 (value_less (arg1
, arg3
)
11162 || value_equal (arg1
, arg3
))
11163 && (value_less (arg2
, arg1
)
11164 || value_equal (arg2
, arg1
)));
11167 case BINOP_IN_BOUNDS
:
11169 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11170 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11172 if (noside
== EVAL_SKIP
)
11175 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11177 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
11178 return value_zero (type
, not_lval
);
11181 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11183 type
= ada_index_type (value_type (arg2
), tem
, "range");
11185 type
= value_type (arg1
);
11187 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
11188 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
11190 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11191 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
11192 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
11194 value_from_longest (type
,
11195 (value_less (arg1
, arg3
)
11196 || value_equal (arg1
, arg3
))
11197 && (value_less (arg2
, arg1
)
11198 || value_equal (arg2
, arg1
)));
11200 case TERNOP_IN_RANGE
:
11201 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11202 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11203 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11205 if (noside
== EVAL_SKIP
)
11208 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11209 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
11210 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
11212 value_from_longest (type
,
11213 (value_less (arg1
, arg3
)
11214 || value_equal (arg1
, arg3
))
11215 && (value_less (arg2
, arg1
)
11216 || value_equal (arg2
, arg1
)));
11220 case OP_ATR_LENGTH
:
11222 struct type
*type_arg
;
11224 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
11226 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11228 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11232 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11236 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
11237 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
11238 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
11241 if (noside
== EVAL_SKIP
)
11244 if (type_arg
== NULL
)
11246 arg1
= ada_coerce_ref (arg1
);
11248 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
11249 arg1
= ada_coerce_to_simple_array (arg1
);
11251 if (op
== OP_ATR_LENGTH
)
11252 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11255 type
= ada_index_type (value_type (arg1
), tem
,
11256 ada_attribute_name (op
));
11258 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11261 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11262 return allocate_value (type
);
11266 default: /* Should never happen. */
11267 error (_("unexpected attribute encountered"));
11269 return value_from_longest
11270 (type
, ada_array_bound (arg1
, tem
, 0));
11272 return value_from_longest
11273 (type
, ada_array_bound (arg1
, tem
, 1));
11274 case OP_ATR_LENGTH
:
11275 return value_from_longest
11276 (type
, ada_array_length (arg1
, tem
));
11279 else if (discrete_type_p (type_arg
))
11281 struct type
*range_type
;
11282 const char *name
= ada_type_name (type_arg
);
11285 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
11286 range_type
= to_fixed_range_type (type_arg
, NULL
);
11287 if (range_type
== NULL
)
11288 range_type
= type_arg
;
11292 error (_("unexpected attribute encountered"));
11294 return value_from_longest
11295 (range_type
, ada_discrete_type_low_bound (range_type
));
11297 return value_from_longest
11298 (range_type
, ada_discrete_type_high_bound (range_type
));
11299 case OP_ATR_LENGTH
:
11300 error (_("the 'length attribute applies only to array types"));
11303 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
11304 error (_("unimplemented type attribute"));
11309 if (ada_is_constrained_packed_array_type (type_arg
))
11310 type_arg
= decode_constrained_packed_array_type (type_arg
);
11312 if (op
== OP_ATR_LENGTH
)
11313 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11316 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11318 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11321 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11322 return allocate_value (type
);
11327 error (_("unexpected attribute encountered"));
11329 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11330 return value_from_longest (type
, low
);
11332 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11333 return value_from_longest (type
, high
);
11334 case OP_ATR_LENGTH
:
11335 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11336 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11337 return value_from_longest (type
, high
- low
+ 1);
11343 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11344 if (noside
== EVAL_SKIP
)
11347 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11348 return value_zero (ada_tag_type (arg1
), not_lval
);
11350 return ada_value_tag (arg1
);
11354 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11355 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11356 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11357 if (noside
== EVAL_SKIP
)
11359 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11360 return value_zero (value_type (arg1
), not_lval
);
11363 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11364 return value_binop (arg1
, arg2
,
11365 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11368 case OP_ATR_MODULUS
:
11370 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11372 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11373 if (noside
== EVAL_SKIP
)
11376 if (!ada_is_modular_type (type_arg
))
11377 error (_("'modulus must be applied to modular type"));
11379 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11380 ada_modulus (type_arg
));
11385 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11386 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11387 if (noside
== EVAL_SKIP
)
11389 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11390 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11391 return value_zero (type
, not_lval
);
11393 return value_pos_atr (type
, arg1
);
11396 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11397 type
= value_type (arg1
);
11399 /* If the argument is a reference, then dereference its type, since
11400 the user is really asking for the size of the actual object,
11401 not the size of the pointer. */
11402 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
11403 type
= TYPE_TARGET_TYPE (type
);
11405 if (noside
== EVAL_SKIP
)
11407 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11408 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11410 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11411 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11414 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11415 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11416 type
= exp
->elts
[pc
+ 2].type
;
11417 if (noside
== EVAL_SKIP
)
11419 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11420 return value_zero (type
, not_lval
);
11422 return value_val_atr (type
, arg1
);
11425 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11426 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11427 if (noside
== EVAL_SKIP
)
11429 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11430 return value_zero (value_type (arg1
), not_lval
);
11433 /* For integer exponentiation operations,
11434 only promote the first argument. */
11435 if (is_integral_type (value_type (arg2
)))
11436 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11438 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11440 return value_binop (arg1
, arg2
, op
);
11444 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11445 if (noside
== EVAL_SKIP
)
11451 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11452 if (noside
== EVAL_SKIP
)
11454 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11455 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11456 return value_neg (arg1
);
11461 preeval_pos
= *pos
;
11462 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11463 if (noside
== EVAL_SKIP
)
11465 type
= ada_check_typedef (value_type (arg1
));
11466 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11468 if (ada_is_array_descriptor_type (type
))
11469 /* GDB allows dereferencing GNAT array descriptors. */
11471 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11473 if (arrType
== NULL
)
11474 error (_("Attempt to dereference null array pointer."));
11475 return value_at_lazy (arrType
, 0);
11477 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
11478 || TYPE_CODE (type
) == TYPE_CODE_REF
11479 /* In C you can dereference an array to get the 1st elt. */
11480 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
11482 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11483 only be determined by inspecting the object's tag.
11484 This means that we need to evaluate completely the
11485 expression in order to get its type. */
11487 if ((TYPE_CODE (type
) == TYPE_CODE_REF
11488 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
11489 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11491 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11493 type
= value_type (ada_value_ind (arg1
));
11497 type
= to_static_fixed_type
11499 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11501 ada_ensure_varsize_limit (type
);
11502 return value_zero (type
, lval_memory
);
11504 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11506 /* GDB allows dereferencing an int. */
11507 if (expect_type
== NULL
)
11508 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11513 to_static_fixed_type (ada_aligned_type (expect_type
));
11514 return value_zero (expect_type
, lval_memory
);
11518 error (_("Attempt to take contents of a non-pointer value."));
11520 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11521 type
= ada_check_typedef (value_type (arg1
));
11523 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11524 /* GDB allows dereferencing an int. If we were given
11525 the expect_type, then use that as the target type.
11526 Otherwise, assume that the target type is an int. */
11528 if (expect_type
!= NULL
)
11529 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11532 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11533 (CORE_ADDR
) value_as_address (arg1
));
11536 if (ada_is_array_descriptor_type (type
))
11537 /* GDB allows dereferencing GNAT array descriptors. */
11538 return ada_coerce_to_simple_array (arg1
);
11540 return ada_value_ind (arg1
);
11542 case STRUCTOP_STRUCT
:
11543 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11544 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11545 preeval_pos
= *pos
;
11546 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11547 if (noside
== EVAL_SKIP
)
11549 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11551 struct type
*type1
= value_type (arg1
);
11553 if (ada_is_tagged_type (type1
, 1))
11555 type
= ada_lookup_struct_elt_type (type1
,
11556 &exp
->elts
[pc
+ 2].string
,
11559 /* If the field is not found, check if it exists in the
11560 extension of this object's type. This means that we
11561 need to evaluate completely the expression. */
11565 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11567 arg1
= ada_value_struct_elt (arg1
,
11568 &exp
->elts
[pc
+ 2].string
,
11570 arg1
= unwrap_value (arg1
);
11571 type
= value_type (ada_to_fixed_value (arg1
));
11576 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11579 return value_zero (ada_aligned_type (type
), lval_memory
);
11583 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11584 arg1
= unwrap_value (arg1
);
11585 return ada_to_fixed_value (arg1
);
11589 /* The value is not supposed to be used. This is here to make it
11590 easier to accommodate expressions that contain types. */
11592 if (noside
== EVAL_SKIP
)
11594 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11595 return allocate_value (exp
->elts
[pc
+ 1].type
);
11597 error (_("Attempt to use a type name as an expression"));
11602 case OP_DISCRETE_RANGE
:
11603 case OP_POSITIONAL
:
11605 if (noside
== EVAL_NORMAL
)
11609 error (_("Undefined name, ambiguous name, or renaming used in "
11610 "component association: %s."), &exp
->elts
[pc
+2].string
);
11612 error (_("Aggregates only allowed on the right of an assignment"));
11614 internal_error (__FILE__
, __LINE__
,
11615 _("aggregate apparently mangled"));
11618 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11620 for (tem
= 0; tem
< nargs
; tem
+= 1)
11621 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11626 return eval_skip_value (exp
);
11632 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11633 type name that encodes the 'small and 'delta information.
11634 Otherwise, return NULL. */
11636 static const char *
11637 fixed_type_info (struct type
*type
)
11639 const char *name
= ada_type_name (type
);
11640 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11642 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11644 const char *tail
= strstr (name
, "___XF_");
11651 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11652 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11657 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11660 ada_is_fixed_point_type (struct type
*type
)
11662 return fixed_type_info (type
) != NULL
;
11665 /* Return non-zero iff TYPE represents a System.Address type. */
11668 ada_is_system_address_type (struct type
*type
)
11670 return (TYPE_NAME (type
)
11671 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11674 /* Assuming that TYPE is the representation of an Ada fixed-point
11675 type, return the target floating-point type to be used to represent
11676 of this type during internal computation. */
11678 static struct type
*
11679 ada_scaling_type (struct type
*type
)
11681 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11684 /* Assuming that TYPE is the representation of an Ada fixed-point
11685 type, return its delta, or NULL if the type is malformed and the
11686 delta cannot be determined. */
11689 ada_delta (struct type
*type
)
11691 const char *encoding
= fixed_type_info (type
);
11692 struct type
*scale_type
= ada_scaling_type (type
);
11694 long long num
, den
;
11696 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11699 return value_binop (value_from_longest (scale_type
, num
),
11700 value_from_longest (scale_type
, den
), BINOP_DIV
);
11703 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11704 factor ('SMALL value) associated with the type. */
11707 ada_scaling_factor (struct type
*type
)
11709 const char *encoding
= fixed_type_info (type
);
11710 struct type
*scale_type
= ada_scaling_type (type
);
11712 long long num0
, den0
, num1
, den1
;
11715 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11716 &num0
, &den0
, &num1
, &den1
);
11719 return value_from_longest (scale_type
, 1);
11721 return value_binop (value_from_longest (scale_type
, num1
),
11722 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11724 return value_binop (value_from_longest (scale_type
, num0
),
11725 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11732 /* Scan STR beginning at position K for a discriminant name, and
11733 return the value of that discriminant field of DVAL in *PX. If
11734 PNEW_K is not null, put the position of the character beyond the
11735 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11736 not alter *PX and *PNEW_K if unsuccessful. */
11739 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11742 static char *bound_buffer
= NULL
;
11743 static size_t bound_buffer_len
= 0;
11744 const char *pstart
, *pend
, *bound
;
11745 struct value
*bound_val
;
11747 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11751 pend
= strstr (pstart
, "__");
11755 k
+= strlen (bound
);
11759 int len
= pend
- pstart
;
11761 /* Strip __ and beyond. */
11762 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11763 strncpy (bound_buffer
, pstart
, len
);
11764 bound_buffer
[len
] = '\0';
11766 bound
= bound_buffer
;
11770 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11771 if (bound_val
== NULL
)
11774 *px
= value_as_long (bound_val
);
11775 if (pnew_k
!= NULL
)
11780 /* Value of variable named NAME in the current environment. If
11781 no such variable found, then if ERR_MSG is null, returns 0, and
11782 otherwise causes an error with message ERR_MSG. */
11784 static struct value
*
11785 get_var_value (const char *name
, const char *err_msg
)
11787 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11789 struct block_symbol
*syms
;
11790 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11791 get_selected_block (0),
11792 VAR_DOMAIN
, &syms
, 1);
11793 struct cleanup
*old_chain
= make_cleanup (xfree
, syms
);
11797 do_cleanups (old_chain
);
11798 if (err_msg
== NULL
)
11801 error (("%s"), err_msg
);
11804 struct value
*result
= value_of_variable (syms
[0].symbol
, syms
[0].block
);
11805 do_cleanups (old_chain
);
11809 /* Value of integer variable named NAME in the current environment.
11810 If no such variable is found, returns false. Otherwise, sets VALUE
11811 to the variable's value and returns true. */
11814 get_int_var_value (const char *name
, LONGEST
&value
)
11816 struct value
*var_val
= get_var_value (name
, 0);
11821 value
= value_as_long (var_val
);
11826 /* Return a range type whose base type is that of the range type named
11827 NAME in the current environment, and whose bounds are calculated
11828 from NAME according to the GNAT range encoding conventions.
11829 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11830 corresponding range type from debug information; fall back to using it
11831 if symbol lookup fails. If a new type must be created, allocate it
11832 like ORIG_TYPE was. The bounds information, in general, is encoded
11833 in NAME, the base type given in the named range type. */
11835 static struct type
*
11836 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11839 struct type
*base_type
;
11840 const char *subtype_info
;
11842 gdb_assert (raw_type
!= NULL
);
11843 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11845 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11846 base_type
= TYPE_TARGET_TYPE (raw_type
);
11848 base_type
= raw_type
;
11850 name
= TYPE_NAME (raw_type
);
11851 subtype_info
= strstr (name
, "___XD");
11852 if (subtype_info
== NULL
)
11854 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11855 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11857 if (L
< INT_MIN
|| U
> INT_MAX
)
11860 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11865 static char *name_buf
= NULL
;
11866 static size_t name_len
= 0;
11867 int prefix_len
= subtype_info
- name
;
11870 const char *bounds_str
;
11873 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11874 strncpy (name_buf
, name
, prefix_len
);
11875 name_buf
[prefix_len
] = '\0';
11878 bounds_str
= strchr (subtype_info
, '_');
11881 if (*subtype_info
== 'L')
11883 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11884 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11886 if (bounds_str
[n
] == '_')
11888 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11894 strcpy (name_buf
+ prefix_len
, "___L");
11895 if (!get_int_var_value (name_buf
, L
))
11897 lim_warning (_("Unknown lower bound, using 1."));
11902 if (*subtype_info
== 'U')
11904 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11905 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11910 strcpy (name_buf
+ prefix_len
, "___U");
11911 if (!get_int_var_value (name_buf
, U
))
11913 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11918 type
= create_static_range_type (alloc_type_copy (raw_type
),
11920 /* create_static_range_type alters the resulting type's length
11921 to match the size of the base_type, which is not what we want.
11922 Set it back to the original range type's length. */
11923 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11924 TYPE_NAME (type
) = name
;
11929 /* True iff NAME is the name of a range type. */
11932 ada_is_range_type_name (const char *name
)
11934 return (name
!= NULL
&& strstr (name
, "___XD"));
11938 /* Modular types */
11940 /* True iff TYPE is an Ada modular type. */
11943 ada_is_modular_type (struct type
*type
)
11945 struct type
*subranged_type
= get_base_type (type
);
11947 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11948 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11949 && TYPE_UNSIGNED (subranged_type
));
11952 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11955 ada_modulus (struct type
*type
)
11957 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11961 /* Ada exception catchpoint support:
11962 ---------------------------------
11964 We support 3 kinds of exception catchpoints:
11965 . catchpoints on Ada exceptions
11966 . catchpoints on unhandled Ada exceptions
11967 . catchpoints on failed assertions
11969 Exceptions raised during failed assertions, or unhandled exceptions
11970 could perfectly be caught with the general catchpoint on Ada exceptions.
11971 However, we can easily differentiate these two special cases, and having
11972 the option to distinguish these two cases from the rest can be useful
11973 to zero-in on certain situations.
11975 Exception catchpoints are a specialized form of breakpoint,
11976 since they rely on inserting breakpoints inside known routines
11977 of the GNAT runtime. The implementation therefore uses a standard
11978 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11981 Support in the runtime for exception catchpoints have been changed
11982 a few times already, and these changes affect the implementation
11983 of these catchpoints. In order to be able to support several
11984 variants of the runtime, we use a sniffer that will determine
11985 the runtime variant used by the program being debugged. */
11987 /* Ada's standard exceptions.
11989 The Ada 83 standard also defined Numeric_Error. But there so many
11990 situations where it was unclear from the Ada 83 Reference Manual
11991 (RM) whether Constraint_Error or Numeric_Error should be raised,
11992 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11993 Interpretation saying that anytime the RM says that Numeric_Error
11994 should be raised, the implementation may raise Constraint_Error.
11995 Ada 95 went one step further and pretty much removed Numeric_Error
11996 from the list of standard exceptions (it made it a renaming of
11997 Constraint_Error, to help preserve compatibility when compiling
11998 an Ada83 compiler). As such, we do not include Numeric_Error from
11999 this list of standard exceptions. */
12001 static const char *standard_exc
[] = {
12002 "constraint_error",
12008 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
12010 /* A structure that describes how to support exception catchpoints
12011 for a given executable. */
12013 struct exception_support_info
12015 /* The name of the symbol to break on in order to insert
12016 a catchpoint on exceptions. */
12017 const char *catch_exception_sym
;
12019 /* The name of the symbol to break on in order to insert
12020 a catchpoint on unhandled exceptions. */
12021 const char *catch_exception_unhandled_sym
;
12023 /* The name of the symbol to break on in order to insert
12024 a catchpoint on failed assertions. */
12025 const char *catch_assert_sym
;
12027 /* The name of the symbol to break on in order to insert
12028 a catchpoint on exception handling. */
12029 const char *catch_handlers_sym
;
12031 /* Assuming that the inferior just triggered an unhandled exception
12032 catchpoint, this function is responsible for returning the address
12033 in inferior memory where the name of that exception is stored.
12034 Return zero if the address could not be computed. */
12035 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
12038 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
12039 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
12041 /* The following exception support info structure describes how to
12042 implement exception catchpoints with the latest version of the
12043 Ada runtime (as of 2007-03-06). */
12045 static const struct exception_support_info default_exception_support_info
=
12047 "__gnat_debug_raise_exception", /* catch_exception_sym */
12048 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
12049 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
12050 "__gnat_begin_handler", /* catch_handlers_sym */
12051 ada_unhandled_exception_name_addr
12054 /* The following exception support info structure describes how to
12055 implement exception catchpoints with a slightly older version
12056 of the Ada runtime. */
12058 static const struct exception_support_info exception_support_info_fallback
=
12060 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
12061 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
12062 "system__assertions__raise_assert_failure", /* catch_assert_sym */
12063 "__gnat_begin_handler", /* catch_handlers_sym */
12064 ada_unhandled_exception_name_addr_from_raise
12067 /* Return nonzero if we can detect the exception support routines
12068 described in EINFO.
12070 This function errors out if an abnormal situation is detected
12071 (for instance, if we find the exception support routines, but
12072 that support is found to be incomplete). */
12075 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
12077 struct symbol
*sym
;
12079 /* The symbol we're looking up is provided by a unit in the GNAT runtime
12080 that should be compiled with debugging information. As a result, we
12081 expect to find that symbol in the symtabs. */
12083 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
12086 /* Perhaps we did not find our symbol because the Ada runtime was
12087 compiled without debugging info, or simply stripped of it.
12088 It happens on some GNU/Linux distributions for instance, where
12089 users have to install a separate debug package in order to get
12090 the runtime's debugging info. In that situation, let the user
12091 know why we cannot insert an Ada exception catchpoint.
12093 Note: Just for the purpose of inserting our Ada exception
12094 catchpoint, we could rely purely on the associated minimal symbol.
12095 But we would be operating in degraded mode anyway, since we are
12096 still lacking the debugging info needed later on to extract
12097 the name of the exception being raised (this name is printed in
12098 the catchpoint message, and is also used when trying to catch
12099 a specific exception). We do not handle this case for now. */
12100 struct bound_minimal_symbol msym
12101 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
12103 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
12104 error (_("Your Ada runtime appears to be missing some debugging "
12105 "information.\nCannot insert Ada exception catchpoint "
12106 "in this configuration."));
12111 /* Make sure that the symbol we found corresponds to a function. */
12113 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12114 error (_("Symbol \"%s\" is not a function (class = %d)"),
12115 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
12120 /* Inspect the Ada runtime and determine which exception info structure
12121 should be used to provide support for exception catchpoints.
12123 This function will always set the per-inferior exception_info,
12124 or raise an error. */
12127 ada_exception_support_info_sniffer (void)
12129 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12131 /* If the exception info is already known, then no need to recompute it. */
12132 if (data
->exception_info
!= NULL
)
12135 /* Check the latest (default) exception support info. */
12136 if (ada_has_this_exception_support (&default_exception_support_info
))
12138 data
->exception_info
= &default_exception_support_info
;
12142 /* Try our fallback exception suport info. */
12143 if (ada_has_this_exception_support (&exception_support_info_fallback
))
12145 data
->exception_info
= &exception_support_info_fallback
;
12149 /* Sometimes, it is normal for us to not be able to find the routine
12150 we are looking for. This happens when the program is linked with
12151 the shared version of the GNAT runtime, and the program has not been
12152 started yet. Inform the user of these two possible causes if
12155 if (ada_update_initial_language (language_unknown
) != language_ada
)
12156 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
12158 /* If the symbol does not exist, then check that the program is
12159 already started, to make sure that shared libraries have been
12160 loaded. If it is not started, this may mean that the symbol is
12161 in a shared library. */
12163 if (ptid_get_pid (inferior_ptid
) == 0)
12164 error (_("Unable to insert catchpoint. Try to start the program first."));
12166 /* At this point, we know that we are debugging an Ada program and
12167 that the inferior has been started, but we still are not able to
12168 find the run-time symbols. That can mean that we are in
12169 configurable run time mode, or that a-except as been optimized
12170 out by the linker... In any case, at this point it is not worth
12171 supporting this feature. */
12173 error (_("Cannot insert Ada exception catchpoints in this configuration."));
12176 /* True iff FRAME is very likely to be that of a function that is
12177 part of the runtime system. This is all very heuristic, but is
12178 intended to be used as advice as to what frames are uninteresting
12182 is_known_support_routine (struct frame_info
*frame
)
12184 enum language func_lang
;
12186 const char *fullname
;
12188 /* If this code does not have any debugging information (no symtab),
12189 This cannot be any user code. */
12191 symtab_and_line sal
= find_frame_sal (frame
);
12192 if (sal
.symtab
== NULL
)
12195 /* If there is a symtab, but the associated source file cannot be
12196 located, then assume this is not user code: Selecting a frame
12197 for which we cannot display the code would not be very helpful
12198 for the user. This should also take care of case such as VxWorks
12199 where the kernel has some debugging info provided for a few units. */
12201 fullname
= symtab_to_fullname (sal
.symtab
);
12202 if (access (fullname
, R_OK
) != 0)
12205 /* Check the unit filename againt the Ada runtime file naming.
12206 We also check the name of the objfile against the name of some
12207 known system libraries that sometimes come with debugging info
12210 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
12212 re_comp (known_runtime_file_name_patterns
[i
]);
12213 if (re_exec (lbasename (sal
.symtab
->filename
)))
12215 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
12216 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
12220 /* Check whether the function is a GNAT-generated entity. */
12222 gdb::unique_xmalloc_ptr
<char> func_name
12223 = find_frame_funname (frame
, &func_lang
, NULL
);
12224 if (func_name
== NULL
)
12227 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
12229 re_comp (known_auxiliary_function_name_patterns
[i
]);
12230 if (re_exec (func_name
.get ()))
12237 /* Find the first frame that contains debugging information and that is not
12238 part of the Ada run-time, starting from FI and moving upward. */
12241 ada_find_printable_frame (struct frame_info
*fi
)
12243 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
12245 if (!is_known_support_routine (fi
))
12254 /* Assuming that the inferior just triggered an unhandled exception
12255 catchpoint, return the address in inferior memory where the name
12256 of the exception is stored.
12258 Return zero if the address could not be computed. */
12261 ada_unhandled_exception_name_addr (void)
12263 return parse_and_eval_address ("e.full_name");
12266 /* Same as ada_unhandled_exception_name_addr, except that this function
12267 should be used when the inferior uses an older version of the runtime,
12268 where the exception name needs to be extracted from a specific frame
12269 several frames up in the callstack. */
12272 ada_unhandled_exception_name_addr_from_raise (void)
12275 struct frame_info
*fi
;
12276 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12278 /* To determine the name of this exception, we need to select
12279 the frame corresponding to RAISE_SYM_NAME. This frame is
12280 at least 3 levels up, so we simply skip the first 3 frames
12281 without checking the name of their associated function. */
12282 fi
= get_current_frame ();
12283 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
12285 fi
= get_prev_frame (fi
);
12289 enum language func_lang
;
12291 gdb::unique_xmalloc_ptr
<char> func_name
12292 = find_frame_funname (fi
, &func_lang
, NULL
);
12293 if (func_name
!= NULL
)
12295 if (strcmp (func_name
.get (),
12296 data
->exception_info
->catch_exception_sym
) == 0)
12297 break; /* We found the frame we were looking for... */
12298 fi
= get_prev_frame (fi
);
12306 return parse_and_eval_address ("id.full_name");
12309 /* Assuming the inferior just triggered an Ada exception catchpoint
12310 (of any type), return the address in inferior memory where the name
12311 of the exception is stored, if applicable.
12313 Assumes the selected frame is the current frame.
12315 Return zero if the address could not be computed, or if not relevant. */
12318 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12319 struct breakpoint
*b
)
12321 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12325 case ada_catch_exception
:
12326 return (parse_and_eval_address ("e.full_name"));
12329 case ada_catch_exception_unhandled
:
12330 return data
->exception_info
->unhandled_exception_name_addr ();
12333 case ada_catch_handlers
:
12334 return 0; /* The runtimes does not provide access to the exception
12338 case ada_catch_assert
:
12339 return 0; /* Exception name is not relevant in this case. */
12343 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12347 return 0; /* Should never be reached. */
12350 /* Assuming the inferior is stopped at an exception catchpoint,
12351 return the message which was associated to the exception, if
12352 available. Return NULL if the message could not be retrieved.
12354 The caller must xfree the string after use.
12356 Note: The exception message can be associated to an exception
12357 either through the use of the Raise_Exception function, or
12358 more simply (Ada 2005 and later), via:
12360 raise Exception_Name with "exception message";
12365 ada_exception_message_1 (void)
12367 struct value
*e_msg_val
;
12368 char *e_msg
= NULL
;
12370 struct cleanup
*cleanups
;
12372 /* For runtimes that support this feature, the exception message
12373 is passed as an unbounded string argument called "message". */
12374 e_msg_val
= parse_and_eval ("message");
12375 if (e_msg_val
== NULL
)
12376 return NULL
; /* Exception message not supported. */
12378 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
12379 gdb_assert (e_msg_val
!= NULL
);
12380 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
12382 /* If the message string is empty, then treat it as if there was
12383 no exception message. */
12384 if (e_msg_len
<= 0)
12387 e_msg
= (char *) xmalloc (e_msg_len
+ 1);
12388 cleanups
= make_cleanup (xfree
, e_msg
);
12389 read_memory_string (value_address (e_msg_val
), e_msg
, e_msg_len
+ 1);
12390 e_msg
[e_msg_len
] = '\0';
12392 discard_cleanups (cleanups
);
12396 /* Same as ada_exception_message_1, except that all exceptions are
12397 contained here (returning NULL instead). */
12400 ada_exception_message (void)
12402 char *e_msg
= NULL
; /* Avoid a spurious uninitialized warning. */
12406 e_msg
= ada_exception_message_1 ();
12408 CATCH (e
, RETURN_MASK_ERROR
)
12417 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12418 any error that ada_exception_name_addr_1 might cause to be thrown.
12419 When an error is intercepted, a warning with the error message is printed,
12420 and zero is returned. */
12423 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12424 struct breakpoint
*b
)
12426 CORE_ADDR result
= 0;
12430 result
= ada_exception_name_addr_1 (ex
, b
);
12433 CATCH (e
, RETURN_MASK_ERROR
)
12435 warning (_("failed to get exception name: %s"), e
.message
);
12443 static char *ada_exception_catchpoint_cond_string
12444 (const char *excep_string
,
12445 enum ada_exception_catchpoint_kind ex
);
12447 /* Ada catchpoints.
12449 In the case of catchpoints on Ada exceptions, the catchpoint will
12450 stop the target on every exception the program throws. When a user
12451 specifies the name of a specific exception, we translate this
12452 request into a condition expression (in text form), and then parse
12453 it into an expression stored in each of the catchpoint's locations.
12454 We then use this condition to check whether the exception that was
12455 raised is the one the user is interested in. If not, then the
12456 target is resumed again. We store the name of the requested
12457 exception, in order to be able to re-set the condition expression
12458 when symbols change. */
12460 /* An instance of this type is used to represent an Ada catchpoint
12461 breakpoint location. */
12463 class ada_catchpoint_location
: public bp_location
12466 ada_catchpoint_location (const bp_location_ops
*ops
, breakpoint
*owner
)
12467 : bp_location (ops
, owner
)
12470 /* The condition that checks whether the exception that was raised
12471 is the specific exception the user specified on catchpoint
12473 expression_up excep_cond_expr
;
12476 /* Implement the DTOR method in the bp_location_ops structure for all
12477 Ada exception catchpoint kinds. */
12480 ada_catchpoint_location_dtor (struct bp_location
*bl
)
12482 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
12484 al
->excep_cond_expr
.reset ();
12487 /* The vtable to be used in Ada catchpoint locations. */
12489 static const struct bp_location_ops ada_catchpoint_location_ops
=
12491 ada_catchpoint_location_dtor
12494 /* An instance of this type is used to represent an Ada catchpoint. */
12496 struct ada_catchpoint
: public breakpoint
12498 ~ada_catchpoint () override
;
12500 /* The name of the specific exception the user specified. */
12501 char *excep_string
;
12504 /* Parse the exception condition string in the context of each of the
12505 catchpoint's locations, and store them for later evaluation. */
12508 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12509 enum ada_exception_catchpoint_kind ex
)
12511 struct cleanup
*old_chain
;
12512 struct bp_location
*bl
;
12515 /* Nothing to do if there's no specific exception to catch. */
12516 if (c
->excep_string
== NULL
)
12519 /* Same if there are no locations... */
12520 if (c
->loc
== NULL
)
12523 /* Compute the condition expression in text form, from the specific
12524 expection we want to catch. */
12525 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
, ex
);
12526 old_chain
= make_cleanup (xfree
, cond_string
);
12528 /* Iterate over all the catchpoint's locations, and parse an
12529 expression for each. */
12530 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12532 struct ada_catchpoint_location
*ada_loc
12533 = (struct ada_catchpoint_location
*) bl
;
12536 if (!bl
->shlib_disabled
)
12543 exp
= parse_exp_1 (&s
, bl
->address
,
12544 block_for_pc (bl
->address
),
12547 CATCH (e
, RETURN_MASK_ERROR
)
12549 warning (_("failed to reevaluate internal exception condition "
12550 "for catchpoint %d: %s"),
12551 c
->number
, e
.message
);
12556 ada_loc
->excep_cond_expr
= std::move (exp
);
12559 do_cleanups (old_chain
);
12562 /* ada_catchpoint destructor. */
12564 ada_catchpoint::~ada_catchpoint ()
12566 xfree (this->excep_string
);
12569 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12570 structure for all exception catchpoint kinds. */
12572 static struct bp_location
*
12573 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
12574 struct breakpoint
*self
)
12576 return new ada_catchpoint_location (&ada_catchpoint_location_ops
, self
);
12579 /* Implement the RE_SET method in the breakpoint_ops structure for all
12580 exception catchpoint kinds. */
12583 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
12585 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12587 /* Call the base class's method. This updates the catchpoint's
12589 bkpt_breakpoint_ops
.re_set (b
);
12591 /* Reparse the exception conditional expressions. One for each
12593 create_excep_cond_exprs (c
, ex
);
12596 /* Returns true if we should stop for this breakpoint hit. If the
12597 user specified a specific exception, we only want to cause a stop
12598 if the program thrown that exception. */
12601 should_stop_exception (const struct bp_location
*bl
)
12603 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12604 const struct ada_catchpoint_location
*ada_loc
12605 = (const struct ada_catchpoint_location
*) bl
;
12608 /* With no specific exception, should always stop. */
12609 if (c
->excep_string
== NULL
)
12612 if (ada_loc
->excep_cond_expr
== NULL
)
12614 /* We will have a NULL expression if back when we were creating
12615 the expressions, this location's had failed to parse. */
12622 struct value
*mark
;
12624 mark
= value_mark ();
12625 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12626 value_free_to_mark (mark
);
12628 CATCH (ex
, RETURN_MASK_ALL
)
12630 exception_fprintf (gdb_stderr
, ex
,
12631 _("Error in testing exception condition:\n"));
12638 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12639 for all exception catchpoint kinds. */
12642 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12644 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12647 /* Implement the PRINT_IT method in the breakpoint_ops structure
12648 for all exception catchpoint kinds. */
12650 static enum print_stop_action
12651 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12653 struct ui_out
*uiout
= current_uiout
;
12654 struct breakpoint
*b
= bs
->breakpoint_at
;
12655 char *exception_message
;
12657 annotate_catchpoint (b
->number
);
12659 if (uiout
->is_mi_like_p ())
12661 uiout
->field_string ("reason",
12662 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12663 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12666 uiout
->text (b
->disposition
== disp_del
12667 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12668 uiout
->field_int ("bkptno", b
->number
);
12669 uiout
->text (", ");
12671 /* ada_exception_name_addr relies on the selected frame being the
12672 current frame. Need to do this here because this function may be
12673 called more than once when printing a stop, and below, we'll
12674 select the first frame past the Ada run-time (see
12675 ada_find_printable_frame). */
12676 select_frame (get_current_frame ());
12680 case ada_catch_exception
:
12681 case ada_catch_exception_unhandled
:
12682 case ada_catch_handlers
:
12684 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
12685 char exception_name
[256];
12689 read_memory (addr
, (gdb_byte
*) exception_name
,
12690 sizeof (exception_name
) - 1);
12691 exception_name
[sizeof (exception_name
) - 1] = '\0';
12695 /* For some reason, we were unable to read the exception
12696 name. This could happen if the Runtime was compiled
12697 without debugging info, for instance. In that case,
12698 just replace the exception name by the generic string
12699 "exception" - it will read as "an exception" in the
12700 notification we are about to print. */
12701 memcpy (exception_name
, "exception", sizeof ("exception"));
12703 /* In the case of unhandled exception breakpoints, we print
12704 the exception name as "unhandled EXCEPTION_NAME", to make
12705 it clearer to the user which kind of catchpoint just got
12706 hit. We used ui_out_text to make sure that this extra
12707 info does not pollute the exception name in the MI case. */
12708 if (ex
== ada_catch_exception_unhandled
)
12709 uiout
->text ("unhandled ");
12710 uiout
->field_string ("exception-name", exception_name
);
12713 case ada_catch_assert
:
12714 /* In this case, the name of the exception is not really
12715 important. Just print "failed assertion" to make it clearer
12716 that his program just hit an assertion-failure catchpoint.
12717 We used ui_out_text because this info does not belong in
12719 uiout
->text ("failed assertion");
12723 exception_message
= ada_exception_message ();
12724 if (exception_message
!= NULL
)
12726 struct cleanup
*cleanups
= make_cleanup (xfree
, exception_message
);
12728 uiout
->text (" (");
12729 uiout
->field_string ("exception-message", exception_message
);
12732 do_cleanups (cleanups
);
12735 uiout
->text (" at ");
12736 ada_find_printable_frame (get_current_frame ());
12738 return PRINT_SRC_AND_LOC
;
12741 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12742 for all exception catchpoint kinds. */
12745 print_one_exception (enum ada_exception_catchpoint_kind ex
,
12746 struct breakpoint
*b
, struct bp_location
**last_loc
)
12748 struct ui_out
*uiout
= current_uiout
;
12749 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12750 struct value_print_options opts
;
12752 get_user_print_options (&opts
);
12753 if (opts
.addressprint
)
12755 annotate_field (4);
12756 uiout
->field_core_addr ("addr", b
->loc
->gdbarch
, b
->loc
->address
);
12759 annotate_field (5);
12760 *last_loc
= b
->loc
;
12763 case ada_catch_exception
:
12764 if (c
->excep_string
!= NULL
)
12766 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12768 uiout
->field_string ("what", msg
);
12772 uiout
->field_string ("what", "all Ada exceptions");
12776 case ada_catch_exception_unhandled
:
12777 uiout
->field_string ("what", "unhandled Ada exceptions");
12780 case ada_catch_handlers
:
12781 if (c
->excep_string
!= NULL
)
12783 uiout
->field_fmt ("what",
12784 _("`%s' Ada exception handlers"),
12788 uiout
->field_string ("what", "all Ada exceptions handlers");
12791 case ada_catch_assert
:
12792 uiout
->field_string ("what", "failed Ada assertions");
12796 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12801 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12802 for all exception catchpoint kinds. */
12805 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12806 struct breakpoint
*b
)
12808 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12809 struct ui_out
*uiout
= current_uiout
;
12811 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12812 : _("Catchpoint "));
12813 uiout
->field_int ("bkptno", b
->number
);
12814 uiout
->text (": ");
12818 case ada_catch_exception
:
12819 if (c
->excep_string
!= NULL
)
12821 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12822 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12824 uiout
->text (info
);
12825 do_cleanups (old_chain
);
12828 uiout
->text (_("all Ada exceptions"));
12831 case ada_catch_exception_unhandled
:
12832 uiout
->text (_("unhandled Ada exceptions"));
12835 case ada_catch_handlers
:
12836 if (c
->excep_string
!= NULL
)
12839 = string_printf (_("`%s' Ada exception handlers"),
12841 uiout
->text (info
.c_str ());
12844 uiout
->text (_("all Ada exceptions handlers"));
12847 case ada_catch_assert
:
12848 uiout
->text (_("failed Ada assertions"));
12852 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12857 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12858 for all exception catchpoint kinds. */
12861 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12862 struct breakpoint
*b
, struct ui_file
*fp
)
12864 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12868 case ada_catch_exception
:
12869 fprintf_filtered (fp
, "catch exception");
12870 if (c
->excep_string
!= NULL
)
12871 fprintf_filtered (fp
, " %s", c
->excep_string
);
12874 case ada_catch_exception_unhandled
:
12875 fprintf_filtered (fp
, "catch exception unhandled");
12878 case ada_catch_handlers
:
12879 fprintf_filtered (fp
, "catch handlers");
12882 case ada_catch_assert
:
12883 fprintf_filtered (fp
, "catch assert");
12887 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12889 print_recreate_thread (b
, fp
);
12892 /* Virtual table for "catch exception" breakpoints. */
12894 static struct bp_location
*
12895 allocate_location_catch_exception (struct breakpoint
*self
)
12897 return allocate_location_exception (ada_catch_exception
, self
);
12901 re_set_catch_exception (struct breakpoint
*b
)
12903 re_set_exception (ada_catch_exception
, b
);
12907 check_status_catch_exception (bpstat bs
)
12909 check_status_exception (ada_catch_exception
, bs
);
12912 static enum print_stop_action
12913 print_it_catch_exception (bpstat bs
)
12915 return print_it_exception (ada_catch_exception
, bs
);
12919 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12921 print_one_exception (ada_catch_exception
, b
, last_loc
);
12925 print_mention_catch_exception (struct breakpoint
*b
)
12927 print_mention_exception (ada_catch_exception
, b
);
12931 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12933 print_recreate_exception (ada_catch_exception
, b
, fp
);
12936 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12938 /* Virtual table for "catch exception unhandled" breakpoints. */
12940 static struct bp_location
*
12941 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12943 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12947 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12949 re_set_exception (ada_catch_exception_unhandled
, b
);
12953 check_status_catch_exception_unhandled (bpstat bs
)
12955 check_status_exception (ada_catch_exception_unhandled
, bs
);
12958 static enum print_stop_action
12959 print_it_catch_exception_unhandled (bpstat bs
)
12961 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12965 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12966 struct bp_location
**last_loc
)
12968 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12972 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12974 print_mention_exception (ada_catch_exception_unhandled
, b
);
12978 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12979 struct ui_file
*fp
)
12981 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12984 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12986 /* Virtual table for "catch assert" breakpoints. */
12988 static struct bp_location
*
12989 allocate_location_catch_assert (struct breakpoint
*self
)
12991 return allocate_location_exception (ada_catch_assert
, self
);
12995 re_set_catch_assert (struct breakpoint
*b
)
12997 re_set_exception (ada_catch_assert
, b
);
13001 check_status_catch_assert (bpstat bs
)
13003 check_status_exception (ada_catch_assert
, bs
);
13006 static enum print_stop_action
13007 print_it_catch_assert (bpstat bs
)
13009 return print_it_exception (ada_catch_assert
, bs
);
13013 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
13015 print_one_exception (ada_catch_assert
, b
, last_loc
);
13019 print_mention_catch_assert (struct breakpoint
*b
)
13021 print_mention_exception (ada_catch_assert
, b
);
13025 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
13027 print_recreate_exception (ada_catch_assert
, b
, fp
);
13030 static struct breakpoint_ops catch_assert_breakpoint_ops
;
13032 /* Virtual table for "catch handlers" breakpoints. */
13034 static struct bp_location
*
13035 allocate_location_catch_handlers (struct breakpoint
*self
)
13037 return allocate_location_exception (ada_catch_handlers
, self
);
13041 re_set_catch_handlers (struct breakpoint
*b
)
13043 re_set_exception (ada_catch_handlers
, b
);
13047 check_status_catch_handlers (bpstat bs
)
13049 check_status_exception (ada_catch_handlers
, bs
);
13052 static enum print_stop_action
13053 print_it_catch_handlers (bpstat bs
)
13055 return print_it_exception (ada_catch_handlers
, bs
);
13059 print_one_catch_handlers (struct breakpoint
*b
,
13060 struct bp_location
**last_loc
)
13062 print_one_exception (ada_catch_handlers
, b
, last_loc
);
13066 print_mention_catch_handlers (struct breakpoint
*b
)
13068 print_mention_exception (ada_catch_handlers
, b
);
13072 print_recreate_catch_handlers (struct breakpoint
*b
,
13073 struct ui_file
*fp
)
13075 print_recreate_exception (ada_catch_handlers
, b
, fp
);
13078 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
13080 /* Return a newly allocated copy of the first space-separated token
13081 in ARGSP, and then adjust ARGSP to point immediately after that
13084 Return NULL if ARGPS does not contain any more tokens. */
13087 ada_get_next_arg (const char **argsp
)
13089 const char *args
= *argsp
;
13093 args
= skip_spaces (args
);
13094 if (args
[0] == '\0')
13095 return NULL
; /* No more arguments. */
13097 /* Find the end of the current argument. */
13099 end
= skip_to_space (args
);
13101 /* Adjust ARGSP to point to the start of the next argument. */
13105 /* Make a copy of the current argument and return it. */
13107 result
= (char *) xmalloc (end
- args
+ 1);
13108 strncpy (result
, args
, end
- args
);
13109 result
[end
- args
] = '\0';
13114 /* Split the arguments specified in a "catch exception" command.
13115 Set EX to the appropriate catchpoint type.
13116 Set EXCEP_STRING to the name of the specific exception if
13117 specified by the user.
13118 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
13119 "catch handlers" command. False otherwise.
13120 If a condition is found at the end of the arguments, the condition
13121 expression is stored in COND_STRING (memory must be deallocated
13122 after use). Otherwise COND_STRING is set to NULL. */
13125 catch_ada_exception_command_split (const char *args
,
13126 bool is_catch_handlers_cmd
,
13127 enum ada_exception_catchpoint_kind
*ex
,
13128 char **excep_string
,
13129 char **cond_string
)
13131 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
13132 char *exception_name
;
13135 exception_name
= ada_get_next_arg (&args
);
13136 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
13138 /* This is not an exception name; this is the start of a condition
13139 expression for a catchpoint on all exceptions. So, "un-get"
13140 this token, and set exception_name to NULL. */
13141 xfree (exception_name
);
13142 exception_name
= NULL
;
13145 make_cleanup (xfree
, exception_name
);
13147 /* Check to see if we have a condition. */
13149 args
= skip_spaces (args
);
13150 if (startswith (args
, "if")
13151 && (isspace (args
[2]) || args
[2] == '\0'))
13154 args
= skip_spaces (args
);
13156 if (args
[0] == '\0')
13157 error (_("Condition missing after `if' keyword"));
13158 cond
= xstrdup (args
);
13159 make_cleanup (xfree
, cond
);
13161 args
+= strlen (args
);
13164 /* Check that we do not have any more arguments. Anything else
13167 if (args
[0] != '\0')
13168 error (_("Junk at end of expression"));
13170 discard_cleanups (old_chain
);
13172 if (is_catch_handlers_cmd
)
13174 /* Catch handling of exceptions. */
13175 *ex
= ada_catch_handlers
;
13176 *excep_string
= exception_name
;
13178 else if (exception_name
== NULL
)
13180 /* Catch all exceptions. */
13181 *ex
= ada_catch_exception
;
13182 *excep_string
= NULL
;
13184 else if (strcmp (exception_name
, "unhandled") == 0)
13186 /* Catch unhandled exceptions. */
13187 *ex
= ada_catch_exception_unhandled
;
13188 *excep_string
= NULL
;
13192 /* Catch a specific exception. */
13193 *ex
= ada_catch_exception
;
13194 *excep_string
= exception_name
;
13196 *cond_string
= cond
;
13199 /* Return the name of the symbol on which we should break in order to
13200 implement a catchpoint of the EX kind. */
13202 static const char *
13203 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
13205 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
13207 gdb_assert (data
->exception_info
!= NULL
);
13211 case ada_catch_exception
:
13212 return (data
->exception_info
->catch_exception_sym
);
13214 case ada_catch_exception_unhandled
:
13215 return (data
->exception_info
->catch_exception_unhandled_sym
);
13217 case ada_catch_assert
:
13218 return (data
->exception_info
->catch_assert_sym
);
13220 case ada_catch_handlers
:
13221 return (data
->exception_info
->catch_handlers_sym
);
13224 internal_error (__FILE__
, __LINE__
,
13225 _("unexpected catchpoint kind (%d)"), ex
);
13229 /* Return the breakpoint ops "virtual table" used for catchpoints
13232 static const struct breakpoint_ops
*
13233 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
13237 case ada_catch_exception
:
13238 return (&catch_exception_breakpoint_ops
);
13240 case ada_catch_exception_unhandled
:
13241 return (&catch_exception_unhandled_breakpoint_ops
);
13243 case ada_catch_assert
:
13244 return (&catch_assert_breakpoint_ops
);
13246 case ada_catch_handlers
:
13247 return (&catch_handlers_breakpoint_ops
);
13250 internal_error (__FILE__
, __LINE__
,
13251 _("unexpected catchpoint kind (%d)"), ex
);
13255 /* Return the condition that will be used to match the current exception
13256 being raised with the exception that the user wants to catch. This
13257 assumes that this condition is used when the inferior just triggered
13258 an exception catchpoint.
13259 EX: the type of catchpoints used for catching Ada exceptions.
13261 The string returned is a newly allocated string that needs to be
13262 deallocated later. */
13265 ada_exception_catchpoint_cond_string (const char *excep_string
,
13266 enum ada_exception_catchpoint_kind ex
)
13269 bool is_standard_exc
= false;
13270 const char *actual_exc_expr
;
13271 char *ref_exc_expr
;
13273 if (ex
== ada_catch_handlers
)
13275 /* For exception handlers catchpoints, the condition string does
13276 not use the same parameter as for the other exceptions. */
13277 actual_exc_expr
= ("long_integer (GNAT_GCC_exception_Access"
13278 "(gcc_exception).all.occurrence.id)");
13281 actual_exc_expr
= "long_integer (e)";
13283 /* The standard exceptions are a special case. They are defined in
13284 runtime units that have been compiled without debugging info; if
13285 EXCEP_STRING is the not-fully-qualified name of a standard
13286 exception (e.g. "constraint_error") then, during the evaluation
13287 of the condition expression, the symbol lookup on this name would
13288 *not* return this standard exception. The catchpoint condition
13289 may then be set only on user-defined exceptions which have the
13290 same not-fully-qualified name (e.g. my_package.constraint_error).
13292 To avoid this unexcepted behavior, these standard exceptions are
13293 systematically prefixed by "standard". This means that "catch
13294 exception constraint_error" is rewritten into "catch exception
13295 standard.constraint_error".
13297 If an exception named contraint_error is defined in another package of
13298 the inferior program, then the only way to specify this exception as a
13299 breakpoint condition is to use its fully-qualified named:
13300 e.g. my_package.constraint_error. */
13302 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
13304 if (strcmp (standard_exc
[i
], excep_string
) == 0)
13306 is_standard_exc
= true;
13311 if (is_standard_exc
)
13312 ref_exc_expr
= xstrprintf ("long_integer (&standard.%s)", excep_string
);
13314 ref_exc_expr
= xstrprintf ("long_integer (&%s)", excep_string
);
13316 char *result
= xstrprintf ("%s = %s", actual_exc_expr
, ref_exc_expr
);
13317 xfree (ref_exc_expr
);
13321 /* Return the symtab_and_line that should be used to insert an exception
13322 catchpoint of the TYPE kind.
13324 EXCEP_STRING should contain the name of a specific exception that
13325 the catchpoint should catch, or NULL otherwise.
13327 ADDR_STRING returns the name of the function where the real
13328 breakpoint that implements the catchpoints is set, depending on the
13329 type of catchpoint we need to create. */
13331 static struct symtab_and_line
13332 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
13333 const char **addr_string
, const struct breakpoint_ops
**ops
)
13335 const char *sym_name
;
13336 struct symbol
*sym
;
13338 /* First, find out which exception support info to use. */
13339 ada_exception_support_info_sniffer ();
13341 /* Then lookup the function on which we will break in order to catch
13342 the Ada exceptions requested by the user. */
13343 sym_name
= ada_exception_sym_name (ex
);
13344 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
13346 /* We can assume that SYM is not NULL at this stage. If the symbol
13347 did not exist, ada_exception_support_info_sniffer would have
13348 raised an exception.
13350 Also, ada_exception_support_info_sniffer should have already
13351 verified that SYM is a function symbol. */
13352 gdb_assert (sym
!= NULL
);
13353 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
13355 /* Set ADDR_STRING. */
13356 *addr_string
= xstrdup (sym_name
);
13359 *ops
= ada_exception_breakpoint_ops (ex
);
13361 return find_function_start_sal (sym
, 1);
13364 /* Create an Ada exception catchpoint.
13366 EX_KIND is the kind of exception catchpoint to be created.
13368 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
13369 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
13370 of the exception to which this catchpoint applies. When not NULL,
13371 the string must be allocated on the heap, and its deallocation
13372 is no longer the responsibility of the caller.
13374 COND_STRING, if not NULL, is the catchpoint condition. This string
13375 must be allocated on the heap, and its deallocation is no longer
13376 the responsibility of the caller.
13378 TEMPFLAG, if nonzero, means that the underlying breakpoint
13379 should be temporary.
13381 FROM_TTY is the usual argument passed to all commands implementations. */
13384 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
13385 enum ada_exception_catchpoint_kind ex_kind
,
13386 char *excep_string
,
13392 const char *addr_string
= NULL
;
13393 const struct breakpoint_ops
*ops
= NULL
;
13394 struct symtab_and_line sal
13395 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
13397 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint ());
13398 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
,
13399 ops
, tempflag
, disabled
, from_tty
);
13400 c
->excep_string
= excep_string
;
13401 create_excep_cond_exprs (c
.get (), ex_kind
);
13402 if (cond_string
!= NULL
)
13403 set_breakpoint_condition (c
.get (), cond_string
, from_tty
);
13404 install_breakpoint (0, std::move (c
), 1);
13407 /* Implement the "catch exception" command. */
13410 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
13411 struct cmd_list_element
*command
)
13413 const char *arg
= arg_entry
;
13414 struct gdbarch
*gdbarch
= get_current_arch ();
13416 enum ada_exception_catchpoint_kind ex_kind
;
13417 char *excep_string
= NULL
;
13418 char *cond_string
= NULL
;
13420 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13424 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
13426 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
13427 excep_string
, cond_string
,
13428 tempflag
, 1 /* enabled */,
13432 /* Implement the "catch handlers" command. */
13435 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
13436 struct cmd_list_element
*command
)
13438 const char *arg
= arg_entry
;
13439 struct gdbarch
*gdbarch
= get_current_arch ();
13441 enum ada_exception_catchpoint_kind ex_kind
;
13442 char *excep_string
= NULL
;
13443 char *cond_string
= NULL
;
13445 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13449 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
13451 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
13452 excep_string
, cond_string
,
13453 tempflag
, 1 /* enabled */,
13457 /* Split the arguments specified in a "catch assert" command.
13459 ARGS contains the command's arguments (or the empty string if
13460 no arguments were passed).
13462 If ARGS contains a condition, set COND_STRING to that condition
13463 (the memory needs to be deallocated after use). */
13466 catch_ada_assert_command_split (const char *args
, char **cond_string
)
13468 args
= skip_spaces (args
);
13470 /* Check whether a condition was provided. */
13471 if (startswith (args
, "if")
13472 && (isspace (args
[2]) || args
[2] == '\0'))
13475 args
= skip_spaces (args
);
13476 if (args
[0] == '\0')
13477 error (_("condition missing after `if' keyword"));
13478 *cond_string
= xstrdup (args
);
13481 /* Otherwise, there should be no other argument at the end of
13483 else if (args
[0] != '\0')
13484 error (_("Junk at end of arguments."));
13487 /* Implement the "catch assert" command. */
13490 catch_assert_command (const char *arg_entry
, int from_tty
,
13491 struct cmd_list_element
*command
)
13493 const char *arg
= arg_entry
;
13494 struct gdbarch
*gdbarch
= get_current_arch ();
13496 char *cond_string
= NULL
;
13498 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13502 catch_ada_assert_command_split (arg
, &cond_string
);
13503 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
13505 tempflag
, 1 /* enabled */,
13509 /* Return non-zero if the symbol SYM is an Ada exception object. */
13512 ada_is_exception_sym (struct symbol
*sym
)
13514 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
13516 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
13517 && SYMBOL_CLASS (sym
) != LOC_BLOCK
13518 && SYMBOL_CLASS (sym
) != LOC_CONST
13519 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
13520 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
13523 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13524 Ada exception object. This matches all exceptions except the ones
13525 defined by the Ada language. */
13528 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13532 if (!ada_is_exception_sym (sym
))
13535 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13536 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
13537 return 0; /* A standard exception. */
13539 /* Numeric_Error is also a standard exception, so exclude it.
13540 See the STANDARD_EXC description for more details as to why
13541 this exception is not listed in that array. */
13542 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
13548 /* A helper function for std::sort, comparing two struct ada_exc_info
13551 The comparison is determined first by exception name, and then
13552 by exception address. */
13555 ada_exc_info::operator< (const ada_exc_info
&other
) const
13559 result
= strcmp (name
, other
.name
);
13562 if (result
== 0 && addr
< other
.addr
)
13568 ada_exc_info::operator== (const ada_exc_info
&other
) const
13570 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
13573 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13574 routine, but keeping the first SKIP elements untouched.
13576 All duplicates are also removed. */
13579 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
13582 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
13583 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
13584 exceptions
->end ());
13587 /* Add all exceptions defined by the Ada standard whose name match
13588 a regular expression.
13590 If PREG is not NULL, then this regexp_t object is used to
13591 perform the symbol name matching. Otherwise, no name-based
13592 filtering is performed.
13594 EXCEPTIONS is a vector of exceptions to which matching exceptions
13598 ada_add_standard_exceptions (compiled_regex
*preg
,
13599 std::vector
<ada_exc_info
> *exceptions
)
13603 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13606 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
13608 struct bound_minimal_symbol msymbol
13609 = ada_lookup_simple_minsym (standard_exc
[i
]);
13611 if (msymbol
.minsym
!= NULL
)
13613 struct ada_exc_info info
13614 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13616 exceptions
->push_back (info
);
13622 /* Add all Ada exceptions defined locally and accessible from the given
13625 If PREG is not NULL, then this regexp_t object is used to
13626 perform the symbol name matching. Otherwise, no name-based
13627 filtering is performed.
13629 EXCEPTIONS is a vector of exceptions to which matching exceptions
13633 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13634 struct frame_info
*frame
,
13635 std::vector
<ada_exc_info
> *exceptions
)
13637 const struct block
*block
= get_frame_block (frame
, 0);
13641 struct block_iterator iter
;
13642 struct symbol
*sym
;
13644 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13646 switch (SYMBOL_CLASS (sym
))
13653 if (ada_is_exception_sym (sym
))
13655 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
13656 SYMBOL_VALUE_ADDRESS (sym
)};
13658 exceptions
->push_back (info
);
13662 if (BLOCK_FUNCTION (block
) != NULL
)
13664 block
= BLOCK_SUPERBLOCK (block
);
13668 /* Return true if NAME matches PREG or if PREG is NULL. */
13671 name_matches_regex (const char *name
, compiled_regex
*preg
)
13673 return (preg
== NULL
13674 || preg
->exec (ada_decode (name
), 0, NULL
, 0) == 0);
13677 /* Add all exceptions defined globally whose name name match
13678 a regular expression, excluding standard exceptions.
13680 The reason we exclude standard exceptions is that they need
13681 to be handled separately: Standard exceptions are defined inside
13682 a runtime unit which is normally not compiled with debugging info,
13683 and thus usually do not show up in our symbol search. However,
13684 if the unit was in fact built with debugging info, we need to
13685 exclude them because they would duplicate the entry we found
13686 during the special loop that specifically searches for those
13687 standard exceptions.
13689 If PREG is not NULL, then this regexp_t object is used to
13690 perform the symbol name matching. Otherwise, no name-based
13691 filtering is performed.
13693 EXCEPTIONS is a vector of exceptions to which matching exceptions
13697 ada_add_global_exceptions (compiled_regex
*preg
,
13698 std::vector
<ada_exc_info
> *exceptions
)
13700 struct objfile
*objfile
;
13701 struct compunit_symtab
*s
;
13703 /* In Ada, the symbol "search name" is a linkage name, whereas the
13704 regular expression used to do the matching refers to the natural
13705 name. So match against the decoded name. */
13706 expand_symtabs_matching (NULL
,
13707 lookup_name_info::match_any (),
13708 [&] (const char *search_name
)
13710 const char *decoded
= ada_decode (search_name
);
13711 return name_matches_regex (decoded
, preg
);
13716 ALL_COMPUNITS (objfile
, s
)
13718 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13721 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13723 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13724 struct block_iterator iter
;
13725 struct symbol
*sym
;
13727 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13728 if (ada_is_non_standard_exception_sym (sym
)
13729 && name_matches_regex (SYMBOL_NATURAL_NAME (sym
), preg
))
13731 struct ada_exc_info info
13732 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
13734 exceptions
->push_back (info
);
13740 /* Implements ada_exceptions_list with the regular expression passed
13741 as a regex_t, rather than a string.
13743 If not NULL, PREG is used to filter out exceptions whose names
13744 do not match. Otherwise, all exceptions are listed. */
13746 static std::vector
<ada_exc_info
>
13747 ada_exceptions_list_1 (compiled_regex
*preg
)
13749 std::vector
<ada_exc_info
> result
;
13752 /* First, list the known standard exceptions. These exceptions
13753 need to be handled separately, as they are usually defined in
13754 runtime units that have been compiled without debugging info. */
13756 ada_add_standard_exceptions (preg
, &result
);
13758 /* Next, find all exceptions whose scope is local and accessible
13759 from the currently selected frame. */
13761 if (has_stack_frames ())
13763 prev_len
= result
.size ();
13764 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13766 if (result
.size () > prev_len
)
13767 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13770 /* Add all exceptions whose scope is global. */
13772 prev_len
= result
.size ();
13773 ada_add_global_exceptions (preg
, &result
);
13774 if (result
.size () > prev_len
)
13775 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13780 /* Return a vector of ada_exc_info.
13782 If REGEXP is NULL, all exceptions are included in the result.
13783 Otherwise, it should contain a valid regular expression,
13784 and only the exceptions whose names match that regular expression
13785 are included in the result.
13787 The exceptions are sorted in the following order:
13788 - Standard exceptions (defined by the Ada language), in
13789 alphabetical order;
13790 - Exceptions only visible from the current frame, in
13791 alphabetical order;
13792 - Exceptions whose scope is global, in alphabetical order. */
13794 std::vector
<ada_exc_info
>
13795 ada_exceptions_list (const char *regexp
)
13797 if (regexp
== NULL
)
13798 return ada_exceptions_list_1 (NULL
);
13800 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13801 return ada_exceptions_list_1 (®
);
13804 /* Implement the "info exceptions" command. */
13807 info_exceptions_command (const char *regexp
, int from_tty
)
13809 struct gdbarch
*gdbarch
= get_current_arch ();
13811 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13813 if (regexp
!= NULL
)
13815 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13817 printf_filtered (_("All defined Ada exceptions:\n"));
13819 for (const ada_exc_info
&info
: exceptions
)
13820 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13824 /* Information about operators given special treatment in functions
13826 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13828 #define ADA_OPERATORS \
13829 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13830 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13831 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13832 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13833 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13834 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13835 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13836 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13837 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13838 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13839 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13840 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13841 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13842 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13843 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13844 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13845 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13846 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13847 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13850 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13853 switch (exp
->elts
[pc
- 1].opcode
)
13856 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13859 #define OP_DEFN(op, len, args, binop) \
13860 case op: *oplenp = len; *argsp = args; break;
13866 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13871 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13876 /* Implementation of the exp_descriptor method operator_check. */
13879 ada_operator_check (struct expression
*exp
, int pos
,
13880 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13883 const union exp_element
*const elts
= exp
->elts
;
13884 struct type
*type
= NULL
;
13886 switch (elts
[pos
].opcode
)
13888 case UNOP_IN_RANGE
:
13890 type
= elts
[pos
+ 1].type
;
13894 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13897 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13899 if (type
&& TYPE_OBJFILE (type
)
13900 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13906 static const char *
13907 ada_op_name (enum exp_opcode opcode
)
13912 return op_name_standard (opcode
);
13914 #define OP_DEFN(op, len, args, binop) case op: return #op;
13919 return "OP_AGGREGATE";
13921 return "OP_CHOICES";
13927 /* As for operator_length, but assumes PC is pointing at the first
13928 element of the operator, and gives meaningful results only for the
13929 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13932 ada_forward_operator_length (struct expression
*exp
, int pc
,
13933 int *oplenp
, int *argsp
)
13935 switch (exp
->elts
[pc
].opcode
)
13938 *oplenp
= *argsp
= 0;
13941 #define OP_DEFN(op, len, args, binop) \
13942 case op: *oplenp = len; *argsp = args; break;
13948 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13953 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13959 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13961 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13969 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13971 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13976 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13980 /* Ada attributes ('Foo). */
13983 case OP_ATR_LENGTH
:
13987 case OP_ATR_MODULUS
:
13994 case UNOP_IN_RANGE
:
13996 /* XXX: gdb_sprint_host_address, type_sprint */
13997 fprintf_filtered (stream
, _("Type @"));
13998 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13999 fprintf_filtered (stream
, " (");
14000 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
14001 fprintf_filtered (stream
, ")");
14003 case BINOP_IN_BOUNDS
:
14004 fprintf_filtered (stream
, " (%d)",
14005 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
14007 case TERNOP_IN_RANGE
:
14012 case OP_DISCRETE_RANGE
:
14013 case OP_POSITIONAL
:
14020 char *name
= &exp
->elts
[elt
+ 2].string
;
14021 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
14023 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
14028 return dump_subexp_body_standard (exp
, stream
, elt
);
14032 for (i
= 0; i
< nargs
; i
+= 1)
14033 elt
= dump_subexp (exp
, stream
, elt
);
14038 /* The Ada extension of print_subexp (q.v.). */
14041 ada_print_subexp (struct expression
*exp
, int *pos
,
14042 struct ui_file
*stream
, enum precedence prec
)
14044 int oplen
, nargs
, i
;
14046 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
14048 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
14055 print_subexp_standard (exp
, pos
, stream
, prec
);
14059 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
14062 case BINOP_IN_BOUNDS
:
14063 /* XXX: sprint_subexp */
14064 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14065 fputs_filtered (" in ", stream
);
14066 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14067 fputs_filtered ("'range", stream
);
14068 if (exp
->elts
[pc
+ 1].longconst
> 1)
14069 fprintf_filtered (stream
, "(%ld)",
14070 (long) exp
->elts
[pc
+ 1].longconst
);
14073 case TERNOP_IN_RANGE
:
14074 if (prec
>= PREC_EQUAL
)
14075 fputs_filtered ("(", stream
);
14076 /* XXX: sprint_subexp */
14077 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14078 fputs_filtered (" in ", stream
);
14079 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
14080 fputs_filtered (" .. ", stream
);
14081 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
14082 if (prec
>= PREC_EQUAL
)
14083 fputs_filtered (")", stream
);
14088 case OP_ATR_LENGTH
:
14092 case OP_ATR_MODULUS
:
14097 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
14099 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
14100 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
14101 &type_print_raw_options
);
14105 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14106 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
14111 for (tem
= 1; tem
< nargs
; tem
+= 1)
14113 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
14114 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
14116 fputs_filtered (")", stream
);
14121 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
14122 fputs_filtered ("'(", stream
);
14123 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
14124 fputs_filtered (")", stream
);
14127 case UNOP_IN_RANGE
:
14128 /* XXX: sprint_subexp */
14129 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14130 fputs_filtered (" in ", stream
);
14131 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
14132 &type_print_raw_options
);
14135 case OP_DISCRETE_RANGE
:
14136 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14137 fputs_filtered ("..", stream
);
14138 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14142 fputs_filtered ("others => ", stream
);
14143 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14147 for (i
= 0; i
< nargs
-1; i
+= 1)
14150 fputs_filtered ("|", stream
);
14151 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14153 fputs_filtered (" => ", stream
);
14154 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14157 case OP_POSITIONAL
:
14158 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14162 fputs_filtered ("(", stream
);
14163 for (i
= 0; i
< nargs
; i
+= 1)
14166 fputs_filtered (", ", stream
);
14167 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
14169 fputs_filtered (")", stream
);
14174 /* Table mapping opcodes into strings for printing operators
14175 and precedences of the operators. */
14177 static const struct op_print ada_op_print_tab
[] = {
14178 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
14179 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
14180 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
14181 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
14182 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
14183 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
14184 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
14185 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
14186 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
14187 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
14188 {">", BINOP_GTR
, PREC_ORDER
, 0},
14189 {"<", BINOP_LESS
, PREC_ORDER
, 0},
14190 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
14191 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
14192 {"+", BINOP_ADD
, PREC_ADD
, 0},
14193 {"-", BINOP_SUB
, PREC_ADD
, 0},
14194 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
14195 {"*", BINOP_MUL
, PREC_MUL
, 0},
14196 {"/", BINOP_DIV
, PREC_MUL
, 0},
14197 {"rem", BINOP_REM
, PREC_MUL
, 0},
14198 {"mod", BINOP_MOD
, PREC_MUL
, 0},
14199 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
14200 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
14201 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
14202 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
14203 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
14204 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
14205 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
14206 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
14207 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
14208 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
14209 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
14212 enum ada_primitive_types
{
14213 ada_primitive_type_int
,
14214 ada_primitive_type_long
,
14215 ada_primitive_type_short
,
14216 ada_primitive_type_char
,
14217 ada_primitive_type_float
,
14218 ada_primitive_type_double
,
14219 ada_primitive_type_void
,
14220 ada_primitive_type_long_long
,
14221 ada_primitive_type_long_double
,
14222 ada_primitive_type_natural
,
14223 ada_primitive_type_positive
,
14224 ada_primitive_type_system_address
,
14225 ada_primitive_type_storage_offset
,
14226 nr_ada_primitive_types
14230 ada_language_arch_info (struct gdbarch
*gdbarch
,
14231 struct language_arch_info
*lai
)
14233 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
14235 lai
->primitive_type_vector
14236 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
14239 lai
->primitive_type_vector
[ada_primitive_type_int
]
14240 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
14242 lai
->primitive_type_vector
[ada_primitive_type_long
]
14243 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
14244 0, "long_integer");
14245 lai
->primitive_type_vector
[ada_primitive_type_short
]
14246 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
14247 0, "short_integer");
14248 lai
->string_char_type
14249 = lai
->primitive_type_vector
[ada_primitive_type_char
]
14250 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
14251 lai
->primitive_type_vector
[ada_primitive_type_float
]
14252 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
14253 "float", gdbarch_float_format (gdbarch
));
14254 lai
->primitive_type_vector
[ada_primitive_type_double
]
14255 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
14256 "long_float", gdbarch_double_format (gdbarch
));
14257 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
14258 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
14259 0, "long_long_integer");
14260 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
14261 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
14262 "long_long_float", gdbarch_long_double_format (gdbarch
));
14263 lai
->primitive_type_vector
[ada_primitive_type_natural
]
14264 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
14266 lai
->primitive_type_vector
[ada_primitive_type_positive
]
14267 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
14269 lai
->primitive_type_vector
[ada_primitive_type_void
]
14270 = builtin
->builtin_void
;
14272 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
14273 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
14275 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
14276 = "system__address";
14278 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
14279 type. This is a signed integral type whose size is the same as
14280 the size of addresses. */
14282 unsigned int addr_length
= TYPE_LENGTH
14283 (lai
->primitive_type_vector
[ada_primitive_type_system_address
]);
14285 lai
->primitive_type_vector
[ada_primitive_type_storage_offset
]
14286 = arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
14290 lai
->bool_type_symbol
= NULL
;
14291 lai
->bool_type_default
= builtin
->builtin_bool
;
14294 /* Language vector */
14296 /* Not really used, but needed in the ada_language_defn. */
14299 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
14301 ada_emit_char (c
, type
, stream
, quoter
, 1);
14305 parse (struct parser_state
*ps
)
14307 warnings_issued
= 0;
14308 return ada_parse (ps
);
14311 static const struct exp_descriptor ada_exp_descriptor
= {
14313 ada_operator_length
,
14314 ada_operator_check
,
14316 ada_dump_subexp_body
,
14317 ada_evaluate_subexp
14320 /* symbol_name_matcher_ftype adapter for wild_match. */
14323 do_wild_match (const char *symbol_search_name
,
14324 const lookup_name_info
&lookup_name
,
14325 completion_match_result
*comp_match_res
)
14327 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
14330 /* symbol_name_matcher_ftype adapter for full_match. */
14333 do_full_match (const char *symbol_search_name
,
14334 const lookup_name_info
&lookup_name
,
14335 completion_match_result
*comp_match_res
)
14337 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
14340 /* Build the Ada lookup name for LOOKUP_NAME. */
14342 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
14344 const std::string
&user_name
= lookup_name
.name ();
14346 if (user_name
[0] == '<')
14348 if (user_name
.back () == '>')
14349 m_encoded_name
= user_name
.substr (1, user_name
.size () - 2);
14351 m_encoded_name
= user_name
.substr (1, user_name
.size () - 1);
14352 m_encoded_p
= true;
14353 m_verbatim_p
= true;
14354 m_wild_match_p
= false;
14355 m_standard_p
= false;
14359 m_verbatim_p
= false;
14361 m_encoded_p
= user_name
.find ("__") != std::string::npos
;
14365 const char *folded
= ada_fold_name (user_name
.c_str ());
14366 const char *encoded
= ada_encode_1 (folded
, false);
14367 if (encoded
!= NULL
)
14368 m_encoded_name
= encoded
;
14370 m_encoded_name
= user_name
;
14373 m_encoded_name
= user_name
;
14375 /* Handle the 'package Standard' special case. See description
14376 of m_standard_p. */
14377 if (startswith (m_encoded_name
.c_str (), "standard__"))
14379 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
14380 m_standard_p
= true;
14383 m_standard_p
= false;
14385 /* If the name contains a ".", then the user is entering a fully
14386 qualified entity name, and the match must not be done in wild
14387 mode. Similarly, if the user wants to complete what looks
14388 like an encoded name, the match must not be done in wild
14389 mode. Also, in the standard__ special case always do
14390 non-wild matching. */
14392 = (lookup_name
.match_type () != symbol_name_match_type::FULL
14395 && user_name
.find ('.') == std::string::npos
);
14399 /* symbol_name_matcher_ftype method for Ada. This only handles
14400 completion mode. */
14403 ada_symbol_name_matches (const char *symbol_search_name
,
14404 const lookup_name_info
&lookup_name
,
14405 completion_match_result
*comp_match_res
)
14407 return lookup_name
.ada ().matches (symbol_search_name
,
14408 lookup_name
.match_type (),
14412 /* Implement the "la_get_symbol_name_matcher" language_defn method for
14415 static symbol_name_matcher_ftype
*
14416 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
14418 if (lookup_name
.completion_mode ())
14419 return ada_symbol_name_matches
;
14422 if (lookup_name
.ada ().wild_match_p ())
14423 return do_wild_match
;
14425 return do_full_match
;
14429 /* Implement the "la_read_var_value" language_defn method for Ada. */
14431 static struct value
*
14432 ada_read_var_value (struct symbol
*var
, const struct block
*var_block
,
14433 struct frame_info
*frame
)
14435 const struct block
*frame_block
= NULL
;
14436 struct symbol
*renaming_sym
= NULL
;
14438 /* The only case where default_read_var_value is not sufficient
14439 is when VAR is a renaming... */
14441 frame_block
= get_frame_block (frame
, NULL
);
14443 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
14444 if (renaming_sym
!= NULL
)
14445 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
14447 /* This is a typical case where we expect the default_read_var_value
14448 function to work. */
14449 return default_read_var_value (var
, var_block
, frame
);
14452 static const char *ada_extensions
[] =
14454 ".adb", ".ads", ".a", ".ada", ".dg", NULL
14457 extern const struct language_defn ada_language_defn
= {
14458 "ada", /* Language name */
14462 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
14463 that's not quite what this means. */
14465 macro_expansion_no
,
14467 &ada_exp_descriptor
,
14471 ada_printchar
, /* Print a character constant */
14472 ada_printstr
, /* Function to print string constant */
14473 emit_char
, /* Function to print single char (not used) */
14474 ada_print_type
, /* Print a type using appropriate syntax */
14475 ada_print_typedef
, /* Print a typedef using appropriate syntax */
14476 ada_val_print
, /* Print a value using appropriate syntax */
14477 ada_value_print
, /* Print a top-level value */
14478 ada_read_var_value
, /* la_read_var_value */
14479 NULL
, /* Language specific skip_trampoline */
14480 NULL
, /* name_of_this */
14481 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
14482 basic_lookup_transparent_type
, /* lookup_transparent_type */
14483 ada_la_decode
, /* Language specific symbol demangler */
14484 ada_sniff_from_mangled_name
,
14485 NULL
, /* Language specific
14486 class_name_from_physname */
14487 ada_op_print_tab
, /* expression operators for printing */
14488 0, /* c-style arrays */
14489 1, /* String lower bound */
14490 ada_get_gdb_completer_word_break_characters
,
14491 ada_collect_symbol_completion_matches
,
14492 ada_language_arch_info
,
14493 ada_print_array_index
,
14494 default_pass_by_reference
,
14496 c_watch_location_expression
,
14497 ada_get_symbol_name_matcher
, /* la_get_symbol_name_matcher */
14498 ada_iterate_over_symbols
,
14499 default_search_name_hash
,
14506 /* Command-list for the "set/show ada" prefix command. */
14507 static struct cmd_list_element
*set_ada_list
;
14508 static struct cmd_list_element
*show_ada_list
;
14510 /* Implement the "set ada" prefix command. */
14513 set_ada_command (const char *arg
, int from_tty
)
14515 printf_unfiltered (_(\
14516 "\"set ada\" must be followed by the name of a setting.\n"));
14517 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
14520 /* Implement the "show ada" prefix command. */
14523 show_ada_command (const char *args
, int from_tty
)
14525 cmd_show_list (show_ada_list
, from_tty
, "");
14529 initialize_ada_catchpoint_ops (void)
14531 struct breakpoint_ops
*ops
;
14533 initialize_breakpoint_ops ();
14535 ops
= &catch_exception_breakpoint_ops
;
14536 *ops
= bkpt_breakpoint_ops
;
14537 ops
->allocate_location
= allocate_location_catch_exception
;
14538 ops
->re_set
= re_set_catch_exception
;
14539 ops
->check_status
= check_status_catch_exception
;
14540 ops
->print_it
= print_it_catch_exception
;
14541 ops
->print_one
= print_one_catch_exception
;
14542 ops
->print_mention
= print_mention_catch_exception
;
14543 ops
->print_recreate
= print_recreate_catch_exception
;
14545 ops
= &catch_exception_unhandled_breakpoint_ops
;
14546 *ops
= bkpt_breakpoint_ops
;
14547 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
14548 ops
->re_set
= re_set_catch_exception_unhandled
;
14549 ops
->check_status
= check_status_catch_exception_unhandled
;
14550 ops
->print_it
= print_it_catch_exception_unhandled
;
14551 ops
->print_one
= print_one_catch_exception_unhandled
;
14552 ops
->print_mention
= print_mention_catch_exception_unhandled
;
14553 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
14555 ops
= &catch_assert_breakpoint_ops
;
14556 *ops
= bkpt_breakpoint_ops
;
14557 ops
->allocate_location
= allocate_location_catch_assert
;
14558 ops
->re_set
= re_set_catch_assert
;
14559 ops
->check_status
= check_status_catch_assert
;
14560 ops
->print_it
= print_it_catch_assert
;
14561 ops
->print_one
= print_one_catch_assert
;
14562 ops
->print_mention
= print_mention_catch_assert
;
14563 ops
->print_recreate
= print_recreate_catch_assert
;
14565 ops
= &catch_handlers_breakpoint_ops
;
14566 *ops
= bkpt_breakpoint_ops
;
14567 ops
->allocate_location
= allocate_location_catch_handlers
;
14568 ops
->re_set
= re_set_catch_handlers
;
14569 ops
->check_status
= check_status_catch_handlers
;
14570 ops
->print_it
= print_it_catch_handlers
;
14571 ops
->print_one
= print_one_catch_handlers
;
14572 ops
->print_mention
= print_mention_catch_handlers
;
14573 ops
->print_recreate
= print_recreate_catch_handlers
;
14576 /* This module's 'new_objfile' observer. */
14579 ada_new_objfile_observer (struct objfile
*objfile
)
14581 ada_clear_symbol_cache ();
14584 /* This module's 'free_objfile' observer. */
14587 ada_free_objfile_observer (struct objfile
*objfile
)
14589 ada_clear_symbol_cache ();
14593 _initialize_ada_language (void)
14595 initialize_ada_catchpoint_ops ();
14597 add_prefix_cmd ("ada", no_class
, set_ada_command
,
14598 _("Prefix command for changing Ada-specfic settings"),
14599 &set_ada_list
, "set ada ", 0, &setlist
);
14601 add_prefix_cmd ("ada", no_class
, show_ada_command
,
14602 _("Generic command for showing Ada-specific settings."),
14603 &show_ada_list
, "show ada ", 0, &showlist
);
14605 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14606 &trust_pad_over_xvs
, _("\
14607 Enable or disable an optimization trusting PAD types over XVS types"), _("\
14608 Show whether an optimization trusting PAD types over XVS types is activated"),
14610 This is related to the encoding used by the GNAT compiler. The debugger\n\
14611 should normally trust the contents of PAD types, but certain older versions\n\
14612 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14613 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14614 work around this bug. It is always safe to turn this option \"off\", but\n\
14615 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14616 this option to \"off\" unless necessary."),
14617 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14619 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14620 &print_signatures
, _("\
14621 Enable or disable the output of formal and return types for functions in the \
14622 overloads selection menu"), _("\
14623 Show whether the output of formal and return types for functions in the \
14624 overloads selection menu is activated"),
14625 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14627 add_catch_command ("exception", _("\
14628 Catch Ada exceptions, when raised.\n\
14629 With an argument, catch only exceptions with the given name."),
14630 catch_ada_exception_command
,
14635 add_catch_command ("handlers", _("\
14636 Catch Ada exceptions, when handled.\n\
14637 With an argument, catch only exceptions with the given name."),
14638 catch_ada_handlers_command
,
14642 add_catch_command ("assert", _("\
14643 Catch failed Ada assertions, when raised.\n\
14644 With an argument, catch only exceptions with the given name."),
14645 catch_assert_command
,
14650 varsize_limit
= 65536;
14652 add_info ("exceptions", info_exceptions_command
,
14654 List all Ada exception names.\n\
14655 If a regular expression is passed as an argument, only those matching\n\
14656 the regular expression are listed."));
14658 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
14659 _("Set Ada maintenance-related variables."),
14660 &maint_set_ada_cmdlist
, "maintenance set ada ",
14661 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14663 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
14664 _("Show Ada maintenance-related variables"),
14665 &maint_show_ada_cmdlist
, "maintenance show ada ",
14666 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14668 add_setshow_boolean_cmd
14669 ("ignore-descriptive-types", class_maintenance
,
14670 &ada_ignore_descriptive_types_p
,
14671 _("Set whether descriptive types generated by GNAT should be ignored."),
14672 _("Show whether descriptive types generated by GNAT should be ignored."),
14674 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14675 DWARF attribute."),
14676 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14678 decoded_names_store
= htab_create_alloc
14679 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
14680 NULL
, xcalloc
, xfree
);
14682 /* The ada-lang observers. */
14683 observer_attach_new_objfile (ada_new_objfile_observer
);
14684 observer_attach_free_objfile (ada_free_objfile_observer
);
14685 observer_attach_inferior_exit (ada_inferior_exit
);
14687 /* Setup various context-specific data. */
14689 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
14690 ada_pspace_data_handle
14691 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);