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 type
= ada_check_typedef (type
);
6404 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6408 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6410 return (name
!= NULL
6411 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6415 /* The type of the tag on VAL. */
6418 ada_tag_type (struct value
*val
)
6420 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6423 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6424 retired at Ada 05). */
6427 is_ada95_tag (struct value
*tag
)
6429 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6432 /* The value of the tag on VAL. */
6435 ada_value_tag (struct value
*val
)
6437 return ada_value_struct_elt (val
, "_tag", 0);
6440 /* The value of the tag on the object of type TYPE whose contents are
6441 saved at VALADDR, if it is non-null, or is at memory address
6444 static struct value
*
6445 value_tag_from_contents_and_address (struct type
*type
,
6446 const gdb_byte
*valaddr
,
6449 int tag_byte_offset
;
6450 struct type
*tag_type
;
6452 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6455 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6457 : valaddr
+ tag_byte_offset
);
6458 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6460 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6465 static struct type
*
6466 type_from_tag (struct value
*tag
)
6468 const char *type_name
= ada_tag_name (tag
);
6470 if (type_name
!= NULL
)
6471 return ada_find_any_type (ada_encode (type_name
));
6475 /* Given a value OBJ of a tagged type, return a value of this
6476 type at the base address of the object. The base address, as
6477 defined in Ada.Tags, it is the address of the primary tag of
6478 the object, and therefore where the field values of its full
6479 view can be fetched. */
6482 ada_tag_value_at_base_address (struct value
*obj
)
6485 LONGEST offset_to_top
= 0;
6486 struct type
*ptr_type
, *obj_type
;
6488 CORE_ADDR base_address
;
6490 obj_type
= value_type (obj
);
6492 /* It is the responsability of the caller to deref pointers. */
6494 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6495 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6498 tag
= ada_value_tag (obj
);
6502 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6504 if (is_ada95_tag (tag
))
6507 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6508 ptr_type
= lookup_pointer_type (ptr_type
);
6509 val
= value_cast (ptr_type
, tag
);
6513 /* It is perfectly possible that an exception be raised while
6514 trying to determine the base address, just like for the tag;
6515 see ada_tag_name for more details. We do not print the error
6516 message for the same reason. */
6520 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6523 CATCH (e
, RETURN_MASK_ERROR
)
6529 /* If offset is null, nothing to do. */
6531 if (offset_to_top
== 0)
6534 /* -1 is a special case in Ada.Tags; however, what should be done
6535 is not quite clear from the documentation. So do nothing for
6538 if (offset_to_top
== -1)
6541 base_address
= value_address (obj
) - offset_to_top
;
6542 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6544 /* Make sure that we have a proper tag at the new address.
6545 Otherwise, offset_to_top is bogus (which can happen when
6546 the object is not initialized yet). */
6551 obj_type
= type_from_tag (tag
);
6556 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6559 /* Return the "ada__tags__type_specific_data" type. */
6561 static struct type
*
6562 ada_get_tsd_type (struct inferior
*inf
)
6564 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6566 if (data
->tsd_type
== 0)
6567 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6568 return data
->tsd_type
;
6571 /* Return the TSD (type-specific data) associated to the given TAG.
6572 TAG is assumed to be the tag of a tagged-type entity.
6574 May return NULL if we are unable to get the TSD. */
6576 static struct value
*
6577 ada_get_tsd_from_tag (struct value
*tag
)
6582 /* First option: The TSD is simply stored as a field of our TAG.
6583 Only older versions of GNAT would use this format, but we have
6584 to test it first, because there are no visible markers for
6585 the current approach except the absence of that field. */
6587 val
= ada_value_struct_elt (tag
, "tsd", 1);
6591 /* Try the second representation for the dispatch table (in which
6592 there is no explicit 'tsd' field in the referent of the tag pointer,
6593 and instead the tsd pointer is stored just before the dispatch
6596 type
= ada_get_tsd_type (current_inferior());
6599 type
= lookup_pointer_type (lookup_pointer_type (type
));
6600 val
= value_cast (type
, tag
);
6603 return value_ind (value_ptradd (val
, -1));
6606 /* Given the TSD of a tag (type-specific data), return a string
6607 containing the name of the associated type.
6609 The returned value is good until the next call. May return NULL
6610 if we are unable to determine the tag name. */
6613 ada_tag_name_from_tsd (struct value
*tsd
)
6615 static char name
[1024];
6619 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6622 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6623 for (p
= name
; *p
!= '\0'; p
+= 1)
6629 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6632 Return NULL if the TAG is not an Ada tag, or if we were unable to
6633 determine the name of that tag. The result is good until the next
6637 ada_tag_name (struct value
*tag
)
6641 if (!ada_is_tag_type (value_type (tag
)))
6644 /* It is perfectly possible that an exception be raised while trying
6645 to determine the TAG's name, even under normal circumstances:
6646 The associated variable may be uninitialized or corrupted, for
6647 instance. We do not let any exception propagate past this point.
6648 instead we return NULL.
6650 We also do not print the error message either (which often is very
6651 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6652 the caller print a more meaningful message if necessary. */
6655 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6658 name
= ada_tag_name_from_tsd (tsd
);
6660 CATCH (e
, RETURN_MASK_ERROR
)
6668 /* The parent type of TYPE, or NULL if none. */
6671 ada_parent_type (struct type
*type
)
6675 type
= ada_check_typedef (type
);
6677 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6680 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6681 if (ada_is_parent_field (type
, i
))
6683 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6685 /* If the _parent field is a pointer, then dereference it. */
6686 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6687 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6688 /* If there is a parallel XVS type, get the actual base type. */
6689 parent_type
= ada_get_base_type (parent_type
);
6691 return ada_check_typedef (parent_type
);
6697 /* True iff field number FIELD_NUM of structure type TYPE contains the
6698 parent-type (inherited) fields of a derived type. Assumes TYPE is
6699 a structure type with at least FIELD_NUM+1 fields. */
6702 ada_is_parent_field (struct type
*type
, int field_num
)
6704 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6706 return (name
!= NULL
6707 && (startswith (name
, "PARENT")
6708 || startswith (name
, "_parent")));
6711 /* True iff field number FIELD_NUM of structure type TYPE is a
6712 transparent wrapper field (which should be silently traversed when doing
6713 field selection and flattened when printing). Assumes TYPE is a
6714 structure type with at least FIELD_NUM+1 fields. Such fields are always
6718 ada_is_wrapper_field (struct type
*type
, int field_num
)
6720 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6722 return (name
!= NULL
6723 && (startswith (name
, "PARENT")
6724 || strcmp (name
, "REP") == 0
6725 || startswith (name
, "_parent")
6726 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6729 /* True iff field number FIELD_NUM of structure or union type TYPE
6730 is a variant wrapper. Assumes TYPE is a structure type with at least
6731 FIELD_NUM+1 fields. */
6734 ada_is_variant_part (struct type
*type
, int field_num
)
6736 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6738 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6739 || (is_dynamic_field (type
, field_num
)
6740 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6741 == TYPE_CODE_UNION
)));
6744 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6745 whose discriminants are contained in the record type OUTER_TYPE,
6746 returns the type of the controlling discriminant for the variant.
6747 May return NULL if the type could not be found. */
6750 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6752 char *name
= ada_variant_discrim_name (var_type
);
6754 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6757 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6758 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6759 represents a 'when others' clause; otherwise 0. */
6762 ada_is_others_clause (struct type
*type
, int field_num
)
6764 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6766 return (name
!= NULL
&& name
[0] == 'O');
6769 /* Assuming that TYPE0 is the type of the variant part of a record,
6770 returns the name of the discriminant controlling the variant.
6771 The value is valid until the next call to ada_variant_discrim_name. */
6774 ada_variant_discrim_name (struct type
*type0
)
6776 static char *result
= NULL
;
6777 static size_t result_len
= 0;
6780 const char *discrim_end
;
6781 const char *discrim_start
;
6783 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6784 type
= TYPE_TARGET_TYPE (type0
);
6788 name
= ada_type_name (type
);
6790 if (name
== NULL
|| name
[0] == '\000')
6793 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6796 if (startswith (discrim_end
, "___XVN"))
6799 if (discrim_end
== name
)
6802 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6805 if (discrim_start
== name
+ 1)
6807 if ((discrim_start
> name
+ 3
6808 && startswith (discrim_start
- 3, "___"))
6809 || discrim_start
[-1] == '.')
6813 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6814 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6815 result
[discrim_end
- discrim_start
] = '\0';
6819 /* Scan STR for a subtype-encoded number, beginning at position K.
6820 Put the position of the character just past the number scanned in
6821 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6822 Return 1 if there was a valid number at the given position, and 0
6823 otherwise. A "subtype-encoded" number consists of the absolute value
6824 in decimal, followed by the letter 'm' to indicate a negative number.
6825 Assumes 0m does not occur. */
6828 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6832 if (!isdigit (str
[k
]))
6835 /* Do it the hard way so as not to make any assumption about
6836 the relationship of unsigned long (%lu scan format code) and
6839 while (isdigit (str
[k
]))
6841 RU
= RU
* 10 + (str
[k
] - '0');
6848 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6854 /* NOTE on the above: Technically, C does not say what the results of
6855 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6856 number representable as a LONGEST (although either would probably work
6857 in most implementations). When RU>0, the locution in the then branch
6858 above is always equivalent to the negative of RU. */
6865 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6866 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6867 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6870 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6872 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6886 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6896 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6897 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6899 if (val
>= L
&& val
<= U
)
6911 /* FIXME: Lots of redundancy below. Try to consolidate. */
6913 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6914 ARG_TYPE, extract and return the value of one of its (non-static)
6915 fields. FIELDNO says which field. Differs from value_primitive_field
6916 only in that it can handle packed values of arbitrary type. */
6918 static struct value
*
6919 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6920 struct type
*arg_type
)
6924 arg_type
= ada_check_typedef (arg_type
);
6925 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6927 /* Handle packed fields. */
6929 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6931 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6932 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6934 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6935 offset
+ bit_pos
/ 8,
6936 bit_pos
% 8, bit_size
, type
);
6939 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6942 /* Find field with name NAME in object of type TYPE. If found,
6943 set the following for each argument that is non-null:
6944 - *FIELD_TYPE_P to the field's type;
6945 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6946 an object of that type;
6947 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6948 - *BIT_SIZE_P to its size in bits if the field is packed, and
6950 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6951 fields up to but not including the desired field, or by the total
6952 number of fields if not found. A NULL value of NAME never
6953 matches; the function just counts visible fields in this case.
6955 Returns 1 if found, 0 otherwise. */
6958 find_struct_field (const char *name
, struct type
*type
, int offset
,
6959 struct type
**field_type_p
,
6960 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6965 type
= ada_check_typedef (type
);
6967 if (field_type_p
!= NULL
)
6968 *field_type_p
= NULL
;
6969 if (byte_offset_p
!= NULL
)
6971 if (bit_offset_p
!= NULL
)
6973 if (bit_size_p
!= NULL
)
6976 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6978 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6979 int fld_offset
= offset
+ bit_pos
/ 8;
6980 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6982 if (t_field_name
== NULL
)
6985 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6987 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6989 if (field_type_p
!= NULL
)
6990 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6991 if (byte_offset_p
!= NULL
)
6992 *byte_offset_p
= fld_offset
;
6993 if (bit_offset_p
!= NULL
)
6994 *bit_offset_p
= bit_pos
% 8;
6995 if (bit_size_p
!= NULL
)
6996 *bit_size_p
= bit_size
;
6999 else if (ada_is_wrapper_field (type
, i
))
7001 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7002 field_type_p
, byte_offset_p
, bit_offset_p
,
7003 bit_size_p
, index_p
))
7006 else if (ada_is_variant_part (type
, i
))
7008 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7011 struct type
*field_type
7012 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7014 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7016 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7018 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7019 field_type_p
, byte_offset_p
,
7020 bit_offset_p
, bit_size_p
, index_p
))
7024 else if (index_p
!= NULL
)
7030 /* Number of user-visible fields in record type TYPE. */
7033 num_visible_fields (struct type
*type
)
7038 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7042 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7043 and search in it assuming it has (class) type TYPE.
7044 If found, return value, else return NULL.
7046 Searches recursively through wrapper fields (e.g., '_parent'). */
7048 static struct value
*
7049 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
7054 type
= ada_check_typedef (type
);
7055 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7057 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7059 if (t_field_name
== NULL
)
7062 else if (field_name_match (t_field_name
, name
))
7063 return ada_value_primitive_field (arg
, offset
, i
, type
);
7065 else if (ada_is_wrapper_field (type
, i
))
7067 struct value
*v
= /* Do not let indent join lines here. */
7068 ada_search_struct_field (name
, arg
,
7069 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7070 TYPE_FIELD_TYPE (type
, i
));
7076 else if (ada_is_variant_part (type
, i
))
7078 /* PNH: Do we ever get here? See find_struct_field. */
7080 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7082 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7084 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7086 struct value
*v
= ada_search_struct_field
/* Force line
7089 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7090 TYPE_FIELD_TYPE (field_type
, j
));
7100 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7101 int, struct type
*);
7104 /* Return field #INDEX in ARG, where the index is that returned by
7105 * find_struct_field through its INDEX_P argument. Adjust the address
7106 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7107 * If found, return value, else return NULL. */
7109 static struct value
*
7110 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7113 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7117 /* Auxiliary function for ada_index_struct_field. Like
7118 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7121 static struct value
*
7122 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7126 type
= ada_check_typedef (type
);
7128 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7130 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7132 else if (ada_is_wrapper_field (type
, i
))
7134 struct value
*v
= /* Do not let indent join lines here. */
7135 ada_index_struct_field_1 (index_p
, arg
,
7136 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7137 TYPE_FIELD_TYPE (type
, i
));
7143 else if (ada_is_variant_part (type
, i
))
7145 /* PNH: Do we ever get here? See ada_search_struct_field,
7146 find_struct_field. */
7147 error (_("Cannot assign this kind of variant record"));
7149 else if (*index_p
== 0)
7150 return ada_value_primitive_field (arg
, offset
, i
, type
);
7157 /* Given ARG, a value of type (pointer or reference to a)*
7158 structure/union, extract the component named NAME from the ultimate
7159 target structure/union and return it as a value with its
7162 The routine searches for NAME among all members of the structure itself
7163 and (recursively) among all members of any wrapper members
7166 If NO_ERR, then simply return NULL in case of error, rather than
7170 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
7172 struct type
*t
, *t1
;
7176 t1
= t
= ada_check_typedef (value_type (arg
));
7177 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7179 t1
= TYPE_TARGET_TYPE (t
);
7182 t1
= ada_check_typedef (t1
);
7183 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7185 arg
= coerce_ref (arg
);
7190 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7192 t1
= TYPE_TARGET_TYPE (t
);
7195 t1
= ada_check_typedef (t1
);
7196 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7198 arg
= value_ind (arg
);
7205 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7209 v
= ada_search_struct_field (name
, arg
, 0, t
);
7212 int bit_offset
, bit_size
, byte_offset
;
7213 struct type
*field_type
;
7216 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7217 address
= value_address (ada_value_ind (arg
));
7219 address
= value_address (ada_coerce_ref (arg
));
7221 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7222 if (find_struct_field (name
, t1
, 0,
7223 &field_type
, &byte_offset
, &bit_offset
,
7228 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7229 arg
= ada_coerce_ref (arg
);
7231 arg
= ada_value_ind (arg
);
7232 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7233 bit_offset
, bit_size
,
7237 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7241 if (v
!= NULL
|| no_err
)
7244 error (_("There is no member named %s."), name
);
7250 error (_("Attempt to extract a component of "
7251 "a value that is not a record."));
7254 /* Given a type TYPE, look up the type of the component of type named NAME.
7255 If DISPP is non-null, add its byte displacement from the beginning of a
7256 structure (pointed to by a value) of type TYPE to *DISPP (does not
7257 work for packed fields).
7259 Matches any field whose name has NAME as a prefix, possibly
7262 TYPE can be either a struct or union. If REFOK, TYPE may also
7263 be a (pointer or reference)+ to a struct or union, and the
7264 ultimate target type will be searched.
7266 Looks recursively into variant clauses and parent types.
7268 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7269 TYPE is not a type of the right kind. */
7271 static struct type
*
7272 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7273 int noerr
, int *dispp
)
7280 if (refok
&& type
!= NULL
)
7283 type
= ada_check_typedef (type
);
7284 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7285 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7287 type
= TYPE_TARGET_TYPE (type
);
7291 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7292 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7298 target_terminal_ours ();
7299 gdb_flush (gdb_stdout
);
7301 error (_("Type (null) is not a structure or union type"));
7304 /* XXX: type_sprint */
7305 fprintf_unfiltered (gdb_stderr
, _("Type "));
7306 type_print (type
, "", gdb_stderr
, -1);
7307 error (_(" is not a structure or union type"));
7312 type
= to_static_fixed_type (type
);
7314 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7316 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7320 if (t_field_name
== NULL
)
7323 else if (field_name_match (t_field_name
, name
))
7326 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7327 return TYPE_FIELD_TYPE (type
, i
);
7330 else if (ada_is_wrapper_field (type
, i
))
7333 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7338 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7343 else if (ada_is_variant_part (type
, i
))
7346 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7349 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7351 /* FIXME pnh 2008/01/26: We check for a field that is
7352 NOT wrapped in a struct, since the compiler sometimes
7353 generates these for unchecked variant types. Revisit
7354 if the compiler changes this practice. */
7355 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7357 if (v_field_name
!= NULL
7358 && field_name_match (v_field_name
, name
))
7359 t
= TYPE_FIELD_TYPE (field_type
, j
);
7361 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7368 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7379 target_terminal_ours ();
7380 gdb_flush (gdb_stdout
);
7383 /* XXX: type_sprint */
7384 fprintf_unfiltered (gdb_stderr
, _("Type "));
7385 type_print (type
, "", gdb_stderr
, -1);
7386 error (_(" has no component named <null>"));
7390 /* XXX: type_sprint */
7391 fprintf_unfiltered (gdb_stderr
, _("Type "));
7392 type_print (type
, "", gdb_stderr
, -1);
7393 error (_(" has no component named %s"), name
);
7400 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7401 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7402 represents an unchecked union (that is, the variant part of a
7403 record that is named in an Unchecked_Union pragma). */
7406 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7408 char *discrim_name
= ada_variant_discrim_name (var_type
);
7410 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
7415 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7416 within a value of type OUTER_TYPE that is stored in GDB at
7417 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7418 numbering from 0) is applicable. Returns -1 if none are. */
7421 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7422 const gdb_byte
*outer_valaddr
)
7426 char *discrim_name
= ada_variant_discrim_name (var_type
);
7427 struct value
*outer
;
7428 struct value
*discrim
;
7429 LONGEST discrim_val
;
7431 /* Using plain value_from_contents_and_address here causes problems
7432 because we will end up trying to resolve a type that is currently
7433 being constructed. */
7434 outer
= value_from_contents_and_address_unresolved (outer_type
,
7436 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7437 if (discrim
== NULL
)
7439 discrim_val
= value_as_long (discrim
);
7442 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7444 if (ada_is_others_clause (var_type
, i
))
7446 else if (ada_in_variant (discrim_val
, var_type
, i
))
7450 return others_clause
;
7455 /* Dynamic-Sized Records */
7457 /* Strategy: The type ostensibly attached to a value with dynamic size
7458 (i.e., a size that is not statically recorded in the debugging
7459 data) does not accurately reflect the size or layout of the value.
7460 Our strategy is to convert these values to values with accurate,
7461 conventional types that are constructed on the fly. */
7463 /* There is a subtle and tricky problem here. In general, we cannot
7464 determine the size of dynamic records without its data. However,
7465 the 'struct value' data structure, which GDB uses to represent
7466 quantities in the inferior process (the target), requires the size
7467 of the type at the time of its allocation in order to reserve space
7468 for GDB's internal copy of the data. That's why the
7469 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7470 rather than struct value*s.
7472 However, GDB's internal history variables ($1, $2, etc.) are
7473 struct value*s containing internal copies of the data that are not, in
7474 general, the same as the data at their corresponding addresses in
7475 the target. Fortunately, the types we give to these values are all
7476 conventional, fixed-size types (as per the strategy described
7477 above), so that we don't usually have to perform the
7478 'to_fixed_xxx_type' conversions to look at their values.
7479 Unfortunately, there is one exception: if one of the internal
7480 history variables is an array whose elements are unconstrained
7481 records, then we will need to create distinct fixed types for each
7482 element selected. */
7484 /* The upshot of all of this is that many routines take a (type, host
7485 address, target address) triple as arguments to represent a value.
7486 The host address, if non-null, is supposed to contain an internal
7487 copy of the relevant data; otherwise, the program is to consult the
7488 target at the target address. */
7490 /* Assuming that VAL0 represents a pointer value, the result of
7491 dereferencing it. Differs from value_ind in its treatment of
7492 dynamic-sized types. */
7495 ada_value_ind (struct value
*val0
)
7497 struct value
*val
= value_ind (val0
);
7499 if (ada_is_tagged_type (value_type (val
), 0))
7500 val
= ada_tag_value_at_base_address (val
);
7502 return ada_to_fixed_value (val
);
7505 /* The value resulting from dereferencing any "reference to"
7506 qualifiers on VAL0. */
7508 static struct value
*
7509 ada_coerce_ref (struct value
*val0
)
7511 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7513 struct value
*val
= val0
;
7515 val
= coerce_ref (val
);
7517 if (ada_is_tagged_type (value_type (val
), 0))
7518 val
= ada_tag_value_at_base_address (val
);
7520 return ada_to_fixed_value (val
);
7526 /* Return OFF rounded upward if necessary to a multiple of
7527 ALIGNMENT (a power of 2). */
7530 align_value (unsigned int off
, unsigned int alignment
)
7532 return (off
+ alignment
- 1) & ~(alignment
- 1);
7535 /* Return the bit alignment required for field #F of template type TYPE. */
7538 field_alignment (struct type
*type
, int f
)
7540 const char *name
= TYPE_FIELD_NAME (type
, f
);
7544 /* The field name should never be null, unless the debugging information
7545 is somehow malformed. In this case, we assume the field does not
7546 require any alignment. */
7550 len
= strlen (name
);
7552 if (!isdigit (name
[len
- 1]))
7555 if (isdigit (name
[len
- 2]))
7556 align_offset
= len
- 2;
7558 align_offset
= len
- 1;
7560 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7561 return TARGET_CHAR_BIT
;
7563 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7566 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7568 static struct symbol
*
7569 ada_find_any_type_symbol (const char *name
)
7573 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7574 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7577 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7581 /* Find a type named NAME. Ignores ambiguity. This routine will look
7582 solely for types defined by debug info, it will not search the GDB
7585 static struct type
*
7586 ada_find_any_type (const char *name
)
7588 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7591 return SYMBOL_TYPE (sym
);
7596 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7597 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7598 symbol, in which case it is returned. Otherwise, this looks for
7599 symbols whose name is that of NAME_SYM suffixed with "___XR".
7600 Return symbol if found, and NULL otherwise. */
7603 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7605 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7608 if (strstr (name
, "___XR") != NULL
)
7611 sym
= find_old_style_renaming_symbol (name
, block
);
7616 /* Not right yet. FIXME pnh 7/20/2007. */
7617 sym
= ada_find_any_type_symbol (name
);
7618 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7624 static struct symbol
*
7625 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7627 const struct symbol
*function_sym
= block_linkage_function (block
);
7630 if (function_sym
!= NULL
)
7632 /* If the symbol is defined inside a function, NAME is not fully
7633 qualified. This means we need to prepend the function name
7634 as well as adding the ``___XR'' suffix to build the name of
7635 the associated renaming symbol. */
7636 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7637 /* Function names sometimes contain suffixes used
7638 for instance to qualify nested subprograms. When building
7639 the XR type name, we need to make sure that this suffix is
7640 not included. So do not include any suffix in the function
7641 name length below. */
7642 int function_name_len
= ada_name_prefix_len (function_name
);
7643 const int rename_len
= function_name_len
+ 2 /* "__" */
7644 + strlen (name
) + 6 /* "___XR\0" */ ;
7646 /* Strip the suffix if necessary. */
7647 ada_remove_trailing_digits (function_name
, &function_name_len
);
7648 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7649 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7651 /* Library-level functions are a special case, as GNAT adds
7652 a ``_ada_'' prefix to the function name to avoid namespace
7653 pollution. However, the renaming symbols themselves do not
7654 have this prefix, so we need to skip this prefix if present. */
7655 if (function_name_len
> 5 /* "_ada_" */
7656 && strstr (function_name
, "_ada_") == function_name
)
7659 function_name_len
-= 5;
7662 rename
= (char *) alloca (rename_len
* sizeof (char));
7663 strncpy (rename
, function_name
, function_name_len
);
7664 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7669 const int rename_len
= strlen (name
) + 6;
7671 rename
= (char *) alloca (rename_len
* sizeof (char));
7672 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7675 return ada_find_any_type_symbol (rename
);
7678 /* Because of GNAT encoding conventions, several GDB symbols may match a
7679 given type name. If the type denoted by TYPE0 is to be preferred to
7680 that of TYPE1 for purposes of type printing, return non-zero;
7681 otherwise return 0. */
7684 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7688 else if (type0
== NULL
)
7690 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7692 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7694 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7696 else if (ada_is_constrained_packed_array_type (type0
))
7698 else if (ada_is_array_descriptor_type (type0
)
7699 && !ada_is_array_descriptor_type (type1
))
7703 const char *type0_name
= type_name_no_tag (type0
);
7704 const char *type1_name
= type_name_no_tag (type1
);
7706 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7707 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7713 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7714 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7717 ada_type_name (struct type
*type
)
7721 else if (TYPE_NAME (type
) != NULL
)
7722 return TYPE_NAME (type
);
7724 return TYPE_TAG_NAME (type
);
7727 /* Search the list of "descriptive" types associated to TYPE for a type
7728 whose name is NAME. */
7730 static struct type
*
7731 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7733 struct type
*result
;
7735 if (ada_ignore_descriptive_types_p
)
7738 /* If there no descriptive-type info, then there is no parallel type
7740 if (!HAVE_GNAT_AUX_INFO (type
))
7743 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7744 while (result
!= NULL
)
7746 const char *result_name
= ada_type_name (result
);
7748 if (result_name
== NULL
)
7750 warning (_("unexpected null name on descriptive type"));
7754 /* If the names match, stop. */
7755 if (strcmp (result_name
, name
) == 0)
7758 /* Otherwise, look at the next item on the list, if any. */
7759 if (HAVE_GNAT_AUX_INFO (result
))
7760 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7765 /* If we didn't find a match, see whether this is a packed array. With
7766 older compilers, the descriptive type information is either absent or
7767 irrelevant when it comes to packed arrays so the above lookup fails.
7768 Fall back to using a parallel lookup by name in this case. */
7769 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7770 return ada_find_any_type (name
);
7775 /* Find a parallel type to TYPE with the specified NAME, using the
7776 descriptive type taken from the debugging information, if available,
7777 and otherwise using the (slower) name-based method. */
7779 static struct type
*
7780 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7782 struct type
*result
= NULL
;
7784 if (HAVE_GNAT_AUX_INFO (type
))
7785 result
= find_parallel_type_by_descriptive_type (type
, name
);
7787 result
= ada_find_any_type (name
);
7792 /* Same as above, but specify the name of the parallel type by appending
7793 SUFFIX to the name of TYPE. */
7796 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7799 const char *type_name
= ada_type_name (type
);
7802 if (type_name
== NULL
)
7805 len
= strlen (type_name
);
7807 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7809 strcpy (name
, type_name
);
7810 strcpy (name
+ len
, suffix
);
7812 return ada_find_parallel_type_with_name (type
, name
);
7815 /* If TYPE is a variable-size record type, return the corresponding template
7816 type describing its fields. Otherwise, return NULL. */
7818 static struct type
*
7819 dynamic_template_type (struct type
*type
)
7821 type
= ada_check_typedef (type
);
7823 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7824 || ada_type_name (type
) == NULL
)
7828 int len
= strlen (ada_type_name (type
));
7830 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7833 return ada_find_parallel_type (type
, "___XVE");
7837 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7838 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7841 is_dynamic_field (struct type
*templ_type
, int field_num
)
7843 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7846 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7847 && strstr (name
, "___XVL") != NULL
;
7850 /* The index of the variant field of TYPE, or -1 if TYPE does not
7851 represent a variant record type. */
7854 variant_field_index (struct type
*type
)
7858 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7861 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7863 if (ada_is_variant_part (type
, f
))
7869 /* A record type with no fields. */
7871 static struct type
*
7872 empty_record (struct type
*templ
)
7874 struct type
*type
= alloc_type_copy (templ
);
7876 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7877 TYPE_NFIELDS (type
) = 0;
7878 TYPE_FIELDS (type
) = NULL
;
7879 INIT_CPLUS_SPECIFIC (type
);
7880 TYPE_NAME (type
) = "<empty>";
7881 TYPE_TAG_NAME (type
) = NULL
;
7882 TYPE_LENGTH (type
) = 0;
7886 /* An ordinary record type (with fixed-length fields) that describes
7887 the value of type TYPE at VALADDR or ADDRESS (see comments at
7888 the beginning of this section) VAL according to GNAT conventions.
7889 DVAL0 should describe the (portion of a) record that contains any
7890 necessary discriminants. It should be NULL if value_type (VAL) is
7891 an outer-level type (i.e., as opposed to a branch of a variant.) A
7892 variant field (unless unchecked) is replaced by a particular branch
7895 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7896 length are not statically known are discarded. As a consequence,
7897 VALADDR, ADDRESS and DVAL0 are ignored.
7899 NOTE: Limitations: For now, we assume that dynamic fields and
7900 variants occupy whole numbers of bytes. However, they need not be
7904 ada_template_to_fixed_record_type_1 (struct type
*type
,
7905 const gdb_byte
*valaddr
,
7906 CORE_ADDR address
, struct value
*dval0
,
7907 int keep_dynamic_fields
)
7909 struct value
*mark
= value_mark ();
7912 int nfields
, bit_len
;
7918 /* Compute the number of fields in this record type that are going
7919 to be processed: unless keep_dynamic_fields, this includes only
7920 fields whose position and length are static will be processed. */
7921 if (keep_dynamic_fields
)
7922 nfields
= TYPE_NFIELDS (type
);
7926 while (nfields
< TYPE_NFIELDS (type
)
7927 && !ada_is_variant_part (type
, nfields
)
7928 && !is_dynamic_field (type
, nfields
))
7932 rtype
= alloc_type_copy (type
);
7933 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7934 INIT_CPLUS_SPECIFIC (rtype
);
7935 TYPE_NFIELDS (rtype
) = nfields
;
7936 TYPE_FIELDS (rtype
) = (struct field
*)
7937 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7938 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7939 TYPE_NAME (rtype
) = ada_type_name (type
);
7940 TYPE_TAG_NAME (rtype
) = NULL
;
7941 TYPE_FIXED_INSTANCE (rtype
) = 1;
7947 for (f
= 0; f
< nfields
; f
+= 1)
7949 off
= align_value (off
, field_alignment (type
, f
))
7950 + TYPE_FIELD_BITPOS (type
, f
);
7951 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
7952 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7954 if (ada_is_variant_part (type
, f
))
7959 else if (is_dynamic_field (type
, f
))
7961 const gdb_byte
*field_valaddr
= valaddr
;
7962 CORE_ADDR field_address
= address
;
7963 struct type
*field_type
=
7964 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7968 /* rtype's length is computed based on the run-time
7969 value of discriminants. If the discriminants are not
7970 initialized, the type size may be completely bogus and
7971 GDB may fail to allocate a value for it. So check the
7972 size first before creating the value. */
7973 ada_ensure_varsize_limit (rtype
);
7974 /* Using plain value_from_contents_and_address here
7975 causes problems because we will end up trying to
7976 resolve a type that is currently being
7978 dval
= value_from_contents_and_address_unresolved (rtype
,
7981 rtype
= value_type (dval
);
7986 /* If the type referenced by this field is an aligner type, we need
7987 to unwrap that aligner type, because its size might not be set.
7988 Keeping the aligner type would cause us to compute the wrong
7989 size for this field, impacting the offset of the all the fields
7990 that follow this one. */
7991 if (ada_is_aligner_type (field_type
))
7993 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7995 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7996 field_address
= cond_offset_target (field_address
, field_offset
);
7997 field_type
= ada_aligned_type (field_type
);
8000 field_valaddr
= cond_offset_host (field_valaddr
,
8001 off
/ TARGET_CHAR_BIT
);
8002 field_address
= cond_offset_target (field_address
,
8003 off
/ TARGET_CHAR_BIT
);
8005 /* Get the fixed type of the field. Note that, in this case,
8006 we do not want to get the real type out of the tag: if
8007 the current field is the parent part of a tagged record,
8008 we will get the tag of the object. Clearly wrong: the real
8009 type of the parent is not the real type of the child. We
8010 would end up in an infinite loop. */
8011 field_type
= ada_get_base_type (field_type
);
8012 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8013 field_address
, dval
, 0);
8014 /* If the field size is already larger than the maximum
8015 object size, then the record itself will necessarily
8016 be larger than the maximum object size. We need to make
8017 this check now, because the size might be so ridiculously
8018 large (due to an uninitialized variable in the inferior)
8019 that it would cause an overflow when adding it to the
8021 ada_ensure_varsize_limit (field_type
);
8023 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8024 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8025 /* The multiplication can potentially overflow. But because
8026 the field length has been size-checked just above, and
8027 assuming that the maximum size is a reasonable value,
8028 an overflow should not happen in practice. So rather than
8029 adding overflow recovery code to this already complex code,
8030 we just assume that it's not going to happen. */
8032 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8036 /* Note: If this field's type is a typedef, it is important
8037 to preserve the typedef layer.
8039 Otherwise, we might be transforming a typedef to a fat
8040 pointer (encoding a pointer to an unconstrained array),
8041 into a basic fat pointer (encoding an unconstrained
8042 array). As both types are implemented using the same
8043 structure, the typedef is the only clue which allows us
8044 to distinguish between the two options. Stripping it
8045 would prevent us from printing this field appropriately. */
8046 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8047 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8048 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8050 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8053 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8055 /* We need to be careful of typedefs when computing
8056 the length of our field. If this is a typedef,
8057 get the length of the target type, not the length
8059 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8060 field_type
= ada_typedef_target_type (field_type
);
8063 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8066 if (off
+ fld_bit_len
> bit_len
)
8067 bit_len
= off
+ fld_bit_len
;
8069 TYPE_LENGTH (rtype
) =
8070 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8073 /* We handle the variant part, if any, at the end because of certain
8074 odd cases in which it is re-ordered so as NOT to be the last field of
8075 the record. This can happen in the presence of representation
8077 if (variant_field
>= 0)
8079 struct type
*branch_type
;
8081 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8085 /* Using plain value_from_contents_and_address here causes
8086 problems because we will end up trying to resolve a type
8087 that is currently being constructed. */
8088 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8090 rtype
= value_type (dval
);
8096 to_fixed_variant_branch_type
8097 (TYPE_FIELD_TYPE (type
, variant_field
),
8098 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8099 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8100 if (branch_type
== NULL
)
8102 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8103 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8104 TYPE_NFIELDS (rtype
) -= 1;
8108 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8109 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8111 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8113 if (off
+ fld_bit_len
> bit_len
)
8114 bit_len
= off
+ fld_bit_len
;
8115 TYPE_LENGTH (rtype
) =
8116 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8120 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8121 should contain the alignment of that record, which should be a strictly
8122 positive value. If null or negative, then something is wrong, most
8123 probably in the debug info. In that case, we don't round up the size
8124 of the resulting type. If this record is not part of another structure,
8125 the current RTYPE length might be good enough for our purposes. */
8126 if (TYPE_LENGTH (type
) <= 0)
8128 if (TYPE_NAME (rtype
))
8129 warning (_("Invalid type size for `%s' detected: %d."),
8130 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8132 warning (_("Invalid type size for <unnamed> detected: %d."),
8133 TYPE_LENGTH (type
));
8137 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8138 TYPE_LENGTH (type
));
8141 value_free_to_mark (mark
);
8142 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8143 error (_("record type with dynamic size is larger than varsize-limit"));
8147 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8150 static struct type
*
8151 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8152 CORE_ADDR address
, struct value
*dval0
)
8154 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8158 /* An ordinary record type in which ___XVL-convention fields and
8159 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8160 static approximations, containing all possible fields. Uses
8161 no runtime values. Useless for use in values, but that's OK,
8162 since the results are used only for type determinations. Works on both
8163 structs and unions. Representation note: to save space, we memorize
8164 the result of this function in the TYPE_TARGET_TYPE of the
8167 static struct type
*
8168 template_to_static_fixed_type (struct type
*type0
)
8174 /* No need no do anything if the input type is already fixed. */
8175 if (TYPE_FIXED_INSTANCE (type0
))
8178 /* Likewise if we already have computed the static approximation. */
8179 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8180 return TYPE_TARGET_TYPE (type0
);
8182 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8184 nfields
= TYPE_NFIELDS (type0
);
8186 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8187 recompute all over next time. */
8188 TYPE_TARGET_TYPE (type0
) = type
;
8190 for (f
= 0; f
< nfields
; f
+= 1)
8192 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8193 struct type
*new_type
;
8195 if (is_dynamic_field (type0
, f
))
8197 field_type
= ada_check_typedef (field_type
);
8198 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8201 new_type
= static_unwrap_type (field_type
);
8203 if (new_type
!= field_type
)
8205 /* Clone TYPE0 only the first time we get a new field type. */
8208 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8209 TYPE_CODE (type
) = TYPE_CODE (type0
);
8210 INIT_CPLUS_SPECIFIC (type
);
8211 TYPE_NFIELDS (type
) = nfields
;
8212 TYPE_FIELDS (type
) = (struct field
*)
8213 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8214 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8215 sizeof (struct field
) * nfields
);
8216 TYPE_NAME (type
) = ada_type_name (type0
);
8217 TYPE_TAG_NAME (type
) = NULL
;
8218 TYPE_FIXED_INSTANCE (type
) = 1;
8219 TYPE_LENGTH (type
) = 0;
8221 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8222 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8229 /* Given an object of type TYPE whose contents are at VALADDR and
8230 whose address in memory is ADDRESS, returns a revision of TYPE,
8231 which should be a non-dynamic-sized record, in which the variant
8232 part, if any, is replaced with the appropriate branch. Looks
8233 for discriminant values in DVAL0, which can be NULL if the record
8234 contains the necessary discriminant values. */
8236 static struct type
*
8237 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8238 CORE_ADDR address
, struct value
*dval0
)
8240 struct value
*mark
= value_mark ();
8243 struct type
*branch_type
;
8244 int nfields
= TYPE_NFIELDS (type
);
8245 int variant_field
= variant_field_index (type
);
8247 if (variant_field
== -1)
8252 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8253 type
= value_type (dval
);
8258 rtype
= alloc_type_copy (type
);
8259 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8260 INIT_CPLUS_SPECIFIC (rtype
);
8261 TYPE_NFIELDS (rtype
) = nfields
;
8262 TYPE_FIELDS (rtype
) =
8263 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8264 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8265 sizeof (struct field
) * nfields
);
8266 TYPE_NAME (rtype
) = ada_type_name (type
);
8267 TYPE_TAG_NAME (rtype
) = NULL
;
8268 TYPE_FIXED_INSTANCE (rtype
) = 1;
8269 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8271 branch_type
= to_fixed_variant_branch_type
8272 (TYPE_FIELD_TYPE (type
, variant_field
),
8273 cond_offset_host (valaddr
,
8274 TYPE_FIELD_BITPOS (type
, variant_field
)
8276 cond_offset_target (address
,
8277 TYPE_FIELD_BITPOS (type
, variant_field
)
8278 / TARGET_CHAR_BIT
), dval
);
8279 if (branch_type
== NULL
)
8283 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8284 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8285 TYPE_NFIELDS (rtype
) -= 1;
8289 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8290 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8291 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8292 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8294 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8296 value_free_to_mark (mark
);
8300 /* An ordinary record type (with fixed-length fields) that describes
8301 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8302 beginning of this section]. Any necessary discriminants' values
8303 should be in DVAL, a record value; it may be NULL if the object
8304 at ADDR itself contains any necessary discriminant values.
8305 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8306 values from the record are needed. Except in the case that DVAL,
8307 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8308 unchecked) is replaced by a particular branch of the variant.
8310 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8311 is questionable and may be removed. It can arise during the
8312 processing of an unconstrained-array-of-record type where all the
8313 variant branches have exactly the same size. This is because in
8314 such cases, the compiler does not bother to use the XVS convention
8315 when encoding the record. I am currently dubious of this
8316 shortcut and suspect the compiler should be altered. FIXME. */
8318 static struct type
*
8319 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8320 CORE_ADDR address
, struct value
*dval
)
8322 struct type
*templ_type
;
8324 if (TYPE_FIXED_INSTANCE (type0
))
8327 templ_type
= dynamic_template_type (type0
);
8329 if (templ_type
!= NULL
)
8330 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8331 else if (variant_field_index (type0
) >= 0)
8333 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8335 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8340 TYPE_FIXED_INSTANCE (type0
) = 1;
8346 /* An ordinary record type (with fixed-length fields) that describes
8347 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8348 union type. Any necessary discriminants' values should be in DVAL,
8349 a record value. That is, this routine selects the appropriate
8350 branch of the union at ADDR according to the discriminant value
8351 indicated in the union's type name. Returns VAR_TYPE0 itself if
8352 it represents a variant subject to a pragma Unchecked_Union. */
8354 static struct type
*
8355 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8356 CORE_ADDR address
, struct value
*dval
)
8359 struct type
*templ_type
;
8360 struct type
*var_type
;
8362 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8363 var_type
= TYPE_TARGET_TYPE (var_type0
);
8365 var_type
= var_type0
;
8367 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8369 if (templ_type
!= NULL
)
8370 var_type
= templ_type
;
8372 if (is_unchecked_variant (var_type
, value_type (dval
)))
8375 ada_which_variant_applies (var_type
,
8376 value_type (dval
), value_contents (dval
));
8379 return empty_record (var_type
);
8380 else if (is_dynamic_field (var_type
, which
))
8381 return to_fixed_record_type
8382 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8383 valaddr
, address
, dval
);
8384 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8386 to_fixed_record_type
8387 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8389 return TYPE_FIELD_TYPE (var_type
, which
);
8392 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8393 ENCODING_TYPE, a type following the GNAT conventions for discrete
8394 type encodings, only carries redundant information. */
8397 ada_is_redundant_range_encoding (struct type
*range_type
,
8398 struct type
*encoding_type
)
8400 struct type
*fixed_range_type
;
8405 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8407 if (TYPE_CODE (get_base_type (range_type
))
8408 != TYPE_CODE (get_base_type (encoding_type
)))
8410 /* The compiler probably used a simple base type to describe
8411 the range type instead of the range's actual base type,
8412 expecting us to get the real base type from the encoding
8413 anyway. In this situation, the encoding cannot be ignored
8418 if (is_dynamic_type (range_type
))
8421 if (TYPE_NAME (encoding_type
) == NULL
)
8424 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8425 if (bounds_str
== NULL
)
8428 n
= 8; /* Skip "___XDLU_". */
8429 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8431 if (TYPE_LOW_BOUND (range_type
) != lo
)
8434 n
+= 2; /* Skip the "__" separator between the two bounds. */
8435 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8437 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8443 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8444 a type following the GNAT encoding for describing array type
8445 indices, only carries redundant information. */
8448 ada_is_redundant_index_type_desc (struct type
*array_type
,
8449 struct type
*desc_type
)
8451 struct type
*this_layer
= check_typedef (array_type
);
8454 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8456 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8457 TYPE_FIELD_TYPE (desc_type
, i
)))
8459 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8465 /* Assuming that TYPE0 is an array type describing the type of a value
8466 at ADDR, and that DVAL describes a record containing any
8467 discriminants used in TYPE0, returns a type for the value that
8468 contains no dynamic components (that is, no components whose sizes
8469 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8470 true, gives an error message if the resulting type's size is over
8473 static struct type
*
8474 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8477 struct type
*index_type_desc
;
8478 struct type
*result
;
8479 int constrained_packed_array_p
;
8481 type0
= ada_check_typedef (type0
);
8482 if (TYPE_FIXED_INSTANCE (type0
))
8485 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8486 if (constrained_packed_array_p
)
8487 type0
= decode_constrained_packed_array_type (type0
);
8489 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
8490 ada_fixup_array_indexes_type (index_type_desc
);
8491 if (index_type_desc
!= NULL
8492 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8494 /* Ignore this ___XA parallel type, as it does not bring any
8495 useful information. This allows us to avoid creating fixed
8496 versions of the array's index types, which would be identical
8497 to the original ones. This, in turn, can also help avoid
8498 the creation of fixed versions of the array itself. */
8499 index_type_desc
= NULL
;
8502 if (index_type_desc
== NULL
)
8504 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8506 /* NOTE: elt_type---the fixed version of elt_type0---should never
8507 depend on the contents of the array in properly constructed
8509 /* Create a fixed version of the array element type.
8510 We're not providing the address of an element here,
8511 and thus the actual object value cannot be inspected to do
8512 the conversion. This should not be a problem, since arrays of
8513 unconstrained objects are not allowed. In particular, all
8514 the elements of an array of a tagged type should all be of
8515 the same type specified in the debugging info. No need to
8516 consult the object tag. */
8517 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8519 /* Make sure we always create a new array type when dealing with
8520 packed array types, since we're going to fix-up the array
8521 type length and element bitsize a little further down. */
8522 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8525 result
= create_array_type (alloc_type_copy (type0
),
8526 elt_type
, TYPE_INDEX_TYPE (type0
));
8531 struct type
*elt_type0
;
8534 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8535 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8537 /* NOTE: result---the fixed version of elt_type0---should never
8538 depend on the contents of the array in properly constructed
8540 /* Create a fixed version of the array element type.
8541 We're not providing the address of an element here,
8542 and thus the actual object value cannot be inspected to do
8543 the conversion. This should not be a problem, since arrays of
8544 unconstrained objects are not allowed. In particular, all
8545 the elements of an array of a tagged type should all be of
8546 the same type specified in the debugging info. No need to
8547 consult the object tag. */
8549 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8552 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8554 struct type
*range_type
=
8555 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8557 result
= create_array_type (alloc_type_copy (elt_type0
),
8558 result
, range_type
);
8559 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8561 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8562 error (_("array type with dynamic size is larger than varsize-limit"));
8565 /* We want to preserve the type name. This can be useful when
8566 trying to get the type name of a value that has already been
8567 printed (for instance, if the user did "print VAR; whatis $". */
8568 TYPE_NAME (result
) = TYPE_NAME (type0
);
8570 if (constrained_packed_array_p
)
8572 /* So far, the resulting type has been created as if the original
8573 type was a regular (non-packed) array type. As a result, the
8574 bitsize of the array elements needs to be set again, and the array
8575 length needs to be recomputed based on that bitsize. */
8576 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8577 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8579 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8580 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8581 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8582 TYPE_LENGTH (result
)++;
8585 TYPE_FIXED_INSTANCE (result
) = 1;
8590 /* A standard type (containing no dynamically sized components)
8591 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8592 DVAL describes a record containing any discriminants used in TYPE0,
8593 and may be NULL if there are none, or if the object of type TYPE at
8594 ADDRESS or in VALADDR contains these discriminants.
8596 If CHECK_TAG is not null, in the case of tagged types, this function
8597 attempts to locate the object's tag and use it to compute the actual
8598 type. However, when ADDRESS is null, we cannot use it to determine the
8599 location of the tag, and therefore compute the tagged type's actual type.
8600 So we return the tagged type without consulting the tag. */
8602 static struct type
*
8603 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8604 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8606 type
= ada_check_typedef (type
);
8607 switch (TYPE_CODE (type
))
8611 case TYPE_CODE_STRUCT
:
8613 struct type
*static_type
= to_static_fixed_type (type
);
8614 struct type
*fixed_record_type
=
8615 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8617 /* If STATIC_TYPE is a tagged type and we know the object's address,
8618 then we can determine its tag, and compute the object's actual
8619 type from there. Note that we have to use the fixed record
8620 type (the parent part of the record may have dynamic fields
8621 and the way the location of _tag is expressed may depend on
8624 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8627 value_tag_from_contents_and_address
8631 struct type
*real_type
= type_from_tag (tag
);
8633 value_from_contents_and_address (fixed_record_type
,
8636 fixed_record_type
= value_type (obj
);
8637 if (real_type
!= NULL
)
8638 return to_fixed_record_type
8640 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8643 /* Check to see if there is a parallel ___XVZ variable.
8644 If there is, then it provides the actual size of our type. */
8645 else if (ada_type_name (fixed_record_type
) != NULL
)
8647 const char *name
= ada_type_name (fixed_record_type
);
8648 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8652 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8653 size
= get_int_var_value (xvz_name
, &xvz_found
);
8654 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8656 fixed_record_type
= copy_type (fixed_record_type
);
8657 TYPE_LENGTH (fixed_record_type
) = size
;
8659 /* The FIXED_RECORD_TYPE may have be a stub. We have
8660 observed this when the debugging info is STABS, and
8661 apparently it is something that is hard to fix.
8663 In practice, we don't need the actual type definition
8664 at all, because the presence of the XVZ variable allows us
8665 to assume that there must be a XVS type as well, which we
8666 should be able to use later, when we need the actual type
8669 In the meantime, pretend that the "fixed" type we are
8670 returning is NOT a stub, because this can cause trouble
8671 when using this type to create new types targeting it.
8672 Indeed, the associated creation routines often check
8673 whether the target type is a stub and will try to replace
8674 it, thus using a type with the wrong size. This, in turn,
8675 might cause the new type to have the wrong size too.
8676 Consider the case of an array, for instance, where the size
8677 of the array is computed from the number of elements in
8678 our array multiplied by the size of its element. */
8679 TYPE_STUB (fixed_record_type
) = 0;
8682 return fixed_record_type
;
8684 case TYPE_CODE_ARRAY
:
8685 return to_fixed_array_type (type
, dval
, 1);
8686 case TYPE_CODE_UNION
:
8690 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8694 /* The same as ada_to_fixed_type_1, except that it preserves the type
8695 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8697 The typedef layer needs be preserved in order to differentiate between
8698 arrays and array pointers when both types are implemented using the same
8699 fat pointer. In the array pointer case, the pointer is encoded as
8700 a typedef of the pointer type. For instance, considering:
8702 type String_Access is access String;
8703 S1 : String_Access := null;
8705 To the debugger, S1 is defined as a typedef of type String. But
8706 to the user, it is a pointer. So if the user tries to print S1,
8707 we should not dereference the array, but print the array address
8710 If we didn't preserve the typedef layer, we would lose the fact that
8711 the type is to be presented as a pointer (needs de-reference before
8712 being printed). And we would also use the source-level type name. */
8715 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8716 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8719 struct type
*fixed_type
=
8720 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8722 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8723 then preserve the typedef layer.
8725 Implementation note: We can only check the main-type portion of
8726 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8727 from TYPE now returns a type that has the same instance flags
8728 as TYPE. For instance, if TYPE is a "typedef const", and its
8729 target type is a "struct", then the typedef elimination will return
8730 a "const" version of the target type. See check_typedef for more
8731 details about how the typedef layer elimination is done.
8733 brobecker/2010-11-19: It seems to me that the only case where it is
8734 useful to preserve the typedef layer is when dealing with fat pointers.
8735 Perhaps, we could add a check for that and preserve the typedef layer
8736 only in that situation. But this seems unecessary so far, probably
8737 because we call check_typedef/ada_check_typedef pretty much everywhere.
8739 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8740 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8741 == TYPE_MAIN_TYPE (fixed_type
)))
8747 /* A standard (static-sized) type corresponding as well as possible to
8748 TYPE0, but based on no runtime data. */
8750 static struct type
*
8751 to_static_fixed_type (struct type
*type0
)
8758 if (TYPE_FIXED_INSTANCE (type0
))
8761 type0
= ada_check_typedef (type0
);
8763 switch (TYPE_CODE (type0
))
8767 case TYPE_CODE_STRUCT
:
8768 type
= dynamic_template_type (type0
);
8770 return template_to_static_fixed_type (type
);
8772 return template_to_static_fixed_type (type0
);
8773 case TYPE_CODE_UNION
:
8774 type
= ada_find_parallel_type (type0
, "___XVU");
8776 return template_to_static_fixed_type (type
);
8778 return template_to_static_fixed_type (type0
);
8782 /* A static approximation of TYPE with all type wrappers removed. */
8784 static struct type
*
8785 static_unwrap_type (struct type
*type
)
8787 if (ada_is_aligner_type (type
))
8789 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8790 if (ada_type_name (type1
) == NULL
)
8791 TYPE_NAME (type1
) = ada_type_name (type
);
8793 return static_unwrap_type (type1
);
8797 struct type
*raw_real_type
= ada_get_base_type (type
);
8799 if (raw_real_type
== type
)
8802 return to_static_fixed_type (raw_real_type
);
8806 /* In some cases, incomplete and private types require
8807 cross-references that are not resolved as records (for example,
8809 type FooP is access Foo;
8811 type Foo is array ...;
8812 ). In these cases, since there is no mechanism for producing
8813 cross-references to such types, we instead substitute for FooP a
8814 stub enumeration type that is nowhere resolved, and whose tag is
8815 the name of the actual type. Call these types "non-record stubs". */
8817 /* A type equivalent to TYPE that is not a non-record stub, if one
8818 exists, otherwise TYPE. */
8821 ada_check_typedef (struct type
*type
)
8826 /* If our type is a typedef type of a fat pointer, then we're done.
8827 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8828 what allows us to distinguish between fat pointers that represent
8829 array types, and fat pointers that represent array access types
8830 (in both cases, the compiler implements them as fat pointers). */
8831 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8832 && is_thick_pntr (ada_typedef_target_type (type
)))
8835 CHECK_TYPEDEF (type
);
8836 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8837 || !TYPE_STUB (type
)
8838 || TYPE_TAG_NAME (type
) == NULL
)
8842 const char *name
= TYPE_TAG_NAME (type
);
8843 struct type
*type1
= ada_find_any_type (name
);
8848 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8849 stubs pointing to arrays, as we don't create symbols for array
8850 types, only for the typedef-to-array types). If that's the case,
8851 strip the typedef layer. */
8852 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8853 type1
= ada_check_typedef (type1
);
8859 /* A value representing the data at VALADDR/ADDRESS as described by
8860 type TYPE0, but with a standard (static-sized) type that correctly
8861 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8862 type, then return VAL0 [this feature is simply to avoid redundant
8863 creation of struct values]. */
8865 static struct value
*
8866 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8869 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8871 if (type
== type0
&& val0
!= NULL
)
8874 return value_from_contents_and_address (type
, 0, address
);
8877 /* A value representing VAL, but with a standard (static-sized) type
8878 that correctly describes it. Does not necessarily create a new
8882 ada_to_fixed_value (struct value
*val
)
8884 val
= unwrap_value (val
);
8885 val
= ada_to_fixed_value_create (value_type (val
),
8886 value_address (val
),
8894 /* Table mapping attribute numbers to names.
8895 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8897 static const char *attribute_names
[] = {
8915 ada_attribute_name (enum exp_opcode n
)
8917 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8918 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8920 return attribute_names
[0];
8923 /* Evaluate the 'POS attribute applied to ARG. */
8926 pos_atr (struct value
*arg
)
8928 struct value
*val
= coerce_ref (arg
);
8929 struct type
*type
= value_type (val
);
8931 if (!discrete_type_p (type
))
8932 error (_("'POS only defined on discrete types"));
8934 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8937 LONGEST v
= value_as_long (val
);
8939 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8941 if (v
== TYPE_FIELD_ENUMVAL (type
, i
))
8944 error (_("enumeration value is invalid: can't find 'POS"));
8947 return value_as_long (val
);
8950 static struct value
*
8951 value_pos_atr (struct type
*type
, struct value
*arg
)
8953 return value_from_longest (type
, pos_atr (arg
));
8956 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8958 static struct value
*
8959 value_val_atr (struct type
*type
, struct value
*arg
)
8961 if (!discrete_type_p (type
))
8962 error (_("'VAL only defined on discrete types"));
8963 if (!integer_type_p (value_type (arg
)))
8964 error (_("'VAL requires integral argument"));
8966 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8968 long pos
= value_as_long (arg
);
8970 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8971 error (_("argument to 'VAL out of range"));
8972 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
8975 return value_from_longest (type
, value_as_long (arg
));
8981 /* True if TYPE appears to be an Ada character type.
8982 [At the moment, this is true only for Character and Wide_Character;
8983 It is a heuristic test that could stand improvement]. */
8986 ada_is_character_type (struct type
*type
)
8990 /* If the type code says it's a character, then assume it really is,
8991 and don't check any further. */
8992 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8995 /* Otherwise, assume it's a character type iff it is a discrete type
8996 with a known character type name. */
8997 name
= ada_type_name (type
);
8998 return (name
!= NULL
8999 && (TYPE_CODE (type
) == TYPE_CODE_INT
9000 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9001 && (strcmp (name
, "character") == 0
9002 || strcmp (name
, "wide_character") == 0
9003 || strcmp (name
, "wide_wide_character") == 0
9004 || strcmp (name
, "unsigned char") == 0));
9007 /* True if TYPE appears to be an Ada string type. */
9010 ada_is_string_type (struct type
*type
)
9012 type
= ada_check_typedef (type
);
9014 && TYPE_CODE (type
) != TYPE_CODE_PTR
9015 && (ada_is_simple_array_type (type
)
9016 || ada_is_array_descriptor_type (type
))
9017 && ada_array_arity (type
) == 1)
9019 struct type
*elttype
= ada_array_element_type (type
, 1);
9021 return ada_is_character_type (elttype
);
9027 /* The compiler sometimes provides a parallel XVS type for a given
9028 PAD type. Normally, it is safe to follow the PAD type directly,
9029 but older versions of the compiler have a bug that causes the offset
9030 of its "F" field to be wrong. Following that field in that case
9031 would lead to incorrect results, but this can be worked around
9032 by ignoring the PAD type and using the associated XVS type instead.
9034 Set to True if the debugger should trust the contents of PAD types.
9035 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9036 static int trust_pad_over_xvs
= 1;
9038 /* True if TYPE is a struct type introduced by the compiler to force the
9039 alignment of a value. Such types have a single field with a
9040 distinctive name. */
9043 ada_is_aligner_type (struct type
*type
)
9045 type
= ada_check_typedef (type
);
9047 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9050 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9051 && TYPE_NFIELDS (type
) == 1
9052 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9055 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9056 the parallel type. */
9059 ada_get_base_type (struct type
*raw_type
)
9061 struct type
*real_type_namer
;
9062 struct type
*raw_real_type
;
9064 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9067 if (ada_is_aligner_type (raw_type
))
9068 /* The encoding specifies that we should always use the aligner type.
9069 So, even if this aligner type has an associated XVS type, we should
9072 According to the compiler gurus, an XVS type parallel to an aligner
9073 type may exist because of a stabs limitation. In stabs, aligner
9074 types are empty because the field has a variable-sized type, and
9075 thus cannot actually be used as an aligner type. As a result,
9076 we need the associated parallel XVS type to decode the type.
9077 Since the policy in the compiler is to not change the internal
9078 representation based on the debugging info format, we sometimes
9079 end up having a redundant XVS type parallel to the aligner type. */
9082 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9083 if (real_type_namer
== NULL
9084 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9085 || TYPE_NFIELDS (real_type_namer
) != 1)
9088 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9090 /* This is an older encoding form where the base type needs to be
9091 looked up by name. We prefer the newer enconding because it is
9093 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9094 if (raw_real_type
== NULL
)
9097 return raw_real_type
;
9100 /* The field in our XVS type is a reference to the base type. */
9101 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9104 /* The type of value designated by TYPE, with all aligners removed. */
9107 ada_aligned_type (struct type
*type
)
9109 if (ada_is_aligner_type (type
))
9110 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9112 return ada_get_base_type (type
);
9116 /* The address of the aligned value in an object at address VALADDR
9117 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9120 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9122 if (ada_is_aligner_type (type
))
9123 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9125 TYPE_FIELD_BITPOS (type
,
9126 0) / TARGET_CHAR_BIT
);
9133 /* The printed representation of an enumeration literal with encoded
9134 name NAME. The value is good to the next call of ada_enum_name. */
9136 ada_enum_name (const char *name
)
9138 static char *result
;
9139 static size_t result_len
= 0;
9142 /* First, unqualify the enumeration name:
9143 1. Search for the last '.' character. If we find one, then skip
9144 all the preceding characters, the unqualified name starts
9145 right after that dot.
9146 2. Otherwise, we may be debugging on a target where the compiler
9147 translates dots into "__". Search forward for double underscores,
9148 but stop searching when we hit an overloading suffix, which is
9149 of the form "__" followed by digits. */
9151 tmp
= strrchr (name
, '.');
9156 while ((tmp
= strstr (name
, "__")) != NULL
)
9158 if (isdigit (tmp
[2]))
9169 if (name
[1] == 'U' || name
[1] == 'W')
9171 if (sscanf (name
+ 2, "%x", &v
) != 1)
9177 GROW_VECT (result
, result_len
, 16);
9178 if (isascii (v
) && isprint (v
))
9179 xsnprintf (result
, result_len
, "'%c'", v
);
9180 else if (name
[1] == 'U')
9181 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9183 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9189 tmp
= strstr (name
, "__");
9191 tmp
= strstr (name
, "$");
9194 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9195 strncpy (result
, name
, tmp
- name
);
9196 result
[tmp
- name
] = '\0';
9204 /* Evaluate the subexpression of EXP starting at *POS as for
9205 evaluate_type, updating *POS to point just past the evaluated
9208 static struct value
*
9209 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9211 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9214 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9217 static struct value
*
9218 unwrap_value (struct value
*val
)
9220 struct type
*type
= ada_check_typedef (value_type (val
));
9222 if (ada_is_aligner_type (type
))
9224 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9225 struct type
*val_type
= ada_check_typedef (value_type (v
));
9227 if (ada_type_name (val_type
) == NULL
)
9228 TYPE_NAME (val_type
) = ada_type_name (type
);
9230 return unwrap_value (v
);
9234 struct type
*raw_real_type
=
9235 ada_check_typedef (ada_get_base_type (type
));
9237 /* If there is no parallel XVS or XVE type, then the value is
9238 already unwrapped. Return it without further modification. */
9239 if ((type
== raw_real_type
)
9240 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9244 coerce_unspec_val_to_type
9245 (val
, ada_to_fixed_type (raw_real_type
, 0,
9246 value_address (val
),
9251 static struct value
*
9252 cast_to_fixed (struct type
*type
, struct value
*arg
)
9256 if (type
== value_type (arg
))
9258 else if (ada_is_fixed_point_type (value_type (arg
)))
9259 val
= ada_float_to_fixed (type
,
9260 ada_fixed_to_float (value_type (arg
),
9261 value_as_long (arg
)));
9264 DOUBLEST argd
= value_as_double (arg
);
9266 val
= ada_float_to_fixed (type
, argd
);
9269 return value_from_longest (type
, val
);
9272 static struct value
*
9273 cast_from_fixed (struct type
*type
, struct value
*arg
)
9275 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9276 value_as_long (arg
));
9278 return value_from_double (type
, val
);
9281 /* Given two array types T1 and T2, return nonzero iff both arrays
9282 contain the same number of elements. */
9285 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9287 LONGEST lo1
, hi1
, lo2
, hi2
;
9289 /* Get the array bounds in order to verify that the size of
9290 the two arrays match. */
9291 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9292 || !get_array_bounds (t2
, &lo2
, &hi2
))
9293 error (_("unable to determine array bounds"));
9295 /* To make things easier for size comparison, normalize a bit
9296 the case of empty arrays by making sure that the difference
9297 between upper bound and lower bound is always -1. */
9303 return (hi1
- lo1
== hi2
- lo2
);
9306 /* Assuming that VAL is an array of integrals, and TYPE represents
9307 an array with the same number of elements, but with wider integral
9308 elements, return an array "casted" to TYPE. In practice, this
9309 means that the returned array is built by casting each element
9310 of the original array into TYPE's (wider) element type. */
9312 static struct value
*
9313 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9315 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9320 /* Verify that both val and type are arrays of scalars, and
9321 that the size of val's elements is smaller than the size
9322 of type's element. */
9323 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9324 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9325 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9326 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9327 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9328 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9330 if (!get_array_bounds (type
, &lo
, &hi
))
9331 error (_("unable to determine array bounds"));
9333 res
= allocate_value (type
);
9335 /* Promote each array element. */
9336 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9338 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9340 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9341 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9347 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9348 return the converted value. */
9350 static struct value
*
9351 coerce_for_assign (struct type
*type
, struct value
*val
)
9353 struct type
*type2
= value_type (val
);
9358 type2
= ada_check_typedef (type2
);
9359 type
= ada_check_typedef (type
);
9361 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9362 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9364 val
= ada_value_ind (val
);
9365 type2
= value_type (val
);
9368 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9369 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9371 if (!ada_same_array_size_p (type
, type2
))
9372 error (_("cannot assign arrays of different length"));
9374 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9375 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9376 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9377 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9379 /* Allow implicit promotion of the array elements to
9381 return ada_promote_array_of_integrals (type
, val
);
9384 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9385 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9386 error (_("Incompatible types in assignment"));
9387 deprecated_set_value_type (val
, type
);
9392 static struct value
*
9393 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9396 struct type
*type1
, *type2
;
9399 arg1
= coerce_ref (arg1
);
9400 arg2
= coerce_ref (arg2
);
9401 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9402 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9404 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9405 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9406 return value_binop (arg1
, arg2
, op
);
9415 return value_binop (arg1
, arg2
, op
);
9418 v2
= value_as_long (arg2
);
9420 error (_("second operand of %s must not be zero."), op_string (op
));
9422 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9423 return value_binop (arg1
, arg2
, op
);
9425 v1
= value_as_long (arg1
);
9430 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9431 v
+= v
> 0 ? -1 : 1;
9439 /* Should not reach this point. */
9443 val
= allocate_value (type1
);
9444 store_unsigned_integer (value_contents_raw (val
),
9445 TYPE_LENGTH (value_type (val
)),
9446 gdbarch_byte_order (get_type_arch (type1
)), v
);
9451 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9453 if (ada_is_direct_array_type (value_type (arg1
))
9454 || ada_is_direct_array_type (value_type (arg2
)))
9456 /* Automatically dereference any array reference before
9457 we attempt to perform the comparison. */
9458 arg1
= ada_coerce_ref (arg1
);
9459 arg2
= ada_coerce_ref (arg2
);
9461 arg1
= ada_coerce_to_simple_array (arg1
);
9462 arg2
= ada_coerce_to_simple_array (arg2
);
9463 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9464 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9465 error (_("Attempt to compare array with non-array"));
9466 /* FIXME: The following works only for types whose
9467 representations use all bits (no padding or undefined bits)
9468 and do not have user-defined equality. */
9470 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9471 && memcmp (value_contents (arg1
), value_contents (arg2
),
9472 TYPE_LENGTH (value_type (arg1
))) == 0;
9474 return value_equal (arg1
, arg2
);
9477 /* Total number of component associations in the aggregate starting at
9478 index PC in EXP. Assumes that index PC is the start of an
9482 num_component_specs (struct expression
*exp
, int pc
)
9486 m
= exp
->elts
[pc
+ 1].longconst
;
9489 for (i
= 0; i
< m
; i
+= 1)
9491 switch (exp
->elts
[pc
].opcode
)
9497 n
+= exp
->elts
[pc
+ 1].longconst
;
9500 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9505 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9506 component of LHS (a simple array or a record), updating *POS past
9507 the expression, assuming that LHS is contained in CONTAINER. Does
9508 not modify the inferior's memory, nor does it modify LHS (unless
9509 LHS == CONTAINER). */
9512 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9513 struct expression
*exp
, int *pos
)
9515 struct value
*mark
= value_mark ();
9518 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9520 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9521 struct value
*index_val
= value_from_longest (index_type
, index
);
9523 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9527 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9528 elt
= ada_to_fixed_value (elt
);
9531 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9532 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9534 value_assign_to_component (container
, elt
,
9535 ada_evaluate_subexp (NULL
, exp
, pos
,
9538 value_free_to_mark (mark
);
9541 /* Assuming that LHS represents an lvalue having a record or array
9542 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9543 of that aggregate's value to LHS, advancing *POS past the
9544 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9545 lvalue containing LHS (possibly LHS itself). Does not modify
9546 the inferior's memory, nor does it modify the contents of
9547 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9549 static struct value
*
9550 assign_aggregate (struct value
*container
,
9551 struct value
*lhs
, struct expression
*exp
,
9552 int *pos
, enum noside noside
)
9554 struct type
*lhs_type
;
9555 int n
= exp
->elts
[*pos
+1].longconst
;
9556 LONGEST low_index
, high_index
;
9559 int max_indices
, num_indices
;
9563 if (noside
!= EVAL_NORMAL
)
9565 for (i
= 0; i
< n
; i
+= 1)
9566 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9570 container
= ada_coerce_ref (container
);
9571 if (ada_is_direct_array_type (value_type (container
)))
9572 container
= ada_coerce_to_simple_array (container
);
9573 lhs
= ada_coerce_ref (lhs
);
9574 if (!deprecated_value_modifiable (lhs
))
9575 error (_("Left operand of assignment is not a modifiable lvalue."));
9577 lhs_type
= value_type (lhs
);
9578 if (ada_is_direct_array_type (lhs_type
))
9580 lhs
= ada_coerce_to_simple_array (lhs
);
9581 lhs_type
= value_type (lhs
);
9582 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9583 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9585 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9588 high_index
= num_visible_fields (lhs_type
) - 1;
9591 error (_("Left-hand side must be array or record."));
9593 num_specs
= num_component_specs (exp
, *pos
- 3);
9594 max_indices
= 4 * num_specs
+ 4;
9595 indices
= alloca (max_indices
* sizeof (indices
[0]));
9596 indices
[0] = indices
[1] = low_index
- 1;
9597 indices
[2] = indices
[3] = high_index
+ 1;
9600 for (i
= 0; i
< n
; i
+= 1)
9602 switch (exp
->elts
[*pos
].opcode
)
9605 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9606 &num_indices
, max_indices
,
9607 low_index
, high_index
);
9610 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9611 &num_indices
, max_indices
,
9612 low_index
, high_index
);
9616 error (_("Misplaced 'others' clause"));
9617 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9618 num_indices
, low_index
, high_index
);
9621 error (_("Internal error: bad aggregate clause"));
9628 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9629 construct at *POS, updating *POS past the construct, given that
9630 the positions are relative to lower bound LOW, where HIGH is the
9631 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9632 updating *NUM_INDICES as needed. CONTAINER is as for
9633 assign_aggregate. */
9635 aggregate_assign_positional (struct value
*container
,
9636 struct value
*lhs
, struct expression
*exp
,
9637 int *pos
, LONGEST
*indices
, int *num_indices
,
9638 int max_indices
, LONGEST low
, LONGEST high
)
9640 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9642 if (ind
- 1 == high
)
9643 warning (_("Extra components in aggregate ignored."));
9646 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9648 assign_component (container
, lhs
, ind
, exp
, pos
);
9651 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9654 /* Assign into the components of LHS indexed by the OP_CHOICES
9655 construct at *POS, updating *POS past the construct, given that
9656 the allowable indices are LOW..HIGH. Record the indices assigned
9657 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9658 needed. CONTAINER is as for assign_aggregate. */
9660 aggregate_assign_from_choices (struct value
*container
,
9661 struct value
*lhs
, struct expression
*exp
,
9662 int *pos
, LONGEST
*indices
, int *num_indices
,
9663 int max_indices
, LONGEST low
, LONGEST high
)
9666 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9667 int choice_pos
, expr_pc
;
9668 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9670 choice_pos
= *pos
+= 3;
9672 for (j
= 0; j
< n_choices
; j
+= 1)
9673 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9675 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9677 for (j
= 0; j
< n_choices
; j
+= 1)
9679 LONGEST lower
, upper
;
9680 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9682 if (op
== OP_DISCRETE_RANGE
)
9685 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9687 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9692 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9704 name
= &exp
->elts
[choice_pos
+ 2].string
;
9707 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9710 error (_("Invalid record component association."));
9712 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9714 if (! find_struct_field (name
, value_type (lhs
), 0,
9715 NULL
, NULL
, NULL
, NULL
, &ind
))
9716 error (_("Unknown component name: %s."), name
);
9717 lower
= upper
= ind
;
9720 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9721 error (_("Index in component association out of bounds."));
9723 add_component_interval (lower
, upper
, indices
, num_indices
,
9725 while (lower
<= upper
)
9730 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9736 /* Assign the value of the expression in the OP_OTHERS construct in
9737 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9738 have not been previously assigned. The index intervals already assigned
9739 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9740 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9742 aggregate_assign_others (struct value
*container
,
9743 struct value
*lhs
, struct expression
*exp
,
9744 int *pos
, LONGEST
*indices
, int num_indices
,
9745 LONGEST low
, LONGEST high
)
9748 int expr_pc
= *pos
+ 1;
9750 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9754 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9759 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9762 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9765 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9766 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9767 modifying *SIZE as needed. It is an error if *SIZE exceeds
9768 MAX_SIZE. The resulting intervals do not overlap. */
9770 add_component_interval (LONGEST low
, LONGEST high
,
9771 LONGEST
* indices
, int *size
, int max_size
)
9775 for (i
= 0; i
< *size
; i
+= 2) {
9776 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9780 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9781 if (high
< indices
[kh
])
9783 if (low
< indices
[i
])
9785 indices
[i
+ 1] = indices
[kh
- 1];
9786 if (high
> indices
[i
+ 1])
9787 indices
[i
+ 1] = high
;
9788 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9789 *size
-= kh
- i
- 2;
9792 else if (high
< indices
[i
])
9796 if (*size
== max_size
)
9797 error (_("Internal error: miscounted aggregate components."));
9799 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9800 indices
[j
] = indices
[j
- 2];
9802 indices
[i
+ 1] = high
;
9805 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9808 static struct value
*
9809 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9811 if (type
== ada_check_typedef (value_type (arg2
)))
9814 if (ada_is_fixed_point_type (type
))
9815 return (cast_to_fixed (type
, arg2
));
9817 if (ada_is_fixed_point_type (value_type (arg2
)))
9818 return cast_from_fixed (type
, arg2
);
9820 return value_cast (type
, arg2
);
9823 /* Evaluating Ada expressions, and printing their result.
9824 ------------------------------------------------------
9829 We usually evaluate an Ada expression in order to print its value.
9830 We also evaluate an expression in order to print its type, which
9831 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9832 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9833 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9834 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9837 Evaluating expressions is a little more complicated for Ada entities
9838 than it is for entities in languages such as C. The main reason for
9839 this is that Ada provides types whose definition might be dynamic.
9840 One example of such types is variant records. Or another example
9841 would be an array whose bounds can only be known at run time.
9843 The following description is a general guide as to what should be
9844 done (and what should NOT be done) in order to evaluate an expression
9845 involving such types, and when. This does not cover how the semantic
9846 information is encoded by GNAT as this is covered separatly. For the
9847 document used as the reference for the GNAT encoding, see exp_dbug.ads
9848 in the GNAT sources.
9850 Ideally, we should embed each part of this description next to its
9851 associated code. Unfortunately, the amount of code is so vast right
9852 now that it's hard to see whether the code handling a particular
9853 situation might be duplicated or not. One day, when the code is
9854 cleaned up, this guide might become redundant with the comments
9855 inserted in the code, and we might want to remove it.
9857 2. ``Fixing'' an Entity, the Simple Case:
9858 -----------------------------------------
9860 When evaluating Ada expressions, the tricky issue is that they may
9861 reference entities whose type contents and size are not statically
9862 known. Consider for instance a variant record:
9864 type Rec (Empty : Boolean := True) is record
9867 when False => Value : Integer;
9870 Yes : Rec := (Empty => False, Value => 1);
9871 No : Rec := (empty => True);
9873 The size and contents of that record depends on the value of the
9874 descriminant (Rec.Empty). At this point, neither the debugging
9875 information nor the associated type structure in GDB are able to
9876 express such dynamic types. So what the debugger does is to create
9877 "fixed" versions of the type that applies to the specific object.
9878 We also informally refer to this opperation as "fixing" an object,
9879 which means creating its associated fixed type.
9881 Example: when printing the value of variable "Yes" above, its fixed
9882 type would look like this:
9889 On the other hand, if we printed the value of "No", its fixed type
9896 Things become a little more complicated when trying to fix an entity
9897 with a dynamic type that directly contains another dynamic type,
9898 such as an array of variant records, for instance. There are
9899 two possible cases: Arrays, and records.
9901 3. ``Fixing'' Arrays:
9902 ---------------------
9904 The type structure in GDB describes an array in terms of its bounds,
9905 and the type of its elements. By design, all elements in the array
9906 have the same type and we cannot represent an array of variant elements
9907 using the current type structure in GDB. When fixing an array,
9908 we cannot fix the array element, as we would potentially need one
9909 fixed type per element of the array. As a result, the best we can do
9910 when fixing an array is to produce an array whose bounds and size
9911 are correct (allowing us to read it from memory), but without having
9912 touched its element type. Fixing each element will be done later,
9913 when (if) necessary.
9915 Arrays are a little simpler to handle than records, because the same
9916 amount of memory is allocated for each element of the array, even if
9917 the amount of space actually used by each element differs from element
9918 to element. Consider for instance the following array of type Rec:
9920 type Rec_Array is array (1 .. 2) of Rec;
9922 The actual amount of memory occupied by each element might be different
9923 from element to element, depending on the value of their discriminant.
9924 But the amount of space reserved for each element in the array remains
9925 fixed regardless. So we simply need to compute that size using
9926 the debugging information available, from which we can then determine
9927 the array size (we multiply the number of elements of the array by
9928 the size of each element).
9930 The simplest case is when we have an array of a constrained element
9931 type. For instance, consider the following type declarations:
9933 type Bounded_String (Max_Size : Integer) is
9935 Buffer : String (1 .. Max_Size);
9937 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9939 In this case, the compiler describes the array as an array of
9940 variable-size elements (identified by its XVS suffix) for which
9941 the size can be read in the parallel XVZ variable.
9943 In the case of an array of an unconstrained element type, the compiler
9944 wraps the array element inside a private PAD type. This type should not
9945 be shown to the user, and must be "unwrap"'ed before printing. Note
9946 that we also use the adjective "aligner" in our code to designate
9947 these wrapper types.
9949 In some cases, the size allocated for each element is statically
9950 known. In that case, the PAD type already has the correct size,
9951 and the array element should remain unfixed.
9953 But there are cases when this size is not statically known.
9954 For instance, assuming that "Five" is an integer variable:
9956 type Dynamic is array (1 .. Five) of Integer;
9957 type Wrapper (Has_Length : Boolean := False) is record
9960 when True => Length : Integer;
9964 type Wrapper_Array is array (1 .. 2) of Wrapper;
9966 Hello : Wrapper_Array := (others => (Has_Length => True,
9967 Data => (others => 17),
9971 The debugging info would describe variable Hello as being an
9972 array of a PAD type. The size of that PAD type is not statically
9973 known, but can be determined using a parallel XVZ variable.
9974 In that case, a copy of the PAD type with the correct size should
9975 be used for the fixed array.
9977 3. ``Fixing'' record type objects:
9978 ----------------------------------
9980 Things are slightly different from arrays in the case of dynamic
9981 record types. In this case, in order to compute the associated
9982 fixed type, we need to determine the size and offset of each of
9983 its components. This, in turn, requires us to compute the fixed
9984 type of each of these components.
9986 Consider for instance the example:
9988 type Bounded_String (Max_Size : Natural) is record
9989 Str : String (1 .. Max_Size);
9992 My_String : Bounded_String (Max_Size => 10);
9994 In that case, the position of field "Length" depends on the size
9995 of field Str, which itself depends on the value of the Max_Size
9996 discriminant. In order to fix the type of variable My_String,
9997 we need to fix the type of field Str. Therefore, fixing a variant
9998 record requires us to fix each of its components.
10000 However, if a component does not have a dynamic size, the component
10001 should not be fixed. In particular, fields that use a PAD type
10002 should not fixed. Here is an example where this might happen
10003 (assuming type Rec above):
10005 type Container (Big : Boolean) is record
10009 when True => Another : Integer;
10010 when False => null;
10013 My_Container : Container := (Big => False,
10014 First => (Empty => True),
10017 In that example, the compiler creates a PAD type for component First,
10018 whose size is constant, and then positions the component After just
10019 right after it. The offset of component After is therefore constant
10022 The debugger computes the position of each field based on an algorithm
10023 that uses, among other things, the actual position and size of the field
10024 preceding it. Let's now imagine that the user is trying to print
10025 the value of My_Container. If the type fixing was recursive, we would
10026 end up computing the offset of field After based on the size of the
10027 fixed version of field First. And since in our example First has
10028 only one actual field, the size of the fixed type is actually smaller
10029 than the amount of space allocated to that field, and thus we would
10030 compute the wrong offset of field After.
10032 To make things more complicated, we need to watch out for dynamic
10033 components of variant records (identified by the ___XVL suffix in
10034 the component name). Even if the target type is a PAD type, the size
10035 of that type might not be statically known. So the PAD type needs
10036 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10037 we might end up with the wrong size for our component. This can be
10038 observed with the following type declarations:
10040 type Octal is new Integer range 0 .. 7;
10041 type Octal_Array is array (Positive range <>) of Octal;
10042 pragma Pack (Octal_Array);
10044 type Octal_Buffer (Size : Positive) is record
10045 Buffer : Octal_Array (1 .. Size);
10049 In that case, Buffer is a PAD type whose size is unset and needs
10050 to be computed by fixing the unwrapped type.
10052 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10053 ----------------------------------------------------------
10055 Lastly, when should the sub-elements of an entity that remained unfixed
10056 thus far, be actually fixed?
10058 The answer is: Only when referencing that element. For instance
10059 when selecting one component of a record, this specific component
10060 should be fixed at that point in time. Or when printing the value
10061 of a record, each component should be fixed before its value gets
10062 printed. Similarly for arrays, the element of the array should be
10063 fixed when printing each element of the array, or when extracting
10064 one element out of that array. On the other hand, fixing should
10065 not be performed on the elements when taking a slice of an array!
10067 Note that one of the side-effects of miscomputing the offset and
10068 size of each field is that we end up also miscomputing the size
10069 of the containing type. This can have adverse results when computing
10070 the value of an entity. GDB fetches the value of an entity based
10071 on the size of its type, and thus a wrong size causes GDB to fetch
10072 the wrong amount of memory. In the case where the computed size is
10073 too small, GDB fetches too little data to print the value of our
10074 entiry. Results in this case as unpredicatble, as we usually read
10075 past the buffer containing the data =:-o. */
10077 /* Implement the evaluate_exp routine in the exp_descriptor structure
10078 for the Ada language. */
10080 static struct value
*
10081 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10082 int *pos
, enum noside noside
)
10084 enum exp_opcode op
;
10088 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10091 struct value
**argvec
;
10095 op
= exp
->elts
[pc
].opcode
;
10101 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10103 if (noside
== EVAL_NORMAL
)
10104 arg1
= unwrap_value (arg1
);
10106 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
10107 then we need to perform the conversion manually, because
10108 evaluate_subexp_standard doesn't do it. This conversion is
10109 necessary in Ada because the different kinds of float/fixed
10110 types in Ada have different representations.
10112 Similarly, we need to perform the conversion from OP_LONG
10114 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
10115 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
10121 struct value
*result
;
10124 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10125 /* The result type will have code OP_STRING, bashed there from
10126 OP_ARRAY. Bash it back. */
10127 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10128 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10134 type
= exp
->elts
[pc
+ 1].type
;
10135 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
10136 if (noside
== EVAL_SKIP
)
10138 arg1
= ada_value_cast (type
, arg1
, noside
);
10143 type
= exp
->elts
[pc
+ 1].type
;
10144 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10147 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10148 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10150 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10151 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10153 return ada_value_assign (arg1
, arg1
);
10155 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10156 except if the lhs of our assignment is a convenience variable.
10157 In the case of assigning to a convenience variable, the lhs
10158 should be exactly the result of the evaluation of the rhs. */
10159 type
= value_type (arg1
);
10160 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10162 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10163 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10165 if (ada_is_fixed_point_type (value_type (arg1
)))
10166 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10167 else if (ada_is_fixed_point_type (value_type (arg2
)))
10169 (_("Fixed-point values must be assigned to fixed-point variables"));
10171 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10172 return ada_value_assign (arg1
, arg2
);
10175 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10176 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10177 if (noside
== EVAL_SKIP
)
10179 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10180 return (value_from_longest
10181 (value_type (arg1
),
10182 value_as_long (arg1
) + value_as_long (arg2
)));
10183 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10184 return (value_from_longest
10185 (value_type (arg2
),
10186 value_as_long (arg1
) + value_as_long (arg2
)));
10187 if ((ada_is_fixed_point_type (value_type (arg1
))
10188 || ada_is_fixed_point_type (value_type (arg2
)))
10189 && value_type (arg1
) != value_type (arg2
))
10190 error (_("Operands of fixed-point addition must have the same type"));
10191 /* Do the addition, and cast the result to the type of the first
10192 argument. We cannot cast the result to a reference type, so if
10193 ARG1 is a reference type, find its underlying type. */
10194 type
= value_type (arg1
);
10195 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10196 type
= TYPE_TARGET_TYPE (type
);
10197 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10198 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10201 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10202 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10203 if (noside
== EVAL_SKIP
)
10205 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10206 return (value_from_longest
10207 (value_type (arg1
),
10208 value_as_long (arg1
) - value_as_long (arg2
)));
10209 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10210 return (value_from_longest
10211 (value_type (arg2
),
10212 value_as_long (arg1
) - value_as_long (arg2
)));
10213 if ((ada_is_fixed_point_type (value_type (arg1
))
10214 || ada_is_fixed_point_type (value_type (arg2
)))
10215 && value_type (arg1
) != value_type (arg2
))
10216 error (_("Operands of fixed-point subtraction "
10217 "must have the same type"));
10218 /* Do the substraction, and cast the result to the type of the first
10219 argument. We cannot cast the result to a reference type, so if
10220 ARG1 is a reference type, find its underlying type. */
10221 type
= value_type (arg1
);
10222 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10223 type
= TYPE_TARGET_TYPE (type
);
10224 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10225 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10231 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10232 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10233 if (noside
== EVAL_SKIP
)
10235 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10237 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10238 return value_zero (value_type (arg1
), not_lval
);
10242 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10243 if (ada_is_fixed_point_type (value_type (arg1
)))
10244 arg1
= cast_from_fixed (type
, arg1
);
10245 if (ada_is_fixed_point_type (value_type (arg2
)))
10246 arg2
= cast_from_fixed (type
, arg2
);
10247 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10248 return ada_value_binop (arg1
, arg2
, op
);
10252 case BINOP_NOTEQUAL
:
10253 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10254 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10255 if (noside
== EVAL_SKIP
)
10257 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10261 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10262 tem
= ada_value_equal (arg1
, arg2
);
10264 if (op
== BINOP_NOTEQUAL
)
10266 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10267 return value_from_longest (type
, (LONGEST
) tem
);
10270 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10271 if (noside
== EVAL_SKIP
)
10273 else if (ada_is_fixed_point_type (value_type (arg1
)))
10274 return value_cast (value_type (arg1
), value_neg (arg1
));
10277 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10278 return value_neg (arg1
);
10281 case BINOP_LOGICAL_AND
:
10282 case BINOP_LOGICAL_OR
:
10283 case UNOP_LOGICAL_NOT
:
10288 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10289 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10290 return value_cast (type
, val
);
10293 case BINOP_BITWISE_AND
:
10294 case BINOP_BITWISE_IOR
:
10295 case BINOP_BITWISE_XOR
:
10299 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10301 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10303 return value_cast (value_type (arg1
), val
);
10309 if (noside
== EVAL_SKIP
)
10315 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10316 /* Only encountered when an unresolved symbol occurs in a
10317 context other than a function call, in which case, it is
10319 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10320 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10322 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10324 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10325 /* Check to see if this is a tagged type. We also need to handle
10326 the case where the type is a reference to a tagged type, but
10327 we have to be careful to exclude pointers to tagged types.
10328 The latter should be shown as usual (as a pointer), whereas
10329 a reference should mostly be transparent to the user. */
10330 if (ada_is_tagged_type (type
, 0)
10331 || (TYPE_CODE (type
) == TYPE_CODE_REF
10332 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10334 /* Tagged types are a little special in the fact that the real
10335 type is dynamic and can only be determined by inspecting the
10336 object's tag. This means that we need to get the object's
10337 value first (EVAL_NORMAL) and then extract the actual object
10340 Note that we cannot skip the final step where we extract
10341 the object type from its tag, because the EVAL_NORMAL phase
10342 results in dynamic components being resolved into fixed ones.
10343 This can cause problems when trying to print the type
10344 description of tagged types whose parent has a dynamic size:
10345 We use the type name of the "_parent" component in order
10346 to print the name of the ancestor type in the type description.
10347 If that component had a dynamic size, the resolution into
10348 a fixed type would result in the loss of that type name,
10349 thus preventing us from printing the name of the ancestor
10350 type in the type description. */
10351 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10353 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10355 struct type
*actual_type
;
10357 actual_type
= type_from_tag (ada_value_tag (arg1
));
10358 if (actual_type
== NULL
)
10359 /* If, for some reason, we were unable to determine
10360 the actual type from the tag, then use the static
10361 approximation that we just computed as a fallback.
10362 This can happen if the debugging information is
10363 incomplete, for instance. */
10364 actual_type
= type
;
10365 return value_zero (actual_type
, not_lval
);
10369 /* In the case of a ref, ada_coerce_ref takes care
10370 of determining the actual type. But the evaluation
10371 should return a ref as it should be valid to ask
10372 for its address; so rebuild a ref after coerce. */
10373 arg1
= ada_coerce_ref (arg1
);
10374 return value_ref (arg1
);
10378 /* Records and unions for which GNAT encodings have been
10379 generated need to be statically fixed as well.
10380 Otherwise, non-static fixing produces a type where
10381 all dynamic properties are removed, which prevents "ptype"
10382 from being able to completely describe the type.
10383 For instance, a case statement in a variant record would be
10384 replaced by the relevant components based on the actual
10385 value of the discriminants. */
10386 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10387 && dynamic_template_type (type
) != NULL
)
10388 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10389 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10392 return value_zero (to_static_fixed_type (type
), not_lval
);
10396 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10397 return ada_to_fixed_value (arg1
);
10402 /* Allocate arg vector, including space for the function to be
10403 called in argvec[0] and a terminating NULL. */
10404 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10406 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
10408 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10409 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10410 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10411 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10414 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10415 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10418 if (noside
== EVAL_SKIP
)
10422 if (ada_is_constrained_packed_array_type
10423 (desc_base_type (value_type (argvec
[0]))))
10424 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10425 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10426 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10427 /* This is a packed array that has already been fixed, and
10428 therefore already coerced to a simple array. Nothing further
10431 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
10432 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10433 && VALUE_LVAL (argvec
[0]) == lval_memory
))
10434 argvec
[0] = value_addr (argvec
[0]);
10436 type
= ada_check_typedef (value_type (argvec
[0]));
10438 /* Ada allows us to implicitly dereference arrays when subscripting
10439 them. So, if this is an array typedef (encoding use for array
10440 access types encoded as fat pointers), strip it now. */
10441 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10442 type
= ada_typedef_target_type (type
);
10444 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10446 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10448 case TYPE_CODE_FUNC
:
10449 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10451 case TYPE_CODE_ARRAY
:
10453 case TYPE_CODE_STRUCT
:
10454 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10455 argvec
[0] = ada_value_ind (argvec
[0]);
10456 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10459 error (_("cannot subscript or call something of type `%s'"),
10460 ada_type_name (value_type (argvec
[0])));
10465 switch (TYPE_CODE (type
))
10467 case TYPE_CODE_FUNC
:
10468 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10470 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10472 if (TYPE_GNU_IFUNC (type
))
10473 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10474 return allocate_value (rtype
);
10476 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10477 case TYPE_CODE_INTERNAL_FUNCTION
:
10478 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10479 /* We don't know anything about what the internal
10480 function might return, but we have to return
10482 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10485 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10486 argvec
[0], nargs
, argvec
+ 1);
10488 case TYPE_CODE_STRUCT
:
10492 arity
= ada_array_arity (type
);
10493 type
= ada_array_element_type (type
, nargs
);
10495 error (_("cannot subscript or call a record"));
10496 if (arity
!= nargs
)
10497 error (_("wrong number of subscripts; expecting %d"), arity
);
10498 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10499 return value_zero (ada_aligned_type (type
), lval_memory
);
10501 unwrap_value (ada_value_subscript
10502 (argvec
[0], nargs
, argvec
+ 1));
10504 case TYPE_CODE_ARRAY
:
10505 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10507 type
= ada_array_element_type (type
, nargs
);
10509 error (_("element type of array unknown"));
10511 return value_zero (ada_aligned_type (type
), lval_memory
);
10514 unwrap_value (ada_value_subscript
10515 (ada_coerce_to_simple_array (argvec
[0]),
10516 nargs
, argvec
+ 1));
10517 case TYPE_CODE_PTR
: /* Pointer to array */
10518 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10520 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10521 type
= ada_array_element_type (type
, nargs
);
10523 error (_("element type of array unknown"));
10525 return value_zero (ada_aligned_type (type
), lval_memory
);
10528 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10529 nargs
, argvec
+ 1));
10532 error (_("Attempt to index or call something other than an "
10533 "array or function"));
10538 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10539 struct value
*low_bound_val
=
10540 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10541 struct value
*high_bound_val
=
10542 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10544 LONGEST high_bound
;
10546 low_bound_val
= coerce_ref (low_bound_val
);
10547 high_bound_val
= coerce_ref (high_bound_val
);
10548 low_bound
= pos_atr (low_bound_val
);
10549 high_bound
= pos_atr (high_bound_val
);
10551 if (noside
== EVAL_SKIP
)
10554 /* If this is a reference to an aligner type, then remove all
10556 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10557 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10558 TYPE_TARGET_TYPE (value_type (array
)) =
10559 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10561 if (ada_is_constrained_packed_array_type (value_type (array
)))
10562 error (_("cannot slice a packed array"));
10564 /* If this is a reference to an array or an array lvalue,
10565 convert to a pointer. */
10566 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10567 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10568 && VALUE_LVAL (array
) == lval_memory
))
10569 array
= value_addr (array
);
10571 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10572 && ada_is_array_descriptor_type (ada_check_typedef
10573 (value_type (array
))))
10574 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10576 array
= ada_coerce_to_simple_array_ptr (array
);
10578 /* If we have more than one level of pointer indirection,
10579 dereference the value until we get only one level. */
10580 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10581 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10583 array
= value_ind (array
);
10585 /* Make sure we really do have an array type before going further,
10586 to avoid a SEGV when trying to get the index type or the target
10587 type later down the road if the debug info generated by
10588 the compiler is incorrect or incomplete. */
10589 if (!ada_is_simple_array_type (value_type (array
)))
10590 error (_("cannot take slice of non-array"));
10592 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10595 struct type
*type0
= ada_check_typedef (value_type (array
));
10597 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10598 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10601 struct type
*arr_type0
=
10602 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10604 return ada_value_slice_from_ptr (array
, arr_type0
,
10605 longest_to_int (low_bound
),
10606 longest_to_int (high_bound
));
10609 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10611 else if (high_bound
< low_bound
)
10612 return empty_array (value_type (array
), low_bound
);
10614 return ada_value_slice (array
, longest_to_int (low_bound
),
10615 longest_to_int (high_bound
));
10618 case UNOP_IN_RANGE
:
10620 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10621 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10623 if (noside
== EVAL_SKIP
)
10626 switch (TYPE_CODE (type
))
10629 lim_warning (_("Membership test incompletely implemented; "
10630 "always returns true"));
10631 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10632 return value_from_longest (type
, (LONGEST
) 1);
10634 case TYPE_CODE_RANGE
:
10635 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10636 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10637 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10638 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10639 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10641 value_from_longest (type
,
10642 (value_less (arg1
, arg3
)
10643 || value_equal (arg1
, arg3
))
10644 && (value_less (arg2
, arg1
)
10645 || value_equal (arg2
, arg1
)));
10648 case BINOP_IN_BOUNDS
:
10650 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10651 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10653 if (noside
== EVAL_SKIP
)
10656 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10658 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10659 return value_zero (type
, not_lval
);
10662 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10664 type
= ada_index_type (value_type (arg2
), tem
, "range");
10666 type
= value_type (arg1
);
10668 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10669 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10671 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10672 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10673 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10675 value_from_longest (type
,
10676 (value_less (arg1
, arg3
)
10677 || value_equal (arg1
, arg3
))
10678 && (value_less (arg2
, arg1
)
10679 || value_equal (arg2
, arg1
)));
10681 case TERNOP_IN_RANGE
:
10682 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10683 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10684 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10686 if (noside
== EVAL_SKIP
)
10689 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10690 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10691 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10693 value_from_longest (type
,
10694 (value_less (arg1
, arg3
)
10695 || value_equal (arg1
, arg3
))
10696 && (value_less (arg2
, arg1
)
10697 || value_equal (arg2
, arg1
)));
10701 case OP_ATR_LENGTH
:
10703 struct type
*type_arg
;
10705 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10707 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10709 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10713 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10717 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10718 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10719 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10722 if (noside
== EVAL_SKIP
)
10725 if (type_arg
== NULL
)
10727 arg1
= ada_coerce_ref (arg1
);
10729 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10730 arg1
= ada_coerce_to_simple_array (arg1
);
10732 if (op
== OP_ATR_LENGTH
)
10733 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10736 type
= ada_index_type (value_type (arg1
), tem
,
10737 ada_attribute_name (op
));
10739 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10742 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10743 return allocate_value (type
);
10747 default: /* Should never happen. */
10748 error (_("unexpected attribute encountered"));
10750 return value_from_longest
10751 (type
, ada_array_bound (arg1
, tem
, 0));
10753 return value_from_longest
10754 (type
, ada_array_bound (arg1
, tem
, 1));
10755 case OP_ATR_LENGTH
:
10756 return value_from_longest
10757 (type
, ada_array_length (arg1
, tem
));
10760 else if (discrete_type_p (type_arg
))
10762 struct type
*range_type
;
10763 const char *name
= ada_type_name (type_arg
);
10766 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10767 range_type
= to_fixed_range_type (type_arg
, NULL
);
10768 if (range_type
== NULL
)
10769 range_type
= type_arg
;
10773 error (_("unexpected attribute encountered"));
10775 return value_from_longest
10776 (range_type
, ada_discrete_type_low_bound (range_type
));
10778 return value_from_longest
10779 (range_type
, ada_discrete_type_high_bound (range_type
));
10780 case OP_ATR_LENGTH
:
10781 error (_("the 'length attribute applies only to array types"));
10784 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10785 error (_("unimplemented type attribute"));
10790 if (ada_is_constrained_packed_array_type (type_arg
))
10791 type_arg
= decode_constrained_packed_array_type (type_arg
);
10793 if (op
== OP_ATR_LENGTH
)
10794 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10797 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10799 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10802 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10803 return allocate_value (type
);
10808 error (_("unexpected attribute encountered"));
10810 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10811 return value_from_longest (type
, low
);
10813 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10814 return value_from_longest (type
, high
);
10815 case OP_ATR_LENGTH
:
10816 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10817 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10818 return value_from_longest (type
, high
- low
+ 1);
10824 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10825 if (noside
== EVAL_SKIP
)
10828 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10829 return value_zero (ada_tag_type (arg1
), not_lval
);
10831 return ada_value_tag (arg1
);
10835 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10836 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10837 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10838 if (noside
== EVAL_SKIP
)
10840 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10841 return value_zero (value_type (arg1
), not_lval
);
10844 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10845 return value_binop (arg1
, arg2
,
10846 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10849 case OP_ATR_MODULUS
:
10851 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10853 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10854 if (noside
== EVAL_SKIP
)
10857 if (!ada_is_modular_type (type_arg
))
10858 error (_("'modulus must be applied to modular type"));
10860 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10861 ada_modulus (type_arg
));
10866 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10867 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10868 if (noside
== EVAL_SKIP
)
10870 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10871 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10872 return value_zero (type
, not_lval
);
10874 return value_pos_atr (type
, arg1
);
10877 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10878 type
= value_type (arg1
);
10880 /* If the argument is a reference, then dereference its type, since
10881 the user is really asking for the size of the actual object,
10882 not the size of the pointer. */
10883 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10884 type
= TYPE_TARGET_TYPE (type
);
10886 if (noside
== EVAL_SKIP
)
10888 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10889 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10891 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10892 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10895 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10896 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10897 type
= exp
->elts
[pc
+ 2].type
;
10898 if (noside
== EVAL_SKIP
)
10900 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10901 return value_zero (type
, not_lval
);
10903 return value_val_atr (type
, arg1
);
10906 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10907 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10908 if (noside
== EVAL_SKIP
)
10910 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10911 return value_zero (value_type (arg1
), not_lval
);
10914 /* For integer exponentiation operations,
10915 only promote the first argument. */
10916 if (is_integral_type (value_type (arg2
)))
10917 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10919 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10921 return value_binop (arg1
, arg2
, op
);
10925 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10926 if (noside
== EVAL_SKIP
)
10932 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10933 if (noside
== EVAL_SKIP
)
10935 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10936 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10937 return value_neg (arg1
);
10942 preeval_pos
= *pos
;
10943 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10944 if (noside
== EVAL_SKIP
)
10946 type
= ada_check_typedef (value_type (arg1
));
10947 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10949 if (ada_is_array_descriptor_type (type
))
10950 /* GDB allows dereferencing GNAT array descriptors. */
10952 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10954 if (arrType
== NULL
)
10955 error (_("Attempt to dereference null array pointer."));
10956 return value_at_lazy (arrType
, 0);
10958 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10959 || TYPE_CODE (type
) == TYPE_CODE_REF
10960 /* In C you can dereference an array to get the 1st elt. */
10961 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10963 /* As mentioned in the OP_VAR_VALUE case, tagged types can
10964 only be determined by inspecting the object's tag.
10965 This means that we need to evaluate completely the
10966 expression in order to get its type. */
10968 if ((TYPE_CODE (type
) == TYPE_CODE_REF
10969 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
10970 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
10972 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10974 type
= value_type (ada_value_ind (arg1
));
10978 type
= to_static_fixed_type
10980 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10982 ada_ensure_varsize_limit (type
);
10983 return value_zero (type
, lval_memory
);
10985 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10987 /* GDB allows dereferencing an int. */
10988 if (expect_type
== NULL
)
10989 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10994 to_static_fixed_type (ada_aligned_type (expect_type
));
10995 return value_zero (expect_type
, lval_memory
);
10999 error (_("Attempt to take contents of a non-pointer value."));
11001 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11002 type
= ada_check_typedef (value_type (arg1
));
11004 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11005 /* GDB allows dereferencing an int. If we were given
11006 the expect_type, then use that as the target type.
11007 Otherwise, assume that the target type is an int. */
11009 if (expect_type
!= NULL
)
11010 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11013 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11014 (CORE_ADDR
) value_as_address (arg1
));
11017 if (ada_is_array_descriptor_type (type
))
11018 /* GDB allows dereferencing GNAT array descriptors. */
11019 return ada_coerce_to_simple_array (arg1
);
11021 return ada_value_ind (arg1
);
11023 case STRUCTOP_STRUCT
:
11024 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11025 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11026 preeval_pos
= *pos
;
11027 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11028 if (noside
== EVAL_SKIP
)
11030 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11032 struct type
*type1
= value_type (arg1
);
11034 if (ada_is_tagged_type (type1
, 1))
11036 type
= ada_lookup_struct_elt_type (type1
,
11037 &exp
->elts
[pc
+ 2].string
,
11040 /* If the field is not found, check if it exists in the
11041 extension of this object's type. This means that we
11042 need to evaluate completely the expression. */
11046 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11048 arg1
= ada_value_struct_elt (arg1
,
11049 &exp
->elts
[pc
+ 2].string
,
11051 arg1
= unwrap_value (arg1
);
11052 type
= value_type (ada_to_fixed_value (arg1
));
11057 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11060 return value_zero (ada_aligned_type (type
), lval_memory
);
11063 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11064 arg1
= unwrap_value (arg1
);
11065 return ada_to_fixed_value (arg1
);
11068 /* The value is not supposed to be used. This is here to make it
11069 easier to accommodate expressions that contain types. */
11071 if (noside
== EVAL_SKIP
)
11073 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11074 return allocate_value (exp
->elts
[pc
+ 1].type
);
11076 error (_("Attempt to use a type name as an expression"));
11081 case OP_DISCRETE_RANGE
:
11082 case OP_POSITIONAL
:
11084 if (noside
== EVAL_NORMAL
)
11088 error (_("Undefined name, ambiguous name, or renaming used in "
11089 "component association: %s."), &exp
->elts
[pc
+2].string
);
11091 error (_("Aggregates only allowed on the right of an assignment"));
11093 internal_error (__FILE__
, __LINE__
,
11094 _("aggregate apparently mangled"));
11097 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11099 for (tem
= 0; tem
< nargs
; tem
+= 1)
11100 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11105 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
11111 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11112 type name that encodes the 'small and 'delta information.
11113 Otherwise, return NULL. */
11115 static const char *
11116 fixed_type_info (struct type
*type
)
11118 const char *name
= ada_type_name (type
);
11119 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11121 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11123 const char *tail
= strstr (name
, "___XF_");
11130 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11131 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11136 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11139 ada_is_fixed_point_type (struct type
*type
)
11141 return fixed_type_info (type
) != NULL
;
11144 /* Return non-zero iff TYPE represents a System.Address type. */
11147 ada_is_system_address_type (struct type
*type
)
11149 return (TYPE_NAME (type
)
11150 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11153 /* Assuming that TYPE is the representation of an Ada fixed-point
11154 type, return its delta, or -1 if the type is malformed and the
11155 delta cannot be determined. */
11158 ada_delta (struct type
*type
)
11160 const char *encoding
= fixed_type_info (type
);
11163 /* Strictly speaking, num and den are encoded as integer. However,
11164 they may not fit into a long, and they will have to be converted
11165 to DOUBLEST anyway. So scan them as DOUBLEST. */
11166 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11173 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11174 factor ('SMALL value) associated with the type. */
11177 scaling_factor (struct type
*type
)
11179 const char *encoding
= fixed_type_info (type
);
11180 DOUBLEST num0
, den0
, num1
, den1
;
11183 /* Strictly speaking, num's and den's are encoded as integer. However,
11184 they may not fit into a long, and they will have to be converted
11185 to DOUBLEST anyway. So scan them as DOUBLEST. */
11186 n
= sscanf (encoding
,
11187 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
11188 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11189 &num0
, &den0
, &num1
, &den1
);
11194 return num1
/ den1
;
11196 return num0
/ den0
;
11200 /* Assuming that X is the representation of a value of fixed-point
11201 type TYPE, return its floating-point equivalent. */
11204 ada_fixed_to_float (struct type
*type
, LONGEST x
)
11206 return (DOUBLEST
) x
*scaling_factor (type
);
11209 /* The representation of a fixed-point value of type TYPE
11210 corresponding to the value X. */
11213 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
11215 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
11222 /* Scan STR beginning at position K for a discriminant name, and
11223 return the value of that discriminant field of DVAL in *PX. If
11224 PNEW_K is not null, put the position of the character beyond the
11225 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11226 not alter *PX and *PNEW_K if unsuccessful. */
11229 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11232 static char *bound_buffer
= NULL
;
11233 static size_t bound_buffer_len
= 0;
11236 struct value
*bound_val
;
11238 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11241 pend
= strstr (str
+ k
, "__");
11245 k
+= strlen (bound
);
11249 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
11250 bound
= bound_buffer
;
11251 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
11252 bound
[pend
- (str
+ k
)] = '\0';
11256 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11257 if (bound_val
== NULL
)
11260 *px
= value_as_long (bound_val
);
11261 if (pnew_k
!= NULL
)
11266 /* Value of variable named NAME in the current environment. If
11267 no such variable found, then if ERR_MSG is null, returns 0, and
11268 otherwise causes an error with message ERR_MSG. */
11270 static struct value
*
11271 get_var_value (char *name
, char *err_msg
)
11273 struct ada_symbol_info
*syms
;
11276 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11281 if (err_msg
== NULL
)
11284 error (("%s"), err_msg
);
11287 return value_of_variable (syms
[0].sym
, syms
[0].block
);
11290 /* Value of integer variable named NAME in the current environment. If
11291 no such variable found, returns 0, and sets *FLAG to 0. If
11292 successful, sets *FLAG to 1. */
11295 get_int_var_value (char *name
, int *flag
)
11297 struct value
*var_val
= get_var_value (name
, 0);
11309 return value_as_long (var_val
);
11314 /* Return a range type whose base type is that of the range type named
11315 NAME in the current environment, and whose bounds are calculated
11316 from NAME according to the GNAT range encoding conventions.
11317 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11318 corresponding range type from debug information; fall back to using it
11319 if symbol lookup fails. If a new type must be created, allocate it
11320 like ORIG_TYPE was. The bounds information, in general, is encoded
11321 in NAME, the base type given in the named range type. */
11323 static struct type
*
11324 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11327 struct type
*base_type
;
11328 char *subtype_info
;
11330 gdb_assert (raw_type
!= NULL
);
11331 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11333 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11334 base_type
= TYPE_TARGET_TYPE (raw_type
);
11336 base_type
= raw_type
;
11338 name
= TYPE_NAME (raw_type
);
11339 subtype_info
= strstr (name
, "___XD");
11340 if (subtype_info
== NULL
)
11342 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11343 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11345 if (L
< INT_MIN
|| U
> INT_MAX
)
11348 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11353 static char *name_buf
= NULL
;
11354 static size_t name_len
= 0;
11355 int prefix_len
= subtype_info
- name
;
11361 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11362 strncpy (name_buf
, name
, prefix_len
);
11363 name_buf
[prefix_len
] = '\0';
11366 bounds_str
= strchr (subtype_info
, '_');
11369 if (*subtype_info
== 'L')
11371 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11372 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11374 if (bounds_str
[n
] == '_')
11376 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11384 strcpy (name_buf
+ prefix_len
, "___L");
11385 L
= get_int_var_value (name_buf
, &ok
);
11388 lim_warning (_("Unknown lower bound, using 1."));
11393 if (*subtype_info
== 'U')
11395 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11396 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11403 strcpy (name_buf
+ prefix_len
, "___U");
11404 U
= get_int_var_value (name_buf
, &ok
);
11407 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11412 type
= create_static_range_type (alloc_type_copy (raw_type
),
11414 TYPE_NAME (type
) = name
;
11419 /* True iff NAME is the name of a range type. */
11422 ada_is_range_type_name (const char *name
)
11424 return (name
!= NULL
&& strstr (name
, "___XD"));
11428 /* Modular types */
11430 /* True iff TYPE is an Ada modular type. */
11433 ada_is_modular_type (struct type
*type
)
11435 struct type
*subranged_type
= get_base_type (type
);
11437 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11438 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11439 && TYPE_UNSIGNED (subranged_type
));
11442 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11445 ada_modulus (struct type
*type
)
11447 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11451 /* Ada exception catchpoint support:
11452 ---------------------------------
11454 We support 3 kinds of exception catchpoints:
11455 . catchpoints on Ada exceptions
11456 . catchpoints on unhandled Ada exceptions
11457 . catchpoints on failed assertions
11459 Exceptions raised during failed assertions, or unhandled exceptions
11460 could perfectly be caught with the general catchpoint on Ada exceptions.
11461 However, we can easily differentiate these two special cases, and having
11462 the option to distinguish these two cases from the rest can be useful
11463 to zero-in on certain situations.
11465 Exception catchpoints are a specialized form of breakpoint,
11466 since they rely on inserting breakpoints inside known routines
11467 of the GNAT runtime. The implementation therefore uses a standard
11468 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11471 Support in the runtime for exception catchpoints have been changed
11472 a few times already, and these changes affect the implementation
11473 of these catchpoints. In order to be able to support several
11474 variants of the runtime, we use a sniffer that will determine
11475 the runtime variant used by the program being debugged. */
11477 /* Ada's standard exceptions.
11479 The Ada 83 standard also defined Numeric_Error. But there so many
11480 situations where it was unclear from the Ada 83 Reference Manual
11481 (RM) whether Constraint_Error or Numeric_Error should be raised,
11482 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11483 Interpretation saying that anytime the RM says that Numeric_Error
11484 should be raised, the implementation may raise Constraint_Error.
11485 Ada 95 went one step further and pretty much removed Numeric_Error
11486 from the list of standard exceptions (it made it a renaming of
11487 Constraint_Error, to help preserve compatibility when compiling
11488 an Ada83 compiler). As such, we do not include Numeric_Error from
11489 this list of standard exceptions. */
11491 static char *standard_exc
[] = {
11492 "constraint_error",
11498 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11500 /* A structure that describes how to support exception catchpoints
11501 for a given executable. */
11503 struct exception_support_info
11505 /* The name of the symbol to break on in order to insert
11506 a catchpoint on exceptions. */
11507 const char *catch_exception_sym
;
11509 /* The name of the symbol to break on in order to insert
11510 a catchpoint on unhandled exceptions. */
11511 const char *catch_exception_unhandled_sym
;
11513 /* The name of the symbol to break on in order to insert
11514 a catchpoint on failed assertions. */
11515 const char *catch_assert_sym
;
11517 /* Assuming that the inferior just triggered an unhandled exception
11518 catchpoint, this function is responsible for returning the address
11519 in inferior memory where the name of that exception is stored.
11520 Return zero if the address could not be computed. */
11521 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11524 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11525 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11527 /* The following exception support info structure describes how to
11528 implement exception catchpoints with the latest version of the
11529 Ada runtime (as of 2007-03-06). */
11531 static const struct exception_support_info default_exception_support_info
=
11533 "__gnat_debug_raise_exception", /* catch_exception_sym */
11534 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11535 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11536 ada_unhandled_exception_name_addr
11539 /* The following exception support info structure describes how to
11540 implement exception catchpoints with a slightly older version
11541 of the Ada runtime. */
11543 static const struct exception_support_info exception_support_info_fallback
=
11545 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11546 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11547 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11548 ada_unhandled_exception_name_addr_from_raise
11551 /* Return nonzero if we can detect the exception support routines
11552 described in EINFO.
11554 This function errors out if an abnormal situation is detected
11555 (for instance, if we find the exception support routines, but
11556 that support is found to be incomplete). */
11559 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11561 struct symbol
*sym
;
11563 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11564 that should be compiled with debugging information. As a result, we
11565 expect to find that symbol in the symtabs. */
11567 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11570 /* Perhaps we did not find our symbol because the Ada runtime was
11571 compiled without debugging info, or simply stripped of it.
11572 It happens on some GNU/Linux distributions for instance, where
11573 users have to install a separate debug package in order to get
11574 the runtime's debugging info. In that situation, let the user
11575 know why we cannot insert an Ada exception catchpoint.
11577 Note: Just for the purpose of inserting our Ada exception
11578 catchpoint, we could rely purely on the associated minimal symbol.
11579 But we would be operating in degraded mode anyway, since we are
11580 still lacking the debugging info needed later on to extract
11581 the name of the exception being raised (this name is printed in
11582 the catchpoint message, and is also used when trying to catch
11583 a specific exception). We do not handle this case for now. */
11584 struct bound_minimal_symbol msym
11585 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11587 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11588 error (_("Your Ada runtime appears to be missing some debugging "
11589 "information.\nCannot insert Ada exception catchpoint "
11590 "in this configuration."));
11595 /* Make sure that the symbol we found corresponds to a function. */
11597 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11598 error (_("Symbol \"%s\" is not a function (class = %d)"),
11599 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11604 /* Inspect the Ada runtime and determine which exception info structure
11605 should be used to provide support for exception catchpoints.
11607 This function will always set the per-inferior exception_info,
11608 or raise an error. */
11611 ada_exception_support_info_sniffer (void)
11613 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11615 /* If the exception info is already known, then no need to recompute it. */
11616 if (data
->exception_info
!= NULL
)
11619 /* Check the latest (default) exception support info. */
11620 if (ada_has_this_exception_support (&default_exception_support_info
))
11622 data
->exception_info
= &default_exception_support_info
;
11626 /* Try our fallback exception suport info. */
11627 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11629 data
->exception_info
= &exception_support_info_fallback
;
11633 /* Sometimes, it is normal for us to not be able to find the routine
11634 we are looking for. This happens when the program is linked with
11635 the shared version of the GNAT runtime, and the program has not been
11636 started yet. Inform the user of these two possible causes if
11639 if (ada_update_initial_language (language_unknown
) != language_ada
)
11640 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11642 /* If the symbol does not exist, then check that the program is
11643 already started, to make sure that shared libraries have been
11644 loaded. If it is not started, this may mean that the symbol is
11645 in a shared library. */
11647 if (ptid_get_pid (inferior_ptid
) == 0)
11648 error (_("Unable to insert catchpoint. Try to start the program first."));
11650 /* At this point, we know that we are debugging an Ada program and
11651 that the inferior has been started, but we still are not able to
11652 find the run-time symbols. That can mean that we are in
11653 configurable run time mode, or that a-except as been optimized
11654 out by the linker... In any case, at this point it is not worth
11655 supporting this feature. */
11657 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11660 /* True iff FRAME is very likely to be that of a function that is
11661 part of the runtime system. This is all very heuristic, but is
11662 intended to be used as advice as to what frames are uninteresting
11666 is_known_support_routine (struct frame_info
*frame
)
11668 struct symtab_and_line sal
;
11670 enum language func_lang
;
11672 const char *fullname
;
11674 /* If this code does not have any debugging information (no symtab),
11675 This cannot be any user code. */
11677 find_frame_sal (frame
, &sal
);
11678 if (sal
.symtab
== NULL
)
11681 /* If there is a symtab, but the associated source file cannot be
11682 located, then assume this is not user code: Selecting a frame
11683 for which we cannot display the code would not be very helpful
11684 for the user. This should also take care of case such as VxWorks
11685 where the kernel has some debugging info provided for a few units. */
11687 fullname
= symtab_to_fullname (sal
.symtab
);
11688 if (access (fullname
, R_OK
) != 0)
11691 /* Check the unit filename againt the Ada runtime file naming.
11692 We also check the name of the objfile against the name of some
11693 known system libraries that sometimes come with debugging info
11696 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11698 re_comp (known_runtime_file_name_patterns
[i
]);
11699 if (re_exec (lbasename (sal
.symtab
->filename
)))
11701 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11702 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11706 /* Check whether the function is a GNAT-generated entity. */
11708 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
11709 if (func_name
== NULL
)
11712 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11714 re_comp (known_auxiliary_function_name_patterns
[i
]);
11715 if (re_exec (func_name
))
11726 /* Find the first frame that contains debugging information and that is not
11727 part of the Ada run-time, starting from FI and moving upward. */
11730 ada_find_printable_frame (struct frame_info
*fi
)
11732 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11734 if (!is_known_support_routine (fi
))
11743 /* Assuming that the inferior just triggered an unhandled exception
11744 catchpoint, return the address in inferior memory where the name
11745 of the exception is stored.
11747 Return zero if the address could not be computed. */
11750 ada_unhandled_exception_name_addr (void)
11752 return parse_and_eval_address ("e.full_name");
11755 /* Same as ada_unhandled_exception_name_addr, except that this function
11756 should be used when the inferior uses an older version of the runtime,
11757 where the exception name needs to be extracted from a specific frame
11758 several frames up in the callstack. */
11761 ada_unhandled_exception_name_addr_from_raise (void)
11764 struct frame_info
*fi
;
11765 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11766 struct cleanup
*old_chain
;
11768 /* To determine the name of this exception, we need to select
11769 the frame corresponding to RAISE_SYM_NAME. This frame is
11770 at least 3 levels up, so we simply skip the first 3 frames
11771 without checking the name of their associated function. */
11772 fi
= get_current_frame ();
11773 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11775 fi
= get_prev_frame (fi
);
11777 old_chain
= make_cleanup (null_cleanup
, NULL
);
11781 enum language func_lang
;
11783 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
11784 if (func_name
!= NULL
)
11786 make_cleanup (xfree
, func_name
);
11788 if (strcmp (func_name
,
11789 data
->exception_info
->catch_exception_sym
) == 0)
11790 break; /* We found the frame we were looking for... */
11791 fi
= get_prev_frame (fi
);
11794 do_cleanups (old_chain
);
11800 return parse_and_eval_address ("id.full_name");
11803 /* Assuming the inferior just triggered an Ada exception catchpoint
11804 (of any type), return the address in inferior memory where the name
11805 of the exception is stored, if applicable.
11807 Return zero if the address could not be computed, or if not relevant. */
11810 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11811 struct breakpoint
*b
)
11813 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11817 case ada_catch_exception
:
11818 return (parse_and_eval_address ("e.full_name"));
11821 case ada_catch_exception_unhandled
:
11822 return data
->exception_info
->unhandled_exception_name_addr ();
11825 case ada_catch_assert
:
11826 return 0; /* Exception name is not relevant in this case. */
11830 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11834 return 0; /* Should never be reached. */
11837 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11838 any error that ada_exception_name_addr_1 might cause to be thrown.
11839 When an error is intercepted, a warning with the error message is printed,
11840 and zero is returned. */
11843 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11844 struct breakpoint
*b
)
11846 CORE_ADDR result
= 0;
11850 result
= ada_exception_name_addr_1 (ex
, b
);
11853 CATCH (e
, RETURN_MASK_ERROR
)
11855 warning (_("failed to get exception name: %s"), e
.message
);
11863 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11865 /* Ada catchpoints.
11867 In the case of catchpoints on Ada exceptions, the catchpoint will
11868 stop the target on every exception the program throws. When a user
11869 specifies the name of a specific exception, we translate this
11870 request into a condition expression (in text form), and then parse
11871 it into an expression stored in each of the catchpoint's locations.
11872 We then use this condition to check whether the exception that was
11873 raised is the one the user is interested in. If not, then the
11874 target is resumed again. We store the name of the requested
11875 exception, in order to be able to re-set the condition expression
11876 when symbols change. */
11878 /* An instance of this type is used to represent an Ada catchpoint
11879 breakpoint location. It includes a "struct bp_location" as a kind
11880 of base class; users downcast to "struct bp_location *" when
11883 struct ada_catchpoint_location
11885 /* The base class. */
11886 struct bp_location base
;
11888 /* The condition that checks whether the exception that was raised
11889 is the specific exception the user specified on catchpoint
11891 struct expression
*excep_cond_expr
;
11894 /* Implement the DTOR method in the bp_location_ops structure for all
11895 Ada exception catchpoint kinds. */
11898 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11900 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11902 xfree (al
->excep_cond_expr
);
11905 /* The vtable to be used in Ada catchpoint locations. */
11907 static const struct bp_location_ops ada_catchpoint_location_ops
=
11909 ada_catchpoint_location_dtor
11912 /* An instance of this type is used to represent an Ada catchpoint.
11913 It includes a "struct breakpoint" as a kind of base class; users
11914 downcast to "struct breakpoint *" when needed. */
11916 struct ada_catchpoint
11918 /* The base class. */
11919 struct breakpoint base
;
11921 /* The name of the specific exception the user specified. */
11922 char *excep_string
;
11925 /* Parse the exception condition string in the context of each of the
11926 catchpoint's locations, and store them for later evaluation. */
11929 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11931 struct cleanup
*old_chain
;
11932 struct bp_location
*bl
;
11935 /* Nothing to do if there's no specific exception to catch. */
11936 if (c
->excep_string
== NULL
)
11939 /* Same if there are no locations... */
11940 if (c
->base
.loc
== NULL
)
11943 /* Compute the condition expression in text form, from the specific
11944 expection we want to catch. */
11945 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11946 old_chain
= make_cleanup (xfree
, cond_string
);
11948 /* Iterate over all the catchpoint's locations, and parse an
11949 expression for each. */
11950 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11952 struct ada_catchpoint_location
*ada_loc
11953 = (struct ada_catchpoint_location
*) bl
;
11954 struct expression
*exp
= NULL
;
11956 if (!bl
->shlib_disabled
)
11963 exp
= parse_exp_1 (&s
, bl
->address
,
11964 block_for_pc (bl
->address
), 0);
11966 CATCH (e
, RETURN_MASK_ERROR
)
11968 warning (_("failed to reevaluate internal exception condition "
11969 "for catchpoint %d: %s"),
11970 c
->base
.number
, e
.message
);
11971 /* There is a bug in GCC on sparc-solaris when building with
11972 optimization which causes EXP to change unexpectedly
11973 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
11974 The problem should be fixed starting with GCC 4.9.
11975 In the meantime, work around it by forcing EXP back
11982 ada_loc
->excep_cond_expr
= exp
;
11985 do_cleanups (old_chain
);
11988 /* Implement the DTOR method in the breakpoint_ops structure for all
11989 exception catchpoint kinds. */
11992 dtor_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11994 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11996 xfree (c
->excep_string
);
11998 bkpt_breakpoint_ops
.dtor (b
);
12001 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12002 structure for all exception catchpoint kinds. */
12004 static struct bp_location
*
12005 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
12006 struct breakpoint
*self
)
12008 struct ada_catchpoint_location
*loc
;
12010 loc
= XNEW (struct ada_catchpoint_location
);
12011 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
12012 loc
->excep_cond_expr
= NULL
;
12016 /* Implement the RE_SET method in the breakpoint_ops structure for all
12017 exception catchpoint kinds. */
12020 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
12022 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12024 /* Call the base class's method. This updates the catchpoint's
12026 bkpt_breakpoint_ops
.re_set (b
);
12028 /* Reparse the exception conditional expressions. One for each
12030 create_excep_cond_exprs (c
);
12033 /* Returns true if we should stop for this breakpoint hit. If the
12034 user specified a specific exception, we only want to cause a stop
12035 if the program thrown that exception. */
12038 should_stop_exception (const struct bp_location
*bl
)
12040 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12041 const struct ada_catchpoint_location
*ada_loc
12042 = (const struct ada_catchpoint_location
*) bl
;
12045 /* With no specific exception, should always stop. */
12046 if (c
->excep_string
== NULL
)
12049 if (ada_loc
->excep_cond_expr
== NULL
)
12051 /* We will have a NULL expression if back when we were creating
12052 the expressions, this location's had failed to parse. */
12059 struct value
*mark
;
12061 mark
= value_mark ();
12062 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
12063 value_free_to_mark (mark
);
12065 CATCH (ex
, RETURN_MASK_ALL
)
12067 exception_fprintf (gdb_stderr
, ex
,
12068 _("Error in testing exception condition:\n"));
12075 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12076 for all exception catchpoint kinds. */
12079 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12081 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12084 /* Implement the PRINT_IT method in the breakpoint_ops structure
12085 for all exception catchpoint kinds. */
12087 static enum print_stop_action
12088 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12090 struct ui_out
*uiout
= current_uiout
;
12091 struct breakpoint
*b
= bs
->breakpoint_at
;
12093 annotate_catchpoint (b
->number
);
12095 if (ui_out_is_mi_like_p (uiout
))
12097 ui_out_field_string (uiout
, "reason",
12098 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12099 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
12102 ui_out_text (uiout
,
12103 b
->disposition
== disp_del
? "\nTemporary catchpoint "
12104 : "\nCatchpoint ");
12105 ui_out_field_int (uiout
, "bkptno", b
->number
);
12106 ui_out_text (uiout
, ", ");
12110 case ada_catch_exception
:
12111 case ada_catch_exception_unhandled
:
12113 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
12114 char exception_name
[256];
12118 read_memory (addr
, (gdb_byte
*) exception_name
,
12119 sizeof (exception_name
) - 1);
12120 exception_name
[sizeof (exception_name
) - 1] = '\0';
12124 /* For some reason, we were unable to read the exception
12125 name. This could happen if the Runtime was compiled
12126 without debugging info, for instance. In that case,
12127 just replace the exception name by the generic string
12128 "exception" - it will read as "an exception" in the
12129 notification we are about to print. */
12130 memcpy (exception_name
, "exception", sizeof ("exception"));
12132 /* In the case of unhandled exception breakpoints, we print
12133 the exception name as "unhandled EXCEPTION_NAME", to make
12134 it clearer to the user which kind of catchpoint just got
12135 hit. We used ui_out_text to make sure that this extra
12136 info does not pollute the exception name in the MI case. */
12137 if (ex
== ada_catch_exception_unhandled
)
12138 ui_out_text (uiout
, "unhandled ");
12139 ui_out_field_string (uiout
, "exception-name", exception_name
);
12142 case ada_catch_assert
:
12143 /* In this case, the name of the exception is not really
12144 important. Just print "failed assertion" to make it clearer
12145 that his program just hit an assertion-failure catchpoint.
12146 We used ui_out_text because this info does not belong in
12148 ui_out_text (uiout
, "failed assertion");
12151 ui_out_text (uiout
, " at ");
12152 ada_find_printable_frame (get_current_frame ());
12154 return PRINT_SRC_AND_LOC
;
12157 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12158 for all exception catchpoint kinds. */
12161 print_one_exception (enum ada_exception_catchpoint_kind ex
,
12162 struct breakpoint
*b
, struct bp_location
**last_loc
)
12164 struct ui_out
*uiout
= current_uiout
;
12165 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12166 struct value_print_options opts
;
12168 get_user_print_options (&opts
);
12169 if (opts
.addressprint
)
12171 annotate_field (4);
12172 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
12175 annotate_field (5);
12176 *last_loc
= b
->loc
;
12179 case ada_catch_exception
:
12180 if (c
->excep_string
!= NULL
)
12182 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12184 ui_out_field_string (uiout
, "what", msg
);
12188 ui_out_field_string (uiout
, "what", "all Ada exceptions");
12192 case ada_catch_exception_unhandled
:
12193 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
12196 case ada_catch_assert
:
12197 ui_out_field_string (uiout
, "what", "failed Ada assertions");
12201 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12206 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12207 for all exception catchpoint kinds. */
12210 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12211 struct breakpoint
*b
)
12213 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12214 struct ui_out
*uiout
= current_uiout
;
12216 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
12217 : _("Catchpoint "));
12218 ui_out_field_int (uiout
, "bkptno", b
->number
);
12219 ui_out_text (uiout
, ": ");
12223 case ada_catch_exception
:
12224 if (c
->excep_string
!= NULL
)
12226 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12227 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12229 ui_out_text (uiout
, info
);
12230 do_cleanups (old_chain
);
12233 ui_out_text (uiout
, _("all Ada exceptions"));
12236 case ada_catch_exception_unhandled
:
12237 ui_out_text (uiout
, _("unhandled Ada exceptions"));
12240 case ada_catch_assert
:
12241 ui_out_text (uiout
, _("failed Ada assertions"));
12245 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12250 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12251 for all exception catchpoint kinds. */
12254 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12255 struct breakpoint
*b
, struct ui_file
*fp
)
12257 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12261 case ada_catch_exception
:
12262 fprintf_filtered (fp
, "catch exception");
12263 if (c
->excep_string
!= NULL
)
12264 fprintf_filtered (fp
, " %s", c
->excep_string
);
12267 case ada_catch_exception_unhandled
:
12268 fprintf_filtered (fp
, "catch exception unhandled");
12271 case ada_catch_assert
:
12272 fprintf_filtered (fp
, "catch assert");
12276 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12278 print_recreate_thread (b
, fp
);
12281 /* Virtual table for "catch exception" breakpoints. */
12284 dtor_catch_exception (struct breakpoint
*b
)
12286 dtor_exception (ada_catch_exception
, b
);
12289 static struct bp_location
*
12290 allocate_location_catch_exception (struct breakpoint
*self
)
12292 return allocate_location_exception (ada_catch_exception
, self
);
12296 re_set_catch_exception (struct breakpoint
*b
)
12298 re_set_exception (ada_catch_exception
, b
);
12302 check_status_catch_exception (bpstat bs
)
12304 check_status_exception (ada_catch_exception
, bs
);
12307 static enum print_stop_action
12308 print_it_catch_exception (bpstat bs
)
12310 return print_it_exception (ada_catch_exception
, bs
);
12314 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12316 print_one_exception (ada_catch_exception
, b
, last_loc
);
12320 print_mention_catch_exception (struct breakpoint
*b
)
12322 print_mention_exception (ada_catch_exception
, b
);
12326 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12328 print_recreate_exception (ada_catch_exception
, b
, fp
);
12331 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12333 /* Virtual table for "catch exception unhandled" breakpoints. */
12336 dtor_catch_exception_unhandled (struct breakpoint
*b
)
12338 dtor_exception (ada_catch_exception_unhandled
, b
);
12341 static struct bp_location
*
12342 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12344 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12348 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12350 re_set_exception (ada_catch_exception_unhandled
, b
);
12354 check_status_catch_exception_unhandled (bpstat bs
)
12356 check_status_exception (ada_catch_exception_unhandled
, bs
);
12359 static enum print_stop_action
12360 print_it_catch_exception_unhandled (bpstat bs
)
12362 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12366 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12367 struct bp_location
**last_loc
)
12369 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12373 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12375 print_mention_exception (ada_catch_exception_unhandled
, b
);
12379 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12380 struct ui_file
*fp
)
12382 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12385 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12387 /* Virtual table for "catch assert" breakpoints. */
12390 dtor_catch_assert (struct breakpoint
*b
)
12392 dtor_exception (ada_catch_assert
, b
);
12395 static struct bp_location
*
12396 allocate_location_catch_assert (struct breakpoint
*self
)
12398 return allocate_location_exception (ada_catch_assert
, self
);
12402 re_set_catch_assert (struct breakpoint
*b
)
12404 re_set_exception (ada_catch_assert
, b
);
12408 check_status_catch_assert (bpstat bs
)
12410 check_status_exception (ada_catch_assert
, bs
);
12413 static enum print_stop_action
12414 print_it_catch_assert (bpstat bs
)
12416 return print_it_exception (ada_catch_assert
, bs
);
12420 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12422 print_one_exception (ada_catch_assert
, b
, last_loc
);
12426 print_mention_catch_assert (struct breakpoint
*b
)
12428 print_mention_exception (ada_catch_assert
, b
);
12432 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12434 print_recreate_exception (ada_catch_assert
, b
, fp
);
12437 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12439 /* Return a newly allocated copy of the first space-separated token
12440 in ARGSP, and then adjust ARGSP to point immediately after that
12443 Return NULL if ARGPS does not contain any more tokens. */
12446 ada_get_next_arg (char **argsp
)
12448 char *args
= *argsp
;
12452 args
= skip_spaces (args
);
12453 if (args
[0] == '\0')
12454 return NULL
; /* No more arguments. */
12456 /* Find the end of the current argument. */
12458 end
= skip_to_space (args
);
12460 /* Adjust ARGSP to point to the start of the next argument. */
12464 /* Make a copy of the current argument and return it. */
12466 result
= xmalloc (end
- args
+ 1);
12467 strncpy (result
, args
, end
- args
);
12468 result
[end
- args
] = '\0';
12473 /* Split the arguments specified in a "catch exception" command.
12474 Set EX to the appropriate catchpoint type.
12475 Set EXCEP_STRING to the name of the specific exception if
12476 specified by the user.
12477 If a condition is found at the end of the arguments, the condition
12478 expression is stored in COND_STRING (memory must be deallocated
12479 after use). Otherwise COND_STRING is set to NULL. */
12482 catch_ada_exception_command_split (char *args
,
12483 enum ada_exception_catchpoint_kind
*ex
,
12484 char **excep_string
,
12485 char **cond_string
)
12487 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12488 char *exception_name
;
12491 exception_name
= ada_get_next_arg (&args
);
12492 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12494 /* This is not an exception name; this is the start of a condition
12495 expression for a catchpoint on all exceptions. So, "un-get"
12496 this token, and set exception_name to NULL. */
12497 xfree (exception_name
);
12498 exception_name
= NULL
;
12501 make_cleanup (xfree
, exception_name
);
12503 /* Check to see if we have a condition. */
12505 args
= skip_spaces (args
);
12506 if (startswith (args
, "if")
12507 && (isspace (args
[2]) || args
[2] == '\0'))
12510 args
= skip_spaces (args
);
12512 if (args
[0] == '\0')
12513 error (_("Condition missing after `if' keyword"));
12514 cond
= xstrdup (args
);
12515 make_cleanup (xfree
, cond
);
12517 args
+= strlen (args
);
12520 /* Check that we do not have any more arguments. Anything else
12523 if (args
[0] != '\0')
12524 error (_("Junk at end of expression"));
12526 discard_cleanups (old_chain
);
12528 if (exception_name
== NULL
)
12530 /* Catch all exceptions. */
12531 *ex
= ada_catch_exception
;
12532 *excep_string
= NULL
;
12534 else if (strcmp (exception_name
, "unhandled") == 0)
12536 /* Catch unhandled exceptions. */
12537 *ex
= ada_catch_exception_unhandled
;
12538 *excep_string
= NULL
;
12542 /* Catch a specific exception. */
12543 *ex
= ada_catch_exception
;
12544 *excep_string
= exception_name
;
12546 *cond_string
= cond
;
12549 /* Return the name of the symbol on which we should break in order to
12550 implement a catchpoint of the EX kind. */
12552 static const char *
12553 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12555 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12557 gdb_assert (data
->exception_info
!= NULL
);
12561 case ada_catch_exception
:
12562 return (data
->exception_info
->catch_exception_sym
);
12564 case ada_catch_exception_unhandled
:
12565 return (data
->exception_info
->catch_exception_unhandled_sym
);
12567 case ada_catch_assert
:
12568 return (data
->exception_info
->catch_assert_sym
);
12571 internal_error (__FILE__
, __LINE__
,
12572 _("unexpected catchpoint kind (%d)"), ex
);
12576 /* Return the breakpoint ops "virtual table" used for catchpoints
12579 static const struct breakpoint_ops
*
12580 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12584 case ada_catch_exception
:
12585 return (&catch_exception_breakpoint_ops
);
12587 case ada_catch_exception_unhandled
:
12588 return (&catch_exception_unhandled_breakpoint_ops
);
12590 case ada_catch_assert
:
12591 return (&catch_assert_breakpoint_ops
);
12594 internal_error (__FILE__
, __LINE__
,
12595 _("unexpected catchpoint kind (%d)"), ex
);
12599 /* Return the condition that will be used to match the current exception
12600 being raised with the exception that the user wants to catch. This
12601 assumes that this condition is used when the inferior just triggered
12602 an exception catchpoint.
12604 The string returned is a newly allocated string that needs to be
12605 deallocated later. */
12608 ada_exception_catchpoint_cond_string (const char *excep_string
)
12612 /* The standard exceptions are a special case. They are defined in
12613 runtime units that have been compiled without debugging info; if
12614 EXCEP_STRING is the not-fully-qualified name of a standard
12615 exception (e.g. "constraint_error") then, during the evaluation
12616 of the condition expression, the symbol lookup on this name would
12617 *not* return this standard exception. The catchpoint condition
12618 may then be set only on user-defined exceptions which have the
12619 same not-fully-qualified name (e.g. my_package.constraint_error).
12621 To avoid this unexcepted behavior, these standard exceptions are
12622 systematically prefixed by "standard". This means that "catch
12623 exception constraint_error" is rewritten into "catch exception
12624 standard.constraint_error".
12626 If an exception named contraint_error is defined in another package of
12627 the inferior program, then the only way to specify this exception as a
12628 breakpoint condition is to use its fully-qualified named:
12629 e.g. my_package.constraint_error. */
12631 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12633 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12635 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12639 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12642 /* Return the symtab_and_line that should be used to insert an exception
12643 catchpoint of the TYPE kind.
12645 EXCEP_STRING should contain the name of a specific exception that
12646 the catchpoint should catch, or NULL otherwise.
12648 ADDR_STRING returns the name of the function where the real
12649 breakpoint that implements the catchpoints is set, depending on the
12650 type of catchpoint we need to create. */
12652 static struct symtab_and_line
12653 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12654 char **addr_string
, const struct breakpoint_ops
**ops
)
12656 const char *sym_name
;
12657 struct symbol
*sym
;
12659 /* First, find out which exception support info to use. */
12660 ada_exception_support_info_sniffer ();
12662 /* Then lookup the function on which we will break in order to catch
12663 the Ada exceptions requested by the user. */
12664 sym_name
= ada_exception_sym_name (ex
);
12665 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12667 /* We can assume that SYM is not NULL at this stage. If the symbol
12668 did not exist, ada_exception_support_info_sniffer would have
12669 raised an exception.
12671 Also, ada_exception_support_info_sniffer should have already
12672 verified that SYM is a function symbol. */
12673 gdb_assert (sym
!= NULL
);
12674 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12676 /* Set ADDR_STRING. */
12677 *addr_string
= xstrdup (sym_name
);
12680 *ops
= ada_exception_breakpoint_ops (ex
);
12682 return find_function_start_sal (sym
, 1);
12685 /* Create an Ada exception catchpoint.
12687 EX_KIND is the kind of exception catchpoint to be created.
12689 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12690 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12691 of the exception to which this catchpoint applies. When not NULL,
12692 the string must be allocated on the heap, and its deallocation
12693 is no longer the responsibility of the caller.
12695 COND_STRING, if not NULL, is the catchpoint condition. This string
12696 must be allocated on the heap, and its deallocation is no longer
12697 the responsibility of the caller.
12699 TEMPFLAG, if nonzero, means that the underlying breakpoint
12700 should be temporary.
12702 FROM_TTY is the usual argument passed to all commands implementations. */
12705 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12706 enum ada_exception_catchpoint_kind ex_kind
,
12707 char *excep_string
,
12713 struct ada_catchpoint
*c
;
12714 char *addr_string
= NULL
;
12715 const struct breakpoint_ops
*ops
= NULL
;
12716 struct symtab_and_line sal
12717 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12719 c
= XNEW (struct ada_catchpoint
);
12720 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
12721 ops
, tempflag
, disabled
, from_tty
);
12722 c
->excep_string
= excep_string
;
12723 create_excep_cond_exprs (c
);
12724 if (cond_string
!= NULL
)
12725 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
12726 install_breakpoint (0, &c
->base
, 1);
12729 /* Implement the "catch exception" command. */
12732 catch_ada_exception_command (char *arg
, int from_tty
,
12733 struct cmd_list_element
*command
)
12735 struct gdbarch
*gdbarch
= get_current_arch ();
12737 enum ada_exception_catchpoint_kind ex_kind
;
12738 char *excep_string
= NULL
;
12739 char *cond_string
= NULL
;
12741 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12745 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12747 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12748 excep_string
, cond_string
,
12749 tempflag
, 1 /* enabled */,
12753 /* Split the arguments specified in a "catch assert" command.
12755 ARGS contains the command's arguments (or the empty string if
12756 no arguments were passed).
12758 If ARGS contains a condition, set COND_STRING to that condition
12759 (the memory needs to be deallocated after use). */
12762 catch_ada_assert_command_split (char *args
, char **cond_string
)
12764 args
= skip_spaces (args
);
12766 /* Check whether a condition was provided. */
12767 if (startswith (args
, "if")
12768 && (isspace (args
[2]) || args
[2] == '\0'))
12771 args
= skip_spaces (args
);
12772 if (args
[0] == '\0')
12773 error (_("condition missing after `if' keyword"));
12774 *cond_string
= xstrdup (args
);
12777 /* Otherwise, there should be no other argument at the end of
12779 else if (args
[0] != '\0')
12780 error (_("Junk at end of arguments."));
12783 /* Implement the "catch assert" command. */
12786 catch_assert_command (char *arg
, int from_tty
,
12787 struct cmd_list_element
*command
)
12789 struct gdbarch
*gdbarch
= get_current_arch ();
12791 char *cond_string
= NULL
;
12793 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12797 catch_ada_assert_command_split (arg
, &cond_string
);
12798 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12800 tempflag
, 1 /* enabled */,
12804 /* Return non-zero if the symbol SYM is an Ada exception object. */
12807 ada_is_exception_sym (struct symbol
*sym
)
12809 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
12811 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12812 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12813 && SYMBOL_CLASS (sym
) != LOC_CONST
12814 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12815 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12818 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12819 Ada exception object. This matches all exceptions except the ones
12820 defined by the Ada language. */
12823 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12827 if (!ada_is_exception_sym (sym
))
12830 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12831 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
12832 return 0; /* A standard exception. */
12834 /* Numeric_Error is also a standard exception, so exclude it.
12835 See the STANDARD_EXC description for more details as to why
12836 this exception is not listed in that array. */
12837 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
12843 /* A helper function for qsort, comparing two struct ada_exc_info
12846 The comparison is determined first by exception name, and then
12847 by exception address. */
12850 compare_ada_exception_info (const void *a
, const void *b
)
12852 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
12853 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
12856 result
= strcmp (exc_a
->name
, exc_b
->name
);
12860 if (exc_a
->addr
< exc_b
->addr
)
12862 if (exc_a
->addr
> exc_b
->addr
)
12868 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12869 routine, but keeping the first SKIP elements untouched.
12871 All duplicates are also removed. */
12874 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
12877 struct ada_exc_info
*to_sort
12878 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
12880 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
12883 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
12884 compare_ada_exception_info
);
12886 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
12887 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
12888 to_sort
[j
++] = to_sort
[i
];
12890 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
12893 /* A function intended as the "name_matcher" callback in the struct
12894 quick_symbol_functions' expand_symtabs_matching method.
12896 SEARCH_NAME is the symbol's search name.
12898 If USER_DATA is not NULL, it is a pointer to a regext_t object
12899 used to match the symbol (by natural name). Otherwise, when USER_DATA
12900 is null, no filtering is performed, and all symbols are a positive
12904 ada_exc_search_name_matches (const char *search_name
, void *user_data
)
12906 regex_t
*preg
= user_data
;
12911 /* In Ada, the symbol "search name" is a linkage name, whereas
12912 the regular expression used to do the matching refers to
12913 the natural name. So match against the decoded name. */
12914 return (regexec (preg
, ada_decode (search_name
), 0, NULL
, 0) == 0);
12917 /* Add all exceptions defined by the Ada standard whose name match
12918 a regular expression.
12920 If PREG is not NULL, then this regexp_t object is used to
12921 perform the symbol name matching. Otherwise, no name-based
12922 filtering is performed.
12924 EXCEPTIONS is a vector of exceptions to which matching exceptions
12928 ada_add_standard_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12932 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12935 || regexec (preg
, standard_exc
[i
], 0, NULL
, 0) == 0)
12937 struct bound_minimal_symbol msymbol
12938 = ada_lookup_simple_minsym (standard_exc
[i
]);
12940 if (msymbol
.minsym
!= NULL
)
12942 struct ada_exc_info info
12943 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12945 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12951 /* Add all Ada exceptions defined locally and accessible from the given
12954 If PREG is not NULL, then this regexp_t object is used to
12955 perform the symbol name matching. Otherwise, no name-based
12956 filtering is performed.
12958 EXCEPTIONS is a vector of exceptions to which matching exceptions
12962 ada_add_exceptions_from_frame (regex_t
*preg
, struct frame_info
*frame
,
12963 VEC(ada_exc_info
) **exceptions
)
12965 const struct block
*block
= get_frame_block (frame
, 0);
12969 struct block_iterator iter
;
12970 struct symbol
*sym
;
12972 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12974 switch (SYMBOL_CLASS (sym
))
12981 if (ada_is_exception_sym (sym
))
12983 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
12984 SYMBOL_VALUE_ADDRESS (sym
)};
12986 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12990 if (BLOCK_FUNCTION (block
) != NULL
)
12992 block
= BLOCK_SUPERBLOCK (block
);
12996 /* Add all exceptions defined globally whose name name match
12997 a regular expression, excluding standard exceptions.
12999 The reason we exclude standard exceptions is that they need
13000 to be handled separately: Standard exceptions are defined inside
13001 a runtime unit which is normally not compiled with debugging info,
13002 and thus usually do not show up in our symbol search. However,
13003 if the unit was in fact built with debugging info, we need to
13004 exclude them because they would duplicate the entry we found
13005 during the special loop that specifically searches for those
13006 standard exceptions.
13008 If PREG is not NULL, then this regexp_t object is used to
13009 perform the symbol name matching. Otherwise, no name-based
13010 filtering is performed.
13012 EXCEPTIONS is a vector of exceptions to which matching exceptions
13016 ada_add_global_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
13018 struct objfile
*objfile
;
13019 struct compunit_symtab
*s
;
13021 expand_symtabs_matching (NULL
, ada_exc_search_name_matches
, NULL
,
13022 VARIABLES_DOMAIN
, preg
);
13024 ALL_COMPUNITS (objfile
, s
)
13026 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13029 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13031 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13032 struct block_iterator iter
;
13033 struct symbol
*sym
;
13035 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13036 if (ada_is_non_standard_exception_sym (sym
)
13038 || regexec (preg
, SYMBOL_NATURAL_NAME (sym
),
13041 struct ada_exc_info info
13042 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
13044 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13050 /* Implements ada_exceptions_list with the regular expression passed
13051 as a regex_t, rather than a string.
13053 If not NULL, PREG is used to filter out exceptions whose names
13054 do not match. Otherwise, all exceptions are listed. */
13056 static VEC(ada_exc_info
) *
13057 ada_exceptions_list_1 (regex_t
*preg
)
13059 VEC(ada_exc_info
) *result
= NULL
;
13060 struct cleanup
*old_chain
13061 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
13064 /* First, list the known standard exceptions. These exceptions
13065 need to be handled separately, as they are usually defined in
13066 runtime units that have been compiled without debugging info. */
13068 ada_add_standard_exceptions (preg
, &result
);
13070 /* Next, find all exceptions whose scope is local and accessible
13071 from the currently selected frame. */
13073 if (has_stack_frames ())
13075 prev_len
= VEC_length (ada_exc_info
, result
);
13076 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13078 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13079 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13082 /* Add all exceptions whose scope is global. */
13084 prev_len
= VEC_length (ada_exc_info
, result
);
13085 ada_add_global_exceptions (preg
, &result
);
13086 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13087 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13089 discard_cleanups (old_chain
);
13093 /* Return a vector of ada_exc_info.
13095 If REGEXP is NULL, all exceptions are included in the result.
13096 Otherwise, it should contain a valid regular expression,
13097 and only the exceptions whose names match that regular expression
13098 are included in the result.
13100 The exceptions are sorted in the following order:
13101 - Standard exceptions (defined by the Ada language), in
13102 alphabetical order;
13103 - Exceptions only visible from the current frame, in
13104 alphabetical order;
13105 - Exceptions whose scope is global, in alphabetical order. */
13107 VEC(ada_exc_info
) *
13108 ada_exceptions_list (const char *regexp
)
13110 VEC(ada_exc_info
) *result
= NULL
;
13111 struct cleanup
*old_chain
= NULL
;
13114 if (regexp
!= NULL
)
13115 old_chain
= compile_rx_or_error (®
, regexp
,
13116 _("invalid regular expression"));
13118 result
= ada_exceptions_list_1 (regexp
!= NULL
? ®
: NULL
);
13120 if (old_chain
!= NULL
)
13121 do_cleanups (old_chain
);
13125 /* Implement the "info exceptions" command. */
13128 info_exceptions_command (char *regexp
, int from_tty
)
13130 VEC(ada_exc_info
) *exceptions
;
13131 struct cleanup
*cleanup
;
13132 struct gdbarch
*gdbarch
= get_current_arch ();
13134 struct ada_exc_info
*info
;
13136 exceptions
= ada_exceptions_list (regexp
);
13137 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
13139 if (regexp
!= NULL
)
13141 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13143 printf_filtered (_("All defined Ada exceptions:\n"));
13145 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
13146 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
13148 do_cleanups (cleanup
);
13152 /* Information about operators given special treatment in functions
13154 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13156 #define ADA_OPERATORS \
13157 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13158 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13159 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13160 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13161 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13162 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13163 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13164 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13165 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13166 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13167 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13168 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13169 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13170 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13171 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13172 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13173 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13174 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13175 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13178 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13181 switch (exp
->elts
[pc
- 1].opcode
)
13184 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13187 #define OP_DEFN(op, len, args, binop) \
13188 case op: *oplenp = len; *argsp = args; break;
13194 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13199 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13204 /* Implementation of the exp_descriptor method operator_check. */
13207 ada_operator_check (struct expression
*exp
, int pos
,
13208 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13211 const union exp_element
*const elts
= exp
->elts
;
13212 struct type
*type
= NULL
;
13214 switch (elts
[pos
].opcode
)
13216 case UNOP_IN_RANGE
:
13218 type
= elts
[pos
+ 1].type
;
13222 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13225 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13227 if (type
&& TYPE_OBJFILE (type
)
13228 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13235 ada_op_name (enum exp_opcode opcode
)
13240 return op_name_standard (opcode
);
13242 #define OP_DEFN(op, len, args, binop) case op: return #op;
13247 return "OP_AGGREGATE";
13249 return "OP_CHOICES";
13255 /* As for operator_length, but assumes PC is pointing at the first
13256 element of the operator, and gives meaningful results only for the
13257 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13260 ada_forward_operator_length (struct expression
*exp
, int pc
,
13261 int *oplenp
, int *argsp
)
13263 switch (exp
->elts
[pc
].opcode
)
13266 *oplenp
= *argsp
= 0;
13269 #define OP_DEFN(op, len, args, binop) \
13270 case op: *oplenp = len; *argsp = args; break;
13276 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13281 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13287 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13289 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13297 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13299 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13304 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13308 /* Ada attributes ('Foo). */
13311 case OP_ATR_LENGTH
:
13315 case OP_ATR_MODULUS
:
13322 case UNOP_IN_RANGE
:
13324 /* XXX: gdb_sprint_host_address, type_sprint */
13325 fprintf_filtered (stream
, _("Type @"));
13326 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13327 fprintf_filtered (stream
, " (");
13328 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13329 fprintf_filtered (stream
, ")");
13331 case BINOP_IN_BOUNDS
:
13332 fprintf_filtered (stream
, " (%d)",
13333 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13335 case TERNOP_IN_RANGE
:
13340 case OP_DISCRETE_RANGE
:
13341 case OP_POSITIONAL
:
13348 char *name
= &exp
->elts
[elt
+ 2].string
;
13349 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13351 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13356 return dump_subexp_body_standard (exp
, stream
, elt
);
13360 for (i
= 0; i
< nargs
; i
+= 1)
13361 elt
= dump_subexp (exp
, stream
, elt
);
13366 /* The Ada extension of print_subexp (q.v.). */
13369 ada_print_subexp (struct expression
*exp
, int *pos
,
13370 struct ui_file
*stream
, enum precedence prec
)
13372 int oplen
, nargs
, i
;
13374 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13376 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13383 print_subexp_standard (exp
, pos
, stream
, prec
);
13387 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13390 case BINOP_IN_BOUNDS
:
13391 /* XXX: sprint_subexp */
13392 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13393 fputs_filtered (" in ", stream
);
13394 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13395 fputs_filtered ("'range", stream
);
13396 if (exp
->elts
[pc
+ 1].longconst
> 1)
13397 fprintf_filtered (stream
, "(%ld)",
13398 (long) exp
->elts
[pc
+ 1].longconst
);
13401 case TERNOP_IN_RANGE
:
13402 if (prec
>= PREC_EQUAL
)
13403 fputs_filtered ("(", stream
);
13404 /* XXX: sprint_subexp */
13405 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13406 fputs_filtered (" in ", stream
);
13407 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13408 fputs_filtered (" .. ", stream
);
13409 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13410 if (prec
>= PREC_EQUAL
)
13411 fputs_filtered (")", stream
);
13416 case OP_ATR_LENGTH
:
13420 case OP_ATR_MODULUS
:
13425 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13427 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13428 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13429 &type_print_raw_options
);
13433 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13434 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13439 for (tem
= 1; tem
< nargs
; tem
+= 1)
13441 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13442 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13444 fputs_filtered (")", stream
);
13449 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13450 fputs_filtered ("'(", stream
);
13451 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13452 fputs_filtered (")", stream
);
13455 case UNOP_IN_RANGE
:
13456 /* XXX: sprint_subexp */
13457 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13458 fputs_filtered (" in ", stream
);
13459 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13460 &type_print_raw_options
);
13463 case OP_DISCRETE_RANGE
:
13464 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13465 fputs_filtered ("..", stream
);
13466 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13470 fputs_filtered ("others => ", stream
);
13471 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13475 for (i
= 0; i
< nargs
-1; i
+= 1)
13478 fputs_filtered ("|", stream
);
13479 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13481 fputs_filtered (" => ", stream
);
13482 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13485 case OP_POSITIONAL
:
13486 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13490 fputs_filtered ("(", stream
);
13491 for (i
= 0; i
< nargs
; i
+= 1)
13494 fputs_filtered (", ", stream
);
13495 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13497 fputs_filtered (")", stream
);
13502 /* Table mapping opcodes into strings for printing operators
13503 and precedences of the operators. */
13505 static const struct op_print ada_op_print_tab
[] = {
13506 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13507 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13508 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13509 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13510 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13511 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13512 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13513 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13514 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13515 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13516 {">", BINOP_GTR
, PREC_ORDER
, 0},
13517 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13518 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13519 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13520 {"+", BINOP_ADD
, PREC_ADD
, 0},
13521 {"-", BINOP_SUB
, PREC_ADD
, 0},
13522 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13523 {"*", BINOP_MUL
, PREC_MUL
, 0},
13524 {"/", BINOP_DIV
, PREC_MUL
, 0},
13525 {"rem", BINOP_REM
, PREC_MUL
, 0},
13526 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13527 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13528 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13529 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13530 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13531 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13532 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13533 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13534 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13535 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13536 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13540 enum ada_primitive_types
{
13541 ada_primitive_type_int
,
13542 ada_primitive_type_long
,
13543 ada_primitive_type_short
,
13544 ada_primitive_type_char
,
13545 ada_primitive_type_float
,
13546 ada_primitive_type_double
,
13547 ada_primitive_type_void
,
13548 ada_primitive_type_long_long
,
13549 ada_primitive_type_long_double
,
13550 ada_primitive_type_natural
,
13551 ada_primitive_type_positive
,
13552 ada_primitive_type_system_address
,
13553 nr_ada_primitive_types
13557 ada_language_arch_info (struct gdbarch
*gdbarch
,
13558 struct language_arch_info
*lai
)
13560 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13562 lai
->primitive_type_vector
13563 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13566 lai
->primitive_type_vector
[ada_primitive_type_int
]
13567 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13569 lai
->primitive_type_vector
[ada_primitive_type_long
]
13570 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13571 0, "long_integer");
13572 lai
->primitive_type_vector
[ada_primitive_type_short
]
13573 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13574 0, "short_integer");
13575 lai
->string_char_type
13576 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13577 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13578 lai
->primitive_type_vector
[ada_primitive_type_float
]
13579 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13581 lai
->primitive_type_vector
[ada_primitive_type_double
]
13582 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13583 "long_float", NULL
);
13584 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13585 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13586 0, "long_long_integer");
13587 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13588 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13589 "long_long_float", NULL
);
13590 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13591 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13593 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13594 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13596 lai
->primitive_type_vector
[ada_primitive_type_void
]
13597 = builtin
->builtin_void
;
13599 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13600 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13601 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13602 = "system__address";
13604 lai
->bool_type_symbol
= NULL
;
13605 lai
->bool_type_default
= builtin
->builtin_bool
;
13608 /* Language vector */
13610 /* Not really used, but needed in the ada_language_defn. */
13613 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13615 ada_emit_char (c
, type
, stream
, quoter
, 1);
13619 parse (struct parser_state
*ps
)
13621 warnings_issued
= 0;
13622 return ada_parse (ps
);
13625 static const struct exp_descriptor ada_exp_descriptor
= {
13627 ada_operator_length
,
13628 ada_operator_check
,
13630 ada_dump_subexp_body
,
13631 ada_evaluate_subexp
13634 /* Implement the "la_get_symbol_name_cmp" language_defn method
13637 static symbol_name_cmp_ftype
13638 ada_get_symbol_name_cmp (const char *lookup_name
)
13640 if (should_use_wild_match (lookup_name
))
13643 return compare_names
;
13646 /* Implement the "la_read_var_value" language_defn method for Ada. */
13648 static struct value
*
13649 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
13651 const struct block
*frame_block
= NULL
;
13652 struct symbol
*renaming_sym
= NULL
;
13654 /* The only case where default_read_var_value is not sufficient
13655 is when VAR is a renaming... */
13657 frame_block
= get_frame_block (frame
, NULL
);
13659 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13660 if (renaming_sym
!= NULL
)
13661 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13663 /* This is a typical case where we expect the default_read_var_value
13664 function to work. */
13665 return default_read_var_value (var
, frame
);
13668 const struct language_defn ada_language_defn
= {
13669 "ada", /* Language name */
13673 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13674 that's not quite what this means. */
13676 macro_expansion_no
,
13677 &ada_exp_descriptor
,
13681 ada_printchar
, /* Print a character constant */
13682 ada_printstr
, /* Function to print string constant */
13683 emit_char
, /* Function to print single char (not used) */
13684 ada_print_type
, /* Print a type using appropriate syntax */
13685 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13686 ada_val_print
, /* Print a value using appropriate syntax */
13687 ada_value_print
, /* Print a top-level value */
13688 ada_read_var_value
, /* la_read_var_value */
13689 NULL
, /* Language specific skip_trampoline */
13690 NULL
, /* name_of_this */
13691 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13692 basic_lookup_transparent_type
, /* lookup_transparent_type */
13693 ada_la_decode
, /* Language specific symbol demangler */
13694 NULL
, /* Language specific
13695 class_name_from_physname */
13696 ada_op_print_tab
, /* expression operators for printing */
13697 0, /* c-style arrays */
13698 1, /* String lower bound */
13699 ada_get_gdb_completer_word_break_characters
,
13700 ada_make_symbol_completion_list
,
13701 ada_language_arch_info
,
13702 ada_print_array_index
,
13703 default_pass_by_reference
,
13705 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13706 ada_iterate_over_symbols
,
13713 /* Provide a prototype to silence -Wmissing-prototypes. */
13714 extern initialize_file_ftype _initialize_ada_language
;
13716 /* Command-list for the "set/show ada" prefix command. */
13717 static struct cmd_list_element
*set_ada_list
;
13718 static struct cmd_list_element
*show_ada_list
;
13720 /* Implement the "set ada" prefix command. */
13723 set_ada_command (char *arg
, int from_tty
)
13725 printf_unfiltered (_(\
13726 "\"set ada\" must be followed by the name of a setting.\n"));
13727 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
13730 /* Implement the "show ada" prefix command. */
13733 show_ada_command (char *args
, int from_tty
)
13735 cmd_show_list (show_ada_list
, from_tty
, "");
13739 initialize_ada_catchpoint_ops (void)
13741 struct breakpoint_ops
*ops
;
13743 initialize_breakpoint_ops ();
13745 ops
= &catch_exception_breakpoint_ops
;
13746 *ops
= bkpt_breakpoint_ops
;
13747 ops
->dtor
= dtor_catch_exception
;
13748 ops
->allocate_location
= allocate_location_catch_exception
;
13749 ops
->re_set
= re_set_catch_exception
;
13750 ops
->check_status
= check_status_catch_exception
;
13751 ops
->print_it
= print_it_catch_exception
;
13752 ops
->print_one
= print_one_catch_exception
;
13753 ops
->print_mention
= print_mention_catch_exception
;
13754 ops
->print_recreate
= print_recreate_catch_exception
;
13756 ops
= &catch_exception_unhandled_breakpoint_ops
;
13757 *ops
= bkpt_breakpoint_ops
;
13758 ops
->dtor
= dtor_catch_exception_unhandled
;
13759 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
13760 ops
->re_set
= re_set_catch_exception_unhandled
;
13761 ops
->check_status
= check_status_catch_exception_unhandled
;
13762 ops
->print_it
= print_it_catch_exception_unhandled
;
13763 ops
->print_one
= print_one_catch_exception_unhandled
;
13764 ops
->print_mention
= print_mention_catch_exception_unhandled
;
13765 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
13767 ops
= &catch_assert_breakpoint_ops
;
13768 *ops
= bkpt_breakpoint_ops
;
13769 ops
->dtor
= dtor_catch_assert
;
13770 ops
->allocate_location
= allocate_location_catch_assert
;
13771 ops
->re_set
= re_set_catch_assert
;
13772 ops
->check_status
= check_status_catch_assert
;
13773 ops
->print_it
= print_it_catch_assert
;
13774 ops
->print_one
= print_one_catch_assert
;
13775 ops
->print_mention
= print_mention_catch_assert
;
13776 ops
->print_recreate
= print_recreate_catch_assert
;
13779 /* This module's 'new_objfile' observer. */
13782 ada_new_objfile_observer (struct objfile
*objfile
)
13784 ada_clear_symbol_cache ();
13787 /* This module's 'free_objfile' observer. */
13790 ada_free_objfile_observer (struct objfile
*objfile
)
13792 ada_clear_symbol_cache ();
13796 _initialize_ada_language (void)
13798 add_language (&ada_language_defn
);
13800 initialize_ada_catchpoint_ops ();
13802 add_prefix_cmd ("ada", no_class
, set_ada_command
,
13803 _("Prefix command for changing Ada-specfic settings"),
13804 &set_ada_list
, "set ada ", 0, &setlist
);
13806 add_prefix_cmd ("ada", no_class
, show_ada_command
,
13807 _("Generic command for showing Ada-specific settings."),
13808 &show_ada_list
, "show ada ", 0, &showlist
);
13810 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
13811 &trust_pad_over_xvs
, _("\
13812 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13813 Show whether an optimization trusting PAD types over XVS types is activated"),
13815 This is related to the encoding used by the GNAT compiler. The debugger\n\
13816 should normally trust the contents of PAD types, but certain older versions\n\
13817 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13818 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13819 work around this bug. It is always safe to turn this option \"off\", but\n\
13820 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13821 this option to \"off\" unless necessary."),
13822 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13824 add_catch_command ("exception", _("\
13825 Catch Ada exceptions, when raised.\n\
13826 With an argument, catch only exceptions with the given name."),
13827 catch_ada_exception_command
,
13831 add_catch_command ("assert", _("\
13832 Catch failed Ada assertions, when raised.\n\
13833 With an argument, catch only exceptions with the given name."),
13834 catch_assert_command
,
13839 varsize_limit
= 65536;
13841 add_info ("exceptions", info_exceptions_command
,
13843 List all Ada exception names.\n\
13844 If a regular expression is passed as an argument, only those matching\n\
13845 the regular expression are listed."));
13847 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
13848 _("Set Ada maintenance-related variables."),
13849 &maint_set_ada_cmdlist
, "maintenance set ada ",
13850 0/*allow-unknown*/, &maintenance_set_cmdlist
);
13852 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
13853 _("Show Ada maintenance-related variables"),
13854 &maint_show_ada_cmdlist
, "maintenance show ada ",
13855 0/*allow-unknown*/, &maintenance_show_cmdlist
);
13857 add_setshow_boolean_cmd
13858 ("ignore-descriptive-types", class_maintenance
,
13859 &ada_ignore_descriptive_types_p
,
13860 _("Set whether descriptive types generated by GNAT should be ignored."),
13861 _("Show whether descriptive types generated by GNAT should be ignored."),
13863 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13864 DWARF attribute."),
13865 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
13867 obstack_init (&symbol_list_obstack
);
13869 decoded_names_store
= htab_create_alloc
13870 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
13871 NULL
, xcalloc
, xfree
);
13873 /* The ada-lang observers. */
13874 observer_attach_new_objfile (ada_new_objfile_observer
);
13875 observer_attach_free_objfile (ada_free_objfile_observer
);
13876 observer_attach_inferior_exit (ada_inferior_exit
);
13878 /* Setup various context-specific data. */
13880 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
13881 ada_pspace_data_handle
13882 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);