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
)
6483 LONGEST offset_to_top
= 0;
6484 struct type
*ptr_type
, *obj_type
;
6486 CORE_ADDR base_address
;
6488 obj_type
= value_type (obj
);
6490 /* It is the responsability of the caller to deref pointers. */
6492 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6493 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6496 tag
= ada_value_tag (obj
);
6500 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6502 if (is_ada95_tag (tag
))
6505 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6506 ptr_type
= lookup_pointer_type (ptr_type
);
6507 val
= value_cast (ptr_type
, tag
);
6511 /* It is perfectly possible that an exception be raised while
6512 trying to determine the base address, just like for the tag;
6513 see ada_tag_name for more details. We do not print the error
6514 message for the same reason. */
6518 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6521 CATCH (e
, RETURN_MASK_ERROR
)
6527 /* If offset is null, nothing to do. */
6529 if (offset_to_top
== 0)
6532 /* -1 is a special case in Ada.Tags; however, what should be done
6533 is not quite clear from the documentation. So do nothing for
6536 if (offset_to_top
== -1)
6539 base_address
= value_address (obj
) - offset_to_top
;
6540 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6542 /* Make sure that we have a proper tag at the new address.
6543 Otherwise, offset_to_top is bogus (which can happen when
6544 the object is not initialized yet). */
6549 obj_type
= type_from_tag (tag
);
6554 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6557 /* Return the "ada__tags__type_specific_data" type. */
6559 static struct type
*
6560 ada_get_tsd_type (struct inferior
*inf
)
6562 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6564 if (data
->tsd_type
== 0)
6565 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6566 return data
->tsd_type
;
6569 /* Return the TSD (type-specific data) associated to the given TAG.
6570 TAG is assumed to be the tag of a tagged-type entity.
6572 May return NULL if we are unable to get the TSD. */
6574 static struct value
*
6575 ada_get_tsd_from_tag (struct value
*tag
)
6580 /* First option: The TSD is simply stored as a field of our TAG.
6581 Only older versions of GNAT would use this format, but we have
6582 to test it first, because there are no visible markers for
6583 the current approach except the absence of that field. */
6585 val
= ada_value_struct_elt (tag
, "tsd", 1);
6589 /* Try the second representation for the dispatch table (in which
6590 there is no explicit 'tsd' field in the referent of the tag pointer,
6591 and instead the tsd pointer is stored just before the dispatch
6594 type
= ada_get_tsd_type (current_inferior());
6597 type
= lookup_pointer_type (lookup_pointer_type (type
));
6598 val
= value_cast (type
, tag
);
6601 return value_ind (value_ptradd (val
, -1));
6604 /* Given the TSD of a tag (type-specific data), return a string
6605 containing the name of the associated type.
6607 The returned value is good until the next call. May return NULL
6608 if we are unable to determine the tag name. */
6611 ada_tag_name_from_tsd (struct value
*tsd
)
6613 static char name
[1024];
6617 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6620 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6621 for (p
= name
; *p
!= '\0'; p
+= 1)
6627 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6630 Return NULL if the TAG is not an Ada tag, or if we were unable to
6631 determine the name of that tag. The result is good until the next
6635 ada_tag_name (struct value
*tag
)
6639 if (!ada_is_tag_type (value_type (tag
)))
6642 /* It is perfectly possible that an exception be raised while trying
6643 to determine the TAG's name, even under normal circumstances:
6644 The associated variable may be uninitialized or corrupted, for
6645 instance. We do not let any exception propagate past this point.
6646 instead we return NULL.
6648 We also do not print the error message either (which often is very
6649 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6650 the caller print a more meaningful message if necessary. */
6653 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6656 name
= ada_tag_name_from_tsd (tsd
);
6658 CATCH (e
, RETURN_MASK_ERROR
)
6666 /* The parent type of TYPE, or NULL if none. */
6669 ada_parent_type (struct type
*type
)
6673 type
= ada_check_typedef (type
);
6675 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6678 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6679 if (ada_is_parent_field (type
, i
))
6681 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6683 /* If the _parent field is a pointer, then dereference it. */
6684 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6685 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6686 /* If there is a parallel XVS type, get the actual base type. */
6687 parent_type
= ada_get_base_type (parent_type
);
6689 return ada_check_typedef (parent_type
);
6695 /* True iff field number FIELD_NUM of structure type TYPE contains the
6696 parent-type (inherited) fields of a derived type. Assumes TYPE is
6697 a structure type with at least FIELD_NUM+1 fields. */
6700 ada_is_parent_field (struct type
*type
, int field_num
)
6702 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6704 return (name
!= NULL
6705 && (startswith (name
, "PARENT")
6706 || startswith (name
, "_parent")));
6709 /* True iff field number FIELD_NUM of structure type TYPE is a
6710 transparent wrapper field (which should be silently traversed when doing
6711 field selection and flattened when printing). Assumes TYPE is a
6712 structure type with at least FIELD_NUM+1 fields. Such fields are always
6716 ada_is_wrapper_field (struct type
*type
, int field_num
)
6718 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6720 return (name
!= NULL
6721 && (startswith (name
, "PARENT")
6722 || strcmp (name
, "REP") == 0
6723 || startswith (name
, "_parent")
6724 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6727 /* True iff field number FIELD_NUM of structure or union type TYPE
6728 is a variant wrapper. Assumes TYPE is a structure type with at least
6729 FIELD_NUM+1 fields. */
6732 ada_is_variant_part (struct type
*type
, int field_num
)
6734 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6736 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6737 || (is_dynamic_field (type
, field_num
)
6738 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6739 == TYPE_CODE_UNION
)));
6742 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6743 whose discriminants are contained in the record type OUTER_TYPE,
6744 returns the type of the controlling discriminant for the variant.
6745 May return NULL if the type could not be found. */
6748 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6750 char *name
= ada_variant_discrim_name (var_type
);
6752 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6755 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6756 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6757 represents a 'when others' clause; otherwise 0. */
6760 ada_is_others_clause (struct type
*type
, int field_num
)
6762 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6764 return (name
!= NULL
&& name
[0] == 'O');
6767 /* Assuming that TYPE0 is the type of the variant part of a record,
6768 returns the name of the discriminant controlling the variant.
6769 The value is valid until the next call to ada_variant_discrim_name. */
6772 ada_variant_discrim_name (struct type
*type0
)
6774 static char *result
= NULL
;
6775 static size_t result_len
= 0;
6778 const char *discrim_end
;
6779 const char *discrim_start
;
6781 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6782 type
= TYPE_TARGET_TYPE (type0
);
6786 name
= ada_type_name (type
);
6788 if (name
== NULL
|| name
[0] == '\000')
6791 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6794 if (startswith (discrim_end
, "___XVN"))
6797 if (discrim_end
== name
)
6800 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6803 if (discrim_start
== name
+ 1)
6805 if ((discrim_start
> name
+ 3
6806 && startswith (discrim_start
- 3, "___"))
6807 || discrim_start
[-1] == '.')
6811 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6812 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6813 result
[discrim_end
- discrim_start
] = '\0';
6817 /* Scan STR for a subtype-encoded number, beginning at position K.
6818 Put the position of the character just past the number scanned in
6819 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6820 Return 1 if there was a valid number at the given position, and 0
6821 otherwise. A "subtype-encoded" number consists of the absolute value
6822 in decimal, followed by the letter 'm' to indicate a negative number.
6823 Assumes 0m does not occur. */
6826 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6830 if (!isdigit (str
[k
]))
6833 /* Do it the hard way so as not to make any assumption about
6834 the relationship of unsigned long (%lu scan format code) and
6837 while (isdigit (str
[k
]))
6839 RU
= RU
* 10 + (str
[k
] - '0');
6846 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6852 /* NOTE on the above: Technically, C does not say what the results of
6853 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6854 number representable as a LONGEST (although either would probably work
6855 in most implementations). When RU>0, the locution in the then branch
6856 above is always equivalent to the negative of RU. */
6863 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6864 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6865 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6868 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6870 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6884 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6894 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6895 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6897 if (val
>= L
&& val
<= U
)
6909 /* FIXME: Lots of redundancy below. Try to consolidate. */
6911 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6912 ARG_TYPE, extract and return the value of one of its (non-static)
6913 fields. FIELDNO says which field. Differs from value_primitive_field
6914 only in that it can handle packed values of arbitrary type. */
6916 static struct value
*
6917 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6918 struct type
*arg_type
)
6922 arg_type
= ada_check_typedef (arg_type
);
6923 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6925 /* Handle packed fields. */
6927 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6929 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6930 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6932 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6933 offset
+ bit_pos
/ 8,
6934 bit_pos
% 8, bit_size
, type
);
6937 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6940 /* Find field with name NAME in object of type TYPE. If found,
6941 set the following for each argument that is non-null:
6942 - *FIELD_TYPE_P to the field's type;
6943 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6944 an object of that type;
6945 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6946 - *BIT_SIZE_P to its size in bits if the field is packed, and
6948 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6949 fields up to but not including the desired field, or by the total
6950 number of fields if not found. A NULL value of NAME never
6951 matches; the function just counts visible fields in this case.
6953 Returns 1 if found, 0 otherwise. */
6956 find_struct_field (const char *name
, struct type
*type
, int offset
,
6957 struct type
**field_type_p
,
6958 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6963 type
= ada_check_typedef (type
);
6965 if (field_type_p
!= NULL
)
6966 *field_type_p
= NULL
;
6967 if (byte_offset_p
!= NULL
)
6969 if (bit_offset_p
!= NULL
)
6971 if (bit_size_p
!= NULL
)
6974 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6976 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6977 int fld_offset
= offset
+ bit_pos
/ 8;
6978 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6980 if (t_field_name
== NULL
)
6983 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6985 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6987 if (field_type_p
!= NULL
)
6988 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6989 if (byte_offset_p
!= NULL
)
6990 *byte_offset_p
= fld_offset
;
6991 if (bit_offset_p
!= NULL
)
6992 *bit_offset_p
= bit_pos
% 8;
6993 if (bit_size_p
!= NULL
)
6994 *bit_size_p
= bit_size
;
6997 else if (ada_is_wrapper_field (type
, i
))
6999 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7000 field_type_p
, byte_offset_p
, bit_offset_p
,
7001 bit_size_p
, index_p
))
7004 else if (ada_is_variant_part (type
, i
))
7006 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7009 struct type
*field_type
7010 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7012 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7014 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7016 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7017 field_type_p
, byte_offset_p
,
7018 bit_offset_p
, bit_size_p
, index_p
))
7022 else if (index_p
!= NULL
)
7028 /* Number of user-visible fields in record type TYPE. */
7031 num_visible_fields (struct type
*type
)
7036 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7040 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7041 and search in it assuming it has (class) type TYPE.
7042 If found, return value, else return NULL.
7044 Searches recursively through wrapper fields (e.g., '_parent'). */
7046 static struct value
*
7047 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
7052 type
= ada_check_typedef (type
);
7053 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7055 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7057 if (t_field_name
== NULL
)
7060 else if (field_name_match (t_field_name
, name
))
7061 return ada_value_primitive_field (arg
, offset
, i
, type
);
7063 else if (ada_is_wrapper_field (type
, i
))
7065 struct value
*v
= /* Do not let indent join lines here. */
7066 ada_search_struct_field (name
, arg
,
7067 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7068 TYPE_FIELD_TYPE (type
, i
));
7074 else if (ada_is_variant_part (type
, i
))
7076 /* PNH: Do we ever get here? See find_struct_field. */
7078 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7080 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7082 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7084 struct value
*v
= ada_search_struct_field
/* Force line
7087 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7088 TYPE_FIELD_TYPE (field_type
, j
));
7098 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7099 int, struct type
*);
7102 /* Return field #INDEX in ARG, where the index is that returned by
7103 * find_struct_field through its INDEX_P argument. Adjust the address
7104 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7105 * If found, return value, else return NULL. */
7107 static struct value
*
7108 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7111 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7115 /* Auxiliary function for ada_index_struct_field. Like
7116 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7119 static struct value
*
7120 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7124 type
= ada_check_typedef (type
);
7126 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7128 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7130 else if (ada_is_wrapper_field (type
, i
))
7132 struct value
*v
= /* Do not let indent join lines here. */
7133 ada_index_struct_field_1 (index_p
, arg
,
7134 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7135 TYPE_FIELD_TYPE (type
, i
));
7141 else if (ada_is_variant_part (type
, i
))
7143 /* PNH: Do we ever get here? See ada_search_struct_field,
7144 find_struct_field. */
7145 error (_("Cannot assign this kind of variant record"));
7147 else if (*index_p
== 0)
7148 return ada_value_primitive_field (arg
, offset
, i
, type
);
7155 /* Given ARG, a value of type (pointer or reference to a)*
7156 structure/union, extract the component named NAME from the ultimate
7157 target structure/union and return it as a value with its
7160 The routine searches for NAME among all members of the structure itself
7161 and (recursively) among all members of any wrapper members
7164 If NO_ERR, then simply return NULL in case of error, rather than
7168 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
7170 struct type
*t
, *t1
;
7174 t1
= t
= ada_check_typedef (value_type (arg
));
7175 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7177 t1
= TYPE_TARGET_TYPE (t
);
7180 t1
= ada_check_typedef (t1
);
7181 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7183 arg
= coerce_ref (arg
);
7188 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7190 t1
= TYPE_TARGET_TYPE (t
);
7193 t1
= ada_check_typedef (t1
);
7194 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7196 arg
= value_ind (arg
);
7203 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7207 v
= ada_search_struct_field (name
, arg
, 0, t
);
7210 int bit_offset
, bit_size
, byte_offset
;
7211 struct type
*field_type
;
7214 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7215 address
= value_address (ada_value_ind (arg
));
7217 address
= value_address (ada_coerce_ref (arg
));
7219 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7220 if (find_struct_field (name
, t1
, 0,
7221 &field_type
, &byte_offset
, &bit_offset
,
7226 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7227 arg
= ada_coerce_ref (arg
);
7229 arg
= ada_value_ind (arg
);
7230 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7231 bit_offset
, bit_size
,
7235 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7239 if (v
!= NULL
|| no_err
)
7242 error (_("There is no member named %s."), name
);
7248 error (_("Attempt to extract a component of "
7249 "a value that is not a record."));
7252 /* Given a type TYPE, look up the type of the component of type named NAME.
7253 If DISPP is non-null, add its byte displacement from the beginning of a
7254 structure (pointed to by a value) of type TYPE to *DISPP (does not
7255 work for packed fields).
7257 Matches any field whose name has NAME as a prefix, possibly
7260 TYPE can be either a struct or union. If REFOK, TYPE may also
7261 be a (pointer or reference)+ to a struct or union, and the
7262 ultimate target type will be searched.
7264 Looks recursively into variant clauses and parent types.
7266 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7267 TYPE is not a type of the right kind. */
7269 static struct type
*
7270 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7271 int noerr
, int *dispp
)
7278 if (refok
&& type
!= NULL
)
7281 type
= ada_check_typedef (type
);
7282 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7283 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7285 type
= TYPE_TARGET_TYPE (type
);
7289 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7290 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7296 target_terminal_ours ();
7297 gdb_flush (gdb_stdout
);
7299 error (_("Type (null) is not a structure or union type"));
7302 /* XXX: type_sprint */
7303 fprintf_unfiltered (gdb_stderr
, _("Type "));
7304 type_print (type
, "", gdb_stderr
, -1);
7305 error (_(" is not a structure or union type"));
7310 type
= to_static_fixed_type (type
);
7312 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7314 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7318 if (t_field_name
== NULL
)
7321 else if (field_name_match (t_field_name
, name
))
7324 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7325 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7328 else if (ada_is_wrapper_field (type
, i
))
7331 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7336 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7341 else if (ada_is_variant_part (type
, i
))
7344 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7347 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7349 /* FIXME pnh 2008/01/26: We check for a field that is
7350 NOT wrapped in a struct, since the compiler sometimes
7351 generates these for unchecked variant types. Revisit
7352 if the compiler changes this practice. */
7353 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7355 if (v_field_name
!= NULL
7356 && field_name_match (v_field_name
, name
))
7357 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
7359 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7366 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7377 target_terminal_ours ();
7378 gdb_flush (gdb_stdout
);
7381 /* XXX: type_sprint */
7382 fprintf_unfiltered (gdb_stderr
, _("Type "));
7383 type_print (type
, "", gdb_stderr
, -1);
7384 error (_(" has no component named <null>"));
7388 /* XXX: type_sprint */
7389 fprintf_unfiltered (gdb_stderr
, _("Type "));
7390 type_print (type
, "", gdb_stderr
, -1);
7391 error (_(" has no component named %s"), name
);
7398 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7399 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7400 represents an unchecked union (that is, the variant part of a
7401 record that is named in an Unchecked_Union pragma). */
7404 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7406 char *discrim_name
= ada_variant_discrim_name (var_type
);
7408 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
7413 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7414 within a value of type OUTER_TYPE that is stored in GDB at
7415 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7416 numbering from 0) is applicable. Returns -1 if none are. */
7419 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7420 const gdb_byte
*outer_valaddr
)
7424 char *discrim_name
= ada_variant_discrim_name (var_type
);
7425 struct value
*outer
;
7426 struct value
*discrim
;
7427 LONGEST discrim_val
;
7429 /* Using plain value_from_contents_and_address here causes problems
7430 because we will end up trying to resolve a type that is currently
7431 being constructed. */
7432 outer
= value_from_contents_and_address_unresolved (outer_type
,
7434 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7435 if (discrim
== NULL
)
7437 discrim_val
= value_as_long (discrim
);
7440 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7442 if (ada_is_others_clause (var_type
, i
))
7444 else if (ada_in_variant (discrim_val
, var_type
, i
))
7448 return others_clause
;
7453 /* Dynamic-Sized Records */
7455 /* Strategy: The type ostensibly attached to a value with dynamic size
7456 (i.e., a size that is not statically recorded in the debugging
7457 data) does not accurately reflect the size or layout of the value.
7458 Our strategy is to convert these values to values with accurate,
7459 conventional types that are constructed on the fly. */
7461 /* There is a subtle and tricky problem here. In general, we cannot
7462 determine the size of dynamic records without its data. However,
7463 the 'struct value' data structure, which GDB uses to represent
7464 quantities in the inferior process (the target), requires the size
7465 of the type at the time of its allocation in order to reserve space
7466 for GDB's internal copy of the data. That's why the
7467 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7468 rather than struct value*s.
7470 However, GDB's internal history variables ($1, $2, etc.) are
7471 struct value*s containing internal copies of the data that are not, in
7472 general, the same as the data at their corresponding addresses in
7473 the target. Fortunately, the types we give to these values are all
7474 conventional, fixed-size types (as per the strategy described
7475 above), so that we don't usually have to perform the
7476 'to_fixed_xxx_type' conversions to look at their values.
7477 Unfortunately, there is one exception: if one of the internal
7478 history variables is an array whose elements are unconstrained
7479 records, then we will need to create distinct fixed types for each
7480 element selected. */
7482 /* The upshot of all of this is that many routines take a (type, host
7483 address, target address) triple as arguments to represent a value.
7484 The host address, if non-null, is supposed to contain an internal
7485 copy of the relevant data; otherwise, the program is to consult the
7486 target at the target address. */
7488 /* Assuming that VAL0 represents a pointer value, the result of
7489 dereferencing it. Differs from value_ind in its treatment of
7490 dynamic-sized types. */
7493 ada_value_ind (struct value
*val0
)
7495 struct value
*val
= value_ind (val0
);
7497 if (ada_is_tagged_type (value_type (val
), 0))
7498 val
= ada_tag_value_at_base_address (val
);
7500 return ada_to_fixed_value (val
);
7503 /* The value resulting from dereferencing any "reference to"
7504 qualifiers on VAL0. */
7506 static struct value
*
7507 ada_coerce_ref (struct value
*val0
)
7509 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7511 struct value
*val
= val0
;
7513 val
= coerce_ref (val
);
7515 if (ada_is_tagged_type (value_type (val
), 0))
7516 val
= ada_tag_value_at_base_address (val
);
7518 return ada_to_fixed_value (val
);
7524 /* Return OFF rounded upward if necessary to a multiple of
7525 ALIGNMENT (a power of 2). */
7528 align_value (unsigned int off
, unsigned int alignment
)
7530 return (off
+ alignment
- 1) & ~(alignment
- 1);
7533 /* Return the bit alignment required for field #F of template type TYPE. */
7536 field_alignment (struct type
*type
, int f
)
7538 const char *name
= TYPE_FIELD_NAME (type
, f
);
7542 /* The field name should never be null, unless the debugging information
7543 is somehow malformed. In this case, we assume the field does not
7544 require any alignment. */
7548 len
= strlen (name
);
7550 if (!isdigit (name
[len
- 1]))
7553 if (isdigit (name
[len
- 2]))
7554 align_offset
= len
- 2;
7556 align_offset
= len
- 1;
7558 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7559 return TARGET_CHAR_BIT
;
7561 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7564 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7566 static struct symbol
*
7567 ada_find_any_type_symbol (const char *name
)
7571 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7572 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7575 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7579 /* Find a type named NAME. Ignores ambiguity. This routine will look
7580 solely for types defined by debug info, it will not search the GDB
7583 static struct type
*
7584 ada_find_any_type (const char *name
)
7586 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7589 return SYMBOL_TYPE (sym
);
7594 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7595 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7596 symbol, in which case it is returned. Otherwise, this looks for
7597 symbols whose name is that of NAME_SYM suffixed with "___XR".
7598 Return symbol if found, and NULL otherwise. */
7601 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7603 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7606 if (strstr (name
, "___XR") != NULL
)
7609 sym
= find_old_style_renaming_symbol (name
, block
);
7614 /* Not right yet. FIXME pnh 7/20/2007. */
7615 sym
= ada_find_any_type_symbol (name
);
7616 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7622 static struct symbol
*
7623 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7625 const struct symbol
*function_sym
= block_linkage_function (block
);
7628 if (function_sym
!= NULL
)
7630 /* If the symbol is defined inside a function, NAME is not fully
7631 qualified. This means we need to prepend the function name
7632 as well as adding the ``___XR'' suffix to build the name of
7633 the associated renaming symbol. */
7634 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7635 /* Function names sometimes contain suffixes used
7636 for instance to qualify nested subprograms. When building
7637 the XR type name, we need to make sure that this suffix is
7638 not included. So do not include any suffix in the function
7639 name length below. */
7640 int function_name_len
= ada_name_prefix_len (function_name
);
7641 const int rename_len
= function_name_len
+ 2 /* "__" */
7642 + strlen (name
) + 6 /* "___XR\0" */ ;
7644 /* Strip the suffix if necessary. */
7645 ada_remove_trailing_digits (function_name
, &function_name_len
);
7646 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7647 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7649 /* Library-level functions are a special case, as GNAT adds
7650 a ``_ada_'' prefix to the function name to avoid namespace
7651 pollution. However, the renaming symbols themselves do not
7652 have this prefix, so we need to skip this prefix if present. */
7653 if (function_name_len
> 5 /* "_ada_" */
7654 && strstr (function_name
, "_ada_") == function_name
)
7657 function_name_len
-= 5;
7660 rename
= (char *) alloca (rename_len
* sizeof (char));
7661 strncpy (rename
, function_name
, function_name_len
);
7662 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7667 const int rename_len
= strlen (name
) + 6;
7669 rename
= (char *) alloca (rename_len
* sizeof (char));
7670 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7673 return ada_find_any_type_symbol (rename
);
7676 /* Because of GNAT encoding conventions, several GDB symbols may match a
7677 given type name. If the type denoted by TYPE0 is to be preferred to
7678 that of TYPE1 for purposes of type printing, return non-zero;
7679 otherwise return 0. */
7682 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7686 else if (type0
== NULL
)
7688 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7690 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7692 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7694 else if (ada_is_constrained_packed_array_type (type0
))
7696 else if (ada_is_array_descriptor_type (type0
)
7697 && !ada_is_array_descriptor_type (type1
))
7701 const char *type0_name
= type_name_no_tag (type0
);
7702 const char *type1_name
= type_name_no_tag (type1
);
7704 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7705 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7711 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7712 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7715 ada_type_name (struct type
*type
)
7719 else if (TYPE_NAME (type
) != NULL
)
7720 return TYPE_NAME (type
);
7722 return TYPE_TAG_NAME (type
);
7725 /* Search the list of "descriptive" types associated to TYPE for a type
7726 whose name is NAME. */
7728 static struct type
*
7729 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7731 struct type
*result
;
7733 if (ada_ignore_descriptive_types_p
)
7736 /* If there no descriptive-type info, then there is no parallel type
7738 if (!HAVE_GNAT_AUX_INFO (type
))
7741 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7742 while (result
!= NULL
)
7744 const char *result_name
= ada_type_name (result
);
7746 if (result_name
== NULL
)
7748 warning (_("unexpected null name on descriptive type"));
7752 /* If the names match, stop. */
7753 if (strcmp (result_name
, name
) == 0)
7756 /* Otherwise, look at the next item on the list, if any. */
7757 if (HAVE_GNAT_AUX_INFO (result
))
7758 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7763 /* If we didn't find a match, see whether this is a packed array. With
7764 older compilers, the descriptive type information is either absent or
7765 irrelevant when it comes to packed arrays so the above lookup fails.
7766 Fall back to using a parallel lookup by name in this case. */
7767 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7768 return ada_find_any_type (name
);
7773 /* Find a parallel type to TYPE with the specified NAME, using the
7774 descriptive type taken from the debugging information, if available,
7775 and otherwise using the (slower) name-based method. */
7777 static struct type
*
7778 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7780 struct type
*result
= NULL
;
7782 if (HAVE_GNAT_AUX_INFO (type
))
7783 result
= find_parallel_type_by_descriptive_type (type
, name
);
7785 result
= ada_find_any_type (name
);
7790 /* Same as above, but specify the name of the parallel type by appending
7791 SUFFIX to the name of TYPE. */
7794 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7797 const char *type_name
= ada_type_name (type
);
7800 if (type_name
== NULL
)
7803 len
= strlen (type_name
);
7805 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7807 strcpy (name
, type_name
);
7808 strcpy (name
+ len
, suffix
);
7810 return ada_find_parallel_type_with_name (type
, name
);
7813 /* If TYPE is a variable-size record type, return the corresponding template
7814 type describing its fields. Otherwise, return NULL. */
7816 static struct type
*
7817 dynamic_template_type (struct type
*type
)
7819 type
= ada_check_typedef (type
);
7821 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7822 || ada_type_name (type
) == NULL
)
7826 int len
= strlen (ada_type_name (type
));
7828 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7831 return ada_find_parallel_type (type
, "___XVE");
7835 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7836 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7839 is_dynamic_field (struct type
*templ_type
, int field_num
)
7841 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7844 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7845 && strstr (name
, "___XVL") != NULL
;
7848 /* The index of the variant field of TYPE, or -1 if TYPE does not
7849 represent a variant record type. */
7852 variant_field_index (struct type
*type
)
7856 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7859 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7861 if (ada_is_variant_part (type
, f
))
7867 /* A record type with no fields. */
7869 static struct type
*
7870 empty_record (struct type
*templ
)
7872 struct type
*type
= alloc_type_copy (templ
);
7874 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7875 TYPE_NFIELDS (type
) = 0;
7876 TYPE_FIELDS (type
) = NULL
;
7877 INIT_CPLUS_SPECIFIC (type
);
7878 TYPE_NAME (type
) = "<empty>";
7879 TYPE_TAG_NAME (type
) = NULL
;
7880 TYPE_LENGTH (type
) = 0;
7884 /* An ordinary record type (with fixed-length fields) that describes
7885 the value of type TYPE at VALADDR or ADDRESS (see comments at
7886 the beginning of this section) VAL according to GNAT conventions.
7887 DVAL0 should describe the (portion of a) record that contains any
7888 necessary discriminants. It should be NULL if value_type (VAL) is
7889 an outer-level type (i.e., as opposed to a branch of a variant.) A
7890 variant field (unless unchecked) is replaced by a particular branch
7893 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7894 length are not statically known are discarded. As a consequence,
7895 VALADDR, ADDRESS and DVAL0 are ignored.
7897 NOTE: Limitations: For now, we assume that dynamic fields and
7898 variants occupy whole numbers of bytes. However, they need not be
7902 ada_template_to_fixed_record_type_1 (struct type
*type
,
7903 const gdb_byte
*valaddr
,
7904 CORE_ADDR address
, struct value
*dval0
,
7905 int keep_dynamic_fields
)
7907 struct value
*mark
= value_mark ();
7910 int nfields
, bit_len
;
7916 /* Compute the number of fields in this record type that are going
7917 to be processed: unless keep_dynamic_fields, this includes only
7918 fields whose position and length are static will be processed. */
7919 if (keep_dynamic_fields
)
7920 nfields
= TYPE_NFIELDS (type
);
7924 while (nfields
< TYPE_NFIELDS (type
)
7925 && !ada_is_variant_part (type
, nfields
)
7926 && !is_dynamic_field (type
, nfields
))
7930 rtype
= alloc_type_copy (type
);
7931 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7932 INIT_CPLUS_SPECIFIC (rtype
);
7933 TYPE_NFIELDS (rtype
) = nfields
;
7934 TYPE_FIELDS (rtype
) = (struct field
*)
7935 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7936 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7937 TYPE_NAME (rtype
) = ada_type_name (type
);
7938 TYPE_TAG_NAME (rtype
) = NULL
;
7939 TYPE_FIXED_INSTANCE (rtype
) = 1;
7945 for (f
= 0; f
< nfields
; f
+= 1)
7947 off
= align_value (off
, field_alignment (type
, f
))
7948 + TYPE_FIELD_BITPOS (type
, f
);
7949 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
7950 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7952 if (ada_is_variant_part (type
, f
))
7957 else if (is_dynamic_field (type
, f
))
7959 const gdb_byte
*field_valaddr
= valaddr
;
7960 CORE_ADDR field_address
= address
;
7961 struct type
*field_type
=
7962 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7966 /* rtype's length is computed based on the run-time
7967 value of discriminants. If the discriminants are not
7968 initialized, the type size may be completely bogus and
7969 GDB may fail to allocate a value for it. So check the
7970 size first before creating the value. */
7971 ada_ensure_varsize_limit (rtype
);
7972 /* Using plain value_from_contents_and_address here
7973 causes problems because we will end up trying to
7974 resolve a type that is currently being
7976 dval
= value_from_contents_and_address_unresolved (rtype
,
7979 rtype
= value_type (dval
);
7984 /* If the type referenced by this field is an aligner type, we need
7985 to unwrap that aligner type, because its size might not be set.
7986 Keeping the aligner type would cause us to compute the wrong
7987 size for this field, impacting the offset of the all the fields
7988 that follow this one. */
7989 if (ada_is_aligner_type (field_type
))
7991 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7993 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7994 field_address
= cond_offset_target (field_address
, field_offset
);
7995 field_type
= ada_aligned_type (field_type
);
7998 field_valaddr
= cond_offset_host (field_valaddr
,
7999 off
/ TARGET_CHAR_BIT
);
8000 field_address
= cond_offset_target (field_address
,
8001 off
/ TARGET_CHAR_BIT
);
8003 /* Get the fixed type of the field. Note that, in this case,
8004 we do not want to get the real type out of the tag: if
8005 the current field is the parent part of a tagged record,
8006 we will get the tag of the object. Clearly wrong: the real
8007 type of the parent is not the real type of the child. We
8008 would end up in an infinite loop. */
8009 field_type
= ada_get_base_type (field_type
);
8010 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8011 field_address
, dval
, 0);
8012 /* If the field size is already larger than the maximum
8013 object size, then the record itself will necessarily
8014 be larger than the maximum object size. We need to make
8015 this check now, because the size might be so ridiculously
8016 large (due to an uninitialized variable in the inferior)
8017 that it would cause an overflow when adding it to the
8019 ada_ensure_varsize_limit (field_type
);
8021 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8022 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8023 /* The multiplication can potentially overflow. But because
8024 the field length has been size-checked just above, and
8025 assuming that the maximum size is a reasonable value,
8026 an overflow should not happen in practice. So rather than
8027 adding overflow recovery code to this already complex code,
8028 we just assume that it's not going to happen. */
8030 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8034 /* Note: If this field's type is a typedef, it is important
8035 to preserve the typedef layer.
8037 Otherwise, we might be transforming a typedef to a fat
8038 pointer (encoding a pointer to an unconstrained array),
8039 into a basic fat pointer (encoding an unconstrained
8040 array). As both types are implemented using the same
8041 structure, the typedef is the only clue which allows us
8042 to distinguish between the two options. Stripping it
8043 would prevent us from printing this field appropriately. */
8044 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8045 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8046 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8048 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8051 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8053 /* We need to be careful of typedefs when computing
8054 the length of our field. If this is a typedef,
8055 get the length of the target type, not the length
8057 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8058 field_type
= ada_typedef_target_type (field_type
);
8061 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8064 if (off
+ fld_bit_len
> bit_len
)
8065 bit_len
= off
+ fld_bit_len
;
8067 TYPE_LENGTH (rtype
) =
8068 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8071 /* We handle the variant part, if any, at the end because of certain
8072 odd cases in which it is re-ordered so as NOT to be the last field of
8073 the record. This can happen in the presence of representation
8075 if (variant_field
>= 0)
8077 struct type
*branch_type
;
8079 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8083 /* Using plain value_from_contents_and_address here causes
8084 problems because we will end up trying to resolve a type
8085 that is currently being constructed. */
8086 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8088 rtype
= value_type (dval
);
8094 to_fixed_variant_branch_type
8095 (TYPE_FIELD_TYPE (type
, variant_field
),
8096 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8097 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8098 if (branch_type
== NULL
)
8100 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8101 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8102 TYPE_NFIELDS (rtype
) -= 1;
8106 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8107 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8109 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8111 if (off
+ fld_bit_len
> bit_len
)
8112 bit_len
= off
+ fld_bit_len
;
8113 TYPE_LENGTH (rtype
) =
8114 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8118 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8119 should contain the alignment of that record, which should be a strictly
8120 positive value. If null or negative, then something is wrong, most
8121 probably in the debug info. In that case, we don't round up the size
8122 of the resulting type. If this record is not part of another structure,
8123 the current RTYPE length might be good enough for our purposes. */
8124 if (TYPE_LENGTH (type
) <= 0)
8126 if (TYPE_NAME (rtype
))
8127 warning (_("Invalid type size for `%s' detected: %d."),
8128 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8130 warning (_("Invalid type size for <unnamed> detected: %d."),
8131 TYPE_LENGTH (type
));
8135 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8136 TYPE_LENGTH (type
));
8139 value_free_to_mark (mark
);
8140 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8141 error (_("record type with dynamic size is larger than varsize-limit"));
8145 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8148 static struct type
*
8149 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8150 CORE_ADDR address
, struct value
*dval0
)
8152 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8156 /* An ordinary record type in which ___XVL-convention fields and
8157 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8158 static approximations, containing all possible fields. Uses
8159 no runtime values. Useless for use in values, but that's OK,
8160 since the results are used only for type determinations. Works on both
8161 structs and unions. Representation note: to save space, we memorize
8162 the result of this function in the TYPE_TARGET_TYPE of the
8165 static struct type
*
8166 template_to_static_fixed_type (struct type
*type0
)
8172 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8173 return TYPE_TARGET_TYPE (type0
);
8175 nfields
= TYPE_NFIELDS (type0
);
8178 for (f
= 0; f
< nfields
; f
+= 1)
8180 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
8181 struct type
*new_type
;
8183 if (is_dynamic_field (type0
, f
))
8184 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8186 new_type
= static_unwrap_type (field_type
);
8187 if (type
== type0
&& new_type
!= field_type
)
8189 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8190 TYPE_CODE (type
) = TYPE_CODE (type0
);
8191 INIT_CPLUS_SPECIFIC (type
);
8192 TYPE_NFIELDS (type
) = nfields
;
8193 TYPE_FIELDS (type
) = (struct field
*)
8194 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8195 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8196 sizeof (struct field
) * nfields
);
8197 TYPE_NAME (type
) = ada_type_name (type0
);
8198 TYPE_TAG_NAME (type
) = NULL
;
8199 TYPE_FIXED_INSTANCE (type
) = 1;
8200 TYPE_LENGTH (type
) = 0;
8202 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8203 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8208 /* Given an object of type TYPE whose contents are at VALADDR and
8209 whose address in memory is ADDRESS, returns a revision of TYPE,
8210 which should be a non-dynamic-sized record, in which the variant
8211 part, if any, is replaced with the appropriate branch. Looks
8212 for discriminant values in DVAL0, which can be NULL if the record
8213 contains the necessary discriminant values. */
8215 static struct type
*
8216 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8217 CORE_ADDR address
, struct value
*dval0
)
8219 struct value
*mark
= value_mark ();
8222 struct type
*branch_type
;
8223 int nfields
= TYPE_NFIELDS (type
);
8224 int variant_field
= variant_field_index (type
);
8226 if (variant_field
== -1)
8231 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8232 type
= value_type (dval
);
8237 rtype
= alloc_type_copy (type
);
8238 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8239 INIT_CPLUS_SPECIFIC (rtype
);
8240 TYPE_NFIELDS (rtype
) = nfields
;
8241 TYPE_FIELDS (rtype
) =
8242 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8243 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8244 sizeof (struct field
) * nfields
);
8245 TYPE_NAME (rtype
) = ada_type_name (type
);
8246 TYPE_TAG_NAME (rtype
) = NULL
;
8247 TYPE_FIXED_INSTANCE (rtype
) = 1;
8248 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8250 branch_type
= to_fixed_variant_branch_type
8251 (TYPE_FIELD_TYPE (type
, variant_field
),
8252 cond_offset_host (valaddr
,
8253 TYPE_FIELD_BITPOS (type
, variant_field
)
8255 cond_offset_target (address
,
8256 TYPE_FIELD_BITPOS (type
, variant_field
)
8257 / TARGET_CHAR_BIT
), dval
);
8258 if (branch_type
== NULL
)
8262 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8263 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8264 TYPE_NFIELDS (rtype
) -= 1;
8268 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8269 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8270 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8271 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8273 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8275 value_free_to_mark (mark
);
8279 /* An ordinary record type (with fixed-length fields) that describes
8280 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8281 beginning of this section]. Any necessary discriminants' values
8282 should be in DVAL, a record value; it may be NULL if the object
8283 at ADDR itself contains any necessary discriminant values.
8284 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8285 values from the record are needed. Except in the case that DVAL,
8286 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8287 unchecked) is replaced by a particular branch of the variant.
8289 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8290 is questionable and may be removed. It can arise during the
8291 processing of an unconstrained-array-of-record type where all the
8292 variant branches have exactly the same size. This is because in
8293 such cases, the compiler does not bother to use the XVS convention
8294 when encoding the record. I am currently dubious of this
8295 shortcut and suspect the compiler should be altered. FIXME. */
8297 static struct type
*
8298 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8299 CORE_ADDR address
, struct value
*dval
)
8301 struct type
*templ_type
;
8303 if (TYPE_FIXED_INSTANCE (type0
))
8306 templ_type
= dynamic_template_type (type0
);
8308 if (templ_type
!= NULL
)
8309 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8310 else if (variant_field_index (type0
) >= 0)
8312 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8314 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8319 TYPE_FIXED_INSTANCE (type0
) = 1;
8325 /* An ordinary record type (with fixed-length fields) that describes
8326 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8327 union type. Any necessary discriminants' values should be in DVAL,
8328 a record value. That is, this routine selects the appropriate
8329 branch of the union at ADDR according to the discriminant value
8330 indicated in the union's type name. Returns VAR_TYPE0 itself if
8331 it represents a variant subject to a pragma Unchecked_Union. */
8333 static struct type
*
8334 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8335 CORE_ADDR address
, struct value
*dval
)
8338 struct type
*templ_type
;
8339 struct type
*var_type
;
8341 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8342 var_type
= TYPE_TARGET_TYPE (var_type0
);
8344 var_type
= var_type0
;
8346 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8348 if (templ_type
!= NULL
)
8349 var_type
= templ_type
;
8351 if (is_unchecked_variant (var_type
, value_type (dval
)))
8354 ada_which_variant_applies (var_type
,
8355 value_type (dval
), value_contents (dval
));
8358 return empty_record (var_type
);
8359 else if (is_dynamic_field (var_type
, which
))
8360 return to_fixed_record_type
8361 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8362 valaddr
, address
, dval
);
8363 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8365 to_fixed_record_type
8366 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8368 return TYPE_FIELD_TYPE (var_type
, which
);
8371 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8372 ENCODING_TYPE, a type following the GNAT conventions for discrete
8373 type encodings, only carries redundant information. */
8376 ada_is_redundant_range_encoding (struct type
*range_type
,
8377 struct type
*encoding_type
)
8379 struct type
*fixed_range_type
;
8384 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8386 if (TYPE_CODE (get_base_type (range_type
))
8387 != TYPE_CODE (get_base_type (encoding_type
)))
8389 /* The compiler probably used a simple base type to describe
8390 the range type instead of the range's actual base type,
8391 expecting us to get the real base type from the encoding
8392 anyway. In this situation, the encoding cannot be ignored
8397 if (is_dynamic_type (range_type
))
8400 if (TYPE_NAME (encoding_type
) == NULL
)
8403 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8404 if (bounds_str
== NULL
)
8407 n
= 8; /* Skip "___XDLU_". */
8408 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8410 if (TYPE_LOW_BOUND (range_type
) != lo
)
8413 n
+= 2; /* Skip the "__" separator between the two bounds. */
8414 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8416 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8422 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8423 a type following the GNAT encoding for describing array type
8424 indices, only carries redundant information. */
8427 ada_is_redundant_index_type_desc (struct type
*array_type
,
8428 struct type
*desc_type
)
8430 struct type
*this_layer
= check_typedef (array_type
);
8433 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8435 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8436 TYPE_FIELD_TYPE (desc_type
, i
)))
8438 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8444 /* Assuming that TYPE0 is an array type describing the type of a value
8445 at ADDR, and that DVAL describes a record containing any
8446 discriminants used in TYPE0, returns a type for the value that
8447 contains no dynamic components (that is, no components whose sizes
8448 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8449 true, gives an error message if the resulting type's size is over
8452 static struct type
*
8453 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8456 struct type
*index_type_desc
;
8457 struct type
*result
;
8458 int constrained_packed_array_p
;
8460 type0
= ada_check_typedef (type0
);
8461 if (TYPE_FIXED_INSTANCE (type0
))
8464 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8465 if (constrained_packed_array_p
)
8466 type0
= decode_constrained_packed_array_type (type0
);
8468 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
8469 ada_fixup_array_indexes_type (index_type_desc
);
8470 if (index_type_desc
!= NULL
8471 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8473 /* Ignore this ___XA parallel type, as it does not bring any
8474 useful information. This allows us to avoid creating fixed
8475 versions of the array's index types, which would be identical
8476 to the original ones. This, in turn, can also help avoid
8477 the creation of fixed versions of the array itself. */
8478 index_type_desc
= NULL
;
8481 if (index_type_desc
== NULL
)
8483 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8485 /* NOTE: elt_type---the fixed version of elt_type0---should never
8486 depend on the contents of the array in properly constructed
8488 /* Create a fixed version of the array element type.
8489 We're not providing the address of an element here,
8490 and thus the actual object value cannot be inspected to do
8491 the conversion. This should not be a problem, since arrays of
8492 unconstrained objects are not allowed. In particular, all
8493 the elements of an array of a tagged type should all be of
8494 the same type specified in the debugging info. No need to
8495 consult the object tag. */
8496 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8498 /* Make sure we always create a new array type when dealing with
8499 packed array types, since we're going to fix-up the array
8500 type length and element bitsize a little further down. */
8501 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8504 result
= create_array_type (alloc_type_copy (type0
),
8505 elt_type
, TYPE_INDEX_TYPE (type0
));
8510 struct type
*elt_type0
;
8513 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8514 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8516 /* NOTE: result---the fixed version of elt_type0---should never
8517 depend on the contents of the array in properly constructed
8519 /* Create a fixed version of the array element type.
8520 We're not providing the address of an element here,
8521 and thus the actual object value cannot be inspected to do
8522 the conversion. This should not be a problem, since arrays of
8523 unconstrained objects are not allowed. In particular, all
8524 the elements of an array of a tagged type should all be of
8525 the same type specified in the debugging info. No need to
8526 consult the object tag. */
8528 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8531 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8533 struct type
*range_type
=
8534 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8536 result
= create_array_type (alloc_type_copy (elt_type0
),
8537 result
, range_type
);
8538 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8540 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8541 error (_("array type with dynamic size is larger than varsize-limit"));
8544 /* We want to preserve the type name. This can be useful when
8545 trying to get the type name of a value that has already been
8546 printed (for instance, if the user did "print VAR; whatis $". */
8547 TYPE_NAME (result
) = TYPE_NAME (type0
);
8549 if (constrained_packed_array_p
)
8551 /* So far, the resulting type has been created as if the original
8552 type was a regular (non-packed) array type. As a result, the
8553 bitsize of the array elements needs to be set again, and the array
8554 length needs to be recomputed based on that bitsize. */
8555 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8556 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8558 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8559 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8560 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8561 TYPE_LENGTH (result
)++;
8564 TYPE_FIXED_INSTANCE (result
) = 1;
8569 /* A standard type (containing no dynamically sized components)
8570 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8571 DVAL describes a record containing any discriminants used in TYPE0,
8572 and may be NULL if there are none, or if the object of type TYPE at
8573 ADDRESS or in VALADDR contains these discriminants.
8575 If CHECK_TAG is not null, in the case of tagged types, this function
8576 attempts to locate the object's tag and use it to compute the actual
8577 type. However, when ADDRESS is null, we cannot use it to determine the
8578 location of the tag, and therefore compute the tagged type's actual type.
8579 So we return the tagged type without consulting the tag. */
8581 static struct type
*
8582 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8583 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8585 type
= ada_check_typedef (type
);
8586 switch (TYPE_CODE (type
))
8590 case TYPE_CODE_STRUCT
:
8592 struct type
*static_type
= to_static_fixed_type (type
);
8593 struct type
*fixed_record_type
=
8594 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8596 /* If STATIC_TYPE is a tagged type and we know the object's address,
8597 then we can determine its tag, and compute the object's actual
8598 type from there. Note that we have to use the fixed record
8599 type (the parent part of the record may have dynamic fields
8600 and the way the location of _tag is expressed may depend on
8603 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8606 value_tag_from_contents_and_address
8610 struct type
*real_type
= type_from_tag (tag
);
8612 value_from_contents_and_address (fixed_record_type
,
8615 fixed_record_type
= value_type (obj
);
8616 if (real_type
!= NULL
)
8617 return to_fixed_record_type
8619 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8622 /* Check to see if there is a parallel ___XVZ variable.
8623 If there is, then it provides the actual size of our type. */
8624 else if (ada_type_name (fixed_record_type
) != NULL
)
8626 const char *name
= ada_type_name (fixed_record_type
);
8627 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8631 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8632 size
= get_int_var_value (xvz_name
, &xvz_found
);
8633 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8635 fixed_record_type
= copy_type (fixed_record_type
);
8636 TYPE_LENGTH (fixed_record_type
) = size
;
8638 /* The FIXED_RECORD_TYPE may have be a stub. We have
8639 observed this when the debugging info is STABS, and
8640 apparently it is something that is hard to fix.
8642 In practice, we don't need the actual type definition
8643 at all, because the presence of the XVZ variable allows us
8644 to assume that there must be a XVS type as well, which we
8645 should be able to use later, when we need the actual type
8648 In the meantime, pretend that the "fixed" type we are
8649 returning is NOT a stub, because this can cause trouble
8650 when using this type to create new types targeting it.
8651 Indeed, the associated creation routines often check
8652 whether the target type is a stub and will try to replace
8653 it, thus using a type with the wrong size. This, in turn,
8654 might cause the new type to have the wrong size too.
8655 Consider the case of an array, for instance, where the size
8656 of the array is computed from the number of elements in
8657 our array multiplied by the size of its element. */
8658 TYPE_STUB (fixed_record_type
) = 0;
8661 return fixed_record_type
;
8663 case TYPE_CODE_ARRAY
:
8664 return to_fixed_array_type (type
, dval
, 1);
8665 case TYPE_CODE_UNION
:
8669 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8673 /* The same as ada_to_fixed_type_1, except that it preserves the type
8674 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8676 The typedef layer needs be preserved in order to differentiate between
8677 arrays and array pointers when both types are implemented using the same
8678 fat pointer. In the array pointer case, the pointer is encoded as
8679 a typedef of the pointer type. For instance, considering:
8681 type String_Access is access String;
8682 S1 : String_Access := null;
8684 To the debugger, S1 is defined as a typedef of type String. But
8685 to the user, it is a pointer. So if the user tries to print S1,
8686 we should not dereference the array, but print the array address
8689 If we didn't preserve the typedef layer, we would lose the fact that
8690 the type is to be presented as a pointer (needs de-reference before
8691 being printed). And we would also use the source-level type name. */
8694 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8695 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8698 struct type
*fixed_type
=
8699 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8701 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8702 then preserve the typedef layer.
8704 Implementation note: We can only check the main-type portion of
8705 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8706 from TYPE now returns a type that has the same instance flags
8707 as TYPE. For instance, if TYPE is a "typedef const", and its
8708 target type is a "struct", then the typedef elimination will return
8709 a "const" version of the target type. See check_typedef for more
8710 details about how the typedef layer elimination is done.
8712 brobecker/2010-11-19: It seems to me that the only case where it is
8713 useful to preserve the typedef layer is when dealing with fat pointers.
8714 Perhaps, we could add a check for that and preserve the typedef layer
8715 only in that situation. But this seems unecessary so far, probably
8716 because we call check_typedef/ada_check_typedef pretty much everywhere.
8718 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8719 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8720 == TYPE_MAIN_TYPE (fixed_type
)))
8726 /* A standard (static-sized) type corresponding as well as possible to
8727 TYPE0, but based on no runtime data. */
8729 static struct type
*
8730 to_static_fixed_type (struct type
*type0
)
8737 if (TYPE_FIXED_INSTANCE (type0
))
8740 type0
= ada_check_typedef (type0
);
8742 switch (TYPE_CODE (type0
))
8746 case TYPE_CODE_STRUCT
:
8747 type
= dynamic_template_type (type0
);
8749 return template_to_static_fixed_type (type
);
8751 return template_to_static_fixed_type (type0
);
8752 case TYPE_CODE_UNION
:
8753 type
= ada_find_parallel_type (type0
, "___XVU");
8755 return template_to_static_fixed_type (type
);
8757 return template_to_static_fixed_type (type0
);
8761 /* A static approximation of TYPE with all type wrappers removed. */
8763 static struct type
*
8764 static_unwrap_type (struct type
*type
)
8766 if (ada_is_aligner_type (type
))
8768 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8769 if (ada_type_name (type1
) == NULL
)
8770 TYPE_NAME (type1
) = ada_type_name (type
);
8772 return static_unwrap_type (type1
);
8776 struct type
*raw_real_type
= ada_get_base_type (type
);
8778 if (raw_real_type
== type
)
8781 return to_static_fixed_type (raw_real_type
);
8785 /* In some cases, incomplete and private types require
8786 cross-references that are not resolved as records (for example,
8788 type FooP is access Foo;
8790 type Foo is array ...;
8791 ). In these cases, since there is no mechanism for producing
8792 cross-references to such types, we instead substitute for FooP a
8793 stub enumeration type that is nowhere resolved, and whose tag is
8794 the name of the actual type. Call these types "non-record stubs". */
8796 /* A type equivalent to TYPE that is not a non-record stub, if one
8797 exists, otherwise TYPE. */
8800 ada_check_typedef (struct type
*type
)
8805 /* If our type is a typedef type of a fat pointer, then we're done.
8806 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8807 what allows us to distinguish between fat pointers that represent
8808 array types, and fat pointers that represent array access types
8809 (in both cases, the compiler implements them as fat pointers). */
8810 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8811 && is_thick_pntr (ada_typedef_target_type (type
)))
8814 CHECK_TYPEDEF (type
);
8815 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8816 || !TYPE_STUB (type
)
8817 || TYPE_TAG_NAME (type
) == NULL
)
8821 const char *name
= TYPE_TAG_NAME (type
);
8822 struct type
*type1
= ada_find_any_type (name
);
8827 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8828 stubs pointing to arrays, as we don't create symbols for array
8829 types, only for the typedef-to-array types). If that's the case,
8830 strip the typedef layer. */
8831 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8832 type1
= ada_check_typedef (type1
);
8838 /* A value representing the data at VALADDR/ADDRESS as described by
8839 type TYPE0, but with a standard (static-sized) type that correctly
8840 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8841 type, then return VAL0 [this feature is simply to avoid redundant
8842 creation of struct values]. */
8844 static struct value
*
8845 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8848 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8850 if (type
== type0
&& val0
!= NULL
)
8853 return value_from_contents_and_address (type
, 0, address
);
8856 /* A value representing VAL, but with a standard (static-sized) type
8857 that correctly describes it. Does not necessarily create a new
8861 ada_to_fixed_value (struct value
*val
)
8863 val
= unwrap_value (val
);
8864 val
= ada_to_fixed_value_create (value_type (val
),
8865 value_address (val
),
8873 /* Table mapping attribute numbers to names.
8874 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8876 static const char *attribute_names
[] = {
8894 ada_attribute_name (enum exp_opcode n
)
8896 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8897 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8899 return attribute_names
[0];
8902 /* Evaluate the 'POS attribute applied to ARG. */
8905 pos_atr (struct value
*arg
)
8907 struct value
*val
= coerce_ref (arg
);
8908 struct type
*type
= value_type (val
);
8910 if (!discrete_type_p (type
))
8911 error (_("'POS only defined on discrete types"));
8913 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8916 LONGEST v
= value_as_long (val
);
8918 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8920 if (v
== TYPE_FIELD_ENUMVAL (type
, i
))
8923 error (_("enumeration value is invalid: can't find 'POS"));
8926 return value_as_long (val
);
8929 static struct value
*
8930 value_pos_atr (struct type
*type
, struct value
*arg
)
8932 return value_from_longest (type
, pos_atr (arg
));
8935 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8937 static struct value
*
8938 value_val_atr (struct type
*type
, struct value
*arg
)
8940 if (!discrete_type_p (type
))
8941 error (_("'VAL only defined on discrete types"));
8942 if (!integer_type_p (value_type (arg
)))
8943 error (_("'VAL requires integral argument"));
8945 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8947 long pos
= value_as_long (arg
);
8949 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8950 error (_("argument to 'VAL out of range"));
8951 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
8954 return value_from_longest (type
, value_as_long (arg
));
8960 /* True if TYPE appears to be an Ada character type.
8961 [At the moment, this is true only for Character and Wide_Character;
8962 It is a heuristic test that could stand improvement]. */
8965 ada_is_character_type (struct type
*type
)
8969 /* If the type code says it's a character, then assume it really is,
8970 and don't check any further. */
8971 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8974 /* Otherwise, assume it's a character type iff it is a discrete type
8975 with a known character type name. */
8976 name
= ada_type_name (type
);
8977 return (name
!= NULL
8978 && (TYPE_CODE (type
) == TYPE_CODE_INT
8979 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8980 && (strcmp (name
, "character") == 0
8981 || strcmp (name
, "wide_character") == 0
8982 || strcmp (name
, "wide_wide_character") == 0
8983 || strcmp (name
, "unsigned char") == 0));
8986 /* True if TYPE appears to be an Ada string type. */
8989 ada_is_string_type (struct type
*type
)
8991 type
= ada_check_typedef (type
);
8993 && TYPE_CODE (type
) != TYPE_CODE_PTR
8994 && (ada_is_simple_array_type (type
)
8995 || ada_is_array_descriptor_type (type
))
8996 && ada_array_arity (type
) == 1)
8998 struct type
*elttype
= ada_array_element_type (type
, 1);
9000 return ada_is_character_type (elttype
);
9006 /* The compiler sometimes provides a parallel XVS type for a given
9007 PAD type. Normally, it is safe to follow the PAD type directly,
9008 but older versions of the compiler have a bug that causes the offset
9009 of its "F" field to be wrong. Following that field in that case
9010 would lead to incorrect results, but this can be worked around
9011 by ignoring the PAD type and using the associated XVS type instead.
9013 Set to True if the debugger should trust the contents of PAD types.
9014 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9015 static int trust_pad_over_xvs
= 1;
9017 /* True if TYPE is a struct type introduced by the compiler to force the
9018 alignment of a value. Such types have a single field with a
9019 distinctive name. */
9022 ada_is_aligner_type (struct type
*type
)
9024 type
= ada_check_typedef (type
);
9026 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9029 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9030 && TYPE_NFIELDS (type
) == 1
9031 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9034 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9035 the parallel type. */
9038 ada_get_base_type (struct type
*raw_type
)
9040 struct type
*real_type_namer
;
9041 struct type
*raw_real_type
;
9043 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9046 if (ada_is_aligner_type (raw_type
))
9047 /* The encoding specifies that we should always use the aligner type.
9048 So, even if this aligner type has an associated XVS type, we should
9051 According to the compiler gurus, an XVS type parallel to an aligner
9052 type may exist because of a stabs limitation. In stabs, aligner
9053 types are empty because the field has a variable-sized type, and
9054 thus cannot actually be used as an aligner type. As a result,
9055 we need the associated parallel XVS type to decode the type.
9056 Since the policy in the compiler is to not change the internal
9057 representation based on the debugging info format, we sometimes
9058 end up having a redundant XVS type parallel to the aligner type. */
9061 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9062 if (real_type_namer
== NULL
9063 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9064 || TYPE_NFIELDS (real_type_namer
) != 1)
9067 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9069 /* This is an older encoding form where the base type needs to be
9070 looked up by name. We prefer the newer enconding because it is
9072 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9073 if (raw_real_type
== NULL
)
9076 return raw_real_type
;
9079 /* The field in our XVS type is a reference to the base type. */
9080 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9083 /* The type of value designated by TYPE, with all aligners removed. */
9086 ada_aligned_type (struct type
*type
)
9088 if (ada_is_aligner_type (type
))
9089 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9091 return ada_get_base_type (type
);
9095 /* The address of the aligned value in an object at address VALADDR
9096 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9099 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9101 if (ada_is_aligner_type (type
))
9102 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9104 TYPE_FIELD_BITPOS (type
,
9105 0) / TARGET_CHAR_BIT
);
9112 /* The printed representation of an enumeration literal with encoded
9113 name NAME. The value is good to the next call of ada_enum_name. */
9115 ada_enum_name (const char *name
)
9117 static char *result
;
9118 static size_t result_len
= 0;
9121 /* First, unqualify the enumeration name:
9122 1. Search for the last '.' character. If we find one, then skip
9123 all the preceding characters, the unqualified name starts
9124 right after that dot.
9125 2. Otherwise, we may be debugging on a target where the compiler
9126 translates dots into "__". Search forward for double underscores,
9127 but stop searching when we hit an overloading suffix, which is
9128 of the form "__" followed by digits. */
9130 tmp
= strrchr (name
, '.');
9135 while ((tmp
= strstr (name
, "__")) != NULL
)
9137 if (isdigit (tmp
[2]))
9148 if (name
[1] == 'U' || name
[1] == 'W')
9150 if (sscanf (name
+ 2, "%x", &v
) != 1)
9156 GROW_VECT (result
, result_len
, 16);
9157 if (isascii (v
) && isprint (v
))
9158 xsnprintf (result
, result_len
, "'%c'", v
);
9159 else if (name
[1] == 'U')
9160 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9162 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9168 tmp
= strstr (name
, "__");
9170 tmp
= strstr (name
, "$");
9173 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9174 strncpy (result
, name
, tmp
- name
);
9175 result
[tmp
- name
] = '\0';
9183 /* Evaluate the subexpression of EXP starting at *POS as for
9184 evaluate_type, updating *POS to point just past the evaluated
9187 static struct value
*
9188 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9190 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9193 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9196 static struct value
*
9197 unwrap_value (struct value
*val
)
9199 struct type
*type
= ada_check_typedef (value_type (val
));
9201 if (ada_is_aligner_type (type
))
9203 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9204 struct type
*val_type
= ada_check_typedef (value_type (v
));
9206 if (ada_type_name (val_type
) == NULL
)
9207 TYPE_NAME (val_type
) = ada_type_name (type
);
9209 return unwrap_value (v
);
9213 struct type
*raw_real_type
=
9214 ada_check_typedef (ada_get_base_type (type
));
9216 /* If there is no parallel XVS or XVE type, then the value is
9217 already unwrapped. Return it without further modification. */
9218 if ((type
== raw_real_type
)
9219 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9223 coerce_unspec_val_to_type
9224 (val
, ada_to_fixed_type (raw_real_type
, 0,
9225 value_address (val
),
9230 static struct value
*
9231 cast_to_fixed (struct type
*type
, struct value
*arg
)
9235 if (type
== value_type (arg
))
9237 else if (ada_is_fixed_point_type (value_type (arg
)))
9238 val
= ada_float_to_fixed (type
,
9239 ada_fixed_to_float (value_type (arg
),
9240 value_as_long (arg
)));
9243 DOUBLEST argd
= value_as_double (arg
);
9245 val
= ada_float_to_fixed (type
, argd
);
9248 return value_from_longest (type
, val
);
9251 static struct value
*
9252 cast_from_fixed (struct type
*type
, struct value
*arg
)
9254 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9255 value_as_long (arg
));
9257 return value_from_double (type
, val
);
9260 /* Given two array types T1 and T2, return nonzero iff both arrays
9261 contain the same number of elements. */
9264 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9266 LONGEST lo1
, hi1
, lo2
, hi2
;
9268 /* Get the array bounds in order to verify that the size of
9269 the two arrays match. */
9270 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9271 || !get_array_bounds (t2
, &lo2
, &hi2
))
9272 error (_("unable to determine array bounds"));
9274 /* To make things easier for size comparison, normalize a bit
9275 the case of empty arrays by making sure that the difference
9276 between upper bound and lower bound is always -1. */
9282 return (hi1
- lo1
== hi2
- lo2
);
9285 /* Assuming that VAL is an array of integrals, and TYPE represents
9286 an array with the same number of elements, but with wider integral
9287 elements, return an array "casted" to TYPE. In practice, this
9288 means that the returned array is built by casting each element
9289 of the original array into TYPE's (wider) element type. */
9291 static struct value
*
9292 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9294 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9299 /* Verify that both val and type are arrays of scalars, and
9300 that the size of val's elements is smaller than the size
9301 of type's element. */
9302 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9303 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9304 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9305 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9306 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9307 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9309 if (!get_array_bounds (type
, &lo
, &hi
))
9310 error (_("unable to determine array bounds"));
9312 res
= allocate_value (type
);
9314 /* Promote each array element. */
9315 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9317 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9319 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9320 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9326 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9327 return the converted value. */
9329 static struct value
*
9330 coerce_for_assign (struct type
*type
, struct value
*val
)
9332 struct type
*type2
= value_type (val
);
9337 type2
= ada_check_typedef (type2
);
9338 type
= ada_check_typedef (type
);
9340 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9341 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9343 val
= ada_value_ind (val
);
9344 type2
= value_type (val
);
9347 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9348 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9350 if (!ada_same_array_size_p (type
, type2
))
9351 error (_("cannot assign arrays of different length"));
9353 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9354 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9355 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9356 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9358 /* Allow implicit promotion of the array elements to
9360 return ada_promote_array_of_integrals (type
, val
);
9363 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9364 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9365 error (_("Incompatible types in assignment"));
9366 deprecated_set_value_type (val
, type
);
9371 static struct value
*
9372 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9375 struct type
*type1
, *type2
;
9378 arg1
= coerce_ref (arg1
);
9379 arg2
= coerce_ref (arg2
);
9380 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9381 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9383 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9384 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9385 return value_binop (arg1
, arg2
, op
);
9394 return value_binop (arg1
, arg2
, op
);
9397 v2
= value_as_long (arg2
);
9399 error (_("second operand of %s must not be zero."), op_string (op
));
9401 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9402 return value_binop (arg1
, arg2
, op
);
9404 v1
= value_as_long (arg1
);
9409 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9410 v
+= v
> 0 ? -1 : 1;
9418 /* Should not reach this point. */
9422 val
= allocate_value (type1
);
9423 store_unsigned_integer (value_contents_raw (val
),
9424 TYPE_LENGTH (value_type (val
)),
9425 gdbarch_byte_order (get_type_arch (type1
)), v
);
9430 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9432 if (ada_is_direct_array_type (value_type (arg1
))
9433 || ada_is_direct_array_type (value_type (arg2
)))
9435 /* Automatically dereference any array reference before
9436 we attempt to perform the comparison. */
9437 arg1
= ada_coerce_ref (arg1
);
9438 arg2
= ada_coerce_ref (arg2
);
9440 arg1
= ada_coerce_to_simple_array (arg1
);
9441 arg2
= ada_coerce_to_simple_array (arg2
);
9442 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9443 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9444 error (_("Attempt to compare array with non-array"));
9445 /* FIXME: The following works only for types whose
9446 representations use all bits (no padding or undefined bits)
9447 and do not have user-defined equality. */
9449 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9450 && memcmp (value_contents (arg1
), value_contents (arg2
),
9451 TYPE_LENGTH (value_type (arg1
))) == 0;
9453 return value_equal (arg1
, arg2
);
9456 /* Total number of component associations in the aggregate starting at
9457 index PC in EXP. Assumes that index PC is the start of an
9461 num_component_specs (struct expression
*exp
, int pc
)
9465 m
= exp
->elts
[pc
+ 1].longconst
;
9468 for (i
= 0; i
< m
; i
+= 1)
9470 switch (exp
->elts
[pc
].opcode
)
9476 n
+= exp
->elts
[pc
+ 1].longconst
;
9479 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9484 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9485 component of LHS (a simple array or a record), updating *POS past
9486 the expression, assuming that LHS is contained in CONTAINER. Does
9487 not modify the inferior's memory, nor does it modify LHS (unless
9488 LHS == CONTAINER). */
9491 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9492 struct expression
*exp
, int *pos
)
9494 struct value
*mark
= value_mark ();
9497 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9499 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9500 struct value
*index_val
= value_from_longest (index_type
, index
);
9502 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9506 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9507 elt
= ada_to_fixed_value (elt
);
9510 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9511 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9513 value_assign_to_component (container
, elt
,
9514 ada_evaluate_subexp (NULL
, exp
, pos
,
9517 value_free_to_mark (mark
);
9520 /* Assuming that LHS represents an lvalue having a record or array
9521 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9522 of that aggregate's value to LHS, advancing *POS past the
9523 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9524 lvalue containing LHS (possibly LHS itself). Does not modify
9525 the inferior's memory, nor does it modify the contents of
9526 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9528 static struct value
*
9529 assign_aggregate (struct value
*container
,
9530 struct value
*lhs
, struct expression
*exp
,
9531 int *pos
, enum noside noside
)
9533 struct type
*lhs_type
;
9534 int n
= exp
->elts
[*pos
+1].longconst
;
9535 LONGEST low_index
, high_index
;
9538 int max_indices
, num_indices
;
9542 if (noside
!= EVAL_NORMAL
)
9544 for (i
= 0; i
< n
; i
+= 1)
9545 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9549 container
= ada_coerce_ref (container
);
9550 if (ada_is_direct_array_type (value_type (container
)))
9551 container
= ada_coerce_to_simple_array (container
);
9552 lhs
= ada_coerce_ref (lhs
);
9553 if (!deprecated_value_modifiable (lhs
))
9554 error (_("Left operand of assignment is not a modifiable lvalue."));
9556 lhs_type
= value_type (lhs
);
9557 if (ada_is_direct_array_type (lhs_type
))
9559 lhs
= ada_coerce_to_simple_array (lhs
);
9560 lhs_type
= value_type (lhs
);
9561 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9562 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9564 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9567 high_index
= num_visible_fields (lhs_type
) - 1;
9570 error (_("Left-hand side must be array or record."));
9572 num_specs
= num_component_specs (exp
, *pos
- 3);
9573 max_indices
= 4 * num_specs
+ 4;
9574 indices
= alloca (max_indices
* sizeof (indices
[0]));
9575 indices
[0] = indices
[1] = low_index
- 1;
9576 indices
[2] = indices
[3] = high_index
+ 1;
9579 for (i
= 0; i
< n
; i
+= 1)
9581 switch (exp
->elts
[*pos
].opcode
)
9584 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9585 &num_indices
, max_indices
,
9586 low_index
, high_index
);
9589 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9590 &num_indices
, max_indices
,
9591 low_index
, high_index
);
9595 error (_("Misplaced 'others' clause"));
9596 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9597 num_indices
, low_index
, high_index
);
9600 error (_("Internal error: bad aggregate clause"));
9607 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9608 construct at *POS, updating *POS past the construct, given that
9609 the positions are relative to lower bound LOW, where HIGH is the
9610 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9611 updating *NUM_INDICES as needed. CONTAINER is as for
9612 assign_aggregate. */
9614 aggregate_assign_positional (struct value
*container
,
9615 struct value
*lhs
, struct expression
*exp
,
9616 int *pos
, LONGEST
*indices
, int *num_indices
,
9617 int max_indices
, LONGEST low
, LONGEST high
)
9619 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9621 if (ind
- 1 == high
)
9622 warning (_("Extra components in aggregate ignored."));
9625 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9627 assign_component (container
, lhs
, ind
, exp
, pos
);
9630 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9633 /* Assign into the components of LHS indexed by the OP_CHOICES
9634 construct at *POS, updating *POS past the construct, given that
9635 the allowable indices are LOW..HIGH. Record the indices assigned
9636 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9637 needed. CONTAINER is as for assign_aggregate. */
9639 aggregate_assign_from_choices (struct value
*container
,
9640 struct value
*lhs
, struct expression
*exp
,
9641 int *pos
, LONGEST
*indices
, int *num_indices
,
9642 int max_indices
, LONGEST low
, LONGEST high
)
9645 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9646 int choice_pos
, expr_pc
;
9647 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9649 choice_pos
= *pos
+= 3;
9651 for (j
= 0; j
< n_choices
; j
+= 1)
9652 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9654 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9656 for (j
= 0; j
< n_choices
; j
+= 1)
9658 LONGEST lower
, upper
;
9659 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9661 if (op
== OP_DISCRETE_RANGE
)
9664 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9666 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9671 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9683 name
= &exp
->elts
[choice_pos
+ 2].string
;
9686 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9689 error (_("Invalid record component association."));
9691 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9693 if (! find_struct_field (name
, value_type (lhs
), 0,
9694 NULL
, NULL
, NULL
, NULL
, &ind
))
9695 error (_("Unknown component name: %s."), name
);
9696 lower
= upper
= ind
;
9699 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9700 error (_("Index in component association out of bounds."));
9702 add_component_interval (lower
, upper
, indices
, num_indices
,
9704 while (lower
<= upper
)
9709 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9715 /* Assign the value of the expression in the OP_OTHERS construct in
9716 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9717 have not been previously assigned. The index intervals already assigned
9718 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9719 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9721 aggregate_assign_others (struct value
*container
,
9722 struct value
*lhs
, struct expression
*exp
,
9723 int *pos
, LONGEST
*indices
, int num_indices
,
9724 LONGEST low
, LONGEST high
)
9727 int expr_pc
= *pos
+ 1;
9729 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9733 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9738 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9741 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9744 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9745 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9746 modifying *SIZE as needed. It is an error if *SIZE exceeds
9747 MAX_SIZE. The resulting intervals do not overlap. */
9749 add_component_interval (LONGEST low
, LONGEST high
,
9750 LONGEST
* indices
, int *size
, int max_size
)
9754 for (i
= 0; i
< *size
; i
+= 2) {
9755 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9759 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9760 if (high
< indices
[kh
])
9762 if (low
< indices
[i
])
9764 indices
[i
+ 1] = indices
[kh
- 1];
9765 if (high
> indices
[i
+ 1])
9766 indices
[i
+ 1] = high
;
9767 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9768 *size
-= kh
- i
- 2;
9771 else if (high
< indices
[i
])
9775 if (*size
== max_size
)
9776 error (_("Internal error: miscounted aggregate components."));
9778 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9779 indices
[j
] = indices
[j
- 2];
9781 indices
[i
+ 1] = high
;
9784 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9787 static struct value
*
9788 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9790 if (type
== ada_check_typedef (value_type (arg2
)))
9793 if (ada_is_fixed_point_type (type
))
9794 return (cast_to_fixed (type
, arg2
));
9796 if (ada_is_fixed_point_type (value_type (arg2
)))
9797 return cast_from_fixed (type
, arg2
);
9799 return value_cast (type
, arg2
);
9802 /* Evaluating Ada expressions, and printing their result.
9803 ------------------------------------------------------
9808 We usually evaluate an Ada expression in order to print its value.
9809 We also evaluate an expression in order to print its type, which
9810 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9811 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9812 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9813 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9816 Evaluating expressions is a little more complicated for Ada entities
9817 than it is for entities in languages such as C. The main reason for
9818 this is that Ada provides types whose definition might be dynamic.
9819 One example of such types is variant records. Or another example
9820 would be an array whose bounds can only be known at run time.
9822 The following description is a general guide as to what should be
9823 done (and what should NOT be done) in order to evaluate an expression
9824 involving such types, and when. This does not cover how the semantic
9825 information is encoded by GNAT as this is covered separatly. For the
9826 document used as the reference for the GNAT encoding, see exp_dbug.ads
9827 in the GNAT sources.
9829 Ideally, we should embed each part of this description next to its
9830 associated code. Unfortunately, the amount of code is so vast right
9831 now that it's hard to see whether the code handling a particular
9832 situation might be duplicated or not. One day, when the code is
9833 cleaned up, this guide might become redundant with the comments
9834 inserted in the code, and we might want to remove it.
9836 2. ``Fixing'' an Entity, the Simple Case:
9837 -----------------------------------------
9839 When evaluating Ada expressions, the tricky issue is that they may
9840 reference entities whose type contents and size are not statically
9841 known. Consider for instance a variant record:
9843 type Rec (Empty : Boolean := True) is record
9846 when False => Value : Integer;
9849 Yes : Rec := (Empty => False, Value => 1);
9850 No : Rec := (empty => True);
9852 The size and contents of that record depends on the value of the
9853 descriminant (Rec.Empty). At this point, neither the debugging
9854 information nor the associated type structure in GDB are able to
9855 express such dynamic types. So what the debugger does is to create
9856 "fixed" versions of the type that applies to the specific object.
9857 We also informally refer to this opperation as "fixing" an object,
9858 which means creating its associated fixed type.
9860 Example: when printing the value of variable "Yes" above, its fixed
9861 type would look like this:
9868 On the other hand, if we printed the value of "No", its fixed type
9875 Things become a little more complicated when trying to fix an entity
9876 with a dynamic type that directly contains another dynamic type,
9877 such as an array of variant records, for instance. There are
9878 two possible cases: Arrays, and records.
9880 3. ``Fixing'' Arrays:
9881 ---------------------
9883 The type structure in GDB describes an array in terms of its bounds,
9884 and the type of its elements. By design, all elements in the array
9885 have the same type and we cannot represent an array of variant elements
9886 using the current type structure in GDB. When fixing an array,
9887 we cannot fix the array element, as we would potentially need one
9888 fixed type per element of the array. As a result, the best we can do
9889 when fixing an array is to produce an array whose bounds and size
9890 are correct (allowing us to read it from memory), but without having
9891 touched its element type. Fixing each element will be done later,
9892 when (if) necessary.
9894 Arrays are a little simpler to handle than records, because the same
9895 amount of memory is allocated for each element of the array, even if
9896 the amount of space actually used by each element differs from element
9897 to element. Consider for instance the following array of type Rec:
9899 type Rec_Array is array (1 .. 2) of Rec;
9901 The actual amount of memory occupied by each element might be different
9902 from element to element, depending on the value of their discriminant.
9903 But the amount of space reserved for each element in the array remains
9904 fixed regardless. So we simply need to compute that size using
9905 the debugging information available, from which we can then determine
9906 the array size (we multiply the number of elements of the array by
9907 the size of each element).
9909 The simplest case is when we have an array of a constrained element
9910 type. For instance, consider the following type declarations:
9912 type Bounded_String (Max_Size : Integer) is
9914 Buffer : String (1 .. Max_Size);
9916 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9918 In this case, the compiler describes the array as an array of
9919 variable-size elements (identified by its XVS suffix) for which
9920 the size can be read in the parallel XVZ variable.
9922 In the case of an array of an unconstrained element type, the compiler
9923 wraps the array element inside a private PAD type. This type should not
9924 be shown to the user, and must be "unwrap"'ed before printing. Note
9925 that we also use the adjective "aligner" in our code to designate
9926 these wrapper types.
9928 In some cases, the size allocated for each element is statically
9929 known. In that case, the PAD type already has the correct size,
9930 and the array element should remain unfixed.
9932 But there are cases when this size is not statically known.
9933 For instance, assuming that "Five" is an integer variable:
9935 type Dynamic is array (1 .. Five) of Integer;
9936 type Wrapper (Has_Length : Boolean := False) is record
9939 when True => Length : Integer;
9943 type Wrapper_Array is array (1 .. 2) of Wrapper;
9945 Hello : Wrapper_Array := (others => (Has_Length => True,
9946 Data => (others => 17),
9950 The debugging info would describe variable Hello as being an
9951 array of a PAD type. The size of that PAD type is not statically
9952 known, but can be determined using a parallel XVZ variable.
9953 In that case, a copy of the PAD type with the correct size should
9954 be used for the fixed array.
9956 3. ``Fixing'' record type objects:
9957 ----------------------------------
9959 Things are slightly different from arrays in the case of dynamic
9960 record types. In this case, in order to compute the associated
9961 fixed type, we need to determine the size and offset of each of
9962 its components. This, in turn, requires us to compute the fixed
9963 type of each of these components.
9965 Consider for instance the example:
9967 type Bounded_String (Max_Size : Natural) is record
9968 Str : String (1 .. Max_Size);
9971 My_String : Bounded_String (Max_Size => 10);
9973 In that case, the position of field "Length" depends on the size
9974 of field Str, which itself depends on the value of the Max_Size
9975 discriminant. In order to fix the type of variable My_String,
9976 we need to fix the type of field Str. Therefore, fixing a variant
9977 record requires us to fix each of its components.
9979 However, if a component does not have a dynamic size, the component
9980 should not be fixed. In particular, fields that use a PAD type
9981 should not fixed. Here is an example where this might happen
9982 (assuming type Rec above):
9984 type Container (Big : Boolean) is record
9988 when True => Another : Integer;
9992 My_Container : Container := (Big => False,
9993 First => (Empty => True),
9996 In that example, the compiler creates a PAD type for component First,
9997 whose size is constant, and then positions the component After just
9998 right after it. The offset of component After is therefore constant
10001 The debugger computes the position of each field based on an algorithm
10002 that uses, among other things, the actual position and size of the field
10003 preceding it. Let's now imagine that the user is trying to print
10004 the value of My_Container. If the type fixing was recursive, we would
10005 end up computing the offset of field After based on the size of the
10006 fixed version of field First. And since in our example First has
10007 only one actual field, the size of the fixed type is actually smaller
10008 than the amount of space allocated to that field, and thus we would
10009 compute the wrong offset of field After.
10011 To make things more complicated, we need to watch out for dynamic
10012 components of variant records (identified by the ___XVL suffix in
10013 the component name). Even if the target type is a PAD type, the size
10014 of that type might not be statically known. So the PAD type needs
10015 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10016 we might end up with the wrong size for our component. This can be
10017 observed with the following type declarations:
10019 type Octal is new Integer range 0 .. 7;
10020 type Octal_Array is array (Positive range <>) of Octal;
10021 pragma Pack (Octal_Array);
10023 type Octal_Buffer (Size : Positive) is record
10024 Buffer : Octal_Array (1 .. Size);
10028 In that case, Buffer is a PAD type whose size is unset and needs
10029 to be computed by fixing the unwrapped type.
10031 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10032 ----------------------------------------------------------
10034 Lastly, when should the sub-elements of an entity that remained unfixed
10035 thus far, be actually fixed?
10037 The answer is: Only when referencing that element. For instance
10038 when selecting one component of a record, this specific component
10039 should be fixed at that point in time. Or when printing the value
10040 of a record, each component should be fixed before its value gets
10041 printed. Similarly for arrays, the element of the array should be
10042 fixed when printing each element of the array, or when extracting
10043 one element out of that array. On the other hand, fixing should
10044 not be performed on the elements when taking a slice of an array!
10046 Note that one of the side-effects of miscomputing the offset and
10047 size of each field is that we end up also miscomputing the size
10048 of the containing type. This can have adverse results when computing
10049 the value of an entity. GDB fetches the value of an entity based
10050 on the size of its type, and thus a wrong size causes GDB to fetch
10051 the wrong amount of memory. In the case where the computed size is
10052 too small, GDB fetches too little data to print the value of our
10053 entiry. Results in this case as unpredicatble, as we usually read
10054 past the buffer containing the data =:-o. */
10056 /* Implement the evaluate_exp routine in the exp_descriptor structure
10057 for the Ada language. */
10059 static struct value
*
10060 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10061 int *pos
, enum noside noside
)
10063 enum exp_opcode op
;
10067 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10070 struct value
**argvec
;
10074 op
= exp
->elts
[pc
].opcode
;
10080 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10082 if (noside
== EVAL_NORMAL
)
10083 arg1
= unwrap_value (arg1
);
10085 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
10086 then we need to perform the conversion manually, because
10087 evaluate_subexp_standard doesn't do it. This conversion is
10088 necessary in Ada because the different kinds of float/fixed
10089 types in Ada have different representations.
10091 Similarly, we need to perform the conversion from OP_LONG
10093 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
10094 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
10100 struct value
*result
;
10103 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10104 /* The result type will have code OP_STRING, bashed there from
10105 OP_ARRAY. Bash it back. */
10106 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10107 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10113 type
= exp
->elts
[pc
+ 1].type
;
10114 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
10115 if (noside
== EVAL_SKIP
)
10117 arg1
= ada_value_cast (type
, arg1
, noside
);
10122 type
= exp
->elts
[pc
+ 1].type
;
10123 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10126 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10127 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10129 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10130 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10132 return ada_value_assign (arg1
, arg1
);
10134 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10135 except if the lhs of our assignment is a convenience variable.
10136 In the case of assigning to a convenience variable, the lhs
10137 should be exactly the result of the evaluation of the rhs. */
10138 type
= value_type (arg1
);
10139 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10141 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10142 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10144 if (ada_is_fixed_point_type (value_type (arg1
)))
10145 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10146 else if (ada_is_fixed_point_type (value_type (arg2
)))
10148 (_("Fixed-point values must be assigned to fixed-point variables"));
10150 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10151 return ada_value_assign (arg1
, arg2
);
10154 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10155 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10156 if (noside
== EVAL_SKIP
)
10158 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10159 return (value_from_longest
10160 (value_type (arg1
),
10161 value_as_long (arg1
) + value_as_long (arg2
)));
10162 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10163 return (value_from_longest
10164 (value_type (arg2
),
10165 value_as_long (arg1
) + value_as_long (arg2
)));
10166 if ((ada_is_fixed_point_type (value_type (arg1
))
10167 || ada_is_fixed_point_type (value_type (arg2
)))
10168 && value_type (arg1
) != value_type (arg2
))
10169 error (_("Operands of fixed-point addition must have the same type"));
10170 /* Do the addition, and cast the result to the type of the first
10171 argument. We cannot cast the result to a reference type, so if
10172 ARG1 is a reference type, find its underlying type. */
10173 type
= value_type (arg1
);
10174 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10175 type
= TYPE_TARGET_TYPE (type
);
10176 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10177 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10180 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10181 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10182 if (noside
== EVAL_SKIP
)
10184 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10185 return (value_from_longest
10186 (value_type (arg1
),
10187 value_as_long (arg1
) - value_as_long (arg2
)));
10188 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10189 return (value_from_longest
10190 (value_type (arg2
),
10191 value_as_long (arg1
) - value_as_long (arg2
)));
10192 if ((ada_is_fixed_point_type (value_type (arg1
))
10193 || ada_is_fixed_point_type (value_type (arg2
)))
10194 && value_type (arg1
) != value_type (arg2
))
10195 error (_("Operands of fixed-point subtraction "
10196 "must have the same type"));
10197 /* Do the substraction, and cast the result to the type of the first
10198 argument. We cannot cast the result to a reference type, so if
10199 ARG1 is a reference type, find its underlying type. */
10200 type
= value_type (arg1
);
10201 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10202 type
= TYPE_TARGET_TYPE (type
);
10203 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10204 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10210 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10211 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10212 if (noside
== EVAL_SKIP
)
10214 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10216 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10217 return value_zero (value_type (arg1
), not_lval
);
10221 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10222 if (ada_is_fixed_point_type (value_type (arg1
)))
10223 arg1
= cast_from_fixed (type
, arg1
);
10224 if (ada_is_fixed_point_type (value_type (arg2
)))
10225 arg2
= cast_from_fixed (type
, arg2
);
10226 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10227 return ada_value_binop (arg1
, arg2
, op
);
10231 case BINOP_NOTEQUAL
:
10232 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10233 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10234 if (noside
== EVAL_SKIP
)
10236 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10240 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10241 tem
= ada_value_equal (arg1
, arg2
);
10243 if (op
== BINOP_NOTEQUAL
)
10245 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10246 return value_from_longest (type
, (LONGEST
) tem
);
10249 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10250 if (noside
== EVAL_SKIP
)
10252 else if (ada_is_fixed_point_type (value_type (arg1
)))
10253 return value_cast (value_type (arg1
), value_neg (arg1
));
10256 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10257 return value_neg (arg1
);
10260 case BINOP_LOGICAL_AND
:
10261 case BINOP_LOGICAL_OR
:
10262 case UNOP_LOGICAL_NOT
:
10267 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10268 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10269 return value_cast (type
, val
);
10272 case BINOP_BITWISE_AND
:
10273 case BINOP_BITWISE_IOR
:
10274 case BINOP_BITWISE_XOR
:
10278 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10280 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10282 return value_cast (value_type (arg1
), val
);
10288 if (noside
== EVAL_SKIP
)
10294 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10295 /* Only encountered when an unresolved symbol occurs in a
10296 context other than a function call, in which case, it is
10298 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10299 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10301 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10303 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10304 /* Check to see if this is a tagged type. We also need to handle
10305 the case where the type is a reference to a tagged type, but
10306 we have to be careful to exclude pointers to tagged types.
10307 The latter should be shown as usual (as a pointer), whereas
10308 a reference should mostly be transparent to the user. */
10309 if (ada_is_tagged_type (type
, 0)
10310 || (TYPE_CODE (type
) == TYPE_CODE_REF
10311 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10313 /* Tagged types are a little special in the fact that the real
10314 type is dynamic and can only be determined by inspecting the
10315 object's tag. This means that we need to get the object's
10316 value first (EVAL_NORMAL) and then extract the actual object
10319 Note that we cannot skip the final step where we extract
10320 the object type from its tag, because the EVAL_NORMAL phase
10321 results in dynamic components being resolved into fixed ones.
10322 This can cause problems when trying to print the type
10323 description of tagged types whose parent has a dynamic size:
10324 We use the type name of the "_parent" component in order
10325 to print the name of the ancestor type in the type description.
10326 If that component had a dynamic size, the resolution into
10327 a fixed type would result in the loss of that type name,
10328 thus preventing us from printing the name of the ancestor
10329 type in the type description. */
10330 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10332 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10334 struct type
*actual_type
;
10336 actual_type
= type_from_tag (ada_value_tag (arg1
));
10337 if (actual_type
== NULL
)
10338 /* If, for some reason, we were unable to determine
10339 the actual type from the tag, then use the static
10340 approximation that we just computed as a fallback.
10341 This can happen if the debugging information is
10342 incomplete, for instance. */
10343 actual_type
= type
;
10344 return value_zero (actual_type
, not_lval
);
10348 /* In the case of a ref, ada_coerce_ref takes care
10349 of determining the actual type. But the evaluation
10350 should return a ref as it should be valid to ask
10351 for its address; so rebuild a ref after coerce. */
10352 arg1
= ada_coerce_ref (arg1
);
10353 return value_ref (arg1
);
10357 /* Records and unions for which GNAT encodings have been
10358 generated need to be statically fixed as well.
10359 Otherwise, non-static fixing produces a type where
10360 all dynamic properties are removed, which prevents "ptype"
10361 from being able to completely describe the type.
10362 For instance, a case statement in a variant record would be
10363 replaced by the relevant components based on the actual
10364 value of the discriminants. */
10365 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10366 && dynamic_template_type (type
) != NULL
)
10367 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10368 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10371 return value_zero (to_static_fixed_type (type
), not_lval
);
10375 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10376 return ada_to_fixed_value (arg1
);
10381 /* Allocate arg vector, including space for the function to be
10382 called in argvec[0] and a terminating NULL. */
10383 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10385 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
10387 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10388 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10389 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10390 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10393 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10394 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10397 if (noside
== EVAL_SKIP
)
10401 if (ada_is_constrained_packed_array_type
10402 (desc_base_type (value_type (argvec
[0]))))
10403 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10404 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10405 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10406 /* This is a packed array that has already been fixed, and
10407 therefore already coerced to a simple array. Nothing further
10410 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
10411 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10412 && VALUE_LVAL (argvec
[0]) == lval_memory
))
10413 argvec
[0] = value_addr (argvec
[0]);
10415 type
= ada_check_typedef (value_type (argvec
[0]));
10417 /* Ada allows us to implicitly dereference arrays when subscripting
10418 them. So, if this is an array typedef (encoding use for array
10419 access types encoded as fat pointers), strip it now. */
10420 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10421 type
= ada_typedef_target_type (type
);
10423 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10425 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10427 case TYPE_CODE_FUNC
:
10428 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10430 case TYPE_CODE_ARRAY
:
10432 case TYPE_CODE_STRUCT
:
10433 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10434 argvec
[0] = ada_value_ind (argvec
[0]);
10435 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10438 error (_("cannot subscript or call something of type `%s'"),
10439 ada_type_name (value_type (argvec
[0])));
10444 switch (TYPE_CODE (type
))
10446 case TYPE_CODE_FUNC
:
10447 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10449 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10451 if (TYPE_GNU_IFUNC (type
))
10452 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10453 return allocate_value (rtype
);
10455 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10456 case TYPE_CODE_INTERNAL_FUNCTION
:
10457 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10458 /* We don't know anything about what the internal
10459 function might return, but we have to return
10461 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10464 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10465 argvec
[0], nargs
, argvec
+ 1);
10467 case TYPE_CODE_STRUCT
:
10471 arity
= ada_array_arity (type
);
10472 type
= ada_array_element_type (type
, nargs
);
10474 error (_("cannot subscript or call a record"));
10475 if (arity
!= nargs
)
10476 error (_("wrong number of subscripts; expecting %d"), arity
);
10477 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10478 return value_zero (ada_aligned_type (type
), lval_memory
);
10480 unwrap_value (ada_value_subscript
10481 (argvec
[0], nargs
, argvec
+ 1));
10483 case TYPE_CODE_ARRAY
:
10484 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10486 type
= ada_array_element_type (type
, nargs
);
10488 error (_("element type of array unknown"));
10490 return value_zero (ada_aligned_type (type
), lval_memory
);
10493 unwrap_value (ada_value_subscript
10494 (ada_coerce_to_simple_array (argvec
[0]),
10495 nargs
, argvec
+ 1));
10496 case TYPE_CODE_PTR
: /* Pointer to array */
10497 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10499 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10500 type
= ada_array_element_type (type
, nargs
);
10502 error (_("element type of array unknown"));
10504 return value_zero (ada_aligned_type (type
), lval_memory
);
10507 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10508 nargs
, argvec
+ 1));
10511 error (_("Attempt to index or call something other than an "
10512 "array or function"));
10517 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10518 struct value
*low_bound_val
=
10519 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10520 struct value
*high_bound_val
=
10521 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10523 LONGEST high_bound
;
10525 low_bound_val
= coerce_ref (low_bound_val
);
10526 high_bound_val
= coerce_ref (high_bound_val
);
10527 low_bound
= pos_atr (low_bound_val
);
10528 high_bound
= pos_atr (high_bound_val
);
10530 if (noside
== EVAL_SKIP
)
10533 /* If this is a reference to an aligner type, then remove all
10535 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10536 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10537 TYPE_TARGET_TYPE (value_type (array
)) =
10538 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10540 if (ada_is_constrained_packed_array_type (value_type (array
)))
10541 error (_("cannot slice a packed array"));
10543 /* If this is a reference to an array or an array lvalue,
10544 convert to a pointer. */
10545 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10546 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10547 && VALUE_LVAL (array
) == lval_memory
))
10548 array
= value_addr (array
);
10550 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10551 && ada_is_array_descriptor_type (ada_check_typedef
10552 (value_type (array
))))
10553 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10555 array
= ada_coerce_to_simple_array_ptr (array
);
10557 /* If we have more than one level of pointer indirection,
10558 dereference the value until we get only one level. */
10559 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10560 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10562 array
= value_ind (array
);
10564 /* Make sure we really do have an array type before going further,
10565 to avoid a SEGV when trying to get the index type or the target
10566 type later down the road if the debug info generated by
10567 the compiler is incorrect or incomplete. */
10568 if (!ada_is_simple_array_type (value_type (array
)))
10569 error (_("cannot take slice of non-array"));
10571 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10574 struct type
*type0
= ada_check_typedef (value_type (array
));
10576 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10577 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10580 struct type
*arr_type0
=
10581 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10583 return ada_value_slice_from_ptr (array
, arr_type0
,
10584 longest_to_int (low_bound
),
10585 longest_to_int (high_bound
));
10588 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10590 else if (high_bound
< low_bound
)
10591 return empty_array (value_type (array
), low_bound
);
10593 return ada_value_slice (array
, longest_to_int (low_bound
),
10594 longest_to_int (high_bound
));
10597 case UNOP_IN_RANGE
:
10599 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10600 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10602 if (noside
== EVAL_SKIP
)
10605 switch (TYPE_CODE (type
))
10608 lim_warning (_("Membership test incompletely implemented; "
10609 "always returns true"));
10610 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10611 return value_from_longest (type
, (LONGEST
) 1);
10613 case TYPE_CODE_RANGE
:
10614 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10615 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10616 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10617 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10618 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10620 value_from_longest (type
,
10621 (value_less (arg1
, arg3
)
10622 || value_equal (arg1
, arg3
))
10623 && (value_less (arg2
, arg1
)
10624 || value_equal (arg2
, arg1
)));
10627 case BINOP_IN_BOUNDS
:
10629 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10630 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10632 if (noside
== EVAL_SKIP
)
10635 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10637 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10638 return value_zero (type
, not_lval
);
10641 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10643 type
= ada_index_type (value_type (arg2
), tem
, "range");
10645 type
= value_type (arg1
);
10647 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10648 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10650 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10651 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10652 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10654 value_from_longest (type
,
10655 (value_less (arg1
, arg3
)
10656 || value_equal (arg1
, arg3
))
10657 && (value_less (arg2
, arg1
)
10658 || value_equal (arg2
, arg1
)));
10660 case TERNOP_IN_RANGE
:
10661 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10662 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10663 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10665 if (noside
== EVAL_SKIP
)
10668 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10669 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10670 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10672 value_from_longest (type
,
10673 (value_less (arg1
, arg3
)
10674 || value_equal (arg1
, arg3
))
10675 && (value_less (arg2
, arg1
)
10676 || value_equal (arg2
, arg1
)));
10680 case OP_ATR_LENGTH
:
10682 struct type
*type_arg
;
10684 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10686 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10688 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10692 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10696 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10697 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10698 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10701 if (noside
== EVAL_SKIP
)
10704 if (type_arg
== NULL
)
10706 arg1
= ada_coerce_ref (arg1
);
10708 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10709 arg1
= ada_coerce_to_simple_array (arg1
);
10711 if (op
== OP_ATR_LENGTH
)
10712 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10715 type
= ada_index_type (value_type (arg1
), tem
,
10716 ada_attribute_name (op
));
10718 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10721 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10722 return allocate_value (type
);
10726 default: /* Should never happen. */
10727 error (_("unexpected attribute encountered"));
10729 return value_from_longest
10730 (type
, ada_array_bound (arg1
, tem
, 0));
10732 return value_from_longest
10733 (type
, ada_array_bound (arg1
, tem
, 1));
10734 case OP_ATR_LENGTH
:
10735 return value_from_longest
10736 (type
, ada_array_length (arg1
, tem
));
10739 else if (discrete_type_p (type_arg
))
10741 struct type
*range_type
;
10742 const char *name
= ada_type_name (type_arg
);
10745 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10746 range_type
= to_fixed_range_type (type_arg
, NULL
);
10747 if (range_type
== NULL
)
10748 range_type
= type_arg
;
10752 error (_("unexpected attribute encountered"));
10754 return value_from_longest
10755 (range_type
, ada_discrete_type_low_bound (range_type
));
10757 return value_from_longest
10758 (range_type
, ada_discrete_type_high_bound (range_type
));
10759 case OP_ATR_LENGTH
:
10760 error (_("the 'length attribute applies only to array types"));
10763 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10764 error (_("unimplemented type attribute"));
10769 if (ada_is_constrained_packed_array_type (type_arg
))
10770 type_arg
= decode_constrained_packed_array_type (type_arg
);
10772 if (op
== OP_ATR_LENGTH
)
10773 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10776 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10778 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10781 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10782 return allocate_value (type
);
10787 error (_("unexpected attribute encountered"));
10789 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10790 return value_from_longest (type
, low
);
10792 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10793 return value_from_longest (type
, high
);
10794 case OP_ATR_LENGTH
:
10795 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10796 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10797 return value_from_longest (type
, high
- low
+ 1);
10803 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10804 if (noside
== EVAL_SKIP
)
10807 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10808 return value_zero (ada_tag_type (arg1
), not_lval
);
10810 return ada_value_tag (arg1
);
10814 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10815 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10816 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10817 if (noside
== EVAL_SKIP
)
10819 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10820 return value_zero (value_type (arg1
), not_lval
);
10823 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10824 return value_binop (arg1
, arg2
,
10825 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10828 case OP_ATR_MODULUS
:
10830 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10832 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10833 if (noside
== EVAL_SKIP
)
10836 if (!ada_is_modular_type (type_arg
))
10837 error (_("'modulus must be applied to modular type"));
10839 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10840 ada_modulus (type_arg
));
10845 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10846 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10847 if (noside
== EVAL_SKIP
)
10849 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10850 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10851 return value_zero (type
, not_lval
);
10853 return value_pos_atr (type
, arg1
);
10856 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10857 type
= value_type (arg1
);
10859 /* If the argument is a reference, then dereference its type, since
10860 the user is really asking for the size of the actual object,
10861 not the size of the pointer. */
10862 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10863 type
= TYPE_TARGET_TYPE (type
);
10865 if (noside
== EVAL_SKIP
)
10867 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10868 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10870 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10871 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10874 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10875 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10876 type
= exp
->elts
[pc
+ 2].type
;
10877 if (noside
== EVAL_SKIP
)
10879 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10880 return value_zero (type
, not_lval
);
10882 return value_val_atr (type
, arg1
);
10885 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10886 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10887 if (noside
== EVAL_SKIP
)
10889 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10890 return value_zero (value_type (arg1
), not_lval
);
10893 /* For integer exponentiation operations,
10894 only promote the first argument. */
10895 if (is_integral_type (value_type (arg2
)))
10896 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10898 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10900 return value_binop (arg1
, arg2
, op
);
10904 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10905 if (noside
== EVAL_SKIP
)
10911 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10912 if (noside
== EVAL_SKIP
)
10914 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10915 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10916 return value_neg (arg1
);
10921 preeval_pos
= *pos
;
10922 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10923 if (noside
== EVAL_SKIP
)
10925 type
= ada_check_typedef (value_type (arg1
));
10926 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10928 if (ada_is_array_descriptor_type (type
))
10929 /* GDB allows dereferencing GNAT array descriptors. */
10931 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10933 if (arrType
== NULL
)
10934 error (_("Attempt to dereference null array pointer."));
10935 return value_at_lazy (arrType
, 0);
10937 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10938 || TYPE_CODE (type
) == TYPE_CODE_REF
10939 /* In C you can dereference an array to get the 1st elt. */
10940 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10942 /* As mentioned in the OP_VAR_VALUE case, tagged types can
10943 only be determined by inspecting the object's tag.
10944 This means that we need to evaluate completely the
10945 expression in order to get its type. */
10947 if ((TYPE_CODE (type
) == TYPE_CODE_REF
10948 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
10949 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
10951 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10953 type
= value_type (ada_value_ind (arg1
));
10957 type
= to_static_fixed_type
10959 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10961 ada_ensure_varsize_limit (type
);
10962 return value_zero (type
, lval_memory
);
10964 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10966 /* GDB allows dereferencing an int. */
10967 if (expect_type
== NULL
)
10968 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10973 to_static_fixed_type (ada_aligned_type (expect_type
));
10974 return value_zero (expect_type
, lval_memory
);
10978 error (_("Attempt to take contents of a non-pointer value."));
10980 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10981 type
= ada_check_typedef (value_type (arg1
));
10983 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10984 /* GDB allows dereferencing an int. If we were given
10985 the expect_type, then use that as the target type.
10986 Otherwise, assume that the target type is an int. */
10988 if (expect_type
!= NULL
)
10989 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10992 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10993 (CORE_ADDR
) value_as_address (arg1
));
10996 if (ada_is_array_descriptor_type (type
))
10997 /* GDB allows dereferencing GNAT array descriptors. */
10998 return ada_coerce_to_simple_array (arg1
);
11000 return ada_value_ind (arg1
);
11002 case STRUCTOP_STRUCT
:
11003 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11004 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11005 preeval_pos
= *pos
;
11006 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11007 if (noside
== EVAL_SKIP
)
11009 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11011 struct type
*type1
= value_type (arg1
);
11013 if (ada_is_tagged_type (type1
, 1))
11015 type
= ada_lookup_struct_elt_type (type1
,
11016 &exp
->elts
[pc
+ 2].string
,
11019 /* If the field is not found, check if it exists in the
11020 extension of this object's type. This means that we
11021 need to evaluate completely the expression. */
11025 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11027 arg1
= ada_value_struct_elt (arg1
,
11028 &exp
->elts
[pc
+ 2].string
,
11030 arg1
= unwrap_value (arg1
);
11031 type
= value_type (ada_to_fixed_value (arg1
));
11036 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11039 return value_zero (ada_aligned_type (type
), lval_memory
);
11042 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11043 arg1
= unwrap_value (arg1
);
11044 return ada_to_fixed_value (arg1
);
11047 /* The value is not supposed to be used. This is here to make it
11048 easier to accommodate expressions that contain types. */
11050 if (noside
== EVAL_SKIP
)
11052 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11053 return allocate_value (exp
->elts
[pc
+ 1].type
);
11055 error (_("Attempt to use a type name as an expression"));
11060 case OP_DISCRETE_RANGE
:
11061 case OP_POSITIONAL
:
11063 if (noside
== EVAL_NORMAL
)
11067 error (_("Undefined name, ambiguous name, or renaming used in "
11068 "component association: %s."), &exp
->elts
[pc
+2].string
);
11070 error (_("Aggregates only allowed on the right of an assignment"));
11072 internal_error (__FILE__
, __LINE__
,
11073 _("aggregate apparently mangled"));
11076 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11078 for (tem
= 0; tem
< nargs
; tem
+= 1)
11079 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11084 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
11090 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11091 type name that encodes the 'small and 'delta information.
11092 Otherwise, return NULL. */
11094 static const char *
11095 fixed_type_info (struct type
*type
)
11097 const char *name
= ada_type_name (type
);
11098 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11100 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11102 const char *tail
= strstr (name
, "___XF_");
11109 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11110 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11115 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11118 ada_is_fixed_point_type (struct type
*type
)
11120 return fixed_type_info (type
) != NULL
;
11123 /* Return non-zero iff TYPE represents a System.Address type. */
11126 ada_is_system_address_type (struct type
*type
)
11128 return (TYPE_NAME (type
)
11129 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11132 /* Assuming that TYPE is the representation of an Ada fixed-point
11133 type, return its delta, or -1 if the type is malformed and the
11134 delta cannot be determined. */
11137 ada_delta (struct type
*type
)
11139 const char *encoding
= fixed_type_info (type
);
11142 /* Strictly speaking, num and den are encoded as integer. However,
11143 they may not fit into a long, and they will have to be converted
11144 to DOUBLEST anyway. So scan them as DOUBLEST. */
11145 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11152 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11153 factor ('SMALL value) associated with the type. */
11156 scaling_factor (struct type
*type
)
11158 const char *encoding
= fixed_type_info (type
);
11159 DOUBLEST num0
, den0
, num1
, den1
;
11162 /* Strictly speaking, num's and den's are encoded as integer. However,
11163 they may not fit into a long, and they will have to be converted
11164 to DOUBLEST anyway. So scan them as DOUBLEST. */
11165 n
= sscanf (encoding
,
11166 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
11167 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11168 &num0
, &den0
, &num1
, &den1
);
11173 return num1
/ den1
;
11175 return num0
/ den0
;
11179 /* Assuming that X is the representation of a value of fixed-point
11180 type TYPE, return its floating-point equivalent. */
11183 ada_fixed_to_float (struct type
*type
, LONGEST x
)
11185 return (DOUBLEST
) x
*scaling_factor (type
);
11188 /* The representation of a fixed-point value of type TYPE
11189 corresponding to the value X. */
11192 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
11194 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
11201 /* Scan STR beginning at position K for a discriminant name, and
11202 return the value of that discriminant field of DVAL in *PX. If
11203 PNEW_K is not null, put the position of the character beyond the
11204 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11205 not alter *PX and *PNEW_K if unsuccessful. */
11208 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11211 static char *bound_buffer
= NULL
;
11212 static size_t bound_buffer_len
= 0;
11215 struct value
*bound_val
;
11217 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11220 pend
= strstr (str
+ k
, "__");
11224 k
+= strlen (bound
);
11228 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
11229 bound
= bound_buffer
;
11230 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
11231 bound
[pend
- (str
+ k
)] = '\0';
11235 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11236 if (bound_val
== NULL
)
11239 *px
= value_as_long (bound_val
);
11240 if (pnew_k
!= NULL
)
11245 /* Value of variable named NAME in the current environment. If
11246 no such variable found, then if ERR_MSG is null, returns 0, and
11247 otherwise causes an error with message ERR_MSG. */
11249 static struct value
*
11250 get_var_value (char *name
, char *err_msg
)
11252 struct ada_symbol_info
*syms
;
11255 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11260 if (err_msg
== NULL
)
11263 error (("%s"), err_msg
);
11266 return value_of_variable (syms
[0].sym
, syms
[0].block
);
11269 /* Value of integer variable named NAME in the current environment. If
11270 no such variable found, returns 0, and sets *FLAG to 0. If
11271 successful, sets *FLAG to 1. */
11274 get_int_var_value (char *name
, int *flag
)
11276 struct value
*var_val
= get_var_value (name
, 0);
11288 return value_as_long (var_val
);
11293 /* Return a range type whose base type is that of the range type named
11294 NAME in the current environment, and whose bounds are calculated
11295 from NAME according to the GNAT range encoding conventions.
11296 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11297 corresponding range type from debug information; fall back to using it
11298 if symbol lookup fails. If a new type must be created, allocate it
11299 like ORIG_TYPE was. The bounds information, in general, is encoded
11300 in NAME, the base type given in the named range type. */
11302 static struct type
*
11303 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11306 struct type
*base_type
;
11307 char *subtype_info
;
11309 gdb_assert (raw_type
!= NULL
);
11310 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11312 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11313 base_type
= TYPE_TARGET_TYPE (raw_type
);
11315 base_type
= raw_type
;
11317 name
= TYPE_NAME (raw_type
);
11318 subtype_info
= strstr (name
, "___XD");
11319 if (subtype_info
== NULL
)
11321 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11322 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11324 if (L
< INT_MIN
|| U
> INT_MAX
)
11327 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11332 static char *name_buf
= NULL
;
11333 static size_t name_len
= 0;
11334 int prefix_len
= subtype_info
- name
;
11340 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11341 strncpy (name_buf
, name
, prefix_len
);
11342 name_buf
[prefix_len
] = '\0';
11345 bounds_str
= strchr (subtype_info
, '_');
11348 if (*subtype_info
== 'L')
11350 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11351 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11353 if (bounds_str
[n
] == '_')
11355 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11363 strcpy (name_buf
+ prefix_len
, "___L");
11364 L
= get_int_var_value (name_buf
, &ok
);
11367 lim_warning (_("Unknown lower bound, using 1."));
11372 if (*subtype_info
== 'U')
11374 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11375 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11382 strcpy (name_buf
+ prefix_len
, "___U");
11383 U
= get_int_var_value (name_buf
, &ok
);
11386 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11391 type
= create_static_range_type (alloc_type_copy (raw_type
),
11393 TYPE_NAME (type
) = name
;
11398 /* True iff NAME is the name of a range type. */
11401 ada_is_range_type_name (const char *name
)
11403 return (name
!= NULL
&& strstr (name
, "___XD"));
11407 /* Modular types */
11409 /* True iff TYPE is an Ada modular type. */
11412 ada_is_modular_type (struct type
*type
)
11414 struct type
*subranged_type
= get_base_type (type
);
11416 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11417 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11418 && TYPE_UNSIGNED (subranged_type
));
11421 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11424 ada_modulus (struct type
*type
)
11426 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11430 /* Ada exception catchpoint support:
11431 ---------------------------------
11433 We support 3 kinds of exception catchpoints:
11434 . catchpoints on Ada exceptions
11435 . catchpoints on unhandled Ada exceptions
11436 . catchpoints on failed assertions
11438 Exceptions raised during failed assertions, or unhandled exceptions
11439 could perfectly be caught with the general catchpoint on Ada exceptions.
11440 However, we can easily differentiate these two special cases, and having
11441 the option to distinguish these two cases from the rest can be useful
11442 to zero-in on certain situations.
11444 Exception catchpoints are a specialized form of breakpoint,
11445 since they rely on inserting breakpoints inside known routines
11446 of the GNAT runtime. The implementation therefore uses a standard
11447 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11450 Support in the runtime for exception catchpoints have been changed
11451 a few times already, and these changes affect the implementation
11452 of these catchpoints. In order to be able to support several
11453 variants of the runtime, we use a sniffer that will determine
11454 the runtime variant used by the program being debugged. */
11456 /* Ada's standard exceptions.
11458 The Ada 83 standard also defined Numeric_Error. But there so many
11459 situations where it was unclear from the Ada 83 Reference Manual
11460 (RM) whether Constraint_Error or Numeric_Error should be raised,
11461 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11462 Interpretation saying that anytime the RM says that Numeric_Error
11463 should be raised, the implementation may raise Constraint_Error.
11464 Ada 95 went one step further and pretty much removed Numeric_Error
11465 from the list of standard exceptions (it made it a renaming of
11466 Constraint_Error, to help preserve compatibility when compiling
11467 an Ada83 compiler). As such, we do not include Numeric_Error from
11468 this list of standard exceptions. */
11470 static char *standard_exc
[] = {
11471 "constraint_error",
11477 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11479 /* A structure that describes how to support exception catchpoints
11480 for a given executable. */
11482 struct exception_support_info
11484 /* The name of the symbol to break on in order to insert
11485 a catchpoint on exceptions. */
11486 const char *catch_exception_sym
;
11488 /* The name of the symbol to break on in order to insert
11489 a catchpoint on unhandled exceptions. */
11490 const char *catch_exception_unhandled_sym
;
11492 /* The name of the symbol to break on in order to insert
11493 a catchpoint on failed assertions. */
11494 const char *catch_assert_sym
;
11496 /* Assuming that the inferior just triggered an unhandled exception
11497 catchpoint, this function is responsible for returning the address
11498 in inferior memory where the name of that exception is stored.
11499 Return zero if the address could not be computed. */
11500 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11503 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11504 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11506 /* The following exception support info structure describes how to
11507 implement exception catchpoints with the latest version of the
11508 Ada runtime (as of 2007-03-06). */
11510 static const struct exception_support_info default_exception_support_info
=
11512 "__gnat_debug_raise_exception", /* catch_exception_sym */
11513 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11514 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11515 ada_unhandled_exception_name_addr
11518 /* The following exception support info structure describes how to
11519 implement exception catchpoints with a slightly older version
11520 of the Ada runtime. */
11522 static const struct exception_support_info exception_support_info_fallback
=
11524 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11525 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11526 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11527 ada_unhandled_exception_name_addr_from_raise
11530 /* Return nonzero if we can detect the exception support routines
11531 described in EINFO.
11533 This function errors out if an abnormal situation is detected
11534 (for instance, if we find the exception support routines, but
11535 that support is found to be incomplete). */
11538 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11540 struct symbol
*sym
;
11542 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11543 that should be compiled with debugging information. As a result, we
11544 expect to find that symbol in the symtabs. */
11546 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11549 /* Perhaps we did not find our symbol because the Ada runtime was
11550 compiled without debugging info, or simply stripped of it.
11551 It happens on some GNU/Linux distributions for instance, where
11552 users have to install a separate debug package in order to get
11553 the runtime's debugging info. In that situation, let the user
11554 know why we cannot insert an Ada exception catchpoint.
11556 Note: Just for the purpose of inserting our Ada exception
11557 catchpoint, we could rely purely on the associated minimal symbol.
11558 But we would be operating in degraded mode anyway, since we are
11559 still lacking the debugging info needed later on to extract
11560 the name of the exception being raised (this name is printed in
11561 the catchpoint message, and is also used when trying to catch
11562 a specific exception). We do not handle this case for now. */
11563 struct bound_minimal_symbol msym
11564 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11566 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11567 error (_("Your Ada runtime appears to be missing some debugging "
11568 "information.\nCannot insert Ada exception catchpoint "
11569 "in this configuration."));
11574 /* Make sure that the symbol we found corresponds to a function. */
11576 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11577 error (_("Symbol \"%s\" is not a function (class = %d)"),
11578 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11583 /* Inspect the Ada runtime and determine which exception info structure
11584 should be used to provide support for exception catchpoints.
11586 This function will always set the per-inferior exception_info,
11587 or raise an error. */
11590 ada_exception_support_info_sniffer (void)
11592 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11594 /* If the exception info is already known, then no need to recompute it. */
11595 if (data
->exception_info
!= NULL
)
11598 /* Check the latest (default) exception support info. */
11599 if (ada_has_this_exception_support (&default_exception_support_info
))
11601 data
->exception_info
= &default_exception_support_info
;
11605 /* Try our fallback exception suport info. */
11606 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11608 data
->exception_info
= &exception_support_info_fallback
;
11612 /* Sometimes, it is normal for us to not be able to find the routine
11613 we are looking for. This happens when the program is linked with
11614 the shared version of the GNAT runtime, and the program has not been
11615 started yet. Inform the user of these two possible causes if
11618 if (ada_update_initial_language (language_unknown
) != language_ada
)
11619 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11621 /* If the symbol does not exist, then check that the program is
11622 already started, to make sure that shared libraries have been
11623 loaded. If it is not started, this may mean that the symbol is
11624 in a shared library. */
11626 if (ptid_get_pid (inferior_ptid
) == 0)
11627 error (_("Unable to insert catchpoint. Try to start the program first."));
11629 /* At this point, we know that we are debugging an Ada program and
11630 that the inferior has been started, but we still are not able to
11631 find the run-time symbols. That can mean that we are in
11632 configurable run time mode, or that a-except as been optimized
11633 out by the linker... In any case, at this point it is not worth
11634 supporting this feature. */
11636 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11639 /* True iff FRAME is very likely to be that of a function that is
11640 part of the runtime system. This is all very heuristic, but is
11641 intended to be used as advice as to what frames are uninteresting
11645 is_known_support_routine (struct frame_info
*frame
)
11647 struct symtab_and_line sal
;
11649 enum language func_lang
;
11651 const char *fullname
;
11653 /* If this code does not have any debugging information (no symtab),
11654 This cannot be any user code. */
11656 find_frame_sal (frame
, &sal
);
11657 if (sal
.symtab
== NULL
)
11660 /* If there is a symtab, but the associated source file cannot be
11661 located, then assume this is not user code: Selecting a frame
11662 for which we cannot display the code would not be very helpful
11663 for the user. This should also take care of case such as VxWorks
11664 where the kernel has some debugging info provided for a few units. */
11666 fullname
= symtab_to_fullname (sal
.symtab
);
11667 if (access (fullname
, R_OK
) != 0)
11670 /* Check the unit filename againt the Ada runtime file naming.
11671 We also check the name of the objfile against the name of some
11672 known system libraries that sometimes come with debugging info
11675 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11677 re_comp (known_runtime_file_name_patterns
[i
]);
11678 if (re_exec (lbasename (sal
.symtab
->filename
)))
11680 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11681 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11685 /* Check whether the function is a GNAT-generated entity. */
11687 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
11688 if (func_name
== NULL
)
11691 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11693 re_comp (known_auxiliary_function_name_patterns
[i
]);
11694 if (re_exec (func_name
))
11705 /* Find the first frame that contains debugging information and that is not
11706 part of the Ada run-time, starting from FI and moving upward. */
11709 ada_find_printable_frame (struct frame_info
*fi
)
11711 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11713 if (!is_known_support_routine (fi
))
11722 /* Assuming that the inferior just triggered an unhandled exception
11723 catchpoint, return the address in inferior memory where the name
11724 of the exception is stored.
11726 Return zero if the address could not be computed. */
11729 ada_unhandled_exception_name_addr (void)
11731 return parse_and_eval_address ("e.full_name");
11734 /* Same as ada_unhandled_exception_name_addr, except that this function
11735 should be used when the inferior uses an older version of the runtime,
11736 where the exception name needs to be extracted from a specific frame
11737 several frames up in the callstack. */
11740 ada_unhandled_exception_name_addr_from_raise (void)
11743 struct frame_info
*fi
;
11744 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11745 struct cleanup
*old_chain
;
11747 /* To determine the name of this exception, we need to select
11748 the frame corresponding to RAISE_SYM_NAME. This frame is
11749 at least 3 levels up, so we simply skip the first 3 frames
11750 without checking the name of their associated function. */
11751 fi
= get_current_frame ();
11752 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11754 fi
= get_prev_frame (fi
);
11756 old_chain
= make_cleanup (null_cleanup
, NULL
);
11760 enum language func_lang
;
11762 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
11763 if (func_name
!= NULL
)
11765 make_cleanup (xfree
, func_name
);
11767 if (strcmp (func_name
,
11768 data
->exception_info
->catch_exception_sym
) == 0)
11769 break; /* We found the frame we were looking for... */
11770 fi
= get_prev_frame (fi
);
11773 do_cleanups (old_chain
);
11779 return parse_and_eval_address ("id.full_name");
11782 /* Assuming the inferior just triggered an Ada exception catchpoint
11783 (of any type), return the address in inferior memory where the name
11784 of the exception is stored, if applicable.
11786 Return zero if the address could not be computed, or if not relevant. */
11789 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11790 struct breakpoint
*b
)
11792 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11796 case ada_catch_exception
:
11797 return (parse_and_eval_address ("e.full_name"));
11800 case ada_catch_exception_unhandled
:
11801 return data
->exception_info
->unhandled_exception_name_addr ();
11804 case ada_catch_assert
:
11805 return 0; /* Exception name is not relevant in this case. */
11809 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11813 return 0; /* Should never be reached. */
11816 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11817 any error that ada_exception_name_addr_1 might cause to be thrown.
11818 When an error is intercepted, a warning with the error message is printed,
11819 and zero is returned. */
11822 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11823 struct breakpoint
*b
)
11825 CORE_ADDR result
= 0;
11829 result
= ada_exception_name_addr_1 (ex
, b
);
11832 CATCH (e
, RETURN_MASK_ERROR
)
11834 warning (_("failed to get exception name: %s"), e
.message
);
11842 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11844 /* Ada catchpoints.
11846 In the case of catchpoints on Ada exceptions, the catchpoint will
11847 stop the target on every exception the program throws. When a user
11848 specifies the name of a specific exception, we translate this
11849 request into a condition expression (in text form), and then parse
11850 it into an expression stored in each of the catchpoint's locations.
11851 We then use this condition to check whether the exception that was
11852 raised is the one the user is interested in. If not, then the
11853 target is resumed again. We store the name of the requested
11854 exception, in order to be able to re-set the condition expression
11855 when symbols change. */
11857 /* An instance of this type is used to represent an Ada catchpoint
11858 breakpoint location. It includes a "struct bp_location" as a kind
11859 of base class; users downcast to "struct bp_location *" when
11862 struct ada_catchpoint_location
11864 /* The base class. */
11865 struct bp_location base
;
11867 /* The condition that checks whether the exception that was raised
11868 is the specific exception the user specified on catchpoint
11870 struct expression
*excep_cond_expr
;
11873 /* Implement the DTOR method in the bp_location_ops structure for all
11874 Ada exception catchpoint kinds. */
11877 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11879 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11881 xfree (al
->excep_cond_expr
);
11884 /* The vtable to be used in Ada catchpoint locations. */
11886 static const struct bp_location_ops ada_catchpoint_location_ops
=
11888 ada_catchpoint_location_dtor
11891 /* An instance of this type is used to represent an Ada catchpoint.
11892 It includes a "struct breakpoint" as a kind of base class; users
11893 downcast to "struct breakpoint *" when needed. */
11895 struct ada_catchpoint
11897 /* The base class. */
11898 struct breakpoint base
;
11900 /* The name of the specific exception the user specified. */
11901 char *excep_string
;
11904 /* Parse the exception condition string in the context of each of the
11905 catchpoint's locations, and store them for later evaluation. */
11908 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11910 struct cleanup
*old_chain
;
11911 struct bp_location
*bl
;
11914 /* Nothing to do if there's no specific exception to catch. */
11915 if (c
->excep_string
== NULL
)
11918 /* Same if there are no locations... */
11919 if (c
->base
.loc
== NULL
)
11922 /* Compute the condition expression in text form, from the specific
11923 expection we want to catch. */
11924 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11925 old_chain
= make_cleanup (xfree
, cond_string
);
11927 /* Iterate over all the catchpoint's locations, and parse an
11928 expression for each. */
11929 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11931 struct ada_catchpoint_location
*ada_loc
11932 = (struct ada_catchpoint_location
*) bl
;
11933 struct expression
*exp
= NULL
;
11935 if (!bl
->shlib_disabled
)
11942 exp
= parse_exp_1 (&s
, bl
->address
,
11943 block_for_pc (bl
->address
), 0);
11945 CATCH (e
, RETURN_MASK_ERROR
)
11947 warning (_("failed to reevaluate internal exception condition "
11948 "for catchpoint %d: %s"),
11949 c
->base
.number
, e
.message
);
11950 /* There is a bug in GCC on sparc-solaris when building with
11951 optimization which causes EXP to change unexpectedly
11952 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
11953 The problem should be fixed starting with GCC 4.9.
11954 In the meantime, work around it by forcing EXP back
11961 ada_loc
->excep_cond_expr
= exp
;
11964 do_cleanups (old_chain
);
11967 /* Implement the DTOR method in the breakpoint_ops structure for all
11968 exception catchpoint kinds. */
11971 dtor_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11973 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11975 xfree (c
->excep_string
);
11977 bkpt_breakpoint_ops
.dtor (b
);
11980 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11981 structure for all exception catchpoint kinds. */
11983 static struct bp_location
*
11984 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
11985 struct breakpoint
*self
)
11987 struct ada_catchpoint_location
*loc
;
11989 loc
= XNEW (struct ada_catchpoint_location
);
11990 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
11991 loc
->excep_cond_expr
= NULL
;
11995 /* Implement the RE_SET method in the breakpoint_ops structure for all
11996 exception catchpoint kinds. */
11999 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
12001 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12003 /* Call the base class's method. This updates the catchpoint's
12005 bkpt_breakpoint_ops
.re_set (b
);
12007 /* Reparse the exception conditional expressions. One for each
12009 create_excep_cond_exprs (c
);
12012 /* Returns true if we should stop for this breakpoint hit. If the
12013 user specified a specific exception, we only want to cause a stop
12014 if the program thrown that exception. */
12017 should_stop_exception (const struct bp_location
*bl
)
12019 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12020 const struct ada_catchpoint_location
*ada_loc
12021 = (const struct ada_catchpoint_location
*) bl
;
12024 /* With no specific exception, should always stop. */
12025 if (c
->excep_string
== NULL
)
12028 if (ada_loc
->excep_cond_expr
== NULL
)
12030 /* We will have a NULL expression if back when we were creating
12031 the expressions, this location's had failed to parse. */
12038 struct value
*mark
;
12040 mark
= value_mark ();
12041 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
12042 value_free_to_mark (mark
);
12044 CATCH (ex
, RETURN_MASK_ALL
)
12046 exception_fprintf (gdb_stderr
, ex
,
12047 _("Error in testing exception condition:\n"));
12054 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12055 for all exception catchpoint kinds. */
12058 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12060 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12063 /* Implement the PRINT_IT method in the breakpoint_ops structure
12064 for all exception catchpoint kinds. */
12066 static enum print_stop_action
12067 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12069 struct ui_out
*uiout
= current_uiout
;
12070 struct breakpoint
*b
= bs
->breakpoint_at
;
12072 annotate_catchpoint (b
->number
);
12074 if (ui_out_is_mi_like_p (uiout
))
12076 ui_out_field_string (uiout
, "reason",
12077 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12078 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
12081 ui_out_text (uiout
,
12082 b
->disposition
== disp_del
? "\nTemporary catchpoint "
12083 : "\nCatchpoint ");
12084 ui_out_field_int (uiout
, "bkptno", b
->number
);
12085 ui_out_text (uiout
, ", ");
12089 case ada_catch_exception
:
12090 case ada_catch_exception_unhandled
:
12092 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
12093 char exception_name
[256];
12097 read_memory (addr
, (gdb_byte
*) exception_name
,
12098 sizeof (exception_name
) - 1);
12099 exception_name
[sizeof (exception_name
) - 1] = '\0';
12103 /* For some reason, we were unable to read the exception
12104 name. This could happen if the Runtime was compiled
12105 without debugging info, for instance. In that case,
12106 just replace the exception name by the generic string
12107 "exception" - it will read as "an exception" in the
12108 notification we are about to print. */
12109 memcpy (exception_name
, "exception", sizeof ("exception"));
12111 /* In the case of unhandled exception breakpoints, we print
12112 the exception name as "unhandled EXCEPTION_NAME", to make
12113 it clearer to the user which kind of catchpoint just got
12114 hit. We used ui_out_text to make sure that this extra
12115 info does not pollute the exception name in the MI case. */
12116 if (ex
== ada_catch_exception_unhandled
)
12117 ui_out_text (uiout
, "unhandled ");
12118 ui_out_field_string (uiout
, "exception-name", exception_name
);
12121 case ada_catch_assert
:
12122 /* In this case, the name of the exception is not really
12123 important. Just print "failed assertion" to make it clearer
12124 that his program just hit an assertion-failure catchpoint.
12125 We used ui_out_text because this info does not belong in
12127 ui_out_text (uiout
, "failed assertion");
12130 ui_out_text (uiout
, " at ");
12131 ada_find_printable_frame (get_current_frame ());
12133 return PRINT_SRC_AND_LOC
;
12136 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12137 for all exception catchpoint kinds. */
12140 print_one_exception (enum ada_exception_catchpoint_kind ex
,
12141 struct breakpoint
*b
, struct bp_location
**last_loc
)
12143 struct ui_out
*uiout
= current_uiout
;
12144 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12145 struct value_print_options opts
;
12147 get_user_print_options (&opts
);
12148 if (opts
.addressprint
)
12150 annotate_field (4);
12151 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
12154 annotate_field (5);
12155 *last_loc
= b
->loc
;
12158 case ada_catch_exception
:
12159 if (c
->excep_string
!= NULL
)
12161 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12163 ui_out_field_string (uiout
, "what", msg
);
12167 ui_out_field_string (uiout
, "what", "all Ada exceptions");
12171 case ada_catch_exception_unhandled
:
12172 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
12175 case ada_catch_assert
:
12176 ui_out_field_string (uiout
, "what", "failed Ada assertions");
12180 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12185 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12186 for all exception catchpoint kinds. */
12189 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12190 struct breakpoint
*b
)
12192 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12193 struct ui_out
*uiout
= current_uiout
;
12195 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
12196 : _("Catchpoint "));
12197 ui_out_field_int (uiout
, "bkptno", b
->number
);
12198 ui_out_text (uiout
, ": ");
12202 case ada_catch_exception
:
12203 if (c
->excep_string
!= NULL
)
12205 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12206 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12208 ui_out_text (uiout
, info
);
12209 do_cleanups (old_chain
);
12212 ui_out_text (uiout
, _("all Ada exceptions"));
12215 case ada_catch_exception_unhandled
:
12216 ui_out_text (uiout
, _("unhandled Ada exceptions"));
12219 case ada_catch_assert
:
12220 ui_out_text (uiout
, _("failed Ada assertions"));
12224 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12229 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12230 for all exception catchpoint kinds. */
12233 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12234 struct breakpoint
*b
, struct ui_file
*fp
)
12236 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12240 case ada_catch_exception
:
12241 fprintf_filtered (fp
, "catch exception");
12242 if (c
->excep_string
!= NULL
)
12243 fprintf_filtered (fp
, " %s", c
->excep_string
);
12246 case ada_catch_exception_unhandled
:
12247 fprintf_filtered (fp
, "catch exception unhandled");
12250 case ada_catch_assert
:
12251 fprintf_filtered (fp
, "catch assert");
12255 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12257 print_recreate_thread (b
, fp
);
12260 /* Virtual table for "catch exception" breakpoints. */
12263 dtor_catch_exception (struct breakpoint
*b
)
12265 dtor_exception (ada_catch_exception
, b
);
12268 static struct bp_location
*
12269 allocate_location_catch_exception (struct breakpoint
*self
)
12271 return allocate_location_exception (ada_catch_exception
, self
);
12275 re_set_catch_exception (struct breakpoint
*b
)
12277 re_set_exception (ada_catch_exception
, b
);
12281 check_status_catch_exception (bpstat bs
)
12283 check_status_exception (ada_catch_exception
, bs
);
12286 static enum print_stop_action
12287 print_it_catch_exception (bpstat bs
)
12289 return print_it_exception (ada_catch_exception
, bs
);
12293 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12295 print_one_exception (ada_catch_exception
, b
, last_loc
);
12299 print_mention_catch_exception (struct breakpoint
*b
)
12301 print_mention_exception (ada_catch_exception
, b
);
12305 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12307 print_recreate_exception (ada_catch_exception
, b
, fp
);
12310 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12312 /* Virtual table for "catch exception unhandled" breakpoints. */
12315 dtor_catch_exception_unhandled (struct breakpoint
*b
)
12317 dtor_exception (ada_catch_exception_unhandled
, b
);
12320 static struct bp_location
*
12321 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12323 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12327 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12329 re_set_exception (ada_catch_exception_unhandled
, b
);
12333 check_status_catch_exception_unhandled (bpstat bs
)
12335 check_status_exception (ada_catch_exception_unhandled
, bs
);
12338 static enum print_stop_action
12339 print_it_catch_exception_unhandled (bpstat bs
)
12341 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12345 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12346 struct bp_location
**last_loc
)
12348 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12352 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12354 print_mention_exception (ada_catch_exception_unhandled
, b
);
12358 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12359 struct ui_file
*fp
)
12361 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12364 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12366 /* Virtual table for "catch assert" breakpoints. */
12369 dtor_catch_assert (struct breakpoint
*b
)
12371 dtor_exception (ada_catch_assert
, b
);
12374 static struct bp_location
*
12375 allocate_location_catch_assert (struct breakpoint
*self
)
12377 return allocate_location_exception (ada_catch_assert
, self
);
12381 re_set_catch_assert (struct breakpoint
*b
)
12383 re_set_exception (ada_catch_assert
, b
);
12387 check_status_catch_assert (bpstat bs
)
12389 check_status_exception (ada_catch_assert
, bs
);
12392 static enum print_stop_action
12393 print_it_catch_assert (bpstat bs
)
12395 return print_it_exception (ada_catch_assert
, bs
);
12399 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12401 print_one_exception (ada_catch_assert
, b
, last_loc
);
12405 print_mention_catch_assert (struct breakpoint
*b
)
12407 print_mention_exception (ada_catch_assert
, b
);
12411 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12413 print_recreate_exception (ada_catch_assert
, b
, fp
);
12416 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12418 /* Return a newly allocated copy of the first space-separated token
12419 in ARGSP, and then adjust ARGSP to point immediately after that
12422 Return NULL if ARGPS does not contain any more tokens. */
12425 ada_get_next_arg (char **argsp
)
12427 char *args
= *argsp
;
12431 args
= skip_spaces (args
);
12432 if (args
[0] == '\0')
12433 return NULL
; /* No more arguments. */
12435 /* Find the end of the current argument. */
12437 end
= skip_to_space (args
);
12439 /* Adjust ARGSP to point to the start of the next argument. */
12443 /* Make a copy of the current argument and return it. */
12445 result
= xmalloc (end
- args
+ 1);
12446 strncpy (result
, args
, end
- args
);
12447 result
[end
- args
] = '\0';
12452 /* Split the arguments specified in a "catch exception" command.
12453 Set EX to the appropriate catchpoint type.
12454 Set EXCEP_STRING to the name of the specific exception if
12455 specified by the user.
12456 If a condition is found at the end of the arguments, the condition
12457 expression is stored in COND_STRING (memory must be deallocated
12458 after use). Otherwise COND_STRING is set to NULL. */
12461 catch_ada_exception_command_split (char *args
,
12462 enum ada_exception_catchpoint_kind
*ex
,
12463 char **excep_string
,
12464 char **cond_string
)
12466 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12467 char *exception_name
;
12470 exception_name
= ada_get_next_arg (&args
);
12471 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12473 /* This is not an exception name; this is the start of a condition
12474 expression for a catchpoint on all exceptions. So, "un-get"
12475 this token, and set exception_name to NULL. */
12476 xfree (exception_name
);
12477 exception_name
= NULL
;
12480 make_cleanup (xfree
, exception_name
);
12482 /* Check to see if we have a condition. */
12484 args
= skip_spaces (args
);
12485 if (startswith (args
, "if")
12486 && (isspace (args
[2]) || args
[2] == '\0'))
12489 args
= skip_spaces (args
);
12491 if (args
[0] == '\0')
12492 error (_("Condition missing after `if' keyword"));
12493 cond
= xstrdup (args
);
12494 make_cleanup (xfree
, cond
);
12496 args
+= strlen (args
);
12499 /* Check that we do not have any more arguments. Anything else
12502 if (args
[0] != '\0')
12503 error (_("Junk at end of expression"));
12505 discard_cleanups (old_chain
);
12507 if (exception_name
== NULL
)
12509 /* Catch all exceptions. */
12510 *ex
= ada_catch_exception
;
12511 *excep_string
= NULL
;
12513 else if (strcmp (exception_name
, "unhandled") == 0)
12515 /* Catch unhandled exceptions. */
12516 *ex
= ada_catch_exception_unhandled
;
12517 *excep_string
= NULL
;
12521 /* Catch a specific exception. */
12522 *ex
= ada_catch_exception
;
12523 *excep_string
= exception_name
;
12525 *cond_string
= cond
;
12528 /* Return the name of the symbol on which we should break in order to
12529 implement a catchpoint of the EX kind. */
12531 static const char *
12532 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12534 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12536 gdb_assert (data
->exception_info
!= NULL
);
12540 case ada_catch_exception
:
12541 return (data
->exception_info
->catch_exception_sym
);
12543 case ada_catch_exception_unhandled
:
12544 return (data
->exception_info
->catch_exception_unhandled_sym
);
12546 case ada_catch_assert
:
12547 return (data
->exception_info
->catch_assert_sym
);
12550 internal_error (__FILE__
, __LINE__
,
12551 _("unexpected catchpoint kind (%d)"), ex
);
12555 /* Return the breakpoint ops "virtual table" used for catchpoints
12558 static const struct breakpoint_ops
*
12559 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12563 case ada_catch_exception
:
12564 return (&catch_exception_breakpoint_ops
);
12566 case ada_catch_exception_unhandled
:
12567 return (&catch_exception_unhandled_breakpoint_ops
);
12569 case ada_catch_assert
:
12570 return (&catch_assert_breakpoint_ops
);
12573 internal_error (__FILE__
, __LINE__
,
12574 _("unexpected catchpoint kind (%d)"), ex
);
12578 /* Return the condition that will be used to match the current exception
12579 being raised with the exception that the user wants to catch. This
12580 assumes that this condition is used when the inferior just triggered
12581 an exception catchpoint.
12583 The string returned is a newly allocated string that needs to be
12584 deallocated later. */
12587 ada_exception_catchpoint_cond_string (const char *excep_string
)
12591 /* The standard exceptions are a special case. They are defined in
12592 runtime units that have been compiled without debugging info; if
12593 EXCEP_STRING is the not-fully-qualified name of a standard
12594 exception (e.g. "constraint_error") then, during the evaluation
12595 of the condition expression, the symbol lookup on this name would
12596 *not* return this standard exception. The catchpoint condition
12597 may then be set only on user-defined exceptions which have the
12598 same not-fully-qualified name (e.g. my_package.constraint_error).
12600 To avoid this unexcepted behavior, these standard exceptions are
12601 systematically prefixed by "standard". This means that "catch
12602 exception constraint_error" is rewritten into "catch exception
12603 standard.constraint_error".
12605 If an exception named contraint_error is defined in another package of
12606 the inferior program, then the only way to specify this exception as a
12607 breakpoint condition is to use its fully-qualified named:
12608 e.g. my_package.constraint_error. */
12610 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12612 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12614 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12618 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12621 /* Return the symtab_and_line that should be used to insert an exception
12622 catchpoint of the TYPE kind.
12624 EXCEP_STRING should contain the name of a specific exception that
12625 the catchpoint should catch, or NULL otherwise.
12627 ADDR_STRING returns the name of the function where the real
12628 breakpoint that implements the catchpoints is set, depending on the
12629 type of catchpoint we need to create. */
12631 static struct symtab_and_line
12632 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12633 char **addr_string
, const struct breakpoint_ops
**ops
)
12635 const char *sym_name
;
12636 struct symbol
*sym
;
12638 /* First, find out which exception support info to use. */
12639 ada_exception_support_info_sniffer ();
12641 /* Then lookup the function on which we will break in order to catch
12642 the Ada exceptions requested by the user. */
12643 sym_name
= ada_exception_sym_name (ex
);
12644 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12646 /* We can assume that SYM is not NULL at this stage. If the symbol
12647 did not exist, ada_exception_support_info_sniffer would have
12648 raised an exception.
12650 Also, ada_exception_support_info_sniffer should have already
12651 verified that SYM is a function symbol. */
12652 gdb_assert (sym
!= NULL
);
12653 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12655 /* Set ADDR_STRING. */
12656 *addr_string
= xstrdup (sym_name
);
12659 *ops
= ada_exception_breakpoint_ops (ex
);
12661 return find_function_start_sal (sym
, 1);
12664 /* Create an Ada exception catchpoint.
12666 EX_KIND is the kind of exception catchpoint to be created.
12668 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12669 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12670 of the exception to which this catchpoint applies. When not NULL,
12671 the string must be allocated on the heap, and its deallocation
12672 is no longer the responsibility of the caller.
12674 COND_STRING, if not NULL, is the catchpoint condition. This string
12675 must be allocated on the heap, and its deallocation is no longer
12676 the responsibility of the caller.
12678 TEMPFLAG, if nonzero, means that the underlying breakpoint
12679 should be temporary.
12681 FROM_TTY is the usual argument passed to all commands implementations. */
12684 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12685 enum ada_exception_catchpoint_kind ex_kind
,
12686 char *excep_string
,
12692 struct ada_catchpoint
*c
;
12693 char *addr_string
= NULL
;
12694 const struct breakpoint_ops
*ops
= NULL
;
12695 struct symtab_and_line sal
12696 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12698 c
= XNEW (struct ada_catchpoint
);
12699 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
12700 ops
, tempflag
, disabled
, from_tty
);
12701 c
->excep_string
= excep_string
;
12702 create_excep_cond_exprs (c
);
12703 if (cond_string
!= NULL
)
12704 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
12705 install_breakpoint (0, &c
->base
, 1);
12708 /* Implement the "catch exception" command. */
12711 catch_ada_exception_command (char *arg
, int from_tty
,
12712 struct cmd_list_element
*command
)
12714 struct gdbarch
*gdbarch
= get_current_arch ();
12716 enum ada_exception_catchpoint_kind ex_kind
;
12717 char *excep_string
= NULL
;
12718 char *cond_string
= NULL
;
12720 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12724 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12726 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12727 excep_string
, cond_string
,
12728 tempflag
, 1 /* enabled */,
12732 /* Split the arguments specified in a "catch assert" command.
12734 ARGS contains the command's arguments (or the empty string if
12735 no arguments were passed).
12737 If ARGS contains a condition, set COND_STRING to that condition
12738 (the memory needs to be deallocated after use). */
12741 catch_ada_assert_command_split (char *args
, char **cond_string
)
12743 args
= skip_spaces (args
);
12745 /* Check whether a condition was provided. */
12746 if (startswith (args
, "if")
12747 && (isspace (args
[2]) || args
[2] == '\0'))
12750 args
= skip_spaces (args
);
12751 if (args
[0] == '\0')
12752 error (_("condition missing after `if' keyword"));
12753 *cond_string
= xstrdup (args
);
12756 /* Otherwise, there should be no other argument at the end of
12758 else if (args
[0] != '\0')
12759 error (_("Junk at end of arguments."));
12762 /* Implement the "catch assert" command. */
12765 catch_assert_command (char *arg
, int from_tty
,
12766 struct cmd_list_element
*command
)
12768 struct gdbarch
*gdbarch
= get_current_arch ();
12770 char *cond_string
= NULL
;
12772 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12776 catch_ada_assert_command_split (arg
, &cond_string
);
12777 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12779 tempflag
, 1 /* enabled */,
12783 /* Return non-zero if the symbol SYM is an Ada exception object. */
12786 ada_is_exception_sym (struct symbol
*sym
)
12788 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
12790 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12791 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12792 && SYMBOL_CLASS (sym
) != LOC_CONST
12793 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12794 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12797 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12798 Ada exception object. This matches all exceptions except the ones
12799 defined by the Ada language. */
12802 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12806 if (!ada_is_exception_sym (sym
))
12809 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12810 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
12811 return 0; /* A standard exception. */
12813 /* Numeric_Error is also a standard exception, so exclude it.
12814 See the STANDARD_EXC description for more details as to why
12815 this exception is not listed in that array. */
12816 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
12822 /* A helper function for qsort, comparing two struct ada_exc_info
12825 The comparison is determined first by exception name, and then
12826 by exception address. */
12829 compare_ada_exception_info (const void *a
, const void *b
)
12831 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
12832 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
12835 result
= strcmp (exc_a
->name
, exc_b
->name
);
12839 if (exc_a
->addr
< exc_b
->addr
)
12841 if (exc_a
->addr
> exc_b
->addr
)
12847 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12848 routine, but keeping the first SKIP elements untouched.
12850 All duplicates are also removed. */
12853 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
12856 struct ada_exc_info
*to_sort
12857 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
12859 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
12862 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
12863 compare_ada_exception_info
);
12865 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
12866 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
12867 to_sort
[j
++] = to_sort
[i
];
12869 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
12872 /* A function intended as the "name_matcher" callback in the struct
12873 quick_symbol_functions' expand_symtabs_matching method.
12875 SEARCH_NAME is the symbol's search name.
12877 If USER_DATA is not NULL, it is a pointer to a regext_t object
12878 used to match the symbol (by natural name). Otherwise, when USER_DATA
12879 is null, no filtering is performed, and all symbols are a positive
12883 ada_exc_search_name_matches (const char *search_name
, void *user_data
)
12885 regex_t
*preg
= user_data
;
12890 /* In Ada, the symbol "search name" is a linkage name, whereas
12891 the regular expression used to do the matching refers to
12892 the natural name. So match against the decoded name. */
12893 return (regexec (preg
, ada_decode (search_name
), 0, NULL
, 0) == 0);
12896 /* Add all exceptions defined by the Ada standard whose name match
12897 a regular expression.
12899 If PREG is not NULL, then this regexp_t object is used to
12900 perform the symbol name matching. Otherwise, no name-based
12901 filtering is performed.
12903 EXCEPTIONS is a vector of exceptions to which matching exceptions
12907 ada_add_standard_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12911 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12914 || regexec (preg
, standard_exc
[i
], 0, NULL
, 0) == 0)
12916 struct bound_minimal_symbol msymbol
12917 = ada_lookup_simple_minsym (standard_exc
[i
]);
12919 if (msymbol
.minsym
!= NULL
)
12921 struct ada_exc_info info
12922 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12924 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12930 /* Add all Ada exceptions defined locally and accessible from the given
12933 If PREG is not NULL, then this regexp_t object is used to
12934 perform the symbol name matching. Otherwise, no name-based
12935 filtering is performed.
12937 EXCEPTIONS is a vector of exceptions to which matching exceptions
12941 ada_add_exceptions_from_frame (regex_t
*preg
, struct frame_info
*frame
,
12942 VEC(ada_exc_info
) **exceptions
)
12944 const struct block
*block
= get_frame_block (frame
, 0);
12948 struct block_iterator iter
;
12949 struct symbol
*sym
;
12951 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12953 switch (SYMBOL_CLASS (sym
))
12960 if (ada_is_exception_sym (sym
))
12962 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
12963 SYMBOL_VALUE_ADDRESS (sym
)};
12965 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12969 if (BLOCK_FUNCTION (block
) != NULL
)
12971 block
= BLOCK_SUPERBLOCK (block
);
12975 /* Add all exceptions defined globally whose name name match
12976 a regular expression, excluding standard exceptions.
12978 The reason we exclude standard exceptions is that they need
12979 to be handled separately: Standard exceptions are defined inside
12980 a runtime unit which is normally not compiled with debugging info,
12981 and thus usually do not show up in our symbol search. However,
12982 if the unit was in fact built with debugging info, we need to
12983 exclude them because they would duplicate the entry we found
12984 during the special loop that specifically searches for those
12985 standard exceptions.
12987 If PREG is not NULL, then this regexp_t object is used to
12988 perform the symbol name matching. Otherwise, no name-based
12989 filtering is performed.
12991 EXCEPTIONS is a vector of exceptions to which matching exceptions
12995 ada_add_global_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12997 struct objfile
*objfile
;
12998 struct compunit_symtab
*s
;
13000 expand_symtabs_matching (NULL
, ada_exc_search_name_matches
, NULL
,
13001 VARIABLES_DOMAIN
, preg
);
13003 ALL_COMPUNITS (objfile
, s
)
13005 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13008 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13010 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13011 struct block_iterator iter
;
13012 struct symbol
*sym
;
13014 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13015 if (ada_is_non_standard_exception_sym (sym
)
13017 || regexec (preg
, SYMBOL_NATURAL_NAME (sym
),
13020 struct ada_exc_info info
13021 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
13023 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13029 /* Implements ada_exceptions_list with the regular expression passed
13030 as a regex_t, rather than a string.
13032 If not NULL, PREG is used to filter out exceptions whose names
13033 do not match. Otherwise, all exceptions are listed. */
13035 static VEC(ada_exc_info
) *
13036 ada_exceptions_list_1 (regex_t
*preg
)
13038 VEC(ada_exc_info
) *result
= NULL
;
13039 struct cleanup
*old_chain
13040 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
13043 /* First, list the known standard exceptions. These exceptions
13044 need to be handled separately, as they are usually defined in
13045 runtime units that have been compiled without debugging info. */
13047 ada_add_standard_exceptions (preg
, &result
);
13049 /* Next, find all exceptions whose scope is local and accessible
13050 from the currently selected frame. */
13052 if (has_stack_frames ())
13054 prev_len
= VEC_length (ada_exc_info
, result
);
13055 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13057 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13058 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13061 /* Add all exceptions whose scope is global. */
13063 prev_len
= VEC_length (ada_exc_info
, result
);
13064 ada_add_global_exceptions (preg
, &result
);
13065 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13066 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13068 discard_cleanups (old_chain
);
13072 /* Return a vector of ada_exc_info.
13074 If REGEXP is NULL, all exceptions are included in the result.
13075 Otherwise, it should contain a valid regular expression,
13076 and only the exceptions whose names match that regular expression
13077 are included in the result.
13079 The exceptions are sorted in the following order:
13080 - Standard exceptions (defined by the Ada language), in
13081 alphabetical order;
13082 - Exceptions only visible from the current frame, in
13083 alphabetical order;
13084 - Exceptions whose scope is global, in alphabetical order. */
13086 VEC(ada_exc_info
) *
13087 ada_exceptions_list (const char *regexp
)
13089 VEC(ada_exc_info
) *result
= NULL
;
13090 struct cleanup
*old_chain
= NULL
;
13093 if (regexp
!= NULL
)
13094 old_chain
= compile_rx_or_error (®
, regexp
,
13095 _("invalid regular expression"));
13097 result
= ada_exceptions_list_1 (regexp
!= NULL
? ®
: NULL
);
13099 if (old_chain
!= NULL
)
13100 do_cleanups (old_chain
);
13104 /* Implement the "info exceptions" command. */
13107 info_exceptions_command (char *regexp
, int from_tty
)
13109 VEC(ada_exc_info
) *exceptions
;
13110 struct cleanup
*cleanup
;
13111 struct gdbarch
*gdbarch
= get_current_arch ();
13113 struct ada_exc_info
*info
;
13115 exceptions
= ada_exceptions_list (regexp
);
13116 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
13118 if (regexp
!= NULL
)
13120 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13122 printf_filtered (_("All defined Ada exceptions:\n"));
13124 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
13125 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
13127 do_cleanups (cleanup
);
13131 /* Information about operators given special treatment in functions
13133 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13135 #define ADA_OPERATORS \
13136 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13137 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13138 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13139 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13140 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13141 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13142 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13143 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13144 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13145 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13146 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13147 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13148 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13149 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13150 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13151 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13152 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13153 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13154 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13157 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13160 switch (exp
->elts
[pc
- 1].opcode
)
13163 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13166 #define OP_DEFN(op, len, args, binop) \
13167 case op: *oplenp = len; *argsp = args; break;
13173 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13178 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13183 /* Implementation of the exp_descriptor method operator_check. */
13186 ada_operator_check (struct expression
*exp
, int pos
,
13187 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13190 const union exp_element
*const elts
= exp
->elts
;
13191 struct type
*type
= NULL
;
13193 switch (elts
[pos
].opcode
)
13195 case UNOP_IN_RANGE
:
13197 type
= elts
[pos
+ 1].type
;
13201 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13204 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13206 if (type
&& TYPE_OBJFILE (type
)
13207 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13214 ada_op_name (enum exp_opcode opcode
)
13219 return op_name_standard (opcode
);
13221 #define OP_DEFN(op, len, args, binop) case op: return #op;
13226 return "OP_AGGREGATE";
13228 return "OP_CHOICES";
13234 /* As for operator_length, but assumes PC is pointing at the first
13235 element of the operator, and gives meaningful results only for the
13236 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13239 ada_forward_operator_length (struct expression
*exp
, int pc
,
13240 int *oplenp
, int *argsp
)
13242 switch (exp
->elts
[pc
].opcode
)
13245 *oplenp
= *argsp
= 0;
13248 #define OP_DEFN(op, len, args, binop) \
13249 case op: *oplenp = len; *argsp = args; break;
13255 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13260 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13266 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13268 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13276 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13278 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13283 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13287 /* Ada attributes ('Foo). */
13290 case OP_ATR_LENGTH
:
13294 case OP_ATR_MODULUS
:
13301 case UNOP_IN_RANGE
:
13303 /* XXX: gdb_sprint_host_address, type_sprint */
13304 fprintf_filtered (stream
, _("Type @"));
13305 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13306 fprintf_filtered (stream
, " (");
13307 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13308 fprintf_filtered (stream
, ")");
13310 case BINOP_IN_BOUNDS
:
13311 fprintf_filtered (stream
, " (%d)",
13312 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13314 case TERNOP_IN_RANGE
:
13319 case OP_DISCRETE_RANGE
:
13320 case OP_POSITIONAL
:
13327 char *name
= &exp
->elts
[elt
+ 2].string
;
13328 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13330 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13335 return dump_subexp_body_standard (exp
, stream
, elt
);
13339 for (i
= 0; i
< nargs
; i
+= 1)
13340 elt
= dump_subexp (exp
, stream
, elt
);
13345 /* The Ada extension of print_subexp (q.v.). */
13348 ada_print_subexp (struct expression
*exp
, int *pos
,
13349 struct ui_file
*stream
, enum precedence prec
)
13351 int oplen
, nargs
, i
;
13353 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13355 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13362 print_subexp_standard (exp
, pos
, stream
, prec
);
13366 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13369 case BINOP_IN_BOUNDS
:
13370 /* XXX: sprint_subexp */
13371 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13372 fputs_filtered (" in ", stream
);
13373 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13374 fputs_filtered ("'range", stream
);
13375 if (exp
->elts
[pc
+ 1].longconst
> 1)
13376 fprintf_filtered (stream
, "(%ld)",
13377 (long) exp
->elts
[pc
+ 1].longconst
);
13380 case TERNOP_IN_RANGE
:
13381 if (prec
>= PREC_EQUAL
)
13382 fputs_filtered ("(", stream
);
13383 /* XXX: sprint_subexp */
13384 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13385 fputs_filtered (" in ", stream
);
13386 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13387 fputs_filtered (" .. ", stream
);
13388 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13389 if (prec
>= PREC_EQUAL
)
13390 fputs_filtered (")", stream
);
13395 case OP_ATR_LENGTH
:
13399 case OP_ATR_MODULUS
:
13404 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13406 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13407 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13408 &type_print_raw_options
);
13412 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13413 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13418 for (tem
= 1; tem
< nargs
; tem
+= 1)
13420 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13421 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13423 fputs_filtered (")", stream
);
13428 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13429 fputs_filtered ("'(", stream
);
13430 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13431 fputs_filtered (")", stream
);
13434 case UNOP_IN_RANGE
:
13435 /* XXX: sprint_subexp */
13436 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13437 fputs_filtered (" in ", stream
);
13438 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13439 &type_print_raw_options
);
13442 case OP_DISCRETE_RANGE
:
13443 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13444 fputs_filtered ("..", stream
);
13445 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13449 fputs_filtered ("others => ", stream
);
13450 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13454 for (i
= 0; i
< nargs
-1; i
+= 1)
13457 fputs_filtered ("|", stream
);
13458 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13460 fputs_filtered (" => ", stream
);
13461 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13464 case OP_POSITIONAL
:
13465 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13469 fputs_filtered ("(", stream
);
13470 for (i
= 0; i
< nargs
; i
+= 1)
13473 fputs_filtered (", ", stream
);
13474 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13476 fputs_filtered (")", stream
);
13481 /* Table mapping opcodes into strings for printing operators
13482 and precedences of the operators. */
13484 static const struct op_print ada_op_print_tab
[] = {
13485 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13486 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13487 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13488 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13489 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13490 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13491 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13492 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13493 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13494 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13495 {">", BINOP_GTR
, PREC_ORDER
, 0},
13496 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13497 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13498 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13499 {"+", BINOP_ADD
, PREC_ADD
, 0},
13500 {"-", BINOP_SUB
, PREC_ADD
, 0},
13501 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13502 {"*", BINOP_MUL
, PREC_MUL
, 0},
13503 {"/", BINOP_DIV
, PREC_MUL
, 0},
13504 {"rem", BINOP_REM
, PREC_MUL
, 0},
13505 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13506 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13507 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13508 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13509 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13510 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13511 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13512 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13513 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13514 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13515 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13519 enum ada_primitive_types
{
13520 ada_primitive_type_int
,
13521 ada_primitive_type_long
,
13522 ada_primitive_type_short
,
13523 ada_primitive_type_char
,
13524 ada_primitive_type_float
,
13525 ada_primitive_type_double
,
13526 ada_primitive_type_void
,
13527 ada_primitive_type_long_long
,
13528 ada_primitive_type_long_double
,
13529 ada_primitive_type_natural
,
13530 ada_primitive_type_positive
,
13531 ada_primitive_type_system_address
,
13532 nr_ada_primitive_types
13536 ada_language_arch_info (struct gdbarch
*gdbarch
,
13537 struct language_arch_info
*lai
)
13539 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13541 lai
->primitive_type_vector
13542 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13545 lai
->primitive_type_vector
[ada_primitive_type_int
]
13546 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13548 lai
->primitive_type_vector
[ada_primitive_type_long
]
13549 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13550 0, "long_integer");
13551 lai
->primitive_type_vector
[ada_primitive_type_short
]
13552 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13553 0, "short_integer");
13554 lai
->string_char_type
13555 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13556 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13557 lai
->primitive_type_vector
[ada_primitive_type_float
]
13558 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13560 lai
->primitive_type_vector
[ada_primitive_type_double
]
13561 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13562 "long_float", NULL
);
13563 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13564 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13565 0, "long_long_integer");
13566 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13567 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13568 "long_long_float", NULL
);
13569 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13570 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13572 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13573 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13575 lai
->primitive_type_vector
[ada_primitive_type_void
]
13576 = builtin
->builtin_void
;
13578 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13579 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13580 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13581 = "system__address";
13583 lai
->bool_type_symbol
= NULL
;
13584 lai
->bool_type_default
= builtin
->builtin_bool
;
13587 /* Language vector */
13589 /* Not really used, but needed in the ada_language_defn. */
13592 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13594 ada_emit_char (c
, type
, stream
, quoter
, 1);
13598 parse (struct parser_state
*ps
)
13600 warnings_issued
= 0;
13601 return ada_parse (ps
);
13604 static const struct exp_descriptor ada_exp_descriptor
= {
13606 ada_operator_length
,
13607 ada_operator_check
,
13609 ada_dump_subexp_body
,
13610 ada_evaluate_subexp
13613 /* Implement the "la_get_symbol_name_cmp" language_defn method
13616 static symbol_name_cmp_ftype
13617 ada_get_symbol_name_cmp (const char *lookup_name
)
13619 if (should_use_wild_match (lookup_name
))
13622 return compare_names
;
13625 /* Implement the "la_read_var_value" language_defn method for Ada. */
13627 static struct value
*
13628 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
13630 const struct block
*frame_block
= NULL
;
13631 struct symbol
*renaming_sym
= NULL
;
13633 /* The only case where default_read_var_value is not sufficient
13634 is when VAR is a renaming... */
13636 frame_block
= get_frame_block (frame
, NULL
);
13638 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13639 if (renaming_sym
!= NULL
)
13640 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13642 /* This is a typical case where we expect the default_read_var_value
13643 function to work. */
13644 return default_read_var_value (var
, frame
);
13647 const struct language_defn ada_language_defn
= {
13648 "ada", /* Language name */
13652 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13653 that's not quite what this means. */
13655 macro_expansion_no
,
13656 &ada_exp_descriptor
,
13660 ada_printchar
, /* Print a character constant */
13661 ada_printstr
, /* Function to print string constant */
13662 emit_char
, /* Function to print single char (not used) */
13663 ada_print_type
, /* Print a type using appropriate syntax */
13664 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13665 ada_val_print
, /* Print a value using appropriate syntax */
13666 ada_value_print
, /* Print a top-level value */
13667 ada_read_var_value
, /* la_read_var_value */
13668 NULL
, /* Language specific skip_trampoline */
13669 NULL
, /* name_of_this */
13670 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13671 basic_lookup_transparent_type
, /* lookup_transparent_type */
13672 ada_la_decode
, /* Language specific symbol demangler */
13673 NULL
, /* Language specific
13674 class_name_from_physname */
13675 ada_op_print_tab
, /* expression operators for printing */
13676 0, /* c-style arrays */
13677 1, /* String lower bound */
13678 ada_get_gdb_completer_word_break_characters
,
13679 ada_make_symbol_completion_list
,
13680 ada_language_arch_info
,
13681 ada_print_array_index
,
13682 default_pass_by_reference
,
13684 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13685 ada_iterate_over_symbols
,
13692 /* Provide a prototype to silence -Wmissing-prototypes. */
13693 extern initialize_file_ftype _initialize_ada_language
;
13695 /* Command-list for the "set/show ada" prefix command. */
13696 static struct cmd_list_element
*set_ada_list
;
13697 static struct cmd_list_element
*show_ada_list
;
13699 /* Implement the "set ada" prefix command. */
13702 set_ada_command (char *arg
, int from_tty
)
13704 printf_unfiltered (_(\
13705 "\"set ada\" must be followed by the name of a setting.\n"));
13706 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
13709 /* Implement the "show ada" prefix command. */
13712 show_ada_command (char *args
, int from_tty
)
13714 cmd_show_list (show_ada_list
, from_tty
, "");
13718 initialize_ada_catchpoint_ops (void)
13720 struct breakpoint_ops
*ops
;
13722 initialize_breakpoint_ops ();
13724 ops
= &catch_exception_breakpoint_ops
;
13725 *ops
= bkpt_breakpoint_ops
;
13726 ops
->dtor
= dtor_catch_exception
;
13727 ops
->allocate_location
= allocate_location_catch_exception
;
13728 ops
->re_set
= re_set_catch_exception
;
13729 ops
->check_status
= check_status_catch_exception
;
13730 ops
->print_it
= print_it_catch_exception
;
13731 ops
->print_one
= print_one_catch_exception
;
13732 ops
->print_mention
= print_mention_catch_exception
;
13733 ops
->print_recreate
= print_recreate_catch_exception
;
13735 ops
= &catch_exception_unhandled_breakpoint_ops
;
13736 *ops
= bkpt_breakpoint_ops
;
13737 ops
->dtor
= dtor_catch_exception_unhandled
;
13738 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
13739 ops
->re_set
= re_set_catch_exception_unhandled
;
13740 ops
->check_status
= check_status_catch_exception_unhandled
;
13741 ops
->print_it
= print_it_catch_exception_unhandled
;
13742 ops
->print_one
= print_one_catch_exception_unhandled
;
13743 ops
->print_mention
= print_mention_catch_exception_unhandled
;
13744 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
13746 ops
= &catch_assert_breakpoint_ops
;
13747 *ops
= bkpt_breakpoint_ops
;
13748 ops
->dtor
= dtor_catch_assert
;
13749 ops
->allocate_location
= allocate_location_catch_assert
;
13750 ops
->re_set
= re_set_catch_assert
;
13751 ops
->check_status
= check_status_catch_assert
;
13752 ops
->print_it
= print_it_catch_assert
;
13753 ops
->print_one
= print_one_catch_assert
;
13754 ops
->print_mention
= print_mention_catch_assert
;
13755 ops
->print_recreate
= print_recreate_catch_assert
;
13758 /* This module's 'new_objfile' observer. */
13761 ada_new_objfile_observer (struct objfile
*objfile
)
13763 ada_clear_symbol_cache ();
13766 /* This module's 'free_objfile' observer. */
13769 ada_free_objfile_observer (struct objfile
*objfile
)
13771 ada_clear_symbol_cache ();
13775 _initialize_ada_language (void)
13777 add_language (&ada_language_defn
);
13779 initialize_ada_catchpoint_ops ();
13781 add_prefix_cmd ("ada", no_class
, set_ada_command
,
13782 _("Prefix command for changing Ada-specfic settings"),
13783 &set_ada_list
, "set ada ", 0, &setlist
);
13785 add_prefix_cmd ("ada", no_class
, show_ada_command
,
13786 _("Generic command for showing Ada-specific settings."),
13787 &show_ada_list
, "show ada ", 0, &showlist
);
13789 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
13790 &trust_pad_over_xvs
, _("\
13791 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13792 Show whether an optimization trusting PAD types over XVS types is activated"),
13794 This is related to the encoding used by the GNAT compiler. The debugger\n\
13795 should normally trust the contents of PAD types, but certain older versions\n\
13796 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13797 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13798 work around this bug. It is always safe to turn this option \"off\", but\n\
13799 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13800 this option to \"off\" unless necessary."),
13801 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13803 add_catch_command ("exception", _("\
13804 Catch Ada exceptions, when raised.\n\
13805 With an argument, catch only exceptions with the given name."),
13806 catch_ada_exception_command
,
13810 add_catch_command ("assert", _("\
13811 Catch failed Ada assertions, when raised.\n\
13812 With an argument, catch only exceptions with the given name."),
13813 catch_assert_command
,
13818 varsize_limit
= 65536;
13820 add_info ("exceptions", info_exceptions_command
,
13822 List all Ada exception names.\n\
13823 If a regular expression is passed as an argument, only those matching\n\
13824 the regular expression are listed."));
13826 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
13827 _("Set Ada maintenance-related variables."),
13828 &maint_set_ada_cmdlist
, "maintenance set ada ",
13829 0/*allow-unknown*/, &maintenance_set_cmdlist
);
13831 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
13832 _("Show Ada maintenance-related variables"),
13833 &maint_show_ada_cmdlist
, "maintenance show ada ",
13834 0/*allow-unknown*/, &maintenance_show_cmdlist
);
13836 add_setshow_boolean_cmd
13837 ("ignore-descriptive-types", class_maintenance
,
13838 &ada_ignore_descriptive_types_p
,
13839 _("Set whether descriptive types generated by GNAT should be ignored."),
13840 _("Show whether descriptive types generated by GNAT should be ignored."),
13842 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13843 DWARF attribute."),
13844 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
13846 obstack_init (&symbol_list_obstack
);
13848 decoded_names_store
= htab_create_alloc
13849 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
13850 NULL
, xcalloc
, xfree
);
13852 /* The ada-lang observers. */
13853 observer_attach_new_objfile (ada_new_objfile_observer
);
13854 observer_attach_free_objfile (ada_free_objfile_observer
);
13855 observer_attach_inferior_exit (ada_inferior_exit
);
13857 /* Setup various context-specific data. */
13859 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
13860 ada_pspace_data_handle
13861 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);