1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2015 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"
59 #include "mi/mi-common.h"
60 #include "arch-utils.h"
61 #include "cli/cli-utils.h"
63 /* Define whether or not the C operator '/' truncates towards zero for
64 differently signed operands (truncation direction is undefined in C).
65 Copied from valarith.c. */
67 #ifndef TRUNCATION_TOWARDS_ZERO
68 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
71 static struct type
*desc_base_type (struct type
*);
73 static struct type
*desc_bounds_type (struct type
*);
75 static struct value
*desc_bounds (struct value
*);
77 static int fat_pntr_bounds_bitpos (struct type
*);
79 static int fat_pntr_bounds_bitsize (struct type
*);
81 static struct type
*desc_data_target_type (struct type
*);
83 static struct value
*desc_data (struct value
*);
85 static int fat_pntr_data_bitpos (struct type
*);
87 static int fat_pntr_data_bitsize (struct type
*);
89 static struct value
*desc_one_bound (struct value
*, int, int);
91 static int desc_bound_bitpos (struct type
*, int, int);
93 static int desc_bound_bitsize (struct type
*, int, int);
95 static struct type
*desc_index_type (struct type
*, int);
97 static int desc_arity (struct type
*);
99 static int ada_type_match (struct type
*, struct type
*, int);
101 static int ada_args_match (struct symbol
*, struct value
**, int);
103 static int full_match (const char *, const char *);
105 static struct value
*make_array_descriptor (struct type
*, struct value
*);
107 static void ada_add_block_symbols (struct obstack
*,
108 const struct block
*, const char *,
109 domain_enum
, struct objfile
*, int);
111 static int is_nonfunction (struct ada_symbol_info
*, int);
113 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
114 const struct block
*);
116 static int num_defns_collected (struct obstack
*);
118 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
120 static struct value
*resolve_subexp (struct expression
**, int *, int,
123 static void replace_operator_with_call (struct expression
**, int, int, int,
124 struct symbol
*, const struct block
*);
126 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
128 static char *ada_op_name (enum exp_opcode
);
130 static const char *ada_decoded_op_name (enum exp_opcode
);
132 static int numeric_type_p (struct type
*);
134 static int integer_type_p (struct type
*);
136 static int scalar_type_p (struct type
*);
138 static int discrete_type_p (struct type
*);
140 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
145 static struct symbol
*find_old_style_renaming_symbol (const char *,
146 const struct block
*);
148 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
151 static struct value
*evaluate_subexp_type (struct expression
*, int *);
153 static struct type
*ada_find_parallel_type_with_name (struct type
*,
156 static int is_dynamic_field (struct type
*, int);
158 static struct type
*to_fixed_variant_branch_type (struct type
*,
160 CORE_ADDR
, struct value
*);
162 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
164 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
166 static struct type
*to_static_fixed_type (struct type
*);
167 static struct type
*static_unwrap_type (struct type
*type
);
169 static struct value
*unwrap_value (struct value
*);
171 static struct type
*constrained_packed_array_type (struct type
*, long *);
173 static struct type
*decode_constrained_packed_array_type (struct type
*);
175 static long decode_packed_array_bitsize (struct type
*);
177 static struct value
*decode_constrained_packed_array (struct value
*);
179 static int ada_is_packed_array_type (struct type
*);
181 static int ada_is_unconstrained_packed_array_type (struct type
*);
183 static struct value
*value_subscript_packed (struct value
*, int,
186 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
188 static struct value
*coerce_unspec_val_to_type (struct value
*,
191 static struct value
*get_var_value (char *, char *);
193 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
195 static int equiv_types (struct type
*, struct type
*);
197 static int is_name_suffix (const char *);
199 static int advance_wild_match (const char **, const char *, int);
201 static int wild_match (const char *, const char *);
203 static struct value
*ada_coerce_ref (struct value
*);
205 static LONGEST
pos_atr (struct value
*);
207 static struct value
*value_pos_atr (struct type
*, struct value
*);
209 static struct value
*value_val_atr (struct type
*, struct value
*);
211 static struct symbol
*standard_lookup (const char *, const struct block
*,
214 static struct value
*ada_search_struct_field (char *, struct value
*, int,
217 static struct value
*ada_value_primitive_field (struct value
*, int, int,
220 static int find_struct_field (const char *, struct type
*, int,
221 struct type
**, int *, int *, int *, int *);
223 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
226 static int ada_resolve_function (struct ada_symbol_info
*, int,
227 struct value
**, int, const char *,
230 static int ada_is_direct_array_type (struct type
*);
232 static void ada_language_arch_info (struct gdbarch
*,
233 struct language_arch_info
*);
235 static struct value
*ada_index_struct_field (int, struct value
*, int,
238 static struct value
*assign_aggregate (struct value
*, struct value
*,
242 static void aggregate_assign_from_choices (struct value
*, struct value
*,
244 int *, LONGEST
*, int *,
245 int, LONGEST
, LONGEST
);
247 static void aggregate_assign_positional (struct value
*, struct value
*,
249 int *, LONGEST
*, int *, int,
253 static void aggregate_assign_others (struct value
*, struct value
*,
255 int *, LONGEST
*, int, LONGEST
, LONGEST
);
258 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
261 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
264 static void ada_forward_operator_length (struct expression
*, int, int *,
267 static struct type
*ada_find_any_type (const char *name
);
270 /* The result of a symbol lookup to be stored in our symbol cache. */
274 /* The name used to perform the lookup. */
276 /* The namespace used during the lookup. */
278 /* The symbol returned by the lookup, or NULL if no matching symbol
281 /* The block where the symbol was found, or NULL if no matching
283 const struct block
*block
;
284 /* A pointer to the next entry with the same hash. */
285 struct cache_entry
*next
;
288 /* The Ada symbol cache, used to store the result of Ada-mode symbol
289 lookups in the course of executing the user's commands.
291 The cache is implemented using a simple, fixed-sized hash.
292 The size is fixed on the grounds that there are not likely to be
293 all that many symbols looked up during any given session, regardless
294 of the size of the symbol table. If we decide to go to a resizable
295 table, let's just use the stuff from libiberty instead. */
297 #define HASH_SIZE 1009
299 struct ada_symbol_cache
301 /* An obstack used to store the entries in our cache. */
302 struct obstack cache_space
;
304 /* The root of the hash table used to implement our symbol cache. */
305 struct cache_entry
*root
[HASH_SIZE
];
308 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
310 /* Maximum-sized dynamic type. */
311 static unsigned int varsize_limit
;
313 /* FIXME: brobecker/2003-09-17: No longer a const because it is
314 returned by a function that does not return a const char *. */
315 static char *ada_completer_word_break_characters
=
317 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
319 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
322 /* The name of the symbol to use to get the name of the main subprogram. */
323 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
324 = "__gnat_ada_main_program_name";
326 /* Limit on the number of warnings to raise per expression evaluation. */
327 static int warning_limit
= 2;
329 /* Number of warning messages issued; reset to 0 by cleanups after
330 expression evaluation. */
331 static int warnings_issued
= 0;
333 static const char *known_runtime_file_name_patterns
[] = {
334 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
337 static const char *known_auxiliary_function_name_patterns
[] = {
338 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
341 /* Space for allocating results of ada_lookup_symbol_list. */
342 static struct obstack symbol_list_obstack
;
344 /* Maintenance-related settings for this module. */
346 static struct cmd_list_element
*maint_set_ada_cmdlist
;
347 static struct cmd_list_element
*maint_show_ada_cmdlist
;
349 /* Implement the "maintenance set ada" (prefix) command. */
352 maint_set_ada_cmd (char *args
, int from_tty
)
354 help_list (maint_set_ada_cmdlist
, "maintenance set ada ", all_commands
,
358 /* Implement the "maintenance show ada" (prefix) command. */
361 maint_show_ada_cmd (char *args
, int from_tty
)
363 cmd_show_list (maint_show_ada_cmdlist
, from_tty
, "");
366 /* The "maintenance ada set/show ignore-descriptive-type" value. */
368 static int ada_ignore_descriptive_types_p
= 0;
370 /* Inferior-specific data. */
372 /* Per-inferior data for this module. */
374 struct ada_inferior_data
376 /* The ada__tags__type_specific_data type, which is used when decoding
377 tagged types. With older versions of GNAT, this type was directly
378 accessible through a component ("tsd") in the object tag. But this
379 is no longer the case, so we cache it for each inferior. */
380 struct type
*tsd_type
;
382 /* The exception_support_info data. This data is used to determine
383 how to implement support for Ada exception catchpoints in a given
385 const struct exception_support_info
*exception_info
;
388 /* Our key to this module's inferior data. */
389 static const struct inferior_data
*ada_inferior_data
;
391 /* A cleanup routine for our inferior data. */
393 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
395 struct ada_inferior_data
*data
;
397 data
= inferior_data (inf
, ada_inferior_data
);
402 /* Return our inferior data for the given inferior (INF).
404 This function always returns a valid pointer to an allocated
405 ada_inferior_data structure. If INF's inferior data has not
406 been previously set, this functions creates a new one with all
407 fields set to zero, sets INF's inferior to it, and then returns
408 a pointer to that newly allocated ada_inferior_data. */
410 static struct ada_inferior_data
*
411 get_ada_inferior_data (struct inferior
*inf
)
413 struct ada_inferior_data
*data
;
415 data
= inferior_data (inf
, ada_inferior_data
);
418 data
= XCNEW (struct ada_inferior_data
);
419 set_inferior_data (inf
, ada_inferior_data
, data
);
425 /* Perform all necessary cleanups regarding our module's inferior data
426 that is required after the inferior INF just exited. */
429 ada_inferior_exit (struct inferior
*inf
)
431 ada_inferior_data_cleanup (inf
, NULL
);
432 set_inferior_data (inf
, ada_inferior_data
, NULL
);
436 /* program-space-specific data. */
438 /* This module's per-program-space data. */
439 struct ada_pspace_data
441 /* The Ada symbol cache. */
442 struct ada_symbol_cache
*sym_cache
;
445 /* Key to our per-program-space data. */
446 static const struct program_space_data
*ada_pspace_data_handle
;
448 /* Return this module's data for the given program space (PSPACE).
449 If not is found, add a zero'ed one now.
451 This function always returns a valid object. */
453 static struct ada_pspace_data
*
454 get_ada_pspace_data (struct program_space
*pspace
)
456 struct ada_pspace_data
*data
;
458 data
= program_space_data (pspace
, ada_pspace_data_handle
);
461 data
= XCNEW (struct ada_pspace_data
);
462 set_program_space_data (pspace
, ada_pspace_data_handle
, data
);
468 /* The cleanup callback for this module's per-program-space data. */
471 ada_pspace_data_cleanup (struct program_space
*pspace
, void *data
)
473 struct ada_pspace_data
*pspace_data
= data
;
475 if (pspace_data
->sym_cache
!= NULL
)
476 ada_free_symbol_cache (pspace_data
->sym_cache
);
482 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
483 all typedef layers have been peeled. Otherwise, return TYPE.
485 Normally, we really expect a typedef type to only have 1 typedef layer.
486 In other words, we really expect the target type of a typedef type to be
487 a non-typedef type. This is particularly true for Ada units, because
488 the language does not have a typedef vs not-typedef distinction.
489 In that respect, the Ada compiler has been trying to eliminate as many
490 typedef definitions in the debugging information, since they generally
491 do not bring any extra information (we still use typedef under certain
492 circumstances related mostly to the GNAT encoding).
494 Unfortunately, we have seen situations where the debugging information
495 generated by the compiler leads to such multiple typedef layers. For
496 instance, consider the following example with stabs:
498 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
499 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
501 This is an error in the debugging information which causes type
502 pck__float_array___XUP to be defined twice, and the second time,
503 it is defined as a typedef of a typedef.
505 This is on the fringe of legality as far as debugging information is
506 concerned, and certainly unexpected. But it is easy to handle these
507 situations correctly, so we can afford to be lenient in this case. */
510 ada_typedef_target_type (struct type
*type
)
512 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
513 type
= TYPE_TARGET_TYPE (type
);
517 /* Given DECODED_NAME a string holding a symbol name in its
518 decoded form (ie using the Ada dotted notation), returns
519 its unqualified name. */
522 ada_unqualified_name (const char *decoded_name
)
526 /* If the decoded name starts with '<', it means that the encoded
527 name does not follow standard naming conventions, and thus that
528 it is not your typical Ada symbol name. Trying to unqualify it
529 is therefore pointless and possibly erroneous. */
530 if (decoded_name
[0] == '<')
533 result
= strrchr (decoded_name
, '.');
535 result
++; /* Skip the dot... */
537 result
= decoded_name
;
542 /* Return a string starting with '<', followed by STR, and '>'.
543 The result is good until the next call. */
546 add_angle_brackets (const char *str
)
548 static char *result
= NULL
;
551 result
= xstrprintf ("<%s>", str
);
556 ada_get_gdb_completer_word_break_characters (void)
558 return ada_completer_word_break_characters
;
561 /* Print an array element index using the Ada syntax. */
564 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
565 const struct value_print_options
*options
)
567 LA_VALUE_PRINT (index_value
, stream
, options
);
568 fprintf_filtered (stream
, " => ");
571 /* Assuming VECT points to an array of *SIZE objects of size
572 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
573 updating *SIZE as necessary and returning the (new) array. */
576 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
578 if (*size
< min_size
)
581 if (*size
< min_size
)
583 vect
= xrealloc (vect
, *size
* element_size
);
588 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
589 suffix of FIELD_NAME beginning "___". */
592 field_name_match (const char *field_name
, const char *target
)
594 int len
= strlen (target
);
597 (strncmp (field_name
, target
, len
) == 0
598 && (field_name
[len
] == '\0'
599 || (startswith (field_name
+ len
, "___")
600 && strcmp (field_name
+ strlen (field_name
) - 6,
605 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
606 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
607 and return its index. This function also handles fields whose name
608 have ___ suffixes because the compiler sometimes alters their name
609 by adding such a suffix to represent fields with certain constraints.
610 If the field could not be found, return a negative number if
611 MAYBE_MISSING is set. Otherwise raise an error. */
614 ada_get_field_index (const struct type
*type
, const char *field_name
,
618 struct type
*struct_type
= check_typedef ((struct type
*) type
);
620 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
621 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
625 error (_("Unable to find field %s in struct %s. Aborting"),
626 field_name
, TYPE_NAME (struct_type
));
631 /* The length of the prefix of NAME prior to any "___" suffix. */
634 ada_name_prefix_len (const char *name
)
640 const char *p
= strstr (name
, "___");
643 return strlen (name
);
649 /* Return non-zero if SUFFIX is a suffix of STR.
650 Return zero if STR is null. */
653 is_suffix (const char *str
, const char *suffix
)
660 len2
= strlen (suffix
);
661 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
664 /* The contents of value VAL, treated as a value of type TYPE. The
665 result is an lval in memory if VAL is. */
667 static struct value
*
668 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
670 type
= ada_check_typedef (type
);
671 if (value_type (val
) == type
)
675 struct value
*result
;
677 /* Make sure that the object size is not unreasonable before
678 trying to allocate some memory for it. */
679 ada_ensure_varsize_limit (type
);
682 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
683 result
= allocate_value_lazy (type
);
686 result
= allocate_value (type
);
687 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
689 set_value_component_location (result
, val
);
690 set_value_bitsize (result
, value_bitsize (val
));
691 set_value_bitpos (result
, value_bitpos (val
));
692 set_value_address (result
, value_address (val
));
697 static const gdb_byte
*
698 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
703 return valaddr
+ offset
;
707 cond_offset_target (CORE_ADDR address
, long offset
)
712 return address
+ offset
;
715 /* Issue a warning (as for the definition of warning in utils.c, but
716 with exactly one argument rather than ...), unless the limit on the
717 number of warnings has passed during the evaluation of the current
720 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
721 provided by "complaint". */
722 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
725 lim_warning (const char *format
, ...)
729 va_start (args
, format
);
730 warnings_issued
+= 1;
731 if (warnings_issued
<= warning_limit
)
732 vwarning (format
, args
);
737 /* Issue an error if the size of an object of type T is unreasonable,
738 i.e. if it would be a bad idea to allocate a value of this type in
742 ada_ensure_varsize_limit (const struct type
*type
)
744 if (TYPE_LENGTH (type
) > varsize_limit
)
745 error (_("object size is larger than varsize-limit"));
748 /* Maximum value of a SIZE-byte signed integer type. */
750 max_of_size (int size
)
752 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
754 return top_bit
| (top_bit
- 1);
757 /* Minimum value of a SIZE-byte signed integer type. */
759 min_of_size (int size
)
761 return -max_of_size (size
) - 1;
764 /* Maximum value of a SIZE-byte unsigned integer type. */
766 umax_of_size (int size
)
768 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
770 return top_bit
| (top_bit
- 1);
773 /* Maximum value of integral type T, as a signed quantity. */
775 max_of_type (struct type
*t
)
777 if (TYPE_UNSIGNED (t
))
778 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
780 return max_of_size (TYPE_LENGTH (t
));
783 /* Minimum value of integral type T, as a signed quantity. */
785 min_of_type (struct type
*t
)
787 if (TYPE_UNSIGNED (t
))
790 return min_of_size (TYPE_LENGTH (t
));
793 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
795 ada_discrete_type_high_bound (struct type
*type
)
797 type
= resolve_dynamic_type (type
, 0);
798 switch (TYPE_CODE (type
))
800 case TYPE_CODE_RANGE
:
801 return TYPE_HIGH_BOUND (type
);
803 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
808 return max_of_type (type
);
810 error (_("Unexpected type in ada_discrete_type_high_bound."));
814 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
816 ada_discrete_type_low_bound (struct type
*type
)
818 type
= resolve_dynamic_type (type
, 0);
819 switch (TYPE_CODE (type
))
821 case TYPE_CODE_RANGE
:
822 return TYPE_LOW_BOUND (type
);
824 return TYPE_FIELD_ENUMVAL (type
, 0);
829 return min_of_type (type
);
831 error (_("Unexpected type in ada_discrete_type_low_bound."));
835 /* The identity on non-range types. For range types, the underlying
836 non-range scalar type. */
839 get_base_type (struct type
*type
)
841 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
843 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
845 type
= TYPE_TARGET_TYPE (type
);
850 /* Return a decoded version of the given VALUE. This means returning
851 a value whose type is obtained by applying all the GNAT-specific
852 encondings, making the resulting type a static but standard description
853 of the initial type. */
856 ada_get_decoded_value (struct value
*value
)
858 struct type
*type
= ada_check_typedef (value_type (value
));
860 if (ada_is_array_descriptor_type (type
)
861 || (ada_is_constrained_packed_array_type (type
)
862 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
864 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
865 value
= ada_coerce_to_simple_array_ptr (value
);
867 value
= ada_coerce_to_simple_array (value
);
870 value
= ada_to_fixed_value (value
);
875 /* Same as ada_get_decoded_value, but with the given TYPE.
876 Because there is no associated actual value for this type,
877 the resulting type might be a best-effort approximation in
878 the case of dynamic types. */
881 ada_get_decoded_type (struct type
*type
)
883 type
= to_static_fixed_type (type
);
884 if (ada_is_constrained_packed_array_type (type
))
885 type
= ada_coerce_to_simple_array_type (type
);
891 /* Language Selection */
893 /* If the main program is in Ada, return language_ada, otherwise return LANG
894 (the main program is in Ada iif the adainit symbol is found). */
897 ada_update_initial_language (enum language lang
)
899 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
900 (struct objfile
*) NULL
).minsym
!= NULL
)
906 /* If the main procedure is written in Ada, then return its name.
907 The result is good until the next call. Return NULL if the main
908 procedure doesn't appear to be in Ada. */
913 struct bound_minimal_symbol msym
;
914 static char *main_program_name
= NULL
;
916 /* For Ada, the name of the main procedure is stored in a specific
917 string constant, generated by the binder. Look for that symbol,
918 extract its address, and then read that string. If we didn't find
919 that string, then most probably the main procedure is not written
921 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
923 if (msym
.minsym
!= NULL
)
925 CORE_ADDR main_program_name_addr
;
928 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
929 if (main_program_name_addr
== 0)
930 error (_("Invalid address for Ada main program name."));
932 xfree (main_program_name
);
933 target_read_string (main_program_name_addr
, &main_program_name
,
938 return main_program_name
;
941 /* The main procedure doesn't seem to be in Ada. */
947 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
950 const struct ada_opname_map ada_opname_table
[] = {
951 {"Oadd", "\"+\"", BINOP_ADD
},
952 {"Osubtract", "\"-\"", BINOP_SUB
},
953 {"Omultiply", "\"*\"", BINOP_MUL
},
954 {"Odivide", "\"/\"", BINOP_DIV
},
955 {"Omod", "\"mod\"", BINOP_MOD
},
956 {"Orem", "\"rem\"", BINOP_REM
},
957 {"Oexpon", "\"**\"", BINOP_EXP
},
958 {"Olt", "\"<\"", BINOP_LESS
},
959 {"Ole", "\"<=\"", BINOP_LEQ
},
960 {"Ogt", "\">\"", BINOP_GTR
},
961 {"Oge", "\">=\"", BINOP_GEQ
},
962 {"Oeq", "\"=\"", BINOP_EQUAL
},
963 {"One", "\"/=\"", BINOP_NOTEQUAL
},
964 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
965 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
966 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
967 {"Oconcat", "\"&\"", BINOP_CONCAT
},
968 {"Oabs", "\"abs\"", UNOP_ABS
},
969 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
970 {"Oadd", "\"+\"", UNOP_PLUS
},
971 {"Osubtract", "\"-\"", UNOP_NEG
},
975 /* The "encoded" form of DECODED, according to GNAT conventions.
976 The result is valid until the next call to ada_encode. */
979 ada_encode (const char *decoded
)
981 static char *encoding_buffer
= NULL
;
982 static size_t encoding_buffer_size
= 0;
989 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
990 2 * strlen (decoded
) + 10);
993 for (p
= decoded
; *p
!= '\0'; p
+= 1)
997 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
1002 const struct ada_opname_map
*mapping
;
1004 for (mapping
= ada_opname_table
;
1005 mapping
->encoded
!= NULL
1006 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
1008 if (mapping
->encoded
== NULL
)
1009 error (_("invalid Ada operator name: %s"), p
);
1010 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
1011 k
+= strlen (mapping
->encoded
);
1016 encoding_buffer
[k
] = *p
;
1021 encoding_buffer
[k
] = '\0';
1022 return encoding_buffer
;
1025 /* Return NAME folded to lower case, or, if surrounded by single
1026 quotes, unfolded, but with the quotes stripped away. Result good
1030 ada_fold_name (const char *name
)
1032 static char *fold_buffer
= NULL
;
1033 static size_t fold_buffer_size
= 0;
1035 int len
= strlen (name
);
1036 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1038 if (name
[0] == '\'')
1040 strncpy (fold_buffer
, name
+ 1, len
- 2);
1041 fold_buffer
[len
- 2] = '\000';
1047 for (i
= 0; i
<= len
; i
+= 1)
1048 fold_buffer
[i
] = tolower (name
[i
]);
1054 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1057 is_lower_alphanum (const char c
)
1059 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1062 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1063 This function saves in LEN the length of that same symbol name but
1064 without either of these suffixes:
1070 These are suffixes introduced by the compiler for entities such as
1071 nested subprogram for instance, in order to avoid name clashes.
1072 They do not serve any purpose for the debugger. */
1075 ada_remove_trailing_digits (const char *encoded
, int *len
)
1077 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1081 while (i
> 0 && isdigit (encoded
[i
]))
1083 if (i
>= 0 && encoded
[i
] == '.')
1085 else if (i
>= 0 && encoded
[i
] == '$')
1087 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1089 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1094 /* Remove the suffix introduced by the compiler for protected object
1098 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1100 /* Remove trailing N. */
1102 /* Protected entry subprograms are broken into two
1103 separate subprograms: The first one is unprotected, and has
1104 a 'N' suffix; the second is the protected version, and has
1105 the 'P' suffix. The second calls the first one after handling
1106 the protection. Since the P subprograms are internally generated,
1107 we leave these names undecoded, giving the user a clue that this
1108 entity is internal. */
1111 && encoded
[*len
- 1] == 'N'
1112 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1116 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1119 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
1123 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
1126 if (encoded
[i
] != 'X')
1132 if (isalnum (encoded
[i
-1]))
1136 /* If ENCODED follows the GNAT entity encoding conventions, then return
1137 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1138 replaced by ENCODED.
1140 The resulting string is valid until the next call of ada_decode.
1141 If the string is unchanged by decoding, the original string pointer
1145 ada_decode (const char *encoded
)
1152 static char *decoding_buffer
= NULL
;
1153 static size_t decoding_buffer_size
= 0;
1155 /* The name of the Ada main procedure starts with "_ada_".
1156 This prefix is not part of the decoded name, so skip this part
1157 if we see this prefix. */
1158 if (startswith (encoded
, "_ada_"))
1161 /* If the name starts with '_', then it is not a properly encoded
1162 name, so do not attempt to decode it. Similarly, if the name
1163 starts with '<', the name should not be decoded. */
1164 if (encoded
[0] == '_' || encoded
[0] == '<')
1167 len0
= strlen (encoded
);
1169 ada_remove_trailing_digits (encoded
, &len0
);
1170 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1172 /* Remove the ___X.* suffix if present. Do not forget to verify that
1173 the suffix is located before the current "end" of ENCODED. We want
1174 to avoid re-matching parts of ENCODED that have previously been
1175 marked as discarded (by decrementing LEN0). */
1176 p
= strstr (encoded
, "___");
1177 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1185 /* Remove any trailing TKB suffix. It tells us that this symbol
1186 is for the body of a task, but that information does not actually
1187 appear in the decoded name. */
1189 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1192 /* Remove any trailing TB suffix. The TB suffix is slightly different
1193 from the TKB suffix because it is used for non-anonymous task
1196 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1199 /* Remove trailing "B" suffixes. */
1200 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1202 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1205 /* Make decoded big enough for possible expansion by operator name. */
1207 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1208 decoded
= decoding_buffer
;
1210 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1212 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1215 while ((i
>= 0 && isdigit (encoded
[i
]))
1216 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1218 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1220 else if (encoded
[i
] == '$')
1224 /* The first few characters that are not alphabetic are not part
1225 of any encoding we use, so we can copy them over verbatim. */
1227 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1228 decoded
[j
] = encoded
[i
];
1233 /* Is this a symbol function? */
1234 if (at_start_name
&& encoded
[i
] == 'O')
1238 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1240 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1241 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1243 && !isalnum (encoded
[i
+ op_len
]))
1245 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1248 j
+= strlen (ada_opname_table
[k
].decoded
);
1252 if (ada_opname_table
[k
].encoded
!= NULL
)
1257 /* Replace "TK__" with "__", which will eventually be translated
1258 into "." (just below). */
1260 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1263 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1264 be translated into "." (just below). These are internal names
1265 generated for anonymous blocks inside which our symbol is nested. */
1267 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1268 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1269 && isdigit (encoded
[i
+4]))
1273 while (k
< len0
&& isdigit (encoded
[k
]))
1274 k
++; /* Skip any extra digit. */
1276 /* Double-check that the "__B_{DIGITS}+" sequence we found
1277 is indeed followed by "__". */
1278 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1282 /* Remove _E{DIGITS}+[sb] */
1284 /* Just as for protected object subprograms, there are 2 categories
1285 of subprograms created by the compiler for each entry. The first
1286 one implements the actual entry code, and has a suffix following
1287 the convention above; the second one implements the barrier and
1288 uses the same convention as above, except that the 'E' is replaced
1291 Just as above, we do not decode the name of barrier functions
1292 to give the user a clue that the code he is debugging has been
1293 internally generated. */
1295 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1296 && isdigit (encoded
[i
+2]))
1300 while (k
< len0
&& isdigit (encoded
[k
]))
1304 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1307 /* Just as an extra precaution, make sure that if this
1308 suffix is followed by anything else, it is a '_'.
1309 Otherwise, we matched this sequence by accident. */
1311 || (k
< len0
&& encoded
[k
] == '_'))
1316 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1317 the GNAT front-end in protected object subprograms. */
1320 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1322 /* Backtrack a bit up until we reach either the begining of
1323 the encoded name, or "__". Make sure that we only find
1324 digits or lowercase characters. */
1325 const char *ptr
= encoded
+ i
- 1;
1327 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1330 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1334 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1336 /* This is a X[bn]* sequence not separated from the previous
1337 part of the name with a non-alpha-numeric character (in other
1338 words, immediately following an alpha-numeric character), then
1339 verify that it is placed at the end of the encoded name. If
1340 not, then the encoding is not valid and we should abort the
1341 decoding. Otherwise, just skip it, it is used in body-nested
1345 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1349 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1351 /* Replace '__' by '.'. */
1359 /* It's a character part of the decoded name, so just copy it
1361 decoded
[j
] = encoded
[i
];
1366 decoded
[j
] = '\000';
1368 /* Decoded names should never contain any uppercase character.
1369 Double-check this, and abort the decoding if we find one. */
1371 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1372 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1375 if (strcmp (decoded
, encoded
) == 0)
1381 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1382 decoded
= decoding_buffer
;
1383 if (encoded
[0] == '<')
1384 strcpy (decoded
, encoded
);
1386 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1391 /* Table for keeping permanent unique copies of decoded names. Once
1392 allocated, names in this table are never released. While this is a
1393 storage leak, it should not be significant unless there are massive
1394 changes in the set of decoded names in successive versions of a
1395 symbol table loaded during a single session. */
1396 static struct htab
*decoded_names_store
;
1398 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1399 in the language-specific part of GSYMBOL, if it has not been
1400 previously computed. Tries to save the decoded name in the same
1401 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1402 in any case, the decoded symbol has a lifetime at least that of
1404 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1405 const, but nevertheless modified to a semantically equivalent form
1406 when a decoded name is cached in it. */
1409 ada_decode_symbol (const struct general_symbol_info
*arg
)
1411 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1412 const char **resultp
=
1413 &gsymbol
->language_specific
.mangled_lang
.demangled_name
;
1415 if (!gsymbol
->ada_mangled
)
1417 const char *decoded
= ada_decode (gsymbol
->name
);
1418 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1420 gsymbol
->ada_mangled
= 1;
1422 if (obstack
!= NULL
)
1423 *resultp
= obstack_copy0 (obstack
, decoded
, strlen (decoded
));
1426 /* Sometimes, we can't find a corresponding objfile, in
1427 which case, we put the result on the heap. Since we only
1428 decode when needed, we hope this usually does not cause a
1429 significant memory leak (FIXME). */
1431 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1435 *slot
= xstrdup (decoded
);
1444 ada_la_decode (const char *encoded
, int options
)
1446 return xstrdup (ada_decode (encoded
));
1449 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1450 suffixes that encode debugging information or leading _ada_ on
1451 SYM_NAME (see is_name_suffix commentary for the debugging
1452 information that is ignored). If WILD, then NAME need only match a
1453 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1454 either argument is NULL. */
1457 match_name (const char *sym_name
, const char *name
, int wild
)
1459 if (sym_name
== NULL
|| name
== NULL
)
1462 return wild_match (sym_name
, name
) == 0;
1465 int len_name
= strlen (name
);
1467 return (strncmp (sym_name
, name
, len_name
) == 0
1468 && is_name_suffix (sym_name
+ len_name
))
1469 || (startswith (sym_name
, "_ada_")
1470 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1471 && is_name_suffix (sym_name
+ len_name
+ 5));
1478 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1479 generated by the GNAT compiler to describe the index type used
1480 for each dimension of an array, check whether it follows the latest
1481 known encoding. If not, fix it up to conform to the latest encoding.
1482 Otherwise, do nothing. This function also does nothing if
1483 INDEX_DESC_TYPE is NULL.
1485 The GNAT encoding used to describle the array index type evolved a bit.
1486 Initially, the information would be provided through the name of each
1487 field of the structure type only, while the type of these fields was
1488 described as unspecified and irrelevant. The debugger was then expected
1489 to perform a global type lookup using the name of that field in order
1490 to get access to the full index type description. Because these global
1491 lookups can be very expensive, the encoding was later enhanced to make
1492 the global lookup unnecessary by defining the field type as being
1493 the full index type description.
1495 The purpose of this routine is to allow us to support older versions
1496 of the compiler by detecting the use of the older encoding, and by
1497 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1498 we essentially replace each field's meaningless type by the associated
1502 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1506 if (index_desc_type
== NULL
)
1508 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1510 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1511 to check one field only, no need to check them all). If not, return
1514 If our INDEX_DESC_TYPE was generated using the older encoding,
1515 the field type should be a meaningless integer type whose name
1516 is not equal to the field name. */
1517 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1518 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1519 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1522 /* Fixup each field of INDEX_DESC_TYPE. */
1523 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1525 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1526 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1529 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1533 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1535 static char *bound_name
[] = {
1536 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1537 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1540 /* Maximum number of array dimensions we are prepared to handle. */
1542 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1545 /* The desc_* routines return primitive portions of array descriptors
1548 /* The descriptor or array type, if any, indicated by TYPE; removes
1549 level of indirection, if needed. */
1551 static struct type
*
1552 desc_base_type (struct type
*type
)
1556 type
= ada_check_typedef (type
);
1557 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1558 type
= ada_typedef_target_type (type
);
1561 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1562 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1563 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1568 /* True iff TYPE indicates a "thin" array pointer type. */
1571 is_thin_pntr (struct type
*type
)
1574 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1575 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1578 /* The descriptor type for thin pointer type TYPE. */
1580 static struct type
*
1581 thin_descriptor_type (struct type
*type
)
1583 struct type
*base_type
= desc_base_type (type
);
1585 if (base_type
== NULL
)
1587 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1591 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1593 if (alt_type
== NULL
)
1600 /* A pointer to the array data for thin-pointer value VAL. */
1602 static struct value
*
1603 thin_data_pntr (struct value
*val
)
1605 struct type
*type
= ada_check_typedef (value_type (val
));
1606 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1608 data_type
= lookup_pointer_type (data_type
);
1610 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1611 return value_cast (data_type
, value_copy (val
));
1613 return value_from_longest (data_type
, value_address (val
));
1616 /* True iff TYPE indicates a "thick" array pointer type. */
1619 is_thick_pntr (struct type
*type
)
1621 type
= desc_base_type (type
);
1622 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1623 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1626 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1627 pointer to one, the type of its bounds data; otherwise, NULL. */
1629 static struct type
*
1630 desc_bounds_type (struct type
*type
)
1634 type
= desc_base_type (type
);
1638 else if (is_thin_pntr (type
))
1640 type
= thin_descriptor_type (type
);
1643 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1645 return ada_check_typedef (r
);
1647 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1649 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1651 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1656 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1657 one, a pointer to its bounds data. Otherwise NULL. */
1659 static struct value
*
1660 desc_bounds (struct value
*arr
)
1662 struct type
*type
= ada_check_typedef (value_type (arr
));
1664 if (is_thin_pntr (type
))
1666 struct type
*bounds_type
=
1667 desc_bounds_type (thin_descriptor_type (type
));
1670 if (bounds_type
== NULL
)
1671 error (_("Bad GNAT array descriptor"));
1673 /* NOTE: The following calculation is not really kosher, but
1674 since desc_type is an XVE-encoded type (and shouldn't be),
1675 the correct calculation is a real pain. FIXME (and fix GCC). */
1676 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1677 addr
= value_as_long (arr
);
1679 addr
= value_address (arr
);
1682 value_from_longest (lookup_pointer_type (bounds_type
),
1683 addr
- TYPE_LENGTH (bounds_type
));
1686 else if (is_thick_pntr (type
))
1688 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1689 _("Bad GNAT array descriptor"));
1690 struct type
*p_bounds_type
= value_type (p_bounds
);
1693 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1695 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1697 if (TYPE_STUB (target_type
))
1698 p_bounds
= value_cast (lookup_pointer_type
1699 (ada_check_typedef (target_type
)),
1703 error (_("Bad GNAT array descriptor"));
1711 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1712 position of the field containing the address of the bounds data. */
1715 fat_pntr_bounds_bitpos (struct type
*type
)
1717 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1720 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1721 size of the field containing the address of the bounds data. */
1724 fat_pntr_bounds_bitsize (struct type
*type
)
1726 type
= desc_base_type (type
);
1728 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1729 return TYPE_FIELD_BITSIZE (type
, 1);
1731 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1734 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1735 pointer to one, the type of its array data (a array-with-no-bounds type);
1736 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1739 static struct type
*
1740 desc_data_target_type (struct type
*type
)
1742 type
= desc_base_type (type
);
1744 /* NOTE: The following is bogus; see comment in desc_bounds. */
1745 if (is_thin_pntr (type
))
1746 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1747 else if (is_thick_pntr (type
))
1749 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1752 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1753 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1759 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1762 static struct value
*
1763 desc_data (struct value
*arr
)
1765 struct type
*type
= value_type (arr
);
1767 if (is_thin_pntr (type
))
1768 return thin_data_pntr (arr
);
1769 else if (is_thick_pntr (type
))
1770 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1771 _("Bad GNAT array descriptor"));
1777 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1778 position of the field containing the address of the data. */
1781 fat_pntr_data_bitpos (struct type
*type
)
1783 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1786 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1787 size of the field containing the address of the data. */
1790 fat_pntr_data_bitsize (struct type
*type
)
1792 type
= desc_base_type (type
);
1794 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1795 return TYPE_FIELD_BITSIZE (type
, 0);
1797 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1800 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1801 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1802 bound, if WHICH is 1. The first bound is I=1. */
1804 static struct value
*
1805 desc_one_bound (struct value
*bounds
, int i
, int which
)
1807 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1808 _("Bad GNAT array descriptor bounds"));
1811 /* If BOUNDS is an array-bounds structure type, return the bit position
1812 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1813 bound, if WHICH is 1. The first bound is I=1. */
1816 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1818 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1821 /* If BOUNDS is an array-bounds structure type, return the bit field size
1822 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1823 bound, if WHICH is 1. The first bound is I=1. */
1826 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1828 type
= desc_base_type (type
);
1830 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1831 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1833 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1836 /* If TYPE is the type of an array-bounds structure, the type of its
1837 Ith bound (numbering from 1). Otherwise, NULL. */
1839 static struct type
*
1840 desc_index_type (struct type
*type
, int i
)
1842 type
= desc_base_type (type
);
1844 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1845 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1850 /* The number of index positions in the array-bounds type TYPE.
1851 Return 0 if TYPE is NULL. */
1854 desc_arity (struct type
*type
)
1856 type
= desc_base_type (type
);
1859 return TYPE_NFIELDS (type
) / 2;
1863 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1864 an array descriptor type (representing an unconstrained array
1868 ada_is_direct_array_type (struct type
*type
)
1872 type
= ada_check_typedef (type
);
1873 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1874 || ada_is_array_descriptor_type (type
));
1877 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1881 ada_is_array_type (struct type
*type
)
1884 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1885 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1886 type
= TYPE_TARGET_TYPE (type
);
1887 return ada_is_direct_array_type (type
);
1890 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1893 ada_is_simple_array_type (struct type
*type
)
1897 type
= ada_check_typedef (type
);
1898 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1899 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1900 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1901 == TYPE_CODE_ARRAY
));
1904 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1907 ada_is_array_descriptor_type (struct type
*type
)
1909 struct type
*data_type
= desc_data_target_type (type
);
1913 type
= ada_check_typedef (type
);
1914 return (data_type
!= NULL
1915 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1916 && desc_arity (desc_bounds_type (type
)) > 0);
1919 /* Non-zero iff type is a partially mal-formed GNAT array
1920 descriptor. FIXME: This is to compensate for some problems with
1921 debugging output from GNAT. Re-examine periodically to see if it
1925 ada_is_bogus_array_descriptor (struct type
*type
)
1929 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1930 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1931 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1932 && !ada_is_array_descriptor_type (type
);
1936 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1937 (fat pointer) returns the type of the array data described---specifically,
1938 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1939 in from the descriptor; otherwise, they are left unspecified. If
1940 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1941 returns NULL. The result is simply the type of ARR if ARR is not
1944 ada_type_of_array (struct value
*arr
, int bounds
)
1946 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1947 return decode_constrained_packed_array_type (value_type (arr
));
1949 if (!ada_is_array_descriptor_type (value_type (arr
)))
1950 return value_type (arr
);
1954 struct type
*array_type
=
1955 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1957 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1958 TYPE_FIELD_BITSIZE (array_type
, 0) =
1959 decode_packed_array_bitsize (value_type (arr
));
1965 struct type
*elt_type
;
1967 struct value
*descriptor
;
1969 elt_type
= ada_array_element_type (value_type (arr
), -1);
1970 arity
= ada_array_arity (value_type (arr
));
1972 if (elt_type
== NULL
|| arity
== 0)
1973 return ada_check_typedef (value_type (arr
));
1975 descriptor
= desc_bounds (arr
);
1976 if (value_as_long (descriptor
) == 0)
1980 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1981 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1982 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1983 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1986 create_static_range_type (range_type
, value_type (low
),
1987 longest_to_int (value_as_long (low
)),
1988 longest_to_int (value_as_long (high
)));
1989 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1991 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1993 /* We need to store the element packed bitsize, as well as
1994 recompute the array size, because it was previously
1995 computed based on the unpacked element size. */
1996 LONGEST lo
= value_as_long (low
);
1997 LONGEST hi
= value_as_long (high
);
1999 TYPE_FIELD_BITSIZE (elt_type
, 0) =
2000 decode_packed_array_bitsize (value_type (arr
));
2001 /* If the array has no element, then the size is already
2002 zero, and does not need to be recomputed. */
2006 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
2008 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
2013 return lookup_pointer_type (elt_type
);
2017 /* If ARR does not represent an array, returns ARR unchanged.
2018 Otherwise, returns either a standard GDB array with bounds set
2019 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2020 GDB array. Returns NULL if ARR is a null fat pointer. */
2023 ada_coerce_to_simple_array_ptr (struct value
*arr
)
2025 if (ada_is_array_descriptor_type (value_type (arr
)))
2027 struct type
*arrType
= ada_type_of_array (arr
, 1);
2029 if (arrType
== NULL
)
2031 return value_cast (arrType
, value_copy (desc_data (arr
)));
2033 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2034 return decode_constrained_packed_array (arr
);
2039 /* If ARR does not represent an array, returns ARR unchanged.
2040 Otherwise, returns a standard GDB array describing ARR (which may
2041 be ARR itself if it already is in the proper form). */
2044 ada_coerce_to_simple_array (struct value
*arr
)
2046 if (ada_is_array_descriptor_type (value_type (arr
)))
2048 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2051 error (_("Bounds unavailable for null array pointer."));
2052 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
2053 return value_ind (arrVal
);
2055 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2056 return decode_constrained_packed_array (arr
);
2061 /* If TYPE represents a GNAT array type, return it translated to an
2062 ordinary GDB array type (possibly with BITSIZE fields indicating
2063 packing). For other types, is the identity. */
2066 ada_coerce_to_simple_array_type (struct type
*type
)
2068 if (ada_is_constrained_packed_array_type (type
))
2069 return decode_constrained_packed_array_type (type
);
2071 if (ada_is_array_descriptor_type (type
))
2072 return ada_check_typedef (desc_data_target_type (type
));
2077 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2080 ada_is_packed_array_type (struct type
*type
)
2084 type
= desc_base_type (type
);
2085 type
= ada_check_typedef (type
);
2087 ada_type_name (type
) != NULL
2088 && strstr (ada_type_name (type
), "___XP") != NULL
;
2091 /* Non-zero iff TYPE represents a standard GNAT constrained
2092 packed-array type. */
2095 ada_is_constrained_packed_array_type (struct type
*type
)
2097 return ada_is_packed_array_type (type
)
2098 && !ada_is_array_descriptor_type (type
);
2101 /* Non-zero iff TYPE represents an array descriptor for a
2102 unconstrained packed-array type. */
2105 ada_is_unconstrained_packed_array_type (struct type
*type
)
2107 return ada_is_packed_array_type (type
)
2108 && ada_is_array_descriptor_type (type
);
2111 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2112 return the size of its elements in bits. */
2115 decode_packed_array_bitsize (struct type
*type
)
2117 const char *raw_name
;
2121 /* Access to arrays implemented as fat pointers are encoded as a typedef
2122 of the fat pointer type. We need the name of the fat pointer type
2123 to do the decoding, so strip the typedef layer. */
2124 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2125 type
= ada_typedef_target_type (type
);
2127 raw_name
= ada_type_name (ada_check_typedef (type
));
2129 raw_name
= ada_type_name (desc_base_type (type
));
2134 tail
= strstr (raw_name
, "___XP");
2135 gdb_assert (tail
!= NULL
);
2137 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2140 (_("could not understand bit size information on packed array"));
2147 /* Given that TYPE is a standard GDB array type with all bounds filled
2148 in, and that the element size of its ultimate scalar constituents
2149 (that is, either its elements, or, if it is an array of arrays, its
2150 elements' elements, etc.) is *ELT_BITS, return an identical type,
2151 but with the bit sizes of its elements (and those of any
2152 constituent arrays) recorded in the BITSIZE components of its
2153 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2156 Note that, for arrays whose index type has an XA encoding where
2157 a bound references a record discriminant, getting that discriminant,
2158 and therefore the actual value of that bound, is not possible
2159 because none of the given parameters gives us access to the record.
2160 This function assumes that it is OK in the context where it is being
2161 used to return an array whose bounds are still dynamic and where
2162 the length is arbitrary. */
2164 static struct type
*
2165 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2167 struct type
*new_elt_type
;
2168 struct type
*new_type
;
2169 struct type
*index_type_desc
;
2170 struct type
*index_type
;
2171 LONGEST low_bound
, high_bound
;
2173 type
= ada_check_typedef (type
);
2174 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2177 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2178 if (index_type_desc
)
2179 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2182 index_type
= TYPE_INDEX_TYPE (type
);
2184 new_type
= alloc_type_copy (type
);
2186 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2188 create_array_type (new_type
, new_elt_type
, index_type
);
2189 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2190 TYPE_NAME (new_type
) = ada_type_name (type
);
2192 if ((TYPE_CODE (check_typedef (index_type
)) == TYPE_CODE_RANGE
2193 && is_dynamic_type (check_typedef (index_type
)))
2194 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2195 low_bound
= high_bound
= 0;
2196 if (high_bound
< low_bound
)
2197 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2200 *elt_bits
*= (high_bound
- low_bound
+ 1);
2201 TYPE_LENGTH (new_type
) =
2202 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2205 TYPE_FIXED_INSTANCE (new_type
) = 1;
2209 /* The array type encoded by TYPE, where
2210 ada_is_constrained_packed_array_type (TYPE). */
2212 static struct type
*
2213 decode_constrained_packed_array_type (struct type
*type
)
2215 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2218 struct type
*shadow_type
;
2222 raw_name
= ada_type_name (desc_base_type (type
));
2227 name
= (char *) alloca (strlen (raw_name
) + 1);
2228 tail
= strstr (raw_name
, "___XP");
2229 type
= desc_base_type (type
);
2231 memcpy (name
, raw_name
, tail
- raw_name
);
2232 name
[tail
- raw_name
] = '\000';
2234 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2236 if (shadow_type
== NULL
)
2238 lim_warning (_("could not find bounds information on packed array"));
2241 CHECK_TYPEDEF (shadow_type
);
2243 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2245 lim_warning (_("could not understand bounds "
2246 "information on packed array"));
2250 bits
= decode_packed_array_bitsize (type
);
2251 return constrained_packed_array_type (shadow_type
, &bits
);
2254 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2255 array, returns a simple array that denotes that array. Its type is a
2256 standard GDB array type except that the BITSIZEs of the array
2257 target types are set to the number of bits in each element, and the
2258 type length is set appropriately. */
2260 static struct value
*
2261 decode_constrained_packed_array (struct value
*arr
)
2265 /* If our value is a pointer, then dereference it. Likewise if
2266 the value is a reference. Make sure that this operation does not
2267 cause the target type to be fixed, as this would indirectly cause
2268 this array to be decoded. The rest of the routine assumes that
2269 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2270 and "value_ind" routines to perform the dereferencing, as opposed
2271 to using "ada_coerce_ref" or "ada_value_ind". */
2272 arr
= coerce_ref (arr
);
2273 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2274 arr
= value_ind (arr
);
2276 type
= decode_constrained_packed_array_type (value_type (arr
));
2279 error (_("can't unpack array"));
2283 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2284 && ada_is_modular_type (value_type (arr
)))
2286 /* This is a (right-justified) modular type representing a packed
2287 array with no wrapper. In order to interpret the value through
2288 the (left-justified) packed array type we just built, we must
2289 first left-justify it. */
2290 int bit_size
, bit_pos
;
2293 mod
= ada_modulus (value_type (arr
)) - 1;
2300 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2301 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2302 bit_pos
/ HOST_CHAR_BIT
,
2303 bit_pos
% HOST_CHAR_BIT
,
2308 return coerce_unspec_val_to_type (arr
, type
);
2312 /* The value of the element of packed array ARR at the ARITY indices
2313 given in IND. ARR must be a simple array. */
2315 static struct value
*
2316 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2319 int bits
, elt_off
, bit_off
;
2320 long elt_total_bit_offset
;
2321 struct type
*elt_type
;
2325 elt_total_bit_offset
= 0;
2326 elt_type
= ada_check_typedef (value_type (arr
));
2327 for (i
= 0; i
< arity
; i
+= 1)
2329 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2330 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2332 (_("attempt to do packed indexing of "
2333 "something other than a packed array"));
2336 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2337 LONGEST lowerbound
, upperbound
;
2340 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2342 lim_warning (_("don't know bounds of array"));
2343 lowerbound
= upperbound
= 0;
2346 idx
= pos_atr (ind
[i
]);
2347 if (idx
< lowerbound
|| idx
> upperbound
)
2348 lim_warning (_("packed array index %ld out of bounds"),
2350 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2351 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2352 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2355 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2356 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2358 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2363 /* Non-zero iff TYPE includes negative integer values. */
2366 has_negatives (struct type
*type
)
2368 switch (TYPE_CODE (type
))
2373 return !TYPE_UNSIGNED (type
);
2374 case TYPE_CODE_RANGE
:
2375 return TYPE_LOW_BOUND (type
) < 0;
2380 /* Create a new value of type TYPE from the contents of OBJ starting
2381 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2382 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2383 assigning through the result will set the field fetched from.
2384 VALADDR is ignored unless OBJ is NULL, in which case,
2385 VALADDR+OFFSET must address the start of storage containing the
2386 packed value. The value returned in this case is never an lval.
2387 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2390 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2391 long offset
, int bit_offset
, int bit_size
,
2395 int src
, /* Index into the source area */
2396 targ
, /* Index into the target area */
2397 srcBitsLeft
, /* Number of source bits left to move */
2398 nsrc
, ntarg
, /* Number of source and target bytes */
2399 unusedLS
, /* Number of bits in next significant
2400 byte of source that are unused */
2401 accumSize
; /* Number of meaningful bits in accum */
2402 unsigned char *bytes
; /* First byte containing data to unpack */
2403 unsigned char *unpacked
;
2404 unsigned long accum
; /* Staging area for bits being transferred */
2406 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2407 /* Transmit bytes from least to most significant; delta is the direction
2408 the indices move. */
2409 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2411 type
= ada_check_typedef (type
);
2415 v
= allocate_value (type
);
2416 bytes
= (unsigned char *) (valaddr
+ offset
);
2418 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2420 v
= value_at (type
, value_address (obj
));
2421 type
= value_type (v
);
2422 bytes
= (unsigned char *) alloca (len
);
2423 read_memory (value_address (v
) + offset
, bytes
, len
);
2427 v
= allocate_value (type
);
2428 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2433 long new_offset
= offset
;
2435 set_value_component_location (v
, obj
);
2436 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2437 set_value_bitsize (v
, bit_size
);
2438 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2441 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2443 set_value_offset (v
, new_offset
);
2445 /* Also set the parent value. This is needed when trying to
2446 assign a new value (in inferior memory). */
2447 set_value_parent (v
, obj
);
2450 set_value_bitsize (v
, bit_size
);
2451 unpacked
= (unsigned char *) value_contents (v
);
2453 srcBitsLeft
= bit_size
;
2455 ntarg
= TYPE_LENGTH (type
);
2459 memset (unpacked
, 0, TYPE_LENGTH (type
));
2462 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2465 if (has_negatives (type
)
2466 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2470 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2473 switch (TYPE_CODE (type
))
2475 case TYPE_CODE_ARRAY
:
2476 case TYPE_CODE_UNION
:
2477 case TYPE_CODE_STRUCT
:
2478 /* Non-scalar values must be aligned at a byte boundary... */
2480 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2481 /* ... And are placed at the beginning (most-significant) bytes
2483 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2488 targ
= TYPE_LENGTH (type
) - 1;
2494 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2497 unusedLS
= bit_offset
;
2500 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2507 /* Mask for removing bits of the next source byte that are not
2508 part of the value. */
2509 unsigned int unusedMSMask
=
2510 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2512 /* Sign-extend bits for this byte. */
2513 unsigned int signMask
= sign
& ~unusedMSMask
;
2516 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2517 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2518 if (accumSize
>= HOST_CHAR_BIT
)
2520 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2521 accumSize
-= HOST_CHAR_BIT
;
2522 accum
>>= HOST_CHAR_BIT
;
2526 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2533 accum
|= sign
<< accumSize
;
2534 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2535 accumSize
-= HOST_CHAR_BIT
;
2536 accum
>>= HOST_CHAR_BIT
;
2544 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2545 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2548 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2549 int src_offset
, int n
, int bits_big_endian_p
)
2551 unsigned int accum
, mask
;
2552 int accum_bits
, chunk_size
;
2554 target
+= targ_offset
/ HOST_CHAR_BIT
;
2555 targ_offset
%= HOST_CHAR_BIT
;
2556 source
+= src_offset
/ HOST_CHAR_BIT
;
2557 src_offset
%= HOST_CHAR_BIT
;
2558 if (bits_big_endian_p
)
2560 accum
= (unsigned char) *source
;
2562 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2568 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2569 accum_bits
+= HOST_CHAR_BIT
;
2571 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2574 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2575 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2578 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2580 accum_bits
-= chunk_size
;
2587 accum
= (unsigned char) *source
>> src_offset
;
2589 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2593 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2594 accum_bits
+= HOST_CHAR_BIT
;
2596 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2599 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2600 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2602 accum_bits
-= chunk_size
;
2603 accum
>>= chunk_size
;
2610 /* Store the contents of FROMVAL into the location of TOVAL.
2611 Return a new value with the location of TOVAL and contents of
2612 FROMVAL. Handles assignment into packed fields that have
2613 floating-point or non-scalar types. */
2615 static struct value
*
2616 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2618 struct type
*type
= value_type (toval
);
2619 int bits
= value_bitsize (toval
);
2621 toval
= ada_coerce_ref (toval
);
2622 fromval
= ada_coerce_ref (fromval
);
2624 if (ada_is_direct_array_type (value_type (toval
)))
2625 toval
= ada_coerce_to_simple_array (toval
);
2626 if (ada_is_direct_array_type (value_type (fromval
)))
2627 fromval
= ada_coerce_to_simple_array (fromval
);
2629 if (!deprecated_value_modifiable (toval
))
2630 error (_("Left operand of assignment is not a modifiable lvalue."));
2632 if (VALUE_LVAL (toval
) == lval_memory
2634 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2635 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2637 int len
= (value_bitpos (toval
)
2638 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2640 gdb_byte
*buffer
= alloca (len
);
2642 CORE_ADDR to_addr
= value_address (toval
);
2644 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2645 fromval
= value_cast (type
, fromval
);
2647 read_memory (to_addr
, buffer
, len
);
2648 from_size
= value_bitsize (fromval
);
2650 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2651 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2652 move_bits (buffer
, value_bitpos (toval
),
2653 value_contents (fromval
), from_size
- bits
, bits
, 1);
2655 move_bits (buffer
, value_bitpos (toval
),
2656 value_contents (fromval
), 0, bits
, 0);
2657 write_memory_with_notification (to_addr
, buffer
, len
);
2659 val
= value_copy (toval
);
2660 memcpy (value_contents_raw (val
), value_contents (fromval
),
2661 TYPE_LENGTH (type
));
2662 deprecated_set_value_type (val
, type
);
2667 return value_assign (toval
, fromval
);
2671 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2672 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2673 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2674 * COMPONENT, and not the inferior's memory. The current contents
2675 * of COMPONENT are ignored. */
2677 value_assign_to_component (struct value
*container
, struct value
*component
,
2680 LONGEST offset_in_container
=
2681 (LONGEST
) (value_address (component
) - value_address (container
));
2682 int bit_offset_in_container
=
2683 value_bitpos (component
) - value_bitpos (container
);
2686 val
= value_cast (value_type (component
), val
);
2688 if (value_bitsize (component
) == 0)
2689 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2691 bits
= value_bitsize (component
);
2693 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2694 move_bits (value_contents_writeable (container
) + offset_in_container
,
2695 value_bitpos (container
) + bit_offset_in_container
,
2696 value_contents (val
),
2697 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2700 move_bits (value_contents_writeable (container
) + offset_in_container
,
2701 value_bitpos (container
) + bit_offset_in_container
,
2702 value_contents (val
), 0, bits
, 0);
2705 /* The value of the element of array ARR at the ARITY indices given in IND.
2706 ARR may be either a simple array, GNAT array descriptor, or pointer
2710 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2714 struct type
*elt_type
;
2716 elt
= ada_coerce_to_simple_array (arr
);
2718 elt_type
= ada_check_typedef (value_type (elt
));
2719 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2720 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2721 return value_subscript_packed (elt
, arity
, ind
);
2723 for (k
= 0; k
< arity
; k
+= 1)
2725 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2726 error (_("too many subscripts (%d expected)"), k
);
2727 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2732 /* Assuming ARR is a pointer to a GDB array, the value of the element
2733 of *ARR at the ARITY indices given in IND.
2734 Does not read the entire array into memory. */
2736 static struct value
*
2737 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2741 = check_typedef (value_enclosing_type (ada_value_ind (arr
)));
2743 for (k
= 0; k
< arity
; k
+= 1)
2747 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2748 error (_("too many subscripts (%d expected)"), k
);
2749 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2751 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2752 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2753 type
= TYPE_TARGET_TYPE (type
);
2756 return value_ind (arr
);
2759 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2760 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2761 elements starting at index LOW. The lower bound of this array is LOW, as
2763 static struct value
*
2764 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2767 struct type
*type0
= ada_check_typedef (type
);
2768 CORE_ADDR base
= value_as_address (array_ptr
)
2769 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
)))
2770 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2771 struct type
*index_type
2772 = create_static_range_type (NULL
,
2773 TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
)),
2775 struct type
*slice_type
=
2776 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2778 return value_at_lazy (slice_type
, base
);
2782 static struct value
*
2783 ada_value_slice (struct value
*array
, int low
, int high
)
2785 struct type
*type
= ada_check_typedef (value_type (array
));
2786 struct type
*index_type
2787 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2788 struct type
*slice_type
=
2789 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2791 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2794 /* If type is a record type in the form of a standard GNAT array
2795 descriptor, returns the number of dimensions for type. If arr is a
2796 simple array, returns the number of "array of"s that prefix its
2797 type designation. Otherwise, returns 0. */
2800 ada_array_arity (struct type
*type
)
2807 type
= desc_base_type (type
);
2810 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2811 return desc_arity (desc_bounds_type (type
));
2813 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2816 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2822 /* If TYPE is a record type in the form of a standard GNAT array
2823 descriptor or a simple array type, returns the element type for
2824 TYPE after indexing by NINDICES indices, or by all indices if
2825 NINDICES is -1. Otherwise, returns NULL. */
2828 ada_array_element_type (struct type
*type
, int nindices
)
2830 type
= desc_base_type (type
);
2832 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2835 struct type
*p_array_type
;
2837 p_array_type
= desc_data_target_type (type
);
2839 k
= ada_array_arity (type
);
2843 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2844 if (nindices
>= 0 && k
> nindices
)
2846 while (k
> 0 && p_array_type
!= NULL
)
2848 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2851 return p_array_type
;
2853 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2855 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2857 type
= TYPE_TARGET_TYPE (type
);
2866 /* The type of nth index in arrays of given type (n numbering from 1).
2867 Does not examine memory. Throws an error if N is invalid or TYPE
2868 is not an array type. NAME is the name of the Ada attribute being
2869 evaluated ('range, 'first, 'last, or 'length); it is used in building
2870 the error message. */
2872 static struct type
*
2873 ada_index_type (struct type
*type
, int n
, const char *name
)
2875 struct type
*result_type
;
2877 type
= desc_base_type (type
);
2879 if (n
< 0 || n
> ada_array_arity (type
))
2880 error (_("invalid dimension number to '%s"), name
);
2882 if (ada_is_simple_array_type (type
))
2886 for (i
= 1; i
< n
; i
+= 1)
2887 type
= TYPE_TARGET_TYPE (type
);
2888 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2889 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2890 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2891 perhaps stabsread.c would make more sense. */
2892 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2897 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2898 if (result_type
== NULL
)
2899 error (_("attempt to take bound of something that is not an array"));
2905 /* Given that arr is an array type, returns the lower bound of the
2906 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2907 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2908 array-descriptor type. It works for other arrays with bounds supplied
2909 by run-time quantities other than discriminants. */
2912 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2914 struct type
*type
, *index_type_desc
, *index_type
;
2917 gdb_assert (which
== 0 || which
== 1);
2919 if (ada_is_constrained_packed_array_type (arr_type
))
2920 arr_type
= decode_constrained_packed_array_type (arr_type
);
2922 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2923 return (LONGEST
) - which
;
2925 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2926 type
= TYPE_TARGET_TYPE (arr_type
);
2930 if (TYPE_FIXED_INSTANCE (type
))
2932 /* The array has already been fixed, so we do not need to
2933 check the parallel ___XA type again. That encoding has
2934 already been applied, so ignore it now. */
2935 index_type_desc
= NULL
;
2939 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2940 ada_fixup_array_indexes_type (index_type_desc
);
2943 if (index_type_desc
!= NULL
)
2944 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2948 struct type
*elt_type
= check_typedef (type
);
2950 for (i
= 1; i
< n
; i
++)
2951 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
2953 index_type
= TYPE_INDEX_TYPE (elt_type
);
2957 (LONGEST
) (which
== 0
2958 ? ada_discrete_type_low_bound (index_type
)
2959 : ada_discrete_type_high_bound (index_type
));
2962 /* Given that arr is an array value, returns the lower bound of the
2963 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2964 WHICH is 1. This routine will also work for arrays with bounds
2965 supplied by run-time quantities other than discriminants. */
2968 ada_array_bound (struct value
*arr
, int n
, int which
)
2970 struct type
*arr_type
;
2972 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2973 arr
= value_ind (arr
);
2974 arr_type
= value_enclosing_type (arr
);
2976 if (ada_is_constrained_packed_array_type (arr_type
))
2977 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2978 else if (ada_is_simple_array_type (arr_type
))
2979 return ada_array_bound_from_type (arr_type
, n
, which
);
2981 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2984 /* Given that arr is an array value, returns the length of the
2985 nth index. This routine will also work for arrays with bounds
2986 supplied by run-time quantities other than discriminants.
2987 Does not work for arrays indexed by enumeration types with representation
2988 clauses at the moment. */
2991 ada_array_length (struct value
*arr
, int n
)
2993 struct type
*arr_type
;
2995 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2996 arr
= value_ind (arr
);
2997 arr_type
= value_enclosing_type (arr
);
2999 if (ada_is_constrained_packed_array_type (arr_type
))
3000 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3002 if (ada_is_simple_array_type (arr_type
))
3003 return (ada_array_bound_from_type (arr_type
, n
, 1)
3004 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
3006 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
3007 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
3010 /* An empty array whose type is that of ARR_TYPE (an array type),
3011 with bounds LOW to LOW-1. */
3013 static struct value
*
3014 empty_array (struct type
*arr_type
, int low
)
3016 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3017 struct type
*index_type
3018 = create_static_range_type
3019 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
, low
- 1);
3020 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3022 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3026 /* Name resolution */
3028 /* The "decoded" name for the user-definable Ada operator corresponding
3032 ada_decoded_op_name (enum exp_opcode op
)
3036 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3038 if (ada_opname_table
[i
].op
== op
)
3039 return ada_opname_table
[i
].decoded
;
3041 error (_("Could not find operator name for opcode"));
3045 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3046 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3047 undefined namespace) and converts operators that are
3048 user-defined into appropriate function calls. If CONTEXT_TYPE is
3049 non-null, it provides a preferred result type [at the moment, only
3050 type void has any effect---causing procedures to be preferred over
3051 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3052 return type is preferred. May change (expand) *EXP. */
3055 resolve (struct expression
**expp
, int void_context_p
)
3057 struct type
*context_type
= NULL
;
3061 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3063 resolve_subexp (expp
, &pc
, 1, context_type
);
3066 /* Resolve the operator of the subexpression beginning at
3067 position *POS of *EXPP. "Resolving" consists of replacing
3068 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3069 with their resolutions, replacing built-in operators with
3070 function calls to user-defined operators, where appropriate, and,
3071 when DEPROCEDURE_P is non-zero, converting function-valued variables
3072 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3073 are as in ada_resolve, above. */
3075 static struct value
*
3076 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
3077 struct type
*context_type
)
3081 struct expression
*exp
; /* Convenience: == *expp. */
3082 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3083 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3084 int nargs
; /* Number of operands. */
3091 /* Pass one: resolve operands, saving their types and updating *pos,
3096 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3097 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3102 resolve_subexp (expp
, pos
, 0, NULL
);
3104 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3109 resolve_subexp (expp
, pos
, 0, NULL
);
3114 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
3117 case OP_ATR_MODULUS
:
3127 case TERNOP_IN_RANGE
:
3128 case BINOP_IN_BOUNDS
:
3134 case OP_DISCRETE_RANGE
:
3136 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3145 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3147 resolve_subexp (expp
, pos
, 1, NULL
);
3149 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3166 case BINOP_LOGICAL_AND
:
3167 case BINOP_LOGICAL_OR
:
3168 case BINOP_BITWISE_AND
:
3169 case BINOP_BITWISE_IOR
:
3170 case BINOP_BITWISE_XOR
:
3173 case BINOP_NOTEQUAL
:
3180 case BINOP_SUBSCRIPT
:
3188 case UNOP_LOGICAL_NOT
:
3204 case OP_INTERNALVAR
:
3214 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3217 case STRUCTOP_STRUCT
:
3218 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3231 error (_("Unexpected operator during name resolution"));
3234 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3235 for (i
= 0; i
< nargs
; i
+= 1)
3236 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3240 /* Pass two: perform any resolution on principal operator. */
3247 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3249 struct ada_symbol_info
*candidates
;
3253 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3254 (exp
->elts
[pc
+ 2].symbol
),
3255 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3258 if (n_candidates
> 1)
3260 /* Types tend to get re-introduced locally, so if there
3261 are any local symbols that are not types, first filter
3264 for (j
= 0; j
< n_candidates
; j
+= 1)
3265 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3270 case LOC_REGPARM_ADDR
:
3278 if (j
< n_candidates
)
3281 while (j
< n_candidates
)
3283 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3285 candidates
[j
] = candidates
[n_candidates
- 1];
3294 if (n_candidates
== 0)
3295 error (_("No definition found for %s"),
3296 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3297 else if (n_candidates
== 1)
3299 else if (deprocedure_p
3300 && !is_nonfunction (candidates
, n_candidates
))
3302 i
= ada_resolve_function
3303 (candidates
, n_candidates
, NULL
, 0,
3304 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3307 error (_("Could not find a match for %s"),
3308 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3312 printf_filtered (_("Multiple matches for %s\n"),
3313 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3314 user_select_syms (candidates
, n_candidates
, 1);
3318 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3319 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3320 if (innermost_block
== NULL
3321 || contained_in (candidates
[i
].block
, innermost_block
))
3322 innermost_block
= candidates
[i
].block
;
3326 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3329 replace_operator_with_call (expp
, pc
, 0, 0,
3330 exp
->elts
[pc
+ 2].symbol
,
3331 exp
->elts
[pc
+ 1].block
);
3338 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3339 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3341 struct ada_symbol_info
*candidates
;
3345 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3346 (exp
->elts
[pc
+ 5].symbol
),
3347 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3349 if (n_candidates
== 1)
3353 i
= ada_resolve_function
3354 (candidates
, n_candidates
,
3356 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3359 error (_("Could not find a match for %s"),
3360 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3363 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3364 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3365 if (innermost_block
== NULL
3366 || contained_in (candidates
[i
].block
, innermost_block
))
3367 innermost_block
= candidates
[i
].block
;
3378 case BINOP_BITWISE_AND
:
3379 case BINOP_BITWISE_IOR
:
3380 case BINOP_BITWISE_XOR
:
3382 case BINOP_NOTEQUAL
:
3390 case UNOP_LOGICAL_NOT
:
3392 if (possible_user_operator_p (op
, argvec
))
3394 struct ada_symbol_info
*candidates
;
3398 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3399 (struct block
*) NULL
, VAR_DOMAIN
,
3401 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3402 ada_decoded_op_name (op
), NULL
);
3406 replace_operator_with_call (expp
, pc
, nargs
, 1,
3407 candidates
[i
].sym
, candidates
[i
].block
);
3418 return evaluate_subexp_type (exp
, pos
);
3421 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3422 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3424 /* The term "match" here is rather loose. The match is heuristic and
3428 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3430 ftype
= ada_check_typedef (ftype
);
3431 atype
= ada_check_typedef (atype
);
3433 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3434 ftype
= TYPE_TARGET_TYPE (ftype
);
3435 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3436 atype
= TYPE_TARGET_TYPE (atype
);
3438 switch (TYPE_CODE (ftype
))
3441 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3443 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3444 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3445 TYPE_TARGET_TYPE (atype
), 0);
3448 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3450 case TYPE_CODE_ENUM
:
3451 case TYPE_CODE_RANGE
:
3452 switch (TYPE_CODE (atype
))
3455 case TYPE_CODE_ENUM
:
3456 case TYPE_CODE_RANGE
:
3462 case TYPE_CODE_ARRAY
:
3463 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3464 || ada_is_array_descriptor_type (atype
));
3466 case TYPE_CODE_STRUCT
:
3467 if (ada_is_array_descriptor_type (ftype
))
3468 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3469 || ada_is_array_descriptor_type (atype
));
3471 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3472 && !ada_is_array_descriptor_type (atype
));
3474 case TYPE_CODE_UNION
:
3476 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3480 /* Return non-zero if the formals of FUNC "sufficiently match" the
3481 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3482 may also be an enumeral, in which case it is treated as a 0-
3483 argument function. */
3486 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3489 struct type
*func_type
= SYMBOL_TYPE (func
);
3491 if (SYMBOL_CLASS (func
) == LOC_CONST
3492 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3493 return (n_actuals
== 0);
3494 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3497 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3500 for (i
= 0; i
< n_actuals
; i
+= 1)
3502 if (actuals
[i
] == NULL
)
3506 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3508 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3510 if (!ada_type_match (ftype
, atype
, 1))
3517 /* False iff function type FUNC_TYPE definitely does not produce a value
3518 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3519 FUNC_TYPE is not a valid function type with a non-null return type
3520 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3523 return_match (struct type
*func_type
, struct type
*context_type
)
3525 struct type
*return_type
;
3527 if (func_type
== NULL
)
3530 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3531 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3533 return_type
= get_base_type (func_type
);
3534 if (return_type
== NULL
)
3537 context_type
= get_base_type (context_type
);
3539 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3540 return context_type
== NULL
|| return_type
== context_type
;
3541 else if (context_type
== NULL
)
3542 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3544 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3548 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3549 function (if any) that matches the types of the NARGS arguments in
3550 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3551 that returns that type, then eliminate matches that don't. If
3552 CONTEXT_TYPE is void and there is at least one match that does not
3553 return void, eliminate all matches that do.
3555 Asks the user if there is more than one match remaining. Returns -1
3556 if there is no such symbol or none is selected. NAME is used
3557 solely for messages. May re-arrange and modify SYMS in
3558 the process; the index returned is for the modified vector. */
3561 ada_resolve_function (struct ada_symbol_info syms
[],
3562 int nsyms
, struct value
**args
, int nargs
,
3563 const char *name
, struct type
*context_type
)
3567 int m
; /* Number of hits */
3570 /* In the first pass of the loop, we only accept functions matching
3571 context_type. If none are found, we add a second pass of the loop
3572 where every function is accepted. */
3573 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3575 for (k
= 0; k
< nsyms
; k
+= 1)
3577 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3579 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3580 && (fallback
|| return_match (type
, context_type
)))
3592 printf_filtered (_("Multiple matches for %s\n"), name
);
3593 user_select_syms (syms
, m
, 1);
3599 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3600 in a listing of choices during disambiguation (see sort_choices, below).
3601 The idea is that overloadings of a subprogram name from the
3602 same package should sort in their source order. We settle for ordering
3603 such symbols by their trailing number (__N or $N). */
3606 encoded_ordered_before (const char *N0
, const char *N1
)
3610 else if (N0
== NULL
)
3616 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3618 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3620 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3621 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3626 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3629 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3631 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3632 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3634 return (strcmp (N0
, N1
) < 0);
3638 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3642 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3646 for (i
= 1; i
< nsyms
; i
+= 1)
3648 struct ada_symbol_info sym
= syms
[i
];
3651 for (j
= i
- 1; j
>= 0; j
-= 1)
3653 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3654 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3656 syms
[j
+ 1] = syms
[j
];
3662 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3663 by asking the user (if necessary), returning the number selected,
3664 and setting the first elements of SYMS items. Error if no symbols
3667 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3668 to be re-integrated one of these days. */
3671 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3674 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3676 int first_choice
= (max_results
== 1) ? 1 : 2;
3677 const char *select_mode
= multiple_symbols_select_mode ();
3679 if (max_results
< 1)
3680 error (_("Request to select 0 symbols!"));
3684 if (select_mode
== multiple_symbols_cancel
)
3686 canceled because the command is ambiguous\n\
3687 See set/show multiple-symbol."));
3689 /* If select_mode is "all", then return all possible symbols.
3690 Only do that if more than one symbol can be selected, of course.
3691 Otherwise, display the menu as usual. */
3692 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3695 printf_unfiltered (_("[0] cancel\n"));
3696 if (max_results
> 1)
3697 printf_unfiltered (_("[1] all\n"));
3699 sort_choices (syms
, nsyms
);
3701 for (i
= 0; i
< nsyms
; i
+= 1)
3703 if (syms
[i
].sym
== NULL
)
3706 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3708 struct symtab_and_line sal
=
3709 find_function_start_sal (syms
[i
].sym
, 1);
3711 if (sal
.symtab
== NULL
)
3712 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3714 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3717 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3718 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3719 symtab_to_filename_for_display (sal
.symtab
),
3726 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3727 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3728 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3729 struct symtab
*symtab
= NULL
;
3731 if (SYMBOL_OBJFILE_OWNED (syms
[i
].sym
))
3732 symtab
= symbol_symtab (syms
[i
].sym
);
3734 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3735 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3737 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3738 symtab_to_filename_for_display (symtab
),
3739 SYMBOL_LINE (syms
[i
].sym
));
3740 else if (is_enumeral
3741 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3743 printf_unfiltered (("[%d] "), i
+ first_choice
);
3744 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3745 gdb_stdout
, -1, 0, &type_print_raw_options
);
3746 printf_unfiltered (_("'(%s) (enumeral)\n"),
3747 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3749 else if (symtab
!= NULL
)
3750 printf_unfiltered (is_enumeral
3751 ? _("[%d] %s in %s (enumeral)\n")
3752 : _("[%d] %s at %s:?\n"),
3754 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3755 symtab_to_filename_for_display (symtab
));
3757 printf_unfiltered (is_enumeral
3758 ? _("[%d] %s (enumeral)\n")
3759 : _("[%d] %s at ?\n"),
3761 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3765 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3768 for (i
= 0; i
< n_chosen
; i
+= 1)
3769 syms
[i
] = syms
[chosen
[i
]];
3774 /* Read and validate a set of numeric choices from the user in the
3775 range 0 .. N_CHOICES-1. Place the results in increasing
3776 order in CHOICES[0 .. N-1], and return N.
3778 The user types choices as a sequence of numbers on one line
3779 separated by blanks, encoding them as follows:
3781 + A choice of 0 means to cancel the selection, throwing an error.
3782 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3783 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3785 The user is not allowed to choose more than MAX_RESULTS values.
3787 ANNOTATION_SUFFIX, if present, is used to annotate the input
3788 prompts (for use with the -f switch). */
3791 get_selections (int *choices
, int n_choices
, int max_results
,
3792 int is_all_choice
, char *annotation_suffix
)
3797 int first_choice
= is_all_choice
? 2 : 1;
3799 prompt
= getenv ("PS2");
3803 args
= command_line_input (prompt
, 0, annotation_suffix
);
3806 error_no_arg (_("one or more choice numbers"));
3810 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3811 order, as given in args. Choices are validated. */
3817 args
= skip_spaces (args
);
3818 if (*args
== '\0' && n_chosen
== 0)
3819 error_no_arg (_("one or more choice numbers"));
3820 else if (*args
== '\0')
3823 choice
= strtol (args
, &args2
, 10);
3824 if (args
== args2
|| choice
< 0
3825 || choice
> n_choices
+ first_choice
- 1)
3826 error (_("Argument must be choice number"));
3830 error (_("cancelled"));
3832 if (choice
< first_choice
)
3834 n_chosen
= n_choices
;
3835 for (j
= 0; j
< n_choices
; j
+= 1)
3839 choice
-= first_choice
;
3841 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3845 if (j
< 0 || choice
!= choices
[j
])
3849 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3850 choices
[k
+ 1] = choices
[k
];
3851 choices
[j
+ 1] = choice
;
3856 if (n_chosen
> max_results
)
3857 error (_("Select no more than %d of the above"), max_results
);
3862 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3863 on the function identified by SYM and BLOCK, and taking NARGS
3864 arguments. Update *EXPP as needed to hold more space. */
3867 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3868 int oplen
, struct symbol
*sym
,
3869 const struct block
*block
)
3871 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3872 symbol, -oplen for operator being replaced). */
3873 struct expression
*newexp
= (struct expression
*)
3874 xzalloc (sizeof (struct expression
)
3875 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3876 struct expression
*exp
= *expp
;
3878 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3879 newexp
->language_defn
= exp
->language_defn
;
3880 newexp
->gdbarch
= exp
->gdbarch
;
3881 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3882 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3883 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3885 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3886 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3888 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3889 newexp
->elts
[pc
+ 4].block
= block
;
3890 newexp
->elts
[pc
+ 5].symbol
= sym
;
3896 /* Type-class predicates */
3898 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3902 numeric_type_p (struct type
*type
)
3908 switch (TYPE_CODE (type
))
3913 case TYPE_CODE_RANGE
:
3914 return (type
== TYPE_TARGET_TYPE (type
)
3915 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3922 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3925 integer_type_p (struct type
*type
)
3931 switch (TYPE_CODE (type
))
3935 case TYPE_CODE_RANGE
:
3936 return (type
== TYPE_TARGET_TYPE (type
)
3937 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3944 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3947 scalar_type_p (struct type
*type
)
3953 switch (TYPE_CODE (type
))
3956 case TYPE_CODE_RANGE
:
3957 case TYPE_CODE_ENUM
:
3966 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3969 discrete_type_p (struct type
*type
)
3975 switch (TYPE_CODE (type
))
3978 case TYPE_CODE_RANGE
:
3979 case TYPE_CODE_ENUM
:
3980 case TYPE_CODE_BOOL
:
3988 /* Returns non-zero if OP with operands in the vector ARGS could be
3989 a user-defined function. Errs on the side of pre-defined operators
3990 (i.e., result 0). */
3993 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3995 struct type
*type0
=
3996 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3997 struct type
*type1
=
3998 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4012 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4016 case BINOP_BITWISE_AND
:
4017 case BINOP_BITWISE_IOR
:
4018 case BINOP_BITWISE_XOR
:
4019 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4022 case BINOP_NOTEQUAL
:
4027 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4030 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4033 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4037 case UNOP_LOGICAL_NOT
:
4039 return (!numeric_type_p (type0
));
4048 1. In the following, we assume that a renaming type's name may
4049 have an ___XD suffix. It would be nice if this went away at some
4051 2. We handle both the (old) purely type-based representation of
4052 renamings and the (new) variable-based encoding. At some point,
4053 it is devoutly to be hoped that the former goes away
4054 (FIXME: hilfinger-2007-07-09).
4055 3. Subprogram renamings are not implemented, although the XRS
4056 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4058 /* If SYM encodes a renaming,
4060 <renaming> renames <renamed entity>,
4062 sets *LEN to the length of the renamed entity's name,
4063 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4064 the string describing the subcomponent selected from the renamed
4065 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4066 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4067 are undefined). Otherwise, returns a value indicating the category
4068 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4069 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4070 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4071 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4072 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4073 may be NULL, in which case they are not assigned.
4075 [Currently, however, GCC does not generate subprogram renamings.] */
4077 enum ada_renaming_category
4078 ada_parse_renaming (struct symbol
*sym
,
4079 const char **renamed_entity
, int *len
,
4080 const char **renaming_expr
)
4082 enum ada_renaming_category kind
;
4087 return ADA_NOT_RENAMING
;
4088 switch (SYMBOL_CLASS (sym
))
4091 return ADA_NOT_RENAMING
;
4093 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
4094 renamed_entity
, len
, renaming_expr
);
4098 case LOC_OPTIMIZED_OUT
:
4099 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4101 return ADA_NOT_RENAMING
;
4105 kind
= ADA_OBJECT_RENAMING
;
4109 kind
= ADA_EXCEPTION_RENAMING
;
4113 kind
= ADA_PACKAGE_RENAMING
;
4117 kind
= ADA_SUBPROGRAM_RENAMING
;
4121 return ADA_NOT_RENAMING
;
4125 if (renamed_entity
!= NULL
)
4126 *renamed_entity
= info
;
4127 suffix
= strstr (info
, "___XE");
4128 if (suffix
== NULL
|| suffix
== info
)
4129 return ADA_NOT_RENAMING
;
4131 *len
= strlen (info
) - strlen (suffix
);
4133 if (renaming_expr
!= NULL
)
4134 *renaming_expr
= suffix
;
4138 /* Assuming TYPE encodes a renaming according to the old encoding in
4139 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4140 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4141 ADA_NOT_RENAMING otherwise. */
4142 static enum ada_renaming_category
4143 parse_old_style_renaming (struct type
*type
,
4144 const char **renamed_entity
, int *len
,
4145 const char **renaming_expr
)
4147 enum ada_renaming_category kind
;
4152 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4153 || TYPE_NFIELDS (type
) != 1)
4154 return ADA_NOT_RENAMING
;
4156 name
= type_name_no_tag (type
);
4158 return ADA_NOT_RENAMING
;
4160 name
= strstr (name
, "___XR");
4162 return ADA_NOT_RENAMING
;
4167 kind
= ADA_OBJECT_RENAMING
;
4170 kind
= ADA_EXCEPTION_RENAMING
;
4173 kind
= ADA_PACKAGE_RENAMING
;
4176 kind
= ADA_SUBPROGRAM_RENAMING
;
4179 return ADA_NOT_RENAMING
;
4182 info
= TYPE_FIELD_NAME (type
, 0);
4184 return ADA_NOT_RENAMING
;
4185 if (renamed_entity
!= NULL
)
4186 *renamed_entity
= info
;
4187 suffix
= strstr (info
, "___XE");
4188 if (renaming_expr
!= NULL
)
4189 *renaming_expr
= suffix
+ 5;
4190 if (suffix
== NULL
|| suffix
== info
)
4191 return ADA_NOT_RENAMING
;
4193 *len
= suffix
- info
;
4197 /* Compute the value of the given RENAMING_SYM, which is expected to
4198 be a symbol encoding a renaming expression. BLOCK is the block
4199 used to evaluate the renaming. */
4201 static struct value
*
4202 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4203 const struct block
*block
)
4205 const char *sym_name
;
4206 struct expression
*expr
;
4207 struct value
*value
;
4208 struct cleanup
*old_chain
= NULL
;
4210 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4211 expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4212 old_chain
= make_cleanup (free_current_contents
, &expr
);
4213 value
= evaluate_expression (expr
);
4215 do_cleanups (old_chain
);
4220 /* Evaluation: Function Calls */
4222 /* Return an lvalue containing the value VAL. This is the identity on
4223 lvalues, and otherwise has the side-effect of allocating memory
4224 in the inferior where a copy of the value contents is copied. */
4226 static struct value
*
4227 ensure_lval (struct value
*val
)
4229 if (VALUE_LVAL (val
) == not_lval
4230 || VALUE_LVAL (val
) == lval_internalvar
)
4232 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4233 const CORE_ADDR addr
=
4234 value_as_long (value_allocate_space_in_inferior (len
));
4236 set_value_address (val
, addr
);
4237 VALUE_LVAL (val
) = lval_memory
;
4238 write_memory (addr
, value_contents (val
), len
);
4244 /* Return the value ACTUAL, converted to be an appropriate value for a
4245 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4246 allocating any necessary descriptors (fat pointers), or copies of
4247 values not residing in memory, updating it as needed. */
4250 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4252 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4253 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4254 struct type
*formal_target
=
4255 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4256 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4257 struct type
*actual_target
=
4258 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4259 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4261 if (ada_is_array_descriptor_type (formal_target
)
4262 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4263 return make_array_descriptor (formal_type
, actual
);
4264 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4265 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4267 struct value
*result
;
4269 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4270 && ada_is_array_descriptor_type (actual_target
))
4271 result
= desc_data (actual
);
4272 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4274 if (VALUE_LVAL (actual
) != lval_memory
)
4278 actual_type
= ada_check_typedef (value_type (actual
));
4279 val
= allocate_value (actual_type
);
4280 memcpy ((char *) value_contents_raw (val
),
4281 (char *) value_contents (actual
),
4282 TYPE_LENGTH (actual_type
));
4283 actual
= ensure_lval (val
);
4285 result
= value_addr (actual
);
4289 return value_cast_pointers (formal_type
, result
, 0);
4291 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4292 return ada_value_ind (actual
);
4297 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4298 type TYPE. This is usually an inefficient no-op except on some targets
4299 (such as AVR) where the representation of a pointer and an address
4303 value_pointer (struct value
*value
, struct type
*type
)
4305 struct gdbarch
*gdbarch
= get_type_arch (type
);
4306 unsigned len
= TYPE_LENGTH (type
);
4307 gdb_byte
*buf
= alloca (len
);
4310 addr
= value_address (value
);
4311 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4312 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4317 /* Push a descriptor of type TYPE for array value ARR on the stack at
4318 *SP, updating *SP to reflect the new descriptor. Return either
4319 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4320 to-descriptor type rather than a descriptor type), a struct value *
4321 representing a pointer to this descriptor. */
4323 static struct value
*
4324 make_array_descriptor (struct type
*type
, struct value
*arr
)
4326 struct type
*bounds_type
= desc_bounds_type (type
);
4327 struct type
*desc_type
= desc_base_type (type
);
4328 struct value
*descriptor
= allocate_value (desc_type
);
4329 struct value
*bounds
= allocate_value (bounds_type
);
4332 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4335 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4336 ada_array_bound (arr
, i
, 0),
4337 desc_bound_bitpos (bounds_type
, i
, 0),
4338 desc_bound_bitsize (bounds_type
, i
, 0));
4339 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4340 ada_array_bound (arr
, i
, 1),
4341 desc_bound_bitpos (bounds_type
, i
, 1),
4342 desc_bound_bitsize (bounds_type
, i
, 1));
4345 bounds
= ensure_lval (bounds
);
4347 modify_field (value_type (descriptor
),
4348 value_contents_writeable (descriptor
),
4349 value_pointer (ensure_lval (arr
),
4350 TYPE_FIELD_TYPE (desc_type
, 0)),
4351 fat_pntr_data_bitpos (desc_type
),
4352 fat_pntr_data_bitsize (desc_type
));
4354 modify_field (value_type (descriptor
),
4355 value_contents_writeable (descriptor
),
4356 value_pointer (bounds
,
4357 TYPE_FIELD_TYPE (desc_type
, 1)),
4358 fat_pntr_bounds_bitpos (desc_type
),
4359 fat_pntr_bounds_bitsize (desc_type
));
4361 descriptor
= ensure_lval (descriptor
);
4363 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4364 return value_addr (descriptor
);
4369 /* Symbol Cache Module */
4371 /* Performance measurements made as of 2010-01-15 indicate that
4372 this cache does bring some noticeable improvements. Depending
4373 on the type of entity being printed, the cache can make it as much
4374 as an order of magnitude faster than without it.
4376 The descriptive type DWARF extension has significantly reduced
4377 the need for this cache, at least when DWARF is being used. However,
4378 even in this case, some expensive name-based symbol searches are still
4379 sometimes necessary - to find an XVZ variable, mostly. */
4381 /* Initialize the contents of SYM_CACHE. */
4384 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4386 obstack_init (&sym_cache
->cache_space
);
4387 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4390 /* Free the memory used by SYM_CACHE. */
4393 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4395 obstack_free (&sym_cache
->cache_space
, NULL
);
4399 /* Return the symbol cache associated to the given program space PSPACE.
4400 If not allocated for this PSPACE yet, allocate and initialize one. */
4402 static struct ada_symbol_cache
*
4403 ada_get_symbol_cache (struct program_space
*pspace
)
4405 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4407 if (pspace_data
->sym_cache
== NULL
)
4409 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4410 ada_init_symbol_cache (pspace_data
->sym_cache
);
4413 return pspace_data
->sym_cache
;
4416 /* Clear all entries from the symbol cache. */
4419 ada_clear_symbol_cache (void)
4421 struct ada_symbol_cache
*sym_cache
4422 = ada_get_symbol_cache (current_program_space
);
4424 obstack_free (&sym_cache
->cache_space
, NULL
);
4425 ada_init_symbol_cache (sym_cache
);
4428 /* Search our cache for an entry matching NAME and DOMAIN.
4429 Return it if found, or NULL otherwise. */
4431 static struct cache_entry
**
4432 find_entry (const char *name
, domain_enum domain
)
4434 struct ada_symbol_cache
*sym_cache
4435 = ada_get_symbol_cache (current_program_space
);
4436 int h
= msymbol_hash (name
) % HASH_SIZE
;
4437 struct cache_entry
**e
;
4439 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4441 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4447 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4448 Return 1 if found, 0 otherwise.
4450 If an entry was found and SYM is not NULL, set *SYM to the entry's
4451 SYM. Same principle for BLOCK if not NULL. */
4454 lookup_cached_symbol (const char *name
, domain_enum domain
,
4455 struct symbol
**sym
, const struct block
**block
)
4457 struct cache_entry
**e
= find_entry (name
, domain
);
4464 *block
= (*e
)->block
;
4468 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4469 in domain DOMAIN, save this result in our symbol cache. */
4472 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4473 const struct block
*block
)
4475 struct ada_symbol_cache
*sym_cache
4476 = ada_get_symbol_cache (current_program_space
);
4479 struct cache_entry
*e
;
4481 /* Symbols for builtin types don't have a block.
4482 For now don't cache such symbols. */
4483 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4486 /* If the symbol is a local symbol, then do not cache it, as a search
4487 for that symbol depends on the context. To determine whether
4488 the symbol is local or not, we check the block where we found it
4489 against the global and static blocks of its associated symtab. */
4491 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4492 GLOBAL_BLOCK
) != block
4493 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4494 STATIC_BLOCK
) != block
)
4497 h
= msymbol_hash (name
) % HASH_SIZE
;
4498 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4500 e
->next
= sym_cache
->root
[h
];
4501 sym_cache
->root
[h
] = e
;
4502 e
->name
= copy
= obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4503 strcpy (copy
, name
);
4511 /* Return nonzero if wild matching should be used when searching for
4512 all symbols matching LOOKUP_NAME.
4514 LOOKUP_NAME is expected to be a symbol name after transformation
4515 for Ada lookups (see ada_name_for_lookup). */
4518 should_use_wild_match (const char *lookup_name
)
4520 return (strstr (lookup_name
, "__") == NULL
);
4523 /* Return the result of a standard (literal, C-like) lookup of NAME in
4524 given DOMAIN, visible from lexical block BLOCK. */
4526 static struct symbol
*
4527 standard_lookup (const char *name
, const struct block
*block
,
4530 /* Initialize it just to avoid a GCC false warning. */
4531 struct symbol
*sym
= NULL
;
4533 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4535 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4536 cache_symbol (name
, domain
, sym
, block_found
);
4541 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4542 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4543 since they contend in overloading in the same way. */
4545 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4549 for (i
= 0; i
< n
; i
+= 1)
4550 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4551 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4552 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4558 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4559 struct types. Otherwise, they may not. */
4562 equiv_types (struct type
*type0
, struct type
*type1
)
4566 if (type0
== NULL
|| type1
== NULL
4567 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4569 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4570 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4571 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4572 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4578 /* True iff SYM0 represents the same entity as SYM1, or one that is
4579 no more defined than that of SYM1. */
4582 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4586 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4587 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4590 switch (SYMBOL_CLASS (sym0
))
4596 struct type
*type0
= SYMBOL_TYPE (sym0
);
4597 struct type
*type1
= SYMBOL_TYPE (sym1
);
4598 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4599 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4600 int len0
= strlen (name0
);
4603 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4604 && (equiv_types (type0
, type1
)
4605 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4606 && startswith (name1
+ len0
, "___XV")));
4609 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4610 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4616 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4617 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4620 add_defn_to_vec (struct obstack
*obstackp
,
4622 const struct block
*block
)
4625 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4627 /* Do not try to complete stub types, as the debugger is probably
4628 already scanning all symbols matching a certain name at the
4629 time when this function is called. Trying to replace the stub
4630 type by its associated full type will cause us to restart a scan
4631 which may lead to an infinite recursion. Instead, the client
4632 collecting the matching symbols will end up collecting several
4633 matches, with at least one of them complete. It can then filter
4634 out the stub ones if needed. */
4636 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4638 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4640 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4642 prevDefns
[i
].sym
= sym
;
4643 prevDefns
[i
].block
= block
;
4649 struct ada_symbol_info info
;
4653 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4657 /* Number of ada_symbol_info structures currently collected in
4658 current vector in *OBSTACKP. */
4661 num_defns_collected (struct obstack
*obstackp
)
4663 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4666 /* Vector of ada_symbol_info structures currently collected in current
4667 vector in *OBSTACKP. If FINISH, close off the vector and return
4668 its final address. */
4670 static struct ada_symbol_info
*
4671 defns_collected (struct obstack
*obstackp
, int finish
)
4674 return obstack_finish (obstackp
);
4676 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4679 /* Return a bound minimal symbol matching NAME according to Ada
4680 decoding rules. Returns an invalid symbol if there is no such
4681 minimal symbol. Names prefixed with "standard__" are handled
4682 specially: "standard__" is first stripped off, and only static and
4683 global symbols are searched. */
4685 struct bound_minimal_symbol
4686 ada_lookup_simple_minsym (const char *name
)
4688 struct bound_minimal_symbol result
;
4689 struct objfile
*objfile
;
4690 struct minimal_symbol
*msymbol
;
4691 const int wild_match_p
= should_use_wild_match (name
);
4693 memset (&result
, 0, sizeof (result
));
4695 /* Special case: If the user specifies a symbol name inside package
4696 Standard, do a non-wild matching of the symbol name without
4697 the "standard__" prefix. This was primarily introduced in order
4698 to allow the user to specifically access the standard exceptions
4699 using, for instance, Standard.Constraint_Error when Constraint_Error
4700 is ambiguous (due to the user defining its own Constraint_Error
4701 entity inside its program). */
4702 if (startswith (name
, "standard__"))
4703 name
+= sizeof ("standard__") - 1;
4705 ALL_MSYMBOLS (objfile
, msymbol
)
4707 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match_p
)
4708 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4710 result
.minsym
= msymbol
;
4711 result
.objfile
= objfile
;
4719 /* For all subprograms that statically enclose the subprogram of the
4720 selected frame, add symbols matching identifier NAME in DOMAIN
4721 and their blocks to the list of data in OBSTACKP, as for
4722 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4723 with a wildcard prefix. */
4726 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4727 const char *name
, domain_enum domain
,
4732 /* True if TYPE is definitely an artificial type supplied to a symbol
4733 for which no debugging information was given in the symbol file. */
4736 is_nondebugging_type (struct type
*type
)
4738 const char *name
= ada_type_name (type
);
4740 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4743 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4744 that are deemed "identical" for practical purposes.
4746 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4747 types and that their number of enumerals is identical (in other
4748 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4751 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4755 /* The heuristic we use here is fairly conservative. We consider
4756 that 2 enumerate types are identical if they have the same
4757 number of enumerals and that all enumerals have the same
4758 underlying value and name. */
4760 /* All enums in the type should have an identical underlying value. */
4761 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4762 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4765 /* All enumerals should also have the same name (modulo any numerical
4767 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4769 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4770 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4771 int len_1
= strlen (name_1
);
4772 int len_2
= strlen (name_2
);
4774 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4775 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4777 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4778 TYPE_FIELD_NAME (type2
, i
),
4786 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4787 that are deemed "identical" for practical purposes. Sometimes,
4788 enumerals are not strictly identical, but their types are so similar
4789 that they can be considered identical.
4791 For instance, consider the following code:
4793 type Color is (Black, Red, Green, Blue, White);
4794 type RGB_Color is new Color range Red .. Blue;
4796 Type RGB_Color is a subrange of an implicit type which is a copy
4797 of type Color. If we call that implicit type RGB_ColorB ("B" is
4798 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4799 As a result, when an expression references any of the enumeral
4800 by name (Eg. "print green"), the expression is technically
4801 ambiguous and the user should be asked to disambiguate. But
4802 doing so would only hinder the user, since it wouldn't matter
4803 what choice he makes, the outcome would always be the same.
4804 So, for practical purposes, we consider them as the same. */
4807 symbols_are_identical_enums (struct ada_symbol_info
*syms
, int nsyms
)
4811 /* Before performing a thorough comparison check of each type,
4812 we perform a series of inexpensive checks. We expect that these
4813 checks will quickly fail in the vast majority of cases, and thus
4814 help prevent the unnecessary use of a more expensive comparison.
4815 Said comparison also expects us to make some of these checks
4816 (see ada_identical_enum_types_p). */
4818 /* Quick check: All symbols should have an enum type. */
4819 for (i
= 0; i
< nsyms
; i
++)
4820 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
)
4823 /* Quick check: They should all have the same value. */
4824 for (i
= 1; i
< nsyms
; i
++)
4825 if (SYMBOL_VALUE (syms
[i
].sym
) != SYMBOL_VALUE (syms
[0].sym
))
4828 /* Quick check: They should all have the same number of enumerals. */
4829 for (i
= 1; i
< nsyms
; i
++)
4830 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].sym
))
4831 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].sym
)))
4834 /* All the sanity checks passed, so we might have a set of
4835 identical enumeration types. Perform a more complete
4836 comparison of the type of each symbol. */
4837 for (i
= 1; i
< nsyms
; i
++)
4838 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].sym
),
4839 SYMBOL_TYPE (syms
[0].sym
)))
4845 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4846 duplicate other symbols in the list (The only case I know of where
4847 this happens is when object files containing stabs-in-ecoff are
4848 linked with files containing ordinary ecoff debugging symbols (or no
4849 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4850 Returns the number of items in the modified list. */
4853 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4857 /* We should never be called with less than 2 symbols, as there
4858 cannot be any extra symbol in that case. But it's easy to
4859 handle, since we have nothing to do in that case. */
4868 /* If two symbols have the same name and one of them is a stub type,
4869 the get rid of the stub. */
4871 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4872 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4874 for (j
= 0; j
< nsyms
; j
++)
4877 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4878 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4879 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4880 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4885 /* Two symbols with the same name, same class and same address
4886 should be identical. */
4888 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4889 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4890 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4892 for (j
= 0; j
< nsyms
; j
+= 1)
4895 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4896 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4897 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4898 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4899 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4900 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4907 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4908 syms
[j
- 1] = syms
[j
];
4915 /* If all the remaining symbols are identical enumerals, then
4916 just keep the first one and discard the rest.
4918 Unlike what we did previously, we do not discard any entry
4919 unless they are ALL identical. This is because the symbol
4920 comparison is not a strict comparison, but rather a practical
4921 comparison. If all symbols are considered identical, then
4922 we can just go ahead and use the first one and discard the rest.
4923 But if we cannot reduce the list to a single element, we have
4924 to ask the user to disambiguate anyways. And if we have to
4925 present a multiple-choice menu, it's less confusing if the list
4926 isn't missing some choices that were identical and yet distinct. */
4927 if (symbols_are_identical_enums (syms
, nsyms
))
4933 /* Given a type that corresponds to a renaming entity, use the type name
4934 to extract the scope (package name or function name, fully qualified,
4935 and following the GNAT encoding convention) where this renaming has been
4936 defined. The string returned needs to be deallocated after use. */
4939 xget_renaming_scope (struct type
*renaming_type
)
4941 /* The renaming types adhere to the following convention:
4942 <scope>__<rename>___<XR extension>.
4943 So, to extract the scope, we search for the "___XR" extension,
4944 and then backtrack until we find the first "__". */
4946 const char *name
= type_name_no_tag (renaming_type
);
4947 char *suffix
= strstr (name
, "___XR");
4952 /* Now, backtrack a bit until we find the first "__". Start looking
4953 at suffix - 3, as the <rename> part is at least one character long. */
4955 for (last
= suffix
- 3; last
> name
; last
--)
4956 if (last
[0] == '_' && last
[1] == '_')
4959 /* Make a copy of scope and return it. */
4961 scope_len
= last
- name
;
4962 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4964 strncpy (scope
, name
, scope_len
);
4965 scope
[scope_len
] = '\0';
4970 /* Return nonzero if NAME corresponds to a package name. */
4973 is_package_name (const char *name
)
4975 /* Here, We take advantage of the fact that no symbols are generated
4976 for packages, while symbols are generated for each function.
4977 So the condition for NAME represent a package becomes equivalent
4978 to NAME not existing in our list of symbols. There is only one
4979 small complication with library-level functions (see below). */
4983 /* If it is a function that has not been defined at library level,
4984 then we should be able to look it up in the symbols. */
4985 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4988 /* Library-level function names start with "_ada_". See if function
4989 "_ada_" followed by NAME can be found. */
4991 /* Do a quick check that NAME does not contain "__", since library-level
4992 functions names cannot contain "__" in them. */
4993 if (strstr (name
, "__") != NULL
)
4996 fun_name
= xstrprintf ("_ada_%s", name
);
4998 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
5001 /* Return nonzero if SYM corresponds to a renaming entity that is
5002 not visible from FUNCTION_NAME. */
5005 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5008 struct cleanup
*old_chain
;
5010 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5013 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5014 old_chain
= make_cleanup (xfree
, scope
);
5016 /* If the rename has been defined in a package, then it is visible. */
5017 if (is_package_name (scope
))
5019 do_cleanups (old_chain
);
5023 /* Check that the rename is in the current function scope by checking
5024 that its name starts with SCOPE. */
5026 /* If the function name starts with "_ada_", it means that it is
5027 a library-level function. Strip this prefix before doing the
5028 comparison, as the encoding for the renaming does not contain
5030 if (startswith (function_name
, "_ada_"))
5034 int is_invisible
= !startswith (function_name
, scope
);
5036 do_cleanups (old_chain
);
5037 return is_invisible
;
5041 /* Remove entries from SYMS that corresponds to a renaming entity that
5042 is not visible from the function associated with CURRENT_BLOCK or
5043 that is superfluous due to the presence of more specific renaming
5044 information. Places surviving symbols in the initial entries of
5045 SYMS and returns the number of surviving symbols.
5048 First, in cases where an object renaming is implemented as a
5049 reference variable, GNAT may produce both the actual reference
5050 variable and the renaming encoding. In this case, we discard the
5053 Second, GNAT emits a type following a specified encoding for each renaming
5054 entity. Unfortunately, STABS currently does not support the definition
5055 of types that are local to a given lexical block, so all renamings types
5056 are emitted at library level. As a consequence, if an application
5057 contains two renaming entities using the same name, and a user tries to
5058 print the value of one of these entities, the result of the ada symbol
5059 lookup will also contain the wrong renaming type.
5061 This function partially covers for this limitation by attempting to
5062 remove from the SYMS list renaming symbols that should be visible
5063 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5064 method with the current information available. The implementation
5065 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5067 - When the user tries to print a rename in a function while there
5068 is another rename entity defined in a package: Normally, the
5069 rename in the function has precedence over the rename in the
5070 package, so the latter should be removed from the list. This is
5071 currently not the case.
5073 - This function will incorrectly remove valid renames if
5074 the CURRENT_BLOCK corresponds to a function which symbol name
5075 has been changed by an "Export" pragma. As a consequence,
5076 the user will be unable to print such rename entities. */
5079 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
5080 int nsyms
, const struct block
*current_block
)
5082 struct symbol
*current_function
;
5083 const char *current_function_name
;
5085 int is_new_style_renaming
;
5087 /* If there is both a renaming foo___XR... encoded as a variable and
5088 a simple variable foo in the same block, discard the latter.
5089 First, zero out such symbols, then compress. */
5090 is_new_style_renaming
= 0;
5091 for (i
= 0; i
< nsyms
; i
+= 1)
5093 struct symbol
*sym
= syms
[i
].sym
;
5094 const struct block
*block
= syms
[i
].block
;
5098 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5100 name
= SYMBOL_LINKAGE_NAME (sym
);
5101 suffix
= strstr (name
, "___XR");
5105 int name_len
= suffix
- name
;
5108 is_new_style_renaming
= 1;
5109 for (j
= 0; j
< nsyms
; j
+= 1)
5110 if (i
!= j
&& syms
[j
].sym
!= NULL
5111 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
5113 && block
== syms
[j
].block
)
5117 if (is_new_style_renaming
)
5121 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5122 if (syms
[j
].sym
!= NULL
)
5130 /* Extract the function name associated to CURRENT_BLOCK.
5131 Abort if unable to do so. */
5133 if (current_block
== NULL
)
5136 current_function
= block_linkage_function (current_block
);
5137 if (current_function
== NULL
)
5140 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5141 if (current_function_name
== NULL
)
5144 /* Check each of the symbols, and remove it from the list if it is
5145 a type corresponding to a renaming that is out of the scope of
5146 the current block. */
5151 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
5152 == ADA_OBJECT_RENAMING
5153 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
5157 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5158 syms
[j
- 1] = syms
[j
];
5168 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5169 whose name and domain match NAME and DOMAIN respectively.
5170 If no match was found, then extend the search to "enclosing"
5171 routines (in other words, if we're inside a nested function,
5172 search the symbols defined inside the enclosing functions).
5173 If WILD_MATCH_P is nonzero, perform the naming matching in
5174 "wild" mode (see function "wild_match" for more info).
5176 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5179 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
5180 const struct block
*block
, domain_enum domain
,
5183 int block_depth
= 0;
5185 while (block
!= NULL
)
5188 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5191 /* If we found a non-function match, assume that's the one. */
5192 if (is_nonfunction (defns_collected (obstackp
, 0),
5193 num_defns_collected (obstackp
)))
5196 block
= BLOCK_SUPERBLOCK (block
);
5199 /* If no luck so far, try to find NAME as a local symbol in some lexically
5200 enclosing subprogram. */
5201 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5202 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match_p
);
5205 /* An object of this type is used as the user_data argument when
5206 calling the map_matching_symbols method. */
5210 struct objfile
*objfile
;
5211 struct obstack
*obstackp
;
5212 struct symbol
*arg_sym
;
5216 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
5217 to a list of symbols. DATA0 is a pointer to a struct match_data *
5218 containing the obstack that collects the symbol list, the file that SYM
5219 must come from, a flag indicating whether a non-argument symbol has
5220 been found in the current block, and the last argument symbol
5221 passed in SYM within the current block (if any). When SYM is null,
5222 marking the end of a block, the argument symbol is added if no
5223 other has been found. */
5226 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5228 struct match_data
*data
= (struct match_data
*) data0
;
5232 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5233 add_defn_to_vec (data
->obstackp
,
5234 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5236 data
->found_sym
= 0;
5237 data
->arg_sym
= NULL
;
5241 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5243 else if (SYMBOL_IS_ARGUMENT (sym
))
5244 data
->arg_sym
= sym
;
5247 data
->found_sym
= 1;
5248 add_defn_to_vec (data
->obstackp
,
5249 fixup_symbol_section (sym
, data
->objfile
),
5256 /* Implements compare_names, but only applying the comparision using
5257 the given CASING. */
5260 compare_names_with_case (const char *string1
, const char *string2
,
5261 enum case_sensitivity casing
)
5263 while (*string1
!= '\0' && *string2
!= '\0')
5267 if (isspace (*string1
) || isspace (*string2
))
5268 return strcmp_iw_ordered (string1
, string2
);
5270 if (casing
== case_sensitive_off
)
5272 c1
= tolower (*string1
);
5273 c2
= tolower (*string2
);
5290 return strcmp_iw_ordered (string1
, string2
);
5292 if (*string2
== '\0')
5294 if (is_name_suffix (string1
))
5301 if (*string2
== '(')
5302 return strcmp_iw_ordered (string1
, string2
);
5305 if (casing
== case_sensitive_off
)
5306 return tolower (*string1
) - tolower (*string2
);
5308 return *string1
- *string2
;
5313 /* Compare STRING1 to STRING2, with results as for strcmp.
5314 Compatible with strcmp_iw_ordered in that...
5316 strcmp_iw_ordered (STRING1, STRING2) <= 0
5320 compare_names (STRING1, STRING2) <= 0
5322 (they may differ as to what symbols compare equal). */
5325 compare_names (const char *string1
, const char *string2
)
5329 /* Similar to what strcmp_iw_ordered does, we need to perform
5330 a case-insensitive comparison first, and only resort to
5331 a second, case-sensitive, comparison if the first one was
5332 not sufficient to differentiate the two strings. */
5334 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5336 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5341 /* Add to OBSTACKP all non-local symbols whose name and domain match
5342 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5343 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5346 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5347 domain_enum domain
, int global
,
5350 struct objfile
*objfile
;
5351 struct match_data data
;
5353 memset (&data
, 0, sizeof data
);
5354 data
.obstackp
= obstackp
;
5356 ALL_OBJFILES (objfile
)
5358 data
.objfile
= objfile
;
5361 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5362 aux_add_nonlocal_symbols
, &data
,
5365 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5366 aux_add_nonlocal_symbols
, &data
,
5367 full_match
, compare_names
);
5370 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5372 ALL_OBJFILES (objfile
)
5374 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
5375 strcpy (name1
, "_ada_");
5376 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5377 data
.objfile
= objfile
;
5378 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
, domain
,
5380 aux_add_nonlocal_symbols
,
5382 full_match
, compare_names
);
5387 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and, if full_search is
5388 non-zero, enclosing scope and in global scopes, returning the number of
5390 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5391 indicating the symbols found and the blocks and symbol tables (if
5392 any) in which they were found. This vector is transient---good only to
5393 the next call of ada_lookup_symbol_list.
5395 When full_search is non-zero, any non-function/non-enumeral
5396 symbol match within the nest of blocks whose innermost member is BLOCK0,
5397 is the one match returned (no other matches in that or
5398 enclosing blocks is returned). If there are any matches in or
5399 surrounding BLOCK0, then these alone are returned.
5401 Names prefixed with "standard__" are handled specially: "standard__"
5402 is first stripped off, and only static and global symbols are searched. */
5405 ada_lookup_symbol_list_worker (const char *name0
, const struct block
*block0
,
5407 struct ada_symbol_info
**results
,
5411 const struct block
*block
;
5413 const int wild_match_p
= should_use_wild_match (name0
);
5414 int syms_from_global_search
= 0;
5417 obstack_free (&symbol_list_obstack
, NULL
);
5418 obstack_init (&symbol_list_obstack
);
5420 /* Search specified block and its superiors. */
5425 /* Special case: If the user specifies a symbol name inside package
5426 Standard, do a non-wild matching of the symbol name without
5427 the "standard__" prefix. This was primarily introduced in order
5428 to allow the user to specifically access the standard exceptions
5429 using, for instance, Standard.Constraint_Error when Constraint_Error
5430 is ambiguous (due to the user defining its own Constraint_Error
5431 entity inside its program). */
5432 if (startswith (name0
, "standard__"))
5435 name
= name0
+ sizeof ("standard__") - 1;
5438 /* Check the non-global symbols. If we have ANY match, then we're done. */
5444 ada_add_local_symbols (&symbol_list_obstack
, name
, block
,
5445 domain
, wild_match_p
);
5449 /* In the !full_search case we're are being called by
5450 ada_iterate_over_symbols, and we don't want to search
5452 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
5453 domain
, NULL
, wild_match_p
);
5455 if (num_defns_collected (&symbol_list_obstack
) > 0 || !full_search
)
5459 /* No non-global symbols found. Check our cache to see if we have
5460 already performed this search before. If we have, then return
5463 if (lookup_cached_symbol (name0
, domain
, &sym
, &block
))
5466 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5470 syms_from_global_search
= 1;
5472 /* Search symbols from all global blocks. */
5474 add_nonlocal_symbols (&symbol_list_obstack
, name
, domain
, 1,
5477 /* Now add symbols from all per-file blocks if we've gotten no hits
5478 (not strictly correct, but perhaps better than an error). */
5480 if (num_defns_collected (&symbol_list_obstack
) == 0)
5481 add_nonlocal_symbols (&symbol_list_obstack
, name
, domain
, 0,
5485 ndefns
= num_defns_collected (&symbol_list_obstack
);
5486 *results
= defns_collected (&symbol_list_obstack
, 1);
5488 ndefns
= remove_extra_symbols (*results
, ndefns
);
5490 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5491 cache_symbol (name0
, domain
, NULL
, NULL
);
5493 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5494 cache_symbol (name0
, domain
, (*results
)[0].sym
, (*results
)[0].block
);
5496 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5501 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5502 in global scopes, returning the number of matches, and setting *RESULTS
5503 to a vector of (SYM,BLOCK) tuples.
5504 See ada_lookup_symbol_list_worker for further details. */
5507 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5508 domain_enum domain
, struct ada_symbol_info
**results
)
5510 return ada_lookup_symbol_list_worker (name0
, block0
, domain
, results
, 1);
5513 /* Implementation of the la_iterate_over_symbols method. */
5516 ada_iterate_over_symbols (const struct block
*block
,
5517 const char *name
, domain_enum domain
,
5518 symbol_found_callback_ftype
*callback
,
5522 struct ada_symbol_info
*results
;
5524 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5525 for (i
= 0; i
< ndefs
; ++i
)
5527 if (! (*callback
) (results
[i
].sym
, data
))
5532 /* If NAME is the name of an entity, return a string that should
5533 be used to look that entity up in Ada units. This string should
5534 be deallocated after use using xfree.
5536 NAME can have any form that the "break" or "print" commands might
5537 recognize. In other words, it does not have to be the "natural"
5538 name, or the "encoded" name. */
5541 ada_name_for_lookup (const char *name
)
5544 int nlen
= strlen (name
);
5546 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5548 canon
= xmalloc (nlen
- 1);
5549 memcpy (canon
, name
+ 1, nlen
- 2);
5550 canon
[nlen
- 2] = '\0';
5553 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5557 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5558 to 1, but choosing the first symbol found if there are multiple
5561 The result is stored in *INFO, which must be non-NULL.
5562 If no match is found, INFO->SYM is set to NULL. */
5565 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5567 struct ada_symbol_info
*info
)
5569 struct ada_symbol_info
*candidates
;
5572 gdb_assert (info
!= NULL
);
5573 memset (info
, 0, sizeof (struct ada_symbol_info
));
5575 n_candidates
= ada_lookup_symbol_list (name
, block
, domain
, &candidates
);
5576 if (n_candidates
== 0)
5579 *info
= candidates
[0];
5580 info
->sym
= fixup_symbol_section (info
->sym
, NULL
);
5583 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5584 scope and in global scopes, or NULL if none. NAME is folded and
5585 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5586 choosing the first symbol if there are multiple choices.
5587 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5590 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5591 domain_enum domain
, int *is_a_field_of_this
)
5593 struct ada_symbol_info info
;
5595 if (is_a_field_of_this
!= NULL
)
5596 *is_a_field_of_this
= 0;
5598 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5599 block0
, domain
, &info
);
5603 static struct symbol
*
5604 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5606 const struct block
*block
,
5607 const domain_enum domain
)
5611 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5615 /* If we haven't found a match at this point, try the primitive
5616 types. In other languages, this search is performed before
5617 searching for global symbols in order to short-circuit that
5618 global-symbol search if it happens that the name corresponds
5619 to a primitive type. But we cannot do the same in Ada, because
5620 it is perfectly legitimate for a program to declare a type which
5621 has the same name as a standard type. If looking up a type in
5622 that situation, we have traditionally ignored the primitive type
5623 in favor of user-defined types. This is why, unlike most other
5624 languages, we search the primitive types this late and only after
5625 having searched the global symbols without success. */
5627 if (domain
== VAR_DOMAIN
)
5629 struct gdbarch
*gdbarch
;
5632 gdbarch
= target_gdbarch ();
5634 gdbarch
= block_gdbarch (block
);
5635 sym
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5644 /* True iff STR is a possible encoded suffix of a normal Ada name
5645 that is to be ignored for matching purposes. Suffixes of parallel
5646 names (e.g., XVE) are not included here. Currently, the possible suffixes
5647 are given by any of the regular expressions:
5649 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5650 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5651 TKB [subprogram suffix for task bodies]
5652 _E[0-9]+[bs]$ [protected object entry suffixes]
5653 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5655 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5656 match is performed. This sequence is used to differentiate homonyms,
5657 is an optional part of a valid name suffix. */
5660 is_name_suffix (const char *str
)
5663 const char *matching
;
5664 const int len
= strlen (str
);
5666 /* Skip optional leading __[0-9]+. */
5668 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5671 while (isdigit (str
[0]))
5677 if (str
[0] == '.' || str
[0] == '$')
5680 while (isdigit (matching
[0]))
5682 if (matching
[0] == '\0')
5688 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5691 while (isdigit (matching
[0]))
5693 if (matching
[0] == '\0')
5697 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5699 if (strcmp (str
, "TKB") == 0)
5703 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5704 with a N at the end. Unfortunately, the compiler uses the same
5705 convention for other internal types it creates. So treating
5706 all entity names that end with an "N" as a name suffix causes
5707 some regressions. For instance, consider the case of an enumerated
5708 type. To support the 'Image attribute, it creates an array whose
5710 Having a single character like this as a suffix carrying some
5711 information is a bit risky. Perhaps we should change the encoding
5712 to be something like "_N" instead. In the meantime, do not do
5713 the following check. */
5714 /* Protected Object Subprograms */
5715 if (len
== 1 && str
[0] == 'N')
5720 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5723 while (isdigit (matching
[0]))
5725 if ((matching
[0] == 'b' || matching
[0] == 's')
5726 && matching
[1] == '\0')
5730 /* ??? We should not modify STR directly, as we are doing below. This
5731 is fine in this case, but may become problematic later if we find
5732 that this alternative did not work, and want to try matching
5733 another one from the begining of STR. Since we modified it, we
5734 won't be able to find the begining of the string anymore! */
5738 while (str
[0] != '_' && str
[0] != '\0')
5740 if (str
[0] != 'n' && str
[0] != 'b')
5746 if (str
[0] == '\000')
5751 if (str
[1] != '_' || str
[2] == '\000')
5755 if (strcmp (str
+ 3, "JM") == 0)
5757 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5758 the LJM suffix in favor of the JM one. But we will
5759 still accept LJM as a valid suffix for a reasonable
5760 amount of time, just to allow ourselves to debug programs
5761 compiled using an older version of GNAT. */
5762 if (strcmp (str
+ 3, "LJM") == 0)
5766 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5767 || str
[4] == 'U' || str
[4] == 'P')
5769 if (str
[4] == 'R' && str
[5] != 'T')
5773 if (!isdigit (str
[2]))
5775 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5776 if (!isdigit (str
[k
]) && str
[k
] != '_')
5780 if (str
[0] == '$' && isdigit (str
[1]))
5782 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5783 if (!isdigit (str
[k
]) && str
[k
] != '_')
5790 /* Return non-zero if the string starting at NAME and ending before
5791 NAME_END contains no capital letters. */
5794 is_valid_name_for_wild_match (const char *name0
)
5796 const char *decoded_name
= ada_decode (name0
);
5799 /* If the decoded name starts with an angle bracket, it means that
5800 NAME0 does not follow the GNAT encoding format. It should then
5801 not be allowed as a possible wild match. */
5802 if (decoded_name
[0] == '<')
5805 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5806 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5812 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5813 that could start a simple name. Assumes that *NAMEP points into
5814 the string beginning at NAME0. */
5817 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5819 const char *name
= *namep
;
5829 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5832 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
5837 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5838 || name
[2] == target0
))
5846 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5856 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5857 informational suffixes of NAME (i.e., for which is_name_suffix is
5858 true). Assumes that PATN is a lower-cased Ada simple name. */
5861 wild_match (const char *name
, const char *patn
)
5864 const char *name0
= name
;
5868 const char *match
= name
;
5872 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5875 if (*p
== '\0' && is_name_suffix (name
))
5876 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5878 if (name
[-1] == '_')
5881 if (!advance_wild_match (&name
, name0
, *patn
))
5886 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5887 informational suffix. */
5890 full_match (const char *sym_name
, const char *search_name
)
5892 return !match_name (sym_name
, search_name
, 0);
5896 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5897 vector *defn_symbols, updating the list of symbols in OBSTACKP
5898 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5899 OBJFILE is the section containing BLOCK. */
5902 ada_add_block_symbols (struct obstack
*obstackp
,
5903 const struct block
*block
, const char *name
,
5904 domain_enum domain
, struct objfile
*objfile
,
5907 struct block_iterator iter
;
5908 int name_len
= strlen (name
);
5909 /* A matching argument symbol, if any. */
5910 struct symbol
*arg_sym
;
5911 /* Set true when we find a matching non-argument symbol. */
5919 for (sym
= block_iter_match_first (block
, name
, wild_match
, &iter
);
5920 sym
!= NULL
; sym
= block_iter_match_next (name
, wild_match
, &iter
))
5922 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5923 SYMBOL_DOMAIN (sym
), domain
)
5924 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5926 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5928 else if (SYMBOL_IS_ARGUMENT (sym
))
5933 add_defn_to_vec (obstackp
,
5934 fixup_symbol_section (sym
, objfile
),
5942 for (sym
= block_iter_match_first (block
, name
, full_match
, &iter
);
5943 sym
!= NULL
; sym
= block_iter_match_next (name
, full_match
, &iter
))
5945 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5946 SYMBOL_DOMAIN (sym
), domain
))
5948 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5950 if (SYMBOL_IS_ARGUMENT (sym
))
5955 add_defn_to_vec (obstackp
,
5956 fixup_symbol_section (sym
, objfile
),
5964 if (!found_sym
&& arg_sym
!= NULL
)
5966 add_defn_to_vec (obstackp
,
5967 fixup_symbol_section (arg_sym
, objfile
),
5976 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5978 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5979 SYMBOL_DOMAIN (sym
), domain
))
5983 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5986 cmp
= !startswith (SYMBOL_LINKAGE_NAME (sym
), "_ada_");
5988 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5993 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5995 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5997 if (SYMBOL_IS_ARGUMENT (sym
))
6002 add_defn_to_vec (obstackp
,
6003 fixup_symbol_section (sym
, objfile
),
6011 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6012 They aren't parameters, right? */
6013 if (!found_sym
&& arg_sym
!= NULL
)
6015 add_defn_to_vec (obstackp
,
6016 fixup_symbol_section (arg_sym
, objfile
),
6023 /* Symbol Completion */
6025 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
6026 name in a form that's appropriate for the completion. The result
6027 does not need to be deallocated, but is only good until the next call.
6029 TEXT_LEN is equal to the length of TEXT.
6030 Perform a wild match if WILD_MATCH_P is set.
6031 ENCODED_P should be set if TEXT represents the start of a symbol name
6032 in its encoded form. */
6035 symbol_completion_match (const char *sym_name
,
6036 const char *text
, int text_len
,
6037 int wild_match_p
, int encoded_p
)
6039 const int verbatim_match
= (text
[0] == '<');
6044 /* Strip the leading angle bracket. */
6049 /* First, test against the fully qualified name of the symbol. */
6051 if (strncmp (sym_name
, text
, text_len
) == 0)
6054 if (match
&& !encoded_p
)
6056 /* One needed check before declaring a positive match is to verify
6057 that iff we are doing a verbatim match, the decoded version
6058 of the symbol name starts with '<'. Otherwise, this symbol name
6059 is not a suitable completion. */
6060 const char *sym_name_copy
= sym_name
;
6061 int has_angle_bracket
;
6063 sym_name
= ada_decode (sym_name
);
6064 has_angle_bracket
= (sym_name
[0] == '<');
6065 match
= (has_angle_bracket
== verbatim_match
);
6066 sym_name
= sym_name_copy
;
6069 if (match
&& !verbatim_match
)
6071 /* When doing non-verbatim match, another check that needs to
6072 be done is to verify that the potentially matching symbol name
6073 does not include capital letters, because the ada-mode would
6074 not be able to understand these symbol names without the
6075 angle bracket notation. */
6078 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6083 /* Second: Try wild matching... */
6085 if (!match
&& wild_match_p
)
6087 /* Since we are doing wild matching, this means that TEXT
6088 may represent an unqualified symbol name. We therefore must
6089 also compare TEXT against the unqualified name of the symbol. */
6090 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6092 if (strncmp (sym_name
, text
, text_len
) == 0)
6096 /* Finally: If we found a mach, prepare the result to return. */
6102 sym_name
= add_angle_brackets (sym_name
);
6105 sym_name
= ada_decode (sym_name
);
6110 /* A companion function to ada_make_symbol_completion_list().
6111 Check if SYM_NAME represents a symbol which name would be suitable
6112 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
6113 it is appended at the end of the given string vector SV.
6115 ORIG_TEXT is the string original string from the user command
6116 that needs to be completed. WORD is the entire command on which
6117 completion should be performed. These two parameters are used to
6118 determine which part of the symbol name should be added to the
6120 if WILD_MATCH_P is set, then wild matching is performed.
6121 ENCODED_P should be set if TEXT represents a symbol name in its
6122 encoded formed (in which case the completion should also be
6126 symbol_completion_add (VEC(char_ptr
) **sv
,
6127 const char *sym_name
,
6128 const char *text
, int text_len
,
6129 const char *orig_text
, const char *word
,
6130 int wild_match_p
, int encoded_p
)
6132 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
6133 wild_match_p
, encoded_p
);
6139 /* We found a match, so add the appropriate completion to the given
6142 if (word
== orig_text
)
6144 completion
= xmalloc (strlen (match
) + 5);
6145 strcpy (completion
, match
);
6147 else if (word
> orig_text
)
6149 /* Return some portion of sym_name. */
6150 completion
= xmalloc (strlen (match
) + 5);
6151 strcpy (completion
, match
+ (word
- orig_text
));
6155 /* Return some of ORIG_TEXT plus sym_name. */
6156 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
6157 strncpy (completion
, word
, orig_text
- word
);
6158 completion
[orig_text
- word
] = '\0';
6159 strcat (completion
, match
);
6162 VEC_safe_push (char_ptr
, *sv
, completion
);
6165 /* An object of this type is passed as the user_data argument to the
6166 expand_symtabs_matching method. */
6167 struct add_partial_datum
6169 VEC(char_ptr
) **completions
;
6178 /* A callback for expand_symtabs_matching. */
6181 ada_complete_symbol_matcher (const char *name
, void *user_data
)
6183 struct add_partial_datum
*data
= user_data
;
6185 return symbol_completion_match (name
, data
->text
, data
->text_len
,
6186 data
->wild_match
, data
->encoded
) != NULL
;
6189 /* Return a list of possible symbol names completing TEXT0. WORD is
6190 the entire command on which completion is made. */
6192 static VEC (char_ptr
) *
6193 ada_make_symbol_completion_list (const char *text0
, const char *word
,
6194 enum type_code code
)
6200 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
6202 struct compunit_symtab
*s
;
6203 struct minimal_symbol
*msymbol
;
6204 struct objfile
*objfile
;
6205 const struct block
*b
, *surrounding_static_block
= 0;
6207 struct block_iterator iter
;
6208 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6210 gdb_assert (code
== TYPE_CODE_UNDEF
);
6212 if (text0
[0] == '<')
6214 text
= xstrdup (text0
);
6215 make_cleanup (xfree
, text
);
6216 text_len
= strlen (text
);
6222 text
= xstrdup (ada_encode (text0
));
6223 make_cleanup (xfree
, text
);
6224 text_len
= strlen (text
);
6225 for (i
= 0; i
< text_len
; i
++)
6226 text
[i
] = tolower (text
[i
]);
6228 encoded_p
= (strstr (text0
, "__") != NULL
);
6229 /* If the name contains a ".", then the user is entering a fully
6230 qualified entity name, and the match must not be done in wild
6231 mode. Similarly, if the user wants to complete what looks like
6232 an encoded name, the match must not be done in wild mode. */
6233 wild_match_p
= (strchr (text0
, '.') == NULL
&& !encoded_p
);
6236 /* First, look at the partial symtab symbols. */
6238 struct add_partial_datum data
;
6240 data
.completions
= &completions
;
6242 data
.text_len
= text_len
;
6245 data
.wild_match
= wild_match_p
;
6246 data
.encoded
= encoded_p
;
6247 expand_symtabs_matching (NULL
, ada_complete_symbol_matcher
, NULL
,
6251 /* At this point scan through the misc symbol vectors and add each
6252 symbol you find to the list. Eventually we want to ignore
6253 anything that isn't a text symbol (everything else will be
6254 handled by the psymtab code above). */
6256 ALL_MSYMBOLS (objfile
, msymbol
)
6259 symbol_completion_add (&completions
, MSYMBOL_LINKAGE_NAME (msymbol
),
6260 text
, text_len
, text0
, word
, wild_match_p
,
6264 /* Search upwards from currently selected frame (so that we can
6265 complete on local vars. */
6267 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6269 if (!BLOCK_SUPERBLOCK (b
))
6270 surrounding_static_block
= b
; /* For elmin of dups */
6272 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6274 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6275 text
, text_len
, text0
, word
,
6276 wild_match_p
, encoded_p
);
6280 /* Go through the symtabs and check the externs and statics for
6281 symbols which match. */
6283 ALL_COMPUNITS (objfile
, s
)
6286 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6287 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6289 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6290 text
, text_len
, text0
, word
,
6291 wild_match_p
, encoded_p
);
6295 ALL_COMPUNITS (objfile
, s
)
6298 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6299 /* Don't do this block twice. */
6300 if (b
== surrounding_static_block
)
6302 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6304 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6305 text
, text_len
, text0
, word
,
6306 wild_match_p
, encoded_p
);
6310 do_cleanups (old_chain
);
6316 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6317 for tagged types. */
6320 ada_is_dispatch_table_ptr_type (struct type
*type
)
6324 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6327 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6331 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6334 /* Return non-zero if TYPE is an interface tag. */
6337 ada_is_interface_tag (struct type
*type
)
6339 const char *name
= TYPE_NAME (type
);
6344 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6347 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6348 to be invisible to users. */
6351 ada_is_ignored_field (struct type
*type
, int field_num
)
6353 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6356 /* Check the name of that field. */
6358 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6360 /* Anonymous field names should not be printed.
6361 brobecker/2007-02-20: I don't think this can actually happen
6362 but we don't want to print the value of annonymous fields anyway. */
6366 /* Normally, fields whose name start with an underscore ("_")
6367 are fields that have been internally generated by the compiler,
6368 and thus should not be printed. The "_parent" field is special,
6369 however: This is a field internally generated by the compiler
6370 for tagged types, and it contains the components inherited from
6371 the parent type. This field should not be printed as is, but
6372 should not be ignored either. */
6373 if (name
[0] == '_' && !startswith (name
, "_parent"))
6377 /* If this is the dispatch table of a tagged type or an interface tag,
6379 if (ada_is_tagged_type (type
, 1)
6380 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6381 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6384 /* Not a special field, so it should not be ignored. */
6388 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6389 pointer or reference type whose ultimate target has a tag field. */
6392 ada_is_tagged_type (struct type
*type
, int refok
)
6394 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
6397 /* True iff TYPE represents the type of X'Tag */
6400 ada_is_tag_type (struct type
*type
)
6402 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6406 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6408 return (name
!= NULL
6409 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6413 /* The type of the tag on VAL. */
6416 ada_tag_type (struct value
*val
)
6418 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6421 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6422 retired at Ada 05). */
6425 is_ada95_tag (struct value
*tag
)
6427 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6430 /* The value of the tag on VAL. */
6433 ada_value_tag (struct value
*val
)
6435 return ada_value_struct_elt (val
, "_tag", 0);
6438 /* The value of the tag on the object of type TYPE whose contents are
6439 saved at VALADDR, if it is non-null, or is at memory address
6442 static struct value
*
6443 value_tag_from_contents_and_address (struct type
*type
,
6444 const gdb_byte
*valaddr
,
6447 int tag_byte_offset
;
6448 struct type
*tag_type
;
6450 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6453 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6455 : valaddr
+ tag_byte_offset
);
6456 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6458 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6463 static struct type
*
6464 type_from_tag (struct value
*tag
)
6466 const char *type_name
= ada_tag_name (tag
);
6468 if (type_name
!= NULL
)
6469 return ada_find_any_type (ada_encode (type_name
));
6473 /* Given a value OBJ of a tagged type, return a value of this
6474 type at the base address of the object. The base address, as
6475 defined in Ada.Tags, it is the address of the primary tag of
6476 the object, and therefore where the field values of its full
6477 view can be fetched. */
6480 ada_tag_value_at_base_address (struct value
*obj
)
6482 volatile struct gdb_exception e
;
6484 LONGEST offset_to_top
= 0;
6485 struct type
*ptr_type
, *obj_type
;
6487 CORE_ADDR base_address
;
6489 obj_type
= value_type (obj
);
6491 /* It is the responsability of the caller to deref pointers. */
6493 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6494 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6497 tag
= ada_value_tag (obj
);
6501 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6503 if (is_ada95_tag (tag
))
6506 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6507 ptr_type
= lookup_pointer_type (ptr_type
);
6508 val
= value_cast (ptr_type
, tag
);
6512 /* It is perfectly possible that an exception be raised while
6513 trying to determine the base address, just like for the tag;
6514 see ada_tag_name for more details. We do not print the error
6515 message for the same reason. */
6517 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6519 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6525 /* If offset is null, nothing to do. */
6527 if (offset_to_top
== 0)
6530 /* -1 is a special case in Ada.Tags; however, what should be done
6531 is not quite clear from the documentation. So do nothing for
6534 if (offset_to_top
== -1)
6537 base_address
= value_address (obj
) - offset_to_top
;
6538 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6540 /* Make sure that we have a proper tag at the new address.
6541 Otherwise, offset_to_top is bogus (which can happen when
6542 the object is not initialized yet). */
6547 obj_type
= type_from_tag (tag
);
6552 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6555 /* Return the "ada__tags__type_specific_data" type. */
6557 static struct type
*
6558 ada_get_tsd_type (struct inferior
*inf
)
6560 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6562 if (data
->tsd_type
== 0)
6563 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6564 return data
->tsd_type
;
6567 /* Return the TSD (type-specific data) associated to the given TAG.
6568 TAG is assumed to be the tag of a tagged-type entity.
6570 May return NULL if we are unable to get the TSD. */
6572 static struct value
*
6573 ada_get_tsd_from_tag (struct value
*tag
)
6578 /* First option: The TSD is simply stored as a field of our TAG.
6579 Only older versions of GNAT would use this format, but we have
6580 to test it first, because there are no visible markers for
6581 the current approach except the absence of that field. */
6583 val
= ada_value_struct_elt (tag
, "tsd", 1);
6587 /* Try the second representation for the dispatch table (in which
6588 there is no explicit 'tsd' field in the referent of the tag pointer,
6589 and instead the tsd pointer is stored just before the dispatch
6592 type
= ada_get_tsd_type (current_inferior());
6595 type
= lookup_pointer_type (lookup_pointer_type (type
));
6596 val
= value_cast (type
, tag
);
6599 return value_ind (value_ptradd (val
, -1));
6602 /* Given the TSD of a tag (type-specific data), return a string
6603 containing the name of the associated type.
6605 The returned value is good until the next call. May return NULL
6606 if we are unable to determine the tag name. */
6609 ada_tag_name_from_tsd (struct value
*tsd
)
6611 static char name
[1024];
6615 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6618 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6619 for (p
= name
; *p
!= '\0'; p
+= 1)
6625 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6628 Return NULL if the TAG is not an Ada tag, or if we were unable to
6629 determine the name of that tag. The result is good until the next
6633 ada_tag_name (struct value
*tag
)
6635 volatile struct gdb_exception e
;
6638 if (!ada_is_tag_type (value_type (tag
)))
6641 /* It is perfectly possible that an exception be raised while trying
6642 to determine the TAG's name, even under normal circumstances:
6643 The associated variable may be uninitialized or corrupted, for
6644 instance. We do not let any exception propagate past this point.
6645 instead we return NULL.
6647 We also do not print the error message either (which often is very
6648 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6649 the caller print a more meaningful message if necessary. */
6650 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6652 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6655 name
= ada_tag_name_from_tsd (tsd
);
6661 /* The parent type of TYPE, or NULL if none. */
6664 ada_parent_type (struct type
*type
)
6668 type
= ada_check_typedef (type
);
6670 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6673 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6674 if (ada_is_parent_field (type
, i
))
6676 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6678 /* If the _parent field is a pointer, then dereference it. */
6679 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6680 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6681 /* If there is a parallel XVS type, get the actual base type. */
6682 parent_type
= ada_get_base_type (parent_type
);
6684 return ada_check_typedef (parent_type
);
6690 /* True iff field number FIELD_NUM of structure type TYPE contains the
6691 parent-type (inherited) fields of a derived type. Assumes TYPE is
6692 a structure type with at least FIELD_NUM+1 fields. */
6695 ada_is_parent_field (struct type
*type
, int field_num
)
6697 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6699 return (name
!= NULL
6700 && (startswith (name
, "PARENT")
6701 || startswith (name
, "_parent")));
6704 /* True iff field number FIELD_NUM of structure type TYPE is a
6705 transparent wrapper field (which should be silently traversed when doing
6706 field selection and flattened when printing). Assumes TYPE is a
6707 structure type with at least FIELD_NUM+1 fields. Such fields are always
6711 ada_is_wrapper_field (struct type
*type
, int field_num
)
6713 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6715 return (name
!= NULL
6716 && (startswith (name
, "PARENT")
6717 || strcmp (name
, "REP") == 0
6718 || startswith (name
, "_parent")
6719 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6722 /* True iff field number FIELD_NUM of structure or union type TYPE
6723 is a variant wrapper. Assumes TYPE is a structure type with at least
6724 FIELD_NUM+1 fields. */
6727 ada_is_variant_part (struct type
*type
, int field_num
)
6729 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6731 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6732 || (is_dynamic_field (type
, field_num
)
6733 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6734 == TYPE_CODE_UNION
)));
6737 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6738 whose discriminants are contained in the record type OUTER_TYPE,
6739 returns the type of the controlling discriminant for the variant.
6740 May return NULL if the type could not be found. */
6743 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6745 char *name
= ada_variant_discrim_name (var_type
);
6747 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6750 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6751 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6752 represents a 'when others' clause; otherwise 0. */
6755 ada_is_others_clause (struct type
*type
, int field_num
)
6757 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6759 return (name
!= NULL
&& name
[0] == 'O');
6762 /* Assuming that TYPE0 is the type of the variant part of a record,
6763 returns the name of the discriminant controlling the variant.
6764 The value is valid until the next call to ada_variant_discrim_name. */
6767 ada_variant_discrim_name (struct type
*type0
)
6769 static char *result
= NULL
;
6770 static size_t result_len
= 0;
6773 const char *discrim_end
;
6774 const char *discrim_start
;
6776 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6777 type
= TYPE_TARGET_TYPE (type0
);
6781 name
= ada_type_name (type
);
6783 if (name
== NULL
|| name
[0] == '\000')
6786 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6789 if (startswith (discrim_end
, "___XVN"))
6792 if (discrim_end
== name
)
6795 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6798 if (discrim_start
== name
+ 1)
6800 if ((discrim_start
> name
+ 3
6801 && startswith (discrim_start
- 3, "___"))
6802 || discrim_start
[-1] == '.')
6806 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6807 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6808 result
[discrim_end
- discrim_start
] = '\0';
6812 /* Scan STR for a subtype-encoded number, beginning at position K.
6813 Put the position of the character just past the number scanned in
6814 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6815 Return 1 if there was a valid number at the given position, and 0
6816 otherwise. A "subtype-encoded" number consists of the absolute value
6817 in decimal, followed by the letter 'm' to indicate a negative number.
6818 Assumes 0m does not occur. */
6821 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6825 if (!isdigit (str
[k
]))
6828 /* Do it the hard way so as not to make any assumption about
6829 the relationship of unsigned long (%lu scan format code) and
6832 while (isdigit (str
[k
]))
6834 RU
= RU
* 10 + (str
[k
] - '0');
6841 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6847 /* NOTE on the above: Technically, C does not say what the results of
6848 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6849 number representable as a LONGEST (although either would probably work
6850 in most implementations). When RU>0, the locution in the then branch
6851 above is always equivalent to the negative of RU. */
6858 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6859 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6860 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6863 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6865 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6879 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6889 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6890 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6892 if (val
>= L
&& val
<= U
)
6904 /* FIXME: Lots of redundancy below. Try to consolidate. */
6906 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6907 ARG_TYPE, extract and return the value of one of its (non-static)
6908 fields. FIELDNO says which field. Differs from value_primitive_field
6909 only in that it can handle packed values of arbitrary type. */
6911 static struct value
*
6912 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6913 struct type
*arg_type
)
6917 arg_type
= ada_check_typedef (arg_type
);
6918 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6920 /* Handle packed fields. */
6922 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6924 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6925 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6927 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6928 offset
+ bit_pos
/ 8,
6929 bit_pos
% 8, bit_size
, type
);
6932 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6935 /* Find field with name NAME in object of type TYPE. If found,
6936 set the following for each argument that is non-null:
6937 - *FIELD_TYPE_P to the field's type;
6938 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6939 an object of that type;
6940 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6941 - *BIT_SIZE_P to its size in bits if the field is packed, and
6943 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6944 fields up to but not including the desired field, or by the total
6945 number of fields if not found. A NULL value of NAME never
6946 matches; the function just counts visible fields in this case.
6948 Returns 1 if found, 0 otherwise. */
6951 find_struct_field (const char *name
, struct type
*type
, int offset
,
6952 struct type
**field_type_p
,
6953 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6958 type
= ada_check_typedef (type
);
6960 if (field_type_p
!= NULL
)
6961 *field_type_p
= NULL
;
6962 if (byte_offset_p
!= NULL
)
6964 if (bit_offset_p
!= NULL
)
6966 if (bit_size_p
!= NULL
)
6969 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6971 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6972 int fld_offset
= offset
+ bit_pos
/ 8;
6973 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6975 if (t_field_name
== NULL
)
6978 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6980 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6982 if (field_type_p
!= NULL
)
6983 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6984 if (byte_offset_p
!= NULL
)
6985 *byte_offset_p
= fld_offset
;
6986 if (bit_offset_p
!= NULL
)
6987 *bit_offset_p
= bit_pos
% 8;
6988 if (bit_size_p
!= NULL
)
6989 *bit_size_p
= bit_size
;
6992 else if (ada_is_wrapper_field (type
, i
))
6994 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6995 field_type_p
, byte_offset_p
, bit_offset_p
,
6996 bit_size_p
, index_p
))
6999 else if (ada_is_variant_part (type
, i
))
7001 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7004 struct type
*field_type
7005 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7007 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7009 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7011 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7012 field_type_p
, byte_offset_p
,
7013 bit_offset_p
, bit_size_p
, index_p
))
7017 else if (index_p
!= NULL
)
7023 /* Number of user-visible fields in record type TYPE. */
7026 num_visible_fields (struct type
*type
)
7031 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7035 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7036 and search in it assuming it has (class) type TYPE.
7037 If found, return value, else return NULL.
7039 Searches recursively through wrapper fields (e.g., '_parent'). */
7041 static struct value
*
7042 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
7047 type
= ada_check_typedef (type
);
7048 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7050 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7052 if (t_field_name
== NULL
)
7055 else if (field_name_match (t_field_name
, name
))
7056 return ada_value_primitive_field (arg
, offset
, i
, type
);
7058 else if (ada_is_wrapper_field (type
, i
))
7060 struct value
*v
= /* Do not let indent join lines here. */
7061 ada_search_struct_field (name
, arg
,
7062 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7063 TYPE_FIELD_TYPE (type
, i
));
7069 else if (ada_is_variant_part (type
, i
))
7071 /* PNH: Do we ever get here? See find_struct_field. */
7073 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7075 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7077 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7079 struct value
*v
= ada_search_struct_field
/* Force line
7082 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7083 TYPE_FIELD_TYPE (field_type
, j
));
7093 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7094 int, struct type
*);
7097 /* Return field #INDEX in ARG, where the index is that returned by
7098 * find_struct_field through its INDEX_P argument. Adjust the address
7099 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7100 * If found, return value, else return NULL. */
7102 static struct value
*
7103 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7106 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7110 /* Auxiliary function for ada_index_struct_field. Like
7111 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7114 static struct value
*
7115 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7119 type
= ada_check_typedef (type
);
7121 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7123 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7125 else if (ada_is_wrapper_field (type
, i
))
7127 struct value
*v
= /* Do not let indent join lines here. */
7128 ada_index_struct_field_1 (index_p
, arg
,
7129 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7130 TYPE_FIELD_TYPE (type
, i
));
7136 else if (ada_is_variant_part (type
, i
))
7138 /* PNH: Do we ever get here? See ada_search_struct_field,
7139 find_struct_field. */
7140 error (_("Cannot assign this kind of variant record"));
7142 else if (*index_p
== 0)
7143 return ada_value_primitive_field (arg
, offset
, i
, type
);
7150 /* Given ARG, a value of type (pointer or reference to a)*
7151 structure/union, extract the component named NAME from the ultimate
7152 target structure/union and return it as a value with its
7155 The routine searches for NAME among all members of the structure itself
7156 and (recursively) among all members of any wrapper members
7159 If NO_ERR, then simply return NULL in case of error, rather than
7163 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
7165 struct type
*t
, *t1
;
7169 t1
= t
= ada_check_typedef (value_type (arg
));
7170 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7172 t1
= TYPE_TARGET_TYPE (t
);
7175 t1
= ada_check_typedef (t1
);
7176 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7178 arg
= coerce_ref (arg
);
7183 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7185 t1
= TYPE_TARGET_TYPE (t
);
7188 t1
= ada_check_typedef (t1
);
7189 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7191 arg
= value_ind (arg
);
7198 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7202 v
= ada_search_struct_field (name
, arg
, 0, t
);
7205 int bit_offset
, bit_size
, byte_offset
;
7206 struct type
*field_type
;
7209 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7210 address
= value_address (ada_value_ind (arg
));
7212 address
= value_address (ada_coerce_ref (arg
));
7214 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7215 if (find_struct_field (name
, t1
, 0,
7216 &field_type
, &byte_offset
, &bit_offset
,
7221 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7222 arg
= ada_coerce_ref (arg
);
7224 arg
= ada_value_ind (arg
);
7225 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7226 bit_offset
, bit_size
,
7230 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7234 if (v
!= NULL
|| no_err
)
7237 error (_("There is no member named %s."), name
);
7243 error (_("Attempt to extract a component of "
7244 "a value that is not a record."));
7247 /* Given a type TYPE, look up the type of the component of type named NAME.
7248 If DISPP is non-null, add its byte displacement from the beginning of a
7249 structure (pointed to by a value) of type TYPE to *DISPP (does not
7250 work for packed fields).
7252 Matches any field whose name has NAME as a prefix, possibly
7255 TYPE can be either a struct or union. If REFOK, TYPE may also
7256 be a (pointer or reference)+ to a struct or union, and the
7257 ultimate target type will be searched.
7259 Looks recursively into variant clauses and parent types.
7261 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7262 TYPE is not a type of the right kind. */
7264 static struct type
*
7265 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7266 int noerr
, int *dispp
)
7273 if (refok
&& type
!= NULL
)
7276 type
= ada_check_typedef (type
);
7277 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7278 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7280 type
= TYPE_TARGET_TYPE (type
);
7284 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7285 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7291 target_terminal_ours ();
7292 gdb_flush (gdb_stdout
);
7294 error (_("Type (null) is not a structure or union type"));
7297 /* XXX: type_sprint */
7298 fprintf_unfiltered (gdb_stderr
, _("Type "));
7299 type_print (type
, "", gdb_stderr
, -1);
7300 error (_(" is not a structure or union type"));
7305 type
= to_static_fixed_type (type
);
7307 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7309 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7313 if (t_field_name
== NULL
)
7316 else if (field_name_match (t_field_name
, name
))
7319 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7320 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7323 else if (ada_is_wrapper_field (type
, i
))
7326 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7331 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7336 else if (ada_is_variant_part (type
, i
))
7339 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7342 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7344 /* FIXME pnh 2008/01/26: We check for a field that is
7345 NOT wrapped in a struct, since the compiler sometimes
7346 generates these for unchecked variant types. Revisit
7347 if the compiler changes this practice. */
7348 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7350 if (v_field_name
!= NULL
7351 && field_name_match (v_field_name
, name
))
7352 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
7354 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7361 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7372 target_terminal_ours ();
7373 gdb_flush (gdb_stdout
);
7376 /* XXX: type_sprint */
7377 fprintf_unfiltered (gdb_stderr
, _("Type "));
7378 type_print (type
, "", gdb_stderr
, -1);
7379 error (_(" has no component named <null>"));
7383 /* XXX: type_sprint */
7384 fprintf_unfiltered (gdb_stderr
, _("Type "));
7385 type_print (type
, "", gdb_stderr
, -1);
7386 error (_(" has no component named %s"), name
);
7393 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7394 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7395 represents an unchecked union (that is, the variant part of a
7396 record that is named in an Unchecked_Union pragma). */
7399 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7401 char *discrim_name
= ada_variant_discrim_name (var_type
);
7403 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
7408 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7409 within a value of type OUTER_TYPE that is stored in GDB at
7410 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7411 numbering from 0) is applicable. Returns -1 if none are. */
7414 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7415 const gdb_byte
*outer_valaddr
)
7419 char *discrim_name
= ada_variant_discrim_name (var_type
);
7420 struct value
*outer
;
7421 struct value
*discrim
;
7422 LONGEST discrim_val
;
7424 /* Using plain value_from_contents_and_address here causes problems
7425 because we will end up trying to resolve a type that is currently
7426 being constructed. */
7427 outer
= value_from_contents_and_address_unresolved (outer_type
,
7429 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7430 if (discrim
== NULL
)
7432 discrim_val
= value_as_long (discrim
);
7435 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7437 if (ada_is_others_clause (var_type
, i
))
7439 else if (ada_in_variant (discrim_val
, var_type
, i
))
7443 return others_clause
;
7448 /* Dynamic-Sized Records */
7450 /* Strategy: The type ostensibly attached to a value with dynamic size
7451 (i.e., a size that is not statically recorded in the debugging
7452 data) does not accurately reflect the size or layout of the value.
7453 Our strategy is to convert these values to values with accurate,
7454 conventional types that are constructed on the fly. */
7456 /* There is a subtle and tricky problem here. In general, we cannot
7457 determine the size of dynamic records without its data. However,
7458 the 'struct value' data structure, which GDB uses to represent
7459 quantities in the inferior process (the target), requires the size
7460 of the type at the time of its allocation in order to reserve space
7461 for GDB's internal copy of the data. That's why the
7462 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7463 rather than struct value*s.
7465 However, GDB's internal history variables ($1, $2, etc.) are
7466 struct value*s containing internal copies of the data that are not, in
7467 general, the same as the data at their corresponding addresses in
7468 the target. Fortunately, the types we give to these values are all
7469 conventional, fixed-size types (as per the strategy described
7470 above), so that we don't usually have to perform the
7471 'to_fixed_xxx_type' conversions to look at their values.
7472 Unfortunately, there is one exception: if one of the internal
7473 history variables is an array whose elements are unconstrained
7474 records, then we will need to create distinct fixed types for each
7475 element selected. */
7477 /* The upshot of all of this is that many routines take a (type, host
7478 address, target address) triple as arguments to represent a value.
7479 The host address, if non-null, is supposed to contain an internal
7480 copy of the relevant data; otherwise, the program is to consult the
7481 target at the target address. */
7483 /* Assuming that VAL0 represents a pointer value, the result of
7484 dereferencing it. Differs from value_ind in its treatment of
7485 dynamic-sized types. */
7488 ada_value_ind (struct value
*val0
)
7490 struct value
*val
= value_ind (val0
);
7492 if (ada_is_tagged_type (value_type (val
), 0))
7493 val
= ada_tag_value_at_base_address (val
);
7495 return ada_to_fixed_value (val
);
7498 /* The value resulting from dereferencing any "reference to"
7499 qualifiers on VAL0. */
7501 static struct value
*
7502 ada_coerce_ref (struct value
*val0
)
7504 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7506 struct value
*val
= val0
;
7508 val
= coerce_ref (val
);
7510 if (ada_is_tagged_type (value_type (val
), 0))
7511 val
= ada_tag_value_at_base_address (val
);
7513 return ada_to_fixed_value (val
);
7519 /* Return OFF rounded upward if necessary to a multiple of
7520 ALIGNMENT (a power of 2). */
7523 align_value (unsigned int off
, unsigned int alignment
)
7525 return (off
+ alignment
- 1) & ~(alignment
- 1);
7528 /* Return the bit alignment required for field #F of template type TYPE. */
7531 field_alignment (struct type
*type
, int f
)
7533 const char *name
= TYPE_FIELD_NAME (type
, f
);
7537 /* The field name should never be null, unless the debugging information
7538 is somehow malformed. In this case, we assume the field does not
7539 require any alignment. */
7543 len
= strlen (name
);
7545 if (!isdigit (name
[len
- 1]))
7548 if (isdigit (name
[len
- 2]))
7549 align_offset
= len
- 2;
7551 align_offset
= len
- 1;
7553 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7554 return TARGET_CHAR_BIT
;
7556 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7559 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7561 static struct symbol
*
7562 ada_find_any_type_symbol (const char *name
)
7566 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7567 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7570 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7574 /* Find a type named NAME. Ignores ambiguity. This routine will look
7575 solely for types defined by debug info, it will not search the GDB
7578 static struct type
*
7579 ada_find_any_type (const char *name
)
7581 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7584 return SYMBOL_TYPE (sym
);
7589 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7590 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7591 symbol, in which case it is returned. Otherwise, this looks for
7592 symbols whose name is that of NAME_SYM suffixed with "___XR".
7593 Return symbol if found, and NULL otherwise. */
7596 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7598 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7601 if (strstr (name
, "___XR") != NULL
)
7604 sym
= find_old_style_renaming_symbol (name
, block
);
7609 /* Not right yet. FIXME pnh 7/20/2007. */
7610 sym
= ada_find_any_type_symbol (name
);
7611 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7617 static struct symbol
*
7618 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7620 const struct symbol
*function_sym
= block_linkage_function (block
);
7623 if (function_sym
!= NULL
)
7625 /* If the symbol is defined inside a function, NAME is not fully
7626 qualified. This means we need to prepend the function name
7627 as well as adding the ``___XR'' suffix to build the name of
7628 the associated renaming symbol. */
7629 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7630 /* Function names sometimes contain suffixes used
7631 for instance to qualify nested subprograms. When building
7632 the XR type name, we need to make sure that this suffix is
7633 not included. So do not include any suffix in the function
7634 name length below. */
7635 int function_name_len
= ada_name_prefix_len (function_name
);
7636 const int rename_len
= function_name_len
+ 2 /* "__" */
7637 + strlen (name
) + 6 /* "___XR\0" */ ;
7639 /* Strip the suffix if necessary. */
7640 ada_remove_trailing_digits (function_name
, &function_name_len
);
7641 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7642 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7644 /* Library-level functions are a special case, as GNAT adds
7645 a ``_ada_'' prefix to the function name to avoid namespace
7646 pollution. However, the renaming symbols themselves do not
7647 have this prefix, so we need to skip this prefix if present. */
7648 if (function_name_len
> 5 /* "_ada_" */
7649 && strstr (function_name
, "_ada_") == function_name
)
7652 function_name_len
-= 5;
7655 rename
= (char *) alloca (rename_len
* sizeof (char));
7656 strncpy (rename
, function_name
, function_name_len
);
7657 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7662 const int rename_len
= strlen (name
) + 6;
7664 rename
= (char *) alloca (rename_len
* sizeof (char));
7665 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7668 return ada_find_any_type_symbol (rename
);
7671 /* Because of GNAT encoding conventions, several GDB symbols may match a
7672 given type name. If the type denoted by TYPE0 is to be preferred to
7673 that of TYPE1 for purposes of type printing, return non-zero;
7674 otherwise return 0. */
7677 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7681 else if (type0
== NULL
)
7683 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7685 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7687 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7689 else if (ada_is_constrained_packed_array_type (type0
))
7691 else if (ada_is_array_descriptor_type (type0
)
7692 && !ada_is_array_descriptor_type (type1
))
7696 const char *type0_name
= type_name_no_tag (type0
);
7697 const char *type1_name
= type_name_no_tag (type1
);
7699 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7700 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7706 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7707 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7710 ada_type_name (struct type
*type
)
7714 else if (TYPE_NAME (type
) != NULL
)
7715 return TYPE_NAME (type
);
7717 return TYPE_TAG_NAME (type
);
7720 /* Search the list of "descriptive" types associated to TYPE for a type
7721 whose name is NAME. */
7723 static struct type
*
7724 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7726 struct type
*result
;
7728 if (ada_ignore_descriptive_types_p
)
7731 /* If there no descriptive-type info, then there is no parallel type
7733 if (!HAVE_GNAT_AUX_INFO (type
))
7736 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7737 while (result
!= NULL
)
7739 const char *result_name
= ada_type_name (result
);
7741 if (result_name
== NULL
)
7743 warning (_("unexpected null name on descriptive type"));
7747 /* If the names match, stop. */
7748 if (strcmp (result_name
, name
) == 0)
7751 /* Otherwise, look at the next item on the list, if any. */
7752 if (HAVE_GNAT_AUX_INFO (result
))
7753 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7758 /* If we didn't find a match, see whether this is a packed array. With
7759 older compilers, the descriptive type information is either absent or
7760 irrelevant when it comes to packed arrays so the above lookup fails.
7761 Fall back to using a parallel lookup by name in this case. */
7762 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7763 return ada_find_any_type (name
);
7768 /* Find a parallel type to TYPE with the specified NAME, using the
7769 descriptive type taken from the debugging information, if available,
7770 and otherwise using the (slower) name-based method. */
7772 static struct type
*
7773 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7775 struct type
*result
= NULL
;
7777 if (HAVE_GNAT_AUX_INFO (type
))
7778 result
= find_parallel_type_by_descriptive_type (type
, name
);
7780 result
= ada_find_any_type (name
);
7785 /* Same as above, but specify the name of the parallel type by appending
7786 SUFFIX to the name of TYPE. */
7789 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7792 const char *type_name
= ada_type_name (type
);
7795 if (type_name
== NULL
)
7798 len
= strlen (type_name
);
7800 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7802 strcpy (name
, type_name
);
7803 strcpy (name
+ len
, suffix
);
7805 return ada_find_parallel_type_with_name (type
, name
);
7808 /* If TYPE is a variable-size record type, return the corresponding template
7809 type describing its fields. Otherwise, return NULL. */
7811 static struct type
*
7812 dynamic_template_type (struct type
*type
)
7814 type
= ada_check_typedef (type
);
7816 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7817 || ada_type_name (type
) == NULL
)
7821 int len
= strlen (ada_type_name (type
));
7823 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7826 return ada_find_parallel_type (type
, "___XVE");
7830 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7831 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7834 is_dynamic_field (struct type
*templ_type
, int field_num
)
7836 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7839 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7840 && strstr (name
, "___XVL") != NULL
;
7843 /* The index of the variant field of TYPE, or -1 if TYPE does not
7844 represent a variant record type. */
7847 variant_field_index (struct type
*type
)
7851 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7854 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7856 if (ada_is_variant_part (type
, f
))
7862 /* A record type with no fields. */
7864 static struct type
*
7865 empty_record (struct type
*templ
)
7867 struct type
*type
= alloc_type_copy (templ
);
7869 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7870 TYPE_NFIELDS (type
) = 0;
7871 TYPE_FIELDS (type
) = NULL
;
7872 INIT_CPLUS_SPECIFIC (type
);
7873 TYPE_NAME (type
) = "<empty>";
7874 TYPE_TAG_NAME (type
) = NULL
;
7875 TYPE_LENGTH (type
) = 0;
7879 /* An ordinary record type (with fixed-length fields) that describes
7880 the value of type TYPE at VALADDR or ADDRESS (see comments at
7881 the beginning of this section) VAL according to GNAT conventions.
7882 DVAL0 should describe the (portion of a) record that contains any
7883 necessary discriminants. It should be NULL if value_type (VAL) is
7884 an outer-level type (i.e., as opposed to a branch of a variant.) A
7885 variant field (unless unchecked) is replaced by a particular branch
7888 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7889 length are not statically known are discarded. As a consequence,
7890 VALADDR, ADDRESS and DVAL0 are ignored.
7892 NOTE: Limitations: For now, we assume that dynamic fields and
7893 variants occupy whole numbers of bytes. However, they need not be
7897 ada_template_to_fixed_record_type_1 (struct type
*type
,
7898 const gdb_byte
*valaddr
,
7899 CORE_ADDR address
, struct value
*dval0
,
7900 int keep_dynamic_fields
)
7902 struct value
*mark
= value_mark ();
7905 int nfields
, bit_len
;
7911 /* Compute the number of fields in this record type that are going
7912 to be processed: unless keep_dynamic_fields, this includes only
7913 fields whose position and length are static will be processed. */
7914 if (keep_dynamic_fields
)
7915 nfields
= TYPE_NFIELDS (type
);
7919 while (nfields
< TYPE_NFIELDS (type
)
7920 && !ada_is_variant_part (type
, nfields
)
7921 && !is_dynamic_field (type
, nfields
))
7925 rtype
= alloc_type_copy (type
);
7926 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7927 INIT_CPLUS_SPECIFIC (rtype
);
7928 TYPE_NFIELDS (rtype
) = nfields
;
7929 TYPE_FIELDS (rtype
) = (struct field
*)
7930 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7931 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7932 TYPE_NAME (rtype
) = ada_type_name (type
);
7933 TYPE_TAG_NAME (rtype
) = NULL
;
7934 TYPE_FIXED_INSTANCE (rtype
) = 1;
7940 for (f
= 0; f
< nfields
; f
+= 1)
7942 off
= align_value (off
, field_alignment (type
, f
))
7943 + TYPE_FIELD_BITPOS (type
, f
);
7944 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
7945 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7947 if (ada_is_variant_part (type
, f
))
7952 else if (is_dynamic_field (type
, f
))
7954 const gdb_byte
*field_valaddr
= valaddr
;
7955 CORE_ADDR field_address
= address
;
7956 struct type
*field_type
=
7957 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7961 /* rtype's length is computed based on the run-time
7962 value of discriminants. If the discriminants are not
7963 initialized, the type size may be completely bogus and
7964 GDB may fail to allocate a value for it. So check the
7965 size first before creating the value. */
7966 ada_ensure_varsize_limit (rtype
);
7967 /* Using plain value_from_contents_and_address here
7968 causes problems because we will end up trying to
7969 resolve a type that is currently being
7971 dval
= value_from_contents_and_address_unresolved (rtype
,
7974 rtype
= value_type (dval
);
7979 /* If the type referenced by this field is an aligner type, we need
7980 to unwrap that aligner type, because its size might not be set.
7981 Keeping the aligner type would cause us to compute the wrong
7982 size for this field, impacting the offset of the all the fields
7983 that follow this one. */
7984 if (ada_is_aligner_type (field_type
))
7986 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7988 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7989 field_address
= cond_offset_target (field_address
, field_offset
);
7990 field_type
= ada_aligned_type (field_type
);
7993 field_valaddr
= cond_offset_host (field_valaddr
,
7994 off
/ TARGET_CHAR_BIT
);
7995 field_address
= cond_offset_target (field_address
,
7996 off
/ TARGET_CHAR_BIT
);
7998 /* Get the fixed type of the field. Note that, in this case,
7999 we do not want to get the real type out of the tag: if
8000 the current field is the parent part of a tagged record,
8001 we will get the tag of the object. Clearly wrong: the real
8002 type of the parent is not the real type of the child. We
8003 would end up in an infinite loop. */
8004 field_type
= ada_get_base_type (field_type
);
8005 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8006 field_address
, dval
, 0);
8007 /* If the field size is already larger than the maximum
8008 object size, then the record itself will necessarily
8009 be larger than the maximum object size. We need to make
8010 this check now, because the size might be so ridiculously
8011 large (due to an uninitialized variable in the inferior)
8012 that it would cause an overflow when adding it to the
8014 ada_ensure_varsize_limit (field_type
);
8016 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8017 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8018 /* The multiplication can potentially overflow. But because
8019 the field length has been size-checked just above, and
8020 assuming that the maximum size is a reasonable value,
8021 an overflow should not happen in practice. So rather than
8022 adding overflow recovery code to this already complex code,
8023 we just assume that it's not going to happen. */
8025 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8029 /* Note: If this field's type is a typedef, it is important
8030 to preserve the typedef layer.
8032 Otherwise, we might be transforming a typedef to a fat
8033 pointer (encoding a pointer to an unconstrained array),
8034 into a basic fat pointer (encoding an unconstrained
8035 array). As both types are implemented using the same
8036 structure, the typedef is the only clue which allows us
8037 to distinguish between the two options. Stripping it
8038 would prevent us from printing this field appropriately. */
8039 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8040 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8041 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8043 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8046 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8048 /* We need to be careful of typedefs when computing
8049 the length of our field. If this is a typedef,
8050 get the length of the target type, not the length
8052 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8053 field_type
= ada_typedef_target_type (field_type
);
8056 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8059 if (off
+ fld_bit_len
> bit_len
)
8060 bit_len
= off
+ fld_bit_len
;
8062 TYPE_LENGTH (rtype
) =
8063 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8066 /* We handle the variant part, if any, at the end because of certain
8067 odd cases in which it is re-ordered so as NOT to be the last field of
8068 the record. This can happen in the presence of representation
8070 if (variant_field
>= 0)
8072 struct type
*branch_type
;
8074 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8078 /* Using plain value_from_contents_and_address here causes
8079 problems because we will end up trying to resolve a type
8080 that is currently being constructed. */
8081 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8083 rtype
= value_type (dval
);
8089 to_fixed_variant_branch_type
8090 (TYPE_FIELD_TYPE (type
, variant_field
),
8091 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8092 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8093 if (branch_type
== NULL
)
8095 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8096 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8097 TYPE_NFIELDS (rtype
) -= 1;
8101 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8102 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8104 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8106 if (off
+ fld_bit_len
> bit_len
)
8107 bit_len
= off
+ fld_bit_len
;
8108 TYPE_LENGTH (rtype
) =
8109 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8113 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8114 should contain the alignment of that record, which should be a strictly
8115 positive value. If null or negative, then something is wrong, most
8116 probably in the debug info. In that case, we don't round up the size
8117 of the resulting type. If this record is not part of another structure,
8118 the current RTYPE length might be good enough for our purposes. */
8119 if (TYPE_LENGTH (type
) <= 0)
8121 if (TYPE_NAME (rtype
))
8122 warning (_("Invalid type size for `%s' detected: %d."),
8123 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8125 warning (_("Invalid type size for <unnamed> detected: %d."),
8126 TYPE_LENGTH (type
));
8130 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8131 TYPE_LENGTH (type
));
8134 value_free_to_mark (mark
);
8135 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8136 error (_("record type with dynamic size is larger than varsize-limit"));
8140 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8143 static struct type
*
8144 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8145 CORE_ADDR address
, struct value
*dval0
)
8147 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8151 /* An ordinary record type in which ___XVL-convention fields and
8152 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8153 static approximations, containing all possible fields. Uses
8154 no runtime values. Useless for use in values, but that's OK,
8155 since the results are used only for type determinations. Works on both
8156 structs and unions. Representation note: to save space, we memorize
8157 the result of this function in the TYPE_TARGET_TYPE of the
8160 static struct type
*
8161 template_to_static_fixed_type (struct type
*type0
)
8167 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8168 return TYPE_TARGET_TYPE (type0
);
8170 nfields
= TYPE_NFIELDS (type0
);
8173 for (f
= 0; f
< nfields
; f
+= 1)
8175 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
8176 struct type
*new_type
;
8178 if (is_dynamic_field (type0
, f
))
8179 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8181 new_type
= static_unwrap_type (field_type
);
8182 if (type
== type0
&& new_type
!= field_type
)
8184 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8185 TYPE_CODE (type
) = TYPE_CODE (type0
);
8186 INIT_CPLUS_SPECIFIC (type
);
8187 TYPE_NFIELDS (type
) = nfields
;
8188 TYPE_FIELDS (type
) = (struct field
*)
8189 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8190 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8191 sizeof (struct field
) * nfields
);
8192 TYPE_NAME (type
) = ada_type_name (type0
);
8193 TYPE_TAG_NAME (type
) = NULL
;
8194 TYPE_FIXED_INSTANCE (type
) = 1;
8195 TYPE_LENGTH (type
) = 0;
8197 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8198 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8203 /* Given an object of type TYPE whose contents are at VALADDR and
8204 whose address in memory is ADDRESS, returns a revision of TYPE,
8205 which should be a non-dynamic-sized record, in which the variant
8206 part, if any, is replaced with the appropriate branch. Looks
8207 for discriminant values in DVAL0, which can be NULL if the record
8208 contains the necessary discriminant values. */
8210 static struct type
*
8211 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8212 CORE_ADDR address
, struct value
*dval0
)
8214 struct value
*mark
= value_mark ();
8217 struct type
*branch_type
;
8218 int nfields
= TYPE_NFIELDS (type
);
8219 int variant_field
= variant_field_index (type
);
8221 if (variant_field
== -1)
8226 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8227 type
= value_type (dval
);
8232 rtype
= alloc_type_copy (type
);
8233 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8234 INIT_CPLUS_SPECIFIC (rtype
);
8235 TYPE_NFIELDS (rtype
) = nfields
;
8236 TYPE_FIELDS (rtype
) =
8237 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8238 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8239 sizeof (struct field
) * nfields
);
8240 TYPE_NAME (rtype
) = ada_type_name (type
);
8241 TYPE_TAG_NAME (rtype
) = NULL
;
8242 TYPE_FIXED_INSTANCE (rtype
) = 1;
8243 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8245 branch_type
= to_fixed_variant_branch_type
8246 (TYPE_FIELD_TYPE (type
, variant_field
),
8247 cond_offset_host (valaddr
,
8248 TYPE_FIELD_BITPOS (type
, variant_field
)
8250 cond_offset_target (address
,
8251 TYPE_FIELD_BITPOS (type
, variant_field
)
8252 / TARGET_CHAR_BIT
), dval
);
8253 if (branch_type
== NULL
)
8257 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8258 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8259 TYPE_NFIELDS (rtype
) -= 1;
8263 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8264 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8265 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8266 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8268 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8270 value_free_to_mark (mark
);
8274 /* An ordinary record type (with fixed-length fields) that describes
8275 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8276 beginning of this section]. Any necessary discriminants' values
8277 should be in DVAL, a record value; it may be NULL if the object
8278 at ADDR itself contains any necessary discriminant values.
8279 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8280 values from the record are needed. Except in the case that DVAL,
8281 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8282 unchecked) is replaced by a particular branch of the variant.
8284 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8285 is questionable and may be removed. It can arise during the
8286 processing of an unconstrained-array-of-record type where all the
8287 variant branches have exactly the same size. This is because in
8288 such cases, the compiler does not bother to use the XVS convention
8289 when encoding the record. I am currently dubious of this
8290 shortcut and suspect the compiler should be altered. FIXME. */
8292 static struct type
*
8293 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8294 CORE_ADDR address
, struct value
*dval
)
8296 struct type
*templ_type
;
8298 if (TYPE_FIXED_INSTANCE (type0
))
8301 templ_type
= dynamic_template_type (type0
);
8303 if (templ_type
!= NULL
)
8304 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8305 else if (variant_field_index (type0
) >= 0)
8307 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8309 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8314 TYPE_FIXED_INSTANCE (type0
) = 1;
8320 /* An ordinary record type (with fixed-length fields) that describes
8321 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8322 union type. Any necessary discriminants' values should be in DVAL,
8323 a record value. That is, this routine selects the appropriate
8324 branch of the union at ADDR according to the discriminant value
8325 indicated in the union's type name. Returns VAR_TYPE0 itself if
8326 it represents a variant subject to a pragma Unchecked_Union. */
8328 static struct type
*
8329 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8330 CORE_ADDR address
, struct value
*dval
)
8333 struct type
*templ_type
;
8334 struct type
*var_type
;
8336 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8337 var_type
= TYPE_TARGET_TYPE (var_type0
);
8339 var_type
= var_type0
;
8341 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8343 if (templ_type
!= NULL
)
8344 var_type
= templ_type
;
8346 if (is_unchecked_variant (var_type
, value_type (dval
)))
8349 ada_which_variant_applies (var_type
,
8350 value_type (dval
), value_contents (dval
));
8353 return empty_record (var_type
);
8354 else if (is_dynamic_field (var_type
, which
))
8355 return to_fixed_record_type
8356 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8357 valaddr
, address
, dval
);
8358 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8360 to_fixed_record_type
8361 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8363 return TYPE_FIELD_TYPE (var_type
, which
);
8366 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8367 ENCODING_TYPE, a type following the GNAT conventions for discrete
8368 type encodings, only carries redundant information. */
8371 ada_is_redundant_range_encoding (struct type
*range_type
,
8372 struct type
*encoding_type
)
8374 struct type
*fixed_range_type
;
8379 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8381 if (TYPE_CODE (get_base_type (range_type
))
8382 != TYPE_CODE (get_base_type (encoding_type
)))
8384 /* The compiler probably used a simple base type to describe
8385 the range type instead of the range's actual base type,
8386 expecting us to get the real base type from the encoding
8387 anyway. In this situation, the encoding cannot be ignored
8392 if (is_dynamic_type (range_type
))
8395 if (TYPE_NAME (encoding_type
) == NULL
)
8398 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8399 if (bounds_str
== NULL
)
8402 n
= 8; /* Skip "___XDLU_". */
8403 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8405 if (TYPE_LOW_BOUND (range_type
) != lo
)
8408 n
+= 2; /* Skip the "__" separator between the two bounds. */
8409 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8411 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8417 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8418 a type following the GNAT encoding for describing array type
8419 indices, only carries redundant information. */
8422 ada_is_redundant_index_type_desc (struct type
*array_type
,
8423 struct type
*desc_type
)
8425 struct type
*this_layer
= check_typedef (array_type
);
8428 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8430 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8431 TYPE_FIELD_TYPE (desc_type
, i
)))
8433 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8439 /* Assuming that TYPE0 is an array type describing the type of a value
8440 at ADDR, and that DVAL describes a record containing any
8441 discriminants used in TYPE0, returns a type for the value that
8442 contains no dynamic components (that is, no components whose sizes
8443 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8444 true, gives an error message if the resulting type's size is over
8447 static struct type
*
8448 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8451 struct type
*index_type_desc
;
8452 struct type
*result
;
8453 int constrained_packed_array_p
;
8455 type0
= ada_check_typedef (type0
);
8456 if (TYPE_FIXED_INSTANCE (type0
))
8459 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8460 if (constrained_packed_array_p
)
8461 type0
= decode_constrained_packed_array_type (type0
);
8463 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
8464 ada_fixup_array_indexes_type (index_type_desc
);
8465 if (index_type_desc
!= NULL
8466 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8468 /* Ignore this ___XA parallel type, as it does not bring any
8469 useful information. This allows us to avoid creating fixed
8470 versions of the array's index types, which would be identical
8471 to the original ones. This, in turn, can also help avoid
8472 the creation of fixed versions of the array itself. */
8473 index_type_desc
= NULL
;
8476 if (index_type_desc
== NULL
)
8478 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8480 /* NOTE: elt_type---the fixed version of elt_type0---should never
8481 depend on the contents of the array in properly constructed
8483 /* Create a fixed version of the array element type.
8484 We're not providing the address of an element here,
8485 and thus the actual object value cannot be inspected to do
8486 the conversion. This should not be a problem, since arrays of
8487 unconstrained objects are not allowed. In particular, all
8488 the elements of an array of a tagged type should all be of
8489 the same type specified in the debugging info. No need to
8490 consult the object tag. */
8491 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8493 /* Make sure we always create a new array type when dealing with
8494 packed array types, since we're going to fix-up the array
8495 type length and element bitsize a little further down. */
8496 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8499 result
= create_array_type (alloc_type_copy (type0
),
8500 elt_type
, TYPE_INDEX_TYPE (type0
));
8505 struct type
*elt_type0
;
8508 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8509 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8511 /* NOTE: result---the fixed version of elt_type0---should never
8512 depend on the contents of the array in properly constructed
8514 /* Create a fixed version of the array element type.
8515 We're not providing the address of an element here,
8516 and thus the actual object value cannot be inspected to do
8517 the conversion. This should not be a problem, since arrays of
8518 unconstrained objects are not allowed. In particular, all
8519 the elements of an array of a tagged type should all be of
8520 the same type specified in the debugging info. No need to
8521 consult the object tag. */
8523 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8526 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8528 struct type
*range_type
=
8529 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8531 result
= create_array_type (alloc_type_copy (elt_type0
),
8532 result
, range_type
);
8533 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8535 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8536 error (_("array type with dynamic size is larger than varsize-limit"));
8539 /* We want to preserve the type name. This can be useful when
8540 trying to get the type name of a value that has already been
8541 printed (for instance, if the user did "print VAR; whatis $". */
8542 TYPE_NAME (result
) = TYPE_NAME (type0
);
8544 if (constrained_packed_array_p
)
8546 /* So far, the resulting type has been created as if the original
8547 type was a regular (non-packed) array type. As a result, the
8548 bitsize of the array elements needs to be set again, and the array
8549 length needs to be recomputed based on that bitsize. */
8550 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8551 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8553 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8554 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8555 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8556 TYPE_LENGTH (result
)++;
8559 TYPE_FIXED_INSTANCE (result
) = 1;
8564 /* A standard type (containing no dynamically sized components)
8565 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8566 DVAL describes a record containing any discriminants used in TYPE0,
8567 and may be NULL if there are none, or if the object of type TYPE at
8568 ADDRESS or in VALADDR contains these discriminants.
8570 If CHECK_TAG is not null, in the case of tagged types, this function
8571 attempts to locate the object's tag and use it to compute the actual
8572 type. However, when ADDRESS is null, we cannot use it to determine the
8573 location of the tag, and therefore compute the tagged type's actual type.
8574 So we return the tagged type without consulting the tag. */
8576 static struct type
*
8577 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8578 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8580 type
= ada_check_typedef (type
);
8581 switch (TYPE_CODE (type
))
8585 case TYPE_CODE_STRUCT
:
8587 struct type
*static_type
= to_static_fixed_type (type
);
8588 struct type
*fixed_record_type
=
8589 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8591 /* If STATIC_TYPE is a tagged type and we know the object's address,
8592 then we can determine its tag, and compute the object's actual
8593 type from there. Note that we have to use the fixed record
8594 type (the parent part of the record may have dynamic fields
8595 and the way the location of _tag is expressed may depend on
8598 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8601 value_tag_from_contents_and_address
8605 struct type
*real_type
= type_from_tag (tag
);
8607 value_from_contents_and_address (fixed_record_type
,
8610 fixed_record_type
= value_type (obj
);
8611 if (real_type
!= NULL
)
8612 return to_fixed_record_type
8614 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8617 /* Check to see if there is a parallel ___XVZ variable.
8618 If there is, then it provides the actual size of our type. */
8619 else if (ada_type_name (fixed_record_type
) != NULL
)
8621 const char *name
= ada_type_name (fixed_record_type
);
8622 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8626 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8627 size
= get_int_var_value (xvz_name
, &xvz_found
);
8628 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8630 fixed_record_type
= copy_type (fixed_record_type
);
8631 TYPE_LENGTH (fixed_record_type
) = size
;
8633 /* The FIXED_RECORD_TYPE may have be a stub. We have
8634 observed this when the debugging info is STABS, and
8635 apparently it is something that is hard to fix.
8637 In practice, we don't need the actual type definition
8638 at all, because the presence of the XVZ variable allows us
8639 to assume that there must be a XVS type as well, which we
8640 should be able to use later, when we need the actual type
8643 In the meantime, pretend that the "fixed" type we are
8644 returning is NOT a stub, because this can cause trouble
8645 when using this type to create new types targeting it.
8646 Indeed, the associated creation routines often check
8647 whether the target type is a stub and will try to replace
8648 it, thus using a type with the wrong size. This, in turn,
8649 might cause the new type to have the wrong size too.
8650 Consider the case of an array, for instance, where the size
8651 of the array is computed from the number of elements in
8652 our array multiplied by the size of its element. */
8653 TYPE_STUB (fixed_record_type
) = 0;
8656 return fixed_record_type
;
8658 case TYPE_CODE_ARRAY
:
8659 return to_fixed_array_type (type
, dval
, 1);
8660 case TYPE_CODE_UNION
:
8664 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8668 /* The same as ada_to_fixed_type_1, except that it preserves the type
8669 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8671 The typedef layer needs be preserved in order to differentiate between
8672 arrays and array pointers when both types are implemented using the same
8673 fat pointer. In the array pointer case, the pointer is encoded as
8674 a typedef of the pointer type. For instance, considering:
8676 type String_Access is access String;
8677 S1 : String_Access := null;
8679 To the debugger, S1 is defined as a typedef of type String. But
8680 to the user, it is a pointer. So if the user tries to print S1,
8681 we should not dereference the array, but print the array address
8684 If we didn't preserve the typedef layer, we would lose the fact that
8685 the type is to be presented as a pointer (needs de-reference before
8686 being printed). And we would also use the source-level type name. */
8689 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8690 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8693 struct type
*fixed_type
=
8694 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8696 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8697 then preserve the typedef layer.
8699 Implementation note: We can only check the main-type portion of
8700 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8701 from TYPE now returns a type that has the same instance flags
8702 as TYPE. For instance, if TYPE is a "typedef const", and its
8703 target type is a "struct", then the typedef elimination will return
8704 a "const" version of the target type. See check_typedef for more
8705 details about how the typedef layer elimination is done.
8707 brobecker/2010-11-19: It seems to me that the only case where it is
8708 useful to preserve the typedef layer is when dealing with fat pointers.
8709 Perhaps, we could add a check for that and preserve the typedef layer
8710 only in that situation. But this seems unecessary so far, probably
8711 because we call check_typedef/ada_check_typedef pretty much everywhere.
8713 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8714 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8715 == TYPE_MAIN_TYPE (fixed_type
)))
8721 /* A standard (static-sized) type corresponding as well as possible to
8722 TYPE0, but based on no runtime data. */
8724 static struct type
*
8725 to_static_fixed_type (struct type
*type0
)
8732 if (TYPE_FIXED_INSTANCE (type0
))
8735 type0
= ada_check_typedef (type0
);
8737 switch (TYPE_CODE (type0
))
8741 case TYPE_CODE_STRUCT
:
8742 type
= dynamic_template_type (type0
);
8744 return template_to_static_fixed_type (type
);
8746 return template_to_static_fixed_type (type0
);
8747 case TYPE_CODE_UNION
:
8748 type
= ada_find_parallel_type (type0
, "___XVU");
8750 return template_to_static_fixed_type (type
);
8752 return template_to_static_fixed_type (type0
);
8756 /* A static approximation of TYPE with all type wrappers removed. */
8758 static struct type
*
8759 static_unwrap_type (struct type
*type
)
8761 if (ada_is_aligner_type (type
))
8763 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8764 if (ada_type_name (type1
) == NULL
)
8765 TYPE_NAME (type1
) = ada_type_name (type
);
8767 return static_unwrap_type (type1
);
8771 struct type
*raw_real_type
= ada_get_base_type (type
);
8773 if (raw_real_type
== type
)
8776 return to_static_fixed_type (raw_real_type
);
8780 /* In some cases, incomplete and private types require
8781 cross-references that are not resolved as records (for example,
8783 type FooP is access Foo;
8785 type Foo is array ...;
8786 ). In these cases, since there is no mechanism for producing
8787 cross-references to such types, we instead substitute for FooP a
8788 stub enumeration type that is nowhere resolved, and whose tag is
8789 the name of the actual type. Call these types "non-record stubs". */
8791 /* A type equivalent to TYPE that is not a non-record stub, if one
8792 exists, otherwise TYPE. */
8795 ada_check_typedef (struct type
*type
)
8800 /* If our type is a typedef type of a fat pointer, then we're done.
8801 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8802 what allows us to distinguish between fat pointers that represent
8803 array types, and fat pointers that represent array access types
8804 (in both cases, the compiler implements them as fat pointers). */
8805 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8806 && is_thick_pntr (ada_typedef_target_type (type
)))
8809 CHECK_TYPEDEF (type
);
8810 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8811 || !TYPE_STUB (type
)
8812 || TYPE_TAG_NAME (type
) == NULL
)
8816 const char *name
= TYPE_TAG_NAME (type
);
8817 struct type
*type1
= ada_find_any_type (name
);
8822 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8823 stubs pointing to arrays, as we don't create symbols for array
8824 types, only for the typedef-to-array types). If that's the case,
8825 strip the typedef layer. */
8826 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8827 type1
= ada_check_typedef (type1
);
8833 /* A value representing the data at VALADDR/ADDRESS as described by
8834 type TYPE0, but with a standard (static-sized) type that correctly
8835 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8836 type, then return VAL0 [this feature is simply to avoid redundant
8837 creation of struct values]. */
8839 static struct value
*
8840 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8843 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8845 if (type
== type0
&& val0
!= NULL
)
8848 return value_from_contents_and_address (type
, 0, address
);
8851 /* A value representing VAL, but with a standard (static-sized) type
8852 that correctly describes it. Does not necessarily create a new
8856 ada_to_fixed_value (struct value
*val
)
8858 val
= unwrap_value (val
);
8859 val
= ada_to_fixed_value_create (value_type (val
),
8860 value_address (val
),
8868 /* Table mapping attribute numbers to names.
8869 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8871 static const char *attribute_names
[] = {
8889 ada_attribute_name (enum exp_opcode n
)
8891 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8892 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8894 return attribute_names
[0];
8897 /* Evaluate the 'POS attribute applied to ARG. */
8900 pos_atr (struct value
*arg
)
8902 struct value
*val
= coerce_ref (arg
);
8903 struct type
*type
= value_type (val
);
8905 if (!discrete_type_p (type
))
8906 error (_("'POS only defined on discrete types"));
8908 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8911 LONGEST v
= value_as_long (val
);
8913 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8915 if (v
== TYPE_FIELD_ENUMVAL (type
, i
))
8918 error (_("enumeration value is invalid: can't find 'POS"));
8921 return value_as_long (val
);
8924 static struct value
*
8925 value_pos_atr (struct type
*type
, struct value
*arg
)
8927 return value_from_longest (type
, pos_atr (arg
));
8930 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8932 static struct value
*
8933 value_val_atr (struct type
*type
, struct value
*arg
)
8935 if (!discrete_type_p (type
))
8936 error (_("'VAL only defined on discrete types"));
8937 if (!integer_type_p (value_type (arg
)))
8938 error (_("'VAL requires integral argument"));
8940 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8942 long pos
= value_as_long (arg
);
8944 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8945 error (_("argument to 'VAL out of range"));
8946 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
8949 return value_from_longest (type
, value_as_long (arg
));
8955 /* True if TYPE appears to be an Ada character type.
8956 [At the moment, this is true only for Character and Wide_Character;
8957 It is a heuristic test that could stand improvement]. */
8960 ada_is_character_type (struct type
*type
)
8964 /* If the type code says it's a character, then assume it really is,
8965 and don't check any further. */
8966 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8969 /* Otherwise, assume it's a character type iff it is a discrete type
8970 with a known character type name. */
8971 name
= ada_type_name (type
);
8972 return (name
!= NULL
8973 && (TYPE_CODE (type
) == TYPE_CODE_INT
8974 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8975 && (strcmp (name
, "character") == 0
8976 || strcmp (name
, "wide_character") == 0
8977 || strcmp (name
, "wide_wide_character") == 0
8978 || strcmp (name
, "unsigned char") == 0));
8981 /* True if TYPE appears to be an Ada string type. */
8984 ada_is_string_type (struct type
*type
)
8986 type
= ada_check_typedef (type
);
8988 && TYPE_CODE (type
) != TYPE_CODE_PTR
8989 && (ada_is_simple_array_type (type
)
8990 || ada_is_array_descriptor_type (type
))
8991 && ada_array_arity (type
) == 1)
8993 struct type
*elttype
= ada_array_element_type (type
, 1);
8995 return ada_is_character_type (elttype
);
9001 /* The compiler sometimes provides a parallel XVS type for a given
9002 PAD type. Normally, it is safe to follow the PAD type directly,
9003 but older versions of the compiler have a bug that causes the offset
9004 of its "F" field to be wrong. Following that field in that case
9005 would lead to incorrect results, but this can be worked around
9006 by ignoring the PAD type and using the associated XVS type instead.
9008 Set to True if the debugger should trust the contents of PAD types.
9009 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9010 static int trust_pad_over_xvs
= 1;
9012 /* True if TYPE is a struct type introduced by the compiler to force the
9013 alignment of a value. Such types have a single field with a
9014 distinctive name. */
9017 ada_is_aligner_type (struct type
*type
)
9019 type
= ada_check_typedef (type
);
9021 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9024 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9025 && TYPE_NFIELDS (type
) == 1
9026 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9029 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9030 the parallel type. */
9033 ada_get_base_type (struct type
*raw_type
)
9035 struct type
*real_type_namer
;
9036 struct type
*raw_real_type
;
9038 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9041 if (ada_is_aligner_type (raw_type
))
9042 /* The encoding specifies that we should always use the aligner type.
9043 So, even if this aligner type has an associated XVS type, we should
9046 According to the compiler gurus, an XVS type parallel to an aligner
9047 type may exist because of a stabs limitation. In stabs, aligner
9048 types are empty because the field has a variable-sized type, and
9049 thus cannot actually be used as an aligner type. As a result,
9050 we need the associated parallel XVS type to decode the type.
9051 Since the policy in the compiler is to not change the internal
9052 representation based on the debugging info format, we sometimes
9053 end up having a redundant XVS type parallel to the aligner type. */
9056 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9057 if (real_type_namer
== NULL
9058 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9059 || TYPE_NFIELDS (real_type_namer
) != 1)
9062 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9064 /* This is an older encoding form where the base type needs to be
9065 looked up by name. We prefer the newer enconding because it is
9067 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9068 if (raw_real_type
== NULL
)
9071 return raw_real_type
;
9074 /* The field in our XVS type is a reference to the base type. */
9075 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9078 /* The type of value designated by TYPE, with all aligners removed. */
9081 ada_aligned_type (struct type
*type
)
9083 if (ada_is_aligner_type (type
))
9084 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9086 return ada_get_base_type (type
);
9090 /* The address of the aligned value in an object at address VALADDR
9091 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9094 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9096 if (ada_is_aligner_type (type
))
9097 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9099 TYPE_FIELD_BITPOS (type
,
9100 0) / TARGET_CHAR_BIT
);
9107 /* The printed representation of an enumeration literal with encoded
9108 name NAME. The value is good to the next call of ada_enum_name. */
9110 ada_enum_name (const char *name
)
9112 static char *result
;
9113 static size_t result_len
= 0;
9116 /* First, unqualify the enumeration name:
9117 1. Search for the last '.' character. If we find one, then skip
9118 all the preceding characters, the unqualified name starts
9119 right after that dot.
9120 2. Otherwise, we may be debugging on a target where the compiler
9121 translates dots into "__". Search forward for double underscores,
9122 but stop searching when we hit an overloading suffix, which is
9123 of the form "__" followed by digits. */
9125 tmp
= strrchr (name
, '.');
9130 while ((tmp
= strstr (name
, "__")) != NULL
)
9132 if (isdigit (tmp
[2]))
9143 if (name
[1] == 'U' || name
[1] == 'W')
9145 if (sscanf (name
+ 2, "%x", &v
) != 1)
9151 GROW_VECT (result
, result_len
, 16);
9152 if (isascii (v
) && isprint (v
))
9153 xsnprintf (result
, result_len
, "'%c'", v
);
9154 else if (name
[1] == 'U')
9155 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9157 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9163 tmp
= strstr (name
, "__");
9165 tmp
= strstr (name
, "$");
9168 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9169 strncpy (result
, name
, tmp
- name
);
9170 result
[tmp
- name
] = '\0';
9178 /* Evaluate the subexpression of EXP starting at *POS as for
9179 evaluate_type, updating *POS to point just past the evaluated
9182 static struct value
*
9183 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9185 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9188 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9191 static struct value
*
9192 unwrap_value (struct value
*val
)
9194 struct type
*type
= ada_check_typedef (value_type (val
));
9196 if (ada_is_aligner_type (type
))
9198 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9199 struct type
*val_type
= ada_check_typedef (value_type (v
));
9201 if (ada_type_name (val_type
) == NULL
)
9202 TYPE_NAME (val_type
) = ada_type_name (type
);
9204 return unwrap_value (v
);
9208 struct type
*raw_real_type
=
9209 ada_check_typedef (ada_get_base_type (type
));
9211 /* If there is no parallel XVS or XVE type, then the value is
9212 already unwrapped. Return it without further modification. */
9213 if ((type
== raw_real_type
)
9214 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9218 coerce_unspec_val_to_type
9219 (val
, ada_to_fixed_type (raw_real_type
, 0,
9220 value_address (val
),
9225 static struct value
*
9226 cast_to_fixed (struct type
*type
, struct value
*arg
)
9230 if (type
== value_type (arg
))
9232 else if (ada_is_fixed_point_type (value_type (arg
)))
9233 val
= ada_float_to_fixed (type
,
9234 ada_fixed_to_float (value_type (arg
),
9235 value_as_long (arg
)));
9238 DOUBLEST argd
= value_as_double (arg
);
9240 val
= ada_float_to_fixed (type
, argd
);
9243 return value_from_longest (type
, val
);
9246 static struct value
*
9247 cast_from_fixed (struct type
*type
, struct value
*arg
)
9249 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9250 value_as_long (arg
));
9252 return value_from_double (type
, val
);
9255 /* Given two array types T1 and T2, return nonzero iff both arrays
9256 contain the same number of elements. */
9259 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9261 LONGEST lo1
, hi1
, lo2
, hi2
;
9263 /* Get the array bounds in order to verify that the size of
9264 the two arrays match. */
9265 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9266 || !get_array_bounds (t2
, &lo2
, &hi2
))
9267 error (_("unable to determine array bounds"));
9269 /* To make things easier for size comparison, normalize a bit
9270 the case of empty arrays by making sure that the difference
9271 between upper bound and lower bound is always -1. */
9277 return (hi1
- lo1
== hi2
- lo2
);
9280 /* Assuming that VAL is an array of integrals, and TYPE represents
9281 an array with the same number of elements, but with wider integral
9282 elements, return an array "casted" to TYPE. In practice, this
9283 means that the returned array is built by casting each element
9284 of the original array into TYPE's (wider) element type. */
9286 static struct value
*
9287 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9289 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9294 /* Verify that both val and type are arrays of scalars, and
9295 that the size of val's elements is smaller than the size
9296 of type's element. */
9297 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9298 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9299 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9300 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9301 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9302 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9304 if (!get_array_bounds (type
, &lo
, &hi
))
9305 error (_("unable to determine array bounds"));
9307 res
= allocate_value (type
);
9309 /* Promote each array element. */
9310 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9312 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9314 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9315 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9321 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9322 return the converted value. */
9324 static struct value
*
9325 coerce_for_assign (struct type
*type
, struct value
*val
)
9327 struct type
*type2
= value_type (val
);
9332 type2
= ada_check_typedef (type2
);
9333 type
= ada_check_typedef (type
);
9335 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9336 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9338 val
= ada_value_ind (val
);
9339 type2
= value_type (val
);
9342 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9343 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9345 if (!ada_same_array_size_p (type
, type2
))
9346 error (_("cannot assign arrays of different length"));
9348 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9349 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9350 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9351 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9353 /* Allow implicit promotion of the array elements to
9355 return ada_promote_array_of_integrals (type
, val
);
9358 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9359 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9360 error (_("Incompatible types in assignment"));
9361 deprecated_set_value_type (val
, type
);
9366 static struct value
*
9367 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9370 struct type
*type1
, *type2
;
9373 arg1
= coerce_ref (arg1
);
9374 arg2
= coerce_ref (arg2
);
9375 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9376 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9378 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9379 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9380 return value_binop (arg1
, arg2
, op
);
9389 return value_binop (arg1
, arg2
, op
);
9392 v2
= value_as_long (arg2
);
9394 error (_("second operand of %s must not be zero."), op_string (op
));
9396 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9397 return value_binop (arg1
, arg2
, op
);
9399 v1
= value_as_long (arg1
);
9404 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9405 v
+= v
> 0 ? -1 : 1;
9413 /* Should not reach this point. */
9417 val
= allocate_value (type1
);
9418 store_unsigned_integer (value_contents_raw (val
),
9419 TYPE_LENGTH (value_type (val
)),
9420 gdbarch_byte_order (get_type_arch (type1
)), v
);
9425 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9427 if (ada_is_direct_array_type (value_type (arg1
))
9428 || ada_is_direct_array_type (value_type (arg2
)))
9430 /* Automatically dereference any array reference before
9431 we attempt to perform the comparison. */
9432 arg1
= ada_coerce_ref (arg1
);
9433 arg2
= ada_coerce_ref (arg2
);
9435 arg1
= ada_coerce_to_simple_array (arg1
);
9436 arg2
= ada_coerce_to_simple_array (arg2
);
9437 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9438 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9439 error (_("Attempt to compare array with non-array"));
9440 /* FIXME: The following works only for types whose
9441 representations use all bits (no padding or undefined bits)
9442 and do not have user-defined equality. */
9444 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9445 && memcmp (value_contents (arg1
), value_contents (arg2
),
9446 TYPE_LENGTH (value_type (arg1
))) == 0;
9448 return value_equal (arg1
, arg2
);
9451 /* Total number of component associations in the aggregate starting at
9452 index PC in EXP. Assumes that index PC is the start of an
9456 num_component_specs (struct expression
*exp
, int pc
)
9460 m
= exp
->elts
[pc
+ 1].longconst
;
9463 for (i
= 0; i
< m
; i
+= 1)
9465 switch (exp
->elts
[pc
].opcode
)
9471 n
+= exp
->elts
[pc
+ 1].longconst
;
9474 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9479 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9480 component of LHS (a simple array or a record), updating *POS past
9481 the expression, assuming that LHS is contained in CONTAINER. Does
9482 not modify the inferior's memory, nor does it modify LHS (unless
9483 LHS == CONTAINER). */
9486 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9487 struct expression
*exp
, int *pos
)
9489 struct value
*mark
= value_mark ();
9492 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9494 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9495 struct value
*index_val
= value_from_longest (index_type
, index
);
9497 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9501 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9502 elt
= ada_to_fixed_value (elt
);
9505 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9506 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9508 value_assign_to_component (container
, elt
,
9509 ada_evaluate_subexp (NULL
, exp
, pos
,
9512 value_free_to_mark (mark
);
9515 /* Assuming that LHS represents an lvalue having a record or array
9516 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9517 of that aggregate's value to LHS, advancing *POS past the
9518 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9519 lvalue containing LHS (possibly LHS itself). Does not modify
9520 the inferior's memory, nor does it modify the contents of
9521 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9523 static struct value
*
9524 assign_aggregate (struct value
*container
,
9525 struct value
*lhs
, struct expression
*exp
,
9526 int *pos
, enum noside noside
)
9528 struct type
*lhs_type
;
9529 int n
= exp
->elts
[*pos
+1].longconst
;
9530 LONGEST low_index
, high_index
;
9533 int max_indices
, num_indices
;
9537 if (noside
!= EVAL_NORMAL
)
9539 for (i
= 0; i
< n
; i
+= 1)
9540 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9544 container
= ada_coerce_ref (container
);
9545 if (ada_is_direct_array_type (value_type (container
)))
9546 container
= ada_coerce_to_simple_array (container
);
9547 lhs
= ada_coerce_ref (lhs
);
9548 if (!deprecated_value_modifiable (lhs
))
9549 error (_("Left operand of assignment is not a modifiable lvalue."));
9551 lhs_type
= value_type (lhs
);
9552 if (ada_is_direct_array_type (lhs_type
))
9554 lhs
= ada_coerce_to_simple_array (lhs
);
9555 lhs_type
= value_type (lhs
);
9556 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9557 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9559 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9562 high_index
= num_visible_fields (lhs_type
) - 1;
9565 error (_("Left-hand side must be array or record."));
9567 num_specs
= num_component_specs (exp
, *pos
- 3);
9568 max_indices
= 4 * num_specs
+ 4;
9569 indices
= alloca (max_indices
* sizeof (indices
[0]));
9570 indices
[0] = indices
[1] = low_index
- 1;
9571 indices
[2] = indices
[3] = high_index
+ 1;
9574 for (i
= 0; i
< n
; i
+= 1)
9576 switch (exp
->elts
[*pos
].opcode
)
9579 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9580 &num_indices
, max_indices
,
9581 low_index
, high_index
);
9584 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9585 &num_indices
, max_indices
,
9586 low_index
, high_index
);
9590 error (_("Misplaced 'others' clause"));
9591 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9592 num_indices
, low_index
, high_index
);
9595 error (_("Internal error: bad aggregate clause"));
9602 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9603 construct at *POS, updating *POS past the construct, given that
9604 the positions are relative to lower bound LOW, where HIGH is the
9605 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9606 updating *NUM_INDICES as needed. CONTAINER is as for
9607 assign_aggregate. */
9609 aggregate_assign_positional (struct value
*container
,
9610 struct value
*lhs
, struct expression
*exp
,
9611 int *pos
, LONGEST
*indices
, int *num_indices
,
9612 int max_indices
, LONGEST low
, LONGEST high
)
9614 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9616 if (ind
- 1 == high
)
9617 warning (_("Extra components in aggregate ignored."));
9620 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9622 assign_component (container
, lhs
, ind
, exp
, pos
);
9625 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9628 /* Assign into the components of LHS indexed by the OP_CHOICES
9629 construct at *POS, updating *POS past the construct, given that
9630 the allowable indices are LOW..HIGH. Record the indices assigned
9631 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9632 needed. CONTAINER is as for assign_aggregate. */
9634 aggregate_assign_from_choices (struct value
*container
,
9635 struct value
*lhs
, struct expression
*exp
,
9636 int *pos
, LONGEST
*indices
, int *num_indices
,
9637 int max_indices
, LONGEST low
, LONGEST high
)
9640 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9641 int choice_pos
, expr_pc
;
9642 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9644 choice_pos
= *pos
+= 3;
9646 for (j
= 0; j
< n_choices
; j
+= 1)
9647 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9649 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9651 for (j
= 0; j
< n_choices
; j
+= 1)
9653 LONGEST lower
, upper
;
9654 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9656 if (op
== OP_DISCRETE_RANGE
)
9659 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9661 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9666 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9678 name
= &exp
->elts
[choice_pos
+ 2].string
;
9681 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9684 error (_("Invalid record component association."));
9686 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9688 if (! find_struct_field (name
, value_type (lhs
), 0,
9689 NULL
, NULL
, NULL
, NULL
, &ind
))
9690 error (_("Unknown component name: %s."), name
);
9691 lower
= upper
= ind
;
9694 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9695 error (_("Index in component association out of bounds."));
9697 add_component_interval (lower
, upper
, indices
, num_indices
,
9699 while (lower
<= upper
)
9704 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9710 /* Assign the value of the expression in the OP_OTHERS construct in
9711 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9712 have not been previously assigned. The index intervals already assigned
9713 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9714 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9716 aggregate_assign_others (struct value
*container
,
9717 struct value
*lhs
, struct expression
*exp
,
9718 int *pos
, LONGEST
*indices
, int num_indices
,
9719 LONGEST low
, LONGEST high
)
9722 int expr_pc
= *pos
+ 1;
9724 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9728 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9733 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9736 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9739 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9740 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9741 modifying *SIZE as needed. It is an error if *SIZE exceeds
9742 MAX_SIZE. The resulting intervals do not overlap. */
9744 add_component_interval (LONGEST low
, LONGEST high
,
9745 LONGEST
* indices
, int *size
, int max_size
)
9749 for (i
= 0; i
< *size
; i
+= 2) {
9750 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9754 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9755 if (high
< indices
[kh
])
9757 if (low
< indices
[i
])
9759 indices
[i
+ 1] = indices
[kh
- 1];
9760 if (high
> indices
[i
+ 1])
9761 indices
[i
+ 1] = high
;
9762 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9763 *size
-= kh
- i
- 2;
9766 else if (high
< indices
[i
])
9770 if (*size
== max_size
)
9771 error (_("Internal error: miscounted aggregate components."));
9773 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9774 indices
[j
] = indices
[j
- 2];
9776 indices
[i
+ 1] = high
;
9779 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9782 static struct value
*
9783 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9785 if (type
== ada_check_typedef (value_type (arg2
)))
9788 if (ada_is_fixed_point_type (type
))
9789 return (cast_to_fixed (type
, arg2
));
9791 if (ada_is_fixed_point_type (value_type (arg2
)))
9792 return cast_from_fixed (type
, arg2
);
9794 return value_cast (type
, arg2
);
9797 /* Evaluating Ada expressions, and printing their result.
9798 ------------------------------------------------------
9803 We usually evaluate an Ada expression in order to print its value.
9804 We also evaluate an expression in order to print its type, which
9805 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9806 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9807 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9808 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9811 Evaluating expressions is a little more complicated for Ada entities
9812 than it is for entities in languages such as C. The main reason for
9813 this is that Ada provides types whose definition might be dynamic.
9814 One example of such types is variant records. Or another example
9815 would be an array whose bounds can only be known at run time.
9817 The following description is a general guide as to what should be
9818 done (and what should NOT be done) in order to evaluate an expression
9819 involving such types, and when. This does not cover how the semantic
9820 information is encoded by GNAT as this is covered separatly. For the
9821 document used as the reference for the GNAT encoding, see exp_dbug.ads
9822 in the GNAT sources.
9824 Ideally, we should embed each part of this description next to its
9825 associated code. Unfortunately, the amount of code is so vast right
9826 now that it's hard to see whether the code handling a particular
9827 situation might be duplicated or not. One day, when the code is
9828 cleaned up, this guide might become redundant with the comments
9829 inserted in the code, and we might want to remove it.
9831 2. ``Fixing'' an Entity, the Simple Case:
9832 -----------------------------------------
9834 When evaluating Ada expressions, the tricky issue is that they may
9835 reference entities whose type contents and size are not statically
9836 known. Consider for instance a variant record:
9838 type Rec (Empty : Boolean := True) is record
9841 when False => Value : Integer;
9844 Yes : Rec := (Empty => False, Value => 1);
9845 No : Rec := (empty => True);
9847 The size and contents of that record depends on the value of the
9848 descriminant (Rec.Empty). At this point, neither the debugging
9849 information nor the associated type structure in GDB are able to
9850 express such dynamic types. So what the debugger does is to create
9851 "fixed" versions of the type that applies to the specific object.
9852 We also informally refer to this opperation as "fixing" an object,
9853 which means creating its associated fixed type.
9855 Example: when printing the value of variable "Yes" above, its fixed
9856 type would look like this:
9863 On the other hand, if we printed the value of "No", its fixed type
9870 Things become a little more complicated when trying to fix an entity
9871 with a dynamic type that directly contains another dynamic type,
9872 such as an array of variant records, for instance. There are
9873 two possible cases: Arrays, and records.
9875 3. ``Fixing'' Arrays:
9876 ---------------------
9878 The type structure in GDB describes an array in terms of its bounds,
9879 and the type of its elements. By design, all elements in the array
9880 have the same type and we cannot represent an array of variant elements
9881 using the current type structure in GDB. When fixing an array,
9882 we cannot fix the array element, as we would potentially need one
9883 fixed type per element of the array. As a result, the best we can do
9884 when fixing an array is to produce an array whose bounds and size
9885 are correct (allowing us to read it from memory), but without having
9886 touched its element type. Fixing each element will be done later,
9887 when (if) necessary.
9889 Arrays are a little simpler to handle than records, because the same
9890 amount of memory is allocated for each element of the array, even if
9891 the amount of space actually used by each element differs from element
9892 to element. Consider for instance the following array of type Rec:
9894 type Rec_Array is array (1 .. 2) of Rec;
9896 The actual amount of memory occupied by each element might be different
9897 from element to element, depending on the value of their discriminant.
9898 But the amount of space reserved for each element in the array remains
9899 fixed regardless. So we simply need to compute that size using
9900 the debugging information available, from which we can then determine
9901 the array size (we multiply the number of elements of the array by
9902 the size of each element).
9904 The simplest case is when we have an array of a constrained element
9905 type. For instance, consider the following type declarations:
9907 type Bounded_String (Max_Size : Integer) is
9909 Buffer : String (1 .. Max_Size);
9911 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9913 In this case, the compiler describes the array as an array of
9914 variable-size elements (identified by its XVS suffix) for which
9915 the size can be read in the parallel XVZ variable.
9917 In the case of an array of an unconstrained element type, the compiler
9918 wraps the array element inside a private PAD type. This type should not
9919 be shown to the user, and must be "unwrap"'ed before printing. Note
9920 that we also use the adjective "aligner" in our code to designate
9921 these wrapper types.
9923 In some cases, the size allocated for each element is statically
9924 known. In that case, the PAD type already has the correct size,
9925 and the array element should remain unfixed.
9927 But there are cases when this size is not statically known.
9928 For instance, assuming that "Five" is an integer variable:
9930 type Dynamic is array (1 .. Five) of Integer;
9931 type Wrapper (Has_Length : Boolean := False) is record
9934 when True => Length : Integer;
9938 type Wrapper_Array is array (1 .. 2) of Wrapper;
9940 Hello : Wrapper_Array := (others => (Has_Length => True,
9941 Data => (others => 17),
9945 The debugging info would describe variable Hello as being an
9946 array of a PAD type. The size of that PAD type is not statically
9947 known, but can be determined using a parallel XVZ variable.
9948 In that case, a copy of the PAD type with the correct size should
9949 be used for the fixed array.
9951 3. ``Fixing'' record type objects:
9952 ----------------------------------
9954 Things are slightly different from arrays in the case of dynamic
9955 record types. In this case, in order to compute the associated
9956 fixed type, we need to determine the size and offset of each of
9957 its components. This, in turn, requires us to compute the fixed
9958 type of each of these components.
9960 Consider for instance the example:
9962 type Bounded_String (Max_Size : Natural) is record
9963 Str : String (1 .. Max_Size);
9966 My_String : Bounded_String (Max_Size => 10);
9968 In that case, the position of field "Length" depends on the size
9969 of field Str, which itself depends on the value of the Max_Size
9970 discriminant. In order to fix the type of variable My_String,
9971 we need to fix the type of field Str. Therefore, fixing a variant
9972 record requires us to fix each of its components.
9974 However, if a component does not have a dynamic size, the component
9975 should not be fixed. In particular, fields that use a PAD type
9976 should not fixed. Here is an example where this might happen
9977 (assuming type Rec above):
9979 type Container (Big : Boolean) is record
9983 when True => Another : Integer;
9987 My_Container : Container := (Big => False,
9988 First => (Empty => True),
9991 In that example, the compiler creates a PAD type for component First,
9992 whose size is constant, and then positions the component After just
9993 right after it. The offset of component After is therefore constant
9996 The debugger computes the position of each field based on an algorithm
9997 that uses, among other things, the actual position and size of the field
9998 preceding it. Let's now imagine that the user is trying to print
9999 the value of My_Container. If the type fixing was recursive, we would
10000 end up computing the offset of field After based on the size of the
10001 fixed version of field First. And since in our example First has
10002 only one actual field, the size of the fixed type is actually smaller
10003 than the amount of space allocated to that field, and thus we would
10004 compute the wrong offset of field After.
10006 To make things more complicated, we need to watch out for dynamic
10007 components of variant records (identified by the ___XVL suffix in
10008 the component name). Even if the target type is a PAD type, the size
10009 of that type might not be statically known. So the PAD type needs
10010 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10011 we might end up with the wrong size for our component. This can be
10012 observed with the following type declarations:
10014 type Octal is new Integer range 0 .. 7;
10015 type Octal_Array is array (Positive range <>) of Octal;
10016 pragma Pack (Octal_Array);
10018 type Octal_Buffer (Size : Positive) is record
10019 Buffer : Octal_Array (1 .. Size);
10023 In that case, Buffer is a PAD type whose size is unset and needs
10024 to be computed by fixing the unwrapped type.
10026 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10027 ----------------------------------------------------------
10029 Lastly, when should the sub-elements of an entity that remained unfixed
10030 thus far, be actually fixed?
10032 The answer is: Only when referencing that element. For instance
10033 when selecting one component of a record, this specific component
10034 should be fixed at that point in time. Or when printing the value
10035 of a record, each component should be fixed before its value gets
10036 printed. Similarly for arrays, the element of the array should be
10037 fixed when printing each element of the array, or when extracting
10038 one element out of that array. On the other hand, fixing should
10039 not be performed on the elements when taking a slice of an array!
10041 Note that one of the side-effects of miscomputing the offset and
10042 size of each field is that we end up also miscomputing the size
10043 of the containing type. This can have adverse results when computing
10044 the value of an entity. GDB fetches the value of an entity based
10045 on the size of its type, and thus a wrong size causes GDB to fetch
10046 the wrong amount of memory. In the case where the computed size is
10047 too small, GDB fetches too little data to print the value of our
10048 entiry. Results in this case as unpredicatble, as we usually read
10049 past the buffer containing the data =:-o. */
10051 /* Implement the evaluate_exp routine in the exp_descriptor structure
10052 for the Ada language. */
10054 static struct value
*
10055 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10056 int *pos
, enum noside noside
)
10058 enum exp_opcode op
;
10062 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10065 struct value
**argvec
;
10069 op
= exp
->elts
[pc
].opcode
;
10075 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10077 if (noside
== EVAL_NORMAL
)
10078 arg1
= unwrap_value (arg1
);
10080 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
10081 then we need to perform the conversion manually, because
10082 evaluate_subexp_standard doesn't do it. This conversion is
10083 necessary in Ada because the different kinds of float/fixed
10084 types in Ada have different representations.
10086 Similarly, we need to perform the conversion from OP_LONG
10088 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
10089 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
10095 struct value
*result
;
10098 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10099 /* The result type will have code OP_STRING, bashed there from
10100 OP_ARRAY. Bash it back. */
10101 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10102 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10108 type
= exp
->elts
[pc
+ 1].type
;
10109 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
10110 if (noside
== EVAL_SKIP
)
10112 arg1
= ada_value_cast (type
, arg1
, noside
);
10117 type
= exp
->elts
[pc
+ 1].type
;
10118 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10121 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10122 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10124 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10125 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10127 return ada_value_assign (arg1
, arg1
);
10129 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10130 except if the lhs of our assignment is a convenience variable.
10131 In the case of assigning to a convenience variable, the lhs
10132 should be exactly the result of the evaluation of the rhs. */
10133 type
= value_type (arg1
);
10134 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10136 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10137 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10139 if (ada_is_fixed_point_type (value_type (arg1
)))
10140 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10141 else if (ada_is_fixed_point_type (value_type (arg2
)))
10143 (_("Fixed-point values must be assigned to fixed-point variables"));
10145 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10146 return ada_value_assign (arg1
, arg2
);
10149 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10150 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10151 if (noside
== EVAL_SKIP
)
10153 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10154 return (value_from_longest
10155 (value_type (arg1
),
10156 value_as_long (arg1
) + value_as_long (arg2
)));
10157 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10158 return (value_from_longest
10159 (value_type (arg2
),
10160 value_as_long (arg1
) + value_as_long (arg2
)));
10161 if ((ada_is_fixed_point_type (value_type (arg1
))
10162 || ada_is_fixed_point_type (value_type (arg2
)))
10163 && value_type (arg1
) != value_type (arg2
))
10164 error (_("Operands of fixed-point addition must have the same type"));
10165 /* Do the addition, and cast the result to the type of the first
10166 argument. We cannot cast the result to a reference type, so if
10167 ARG1 is a reference type, find its underlying type. */
10168 type
= value_type (arg1
);
10169 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10170 type
= TYPE_TARGET_TYPE (type
);
10171 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10172 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10175 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10176 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10177 if (noside
== EVAL_SKIP
)
10179 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10180 return (value_from_longest
10181 (value_type (arg1
),
10182 value_as_long (arg1
) - value_as_long (arg2
)));
10183 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10184 return (value_from_longest
10185 (value_type (arg2
),
10186 value_as_long (arg1
) - value_as_long (arg2
)));
10187 if ((ada_is_fixed_point_type (value_type (arg1
))
10188 || ada_is_fixed_point_type (value_type (arg2
)))
10189 && value_type (arg1
) != value_type (arg2
))
10190 error (_("Operands of fixed-point subtraction "
10191 "must have the same type"));
10192 /* Do the substraction, and cast the result to the type of the first
10193 argument. We cannot cast the result to a reference type, so if
10194 ARG1 is a reference type, find its underlying type. */
10195 type
= value_type (arg1
);
10196 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10197 type
= TYPE_TARGET_TYPE (type
);
10198 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10199 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10205 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10206 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10207 if (noside
== EVAL_SKIP
)
10209 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10211 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10212 return value_zero (value_type (arg1
), not_lval
);
10216 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10217 if (ada_is_fixed_point_type (value_type (arg1
)))
10218 arg1
= cast_from_fixed (type
, arg1
);
10219 if (ada_is_fixed_point_type (value_type (arg2
)))
10220 arg2
= cast_from_fixed (type
, arg2
);
10221 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10222 return ada_value_binop (arg1
, arg2
, op
);
10226 case BINOP_NOTEQUAL
:
10227 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10228 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10229 if (noside
== EVAL_SKIP
)
10231 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10235 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10236 tem
= ada_value_equal (arg1
, arg2
);
10238 if (op
== BINOP_NOTEQUAL
)
10240 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10241 return value_from_longest (type
, (LONGEST
) tem
);
10244 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10245 if (noside
== EVAL_SKIP
)
10247 else if (ada_is_fixed_point_type (value_type (arg1
)))
10248 return value_cast (value_type (arg1
), value_neg (arg1
));
10251 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10252 return value_neg (arg1
);
10255 case BINOP_LOGICAL_AND
:
10256 case BINOP_LOGICAL_OR
:
10257 case UNOP_LOGICAL_NOT
:
10262 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10263 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10264 return value_cast (type
, val
);
10267 case BINOP_BITWISE_AND
:
10268 case BINOP_BITWISE_IOR
:
10269 case BINOP_BITWISE_XOR
:
10273 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10275 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10277 return value_cast (value_type (arg1
), val
);
10283 if (noside
== EVAL_SKIP
)
10289 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10290 /* Only encountered when an unresolved symbol occurs in a
10291 context other than a function call, in which case, it is
10293 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10294 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10296 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10298 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10299 /* Check to see if this is a tagged type. We also need to handle
10300 the case where the type is a reference to a tagged type, but
10301 we have to be careful to exclude pointers to tagged types.
10302 The latter should be shown as usual (as a pointer), whereas
10303 a reference should mostly be transparent to the user. */
10304 if (ada_is_tagged_type (type
, 0)
10305 || (TYPE_CODE (type
) == TYPE_CODE_REF
10306 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10308 /* Tagged types are a little special in the fact that the real
10309 type is dynamic and can only be determined by inspecting the
10310 object's tag. This means that we need to get the object's
10311 value first (EVAL_NORMAL) and then extract the actual object
10314 Note that we cannot skip the final step where we extract
10315 the object type from its tag, because the EVAL_NORMAL phase
10316 results in dynamic components being resolved into fixed ones.
10317 This can cause problems when trying to print the type
10318 description of tagged types whose parent has a dynamic size:
10319 We use the type name of the "_parent" component in order
10320 to print the name of the ancestor type in the type description.
10321 If that component had a dynamic size, the resolution into
10322 a fixed type would result in the loss of that type name,
10323 thus preventing us from printing the name of the ancestor
10324 type in the type description. */
10325 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10327 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10329 struct type
*actual_type
;
10331 actual_type
= type_from_tag (ada_value_tag (arg1
));
10332 if (actual_type
== NULL
)
10333 /* If, for some reason, we were unable to determine
10334 the actual type from the tag, then use the static
10335 approximation that we just computed as a fallback.
10336 This can happen if the debugging information is
10337 incomplete, for instance. */
10338 actual_type
= type
;
10339 return value_zero (actual_type
, not_lval
);
10343 /* In the case of a ref, ada_coerce_ref takes care
10344 of determining the actual type. But the evaluation
10345 should return a ref as it should be valid to ask
10346 for its address; so rebuild a ref after coerce. */
10347 arg1
= ada_coerce_ref (arg1
);
10348 return value_ref (arg1
);
10352 /* Records and unions for which GNAT encodings have been
10353 generated need to be statically fixed as well.
10354 Otherwise, non-static fixing produces a type where
10355 all dynamic properties are removed, which prevents "ptype"
10356 from being able to completely describe the type.
10357 For instance, a case statement in a variant record would be
10358 replaced by the relevant components based on the actual
10359 value of the discriminants. */
10360 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10361 && dynamic_template_type (type
) != NULL
)
10362 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10363 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10366 return value_zero (to_static_fixed_type (type
), not_lval
);
10370 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10371 return ada_to_fixed_value (arg1
);
10376 /* Allocate arg vector, including space for the function to be
10377 called in argvec[0] and a terminating NULL. */
10378 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10380 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
10382 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10383 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10384 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10385 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10388 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10389 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10392 if (noside
== EVAL_SKIP
)
10396 if (ada_is_constrained_packed_array_type
10397 (desc_base_type (value_type (argvec
[0]))))
10398 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10399 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10400 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10401 /* This is a packed array that has already been fixed, and
10402 therefore already coerced to a simple array. Nothing further
10405 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
10406 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10407 && VALUE_LVAL (argvec
[0]) == lval_memory
))
10408 argvec
[0] = value_addr (argvec
[0]);
10410 type
= ada_check_typedef (value_type (argvec
[0]));
10412 /* Ada allows us to implicitly dereference arrays when subscripting
10413 them. So, if this is an array typedef (encoding use for array
10414 access types encoded as fat pointers), strip it now. */
10415 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10416 type
= ada_typedef_target_type (type
);
10418 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10420 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10422 case TYPE_CODE_FUNC
:
10423 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10425 case TYPE_CODE_ARRAY
:
10427 case TYPE_CODE_STRUCT
:
10428 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10429 argvec
[0] = ada_value_ind (argvec
[0]);
10430 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10433 error (_("cannot subscript or call something of type `%s'"),
10434 ada_type_name (value_type (argvec
[0])));
10439 switch (TYPE_CODE (type
))
10441 case TYPE_CODE_FUNC
:
10442 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10444 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10446 if (TYPE_GNU_IFUNC (type
))
10447 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10448 return allocate_value (rtype
);
10450 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10451 case TYPE_CODE_INTERNAL_FUNCTION
:
10452 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10453 /* We don't know anything about what the internal
10454 function might return, but we have to return
10456 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10459 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10460 argvec
[0], nargs
, argvec
+ 1);
10462 case TYPE_CODE_STRUCT
:
10466 arity
= ada_array_arity (type
);
10467 type
= ada_array_element_type (type
, nargs
);
10469 error (_("cannot subscript or call a record"));
10470 if (arity
!= nargs
)
10471 error (_("wrong number of subscripts; expecting %d"), arity
);
10472 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10473 return value_zero (ada_aligned_type (type
), lval_memory
);
10475 unwrap_value (ada_value_subscript
10476 (argvec
[0], nargs
, argvec
+ 1));
10478 case TYPE_CODE_ARRAY
:
10479 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10481 type
= ada_array_element_type (type
, nargs
);
10483 error (_("element type of array unknown"));
10485 return value_zero (ada_aligned_type (type
), lval_memory
);
10488 unwrap_value (ada_value_subscript
10489 (ada_coerce_to_simple_array (argvec
[0]),
10490 nargs
, argvec
+ 1));
10491 case TYPE_CODE_PTR
: /* Pointer to array */
10492 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10494 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10495 type
= ada_array_element_type (type
, nargs
);
10497 error (_("element type of array unknown"));
10499 return value_zero (ada_aligned_type (type
), lval_memory
);
10502 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10503 nargs
, argvec
+ 1));
10506 error (_("Attempt to index or call something other than an "
10507 "array or function"));
10512 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10513 struct value
*low_bound_val
=
10514 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10515 struct value
*high_bound_val
=
10516 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10518 LONGEST high_bound
;
10520 low_bound_val
= coerce_ref (low_bound_val
);
10521 high_bound_val
= coerce_ref (high_bound_val
);
10522 low_bound
= pos_atr (low_bound_val
);
10523 high_bound
= pos_atr (high_bound_val
);
10525 if (noside
== EVAL_SKIP
)
10528 /* If this is a reference to an aligner type, then remove all
10530 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10531 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10532 TYPE_TARGET_TYPE (value_type (array
)) =
10533 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10535 if (ada_is_constrained_packed_array_type (value_type (array
)))
10536 error (_("cannot slice a packed array"));
10538 /* If this is a reference to an array or an array lvalue,
10539 convert to a pointer. */
10540 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10541 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10542 && VALUE_LVAL (array
) == lval_memory
))
10543 array
= value_addr (array
);
10545 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10546 && ada_is_array_descriptor_type (ada_check_typedef
10547 (value_type (array
))))
10548 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10550 array
= ada_coerce_to_simple_array_ptr (array
);
10552 /* If we have more than one level of pointer indirection,
10553 dereference the value until we get only one level. */
10554 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10555 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10557 array
= value_ind (array
);
10559 /* Make sure we really do have an array type before going further,
10560 to avoid a SEGV when trying to get the index type or the target
10561 type later down the road if the debug info generated by
10562 the compiler is incorrect or incomplete. */
10563 if (!ada_is_simple_array_type (value_type (array
)))
10564 error (_("cannot take slice of non-array"));
10566 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10569 struct type
*type0
= ada_check_typedef (value_type (array
));
10571 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10572 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10575 struct type
*arr_type0
=
10576 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10578 return ada_value_slice_from_ptr (array
, arr_type0
,
10579 longest_to_int (low_bound
),
10580 longest_to_int (high_bound
));
10583 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10585 else if (high_bound
< low_bound
)
10586 return empty_array (value_type (array
), low_bound
);
10588 return ada_value_slice (array
, longest_to_int (low_bound
),
10589 longest_to_int (high_bound
));
10592 case UNOP_IN_RANGE
:
10594 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10595 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10597 if (noside
== EVAL_SKIP
)
10600 switch (TYPE_CODE (type
))
10603 lim_warning (_("Membership test incompletely implemented; "
10604 "always returns true"));
10605 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10606 return value_from_longest (type
, (LONGEST
) 1);
10608 case TYPE_CODE_RANGE
:
10609 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10610 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10611 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10612 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10613 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10615 value_from_longest (type
,
10616 (value_less (arg1
, arg3
)
10617 || value_equal (arg1
, arg3
))
10618 && (value_less (arg2
, arg1
)
10619 || value_equal (arg2
, arg1
)));
10622 case BINOP_IN_BOUNDS
:
10624 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10625 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10627 if (noside
== EVAL_SKIP
)
10630 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10632 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10633 return value_zero (type
, not_lval
);
10636 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10638 type
= ada_index_type (value_type (arg2
), tem
, "range");
10640 type
= value_type (arg1
);
10642 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10643 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10645 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10646 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10647 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10649 value_from_longest (type
,
10650 (value_less (arg1
, arg3
)
10651 || value_equal (arg1
, arg3
))
10652 && (value_less (arg2
, arg1
)
10653 || value_equal (arg2
, arg1
)));
10655 case TERNOP_IN_RANGE
:
10656 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10657 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10658 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10660 if (noside
== EVAL_SKIP
)
10663 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10664 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10665 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10667 value_from_longest (type
,
10668 (value_less (arg1
, arg3
)
10669 || value_equal (arg1
, arg3
))
10670 && (value_less (arg2
, arg1
)
10671 || value_equal (arg2
, arg1
)));
10675 case OP_ATR_LENGTH
:
10677 struct type
*type_arg
;
10679 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10681 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10683 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10687 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10691 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10692 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10693 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10696 if (noside
== EVAL_SKIP
)
10699 if (type_arg
== NULL
)
10701 arg1
= ada_coerce_ref (arg1
);
10703 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10704 arg1
= ada_coerce_to_simple_array (arg1
);
10706 if (op
== OP_ATR_LENGTH
)
10707 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10710 type
= ada_index_type (value_type (arg1
), tem
,
10711 ada_attribute_name (op
));
10713 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10716 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10717 return allocate_value (type
);
10721 default: /* Should never happen. */
10722 error (_("unexpected attribute encountered"));
10724 return value_from_longest
10725 (type
, ada_array_bound (arg1
, tem
, 0));
10727 return value_from_longest
10728 (type
, ada_array_bound (arg1
, tem
, 1));
10729 case OP_ATR_LENGTH
:
10730 return value_from_longest
10731 (type
, ada_array_length (arg1
, tem
));
10734 else if (discrete_type_p (type_arg
))
10736 struct type
*range_type
;
10737 const char *name
= ada_type_name (type_arg
);
10740 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10741 range_type
= to_fixed_range_type (type_arg
, NULL
);
10742 if (range_type
== NULL
)
10743 range_type
= type_arg
;
10747 error (_("unexpected attribute encountered"));
10749 return value_from_longest
10750 (range_type
, ada_discrete_type_low_bound (range_type
));
10752 return value_from_longest
10753 (range_type
, ada_discrete_type_high_bound (range_type
));
10754 case OP_ATR_LENGTH
:
10755 error (_("the 'length attribute applies only to array types"));
10758 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10759 error (_("unimplemented type attribute"));
10764 if (ada_is_constrained_packed_array_type (type_arg
))
10765 type_arg
= decode_constrained_packed_array_type (type_arg
);
10767 if (op
== OP_ATR_LENGTH
)
10768 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10771 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10773 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10776 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10777 return allocate_value (type
);
10782 error (_("unexpected attribute encountered"));
10784 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10785 return value_from_longest (type
, low
);
10787 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10788 return value_from_longest (type
, high
);
10789 case OP_ATR_LENGTH
:
10790 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10791 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10792 return value_from_longest (type
, high
- low
+ 1);
10798 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10799 if (noside
== EVAL_SKIP
)
10802 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10803 return value_zero (ada_tag_type (arg1
), not_lval
);
10805 return ada_value_tag (arg1
);
10809 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10810 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10811 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10812 if (noside
== EVAL_SKIP
)
10814 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10815 return value_zero (value_type (arg1
), not_lval
);
10818 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10819 return value_binop (arg1
, arg2
,
10820 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10823 case OP_ATR_MODULUS
:
10825 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10827 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10828 if (noside
== EVAL_SKIP
)
10831 if (!ada_is_modular_type (type_arg
))
10832 error (_("'modulus must be applied to modular type"));
10834 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10835 ada_modulus (type_arg
));
10840 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10841 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10842 if (noside
== EVAL_SKIP
)
10844 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10845 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10846 return value_zero (type
, not_lval
);
10848 return value_pos_atr (type
, arg1
);
10851 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10852 type
= value_type (arg1
);
10854 /* If the argument is a reference, then dereference its type, since
10855 the user is really asking for the size of the actual object,
10856 not the size of the pointer. */
10857 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10858 type
= TYPE_TARGET_TYPE (type
);
10860 if (noside
== EVAL_SKIP
)
10862 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10863 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10865 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10866 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10869 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10870 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10871 type
= exp
->elts
[pc
+ 2].type
;
10872 if (noside
== EVAL_SKIP
)
10874 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10875 return value_zero (type
, not_lval
);
10877 return value_val_atr (type
, arg1
);
10880 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10881 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10882 if (noside
== EVAL_SKIP
)
10884 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10885 return value_zero (value_type (arg1
), not_lval
);
10888 /* For integer exponentiation operations,
10889 only promote the first argument. */
10890 if (is_integral_type (value_type (arg2
)))
10891 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10893 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10895 return value_binop (arg1
, arg2
, op
);
10899 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10900 if (noside
== EVAL_SKIP
)
10906 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10907 if (noside
== EVAL_SKIP
)
10909 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10910 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10911 return value_neg (arg1
);
10916 preeval_pos
= *pos
;
10917 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10918 if (noside
== EVAL_SKIP
)
10920 type
= ada_check_typedef (value_type (arg1
));
10921 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10923 if (ada_is_array_descriptor_type (type
))
10924 /* GDB allows dereferencing GNAT array descriptors. */
10926 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10928 if (arrType
== NULL
)
10929 error (_("Attempt to dereference null array pointer."));
10930 return value_at_lazy (arrType
, 0);
10932 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10933 || TYPE_CODE (type
) == TYPE_CODE_REF
10934 /* In C you can dereference an array to get the 1st elt. */
10935 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10937 /* As mentioned in the OP_VAR_VALUE case, tagged types can
10938 only be determined by inspecting the object's tag.
10939 This means that we need to evaluate completely the
10940 expression in order to get its type. */
10942 if ((TYPE_CODE (type
) == TYPE_CODE_REF
10943 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
10944 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
10946 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10948 type
= value_type (ada_value_ind (arg1
));
10952 type
= to_static_fixed_type
10954 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10956 ada_ensure_varsize_limit (type
);
10957 return value_zero (type
, lval_memory
);
10959 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10961 /* GDB allows dereferencing an int. */
10962 if (expect_type
== NULL
)
10963 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10968 to_static_fixed_type (ada_aligned_type (expect_type
));
10969 return value_zero (expect_type
, lval_memory
);
10973 error (_("Attempt to take contents of a non-pointer value."));
10975 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10976 type
= ada_check_typedef (value_type (arg1
));
10978 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10979 /* GDB allows dereferencing an int. If we were given
10980 the expect_type, then use that as the target type.
10981 Otherwise, assume that the target type is an int. */
10983 if (expect_type
!= NULL
)
10984 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10987 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10988 (CORE_ADDR
) value_as_address (arg1
));
10991 if (ada_is_array_descriptor_type (type
))
10992 /* GDB allows dereferencing GNAT array descriptors. */
10993 return ada_coerce_to_simple_array (arg1
);
10995 return ada_value_ind (arg1
);
10997 case STRUCTOP_STRUCT
:
10998 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10999 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11000 preeval_pos
= *pos
;
11001 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11002 if (noside
== EVAL_SKIP
)
11004 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11006 struct type
*type1
= value_type (arg1
);
11008 if (ada_is_tagged_type (type1
, 1))
11010 type
= ada_lookup_struct_elt_type (type1
,
11011 &exp
->elts
[pc
+ 2].string
,
11014 /* If the field is not found, check if it exists in the
11015 extension of this object's type. This means that we
11016 need to evaluate completely the expression. */
11020 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11022 arg1
= ada_value_struct_elt (arg1
,
11023 &exp
->elts
[pc
+ 2].string
,
11025 arg1
= unwrap_value (arg1
);
11026 type
= value_type (ada_to_fixed_value (arg1
));
11031 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11034 return value_zero (ada_aligned_type (type
), lval_memory
);
11037 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11038 arg1
= unwrap_value (arg1
);
11039 return ada_to_fixed_value (arg1
);
11042 /* The value is not supposed to be used. This is here to make it
11043 easier to accommodate expressions that contain types. */
11045 if (noside
== EVAL_SKIP
)
11047 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11048 return allocate_value (exp
->elts
[pc
+ 1].type
);
11050 error (_("Attempt to use a type name as an expression"));
11055 case OP_DISCRETE_RANGE
:
11056 case OP_POSITIONAL
:
11058 if (noside
== EVAL_NORMAL
)
11062 error (_("Undefined name, ambiguous name, or renaming used in "
11063 "component association: %s."), &exp
->elts
[pc
+2].string
);
11065 error (_("Aggregates only allowed on the right of an assignment"));
11067 internal_error (__FILE__
, __LINE__
,
11068 _("aggregate apparently mangled"));
11071 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11073 for (tem
= 0; tem
< nargs
; tem
+= 1)
11074 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11079 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
11085 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11086 type name that encodes the 'small and 'delta information.
11087 Otherwise, return NULL. */
11089 static const char *
11090 fixed_type_info (struct type
*type
)
11092 const char *name
= ada_type_name (type
);
11093 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11095 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11097 const char *tail
= strstr (name
, "___XF_");
11104 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11105 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11110 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11113 ada_is_fixed_point_type (struct type
*type
)
11115 return fixed_type_info (type
) != NULL
;
11118 /* Return non-zero iff TYPE represents a System.Address type. */
11121 ada_is_system_address_type (struct type
*type
)
11123 return (TYPE_NAME (type
)
11124 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11127 /* Assuming that TYPE is the representation of an Ada fixed-point
11128 type, return its delta, or -1 if the type is malformed and the
11129 delta cannot be determined. */
11132 ada_delta (struct type
*type
)
11134 const char *encoding
= fixed_type_info (type
);
11137 /* Strictly speaking, num and den are encoded as integer. However,
11138 they may not fit into a long, and they will have to be converted
11139 to DOUBLEST anyway. So scan them as DOUBLEST. */
11140 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11147 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11148 factor ('SMALL value) associated with the type. */
11151 scaling_factor (struct type
*type
)
11153 const char *encoding
= fixed_type_info (type
);
11154 DOUBLEST num0
, den0
, num1
, den1
;
11157 /* Strictly speaking, num's and den's are encoded as integer. However,
11158 they may not fit into a long, and they will have to be converted
11159 to DOUBLEST anyway. So scan them as DOUBLEST. */
11160 n
= sscanf (encoding
,
11161 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
11162 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11163 &num0
, &den0
, &num1
, &den1
);
11168 return num1
/ den1
;
11170 return num0
/ den0
;
11174 /* Assuming that X is the representation of a value of fixed-point
11175 type TYPE, return its floating-point equivalent. */
11178 ada_fixed_to_float (struct type
*type
, LONGEST x
)
11180 return (DOUBLEST
) x
*scaling_factor (type
);
11183 /* The representation of a fixed-point value of type TYPE
11184 corresponding to the value X. */
11187 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
11189 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
11196 /* Scan STR beginning at position K for a discriminant name, and
11197 return the value of that discriminant field of DVAL in *PX. If
11198 PNEW_K is not null, put the position of the character beyond the
11199 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11200 not alter *PX and *PNEW_K if unsuccessful. */
11203 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11206 static char *bound_buffer
= NULL
;
11207 static size_t bound_buffer_len
= 0;
11210 struct value
*bound_val
;
11212 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11215 pend
= strstr (str
+ k
, "__");
11219 k
+= strlen (bound
);
11223 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
11224 bound
= bound_buffer
;
11225 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
11226 bound
[pend
- (str
+ k
)] = '\0';
11230 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11231 if (bound_val
== NULL
)
11234 *px
= value_as_long (bound_val
);
11235 if (pnew_k
!= NULL
)
11240 /* Value of variable named NAME in the current environment. If
11241 no such variable found, then if ERR_MSG is null, returns 0, and
11242 otherwise causes an error with message ERR_MSG. */
11244 static struct value
*
11245 get_var_value (char *name
, char *err_msg
)
11247 struct ada_symbol_info
*syms
;
11250 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11255 if (err_msg
== NULL
)
11258 error (("%s"), err_msg
);
11261 return value_of_variable (syms
[0].sym
, syms
[0].block
);
11264 /* Value of integer variable named NAME in the current environment. If
11265 no such variable found, returns 0, and sets *FLAG to 0. If
11266 successful, sets *FLAG to 1. */
11269 get_int_var_value (char *name
, int *flag
)
11271 struct value
*var_val
= get_var_value (name
, 0);
11283 return value_as_long (var_val
);
11288 /* Return a range type whose base type is that of the range type named
11289 NAME in the current environment, and whose bounds are calculated
11290 from NAME according to the GNAT range encoding conventions.
11291 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11292 corresponding range type from debug information; fall back to using it
11293 if symbol lookup fails. If a new type must be created, allocate it
11294 like ORIG_TYPE was. The bounds information, in general, is encoded
11295 in NAME, the base type given in the named range type. */
11297 static struct type
*
11298 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11301 struct type
*base_type
;
11302 char *subtype_info
;
11304 gdb_assert (raw_type
!= NULL
);
11305 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11307 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11308 base_type
= TYPE_TARGET_TYPE (raw_type
);
11310 base_type
= raw_type
;
11312 name
= TYPE_NAME (raw_type
);
11313 subtype_info
= strstr (name
, "___XD");
11314 if (subtype_info
== NULL
)
11316 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11317 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11319 if (L
< INT_MIN
|| U
> INT_MAX
)
11322 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11327 static char *name_buf
= NULL
;
11328 static size_t name_len
= 0;
11329 int prefix_len
= subtype_info
- name
;
11335 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11336 strncpy (name_buf
, name
, prefix_len
);
11337 name_buf
[prefix_len
] = '\0';
11340 bounds_str
= strchr (subtype_info
, '_');
11343 if (*subtype_info
== 'L')
11345 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11346 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11348 if (bounds_str
[n
] == '_')
11350 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11358 strcpy (name_buf
+ prefix_len
, "___L");
11359 L
= get_int_var_value (name_buf
, &ok
);
11362 lim_warning (_("Unknown lower bound, using 1."));
11367 if (*subtype_info
== 'U')
11369 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11370 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11377 strcpy (name_buf
+ prefix_len
, "___U");
11378 U
= get_int_var_value (name_buf
, &ok
);
11381 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11386 type
= create_static_range_type (alloc_type_copy (raw_type
),
11388 TYPE_NAME (type
) = name
;
11393 /* True iff NAME is the name of a range type. */
11396 ada_is_range_type_name (const char *name
)
11398 return (name
!= NULL
&& strstr (name
, "___XD"));
11402 /* Modular types */
11404 /* True iff TYPE is an Ada modular type. */
11407 ada_is_modular_type (struct type
*type
)
11409 struct type
*subranged_type
= get_base_type (type
);
11411 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11412 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11413 && TYPE_UNSIGNED (subranged_type
));
11416 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11419 ada_modulus (struct type
*type
)
11421 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11425 /* Ada exception catchpoint support:
11426 ---------------------------------
11428 We support 3 kinds of exception catchpoints:
11429 . catchpoints on Ada exceptions
11430 . catchpoints on unhandled Ada exceptions
11431 . catchpoints on failed assertions
11433 Exceptions raised during failed assertions, or unhandled exceptions
11434 could perfectly be caught with the general catchpoint on Ada exceptions.
11435 However, we can easily differentiate these two special cases, and having
11436 the option to distinguish these two cases from the rest can be useful
11437 to zero-in on certain situations.
11439 Exception catchpoints are a specialized form of breakpoint,
11440 since they rely on inserting breakpoints inside known routines
11441 of the GNAT runtime. The implementation therefore uses a standard
11442 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11445 Support in the runtime for exception catchpoints have been changed
11446 a few times already, and these changes affect the implementation
11447 of these catchpoints. In order to be able to support several
11448 variants of the runtime, we use a sniffer that will determine
11449 the runtime variant used by the program being debugged. */
11451 /* Ada's standard exceptions.
11453 The Ada 83 standard also defined Numeric_Error. But there so many
11454 situations where it was unclear from the Ada 83 Reference Manual
11455 (RM) whether Constraint_Error or Numeric_Error should be raised,
11456 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11457 Interpretation saying that anytime the RM says that Numeric_Error
11458 should be raised, the implementation may raise Constraint_Error.
11459 Ada 95 went one step further and pretty much removed Numeric_Error
11460 from the list of standard exceptions (it made it a renaming of
11461 Constraint_Error, to help preserve compatibility when compiling
11462 an Ada83 compiler). As such, we do not include Numeric_Error from
11463 this list of standard exceptions. */
11465 static char *standard_exc
[] = {
11466 "constraint_error",
11472 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11474 /* A structure that describes how to support exception catchpoints
11475 for a given executable. */
11477 struct exception_support_info
11479 /* The name of the symbol to break on in order to insert
11480 a catchpoint on exceptions. */
11481 const char *catch_exception_sym
;
11483 /* The name of the symbol to break on in order to insert
11484 a catchpoint on unhandled exceptions. */
11485 const char *catch_exception_unhandled_sym
;
11487 /* The name of the symbol to break on in order to insert
11488 a catchpoint on failed assertions. */
11489 const char *catch_assert_sym
;
11491 /* Assuming that the inferior just triggered an unhandled exception
11492 catchpoint, this function is responsible for returning the address
11493 in inferior memory where the name of that exception is stored.
11494 Return zero if the address could not be computed. */
11495 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11498 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11499 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11501 /* The following exception support info structure describes how to
11502 implement exception catchpoints with the latest version of the
11503 Ada runtime (as of 2007-03-06). */
11505 static const struct exception_support_info default_exception_support_info
=
11507 "__gnat_debug_raise_exception", /* catch_exception_sym */
11508 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11509 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11510 ada_unhandled_exception_name_addr
11513 /* The following exception support info structure describes how to
11514 implement exception catchpoints with a slightly older version
11515 of the Ada runtime. */
11517 static const struct exception_support_info exception_support_info_fallback
=
11519 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11520 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11521 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11522 ada_unhandled_exception_name_addr_from_raise
11525 /* Return nonzero if we can detect the exception support routines
11526 described in EINFO.
11528 This function errors out if an abnormal situation is detected
11529 (for instance, if we find the exception support routines, but
11530 that support is found to be incomplete). */
11533 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11535 struct symbol
*sym
;
11537 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11538 that should be compiled with debugging information. As a result, we
11539 expect to find that symbol in the symtabs. */
11541 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11544 /* Perhaps we did not find our symbol because the Ada runtime was
11545 compiled without debugging info, or simply stripped of it.
11546 It happens on some GNU/Linux distributions for instance, where
11547 users have to install a separate debug package in order to get
11548 the runtime's debugging info. In that situation, let the user
11549 know why we cannot insert an Ada exception catchpoint.
11551 Note: Just for the purpose of inserting our Ada exception
11552 catchpoint, we could rely purely on the associated minimal symbol.
11553 But we would be operating in degraded mode anyway, since we are
11554 still lacking the debugging info needed later on to extract
11555 the name of the exception being raised (this name is printed in
11556 the catchpoint message, and is also used when trying to catch
11557 a specific exception). We do not handle this case for now. */
11558 struct bound_minimal_symbol msym
11559 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11561 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11562 error (_("Your Ada runtime appears to be missing some debugging "
11563 "information.\nCannot insert Ada exception catchpoint "
11564 "in this configuration."));
11569 /* Make sure that the symbol we found corresponds to a function. */
11571 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11572 error (_("Symbol \"%s\" is not a function (class = %d)"),
11573 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11578 /* Inspect the Ada runtime and determine which exception info structure
11579 should be used to provide support for exception catchpoints.
11581 This function will always set the per-inferior exception_info,
11582 or raise an error. */
11585 ada_exception_support_info_sniffer (void)
11587 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11589 /* If the exception info is already known, then no need to recompute it. */
11590 if (data
->exception_info
!= NULL
)
11593 /* Check the latest (default) exception support info. */
11594 if (ada_has_this_exception_support (&default_exception_support_info
))
11596 data
->exception_info
= &default_exception_support_info
;
11600 /* Try our fallback exception suport info. */
11601 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11603 data
->exception_info
= &exception_support_info_fallback
;
11607 /* Sometimes, it is normal for us to not be able to find the routine
11608 we are looking for. This happens when the program is linked with
11609 the shared version of the GNAT runtime, and the program has not been
11610 started yet. Inform the user of these two possible causes if
11613 if (ada_update_initial_language (language_unknown
) != language_ada
)
11614 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11616 /* If the symbol does not exist, then check that the program is
11617 already started, to make sure that shared libraries have been
11618 loaded. If it is not started, this may mean that the symbol is
11619 in a shared library. */
11621 if (ptid_get_pid (inferior_ptid
) == 0)
11622 error (_("Unable to insert catchpoint. Try to start the program first."));
11624 /* At this point, we know that we are debugging an Ada program and
11625 that the inferior has been started, but we still are not able to
11626 find the run-time symbols. That can mean that we are in
11627 configurable run time mode, or that a-except as been optimized
11628 out by the linker... In any case, at this point it is not worth
11629 supporting this feature. */
11631 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11634 /* True iff FRAME is very likely to be that of a function that is
11635 part of the runtime system. This is all very heuristic, but is
11636 intended to be used as advice as to what frames are uninteresting
11640 is_known_support_routine (struct frame_info
*frame
)
11642 struct symtab_and_line sal
;
11644 enum language func_lang
;
11646 const char *fullname
;
11648 /* If this code does not have any debugging information (no symtab),
11649 This cannot be any user code. */
11651 find_frame_sal (frame
, &sal
);
11652 if (sal
.symtab
== NULL
)
11655 /* If there is a symtab, but the associated source file cannot be
11656 located, then assume this is not user code: Selecting a frame
11657 for which we cannot display the code would not be very helpful
11658 for the user. This should also take care of case such as VxWorks
11659 where the kernel has some debugging info provided for a few units. */
11661 fullname
= symtab_to_fullname (sal
.symtab
);
11662 if (access (fullname
, R_OK
) != 0)
11665 /* Check the unit filename againt the Ada runtime file naming.
11666 We also check the name of the objfile against the name of some
11667 known system libraries that sometimes come with debugging info
11670 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11672 re_comp (known_runtime_file_name_patterns
[i
]);
11673 if (re_exec (lbasename (sal
.symtab
->filename
)))
11675 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11676 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11680 /* Check whether the function is a GNAT-generated entity. */
11682 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
11683 if (func_name
== NULL
)
11686 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11688 re_comp (known_auxiliary_function_name_patterns
[i
]);
11689 if (re_exec (func_name
))
11700 /* Find the first frame that contains debugging information and that is not
11701 part of the Ada run-time, starting from FI and moving upward. */
11704 ada_find_printable_frame (struct frame_info
*fi
)
11706 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11708 if (!is_known_support_routine (fi
))
11717 /* Assuming that the inferior just triggered an unhandled exception
11718 catchpoint, return the address in inferior memory where the name
11719 of the exception is stored.
11721 Return zero if the address could not be computed. */
11724 ada_unhandled_exception_name_addr (void)
11726 return parse_and_eval_address ("e.full_name");
11729 /* Same as ada_unhandled_exception_name_addr, except that this function
11730 should be used when the inferior uses an older version of the runtime,
11731 where the exception name needs to be extracted from a specific frame
11732 several frames up in the callstack. */
11735 ada_unhandled_exception_name_addr_from_raise (void)
11738 struct frame_info
*fi
;
11739 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11740 struct cleanup
*old_chain
;
11742 /* To determine the name of this exception, we need to select
11743 the frame corresponding to RAISE_SYM_NAME. This frame is
11744 at least 3 levels up, so we simply skip the first 3 frames
11745 without checking the name of their associated function. */
11746 fi
= get_current_frame ();
11747 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11749 fi
= get_prev_frame (fi
);
11751 old_chain
= make_cleanup (null_cleanup
, NULL
);
11755 enum language func_lang
;
11757 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
11758 if (func_name
!= NULL
)
11760 make_cleanup (xfree
, func_name
);
11762 if (strcmp (func_name
,
11763 data
->exception_info
->catch_exception_sym
) == 0)
11764 break; /* We found the frame we were looking for... */
11765 fi
= get_prev_frame (fi
);
11768 do_cleanups (old_chain
);
11774 return parse_and_eval_address ("id.full_name");
11777 /* Assuming the inferior just triggered an Ada exception catchpoint
11778 (of any type), return the address in inferior memory where the name
11779 of the exception is stored, if applicable.
11781 Return zero if the address could not be computed, or if not relevant. */
11784 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11785 struct breakpoint
*b
)
11787 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11791 case ada_catch_exception
:
11792 return (parse_and_eval_address ("e.full_name"));
11795 case ada_catch_exception_unhandled
:
11796 return data
->exception_info
->unhandled_exception_name_addr ();
11799 case ada_catch_assert
:
11800 return 0; /* Exception name is not relevant in this case. */
11804 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11808 return 0; /* Should never be reached. */
11811 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11812 any error that ada_exception_name_addr_1 might cause to be thrown.
11813 When an error is intercepted, a warning with the error message is printed,
11814 and zero is returned. */
11817 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11818 struct breakpoint
*b
)
11820 volatile struct gdb_exception e
;
11821 CORE_ADDR result
= 0;
11823 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11825 result
= ada_exception_name_addr_1 (ex
, b
);
11830 warning (_("failed to get exception name: %s"), e
.message
);
11837 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11839 /* Ada catchpoints.
11841 In the case of catchpoints on Ada exceptions, the catchpoint will
11842 stop the target on every exception the program throws. When a user
11843 specifies the name of a specific exception, we translate this
11844 request into a condition expression (in text form), and then parse
11845 it into an expression stored in each of the catchpoint's locations.
11846 We then use this condition to check whether the exception that was
11847 raised is the one the user is interested in. If not, then the
11848 target is resumed again. We store the name of the requested
11849 exception, in order to be able to re-set the condition expression
11850 when symbols change. */
11852 /* An instance of this type is used to represent an Ada catchpoint
11853 breakpoint location. It includes a "struct bp_location" as a kind
11854 of base class; users downcast to "struct bp_location *" when
11857 struct ada_catchpoint_location
11859 /* The base class. */
11860 struct bp_location base
;
11862 /* The condition that checks whether the exception that was raised
11863 is the specific exception the user specified on catchpoint
11865 struct expression
*excep_cond_expr
;
11868 /* Implement the DTOR method in the bp_location_ops structure for all
11869 Ada exception catchpoint kinds. */
11872 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11874 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11876 xfree (al
->excep_cond_expr
);
11879 /* The vtable to be used in Ada catchpoint locations. */
11881 static const struct bp_location_ops ada_catchpoint_location_ops
=
11883 ada_catchpoint_location_dtor
11886 /* An instance of this type is used to represent an Ada catchpoint.
11887 It includes a "struct breakpoint" as a kind of base class; users
11888 downcast to "struct breakpoint *" when needed. */
11890 struct ada_catchpoint
11892 /* The base class. */
11893 struct breakpoint base
;
11895 /* The name of the specific exception the user specified. */
11896 char *excep_string
;
11899 /* Parse the exception condition string in the context of each of the
11900 catchpoint's locations, and store them for later evaluation. */
11903 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11905 struct cleanup
*old_chain
;
11906 struct bp_location
*bl
;
11909 /* Nothing to do if there's no specific exception to catch. */
11910 if (c
->excep_string
== NULL
)
11913 /* Same if there are no locations... */
11914 if (c
->base
.loc
== NULL
)
11917 /* Compute the condition expression in text form, from the specific
11918 expection we want to catch. */
11919 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11920 old_chain
= make_cleanup (xfree
, cond_string
);
11922 /* Iterate over all the catchpoint's locations, and parse an
11923 expression for each. */
11924 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11926 struct ada_catchpoint_location
*ada_loc
11927 = (struct ada_catchpoint_location
*) bl
;
11928 struct expression
*exp
= NULL
;
11930 if (!bl
->shlib_disabled
)
11932 volatile struct gdb_exception e
;
11936 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11938 exp
= parse_exp_1 (&s
, bl
->address
,
11939 block_for_pc (bl
->address
), 0);
11943 warning (_("failed to reevaluate internal exception condition "
11944 "for catchpoint %d: %s"),
11945 c
->base
.number
, e
.message
);
11946 /* There is a bug in GCC on sparc-solaris when building with
11947 optimization which causes EXP to change unexpectedly
11948 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
11949 The problem should be fixed starting with GCC 4.9.
11950 In the meantime, work around it by forcing EXP back
11956 ada_loc
->excep_cond_expr
= exp
;
11959 do_cleanups (old_chain
);
11962 /* Implement the DTOR method in the breakpoint_ops structure for all
11963 exception catchpoint kinds. */
11966 dtor_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11968 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11970 xfree (c
->excep_string
);
11972 bkpt_breakpoint_ops
.dtor (b
);
11975 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11976 structure for all exception catchpoint kinds. */
11978 static struct bp_location
*
11979 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
11980 struct breakpoint
*self
)
11982 struct ada_catchpoint_location
*loc
;
11984 loc
= XNEW (struct ada_catchpoint_location
);
11985 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
11986 loc
->excep_cond_expr
= NULL
;
11990 /* Implement the RE_SET method in the breakpoint_ops structure for all
11991 exception catchpoint kinds. */
11994 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11996 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11998 /* Call the base class's method. This updates the catchpoint's
12000 bkpt_breakpoint_ops
.re_set (b
);
12002 /* Reparse the exception conditional expressions. One for each
12004 create_excep_cond_exprs (c
);
12007 /* Returns true if we should stop for this breakpoint hit. If the
12008 user specified a specific exception, we only want to cause a stop
12009 if the program thrown that exception. */
12012 should_stop_exception (const struct bp_location
*bl
)
12014 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12015 const struct ada_catchpoint_location
*ada_loc
12016 = (const struct ada_catchpoint_location
*) bl
;
12017 volatile struct gdb_exception ex
;
12020 /* With no specific exception, should always stop. */
12021 if (c
->excep_string
== NULL
)
12024 if (ada_loc
->excep_cond_expr
== NULL
)
12026 /* We will have a NULL expression if back when we were creating
12027 the expressions, this location's had failed to parse. */
12032 TRY_CATCH (ex
, RETURN_MASK_ALL
)
12034 struct value
*mark
;
12036 mark
= value_mark ();
12037 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
12038 value_free_to_mark (mark
);
12041 exception_fprintf (gdb_stderr
, ex
,
12042 _("Error in testing exception condition:\n"));
12046 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12047 for all exception catchpoint kinds. */
12050 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12052 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12055 /* Implement the PRINT_IT method in the breakpoint_ops structure
12056 for all exception catchpoint kinds. */
12058 static enum print_stop_action
12059 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12061 struct ui_out
*uiout
= current_uiout
;
12062 struct breakpoint
*b
= bs
->breakpoint_at
;
12064 annotate_catchpoint (b
->number
);
12066 if (ui_out_is_mi_like_p (uiout
))
12068 ui_out_field_string (uiout
, "reason",
12069 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12070 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
12073 ui_out_text (uiout
,
12074 b
->disposition
== disp_del
? "\nTemporary catchpoint "
12075 : "\nCatchpoint ");
12076 ui_out_field_int (uiout
, "bkptno", b
->number
);
12077 ui_out_text (uiout
, ", ");
12081 case ada_catch_exception
:
12082 case ada_catch_exception_unhandled
:
12084 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
12085 char exception_name
[256];
12089 read_memory (addr
, (gdb_byte
*) exception_name
,
12090 sizeof (exception_name
) - 1);
12091 exception_name
[sizeof (exception_name
) - 1] = '\0';
12095 /* For some reason, we were unable to read the exception
12096 name. This could happen if the Runtime was compiled
12097 without debugging info, for instance. In that case,
12098 just replace the exception name by the generic string
12099 "exception" - it will read as "an exception" in the
12100 notification we are about to print. */
12101 memcpy (exception_name
, "exception", sizeof ("exception"));
12103 /* In the case of unhandled exception breakpoints, we print
12104 the exception name as "unhandled EXCEPTION_NAME", to make
12105 it clearer to the user which kind of catchpoint just got
12106 hit. We used ui_out_text to make sure that this extra
12107 info does not pollute the exception name in the MI case. */
12108 if (ex
== ada_catch_exception_unhandled
)
12109 ui_out_text (uiout
, "unhandled ");
12110 ui_out_field_string (uiout
, "exception-name", exception_name
);
12113 case ada_catch_assert
:
12114 /* In this case, the name of the exception is not really
12115 important. Just print "failed assertion" to make it clearer
12116 that his program just hit an assertion-failure catchpoint.
12117 We used ui_out_text because this info does not belong in
12119 ui_out_text (uiout
, "failed assertion");
12122 ui_out_text (uiout
, " at ");
12123 ada_find_printable_frame (get_current_frame ());
12125 return PRINT_SRC_AND_LOC
;
12128 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12129 for all exception catchpoint kinds. */
12132 print_one_exception (enum ada_exception_catchpoint_kind ex
,
12133 struct breakpoint
*b
, struct bp_location
**last_loc
)
12135 struct ui_out
*uiout
= current_uiout
;
12136 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12137 struct value_print_options opts
;
12139 get_user_print_options (&opts
);
12140 if (opts
.addressprint
)
12142 annotate_field (4);
12143 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
12146 annotate_field (5);
12147 *last_loc
= b
->loc
;
12150 case ada_catch_exception
:
12151 if (c
->excep_string
!= NULL
)
12153 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12155 ui_out_field_string (uiout
, "what", msg
);
12159 ui_out_field_string (uiout
, "what", "all Ada exceptions");
12163 case ada_catch_exception_unhandled
:
12164 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
12167 case ada_catch_assert
:
12168 ui_out_field_string (uiout
, "what", "failed Ada assertions");
12172 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12177 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12178 for all exception catchpoint kinds. */
12181 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12182 struct breakpoint
*b
)
12184 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12185 struct ui_out
*uiout
= current_uiout
;
12187 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
12188 : _("Catchpoint "));
12189 ui_out_field_int (uiout
, "bkptno", b
->number
);
12190 ui_out_text (uiout
, ": ");
12194 case ada_catch_exception
:
12195 if (c
->excep_string
!= NULL
)
12197 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12198 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12200 ui_out_text (uiout
, info
);
12201 do_cleanups (old_chain
);
12204 ui_out_text (uiout
, _("all Ada exceptions"));
12207 case ada_catch_exception_unhandled
:
12208 ui_out_text (uiout
, _("unhandled Ada exceptions"));
12211 case ada_catch_assert
:
12212 ui_out_text (uiout
, _("failed Ada assertions"));
12216 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12221 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12222 for all exception catchpoint kinds. */
12225 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12226 struct breakpoint
*b
, struct ui_file
*fp
)
12228 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12232 case ada_catch_exception
:
12233 fprintf_filtered (fp
, "catch exception");
12234 if (c
->excep_string
!= NULL
)
12235 fprintf_filtered (fp
, " %s", c
->excep_string
);
12238 case ada_catch_exception_unhandled
:
12239 fprintf_filtered (fp
, "catch exception unhandled");
12242 case ada_catch_assert
:
12243 fprintf_filtered (fp
, "catch assert");
12247 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12249 print_recreate_thread (b
, fp
);
12252 /* Virtual table for "catch exception" breakpoints. */
12255 dtor_catch_exception (struct breakpoint
*b
)
12257 dtor_exception (ada_catch_exception
, b
);
12260 static struct bp_location
*
12261 allocate_location_catch_exception (struct breakpoint
*self
)
12263 return allocate_location_exception (ada_catch_exception
, self
);
12267 re_set_catch_exception (struct breakpoint
*b
)
12269 re_set_exception (ada_catch_exception
, b
);
12273 check_status_catch_exception (bpstat bs
)
12275 check_status_exception (ada_catch_exception
, bs
);
12278 static enum print_stop_action
12279 print_it_catch_exception (bpstat bs
)
12281 return print_it_exception (ada_catch_exception
, bs
);
12285 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12287 print_one_exception (ada_catch_exception
, b
, last_loc
);
12291 print_mention_catch_exception (struct breakpoint
*b
)
12293 print_mention_exception (ada_catch_exception
, b
);
12297 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12299 print_recreate_exception (ada_catch_exception
, b
, fp
);
12302 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12304 /* Virtual table for "catch exception unhandled" breakpoints. */
12307 dtor_catch_exception_unhandled (struct breakpoint
*b
)
12309 dtor_exception (ada_catch_exception_unhandled
, b
);
12312 static struct bp_location
*
12313 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12315 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12319 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12321 re_set_exception (ada_catch_exception_unhandled
, b
);
12325 check_status_catch_exception_unhandled (bpstat bs
)
12327 check_status_exception (ada_catch_exception_unhandled
, bs
);
12330 static enum print_stop_action
12331 print_it_catch_exception_unhandled (bpstat bs
)
12333 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12337 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12338 struct bp_location
**last_loc
)
12340 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12344 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12346 print_mention_exception (ada_catch_exception_unhandled
, b
);
12350 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12351 struct ui_file
*fp
)
12353 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12356 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12358 /* Virtual table for "catch assert" breakpoints. */
12361 dtor_catch_assert (struct breakpoint
*b
)
12363 dtor_exception (ada_catch_assert
, b
);
12366 static struct bp_location
*
12367 allocate_location_catch_assert (struct breakpoint
*self
)
12369 return allocate_location_exception (ada_catch_assert
, self
);
12373 re_set_catch_assert (struct breakpoint
*b
)
12375 re_set_exception (ada_catch_assert
, b
);
12379 check_status_catch_assert (bpstat bs
)
12381 check_status_exception (ada_catch_assert
, bs
);
12384 static enum print_stop_action
12385 print_it_catch_assert (bpstat bs
)
12387 return print_it_exception (ada_catch_assert
, bs
);
12391 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12393 print_one_exception (ada_catch_assert
, b
, last_loc
);
12397 print_mention_catch_assert (struct breakpoint
*b
)
12399 print_mention_exception (ada_catch_assert
, b
);
12403 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12405 print_recreate_exception (ada_catch_assert
, b
, fp
);
12408 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12410 /* Return a newly allocated copy of the first space-separated token
12411 in ARGSP, and then adjust ARGSP to point immediately after that
12414 Return NULL if ARGPS does not contain any more tokens. */
12417 ada_get_next_arg (char **argsp
)
12419 char *args
= *argsp
;
12423 args
= skip_spaces (args
);
12424 if (args
[0] == '\0')
12425 return NULL
; /* No more arguments. */
12427 /* Find the end of the current argument. */
12429 end
= skip_to_space (args
);
12431 /* Adjust ARGSP to point to the start of the next argument. */
12435 /* Make a copy of the current argument and return it. */
12437 result
= xmalloc (end
- args
+ 1);
12438 strncpy (result
, args
, end
- args
);
12439 result
[end
- args
] = '\0';
12444 /* Split the arguments specified in a "catch exception" command.
12445 Set EX to the appropriate catchpoint type.
12446 Set EXCEP_STRING to the name of the specific exception if
12447 specified by the user.
12448 If a condition is found at the end of the arguments, the condition
12449 expression is stored in COND_STRING (memory must be deallocated
12450 after use). Otherwise COND_STRING is set to NULL. */
12453 catch_ada_exception_command_split (char *args
,
12454 enum ada_exception_catchpoint_kind
*ex
,
12455 char **excep_string
,
12456 char **cond_string
)
12458 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12459 char *exception_name
;
12462 exception_name
= ada_get_next_arg (&args
);
12463 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12465 /* This is not an exception name; this is the start of a condition
12466 expression for a catchpoint on all exceptions. So, "un-get"
12467 this token, and set exception_name to NULL. */
12468 xfree (exception_name
);
12469 exception_name
= NULL
;
12472 make_cleanup (xfree
, exception_name
);
12474 /* Check to see if we have a condition. */
12476 args
= skip_spaces (args
);
12477 if (startswith (args
, "if")
12478 && (isspace (args
[2]) || args
[2] == '\0'))
12481 args
= skip_spaces (args
);
12483 if (args
[0] == '\0')
12484 error (_("Condition missing after `if' keyword"));
12485 cond
= xstrdup (args
);
12486 make_cleanup (xfree
, cond
);
12488 args
+= strlen (args
);
12491 /* Check that we do not have any more arguments. Anything else
12494 if (args
[0] != '\0')
12495 error (_("Junk at end of expression"));
12497 discard_cleanups (old_chain
);
12499 if (exception_name
== NULL
)
12501 /* Catch all exceptions. */
12502 *ex
= ada_catch_exception
;
12503 *excep_string
= NULL
;
12505 else if (strcmp (exception_name
, "unhandled") == 0)
12507 /* Catch unhandled exceptions. */
12508 *ex
= ada_catch_exception_unhandled
;
12509 *excep_string
= NULL
;
12513 /* Catch a specific exception. */
12514 *ex
= ada_catch_exception
;
12515 *excep_string
= exception_name
;
12517 *cond_string
= cond
;
12520 /* Return the name of the symbol on which we should break in order to
12521 implement a catchpoint of the EX kind. */
12523 static const char *
12524 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12526 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12528 gdb_assert (data
->exception_info
!= NULL
);
12532 case ada_catch_exception
:
12533 return (data
->exception_info
->catch_exception_sym
);
12535 case ada_catch_exception_unhandled
:
12536 return (data
->exception_info
->catch_exception_unhandled_sym
);
12538 case ada_catch_assert
:
12539 return (data
->exception_info
->catch_assert_sym
);
12542 internal_error (__FILE__
, __LINE__
,
12543 _("unexpected catchpoint kind (%d)"), ex
);
12547 /* Return the breakpoint ops "virtual table" used for catchpoints
12550 static const struct breakpoint_ops
*
12551 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12555 case ada_catch_exception
:
12556 return (&catch_exception_breakpoint_ops
);
12558 case ada_catch_exception_unhandled
:
12559 return (&catch_exception_unhandled_breakpoint_ops
);
12561 case ada_catch_assert
:
12562 return (&catch_assert_breakpoint_ops
);
12565 internal_error (__FILE__
, __LINE__
,
12566 _("unexpected catchpoint kind (%d)"), ex
);
12570 /* Return the condition that will be used to match the current exception
12571 being raised with the exception that the user wants to catch. This
12572 assumes that this condition is used when the inferior just triggered
12573 an exception catchpoint.
12575 The string returned is a newly allocated string that needs to be
12576 deallocated later. */
12579 ada_exception_catchpoint_cond_string (const char *excep_string
)
12583 /* The standard exceptions are a special case. They are defined in
12584 runtime units that have been compiled without debugging info; if
12585 EXCEP_STRING is the not-fully-qualified name of a standard
12586 exception (e.g. "constraint_error") then, during the evaluation
12587 of the condition expression, the symbol lookup on this name would
12588 *not* return this standard exception. The catchpoint condition
12589 may then be set only on user-defined exceptions which have the
12590 same not-fully-qualified name (e.g. my_package.constraint_error).
12592 To avoid this unexcepted behavior, these standard exceptions are
12593 systematically prefixed by "standard". This means that "catch
12594 exception constraint_error" is rewritten into "catch exception
12595 standard.constraint_error".
12597 If an exception named contraint_error is defined in another package of
12598 the inferior program, then the only way to specify this exception as a
12599 breakpoint condition is to use its fully-qualified named:
12600 e.g. my_package.constraint_error. */
12602 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12604 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12606 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12610 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12613 /* Return the symtab_and_line that should be used to insert an exception
12614 catchpoint of the TYPE kind.
12616 EXCEP_STRING should contain the name of a specific exception that
12617 the catchpoint should catch, or NULL otherwise.
12619 ADDR_STRING returns the name of the function where the real
12620 breakpoint that implements the catchpoints is set, depending on the
12621 type of catchpoint we need to create. */
12623 static struct symtab_and_line
12624 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12625 char **addr_string
, const struct breakpoint_ops
**ops
)
12627 const char *sym_name
;
12628 struct symbol
*sym
;
12630 /* First, find out which exception support info to use. */
12631 ada_exception_support_info_sniffer ();
12633 /* Then lookup the function on which we will break in order to catch
12634 the Ada exceptions requested by the user. */
12635 sym_name
= ada_exception_sym_name (ex
);
12636 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12638 /* We can assume that SYM is not NULL at this stage. If the symbol
12639 did not exist, ada_exception_support_info_sniffer would have
12640 raised an exception.
12642 Also, ada_exception_support_info_sniffer should have already
12643 verified that SYM is a function symbol. */
12644 gdb_assert (sym
!= NULL
);
12645 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12647 /* Set ADDR_STRING. */
12648 *addr_string
= xstrdup (sym_name
);
12651 *ops
= ada_exception_breakpoint_ops (ex
);
12653 return find_function_start_sal (sym
, 1);
12656 /* Create an Ada exception catchpoint.
12658 EX_KIND is the kind of exception catchpoint to be created.
12660 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12661 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12662 of the exception to which this catchpoint applies. When not NULL,
12663 the string must be allocated on the heap, and its deallocation
12664 is no longer the responsibility of the caller.
12666 COND_STRING, if not NULL, is the catchpoint condition. This string
12667 must be allocated on the heap, and its deallocation is no longer
12668 the responsibility of the caller.
12670 TEMPFLAG, if nonzero, means that the underlying breakpoint
12671 should be temporary.
12673 FROM_TTY is the usual argument passed to all commands implementations. */
12676 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12677 enum ada_exception_catchpoint_kind ex_kind
,
12678 char *excep_string
,
12684 struct ada_catchpoint
*c
;
12685 char *addr_string
= NULL
;
12686 const struct breakpoint_ops
*ops
= NULL
;
12687 struct symtab_and_line sal
12688 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12690 c
= XNEW (struct ada_catchpoint
);
12691 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
12692 ops
, tempflag
, disabled
, from_tty
);
12693 c
->excep_string
= excep_string
;
12694 create_excep_cond_exprs (c
);
12695 if (cond_string
!= NULL
)
12696 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
12697 install_breakpoint (0, &c
->base
, 1);
12700 /* Implement the "catch exception" command. */
12703 catch_ada_exception_command (char *arg
, int from_tty
,
12704 struct cmd_list_element
*command
)
12706 struct gdbarch
*gdbarch
= get_current_arch ();
12708 enum ada_exception_catchpoint_kind ex_kind
;
12709 char *excep_string
= NULL
;
12710 char *cond_string
= NULL
;
12712 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12716 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12718 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12719 excep_string
, cond_string
,
12720 tempflag
, 1 /* enabled */,
12724 /* Split the arguments specified in a "catch assert" command.
12726 ARGS contains the command's arguments (or the empty string if
12727 no arguments were passed).
12729 If ARGS contains a condition, set COND_STRING to that condition
12730 (the memory needs to be deallocated after use). */
12733 catch_ada_assert_command_split (char *args
, char **cond_string
)
12735 args
= skip_spaces (args
);
12737 /* Check whether a condition was provided. */
12738 if (startswith (args
, "if")
12739 && (isspace (args
[2]) || args
[2] == '\0'))
12742 args
= skip_spaces (args
);
12743 if (args
[0] == '\0')
12744 error (_("condition missing after `if' keyword"));
12745 *cond_string
= xstrdup (args
);
12748 /* Otherwise, there should be no other argument at the end of
12750 else if (args
[0] != '\0')
12751 error (_("Junk at end of arguments."));
12754 /* Implement the "catch assert" command. */
12757 catch_assert_command (char *arg
, int from_tty
,
12758 struct cmd_list_element
*command
)
12760 struct gdbarch
*gdbarch
= get_current_arch ();
12762 char *cond_string
= NULL
;
12764 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12768 catch_ada_assert_command_split (arg
, &cond_string
);
12769 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12771 tempflag
, 1 /* enabled */,
12775 /* Return non-zero if the symbol SYM is an Ada exception object. */
12778 ada_is_exception_sym (struct symbol
*sym
)
12780 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
12782 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12783 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12784 && SYMBOL_CLASS (sym
) != LOC_CONST
12785 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12786 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12789 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12790 Ada exception object. This matches all exceptions except the ones
12791 defined by the Ada language. */
12794 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12798 if (!ada_is_exception_sym (sym
))
12801 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12802 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
12803 return 0; /* A standard exception. */
12805 /* Numeric_Error is also a standard exception, so exclude it.
12806 See the STANDARD_EXC description for more details as to why
12807 this exception is not listed in that array. */
12808 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
12814 /* A helper function for qsort, comparing two struct ada_exc_info
12817 The comparison is determined first by exception name, and then
12818 by exception address. */
12821 compare_ada_exception_info (const void *a
, const void *b
)
12823 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
12824 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
12827 result
= strcmp (exc_a
->name
, exc_b
->name
);
12831 if (exc_a
->addr
< exc_b
->addr
)
12833 if (exc_a
->addr
> exc_b
->addr
)
12839 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12840 routine, but keeping the first SKIP elements untouched.
12842 All duplicates are also removed. */
12845 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
12848 struct ada_exc_info
*to_sort
12849 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
12851 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
12854 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
12855 compare_ada_exception_info
);
12857 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
12858 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
12859 to_sort
[j
++] = to_sort
[i
];
12861 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
12864 /* A function intended as the "name_matcher" callback in the struct
12865 quick_symbol_functions' expand_symtabs_matching method.
12867 SEARCH_NAME is the symbol's search name.
12869 If USER_DATA is not NULL, it is a pointer to a regext_t object
12870 used to match the symbol (by natural name). Otherwise, when USER_DATA
12871 is null, no filtering is performed, and all symbols are a positive
12875 ada_exc_search_name_matches (const char *search_name
, void *user_data
)
12877 regex_t
*preg
= user_data
;
12882 /* In Ada, the symbol "search name" is a linkage name, whereas
12883 the regular expression used to do the matching refers to
12884 the natural name. So match against the decoded name. */
12885 return (regexec (preg
, ada_decode (search_name
), 0, NULL
, 0) == 0);
12888 /* Add all exceptions defined by the Ada standard whose name match
12889 a regular expression.
12891 If PREG is not NULL, then this regexp_t object is used to
12892 perform the symbol name matching. Otherwise, no name-based
12893 filtering is performed.
12895 EXCEPTIONS is a vector of exceptions to which matching exceptions
12899 ada_add_standard_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12903 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12906 || regexec (preg
, standard_exc
[i
], 0, NULL
, 0) == 0)
12908 struct bound_minimal_symbol msymbol
12909 = ada_lookup_simple_minsym (standard_exc
[i
]);
12911 if (msymbol
.minsym
!= NULL
)
12913 struct ada_exc_info info
12914 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12916 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12922 /* Add all Ada exceptions defined locally and accessible from the given
12925 If PREG is not NULL, then this regexp_t object is used to
12926 perform the symbol name matching. Otherwise, no name-based
12927 filtering is performed.
12929 EXCEPTIONS is a vector of exceptions to which matching exceptions
12933 ada_add_exceptions_from_frame (regex_t
*preg
, struct frame_info
*frame
,
12934 VEC(ada_exc_info
) **exceptions
)
12936 const struct block
*block
= get_frame_block (frame
, 0);
12940 struct block_iterator iter
;
12941 struct symbol
*sym
;
12943 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12945 switch (SYMBOL_CLASS (sym
))
12952 if (ada_is_exception_sym (sym
))
12954 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
12955 SYMBOL_VALUE_ADDRESS (sym
)};
12957 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12961 if (BLOCK_FUNCTION (block
) != NULL
)
12963 block
= BLOCK_SUPERBLOCK (block
);
12967 /* Add all exceptions defined globally whose name name match
12968 a regular expression, excluding standard exceptions.
12970 The reason we exclude standard exceptions is that they need
12971 to be handled separately: Standard exceptions are defined inside
12972 a runtime unit which is normally not compiled with debugging info,
12973 and thus usually do not show up in our symbol search. However,
12974 if the unit was in fact built with debugging info, we need to
12975 exclude them because they would duplicate the entry we found
12976 during the special loop that specifically searches for those
12977 standard exceptions.
12979 If PREG is not NULL, then this regexp_t object is used to
12980 perform the symbol name matching. Otherwise, no name-based
12981 filtering is performed.
12983 EXCEPTIONS is a vector of exceptions to which matching exceptions
12987 ada_add_global_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12989 struct objfile
*objfile
;
12990 struct compunit_symtab
*s
;
12992 expand_symtabs_matching (NULL
, ada_exc_search_name_matches
, NULL
,
12993 VARIABLES_DOMAIN
, preg
);
12995 ALL_COMPUNITS (objfile
, s
)
12997 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13000 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13002 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13003 struct block_iterator iter
;
13004 struct symbol
*sym
;
13006 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13007 if (ada_is_non_standard_exception_sym (sym
)
13009 || regexec (preg
, SYMBOL_NATURAL_NAME (sym
),
13012 struct ada_exc_info info
13013 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
13015 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13021 /* Implements ada_exceptions_list with the regular expression passed
13022 as a regex_t, rather than a string.
13024 If not NULL, PREG is used to filter out exceptions whose names
13025 do not match. Otherwise, all exceptions are listed. */
13027 static VEC(ada_exc_info
) *
13028 ada_exceptions_list_1 (regex_t
*preg
)
13030 VEC(ada_exc_info
) *result
= NULL
;
13031 struct cleanup
*old_chain
13032 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
13035 /* First, list the known standard exceptions. These exceptions
13036 need to be handled separately, as they are usually defined in
13037 runtime units that have been compiled without debugging info. */
13039 ada_add_standard_exceptions (preg
, &result
);
13041 /* Next, find all exceptions whose scope is local and accessible
13042 from the currently selected frame. */
13044 if (has_stack_frames ())
13046 prev_len
= VEC_length (ada_exc_info
, result
);
13047 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13049 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13050 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13053 /* Add all exceptions whose scope is global. */
13055 prev_len
= VEC_length (ada_exc_info
, result
);
13056 ada_add_global_exceptions (preg
, &result
);
13057 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13058 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13060 discard_cleanups (old_chain
);
13064 /* Return a vector of ada_exc_info.
13066 If REGEXP is NULL, all exceptions are included in the result.
13067 Otherwise, it should contain a valid regular expression,
13068 and only the exceptions whose names match that regular expression
13069 are included in the result.
13071 The exceptions are sorted in the following order:
13072 - Standard exceptions (defined by the Ada language), in
13073 alphabetical order;
13074 - Exceptions only visible from the current frame, in
13075 alphabetical order;
13076 - Exceptions whose scope is global, in alphabetical order. */
13078 VEC(ada_exc_info
) *
13079 ada_exceptions_list (const char *regexp
)
13081 VEC(ada_exc_info
) *result
= NULL
;
13082 struct cleanup
*old_chain
= NULL
;
13085 if (regexp
!= NULL
)
13086 old_chain
= compile_rx_or_error (®
, regexp
,
13087 _("invalid regular expression"));
13089 result
= ada_exceptions_list_1 (regexp
!= NULL
? ®
: NULL
);
13091 if (old_chain
!= NULL
)
13092 do_cleanups (old_chain
);
13096 /* Implement the "info exceptions" command. */
13099 info_exceptions_command (char *regexp
, int from_tty
)
13101 VEC(ada_exc_info
) *exceptions
;
13102 struct cleanup
*cleanup
;
13103 struct gdbarch
*gdbarch
= get_current_arch ();
13105 struct ada_exc_info
*info
;
13107 exceptions
= ada_exceptions_list (regexp
);
13108 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
13110 if (regexp
!= NULL
)
13112 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13114 printf_filtered (_("All defined Ada exceptions:\n"));
13116 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
13117 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
13119 do_cleanups (cleanup
);
13123 /* Information about operators given special treatment in functions
13125 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13127 #define ADA_OPERATORS \
13128 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13129 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13130 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13131 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13132 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13133 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13134 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13135 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13136 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13137 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13138 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13139 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13140 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13141 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13142 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13143 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13144 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13145 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13146 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13149 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13152 switch (exp
->elts
[pc
- 1].opcode
)
13155 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13158 #define OP_DEFN(op, len, args, binop) \
13159 case op: *oplenp = len; *argsp = args; break;
13165 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13170 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13175 /* Implementation of the exp_descriptor method operator_check. */
13178 ada_operator_check (struct expression
*exp
, int pos
,
13179 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13182 const union exp_element
*const elts
= exp
->elts
;
13183 struct type
*type
= NULL
;
13185 switch (elts
[pos
].opcode
)
13187 case UNOP_IN_RANGE
:
13189 type
= elts
[pos
+ 1].type
;
13193 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13196 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13198 if (type
&& TYPE_OBJFILE (type
)
13199 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13206 ada_op_name (enum exp_opcode opcode
)
13211 return op_name_standard (opcode
);
13213 #define OP_DEFN(op, len, args, binop) case op: return #op;
13218 return "OP_AGGREGATE";
13220 return "OP_CHOICES";
13226 /* As for operator_length, but assumes PC is pointing at the first
13227 element of the operator, and gives meaningful results only for the
13228 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13231 ada_forward_operator_length (struct expression
*exp
, int pc
,
13232 int *oplenp
, int *argsp
)
13234 switch (exp
->elts
[pc
].opcode
)
13237 *oplenp
= *argsp
= 0;
13240 #define OP_DEFN(op, len, args, binop) \
13241 case op: *oplenp = len; *argsp = args; break;
13247 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13252 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13258 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13260 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13268 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13270 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13275 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13279 /* Ada attributes ('Foo). */
13282 case OP_ATR_LENGTH
:
13286 case OP_ATR_MODULUS
:
13293 case UNOP_IN_RANGE
:
13295 /* XXX: gdb_sprint_host_address, type_sprint */
13296 fprintf_filtered (stream
, _("Type @"));
13297 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13298 fprintf_filtered (stream
, " (");
13299 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13300 fprintf_filtered (stream
, ")");
13302 case BINOP_IN_BOUNDS
:
13303 fprintf_filtered (stream
, " (%d)",
13304 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13306 case TERNOP_IN_RANGE
:
13311 case OP_DISCRETE_RANGE
:
13312 case OP_POSITIONAL
:
13319 char *name
= &exp
->elts
[elt
+ 2].string
;
13320 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13322 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13327 return dump_subexp_body_standard (exp
, stream
, elt
);
13331 for (i
= 0; i
< nargs
; i
+= 1)
13332 elt
= dump_subexp (exp
, stream
, elt
);
13337 /* The Ada extension of print_subexp (q.v.). */
13340 ada_print_subexp (struct expression
*exp
, int *pos
,
13341 struct ui_file
*stream
, enum precedence prec
)
13343 int oplen
, nargs
, i
;
13345 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13347 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13354 print_subexp_standard (exp
, pos
, stream
, prec
);
13358 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13361 case BINOP_IN_BOUNDS
:
13362 /* XXX: sprint_subexp */
13363 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13364 fputs_filtered (" in ", stream
);
13365 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13366 fputs_filtered ("'range", stream
);
13367 if (exp
->elts
[pc
+ 1].longconst
> 1)
13368 fprintf_filtered (stream
, "(%ld)",
13369 (long) exp
->elts
[pc
+ 1].longconst
);
13372 case TERNOP_IN_RANGE
:
13373 if (prec
>= PREC_EQUAL
)
13374 fputs_filtered ("(", stream
);
13375 /* XXX: sprint_subexp */
13376 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13377 fputs_filtered (" in ", stream
);
13378 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13379 fputs_filtered (" .. ", stream
);
13380 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13381 if (prec
>= PREC_EQUAL
)
13382 fputs_filtered (")", stream
);
13387 case OP_ATR_LENGTH
:
13391 case OP_ATR_MODULUS
:
13396 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13398 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13399 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13400 &type_print_raw_options
);
13404 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13405 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13410 for (tem
= 1; tem
< nargs
; tem
+= 1)
13412 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13413 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13415 fputs_filtered (")", stream
);
13420 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13421 fputs_filtered ("'(", stream
);
13422 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13423 fputs_filtered (")", stream
);
13426 case UNOP_IN_RANGE
:
13427 /* XXX: sprint_subexp */
13428 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13429 fputs_filtered (" in ", stream
);
13430 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13431 &type_print_raw_options
);
13434 case OP_DISCRETE_RANGE
:
13435 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13436 fputs_filtered ("..", stream
);
13437 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13441 fputs_filtered ("others => ", stream
);
13442 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13446 for (i
= 0; i
< nargs
-1; i
+= 1)
13449 fputs_filtered ("|", stream
);
13450 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13452 fputs_filtered (" => ", stream
);
13453 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13456 case OP_POSITIONAL
:
13457 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13461 fputs_filtered ("(", stream
);
13462 for (i
= 0; i
< nargs
; i
+= 1)
13465 fputs_filtered (", ", stream
);
13466 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13468 fputs_filtered (")", stream
);
13473 /* Table mapping opcodes into strings for printing operators
13474 and precedences of the operators. */
13476 static const struct op_print ada_op_print_tab
[] = {
13477 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13478 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13479 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13480 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13481 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13482 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13483 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13484 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13485 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13486 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13487 {">", BINOP_GTR
, PREC_ORDER
, 0},
13488 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13489 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13490 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13491 {"+", BINOP_ADD
, PREC_ADD
, 0},
13492 {"-", BINOP_SUB
, PREC_ADD
, 0},
13493 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13494 {"*", BINOP_MUL
, PREC_MUL
, 0},
13495 {"/", BINOP_DIV
, PREC_MUL
, 0},
13496 {"rem", BINOP_REM
, PREC_MUL
, 0},
13497 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13498 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13499 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13500 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13501 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13502 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13503 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13504 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13505 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13506 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13507 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13511 enum ada_primitive_types
{
13512 ada_primitive_type_int
,
13513 ada_primitive_type_long
,
13514 ada_primitive_type_short
,
13515 ada_primitive_type_char
,
13516 ada_primitive_type_float
,
13517 ada_primitive_type_double
,
13518 ada_primitive_type_void
,
13519 ada_primitive_type_long_long
,
13520 ada_primitive_type_long_double
,
13521 ada_primitive_type_natural
,
13522 ada_primitive_type_positive
,
13523 ada_primitive_type_system_address
,
13524 nr_ada_primitive_types
13528 ada_language_arch_info (struct gdbarch
*gdbarch
,
13529 struct language_arch_info
*lai
)
13531 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13533 lai
->primitive_type_vector
13534 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13537 lai
->primitive_type_vector
[ada_primitive_type_int
]
13538 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13540 lai
->primitive_type_vector
[ada_primitive_type_long
]
13541 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13542 0, "long_integer");
13543 lai
->primitive_type_vector
[ada_primitive_type_short
]
13544 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13545 0, "short_integer");
13546 lai
->string_char_type
13547 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13548 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13549 lai
->primitive_type_vector
[ada_primitive_type_float
]
13550 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13552 lai
->primitive_type_vector
[ada_primitive_type_double
]
13553 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13554 "long_float", NULL
);
13555 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13556 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13557 0, "long_long_integer");
13558 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13559 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13560 "long_long_float", NULL
);
13561 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13562 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13564 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13565 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13567 lai
->primitive_type_vector
[ada_primitive_type_void
]
13568 = builtin
->builtin_void
;
13570 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13571 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13572 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13573 = "system__address";
13575 lai
->bool_type_symbol
= NULL
;
13576 lai
->bool_type_default
= builtin
->builtin_bool
;
13579 /* Language vector */
13581 /* Not really used, but needed in the ada_language_defn. */
13584 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13586 ada_emit_char (c
, type
, stream
, quoter
, 1);
13590 parse (struct parser_state
*ps
)
13592 warnings_issued
= 0;
13593 return ada_parse (ps
);
13596 static const struct exp_descriptor ada_exp_descriptor
= {
13598 ada_operator_length
,
13599 ada_operator_check
,
13601 ada_dump_subexp_body
,
13602 ada_evaluate_subexp
13605 /* Implement the "la_get_symbol_name_cmp" language_defn method
13608 static symbol_name_cmp_ftype
13609 ada_get_symbol_name_cmp (const char *lookup_name
)
13611 if (should_use_wild_match (lookup_name
))
13614 return compare_names
;
13617 /* Implement the "la_read_var_value" language_defn method for Ada. */
13619 static struct value
*
13620 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
13622 const struct block
*frame_block
= NULL
;
13623 struct symbol
*renaming_sym
= NULL
;
13625 /* The only case where default_read_var_value is not sufficient
13626 is when VAR is a renaming... */
13628 frame_block
= get_frame_block (frame
, NULL
);
13630 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13631 if (renaming_sym
!= NULL
)
13632 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13634 /* This is a typical case where we expect the default_read_var_value
13635 function to work. */
13636 return default_read_var_value (var
, frame
);
13639 const struct language_defn ada_language_defn
= {
13640 "ada", /* Language name */
13644 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13645 that's not quite what this means. */
13647 macro_expansion_no
,
13648 &ada_exp_descriptor
,
13652 ada_printchar
, /* Print a character constant */
13653 ada_printstr
, /* Function to print string constant */
13654 emit_char
, /* Function to print single char (not used) */
13655 ada_print_type
, /* Print a type using appropriate syntax */
13656 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13657 ada_val_print
, /* Print a value using appropriate syntax */
13658 ada_value_print
, /* Print a top-level value */
13659 ada_read_var_value
, /* la_read_var_value */
13660 NULL
, /* Language specific skip_trampoline */
13661 NULL
, /* name_of_this */
13662 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13663 basic_lookup_transparent_type
, /* lookup_transparent_type */
13664 ada_la_decode
, /* Language specific symbol demangler */
13665 NULL
, /* Language specific
13666 class_name_from_physname */
13667 ada_op_print_tab
, /* expression operators for printing */
13668 0, /* c-style arrays */
13669 1, /* String lower bound */
13670 ada_get_gdb_completer_word_break_characters
,
13671 ada_make_symbol_completion_list
,
13672 ada_language_arch_info
,
13673 ada_print_array_index
,
13674 default_pass_by_reference
,
13676 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13677 ada_iterate_over_symbols
,
13684 /* Provide a prototype to silence -Wmissing-prototypes. */
13685 extern initialize_file_ftype _initialize_ada_language
;
13687 /* Command-list for the "set/show ada" prefix command. */
13688 static struct cmd_list_element
*set_ada_list
;
13689 static struct cmd_list_element
*show_ada_list
;
13691 /* Implement the "set ada" prefix command. */
13694 set_ada_command (char *arg
, int from_tty
)
13696 printf_unfiltered (_(\
13697 "\"set ada\" must be followed by the name of a setting.\n"));
13698 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
13701 /* Implement the "show ada" prefix command. */
13704 show_ada_command (char *args
, int from_tty
)
13706 cmd_show_list (show_ada_list
, from_tty
, "");
13710 initialize_ada_catchpoint_ops (void)
13712 struct breakpoint_ops
*ops
;
13714 initialize_breakpoint_ops ();
13716 ops
= &catch_exception_breakpoint_ops
;
13717 *ops
= bkpt_breakpoint_ops
;
13718 ops
->dtor
= dtor_catch_exception
;
13719 ops
->allocate_location
= allocate_location_catch_exception
;
13720 ops
->re_set
= re_set_catch_exception
;
13721 ops
->check_status
= check_status_catch_exception
;
13722 ops
->print_it
= print_it_catch_exception
;
13723 ops
->print_one
= print_one_catch_exception
;
13724 ops
->print_mention
= print_mention_catch_exception
;
13725 ops
->print_recreate
= print_recreate_catch_exception
;
13727 ops
= &catch_exception_unhandled_breakpoint_ops
;
13728 *ops
= bkpt_breakpoint_ops
;
13729 ops
->dtor
= dtor_catch_exception_unhandled
;
13730 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
13731 ops
->re_set
= re_set_catch_exception_unhandled
;
13732 ops
->check_status
= check_status_catch_exception_unhandled
;
13733 ops
->print_it
= print_it_catch_exception_unhandled
;
13734 ops
->print_one
= print_one_catch_exception_unhandled
;
13735 ops
->print_mention
= print_mention_catch_exception_unhandled
;
13736 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
13738 ops
= &catch_assert_breakpoint_ops
;
13739 *ops
= bkpt_breakpoint_ops
;
13740 ops
->dtor
= dtor_catch_assert
;
13741 ops
->allocate_location
= allocate_location_catch_assert
;
13742 ops
->re_set
= re_set_catch_assert
;
13743 ops
->check_status
= check_status_catch_assert
;
13744 ops
->print_it
= print_it_catch_assert
;
13745 ops
->print_one
= print_one_catch_assert
;
13746 ops
->print_mention
= print_mention_catch_assert
;
13747 ops
->print_recreate
= print_recreate_catch_assert
;
13750 /* This module's 'new_objfile' observer. */
13753 ada_new_objfile_observer (struct objfile
*objfile
)
13755 ada_clear_symbol_cache ();
13758 /* This module's 'free_objfile' observer. */
13761 ada_free_objfile_observer (struct objfile
*objfile
)
13763 ada_clear_symbol_cache ();
13767 _initialize_ada_language (void)
13769 add_language (&ada_language_defn
);
13771 initialize_ada_catchpoint_ops ();
13773 add_prefix_cmd ("ada", no_class
, set_ada_command
,
13774 _("Prefix command for changing Ada-specfic settings"),
13775 &set_ada_list
, "set ada ", 0, &setlist
);
13777 add_prefix_cmd ("ada", no_class
, show_ada_command
,
13778 _("Generic command for showing Ada-specific settings."),
13779 &show_ada_list
, "show ada ", 0, &showlist
);
13781 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
13782 &trust_pad_over_xvs
, _("\
13783 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13784 Show whether an optimization trusting PAD types over XVS types is activated"),
13786 This is related to the encoding used by the GNAT compiler. The debugger\n\
13787 should normally trust the contents of PAD types, but certain older versions\n\
13788 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13789 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13790 work around this bug. It is always safe to turn this option \"off\", but\n\
13791 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13792 this option to \"off\" unless necessary."),
13793 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13795 add_catch_command ("exception", _("\
13796 Catch Ada exceptions, when raised.\n\
13797 With an argument, catch only exceptions with the given name."),
13798 catch_ada_exception_command
,
13802 add_catch_command ("assert", _("\
13803 Catch failed Ada assertions, when raised.\n\
13804 With an argument, catch only exceptions with the given name."),
13805 catch_assert_command
,
13810 varsize_limit
= 65536;
13812 add_info ("exceptions", info_exceptions_command
,
13814 List all Ada exception names.\n\
13815 If a regular expression is passed as an argument, only those matching\n\
13816 the regular expression are listed."));
13818 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
13819 _("Set Ada maintenance-related variables."),
13820 &maint_set_ada_cmdlist
, "maintenance set ada ",
13821 0/*allow-unknown*/, &maintenance_set_cmdlist
);
13823 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
13824 _("Show Ada maintenance-related variables"),
13825 &maint_show_ada_cmdlist
, "maintenance show ada ",
13826 0/*allow-unknown*/, &maintenance_show_cmdlist
);
13828 add_setshow_boolean_cmd
13829 ("ignore-descriptive-types", class_maintenance
,
13830 &ada_ignore_descriptive_types_p
,
13831 _("Set whether descriptive types generated by GNAT should be ignored."),
13832 _("Show whether descriptive types generated by GNAT should be ignored."),
13834 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13835 DWARF attribute."),
13836 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
13838 obstack_init (&symbol_list_obstack
);
13840 decoded_names_store
= htab_create_alloc
13841 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
13842 NULL
, xcalloc
, xfree
);
13844 /* The ada-lang observers. */
13845 observer_attach_new_objfile (ada_new_objfile_observer
);
13846 observer_attach_free_objfile (ada_free_objfile_observer
);
13847 observer_attach_inferior_exit (ada_inferior_exit
);
13849 /* Setup various context-specific data. */
13851 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
13852 ada_pspace_data_handle
13853 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);