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
, NULL
, 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
, NULL
, 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
) + offset
);
2421 type
= value_type (v
);
2422 if (TYPE_LENGTH (type
) * HOST_CHAR_BIT
< bit_size
)
2424 /* This can happen in the case of an array of dynamic objects,
2425 where the size of each element changes from element to element.
2426 In that case, we're initially given the array stride, but
2427 after resolving the element type, we find that its size is
2428 less than this stride. In that case, adjust bit_size to
2429 match TYPE's length, and recompute LEN accordingly. */
2430 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2431 len
= TYPE_LENGTH (type
) + (bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2433 bytes
= (unsigned char *) alloca (len
);
2434 read_memory (value_address (v
), bytes
, len
);
2438 v
= allocate_value (type
);
2439 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2444 long new_offset
= offset
;
2446 set_value_component_location (v
, obj
);
2447 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2448 set_value_bitsize (v
, bit_size
);
2449 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2452 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2454 set_value_offset (v
, new_offset
);
2456 /* Also set the parent value. This is needed when trying to
2457 assign a new value (in inferior memory). */
2458 set_value_parent (v
, obj
);
2461 set_value_bitsize (v
, bit_size
);
2462 unpacked
= (unsigned char *) value_contents (v
);
2464 srcBitsLeft
= bit_size
;
2466 ntarg
= TYPE_LENGTH (type
);
2470 memset (unpacked
, 0, TYPE_LENGTH (type
));
2473 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2476 if (has_negatives (type
)
2477 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2481 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2484 switch (TYPE_CODE (type
))
2486 case TYPE_CODE_ARRAY
:
2487 case TYPE_CODE_UNION
:
2488 case TYPE_CODE_STRUCT
:
2489 /* Non-scalar values must be aligned at a byte boundary... */
2491 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2492 /* ... And are placed at the beginning (most-significant) bytes
2494 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2499 targ
= TYPE_LENGTH (type
) - 1;
2505 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2508 unusedLS
= bit_offset
;
2511 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2518 /* Mask for removing bits of the next source byte that are not
2519 part of the value. */
2520 unsigned int unusedMSMask
=
2521 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2523 /* Sign-extend bits for this byte. */
2524 unsigned int signMask
= sign
& ~unusedMSMask
;
2527 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2528 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2529 if (accumSize
>= HOST_CHAR_BIT
)
2531 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2532 accumSize
-= HOST_CHAR_BIT
;
2533 accum
>>= HOST_CHAR_BIT
;
2537 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2544 accum
|= sign
<< accumSize
;
2545 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2546 accumSize
-= HOST_CHAR_BIT
;
2549 accum
>>= HOST_CHAR_BIT
;
2554 if (is_dynamic_type (value_type (v
)))
2555 v
= value_from_contents_and_address (value_type (v
), value_contents (v
),
2560 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2561 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2564 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2565 int src_offset
, int n
, int bits_big_endian_p
)
2567 unsigned int accum
, mask
;
2568 int accum_bits
, chunk_size
;
2570 target
+= targ_offset
/ HOST_CHAR_BIT
;
2571 targ_offset
%= HOST_CHAR_BIT
;
2572 source
+= src_offset
/ HOST_CHAR_BIT
;
2573 src_offset
%= HOST_CHAR_BIT
;
2574 if (bits_big_endian_p
)
2576 accum
= (unsigned char) *source
;
2578 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2584 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2585 accum_bits
+= HOST_CHAR_BIT
;
2587 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2590 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2591 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2594 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2596 accum_bits
-= chunk_size
;
2603 accum
= (unsigned char) *source
>> src_offset
;
2605 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2609 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2610 accum_bits
+= HOST_CHAR_BIT
;
2612 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2615 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2616 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2618 accum_bits
-= chunk_size
;
2619 accum
>>= chunk_size
;
2626 /* Store the contents of FROMVAL into the location of TOVAL.
2627 Return a new value with the location of TOVAL and contents of
2628 FROMVAL. Handles assignment into packed fields that have
2629 floating-point or non-scalar types. */
2631 static struct value
*
2632 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2634 struct type
*type
= value_type (toval
);
2635 int bits
= value_bitsize (toval
);
2637 toval
= ada_coerce_ref (toval
);
2638 fromval
= ada_coerce_ref (fromval
);
2640 if (ada_is_direct_array_type (value_type (toval
)))
2641 toval
= ada_coerce_to_simple_array (toval
);
2642 if (ada_is_direct_array_type (value_type (fromval
)))
2643 fromval
= ada_coerce_to_simple_array (fromval
);
2645 if (!deprecated_value_modifiable (toval
))
2646 error (_("Left operand of assignment is not a modifiable lvalue."));
2648 if (VALUE_LVAL (toval
) == lval_memory
2650 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2651 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2653 int len
= (value_bitpos (toval
)
2654 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2656 gdb_byte
*buffer
= alloca (len
);
2658 CORE_ADDR to_addr
= value_address (toval
);
2660 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2661 fromval
= value_cast (type
, fromval
);
2663 read_memory (to_addr
, buffer
, len
);
2664 from_size
= value_bitsize (fromval
);
2666 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2667 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2668 move_bits (buffer
, value_bitpos (toval
),
2669 value_contents (fromval
), from_size
- bits
, bits
, 1);
2671 move_bits (buffer
, value_bitpos (toval
),
2672 value_contents (fromval
), 0, bits
, 0);
2673 write_memory_with_notification (to_addr
, buffer
, len
);
2675 val
= value_copy (toval
);
2676 memcpy (value_contents_raw (val
), value_contents (fromval
),
2677 TYPE_LENGTH (type
));
2678 deprecated_set_value_type (val
, type
);
2683 return value_assign (toval
, fromval
);
2687 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2688 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2689 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2690 COMPONENT, and not the inferior's memory. The current contents
2691 of COMPONENT are ignored.
2693 Although not part of the initial design, this function also works
2694 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2695 had a null address, and COMPONENT had an address which is equal to
2696 its offset inside CONTAINER. */
2699 value_assign_to_component (struct value
*container
, struct value
*component
,
2702 LONGEST offset_in_container
=
2703 (LONGEST
) (value_address (component
) - value_address (container
));
2704 int bit_offset_in_container
=
2705 value_bitpos (component
) - value_bitpos (container
);
2708 val
= value_cast (value_type (component
), val
);
2710 if (value_bitsize (component
) == 0)
2711 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2713 bits
= value_bitsize (component
);
2715 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2716 move_bits (value_contents_writeable (container
) + offset_in_container
,
2717 value_bitpos (container
) + bit_offset_in_container
,
2718 value_contents (val
),
2719 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2722 move_bits (value_contents_writeable (container
) + offset_in_container
,
2723 value_bitpos (container
) + bit_offset_in_container
,
2724 value_contents (val
), 0, bits
, 0);
2727 /* The value of the element of array ARR at the ARITY indices given in IND.
2728 ARR may be either a simple array, GNAT array descriptor, or pointer
2732 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2736 struct type
*elt_type
;
2738 elt
= ada_coerce_to_simple_array (arr
);
2740 elt_type
= ada_check_typedef (value_type (elt
));
2741 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2742 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2743 return value_subscript_packed (elt
, arity
, ind
);
2745 for (k
= 0; k
< arity
; k
+= 1)
2747 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2748 error (_("too many subscripts (%d expected)"), k
);
2749 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2754 /* Assuming ARR is a pointer to a GDB array, the value of the element
2755 of *ARR at the ARITY indices given in IND.
2756 Does not read the entire array into memory. */
2758 static struct value
*
2759 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2763 = check_typedef (value_enclosing_type (ada_value_ind (arr
)));
2765 for (k
= 0; k
< arity
; k
+= 1)
2769 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2770 error (_("too many subscripts (%d expected)"), k
);
2771 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2773 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2774 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2775 type
= TYPE_TARGET_TYPE (type
);
2778 return value_ind (arr
);
2781 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2782 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2783 elements starting at index LOW. The lower bound of this array is LOW, as
2785 static struct value
*
2786 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2789 struct type
*type0
= ada_check_typedef (type
);
2790 CORE_ADDR base
= value_as_address (array_ptr
)
2791 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
)))
2792 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2793 struct type
*index_type
2794 = create_static_range_type (NULL
,
2795 TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
)),
2797 struct type
*slice_type
=
2798 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2800 return value_at_lazy (slice_type
, base
);
2804 static struct value
*
2805 ada_value_slice (struct value
*array
, int low
, int high
)
2807 struct type
*type
= ada_check_typedef (value_type (array
));
2808 struct type
*index_type
2809 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2810 struct type
*slice_type
=
2811 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2813 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2816 /* If type is a record type in the form of a standard GNAT array
2817 descriptor, returns the number of dimensions for type. If arr is a
2818 simple array, returns the number of "array of"s that prefix its
2819 type designation. Otherwise, returns 0. */
2822 ada_array_arity (struct type
*type
)
2829 type
= desc_base_type (type
);
2832 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2833 return desc_arity (desc_bounds_type (type
));
2835 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2838 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2844 /* If TYPE is a record type in the form of a standard GNAT array
2845 descriptor or a simple array type, returns the element type for
2846 TYPE after indexing by NINDICES indices, or by all indices if
2847 NINDICES is -1. Otherwise, returns NULL. */
2850 ada_array_element_type (struct type
*type
, int nindices
)
2852 type
= desc_base_type (type
);
2854 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2857 struct type
*p_array_type
;
2859 p_array_type
= desc_data_target_type (type
);
2861 k
= ada_array_arity (type
);
2865 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2866 if (nindices
>= 0 && k
> nindices
)
2868 while (k
> 0 && p_array_type
!= NULL
)
2870 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2873 return p_array_type
;
2875 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2877 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2879 type
= TYPE_TARGET_TYPE (type
);
2888 /* The type of nth index in arrays of given type (n numbering from 1).
2889 Does not examine memory. Throws an error if N is invalid or TYPE
2890 is not an array type. NAME is the name of the Ada attribute being
2891 evaluated ('range, 'first, 'last, or 'length); it is used in building
2892 the error message. */
2894 static struct type
*
2895 ada_index_type (struct type
*type
, int n
, const char *name
)
2897 struct type
*result_type
;
2899 type
= desc_base_type (type
);
2901 if (n
< 0 || n
> ada_array_arity (type
))
2902 error (_("invalid dimension number to '%s"), name
);
2904 if (ada_is_simple_array_type (type
))
2908 for (i
= 1; i
< n
; i
+= 1)
2909 type
= TYPE_TARGET_TYPE (type
);
2910 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2911 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2912 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2913 perhaps stabsread.c would make more sense. */
2914 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2919 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2920 if (result_type
== NULL
)
2921 error (_("attempt to take bound of something that is not an array"));
2927 /* Given that arr is an array type, returns the lower bound of the
2928 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2929 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2930 array-descriptor type. It works for other arrays with bounds supplied
2931 by run-time quantities other than discriminants. */
2934 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2936 struct type
*type
, *index_type_desc
, *index_type
;
2939 gdb_assert (which
== 0 || which
== 1);
2941 if (ada_is_constrained_packed_array_type (arr_type
))
2942 arr_type
= decode_constrained_packed_array_type (arr_type
);
2944 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2945 return (LONGEST
) - which
;
2947 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2948 type
= TYPE_TARGET_TYPE (arr_type
);
2952 if (TYPE_FIXED_INSTANCE (type
))
2954 /* The array has already been fixed, so we do not need to
2955 check the parallel ___XA type again. That encoding has
2956 already been applied, so ignore it now. */
2957 index_type_desc
= NULL
;
2961 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2962 ada_fixup_array_indexes_type (index_type_desc
);
2965 if (index_type_desc
!= NULL
)
2966 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2970 struct type
*elt_type
= check_typedef (type
);
2972 for (i
= 1; i
< n
; i
++)
2973 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
2975 index_type
= TYPE_INDEX_TYPE (elt_type
);
2979 (LONGEST
) (which
== 0
2980 ? ada_discrete_type_low_bound (index_type
)
2981 : ada_discrete_type_high_bound (index_type
));
2984 /* Given that arr is an array value, returns the lower bound of the
2985 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2986 WHICH is 1. This routine will also work for arrays with bounds
2987 supplied by run-time quantities other than discriminants. */
2990 ada_array_bound (struct value
*arr
, int n
, int which
)
2992 struct type
*arr_type
;
2994 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2995 arr
= value_ind (arr
);
2996 arr_type
= value_enclosing_type (arr
);
2998 if (ada_is_constrained_packed_array_type (arr_type
))
2999 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3000 else if (ada_is_simple_array_type (arr_type
))
3001 return ada_array_bound_from_type (arr_type
, n
, which
);
3003 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3006 /* Given that arr is an array value, returns the length of the
3007 nth index. This routine will also work for arrays with bounds
3008 supplied by run-time quantities other than discriminants.
3009 Does not work for arrays indexed by enumeration types with representation
3010 clauses at the moment. */
3013 ada_array_length (struct value
*arr
, int n
)
3015 struct type
*arr_type
;
3017 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3018 arr
= value_ind (arr
);
3019 arr_type
= value_enclosing_type (arr
);
3021 if (ada_is_constrained_packed_array_type (arr_type
))
3022 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3024 if (ada_is_simple_array_type (arr_type
))
3025 return (ada_array_bound_from_type (arr_type
, n
, 1)
3026 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
3028 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
3029 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
3032 /* An empty array whose type is that of ARR_TYPE (an array type),
3033 with bounds LOW to LOW-1. */
3035 static struct value
*
3036 empty_array (struct type
*arr_type
, int low
)
3038 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3039 struct type
*index_type
3040 = create_static_range_type
3041 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
, low
- 1);
3042 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3044 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3048 /* Name resolution */
3050 /* The "decoded" name for the user-definable Ada operator corresponding
3054 ada_decoded_op_name (enum exp_opcode op
)
3058 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3060 if (ada_opname_table
[i
].op
== op
)
3061 return ada_opname_table
[i
].decoded
;
3063 error (_("Could not find operator name for opcode"));
3067 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3068 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3069 undefined namespace) and converts operators that are
3070 user-defined into appropriate function calls. If CONTEXT_TYPE is
3071 non-null, it provides a preferred result type [at the moment, only
3072 type void has any effect---causing procedures to be preferred over
3073 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3074 return type is preferred. May change (expand) *EXP. */
3077 resolve (struct expression
**expp
, int void_context_p
)
3079 struct type
*context_type
= NULL
;
3083 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3085 resolve_subexp (expp
, &pc
, 1, context_type
);
3088 /* Resolve the operator of the subexpression beginning at
3089 position *POS of *EXPP. "Resolving" consists of replacing
3090 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3091 with their resolutions, replacing built-in operators with
3092 function calls to user-defined operators, where appropriate, and,
3093 when DEPROCEDURE_P is non-zero, converting function-valued variables
3094 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3095 are as in ada_resolve, above. */
3097 static struct value
*
3098 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
3099 struct type
*context_type
)
3103 struct expression
*exp
; /* Convenience: == *expp. */
3104 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3105 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3106 int nargs
; /* Number of operands. */
3113 /* Pass one: resolve operands, saving their types and updating *pos,
3118 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3119 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3124 resolve_subexp (expp
, pos
, 0, NULL
);
3126 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3131 resolve_subexp (expp
, pos
, 0, NULL
);
3136 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
3139 case OP_ATR_MODULUS
:
3149 case TERNOP_IN_RANGE
:
3150 case BINOP_IN_BOUNDS
:
3156 case OP_DISCRETE_RANGE
:
3158 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3167 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3169 resolve_subexp (expp
, pos
, 1, NULL
);
3171 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3188 case BINOP_LOGICAL_AND
:
3189 case BINOP_LOGICAL_OR
:
3190 case BINOP_BITWISE_AND
:
3191 case BINOP_BITWISE_IOR
:
3192 case BINOP_BITWISE_XOR
:
3195 case BINOP_NOTEQUAL
:
3202 case BINOP_SUBSCRIPT
:
3210 case UNOP_LOGICAL_NOT
:
3226 case OP_INTERNALVAR
:
3236 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3239 case STRUCTOP_STRUCT
:
3240 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3253 error (_("Unexpected operator during name resolution"));
3256 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3257 for (i
= 0; i
< nargs
; i
+= 1)
3258 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3262 /* Pass two: perform any resolution on principal operator. */
3269 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3271 struct ada_symbol_info
*candidates
;
3275 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3276 (exp
->elts
[pc
+ 2].symbol
),
3277 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3280 if (n_candidates
> 1)
3282 /* Types tend to get re-introduced locally, so if there
3283 are any local symbols that are not types, first filter
3286 for (j
= 0; j
< n_candidates
; j
+= 1)
3287 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3292 case LOC_REGPARM_ADDR
:
3300 if (j
< n_candidates
)
3303 while (j
< n_candidates
)
3305 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3307 candidates
[j
] = candidates
[n_candidates
- 1];
3316 if (n_candidates
== 0)
3317 error (_("No definition found for %s"),
3318 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3319 else if (n_candidates
== 1)
3321 else if (deprocedure_p
3322 && !is_nonfunction (candidates
, n_candidates
))
3324 i
= ada_resolve_function
3325 (candidates
, n_candidates
, NULL
, 0,
3326 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3329 error (_("Could not find a match for %s"),
3330 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3334 printf_filtered (_("Multiple matches for %s\n"),
3335 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3336 user_select_syms (candidates
, n_candidates
, 1);
3340 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3341 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3342 if (innermost_block
== NULL
3343 || contained_in (candidates
[i
].block
, innermost_block
))
3344 innermost_block
= candidates
[i
].block
;
3348 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3351 replace_operator_with_call (expp
, pc
, 0, 0,
3352 exp
->elts
[pc
+ 2].symbol
,
3353 exp
->elts
[pc
+ 1].block
);
3360 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3361 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3363 struct ada_symbol_info
*candidates
;
3367 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3368 (exp
->elts
[pc
+ 5].symbol
),
3369 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3371 if (n_candidates
== 1)
3375 i
= ada_resolve_function
3376 (candidates
, n_candidates
,
3378 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3381 error (_("Could not find a match for %s"),
3382 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3385 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3386 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3387 if (innermost_block
== NULL
3388 || contained_in (candidates
[i
].block
, innermost_block
))
3389 innermost_block
= candidates
[i
].block
;
3400 case BINOP_BITWISE_AND
:
3401 case BINOP_BITWISE_IOR
:
3402 case BINOP_BITWISE_XOR
:
3404 case BINOP_NOTEQUAL
:
3412 case UNOP_LOGICAL_NOT
:
3414 if (possible_user_operator_p (op
, argvec
))
3416 struct ada_symbol_info
*candidates
;
3420 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3421 (struct block
*) NULL
, VAR_DOMAIN
,
3423 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3424 ada_decoded_op_name (op
), NULL
);
3428 replace_operator_with_call (expp
, pc
, nargs
, 1,
3429 candidates
[i
].sym
, candidates
[i
].block
);
3440 return evaluate_subexp_type (exp
, pos
);
3443 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3444 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3446 /* The term "match" here is rather loose. The match is heuristic and
3450 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3452 ftype
= ada_check_typedef (ftype
);
3453 atype
= ada_check_typedef (atype
);
3455 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3456 ftype
= TYPE_TARGET_TYPE (ftype
);
3457 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3458 atype
= TYPE_TARGET_TYPE (atype
);
3460 switch (TYPE_CODE (ftype
))
3463 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3465 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3466 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3467 TYPE_TARGET_TYPE (atype
), 0);
3470 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3472 case TYPE_CODE_ENUM
:
3473 case TYPE_CODE_RANGE
:
3474 switch (TYPE_CODE (atype
))
3477 case TYPE_CODE_ENUM
:
3478 case TYPE_CODE_RANGE
:
3484 case TYPE_CODE_ARRAY
:
3485 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3486 || ada_is_array_descriptor_type (atype
));
3488 case TYPE_CODE_STRUCT
:
3489 if (ada_is_array_descriptor_type (ftype
))
3490 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3491 || ada_is_array_descriptor_type (atype
));
3493 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3494 && !ada_is_array_descriptor_type (atype
));
3496 case TYPE_CODE_UNION
:
3498 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3502 /* Return non-zero if the formals of FUNC "sufficiently match" the
3503 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3504 may also be an enumeral, in which case it is treated as a 0-
3505 argument function. */
3508 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3511 struct type
*func_type
= SYMBOL_TYPE (func
);
3513 if (SYMBOL_CLASS (func
) == LOC_CONST
3514 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3515 return (n_actuals
== 0);
3516 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3519 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3522 for (i
= 0; i
< n_actuals
; i
+= 1)
3524 if (actuals
[i
] == NULL
)
3528 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3530 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3532 if (!ada_type_match (ftype
, atype
, 1))
3539 /* False iff function type FUNC_TYPE definitely does not produce a value
3540 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3541 FUNC_TYPE is not a valid function type with a non-null return type
3542 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3545 return_match (struct type
*func_type
, struct type
*context_type
)
3547 struct type
*return_type
;
3549 if (func_type
== NULL
)
3552 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3553 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3555 return_type
= get_base_type (func_type
);
3556 if (return_type
== NULL
)
3559 context_type
= get_base_type (context_type
);
3561 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3562 return context_type
== NULL
|| return_type
== context_type
;
3563 else if (context_type
== NULL
)
3564 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3566 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3570 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3571 function (if any) that matches the types of the NARGS arguments in
3572 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3573 that returns that type, then eliminate matches that don't. If
3574 CONTEXT_TYPE is void and there is at least one match that does not
3575 return void, eliminate all matches that do.
3577 Asks the user if there is more than one match remaining. Returns -1
3578 if there is no such symbol or none is selected. NAME is used
3579 solely for messages. May re-arrange and modify SYMS in
3580 the process; the index returned is for the modified vector. */
3583 ada_resolve_function (struct ada_symbol_info syms
[],
3584 int nsyms
, struct value
**args
, int nargs
,
3585 const char *name
, struct type
*context_type
)
3589 int m
; /* Number of hits */
3592 /* In the first pass of the loop, we only accept functions matching
3593 context_type. If none are found, we add a second pass of the loop
3594 where every function is accepted. */
3595 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3597 for (k
= 0; k
< nsyms
; k
+= 1)
3599 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3601 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3602 && (fallback
|| return_match (type
, context_type
)))
3614 printf_filtered (_("Multiple matches for %s\n"), name
);
3615 user_select_syms (syms
, m
, 1);
3621 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3622 in a listing of choices during disambiguation (see sort_choices, below).
3623 The idea is that overloadings of a subprogram name from the
3624 same package should sort in their source order. We settle for ordering
3625 such symbols by their trailing number (__N or $N). */
3628 encoded_ordered_before (const char *N0
, const char *N1
)
3632 else if (N0
== NULL
)
3638 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3640 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3642 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3643 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3648 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3651 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3653 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3654 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3656 return (strcmp (N0
, N1
) < 0);
3660 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3664 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3668 for (i
= 1; i
< nsyms
; i
+= 1)
3670 struct ada_symbol_info sym
= syms
[i
];
3673 for (j
= i
- 1; j
>= 0; j
-= 1)
3675 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3676 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3678 syms
[j
+ 1] = syms
[j
];
3684 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3685 by asking the user (if necessary), returning the number selected,
3686 and setting the first elements of SYMS items. Error if no symbols
3689 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3690 to be re-integrated one of these days. */
3693 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3696 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3698 int first_choice
= (max_results
== 1) ? 1 : 2;
3699 const char *select_mode
= multiple_symbols_select_mode ();
3701 if (max_results
< 1)
3702 error (_("Request to select 0 symbols!"));
3706 if (select_mode
== multiple_symbols_cancel
)
3708 canceled because the command is ambiguous\n\
3709 See set/show multiple-symbol."));
3711 /* If select_mode is "all", then return all possible symbols.
3712 Only do that if more than one symbol can be selected, of course.
3713 Otherwise, display the menu as usual. */
3714 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3717 printf_unfiltered (_("[0] cancel\n"));
3718 if (max_results
> 1)
3719 printf_unfiltered (_("[1] all\n"));
3721 sort_choices (syms
, nsyms
);
3723 for (i
= 0; i
< nsyms
; i
+= 1)
3725 if (syms
[i
].sym
== NULL
)
3728 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3730 struct symtab_and_line sal
=
3731 find_function_start_sal (syms
[i
].sym
, 1);
3733 if (sal
.symtab
== NULL
)
3734 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3736 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3739 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3740 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3741 symtab_to_filename_for_display (sal
.symtab
),
3748 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3749 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3750 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3751 struct symtab
*symtab
= NULL
;
3753 if (SYMBOL_OBJFILE_OWNED (syms
[i
].sym
))
3754 symtab
= symbol_symtab (syms
[i
].sym
);
3756 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3757 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3759 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3760 symtab_to_filename_for_display (symtab
),
3761 SYMBOL_LINE (syms
[i
].sym
));
3762 else if (is_enumeral
3763 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3765 printf_unfiltered (("[%d] "), i
+ first_choice
);
3766 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3767 gdb_stdout
, -1, 0, &type_print_raw_options
);
3768 printf_unfiltered (_("'(%s) (enumeral)\n"),
3769 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3771 else if (symtab
!= NULL
)
3772 printf_unfiltered (is_enumeral
3773 ? _("[%d] %s in %s (enumeral)\n")
3774 : _("[%d] %s at %s:?\n"),
3776 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3777 symtab_to_filename_for_display (symtab
));
3779 printf_unfiltered (is_enumeral
3780 ? _("[%d] %s (enumeral)\n")
3781 : _("[%d] %s at ?\n"),
3783 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3787 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3790 for (i
= 0; i
< n_chosen
; i
+= 1)
3791 syms
[i
] = syms
[chosen
[i
]];
3796 /* Read and validate a set of numeric choices from the user in the
3797 range 0 .. N_CHOICES-1. Place the results in increasing
3798 order in CHOICES[0 .. N-1], and return N.
3800 The user types choices as a sequence of numbers on one line
3801 separated by blanks, encoding them as follows:
3803 + A choice of 0 means to cancel the selection, throwing an error.
3804 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3805 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3807 The user is not allowed to choose more than MAX_RESULTS values.
3809 ANNOTATION_SUFFIX, if present, is used to annotate the input
3810 prompts (for use with the -f switch). */
3813 get_selections (int *choices
, int n_choices
, int max_results
,
3814 int is_all_choice
, char *annotation_suffix
)
3819 int first_choice
= is_all_choice
? 2 : 1;
3821 prompt
= getenv ("PS2");
3825 args
= command_line_input (prompt
, 0, annotation_suffix
);
3828 error_no_arg (_("one or more choice numbers"));
3832 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3833 order, as given in args. Choices are validated. */
3839 args
= skip_spaces (args
);
3840 if (*args
== '\0' && n_chosen
== 0)
3841 error_no_arg (_("one or more choice numbers"));
3842 else if (*args
== '\0')
3845 choice
= strtol (args
, &args2
, 10);
3846 if (args
== args2
|| choice
< 0
3847 || choice
> n_choices
+ first_choice
- 1)
3848 error (_("Argument must be choice number"));
3852 error (_("cancelled"));
3854 if (choice
< first_choice
)
3856 n_chosen
= n_choices
;
3857 for (j
= 0; j
< n_choices
; j
+= 1)
3861 choice
-= first_choice
;
3863 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3867 if (j
< 0 || choice
!= choices
[j
])
3871 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3872 choices
[k
+ 1] = choices
[k
];
3873 choices
[j
+ 1] = choice
;
3878 if (n_chosen
> max_results
)
3879 error (_("Select no more than %d of the above"), max_results
);
3884 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3885 on the function identified by SYM and BLOCK, and taking NARGS
3886 arguments. Update *EXPP as needed to hold more space. */
3889 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3890 int oplen
, struct symbol
*sym
,
3891 const struct block
*block
)
3893 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3894 symbol, -oplen for operator being replaced). */
3895 struct expression
*newexp
= (struct expression
*)
3896 xzalloc (sizeof (struct expression
)
3897 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3898 struct expression
*exp
= *expp
;
3900 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3901 newexp
->language_defn
= exp
->language_defn
;
3902 newexp
->gdbarch
= exp
->gdbarch
;
3903 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3904 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3905 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3907 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3908 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3910 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3911 newexp
->elts
[pc
+ 4].block
= block
;
3912 newexp
->elts
[pc
+ 5].symbol
= sym
;
3918 /* Type-class predicates */
3920 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3924 numeric_type_p (struct type
*type
)
3930 switch (TYPE_CODE (type
))
3935 case TYPE_CODE_RANGE
:
3936 return (type
== TYPE_TARGET_TYPE (type
)
3937 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3944 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3947 integer_type_p (struct type
*type
)
3953 switch (TYPE_CODE (type
))
3957 case TYPE_CODE_RANGE
:
3958 return (type
== TYPE_TARGET_TYPE (type
)
3959 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3966 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3969 scalar_type_p (struct type
*type
)
3975 switch (TYPE_CODE (type
))
3978 case TYPE_CODE_RANGE
:
3979 case TYPE_CODE_ENUM
:
3988 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3991 discrete_type_p (struct type
*type
)
3997 switch (TYPE_CODE (type
))
4000 case TYPE_CODE_RANGE
:
4001 case TYPE_CODE_ENUM
:
4002 case TYPE_CODE_BOOL
:
4010 /* Returns non-zero if OP with operands in the vector ARGS could be
4011 a user-defined function. Errs on the side of pre-defined operators
4012 (i.e., result 0). */
4015 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4017 struct type
*type0
=
4018 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4019 struct type
*type1
=
4020 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4034 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4038 case BINOP_BITWISE_AND
:
4039 case BINOP_BITWISE_IOR
:
4040 case BINOP_BITWISE_XOR
:
4041 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4044 case BINOP_NOTEQUAL
:
4049 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4052 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4055 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4059 case UNOP_LOGICAL_NOT
:
4061 return (!numeric_type_p (type0
));
4070 1. In the following, we assume that a renaming type's name may
4071 have an ___XD suffix. It would be nice if this went away at some
4073 2. We handle both the (old) purely type-based representation of
4074 renamings and the (new) variable-based encoding. At some point,
4075 it is devoutly to be hoped that the former goes away
4076 (FIXME: hilfinger-2007-07-09).
4077 3. Subprogram renamings are not implemented, although the XRS
4078 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4080 /* If SYM encodes a renaming,
4082 <renaming> renames <renamed entity>,
4084 sets *LEN to the length of the renamed entity's name,
4085 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4086 the string describing the subcomponent selected from the renamed
4087 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4088 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4089 are undefined). Otherwise, returns a value indicating the category
4090 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4091 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4092 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4093 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4094 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4095 may be NULL, in which case they are not assigned.
4097 [Currently, however, GCC does not generate subprogram renamings.] */
4099 enum ada_renaming_category
4100 ada_parse_renaming (struct symbol
*sym
,
4101 const char **renamed_entity
, int *len
,
4102 const char **renaming_expr
)
4104 enum ada_renaming_category kind
;
4109 return ADA_NOT_RENAMING
;
4110 switch (SYMBOL_CLASS (sym
))
4113 return ADA_NOT_RENAMING
;
4115 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
4116 renamed_entity
, len
, renaming_expr
);
4120 case LOC_OPTIMIZED_OUT
:
4121 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4123 return ADA_NOT_RENAMING
;
4127 kind
= ADA_OBJECT_RENAMING
;
4131 kind
= ADA_EXCEPTION_RENAMING
;
4135 kind
= ADA_PACKAGE_RENAMING
;
4139 kind
= ADA_SUBPROGRAM_RENAMING
;
4143 return ADA_NOT_RENAMING
;
4147 if (renamed_entity
!= NULL
)
4148 *renamed_entity
= info
;
4149 suffix
= strstr (info
, "___XE");
4150 if (suffix
== NULL
|| suffix
== info
)
4151 return ADA_NOT_RENAMING
;
4153 *len
= strlen (info
) - strlen (suffix
);
4155 if (renaming_expr
!= NULL
)
4156 *renaming_expr
= suffix
;
4160 /* Assuming TYPE encodes a renaming according to the old encoding in
4161 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4162 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4163 ADA_NOT_RENAMING otherwise. */
4164 static enum ada_renaming_category
4165 parse_old_style_renaming (struct type
*type
,
4166 const char **renamed_entity
, int *len
,
4167 const char **renaming_expr
)
4169 enum ada_renaming_category kind
;
4174 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4175 || TYPE_NFIELDS (type
) != 1)
4176 return ADA_NOT_RENAMING
;
4178 name
= type_name_no_tag (type
);
4180 return ADA_NOT_RENAMING
;
4182 name
= strstr (name
, "___XR");
4184 return ADA_NOT_RENAMING
;
4189 kind
= ADA_OBJECT_RENAMING
;
4192 kind
= ADA_EXCEPTION_RENAMING
;
4195 kind
= ADA_PACKAGE_RENAMING
;
4198 kind
= ADA_SUBPROGRAM_RENAMING
;
4201 return ADA_NOT_RENAMING
;
4204 info
= TYPE_FIELD_NAME (type
, 0);
4206 return ADA_NOT_RENAMING
;
4207 if (renamed_entity
!= NULL
)
4208 *renamed_entity
= info
;
4209 suffix
= strstr (info
, "___XE");
4210 if (renaming_expr
!= NULL
)
4211 *renaming_expr
= suffix
+ 5;
4212 if (suffix
== NULL
|| suffix
== info
)
4213 return ADA_NOT_RENAMING
;
4215 *len
= suffix
- info
;
4219 /* Compute the value of the given RENAMING_SYM, which is expected to
4220 be a symbol encoding a renaming expression. BLOCK is the block
4221 used to evaluate the renaming. */
4223 static struct value
*
4224 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4225 const struct block
*block
)
4227 const char *sym_name
;
4228 struct expression
*expr
;
4229 struct value
*value
;
4230 struct cleanup
*old_chain
= NULL
;
4232 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4233 expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4234 old_chain
= make_cleanup (free_current_contents
, &expr
);
4235 value
= evaluate_expression (expr
);
4237 do_cleanups (old_chain
);
4242 /* Evaluation: Function Calls */
4244 /* Return an lvalue containing the value VAL. This is the identity on
4245 lvalues, and otherwise has the side-effect of allocating memory
4246 in the inferior where a copy of the value contents is copied. */
4248 static struct value
*
4249 ensure_lval (struct value
*val
)
4251 if (VALUE_LVAL (val
) == not_lval
4252 || VALUE_LVAL (val
) == lval_internalvar
)
4254 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4255 const CORE_ADDR addr
=
4256 value_as_long (value_allocate_space_in_inferior (len
));
4258 set_value_address (val
, addr
);
4259 VALUE_LVAL (val
) = lval_memory
;
4260 write_memory (addr
, value_contents (val
), len
);
4266 /* Return the value ACTUAL, converted to be an appropriate value for a
4267 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4268 allocating any necessary descriptors (fat pointers), or copies of
4269 values not residing in memory, updating it as needed. */
4272 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4274 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4275 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4276 struct type
*formal_target
=
4277 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4278 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4279 struct type
*actual_target
=
4280 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4281 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4283 if (ada_is_array_descriptor_type (formal_target
)
4284 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4285 return make_array_descriptor (formal_type
, actual
);
4286 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4287 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4289 struct value
*result
;
4291 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4292 && ada_is_array_descriptor_type (actual_target
))
4293 result
= desc_data (actual
);
4294 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4296 if (VALUE_LVAL (actual
) != lval_memory
)
4300 actual_type
= ada_check_typedef (value_type (actual
));
4301 val
= allocate_value (actual_type
);
4302 memcpy ((char *) value_contents_raw (val
),
4303 (char *) value_contents (actual
),
4304 TYPE_LENGTH (actual_type
));
4305 actual
= ensure_lval (val
);
4307 result
= value_addr (actual
);
4311 return value_cast_pointers (formal_type
, result
, 0);
4313 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4314 return ada_value_ind (actual
);
4315 else if (ada_is_aligner_type (formal_type
))
4317 /* We need to turn this parameter into an aligner type
4319 struct value
*aligner
= allocate_value (formal_type
);
4320 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4322 value_assign_to_component (aligner
, component
, actual
);
4329 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4330 type TYPE. This is usually an inefficient no-op except on some targets
4331 (such as AVR) where the representation of a pointer and an address
4335 value_pointer (struct value
*value
, struct type
*type
)
4337 struct gdbarch
*gdbarch
= get_type_arch (type
);
4338 unsigned len
= TYPE_LENGTH (type
);
4339 gdb_byte
*buf
= alloca (len
);
4342 addr
= value_address (value
);
4343 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4344 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4349 /* Push a descriptor of type TYPE for array value ARR on the stack at
4350 *SP, updating *SP to reflect the new descriptor. Return either
4351 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4352 to-descriptor type rather than a descriptor type), a struct value *
4353 representing a pointer to this descriptor. */
4355 static struct value
*
4356 make_array_descriptor (struct type
*type
, struct value
*arr
)
4358 struct type
*bounds_type
= desc_bounds_type (type
);
4359 struct type
*desc_type
= desc_base_type (type
);
4360 struct value
*descriptor
= allocate_value (desc_type
);
4361 struct value
*bounds
= allocate_value (bounds_type
);
4364 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4367 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4368 ada_array_bound (arr
, i
, 0),
4369 desc_bound_bitpos (bounds_type
, i
, 0),
4370 desc_bound_bitsize (bounds_type
, i
, 0));
4371 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4372 ada_array_bound (arr
, i
, 1),
4373 desc_bound_bitpos (bounds_type
, i
, 1),
4374 desc_bound_bitsize (bounds_type
, i
, 1));
4377 bounds
= ensure_lval (bounds
);
4379 modify_field (value_type (descriptor
),
4380 value_contents_writeable (descriptor
),
4381 value_pointer (ensure_lval (arr
),
4382 TYPE_FIELD_TYPE (desc_type
, 0)),
4383 fat_pntr_data_bitpos (desc_type
),
4384 fat_pntr_data_bitsize (desc_type
));
4386 modify_field (value_type (descriptor
),
4387 value_contents_writeable (descriptor
),
4388 value_pointer (bounds
,
4389 TYPE_FIELD_TYPE (desc_type
, 1)),
4390 fat_pntr_bounds_bitpos (desc_type
),
4391 fat_pntr_bounds_bitsize (desc_type
));
4393 descriptor
= ensure_lval (descriptor
);
4395 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4396 return value_addr (descriptor
);
4401 /* Symbol Cache Module */
4403 /* Performance measurements made as of 2010-01-15 indicate that
4404 this cache does bring some noticeable improvements. Depending
4405 on the type of entity being printed, the cache can make it as much
4406 as an order of magnitude faster than without it.
4408 The descriptive type DWARF extension has significantly reduced
4409 the need for this cache, at least when DWARF is being used. However,
4410 even in this case, some expensive name-based symbol searches are still
4411 sometimes necessary - to find an XVZ variable, mostly. */
4413 /* Initialize the contents of SYM_CACHE. */
4416 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4418 obstack_init (&sym_cache
->cache_space
);
4419 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4422 /* Free the memory used by SYM_CACHE. */
4425 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4427 obstack_free (&sym_cache
->cache_space
, NULL
);
4431 /* Return the symbol cache associated to the given program space PSPACE.
4432 If not allocated for this PSPACE yet, allocate and initialize one. */
4434 static struct ada_symbol_cache
*
4435 ada_get_symbol_cache (struct program_space
*pspace
)
4437 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4439 if (pspace_data
->sym_cache
== NULL
)
4441 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4442 ada_init_symbol_cache (pspace_data
->sym_cache
);
4445 return pspace_data
->sym_cache
;
4448 /* Clear all entries from the symbol cache. */
4451 ada_clear_symbol_cache (void)
4453 struct ada_symbol_cache
*sym_cache
4454 = ada_get_symbol_cache (current_program_space
);
4456 obstack_free (&sym_cache
->cache_space
, NULL
);
4457 ada_init_symbol_cache (sym_cache
);
4460 /* Search our cache for an entry matching NAME and DOMAIN.
4461 Return it if found, or NULL otherwise. */
4463 static struct cache_entry
**
4464 find_entry (const char *name
, domain_enum domain
)
4466 struct ada_symbol_cache
*sym_cache
4467 = ada_get_symbol_cache (current_program_space
);
4468 int h
= msymbol_hash (name
) % HASH_SIZE
;
4469 struct cache_entry
**e
;
4471 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4473 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4479 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4480 Return 1 if found, 0 otherwise.
4482 If an entry was found and SYM is not NULL, set *SYM to the entry's
4483 SYM. Same principle for BLOCK if not NULL. */
4486 lookup_cached_symbol (const char *name
, domain_enum domain
,
4487 struct symbol
**sym
, const struct block
**block
)
4489 struct cache_entry
**e
= find_entry (name
, domain
);
4496 *block
= (*e
)->block
;
4500 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4501 in domain DOMAIN, save this result in our symbol cache. */
4504 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4505 const struct block
*block
)
4507 struct ada_symbol_cache
*sym_cache
4508 = ada_get_symbol_cache (current_program_space
);
4511 struct cache_entry
*e
;
4513 /* Symbols for builtin types don't have a block.
4514 For now don't cache such symbols. */
4515 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4518 /* If the symbol is a local symbol, then do not cache it, as a search
4519 for that symbol depends on the context. To determine whether
4520 the symbol is local or not, we check the block where we found it
4521 against the global and static blocks of its associated symtab. */
4523 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4524 GLOBAL_BLOCK
) != block
4525 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4526 STATIC_BLOCK
) != block
)
4529 h
= msymbol_hash (name
) % HASH_SIZE
;
4530 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4532 e
->next
= sym_cache
->root
[h
];
4533 sym_cache
->root
[h
] = e
;
4534 e
->name
= copy
= obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4535 strcpy (copy
, name
);
4543 /* Return nonzero if wild matching should be used when searching for
4544 all symbols matching LOOKUP_NAME.
4546 LOOKUP_NAME is expected to be a symbol name after transformation
4547 for Ada lookups (see ada_name_for_lookup). */
4550 should_use_wild_match (const char *lookup_name
)
4552 return (strstr (lookup_name
, "__") == NULL
);
4555 /* Return the result of a standard (literal, C-like) lookup of NAME in
4556 given DOMAIN, visible from lexical block BLOCK. */
4558 static struct symbol
*
4559 standard_lookup (const char *name
, const struct block
*block
,
4562 /* Initialize it just to avoid a GCC false warning. */
4563 struct symbol
*sym
= NULL
;
4565 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4567 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4568 cache_symbol (name
, domain
, sym
, block_found
);
4573 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4574 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4575 since they contend in overloading in the same way. */
4577 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4581 for (i
= 0; i
< n
; i
+= 1)
4582 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4583 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4584 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4590 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4591 struct types. Otherwise, they may not. */
4594 equiv_types (struct type
*type0
, struct type
*type1
)
4598 if (type0
== NULL
|| type1
== NULL
4599 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4601 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4602 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4603 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4604 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4610 /* True iff SYM0 represents the same entity as SYM1, or one that is
4611 no more defined than that of SYM1. */
4614 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4618 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4619 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4622 switch (SYMBOL_CLASS (sym0
))
4628 struct type
*type0
= SYMBOL_TYPE (sym0
);
4629 struct type
*type1
= SYMBOL_TYPE (sym1
);
4630 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4631 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4632 int len0
= strlen (name0
);
4635 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4636 && (equiv_types (type0
, type1
)
4637 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4638 && startswith (name1
+ len0
, "___XV")));
4641 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4642 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4648 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4649 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4652 add_defn_to_vec (struct obstack
*obstackp
,
4654 const struct block
*block
)
4657 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4659 /* Do not try to complete stub types, as the debugger is probably
4660 already scanning all symbols matching a certain name at the
4661 time when this function is called. Trying to replace the stub
4662 type by its associated full type will cause us to restart a scan
4663 which may lead to an infinite recursion. Instead, the client
4664 collecting the matching symbols will end up collecting several
4665 matches, with at least one of them complete. It can then filter
4666 out the stub ones if needed. */
4668 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4670 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4672 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4674 prevDefns
[i
].sym
= sym
;
4675 prevDefns
[i
].block
= block
;
4681 struct ada_symbol_info info
;
4685 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4689 /* Number of ada_symbol_info structures currently collected in
4690 current vector in *OBSTACKP. */
4693 num_defns_collected (struct obstack
*obstackp
)
4695 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4698 /* Vector of ada_symbol_info structures currently collected in current
4699 vector in *OBSTACKP. If FINISH, close off the vector and return
4700 its final address. */
4702 static struct ada_symbol_info
*
4703 defns_collected (struct obstack
*obstackp
, int finish
)
4706 return obstack_finish (obstackp
);
4708 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4711 /* Return a bound minimal symbol matching NAME according to Ada
4712 decoding rules. Returns an invalid symbol if there is no such
4713 minimal symbol. Names prefixed with "standard__" are handled
4714 specially: "standard__" is first stripped off, and only static and
4715 global symbols are searched. */
4717 struct bound_minimal_symbol
4718 ada_lookup_simple_minsym (const char *name
)
4720 struct bound_minimal_symbol result
;
4721 struct objfile
*objfile
;
4722 struct minimal_symbol
*msymbol
;
4723 const int wild_match_p
= should_use_wild_match (name
);
4725 memset (&result
, 0, sizeof (result
));
4727 /* Special case: If the user specifies a symbol name inside package
4728 Standard, do a non-wild matching of the symbol name without
4729 the "standard__" prefix. This was primarily introduced in order
4730 to allow the user to specifically access the standard exceptions
4731 using, for instance, Standard.Constraint_Error when Constraint_Error
4732 is ambiguous (due to the user defining its own Constraint_Error
4733 entity inside its program). */
4734 if (startswith (name
, "standard__"))
4735 name
+= sizeof ("standard__") - 1;
4737 ALL_MSYMBOLS (objfile
, msymbol
)
4739 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match_p
)
4740 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4742 result
.minsym
= msymbol
;
4743 result
.objfile
= objfile
;
4751 /* For all subprograms that statically enclose the subprogram of the
4752 selected frame, add symbols matching identifier NAME in DOMAIN
4753 and their blocks to the list of data in OBSTACKP, as for
4754 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4755 with a wildcard prefix. */
4758 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4759 const char *name
, domain_enum domain
,
4764 /* True if TYPE is definitely an artificial type supplied to a symbol
4765 for which no debugging information was given in the symbol file. */
4768 is_nondebugging_type (struct type
*type
)
4770 const char *name
= ada_type_name (type
);
4772 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4775 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4776 that are deemed "identical" for practical purposes.
4778 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4779 types and that their number of enumerals is identical (in other
4780 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4783 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4787 /* The heuristic we use here is fairly conservative. We consider
4788 that 2 enumerate types are identical if they have the same
4789 number of enumerals and that all enumerals have the same
4790 underlying value and name. */
4792 /* All enums in the type should have an identical underlying value. */
4793 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4794 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4797 /* All enumerals should also have the same name (modulo any numerical
4799 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4801 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4802 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4803 int len_1
= strlen (name_1
);
4804 int len_2
= strlen (name_2
);
4806 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4807 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4809 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4810 TYPE_FIELD_NAME (type2
, i
),
4818 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4819 that are deemed "identical" for practical purposes. Sometimes,
4820 enumerals are not strictly identical, but their types are so similar
4821 that they can be considered identical.
4823 For instance, consider the following code:
4825 type Color is (Black, Red, Green, Blue, White);
4826 type RGB_Color is new Color range Red .. Blue;
4828 Type RGB_Color is a subrange of an implicit type which is a copy
4829 of type Color. If we call that implicit type RGB_ColorB ("B" is
4830 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4831 As a result, when an expression references any of the enumeral
4832 by name (Eg. "print green"), the expression is technically
4833 ambiguous and the user should be asked to disambiguate. But
4834 doing so would only hinder the user, since it wouldn't matter
4835 what choice he makes, the outcome would always be the same.
4836 So, for practical purposes, we consider them as the same. */
4839 symbols_are_identical_enums (struct ada_symbol_info
*syms
, int nsyms
)
4843 /* Before performing a thorough comparison check of each type,
4844 we perform a series of inexpensive checks. We expect that these
4845 checks will quickly fail in the vast majority of cases, and thus
4846 help prevent the unnecessary use of a more expensive comparison.
4847 Said comparison also expects us to make some of these checks
4848 (see ada_identical_enum_types_p). */
4850 /* Quick check: All symbols should have an enum type. */
4851 for (i
= 0; i
< nsyms
; i
++)
4852 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
)
4855 /* Quick check: They should all have the same value. */
4856 for (i
= 1; i
< nsyms
; i
++)
4857 if (SYMBOL_VALUE (syms
[i
].sym
) != SYMBOL_VALUE (syms
[0].sym
))
4860 /* Quick check: They should all have the same number of enumerals. */
4861 for (i
= 1; i
< nsyms
; i
++)
4862 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].sym
))
4863 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].sym
)))
4866 /* All the sanity checks passed, so we might have a set of
4867 identical enumeration types. Perform a more complete
4868 comparison of the type of each symbol. */
4869 for (i
= 1; i
< nsyms
; i
++)
4870 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].sym
),
4871 SYMBOL_TYPE (syms
[0].sym
)))
4877 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4878 duplicate other symbols in the list (The only case I know of where
4879 this happens is when object files containing stabs-in-ecoff are
4880 linked with files containing ordinary ecoff debugging symbols (or no
4881 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4882 Returns the number of items in the modified list. */
4885 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4889 /* We should never be called with less than 2 symbols, as there
4890 cannot be any extra symbol in that case. But it's easy to
4891 handle, since we have nothing to do in that case. */
4900 /* If two symbols have the same name and one of them is a stub type,
4901 the get rid of the stub. */
4903 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4904 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4906 for (j
= 0; j
< nsyms
; j
++)
4909 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4910 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4911 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4912 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4917 /* Two symbols with the same name, same class and same address
4918 should be identical. */
4920 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4921 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4922 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4924 for (j
= 0; j
< nsyms
; j
+= 1)
4927 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4928 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4929 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4930 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4931 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4932 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4939 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4940 syms
[j
- 1] = syms
[j
];
4947 /* If all the remaining symbols are identical enumerals, then
4948 just keep the first one and discard the rest.
4950 Unlike what we did previously, we do not discard any entry
4951 unless they are ALL identical. This is because the symbol
4952 comparison is not a strict comparison, but rather a practical
4953 comparison. If all symbols are considered identical, then
4954 we can just go ahead and use the first one and discard the rest.
4955 But if we cannot reduce the list to a single element, we have
4956 to ask the user to disambiguate anyways. And if we have to
4957 present a multiple-choice menu, it's less confusing if the list
4958 isn't missing some choices that were identical and yet distinct. */
4959 if (symbols_are_identical_enums (syms
, nsyms
))
4965 /* Given a type that corresponds to a renaming entity, use the type name
4966 to extract the scope (package name or function name, fully qualified,
4967 and following the GNAT encoding convention) where this renaming has been
4968 defined. The string returned needs to be deallocated after use. */
4971 xget_renaming_scope (struct type
*renaming_type
)
4973 /* The renaming types adhere to the following convention:
4974 <scope>__<rename>___<XR extension>.
4975 So, to extract the scope, we search for the "___XR" extension,
4976 and then backtrack until we find the first "__". */
4978 const char *name
= type_name_no_tag (renaming_type
);
4979 char *suffix
= strstr (name
, "___XR");
4984 /* Now, backtrack a bit until we find the first "__". Start looking
4985 at suffix - 3, as the <rename> part is at least one character long. */
4987 for (last
= suffix
- 3; last
> name
; last
--)
4988 if (last
[0] == '_' && last
[1] == '_')
4991 /* Make a copy of scope and return it. */
4993 scope_len
= last
- name
;
4994 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4996 strncpy (scope
, name
, scope_len
);
4997 scope
[scope_len
] = '\0';
5002 /* Return nonzero if NAME corresponds to a package name. */
5005 is_package_name (const char *name
)
5007 /* Here, We take advantage of the fact that no symbols are generated
5008 for packages, while symbols are generated for each function.
5009 So the condition for NAME represent a package becomes equivalent
5010 to NAME not existing in our list of symbols. There is only one
5011 small complication with library-level functions (see below). */
5015 /* If it is a function that has not been defined at library level,
5016 then we should be able to look it up in the symbols. */
5017 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5020 /* Library-level function names start with "_ada_". See if function
5021 "_ada_" followed by NAME can be found. */
5023 /* Do a quick check that NAME does not contain "__", since library-level
5024 functions names cannot contain "__" in them. */
5025 if (strstr (name
, "__") != NULL
)
5028 fun_name
= xstrprintf ("_ada_%s", name
);
5030 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
5033 /* Return nonzero if SYM corresponds to a renaming entity that is
5034 not visible from FUNCTION_NAME. */
5037 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5040 struct cleanup
*old_chain
;
5042 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5045 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5046 old_chain
= make_cleanup (xfree
, scope
);
5048 /* If the rename has been defined in a package, then it is visible. */
5049 if (is_package_name (scope
))
5051 do_cleanups (old_chain
);
5055 /* Check that the rename is in the current function scope by checking
5056 that its name starts with SCOPE. */
5058 /* If the function name starts with "_ada_", it means that it is
5059 a library-level function. Strip this prefix before doing the
5060 comparison, as the encoding for the renaming does not contain
5062 if (startswith (function_name
, "_ada_"))
5066 int is_invisible
= !startswith (function_name
, scope
);
5068 do_cleanups (old_chain
);
5069 return is_invisible
;
5073 /* Remove entries from SYMS that corresponds to a renaming entity that
5074 is not visible from the function associated with CURRENT_BLOCK or
5075 that is superfluous due to the presence of more specific renaming
5076 information. Places surviving symbols in the initial entries of
5077 SYMS and returns the number of surviving symbols.
5080 First, in cases where an object renaming is implemented as a
5081 reference variable, GNAT may produce both the actual reference
5082 variable and the renaming encoding. In this case, we discard the
5085 Second, GNAT emits a type following a specified encoding for each renaming
5086 entity. Unfortunately, STABS currently does not support the definition
5087 of types that are local to a given lexical block, so all renamings types
5088 are emitted at library level. As a consequence, if an application
5089 contains two renaming entities using the same name, and a user tries to
5090 print the value of one of these entities, the result of the ada symbol
5091 lookup will also contain the wrong renaming type.
5093 This function partially covers for this limitation by attempting to
5094 remove from the SYMS list renaming symbols that should be visible
5095 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5096 method with the current information available. The implementation
5097 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5099 - When the user tries to print a rename in a function while there
5100 is another rename entity defined in a package: Normally, the
5101 rename in the function has precedence over the rename in the
5102 package, so the latter should be removed from the list. This is
5103 currently not the case.
5105 - This function will incorrectly remove valid renames if
5106 the CURRENT_BLOCK corresponds to a function which symbol name
5107 has been changed by an "Export" pragma. As a consequence,
5108 the user will be unable to print such rename entities. */
5111 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
5112 int nsyms
, const struct block
*current_block
)
5114 struct symbol
*current_function
;
5115 const char *current_function_name
;
5117 int is_new_style_renaming
;
5119 /* If there is both a renaming foo___XR... encoded as a variable and
5120 a simple variable foo in the same block, discard the latter.
5121 First, zero out such symbols, then compress. */
5122 is_new_style_renaming
= 0;
5123 for (i
= 0; i
< nsyms
; i
+= 1)
5125 struct symbol
*sym
= syms
[i
].sym
;
5126 const struct block
*block
= syms
[i
].block
;
5130 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5132 name
= SYMBOL_LINKAGE_NAME (sym
);
5133 suffix
= strstr (name
, "___XR");
5137 int name_len
= suffix
- name
;
5140 is_new_style_renaming
= 1;
5141 for (j
= 0; j
< nsyms
; j
+= 1)
5142 if (i
!= j
&& syms
[j
].sym
!= NULL
5143 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
5145 && block
== syms
[j
].block
)
5149 if (is_new_style_renaming
)
5153 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5154 if (syms
[j
].sym
!= NULL
)
5162 /* Extract the function name associated to CURRENT_BLOCK.
5163 Abort if unable to do so. */
5165 if (current_block
== NULL
)
5168 current_function
= block_linkage_function (current_block
);
5169 if (current_function
== NULL
)
5172 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5173 if (current_function_name
== NULL
)
5176 /* Check each of the symbols, and remove it from the list if it is
5177 a type corresponding to a renaming that is out of the scope of
5178 the current block. */
5183 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
5184 == ADA_OBJECT_RENAMING
5185 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
5189 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5190 syms
[j
- 1] = syms
[j
];
5200 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5201 whose name and domain match NAME and DOMAIN respectively.
5202 If no match was found, then extend the search to "enclosing"
5203 routines (in other words, if we're inside a nested function,
5204 search the symbols defined inside the enclosing functions).
5205 If WILD_MATCH_P is nonzero, perform the naming matching in
5206 "wild" mode (see function "wild_match" for more info).
5208 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5211 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
5212 const struct block
*block
, domain_enum domain
,
5215 int block_depth
= 0;
5217 while (block
!= NULL
)
5220 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5223 /* If we found a non-function match, assume that's the one. */
5224 if (is_nonfunction (defns_collected (obstackp
, 0),
5225 num_defns_collected (obstackp
)))
5228 block
= BLOCK_SUPERBLOCK (block
);
5231 /* If no luck so far, try to find NAME as a local symbol in some lexically
5232 enclosing subprogram. */
5233 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5234 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match_p
);
5237 /* An object of this type is used as the user_data argument when
5238 calling the map_matching_symbols method. */
5242 struct objfile
*objfile
;
5243 struct obstack
*obstackp
;
5244 struct symbol
*arg_sym
;
5248 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
5249 to a list of symbols. DATA0 is a pointer to a struct match_data *
5250 containing the obstack that collects the symbol list, the file that SYM
5251 must come from, a flag indicating whether a non-argument symbol has
5252 been found in the current block, and the last argument symbol
5253 passed in SYM within the current block (if any). When SYM is null,
5254 marking the end of a block, the argument symbol is added if no
5255 other has been found. */
5258 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5260 struct match_data
*data
= (struct match_data
*) data0
;
5264 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5265 add_defn_to_vec (data
->obstackp
,
5266 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5268 data
->found_sym
= 0;
5269 data
->arg_sym
= NULL
;
5273 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5275 else if (SYMBOL_IS_ARGUMENT (sym
))
5276 data
->arg_sym
= sym
;
5279 data
->found_sym
= 1;
5280 add_defn_to_vec (data
->obstackp
,
5281 fixup_symbol_section (sym
, data
->objfile
),
5288 /* Implements compare_names, but only applying the comparision using
5289 the given CASING. */
5292 compare_names_with_case (const char *string1
, const char *string2
,
5293 enum case_sensitivity casing
)
5295 while (*string1
!= '\0' && *string2
!= '\0')
5299 if (isspace (*string1
) || isspace (*string2
))
5300 return strcmp_iw_ordered (string1
, string2
);
5302 if (casing
== case_sensitive_off
)
5304 c1
= tolower (*string1
);
5305 c2
= tolower (*string2
);
5322 return strcmp_iw_ordered (string1
, string2
);
5324 if (*string2
== '\0')
5326 if (is_name_suffix (string1
))
5333 if (*string2
== '(')
5334 return strcmp_iw_ordered (string1
, string2
);
5337 if (casing
== case_sensitive_off
)
5338 return tolower (*string1
) - tolower (*string2
);
5340 return *string1
- *string2
;
5345 /* Compare STRING1 to STRING2, with results as for strcmp.
5346 Compatible with strcmp_iw_ordered in that...
5348 strcmp_iw_ordered (STRING1, STRING2) <= 0
5352 compare_names (STRING1, STRING2) <= 0
5354 (they may differ as to what symbols compare equal). */
5357 compare_names (const char *string1
, const char *string2
)
5361 /* Similar to what strcmp_iw_ordered does, we need to perform
5362 a case-insensitive comparison first, and only resort to
5363 a second, case-sensitive, comparison if the first one was
5364 not sufficient to differentiate the two strings. */
5366 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5368 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5373 /* Add to OBSTACKP all non-local symbols whose name and domain match
5374 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5375 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5378 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5379 domain_enum domain
, int global
,
5382 struct objfile
*objfile
;
5383 struct match_data data
;
5385 memset (&data
, 0, sizeof data
);
5386 data
.obstackp
= obstackp
;
5388 ALL_OBJFILES (objfile
)
5390 data
.objfile
= objfile
;
5393 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5394 aux_add_nonlocal_symbols
, &data
,
5397 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5398 aux_add_nonlocal_symbols
, &data
,
5399 full_match
, compare_names
);
5402 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5404 ALL_OBJFILES (objfile
)
5406 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
5407 strcpy (name1
, "_ada_");
5408 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5409 data
.objfile
= objfile
;
5410 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
, domain
,
5412 aux_add_nonlocal_symbols
,
5414 full_match
, compare_names
);
5419 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and, if full_search is
5420 non-zero, enclosing scope and in global scopes, returning the number of
5422 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5423 indicating the symbols found and the blocks and symbol tables (if
5424 any) in which they were found. This vector is transient---good only to
5425 the next call of ada_lookup_symbol_list.
5427 When full_search is non-zero, any non-function/non-enumeral
5428 symbol match within the nest of blocks whose innermost member is BLOCK0,
5429 is the one match returned (no other matches in that or
5430 enclosing blocks is returned). If there are any matches in or
5431 surrounding BLOCK0, then these alone are returned.
5433 Names prefixed with "standard__" are handled specially: "standard__"
5434 is first stripped off, and only static and global symbols are searched. */
5437 ada_lookup_symbol_list_worker (const char *name0
, const struct block
*block0
,
5439 struct ada_symbol_info
**results
,
5443 const struct block
*block
;
5445 const int wild_match_p
= should_use_wild_match (name0
);
5446 int syms_from_global_search
= 0;
5449 obstack_free (&symbol_list_obstack
, NULL
);
5450 obstack_init (&symbol_list_obstack
);
5452 /* Search specified block and its superiors. */
5457 /* Special case: If the user specifies a symbol name inside package
5458 Standard, do a non-wild matching of the symbol name without
5459 the "standard__" prefix. This was primarily introduced in order
5460 to allow the user to specifically access the standard exceptions
5461 using, for instance, Standard.Constraint_Error when Constraint_Error
5462 is ambiguous (due to the user defining its own Constraint_Error
5463 entity inside its program). */
5464 if (startswith (name0
, "standard__"))
5467 name
= name0
+ sizeof ("standard__") - 1;
5470 /* Check the non-global symbols. If we have ANY match, then we're done. */
5476 ada_add_local_symbols (&symbol_list_obstack
, name
, block
,
5477 domain
, wild_match_p
);
5481 /* In the !full_search case we're are being called by
5482 ada_iterate_over_symbols, and we don't want to search
5484 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
5485 domain
, NULL
, wild_match_p
);
5487 if (num_defns_collected (&symbol_list_obstack
) > 0 || !full_search
)
5491 /* No non-global symbols found. Check our cache to see if we have
5492 already performed this search before. If we have, then return
5495 if (lookup_cached_symbol (name0
, domain
, &sym
, &block
))
5498 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5502 syms_from_global_search
= 1;
5504 /* Search symbols from all global blocks. */
5506 add_nonlocal_symbols (&symbol_list_obstack
, name
, domain
, 1,
5509 /* Now add symbols from all per-file blocks if we've gotten no hits
5510 (not strictly correct, but perhaps better than an error). */
5512 if (num_defns_collected (&symbol_list_obstack
) == 0)
5513 add_nonlocal_symbols (&symbol_list_obstack
, name
, domain
, 0,
5517 ndefns
= num_defns_collected (&symbol_list_obstack
);
5518 *results
= defns_collected (&symbol_list_obstack
, 1);
5520 ndefns
= remove_extra_symbols (*results
, ndefns
);
5522 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5523 cache_symbol (name0
, domain
, NULL
, NULL
);
5525 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5526 cache_symbol (name0
, domain
, (*results
)[0].sym
, (*results
)[0].block
);
5528 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5533 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5534 in global scopes, returning the number of matches, and setting *RESULTS
5535 to a vector of (SYM,BLOCK) tuples.
5536 See ada_lookup_symbol_list_worker for further details. */
5539 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5540 domain_enum domain
, struct ada_symbol_info
**results
)
5542 return ada_lookup_symbol_list_worker (name0
, block0
, domain
, results
, 1);
5545 /* Implementation of the la_iterate_over_symbols method. */
5548 ada_iterate_over_symbols (const struct block
*block
,
5549 const char *name
, domain_enum domain
,
5550 symbol_found_callback_ftype
*callback
,
5554 struct ada_symbol_info
*results
;
5556 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5557 for (i
= 0; i
< ndefs
; ++i
)
5559 if (! (*callback
) (results
[i
].sym
, data
))
5564 /* If NAME is the name of an entity, return a string that should
5565 be used to look that entity up in Ada units. This string should
5566 be deallocated after use using xfree.
5568 NAME can have any form that the "break" or "print" commands might
5569 recognize. In other words, it does not have to be the "natural"
5570 name, or the "encoded" name. */
5573 ada_name_for_lookup (const char *name
)
5576 int nlen
= strlen (name
);
5578 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5580 canon
= xmalloc (nlen
- 1);
5581 memcpy (canon
, name
+ 1, nlen
- 2);
5582 canon
[nlen
- 2] = '\0';
5585 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5589 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5590 to 1, but choosing the first symbol found if there are multiple
5593 The result is stored in *INFO, which must be non-NULL.
5594 If no match is found, INFO->SYM is set to NULL. */
5597 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5599 struct ada_symbol_info
*info
)
5601 struct ada_symbol_info
*candidates
;
5604 gdb_assert (info
!= NULL
);
5605 memset (info
, 0, sizeof (struct ada_symbol_info
));
5607 n_candidates
= ada_lookup_symbol_list (name
, block
, domain
, &candidates
);
5608 if (n_candidates
== 0)
5611 *info
= candidates
[0];
5612 info
->sym
= fixup_symbol_section (info
->sym
, NULL
);
5615 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5616 scope and in global scopes, or NULL if none. NAME is folded and
5617 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5618 choosing the first symbol if there are multiple choices.
5619 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5622 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5623 domain_enum domain
, int *is_a_field_of_this
)
5625 struct ada_symbol_info info
;
5627 if (is_a_field_of_this
!= NULL
)
5628 *is_a_field_of_this
= 0;
5630 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5631 block0
, domain
, &info
);
5635 static struct symbol
*
5636 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5638 const struct block
*block
,
5639 const domain_enum domain
)
5643 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5647 /* If we haven't found a match at this point, try the primitive
5648 types. In other languages, this search is performed before
5649 searching for global symbols in order to short-circuit that
5650 global-symbol search if it happens that the name corresponds
5651 to a primitive type. But we cannot do the same in Ada, because
5652 it is perfectly legitimate for a program to declare a type which
5653 has the same name as a standard type. If looking up a type in
5654 that situation, we have traditionally ignored the primitive type
5655 in favor of user-defined types. This is why, unlike most other
5656 languages, we search the primitive types this late and only after
5657 having searched the global symbols without success. */
5659 if (domain
== VAR_DOMAIN
)
5661 struct gdbarch
*gdbarch
;
5664 gdbarch
= target_gdbarch ();
5666 gdbarch
= block_gdbarch (block
);
5667 sym
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5676 /* True iff STR is a possible encoded suffix of a normal Ada name
5677 that is to be ignored for matching purposes. Suffixes of parallel
5678 names (e.g., XVE) are not included here. Currently, the possible suffixes
5679 are given by any of the regular expressions:
5681 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5682 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5683 TKB [subprogram suffix for task bodies]
5684 _E[0-9]+[bs]$ [protected object entry suffixes]
5685 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5687 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5688 match is performed. This sequence is used to differentiate homonyms,
5689 is an optional part of a valid name suffix. */
5692 is_name_suffix (const char *str
)
5695 const char *matching
;
5696 const int len
= strlen (str
);
5698 /* Skip optional leading __[0-9]+. */
5700 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5703 while (isdigit (str
[0]))
5709 if (str
[0] == '.' || str
[0] == '$')
5712 while (isdigit (matching
[0]))
5714 if (matching
[0] == '\0')
5720 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5723 while (isdigit (matching
[0]))
5725 if (matching
[0] == '\0')
5729 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5731 if (strcmp (str
, "TKB") == 0)
5735 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5736 with a N at the end. Unfortunately, the compiler uses the same
5737 convention for other internal types it creates. So treating
5738 all entity names that end with an "N" as a name suffix causes
5739 some regressions. For instance, consider the case of an enumerated
5740 type. To support the 'Image attribute, it creates an array whose
5742 Having a single character like this as a suffix carrying some
5743 information is a bit risky. Perhaps we should change the encoding
5744 to be something like "_N" instead. In the meantime, do not do
5745 the following check. */
5746 /* Protected Object Subprograms */
5747 if (len
== 1 && str
[0] == 'N')
5752 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5755 while (isdigit (matching
[0]))
5757 if ((matching
[0] == 'b' || matching
[0] == 's')
5758 && matching
[1] == '\0')
5762 /* ??? We should not modify STR directly, as we are doing below. This
5763 is fine in this case, but may become problematic later if we find
5764 that this alternative did not work, and want to try matching
5765 another one from the begining of STR. Since we modified it, we
5766 won't be able to find the begining of the string anymore! */
5770 while (str
[0] != '_' && str
[0] != '\0')
5772 if (str
[0] != 'n' && str
[0] != 'b')
5778 if (str
[0] == '\000')
5783 if (str
[1] != '_' || str
[2] == '\000')
5787 if (strcmp (str
+ 3, "JM") == 0)
5789 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5790 the LJM suffix in favor of the JM one. But we will
5791 still accept LJM as a valid suffix for a reasonable
5792 amount of time, just to allow ourselves to debug programs
5793 compiled using an older version of GNAT. */
5794 if (strcmp (str
+ 3, "LJM") == 0)
5798 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5799 || str
[4] == 'U' || str
[4] == 'P')
5801 if (str
[4] == 'R' && str
[5] != 'T')
5805 if (!isdigit (str
[2]))
5807 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5808 if (!isdigit (str
[k
]) && str
[k
] != '_')
5812 if (str
[0] == '$' && isdigit (str
[1]))
5814 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5815 if (!isdigit (str
[k
]) && str
[k
] != '_')
5822 /* Return non-zero if the string starting at NAME and ending before
5823 NAME_END contains no capital letters. */
5826 is_valid_name_for_wild_match (const char *name0
)
5828 const char *decoded_name
= ada_decode (name0
);
5831 /* If the decoded name starts with an angle bracket, it means that
5832 NAME0 does not follow the GNAT encoding format. It should then
5833 not be allowed as a possible wild match. */
5834 if (decoded_name
[0] == '<')
5837 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5838 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5844 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5845 that could start a simple name. Assumes that *NAMEP points into
5846 the string beginning at NAME0. */
5849 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5851 const char *name
= *namep
;
5861 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5864 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
5869 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5870 || name
[2] == target0
))
5878 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5888 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5889 informational suffixes of NAME (i.e., for which is_name_suffix is
5890 true). Assumes that PATN is a lower-cased Ada simple name. */
5893 wild_match (const char *name
, const char *patn
)
5896 const char *name0
= name
;
5900 const char *match
= name
;
5904 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5907 if (*p
== '\0' && is_name_suffix (name
))
5908 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5910 if (name
[-1] == '_')
5913 if (!advance_wild_match (&name
, name0
, *patn
))
5918 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5919 informational suffix. */
5922 full_match (const char *sym_name
, const char *search_name
)
5924 return !match_name (sym_name
, search_name
, 0);
5928 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5929 vector *defn_symbols, updating the list of symbols in OBSTACKP
5930 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5931 OBJFILE is the section containing BLOCK. */
5934 ada_add_block_symbols (struct obstack
*obstackp
,
5935 const struct block
*block
, const char *name
,
5936 domain_enum domain
, struct objfile
*objfile
,
5939 struct block_iterator iter
;
5940 int name_len
= strlen (name
);
5941 /* A matching argument symbol, if any. */
5942 struct symbol
*arg_sym
;
5943 /* Set true when we find a matching non-argument symbol. */
5951 for (sym
= block_iter_match_first (block
, name
, wild_match
, &iter
);
5952 sym
!= NULL
; sym
= block_iter_match_next (name
, wild_match
, &iter
))
5954 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5955 SYMBOL_DOMAIN (sym
), domain
)
5956 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5958 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5960 else if (SYMBOL_IS_ARGUMENT (sym
))
5965 add_defn_to_vec (obstackp
,
5966 fixup_symbol_section (sym
, objfile
),
5974 for (sym
= block_iter_match_first (block
, name
, full_match
, &iter
);
5975 sym
!= NULL
; sym
= block_iter_match_next (name
, full_match
, &iter
))
5977 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5978 SYMBOL_DOMAIN (sym
), domain
))
5980 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5982 if (SYMBOL_IS_ARGUMENT (sym
))
5987 add_defn_to_vec (obstackp
,
5988 fixup_symbol_section (sym
, objfile
),
5996 if (!found_sym
&& arg_sym
!= NULL
)
5998 add_defn_to_vec (obstackp
,
5999 fixup_symbol_section (arg_sym
, objfile
),
6008 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6010 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6011 SYMBOL_DOMAIN (sym
), domain
))
6015 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
6018 cmp
= !startswith (SYMBOL_LINKAGE_NAME (sym
), "_ada_");
6020 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
6025 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
6027 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6029 if (SYMBOL_IS_ARGUMENT (sym
))
6034 add_defn_to_vec (obstackp
,
6035 fixup_symbol_section (sym
, objfile
),
6043 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6044 They aren't parameters, right? */
6045 if (!found_sym
&& arg_sym
!= NULL
)
6047 add_defn_to_vec (obstackp
,
6048 fixup_symbol_section (arg_sym
, objfile
),
6055 /* Symbol Completion */
6057 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
6058 name in a form that's appropriate for the completion. The result
6059 does not need to be deallocated, but is only good until the next call.
6061 TEXT_LEN is equal to the length of TEXT.
6062 Perform a wild match if WILD_MATCH_P is set.
6063 ENCODED_P should be set if TEXT represents the start of a symbol name
6064 in its encoded form. */
6067 symbol_completion_match (const char *sym_name
,
6068 const char *text
, int text_len
,
6069 int wild_match_p
, int encoded_p
)
6071 const int verbatim_match
= (text
[0] == '<');
6076 /* Strip the leading angle bracket. */
6081 /* First, test against the fully qualified name of the symbol. */
6083 if (strncmp (sym_name
, text
, text_len
) == 0)
6086 if (match
&& !encoded_p
)
6088 /* One needed check before declaring a positive match is to verify
6089 that iff we are doing a verbatim match, the decoded version
6090 of the symbol name starts with '<'. Otherwise, this symbol name
6091 is not a suitable completion. */
6092 const char *sym_name_copy
= sym_name
;
6093 int has_angle_bracket
;
6095 sym_name
= ada_decode (sym_name
);
6096 has_angle_bracket
= (sym_name
[0] == '<');
6097 match
= (has_angle_bracket
== verbatim_match
);
6098 sym_name
= sym_name_copy
;
6101 if (match
&& !verbatim_match
)
6103 /* When doing non-verbatim match, another check that needs to
6104 be done is to verify that the potentially matching symbol name
6105 does not include capital letters, because the ada-mode would
6106 not be able to understand these symbol names without the
6107 angle bracket notation. */
6110 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6115 /* Second: Try wild matching... */
6117 if (!match
&& wild_match_p
)
6119 /* Since we are doing wild matching, this means that TEXT
6120 may represent an unqualified symbol name. We therefore must
6121 also compare TEXT against the unqualified name of the symbol. */
6122 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6124 if (strncmp (sym_name
, text
, text_len
) == 0)
6128 /* Finally: If we found a mach, prepare the result to return. */
6134 sym_name
= add_angle_brackets (sym_name
);
6137 sym_name
= ada_decode (sym_name
);
6142 /* A companion function to ada_make_symbol_completion_list().
6143 Check if SYM_NAME represents a symbol which name would be suitable
6144 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
6145 it is appended at the end of the given string vector SV.
6147 ORIG_TEXT is the string original string from the user command
6148 that needs to be completed. WORD is the entire command on which
6149 completion should be performed. These two parameters are used to
6150 determine which part of the symbol name should be added to the
6152 if WILD_MATCH_P is set, then wild matching is performed.
6153 ENCODED_P should be set if TEXT represents a symbol name in its
6154 encoded formed (in which case the completion should also be
6158 symbol_completion_add (VEC(char_ptr
) **sv
,
6159 const char *sym_name
,
6160 const char *text
, int text_len
,
6161 const char *orig_text
, const char *word
,
6162 int wild_match_p
, int encoded_p
)
6164 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
6165 wild_match_p
, encoded_p
);
6171 /* We found a match, so add the appropriate completion to the given
6174 if (word
== orig_text
)
6176 completion
= xmalloc (strlen (match
) + 5);
6177 strcpy (completion
, match
);
6179 else if (word
> orig_text
)
6181 /* Return some portion of sym_name. */
6182 completion
= xmalloc (strlen (match
) + 5);
6183 strcpy (completion
, match
+ (word
- orig_text
));
6187 /* Return some of ORIG_TEXT plus sym_name. */
6188 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
6189 strncpy (completion
, word
, orig_text
- word
);
6190 completion
[orig_text
- word
] = '\0';
6191 strcat (completion
, match
);
6194 VEC_safe_push (char_ptr
, *sv
, completion
);
6197 /* An object of this type is passed as the user_data argument to the
6198 expand_symtabs_matching method. */
6199 struct add_partial_datum
6201 VEC(char_ptr
) **completions
;
6210 /* A callback for expand_symtabs_matching. */
6213 ada_complete_symbol_matcher (const char *name
, void *user_data
)
6215 struct add_partial_datum
*data
= user_data
;
6217 return symbol_completion_match (name
, data
->text
, data
->text_len
,
6218 data
->wild_match
, data
->encoded
) != NULL
;
6221 /* Return a list of possible symbol names completing TEXT0. WORD is
6222 the entire command on which completion is made. */
6224 static VEC (char_ptr
) *
6225 ada_make_symbol_completion_list (const char *text0
, const char *word
,
6226 enum type_code code
)
6232 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
6234 struct compunit_symtab
*s
;
6235 struct minimal_symbol
*msymbol
;
6236 struct objfile
*objfile
;
6237 const struct block
*b
, *surrounding_static_block
= 0;
6239 struct block_iterator iter
;
6240 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6242 gdb_assert (code
== TYPE_CODE_UNDEF
);
6244 if (text0
[0] == '<')
6246 text
= xstrdup (text0
);
6247 make_cleanup (xfree
, text
);
6248 text_len
= strlen (text
);
6254 text
= xstrdup (ada_encode (text0
));
6255 make_cleanup (xfree
, text
);
6256 text_len
= strlen (text
);
6257 for (i
= 0; i
< text_len
; i
++)
6258 text
[i
] = tolower (text
[i
]);
6260 encoded_p
= (strstr (text0
, "__") != NULL
);
6261 /* If the name contains a ".", then the user is entering a fully
6262 qualified entity name, and the match must not be done in wild
6263 mode. Similarly, if the user wants to complete what looks like
6264 an encoded name, the match must not be done in wild mode. */
6265 wild_match_p
= (strchr (text0
, '.') == NULL
&& !encoded_p
);
6268 /* First, look at the partial symtab symbols. */
6270 struct add_partial_datum data
;
6272 data
.completions
= &completions
;
6274 data
.text_len
= text_len
;
6277 data
.wild_match
= wild_match_p
;
6278 data
.encoded
= encoded_p
;
6279 expand_symtabs_matching (NULL
, ada_complete_symbol_matcher
, NULL
,
6283 /* At this point scan through the misc symbol vectors and add each
6284 symbol you find to the list. Eventually we want to ignore
6285 anything that isn't a text symbol (everything else will be
6286 handled by the psymtab code above). */
6288 ALL_MSYMBOLS (objfile
, msymbol
)
6291 symbol_completion_add (&completions
, MSYMBOL_LINKAGE_NAME (msymbol
),
6292 text
, text_len
, text0
, word
, wild_match_p
,
6296 /* Search upwards from currently selected frame (so that we can
6297 complete on local vars. */
6299 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6301 if (!BLOCK_SUPERBLOCK (b
))
6302 surrounding_static_block
= b
; /* For elmin of dups */
6304 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6306 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6307 text
, text_len
, text0
, word
,
6308 wild_match_p
, encoded_p
);
6312 /* Go through the symtabs and check the externs and statics for
6313 symbols which match. */
6315 ALL_COMPUNITS (objfile
, s
)
6318 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6319 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6321 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6322 text
, text_len
, text0
, word
,
6323 wild_match_p
, encoded_p
);
6327 ALL_COMPUNITS (objfile
, s
)
6330 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6331 /* Don't do this block twice. */
6332 if (b
== surrounding_static_block
)
6334 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6336 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6337 text
, text_len
, text0
, word
,
6338 wild_match_p
, encoded_p
);
6342 do_cleanups (old_chain
);
6348 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6349 for tagged types. */
6352 ada_is_dispatch_table_ptr_type (struct type
*type
)
6356 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6359 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6363 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6366 /* Return non-zero if TYPE is an interface tag. */
6369 ada_is_interface_tag (struct type
*type
)
6371 const char *name
= TYPE_NAME (type
);
6376 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6379 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6380 to be invisible to users. */
6383 ada_is_ignored_field (struct type
*type
, int field_num
)
6385 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6388 /* Check the name of that field. */
6390 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6392 /* Anonymous field names should not be printed.
6393 brobecker/2007-02-20: I don't think this can actually happen
6394 but we don't want to print the value of annonymous fields anyway. */
6398 /* Normally, fields whose name start with an underscore ("_")
6399 are fields that have been internally generated by the compiler,
6400 and thus should not be printed. The "_parent" field is special,
6401 however: This is a field internally generated by the compiler
6402 for tagged types, and it contains the components inherited from
6403 the parent type. This field should not be printed as is, but
6404 should not be ignored either. */
6405 if (name
[0] == '_' && !startswith (name
, "_parent"))
6409 /* If this is the dispatch table of a tagged type or an interface tag,
6411 if (ada_is_tagged_type (type
, 1)
6412 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6413 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6416 /* Not a special field, so it should not be ignored. */
6420 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6421 pointer or reference type whose ultimate target has a tag field. */
6424 ada_is_tagged_type (struct type
*type
, int refok
)
6426 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
6429 /* True iff TYPE represents the type of X'Tag */
6432 ada_is_tag_type (struct type
*type
)
6434 type
= ada_check_typedef (type
);
6436 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6440 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6442 return (name
!= NULL
6443 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6447 /* The type of the tag on VAL. */
6450 ada_tag_type (struct value
*val
)
6452 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6455 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6456 retired at Ada 05). */
6459 is_ada95_tag (struct value
*tag
)
6461 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6464 /* The value of the tag on VAL. */
6467 ada_value_tag (struct value
*val
)
6469 return ada_value_struct_elt (val
, "_tag", 0);
6472 /* The value of the tag on the object of type TYPE whose contents are
6473 saved at VALADDR, if it is non-null, or is at memory address
6476 static struct value
*
6477 value_tag_from_contents_and_address (struct type
*type
,
6478 const gdb_byte
*valaddr
,
6481 int tag_byte_offset
;
6482 struct type
*tag_type
;
6484 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6487 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6489 : valaddr
+ tag_byte_offset
);
6490 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6492 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6497 static struct type
*
6498 type_from_tag (struct value
*tag
)
6500 const char *type_name
= ada_tag_name (tag
);
6502 if (type_name
!= NULL
)
6503 return ada_find_any_type (ada_encode (type_name
));
6507 /* Given a value OBJ of a tagged type, return a value of this
6508 type at the base address of the object. The base address, as
6509 defined in Ada.Tags, it is the address of the primary tag of
6510 the object, and therefore where the field values of its full
6511 view can be fetched. */
6514 ada_tag_value_at_base_address (struct value
*obj
)
6517 LONGEST offset_to_top
= 0;
6518 struct type
*ptr_type
, *obj_type
;
6520 CORE_ADDR base_address
;
6522 obj_type
= value_type (obj
);
6524 /* It is the responsability of the caller to deref pointers. */
6526 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6527 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6530 tag
= ada_value_tag (obj
);
6534 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6536 if (is_ada95_tag (tag
))
6539 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6540 ptr_type
= lookup_pointer_type (ptr_type
);
6541 val
= value_cast (ptr_type
, tag
);
6545 /* It is perfectly possible that an exception be raised while
6546 trying to determine the base address, just like for the tag;
6547 see ada_tag_name for more details. We do not print the error
6548 message for the same reason. */
6552 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6555 CATCH (e
, RETURN_MASK_ERROR
)
6561 /* If offset is null, nothing to do. */
6563 if (offset_to_top
== 0)
6566 /* -1 is a special case in Ada.Tags; however, what should be done
6567 is not quite clear from the documentation. So do nothing for
6570 if (offset_to_top
== -1)
6573 base_address
= value_address (obj
) - offset_to_top
;
6574 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6576 /* Make sure that we have a proper tag at the new address.
6577 Otherwise, offset_to_top is bogus (which can happen when
6578 the object is not initialized yet). */
6583 obj_type
= type_from_tag (tag
);
6588 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6591 /* Return the "ada__tags__type_specific_data" type. */
6593 static struct type
*
6594 ada_get_tsd_type (struct inferior
*inf
)
6596 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6598 if (data
->tsd_type
== 0)
6599 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6600 return data
->tsd_type
;
6603 /* Return the TSD (type-specific data) associated to the given TAG.
6604 TAG is assumed to be the tag of a tagged-type entity.
6606 May return NULL if we are unable to get the TSD. */
6608 static struct value
*
6609 ada_get_tsd_from_tag (struct value
*tag
)
6614 /* First option: The TSD is simply stored as a field of our TAG.
6615 Only older versions of GNAT would use this format, but we have
6616 to test it first, because there are no visible markers for
6617 the current approach except the absence of that field. */
6619 val
= ada_value_struct_elt (tag
, "tsd", 1);
6623 /* Try the second representation for the dispatch table (in which
6624 there is no explicit 'tsd' field in the referent of the tag pointer,
6625 and instead the tsd pointer is stored just before the dispatch
6628 type
= ada_get_tsd_type (current_inferior());
6631 type
= lookup_pointer_type (lookup_pointer_type (type
));
6632 val
= value_cast (type
, tag
);
6635 return value_ind (value_ptradd (val
, -1));
6638 /* Given the TSD of a tag (type-specific data), return a string
6639 containing the name of the associated type.
6641 The returned value is good until the next call. May return NULL
6642 if we are unable to determine the tag name. */
6645 ada_tag_name_from_tsd (struct value
*tsd
)
6647 static char name
[1024];
6651 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6654 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6655 for (p
= name
; *p
!= '\0'; p
+= 1)
6661 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6664 Return NULL if the TAG is not an Ada tag, or if we were unable to
6665 determine the name of that tag. The result is good until the next
6669 ada_tag_name (struct value
*tag
)
6673 if (!ada_is_tag_type (value_type (tag
)))
6676 /* It is perfectly possible that an exception be raised while trying
6677 to determine the TAG's name, even under normal circumstances:
6678 The associated variable may be uninitialized or corrupted, for
6679 instance. We do not let any exception propagate past this point.
6680 instead we return NULL.
6682 We also do not print the error message either (which often is very
6683 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6684 the caller print a more meaningful message if necessary. */
6687 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6690 name
= ada_tag_name_from_tsd (tsd
);
6692 CATCH (e
, RETURN_MASK_ERROR
)
6700 /* The parent type of TYPE, or NULL if none. */
6703 ada_parent_type (struct type
*type
)
6707 type
= ada_check_typedef (type
);
6709 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6712 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6713 if (ada_is_parent_field (type
, i
))
6715 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6717 /* If the _parent field is a pointer, then dereference it. */
6718 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6719 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6720 /* If there is a parallel XVS type, get the actual base type. */
6721 parent_type
= ada_get_base_type (parent_type
);
6723 return ada_check_typedef (parent_type
);
6729 /* True iff field number FIELD_NUM of structure type TYPE contains the
6730 parent-type (inherited) fields of a derived type. Assumes TYPE is
6731 a structure type with at least FIELD_NUM+1 fields. */
6734 ada_is_parent_field (struct type
*type
, int field_num
)
6736 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6738 return (name
!= NULL
6739 && (startswith (name
, "PARENT")
6740 || startswith (name
, "_parent")));
6743 /* True iff field number FIELD_NUM of structure type TYPE is a
6744 transparent wrapper field (which should be silently traversed when doing
6745 field selection and flattened when printing). Assumes TYPE is a
6746 structure type with at least FIELD_NUM+1 fields. Such fields are always
6750 ada_is_wrapper_field (struct type
*type
, int field_num
)
6752 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6754 return (name
!= NULL
6755 && (startswith (name
, "PARENT")
6756 || strcmp (name
, "REP") == 0
6757 || startswith (name
, "_parent")
6758 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6761 /* True iff field number FIELD_NUM of structure or union type TYPE
6762 is a variant wrapper. Assumes TYPE is a structure type with at least
6763 FIELD_NUM+1 fields. */
6766 ada_is_variant_part (struct type
*type
, int field_num
)
6768 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6770 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6771 || (is_dynamic_field (type
, field_num
)
6772 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6773 == TYPE_CODE_UNION
)));
6776 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6777 whose discriminants are contained in the record type OUTER_TYPE,
6778 returns the type of the controlling discriminant for the variant.
6779 May return NULL if the type could not be found. */
6782 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6784 char *name
= ada_variant_discrim_name (var_type
);
6786 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6789 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6790 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6791 represents a 'when others' clause; otherwise 0. */
6794 ada_is_others_clause (struct type
*type
, int field_num
)
6796 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6798 return (name
!= NULL
&& name
[0] == 'O');
6801 /* Assuming that TYPE0 is the type of the variant part of a record,
6802 returns the name of the discriminant controlling the variant.
6803 The value is valid until the next call to ada_variant_discrim_name. */
6806 ada_variant_discrim_name (struct type
*type0
)
6808 static char *result
= NULL
;
6809 static size_t result_len
= 0;
6812 const char *discrim_end
;
6813 const char *discrim_start
;
6815 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6816 type
= TYPE_TARGET_TYPE (type0
);
6820 name
= ada_type_name (type
);
6822 if (name
== NULL
|| name
[0] == '\000')
6825 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6828 if (startswith (discrim_end
, "___XVN"))
6831 if (discrim_end
== name
)
6834 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6837 if (discrim_start
== name
+ 1)
6839 if ((discrim_start
> name
+ 3
6840 && startswith (discrim_start
- 3, "___"))
6841 || discrim_start
[-1] == '.')
6845 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6846 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6847 result
[discrim_end
- discrim_start
] = '\0';
6851 /* Scan STR for a subtype-encoded number, beginning at position K.
6852 Put the position of the character just past the number scanned in
6853 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6854 Return 1 if there was a valid number at the given position, and 0
6855 otherwise. A "subtype-encoded" number consists of the absolute value
6856 in decimal, followed by the letter 'm' to indicate a negative number.
6857 Assumes 0m does not occur. */
6860 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6864 if (!isdigit (str
[k
]))
6867 /* Do it the hard way so as not to make any assumption about
6868 the relationship of unsigned long (%lu scan format code) and
6871 while (isdigit (str
[k
]))
6873 RU
= RU
* 10 + (str
[k
] - '0');
6880 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6886 /* NOTE on the above: Technically, C does not say what the results of
6887 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6888 number representable as a LONGEST (although either would probably work
6889 in most implementations). When RU>0, the locution in the then branch
6890 above is always equivalent to the negative of RU. */
6897 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6898 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6899 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6902 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6904 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6918 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6928 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6929 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6931 if (val
>= L
&& val
<= U
)
6943 /* FIXME: Lots of redundancy below. Try to consolidate. */
6945 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6946 ARG_TYPE, extract and return the value of one of its (non-static)
6947 fields. FIELDNO says which field. Differs from value_primitive_field
6948 only in that it can handle packed values of arbitrary type. */
6950 static struct value
*
6951 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6952 struct type
*arg_type
)
6956 arg_type
= ada_check_typedef (arg_type
);
6957 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6959 /* Handle packed fields. */
6961 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6963 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6964 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6966 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6967 offset
+ bit_pos
/ 8,
6968 bit_pos
% 8, bit_size
, type
);
6971 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6974 /* Find field with name NAME in object of type TYPE. If found,
6975 set the following for each argument that is non-null:
6976 - *FIELD_TYPE_P to the field's type;
6977 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6978 an object of that type;
6979 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6980 - *BIT_SIZE_P to its size in bits if the field is packed, and
6982 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6983 fields up to but not including the desired field, or by the total
6984 number of fields if not found. A NULL value of NAME never
6985 matches; the function just counts visible fields in this case.
6987 Returns 1 if found, 0 otherwise. */
6990 find_struct_field (const char *name
, struct type
*type
, int offset
,
6991 struct type
**field_type_p
,
6992 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6997 type
= ada_check_typedef (type
);
6999 if (field_type_p
!= NULL
)
7000 *field_type_p
= NULL
;
7001 if (byte_offset_p
!= NULL
)
7003 if (bit_offset_p
!= NULL
)
7005 if (bit_size_p
!= NULL
)
7008 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7010 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7011 int fld_offset
= offset
+ bit_pos
/ 8;
7012 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7014 if (t_field_name
== NULL
)
7017 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7019 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7021 if (field_type_p
!= NULL
)
7022 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7023 if (byte_offset_p
!= NULL
)
7024 *byte_offset_p
= fld_offset
;
7025 if (bit_offset_p
!= NULL
)
7026 *bit_offset_p
= bit_pos
% 8;
7027 if (bit_size_p
!= NULL
)
7028 *bit_size_p
= bit_size
;
7031 else if (ada_is_wrapper_field (type
, i
))
7033 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7034 field_type_p
, byte_offset_p
, bit_offset_p
,
7035 bit_size_p
, index_p
))
7038 else if (ada_is_variant_part (type
, i
))
7040 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7043 struct type
*field_type
7044 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7046 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7048 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7050 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7051 field_type_p
, byte_offset_p
,
7052 bit_offset_p
, bit_size_p
, index_p
))
7056 else if (index_p
!= NULL
)
7062 /* Number of user-visible fields in record type TYPE. */
7065 num_visible_fields (struct type
*type
)
7070 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7074 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7075 and search in it assuming it has (class) type TYPE.
7076 If found, return value, else return NULL.
7078 Searches recursively through wrapper fields (e.g., '_parent'). */
7080 static struct value
*
7081 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
7086 type
= ada_check_typedef (type
);
7087 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7089 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7091 if (t_field_name
== NULL
)
7094 else if (field_name_match (t_field_name
, name
))
7095 return ada_value_primitive_field (arg
, offset
, i
, type
);
7097 else if (ada_is_wrapper_field (type
, i
))
7099 struct value
*v
= /* Do not let indent join lines here. */
7100 ada_search_struct_field (name
, arg
,
7101 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7102 TYPE_FIELD_TYPE (type
, i
));
7108 else if (ada_is_variant_part (type
, i
))
7110 /* PNH: Do we ever get here? See find_struct_field. */
7112 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7114 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7116 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7118 struct value
*v
= ada_search_struct_field
/* Force line
7121 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7122 TYPE_FIELD_TYPE (field_type
, j
));
7132 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7133 int, struct type
*);
7136 /* Return field #INDEX in ARG, where the index is that returned by
7137 * find_struct_field through its INDEX_P argument. Adjust the address
7138 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7139 * If found, return value, else return NULL. */
7141 static struct value
*
7142 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7145 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7149 /* Auxiliary function for ada_index_struct_field. Like
7150 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7153 static struct value
*
7154 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7158 type
= ada_check_typedef (type
);
7160 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7162 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7164 else if (ada_is_wrapper_field (type
, i
))
7166 struct value
*v
= /* Do not let indent join lines here. */
7167 ada_index_struct_field_1 (index_p
, arg
,
7168 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7169 TYPE_FIELD_TYPE (type
, i
));
7175 else if (ada_is_variant_part (type
, i
))
7177 /* PNH: Do we ever get here? See ada_search_struct_field,
7178 find_struct_field. */
7179 error (_("Cannot assign this kind of variant record"));
7181 else if (*index_p
== 0)
7182 return ada_value_primitive_field (arg
, offset
, i
, type
);
7189 /* Given ARG, a value of type (pointer or reference to a)*
7190 structure/union, extract the component named NAME from the ultimate
7191 target structure/union and return it as a value with its
7194 The routine searches for NAME among all members of the structure itself
7195 and (recursively) among all members of any wrapper members
7198 If NO_ERR, then simply return NULL in case of error, rather than
7202 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
7204 struct type
*t
, *t1
;
7208 t1
= t
= ada_check_typedef (value_type (arg
));
7209 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7211 t1
= TYPE_TARGET_TYPE (t
);
7214 t1
= ada_check_typedef (t1
);
7215 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7217 arg
= coerce_ref (arg
);
7222 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7224 t1
= TYPE_TARGET_TYPE (t
);
7227 t1
= ada_check_typedef (t1
);
7228 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7230 arg
= value_ind (arg
);
7237 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7241 v
= ada_search_struct_field (name
, arg
, 0, t
);
7244 int bit_offset
, bit_size
, byte_offset
;
7245 struct type
*field_type
;
7248 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7249 address
= value_address (ada_value_ind (arg
));
7251 address
= value_address (ada_coerce_ref (arg
));
7253 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7254 if (find_struct_field (name
, t1
, 0,
7255 &field_type
, &byte_offset
, &bit_offset
,
7260 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7261 arg
= ada_coerce_ref (arg
);
7263 arg
= ada_value_ind (arg
);
7264 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7265 bit_offset
, bit_size
,
7269 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7273 if (v
!= NULL
|| no_err
)
7276 error (_("There is no member named %s."), name
);
7282 error (_("Attempt to extract a component of "
7283 "a value that is not a record."));
7286 /* Given a type TYPE, look up the type of the component of type named NAME.
7287 If DISPP is non-null, add its byte displacement from the beginning of a
7288 structure (pointed to by a value) of type TYPE to *DISPP (does not
7289 work for packed fields).
7291 Matches any field whose name has NAME as a prefix, possibly
7294 TYPE can be either a struct or union. If REFOK, TYPE may also
7295 be a (pointer or reference)+ to a struct or union, and the
7296 ultimate target type will be searched.
7298 Looks recursively into variant clauses and parent types.
7300 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7301 TYPE is not a type of the right kind. */
7303 static struct type
*
7304 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7305 int noerr
, int *dispp
)
7312 if (refok
&& type
!= NULL
)
7315 type
= ada_check_typedef (type
);
7316 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7317 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7319 type
= TYPE_TARGET_TYPE (type
);
7323 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7324 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7330 target_terminal_ours ();
7331 gdb_flush (gdb_stdout
);
7333 error (_("Type (null) is not a structure or union type"));
7336 /* XXX: type_sprint */
7337 fprintf_unfiltered (gdb_stderr
, _("Type "));
7338 type_print (type
, "", gdb_stderr
, -1);
7339 error (_(" is not a structure or union type"));
7344 type
= to_static_fixed_type (type
);
7346 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7348 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7352 if (t_field_name
== NULL
)
7355 else if (field_name_match (t_field_name
, name
))
7358 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7359 return TYPE_FIELD_TYPE (type
, i
);
7362 else if (ada_is_wrapper_field (type
, i
))
7365 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7370 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7375 else if (ada_is_variant_part (type
, i
))
7378 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7381 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7383 /* FIXME pnh 2008/01/26: We check for a field that is
7384 NOT wrapped in a struct, since the compiler sometimes
7385 generates these for unchecked variant types. Revisit
7386 if the compiler changes this practice. */
7387 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7389 if (v_field_name
!= NULL
7390 && field_name_match (v_field_name
, name
))
7391 t
= TYPE_FIELD_TYPE (field_type
, j
);
7393 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7400 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7411 target_terminal_ours ();
7412 gdb_flush (gdb_stdout
);
7415 /* XXX: type_sprint */
7416 fprintf_unfiltered (gdb_stderr
, _("Type "));
7417 type_print (type
, "", gdb_stderr
, -1);
7418 error (_(" has no component named <null>"));
7422 /* XXX: type_sprint */
7423 fprintf_unfiltered (gdb_stderr
, _("Type "));
7424 type_print (type
, "", gdb_stderr
, -1);
7425 error (_(" has no component named %s"), name
);
7432 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7433 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7434 represents an unchecked union (that is, the variant part of a
7435 record that is named in an Unchecked_Union pragma). */
7438 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7440 char *discrim_name
= ada_variant_discrim_name (var_type
);
7442 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
7447 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7448 within a value of type OUTER_TYPE that is stored in GDB at
7449 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7450 numbering from 0) is applicable. Returns -1 if none are. */
7453 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7454 const gdb_byte
*outer_valaddr
)
7458 char *discrim_name
= ada_variant_discrim_name (var_type
);
7459 struct value
*outer
;
7460 struct value
*discrim
;
7461 LONGEST discrim_val
;
7463 /* Using plain value_from_contents_and_address here causes problems
7464 because we will end up trying to resolve a type that is currently
7465 being constructed. */
7466 outer
= value_from_contents_and_address_unresolved (outer_type
,
7468 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7469 if (discrim
== NULL
)
7471 discrim_val
= value_as_long (discrim
);
7474 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7476 if (ada_is_others_clause (var_type
, i
))
7478 else if (ada_in_variant (discrim_val
, var_type
, i
))
7482 return others_clause
;
7487 /* Dynamic-Sized Records */
7489 /* Strategy: The type ostensibly attached to a value with dynamic size
7490 (i.e., a size that is not statically recorded in the debugging
7491 data) does not accurately reflect the size or layout of the value.
7492 Our strategy is to convert these values to values with accurate,
7493 conventional types that are constructed on the fly. */
7495 /* There is a subtle and tricky problem here. In general, we cannot
7496 determine the size of dynamic records without its data. However,
7497 the 'struct value' data structure, which GDB uses to represent
7498 quantities in the inferior process (the target), requires the size
7499 of the type at the time of its allocation in order to reserve space
7500 for GDB's internal copy of the data. That's why the
7501 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7502 rather than struct value*s.
7504 However, GDB's internal history variables ($1, $2, etc.) are
7505 struct value*s containing internal copies of the data that are not, in
7506 general, the same as the data at their corresponding addresses in
7507 the target. Fortunately, the types we give to these values are all
7508 conventional, fixed-size types (as per the strategy described
7509 above), so that we don't usually have to perform the
7510 'to_fixed_xxx_type' conversions to look at their values.
7511 Unfortunately, there is one exception: if one of the internal
7512 history variables is an array whose elements are unconstrained
7513 records, then we will need to create distinct fixed types for each
7514 element selected. */
7516 /* The upshot of all of this is that many routines take a (type, host
7517 address, target address) triple as arguments to represent a value.
7518 The host address, if non-null, is supposed to contain an internal
7519 copy of the relevant data; otherwise, the program is to consult the
7520 target at the target address. */
7522 /* Assuming that VAL0 represents a pointer value, the result of
7523 dereferencing it. Differs from value_ind in its treatment of
7524 dynamic-sized types. */
7527 ada_value_ind (struct value
*val0
)
7529 struct value
*val
= value_ind (val0
);
7531 if (ada_is_tagged_type (value_type (val
), 0))
7532 val
= ada_tag_value_at_base_address (val
);
7534 return ada_to_fixed_value (val
);
7537 /* The value resulting from dereferencing any "reference to"
7538 qualifiers on VAL0. */
7540 static struct value
*
7541 ada_coerce_ref (struct value
*val0
)
7543 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7545 struct value
*val
= val0
;
7547 val
= coerce_ref (val
);
7549 if (ada_is_tagged_type (value_type (val
), 0))
7550 val
= ada_tag_value_at_base_address (val
);
7552 return ada_to_fixed_value (val
);
7558 /* Return OFF rounded upward if necessary to a multiple of
7559 ALIGNMENT (a power of 2). */
7562 align_value (unsigned int off
, unsigned int alignment
)
7564 return (off
+ alignment
- 1) & ~(alignment
- 1);
7567 /* Return the bit alignment required for field #F of template type TYPE. */
7570 field_alignment (struct type
*type
, int f
)
7572 const char *name
= TYPE_FIELD_NAME (type
, f
);
7576 /* The field name should never be null, unless the debugging information
7577 is somehow malformed. In this case, we assume the field does not
7578 require any alignment. */
7582 len
= strlen (name
);
7584 if (!isdigit (name
[len
- 1]))
7587 if (isdigit (name
[len
- 2]))
7588 align_offset
= len
- 2;
7590 align_offset
= len
- 1;
7592 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7593 return TARGET_CHAR_BIT
;
7595 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7598 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7600 static struct symbol
*
7601 ada_find_any_type_symbol (const char *name
)
7605 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7606 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7609 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7613 /* Find a type named NAME. Ignores ambiguity. This routine will look
7614 solely for types defined by debug info, it will not search the GDB
7617 static struct type
*
7618 ada_find_any_type (const char *name
)
7620 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7623 return SYMBOL_TYPE (sym
);
7628 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7629 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7630 symbol, in which case it is returned. Otherwise, this looks for
7631 symbols whose name is that of NAME_SYM suffixed with "___XR".
7632 Return symbol if found, and NULL otherwise. */
7635 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7637 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7640 if (strstr (name
, "___XR") != NULL
)
7643 sym
= find_old_style_renaming_symbol (name
, block
);
7648 /* Not right yet. FIXME pnh 7/20/2007. */
7649 sym
= ada_find_any_type_symbol (name
);
7650 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7656 static struct symbol
*
7657 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7659 const struct symbol
*function_sym
= block_linkage_function (block
);
7662 if (function_sym
!= NULL
)
7664 /* If the symbol is defined inside a function, NAME is not fully
7665 qualified. This means we need to prepend the function name
7666 as well as adding the ``___XR'' suffix to build the name of
7667 the associated renaming symbol. */
7668 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7669 /* Function names sometimes contain suffixes used
7670 for instance to qualify nested subprograms. When building
7671 the XR type name, we need to make sure that this suffix is
7672 not included. So do not include any suffix in the function
7673 name length below. */
7674 int function_name_len
= ada_name_prefix_len (function_name
);
7675 const int rename_len
= function_name_len
+ 2 /* "__" */
7676 + strlen (name
) + 6 /* "___XR\0" */ ;
7678 /* Strip the suffix if necessary. */
7679 ada_remove_trailing_digits (function_name
, &function_name_len
);
7680 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7681 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7683 /* Library-level functions are a special case, as GNAT adds
7684 a ``_ada_'' prefix to the function name to avoid namespace
7685 pollution. However, the renaming symbols themselves do not
7686 have this prefix, so we need to skip this prefix if present. */
7687 if (function_name_len
> 5 /* "_ada_" */
7688 && strstr (function_name
, "_ada_") == function_name
)
7691 function_name_len
-= 5;
7694 rename
= (char *) alloca (rename_len
* sizeof (char));
7695 strncpy (rename
, function_name
, function_name_len
);
7696 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7701 const int rename_len
= strlen (name
) + 6;
7703 rename
= (char *) alloca (rename_len
* sizeof (char));
7704 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7707 return ada_find_any_type_symbol (rename
);
7710 /* Because of GNAT encoding conventions, several GDB symbols may match a
7711 given type name. If the type denoted by TYPE0 is to be preferred to
7712 that of TYPE1 for purposes of type printing, return non-zero;
7713 otherwise return 0. */
7716 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7720 else if (type0
== NULL
)
7722 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7724 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7726 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7728 else if (ada_is_constrained_packed_array_type (type0
))
7730 else if (ada_is_array_descriptor_type (type0
)
7731 && !ada_is_array_descriptor_type (type1
))
7735 const char *type0_name
= type_name_no_tag (type0
);
7736 const char *type1_name
= type_name_no_tag (type1
);
7738 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7739 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7745 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7746 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7749 ada_type_name (struct type
*type
)
7753 else if (TYPE_NAME (type
) != NULL
)
7754 return TYPE_NAME (type
);
7756 return TYPE_TAG_NAME (type
);
7759 /* Search the list of "descriptive" types associated to TYPE for a type
7760 whose name is NAME. */
7762 static struct type
*
7763 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7765 struct type
*result
, *tmp
;
7767 if (ada_ignore_descriptive_types_p
)
7770 /* If there no descriptive-type info, then there is no parallel type
7772 if (!HAVE_GNAT_AUX_INFO (type
))
7775 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7776 while (result
!= NULL
)
7778 const char *result_name
= ada_type_name (result
);
7780 if (result_name
== NULL
)
7782 warning (_("unexpected null name on descriptive type"));
7786 /* If the names match, stop. */
7787 if (strcmp (result_name
, name
) == 0)
7790 /* Otherwise, look at the next item on the list, if any. */
7791 if (HAVE_GNAT_AUX_INFO (result
))
7792 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7796 /* If not found either, try after having resolved the typedef. */
7801 CHECK_TYPEDEF (result
);
7802 if (HAVE_GNAT_AUX_INFO (result
))
7803 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7809 /* If we didn't find a match, see whether this is a packed array. With
7810 older compilers, the descriptive type information is either absent or
7811 irrelevant when it comes to packed arrays so the above lookup fails.
7812 Fall back to using a parallel lookup by name in this case. */
7813 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7814 return ada_find_any_type (name
);
7819 /* Find a parallel type to TYPE with the specified NAME, using the
7820 descriptive type taken from the debugging information, if available,
7821 and otherwise using the (slower) name-based method. */
7823 static struct type
*
7824 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7826 struct type
*result
= NULL
;
7828 if (HAVE_GNAT_AUX_INFO (type
))
7829 result
= find_parallel_type_by_descriptive_type (type
, name
);
7831 result
= ada_find_any_type (name
);
7836 /* Same as above, but specify the name of the parallel type by appending
7837 SUFFIX to the name of TYPE. */
7840 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7843 const char *type_name
= ada_type_name (type
);
7846 if (type_name
== NULL
)
7849 len
= strlen (type_name
);
7851 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7853 strcpy (name
, type_name
);
7854 strcpy (name
+ len
, suffix
);
7856 return ada_find_parallel_type_with_name (type
, name
);
7859 /* If TYPE is a variable-size record type, return the corresponding template
7860 type describing its fields. Otherwise, return NULL. */
7862 static struct type
*
7863 dynamic_template_type (struct type
*type
)
7865 type
= ada_check_typedef (type
);
7867 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7868 || ada_type_name (type
) == NULL
)
7872 int len
= strlen (ada_type_name (type
));
7874 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7877 return ada_find_parallel_type (type
, "___XVE");
7881 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7882 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7885 is_dynamic_field (struct type
*templ_type
, int field_num
)
7887 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7890 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7891 && strstr (name
, "___XVL") != NULL
;
7894 /* The index of the variant field of TYPE, or -1 if TYPE does not
7895 represent a variant record type. */
7898 variant_field_index (struct type
*type
)
7902 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7905 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7907 if (ada_is_variant_part (type
, f
))
7913 /* A record type with no fields. */
7915 static struct type
*
7916 empty_record (struct type
*templ
)
7918 struct type
*type
= alloc_type_copy (templ
);
7920 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7921 TYPE_NFIELDS (type
) = 0;
7922 TYPE_FIELDS (type
) = NULL
;
7923 INIT_CPLUS_SPECIFIC (type
);
7924 TYPE_NAME (type
) = "<empty>";
7925 TYPE_TAG_NAME (type
) = NULL
;
7926 TYPE_LENGTH (type
) = 0;
7930 /* An ordinary record type (with fixed-length fields) that describes
7931 the value of type TYPE at VALADDR or ADDRESS (see comments at
7932 the beginning of this section) VAL according to GNAT conventions.
7933 DVAL0 should describe the (portion of a) record that contains any
7934 necessary discriminants. It should be NULL if value_type (VAL) is
7935 an outer-level type (i.e., as opposed to a branch of a variant.) A
7936 variant field (unless unchecked) is replaced by a particular branch
7939 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7940 length are not statically known are discarded. As a consequence,
7941 VALADDR, ADDRESS and DVAL0 are ignored.
7943 NOTE: Limitations: For now, we assume that dynamic fields and
7944 variants occupy whole numbers of bytes. However, they need not be
7948 ada_template_to_fixed_record_type_1 (struct type
*type
,
7949 const gdb_byte
*valaddr
,
7950 CORE_ADDR address
, struct value
*dval0
,
7951 int keep_dynamic_fields
)
7953 struct value
*mark
= value_mark ();
7956 int nfields
, bit_len
;
7962 /* Compute the number of fields in this record type that are going
7963 to be processed: unless keep_dynamic_fields, this includes only
7964 fields whose position and length are static will be processed. */
7965 if (keep_dynamic_fields
)
7966 nfields
= TYPE_NFIELDS (type
);
7970 while (nfields
< TYPE_NFIELDS (type
)
7971 && !ada_is_variant_part (type
, nfields
)
7972 && !is_dynamic_field (type
, nfields
))
7976 rtype
= alloc_type_copy (type
);
7977 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7978 INIT_CPLUS_SPECIFIC (rtype
);
7979 TYPE_NFIELDS (rtype
) = nfields
;
7980 TYPE_FIELDS (rtype
) = (struct field
*)
7981 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7982 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7983 TYPE_NAME (rtype
) = ada_type_name (type
);
7984 TYPE_TAG_NAME (rtype
) = NULL
;
7985 TYPE_FIXED_INSTANCE (rtype
) = 1;
7991 for (f
= 0; f
< nfields
; f
+= 1)
7993 off
= align_value (off
, field_alignment (type
, f
))
7994 + TYPE_FIELD_BITPOS (type
, f
);
7995 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
7996 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7998 if (ada_is_variant_part (type
, f
))
8003 else if (is_dynamic_field (type
, f
))
8005 const gdb_byte
*field_valaddr
= valaddr
;
8006 CORE_ADDR field_address
= address
;
8007 struct type
*field_type
=
8008 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8012 /* rtype's length is computed based on the run-time
8013 value of discriminants. If the discriminants are not
8014 initialized, the type size may be completely bogus and
8015 GDB may fail to allocate a value for it. So check the
8016 size first before creating the value. */
8017 ada_ensure_varsize_limit (rtype
);
8018 /* Using plain value_from_contents_and_address here
8019 causes problems because we will end up trying to
8020 resolve a type that is currently being
8022 dval
= value_from_contents_and_address_unresolved (rtype
,
8025 rtype
= value_type (dval
);
8030 /* If the type referenced by this field is an aligner type, we need
8031 to unwrap that aligner type, because its size might not be set.
8032 Keeping the aligner type would cause us to compute the wrong
8033 size for this field, impacting the offset of the all the fields
8034 that follow this one. */
8035 if (ada_is_aligner_type (field_type
))
8037 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8039 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8040 field_address
= cond_offset_target (field_address
, field_offset
);
8041 field_type
= ada_aligned_type (field_type
);
8044 field_valaddr
= cond_offset_host (field_valaddr
,
8045 off
/ TARGET_CHAR_BIT
);
8046 field_address
= cond_offset_target (field_address
,
8047 off
/ TARGET_CHAR_BIT
);
8049 /* Get the fixed type of the field. Note that, in this case,
8050 we do not want to get the real type out of the tag: if
8051 the current field is the parent part of a tagged record,
8052 we will get the tag of the object. Clearly wrong: the real
8053 type of the parent is not the real type of the child. We
8054 would end up in an infinite loop. */
8055 field_type
= ada_get_base_type (field_type
);
8056 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8057 field_address
, dval
, 0);
8058 /* If the field size is already larger than the maximum
8059 object size, then the record itself will necessarily
8060 be larger than the maximum object size. We need to make
8061 this check now, because the size might be so ridiculously
8062 large (due to an uninitialized variable in the inferior)
8063 that it would cause an overflow when adding it to the
8065 ada_ensure_varsize_limit (field_type
);
8067 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8068 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8069 /* The multiplication can potentially overflow. But because
8070 the field length has been size-checked just above, and
8071 assuming that the maximum size is a reasonable value,
8072 an overflow should not happen in practice. So rather than
8073 adding overflow recovery code to this already complex code,
8074 we just assume that it's not going to happen. */
8076 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8080 /* Note: If this field's type is a typedef, it is important
8081 to preserve the typedef layer.
8083 Otherwise, we might be transforming a typedef to a fat
8084 pointer (encoding a pointer to an unconstrained array),
8085 into a basic fat pointer (encoding an unconstrained
8086 array). As both types are implemented using the same
8087 structure, the typedef is the only clue which allows us
8088 to distinguish between the two options. Stripping it
8089 would prevent us from printing this field appropriately. */
8090 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8091 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8092 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8094 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8097 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8099 /* We need to be careful of typedefs when computing
8100 the length of our field. If this is a typedef,
8101 get the length of the target type, not the length
8103 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8104 field_type
= ada_typedef_target_type (field_type
);
8107 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8110 if (off
+ fld_bit_len
> bit_len
)
8111 bit_len
= off
+ fld_bit_len
;
8113 TYPE_LENGTH (rtype
) =
8114 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8117 /* We handle the variant part, if any, at the end because of certain
8118 odd cases in which it is re-ordered so as NOT to be the last field of
8119 the record. This can happen in the presence of representation
8121 if (variant_field
>= 0)
8123 struct type
*branch_type
;
8125 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8129 /* Using plain value_from_contents_and_address here causes
8130 problems because we will end up trying to resolve a type
8131 that is currently being constructed. */
8132 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8134 rtype
= value_type (dval
);
8140 to_fixed_variant_branch_type
8141 (TYPE_FIELD_TYPE (type
, variant_field
),
8142 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8143 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8144 if (branch_type
== NULL
)
8146 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8147 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8148 TYPE_NFIELDS (rtype
) -= 1;
8152 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8153 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8155 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8157 if (off
+ fld_bit_len
> bit_len
)
8158 bit_len
= off
+ fld_bit_len
;
8159 TYPE_LENGTH (rtype
) =
8160 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8164 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8165 should contain the alignment of that record, which should be a strictly
8166 positive value. If null or negative, then something is wrong, most
8167 probably in the debug info. In that case, we don't round up the size
8168 of the resulting type. If this record is not part of another structure,
8169 the current RTYPE length might be good enough for our purposes. */
8170 if (TYPE_LENGTH (type
) <= 0)
8172 if (TYPE_NAME (rtype
))
8173 warning (_("Invalid type size for `%s' detected: %d."),
8174 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8176 warning (_("Invalid type size for <unnamed> detected: %d."),
8177 TYPE_LENGTH (type
));
8181 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8182 TYPE_LENGTH (type
));
8185 value_free_to_mark (mark
);
8186 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8187 error (_("record type with dynamic size is larger than varsize-limit"));
8191 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8194 static struct type
*
8195 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8196 CORE_ADDR address
, struct value
*dval0
)
8198 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8202 /* An ordinary record type in which ___XVL-convention fields and
8203 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8204 static approximations, containing all possible fields. Uses
8205 no runtime values. Useless for use in values, but that's OK,
8206 since the results are used only for type determinations. Works on both
8207 structs and unions. Representation note: to save space, we memorize
8208 the result of this function in the TYPE_TARGET_TYPE of the
8211 static struct type
*
8212 template_to_static_fixed_type (struct type
*type0
)
8218 /* No need no do anything if the input type is already fixed. */
8219 if (TYPE_FIXED_INSTANCE (type0
))
8222 /* Likewise if we already have computed the static approximation. */
8223 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8224 return TYPE_TARGET_TYPE (type0
);
8226 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8228 nfields
= TYPE_NFIELDS (type0
);
8230 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8231 recompute all over next time. */
8232 TYPE_TARGET_TYPE (type0
) = type
;
8234 for (f
= 0; f
< nfields
; f
+= 1)
8236 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8237 struct type
*new_type
;
8239 if (is_dynamic_field (type0
, f
))
8241 field_type
= ada_check_typedef (field_type
);
8242 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8245 new_type
= static_unwrap_type (field_type
);
8247 if (new_type
!= field_type
)
8249 /* Clone TYPE0 only the first time we get a new field type. */
8252 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8253 TYPE_CODE (type
) = TYPE_CODE (type0
);
8254 INIT_CPLUS_SPECIFIC (type
);
8255 TYPE_NFIELDS (type
) = nfields
;
8256 TYPE_FIELDS (type
) = (struct field
*)
8257 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8258 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8259 sizeof (struct field
) * nfields
);
8260 TYPE_NAME (type
) = ada_type_name (type0
);
8261 TYPE_TAG_NAME (type
) = NULL
;
8262 TYPE_FIXED_INSTANCE (type
) = 1;
8263 TYPE_LENGTH (type
) = 0;
8265 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8266 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8273 /* Given an object of type TYPE whose contents are at VALADDR and
8274 whose address in memory is ADDRESS, returns a revision of TYPE,
8275 which should be a non-dynamic-sized record, in which the variant
8276 part, if any, is replaced with the appropriate branch. Looks
8277 for discriminant values in DVAL0, which can be NULL if the record
8278 contains the necessary discriminant values. */
8280 static struct type
*
8281 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8282 CORE_ADDR address
, struct value
*dval0
)
8284 struct value
*mark
= value_mark ();
8287 struct type
*branch_type
;
8288 int nfields
= TYPE_NFIELDS (type
);
8289 int variant_field
= variant_field_index (type
);
8291 if (variant_field
== -1)
8296 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8297 type
= value_type (dval
);
8302 rtype
= alloc_type_copy (type
);
8303 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8304 INIT_CPLUS_SPECIFIC (rtype
);
8305 TYPE_NFIELDS (rtype
) = nfields
;
8306 TYPE_FIELDS (rtype
) =
8307 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8308 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8309 sizeof (struct field
) * nfields
);
8310 TYPE_NAME (rtype
) = ada_type_name (type
);
8311 TYPE_TAG_NAME (rtype
) = NULL
;
8312 TYPE_FIXED_INSTANCE (rtype
) = 1;
8313 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8315 branch_type
= to_fixed_variant_branch_type
8316 (TYPE_FIELD_TYPE (type
, variant_field
),
8317 cond_offset_host (valaddr
,
8318 TYPE_FIELD_BITPOS (type
, variant_field
)
8320 cond_offset_target (address
,
8321 TYPE_FIELD_BITPOS (type
, variant_field
)
8322 / TARGET_CHAR_BIT
), dval
);
8323 if (branch_type
== NULL
)
8327 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8328 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8329 TYPE_NFIELDS (rtype
) -= 1;
8333 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8334 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8335 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8336 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8338 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8340 value_free_to_mark (mark
);
8344 /* An ordinary record type (with fixed-length fields) that describes
8345 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8346 beginning of this section]. Any necessary discriminants' values
8347 should be in DVAL, a record value; it may be NULL if the object
8348 at ADDR itself contains any necessary discriminant values.
8349 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8350 values from the record are needed. Except in the case that DVAL,
8351 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8352 unchecked) is replaced by a particular branch of the variant.
8354 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8355 is questionable and may be removed. It can arise during the
8356 processing of an unconstrained-array-of-record type where all the
8357 variant branches have exactly the same size. This is because in
8358 such cases, the compiler does not bother to use the XVS convention
8359 when encoding the record. I am currently dubious of this
8360 shortcut and suspect the compiler should be altered. FIXME. */
8362 static struct type
*
8363 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8364 CORE_ADDR address
, struct value
*dval
)
8366 struct type
*templ_type
;
8368 if (TYPE_FIXED_INSTANCE (type0
))
8371 templ_type
= dynamic_template_type (type0
);
8373 if (templ_type
!= NULL
)
8374 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8375 else if (variant_field_index (type0
) >= 0)
8377 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8379 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8384 TYPE_FIXED_INSTANCE (type0
) = 1;
8390 /* An ordinary record type (with fixed-length fields) that describes
8391 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8392 union type. Any necessary discriminants' values should be in DVAL,
8393 a record value. That is, this routine selects the appropriate
8394 branch of the union at ADDR according to the discriminant value
8395 indicated in the union's type name. Returns VAR_TYPE0 itself if
8396 it represents a variant subject to a pragma Unchecked_Union. */
8398 static struct type
*
8399 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8400 CORE_ADDR address
, struct value
*dval
)
8403 struct type
*templ_type
;
8404 struct type
*var_type
;
8406 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8407 var_type
= TYPE_TARGET_TYPE (var_type0
);
8409 var_type
= var_type0
;
8411 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8413 if (templ_type
!= NULL
)
8414 var_type
= templ_type
;
8416 if (is_unchecked_variant (var_type
, value_type (dval
)))
8419 ada_which_variant_applies (var_type
,
8420 value_type (dval
), value_contents (dval
));
8423 return empty_record (var_type
);
8424 else if (is_dynamic_field (var_type
, which
))
8425 return to_fixed_record_type
8426 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8427 valaddr
, address
, dval
);
8428 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8430 to_fixed_record_type
8431 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8433 return TYPE_FIELD_TYPE (var_type
, which
);
8436 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8437 ENCODING_TYPE, a type following the GNAT conventions for discrete
8438 type encodings, only carries redundant information. */
8441 ada_is_redundant_range_encoding (struct type
*range_type
,
8442 struct type
*encoding_type
)
8444 struct type
*fixed_range_type
;
8449 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8451 if (TYPE_CODE (get_base_type (range_type
))
8452 != TYPE_CODE (get_base_type (encoding_type
)))
8454 /* The compiler probably used a simple base type to describe
8455 the range type instead of the range's actual base type,
8456 expecting us to get the real base type from the encoding
8457 anyway. In this situation, the encoding cannot be ignored
8462 if (is_dynamic_type (range_type
))
8465 if (TYPE_NAME (encoding_type
) == NULL
)
8468 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8469 if (bounds_str
== NULL
)
8472 n
= 8; /* Skip "___XDLU_". */
8473 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8475 if (TYPE_LOW_BOUND (range_type
) != lo
)
8478 n
+= 2; /* Skip the "__" separator between the two bounds. */
8479 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8481 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8487 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8488 a type following the GNAT encoding for describing array type
8489 indices, only carries redundant information. */
8492 ada_is_redundant_index_type_desc (struct type
*array_type
,
8493 struct type
*desc_type
)
8495 struct type
*this_layer
= check_typedef (array_type
);
8498 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8500 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8501 TYPE_FIELD_TYPE (desc_type
, i
)))
8503 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8509 /* Assuming that TYPE0 is an array type describing the type of a value
8510 at ADDR, and that DVAL describes a record containing any
8511 discriminants used in TYPE0, returns a type for the value that
8512 contains no dynamic components (that is, no components whose sizes
8513 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8514 true, gives an error message if the resulting type's size is over
8517 static struct type
*
8518 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8521 struct type
*index_type_desc
;
8522 struct type
*result
;
8523 int constrained_packed_array_p
;
8524 static const char *xa_suffix
= "___XA";
8526 type0
= ada_check_typedef (type0
);
8527 if (TYPE_FIXED_INSTANCE (type0
))
8530 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8531 if (constrained_packed_array_p
)
8532 type0
= decode_constrained_packed_array_type (type0
);
8534 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8536 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8537 encoding suffixed with 'P' may still be generated. If so,
8538 it should be used to find the XA type. */
8540 if (index_type_desc
== NULL
)
8542 const char *typename
= ada_type_name (type0
);
8544 if (typename
!= NULL
)
8546 const int len
= strlen (typename
);
8547 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8549 if (typename
[len
- 1] == 'P')
8551 strcpy (name
, typename
);
8552 strcpy (name
+ len
- 1, xa_suffix
);
8553 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8558 ada_fixup_array_indexes_type (index_type_desc
);
8559 if (index_type_desc
!= NULL
8560 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8562 /* Ignore this ___XA parallel type, as it does not bring any
8563 useful information. This allows us to avoid creating fixed
8564 versions of the array's index types, which would be identical
8565 to the original ones. This, in turn, can also help avoid
8566 the creation of fixed versions of the array itself. */
8567 index_type_desc
= NULL
;
8570 if (index_type_desc
== NULL
)
8572 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8574 /* NOTE: elt_type---the fixed version of elt_type0---should never
8575 depend on the contents of the array in properly constructed
8577 /* Create a fixed version of the array element type.
8578 We're not providing the address of an element here,
8579 and thus the actual object value cannot be inspected to do
8580 the conversion. This should not be a problem, since arrays of
8581 unconstrained objects are not allowed. In particular, all
8582 the elements of an array of a tagged type should all be of
8583 the same type specified in the debugging info. No need to
8584 consult the object tag. */
8585 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8587 /* Make sure we always create a new array type when dealing with
8588 packed array types, since we're going to fix-up the array
8589 type length and element bitsize a little further down. */
8590 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8593 result
= create_array_type (alloc_type_copy (type0
),
8594 elt_type
, TYPE_INDEX_TYPE (type0
));
8599 struct type
*elt_type0
;
8602 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8603 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8605 /* NOTE: result---the fixed version of elt_type0---should never
8606 depend on the contents of the array in properly constructed
8608 /* Create a fixed version of the array element type.
8609 We're not providing the address of an element here,
8610 and thus the actual object value cannot be inspected to do
8611 the conversion. This should not be a problem, since arrays of
8612 unconstrained objects are not allowed. In particular, all
8613 the elements of an array of a tagged type should all be of
8614 the same type specified in the debugging info. No need to
8615 consult the object tag. */
8617 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8620 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8622 struct type
*range_type
=
8623 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8625 result
= create_array_type (alloc_type_copy (elt_type0
),
8626 result
, range_type
);
8627 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8629 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8630 error (_("array type with dynamic size is larger than varsize-limit"));
8633 /* We want to preserve the type name. This can be useful when
8634 trying to get the type name of a value that has already been
8635 printed (for instance, if the user did "print VAR; whatis $". */
8636 TYPE_NAME (result
) = TYPE_NAME (type0
);
8638 if (constrained_packed_array_p
)
8640 /* So far, the resulting type has been created as if the original
8641 type was a regular (non-packed) array type. As a result, the
8642 bitsize of the array elements needs to be set again, and the array
8643 length needs to be recomputed based on that bitsize. */
8644 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8645 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8647 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8648 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8649 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8650 TYPE_LENGTH (result
)++;
8653 TYPE_FIXED_INSTANCE (result
) = 1;
8658 /* A standard type (containing no dynamically sized components)
8659 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8660 DVAL describes a record containing any discriminants used in TYPE0,
8661 and may be NULL if there are none, or if the object of type TYPE at
8662 ADDRESS or in VALADDR contains these discriminants.
8664 If CHECK_TAG is not null, in the case of tagged types, this function
8665 attempts to locate the object's tag and use it to compute the actual
8666 type. However, when ADDRESS is null, we cannot use it to determine the
8667 location of the tag, and therefore compute the tagged type's actual type.
8668 So we return the tagged type without consulting the tag. */
8670 static struct type
*
8671 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8672 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8674 type
= ada_check_typedef (type
);
8675 switch (TYPE_CODE (type
))
8679 case TYPE_CODE_STRUCT
:
8681 struct type
*static_type
= to_static_fixed_type (type
);
8682 struct type
*fixed_record_type
=
8683 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8685 /* If STATIC_TYPE is a tagged type and we know the object's address,
8686 then we can determine its tag, and compute the object's actual
8687 type from there. Note that we have to use the fixed record
8688 type (the parent part of the record may have dynamic fields
8689 and the way the location of _tag is expressed may depend on
8692 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8695 value_tag_from_contents_and_address
8699 struct type
*real_type
= type_from_tag (tag
);
8701 value_from_contents_and_address (fixed_record_type
,
8704 fixed_record_type
= value_type (obj
);
8705 if (real_type
!= NULL
)
8706 return to_fixed_record_type
8708 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8711 /* Check to see if there is a parallel ___XVZ variable.
8712 If there is, then it provides the actual size of our type. */
8713 else if (ada_type_name (fixed_record_type
) != NULL
)
8715 const char *name
= ada_type_name (fixed_record_type
);
8716 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8720 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8721 size
= get_int_var_value (xvz_name
, &xvz_found
);
8722 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8724 fixed_record_type
= copy_type (fixed_record_type
);
8725 TYPE_LENGTH (fixed_record_type
) = size
;
8727 /* The FIXED_RECORD_TYPE may have be a stub. We have
8728 observed this when the debugging info is STABS, and
8729 apparently it is something that is hard to fix.
8731 In practice, we don't need the actual type definition
8732 at all, because the presence of the XVZ variable allows us
8733 to assume that there must be a XVS type as well, which we
8734 should be able to use later, when we need the actual type
8737 In the meantime, pretend that the "fixed" type we are
8738 returning is NOT a stub, because this can cause trouble
8739 when using this type to create new types targeting it.
8740 Indeed, the associated creation routines often check
8741 whether the target type is a stub and will try to replace
8742 it, thus using a type with the wrong size. This, in turn,
8743 might cause the new type to have the wrong size too.
8744 Consider the case of an array, for instance, where the size
8745 of the array is computed from the number of elements in
8746 our array multiplied by the size of its element. */
8747 TYPE_STUB (fixed_record_type
) = 0;
8750 return fixed_record_type
;
8752 case TYPE_CODE_ARRAY
:
8753 return to_fixed_array_type (type
, dval
, 1);
8754 case TYPE_CODE_UNION
:
8758 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8762 /* The same as ada_to_fixed_type_1, except that it preserves the type
8763 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8765 The typedef layer needs be preserved in order to differentiate between
8766 arrays and array pointers when both types are implemented using the same
8767 fat pointer. In the array pointer case, the pointer is encoded as
8768 a typedef of the pointer type. For instance, considering:
8770 type String_Access is access String;
8771 S1 : String_Access := null;
8773 To the debugger, S1 is defined as a typedef of type String. But
8774 to the user, it is a pointer. So if the user tries to print S1,
8775 we should not dereference the array, but print the array address
8778 If we didn't preserve the typedef layer, we would lose the fact that
8779 the type is to be presented as a pointer (needs de-reference before
8780 being printed). And we would also use the source-level type name. */
8783 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8784 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8787 struct type
*fixed_type
=
8788 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8790 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8791 then preserve the typedef layer.
8793 Implementation note: We can only check the main-type portion of
8794 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8795 from TYPE now returns a type that has the same instance flags
8796 as TYPE. For instance, if TYPE is a "typedef const", and its
8797 target type is a "struct", then the typedef elimination will return
8798 a "const" version of the target type. See check_typedef for more
8799 details about how the typedef layer elimination is done.
8801 brobecker/2010-11-19: It seems to me that the only case where it is
8802 useful to preserve the typedef layer is when dealing with fat pointers.
8803 Perhaps, we could add a check for that and preserve the typedef layer
8804 only in that situation. But this seems unecessary so far, probably
8805 because we call check_typedef/ada_check_typedef pretty much everywhere.
8807 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8808 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8809 == TYPE_MAIN_TYPE (fixed_type
)))
8815 /* A standard (static-sized) type corresponding as well as possible to
8816 TYPE0, but based on no runtime data. */
8818 static struct type
*
8819 to_static_fixed_type (struct type
*type0
)
8826 if (TYPE_FIXED_INSTANCE (type0
))
8829 type0
= ada_check_typedef (type0
);
8831 switch (TYPE_CODE (type0
))
8835 case TYPE_CODE_STRUCT
:
8836 type
= dynamic_template_type (type0
);
8838 return template_to_static_fixed_type (type
);
8840 return template_to_static_fixed_type (type0
);
8841 case TYPE_CODE_UNION
:
8842 type
= ada_find_parallel_type (type0
, "___XVU");
8844 return template_to_static_fixed_type (type
);
8846 return template_to_static_fixed_type (type0
);
8850 /* A static approximation of TYPE with all type wrappers removed. */
8852 static struct type
*
8853 static_unwrap_type (struct type
*type
)
8855 if (ada_is_aligner_type (type
))
8857 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8858 if (ada_type_name (type1
) == NULL
)
8859 TYPE_NAME (type1
) = ada_type_name (type
);
8861 return static_unwrap_type (type1
);
8865 struct type
*raw_real_type
= ada_get_base_type (type
);
8867 if (raw_real_type
== type
)
8870 return to_static_fixed_type (raw_real_type
);
8874 /* In some cases, incomplete and private types require
8875 cross-references that are not resolved as records (for example,
8877 type FooP is access Foo;
8879 type Foo is array ...;
8880 ). In these cases, since there is no mechanism for producing
8881 cross-references to such types, we instead substitute for FooP a
8882 stub enumeration type that is nowhere resolved, and whose tag is
8883 the name of the actual type. Call these types "non-record stubs". */
8885 /* A type equivalent to TYPE that is not a non-record stub, if one
8886 exists, otherwise TYPE. */
8889 ada_check_typedef (struct type
*type
)
8894 /* If our type is a typedef type of a fat pointer, then we're done.
8895 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8896 what allows us to distinguish between fat pointers that represent
8897 array types, and fat pointers that represent array access types
8898 (in both cases, the compiler implements them as fat pointers). */
8899 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8900 && is_thick_pntr (ada_typedef_target_type (type
)))
8903 CHECK_TYPEDEF (type
);
8904 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8905 || !TYPE_STUB (type
)
8906 || TYPE_TAG_NAME (type
) == NULL
)
8910 const char *name
= TYPE_TAG_NAME (type
);
8911 struct type
*type1
= ada_find_any_type (name
);
8916 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8917 stubs pointing to arrays, as we don't create symbols for array
8918 types, only for the typedef-to-array types). If that's the case,
8919 strip the typedef layer. */
8920 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8921 type1
= ada_check_typedef (type1
);
8927 /* A value representing the data at VALADDR/ADDRESS as described by
8928 type TYPE0, but with a standard (static-sized) type that correctly
8929 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8930 type, then return VAL0 [this feature is simply to avoid redundant
8931 creation of struct values]. */
8933 static struct value
*
8934 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8937 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8939 if (type
== type0
&& val0
!= NULL
)
8942 return value_from_contents_and_address (type
, 0, address
);
8945 /* A value representing VAL, but with a standard (static-sized) type
8946 that correctly describes it. Does not necessarily create a new
8950 ada_to_fixed_value (struct value
*val
)
8952 val
= unwrap_value (val
);
8953 val
= ada_to_fixed_value_create (value_type (val
),
8954 value_address (val
),
8962 /* Table mapping attribute numbers to names.
8963 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8965 static const char *attribute_names
[] = {
8983 ada_attribute_name (enum exp_opcode n
)
8985 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8986 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8988 return attribute_names
[0];
8991 /* Evaluate the 'POS attribute applied to ARG. */
8994 pos_atr (struct value
*arg
)
8996 struct value
*val
= coerce_ref (arg
);
8997 struct type
*type
= value_type (val
);
8999 if (!discrete_type_p (type
))
9000 error (_("'POS only defined on discrete types"));
9002 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
9005 LONGEST v
= value_as_long (val
);
9007 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
9009 if (v
== TYPE_FIELD_ENUMVAL (type
, i
))
9012 error (_("enumeration value is invalid: can't find 'POS"));
9015 return value_as_long (val
);
9018 static struct value
*
9019 value_pos_atr (struct type
*type
, struct value
*arg
)
9021 return value_from_longest (type
, pos_atr (arg
));
9024 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9026 static struct value
*
9027 value_val_atr (struct type
*type
, struct value
*arg
)
9029 if (!discrete_type_p (type
))
9030 error (_("'VAL only defined on discrete types"));
9031 if (!integer_type_p (value_type (arg
)))
9032 error (_("'VAL requires integral argument"));
9034 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
9036 long pos
= value_as_long (arg
);
9038 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
9039 error (_("argument to 'VAL out of range"));
9040 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
9043 return value_from_longest (type
, value_as_long (arg
));
9049 /* True if TYPE appears to be an Ada character type.
9050 [At the moment, this is true only for Character and Wide_Character;
9051 It is a heuristic test that could stand improvement]. */
9054 ada_is_character_type (struct type
*type
)
9058 /* If the type code says it's a character, then assume it really is,
9059 and don't check any further. */
9060 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
9063 /* Otherwise, assume it's a character type iff it is a discrete type
9064 with a known character type name. */
9065 name
= ada_type_name (type
);
9066 return (name
!= NULL
9067 && (TYPE_CODE (type
) == TYPE_CODE_INT
9068 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9069 && (strcmp (name
, "character") == 0
9070 || strcmp (name
, "wide_character") == 0
9071 || strcmp (name
, "wide_wide_character") == 0
9072 || strcmp (name
, "unsigned char") == 0));
9075 /* True if TYPE appears to be an Ada string type. */
9078 ada_is_string_type (struct type
*type
)
9080 type
= ada_check_typedef (type
);
9082 && TYPE_CODE (type
) != TYPE_CODE_PTR
9083 && (ada_is_simple_array_type (type
)
9084 || ada_is_array_descriptor_type (type
))
9085 && ada_array_arity (type
) == 1)
9087 struct type
*elttype
= ada_array_element_type (type
, 1);
9089 return ada_is_character_type (elttype
);
9095 /* The compiler sometimes provides a parallel XVS type for a given
9096 PAD type. Normally, it is safe to follow the PAD type directly,
9097 but older versions of the compiler have a bug that causes the offset
9098 of its "F" field to be wrong. Following that field in that case
9099 would lead to incorrect results, but this can be worked around
9100 by ignoring the PAD type and using the associated XVS type instead.
9102 Set to True if the debugger should trust the contents of PAD types.
9103 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9104 static int trust_pad_over_xvs
= 1;
9106 /* True if TYPE is a struct type introduced by the compiler to force the
9107 alignment of a value. Such types have a single field with a
9108 distinctive name. */
9111 ada_is_aligner_type (struct type
*type
)
9113 type
= ada_check_typedef (type
);
9115 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9118 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9119 && TYPE_NFIELDS (type
) == 1
9120 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9123 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9124 the parallel type. */
9127 ada_get_base_type (struct type
*raw_type
)
9129 struct type
*real_type_namer
;
9130 struct type
*raw_real_type
;
9132 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9135 if (ada_is_aligner_type (raw_type
))
9136 /* The encoding specifies that we should always use the aligner type.
9137 So, even if this aligner type has an associated XVS type, we should
9140 According to the compiler gurus, an XVS type parallel to an aligner
9141 type may exist because of a stabs limitation. In stabs, aligner
9142 types are empty because the field has a variable-sized type, and
9143 thus cannot actually be used as an aligner type. As a result,
9144 we need the associated parallel XVS type to decode the type.
9145 Since the policy in the compiler is to not change the internal
9146 representation based on the debugging info format, we sometimes
9147 end up having a redundant XVS type parallel to the aligner type. */
9150 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9151 if (real_type_namer
== NULL
9152 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9153 || TYPE_NFIELDS (real_type_namer
) != 1)
9156 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9158 /* This is an older encoding form where the base type needs to be
9159 looked up by name. We prefer the newer enconding because it is
9161 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9162 if (raw_real_type
== NULL
)
9165 return raw_real_type
;
9168 /* The field in our XVS type is a reference to the base type. */
9169 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9172 /* The type of value designated by TYPE, with all aligners removed. */
9175 ada_aligned_type (struct type
*type
)
9177 if (ada_is_aligner_type (type
))
9178 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9180 return ada_get_base_type (type
);
9184 /* The address of the aligned value in an object at address VALADDR
9185 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9188 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9190 if (ada_is_aligner_type (type
))
9191 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9193 TYPE_FIELD_BITPOS (type
,
9194 0) / TARGET_CHAR_BIT
);
9201 /* The printed representation of an enumeration literal with encoded
9202 name NAME. The value is good to the next call of ada_enum_name. */
9204 ada_enum_name (const char *name
)
9206 static char *result
;
9207 static size_t result_len
= 0;
9210 /* First, unqualify the enumeration name:
9211 1. Search for the last '.' character. If we find one, then skip
9212 all the preceding characters, the unqualified name starts
9213 right after that dot.
9214 2. Otherwise, we may be debugging on a target where the compiler
9215 translates dots into "__". Search forward for double underscores,
9216 but stop searching when we hit an overloading suffix, which is
9217 of the form "__" followed by digits. */
9219 tmp
= strrchr (name
, '.');
9224 while ((tmp
= strstr (name
, "__")) != NULL
)
9226 if (isdigit (tmp
[2]))
9237 if (name
[1] == 'U' || name
[1] == 'W')
9239 if (sscanf (name
+ 2, "%x", &v
) != 1)
9245 GROW_VECT (result
, result_len
, 16);
9246 if (isascii (v
) && isprint (v
))
9247 xsnprintf (result
, result_len
, "'%c'", v
);
9248 else if (name
[1] == 'U')
9249 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9251 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9257 tmp
= strstr (name
, "__");
9259 tmp
= strstr (name
, "$");
9262 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9263 strncpy (result
, name
, tmp
- name
);
9264 result
[tmp
- name
] = '\0';
9272 /* Evaluate the subexpression of EXP starting at *POS as for
9273 evaluate_type, updating *POS to point just past the evaluated
9276 static struct value
*
9277 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9279 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9282 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9285 static struct value
*
9286 unwrap_value (struct value
*val
)
9288 struct type
*type
= ada_check_typedef (value_type (val
));
9290 if (ada_is_aligner_type (type
))
9292 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9293 struct type
*val_type
= ada_check_typedef (value_type (v
));
9295 if (ada_type_name (val_type
) == NULL
)
9296 TYPE_NAME (val_type
) = ada_type_name (type
);
9298 return unwrap_value (v
);
9302 struct type
*raw_real_type
=
9303 ada_check_typedef (ada_get_base_type (type
));
9305 /* If there is no parallel XVS or XVE type, then the value is
9306 already unwrapped. Return it without further modification. */
9307 if ((type
== raw_real_type
)
9308 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9312 coerce_unspec_val_to_type
9313 (val
, ada_to_fixed_type (raw_real_type
, 0,
9314 value_address (val
),
9319 static struct value
*
9320 cast_to_fixed (struct type
*type
, struct value
*arg
)
9324 if (type
== value_type (arg
))
9326 else if (ada_is_fixed_point_type (value_type (arg
)))
9327 val
= ada_float_to_fixed (type
,
9328 ada_fixed_to_float (value_type (arg
),
9329 value_as_long (arg
)));
9332 DOUBLEST argd
= value_as_double (arg
);
9334 val
= ada_float_to_fixed (type
, argd
);
9337 return value_from_longest (type
, val
);
9340 static struct value
*
9341 cast_from_fixed (struct type
*type
, struct value
*arg
)
9343 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9344 value_as_long (arg
));
9346 return value_from_double (type
, val
);
9349 /* Given two array types T1 and T2, return nonzero iff both arrays
9350 contain the same number of elements. */
9353 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9355 LONGEST lo1
, hi1
, lo2
, hi2
;
9357 /* Get the array bounds in order to verify that the size of
9358 the two arrays match. */
9359 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9360 || !get_array_bounds (t2
, &lo2
, &hi2
))
9361 error (_("unable to determine array bounds"));
9363 /* To make things easier for size comparison, normalize a bit
9364 the case of empty arrays by making sure that the difference
9365 between upper bound and lower bound is always -1. */
9371 return (hi1
- lo1
== hi2
- lo2
);
9374 /* Assuming that VAL is an array of integrals, and TYPE represents
9375 an array with the same number of elements, but with wider integral
9376 elements, return an array "casted" to TYPE. In practice, this
9377 means that the returned array is built by casting each element
9378 of the original array into TYPE's (wider) element type. */
9380 static struct value
*
9381 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9383 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9388 /* Verify that both val and type are arrays of scalars, and
9389 that the size of val's elements is smaller than the size
9390 of type's element. */
9391 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9392 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9393 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9394 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9395 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9396 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9398 if (!get_array_bounds (type
, &lo
, &hi
))
9399 error (_("unable to determine array bounds"));
9401 res
= allocate_value (type
);
9403 /* Promote each array element. */
9404 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9406 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9408 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9409 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9415 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9416 return the converted value. */
9418 static struct value
*
9419 coerce_for_assign (struct type
*type
, struct value
*val
)
9421 struct type
*type2
= value_type (val
);
9426 type2
= ada_check_typedef (type2
);
9427 type
= ada_check_typedef (type
);
9429 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9430 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9432 val
= ada_value_ind (val
);
9433 type2
= value_type (val
);
9436 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9437 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9439 if (!ada_same_array_size_p (type
, type2
))
9440 error (_("cannot assign arrays of different length"));
9442 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9443 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9444 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9445 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9447 /* Allow implicit promotion of the array elements to
9449 return ada_promote_array_of_integrals (type
, val
);
9452 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9453 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9454 error (_("Incompatible types in assignment"));
9455 deprecated_set_value_type (val
, type
);
9460 static struct value
*
9461 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9464 struct type
*type1
, *type2
;
9467 arg1
= coerce_ref (arg1
);
9468 arg2
= coerce_ref (arg2
);
9469 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9470 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9472 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9473 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9474 return value_binop (arg1
, arg2
, op
);
9483 return value_binop (arg1
, arg2
, op
);
9486 v2
= value_as_long (arg2
);
9488 error (_("second operand of %s must not be zero."), op_string (op
));
9490 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9491 return value_binop (arg1
, arg2
, op
);
9493 v1
= value_as_long (arg1
);
9498 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9499 v
+= v
> 0 ? -1 : 1;
9507 /* Should not reach this point. */
9511 val
= allocate_value (type1
);
9512 store_unsigned_integer (value_contents_raw (val
),
9513 TYPE_LENGTH (value_type (val
)),
9514 gdbarch_byte_order (get_type_arch (type1
)), v
);
9519 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9521 if (ada_is_direct_array_type (value_type (arg1
))
9522 || ada_is_direct_array_type (value_type (arg2
)))
9524 /* Automatically dereference any array reference before
9525 we attempt to perform the comparison. */
9526 arg1
= ada_coerce_ref (arg1
);
9527 arg2
= ada_coerce_ref (arg2
);
9529 arg1
= ada_coerce_to_simple_array (arg1
);
9530 arg2
= ada_coerce_to_simple_array (arg2
);
9531 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9532 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9533 error (_("Attempt to compare array with non-array"));
9534 /* FIXME: The following works only for types whose
9535 representations use all bits (no padding or undefined bits)
9536 and do not have user-defined equality. */
9538 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9539 && memcmp (value_contents (arg1
), value_contents (arg2
),
9540 TYPE_LENGTH (value_type (arg1
))) == 0;
9542 return value_equal (arg1
, arg2
);
9545 /* Total number of component associations in the aggregate starting at
9546 index PC in EXP. Assumes that index PC is the start of an
9550 num_component_specs (struct expression
*exp
, int pc
)
9554 m
= exp
->elts
[pc
+ 1].longconst
;
9557 for (i
= 0; i
< m
; i
+= 1)
9559 switch (exp
->elts
[pc
].opcode
)
9565 n
+= exp
->elts
[pc
+ 1].longconst
;
9568 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9573 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9574 component of LHS (a simple array or a record), updating *POS past
9575 the expression, assuming that LHS is contained in CONTAINER. Does
9576 not modify the inferior's memory, nor does it modify LHS (unless
9577 LHS == CONTAINER). */
9580 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9581 struct expression
*exp
, int *pos
)
9583 struct value
*mark
= value_mark ();
9586 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9588 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9589 struct value
*index_val
= value_from_longest (index_type
, index
);
9591 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9595 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9596 elt
= ada_to_fixed_value (elt
);
9599 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9600 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9602 value_assign_to_component (container
, elt
,
9603 ada_evaluate_subexp (NULL
, exp
, pos
,
9606 value_free_to_mark (mark
);
9609 /* Assuming that LHS represents an lvalue having a record or array
9610 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9611 of that aggregate's value to LHS, advancing *POS past the
9612 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9613 lvalue containing LHS (possibly LHS itself). Does not modify
9614 the inferior's memory, nor does it modify the contents of
9615 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9617 static struct value
*
9618 assign_aggregate (struct value
*container
,
9619 struct value
*lhs
, struct expression
*exp
,
9620 int *pos
, enum noside noside
)
9622 struct type
*lhs_type
;
9623 int n
= exp
->elts
[*pos
+1].longconst
;
9624 LONGEST low_index
, high_index
;
9627 int max_indices
, num_indices
;
9631 if (noside
!= EVAL_NORMAL
)
9633 for (i
= 0; i
< n
; i
+= 1)
9634 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9638 container
= ada_coerce_ref (container
);
9639 if (ada_is_direct_array_type (value_type (container
)))
9640 container
= ada_coerce_to_simple_array (container
);
9641 lhs
= ada_coerce_ref (lhs
);
9642 if (!deprecated_value_modifiable (lhs
))
9643 error (_("Left operand of assignment is not a modifiable lvalue."));
9645 lhs_type
= value_type (lhs
);
9646 if (ada_is_direct_array_type (lhs_type
))
9648 lhs
= ada_coerce_to_simple_array (lhs
);
9649 lhs_type
= value_type (lhs
);
9650 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9651 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9653 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9656 high_index
= num_visible_fields (lhs_type
) - 1;
9659 error (_("Left-hand side must be array or record."));
9661 num_specs
= num_component_specs (exp
, *pos
- 3);
9662 max_indices
= 4 * num_specs
+ 4;
9663 indices
= alloca (max_indices
* sizeof (indices
[0]));
9664 indices
[0] = indices
[1] = low_index
- 1;
9665 indices
[2] = indices
[3] = high_index
+ 1;
9668 for (i
= 0; i
< n
; i
+= 1)
9670 switch (exp
->elts
[*pos
].opcode
)
9673 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9674 &num_indices
, max_indices
,
9675 low_index
, high_index
);
9678 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9679 &num_indices
, max_indices
,
9680 low_index
, high_index
);
9684 error (_("Misplaced 'others' clause"));
9685 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9686 num_indices
, low_index
, high_index
);
9689 error (_("Internal error: bad aggregate clause"));
9696 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9697 construct at *POS, updating *POS past the construct, given that
9698 the positions are relative to lower bound LOW, where HIGH is the
9699 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9700 updating *NUM_INDICES as needed. CONTAINER is as for
9701 assign_aggregate. */
9703 aggregate_assign_positional (struct value
*container
,
9704 struct value
*lhs
, struct expression
*exp
,
9705 int *pos
, LONGEST
*indices
, int *num_indices
,
9706 int max_indices
, LONGEST low
, LONGEST high
)
9708 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9710 if (ind
- 1 == high
)
9711 warning (_("Extra components in aggregate ignored."));
9714 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9716 assign_component (container
, lhs
, ind
, exp
, pos
);
9719 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9722 /* Assign into the components of LHS indexed by the OP_CHOICES
9723 construct at *POS, updating *POS past the construct, given that
9724 the allowable indices are LOW..HIGH. Record the indices assigned
9725 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9726 needed. CONTAINER is as for assign_aggregate. */
9728 aggregate_assign_from_choices (struct value
*container
,
9729 struct value
*lhs
, struct expression
*exp
,
9730 int *pos
, LONGEST
*indices
, int *num_indices
,
9731 int max_indices
, LONGEST low
, LONGEST high
)
9734 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9735 int choice_pos
, expr_pc
;
9736 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9738 choice_pos
= *pos
+= 3;
9740 for (j
= 0; j
< n_choices
; j
+= 1)
9741 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9743 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9745 for (j
= 0; j
< n_choices
; j
+= 1)
9747 LONGEST lower
, upper
;
9748 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9750 if (op
== OP_DISCRETE_RANGE
)
9753 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9755 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9760 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9772 name
= &exp
->elts
[choice_pos
+ 2].string
;
9775 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9778 error (_("Invalid record component association."));
9780 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9782 if (! find_struct_field (name
, value_type (lhs
), 0,
9783 NULL
, NULL
, NULL
, NULL
, &ind
))
9784 error (_("Unknown component name: %s."), name
);
9785 lower
= upper
= ind
;
9788 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9789 error (_("Index in component association out of bounds."));
9791 add_component_interval (lower
, upper
, indices
, num_indices
,
9793 while (lower
<= upper
)
9798 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9804 /* Assign the value of the expression in the OP_OTHERS construct in
9805 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9806 have not been previously assigned. The index intervals already assigned
9807 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9808 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9810 aggregate_assign_others (struct value
*container
,
9811 struct value
*lhs
, struct expression
*exp
,
9812 int *pos
, LONGEST
*indices
, int num_indices
,
9813 LONGEST low
, LONGEST high
)
9816 int expr_pc
= *pos
+ 1;
9818 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9822 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9827 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9830 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9833 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9834 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9835 modifying *SIZE as needed. It is an error if *SIZE exceeds
9836 MAX_SIZE. The resulting intervals do not overlap. */
9838 add_component_interval (LONGEST low
, LONGEST high
,
9839 LONGEST
* indices
, int *size
, int max_size
)
9843 for (i
= 0; i
< *size
; i
+= 2) {
9844 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9848 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9849 if (high
< indices
[kh
])
9851 if (low
< indices
[i
])
9853 indices
[i
+ 1] = indices
[kh
- 1];
9854 if (high
> indices
[i
+ 1])
9855 indices
[i
+ 1] = high
;
9856 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9857 *size
-= kh
- i
- 2;
9860 else if (high
< indices
[i
])
9864 if (*size
== max_size
)
9865 error (_("Internal error: miscounted aggregate components."));
9867 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9868 indices
[j
] = indices
[j
- 2];
9870 indices
[i
+ 1] = high
;
9873 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9876 static struct value
*
9877 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9879 if (type
== ada_check_typedef (value_type (arg2
)))
9882 if (ada_is_fixed_point_type (type
))
9883 return (cast_to_fixed (type
, arg2
));
9885 if (ada_is_fixed_point_type (value_type (arg2
)))
9886 return cast_from_fixed (type
, arg2
);
9888 return value_cast (type
, arg2
);
9891 /* Evaluating Ada expressions, and printing their result.
9892 ------------------------------------------------------
9897 We usually evaluate an Ada expression in order to print its value.
9898 We also evaluate an expression in order to print its type, which
9899 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9900 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9901 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9902 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9905 Evaluating expressions is a little more complicated for Ada entities
9906 than it is for entities in languages such as C. The main reason for
9907 this is that Ada provides types whose definition might be dynamic.
9908 One example of such types is variant records. Or another example
9909 would be an array whose bounds can only be known at run time.
9911 The following description is a general guide as to what should be
9912 done (and what should NOT be done) in order to evaluate an expression
9913 involving such types, and when. This does not cover how the semantic
9914 information is encoded by GNAT as this is covered separatly. For the
9915 document used as the reference for the GNAT encoding, see exp_dbug.ads
9916 in the GNAT sources.
9918 Ideally, we should embed each part of this description next to its
9919 associated code. Unfortunately, the amount of code is so vast right
9920 now that it's hard to see whether the code handling a particular
9921 situation might be duplicated or not. One day, when the code is
9922 cleaned up, this guide might become redundant with the comments
9923 inserted in the code, and we might want to remove it.
9925 2. ``Fixing'' an Entity, the Simple Case:
9926 -----------------------------------------
9928 When evaluating Ada expressions, the tricky issue is that they may
9929 reference entities whose type contents and size are not statically
9930 known. Consider for instance a variant record:
9932 type Rec (Empty : Boolean := True) is record
9935 when False => Value : Integer;
9938 Yes : Rec := (Empty => False, Value => 1);
9939 No : Rec := (empty => True);
9941 The size and contents of that record depends on the value of the
9942 descriminant (Rec.Empty). At this point, neither the debugging
9943 information nor the associated type structure in GDB are able to
9944 express such dynamic types. So what the debugger does is to create
9945 "fixed" versions of the type that applies to the specific object.
9946 We also informally refer to this opperation as "fixing" an object,
9947 which means creating its associated fixed type.
9949 Example: when printing the value of variable "Yes" above, its fixed
9950 type would look like this:
9957 On the other hand, if we printed the value of "No", its fixed type
9964 Things become a little more complicated when trying to fix an entity
9965 with a dynamic type that directly contains another dynamic type,
9966 such as an array of variant records, for instance. There are
9967 two possible cases: Arrays, and records.
9969 3. ``Fixing'' Arrays:
9970 ---------------------
9972 The type structure in GDB describes an array in terms of its bounds,
9973 and the type of its elements. By design, all elements in the array
9974 have the same type and we cannot represent an array of variant elements
9975 using the current type structure in GDB. When fixing an array,
9976 we cannot fix the array element, as we would potentially need one
9977 fixed type per element of the array. As a result, the best we can do
9978 when fixing an array is to produce an array whose bounds and size
9979 are correct (allowing us to read it from memory), but without having
9980 touched its element type. Fixing each element will be done later,
9981 when (if) necessary.
9983 Arrays are a little simpler to handle than records, because the same
9984 amount of memory is allocated for each element of the array, even if
9985 the amount of space actually used by each element differs from element
9986 to element. Consider for instance the following array of type Rec:
9988 type Rec_Array is array (1 .. 2) of Rec;
9990 The actual amount of memory occupied by each element might be different
9991 from element to element, depending on the value of their discriminant.
9992 But the amount of space reserved for each element in the array remains
9993 fixed regardless. So we simply need to compute that size using
9994 the debugging information available, from which we can then determine
9995 the array size (we multiply the number of elements of the array by
9996 the size of each element).
9998 The simplest case is when we have an array of a constrained element
9999 type. For instance, consider the following type declarations:
10001 type Bounded_String (Max_Size : Integer) is
10003 Buffer : String (1 .. Max_Size);
10005 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10007 In this case, the compiler describes the array as an array of
10008 variable-size elements (identified by its XVS suffix) for which
10009 the size can be read in the parallel XVZ variable.
10011 In the case of an array of an unconstrained element type, the compiler
10012 wraps the array element inside a private PAD type. This type should not
10013 be shown to the user, and must be "unwrap"'ed before printing. Note
10014 that we also use the adjective "aligner" in our code to designate
10015 these wrapper types.
10017 In some cases, the size allocated for each element is statically
10018 known. In that case, the PAD type already has the correct size,
10019 and the array element should remain unfixed.
10021 But there are cases when this size is not statically known.
10022 For instance, assuming that "Five" is an integer variable:
10024 type Dynamic is array (1 .. Five) of Integer;
10025 type Wrapper (Has_Length : Boolean := False) is record
10028 when True => Length : Integer;
10029 when False => null;
10032 type Wrapper_Array is array (1 .. 2) of Wrapper;
10034 Hello : Wrapper_Array := (others => (Has_Length => True,
10035 Data => (others => 17),
10039 The debugging info would describe variable Hello as being an
10040 array of a PAD type. The size of that PAD type is not statically
10041 known, but can be determined using a parallel XVZ variable.
10042 In that case, a copy of the PAD type with the correct size should
10043 be used for the fixed array.
10045 3. ``Fixing'' record type objects:
10046 ----------------------------------
10048 Things are slightly different from arrays in the case of dynamic
10049 record types. In this case, in order to compute the associated
10050 fixed type, we need to determine the size and offset of each of
10051 its components. This, in turn, requires us to compute the fixed
10052 type of each of these components.
10054 Consider for instance the example:
10056 type Bounded_String (Max_Size : Natural) is record
10057 Str : String (1 .. Max_Size);
10060 My_String : Bounded_String (Max_Size => 10);
10062 In that case, the position of field "Length" depends on the size
10063 of field Str, which itself depends on the value of the Max_Size
10064 discriminant. In order to fix the type of variable My_String,
10065 we need to fix the type of field Str. Therefore, fixing a variant
10066 record requires us to fix each of its components.
10068 However, if a component does not have a dynamic size, the component
10069 should not be fixed. In particular, fields that use a PAD type
10070 should not fixed. Here is an example where this might happen
10071 (assuming type Rec above):
10073 type Container (Big : Boolean) is record
10077 when True => Another : Integer;
10078 when False => null;
10081 My_Container : Container := (Big => False,
10082 First => (Empty => True),
10085 In that example, the compiler creates a PAD type for component First,
10086 whose size is constant, and then positions the component After just
10087 right after it. The offset of component After is therefore constant
10090 The debugger computes the position of each field based on an algorithm
10091 that uses, among other things, the actual position and size of the field
10092 preceding it. Let's now imagine that the user is trying to print
10093 the value of My_Container. If the type fixing was recursive, we would
10094 end up computing the offset of field After based on the size of the
10095 fixed version of field First. And since in our example First has
10096 only one actual field, the size of the fixed type is actually smaller
10097 than the amount of space allocated to that field, and thus we would
10098 compute the wrong offset of field After.
10100 To make things more complicated, we need to watch out for dynamic
10101 components of variant records (identified by the ___XVL suffix in
10102 the component name). Even if the target type is a PAD type, the size
10103 of that type might not be statically known. So the PAD type needs
10104 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10105 we might end up with the wrong size for our component. This can be
10106 observed with the following type declarations:
10108 type Octal is new Integer range 0 .. 7;
10109 type Octal_Array is array (Positive range <>) of Octal;
10110 pragma Pack (Octal_Array);
10112 type Octal_Buffer (Size : Positive) is record
10113 Buffer : Octal_Array (1 .. Size);
10117 In that case, Buffer is a PAD type whose size is unset and needs
10118 to be computed by fixing the unwrapped type.
10120 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10121 ----------------------------------------------------------
10123 Lastly, when should the sub-elements of an entity that remained unfixed
10124 thus far, be actually fixed?
10126 The answer is: Only when referencing that element. For instance
10127 when selecting one component of a record, this specific component
10128 should be fixed at that point in time. Or when printing the value
10129 of a record, each component should be fixed before its value gets
10130 printed. Similarly for arrays, the element of the array should be
10131 fixed when printing each element of the array, or when extracting
10132 one element out of that array. On the other hand, fixing should
10133 not be performed on the elements when taking a slice of an array!
10135 Note that one of the side-effects of miscomputing the offset and
10136 size of each field is that we end up also miscomputing the size
10137 of the containing type. This can have adverse results when computing
10138 the value of an entity. GDB fetches the value of an entity based
10139 on the size of its type, and thus a wrong size causes GDB to fetch
10140 the wrong amount of memory. In the case where the computed size is
10141 too small, GDB fetches too little data to print the value of our
10142 entiry. Results in this case as unpredicatble, as we usually read
10143 past the buffer containing the data =:-o. */
10145 /* Implement the evaluate_exp routine in the exp_descriptor structure
10146 for the Ada language. */
10148 static struct value
*
10149 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10150 int *pos
, enum noside noside
)
10152 enum exp_opcode op
;
10156 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10159 struct value
**argvec
;
10163 op
= exp
->elts
[pc
].opcode
;
10169 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10171 if (noside
== EVAL_NORMAL
)
10172 arg1
= unwrap_value (arg1
);
10174 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
10175 then we need to perform the conversion manually, because
10176 evaluate_subexp_standard doesn't do it. This conversion is
10177 necessary in Ada because the different kinds of float/fixed
10178 types in Ada have different representations.
10180 Similarly, we need to perform the conversion from OP_LONG
10182 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
10183 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
10189 struct value
*result
;
10192 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10193 /* The result type will have code OP_STRING, bashed there from
10194 OP_ARRAY. Bash it back. */
10195 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10196 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10202 type
= exp
->elts
[pc
+ 1].type
;
10203 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
10204 if (noside
== EVAL_SKIP
)
10206 arg1
= ada_value_cast (type
, arg1
, noside
);
10211 type
= exp
->elts
[pc
+ 1].type
;
10212 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10215 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10216 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10218 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10219 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10221 return ada_value_assign (arg1
, arg1
);
10223 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10224 except if the lhs of our assignment is a convenience variable.
10225 In the case of assigning to a convenience variable, the lhs
10226 should be exactly the result of the evaluation of the rhs. */
10227 type
= value_type (arg1
);
10228 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10230 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10231 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10233 if (ada_is_fixed_point_type (value_type (arg1
)))
10234 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10235 else if (ada_is_fixed_point_type (value_type (arg2
)))
10237 (_("Fixed-point values must be assigned to fixed-point variables"));
10239 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10240 return ada_value_assign (arg1
, arg2
);
10243 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10244 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10245 if (noside
== EVAL_SKIP
)
10247 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10248 return (value_from_longest
10249 (value_type (arg1
),
10250 value_as_long (arg1
) + value_as_long (arg2
)));
10251 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10252 return (value_from_longest
10253 (value_type (arg2
),
10254 value_as_long (arg1
) + value_as_long (arg2
)));
10255 if ((ada_is_fixed_point_type (value_type (arg1
))
10256 || ada_is_fixed_point_type (value_type (arg2
)))
10257 && value_type (arg1
) != value_type (arg2
))
10258 error (_("Operands of fixed-point addition must have the same type"));
10259 /* Do the addition, and cast the result to the type of the first
10260 argument. We cannot cast the result to a reference type, so if
10261 ARG1 is a reference type, find its underlying type. */
10262 type
= value_type (arg1
);
10263 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10264 type
= TYPE_TARGET_TYPE (type
);
10265 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10266 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10269 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10270 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10271 if (noside
== EVAL_SKIP
)
10273 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10274 return (value_from_longest
10275 (value_type (arg1
),
10276 value_as_long (arg1
) - value_as_long (arg2
)));
10277 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10278 return (value_from_longest
10279 (value_type (arg2
),
10280 value_as_long (arg1
) - value_as_long (arg2
)));
10281 if ((ada_is_fixed_point_type (value_type (arg1
))
10282 || ada_is_fixed_point_type (value_type (arg2
)))
10283 && value_type (arg1
) != value_type (arg2
))
10284 error (_("Operands of fixed-point subtraction "
10285 "must have the same type"));
10286 /* Do the substraction, and cast the result to the type of the first
10287 argument. We cannot cast the result to a reference type, so if
10288 ARG1 is a reference type, find its underlying type. */
10289 type
= value_type (arg1
);
10290 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10291 type
= TYPE_TARGET_TYPE (type
);
10292 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10293 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10299 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10300 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10301 if (noside
== EVAL_SKIP
)
10303 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10305 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10306 return value_zero (value_type (arg1
), not_lval
);
10310 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10311 if (ada_is_fixed_point_type (value_type (arg1
)))
10312 arg1
= cast_from_fixed (type
, arg1
);
10313 if (ada_is_fixed_point_type (value_type (arg2
)))
10314 arg2
= cast_from_fixed (type
, arg2
);
10315 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10316 return ada_value_binop (arg1
, arg2
, op
);
10320 case BINOP_NOTEQUAL
:
10321 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10322 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10323 if (noside
== EVAL_SKIP
)
10325 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10329 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10330 tem
= ada_value_equal (arg1
, arg2
);
10332 if (op
== BINOP_NOTEQUAL
)
10334 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10335 return value_from_longest (type
, (LONGEST
) tem
);
10338 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10339 if (noside
== EVAL_SKIP
)
10341 else if (ada_is_fixed_point_type (value_type (arg1
)))
10342 return value_cast (value_type (arg1
), value_neg (arg1
));
10345 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10346 return value_neg (arg1
);
10349 case BINOP_LOGICAL_AND
:
10350 case BINOP_LOGICAL_OR
:
10351 case UNOP_LOGICAL_NOT
:
10356 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10357 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10358 return value_cast (type
, val
);
10361 case BINOP_BITWISE_AND
:
10362 case BINOP_BITWISE_IOR
:
10363 case BINOP_BITWISE_XOR
:
10367 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10369 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10371 return value_cast (value_type (arg1
), val
);
10377 if (noside
== EVAL_SKIP
)
10383 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10384 /* Only encountered when an unresolved symbol occurs in a
10385 context other than a function call, in which case, it is
10387 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10388 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10390 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10392 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10393 /* Check to see if this is a tagged type. We also need to handle
10394 the case where the type is a reference to a tagged type, but
10395 we have to be careful to exclude pointers to tagged types.
10396 The latter should be shown as usual (as a pointer), whereas
10397 a reference should mostly be transparent to the user. */
10398 if (ada_is_tagged_type (type
, 0)
10399 || (TYPE_CODE (type
) == TYPE_CODE_REF
10400 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10402 /* Tagged types are a little special in the fact that the real
10403 type is dynamic and can only be determined by inspecting the
10404 object's tag. This means that we need to get the object's
10405 value first (EVAL_NORMAL) and then extract the actual object
10408 Note that we cannot skip the final step where we extract
10409 the object type from its tag, because the EVAL_NORMAL phase
10410 results in dynamic components being resolved into fixed ones.
10411 This can cause problems when trying to print the type
10412 description of tagged types whose parent has a dynamic size:
10413 We use the type name of the "_parent" component in order
10414 to print the name of the ancestor type in the type description.
10415 If that component had a dynamic size, the resolution into
10416 a fixed type would result in the loss of that type name,
10417 thus preventing us from printing the name of the ancestor
10418 type in the type description. */
10419 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10421 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10423 struct type
*actual_type
;
10425 actual_type
= type_from_tag (ada_value_tag (arg1
));
10426 if (actual_type
== NULL
)
10427 /* If, for some reason, we were unable to determine
10428 the actual type from the tag, then use the static
10429 approximation that we just computed as a fallback.
10430 This can happen if the debugging information is
10431 incomplete, for instance. */
10432 actual_type
= type
;
10433 return value_zero (actual_type
, not_lval
);
10437 /* In the case of a ref, ada_coerce_ref takes care
10438 of determining the actual type. But the evaluation
10439 should return a ref as it should be valid to ask
10440 for its address; so rebuild a ref after coerce. */
10441 arg1
= ada_coerce_ref (arg1
);
10442 return value_ref (arg1
);
10446 /* Records and unions for which GNAT encodings have been
10447 generated need to be statically fixed as well.
10448 Otherwise, non-static fixing produces a type where
10449 all dynamic properties are removed, which prevents "ptype"
10450 from being able to completely describe the type.
10451 For instance, a case statement in a variant record would be
10452 replaced by the relevant components based on the actual
10453 value of the discriminants. */
10454 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10455 && dynamic_template_type (type
) != NULL
)
10456 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10457 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10460 return value_zero (to_static_fixed_type (type
), not_lval
);
10464 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10465 return ada_to_fixed_value (arg1
);
10470 /* Allocate arg vector, including space for the function to be
10471 called in argvec[0] and a terminating NULL. */
10472 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10474 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
10476 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10477 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10478 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10479 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10482 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10483 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10486 if (noside
== EVAL_SKIP
)
10490 if (ada_is_constrained_packed_array_type
10491 (desc_base_type (value_type (argvec
[0]))))
10492 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10493 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10494 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10495 /* This is a packed array that has already been fixed, and
10496 therefore already coerced to a simple array. Nothing further
10499 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
10500 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10501 && VALUE_LVAL (argvec
[0]) == lval_memory
))
10502 argvec
[0] = value_addr (argvec
[0]);
10504 type
= ada_check_typedef (value_type (argvec
[0]));
10506 /* Ada allows us to implicitly dereference arrays when subscripting
10507 them. So, if this is an array typedef (encoding use for array
10508 access types encoded as fat pointers), strip it now. */
10509 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10510 type
= ada_typedef_target_type (type
);
10512 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10514 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10516 case TYPE_CODE_FUNC
:
10517 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10519 case TYPE_CODE_ARRAY
:
10521 case TYPE_CODE_STRUCT
:
10522 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10523 argvec
[0] = ada_value_ind (argvec
[0]);
10524 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10527 error (_("cannot subscript or call something of type `%s'"),
10528 ada_type_name (value_type (argvec
[0])));
10533 switch (TYPE_CODE (type
))
10535 case TYPE_CODE_FUNC
:
10536 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10538 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10540 if (TYPE_GNU_IFUNC (type
))
10541 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10542 return allocate_value (rtype
);
10544 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10545 case TYPE_CODE_INTERNAL_FUNCTION
:
10546 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10547 /* We don't know anything about what the internal
10548 function might return, but we have to return
10550 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10553 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10554 argvec
[0], nargs
, argvec
+ 1);
10556 case TYPE_CODE_STRUCT
:
10560 arity
= ada_array_arity (type
);
10561 type
= ada_array_element_type (type
, nargs
);
10563 error (_("cannot subscript or call a record"));
10564 if (arity
!= nargs
)
10565 error (_("wrong number of subscripts; expecting %d"), arity
);
10566 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10567 return value_zero (ada_aligned_type (type
), lval_memory
);
10569 unwrap_value (ada_value_subscript
10570 (argvec
[0], nargs
, argvec
+ 1));
10572 case TYPE_CODE_ARRAY
:
10573 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10575 type
= ada_array_element_type (type
, nargs
);
10577 error (_("element type of array unknown"));
10579 return value_zero (ada_aligned_type (type
), lval_memory
);
10582 unwrap_value (ada_value_subscript
10583 (ada_coerce_to_simple_array (argvec
[0]),
10584 nargs
, argvec
+ 1));
10585 case TYPE_CODE_PTR
: /* Pointer to array */
10586 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10588 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10589 type
= ada_array_element_type (type
, nargs
);
10591 error (_("element type of array unknown"));
10593 return value_zero (ada_aligned_type (type
), lval_memory
);
10596 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10597 nargs
, argvec
+ 1));
10600 error (_("Attempt to index or call something other than an "
10601 "array or function"));
10606 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10607 struct value
*low_bound_val
=
10608 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10609 struct value
*high_bound_val
=
10610 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10612 LONGEST high_bound
;
10614 low_bound_val
= coerce_ref (low_bound_val
);
10615 high_bound_val
= coerce_ref (high_bound_val
);
10616 low_bound
= pos_atr (low_bound_val
);
10617 high_bound
= pos_atr (high_bound_val
);
10619 if (noside
== EVAL_SKIP
)
10622 /* If this is a reference to an aligner type, then remove all
10624 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10625 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10626 TYPE_TARGET_TYPE (value_type (array
)) =
10627 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10629 if (ada_is_constrained_packed_array_type (value_type (array
)))
10630 error (_("cannot slice a packed array"));
10632 /* If this is a reference to an array or an array lvalue,
10633 convert to a pointer. */
10634 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10635 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10636 && VALUE_LVAL (array
) == lval_memory
))
10637 array
= value_addr (array
);
10639 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10640 && ada_is_array_descriptor_type (ada_check_typedef
10641 (value_type (array
))))
10642 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10644 array
= ada_coerce_to_simple_array_ptr (array
);
10646 /* If we have more than one level of pointer indirection,
10647 dereference the value until we get only one level. */
10648 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10649 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10651 array
= value_ind (array
);
10653 /* Make sure we really do have an array type before going further,
10654 to avoid a SEGV when trying to get the index type or the target
10655 type later down the road if the debug info generated by
10656 the compiler is incorrect or incomplete. */
10657 if (!ada_is_simple_array_type (value_type (array
)))
10658 error (_("cannot take slice of non-array"));
10660 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10663 struct type
*type0
= ada_check_typedef (value_type (array
));
10665 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10666 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10669 struct type
*arr_type0
=
10670 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10672 return ada_value_slice_from_ptr (array
, arr_type0
,
10673 longest_to_int (low_bound
),
10674 longest_to_int (high_bound
));
10677 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10679 else if (high_bound
< low_bound
)
10680 return empty_array (value_type (array
), low_bound
);
10682 return ada_value_slice (array
, longest_to_int (low_bound
),
10683 longest_to_int (high_bound
));
10686 case UNOP_IN_RANGE
:
10688 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10689 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10691 if (noside
== EVAL_SKIP
)
10694 switch (TYPE_CODE (type
))
10697 lim_warning (_("Membership test incompletely implemented; "
10698 "always returns true"));
10699 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10700 return value_from_longest (type
, (LONGEST
) 1);
10702 case TYPE_CODE_RANGE
:
10703 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10704 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10705 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10706 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10707 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10709 value_from_longest (type
,
10710 (value_less (arg1
, arg3
)
10711 || value_equal (arg1
, arg3
))
10712 && (value_less (arg2
, arg1
)
10713 || value_equal (arg2
, arg1
)));
10716 case BINOP_IN_BOUNDS
:
10718 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10719 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10721 if (noside
== EVAL_SKIP
)
10724 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10726 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10727 return value_zero (type
, not_lval
);
10730 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10732 type
= ada_index_type (value_type (arg2
), tem
, "range");
10734 type
= value_type (arg1
);
10736 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10737 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10739 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10740 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10741 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10743 value_from_longest (type
,
10744 (value_less (arg1
, arg3
)
10745 || value_equal (arg1
, arg3
))
10746 && (value_less (arg2
, arg1
)
10747 || value_equal (arg2
, arg1
)));
10749 case TERNOP_IN_RANGE
:
10750 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10751 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10752 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10754 if (noside
== EVAL_SKIP
)
10757 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10758 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10759 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10761 value_from_longest (type
,
10762 (value_less (arg1
, arg3
)
10763 || value_equal (arg1
, arg3
))
10764 && (value_less (arg2
, arg1
)
10765 || value_equal (arg2
, arg1
)));
10769 case OP_ATR_LENGTH
:
10771 struct type
*type_arg
;
10773 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10775 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10777 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10781 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10785 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10786 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10787 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10790 if (noside
== EVAL_SKIP
)
10793 if (type_arg
== NULL
)
10795 arg1
= ada_coerce_ref (arg1
);
10797 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10798 arg1
= ada_coerce_to_simple_array (arg1
);
10800 if (op
== OP_ATR_LENGTH
)
10801 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10804 type
= ada_index_type (value_type (arg1
), tem
,
10805 ada_attribute_name (op
));
10807 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10810 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10811 return allocate_value (type
);
10815 default: /* Should never happen. */
10816 error (_("unexpected attribute encountered"));
10818 return value_from_longest
10819 (type
, ada_array_bound (arg1
, tem
, 0));
10821 return value_from_longest
10822 (type
, ada_array_bound (arg1
, tem
, 1));
10823 case OP_ATR_LENGTH
:
10824 return value_from_longest
10825 (type
, ada_array_length (arg1
, tem
));
10828 else if (discrete_type_p (type_arg
))
10830 struct type
*range_type
;
10831 const char *name
= ada_type_name (type_arg
);
10834 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10835 range_type
= to_fixed_range_type (type_arg
, NULL
);
10836 if (range_type
== NULL
)
10837 range_type
= type_arg
;
10841 error (_("unexpected attribute encountered"));
10843 return value_from_longest
10844 (range_type
, ada_discrete_type_low_bound (range_type
));
10846 return value_from_longest
10847 (range_type
, ada_discrete_type_high_bound (range_type
));
10848 case OP_ATR_LENGTH
:
10849 error (_("the 'length attribute applies only to array types"));
10852 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10853 error (_("unimplemented type attribute"));
10858 if (ada_is_constrained_packed_array_type (type_arg
))
10859 type_arg
= decode_constrained_packed_array_type (type_arg
);
10861 if (op
== OP_ATR_LENGTH
)
10862 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10865 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10867 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10870 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10871 return allocate_value (type
);
10876 error (_("unexpected attribute encountered"));
10878 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10879 return value_from_longest (type
, low
);
10881 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10882 return value_from_longest (type
, high
);
10883 case OP_ATR_LENGTH
:
10884 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10885 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10886 return value_from_longest (type
, high
- low
+ 1);
10892 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10893 if (noside
== EVAL_SKIP
)
10896 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10897 return value_zero (ada_tag_type (arg1
), not_lval
);
10899 return ada_value_tag (arg1
);
10903 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10904 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10905 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10906 if (noside
== EVAL_SKIP
)
10908 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10909 return value_zero (value_type (arg1
), not_lval
);
10912 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10913 return value_binop (arg1
, arg2
,
10914 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10917 case OP_ATR_MODULUS
:
10919 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10921 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10922 if (noside
== EVAL_SKIP
)
10925 if (!ada_is_modular_type (type_arg
))
10926 error (_("'modulus must be applied to modular type"));
10928 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10929 ada_modulus (type_arg
));
10934 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10935 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10936 if (noside
== EVAL_SKIP
)
10938 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10939 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10940 return value_zero (type
, not_lval
);
10942 return value_pos_atr (type
, arg1
);
10945 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10946 type
= value_type (arg1
);
10948 /* If the argument is a reference, then dereference its type, since
10949 the user is really asking for the size of the actual object,
10950 not the size of the pointer. */
10951 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10952 type
= TYPE_TARGET_TYPE (type
);
10954 if (noside
== EVAL_SKIP
)
10956 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10957 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10959 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10960 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10963 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10964 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10965 type
= exp
->elts
[pc
+ 2].type
;
10966 if (noside
== EVAL_SKIP
)
10968 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10969 return value_zero (type
, not_lval
);
10971 return value_val_atr (type
, arg1
);
10974 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10975 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10976 if (noside
== EVAL_SKIP
)
10978 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10979 return value_zero (value_type (arg1
), not_lval
);
10982 /* For integer exponentiation operations,
10983 only promote the first argument. */
10984 if (is_integral_type (value_type (arg2
)))
10985 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10987 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10989 return value_binop (arg1
, arg2
, op
);
10993 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10994 if (noside
== EVAL_SKIP
)
11000 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11001 if (noside
== EVAL_SKIP
)
11003 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11004 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11005 return value_neg (arg1
);
11010 preeval_pos
= *pos
;
11011 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11012 if (noside
== EVAL_SKIP
)
11014 type
= ada_check_typedef (value_type (arg1
));
11015 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11017 if (ada_is_array_descriptor_type (type
))
11018 /* GDB allows dereferencing GNAT array descriptors. */
11020 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11022 if (arrType
== NULL
)
11023 error (_("Attempt to dereference null array pointer."));
11024 return value_at_lazy (arrType
, 0);
11026 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
11027 || TYPE_CODE (type
) == TYPE_CODE_REF
11028 /* In C you can dereference an array to get the 1st elt. */
11029 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
11031 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11032 only be determined by inspecting the object's tag.
11033 This means that we need to evaluate completely the
11034 expression in order to get its type. */
11036 if ((TYPE_CODE (type
) == TYPE_CODE_REF
11037 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
11038 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11040 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11042 type
= value_type (ada_value_ind (arg1
));
11046 type
= to_static_fixed_type
11048 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11050 ada_ensure_varsize_limit (type
);
11051 return value_zero (type
, lval_memory
);
11053 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11055 /* GDB allows dereferencing an int. */
11056 if (expect_type
== NULL
)
11057 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11062 to_static_fixed_type (ada_aligned_type (expect_type
));
11063 return value_zero (expect_type
, lval_memory
);
11067 error (_("Attempt to take contents of a non-pointer value."));
11069 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11070 type
= ada_check_typedef (value_type (arg1
));
11072 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11073 /* GDB allows dereferencing an int. If we were given
11074 the expect_type, then use that as the target type.
11075 Otherwise, assume that the target type is an int. */
11077 if (expect_type
!= NULL
)
11078 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11081 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11082 (CORE_ADDR
) value_as_address (arg1
));
11085 if (ada_is_array_descriptor_type (type
))
11086 /* GDB allows dereferencing GNAT array descriptors. */
11087 return ada_coerce_to_simple_array (arg1
);
11089 return ada_value_ind (arg1
);
11091 case STRUCTOP_STRUCT
:
11092 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11093 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11094 preeval_pos
= *pos
;
11095 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11096 if (noside
== EVAL_SKIP
)
11098 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11100 struct type
*type1
= value_type (arg1
);
11102 if (ada_is_tagged_type (type1
, 1))
11104 type
= ada_lookup_struct_elt_type (type1
,
11105 &exp
->elts
[pc
+ 2].string
,
11108 /* If the field is not found, check if it exists in the
11109 extension of this object's type. This means that we
11110 need to evaluate completely the expression. */
11114 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11116 arg1
= ada_value_struct_elt (arg1
,
11117 &exp
->elts
[pc
+ 2].string
,
11119 arg1
= unwrap_value (arg1
);
11120 type
= value_type (ada_to_fixed_value (arg1
));
11125 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11128 return value_zero (ada_aligned_type (type
), lval_memory
);
11131 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11132 arg1
= unwrap_value (arg1
);
11133 return ada_to_fixed_value (arg1
);
11136 /* The value is not supposed to be used. This is here to make it
11137 easier to accommodate expressions that contain types. */
11139 if (noside
== EVAL_SKIP
)
11141 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11142 return allocate_value (exp
->elts
[pc
+ 1].type
);
11144 error (_("Attempt to use a type name as an expression"));
11149 case OP_DISCRETE_RANGE
:
11150 case OP_POSITIONAL
:
11152 if (noside
== EVAL_NORMAL
)
11156 error (_("Undefined name, ambiguous name, or renaming used in "
11157 "component association: %s."), &exp
->elts
[pc
+2].string
);
11159 error (_("Aggregates only allowed on the right of an assignment"));
11161 internal_error (__FILE__
, __LINE__
,
11162 _("aggregate apparently mangled"));
11165 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11167 for (tem
= 0; tem
< nargs
; tem
+= 1)
11168 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11173 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
11179 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11180 type name that encodes the 'small and 'delta information.
11181 Otherwise, return NULL. */
11183 static const char *
11184 fixed_type_info (struct type
*type
)
11186 const char *name
= ada_type_name (type
);
11187 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11189 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11191 const char *tail
= strstr (name
, "___XF_");
11198 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11199 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11204 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11207 ada_is_fixed_point_type (struct type
*type
)
11209 return fixed_type_info (type
) != NULL
;
11212 /* Return non-zero iff TYPE represents a System.Address type. */
11215 ada_is_system_address_type (struct type
*type
)
11217 return (TYPE_NAME (type
)
11218 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11221 /* Assuming that TYPE is the representation of an Ada fixed-point
11222 type, return its delta, or -1 if the type is malformed and the
11223 delta cannot be determined. */
11226 ada_delta (struct type
*type
)
11228 const char *encoding
= fixed_type_info (type
);
11231 /* Strictly speaking, num and den are encoded as integer. However,
11232 they may not fit into a long, and they will have to be converted
11233 to DOUBLEST anyway. So scan them as DOUBLEST. */
11234 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11241 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11242 factor ('SMALL value) associated with the type. */
11245 scaling_factor (struct type
*type
)
11247 const char *encoding
= fixed_type_info (type
);
11248 DOUBLEST num0
, den0
, num1
, den1
;
11251 /* Strictly speaking, num's and den's are encoded as integer. However,
11252 they may not fit into a long, and they will have to be converted
11253 to DOUBLEST anyway. So scan them as DOUBLEST. */
11254 n
= sscanf (encoding
,
11255 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
11256 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11257 &num0
, &den0
, &num1
, &den1
);
11262 return num1
/ den1
;
11264 return num0
/ den0
;
11268 /* Assuming that X is the representation of a value of fixed-point
11269 type TYPE, return its floating-point equivalent. */
11272 ada_fixed_to_float (struct type
*type
, LONGEST x
)
11274 return (DOUBLEST
) x
*scaling_factor (type
);
11277 /* The representation of a fixed-point value of type TYPE
11278 corresponding to the value X. */
11281 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
11283 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
11290 /* Scan STR beginning at position K for a discriminant name, and
11291 return the value of that discriminant field of DVAL in *PX. If
11292 PNEW_K is not null, put the position of the character beyond the
11293 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11294 not alter *PX and *PNEW_K if unsuccessful. */
11297 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11300 static char *bound_buffer
= NULL
;
11301 static size_t bound_buffer_len
= 0;
11304 struct value
*bound_val
;
11306 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11309 pend
= strstr (str
+ k
, "__");
11313 k
+= strlen (bound
);
11317 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
11318 bound
= bound_buffer
;
11319 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
11320 bound
[pend
- (str
+ k
)] = '\0';
11324 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11325 if (bound_val
== NULL
)
11328 *px
= value_as_long (bound_val
);
11329 if (pnew_k
!= NULL
)
11334 /* Value of variable named NAME in the current environment. If
11335 no such variable found, then if ERR_MSG is null, returns 0, and
11336 otherwise causes an error with message ERR_MSG. */
11338 static struct value
*
11339 get_var_value (char *name
, char *err_msg
)
11341 struct ada_symbol_info
*syms
;
11344 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11349 if (err_msg
== NULL
)
11352 error (("%s"), err_msg
);
11355 return value_of_variable (syms
[0].sym
, syms
[0].block
);
11358 /* Value of integer variable named NAME in the current environment. If
11359 no such variable found, returns 0, and sets *FLAG to 0. If
11360 successful, sets *FLAG to 1. */
11363 get_int_var_value (char *name
, int *flag
)
11365 struct value
*var_val
= get_var_value (name
, 0);
11377 return value_as_long (var_val
);
11382 /* Return a range type whose base type is that of the range type named
11383 NAME in the current environment, and whose bounds are calculated
11384 from NAME according to the GNAT range encoding conventions.
11385 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11386 corresponding range type from debug information; fall back to using it
11387 if symbol lookup fails. If a new type must be created, allocate it
11388 like ORIG_TYPE was. The bounds information, in general, is encoded
11389 in NAME, the base type given in the named range type. */
11391 static struct type
*
11392 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11395 struct type
*base_type
;
11396 char *subtype_info
;
11398 gdb_assert (raw_type
!= NULL
);
11399 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11401 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11402 base_type
= TYPE_TARGET_TYPE (raw_type
);
11404 base_type
= raw_type
;
11406 name
= TYPE_NAME (raw_type
);
11407 subtype_info
= strstr (name
, "___XD");
11408 if (subtype_info
== NULL
)
11410 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11411 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11413 if (L
< INT_MIN
|| U
> INT_MAX
)
11416 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11421 static char *name_buf
= NULL
;
11422 static size_t name_len
= 0;
11423 int prefix_len
= subtype_info
- name
;
11429 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11430 strncpy (name_buf
, name
, prefix_len
);
11431 name_buf
[prefix_len
] = '\0';
11434 bounds_str
= strchr (subtype_info
, '_');
11437 if (*subtype_info
== 'L')
11439 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11440 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11442 if (bounds_str
[n
] == '_')
11444 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11452 strcpy (name_buf
+ prefix_len
, "___L");
11453 L
= get_int_var_value (name_buf
, &ok
);
11456 lim_warning (_("Unknown lower bound, using 1."));
11461 if (*subtype_info
== 'U')
11463 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11464 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11471 strcpy (name_buf
+ prefix_len
, "___U");
11472 U
= get_int_var_value (name_buf
, &ok
);
11475 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11480 type
= create_static_range_type (alloc_type_copy (raw_type
),
11482 TYPE_NAME (type
) = name
;
11487 /* True iff NAME is the name of a range type. */
11490 ada_is_range_type_name (const char *name
)
11492 return (name
!= NULL
&& strstr (name
, "___XD"));
11496 /* Modular types */
11498 /* True iff TYPE is an Ada modular type. */
11501 ada_is_modular_type (struct type
*type
)
11503 struct type
*subranged_type
= get_base_type (type
);
11505 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11506 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11507 && TYPE_UNSIGNED (subranged_type
));
11510 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11513 ada_modulus (struct type
*type
)
11515 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11519 /* Ada exception catchpoint support:
11520 ---------------------------------
11522 We support 3 kinds of exception catchpoints:
11523 . catchpoints on Ada exceptions
11524 . catchpoints on unhandled Ada exceptions
11525 . catchpoints on failed assertions
11527 Exceptions raised during failed assertions, or unhandled exceptions
11528 could perfectly be caught with the general catchpoint on Ada exceptions.
11529 However, we can easily differentiate these two special cases, and having
11530 the option to distinguish these two cases from the rest can be useful
11531 to zero-in on certain situations.
11533 Exception catchpoints are a specialized form of breakpoint,
11534 since they rely on inserting breakpoints inside known routines
11535 of the GNAT runtime. The implementation therefore uses a standard
11536 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11539 Support in the runtime for exception catchpoints have been changed
11540 a few times already, and these changes affect the implementation
11541 of these catchpoints. In order to be able to support several
11542 variants of the runtime, we use a sniffer that will determine
11543 the runtime variant used by the program being debugged. */
11545 /* Ada's standard exceptions.
11547 The Ada 83 standard also defined Numeric_Error. But there so many
11548 situations where it was unclear from the Ada 83 Reference Manual
11549 (RM) whether Constraint_Error or Numeric_Error should be raised,
11550 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11551 Interpretation saying that anytime the RM says that Numeric_Error
11552 should be raised, the implementation may raise Constraint_Error.
11553 Ada 95 went one step further and pretty much removed Numeric_Error
11554 from the list of standard exceptions (it made it a renaming of
11555 Constraint_Error, to help preserve compatibility when compiling
11556 an Ada83 compiler). As such, we do not include Numeric_Error from
11557 this list of standard exceptions. */
11559 static char *standard_exc
[] = {
11560 "constraint_error",
11566 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11568 /* A structure that describes how to support exception catchpoints
11569 for a given executable. */
11571 struct exception_support_info
11573 /* The name of the symbol to break on in order to insert
11574 a catchpoint on exceptions. */
11575 const char *catch_exception_sym
;
11577 /* The name of the symbol to break on in order to insert
11578 a catchpoint on unhandled exceptions. */
11579 const char *catch_exception_unhandled_sym
;
11581 /* The name of the symbol to break on in order to insert
11582 a catchpoint on failed assertions. */
11583 const char *catch_assert_sym
;
11585 /* Assuming that the inferior just triggered an unhandled exception
11586 catchpoint, this function is responsible for returning the address
11587 in inferior memory where the name of that exception is stored.
11588 Return zero if the address could not be computed. */
11589 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11592 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11593 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11595 /* The following exception support info structure describes how to
11596 implement exception catchpoints with the latest version of the
11597 Ada runtime (as of 2007-03-06). */
11599 static const struct exception_support_info default_exception_support_info
=
11601 "__gnat_debug_raise_exception", /* catch_exception_sym */
11602 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11603 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11604 ada_unhandled_exception_name_addr
11607 /* The following exception support info structure describes how to
11608 implement exception catchpoints with a slightly older version
11609 of the Ada runtime. */
11611 static const struct exception_support_info exception_support_info_fallback
=
11613 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11614 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11615 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11616 ada_unhandled_exception_name_addr_from_raise
11619 /* Return nonzero if we can detect the exception support routines
11620 described in EINFO.
11622 This function errors out if an abnormal situation is detected
11623 (for instance, if we find the exception support routines, but
11624 that support is found to be incomplete). */
11627 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11629 struct symbol
*sym
;
11631 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11632 that should be compiled with debugging information. As a result, we
11633 expect to find that symbol in the symtabs. */
11635 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11638 /* Perhaps we did not find our symbol because the Ada runtime was
11639 compiled without debugging info, or simply stripped of it.
11640 It happens on some GNU/Linux distributions for instance, where
11641 users have to install a separate debug package in order to get
11642 the runtime's debugging info. In that situation, let the user
11643 know why we cannot insert an Ada exception catchpoint.
11645 Note: Just for the purpose of inserting our Ada exception
11646 catchpoint, we could rely purely on the associated minimal symbol.
11647 But we would be operating in degraded mode anyway, since we are
11648 still lacking the debugging info needed later on to extract
11649 the name of the exception being raised (this name is printed in
11650 the catchpoint message, and is also used when trying to catch
11651 a specific exception). We do not handle this case for now. */
11652 struct bound_minimal_symbol msym
11653 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11655 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11656 error (_("Your Ada runtime appears to be missing some debugging "
11657 "information.\nCannot insert Ada exception catchpoint "
11658 "in this configuration."));
11663 /* Make sure that the symbol we found corresponds to a function. */
11665 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11666 error (_("Symbol \"%s\" is not a function (class = %d)"),
11667 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11672 /* Inspect the Ada runtime and determine which exception info structure
11673 should be used to provide support for exception catchpoints.
11675 This function will always set the per-inferior exception_info,
11676 or raise an error. */
11679 ada_exception_support_info_sniffer (void)
11681 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11683 /* If the exception info is already known, then no need to recompute it. */
11684 if (data
->exception_info
!= NULL
)
11687 /* Check the latest (default) exception support info. */
11688 if (ada_has_this_exception_support (&default_exception_support_info
))
11690 data
->exception_info
= &default_exception_support_info
;
11694 /* Try our fallback exception suport info. */
11695 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11697 data
->exception_info
= &exception_support_info_fallback
;
11701 /* Sometimes, it is normal for us to not be able to find the routine
11702 we are looking for. This happens when the program is linked with
11703 the shared version of the GNAT runtime, and the program has not been
11704 started yet. Inform the user of these two possible causes if
11707 if (ada_update_initial_language (language_unknown
) != language_ada
)
11708 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11710 /* If the symbol does not exist, then check that the program is
11711 already started, to make sure that shared libraries have been
11712 loaded. If it is not started, this may mean that the symbol is
11713 in a shared library. */
11715 if (ptid_get_pid (inferior_ptid
) == 0)
11716 error (_("Unable to insert catchpoint. Try to start the program first."));
11718 /* At this point, we know that we are debugging an Ada program and
11719 that the inferior has been started, but we still are not able to
11720 find the run-time symbols. That can mean that we are in
11721 configurable run time mode, or that a-except as been optimized
11722 out by the linker... In any case, at this point it is not worth
11723 supporting this feature. */
11725 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11728 /* True iff FRAME is very likely to be that of a function that is
11729 part of the runtime system. This is all very heuristic, but is
11730 intended to be used as advice as to what frames are uninteresting
11734 is_known_support_routine (struct frame_info
*frame
)
11736 struct symtab_and_line sal
;
11738 enum language func_lang
;
11740 const char *fullname
;
11742 /* If this code does not have any debugging information (no symtab),
11743 This cannot be any user code. */
11745 find_frame_sal (frame
, &sal
);
11746 if (sal
.symtab
== NULL
)
11749 /* If there is a symtab, but the associated source file cannot be
11750 located, then assume this is not user code: Selecting a frame
11751 for which we cannot display the code would not be very helpful
11752 for the user. This should also take care of case such as VxWorks
11753 where the kernel has some debugging info provided for a few units. */
11755 fullname
= symtab_to_fullname (sal
.symtab
);
11756 if (access (fullname
, R_OK
) != 0)
11759 /* Check the unit filename againt the Ada runtime file naming.
11760 We also check the name of the objfile against the name of some
11761 known system libraries that sometimes come with debugging info
11764 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11766 re_comp (known_runtime_file_name_patterns
[i
]);
11767 if (re_exec (lbasename (sal
.symtab
->filename
)))
11769 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11770 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11774 /* Check whether the function is a GNAT-generated entity. */
11776 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
11777 if (func_name
== NULL
)
11780 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11782 re_comp (known_auxiliary_function_name_patterns
[i
]);
11783 if (re_exec (func_name
))
11794 /* Find the first frame that contains debugging information and that is not
11795 part of the Ada run-time, starting from FI and moving upward. */
11798 ada_find_printable_frame (struct frame_info
*fi
)
11800 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11802 if (!is_known_support_routine (fi
))
11811 /* Assuming that the inferior just triggered an unhandled exception
11812 catchpoint, return the address in inferior memory where the name
11813 of the exception is stored.
11815 Return zero if the address could not be computed. */
11818 ada_unhandled_exception_name_addr (void)
11820 return parse_and_eval_address ("e.full_name");
11823 /* Same as ada_unhandled_exception_name_addr, except that this function
11824 should be used when the inferior uses an older version of the runtime,
11825 where the exception name needs to be extracted from a specific frame
11826 several frames up in the callstack. */
11829 ada_unhandled_exception_name_addr_from_raise (void)
11832 struct frame_info
*fi
;
11833 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11834 struct cleanup
*old_chain
;
11836 /* To determine the name of this exception, we need to select
11837 the frame corresponding to RAISE_SYM_NAME. This frame is
11838 at least 3 levels up, so we simply skip the first 3 frames
11839 without checking the name of their associated function. */
11840 fi
= get_current_frame ();
11841 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11843 fi
= get_prev_frame (fi
);
11845 old_chain
= make_cleanup (null_cleanup
, NULL
);
11849 enum language func_lang
;
11851 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
11852 if (func_name
!= NULL
)
11854 make_cleanup (xfree
, func_name
);
11856 if (strcmp (func_name
,
11857 data
->exception_info
->catch_exception_sym
) == 0)
11858 break; /* We found the frame we were looking for... */
11859 fi
= get_prev_frame (fi
);
11862 do_cleanups (old_chain
);
11868 return parse_and_eval_address ("id.full_name");
11871 /* Assuming the inferior just triggered an Ada exception catchpoint
11872 (of any type), return the address in inferior memory where the name
11873 of the exception is stored, if applicable.
11875 Return zero if the address could not be computed, or if not relevant. */
11878 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11879 struct breakpoint
*b
)
11881 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11885 case ada_catch_exception
:
11886 return (parse_and_eval_address ("e.full_name"));
11889 case ada_catch_exception_unhandled
:
11890 return data
->exception_info
->unhandled_exception_name_addr ();
11893 case ada_catch_assert
:
11894 return 0; /* Exception name is not relevant in this case. */
11898 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11902 return 0; /* Should never be reached. */
11905 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11906 any error that ada_exception_name_addr_1 might cause to be thrown.
11907 When an error is intercepted, a warning with the error message is printed,
11908 and zero is returned. */
11911 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11912 struct breakpoint
*b
)
11914 CORE_ADDR result
= 0;
11918 result
= ada_exception_name_addr_1 (ex
, b
);
11921 CATCH (e
, RETURN_MASK_ERROR
)
11923 warning (_("failed to get exception name: %s"), e
.message
);
11931 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11933 /* Ada catchpoints.
11935 In the case of catchpoints on Ada exceptions, the catchpoint will
11936 stop the target on every exception the program throws. When a user
11937 specifies the name of a specific exception, we translate this
11938 request into a condition expression (in text form), and then parse
11939 it into an expression stored in each of the catchpoint's locations.
11940 We then use this condition to check whether the exception that was
11941 raised is the one the user is interested in. If not, then the
11942 target is resumed again. We store the name of the requested
11943 exception, in order to be able to re-set the condition expression
11944 when symbols change. */
11946 /* An instance of this type is used to represent an Ada catchpoint
11947 breakpoint location. It includes a "struct bp_location" as a kind
11948 of base class; users downcast to "struct bp_location *" when
11951 struct ada_catchpoint_location
11953 /* The base class. */
11954 struct bp_location base
;
11956 /* The condition that checks whether the exception that was raised
11957 is the specific exception the user specified on catchpoint
11959 struct expression
*excep_cond_expr
;
11962 /* Implement the DTOR method in the bp_location_ops structure for all
11963 Ada exception catchpoint kinds. */
11966 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11968 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11970 xfree (al
->excep_cond_expr
);
11973 /* The vtable to be used in Ada catchpoint locations. */
11975 static const struct bp_location_ops ada_catchpoint_location_ops
=
11977 ada_catchpoint_location_dtor
11980 /* An instance of this type is used to represent an Ada catchpoint.
11981 It includes a "struct breakpoint" as a kind of base class; users
11982 downcast to "struct breakpoint *" when needed. */
11984 struct ada_catchpoint
11986 /* The base class. */
11987 struct breakpoint base
;
11989 /* The name of the specific exception the user specified. */
11990 char *excep_string
;
11993 /* Parse the exception condition string in the context of each of the
11994 catchpoint's locations, and store them for later evaluation. */
11997 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11999 struct cleanup
*old_chain
;
12000 struct bp_location
*bl
;
12003 /* Nothing to do if there's no specific exception to catch. */
12004 if (c
->excep_string
== NULL
)
12007 /* Same if there are no locations... */
12008 if (c
->base
.loc
== NULL
)
12011 /* Compute the condition expression in text form, from the specific
12012 expection we want to catch. */
12013 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
12014 old_chain
= make_cleanup (xfree
, cond_string
);
12016 /* Iterate over all the catchpoint's locations, and parse an
12017 expression for each. */
12018 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
12020 struct ada_catchpoint_location
*ada_loc
12021 = (struct ada_catchpoint_location
*) bl
;
12022 struct expression
*exp
= NULL
;
12024 if (!bl
->shlib_disabled
)
12031 exp
= parse_exp_1 (&s
, bl
->address
,
12032 block_for_pc (bl
->address
), 0);
12034 CATCH (e
, RETURN_MASK_ERROR
)
12036 warning (_("failed to reevaluate internal exception condition "
12037 "for catchpoint %d: %s"),
12038 c
->base
.number
, e
.message
);
12039 /* There is a bug in GCC on sparc-solaris when building with
12040 optimization which causes EXP to change unexpectedly
12041 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
12042 The problem should be fixed starting with GCC 4.9.
12043 In the meantime, work around it by forcing EXP back
12050 ada_loc
->excep_cond_expr
= exp
;
12053 do_cleanups (old_chain
);
12056 /* Implement the DTOR method in the breakpoint_ops structure for all
12057 exception catchpoint kinds. */
12060 dtor_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
12062 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12064 xfree (c
->excep_string
);
12066 bkpt_breakpoint_ops
.dtor (b
);
12069 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12070 structure for all exception catchpoint kinds. */
12072 static struct bp_location
*
12073 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
12074 struct breakpoint
*self
)
12076 struct ada_catchpoint_location
*loc
;
12078 loc
= XNEW (struct ada_catchpoint_location
);
12079 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
12080 loc
->excep_cond_expr
= NULL
;
12084 /* Implement the RE_SET method in the breakpoint_ops structure for all
12085 exception catchpoint kinds. */
12088 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
12090 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12092 /* Call the base class's method. This updates the catchpoint's
12094 bkpt_breakpoint_ops
.re_set (b
);
12096 /* Reparse the exception conditional expressions. One for each
12098 create_excep_cond_exprs (c
);
12101 /* Returns true if we should stop for this breakpoint hit. If the
12102 user specified a specific exception, we only want to cause a stop
12103 if the program thrown that exception. */
12106 should_stop_exception (const struct bp_location
*bl
)
12108 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12109 const struct ada_catchpoint_location
*ada_loc
12110 = (const struct ada_catchpoint_location
*) bl
;
12113 /* With no specific exception, should always stop. */
12114 if (c
->excep_string
== NULL
)
12117 if (ada_loc
->excep_cond_expr
== NULL
)
12119 /* We will have a NULL expression if back when we were creating
12120 the expressions, this location's had failed to parse. */
12127 struct value
*mark
;
12129 mark
= value_mark ();
12130 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
12131 value_free_to_mark (mark
);
12133 CATCH (ex
, RETURN_MASK_ALL
)
12135 exception_fprintf (gdb_stderr
, ex
,
12136 _("Error in testing exception condition:\n"));
12143 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12144 for all exception catchpoint kinds. */
12147 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12149 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12152 /* Implement the PRINT_IT method in the breakpoint_ops structure
12153 for all exception catchpoint kinds. */
12155 static enum print_stop_action
12156 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12158 struct ui_out
*uiout
= current_uiout
;
12159 struct breakpoint
*b
= bs
->breakpoint_at
;
12161 annotate_catchpoint (b
->number
);
12163 if (ui_out_is_mi_like_p (uiout
))
12165 ui_out_field_string (uiout
, "reason",
12166 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12167 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
12170 ui_out_text (uiout
,
12171 b
->disposition
== disp_del
? "\nTemporary catchpoint "
12172 : "\nCatchpoint ");
12173 ui_out_field_int (uiout
, "bkptno", b
->number
);
12174 ui_out_text (uiout
, ", ");
12178 case ada_catch_exception
:
12179 case ada_catch_exception_unhandled
:
12181 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
12182 char exception_name
[256];
12186 read_memory (addr
, (gdb_byte
*) exception_name
,
12187 sizeof (exception_name
) - 1);
12188 exception_name
[sizeof (exception_name
) - 1] = '\0';
12192 /* For some reason, we were unable to read the exception
12193 name. This could happen if the Runtime was compiled
12194 without debugging info, for instance. In that case,
12195 just replace the exception name by the generic string
12196 "exception" - it will read as "an exception" in the
12197 notification we are about to print. */
12198 memcpy (exception_name
, "exception", sizeof ("exception"));
12200 /* In the case of unhandled exception breakpoints, we print
12201 the exception name as "unhandled EXCEPTION_NAME", to make
12202 it clearer to the user which kind of catchpoint just got
12203 hit. We used ui_out_text to make sure that this extra
12204 info does not pollute the exception name in the MI case. */
12205 if (ex
== ada_catch_exception_unhandled
)
12206 ui_out_text (uiout
, "unhandled ");
12207 ui_out_field_string (uiout
, "exception-name", exception_name
);
12210 case ada_catch_assert
:
12211 /* In this case, the name of the exception is not really
12212 important. Just print "failed assertion" to make it clearer
12213 that his program just hit an assertion-failure catchpoint.
12214 We used ui_out_text because this info does not belong in
12216 ui_out_text (uiout
, "failed assertion");
12219 ui_out_text (uiout
, " at ");
12220 ada_find_printable_frame (get_current_frame ());
12222 return PRINT_SRC_AND_LOC
;
12225 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12226 for all exception catchpoint kinds. */
12229 print_one_exception (enum ada_exception_catchpoint_kind ex
,
12230 struct breakpoint
*b
, struct bp_location
**last_loc
)
12232 struct ui_out
*uiout
= current_uiout
;
12233 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12234 struct value_print_options opts
;
12236 get_user_print_options (&opts
);
12237 if (opts
.addressprint
)
12239 annotate_field (4);
12240 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
12243 annotate_field (5);
12244 *last_loc
= b
->loc
;
12247 case ada_catch_exception
:
12248 if (c
->excep_string
!= NULL
)
12250 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12252 ui_out_field_string (uiout
, "what", msg
);
12256 ui_out_field_string (uiout
, "what", "all Ada exceptions");
12260 case ada_catch_exception_unhandled
:
12261 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
12264 case ada_catch_assert
:
12265 ui_out_field_string (uiout
, "what", "failed Ada assertions");
12269 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12274 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12275 for all exception catchpoint kinds. */
12278 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12279 struct breakpoint
*b
)
12281 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12282 struct ui_out
*uiout
= current_uiout
;
12284 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
12285 : _("Catchpoint "));
12286 ui_out_field_int (uiout
, "bkptno", b
->number
);
12287 ui_out_text (uiout
, ": ");
12291 case ada_catch_exception
:
12292 if (c
->excep_string
!= NULL
)
12294 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12295 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12297 ui_out_text (uiout
, info
);
12298 do_cleanups (old_chain
);
12301 ui_out_text (uiout
, _("all Ada exceptions"));
12304 case ada_catch_exception_unhandled
:
12305 ui_out_text (uiout
, _("unhandled Ada exceptions"));
12308 case ada_catch_assert
:
12309 ui_out_text (uiout
, _("failed Ada assertions"));
12313 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12318 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12319 for all exception catchpoint kinds. */
12322 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12323 struct breakpoint
*b
, struct ui_file
*fp
)
12325 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12329 case ada_catch_exception
:
12330 fprintf_filtered (fp
, "catch exception");
12331 if (c
->excep_string
!= NULL
)
12332 fprintf_filtered (fp
, " %s", c
->excep_string
);
12335 case ada_catch_exception_unhandled
:
12336 fprintf_filtered (fp
, "catch exception unhandled");
12339 case ada_catch_assert
:
12340 fprintf_filtered (fp
, "catch assert");
12344 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12346 print_recreate_thread (b
, fp
);
12349 /* Virtual table for "catch exception" breakpoints. */
12352 dtor_catch_exception (struct breakpoint
*b
)
12354 dtor_exception (ada_catch_exception
, b
);
12357 static struct bp_location
*
12358 allocate_location_catch_exception (struct breakpoint
*self
)
12360 return allocate_location_exception (ada_catch_exception
, self
);
12364 re_set_catch_exception (struct breakpoint
*b
)
12366 re_set_exception (ada_catch_exception
, b
);
12370 check_status_catch_exception (bpstat bs
)
12372 check_status_exception (ada_catch_exception
, bs
);
12375 static enum print_stop_action
12376 print_it_catch_exception (bpstat bs
)
12378 return print_it_exception (ada_catch_exception
, bs
);
12382 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12384 print_one_exception (ada_catch_exception
, b
, last_loc
);
12388 print_mention_catch_exception (struct breakpoint
*b
)
12390 print_mention_exception (ada_catch_exception
, b
);
12394 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12396 print_recreate_exception (ada_catch_exception
, b
, fp
);
12399 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12401 /* Virtual table for "catch exception unhandled" breakpoints. */
12404 dtor_catch_exception_unhandled (struct breakpoint
*b
)
12406 dtor_exception (ada_catch_exception_unhandled
, b
);
12409 static struct bp_location
*
12410 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12412 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12416 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12418 re_set_exception (ada_catch_exception_unhandled
, b
);
12422 check_status_catch_exception_unhandled (bpstat bs
)
12424 check_status_exception (ada_catch_exception_unhandled
, bs
);
12427 static enum print_stop_action
12428 print_it_catch_exception_unhandled (bpstat bs
)
12430 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12434 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12435 struct bp_location
**last_loc
)
12437 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12441 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12443 print_mention_exception (ada_catch_exception_unhandled
, b
);
12447 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12448 struct ui_file
*fp
)
12450 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12453 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12455 /* Virtual table for "catch assert" breakpoints. */
12458 dtor_catch_assert (struct breakpoint
*b
)
12460 dtor_exception (ada_catch_assert
, b
);
12463 static struct bp_location
*
12464 allocate_location_catch_assert (struct breakpoint
*self
)
12466 return allocate_location_exception (ada_catch_assert
, self
);
12470 re_set_catch_assert (struct breakpoint
*b
)
12472 re_set_exception (ada_catch_assert
, b
);
12476 check_status_catch_assert (bpstat bs
)
12478 check_status_exception (ada_catch_assert
, bs
);
12481 static enum print_stop_action
12482 print_it_catch_assert (bpstat bs
)
12484 return print_it_exception (ada_catch_assert
, bs
);
12488 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12490 print_one_exception (ada_catch_assert
, b
, last_loc
);
12494 print_mention_catch_assert (struct breakpoint
*b
)
12496 print_mention_exception (ada_catch_assert
, b
);
12500 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12502 print_recreate_exception (ada_catch_assert
, b
, fp
);
12505 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12507 /* Return a newly allocated copy of the first space-separated token
12508 in ARGSP, and then adjust ARGSP to point immediately after that
12511 Return NULL if ARGPS does not contain any more tokens. */
12514 ada_get_next_arg (char **argsp
)
12516 char *args
= *argsp
;
12520 args
= skip_spaces (args
);
12521 if (args
[0] == '\0')
12522 return NULL
; /* No more arguments. */
12524 /* Find the end of the current argument. */
12526 end
= skip_to_space (args
);
12528 /* Adjust ARGSP to point to the start of the next argument. */
12532 /* Make a copy of the current argument and return it. */
12534 result
= xmalloc (end
- args
+ 1);
12535 strncpy (result
, args
, end
- args
);
12536 result
[end
- args
] = '\0';
12541 /* Split the arguments specified in a "catch exception" command.
12542 Set EX to the appropriate catchpoint type.
12543 Set EXCEP_STRING to the name of the specific exception if
12544 specified by the user.
12545 If a condition is found at the end of the arguments, the condition
12546 expression is stored in COND_STRING (memory must be deallocated
12547 after use). Otherwise COND_STRING is set to NULL. */
12550 catch_ada_exception_command_split (char *args
,
12551 enum ada_exception_catchpoint_kind
*ex
,
12552 char **excep_string
,
12553 char **cond_string
)
12555 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12556 char *exception_name
;
12559 exception_name
= ada_get_next_arg (&args
);
12560 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12562 /* This is not an exception name; this is the start of a condition
12563 expression for a catchpoint on all exceptions. So, "un-get"
12564 this token, and set exception_name to NULL. */
12565 xfree (exception_name
);
12566 exception_name
= NULL
;
12569 make_cleanup (xfree
, exception_name
);
12571 /* Check to see if we have a condition. */
12573 args
= skip_spaces (args
);
12574 if (startswith (args
, "if")
12575 && (isspace (args
[2]) || args
[2] == '\0'))
12578 args
= skip_spaces (args
);
12580 if (args
[0] == '\0')
12581 error (_("Condition missing after `if' keyword"));
12582 cond
= xstrdup (args
);
12583 make_cleanup (xfree
, cond
);
12585 args
+= strlen (args
);
12588 /* Check that we do not have any more arguments. Anything else
12591 if (args
[0] != '\0')
12592 error (_("Junk at end of expression"));
12594 discard_cleanups (old_chain
);
12596 if (exception_name
== NULL
)
12598 /* Catch all exceptions. */
12599 *ex
= ada_catch_exception
;
12600 *excep_string
= NULL
;
12602 else if (strcmp (exception_name
, "unhandled") == 0)
12604 /* Catch unhandled exceptions. */
12605 *ex
= ada_catch_exception_unhandled
;
12606 *excep_string
= NULL
;
12610 /* Catch a specific exception. */
12611 *ex
= ada_catch_exception
;
12612 *excep_string
= exception_name
;
12614 *cond_string
= cond
;
12617 /* Return the name of the symbol on which we should break in order to
12618 implement a catchpoint of the EX kind. */
12620 static const char *
12621 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12623 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12625 gdb_assert (data
->exception_info
!= NULL
);
12629 case ada_catch_exception
:
12630 return (data
->exception_info
->catch_exception_sym
);
12632 case ada_catch_exception_unhandled
:
12633 return (data
->exception_info
->catch_exception_unhandled_sym
);
12635 case ada_catch_assert
:
12636 return (data
->exception_info
->catch_assert_sym
);
12639 internal_error (__FILE__
, __LINE__
,
12640 _("unexpected catchpoint kind (%d)"), ex
);
12644 /* Return the breakpoint ops "virtual table" used for catchpoints
12647 static const struct breakpoint_ops
*
12648 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12652 case ada_catch_exception
:
12653 return (&catch_exception_breakpoint_ops
);
12655 case ada_catch_exception_unhandled
:
12656 return (&catch_exception_unhandled_breakpoint_ops
);
12658 case ada_catch_assert
:
12659 return (&catch_assert_breakpoint_ops
);
12662 internal_error (__FILE__
, __LINE__
,
12663 _("unexpected catchpoint kind (%d)"), ex
);
12667 /* Return the condition that will be used to match the current exception
12668 being raised with the exception that the user wants to catch. This
12669 assumes that this condition is used when the inferior just triggered
12670 an exception catchpoint.
12672 The string returned is a newly allocated string that needs to be
12673 deallocated later. */
12676 ada_exception_catchpoint_cond_string (const char *excep_string
)
12680 /* The standard exceptions are a special case. They are defined in
12681 runtime units that have been compiled without debugging info; if
12682 EXCEP_STRING is the not-fully-qualified name of a standard
12683 exception (e.g. "constraint_error") then, during the evaluation
12684 of the condition expression, the symbol lookup on this name would
12685 *not* return this standard exception. The catchpoint condition
12686 may then be set only on user-defined exceptions which have the
12687 same not-fully-qualified name (e.g. my_package.constraint_error).
12689 To avoid this unexcepted behavior, these standard exceptions are
12690 systematically prefixed by "standard". This means that "catch
12691 exception constraint_error" is rewritten into "catch exception
12692 standard.constraint_error".
12694 If an exception named contraint_error is defined in another package of
12695 the inferior program, then the only way to specify this exception as a
12696 breakpoint condition is to use its fully-qualified named:
12697 e.g. my_package.constraint_error. */
12699 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12701 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12703 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12707 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12710 /* Return the symtab_and_line that should be used to insert an exception
12711 catchpoint of the TYPE kind.
12713 EXCEP_STRING should contain the name of a specific exception that
12714 the catchpoint should catch, or NULL otherwise.
12716 ADDR_STRING returns the name of the function where the real
12717 breakpoint that implements the catchpoints is set, depending on the
12718 type of catchpoint we need to create. */
12720 static struct symtab_and_line
12721 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12722 char **addr_string
, const struct breakpoint_ops
**ops
)
12724 const char *sym_name
;
12725 struct symbol
*sym
;
12727 /* First, find out which exception support info to use. */
12728 ada_exception_support_info_sniffer ();
12730 /* Then lookup the function on which we will break in order to catch
12731 the Ada exceptions requested by the user. */
12732 sym_name
= ada_exception_sym_name (ex
);
12733 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12735 /* We can assume that SYM is not NULL at this stage. If the symbol
12736 did not exist, ada_exception_support_info_sniffer would have
12737 raised an exception.
12739 Also, ada_exception_support_info_sniffer should have already
12740 verified that SYM is a function symbol. */
12741 gdb_assert (sym
!= NULL
);
12742 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12744 /* Set ADDR_STRING. */
12745 *addr_string
= xstrdup (sym_name
);
12748 *ops
= ada_exception_breakpoint_ops (ex
);
12750 return find_function_start_sal (sym
, 1);
12753 /* Create an Ada exception catchpoint.
12755 EX_KIND is the kind of exception catchpoint to be created.
12757 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12758 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12759 of the exception to which this catchpoint applies. When not NULL,
12760 the string must be allocated on the heap, and its deallocation
12761 is no longer the responsibility of the caller.
12763 COND_STRING, if not NULL, is the catchpoint condition. This string
12764 must be allocated on the heap, and its deallocation is no longer
12765 the responsibility of the caller.
12767 TEMPFLAG, if nonzero, means that the underlying breakpoint
12768 should be temporary.
12770 FROM_TTY is the usual argument passed to all commands implementations. */
12773 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12774 enum ada_exception_catchpoint_kind ex_kind
,
12775 char *excep_string
,
12781 struct ada_catchpoint
*c
;
12782 char *addr_string
= NULL
;
12783 const struct breakpoint_ops
*ops
= NULL
;
12784 struct symtab_and_line sal
12785 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12787 c
= XNEW (struct ada_catchpoint
);
12788 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
12789 ops
, tempflag
, disabled
, from_tty
);
12790 c
->excep_string
= excep_string
;
12791 create_excep_cond_exprs (c
);
12792 if (cond_string
!= NULL
)
12793 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
12794 install_breakpoint (0, &c
->base
, 1);
12797 /* Implement the "catch exception" command. */
12800 catch_ada_exception_command (char *arg
, int from_tty
,
12801 struct cmd_list_element
*command
)
12803 struct gdbarch
*gdbarch
= get_current_arch ();
12805 enum ada_exception_catchpoint_kind ex_kind
;
12806 char *excep_string
= NULL
;
12807 char *cond_string
= NULL
;
12809 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12813 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12815 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12816 excep_string
, cond_string
,
12817 tempflag
, 1 /* enabled */,
12821 /* Split the arguments specified in a "catch assert" command.
12823 ARGS contains the command's arguments (or the empty string if
12824 no arguments were passed).
12826 If ARGS contains a condition, set COND_STRING to that condition
12827 (the memory needs to be deallocated after use). */
12830 catch_ada_assert_command_split (char *args
, char **cond_string
)
12832 args
= skip_spaces (args
);
12834 /* Check whether a condition was provided. */
12835 if (startswith (args
, "if")
12836 && (isspace (args
[2]) || args
[2] == '\0'))
12839 args
= skip_spaces (args
);
12840 if (args
[0] == '\0')
12841 error (_("condition missing after `if' keyword"));
12842 *cond_string
= xstrdup (args
);
12845 /* Otherwise, there should be no other argument at the end of
12847 else if (args
[0] != '\0')
12848 error (_("Junk at end of arguments."));
12851 /* Implement the "catch assert" command. */
12854 catch_assert_command (char *arg
, int from_tty
,
12855 struct cmd_list_element
*command
)
12857 struct gdbarch
*gdbarch
= get_current_arch ();
12859 char *cond_string
= NULL
;
12861 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12865 catch_ada_assert_command_split (arg
, &cond_string
);
12866 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12868 tempflag
, 1 /* enabled */,
12872 /* Return non-zero if the symbol SYM is an Ada exception object. */
12875 ada_is_exception_sym (struct symbol
*sym
)
12877 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
12879 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12880 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12881 && SYMBOL_CLASS (sym
) != LOC_CONST
12882 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12883 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12886 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12887 Ada exception object. This matches all exceptions except the ones
12888 defined by the Ada language. */
12891 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12895 if (!ada_is_exception_sym (sym
))
12898 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12899 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
12900 return 0; /* A standard exception. */
12902 /* Numeric_Error is also a standard exception, so exclude it.
12903 See the STANDARD_EXC description for more details as to why
12904 this exception is not listed in that array. */
12905 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
12911 /* A helper function for qsort, comparing two struct ada_exc_info
12914 The comparison is determined first by exception name, and then
12915 by exception address. */
12918 compare_ada_exception_info (const void *a
, const void *b
)
12920 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
12921 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
12924 result
= strcmp (exc_a
->name
, exc_b
->name
);
12928 if (exc_a
->addr
< exc_b
->addr
)
12930 if (exc_a
->addr
> exc_b
->addr
)
12936 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12937 routine, but keeping the first SKIP elements untouched.
12939 All duplicates are also removed. */
12942 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
12945 struct ada_exc_info
*to_sort
12946 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
12948 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
12951 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
12952 compare_ada_exception_info
);
12954 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
12955 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
12956 to_sort
[j
++] = to_sort
[i
];
12958 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
12961 /* A function intended as the "name_matcher" callback in the struct
12962 quick_symbol_functions' expand_symtabs_matching method.
12964 SEARCH_NAME is the symbol's search name.
12966 If USER_DATA is not NULL, it is a pointer to a regext_t object
12967 used to match the symbol (by natural name). Otherwise, when USER_DATA
12968 is null, no filtering is performed, and all symbols are a positive
12972 ada_exc_search_name_matches (const char *search_name
, void *user_data
)
12974 regex_t
*preg
= user_data
;
12979 /* In Ada, the symbol "search name" is a linkage name, whereas
12980 the regular expression used to do the matching refers to
12981 the natural name. So match against the decoded name. */
12982 return (regexec (preg
, ada_decode (search_name
), 0, NULL
, 0) == 0);
12985 /* Add all exceptions defined by the Ada standard whose name match
12986 a regular expression.
12988 If PREG is not NULL, then this regexp_t object is used to
12989 perform the symbol name matching. Otherwise, no name-based
12990 filtering is performed.
12992 EXCEPTIONS is a vector of exceptions to which matching exceptions
12996 ada_add_standard_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
13000 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13003 || regexec (preg
, standard_exc
[i
], 0, NULL
, 0) == 0)
13005 struct bound_minimal_symbol msymbol
13006 = ada_lookup_simple_minsym (standard_exc
[i
]);
13008 if (msymbol
.minsym
!= NULL
)
13010 struct ada_exc_info info
13011 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13013 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13019 /* Add all Ada exceptions defined locally and accessible from the given
13022 If PREG is not NULL, then this regexp_t object is used to
13023 perform the symbol name matching. Otherwise, no name-based
13024 filtering is performed.
13026 EXCEPTIONS is a vector of exceptions to which matching exceptions
13030 ada_add_exceptions_from_frame (regex_t
*preg
, struct frame_info
*frame
,
13031 VEC(ada_exc_info
) **exceptions
)
13033 const struct block
*block
= get_frame_block (frame
, 0);
13037 struct block_iterator iter
;
13038 struct symbol
*sym
;
13040 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13042 switch (SYMBOL_CLASS (sym
))
13049 if (ada_is_exception_sym (sym
))
13051 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
13052 SYMBOL_VALUE_ADDRESS (sym
)};
13054 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13058 if (BLOCK_FUNCTION (block
) != NULL
)
13060 block
= BLOCK_SUPERBLOCK (block
);
13064 /* Add all exceptions defined globally whose name name match
13065 a regular expression, excluding standard exceptions.
13067 The reason we exclude standard exceptions is that they need
13068 to be handled separately: Standard exceptions are defined inside
13069 a runtime unit which is normally not compiled with debugging info,
13070 and thus usually do not show up in our symbol search. However,
13071 if the unit was in fact built with debugging info, we need to
13072 exclude them because they would duplicate the entry we found
13073 during the special loop that specifically searches for those
13074 standard exceptions.
13076 If PREG is not NULL, then this regexp_t object is used to
13077 perform the symbol name matching. Otherwise, no name-based
13078 filtering is performed.
13080 EXCEPTIONS is a vector of exceptions to which matching exceptions
13084 ada_add_global_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
13086 struct objfile
*objfile
;
13087 struct compunit_symtab
*s
;
13089 expand_symtabs_matching (NULL
, ada_exc_search_name_matches
, NULL
,
13090 VARIABLES_DOMAIN
, preg
);
13092 ALL_COMPUNITS (objfile
, s
)
13094 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13097 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13099 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13100 struct block_iterator iter
;
13101 struct symbol
*sym
;
13103 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13104 if (ada_is_non_standard_exception_sym (sym
)
13106 || regexec (preg
, SYMBOL_NATURAL_NAME (sym
),
13109 struct ada_exc_info info
13110 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
13112 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13118 /* Implements ada_exceptions_list with the regular expression passed
13119 as a regex_t, rather than a string.
13121 If not NULL, PREG is used to filter out exceptions whose names
13122 do not match. Otherwise, all exceptions are listed. */
13124 static VEC(ada_exc_info
) *
13125 ada_exceptions_list_1 (regex_t
*preg
)
13127 VEC(ada_exc_info
) *result
= NULL
;
13128 struct cleanup
*old_chain
13129 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
13132 /* First, list the known standard exceptions. These exceptions
13133 need to be handled separately, as they are usually defined in
13134 runtime units that have been compiled without debugging info. */
13136 ada_add_standard_exceptions (preg
, &result
);
13138 /* Next, find all exceptions whose scope is local and accessible
13139 from the currently selected frame. */
13141 if (has_stack_frames ())
13143 prev_len
= VEC_length (ada_exc_info
, result
);
13144 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13146 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13147 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13150 /* Add all exceptions whose scope is global. */
13152 prev_len
= VEC_length (ada_exc_info
, result
);
13153 ada_add_global_exceptions (preg
, &result
);
13154 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13155 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13157 discard_cleanups (old_chain
);
13161 /* Return a vector of ada_exc_info.
13163 If REGEXP is NULL, all exceptions are included in the result.
13164 Otherwise, it should contain a valid regular expression,
13165 and only the exceptions whose names match that regular expression
13166 are included in the result.
13168 The exceptions are sorted in the following order:
13169 - Standard exceptions (defined by the Ada language), in
13170 alphabetical order;
13171 - Exceptions only visible from the current frame, in
13172 alphabetical order;
13173 - Exceptions whose scope is global, in alphabetical order. */
13175 VEC(ada_exc_info
) *
13176 ada_exceptions_list (const char *regexp
)
13178 VEC(ada_exc_info
) *result
= NULL
;
13179 struct cleanup
*old_chain
= NULL
;
13182 if (regexp
!= NULL
)
13183 old_chain
= compile_rx_or_error (®
, regexp
,
13184 _("invalid regular expression"));
13186 result
= ada_exceptions_list_1 (regexp
!= NULL
? ®
: NULL
);
13188 if (old_chain
!= NULL
)
13189 do_cleanups (old_chain
);
13193 /* Implement the "info exceptions" command. */
13196 info_exceptions_command (char *regexp
, int from_tty
)
13198 VEC(ada_exc_info
) *exceptions
;
13199 struct cleanup
*cleanup
;
13200 struct gdbarch
*gdbarch
= get_current_arch ();
13202 struct ada_exc_info
*info
;
13204 exceptions
= ada_exceptions_list (regexp
);
13205 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
13207 if (regexp
!= NULL
)
13209 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13211 printf_filtered (_("All defined Ada exceptions:\n"));
13213 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
13214 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
13216 do_cleanups (cleanup
);
13220 /* Information about operators given special treatment in functions
13222 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13224 #define ADA_OPERATORS \
13225 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13226 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13227 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13228 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13229 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13230 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13231 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13232 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13233 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13234 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13235 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13236 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13237 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13238 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13239 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13240 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13241 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13242 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13243 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13246 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13249 switch (exp
->elts
[pc
- 1].opcode
)
13252 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13255 #define OP_DEFN(op, len, args, binop) \
13256 case op: *oplenp = len; *argsp = args; break;
13262 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13267 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13272 /* Implementation of the exp_descriptor method operator_check. */
13275 ada_operator_check (struct expression
*exp
, int pos
,
13276 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13279 const union exp_element
*const elts
= exp
->elts
;
13280 struct type
*type
= NULL
;
13282 switch (elts
[pos
].opcode
)
13284 case UNOP_IN_RANGE
:
13286 type
= elts
[pos
+ 1].type
;
13290 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13293 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13295 if (type
&& TYPE_OBJFILE (type
)
13296 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13303 ada_op_name (enum exp_opcode opcode
)
13308 return op_name_standard (opcode
);
13310 #define OP_DEFN(op, len, args, binop) case op: return #op;
13315 return "OP_AGGREGATE";
13317 return "OP_CHOICES";
13323 /* As for operator_length, but assumes PC is pointing at the first
13324 element of the operator, and gives meaningful results only for the
13325 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13328 ada_forward_operator_length (struct expression
*exp
, int pc
,
13329 int *oplenp
, int *argsp
)
13331 switch (exp
->elts
[pc
].opcode
)
13334 *oplenp
= *argsp
= 0;
13337 #define OP_DEFN(op, len, args, binop) \
13338 case op: *oplenp = len; *argsp = args; break;
13344 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13349 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13355 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13357 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13365 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13367 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13372 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13376 /* Ada attributes ('Foo). */
13379 case OP_ATR_LENGTH
:
13383 case OP_ATR_MODULUS
:
13390 case UNOP_IN_RANGE
:
13392 /* XXX: gdb_sprint_host_address, type_sprint */
13393 fprintf_filtered (stream
, _("Type @"));
13394 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13395 fprintf_filtered (stream
, " (");
13396 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13397 fprintf_filtered (stream
, ")");
13399 case BINOP_IN_BOUNDS
:
13400 fprintf_filtered (stream
, " (%d)",
13401 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13403 case TERNOP_IN_RANGE
:
13408 case OP_DISCRETE_RANGE
:
13409 case OP_POSITIONAL
:
13416 char *name
= &exp
->elts
[elt
+ 2].string
;
13417 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13419 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13424 return dump_subexp_body_standard (exp
, stream
, elt
);
13428 for (i
= 0; i
< nargs
; i
+= 1)
13429 elt
= dump_subexp (exp
, stream
, elt
);
13434 /* The Ada extension of print_subexp (q.v.). */
13437 ada_print_subexp (struct expression
*exp
, int *pos
,
13438 struct ui_file
*stream
, enum precedence prec
)
13440 int oplen
, nargs
, i
;
13442 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13444 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13451 print_subexp_standard (exp
, pos
, stream
, prec
);
13455 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13458 case BINOP_IN_BOUNDS
:
13459 /* XXX: sprint_subexp */
13460 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13461 fputs_filtered (" in ", stream
);
13462 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13463 fputs_filtered ("'range", stream
);
13464 if (exp
->elts
[pc
+ 1].longconst
> 1)
13465 fprintf_filtered (stream
, "(%ld)",
13466 (long) exp
->elts
[pc
+ 1].longconst
);
13469 case TERNOP_IN_RANGE
:
13470 if (prec
>= PREC_EQUAL
)
13471 fputs_filtered ("(", stream
);
13472 /* XXX: sprint_subexp */
13473 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13474 fputs_filtered (" in ", stream
);
13475 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13476 fputs_filtered (" .. ", stream
);
13477 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13478 if (prec
>= PREC_EQUAL
)
13479 fputs_filtered (")", stream
);
13484 case OP_ATR_LENGTH
:
13488 case OP_ATR_MODULUS
:
13493 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13495 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13496 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13497 &type_print_raw_options
);
13501 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13502 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13507 for (tem
= 1; tem
< nargs
; tem
+= 1)
13509 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13510 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13512 fputs_filtered (")", stream
);
13517 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13518 fputs_filtered ("'(", stream
);
13519 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13520 fputs_filtered (")", stream
);
13523 case UNOP_IN_RANGE
:
13524 /* XXX: sprint_subexp */
13525 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13526 fputs_filtered (" in ", stream
);
13527 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13528 &type_print_raw_options
);
13531 case OP_DISCRETE_RANGE
:
13532 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13533 fputs_filtered ("..", stream
);
13534 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13538 fputs_filtered ("others => ", stream
);
13539 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13543 for (i
= 0; i
< nargs
-1; i
+= 1)
13546 fputs_filtered ("|", stream
);
13547 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13549 fputs_filtered (" => ", stream
);
13550 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13553 case OP_POSITIONAL
:
13554 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13558 fputs_filtered ("(", stream
);
13559 for (i
= 0; i
< nargs
; i
+= 1)
13562 fputs_filtered (", ", stream
);
13563 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13565 fputs_filtered (")", stream
);
13570 /* Table mapping opcodes into strings for printing operators
13571 and precedences of the operators. */
13573 static const struct op_print ada_op_print_tab
[] = {
13574 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13575 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13576 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13577 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13578 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13579 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13580 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13581 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13582 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13583 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13584 {">", BINOP_GTR
, PREC_ORDER
, 0},
13585 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13586 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13587 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13588 {"+", BINOP_ADD
, PREC_ADD
, 0},
13589 {"-", BINOP_SUB
, PREC_ADD
, 0},
13590 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13591 {"*", BINOP_MUL
, PREC_MUL
, 0},
13592 {"/", BINOP_DIV
, PREC_MUL
, 0},
13593 {"rem", BINOP_REM
, PREC_MUL
, 0},
13594 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13595 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13596 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13597 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13598 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13599 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13600 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13601 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13602 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13603 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13604 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13608 enum ada_primitive_types
{
13609 ada_primitive_type_int
,
13610 ada_primitive_type_long
,
13611 ada_primitive_type_short
,
13612 ada_primitive_type_char
,
13613 ada_primitive_type_float
,
13614 ada_primitive_type_double
,
13615 ada_primitive_type_void
,
13616 ada_primitive_type_long_long
,
13617 ada_primitive_type_long_double
,
13618 ada_primitive_type_natural
,
13619 ada_primitive_type_positive
,
13620 ada_primitive_type_system_address
,
13621 nr_ada_primitive_types
13625 ada_language_arch_info (struct gdbarch
*gdbarch
,
13626 struct language_arch_info
*lai
)
13628 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13630 lai
->primitive_type_vector
13631 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13634 lai
->primitive_type_vector
[ada_primitive_type_int
]
13635 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13637 lai
->primitive_type_vector
[ada_primitive_type_long
]
13638 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13639 0, "long_integer");
13640 lai
->primitive_type_vector
[ada_primitive_type_short
]
13641 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13642 0, "short_integer");
13643 lai
->string_char_type
13644 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13645 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13646 lai
->primitive_type_vector
[ada_primitive_type_float
]
13647 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13649 lai
->primitive_type_vector
[ada_primitive_type_double
]
13650 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13651 "long_float", NULL
);
13652 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13653 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13654 0, "long_long_integer");
13655 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13656 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13657 "long_long_float", NULL
);
13658 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13659 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13661 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13662 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13664 lai
->primitive_type_vector
[ada_primitive_type_void
]
13665 = builtin
->builtin_void
;
13667 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13668 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13669 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13670 = "system__address";
13672 lai
->bool_type_symbol
= NULL
;
13673 lai
->bool_type_default
= builtin
->builtin_bool
;
13676 /* Language vector */
13678 /* Not really used, but needed in the ada_language_defn. */
13681 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13683 ada_emit_char (c
, type
, stream
, quoter
, 1);
13687 parse (struct parser_state
*ps
)
13689 warnings_issued
= 0;
13690 return ada_parse (ps
);
13693 static const struct exp_descriptor ada_exp_descriptor
= {
13695 ada_operator_length
,
13696 ada_operator_check
,
13698 ada_dump_subexp_body
,
13699 ada_evaluate_subexp
13702 /* Implement the "la_get_symbol_name_cmp" language_defn method
13705 static symbol_name_cmp_ftype
13706 ada_get_symbol_name_cmp (const char *lookup_name
)
13708 if (should_use_wild_match (lookup_name
))
13711 return compare_names
;
13714 /* Implement the "la_read_var_value" language_defn method for Ada. */
13716 static struct value
*
13717 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
13719 const struct block
*frame_block
= NULL
;
13720 struct symbol
*renaming_sym
= NULL
;
13722 /* The only case where default_read_var_value is not sufficient
13723 is when VAR is a renaming... */
13725 frame_block
= get_frame_block (frame
, NULL
);
13727 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13728 if (renaming_sym
!= NULL
)
13729 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13731 /* This is a typical case where we expect the default_read_var_value
13732 function to work. */
13733 return default_read_var_value (var
, frame
);
13736 const struct language_defn ada_language_defn
= {
13737 "ada", /* Language name */
13741 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13742 that's not quite what this means. */
13744 macro_expansion_no
,
13745 &ada_exp_descriptor
,
13749 ada_printchar
, /* Print a character constant */
13750 ada_printstr
, /* Function to print string constant */
13751 emit_char
, /* Function to print single char (not used) */
13752 ada_print_type
, /* Print a type using appropriate syntax */
13753 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13754 ada_val_print
, /* Print a value using appropriate syntax */
13755 ada_value_print
, /* Print a top-level value */
13756 ada_read_var_value
, /* la_read_var_value */
13757 NULL
, /* Language specific skip_trampoline */
13758 NULL
, /* name_of_this */
13759 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13760 basic_lookup_transparent_type
, /* lookup_transparent_type */
13761 ada_la_decode
, /* Language specific symbol demangler */
13762 NULL
, /* Language specific
13763 class_name_from_physname */
13764 ada_op_print_tab
, /* expression operators for printing */
13765 0, /* c-style arrays */
13766 1, /* String lower bound */
13767 ada_get_gdb_completer_word_break_characters
,
13768 ada_make_symbol_completion_list
,
13769 ada_language_arch_info
,
13770 ada_print_array_index
,
13771 default_pass_by_reference
,
13773 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13774 ada_iterate_over_symbols
,
13781 /* Provide a prototype to silence -Wmissing-prototypes. */
13782 extern initialize_file_ftype _initialize_ada_language
;
13784 /* Command-list for the "set/show ada" prefix command. */
13785 static struct cmd_list_element
*set_ada_list
;
13786 static struct cmd_list_element
*show_ada_list
;
13788 /* Implement the "set ada" prefix command. */
13791 set_ada_command (char *arg
, int from_tty
)
13793 printf_unfiltered (_(\
13794 "\"set ada\" must be followed by the name of a setting.\n"));
13795 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
13798 /* Implement the "show ada" prefix command. */
13801 show_ada_command (char *args
, int from_tty
)
13803 cmd_show_list (show_ada_list
, from_tty
, "");
13807 initialize_ada_catchpoint_ops (void)
13809 struct breakpoint_ops
*ops
;
13811 initialize_breakpoint_ops ();
13813 ops
= &catch_exception_breakpoint_ops
;
13814 *ops
= bkpt_breakpoint_ops
;
13815 ops
->dtor
= dtor_catch_exception
;
13816 ops
->allocate_location
= allocate_location_catch_exception
;
13817 ops
->re_set
= re_set_catch_exception
;
13818 ops
->check_status
= check_status_catch_exception
;
13819 ops
->print_it
= print_it_catch_exception
;
13820 ops
->print_one
= print_one_catch_exception
;
13821 ops
->print_mention
= print_mention_catch_exception
;
13822 ops
->print_recreate
= print_recreate_catch_exception
;
13824 ops
= &catch_exception_unhandled_breakpoint_ops
;
13825 *ops
= bkpt_breakpoint_ops
;
13826 ops
->dtor
= dtor_catch_exception_unhandled
;
13827 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
13828 ops
->re_set
= re_set_catch_exception_unhandled
;
13829 ops
->check_status
= check_status_catch_exception_unhandled
;
13830 ops
->print_it
= print_it_catch_exception_unhandled
;
13831 ops
->print_one
= print_one_catch_exception_unhandled
;
13832 ops
->print_mention
= print_mention_catch_exception_unhandled
;
13833 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
13835 ops
= &catch_assert_breakpoint_ops
;
13836 *ops
= bkpt_breakpoint_ops
;
13837 ops
->dtor
= dtor_catch_assert
;
13838 ops
->allocate_location
= allocate_location_catch_assert
;
13839 ops
->re_set
= re_set_catch_assert
;
13840 ops
->check_status
= check_status_catch_assert
;
13841 ops
->print_it
= print_it_catch_assert
;
13842 ops
->print_one
= print_one_catch_assert
;
13843 ops
->print_mention
= print_mention_catch_assert
;
13844 ops
->print_recreate
= print_recreate_catch_assert
;
13847 /* This module's 'new_objfile' observer. */
13850 ada_new_objfile_observer (struct objfile
*objfile
)
13852 ada_clear_symbol_cache ();
13855 /* This module's 'free_objfile' observer. */
13858 ada_free_objfile_observer (struct objfile
*objfile
)
13860 ada_clear_symbol_cache ();
13864 _initialize_ada_language (void)
13866 add_language (&ada_language_defn
);
13868 initialize_ada_catchpoint_ops ();
13870 add_prefix_cmd ("ada", no_class
, set_ada_command
,
13871 _("Prefix command for changing Ada-specfic settings"),
13872 &set_ada_list
, "set ada ", 0, &setlist
);
13874 add_prefix_cmd ("ada", no_class
, show_ada_command
,
13875 _("Generic command for showing Ada-specific settings."),
13876 &show_ada_list
, "show ada ", 0, &showlist
);
13878 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
13879 &trust_pad_over_xvs
, _("\
13880 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13881 Show whether an optimization trusting PAD types over XVS types is activated"),
13883 This is related to the encoding used by the GNAT compiler. The debugger\n\
13884 should normally trust the contents of PAD types, but certain older versions\n\
13885 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13886 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13887 work around this bug. It is always safe to turn this option \"off\", but\n\
13888 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13889 this option to \"off\" unless necessary."),
13890 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13892 add_catch_command ("exception", _("\
13893 Catch Ada exceptions, when raised.\n\
13894 With an argument, catch only exceptions with the given name."),
13895 catch_ada_exception_command
,
13899 add_catch_command ("assert", _("\
13900 Catch failed Ada assertions, when raised.\n\
13901 With an argument, catch only exceptions with the given name."),
13902 catch_assert_command
,
13907 varsize_limit
= 65536;
13909 add_info ("exceptions", info_exceptions_command
,
13911 List all Ada exception names.\n\
13912 If a regular expression is passed as an argument, only those matching\n\
13913 the regular expression are listed."));
13915 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
13916 _("Set Ada maintenance-related variables."),
13917 &maint_set_ada_cmdlist
, "maintenance set ada ",
13918 0/*allow-unknown*/, &maintenance_set_cmdlist
);
13920 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
13921 _("Show Ada maintenance-related variables"),
13922 &maint_show_ada_cmdlist
, "maintenance show ada ",
13923 0/*allow-unknown*/, &maintenance_show_cmdlist
);
13925 add_setshow_boolean_cmd
13926 ("ignore-descriptive-types", class_maintenance
,
13927 &ada_ignore_descriptive_types_p
,
13928 _("Set whether descriptive types generated by GNAT should be ignored."),
13929 _("Show whether descriptive types generated by GNAT should be ignored."),
13931 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13932 DWARF attribute."),
13933 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
13935 obstack_init (&symbol_list_obstack
);
13937 decoded_names_store
= htab_create_alloc
13938 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
13939 NULL
, xcalloc
, xfree
);
13941 /* The ada-lang observers. */
13942 observer_attach_new_objfile (ada_new_objfile_observer
);
13943 observer_attach_free_objfile (ada_free_objfile_observer
);
13944 observer_attach_inferior_exit (ada_inferior_exit
);
13946 /* Setup various context-specific data. */
13948 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
13949 ada_pspace_data_handle
13950 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);