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
;
2547 accum
>>= HOST_CHAR_BIT
;
2552 if (is_dynamic_type (value_type (v
)))
2553 v
= value_from_contents_and_address (value_type (v
), value_contents (v
),
2558 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2559 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2562 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2563 int src_offset
, int n
, int bits_big_endian_p
)
2565 unsigned int accum
, mask
;
2566 int accum_bits
, chunk_size
;
2568 target
+= targ_offset
/ HOST_CHAR_BIT
;
2569 targ_offset
%= HOST_CHAR_BIT
;
2570 source
+= src_offset
/ HOST_CHAR_BIT
;
2571 src_offset
%= HOST_CHAR_BIT
;
2572 if (bits_big_endian_p
)
2574 accum
= (unsigned char) *source
;
2576 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2582 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2583 accum_bits
+= HOST_CHAR_BIT
;
2585 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2588 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2589 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2592 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2594 accum_bits
-= chunk_size
;
2601 accum
= (unsigned char) *source
>> src_offset
;
2603 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2607 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2608 accum_bits
+= HOST_CHAR_BIT
;
2610 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2613 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2614 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2616 accum_bits
-= chunk_size
;
2617 accum
>>= chunk_size
;
2624 /* Store the contents of FROMVAL into the location of TOVAL.
2625 Return a new value with the location of TOVAL and contents of
2626 FROMVAL. Handles assignment into packed fields that have
2627 floating-point or non-scalar types. */
2629 static struct value
*
2630 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2632 struct type
*type
= value_type (toval
);
2633 int bits
= value_bitsize (toval
);
2635 toval
= ada_coerce_ref (toval
);
2636 fromval
= ada_coerce_ref (fromval
);
2638 if (ada_is_direct_array_type (value_type (toval
)))
2639 toval
= ada_coerce_to_simple_array (toval
);
2640 if (ada_is_direct_array_type (value_type (fromval
)))
2641 fromval
= ada_coerce_to_simple_array (fromval
);
2643 if (!deprecated_value_modifiable (toval
))
2644 error (_("Left operand of assignment is not a modifiable lvalue."));
2646 if (VALUE_LVAL (toval
) == lval_memory
2648 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2649 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2651 int len
= (value_bitpos (toval
)
2652 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2654 gdb_byte
*buffer
= alloca (len
);
2656 CORE_ADDR to_addr
= value_address (toval
);
2658 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2659 fromval
= value_cast (type
, fromval
);
2661 read_memory (to_addr
, buffer
, len
);
2662 from_size
= value_bitsize (fromval
);
2664 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2665 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2666 move_bits (buffer
, value_bitpos (toval
),
2667 value_contents (fromval
), from_size
- bits
, bits
, 1);
2669 move_bits (buffer
, value_bitpos (toval
),
2670 value_contents (fromval
), 0, bits
, 0);
2671 write_memory_with_notification (to_addr
, buffer
, len
);
2673 val
= value_copy (toval
);
2674 memcpy (value_contents_raw (val
), value_contents (fromval
),
2675 TYPE_LENGTH (type
));
2676 deprecated_set_value_type (val
, type
);
2681 return value_assign (toval
, fromval
);
2685 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2686 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2687 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2688 * COMPONENT, and not the inferior's memory. The current contents
2689 * of COMPONENT are ignored. */
2691 value_assign_to_component (struct value
*container
, struct value
*component
,
2694 LONGEST offset_in_container
=
2695 (LONGEST
) (value_address (component
) - value_address (container
));
2696 int bit_offset_in_container
=
2697 value_bitpos (component
) - value_bitpos (container
);
2700 val
= value_cast (value_type (component
), val
);
2702 if (value_bitsize (component
) == 0)
2703 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2705 bits
= value_bitsize (component
);
2707 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2708 move_bits (value_contents_writeable (container
) + offset_in_container
,
2709 value_bitpos (container
) + bit_offset_in_container
,
2710 value_contents (val
),
2711 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2714 move_bits (value_contents_writeable (container
) + offset_in_container
,
2715 value_bitpos (container
) + bit_offset_in_container
,
2716 value_contents (val
), 0, bits
, 0);
2719 /* The value of the element of array ARR at the ARITY indices given in IND.
2720 ARR may be either a simple array, GNAT array descriptor, or pointer
2724 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2728 struct type
*elt_type
;
2730 elt
= ada_coerce_to_simple_array (arr
);
2732 elt_type
= ada_check_typedef (value_type (elt
));
2733 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2734 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2735 return value_subscript_packed (elt
, arity
, ind
);
2737 for (k
= 0; k
< arity
; k
+= 1)
2739 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2740 error (_("too many subscripts (%d expected)"), k
);
2741 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2746 /* Assuming ARR is a pointer to a GDB array, the value of the element
2747 of *ARR at the ARITY indices given in IND.
2748 Does not read the entire array into memory. */
2750 static struct value
*
2751 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2755 = check_typedef (value_enclosing_type (ada_value_ind (arr
)));
2757 for (k
= 0; k
< arity
; k
+= 1)
2761 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2762 error (_("too many subscripts (%d expected)"), k
);
2763 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2765 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2766 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2767 type
= TYPE_TARGET_TYPE (type
);
2770 return value_ind (arr
);
2773 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2774 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2775 elements starting at index LOW. The lower bound of this array is LOW, as
2777 static struct value
*
2778 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2781 struct type
*type0
= ada_check_typedef (type
);
2782 CORE_ADDR base
= value_as_address (array_ptr
)
2783 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
)))
2784 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2785 struct type
*index_type
2786 = create_static_range_type (NULL
,
2787 TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
)),
2789 struct type
*slice_type
=
2790 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2792 return value_at_lazy (slice_type
, base
);
2796 static struct value
*
2797 ada_value_slice (struct value
*array
, int low
, int high
)
2799 struct type
*type
= ada_check_typedef (value_type (array
));
2800 struct type
*index_type
2801 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2802 struct type
*slice_type
=
2803 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2805 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2808 /* If type is a record type in the form of a standard GNAT array
2809 descriptor, returns the number of dimensions for type. If arr is a
2810 simple array, returns the number of "array of"s that prefix its
2811 type designation. Otherwise, returns 0. */
2814 ada_array_arity (struct type
*type
)
2821 type
= desc_base_type (type
);
2824 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2825 return desc_arity (desc_bounds_type (type
));
2827 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2830 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2836 /* If TYPE is a record type in the form of a standard GNAT array
2837 descriptor or a simple array type, returns the element type for
2838 TYPE after indexing by NINDICES indices, or by all indices if
2839 NINDICES is -1. Otherwise, returns NULL. */
2842 ada_array_element_type (struct type
*type
, int nindices
)
2844 type
= desc_base_type (type
);
2846 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2849 struct type
*p_array_type
;
2851 p_array_type
= desc_data_target_type (type
);
2853 k
= ada_array_arity (type
);
2857 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2858 if (nindices
>= 0 && k
> nindices
)
2860 while (k
> 0 && p_array_type
!= NULL
)
2862 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2865 return p_array_type
;
2867 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2869 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2871 type
= TYPE_TARGET_TYPE (type
);
2880 /* The type of nth index in arrays of given type (n numbering from 1).
2881 Does not examine memory. Throws an error if N is invalid or TYPE
2882 is not an array type. NAME is the name of the Ada attribute being
2883 evaluated ('range, 'first, 'last, or 'length); it is used in building
2884 the error message. */
2886 static struct type
*
2887 ada_index_type (struct type
*type
, int n
, const char *name
)
2889 struct type
*result_type
;
2891 type
= desc_base_type (type
);
2893 if (n
< 0 || n
> ada_array_arity (type
))
2894 error (_("invalid dimension number to '%s"), name
);
2896 if (ada_is_simple_array_type (type
))
2900 for (i
= 1; i
< n
; i
+= 1)
2901 type
= TYPE_TARGET_TYPE (type
);
2902 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2903 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2904 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2905 perhaps stabsread.c would make more sense. */
2906 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2911 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2912 if (result_type
== NULL
)
2913 error (_("attempt to take bound of something that is not an array"));
2919 /* Given that arr is an array type, returns the lower bound of the
2920 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2921 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2922 array-descriptor type. It works for other arrays with bounds supplied
2923 by run-time quantities other than discriminants. */
2926 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2928 struct type
*type
, *index_type_desc
, *index_type
;
2931 gdb_assert (which
== 0 || which
== 1);
2933 if (ada_is_constrained_packed_array_type (arr_type
))
2934 arr_type
= decode_constrained_packed_array_type (arr_type
);
2936 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2937 return (LONGEST
) - which
;
2939 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2940 type
= TYPE_TARGET_TYPE (arr_type
);
2944 if (TYPE_FIXED_INSTANCE (type
))
2946 /* The array has already been fixed, so we do not need to
2947 check the parallel ___XA type again. That encoding has
2948 already been applied, so ignore it now. */
2949 index_type_desc
= NULL
;
2953 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2954 ada_fixup_array_indexes_type (index_type_desc
);
2957 if (index_type_desc
!= NULL
)
2958 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2962 struct type
*elt_type
= check_typedef (type
);
2964 for (i
= 1; i
< n
; i
++)
2965 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
2967 index_type
= TYPE_INDEX_TYPE (elt_type
);
2971 (LONGEST
) (which
== 0
2972 ? ada_discrete_type_low_bound (index_type
)
2973 : ada_discrete_type_high_bound (index_type
));
2976 /* Given that arr is an array value, returns the lower bound of the
2977 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2978 WHICH is 1. This routine will also work for arrays with bounds
2979 supplied by run-time quantities other than discriminants. */
2982 ada_array_bound (struct value
*arr
, int n
, int which
)
2984 struct type
*arr_type
;
2986 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2987 arr
= value_ind (arr
);
2988 arr_type
= value_enclosing_type (arr
);
2990 if (ada_is_constrained_packed_array_type (arr_type
))
2991 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2992 else if (ada_is_simple_array_type (arr_type
))
2993 return ada_array_bound_from_type (arr_type
, n
, which
);
2995 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2998 /* Given that arr is an array value, returns the length of the
2999 nth index. This routine will also work for arrays with bounds
3000 supplied by run-time quantities other than discriminants.
3001 Does not work for arrays indexed by enumeration types with representation
3002 clauses at the moment. */
3005 ada_array_length (struct value
*arr
, int n
)
3007 struct type
*arr_type
;
3009 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3010 arr
= value_ind (arr
);
3011 arr_type
= value_enclosing_type (arr
);
3013 if (ada_is_constrained_packed_array_type (arr_type
))
3014 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3016 if (ada_is_simple_array_type (arr_type
))
3017 return (ada_array_bound_from_type (arr_type
, n
, 1)
3018 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
3020 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
3021 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
3024 /* An empty array whose type is that of ARR_TYPE (an array type),
3025 with bounds LOW to LOW-1. */
3027 static struct value
*
3028 empty_array (struct type
*arr_type
, int low
)
3030 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3031 struct type
*index_type
3032 = create_static_range_type
3033 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
, low
- 1);
3034 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3036 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3040 /* Name resolution */
3042 /* The "decoded" name for the user-definable Ada operator corresponding
3046 ada_decoded_op_name (enum exp_opcode op
)
3050 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3052 if (ada_opname_table
[i
].op
== op
)
3053 return ada_opname_table
[i
].decoded
;
3055 error (_("Could not find operator name for opcode"));
3059 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3060 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3061 undefined namespace) and converts operators that are
3062 user-defined into appropriate function calls. If CONTEXT_TYPE is
3063 non-null, it provides a preferred result type [at the moment, only
3064 type void has any effect---causing procedures to be preferred over
3065 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3066 return type is preferred. May change (expand) *EXP. */
3069 resolve (struct expression
**expp
, int void_context_p
)
3071 struct type
*context_type
= NULL
;
3075 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3077 resolve_subexp (expp
, &pc
, 1, context_type
);
3080 /* Resolve the operator of the subexpression beginning at
3081 position *POS of *EXPP. "Resolving" consists of replacing
3082 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3083 with their resolutions, replacing built-in operators with
3084 function calls to user-defined operators, where appropriate, and,
3085 when DEPROCEDURE_P is non-zero, converting function-valued variables
3086 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3087 are as in ada_resolve, above. */
3089 static struct value
*
3090 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
3091 struct type
*context_type
)
3095 struct expression
*exp
; /* Convenience: == *expp. */
3096 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3097 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3098 int nargs
; /* Number of operands. */
3105 /* Pass one: resolve operands, saving their types and updating *pos,
3110 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3111 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3116 resolve_subexp (expp
, pos
, 0, NULL
);
3118 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3123 resolve_subexp (expp
, pos
, 0, NULL
);
3128 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
3131 case OP_ATR_MODULUS
:
3141 case TERNOP_IN_RANGE
:
3142 case BINOP_IN_BOUNDS
:
3148 case OP_DISCRETE_RANGE
:
3150 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3159 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3161 resolve_subexp (expp
, pos
, 1, NULL
);
3163 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3180 case BINOP_LOGICAL_AND
:
3181 case BINOP_LOGICAL_OR
:
3182 case BINOP_BITWISE_AND
:
3183 case BINOP_BITWISE_IOR
:
3184 case BINOP_BITWISE_XOR
:
3187 case BINOP_NOTEQUAL
:
3194 case BINOP_SUBSCRIPT
:
3202 case UNOP_LOGICAL_NOT
:
3218 case OP_INTERNALVAR
:
3228 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3231 case STRUCTOP_STRUCT
:
3232 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3245 error (_("Unexpected operator during name resolution"));
3248 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3249 for (i
= 0; i
< nargs
; i
+= 1)
3250 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3254 /* Pass two: perform any resolution on principal operator. */
3261 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3263 struct ada_symbol_info
*candidates
;
3267 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3268 (exp
->elts
[pc
+ 2].symbol
),
3269 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3272 if (n_candidates
> 1)
3274 /* Types tend to get re-introduced locally, so if there
3275 are any local symbols that are not types, first filter
3278 for (j
= 0; j
< n_candidates
; j
+= 1)
3279 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3284 case LOC_REGPARM_ADDR
:
3292 if (j
< n_candidates
)
3295 while (j
< n_candidates
)
3297 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3299 candidates
[j
] = candidates
[n_candidates
- 1];
3308 if (n_candidates
== 0)
3309 error (_("No definition found for %s"),
3310 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3311 else if (n_candidates
== 1)
3313 else if (deprocedure_p
3314 && !is_nonfunction (candidates
, n_candidates
))
3316 i
= ada_resolve_function
3317 (candidates
, n_candidates
, NULL
, 0,
3318 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3321 error (_("Could not find a match for %s"),
3322 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3326 printf_filtered (_("Multiple matches for %s\n"),
3327 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3328 user_select_syms (candidates
, n_candidates
, 1);
3332 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3333 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3334 if (innermost_block
== NULL
3335 || contained_in (candidates
[i
].block
, innermost_block
))
3336 innermost_block
= candidates
[i
].block
;
3340 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3343 replace_operator_with_call (expp
, pc
, 0, 0,
3344 exp
->elts
[pc
+ 2].symbol
,
3345 exp
->elts
[pc
+ 1].block
);
3352 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3353 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3355 struct ada_symbol_info
*candidates
;
3359 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3360 (exp
->elts
[pc
+ 5].symbol
),
3361 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3363 if (n_candidates
== 1)
3367 i
= ada_resolve_function
3368 (candidates
, n_candidates
,
3370 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3373 error (_("Could not find a match for %s"),
3374 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3377 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3378 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3379 if (innermost_block
== NULL
3380 || contained_in (candidates
[i
].block
, innermost_block
))
3381 innermost_block
= candidates
[i
].block
;
3392 case BINOP_BITWISE_AND
:
3393 case BINOP_BITWISE_IOR
:
3394 case BINOP_BITWISE_XOR
:
3396 case BINOP_NOTEQUAL
:
3404 case UNOP_LOGICAL_NOT
:
3406 if (possible_user_operator_p (op
, argvec
))
3408 struct ada_symbol_info
*candidates
;
3412 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3413 (struct block
*) NULL
, VAR_DOMAIN
,
3415 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3416 ada_decoded_op_name (op
), NULL
);
3420 replace_operator_with_call (expp
, pc
, nargs
, 1,
3421 candidates
[i
].sym
, candidates
[i
].block
);
3432 return evaluate_subexp_type (exp
, pos
);
3435 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3436 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3438 /* The term "match" here is rather loose. The match is heuristic and
3442 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3444 ftype
= ada_check_typedef (ftype
);
3445 atype
= ada_check_typedef (atype
);
3447 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3448 ftype
= TYPE_TARGET_TYPE (ftype
);
3449 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3450 atype
= TYPE_TARGET_TYPE (atype
);
3452 switch (TYPE_CODE (ftype
))
3455 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3457 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3458 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3459 TYPE_TARGET_TYPE (atype
), 0);
3462 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3464 case TYPE_CODE_ENUM
:
3465 case TYPE_CODE_RANGE
:
3466 switch (TYPE_CODE (atype
))
3469 case TYPE_CODE_ENUM
:
3470 case TYPE_CODE_RANGE
:
3476 case TYPE_CODE_ARRAY
:
3477 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3478 || ada_is_array_descriptor_type (atype
));
3480 case TYPE_CODE_STRUCT
:
3481 if (ada_is_array_descriptor_type (ftype
))
3482 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3483 || ada_is_array_descriptor_type (atype
));
3485 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3486 && !ada_is_array_descriptor_type (atype
));
3488 case TYPE_CODE_UNION
:
3490 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3494 /* Return non-zero if the formals of FUNC "sufficiently match" the
3495 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3496 may also be an enumeral, in which case it is treated as a 0-
3497 argument function. */
3500 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3503 struct type
*func_type
= SYMBOL_TYPE (func
);
3505 if (SYMBOL_CLASS (func
) == LOC_CONST
3506 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3507 return (n_actuals
== 0);
3508 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3511 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3514 for (i
= 0; i
< n_actuals
; i
+= 1)
3516 if (actuals
[i
] == NULL
)
3520 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3522 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3524 if (!ada_type_match (ftype
, atype
, 1))
3531 /* False iff function type FUNC_TYPE definitely does not produce a value
3532 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3533 FUNC_TYPE is not a valid function type with a non-null return type
3534 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3537 return_match (struct type
*func_type
, struct type
*context_type
)
3539 struct type
*return_type
;
3541 if (func_type
== NULL
)
3544 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3545 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3547 return_type
= get_base_type (func_type
);
3548 if (return_type
== NULL
)
3551 context_type
= get_base_type (context_type
);
3553 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3554 return context_type
== NULL
|| return_type
== context_type
;
3555 else if (context_type
== NULL
)
3556 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3558 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3562 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3563 function (if any) that matches the types of the NARGS arguments in
3564 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3565 that returns that type, then eliminate matches that don't. If
3566 CONTEXT_TYPE is void and there is at least one match that does not
3567 return void, eliminate all matches that do.
3569 Asks the user if there is more than one match remaining. Returns -1
3570 if there is no such symbol or none is selected. NAME is used
3571 solely for messages. May re-arrange and modify SYMS in
3572 the process; the index returned is for the modified vector. */
3575 ada_resolve_function (struct ada_symbol_info syms
[],
3576 int nsyms
, struct value
**args
, int nargs
,
3577 const char *name
, struct type
*context_type
)
3581 int m
; /* Number of hits */
3584 /* In the first pass of the loop, we only accept functions matching
3585 context_type. If none are found, we add a second pass of the loop
3586 where every function is accepted. */
3587 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3589 for (k
= 0; k
< nsyms
; k
+= 1)
3591 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3593 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3594 && (fallback
|| return_match (type
, context_type
)))
3606 printf_filtered (_("Multiple matches for %s\n"), name
);
3607 user_select_syms (syms
, m
, 1);
3613 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3614 in a listing of choices during disambiguation (see sort_choices, below).
3615 The idea is that overloadings of a subprogram name from the
3616 same package should sort in their source order. We settle for ordering
3617 such symbols by their trailing number (__N or $N). */
3620 encoded_ordered_before (const char *N0
, const char *N1
)
3624 else if (N0
== NULL
)
3630 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3632 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3634 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3635 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3640 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3643 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3645 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3646 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3648 return (strcmp (N0
, N1
) < 0);
3652 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3656 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3660 for (i
= 1; i
< nsyms
; i
+= 1)
3662 struct ada_symbol_info sym
= syms
[i
];
3665 for (j
= i
- 1; j
>= 0; j
-= 1)
3667 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3668 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3670 syms
[j
+ 1] = syms
[j
];
3676 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3677 by asking the user (if necessary), returning the number selected,
3678 and setting the first elements of SYMS items. Error if no symbols
3681 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3682 to be re-integrated one of these days. */
3685 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3688 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3690 int first_choice
= (max_results
== 1) ? 1 : 2;
3691 const char *select_mode
= multiple_symbols_select_mode ();
3693 if (max_results
< 1)
3694 error (_("Request to select 0 symbols!"));
3698 if (select_mode
== multiple_symbols_cancel
)
3700 canceled because the command is ambiguous\n\
3701 See set/show multiple-symbol."));
3703 /* If select_mode is "all", then return all possible symbols.
3704 Only do that if more than one symbol can be selected, of course.
3705 Otherwise, display the menu as usual. */
3706 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3709 printf_unfiltered (_("[0] cancel\n"));
3710 if (max_results
> 1)
3711 printf_unfiltered (_("[1] all\n"));
3713 sort_choices (syms
, nsyms
);
3715 for (i
= 0; i
< nsyms
; i
+= 1)
3717 if (syms
[i
].sym
== NULL
)
3720 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3722 struct symtab_and_line sal
=
3723 find_function_start_sal (syms
[i
].sym
, 1);
3725 if (sal
.symtab
== NULL
)
3726 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3728 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3731 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3732 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3733 symtab_to_filename_for_display (sal
.symtab
),
3740 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3741 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3742 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3743 struct symtab
*symtab
= NULL
;
3745 if (SYMBOL_OBJFILE_OWNED (syms
[i
].sym
))
3746 symtab
= symbol_symtab (syms
[i
].sym
);
3748 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3749 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3751 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3752 symtab_to_filename_for_display (symtab
),
3753 SYMBOL_LINE (syms
[i
].sym
));
3754 else if (is_enumeral
3755 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3757 printf_unfiltered (("[%d] "), i
+ first_choice
);
3758 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3759 gdb_stdout
, -1, 0, &type_print_raw_options
);
3760 printf_unfiltered (_("'(%s) (enumeral)\n"),
3761 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3763 else if (symtab
!= NULL
)
3764 printf_unfiltered (is_enumeral
3765 ? _("[%d] %s in %s (enumeral)\n")
3766 : _("[%d] %s at %s:?\n"),
3768 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3769 symtab_to_filename_for_display (symtab
));
3771 printf_unfiltered (is_enumeral
3772 ? _("[%d] %s (enumeral)\n")
3773 : _("[%d] %s at ?\n"),
3775 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3779 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3782 for (i
= 0; i
< n_chosen
; i
+= 1)
3783 syms
[i
] = syms
[chosen
[i
]];
3788 /* Read and validate a set of numeric choices from the user in the
3789 range 0 .. N_CHOICES-1. Place the results in increasing
3790 order in CHOICES[0 .. N-1], and return N.
3792 The user types choices as a sequence of numbers on one line
3793 separated by blanks, encoding them as follows:
3795 + A choice of 0 means to cancel the selection, throwing an error.
3796 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3797 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3799 The user is not allowed to choose more than MAX_RESULTS values.
3801 ANNOTATION_SUFFIX, if present, is used to annotate the input
3802 prompts (for use with the -f switch). */
3805 get_selections (int *choices
, int n_choices
, int max_results
,
3806 int is_all_choice
, char *annotation_suffix
)
3811 int first_choice
= is_all_choice
? 2 : 1;
3813 prompt
= getenv ("PS2");
3817 args
= command_line_input (prompt
, 0, annotation_suffix
);
3820 error_no_arg (_("one or more choice numbers"));
3824 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3825 order, as given in args. Choices are validated. */
3831 args
= skip_spaces (args
);
3832 if (*args
== '\0' && n_chosen
== 0)
3833 error_no_arg (_("one or more choice numbers"));
3834 else if (*args
== '\0')
3837 choice
= strtol (args
, &args2
, 10);
3838 if (args
== args2
|| choice
< 0
3839 || choice
> n_choices
+ first_choice
- 1)
3840 error (_("Argument must be choice number"));
3844 error (_("cancelled"));
3846 if (choice
< first_choice
)
3848 n_chosen
= n_choices
;
3849 for (j
= 0; j
< n_choices
; j
+= 1)
3853 choice
-= first_choice
;
3855 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3859 if (j
< 0 || choice
!= choices
[j
])
3863 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3864 choices
[k
+ 1] = choices
[k
];
3865 choices
[j
+ 1] = choice
;
3870 if (n_chosen
> max_results
)
3871 error (_("Select no more than %d of the above"), max_results
);
3876 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3877 on the function identified by SYM and BLOCK, and taking NARGS
3878 arguments. Update *EXPP as needed to hold more space. */
3881 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3882 int oplen
, struct symbol
*sym
,
3883 const struct block
*block
)
3885 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3886 symbol, -oplen for operator being replaced). */
3887 struct expression
*newexp
= (struct expression
*)
3888 xzalloc (sizeof (struct expression
)
3889 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3890 struct expression
*exp
= *expp
;
3892 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3893 newexp
->language_defn
= exp
->language_defn
;
3894 newexp
->gdbarch
= exp
->gdbarch
;
3895 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3896 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3897 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3899 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3900 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3902 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3903 newexp
->elts
[pc
+ 4].block
= block
;
3904 newexp
->elts
[pc
+ 5].symbol
= sym
;
3910 /* Type-class predicates */
3912 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3916 numeric_type_p (struct type
*type
)
3922 switch (TYPE_CODE (type
))
3927 case TYPE_CODE_RANGE
:
3928 return (type
== TYPE_TARGET_TYPE (type
)
3929 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3936 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3939 integer_type_p (struct type
*type
)
3945 switch (TYPE_CODE (type
))
3949 case TYPE_CODE_RANGE
:
3950 return (type
== TYPE_TARGET_TYPE (type
)
3951 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3958 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3961 scalar_type_p (struct type
*type
)
3967 switch (TYPE_CODE (type
))
3970 case TYPE_CODE_RANGE
:
3971 case TYPE_CODE_ENUM
:
3980 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3983 discrete_type_p (struct type
*type
)
3989 switch (TYPE_CODE (type
))
3992 case TYPE_CODE_RANGE
:
3993 case TYPE_CODE_ENUM
:
3994 case TYPE_CODE_BOOL
:
4002 /* Returns non-zero if OP with operands in the vector ARGS could be
4003 a user-defined function. Errs on the side of pre-defined operators
4004 (i.e., result 0). */
4007 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4009 struct type
*type0
=
4010 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4011 struct type
*type1
=
4012 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4026 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4030 case BINOP_BITWISE_AND
:
4031 case BINOP_BITWISE_IOR
:
4032 case BINOP_BITWISE_XOR
:
4033 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4036 case BINOP_NOTEQUAL
:
4041 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4044 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4047 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4051 case UNOP_LOGICAL_NOT
:
4053 return (!numeric_type_p (type0
));
4062 1. In the following, we assume that a renaming type's name may
4063 have an ___XD suffix. It would be nice if this went away at some
4065 2. We handle both the (old) purely type-based representation of
4066 renamings and the (new) variable-based encoding. At some point,
4067 it is devoutly to be hoped that the former goes away
4068 (FIXME: hilfinger-2007-07-09).
4069 3. Subprogram renamings are not implemented, although the XRS
4070 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4072 /* If SYM encodes a renaming,
4074 <renaming> renames <renamed entity>,
4076 sets *LEN to the length of the renamed entity's name,
4077 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4078 the string describing the subcomponent selected from the renamed
4079 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4080 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4081 are undefined). Otherwise, returns a value indicating the category
4082 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4083 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4084 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4085 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4086 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4087 may be NULL, in which case they are not assigned.
4089 [Currently, however, GCC does not generate subprogram renamings.] */
4091 enum ada_renaming_category
4092 ada_parse_renaming (struct symbol
*sym
,
4093 const char **renamed_entity
, int *len
,
4094 const char **renaming_expr
)
4096 enum ada_renaming_category kind
;
4101 return ADA_NOT_RENAMING
;
4102 switch (SYMBOL_CLASS (sym
))
4105 return ADA_NOT_RENAMING
;
4107 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
4108 renamed_entity
, len
, renaming_expr
);
4112 case LOC_OPTIMIZED_OUT
:
4113 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4115 return ADA_NOT_RENAMING
;
4119 kind
= ADA_OBJECT_RENAMING
;
4123 kind
= ADA_EXCEPTION_RENAMING
;
4127 kind
= ADA_PACKAGE_RENAMING
;
4131 kind
= ADA_SUBPROGRAM_RENAMING
;
4135 return ADA_NOT_RENAMING
;
4139 if (renamed_entity
!= NULL
)
4140 *renamed_entity
= info
;
4141 suffix
= strstr (info
, "___XE");
4142 if (suffix
== NULL
|| suffix
== info
)
4143 return ADA_NOT_RENAMING
;
4145 *len
= strlen (info
) - strlen (suffix
);
4147 if (renaming_expr
!= NULL
)
4148 *renaming_expr
= suffix
;
4152 /* Assuming TYPE encodes a renaming according to the old encoding in
4153 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4154 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4155 ADA_NOT_RENAMING otherwise. */
4156 static enum ada_renaming_category
4157 parse_old_style_renaming (struct type
*type
,
4158 const char **renamed_entity
, int *len
,
4159 const char **renaming_expr
)
4161 enum ada_renaming_category kind
;
4166 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4167 || TYPE_NFIELDS (type
) != 1)
4168 return ADA_NOT_RENAMING
;
4170 name
= type_name_no_tag (type
);
4172 return ADA_NOT_RENAMING
;
4174 name
= strstr (name
, "___XR");
4176 return ADA_NOT_RENAMING
;
4181 kind
= ADA_OBJECT_RENAMING
;
4184 kind
= ADA_EXCEPTION_RENAMING
;
4187 kind
= ADA_PACKAGE_RENAMING
;
4190 kind
= ADA_SUBPROGRAM_RENAMING
;
4193 return ADA_NOT_RENAMING
;
4196 info
= TYPE_FIELD_NAME (type
, 0);
4198 return ADA_NOT_RENAMING
;
4199 if (renamed_entity
!= NULL
)
4200 *renamed_entity
= info
;
4201 suffix
= strstr (info
, "___XE");
4202 if (renaming_expr
!= NULL
)
4203 *renaming_expr
= suffix
+ 5;
4204 if (suffix
== NULL
|| suffix
== info
)
4205 return ADA_NOT_RENAMING
;
4207 *len
= suffix
- info
;
4211 /* Compute the value of the given RENAMING_SYM, which is expected to
4212 be a symbol encoding a renaming expression. BLOCK is the block
4213 used to evaluate the renaming. */
4215 static struct value
*
4216 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4217 const struct block
*block
)
4219 const char *sym_name
;
4220 struct expression
*expr
;
4221 struct value
*value
;
4222 struct cleanup
*old_chain
= NULL
;
4224 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4225 expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4226 old_chain
= make_cleanup (free_current_contents
, &expr
);
4227 value
= evaluate_expression (expr
);
4229 do_cleanups (old_chain
);
4234 /* Evaluation: Function Calls */
4236 /* Return an lvalue containing the value VAL. This is the identity on
4237 lvalues, and otherwise has the side-effect of allocating memory
4238 in the inferior where a copy of the value contents is copied. */
4240 static struct value
*
4241 ensure_lval (struct value
*val
)
4243 if (VALUE_LVAL (val
) == not_lval
4244 || VALUE_LVAL (val
) == lval_internalvar
)
4246 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4247 const CORE_ADDR addr
=
4248 value_as_long (value_allocate_space_in_inferior (len
));
4250 set_value_address (val
, addr
);
4251 VALUE_LVAL (val
) = lval_memory
;
4252 write_memory (addr
, value_contents (val
), len
);
4258 /* Return the value ACTUAL, converted to be an appropriate value for a
4259 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4260 allocating any necessary descriptors (fat pointers), or copies of
4261 values not residing in memory, updating it as needed. */
4264 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4266 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4267 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4268 struct type
*formal_target
=
4269 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4270 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4271 struct type
*actual_target
=
4272 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4273 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4275 if (ada_is_array_descriptor_type (formal_target
)
4276 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4277 return make_array_descriptor (formal_type
, actual
);
4278 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4279 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4281 struct value
*result
;
4283 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4284 && ada_is_array_descriptor_type (actual_target
))
4285 result
= desc_data (actual
);
4286 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4288 if (VALUE_LVAL (actual
) != lval_memory
)
4292 actual_type
= ada_check_typedef (value_type (actual
));
4293 val
= allocate_value (actual_type
);
4294 memcpy ((char *) value_contents_raw (val
),
4295 (char *) value_contents (actual
),
4296 TYPE_LENGTH (actual_type
));
4297 actual
= ensure_lval (val
);
4299 result
= value_addr (actual
);
4303 return value_cast_pointers (formal_type
, result
, 0);
4305 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4306 return ada_value_ind (actual
);
4311 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4312 type TYPE. This is usually an inefficient no-op except on some targets
4313 (such as AVR) where the representation of a pointer and an address
4317 value_pointer (struct value
*value
, struct type
*type
)
4319 struct gdbarch
*gdbarch
= get_type_arch (type
);
4320 unsigned len
= TYPE_LENGTH (type
);
4321 gdb_byte
*buf
= alloca (len
);
4324 addr
= value_address (value
);
4325 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4326 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4331 /* Push a descriptor of type TYPE for array value ARR on the stack at
4332 *SP, updating *SP to reflect the new descriptor. Return either
4333 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4334 to-descriptor type rather than a descriptor type), a struct value *
4335 representing a pointer to this descriptor. */
4337 static struct value
*
4338 make_array_descriptor (struct type
*type
, struct value
*arr
)
4340 struct type
*bounds_type
= desc_bounds_type (type
);
4341 struct type
*desc_type
= desc_base_type (type
);
4342 struct value
*descriptor
= allocate_value (desc_type
);
4343 struct value
*bounds
= allocate_value (bounds_type
);
4346 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4349 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4350 ada_array_bound (arr
, i
, 0),
4351 desc_bound_bitpos (bounds_type
, i
, 0),
4352 desc_bound_bitsize (bounds_type
, i
, 0));
4353 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4354 ada_array_bound (arr
, i
, 1),
4355 desc_bound_bitpos (bounds_type
, i
, 1),
4356 desc_bound_bitsize (bounds_type
, i
, 1));
4359 bounds
= ensure_lval (bounds
);
4361 modify_field (value_type (descriptor
),
4362 value_contents_writeable (descriptor
),
4363 value_pointer (ensure_lval (arr
),
4364 TYPE_FIELD_TYPE (desc_type
, 0)),
4365 fat_pntr_data_bitpos (desc_type
),
4366 fat_pntr_data_bitsize (desc_type
));
4368 modify_field (value_type (descriptor
),
4369 value_contents_writeable (descriptor
),
4370 value_pointer (bounds
,
4371 TYPE_FIELD_TYPE (desc_type
, 1)),
4372 fat_pntr_bounds_bitpos (desc_type
),
4373 fat_pntr_bounds_bitsize (desc_type
));
4375 descriptor
= ensure_lval (descriptor
);
4377 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4378 return value_addr (descriptor
);
4383 /* Symbol Cache Module */
4385 /* Performance measurements made as of 2010-01-15 indicate that
4386 this cache does bring some noticeable improvements. Depending
4387 on the type of entity being printed, the cache can make it as much
4388 as an order of magnitude faster than without it.
4390 The descriptive type DWARF extension has significantly reduced
4391 the need for this cache, at least when DWARF is being used. However,
4392 even in this case, some expensive name-based symbol searches are still
4393 sometimes necessary - to find an XVZ variable, mostly. */
4395 /* Initialize the contents of SYM_CACHE. */
4398 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4400 obstack_init (&sym_cache
->cache_space
);
4401 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4404 /* Free the memory used by SYM_CACHE. */
4407 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4409 obstack_free (&sym_cache
->cache_space
, NULL
);
4413 /* Return the symbol cache associated to the given program space PSPACE.
4414 If not allocated for this PSPACE yet, allocate and initialize one. */
4416 static struct ada_symbol_cache
*
4417 ada_get_symbol_cache (struct program_space
*pspace
)
4419 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4421 if (pspace_data
->sym_cache
== NULL
)
4423 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4424 ada_init_symbol_cache (pspace_data
->sym_cache
);
4427 return pspace_data
->sym_cache
;
4430 /* Clear all entries from the symbol cache. */
4433 ada_clear_symbol_cache (void)
4435 struct ada_symbol_cache
*sym_cache
4436 = ada_get_symbol_cache (current_program_space
);
4438 obstack_free (&sym_cache
->cache_space
, NULL
);
4439 ada_init_symbol_cache (sym_cache
);
4442 /* Search our cache for an entry matching NAME and DOMAIN.
4443 Return it if found, or NULL otherwise. */
4445 static struct cache_entry
**
4446 find_entry (const char *name
, domain_enum domain
)
4448 struct ada_symbol_cache
*sym_cache
4449 = ada_get_symbol_cache (current_program_space
);
4450 int h
= msymbol_hash (name
) % HASH_SIZE
;
4451 struct cache_entry
**e
;
4453 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4455 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4461 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4462 Return 1 if found, 0 otherwise.
4464 If an entry was found and SYM is not NULL, set *SYM to the entry's
4465 SYM. Same principle for BLOCK if not NULL. */
4468 lookup_cached_symbol (const char *name
, domain_enum domain
,
4469 struct symbol
**sym
, const struct block
**block
)
4471 struct cache_entry
**e
= find_entry (name
, domain
);
4478 *block
= (*e
)->block
;
4482 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4483 in domain DOMAIN, save this result in our symbol cache. */
4486 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4487 const struct block
*block
)
4489 struct ada_symbol_cache
*sym_cache
4490 = ada_get_symbol_cache (current_program_space
);
4493 struct cache_entry
*e
;
4495 /* Symbols for builtin types don't have a block.
4496 For now don't cache such symbols. */
4497 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4500 /* If the symbol is a local symbol, then do not cache it, as a search
4501 for that symbol depends on the context. To determine whether
4502 the symbol is local or not, we check the block where we found it
4503 against the global and static blocks of its associated symtab. */
4505 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4506 GLOBAL_BLOCK
) != block
4507 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4508 STATIC_BLOCK
) != block
)
4511 h
= msymbol_hash (name
) % HASH_SIZE
;
4512 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4514 e
->next
= sym_cache
->root
[h
];
4515 sym_cache
->root
[h
] = e
;
4516 e
->name
= copy
= obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4517 strcpy (copy
, name
);
4525 /* Return nonzero if wild matching should be used when searching for
4526 all symbols matching LOOKUP_NAME.
4528 LOOKUP_NAME is expected to be a symbol name after transformation
4529 for Ada lookups (see ada_name_for_lookup). */
4532 should_use_wild_match (const char *lookup_name
)
4534 return (strstr (lookup_name
, "__") == NULL
);
4537 /* Return the result of a standard (literal, C-like) lookup of NAME in
4538 given DOMAIN, visible from lexical block BLOCK. */
4540 static struct symbol
*
4541 standard_lookup (const char *name
, const struct block
*block
,
4544 /* Initialize it just to avoid a GCC false warning. */
4545 struct symbol
*sym
= NULL
;
4547 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4549 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4550 cache_symbol (name
, domain
, sym
, block_found
);
4555 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4556 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4557 since they contend in overloading in the same way. */
4559 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4563 for (i
= 0; i
< n
; i
+= 1)
4564 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4565 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4566 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4572 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4573 struct types. Otherwise, they may not. */
4576 equiv_types (struct type
*type0
, struct type
*type1
)
4580 if (type0
== NULL
|| type1
== NULL
4581 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4583 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4584 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4585 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4586 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4592 /* True iff SYM0 represents the same entity as SYM1, or one that is
4593 no more defined than that of SYM1. */
4596 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4600 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4601 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4604 switch (SYMBOL_CLASS (sym0
))
4610 struct type
*type0
= SYMBOL_TYPE (sym0
);
4611 struct type
*type1
= SYMBOL_TYPE (sym1
);
4612 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4613 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4614 int len0
= strlen (name0
);
4617 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4618 && (equiv_types (type0
, type1
)
4619 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4620 && startswith (name1
+ len0
, "___XV")));
4623 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4624 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4630 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4631 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4634 add_defn_to_vec (struct obstack
*obstackp
,
4636 const struct block
*block
)
4639 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4641 /* Do not try to complete stub types, as the debugger is probably
4642 already scanning all symbols matching a certain name at the
4643 time when this function is called. Trying to replace the stub
4644 type by its associated full type will cause us to restart a scan
4645 which may lead to an infinite recursion. Instead, the client
4646 collecting the matching symbols will end up collecting several
4647 matches, with at least one of them complete. It can then filter
4648 out the stub ones if needed. */
4650 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4652 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4654 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4656 prevDefns
[i
].sym
= sym
;
4657 prevDefns
[i
].block
= block
;
4663 struct ada_symbol_info info
;
4667 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4671 /* Number of ada_symbol_info structures currently collected in
4672 current vector in *OBSTACKP. */
4675 num_defns_collected (struct obstack
*obstackp
)
4677 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4680 /* Vector of ada_symbol_info structures currently collected in current
4681 vector in *OBSTACKP. If FINISH, close off the vector and return
4682 its final address. */
4684 static struct ada_symbol_info
*
4685 defns_collected (struct obstack
*obstackp
, int finish
)
4688 return obstack_finish (obstackp
);
4690 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4693 /* Return a bound minimal symbol matching NAME according to Ada
4694 decoding rules. Returns an invalid symbol if there is no such
4695 minimal symbol. Names prefixed with "standard__" are handled
4696 specially: "standard__" is first stripped off, and only static and
4697 global symbols are searched. */
4699 struct bound_minimal_symbol
4700 ada_lookup_simple_minsym (const char *name
)
4702 struct bound_minimal_symbol result
;
4703 struct objfile
*objfile
;
4704 struct minimal_symbol
*msymbol
;
4705 const int wild_match_p
= should_use_wild_match (name
);
4707 memset (&result
, 0, sizeof (result
));
4709 /* Special case: If the user specifies a symbol name inside package
4710 Standard, do a non-wild matching of the symbol name without
4711 the "standard__" prefix. This was primarily introduced in order
4712 to allow the user to specifically access the standard exceptions
4713 using, for instance, Standard.Constraint_Error when Constraint_Error
4714 is ambiguous (due to the user defining its own Constraint_Error
4715 entity inside its program). */
4716 if (startswith (name
, "standard__"))
4717 name
+= sizeof ("standard__") - 1;
4719 ALL_MSYMBOLS (objfile
, msymbol
)
4721 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match_p
)
4722 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4724 result
.minsym
= msymbol
;
4725 result
.objfile
= objfile
;
4733 /* For all subprograms that statically enclose the subprogram of the
4734 selected frame, add symbols matching identifier NAME in DOMAIN
4735 and their blocks to the list of data in OBSTACKP, as for
4736 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4737 with a wildcard prefix. */
4740 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4741 const char *name
, domain_enum domain
,
4746 /* True if TYPE is definitely an artificial type supplied to a symbol
4747 for which no debugging information was given in the symbol file. */
4750 is_nondebugging_type (struct type
*type
)
4752 const char *name
= ada_type_name (type
);
4754 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4757 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4758 that are deemed "identical" for practical purposes.
4760 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4761 types and that their number of enumerals is identical (in other
4762 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4765 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4769 /* The heuristic we use here is fairly conservative. We consider
4770 that 2 enumerate types are identical if they have the same
4771 number of enumerals and that all enumerals have the same
4772 underlying value and name. */
4774 /* All enums in the type should have an identical underlying value. */
4775 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4776 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4779 /* All enumerals should also have the same name (modulo any numerical
4781 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4783 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4784 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4785 int len_1
= strlen (name_1
);
4786 int len_2
= strlen (name_2
);
4788 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4789 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4791 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4792 TYPE_FIELD_NAME (type2
, i
),
4800 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4801 that are deemed "identical" for practical purposes. Sometimes,
4802 enumerals are not strictly identical, but their types are so similar
4803 that they can be considered identical.
4805 For instance, consider the following code:
4807 type Color is (Black, Red, Green, Blue, White);
4808 type RGB_Color is new Color range Red .. Blue;
4810 Type RGB_Color is a subrange of an implicit type which is a copy
4811 of type Color. If we call that implicit type RGB_ColorB ("B" is
4812 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4813 As a result, when an expression references any of the enumeral
4814 by name (Eg. "print green"), the expression is technically
4815 ambiguous and the user should be asked to disambiguate. But
4816 doing so would only hinder the user, since it wouldn't matter
4817 what choice he makes, the outcome would always be the same.
4818 So, for practical purposes, we consider them as the same. */
4821 symbols_are_identical_enums (struct ada_symbol_info
*syms
, int nsyms
)
4825 /* Before performing a thorough comparison check of each type,
4826 we perform a series of inexpensive checks. We expect that these
4827 checks will quickly fail in the vast majority of cases, and thus
4828 help prevent the unnecessary use of a more expensive comparison.
4829 Said comparison also expects us to make some of these checks
4830 (see ada_identical_enum_types_p). */
4832 /* Quick check: All symbols should have an enum type. */
4833 for (i
= 0; i
< nsyms
; i
++)
4834 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
)
4837 /* Quick check: They should all have the same value. */
4838 for (i
= 1; i
< nsyms
; i
++)
4839 if (SYMBOL_VALUE (syms
[i
].sym
) != SYMBOL_VALUE (syms
[0].sym
))
4842 /* Quick check: They should all have the same number of enumerals. */
4843 for (i
= 1; i
< nsyms
; i
++)
4844 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].sym
))
4845 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].sym
)))
4848 /* All the sanity checks passed, so we might have a set of
4849 identical enumeration types. Perform a more complete
4850 comparison of the type of each symbol. */
4851 for (i
= 1; i
< nsyms
; i
++)
4852 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].sym
),
4853 SYMBOL_TYPE (syms
[0].sym
)))
4859 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4860 duplicate other symbols in the list (The only case I know of where
4861 this happens is when object files containing stabs-in-ecoff are
4862 linked with files containing ordinary ecoff debugging symbols (or no
4863 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4864 Returns the number of items in the modified list. */
4867 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4871 /* We should never be called with less than 2 symbols, as there
4872 cannot be any extra symbol in that case. But it's easy to
4873 handle, since we have nothing to do in that case. */
4882 /* If two symbols have the same name and one of them is a stub type,
4883 the get rid of the stub. */
4885 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4886 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4888 for (j
= 0; j
< nsyms
; j
++)
4891 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4892 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4893 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4894 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4899 /* Two symbols with the same name, same class and same address
4900 should be identical. */
4902 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4903 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4904 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4906 for (j
= 0; j
< nsyms
; j
+= 1)
4909 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4910 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4911 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4912 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4913 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4914 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4921 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4922 syms
[j
- 1] = syms
[j
];
4929 /* If all the remaining symbols are identical enumerals, then
4930 just keep the first one and discard the rest.
4932 Unlike what we did previously, we do not discard any entry
4933 unless they are ALL identical. This is because the symbol
4934 comparison is not a strict comparison, but rather a practical
4935 comparison. If all symbols are considered identical, then
4936 we can just go ahead and use the first one and discard the rest.
4937 But if we cannot reduce the list to a single element, we have
4938 to ask the user to disambiguate anyways. And if we have to
4939 present a multiple-choice menu, it's less confusing if the list
4940 isn't missing some choices that were identical and yet distinct. */
4941 if (symbols_are_identical_enums (syms
, nsyms
))
4947 /* Given a type that corresponds to a renaming entity, use the type name
4948 to extract the scope (package name or function name, fully qualified,
4949 and following the GNAT encoding convention) where this renaming has been
4950 defined. The string returned needs to be deallocated after use. */
4953 xget_renaming_scope (struct type
*renaming_type
)
4955 /* The renaming types adhere to the following convention:
4956 <scope>__<rename>___<XR extension>.
4957 So, to extract the scope, we search for the "___XR" extension,
4958 and then backtrack until we find the first "__". */
4960 const char *name
= type_name_no_tag (renaming_type
);
4961 char *suffix
= strstr (name
, "___XR");
4966 /* Now, backtrack a bit until we find the first "__". Start looking
4967 at suffix - 3, as the <rename> part is at least one character long. */
4969 for (last
= suffix
- 3; last
> name
; last
--)
4970 if (last
[0] == '_' && last
[1] == '_')
4973 /* Make a copy of scope and return it. */
4975 scope_len
= last
- name
;
4976 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4978 strncpy (scope
, name
, scope_len
);
4979 scope
[scope_len
] = '\0';
4984 /* Return nonzero if NAME corresponds to a package name. */
4987 is_package_name (const char *name
)
4989 /* Here, We take advantage of the fact that no symbols are generated
4990 for packages, while symbols are generated for each function.
4991 So the condition for NAME represent a package becomes equivalent
4992 to NAME not existing in our list of symbols. There is only one
4993 small complication with library-level functions (see below). */
4997 /* If it is a function that has not been defined at library level,
4998 then we should be able to look it up in the symbols. */
4999 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5002 /* Library-level function names start with "_ada_". See if function
5003 "_ada_" followed by NAME can be found. */
5005 /* Do a quick check that NAME does not contain "__", since library-level
5006 functions names cannot contain "__" in them. */
5007 if (strstr (name
, "__") != NULL
)
5010 fun_name
= xstrprintf ("_ada_%s", name
);
5012 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
5015 /* Return nonzero if SYM corresponds to a renaming entity that is
5016 not visible from FUNCTION_NAME. */
5019 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5022 struct cleanup
*old_chain
;
5024 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5027 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5028 old_chain
= make_cleanup (xfree
, scope
);
5030 /* If the rename has been defined in a package, then it is visible. */
5031 if (is_package_name (scope
))
5033 do_cleanups (old_chain
);
5037 /* Check that the rename is in the current function scope by checking
5038 that its name starts with SCOPE. */
5040 /* If the function name starts with "_ada_", it means that it is
5041 a library-level function. Strip this prefix before doing the
5042 comparison, as the encoding for the renaming does not contain
5044 if (startswith (function_name
, "_ada_"))
5048 int is_invisible
= !startswith (function_name
, scope
);
5050 do_cleanups (old_chain
);
5051 return is_invisible
;
5055 /* Remove entries from SYMS that corresponds to a renaming entity that
5056 is not visible from the function associated with CURRENT_BLOCK or
5057 that is superfluous due to the presence of more specific renaming
5058 information. Places surviving symbols in the initial entries of
5059 SYMS and returns the number of surviving symbols.
5062 First, in cases where an object renaming is implemented as a
5063 reference variable, GNAT may produce both the actual reference
5064 variable and the renaming encoding. In this case, we discard the
5067 Second, GNAT emits a type following a specified encoding for each renaming
5068 entity. Unfortunately, STABS currently does not support the definition
5069 of types that are local to a given lexical block, so all renamings types
5070 are emitted at library level. As a consequence, if an application
5071 contains two renaming entities using the same name, and a user tries to
5072 print the value of one of these entities, the result of the ada symbol
5073 lookup will also contain the wrong renaming type.
5075 This function partially covers for this limitation by attempting to
5076 remove from the SYMS list renaming symbols that should be visible
5077 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5078 method with the current information available. The implementation
5079 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5081 - When the user tries to print a rename in a function while there
5082 is another rename entity defined in a package: Normally, the
5083 rename in the function has precedence over the rename in the
5084 package, so the latter should be removed from the list. This is
5085 currently not the case.
5087 - This function will incorrectly remove valid renames if
5088 the CURRENT_BLOCK corresponds to a function which symbol name
5089 has been changed by an "Export" pragma. As a consequence,
5090 the user will be unable to print such rename entities. */
5093 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
5094 int nsyms
, const struct block
*current_block
)
5096 struct symbol
*current_function
;
5097 const char *current_function_name
;
5099 int is_new_style_renaming
;
5101 /* If there is both a renaming foo___XR... encoded as a variable and
5102 a simple variable foo in the same block, discard the latter.
5103 First, zero out such symbols, then compress. */
5104 is_new_style_renaming
= 0;
5105 for (i
= 0; i
< nsyms
; i
+= 1)
5107 struct symbol
*sym
= syms
[i
].sym
;
5108 const struct block
*block
= syms
[i
].block
;
5112 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5114 name
= SYMBOL_LINKAGE_NAME (sym
);
5115 suffix
= strstr (name
, "___XR");
5119 int name_len
= suffix
- name
;
5122 is_new_style_renaming
= 1;
5123 for (j
= 0; j
< nsyms
; j
+= 1)
5124 if (i
!= j
&& syms
[j
].sym
!= NULL
5125 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
5127 && block
== syms
[j
].block
)
5131 if (is_new_style_renaming
)
5135 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5136 if (syms
[j
].sym
!= NULL
)
5144 /* Extract the function name associated to CURRENT_BLOCK.
5145 Abort if unable to do so. */
5147 if (current_block
== NULL
)
5150 current_function
= block_linkage_function (current_block
);
5151 if (current_function
== NULL
)
5154 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5155 if (current_function_name
== NULL
)
5158 /* Check each of the symbols, and remove it from the list if it is
5159 a type corresponding to a renaming that is out of the scope of
5160 the current block. */
5165 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
5166 == ADA_OBJECT_RENAMING
5167 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
5171 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5172 syms
[j
- 1] = syms
[j
];
5182 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5183 whose name and domain match NAME and DOMAIN respectively.
5184 If no match was found, then extend the search to "enclosing"
5185 routines (in other words, if we're inside a nested function,
5186 search the symbols defined inside the enclosing functions).
5187 If WILD_MATCH_P is nonzero, perform the naming matching in
5188 "wild" mode (see function "wild_match" for more info).
5190 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5193 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
5194 const struct block
*block
, domain_enum domain
,
5197 int block_depth
= 0;
5199 while (block
!= NULL
)
5202 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5205 /* If we found a non-function match, assume that's the one. */
5206 if (is_nonfunction (defns_collected (obstackp
, 0),
5207 num_defns_collected (obstackp
)))
5210 block
= BLOCK_SUPERBLOCK (block
);
5213 /* If no luck so far, try to find NAME as a local symbol in some lexically
5214 enclosing subprogram. */
5215 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5216 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match_p
);
5219 /* An object of this type is used as the user_data argument when
5220 calling the map_matching_symbols method. */
5224 struct objfile
*objfile
;
5225 struct obstack
*obstackp
;
5226 struct symbol
*arg_sym
;
5230 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
5231 to a list of symbols. DATA0 is a pointer to a struct match_data *
5232 containing the obstack that collects the symbol list, the file that SYM
5233 must come from, a flag indicating whether a non-argument symbol has
5234 been found in the current block, and the last argument symbol
5235 passed in SYM within the current block (if any). When SYM is null,
5236 marking the end of a block, the argument symbol is added if no
5237 other has been found. */
5240 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5242 struct match_data
*data
= (struct match_data
*) data0
;
5246 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5247 add_defn_to_vec (data
->obstackp
,
5248 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5250 data
->found_sym
= 0;
5251 data
->arg_sym
= NULL
;
5255 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5257 else if (SYMBOL_IS_ARGUMENT (sym
))
5258 data
->arg_sym
= sym
;
5261 data
->found_sym
= 1;
5262 add_defn_to_vec (data
->obstackp
,
5263 fixup_symbol_section (sym
, data
->objfile
),
5270 /* Implements compare_names, but only applying the comparision using
5271 the given CASING. */
5274 compare_names_with_case (const char *string1
, const char *string2
,
5275 enum case_sensitivity casing
)
5277 while (*string1
!= '\0' && *string2
!= '\0')
5281 if (isspace (*string1
) || isspace (*string2
))
5282 return strcmp_iw_ordered (string1
, string2
);
5284 if (casing
== case_sensitive_off
)
5286 c1
= tolower (*string1
);
5287 c2
= tolower (*string2
);
5304 return strcmp_iw_ordered (string1
, string2
);
5306 if (*string2
== '\0')
5308 if (is_name_suffix (string1
))
5315 if (*string2
== '(')
5316 return strcmp_iw_ordered (string1
, string2
);
5319 if (casing
== case_sensitive_off
)
5320 return tolower (*string1
) - tolower (*string2
);
5322 return *string1
- *string2
;
5327 /* Compare STRING1 to STRING2, with results as for strcmp.
5328 Compatible with strcmp_iw_ordered in that...
5330 strcmp_iw_ordered (STRING1, STRING2) <= 0
5334 compare_names (STRING1, STRING2) <= 0
5336 (they may differ as to what symbols compare equal). */
5339 compare_names (const char *string1
, const char *string2
)
5343 /* Similar to what strcmp_iw_ordered does, we need to perform
5344 a case-insensitive comparison first, and only resort to
5345 a second, case-sensitive, comparison if the first one was
5346 not sufficient to differentiate the two strings. */
5348 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5350 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5355 /* Add to OBSTACKP all non-local symbols whose name and domain match
5356 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5357 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5360 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5361 domain_enum domain
, int global
,
5364 struct objfile
*objfile
;
5365 struct match_data data
;
5367 memset (&data
, 0, sizeof data
);
5368 data
.obstackp
= obstackp
;
5370 ALL_OBJFILES (objfile
)
5372 data
.objfile
= objfile
;
5375 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5376 aux_add_nonlocal_symbols
, &data
,
5379 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5380 aux_add_nonlocal_symbols
, &data
,
5381 full_match
, compare_names
);
5384 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5386 ALL_OBJFILES (objfile
)
5388 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
5389 strcpy (name1
, "_ada_");
5390 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5391 data
.objfile
= objfile
;
5392 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
, domain
,
5394 aux_add_nonlocal_symbols
,
5396 full_match
, compare_names
);
5401 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and, if full_search is
5402 non-zero, enclosing scope and in global scopes, returning the number of
5404 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5405 indicating the symbols found and the blocks and symbol tables (if
5406 any) in which they were found. This vector is transient---good only to
5407 the next call of ada_lookup_symbol_list.
5409 When full_search is non-zero, any non-function/non-enumeral
5410 symbol match within the nest of blocks whose innermost member is BLOCK0,
5411 is the one match returned (no other matches in that or
5412 enclosing blocks is returned). If there are any matches in or
5413 surrounding BLOCK0, then these alone are returned.
5415 Names prefixed with "standard__" are handled specially: "standard__"
5416 is first stripped off, and only static and global symbols are searched. */
5419 ada_lookup_symbol_list_worker (const char *name0
, const struct block
*block0
,
5421 struct ada_symbol_info
**results
,
5425 const struct block
*block
;
5427 const int wild_match_p
= should_use_wild_match (name0
);
5428 int syms_from_global_search
= 0;
5431 obstack_free (&symbol_list_obstack
, NULL
);
5432 obstack_init (&symbol_list_obstack
);
5434 /* Search specified block and its superiors. */
5439 /* Special case: If the user specifies a symbol name inside package
5440 Standard, do a non-wild matching of the symbol name without
5441 the "standard__" prefix. This was primarily introduced in order
5442 to allow the user to specifically access the standard exceptions
5443 using, for instance, Standard.Constraint_Error when Constraint_Error
5444 is ambiguous (due to the user defining its own Constraint_Error
5445 entity inside its program). */
5446 if (startswith (name0
, "standard__"))
5449 name
= name0
+ sizeof ("standard__") - 1;
5452 /* Check the non-global symbols. If we have ANY match, then we're done. */
5458 ada_add_local_symbols (&symbol_list_obstack
, name
, block
,
5459 domain
, wild_match_p
);
5463 /* In the !full_search case we're are being called by
5464 ada_iterate_over_symbols, and we don't want to search
5466 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
5467 domain
, NULL
, wild_match_p
);
5469 if (num_defns_collected (&symbol_list_obstack
) > 0 || !full_search
)
5473 /* No non-global symbols found. Check our cache to see if we have
5474 already performed this search before. If we have, then return
5477 if (lookup_cached_symbol (name0
, domain
, &sym
, &block
))
5480 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5484 syms_from_global_search
= 1;
5486 /* Search symbols from all global blocks. */
5488 add_nonlocal_symbols (&symbol_list_obstack
, name
, domain
, 1,
5491 /* Now add symbols from all per-file blocks if we've gotten no hits
5492 (not strictly correct, but perhaps better than an error). */
5494 if (num_defns_collected (&symbol_list_obstack
) == 0)
5495 add_nonlocal_symbols (&symbol_list_obstack
, name
, domain
, 0,
5499 ndefns
= num_defns_collected (&symbol_list_obstack
);
5500 *results
= defns_collected (&symbol_list_obstack
, 1);
5502 ndefns
= remove_extra_symbols (*results
, ndefns
);
5504 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5505 cache_symbol (name0
, domain
, NULL
, NULL
);
5507 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5508 cache_symbol (name0
, domain
, (*results
)[0].sym
, (*results
)[0].block
);
5510 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5515 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5516 in global scopes, returning the number of matches, and setting *RESULTS
5517 to a vector of (SYM,BLOCK) tuples.
5518 See ada_lookup_symbol_list_worker for further details. */
5521 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5522 domain_enum domain
, struct ada_symbol_info
**results
)
5524 return ada_lookup_symbol_list_worker (name0
, block0
, domain
, results
, 1);
5527 /* Implementation of the la_iterate_over_symbols method. */
5530 ada_iterate_over_symbols (const struct block
*block
,
5531 const char *name
, domain_enum domain
,
5532 symbol_found_callback_ftype
*callback
,
5536 struct ada_symbol_info
*results
;
5538 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5539 for (i
= 0; i
< ndefs
; ++i
)
5541 if (! (*callback
) (results
[i
].sym
, data
))
5546 /* If NAME is the name of an entity, return a string that should
5547 be used to look that entity up in Ada units. This string should
5548 be deallocated after use using xfree.
5550 NAME can have any form that the "break" or "print" commands might
5551 recognize. In other words, it does not have to be the "natural"
5552 name, or the "encoded" name. */
5555 ada_name_for_lookup (const char *name
)
5558 int nlen
= strlen (name
);
5560 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5562 canon
= xmalloc (nlen
- 1);
5563 memcpy (canon
, name
+ 1, nlen
- 2);
5564 canon
[nlen
- 2] = '\0';
5567 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5571 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5572 to 1, but choosing the first symbol found if there are multiple
5575 The result is stored in *INFO, which must be non-NULL.
5576 If no match is found, INFO->SYM is set to NULL. */
5579 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5581 struct ada_symbol_info
*info
)
5583 struct ada_symbol_info
*candidates
;
5586 gdb_assert (info
!= NULL
);
5587 memset (info
, 0, sizeof (struct ada_symbol_info
));
5589 n_candidates
= ada_lookup_symbol_list (name
, block
, domain
, &candidates
);
5590 if (n_candidates
== 0)
5593 *info
= candidates
[0];
5594 info
->sym
= fixup_symbol_section (info
->sym
, NULL
);
5597 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5598 scope and in global scopes, or NULL if none. NAME is folded and
5599 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5600 choosing the first symbol if there are multiple choices.
5601 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5604 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5605 domain_enum domain
, int *is_a_field_of_this
)
5607 struct ada_symbol_info info
;
5609 if (is_a_field_of_this
!= NULL
)
5610 *is_a_field_of_this
= 0;
5612 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5613 block0
, domain
, &info
);
5617 static struct symbol
*
5618 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5620 const struct block
*block
,
5621 const domain_enum domain
)
5625 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5629 /* If we haven't found a match at this point, try the primitive
5630 types. In other languages, this search is performed before
5631 searching for global symbols in order to short-circuit that
5632 global-symbol search if it happens that the name corresponds
5633 to a primitive type. But we cannot do the same in Ada, because
5634 it is perfectly legitimate for a program to declare a type which
5635 has the same name as a standard type. If looking up a type in
5636 that situation, we have traditionally ignored the primitive type
5637 in favor of user-defined types. This is why, unlike most other
5638 languages, we search the primitive types this late and only after
5639 having searched the global symbols without success. */
5641 if (domain
== VAR_DOMAIN
)
5643 struct gdbarch
*gdbarch
;
5646 gdbarch
= target_gdbarch ();
5648 gdbarch
= block_gdbarch (block
);
5649 sym
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5658 /* True iff STR is a possible encoded suffix of a normal Ada name
5659 that is to be ignored for matching purposes. Suffixes of parallel
5660 names (e.g., XVE) are not included here. Currently, the possible suffixes
5661 are given by any of the regular expressions:
5663 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5664 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5665 TKB [subprogram suffix for task bodies]
5666 _E[0-9]+[bs]$ [protected object entry suffixes]
5667 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5669 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5670 match is performed. This sequence is used to differentiate homonyms,
5671 is an optional part of a valid name suffix. */
5674 is_name_suffix (const char *str
)
5677 const char *matching
;
5678 const int len
= strlen (str
);
5680 /* Skip optional leading __[0-9]+. */
5682 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5685 while (isdigit (str
[0]))
5691 if (str
[0] == '.' || str
[0] == '$')
5694 while (isdigit (matching
[0]))
5696 if (matching
[0] == '\0')
5702 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5705 while (isdigit (matching
[0]))
5707 if (matching
[0] == '\0')
5711 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5713 if (strcmp (str
, "TKB") == 0)
5717 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5718 with a N at the end. Unfortunately, the compiler uses the same
5719 convention for other internal types it creates. So treating
5720 all entity names that end with an "N" as a name suffix causes
5721 some regressions. For instance, consider the case of an enumerated
5722 type. To support the 'Image attribute, it creates an array whose
5724 Having a single character like this as a suffix carrying some
5725 information is a bit risky. Perhaps we should change the encoding
5726 to be something like "_N" instead. In the meantime, do not do
5727 the following check. */
5728 /* Protected Object Subprograms */
5729 if (len
== 1 && str
[0] == 'N')
5734 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5737 while (isdigit (matching
[0]))
5739 if ((matching
[0] == 'b' || matching
[0] == 's')
5740 && matching
[1] == '\0')
5744 /* ??? We should not modify STR directly, as we are doing below. This
5745 is fine in this case, but may become problematic later if we find
5746 that this alternative did not work, and want to try matching
5747 another one from the begining of STR. Since we modified it, we
5748 won't be able to find the begining of the string anymore! */
5752 while (str
[0] != '_' && str
[0] != '\0')
5754 if (str
[0] != 'n' && str
[0] != 'b')
5760 if (str
[0] == '\000')
5765 if (str
[1] != '_' || str
[2] == '\000')
5769 if (strcmp (str
+ 3, "JM") == 0)
5771 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5772 the LJM suffix in favor of the JM one. But we will
5773 still accept LJM as a valid suffix for a reasonable
5774 amount of time, just to allow ourselves to debug programs
5775 compiled using an older version of GNAT. */
5776 if (strcmp (str
+ 3, "LJM") == 0)
5780 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5781 || str
[4] == 'U' || str
[4] == 'P')
5783 if (str
[4] == 'R' && str
[5] != 'T')
5787 if (!isdigit (str
[2]))
5789 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5790 if (!isdigit (str
[k
]) && str
[k
] != '_')
5794 if (str
[0] == '$' && isdigit (str
[1]))
5796 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5797 if (!isdigit (str
[k
]) && str
[k
] != '_')
5804 /* Return non-zero if the string starting at NAME and ending before
5805 NAME_END contains no capital letters. */
5808 is_valid_name_for_wild_match (const char *name0
)
5810 const char *decoded_name
= ada_decode (name0
);
5813 /* If the decoded name starts with an angle bracket, it means that
5814 NAME0 does not follow the GNAT encoding format. It should then
5815 not be allowed as a possible wild match. */
5816 if (decoded_name
[0] == '<')
5819 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5820 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5826 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5827 that could start a simple name. Assumes that *NAMEP points into
5828 the string beginning at NAME0. */
5831 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5833 const char *name
= *namep
;
5843 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5846 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
5851 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5852 || name
[2] == target0
))
5860 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5870 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5871 informational suffixes of NAME (i.e., for which is_name_suffix is
5872 true). Assumes that PATN is a lower-cased Ada simple name. */
5875 wild_match (const char *name
, const char *patn
)
5878 const char *name0
= name
;
5882 const char *match
= name
;
5886 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5889 if (*p
== '\0' && is_name_suffix (name
))
5890 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5892 if (name
[-1] == '_')
5895 if (!advance_wild_match (&name
, name0
, *patn
))
5900 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5901 informational suffix. */
5904 full_match (const char *sym_name
, const char *search_name
)
5906 return !match_name (sym_name
, search_name
, 0);
5910 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5911 vector *defn_symbols, updating the list of symbols in OBSTACKP
5912 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5913 OBJFILE is the section containing BLOCK. */
5916 ada_add_block_symbols (struct obstack
*obstackp
,
5917 const struct block
*block
, const char *name
,
5918 domain_enum domain
, struct objfile
*objfile
,
5921 struct block_iterator iter
;
5922 int name_len
= strlen (name
);
5923 /* A matching argument symbol, if any. */
5924 struct symbol
*arg_sym
;
5925 /* Set true when we find a matching non-argument symbol. */
5933 for (sym
= block_iter_match_first (block
, name
, wild_match
, &iter
);
5934 sym
!= NULL
; sym
= block_iter_match_next (name
, wild_match
, &iter
))
5936 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5937 SYMBOL_DOMAIN (sym
), domain
)
5938 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5940 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5942 else if (SYMBOL_IS_ARGUMENT (sym
))
5947 add_defn_to_vec (obstackp
,
5948 fixup_symbol_section (sym
, objfile
),
5956 for (sym
= block_iter_match_first (block
, name
, full_match
, &iter
);
5957 sym
!= NULL
; sym
= block_iter_match_next (name
, full_match
, &iter
))
5959 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5960 SYMBOL_DOMAIN (sym
), domain
))
5962 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5964 if (SYMBOL_IS_ARGUMENT (sym
))
5969 add_defn_to_vec (obstackp
,
5970 fixup_symbol_section (sym
, objfile
),
5978 if (!found_sym
&& arg_sym
!= NULL
)
5980 add_defn_to_vec (obstackp
,
5981 fixup_symbol_section (arg_sym
, objfile
),
5990 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5992 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5993 SYMBOL_DOMAIN (sym
), domain
))
5997 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
6000 cmp
= !startswith (SYMBOL_LINKAGE_NAME (sym
), "_ada_");
6002 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
6007 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
6009 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6011 if (SYMBOL_IS_ARGUMENT (sym
))
6016 add_defn_to_vec (obstackp
,
6017 fixup_symbol_section (sym
, objfile
),
6025 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6026 They aren't parameters, right? */
6027 if (!found_sym
&& arg_sym
!= NULL
)
6029 add_defn_to_vec (obstackp
,
6030 fixup_symbol_section (arg_sym
, objfile
),
6037 /* Symbol Completion */
6039 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
6040 name in a form that's appropriate for the completion. The result
6041 does not need to be deallocated, but is only good until the next call.
6043 TEXT_LEN is equal to the length of TEXT.
6044 Perform a wild match if WILD_MATCH_P is set.
6045 ENCODED_P should be set if TEXT represents the start of a symbol name
6046 in its encoded form. */
6049 symbol_completion_match (const char *sym_name
,
6050 const char *text
, int text_len
,
6051 int wild_match_p
, int encoded_p
)
6053 const int verbatim_match
= (text
[0] == '<');
6058 /* Strip the leading angle bracket. */
6063 /* First, test against the fully qualified name of the symbol. */
6065 if (strncmp (sym_name
, text
, text_len
) == 0)
6068 if (match
&& !encoded_p
)
6070 /* One needed check before declaring a positive match is to verify
6071 that iff we are doing a verbatim match, the decoded version
6072 of the symbol name starts with '<'. Otherwise, this symbol name
6073 is not a suitable completion. */
6074 const char *sym_name_copy
= sym_name
;
6075 int has_angle_bracket
;
6077 sym_name
= ada_decode (sym_name
);
6078 has_angle_bracket
= (sym_name
[0] == '<');
6079 match
= (has_angle_bracket
== verbatim_match
);
6080 sym_name
= sym_name_copy
;
6083 if (match
&& !verbatim_match
)
6085 /* When doing non-verbatim match, another check that needs to
6086 be done is to verify that the potentially matching symbol name
6087 does not include capital letters, because the ada-mode would
6088 not be able to understand these symbol names without the
6089 angle bracket notation. */
6092 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6097 /* Second: Try wild matching... */
6099 if (!match
&& wild_match_p
)
6101 /* Since we are doing wild matching, this means that TEXT
6102 may represent an unqualified symbol name. We therefore must
6103 also compare TEXT against the unqualified name of the symbol. */
6104 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6106 if (strncmp (sym_name
, text
, text_len
) == 0)
6110 /* Finally: If we found a mach, prepare the result to return. */
6116 sym_name
= add_angle_brackets (sym_name
);
6119 sym_name
= ada_decode (sym_name
);
6124 /* A companion function to ada_make_symbol_completion_list().
6125 Check if SYM_NAME represents a symbol which name would be suitable
6126 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
6127 it is appended at the end of the given string vector SV.
6129 ORIG_TEXT is the string original string from the user command
6130 that needs to be completed. WORD is the entire command on which
6131 completion should be performed. These two parameters are used to
6132 determine which part of the symbol name should be added to the
6134 if WILD_MATCH_P is set, then wild matching is performed.
6135 ENCODED_P should be set if TEXT represents a symbol name in its
6136 encoded formed (in which case the completion should also be
6140 symbol_completion_add (VEC(char_ptr
) **sv
,
6141 const char *sym_name
,
6142 const char *text
, int text_len
,
6143 const char *orig_text
, const char *word
,
6144 int wild_match_p
, int encoded_p
)
6146 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
6147 wild_match_p
, encoded_p
);
6153 /* We found a match, so add the appropriate completion to the given
6156 if (word
== orig_text
)
6158 completion
= xmalloc (strlen (match
) + 5);
6159 strcpy (completion
, match
);
6161 else if (word
> orig_text
)
6163 /* Return some portion of sym_name. */
6164 completion
= xmalloc (strlen (match
) + 5);
6165 strcpy (completion
, match
+ (word
- orig_text
));
6169 /* Return some of ORIG_TEXT plus sym_name. */
6170 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
6171 strncpy (completion
, word
, orig_text
- word
);
6172 completion
[orig_text
- word
] = '\0';
6173 strcat (completion
, match
);
6176 VEC_safe_push (char_ptr
, *sv
, completion
);
6179 /* An object of this type is passed as the user_data argument to the
6180 expand_symtabs_matching method. */
6181 struct add_partial_datum
6183 VEC(char_ptr
) **completions
;
6192 /* A callback for expand_symtabs_matching. */
6195 ada_complete_symbol_matcher (const char *name
, void *user_data
)
6197 struct add_partial_datum
*data
= user_data
;
6199 return symbol_completion_match (name
, data
->text
, data
->text_len
,
6200 data
->wild_match
, data
->encoded
) != NULL
;
6203 /* Return a list of possible symbol names completing TEXT0. WORD is
6204 the entire command on which completion is made. */
6206 static VEC (char_ptr
) *
6207 ada_make_symbol_completion_list (const char *text0
, const char *word
,
6208 enum type_code code
)
6214 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
6216 struct compunit_symtab
*s
;
6217 struct minimal_symbol
*msymbol
;
6218 struct objfile
*objfile
;
6219 const struct block
*b
, *surrounding_static_block
= 0;
6221 struct block_iterator iter
;
6222 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6224 gdb_assert (code
== TYPE_CODE_UNDEF
);
6226 if (text0
[0] == '<')
6228 text
= xstrdup (text0
);
6229 make_cleanup (xfree
, text
);
6230 text_len
= strlen (text
);
6236 text
= xstrdup (ada_encode (text0
));
6237 make_cleanup (xfree
, text
);
6238 text_len
= strlen (text
);
6239 for (i
= 0; i
< text_len
; i
++)
6240 text
[i
] = tolower (text
[i
]);
6242 encoded_p
= (strstr (text0
, "__") != NULL
);
6243 /* If the name contains a ".", then the user is entering a fully
6244 qualified entity name, and the match must not be done in wild
6245 mode. Similarly, if the user wants to complete what looks like
6246 an encoded name, the match must not be done in wild mode. */
6247 wild_match_p
= (strchr (text0
, '.') == NULL
&& !encoded_p
);
6250 /* First, look at the partial symtab symbols. */
6252 struct add_partial_datum data
;
6254 data
.completions
= &completions
;
6256 data
.text_len
= text_len
;
6259 data
.wild_match
= wild_match_p
;
6260 data
.encoded
= encoded_p
;
6261 expand_symtabs_matching (NULL
, ada_complete_symbol_matcher
, NULL
,
6265 /* At this point scan through the misc symbol vectors and add each
6266 symbol you find to the list. Eventually we want to ignore
6267 anything that isn't a text symbol (everything else will be
6268 handled by the psymtab code above). */
6270 ALL_MSYMBOLS (objfile
, msymbol
)
6273 symbol_completion_add (&completions
, MSYMBOL_LINKAGE_NAME (msymbol
),
6274 text
, text_len
, text0
, word
, wild_match_p
,
6278 /* Search upwards from currently selected frame (so that we can
6279 complete on local vars. */
6281 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6283 if (!BLOCK_SUPERBLOCK (b
))
6284 surrounding_static_block
= b
; /* For elmin of dups */
6286 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6288 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6289 text
, text_len
, text0
, word
,
6290 wild_match_p
, encoded_p
);
6294 /* Go through the symtabs and check the externs and statics for
6295 symbols which match. */
6297 ALL_COMPUNITS (objfile
, s
)
6300 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6301 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6303 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6304 text
, text_len
, text0
, word
,
6305 wild_match_p
, encoded_p
);
6309 ALL_COMPUNITS (objfile
, s
)
6312 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6313 /* Don't do this block twice. */
6314 if (b
== surrounding_static_block
)
6316 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6318 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6319 text
, text_len
, text0
, word
,
6320 wild_match_p
, encoded_p
);
6324 do_cleanups (old_chain
);
6330 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6331 for tagged types. */
6334 ada_is_dispatch_table_ptr_type (struct type
*type
)
6338 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6341 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6345 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6348 /* Return non-zero if TYPE is an interface tag. */
6351 ada_is_interface_tag (struct type
*type
)
6353 const char *name
= TYPE_NAME (type
);
6358 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6361 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6362 to be invisible to users. */
6365 ada_is_ignored_field (struct type
*type
, int field_num
)
6367 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6370 /* Check the name of that field. */
6372 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6374 /* Anonymous field names should not be printed.
6375 brobecker/2007-02-20: I don't think this can actually happen
6376 but we don't want to print the value of annonymous fields anyway. */
6380 /* Normally, fields whose name start with an underscore ("_")
6381 are fields that have been internally generated by the compiler,
6382 and thus should not be printed. The "_parent" field is special,
6383 however: This is a field internally generated by the compiler
6384 for tagged types, and it contains the components inherited from
6385 the parent type. This field should not be printed as is, but
6386 should not be ignored either. */
6387 if (name
[0] == '_' && !startswith (name
, "_parent"))
6391 /* If this is the dispatch table of a tagged type or an interface tag,
6393 if (ada_is_tagged_type (type
, 1)
6394 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6395 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6398 /* Not a special field, so it should not be ignored. */
6402 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6403 pointer or reference type whose ultimate target has a tag field. */
6406 ada_is_tagged_type (struct type
*type
, int refok
)
6408 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
6411 /* True iff TYPE represents the type of X'Tag */
6414 ada_is_tag_type (struct type
*type
)
6416 type
= ada_check_typedef (type
);
6418 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6422 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6424 return (name
!= NULL
6425 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6429 /* The type of the tag on VAL. */
6432 ada_tag_type (struct value
*val
)
6434 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6437 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6438 retired at Ada 05). */
6441 is_ada95_tag (struct value
*tag
)
6443 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6446 /* The value of the tag on VAL. */
6449 ada_value_tag (struct value
*val
)
6451 return ada_value_struct_elt (val
, "_tag", 0);
6454 /* The value of the tag on the object of type TYPE whose contents are
6455 saved at VALADDR, if it is non-null, or is at memory address
6458 static struct value
*
6459 value_tag_from_contents_and_address (struct type
*type
,
6460 const gdb_byte
*valaddr
,
6463 int tag_byte_offset
;
6464 struct type
*tag_type
;
6466 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6469 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6471 : valaddr
+ tag_byte_offset
);
6472 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6474 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6479 static struct type
*
6480 type_from_tag (struct value
*tag
)
6482 const char *type_name
= ada_tag_name (tag
);
6484 if (type_name
!= NULL
)
6485 return ada_find_any_type (ada_encode (type_name
));
6489 /* Given a value OBJ of a tagged type, return a value of this
6490 type at the base address of the object. The base address, as
6491 defined in Ada.Tags, it is the address of the primary tag of
6492 the object, and therefore where the field values of its full
6493 view can be fetched. */
6496 ada_tag_value_at_base_address (struct value
*obj
)
6499 LONGEST offset_to_top
= 0;
6500 struct type
*ptr_type
, *obj_type
;
6502 CORE_ADDR base_address
;
6504 obj_type
= value_type (obj
);
6506 /* It is the responsability of the caller to deref pointers. */
6508 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6509 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6512 tag
= ada_value_tag (obj
);
6516 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6518 if (is_ada95_tag (tag
))
6521 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6522 ptr_type
= lookup_pointer_type (ptr_type
);
6523 val
= value_cast (ptr_type
, tag
);
6527 /* It is perfectly possible that an exception be raised while
6528 trying to determine the base address, just like for the tag;
6529 see ada_tag_name for more details. We do not print the error
6530 message for the same reason. */
6534 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6537 CATCH (e
, RETURN_MASK_ERROR
)
6543 /* If offset is null, nothing to do. */
6545 if (offset_to_top
== 0)
6548 /* -1 is a special case in Ada.Tags; however, what should be done
6549 is not quite clear from the documentation. So do nothing for
6552 if (offset_to_top
== -1)
6555 base_address
= value_address (obj
) - offset_to_top
;
6556 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6558 /* Make sure that we have a proper tag at the new address.
6559 Otherwise, offset_to_top is bogus (which can happen when
6560 the object is not initialized yet). */
6565 obj_type
= type_from_tag (tag
);
6570 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6573 /* Return the "ada__tags__type_specific_data" type. */
6575 static struct type
*
6576 ada_get_tsd_type (struct inferior
*inf
)
6578 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6580 if (data
->tsd_type
== 0)
6581 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6582 return data
->tsd_type
;
6585 /* Return the TSD (type-specific data) associated to the given TAG.
6586 TAG is assumed to be the tag of a tagged-type entity.
6588 May return NULL if we are unable to get the TSD. */
6590 static struct value
*
6591 ada_get_tsd_from_tag (struct value
*tag
)
6596 /* First option: The TSD is simply stored as a field of our TAG.
6597 Only older versions of GNAT would use this format, but we have
6598 to test it first, because there are no visible markers for
6599 the current approach except the absence of that field. */
6601 val
= ada_value_struct_elt (tag
, "tsd", 1);
6605 /* Try the second representation for the dispatch table (in which
6606 there is no explicit 'tsd' field in the referent of the tag pointer,
6607 and instead the tsd pointer is stored just before the dispatch
6610 type
= ada_get_tsd_type (current_inferior());
6613 type
= lookup_pointer_type (lookup_pointer_type (type
));
6614 val
= value_cast (type
, tag
);
6617 return value_ind (value_ptradd (val
, -1));
6620 /* Given the TSD of a tag (type-specific data), return a string
6621 containing the name of the associated type.
6623 The returned value is good until the next call. May return NULL
6624 if we are unable to determine the tag name. */
6627 ada_tag_name_from_tsd (struct value
*tsd
)
6629 static char name
[1024];
6633 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6636 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6637 for (p
= name
; *p
!= '\0'; p
+= 1)
6643 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6646 Return NULL if the TAG is not an Ada tag, or if we were unable to
6647 determine the name of that tag. The result is good until the next
6651 ada_tag_name (struct value
*tag
)
6655 if (!ada_is_tag_type (value_type (tag
)))
6658 /* It is perfectly possible that an exception be raised while trying
6659 to determine the TAG's name, even under normal circumstances:
6660 The associated variable may be uninitialized or corrupted, for
6661 instance. We do not let any exception propagate past this point.
6662 instead we return NULL.
6664 We also do not print the error message either (which often is very
6665 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6666 the caller print a more meaningful message if necessary. */
6669 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6672 name
= ada_tag_name_from_tsd (tsd
);
6674 CATCH (e
, RETURN_MASK_ERROR
)
6682 /* The parent type of TYPE, or NULL if none. */
6685 ada_parent_type (struct type
*type
)
6689 type
= ada_check_typedef (type
);
6691 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6694 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6695 if (ada_is_parent_field (type
, i
))
6697 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6699 /* If the _parent field is a pointer, then dereference it. */
6700 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6701 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6702 /* If there is a parallel XVS type, get the actual base type. */
6703 parent_type
= ada_get_base_type (parent_type
);
6705 return ada_check_typedef (parent_type
);
6711 /* True iff field number FIELD_NUM of structure type TYPE contains the
6712 parent-type (inherited) fields of a derived type. Assumes TYPE is
6713 a structure type with at least FIELD_NUM+1 fields. */
6716 ada_is_parent_field (struct type
*type
, int field_num
)
6718 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6720 return (name
!= NULL
6721 && (startswith (name
, "PARENT")
6722 || startswith (name
, "_parent")));
6725 /* True iff field number FIELD_NUM of structure type TYPE is a
6726 transparent wrapper field (which should be silently traversed when doing
6727 field selection and flattened when printing). Assumes TYPE is a
6728 structure type with at least FIELD_NUM+1 fields. Such fields are always
6732 ada_is_wrapper_field (struct type
*type
, int field_num
)
6734 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6736 return (name
!= NULL
6737 && (startswith (name
, "PARENT")
6738 || strcmp (name
, "REP") == 0
6739 || startswith (name
, "_parent")
6740 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6743 /* True iff field number FIELD_NUM of structure or union type TYPE
6744 is a variant wrapper. Assumes TYPE is a structure type with at least
6745 FIELD_NUM+1 fields. */
6748 ada_is_variant_part (struct type
*type
, int field_num
)
6750 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6752 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6753 || (is_dynamic_field (type
, field_num
)
6754 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6755 == TYPE_CODE_UNION
)));
6758 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6759 whose discriminants are contained in the record type OUTER_TYPE,
6760 returns the type of the controlling discriminant for the variant.
6761 May return NULL if the type could not be found. */
6764 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6766 char *name
= ada_variant_discrim_name (var_type
);
6768 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6771 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6772 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6773 represents a 'when others' clause; otherwise 0. */
6776 ada_is_others_clause (struct type
*type
, int field_num
)
6778 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6780 return (name
!= NULL
&& name
[0] == 'O');
6783 /* Assuming that TYPE0 is the type of the variant part of a record,
6784 returns the name of the discriminant controlling the variant.
6785 The value is valid until the next call to ada_variant_discrim_name. */
6788 ada_variant_discrim_name (struct type
*type0
)
6790 static char *result
= NULL
;
6791 static size_t result_len
= 0;
6794 const char *discrim_end
;
6795 const char *discrim_start
;
6797 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6798 type
= TYPE_TARGET_TYPE (type0
);
6802 name
= ada_type_name (type
);
6804 if (name
== NULL
|| name
[0] == '\000')
6807 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6810 if (startswith (discrim_end
, "___XVN"))
6813 if (discrim_end
== name
)
6816 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6819 if (discrim_start
== name
+ 1)
6821 if ((discrim_start
> name
+ 3
6822 && startswith (discrim_start
- 3, "___"))
6823 || discrim_start
[-1] == '.')
6827 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6828 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6829 result
[discrim_end
- discrim_start
] = '\0';
6833 /* Scan STR for a subtype-encoded number, beginning at position K.
6834 Put the position of the character just past the number scanned in
6835 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6836 Return 1 if there was a valid number at the given position, and 0
6837 otherwise. A "subtype-encoded" number consists of the absolute value
6838 in decimal, followed by the letter 'm' to indicate a negative number.
6839 Assumes 0m does not occur. */
6842 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6846 if (!isdigit (str
[k
]))
6849 /* Do it the hard way so as not to make any assumption about
6850 the relationship of unsigned long (%lu scan format code) and
6853 while (isdigit (str
[k
]))
6855 RU
= RU
* 10 + (str
[k
] - '0');
6862 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6868 /* NOTE on the above: Technically, C does not say what the results of
6869 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6870 number representable as a LONGEST (although either would probably work
6871 in most implementations). When RU>0, the locution in the then branch
6872 above is always equivalent to the negative of RU. */
6879 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6880 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6881 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6884 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6886 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6900 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6910 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6911 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6913 if (val
>= L
&& val
<= U
)
6925 /* FIXME: Lots of redundancy below. Try to consolidate. */
6927 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6928 ARG_TYPE, extract and return the value of one of its (non-static)
6929 fields. FIELDNO says which field. Differs from value_primitive_field
6930 only in that it can handle packed values of arbitrary type. */
6932 static struct value
*
6933 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6934 struct type
*arg_type
)
6938 arg_type
= ada_check_typedef (arg_type
);
6939 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6941 /* Handle packed fields. */
6943 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6945 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6946 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6948 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6949 offset
+ bit_pos
/ 8,
6950 bit_pos
% 8, bit_size
, type
);
6953 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6956 /* Find field with name NAME in object of type TYPE. If found,
6957 set the following for each argument that is non-null:
6958 - *FIELD_TYPE_P to the field's type;
6959 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6960 an object of that type;
6961 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6962 - *BIT_SIZE_P to its size in bits if the field is packed, and
6964 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6965 fields up to but not including the desired field, or by the total
6966 number of fields if not found. A NULL value of NAME never
6967 matches; the function just counts visible fields in this case.
6969 Returns 1 if found, 0 otherwise. */
6972 find_struct_field (const char *name
, struct type
*type
, int offset
,
6973 struct type
**field_type_p
,
6974 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6979 type
= ada_check_typedef (type
);
6981 if (field_type_p
!= NULL
)
6982 *field_type_p
= NULL
;
6983 if (byte_offset_p
!= NULL
)
6985 if (bit_offset_p
!= NULL
)
6987 if (bit_size_p
!= NULL
)
6990 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6992 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6993 int fld_offset
= offset
+ bit_pos
/ 8;
6994 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6996 if (t_field_name
== NULL
)
6999 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7001 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7003 if (field_type_p
!= NULL
)
7004 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7005 if (byte_offset_p
!= NULL
)
7006 *byte_offset_p
= fld_offset
;
7007 if (bit_offset_p
!= NULL
)
7008 *bit_offset_p
= bit_pos
% 8;
7009 if (bit_size_p
!= NULL
)
7010 *bit_size_p
= bit_size
;
7013 else if (ada_is_wrapper_field (type
, i
))
7015 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7016 field_type_p
, byte_offset_p
, bit_offset_p
,
7017 bit_size_p
, index_p
))
7020 else if (ada_is_variant_part (type
, i
))
7022 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7025 struct type
*field_type
7026 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7028 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7030 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7032 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7033 field_type_p
, byte_offset_p
,
7034 bit_offset_p
, bit_size_p
, index_p
))
7038 else if (index_p
!= NULL
)
7044 /* Number of user-visible fields in record type TYPE. */
7047 num_visible_fields (struct type
*type
)
7052 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7056 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7057 and search in it assuming it has (class) type TYPE.
7058 If found, return value, else return NULL.
7060 Searches recursively through wrapper fields (e.g., '_parent'). */
7062 static struct value
*
7063 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
7068 type
= ada_check_typedef (type
);
7069 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7071 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7073 if (t_field_name
== NULL
)
7076 else if (field_name_match (t_field_name
, name
))
7077 return ada_value_primitive_field (arg
, offset
, i
, type
);
7079 else if (ada_is_wrapper_field (type
, i
))
7081 struct value
*v
= /* Do not let indent join lines here. */
7082 ada_search_struct_field (name
, arg
,
7083 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7084 TYPE_FIELD_TYPE (type
, i
));
7090 else if (ada_is_variant_part (type
, i
))
7092 /* PNH: Do we ever get here? See find_struct_field. */
7094 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7096 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7098 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7100 struct value
*v
= ada_search_struct_field
/* Force line
7103 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7104 TYPE_FIELD_TYPE (field_type
, j
));
7114 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7115 int, struct type
*);
7118 /* Return field #INDEX in ARG, where the index is that returned by
7119 * find_struct_field through its INDEX_P argument. Adjust the address
7120 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7121 * If found, return value, else return NULL. */
7123 static struct value
*
7124 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7127 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7131 /* Auxiliary function for ada_index_struct_field. Like
7132 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7135 static struct value
*
7136 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7140 type
= ada_check_typedef (type
);
7142 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7144 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7146 else if (ada_is_wrapper_field (type
, i
))
7148 struct value
*v
= /* Do not let indent join lines here. */
7149 ada_index_struct_field_1 (index_p
, arg
,
7150 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7151 TYPE_FIELD_TYPE (type
, i
));
7157 else if (ada_is_variant_part (type
, i
))
7159 /* PNH: Do we ever get here? See ada_search_struct_field,
7160 find_struct_field. */
7161 error (_("Cannot assign this kind of variant record"));
7163 else if (*index_p
== 0)
7164 return ada_value_primitive_field (arg
, offset
, i
, type
);
7171 /* Given ARG, a value of type (pointer or reference to a)*
7172 structure/union, extract the component named NAME from the ultimate
7173 target structure/union and return it as a value with its
7176 The routine searches for NAME among all members of the structure itself
7177 and (recursively) among all members of any wrapper members
7180 If NO_ERR, then simply return NULL in case of error, rather than
7184 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
7186 struct type
*t
, *t1
;
7190 t1
= t
= ada_check_typedef (value_type (arg
));
7191 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7193 t1
= TYPE_TARGET_TYPE (t
);
7196 t1
= ada_check_typedef (t1
);
7197 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7199 arg
= coerce_ref (arg
);
7204 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7206 t1
= TYPE_TARGET_TYPE (t
);
7209 t1
= ada_check_typedef (t1
);
7210 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7212 arg
= value_ind (arg
);
7219 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7223 v
= ada_search_struct_field (name
, arg
, 0, t
);
7226 int bit_offset
, bit_size
, byte_offset
;
7227 struct type
*field_type
;
7230 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7231 address
= value_address (ada_value_ind (arg
));
7233 address
= value_address (ada_coerce_ref (arg
));
7235 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7236 if (find_struct_field (name
, t1
, 0,
7237 &field_type
, &byte_offset
, &bit_offset
,
7242 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7243 arg
= ada_coerce_ref (arg
);
7245 arg
= ada_value_ind (arg
);
7246 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7247 bit_offset
, bit_size
,
7251 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7255 if (v
!= NULL
|| no_err
)
7258 error (_("There is no member named %s."), name
);
7264 error (_("Attempt to extract a component of "
7265 "a value that is not a record."));
7268 /* Given a type TYPE, look up the type of the component of type named NAME.
7269 If DISPP is non-null, add its byte displacement from the beginning of a
7270 structure (pointed to by a value) of type TYPE to *DISPP (does not
7271 work for packed fields).
7273 Matches any field whose name has NAME as a prefix, possibly
7276 TYPE can be either a struct or union. If REFOK, TYPE may also
7277 be a (pointer or reference)+ to a struct or union, and the
7278 ultimate target type will be searched.
7280 Looks recursively into variant clauses and parent types.
7282 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7283 TYPE is not a type of the right kind. */
7285 static struct type
*
7286 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7287 int noerr
, int *dispp
)
7294 if (refok
&& type
!= NULL
)
7297 type
= ada_check_typedef (type
);
7298 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7299 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7301 type
= TYPE_TARGET_TYPE (type
);
7305 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7306 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7312 target_terminal_ours ();
7313 gdb_flush (gdb_stdout
);
7315 error (_("Type (null) is not a structure or union type"));
7318 /* XXX: type_sprint */
7319 fprintf_unfiltered (gdb_stderr
, _("Type "));
7320 type_print (type
, "", gdb_stderr
, -1);
7321 error (_(" is not a structure or union type"));
7326 type
= to_static_fixed_type (type
);
7328 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7330 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7334 if (t_field_name
== NULL
)
7337 else if (field_name_match (t_field_name
, name
))
7340 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7341 return TYPE_FIELD_TYPE (type
, i
);
7344 else if (ada_is_wrapper_field (type
, i
))
7347 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7352 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7357 else if (ada_is_variant_part (type
, i
))
7360 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7363 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7365 /* FIXME pnh 2008/01/26: We check for a field that is
7366 NOT wrapped in a struct, since the compiler sometimes
7367 generates these for unchecked variant types. Revisit
7368 if the compiler changes this practice. */
7369 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7371 if (v_field_name
!= NULL
7372 && field_name_match (v_field_name
, name
))
7373 t
= TYPE_FIELD_TYPE (field_type
, j
);
7375 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7382 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7393 target_terminal_ours ();
7394 gdb_flush (gdb_stdout
);
7397 /* XXX: type_sprint */
7398 fprintf_unfiltered (gdb_stderr
, _("Type "));
7399 type_print (type
, "", gdb_stderr
, -1);
7400 error (_(" has no component named <null>"));
7404 /* XXX: type_sprint */
7405 fprintf_unfiltered (gdb_stderr
, _("Type "));
7406 type_print (type
, "", gdb_stderr
, -1);
7407 error (_(" has no component named %s"), name
);
7414 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7415 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7416 represents an unchecked union (that is, the variant part of a
7417 record that is named in an Unchecked_Union pragma). */
7420 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7422 char *discrim_name
= ada_variant_discrim_name (var_type
);
7424 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
7429 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7430 within a value of type OUTER_TYPE that is stored in GDB at
7431 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7432 numbering from 0) is applicable. Returns -1 if none are. */
7435 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7436 const gdb_byte
*outer_valaddr
)
7440 char *discrim_name
= ada_variant_discrim_name (var_type
);
7441 struct value
*outer
;
7442 struct value
*discrim
;
7443 LONGEST discrim_val
;
7445 /* Using plain value_from_contents_and_address here causes problems
7446 because we will end up trying to resolve a type that is currently
7447 being constructed. */
7448 outer
= value_from_contents_and_address_unresolved (outer_type
,
7450 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7451 if (discrim
== NULL
)
7453 discrim_val
= value_as_long (discrim
);
7456 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7458 if (ada_is_others_clause (var_type
, i
))
7460 else if (ada_in_variant (discrim_val
, var_type
, i
))
7464 return others_clause
;
7469 /* Dynamic-Sized Records */
7471 /* Strategy: The type ostensibly attached to a value with dynamic size
7472 (i.e., a size that is not statically recorded in the debugging
7473 data) does not accurately reflect the size or layout of the value.
7474 Our strategy is to convert these values to values with accurate,
7475 conventional types that are constructed on the fly. */
7477 /* There is a subtle and tricky problem here. In general, we cannot
7478 determine the size of dynamic records without its data. However,
7479 the 'struct value' data structure, which GDB uses to represent
7480 quantities in the inferior process (the target), requires the size
7481 of the type at the time of its allocation in order to reserve space
7482 for GDB's internal copy of the data. That's why the
7483 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7484 rather than struct value*s.
7486 However, GDB's internal history variables ($1, $2, etc.) are
7487 struct value*s containing internal copies of the data that are not, in
7488 general, the same as the data at their corresponding addresses in
7489 the target. Fortunately, the types we give to these values are all
7490 conventional, fixed-size types (as per the strategy described
7491 above), so that we don't usually have to perform the
7492 'to_fixed_xxx_type' conversions to look at their values.
7493 Unfortunately, there is one exception: if one of the internal
7494 history variables is an array whose elements are unconstrained
7495 records, then we will need to create distinct fixed types for each
7496 element selected. */
7498 /* The upshot of all of this is that many routines take a (type, host
7499 address, target address) triple as arguments to represent a value.
7500 The host address, if non-null, is supposed to contain an internal
7501 copy of the relevant data; otherwise, the program is to consult the
7502 target at the target address. */
7504 /* Assuming that VAL0 represents a pointer value, the result of
7505 dereferencing it. Differs from value_ind in its treatment of
7506 dynamic-sized types. */
7509 ada_value_ind (struct value
*val0
)
7511 struct value
*val
= value_ind (val0
);
7513 if (ada_is_tagged_type (value_type (val
), 0))
7514 val
= ada_tag_value_at_base_address (val
);
7516 return ada_to_fixed_value (val
);
7519 /* The value resulting from dereferencing any "reference to"
7520 qualifiers on VAL0. */
7522 static struct value
*
7523 ada_coerce_ref (struct value
*val0
)
7525 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7527 struct value
*val
= val0
;
7529 val
= coerce_ref (val
);
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
);
7540 /* Return OFF rounded upward if necessary to a multiple of
7541 ALIGNMENT (a power of 2). */
7544 align_value (unsigned int off
, unsigned int alignment
)
7546 return (off
+ alignment
- 1) & ~(alignment
- 1);
7549 /* Return the bit alignment required for field #F of template type TYPE. */
7552 field_alignment (struct type
*type
, int f
)
7554 const char *name
= TYPE_FIELD_NAME (type
, f
);
7558 /* The field name should never be null, unless the debugging information
7559 is somehow malformed. In this case, we assume the field does not
7560 require any alignment. */
7564 len
= strlen (name
);
7566 if (!isdigit (name
[len
- 1]))
7569 if (isdigit (name
[len
- 2]))
7570 align_offset
= len
- 2;
7572 align_offset
= len
- 1;
7574 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7575 return TARGET_CHAR_BIT
;
7577 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7580 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7582 static struct symbol
*
7583 ada_find_any_type_symbol (const char *name
)
7587 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7588 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7591 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7595 /* Find a type named NAME. Ignores ambiguity. This routine will look
7596 solely for types defined by debug info, it will not search the GDB
7599 static struct type
*
7600 ada_find_any_type (const char *name
)
7602 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7605 return SYMBOL_TYPE (sym
);
7610 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7611 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7612 symbol, in which case it is returned. Otherwise, this looks for
7613 symbols whose name is that of NAME_SYM suffixed with "___XR".
7614 Return symbol if found, and NULL otherwise. */
7617 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7619 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7622 if (strstr (name
, "___XR") != NULL
)
7625 sym
= find_old_style_renaming_symbol (name
, block
);
7630 /* Not right yet. FIXME pnh 7/20/2007. */
7631 sym
= ada_find_any_type_symbol (name
);
7632 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7638 static struct symbol
*
7639 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7641 const struct symbol
*function_sym
= block_linkage_function (block
);
7644 if (function_sym
!= NULL
)
7646 /* If the symbol is defined inside a function, NAME is not fully
7647 qualified. This means we need to prepend the function name
7648 as well as adding the ``___XR'' suffix to build the name of
7649 the associated renaming symbol. */
7650 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7651 /* Function names sometimes contain suffixes used
7652 for instance to qualify nested subprograms. When building
7653 the XR type name, we need to make sure that this suffix is
7654 not included. So do not include any suffix in the function
7655 name length below. */
7656 int function_name_len
= ada_name_prefix_len (function_name
);
7657 const int rename_len
= function_name_len
+ 2 /* "__" */
7658 + strlen (name
) + 6 /* "___XR\0" */ ;
7660 /* Strip the suffix if necessary. */
7661 ada_remove_trailing_digits (function_name
, &function_name_len
);
7662 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7663 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7665 /* Library-level functions are a special case, as GNAT adds
7666 a ``_ada_'' prefix to the function name to avoid namespace
7667 pollution. However, the renaming symbols themselves do not
7668 have this prefix, so we need to skip this prefix if present. */
7669 if (function_name_len
> 5 /* "_ada_" */
7670 && strstr (function_name
, "_ada_") == function_name
)
7673 function_name_len
-= 5;
7676 rename
= (char *) alloca (rename_len
* sizeof (char));
7677 strncpy (rename
, function_name
, function_name_len
);
7678 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7683 const int rename_len
= strlen (name
) + 6;
7685 rename
= (char *) alloca (rename_len
* sizeof (char));
7686 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7689 return ada_find_any_type_symbol (rename
);
7692 /* Because of GNAT encoding conventions, several GDB symbols may match a
7693 given type name. If the type denoted by TYPE0 is to be preferred to
7694 that of TYPE1 for purposes of type printing, return non-zero;
7695 otherwise return 0. */
7698 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7702 else if (type0
== NULL
)
7704 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7706 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7708 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7710 else if (ada_is_constrained_packed_array_type (type0
))
7712 else if (ada_is_array_descriptor_type (type0
)
7713 && !ada_is_array_descriptor_type (type1
))
7717 const char *type0_name
= type_name_no_tag (type0
);
7718 const char *type1_name
= type_name_no_tag (type1
);
7720 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7721 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7727 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7728 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7731 ada_type_name (struct type
*type
)
7735 else if (TYPE_NAME (type
) != NULL
)
7736 return TYPE_NAME (type
);
7738 return TYPE_TAG_NAME (type
);
7741 /* Search the list of "descriptive" types associated to TYPE for a type
7742 whose name is NAME. */
7744 static struct type
*
7745 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7747 struct type
*result
;
7749 if (ada_ignore_descriptive_types_p
)
7752 /* If there no descriptive-type info, then there is no parallel type
7754 if (!HAVE_GNAT_AUX_INFO (type
))
7757 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7758 while (result
!= NULL
)
7760 const char *result_name
= ada_type_name (result
);
7762 if (result_name
== NULL
)
7764 warning (_("unexpected null name on descriptive type"));
7768 /* If the names match, stop. */
7769 if (strcmp (result_name
, name
) == 0)
7772 /* Otherwise, look at the next item on the list, if any. */
7773 if (HAVE_GNAT_AUX_INFO (result
))
7774 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7779 /* If we didn't find a match, see whether this is a packed array. With
7780 older compilers, the descriptive type information is either absent or
7781 irrelevant when it comes to packed arrays so the above lookup fails.
7782 Fall back to using a parallel lookup by name in this case. */
7783 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7784 return ada_find_any_type (name
);
7789 /* Find a parallel type to TYPE with the specified NAME, using the
7790 descriptive type taken from the debugging information, if available,
7791 and otherwise using the (slower) name-based method. */
7793 static struct type
*
7794 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7796 struct type
*result
= NULL
;
7798 if (HAVE_GNAT_AUX_INFO (type
))
7799 result
= find_parallel_type_by_descriptive_type (type
, name
);
7801 result
= ada_find_any_type (name
);
7806 /* Same as above, but specify the name of the parallel type by appending
7807 SUFFIX to the name of TYPE. */
7810 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7813 const char *type_name
= ada_type_name (type
);
7816 if (type_name
== NULL
)
7819 len
= strlen (type_name
);
7821 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7823 strcpy (name
, type_name
);
7824 strcpy (name
+ len
, suffix
);
7826 return ada_find_parallel_type_with_name (type
, name
);
7829 /* If TYPE is a variable-size record type, return the corresponding template
7830 type describing its fields. Otherwise, return NULL. */
7832 static struct type
*
7833 dynamic_template_type (struct type
*type
)
7835 type
= ada_check_typedef (type
);
7837 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7838 || ada_type_name (type
) == NULL
)
7842 int len
= strlen (ada_type_name (type
));
7844 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7847 return ada_find_parallel_type (type
, "___XVE");
7851 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7852 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7855 is_dynamic_field (struct type
*templ_type
, int field_num
)
7857 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7860 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7861 && strstr (name
, "___XVL") != NULL
;
7864 /* The index of the variant field of TYPE, or -1 if TYPE does not
7865 represent a variant record type. */
7868 variant_field_index (struct type
*type
)
7872 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7875 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7877 if (ada_is_variant_part (type
, f
))
7883 /* A record type with no fields. */
7885 static struct type
*
7886 empty_record (struct type
*templ
)
7888 struct type
*type
= alloc_type_copy (templ
);
7890 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7891 TYPE_NFIELDS (type
) = 0;
7892 TYPE_FIELDS (type
) = NULL
;
7893 INIT_CPLUS_SPECIFIC (type
);
7894 TYPE_NAME (type
) = "<empty>";
7895 TYPE_TAG_NAME (type
) = NULL
;
7896 TYPE_LENGTH (type
) = 0;
7900 /* An ordinary record type (with fixed-length fields) that describes
7901 the value of type TYPE at VALADDR or ADDRESS (see comments at
7902 the beginning of this section) VAL according to GNAT conventions.
7903 DVAL0 should describe the (portion of a) record that contains any
7904 necessary discriminants. It should be NULL if value_type (VAL) is
7905 an outer-level type (i.e., as opposed to a branch of a variant.) A
7906 variant field (unless unchecked) is replaced by a particular branch
7909 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7910 length are not statically known are discarded. As a consequence,
7911 VALADDR, ADDRESS and DVAL0 are ignored.
7913 NOTE: Limitations: For now, we assume that dynamic fields and
7914 variants occupy whole numbers of bytes. However, they need not be
7918 ada_template_to_fixed_record_type_1 (struct type
*type
,
7919 const gdb_byte
*valaddr
,
7920 CORE_ADDR address
, struct value
*dval0
,
7921 int keep_dynamic_fields
)
7923 struct value
*mark
= value_mark ();
7926 int nfields
, bit_len
;
7932 /* Compute the number of fields in this record type that are going
7933 to be processed: unless keep_dynamic_fields, this includes only
7934 fields whose position and length are static will be processed. */
7935 if (keep_dynamic_fields
)
7936 nfields
= TYPE_NFIELDS (type
);
7940 while (nfields
< TYPE_NFIELDS (type
)
7941 && !ada_is_variant_part (type
, nfields
)
7942 && !is_dynamic_field (type
, nfields
))
7946 rtype
= alloc_type_copy (type
);
7947 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7948 INIT_CPLUS_SPECIFIC (rtype
);
7949 TYPE_NFIELDS (rtype
) = nfields
;
7950 TYPE_FIELDS (rtype
) = (struct field
*)
7951 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7952 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7953 TYPE_NAME (rtype
) = ada_type_name (type
);
7954 TYPE_TAG_NAME (rtype
) = NULL
;
7955 TYPE_FIXED_INSTANCE (rtype
) = 1;
7961 for (f
= 0; f
< nfields
; f
+= 1)
7963 off
= align_value (off
, field_alignment (type
, f
))
7964 + TYPE_FIELD_BITPOS (type
, f
);
7965 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
7966 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7968 if (ada_is_variant_part (type
, f
))
7973 else if (is_dynamic_field (type
, f
))
7975 const gdb_byte
*field_valaddr
= valaddr
;
7976 CORE_ADDR field_address
= address
;
7977 struct type
*field_type
=
7978 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7982 /* rtype's length is computed based on the run-time
7983 value of discriminants. If the discriminants are not
7984 initialized, the type size may be completely bogus and
7985 GDB may fail to allocate a value for it. So check the
7986 size first before creating the value. */
7987 ada_ensure_varsize_limit (rtype
);
7988 /* Using plain value_from_contents_and_address here
7989 causes problems because we will end up trying to
7990 resolve a type that is currently being
7992 dval
= value_from_contents_and_address_unresolved (rtype
,
7995 rtype
= value_type (dval
);
8000 /* If the type referenced by this field is an aligner type, we need
8001 to unwrap that aligner type, because its size might not be set.
8002 Keeping the aligner type would cause us to compute the wrong
8003 size for this field, impacting the offset of the all the fields
8004 that follow this one. */
8005 if (ada_is_aligner_type (field_type
))
8007 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8009 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8010 field_address
= cond_offset_target (field_address
, field_offset
);
8011 field_type
= ada_aligned_type (field_type
);
8014 field_valaddr
= cond_offset_host (field_valaddr
,
8015 off
/ TARGET_CHAR_BIT
);
8016 field_address
= cond_offset_target (field_address
,
8017 off
/ TARGET_CHAR_BIT
);
8019 /* Get the fixed type of the field. Note that, in this case,
8020 we do not want to get the real type out of the tag: if
8021 the current field is the parent part of a tagged record,
8022 we will get the tag of the object. Clearly wrong: the real
8023 type of the parent is not the real type of the child. We
8024 would end up in an infinite loop. */
8025 field_type
= ada_get_base_type (field_type
);
8026 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8027 field_address
, dval
, 0);
8028 /* If the field size is already larger than the maximum
8029 object size, then the record itself will necessarily
8030 be larger than the maximum object size. We need to make
8031 this check now, because the size might be so ridiculously
8032 large (due to an uninitialized variable in the inferior)
8033 that it would cause an overflow when adding it to the
8035 ada_ensure_varsize_limit (field_type
);
8037 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8038 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8039 /* The multiplication can potentially overflow. But because
8040 the field length has been size-checked just above, and
8041 assuming that the maximum size is a reasonable value,
8042 an overflow should not happen in practice. So rather than
8043 adding overflow recovery code to this already complex code,
8044 we just assume that it's not going to happen. */
8046 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8050 /* Note: If this field's type is a typedef, it is important
8051 to preserve the typedef layer.
8053 Otherwise, we might be transforming a typedef to a fat
8054 pointer (encoding a pointer to an unconstrained array),
8055 into a basic fat pointer (encoding an unconstrained
8056 array). As both types are implemented using the same
8057 structure, the typedef is the only clue which allows us
8058 to distinguish between the two options. Stripping it
8059 would prevent us from printing this field appropriately. */
8060 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8061 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8062 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8064 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8067 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8069 /* We need to be careful of typedefs when computing
8070 the length of our field. If this is a typedef,
8071 get the length of the target type, not the length
8073 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8074 field_type
= ada_typedef_target_type (field_type
);
8077 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8080 if (off
+ fld_bit_len
> bit_len
)
8081 bit_len
= off
+ fld_bit_len
;
8083 TYPE_LENGTH (rtype
) =
8084 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8087 /* We handle the variant part, if any, at the end because of certain
8088 odd cases in which it is re-ordered so as NOT to be the last field of
8089 the record. This can happen in the presence of representation
8091 if (variant_field
>= 0)
8093 struct type
*branch_type
;
8095 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8099 /* Using plain value_from_contents_and_address here causes
8100 problems because we will end up trying to resolve a type
8101 that is currently being constructed. */
8102 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8104 rtype
= value_type (dval
);
8110 to_fixed_variant_branch_type
8111 (TYPE_FIELD_TYPE (type
, variant_field
),
8112 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8113 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8114 if (branch_type
== NULL
)
8116 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8117 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8118 TYPE_NFIELDS (rtype
) -= 1;
8122 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8123 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8125 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8127 if (off
+ fld_bit_len
> bit_len
)
8128 bit_len
= off
+ fld_bit_len
;
8129 TYPE_LENGTH (rtype
) =
8130 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8134 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8135 should contain the alignment of that record, which should be a strictly
8136 positive value. If null or negative, then something is wrong, most
8137 probably in the debug info. In that case, we don't round up the size
8138 of the resulting type. If this record is not part of another structure,
8139 the current RTYPE length might be good enough for our purposes. */
8140 if (TYPE_LENGTH (type
) <= 0)
8142 if (TYPE_NAME (rtype
))
8143 warning (_("Invalid type size for `%s' detected: %d."),
8144 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8146 warning (_("Invalid type size for <unnamed> detected: %d."),
8147 TYPE_LENGTH (type
));
8151 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8152 TYPE_LENGTH (type
));
8155 value_free_to_mark (mark
);
8156 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8157 error (_("record type with dynamic size is larger than varsize-limit"));
8161 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8164 static struct type
*
8165 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8166 CORE_ADDR address
, struct value
*dval0
)
8168 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8172 /* An ordinary record type in which ___XVL-convention fields and
8173 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8174 static approximations, containing all possible fields. Uses
8175 no runtime values. Useless for use in values, but that's OK,
8176 since the results are used only for type determinations. Works on both
8177 structs and unions. Representation note: to save space, we memorize
8178 the result of this function in the TYPE_TARGET_TYPE of the
8181 static struct type
*
8182 template_to_static_fixed_type (struct type
*type0
)
8188 /* No need no do anything if the input type is already fixed. */
8189 if (TYPE_FIXED_INSTANCE (type0
))
8192 /* Likewise if we already have computed the static approximation. */
8193 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8194 return TYPE_TARGET_TYPE (type0
);
8196 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8198 nfields
= TYPE_NFIELDS (type0
);
8200 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8201 recompute all over next time. */
8202 TYPE_TARGET_TYPE (type0
) = type
;
8204 for (f
= 0; f
< nfields
; f
+= 1)
8206 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8207 struct type
*new_type
;
8209 if (is_dynamic_field (type0
, f
))
8211 field_type
= ada_check_typedef (field_type
);
8212 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8215 new_type
= static_unwrap_type (field_type
);
8217 if (new_type
!= field_type
)
8219 /* Clone TYPE0 only the first time we get a new field type. */
8222 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8223 TYPE_CODE (type
) = TYPE_CODE (type0
);
8224 INIT_CPLUS_SPECIFIC (type
);
8225 TYPE_NFIELDS (type
) = nfields
;
8226 TYPE_FIELDS (type
) = (struct field
*)
8227 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8228 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8229 sizeof (struct field
) * nfields
);
8230 TYPE_NAME (type
) = ada_type_name (type0
);
8231 TYPE_TAG_NAME (type
) = NULL
;
8232 TYPE_FIXED_INSTANCE (type
) = 1;
8233 TYPE_LENGTH (type
) = 0;
8235 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8236 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8243 /* Given an object of type TYPE whose contents are at VALADDR and
8244 whose address in memory is ADDRESS, returns a revision of TYPE,
8245 which should be a non-dynamic-sized record, in which the variant
8246 part, if any, is replaced with the appropriate branch. Looks
8247 for discriminant values in DVAL0, which can be NULL if the record
8248 contains the necessary discriminant values. */
8250 static struct type
*
8251 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8252 CORE_ADDR address
, struct value
*dval0
)
8254 struct value
*mark
= value_mark ();
8257 struct type
*branch_type
;
8258 int nfields
= TYPE_NFIELDS (type
);
8259 int variant_field
= variant_field_index (type
);
8261 if (variant_field
== -1)
8266 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8267 type
= value_type (dval
);
8272 rtype
= alloc_type_copy (type
);
8273 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8274 INIT_CPLUS_SPECIFIC (rtype
);
8275 TYPE_NFIELDS (rtype
) = nfields
;
8276 TYPE_FIELDS (rtype
) =
8277 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8278 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8279 sizeof (struct field
) * nfields
);
8280 TYPE_NAME (rtype
) = ada_type_name (type
);
8281 TYPE_TAG_NAME (rtype
) = NULL
;
8282 TYPE_FIXED_INSTANCE (rtype
) = 1;
8283 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8285 branch_type
= to_fixed_variant_branch_type
8286 (TYPE_FIELD_TYPE (type
, variant_field
),
8287 cond_offset_host (valaddr
,
8288 TYPE_FIELD_BITPOS (type
, variant_field
)
8290 cond_offset_target (address
,
8291 TYPE_FIELD_BITPOS (type
, variant_field
)
8292 / TARGET_CHAR_BIT
), dval
);
8293 if (branch_type
== NULL
)
8297 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8298 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8299 TYPE_NFIELDS (rtype
) -= 1;
8303 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8304 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8305 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8306 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8308 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8310 value_free_to_mark (mark
);
8314 /* An ordinary record type (with fixed-length fields) that describes
8315 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8316 beginning of this section]. Any necessary discriminants' values
8317 should be in DVAL, a record value; it may be NULL if the object
8318 at ADDR itself contains any necessary discriminant values.
8319 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8320 values from the record are needed. Except in the case that DVAL,
8321 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8322 unchecked) is replaced by a particular branch of the variant.
8324 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8325 is questionable and may be removed. It can arise during the
8326 processing of an unconstrained-array-of-record type where all the
8327 variant branches have exactly the same size. This is because in
8328 such cases, the compiler does not bother to use the XVS convention
8329 when encoding the record. I am currently dubious of this
8330 shortcut and suspect the compiler should be altered. FIXME. */
8332 static struct type
*
8333 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8334 CORE_ADDR address
, struct value
*dval
)
8336 struct type
*templ_type
;
8338 if (TYPE_FIXED_INSTANCE (type0
))
8341 templ_type
= dynamic_template_type (type0
);
8343 if (templ_type
!= NULL
)
8344 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8345 else if (variant_field_index (type0
) >= 0)
8347 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8349 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8354 TYPE_FIXED_INSTANCE (type0
) = 1;
8360 /* An ordinary record type (with fixed-length fields) that describes
8361 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8362 union type. Any necessary discriminants' values should be in DVAL,
8363 a record value. That is, this routine selects the appropriate
8364 branch of the union at ADDR according to the discriminant value
8365 indicated in the union's type name. Returns VAR_TYPE0 itself if
8366 it represents a variant subject to a pragma Unchecked_Union. */
8368 static struct type
*
8369 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8370 CORE_ADDR address
, struct value
*dval
)
8373 struct type
*templ_type
;
8374 struct type
*var_type
;
8376 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8377 var_type
= TYPE_TARGET_TYPE (var_type0
);
8379 var_type
= var_type0
;
8381 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8383 if (templ_type
!= NULL
)
8384 var_type
= templ_type
;
8386 if (is_unchecked_variant (var_type
, value_type (dval
)))
8389 ada_which_variant_applies (var_type
,
8390 value_type (dval
), value_contents (dval
));
8393 return empty_record (var_type
);
8394 else if (is_dynamic_field (var_type
, which
))
8395 return to_fixed_record_type
8396 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8397 valaddr
, address
, dval
);
8398 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8400 to_fixed_record_type
8401 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8403 return TYPE_FIELD_TYPE (var_type
, which
);
8406 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8407 ENCODING_TYPE, a type following the GNAT conventions for discrete
8408 type encodings, only carries redundant information. */
8411 ada_is_redundant_range_encoding (struct type
*range_type
,
8412 struct type
*encoding_type
)
8414 struct type
*fixed_range_type
;
8419 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8421 if (TYPE_CODE (get_base_type (range_type
))
8422 != TYPE_CODE (get_base_type (encoding_type
)))
8424 /* The compiler probably used a simple base type to describe
8425 the range type instead of the range's actual base type,
8426 expecting us to get the real base type from the encoding
8427 anyway. In this situation, the encoding cannot be ignored
8432 if (is_dynamic_type (range_type
))
8435 if (TYPE_NAME (encoding_type
) == NULL
)
8438 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8439 if (bounds_str
== NULL
)
8442 n
= 8; /* Skip "___XDLU_". */
8443 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8445 if (TYPE_LOW_BOUND (range_type
) != lo
)
8448 n
+= 2; /* Skip the "__" separator between the two bounds. */
8449 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8451 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8457 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8458 a type following the GNAT encoding for describing array type
8459 indices, only carries redundant information. */
8462 ada_is_redundant_index_type_desc (struct type
*array_type
,
8463 struct type
*desc_type
)
8465 struct type
*this_layer
= check_typedef (array_type
);
8468 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8470 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8471 TYPE_FIELD_TYPE (desc_type
, i
)))
8473 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8479 /* Assuming that TYPE0 is an array type describing the type of a value
8480 at ADDR, and that DVAL describes a record containing any
8481 discriminants used in TYPE0, returns a type for the value that
8482 contains no dynamic components (that is, no components whose sizes
8483 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8484 true, gives an error message if the resulting type's size is over
8487 static struct type
*
8488 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8491 struct type
*index_type_desc
;
8492 struct type
*result
;
8493 int constrained_packed_array_p
;
8495 type0
= ada_check_typedef (type0
);
8496 if (TYPE_FIXED_INSTANCE (type0
))
8499 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8500 if (constrained_packed_array_p
)
8501 type0
= decode_constrained_packed_array_type (type0
);
8503 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
8504 ada_fixup_array_indexes_type (index_type_desc
);
8505 if (index_type_desc
!= NULL
8506 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8508 /* Ignore this ___XA parallel type, as it does not bring any
8509 useful information. This allows us to avoid creating fixed
8510 versions of the array's index types, which would be identical
8511 to the original ones. This, in turn, can also help avoid
8512 the creation of fixed versions of the array itself. */
8513 index_type_desc
= NULL
;
8516 if (index_type_desc
== NULL
)
8518 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8520 /* NOTE: elt_type---the fixed version of elt_type0---should never
8521 depend on the contents of the array in properly constructed
8523 /* Create a fixed version of the array element type.
8524 We're not providing the address of an element here,
8525 and thus the actual object value cannot be inspected to do
8526 the conversion. This should not be a problem, since arrays of
8527 unconstrained objects are not allowed. In particular, all
8528 the elements of an array of a tagged type should all be of
8529 the same type specified in the debugging info. No need to
8530 consult the object tag. */
8531 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8533 /* Make sure we always create a new array type when dealing with
8534 packed array types, since we're going to fix-up the array
8535 type length and element bitsize a little further down. */
8536 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8539 result
= create_array_type (alloc_type_copy (type0
),
8540 elt_type
, TYPE_INDEX_TYPE (type0
));
8545 struct type
*elt_type0
;
8548 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8549 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8551 /* NOTE: result---the fixed version of elt_type0---should never
8552 depend on the contents of the array in properly constructed
8554 /* Create a fixed version of the array element type.
8555 We're not providing the address of an element here,
8556 and thus the actual object value cannot be inspected to do
8557 the conversion. This should not be a problem, since arrays of
8558 unconstrained objects are not allowed. In particular, all
8559 the elements of an array of a tagged type should all be of
8560 the same type specified in the debugging info. No need to
8561 consult the object tag. */
8563 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8566 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8568 struct type
*range_type
=
8569 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8571 result
= create_array_type (alloc_type_copy (elt_type0
),
8572 result
, range_type
);
8573 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8575 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8576 error (_("array type with dynamic size is larger than varsize-limit"));
8579 /* We want to preserve the type name. This can be useful when
8580 trying to get the type name of a value that has already been
8581 printed (for instance, if the user did "print VAR; whatis $". */
8582 TYPE_NAME (result
) = TYPE_NAME (type0
);
8584 if (constrained_packed_array_p
)
8586 /* So far, the resulting type has been created as if the original
8587 type was a regular (non-packed) array type. As a result, the
8588 bitsize of the array elements needs to be set again, and the array
8589 length needs to be recomputed based on that bitsize. */
8590 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8591 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8593 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8594 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8595 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8596 TYPE_LENGTH (result
)++;
8599 TYPE_FIXED_INSTANCE (result
) = 1;
8604 /* A standard type (containing no dynamically sized components)
8605 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8606 DVAL describes a record containing any discriminants used in TYPE0,
8607 and may be NULL if there are none, or if the object of type TYPE at
8608 ADDRESS or in VALADDR contains these discriminants.
8610 If CHECK_TAG is not null, in the case of tagged types, this function
8611 attempts to locate the object's tag and use it to compute the actual
8612 type. However, when ADDRESS is null, we cannot use it to determine the
8613 location of the tag, and therefore compute the tagged type's actual type.
8614 So we return the tagged type without consulting the tag. */
8616 static struct type
*
8617 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8618 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8620 type
= ada_check_typedef (type
);
8621 switch (TYPE_CODE (type
))
8625 case TYPE_CODE_STRUCT
:
8627 struct type
*static_type
= to_static_fixed_type (type
);
8628 struct type
*fixed_record_type
=
8629 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8631 /* If STATIC_TYPE is a tagged type and we know the object's address,
8632 then we can determine its tag, and compute the object's actual
8633 type from there. Note that we have to use the fixed record
8634 type (the parent part of the record may have dynamic fields
8635 and the way the location of _tag is expressed may depend on
8638 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8641 value_tag_from_contents_and_address
8645 struct type
*real_type
= type_from_tag (tag
);
8647 value_from_contents_and_address (fixed_record_type
,
8650 fixed_record_type
= value_type (obj
);
8651 if (real_type
!= NULL
)
8652 return to_fixed_record_type
8654 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8657 /* Check to see if there is a parallel ___XVZ variable.
8658 If there is, then it provides the actual size of our type. */
8659 else if (ada_type_name (fixed_record_type
) != NULL
)
8661 const char *name
= ada_type_name (fixed_record_type
);
8662 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8666 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8667 size
= get_int_var_value (xvz_name
, &xvz_found
);
8668 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8670 fixed_record_type
= copy_type (fixed_record_type
);
8671 TYPE_LENGTH (fixed_record_type
) = size
;
8673 /* The FIXED_RECORD_TYPE may have be a stub. We have
8674 observed this when the debugging info is STABS, and
8675 apparently it is something that is hard to fix.
8677 In practice, we don't need the actual type definition
8678 at all, because the presence of the XVZ variable allows us
8679 to assume that there must be a XVS type as well, which we
8680 should be able to use later, when we need the actual type
8683 In the meantime, pretend that the "fixed" type we are
8684 returning is NOT a stub, because this can cause trouble
8685 when using this type to create new types targeting it.
8686 Indeed, the associated creation routines often check
8687 whether the target type is a stub and will try to replace
8688 it, thus using a type with the wrong size. This, in turn,
8689 might cause the new type to have the wrong size too.
8690 Consider the case of an array, for instance, where the size
8691 of the array is computed from the number of elements in
8692 our array multiplied by the size of its element. */
8693 TYPE_STUB (fixed_record_type
) = 0;
8696 return fixed_record_type
;
8698 case TYPE_CODE_ARRAY
:
8699 return to_fixed_array_type (type
, dval
, 1);
8700 case TYPE_CODE_UNION
:
8704 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8708 /* The same as ada_to_fixed_type_1, except that it preserves the type
8709 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8711 The typedef layer needs be preserved in order to differentiate between
8712 arrays and array pointers when both types are implemented using the same
8713 fat pointer. In the array pointer case, the pointer is encoded as
8714 a typedef of the pointer type. For instance, considering:
8716 type String_Access is access String;
8717 S1 : String_Access := null;
8719 To the debugger, S1 is defined as a typedef of type String. But
8720 to the user, it is a pointer. So if the user tries to print S1,
8721 we should not dereference the array, but print the array address
8724 If we didn't preserve the typedef layer, we would lose the fact that
8725 the type is to be presented as a pointer (needs de-reference before
8726 being printed). And we would also use the source-level type name. */
8729 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8730 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8733 struct type
*fixed_type
=
8734 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8736 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8737 then preserve the typedef layer.
8739 Implementation note: We can only check the main-type portion of
8740 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8741 from TYPE now returns a type that has the same instance flags
8742 as TYPE. For instance, if TYPE is a "typedef const", and its
8743 target type is a "struct", then the typedef elimination will return
8744 a "const" version of the target type. See check_typedef for more
8745 details about how the typedef layer elimination is done.
8747 brobecker/2010-11-19: It seems to me that the only case where it is
8748 useful to preserve the typedef layer is when dealing with fat pointers.
8749 Perhaps, we could add a check for that and preserve the typedef layer
8750 only in that situation. But this seems unecessary so far, probably
8751 because we call check_typedef/ada_check_typedef pretty much everywhere.
8753 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8754 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8755 == TYPE_MAIN_TYPE (fixed_type
)))
8761 /* A standard (static-sized) type corresponding as well as possible to
8762 TYPE0, but based on no runtime data. */
8764 static struct type
*
8765 to_static_fixed_type (struct type
*type0
)
8772 if (TYPE_FIXED_INSTANCE (type0
))
8775 type0
= ada_check_typedef (type0
);
8777 switch (TYPE_CODE (type0
))
8781 case TYPE_CODE_STRUCT
:
8782 type
= dynamic_template_type (type0
);
8784 return template_to_static_fixed_type (type
);
8786 return template_to_static_fixed_type (type0
);
8787 case TYPE_CODE_UNION
:
8788 type
= ada_find_parallel_type (type0
, "___XVU");
8790 return template_to_static_fixed_type (type
);
8792 return template_to_static_fixed_type (type0
);
8796 /* A static approximation of TYPE with all type wrappers removed. */
8798 static struct type
*
8799 static_unwrap_type (struct type
*type
)
8801 if (ada_is_aligner_type (type
))
8803 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8804 if (ada_type_name (type1
) == NULL
)
8805 TYPE_NAME (type1
) = ada_type_name (type
);
8807 return static_unwrap_type (type1
);
8811 struct type
*raw_real_type
= ada_get_base_type (type
);
8813 if (raw_real_type
== type
)
8816 return to_static_fixed_type (raw_real_type
);
8820 /* In some cases, incomplete and private types require
8821 cross-references that are not resolved as records (for example,
8823 type FooP is access Foo;
8825 type Foo is array ...;
8826 ). In these cases, since there is no mechanism for producing
8827 cross-references to such types, we instead substitute for FooP a
8828 stub enumeration type that is nowhere resolved, and whose tag is
8829 the name of the actual type. Call these types "non-record stubs". */
8831 /* A type equivalent to TYPE that is not a non-record stub, if one
8832 exists, otherwise TYPE. */
8835 ada_check_typedef (struct type
*type
)
8840 /* If our type is a typedef type of a fat pointer, then we're done.
8841 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8842 what allows us to distinguish between fat pointers that represent
8843 array types, and fat pointers that represent array access types
8844 (in both cases, the compiler implements them as fat pointers). */
8845 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8846 && is_thick_pntr (ada_typedef_target_type (type
)))
8849 CHECK_TYPEDEF (type
);
8850 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8851 || !TYPE_STUB (type
)
8852 || TYPE_TAG_NAME (type
) == NULL
)
8856 const char *name
= TYPE_TAG_NAME (type
);
8857 struct type
*type1
= ada_find_any_type (name
);
8862 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8863 stubs pointing to arrays, as we don't create symbols for array
8864 types, only for the typedef-to-array types). If that's the case,
8865 strip the typedef layer. */
8866 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8867 type1
= ada_check_typedef (type1
);
8873 /* A value representing the data at VALADDR/ADDRESS as described by
8874 type TYPE0, but with a standard (static-sized) type that correctly
8875 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8876 type, then return VAL0 [this feature is simply to avoid redundant
8877 creation of struct values]. */
8879 static struct value
*
8880 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8883 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8885 if (type
== type0
&& val0
!= NULL
)
8888 return value_from_contents_and_address (type
, 0, address
);
8891 /* A value representing VAL, but with a standard (static-sized) type
8892 that correctly describes it. Does not necessarily create a new
8896 ada_to_fixed_value (struct value
*val
)
8898 val
= unwrap_value (val
);
8899 val
= ada_to_fixed_value_create (value_type (val
),
8900 value_address (val
),
8908 /* Table mapping attribute numbers to names.
8909 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8911 static const char *attribute_names
[] = {
8929 ada_attribute_name (enum exp_opcode n
)
8931 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8932 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8934 return attribute_names
[0];
8937 /* Evaluate the 'POS attribute applied to ARG. */
8940 pos_atr (struct value
*arg
)
8942 struct value
*val
= coerce_ref (arg
);
8943 struct type
*type
= value_type (val
);
8945 if (!discrete_type_p (type
))
8946 error (_("'POS only defined on discrete types"));
8948 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8951 LONGEST v
= value_as_long (val
);
8953 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8955 if (v
== TYPE_FIELD_ENUMVAL (type
, i
))
8958 error (_("enumeration value is invalid: can't find 'POS"));
8961 return value_as_long (val
);
8964 static struct value
*
8965 value_pos_atr (struct type
*type
, struct value
*arg
)
8967 return value_from_longest (type
, pos_atr (arg
));
8970 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8972 static struct value
*
8973 value_val_atr (struct type
*type
, struct value
*arg
)
8975 if (!discrete_type_p (type
))
8976 error (_("'VAL only defined on discrete types"));
8977 if (!integer_type_p (value_type (arg
)))
8978 error (_("'VAL requires integral argument"));
8980 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8982 long pos
= value_as_long (arg
);
8984 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8985 error (_("argument to 'VAL out of range"));
8986 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
8989 return value_from_longest (type
, value_as_long (arg
));
8995 /* True if TYPE appears to be an Ada character type.
8996 [At the moment, this is true only for Character and Wide_Character;
8997 It is a heuristic test that could stand improvement]. */
9000 ada_is_character_type (struct type
*type
)
9004 /* If the type code says it's a character, then assume it really is,
9005 and don't check any further. */
9006 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
9009 /* Otherwise, assume it's a character type iff it is a discrete type
9010 with a known character type name. */
9011 name
= ada_type_name (type
);
9012 return (name
!= NULL
9013 && (TYPE_CODE (type
) == TYPE_CODE_INT
9014 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9015 && (strcmp (name
, "character") == 0
9016 || strcmp (name
, "wide_character") == 0
9017 || strcmp (name
, "wide_wide_character") == 0
9018 || strcmp (name
, "unsigned char") == 0));
9021 /* True if TYPE appears to be an Ada string type. */
9024 ada_is_string_type (struct type
*type
)
9026 type
= ada_check_typedef (type
);
9028 && TYPE_CODE (type
) != TYPE_CODE_PTR
9029 && (ada_is_simple_array_type (type
)
9030 || ada_is_array_descriptor_type (type
))
9031 && ada_array_arity (type
) == 1)
9033 struct type
*elttype
= ada_array_element_type (type
, 1);
9035 return ada_is_character_type (elttype
);
9041 /* The compiler sometimes provides a parallel XVS type for a given
9042 PAD type. Normally, it is safe to follow the PAD type directly,
9043 but older versions of the compiler have a bug that causes the offset
9044 of its "F" field to be wrong. Following that field in that case
9045 would lead to incorrect results, but this can be worked around
9046 by ignoring the PAD type and using the associated XVS type instead.
9048 Set to True if the debugger should trust the contents of PAD types.
9049 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9050 static int trust_pad_over_xvs
= 1;
9052 /* True if TYPE is a struct type introduced by the compiler to force the
9053 alignment of a value. Such types have a single field with a
9054 distinctive name. */
9057 ada_is_aligner_type (struct type
*type
)
9059 type
= ada_check_typedef (type
);
9061 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9064 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9065 && TYPE_NFIELDS (type
) == 1
9066 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9069 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9070 the parallel type. */
9073 ada_get_base_type (struct type
*raw_type
)
9075 struct type
*real_type_namer
;
9076 struct type
*raw_real_type
;
9078 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9081 if (ada_is_aligner_type (raw_type
))
9082 /* The encoding specifies that we should always use the aligner type.
9083 So, even if this aligner type has an associated XVS type, we should
9086 According to the compiler gurus, an XVS type parallel to an aligner
9087 type may exist because of a stabs limitation. In stabs, aligner
9088 types are empty because the field has a variable-sized type, and
9089 thus cannot actually be used as an aligner type. As a result,
9090 we need the associated parallel XVS type to decode the type.
9091 Since the policy in the compiler is to not change the internal
9092 representation based on the debugging info format, we sometimes
9093 end up having a redundant XVS type parallel to the aligner type. */
9096 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9097 if (real_type_namer
== NULL
9098 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9099 || TYPE_NFIELDS (real_type_namer
) != 1)
9102 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9104 /* This is an older encoding form where the base type needs to be
9105 looked up by name. We prefer the newer enconding because it is
9107 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9108 if (raw_real_type
== NULL
)
9111 return raw_real_type
;
9114 /* The field in our XVS type is a reference to the base type. */
9115 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9118 /* The type of value designated by TYPE, with all aligners removed. */
9121 ada_aligned_type (struct type
*type
)
9123 if (ada_is_aligner_type (type
))
9124 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9126 return ada_get_base_type (type
);
9130 /* The address of the aligned value in an object at address VALADDR
9131 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9134 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9136 if (ada_is_aligner_type (type
))
9137 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9139 TYPE_FIELD_BITPOS (type
,
9140 0) / TARGET_CHAR_BIT
);
9147 /* The printed representation of an enumeration literal with encoded
9148 name NAME. The value is good to the next call of ada_enum_name. */
9150 ada_enum_name (const char *name
)
9152 static char *result
;
9153 static size_t result_len
= 0;
9156 /* First, unqualify the enumeration name:
9157 1. Search for the last '.' character. If we find one, then skip
9158 all the preceding characters, the unqualified name starts
9159 right after that dot.
9160 2. Otherwise, we may be debugging on a target where the compiler
9161 translates dots into "__". Search forward for double underscores,
9162 but stop searching when we hit an overloading suffix, which is
9163 of the form "__" followed by digits. */
9165 tmp
= strrchr (name
, '.');
9170 while ((tmp
= strstr (name
, "__")) != NULL
)
9172 if (isdigit (tmp
[2]))
9183 if (name
[1] == 'U' || name
[1] == 'W')
9185 if (sscanf (name
+ 2, "%x", &v
) != 1)
9191 GROW_VECT (result
, result_len
, 16);
9192 if (isascii (v
) && isprint (v
))
9193 xsnprintf (result
, result_len
, "'%c'", v
);
9194 else if (name
[1] == 'U')
9195 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9197 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9203 tmp
= strstr (name
, "__");
9205 tmp
= strstr (name
, "$");
9208 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9209 strncpy (result
, name
, tmp
- name
);
9210 result
[tmp
- name
] = '\0';
9218 /* Evaluate the subexpression of EXP starting at *POS as for
9219 evaluate_type, updating *POS to point just past the evaluated
9222 static struct value
*
9223 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9225 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9228 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9231 static struct value
*
9232 unwrap_value (struct value
*val
)
9234 struct type
*type
= ada_check_typedef (value_type (val
));
9236 if (ada_is_aligner_type (type
))
9238 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9239 struct type
*val_type
= ada_check_typedef (value_type (v
));
9241 if (ada_type_name (val_type
) == NULL
)
9242 TYPE_NAME (val_type
) = ada_type_name (type
);
9244 return unwrap_value (v
);
9248 struct type
*raw_real_type
=
9249 ada_check_typedef (ada_get_base_type (type
));
9251 /* If there is no parallel XVS or XVE type, then the value is
9252 already unwrapped. Return it without further modification. */
9253 if ((type
== raw_real_type
)
9254 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9258 coerce_unspec_val_to_type
9259 (val
, ada_to_fixed_type (raw_real_type
, 0,
9260 value_address (val
),
9265 static struct value
*
9266 cast_to_fixed (struct type
*type
, struct value
*arg
)
9270 if (type
== value_type (arg
))
9272 else if (ada_is_fixed_point_type (value_type (arg
)))
9273 val
= ada_float_to_fixed (type
,
9274 ada_fixed_to_float (value_type (arg
),
9275 value_as_long (arg
)));
9278 DOUBLEST argd
= value_as_double (arg
);
9280 val
= ada_float_to_fixed (type
, argd
);
9283 return value_from_longest (type
, val
);
9286 static struct value
*
9287 cast_from_fixed (struct type
*type
, struct value
*arg
)
9289 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9290 value_as_long (arg
));
9292 return value_from_double (type
, val
);
9295 /* Given two array types T1 and T2, return nonzero iff both arrays
9296 contain the same number of elements. */
9299 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9301 LONGEST lo1
, hi1
, lo2
, hi2
;
9303 /* Get the array bounds in order to verify that the size of
9304 the two arrays match. */
9305 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9306 || !get_array_bounds (t2
, &lo2
, &hi2
))
9307 error (_("unable to determine array bounds"));
9309 /* To make things easier for size comparison, normalize a bit
9310 the case of empty arrays by making sure that the difference
9311 between upper bound and lower bound is always -1. */
9317 return (hi1
- lo1
== hi2
- lo2
);
9320 /* Assuming that VAL is an array of integrals, and TYPE represents
9321 an array with the same number of elements, but with wider integral
9322 elements, return an array "casted" to TYPE. In practice, this
9323 means that the returned array is built by casting each element
9324 of the original array into TYPE's (wider) element type. */
9326 static struct value
*
9327 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9329 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9334 /* Verify that both val and type are arrays of scalars, and
9335 that the size of val's elements is smaller than the size
9336 of type's element. */
9337 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9338 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9339 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9340 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9341 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9342 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9344 if (!get_array_bounds (type
, &lo
, &hi
))
9345 error (_("unable to determine array bounds"));
9347 res
= allocate_value (type
);
9349 /* Promote each array element. */
9350 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9352 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9354 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9355 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9361 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9362 return the converted value. */
9364 static struct value
*
9365 coerce_for_assign (struct type
*type
, struct value
*val
)
9367 struct type
*type2
= value_type (val
);
9372 type2
= ada_check_typedef (type2
);
9373 type
= ada_check_typedef (type
);
9375 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9376 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9378 val
= ada_value_ind (val
);
9379 type2
= value_type (val
);
9382 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9383 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9385 if (!ada_same_array_size_p (type
, type2
))
9386 error (_("cannot assign arrays of different length"));
9388 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9389 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9390 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9391 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9393 /* Allow implicit promotion of the array elements to
9395 return ada_promote_array_of_integrals (type
, val
);
9398 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9399 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9400 error (_("Incompatible types in assignment"));
9401 deprecated_set_value_type (val
, type
);
9406 static struct value
*
9407 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9410 struct type
*type1
, *type2
;
9413 arg1
= coerce_ref (arg1
);
9414 arg2
= coerce_ref (arg2
);
9415 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9416 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9418 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9419 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9420 return value_binop (arg1
, arg2
, op
);
9429 return value_binop (arg1
, arg2
, op
);
9432 v2
= value_as_long (arg2
);
9434 error (_("second operand of %s must not be zero."), op_string (op
));
9436 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9437 return value_binop (arg1
, arg2
, op
);
9439 v1
= value_as_long (arg1
);
9444 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9445 v
+= v
> 0 ? -1 : 1;
9453 /* Should not reach this point. */
9457 val
= allocate_value (type1
);
9458 store_unsigned_integer (value_contents_raw (val
),
9459 TYPE_LENGTH (value_type (val
)),
9460 gdbarch_byte_order (get_type_arch (type1
)), v
);
9465 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9467 if (ada_is_direct_array_type (value_type (arg1
))
9468 || ada_is_direct_array_type (value_type (arg2
)))
9470 /* Automatically dereference any array reference before
9471 we attempt to perform the comparison. */
9472 arg1
= ada_coerce_ref (arg1
);
9473 arg2
= ada_coerce_ref (arg2
);
9475 arg1
= ada_coerce_to_simple_array (arg1
);
9476 arg2
= ada_coerce_to_simple_array (arg2
);
9477 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9478 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9479 error (_("Attempt to compare array with non-array"));
9480 /* FIXME: The following works only for types whose
9481 representations use all bits (no padding or undefined bits)
9482 and do not have user-defined equality. */
9484 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9485 && memcmp (value_contents (arg1
), value_contents (arg2
),
9486 TYPE_LENGTH (value_type (arg1
))) == 0;
9488 return value_equal (arg1
, arg2
);
9491 /* Total number of component associations in the aggregate starting at
9492 index PC in EXP. Assumes that index PC is the start of an
9496 num_component_specs (struct expression
*exp
, int pc
)
9500 m
= exp
->elts
[pc
+ 1].longconst
;
9503 for (i
= 0; i
< m
; i
+= 1)
9505 switch (exp
->elts
[pc
].opcode
)
9511 n
+= exp
->elts
[pc
+ 1].longconst
;
9514 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9519 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9520 component of LHS (a simple array or a record), updating *POS past
9521 the expression, assuming that LHS is contained in CONTAINER. Does
9522 not modify the inferior's memory, nor does it modify LHS (unless
9523 LHS == CONTAINER). */
9526 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9527 struct expression
*exp
, int *pos
)
9529 struct value
*mark
= value_mark ();
9532 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9534 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9535 struct value
*index_val
= value_from_longest (index_type
, index
);
9537 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9541 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9542 elt
= ada_to_fixed_value (elt
);
9545 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9546 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9548 value_assign_to_component (container
, elt
,
9549 ada_evaluate_subexp (NULL
, exp
, pos
,
9552 value_free_to_mark (mark
);
9555 /* Assuming that LHS represents an lvalue having a record or array
9556 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9557 of that aggregate's value to LHS, advancing *POS past the
9558 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9559 lvalue containing LHS (possibly LHS itself). Does not modify
9560 the inferior's memory, nor does it modify the contents of
9561 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9563 static struct value
*
9564 assign_aggregate (struct value
*container
,
9565 struct value
*lhs
, struct expression
*exp
,
9566 int *pos
, enum noside noside
)
9568 struct type
*lhs_type
;
9569 int n
= exp
->elts
[*pos
+1].longconst
;
9570 LONGEST low_index
, high_index
;
9573 int max_indices
, num_indices
;
9577 if (noside
!= EVAL_NORMAL
)
9579 for (i
= 0; i
< n
; i
+= 1)
9580 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9584 container
= ada_coerce_ref (container
);
9585 if (ada_is_direct_array_type (value_type (container
)))
9586 container
= ada_coerce_to_simple_array (container
);
9587 lhs
= ada_coerce_ref (lhs
);
9588 if (!deprecated_value_modifiable (lhs
))
9589 error (_("Left operand of assignment is not a modifiable lvalue."));
9591 lhs_type
= value_type (lhs
);
9592 if (ada_is_direct_array_type (lhs_type
))
9594 lhs
= ada_coerce_to_simple_array (lhs
);
9595 lhs_type
= value_type (lhs
);
9596 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9597 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9599 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9602 high_index
= num_visible_fields (lhs_type
) - 1;
9605 error (_("Left-hand side must be array or record."));
9607 num_specs
= num_component_specs (exp
, *pos
- 3);
9608 max_indices
= 4 * num_specs
+ 4;
9609 indices
= alloca (max_indices
* sizeof (indices
[0]));
9610 indices
[0] = indices
[1] = low_index
- 1;
9611 indices
[2] = indices
[3] = high_index
+ 1;
9614 for (i
= 0; i
< n
; i
+= 1)
9616 switch (exp
->elts
[*pos
].opcode
)
9619 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9620 &num_indices
, max_indices
,
9621 low_index
, high_index
);
9624 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9625 &num_indices
, max_indices
,
9626 low_index
, high_index
);
9630 error (_("Misplaced 'others' clause"));
9631 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9632 num_indices
, low_index
, high_index
);
9635 error (_("Internal error: bad aggregate clause"));
9642 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9643 construct at *POS, updating *POS past the construct, given that
9644 the positions are relative to lower bound LOW, where HIGH is the
9645 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9646 updating *NUM_INDICES as needed. CONTAINER is as for
9647 assign_aggregate. */
9649 aggregate_assign_positional (struct value
*container
,
9650 struct value
*lhs
, struct expression
*exp
,
9651 int *pos
, LONGEST
*indices
, int *num_indices
,
9652 int max_indices
, LONGEST low
, LONGEST high
)
9654 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9656 if (ind
- 1 == high
)
9657 warning (_("Extra components in aggregate ignored."));
9660 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9662 assign_component (container
, lhs
, ind
, exp
, pos
);
9665 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9668 /* Assign into the components of LHS indexed by the OP_CHOICES
9669 construct at *POS, updating *POS past the construct, given that
9670 the allowable indices are LOW..HIGH. Record the indices assigned
9671 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9672 needed. CONTAINER is as for assign_aggregate. */
9674 aggregate_assign_from_choices (struct value
*container
,
9675 struct value
*lhs
, struct expression
*exp
,
9676 int *pos
, LONGEST
*indices
, int *num_indices
,
9677 int max_indices
, LONGEST low
, LONGEST high
)
9680 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9681 int choice_pos
, expr_pc
;
9682 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9684 choice_pos
= *pos
+= 3;
9686 for (j
= 0; j
< n_choices
; j
+= 1)
9687 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9689 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9691 for (j
= 0; j
< n_choices
; j
+= 1)
9693 LONGEST lower
, upper
;
9694 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9696 if (op
== OP_DISCRETE_RANGE
)
9699 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9701 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9706 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9718 name
= &exp
->elts
[choice_pos
+ 2].string
;
9721 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9724 error (_("Invalid record component association."));
9726 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9728 if (! find_struct_field (name
, value_type (lhs
), 0,
9729 NULL
, NULL
, NULL
, NULL
, &ind
))
9730 error (_("Unknown component name: %s."), name
);
9731 lower
= upper
= ind
;
9734 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9735 error (_("Index in component association out of bounds."));
9737 add_component_interval (lower
, upper
, indices
, num_indices
,
9739 while (lower
<= upper
)
9744 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9750 /* Assign the value of the expression in the OP_OTHERS construct in
9751 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9752 have not been previously assigned. The index intervals already assigned
9753 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9754 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9756 aggregate_assign_others (struct value
*container
,
9757 struct value
*lhs
, struct expression
*exp
,
9758 int *pos
, LONGEST
*indices
, int num_indices
,
9759 LONGEST low
, LONGEST high
)
9762 int expr_pc
= *pos
+ 1;
9764 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9768 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9773 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9776 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9779 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9780 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9781 modifying *SIZE as needed. It is an error if *SIZE exceeds
9782 MAX_SIZE. The resulting intervals do not overlap. */
9784 add_component_interval (LONGEST low
, LONGEST high
,
9785 LONGEST
* indices
, int *size
, int max_size
)
9789 for (i
= 0; i
< *size
; i
+= 2) {
9790 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9794 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9795 if (high
< indices
[kh
])
9797 if (low
< indices
[i
])
9799 indices
[i
+ 1] = indices
[kh
- 1];
9800 if (high
> indices
[i
+ 1])
9801 indices
[i
+ 1] = high
;
9802 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9803 *size
-= kh
- i
- 2;
9806 else if (high
< indices
[i
])
9810 if (*size
== max_size
)
9811 error (_("Internal error: miscounted aggregate components."));
9813 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9814 indices
[j
] = indices
[j
- 2];
9816 indices
[i
+ 1] = high
;
9819 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9822 static struct value
*
9823 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9825 if (type
== ada_check_typedef (value_type (arg2
)))
9828 if (ada_is_fixed_point_type (type
))
9829 return (cast_to_fixed (type
, arg2
));
9831 if (ada_is_fixed_point_type (value_type (arg2
)))
9832 return cast_from_fixed (type
, arg2
);
9834 return value_cast (type
, arg2
);
9837 /* Evaluating Ada expressions, and printing their result.
9838 ------------------------------------------------------
9843 We usually evaluate an Ada expression in order to print its value.
9844 We also evaluate an expression in order to print its type, which
9845 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9846 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9847 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9848 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9851 Evaluating expressions is a little more complicated for Ada entities
9852 than it is for entities in languages such as C. The main reason for
9853 this is that Ada provides types whose definition might be dynamic.
9854 One example of such types is variant records. Or another example
9855 would be an array whose bounds can only be known at run time.
9857 The following description is a general guide as to what should be
9858 done (and what should NOT be done) in order to evaluate an expression
9859 involving such types, and when. This does not cover how the semantic
9860 information is encoded by GNAT as this is covered separatly. For the
9861 document used as the reference for the GNAT encoding, see exp_dbug.ads
9862 in the GNAT sources.
9864 Ideally, we should embed each part of this description next to its
9865 associated code. Unfortunately, the amount of code is so vast right
9866 now that it's hard to see whether the code handling a particular
9867 situation might be duplicated or not. One day, when the code is
9868 cleaned up, this guide might become redundant with the comments
9869 inserted in the code, and we might want to remove it.
9871 2. ``Fixing'' an Entity, the Simple Case:
9872 -----------------------------------------
9874 When evaluating Ada expressions, the tricky issue is that they may
9875 reference entities whose type contents and size are not statically
9876 known. Consider for instance a variant record:
9878 type Rec (Empty : Boolean := True) is record
9881 when False => Value : Integer;
9884 Yes : Rec := (Empty => False, Value => 1);
9885 No : Rec := (empty => True);
9887 The size and contents of that record depends on the value of the
9888 descriminant (Rec.Empty). At this point, neither the debugging
9889 information nor the associated type structure in GDB are able to
9890 express such dynamic types. So what the debugger does is to create
9891 "fixed" versions of the type that applies to the specific object.
9892 We also informally refer to this opperation as "fixing" an object,
9893 which means creating its associated fixed type.
9895 Example: when printing the value of variable "Yes" above, its fixed
9896 type would look like this:
9903 On the other hand, if we printed the value of "No", its fixed type
9910 Things become a little more complicated when trying to fix an entity
9911 with a dynamic type that directly contains another dynamic type,
9912 such as an array of variant records, for instance. There are
9913 two possible cases: Arrays, and records.
9915 3. ``Fixing'' Arrays:
9916 ---------------------
9918 The type structure in GDB describes an array in terms of its bounds,
9919 and the type of its elements. By design, all elements in the array
9920 have the same type and we cannot represent an array of variant elements
9921 using the current type structure in GDB. When fixing an array,
9922 we cannot fix the array element, as we would potentially need one
9923 fixed type per element of the array. As a result, the best we can do
9924 when fixing an array is to produce an array whose bounds and size
9925 are correct (allowing us to read it from memory), but without having
9926 touched its element type. Fixing each element will be done later,
9927 when (if) necessary.
9929 Arrays are a little simpler to handle than records, because the same
9930 amount of memory is allocated for each element of the array, even if
9931 the amount of space actually used by each element differs from element
9932 to element. Consider for instance the following array of type Rec:
9934 type Rec_Array is array (1 .. 2) of Rec;
9936 The actual amount of memory occupied by each element might be different
9937 from element to element, depending on the value of their discriminant.
9938 But the amount of space reserved for each element in the array remains
9939 fixed regardless. So we simply need to compute that size using
9940 the debugging information available, from which we can then determine
9941 the array size (we multiply the number of elements of the array by
9942 the size of each element).
9944 The simplest case is when we have an array of a constrained element
9945 type. For instance, consider the following type declarations:
9947 type Bounded_String (Max_Size : Integer) is
9949 Buffer : String (1 .. Max_Size);
9951 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9953 In this case, the compiler describes the array as an array of
9954 variable-size elements (identified by its XVS suffix) for which
9955 the size can be read in the parallel XVZ variable.
9957 In the case of an array of an unconstrained element type, the compiler
9958 wraps the array element inside a private PAD type. This type should not
9959 be shown to the user, and must be "unwrap"'ed before printing. Note
9960 that we also use the adjective "aligner" in our code to designate
9961 these wrapper types.
9963 In some cases, the size allocated for each element is statically
9964 known. In that case, the PAD type already has the correct size,
9965 and the array element should remain unfixed.
9967 But there are cases when this size is not statically known.
9968 For instance, assuming that "Five" is an integer variable:
9970 type Dynamic is array (1 .. Five) of Integer;
9971 type Wrapper (Has_Length : Boolean := False) is record
9974 when True => Length : Integer;
9978 type Wrapper_Array is array (1 .. 2) of Wrapper;
9980 Hello : Wrapper_Array := (others => (Has_Length => True,
9981 Data => (others => 17),
9985 The debugging info would describe variable Hello as being an
9986 array of a PAD type. The size of that PAD type is not statically
9987 known, but can be determined using a parallel XVZ variable.
9988 In that case, a copy of the PAD type with the correct size should
9989 be used for the fixed array.
9991 3. ``Fixing'' record type objects:
9992 ----------------------------------
9994 Things are slightly different from arrays in the case of dynamic
9995 record types. In this case, in order to compute the associated
9996 fixed type, we need to determine the size and offset of each of
9997 its components. This, in turn, requires us to compute the fixed
9998 type of each of these components.
10000 Consider for instance the example:
10002 type Bounded_String (Max_Size : Natural) is record
10003 Str : String (1 .. Max_Size);
10006 My_String : Bounded_String (Max_Size => 10);
10008 In that case, the position of field "Length" depends on the size
10009 of field Str, which itself depends on the value of the Max_Size
10010 discriminant. In order to fix the type of variable My_String,
10011 we need to fix the type of field Str. Therefore, fixing a variant
10012 record requires us to fix each of its components.
10014 However, if a component does not have a dynamic size, the component
10015 should not be fixed. In particular, fields that use a PAD type
10016 should not fixed. Here is an example where this might happen
10017 (assuming type Rec above):
10019 type Container (Big : Boolean) is record
10023 when True => Another : Integer;
10024 when False => null;
10027 My_Container : Container := (Big => False,
10028 First => (Empty => True),
10031 In that example, the compiler creates a PAD type for component First,
10032 whose size is constant, and then positions the component After just
10033 right after it. The offset of component After is therefore constant
10036 The debugger computes the position of each field based on an algorithm
10037 that uses, among other things, the actual position and size of the field
10038 preceding it. Let's now imagine that the user is trying to print
10039 the value of My_Container. If the type fixing was recursive, we would
10040 end up computing the offset of field After based on the size of the
10041 fixed version of field First. And since in our example First has
10042 only one actual field, the size of the fixed type is actually smaller
10043 than the amount of space allocated to that field, and thus we would
10044 compute the wrong offset of field After.
10046 To make things more complicated, we need to watch out for dynamic
10047 components of variant records (identified by the ___XVL suffix in
10048 the component name). Even if the target type is a PAD type, the size
10049 of that type might not be statically known. So the PAD type needs
10050 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10051 we might end up with the wrong size for our component. This can be
10052 observed with the following type declarations:
10054 type Octal is new Integer range 0 .. 7;
10055 type Octal_Array is array (Positive range <>) of Octal;
10056 pragma Pack (Octal_Array);
10058 type Octal_Buffer (Size : Positive) is record
10059 Buffer : Octal_Array (1 .. Size);
10063 In that case, Buffer is a PAD type whose size is unset and needs
10064 to be computed by fixing the unwrapped type.
10066 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10067 ----------------------------------------------------------
10069 Lastly, when should the sub-elements of an entity that remained unfixed
10070 thus far, be actually fixed?
10072 The answer is: Only when referencing that element. For instance
10073 when selecting one component of a record, this specific component
10074 should be fixed at that point in time. Or when printing the value
10075 of a record, each component should be fixed before its value gets
10076 printed. Similarly for arrays, the element of the array should be
10077 fixed when printing each element of the array, or when extracting
10078 one element out of that array. On the other hand, fixing should
10079 not be performed on the elements when taking a slice of an array!
10081 Note that one of the side-effects of miscomputing the offset and
10082 size of each field is that we end up also miscomputing the size
10083 of the containing type. This can have adverse results when computing
10084 the value of an entity. GDB fetches the value of an entity based
10085 on the size of its type, and thus a wrong size causes GDB to fetch
10086 the wrong amount of memory. In the case where the computed size is
10087 too small, GDB fetches too little data to print the value of our
10088 entiry. Results in this case as unpredicatble, as we usually read
10089 past the buffer containing the data =:-o. */
10091 /* Implement the evaluate_exp routine in the exp_descriptor structure
10092 for the Ada language. */
10094 static struct value
*
10095 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10096 int *pos
, enum noside noside
)
10098 enum exp_opcode op
;
10102 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10105 struct value
**argvec
;
10109 op
= exp
->elts
[pc
].opcode
;
10115 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10117 if (noside
== EVAL_NORMAL
)
10118 arg1
= unwrap_value (arg1
);
10120 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
10121 then we need to perform the conversion manually, because
10122 evaluate_subexp_standard doesn't do it. This conversion is
10123 necessary in Ada because the different kinds of float/fixed
10124 types in Ada have different representations.
10126 Similarly, we need to perform the conversion from OP_LONG
10128 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
10129 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
10135 struct value
*result
;
10138 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10139 /* The result type will have code OP_STRING, bashed there from
10140 OP_ARRAY. Bash it back. */
10141 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10142 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10148 type
= exp
->elts
[pc
+ 1].type
;
10149 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
10150 if (noside
== EVAL_SKIP
)
10152 arg1
= ada_value_cast (type
, arg1
, noside
);
10157 type
= exp
->elts
[pc
+ 1].type
;
10158 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10161 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10162 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10164 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10165 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10167 return ada_value_assign (arg1
, arg1
);
10169 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10170 except if the lhs of our assignment is a convenience variable.
10171 In the case of assigning to a convenience variable, the lhs
10172 should be exactly the result of the evaluation of the rhs. */
10173 type
= value_type (arg1
);
10174 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10176 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10177 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10179 if (ada_is_fixed_point_type (value_type (arg1
)))
10180 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10181 else if (ada_is_fixed_point_type (value_type (arg2
)))
10183 (_("Fixed-point values must be assigned to fixed-point variables"));
10185 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10186 return ada_value_assign (arg1
, arg2
);
10189 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10190 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10191 if (noside
== EVAL_SKIP
)
10193 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10194 return (value_from_longest
10195 (value_type (arg1
),
10196 value_as_long (arg1
) + value_as_long (arg2
)));
10197 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10198 return (value_from_longest
10199 (value_type (arg2
),
10200 value_as_long (arg1
) + value_as_long (arg2
)));
10201 if ((ada_is_fixed_point_type (value_type (arg1
))
10202 || ada_is_fixed_point_type (value_type (arg2
)))
10203 && value_type (arg1
) != value_type (arg2
))
10204 error (_("Operands of fixed-point addition must have the same type"));
10205 /* Do the addition, and cast the result to the type of the first
10206 argument. We cannot cast the result to a reference type, so if
10207 ARG1 is a reference type, find its underlying type. */
10208 type
= value_type (arg1
);
10209 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10210 type
= TYPE_TARGET_TYPE (type
);
10211 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10212 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10215 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10216 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10217 if (noside
== EVAL_SKIP
)
10219 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10220 return (value_from_longest
10221 (value_type (arg1
),
10222 value_as_long (arg1
) - value_as_long (arg2
)));
10223 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10224 return (value_from_longest
10225 (value_type (arg2
),
10226 value_as_long (arg1
) - value_as_long (arg2
)));
10227 if ((ada_is_fixed_point_type (value_type (arg1
))
10228 || ada_is_fixed_point_type (value_type (arg2
)))
10229 && value_type (arg1
) != value_type (arg2
))
10230 error (_("Operands of fixed-point subtraction "
10231 "must have the same type"));
10232 /* Do the substraction, and cast the result to the type of the first
10233 argument. We cannot cast the result to a reference type, so if
10234 ARG1 is a reference type, find its underlying type. */
10235 type
= value_type (arg1
);
10236 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10237 type
= TYPE_TARGET_TYPE (type
);
10238 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10239 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10245 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10246 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10247 if (noside
== EVAL_SKIP
)
10249 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10251 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10252 return value_zero (value_type (arg1
), not_lval
);
10256 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10257 if (ada_is_fixed_point_type (value_type (arg1
)))
10258 arg1
= cast_from_fixed (type
, arg1
);
10259 if (ada_is_fixed_point_type (value_type (arg2
)))
10260 arg2
= cast_from_fixed (type
, arg2
);
10261 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10262 return ada_value_binop (arg1
, arg2
, op
);
10266 case BINOP_NOTEQUAL
:
10267 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10268 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10269 if (noside
== EVAL_SKIP
)
10271 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10275 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10276 tem
= ada_value_equal (arg1
, arg2
);
10278 if (op
== BINOP_NOTEQUAL
)
10280 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10281 return value_from_longest (type
, (LONGEST
) tem
);
10284 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10285 if (noside
== EVAL_SKIP
)
10287 else if (ada_is_fixed_point_type (value_type (arg1
)))
10288 return value_cast (value_type (arg1
), value_neg (arg1
));
10291 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10292 return value_neg (arg1
);
10295 case BINOP_LOGICAL_AND
:
10296 case BINOP_LOGICAL_OR
:
10297 case UNOP_LOGICAL_NOT
:
10302 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10303 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10304 return value_cast (type
, val
);
10307 case BINOP_BITWISE_AND
:
10308 case BINOP_BITWISE_IOR
:
10309 case BINOP_BITWISE_XOR
:
10313 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10315 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10317 return value_cast (value_type (arg1
), val
);
10323 if (noside
== EVAL_SKIP
)
10329 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10330 /* Only encountered when an unresolved symbol occurs in a
10331 context other than a function call, in which case, it is
10333 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10334 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10336 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10338 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10339 /* Check to see if this is a tagged type. We also need to handle
10340 the case where the type is a reference to a tagged type, but
10341 we have to be careful to exclude pointers to tagged types.
10342 The latter should be shown as usual (as a pointer), whereas
10343 a reference should mostly be transparent to the user. */
10344 if (ada_is_tagged_type (type
, 0)
10345 || (TYPE_CODE (type
) == TYPE_CODE_REF
10346 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10348 /* Tagged types are a little special in the fact that the real
10349 type is dynamic and can only be determined by inspecting the
10350 object's tag. This means that we need to get the object's
10351 value first (EVAL_NORMAL) and then extract the actual object
10354 Note that we cannot skip the final step where we extract
10355 the object type from its tag, because the EVAL_NORMAL phase
10356 results in dynamic components being resolved into fixed ones.
10357 This can cause problems when trying to print the type
10358 description of tagged types whose parent has a dynamic size:
10359 We use the type name of the "_parent" component in order
10360 to print the name of the ancestor type in the type description.
10361 If that component had a dynamic size, the resolution into
10362 a fixed type would result in the loss of that type name,
10363 thus preventing us from printing the name of the ancestor
10364 type in the type description. */
10365 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10367 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10369 struct type
*actual_type
;
10371 actual_type
= type_from_tag (ada_value_tag (arg1
));
10372 if (actual_type
== NULL
)
10373 /* If, for some reason, we were unable to determine
10374 the actual type from the tag, then use the static
10375 approximation that we just computed as a fallback.
10376 This can happen if the debugging information is
10377 incomplete, for instance. */
10378 actual_type
= type
;
10379 return value_zero (actual_type
, not_lval
);
10383 /* In the case of a ref, ada_coerce_ref takes care
10384 of determining the actual type. But the evaluation
10385 should return a ref as it should be valid to ask
10386 for its address; so rebuild a ref after coerce. */
10387 arg1
= ada_coerce_ref (arg1
);
10388 return value_ref (arg1
);
10392 /* Records and unions for which GNAT encodings have been
10393 generated need to be statically fixed as well.
10394 Otherwise, non-static fixing produces a type where
10395 all dynamic properties are removed, which prevents "ptype"
10396 from being able to completely describe the type.
10397 For instance, a case statement in a variant record would be
10398 replaced by the relevant components based on the actual
10399 value of the discriminants. */
10400 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10401 && dynamic_template_type (type
) != NULL
)
10402 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10403 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10406 return value_zero (to_static_fixed_type (type
), not_lval
);
10410 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10411 return ada_to_fixed_value (arg1
);
10416 /* Allocate arg vector, including space for the function to be
10417 called in argvec[0] and a terminating NULL. */
10418 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10420 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
10422 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10423 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10424 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10425 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10428 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10429 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10432 if (noside
== EVAL_SKIP
)
10436 if (ada_is_constrained_packed_array_type
10437 (desc_base_type (value_type (argvec
[0]))))
10438 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10439 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10440 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10441 /* This is a packed array that has already been fixed, and
10442 therefore already coerced to a simple array. Nothing further
10445 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
10446 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10447 && VALUE_LVAL (argvec
[0]) == lval_memory
))
10448 argvec
[0] = value_addr (argvec
[0]);
10450 type
= ada_check_typedef (value_type (argvec
[0]));
10452 /* Ada allows us to implicitly dereference arrays when subscripting
10453 them. So, if this is an array typedef (encoding use for array
10454 access types encoded as fat pointers), strip it now. */
10455 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10456 type
= ada_typedef_target_type (type
);
10458 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10460 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10462 case TYPE_CODE_FUNC
:
10463 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10465 case TYPE_CODE_ARRAY
:
10467 case TYPE_CODE_STRUCT
:
10468 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10469 argvec
[0] = ada_value_ind (argvec
[0]);
10470 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10473 error (_("cannot subscript or call something of type `%s'"),
10474 ada_type_name (value_type (argvec
[0])));
10479 switch (TYPE_CODE (type
))
10481 case TYPE_CODE_FUNC
:
10482 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10484 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10486 if (TYPE_GNU_IFUNC (type
))
10487 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10488 return allocate_value (rtype
);
10490 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10491 case TYPE_CODE_INTERNAL_FUNCTION
:
10492 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10493 /* We don't know anything about what the internal
10494 function might return, but we have to return
10496 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10499 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10500 argvec
[0], nargs
, argvec
+ 1);
10502 case TYPE_CODE_STRUCT
:
10506 arity
= ada_array_arity (type
);
10507 type
= ada_array_element_type (type
, nargs
);
10509 error (_("cannot subscript or call a record"));
10510 if (arity
!= nargs
)
10511 error (_("wrong number of subscripts; expecting %d"), arity
);
10512 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10513 return value_zero (ada_aligned_type (type
), lval_memory
);
10515 unwrap_value (ada_value_subscript
10516 (argvec
[0], nargs
, argvec
+ 1));
10518 case TYPE_CODE_ARRAY
:
10519 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10521 type
= ada_array_element_type (type
, nargs
);
10523 error (_("element type of array unknown"));
10525 return value_zero (ada_aligned_type (type
), lval_memory
);
10528 unwrap_value (ada_value_subscript
10529 (ada_coerce_to_simple_array (argvec
[0]),
10530 nargs
, argvec
+ 1));
10531 case TYPE_CODE_PTR
: /* Pointer to array */
10532 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10534 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10535 type
= ada_array_element_type (type
, nargs
);
10537 error (_("element type of array unknown"));
10539 return value_zero (ada_aligned_type (type
), lval_memory
);
10542 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10543 nargs
, argvec
+ 1));
10546 error (_("Attempt to index or call something other than an "
10547 "array or function"));
10552 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10553 struct value
*low_bound_val
=
10554 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10555 struct value
*high_bound_val
=
10556 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10558 LONGEST high_bound
;
10560 low_bound_val
= coerce_ref (low_bound_val
);
10561 high_bound_val
= coerce_ref (high_bound_val
);
10562 low_bound
= pos_atr (low_bound_val
);
10563 high_bound
= pos_atr (high_bound_val
);
10565 if (noside
== EVAL_SKIP
)
10568 /* If this is a reference to an aligner type, then remove all
10570 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10571 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10572 TYPE_TARGET_TYPE (value_type (array
)) =
10573 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10575 if (ada_is_constrained_packed_array_type (value_type (array
)))
10576 error (_("cannot slice a packed array"));
10578 /* If this is a reference to an array or an array lvalue,
10579 convert to a pointer. */
10580 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10581 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10582 && VALUE_LVAL (array
) == lval_memory
))
10583 array
= value_addr (array
);
10585 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10586 && ada_is_array_descriptor_type (ada_check_typedef
10587 (value_type (array
))))
10588 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10590 array
= ada_coerce_to_simple_array_ptr (array
);
10592 /* If we have more than one level of pointer indirection,
10593 dereference the value until we get only one level. */
10594 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10595 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10597 array
= value_ind (array
);
10599 /* Make sure we really do have an array type before going further,
10600 to avoid a SEGV when trying to get the index type or the target
10601 type later down the road if the debug info generated by
10602 the compiler is incorrect or incomplete. */
10603 if (!ada_is_simple_array_type (value_type (array
)))
10604 error (_("cannot take slice of non-array"));
10606 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10609 struct type
*type0
= ada_check_typedef (value_type (array
));
10611 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10612 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10615 struct type
*arr_type0
=
10616 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10618 return ada_value_slice_from_ptr (array
, arr_type0
,
10619 longest_to_int (low_bound
),
10620 longest_to_int (high_bound
));
10623 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10625 else if (high_bound
< low_bound
)
10626 return empty_array (value_type (array
), low_bound
);
10628 return ada_value_slice (array
, longest_to_int (low_bound
),
10629 longest_to_int (high_bound
));
10632 case UNOP_IN_RANGE
:
10634 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10635 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10637 if (noside
== EVAL_SKIP
)
10640 switch (TYPE_CODE (type
))
10643 lim_warning (_("Membership test incompletely implemented; "
10644 "always returns true"));
10645 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10646 return value_from_longest (type
, (LONGEST
) 1);
10648 case TYPE_CODE_RANGE
:
10649 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10650 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10651 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10652 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10653 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10655 value_from_longest (type
,
10656 (value_less (arg1
, arg3
)
10657 || value_equal (arg1
, arg3
))
10658 && (value_less (arg2
, arg1
)
10659 || value_equal (arg2
, arg1
)));
10662 case BINOP_IN_BOUNDS
:
10664 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10665 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10667 if (noside
== EVAL_SKIP
)
10670 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10672 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10673 return value_zero (type
, not_lval
);
10676 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10678 type
= ada_index_type (value_type (arg2
), tem
, "range");
10680 type
= value_type (arg1
);
10682 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10683 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10685 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10686 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10687 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10689 value_from_longest (type
,
10690 (value_less (arg1
, arg3
)
10691 || value_equal (arg1
, arg3
))
10692 && (value_less (arg2
, arg1
)
10693 || value_equal (arg2
, arg1
)));
10695 case TERNOP_IN_RANGE
:
10696 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10697 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10698 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10700 if (noside
== EVAL_SKIP
)
10703 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10704 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10705 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10707 value_from_longest (type
,
10708 (value_less (arg1
, arg3
)
10709 || value_equal (arg1
, arg3
))
10710 && (value_less (arg2
, arg1
)
10711 || value_equal (arg2
, arg1
)));
10715 case OP_ATR_LENGTH
:
10717 struct type
*type_arg
;
10719 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10721 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10723 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10727 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10731 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10732 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10733 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10736 if (noside
== EVAL_SKIP
)
10739 if (type_arg
== NULL
)
10741 arg1
= ada_coerce_ref (arg1
);
10743 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10744 arg1
= ada_coerce_to_simple_array (arg1
);
10746 if (op
== OP_ATR_LENGTH
)
10747 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10750 type
= ada_index_type (value_type (arg1
), tem
,
10751 ada_attribute_name (op
));
10753 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10756 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10757 return allocate_value (type
);
10761 default: /* Should never happen. */
10762 error (_("unexpected attribute encountered"));
10764 return value_from_longest
10765 (type
, ada_array_bound (arg1
, tem
, 0));
10767 return value_from_longest
10768 (type
, ada_array_bound (arg1
, tem
, 1));
10769 case OP_ATR_LENGTH
:
10770 return value_from_longest
10771 (type
, ada_array_length (arg1
, tem
));
10774 else if (discrete_type_p (type_arg
))
10776 struct type
*range_type
;
10777 const char *name
= ada_type_name (type_arg
);
10780 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10781 range_type
= to_fixed_range_type (type_arg
, NULL
);
10782 if (range_type
== NULL
)
10783 range_type
= type_arg
;
10787 error (_("unexpected attribute encountered"));
10789 return value_from_longest
10790 (range_type
, ada_discrete_type_low_bound (range_type
));
10792 return value_from_longest
10793 (range_type
, ada_discrete_type_high_bound (range_type
));
10794 case OP_ATR_LENGTH
:
10795 error (_("the 'length attribute applies only to array types"));
10798 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10799 error (_("unimplemented type attribute"));
10804 if (ada_is_constrained_packed_array_type (type_arg
))
10805 type_arg
= decode_constrained_packed_array_type (type_arg
);
10807 if (op
== OP_ATR_LENGTH
)
10808 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10811 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10813 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10816 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10817 return allocate_value (type
);
10822 error (_("unexpected attribute encountered"));
10824 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10825 return value_from_longest (type
, low
);
10827 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10828 return value_from_longest (type
, high
);
10829 case OP_ATR_LENGTH
:
10830 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10831 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10832 return value_from_longest (type
, high
- low
+ 1);
10838 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10839 if (noside
== EVAL_SKIP
)
10842 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10843 return value_zero (ada_tag_type (arg1
), not_lval
);
10845 return ada_value_tag (arg1
);
10849 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10850 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10851 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10852 if (noside
== EVAL_SKIP
)
10854 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10855 return value_zero (value_type (arg1
), not_lval
);
10858 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10859 return value_binop (arg1
, arg2
,
10860 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10863 case OP_ATR_MODULUS
:
10865 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10867 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10868 if (noside
== EVAL_SKIP
)
10871 if (!ada_is_modular_type (type_arg
))
10872 error (_("'modulus must be applied to modular type"));
10874 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10875 ada_modulus (type_arg
));
10880 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10881 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10882 if (noside
== EVAL_SKIP
)
10884 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10885 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10886 return value_zero (type
, not_lval
);
10888 return value_pos_atr (type
, arg1
);
10891 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10892 type
= value_type (arg1
);
10894 /* If the argument is a reference, then dereference its type, since
10895 the user is really asking for the size of the actual object,
10896 not the size of the pointer. */
10897 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10898 type
= TYPE_TARGET_TYPE (type
);
10900 if (noside
== EVAL_SKIP
)
10902 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10903 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10905 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10906 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10909 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10910 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10911 type
= exp
->elts
[pc
+ 2].type
;
10912 if (noside
== EVAL_SKIP
)
10914 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10915 return value_zero (type
, not_lval
);
10917 return value_val_atr (type
, arg1
);
10920 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10921 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10922 if (noside
== EVAL_SKIP
)
10924 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10925 return value_zero (value_type (arg1
), not_lval
);
10928 /* For integer exponentiation operations,
10929 only promote the first argument. */
10930 if (is_integral_type (value_type (arg2
)))
10931 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10933 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10935 return value_binop (arg1
, arg2
, op
);
10939 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10940 if (noside
== EVAL_SKIP
)
10946 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10947 if (noside
== EVAL_SKIP
)
10949 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10950 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10951 return value_neg (arg1
);
10956 preeval_pos
= *pos
;
10957 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10958 if (noside
== EVAL_SKIP
)
10960 type
= ada_check_typedef (value_type (arg1
));
10961 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10963 if (ada_is_array_descriptor_type (type
))
10964 /* GDB allows dereferencing GNAT array descriptors. */
10966 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10968 if (arrType
== NULL
)
10969 error (_("Attempt to dereference null array pointer."));
10970 return value_at_lazy (arrType
, 0);
10972 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10973 || TYPE_CODE (type
) == TYPE_CODE_REF
10974 /* In C you can dereference an array to get the 1st elt. */
10975 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10977 /* As mentioned in the OP_VAR_VALUE case, tagged types can
10978 only be determined by inspecting the object's tag.
10979 This means that we need to evaluate completely the
10980 expression in order to get its type. */
10982 if ((TYPE_CODE (type
) == TYPE_CODE_REF
10983 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
10984 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
10986 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10988 type
= value_type (ada_value_ind (arg1
));
10992 type
= to_static_fixed_type
10994 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10996 ada_ensure_varsize_limit (type
);
10997 return value_zero (type
, lval_memory
);
10999 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11001 /* GDB allows dereferencing an int. */
11002 if (expect_type
== NULL
)
11003 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11008 to_static_fixed_type (ada_aligned_type (expect_type
));
11009 return value_zero (expect_type
, lval_memory
);
11013 error (_("Attempt to take contents of a non-pointer value."));
11015 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11016 type
= ada_check_typedef (value_type (arg1
));
11018 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11019 /* GDB allows dereferencing an int. If we were given
11020 the expect_type, then use that as the target type.
11021 Otherwise, assume that the target type is an int. */
11023 if (expect_type
!= NULL
)
11024 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11027 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11028 (CORE_ADDR
) value_as_address (arg1
));
11031 if (ada_is_array_descriptor_type (type
))
11032 /* GDB allows dereferencing GNAT array descriptors. */
11033 return ada_coerce_to_simple_array (arg1
);
11035 return ada_value_ind (arg1
);
11037 case STRUCTOP_STRUCT
:
11038 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11039 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11040 preeval_pos
= *pos
;
11041 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11042 if (noside
== EVAL_SKIP
)
11044 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11046 struct type
*type1
= value_type (arg1
);
11048 if (ada_is_tagged_type (type1
, 1))
11050 type
= ada_lookup_struct_elt_type (type1
,
11051 &exp
->elts
[pc
+ 2].string
,
11054 /* If the field is not found, check if it exists in the
11055 extension of this object's type. This means that we
11056 need to evaluate completely the expression. */
11060 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11062 arg1
= ada_value_struct_elt (arg1
,
11063 &exp
->elts
[pc
+ 2].string
,
11065 arg1
= unwrap_value (arg1
);
11066 type
= value_type (ada_to_fixed_value (arg1
));
11071 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11074 return value_zero (ada_aligned_type (type
), lval_memory
);
11077 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11078 arg1
= unwrap_value (arg1
);
11079 return ada_to_fixed_value (arg1
);
11082 /* The value is not supposed to be used. This is here to make it
11083 easier to accommodate expressions that contain types. */
11085 if (noside
== EVAL_SKIP
)
11087 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11088 return allocate_value (exp
->elts
[pc
+ 1].type
);
11090 error (_("Attempt to use a type name as an expression"));
11095 case OP_DISCRETE_RANGE
:
11096 case OP_POSITIONAL
:
11098 if (noside
== EVAL_NORMAL
)
11102 error (_("Undefined name, ambiguous name, or renaming used in "
11103 "component association: %s."), &exp
->elts
[pc
+2].string
);
11105 error (_("Aggregates only allowed on the right of an assignment"));
11107 internal_error (__FILE__
, __LINE__
,
11108 _("aggregate apparently mangled"));
11111 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11113 for (tem
= 0; tem
< nargs
; tem
+= 1)
11114 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11119 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
11125 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11126 type name that encodes the 'small and 'delta information.
11127 Otherwise, return NULL. */
11129 static const char *
11130 fixed_type_info (struct type
*type
)
11132 const char *name
= ada_type_name (type
);
11133 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11135 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11137 const char *tail
= strstr (name
, "___XF_");
11144 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11145 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11150 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11153 ada_is_fixed_point_type (struct type
*type
)
11155 return fixed_type_info (type
) != NULL
;
11158 /* Return non-zero iff TYPE represents a System.Address type. */
11161 ada_is_system_address_type (struct type
*type
)
11163 return (TYPE_NAME (type
)
11164 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11167 /* Assuming that TYPE is the representation of an Ada fixed-point
11168 type, return its delta, or -1 if the type is malformed and the
11169 delta cannot be determined. */
11172 ada_delta (struct type
*type
)
11174 const char *encoding
= fixed_type_info (type
);
11177 /* Strictly speaking, num and den are encoded as integer. However,
11178 they may not fit into a long, and they will have to be converted
11179 to DOUBLEST anyway. So scan them as DOUBLEST. */
11180 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11187 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11188 factor ('SMALL value) associated with the type. */
11191 scaling_factor (struct type
*type
)
11193 const char *encoding
= fixed_type_info (type
);
11194 DOUBLEST num0
, den0
, num1
, den1
;
11197 /* Strictly speaking, num's and den's are encoded as integer. However,
11198 they may not fit into a long, and they will have to be converted
11199 to DOUBLEST anyway. So scan them as DOUBLEST. */
11200 n
= sscanf (encoding
,
11201 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
11202 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11203 &num0
, &den0
, &num1
, &den1
);
11208 return num1
/ den1
;
11210 return num0
/ den0
;
11214 /* Assuming that X is the representation of a value of fixed-point
11215 type TYPE, return its floating-point equivalent. */
11218 ada_fixed_to_float (struct type
*type
, LONGEST x
)
11220 return (DOUBLEST
) x
*scaling_factor (type
);
11223 /* The representation of a fixed-point value of type TYPE
11224 corresponding to the value X. */
11227 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
11229 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
11236 /* Scan STR beginning at position K for a discriminant name, and
11237 return the value of that discriminant field of DVAL in *PX. If
11238 PNEW_K is not null, put the position of the character beyond the
11239 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11240 not alter *PX and *PNEW_K if unsuccessful. */
11243 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11246 static char *bound_buffer
= NULL
;
11247 static size_t bound_buffer_len
= 0;
11250 struct value
*bound_val
;
11252 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11255 pend
= strstr (str
+ k
, "__");
11259 k
+= strlen (bound
);
11263 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
11264 bound
= bound_buffer
;
11265 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
11266 bound
[pend
- (str
+ k
)] = '\0';
11270 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11271 if (bound_val
== NULL
)
11274 *px
= value_as_long (bound_val
);
11275 if (pnew_k
!= NULL
)
11280 /* Value of variable named NAME in the current environment. If
11281 no such variable found, then if ERR_MSG is null, returns 0, and
11282 otherwise causes an error with message ERR_MSG. */
11284 static struct value
*
11285 get_var_value (char *name
, char *err_msg
)
11287 struct ada_symbol_info
*syms
;
11290 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11295 if (err_msg
== NULL
)
11298 error (("%s"), err_msg
);
11301 return value_of_variable (syms
[0].sym
, syms
[0].block
);
11304 /* Value of integer variable named NAME in the current environment. If
11305 no such variable found, returns 0, and sets *FLAG to 0. If
11306 successful, sets *FLAG to 1. */
11309 get_int_var_value (char *name
, int *flag
)
11311 struct value
*var_val
= get_var_value (name
, 0);
11323 return value_as_long (var_val
);
11328 /* Return a range type whose base type is that of the range type named
11329 NAME in the current environment, and whose bounds are calculated
11330 from NAME according to the GNAT range encoding conventions.
11331 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11332 corresponding range type from debug information; fall back to using it
11333 if symbol lookup fails. If a new type must be created, allocate it
11334 like ORIG_TYPE was. The bounds information, in general, is encoded
11335 in NAME, the base type given in the named range type. */
11337 static struct type
*
11338 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11341 struct type
*base_type
;
11342 char *subtype_info
;
11344 gdb_assert (raw_type
!= NULL
);
11345 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11347 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11348 base_type
= TYPE_TARGET_TYPE (raw_type
);
11350 base_type
= raw_type
;
11352 name
= TYPE_NAME (raw_type
);
11353 subtype_info
= strstr (name
, "___XD");
11354 if (subtype_info
== NULL
)
11356 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11357 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11359 if (L
< INT_MIN
|| U
> INT_MAX
)
11362 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11367 static char *name_buf
= NULL
;
11368 static size_t name_len
= 0;
11369 int prefix_len
= subtype_info
- name
;
11375 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11376 strncpy (name_buf
, name
, prefix_len
);
11377 name_buf
[prefix_len
] = '\0';
11380 bounds_str
= strchr (subtype_info
, '_');
11383 if (*subtype_info
== 'L')
11385 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11386 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11388 if (bounds_str
[n
] == '_')
11390 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11398 strcpy (name_buf
+ prefix_len
, "___L");
11399 L
= get_int_var_value (name_buf
, &ok
);
11402 lim_warning (_("Unknown lower bound, using 1."));
11407 if (*subtype_info
== 'U')
11409 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11410 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11417 strcpy (name_buf
+ prefix_len
, "___U");
11418 U
= get_int_var_value (name_buf
, &ok
);
11421 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11426 type
= create_static_range_type (alloc_type_copy (raw_type
),
11428 TYPE_NAME (type
) = name
;
11433 /* True iff NAME is the name of a range type. */
11436 ada_is_range_type_name (const char *name
)
11438 return (name
!= NULL
&& strstr (name
, "___XD"));
11442 /* Modular types */
11444 /* True iff TYPE is an Ada modular type. */
11447 ada_is_modular_type (struct type
*type
)
11449 struct type
*subranged_type
= get_base_type (type
);
11451 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11452 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11453 && TYPE_UNSIGNED (subranged_type
));
11456 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11459 ada_modulus (struct type
*type
)
11461 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11465 /* Ada exception catchpoint support:
11466 ---------------------------------
11468 We support 3 kinds of exception catchpoints:
11469 . catchpoints on Ada exceptions
11470 . catchpoints on unhandled Ada exceptions
11471 . catchpoints on failed assertions
11473 Exceptions raised during failed assertions, or unhandled exceptions
11474 could perfectly be caught with the general catchpoint on Ada exceptions.
11475 However, we can easily differentiate these two special cases, and having
11476 the option to distinguish these two cases from the rest can be useful
11477 to zero-in on certain situations.
11479 Exception catchpoints are a specialized form of breakpoint,
11480 since they rely on inserting breakpoints inside known routines
11481 of the GNAT runtime. The implementation therefore uses a standard
11482 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11485 Support in the runtime for exception catchpoints have been changed
11486 a few times already, and these changes affect the implementation
11487 of these catchpoints. In order to be able to support several
11488 variants of the runtime, we use a sniffer that will determine
11489 the runtime variant used by the program being debugged. */
11491 /* Ada's standard exceptions.
11493 The Ada 83 standard also defined Numeric_Error. But there so many
11494 situations where it was unclear from the Ada 83 Reference Manual
11495 (RM) whether Constraint_Error or Numeric_Error should be raised,
11496 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11497 Interpretation saying that anytime the RM says that Numeric_Error
11498 should be raised, the implementation may raise Constraint_Error.
11499 Ada 95 went one step further and pretty much removed Numeric_Error
11500 from the list of standard exceptions (it made it a renaming of
11501 Constraint_Error, to help preserve compatibility when compiling
11502 an Ada83 compiler). As such, we do not include Numeric_Error from
11503 this list of standard exceptions. */
11505 static char *standard_exc
[] = {
11506 "constraint_error",
11512 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11514 /* A structure that describes how to support exception catchpoints
11515 for a given executable. */
11517 struct exception_support_info
11519 /* The name of the symbol to break on in order to insert
11520 a catchpoint on exceptions. */
11521 const char *catch_exception_sym
;
11523 /* The name of the symbol to break on in order to insert
11524 a catchpoint on unhandled exceptions. */
11525 const char *catch_exception_unhandled_sym
;
11527 /* The name of the symbol to break on in order to insert
11528 a catchpoint on failed assertions. */
11529 const char *catch_assert_sym
;
11531 /* Assuming that the inferior just triggered an unhandled exception
11532 catchpoint, this function is responsible for returning the address
11533 in inferior memory where the name of that exception is stored.
11534 Return zero if the address could not be computed. */
11535 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11538 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11539 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11541 /* The following exception support info structure describes how to
11542 implement exception catchpoints with the latest version of the
11543 Ada runtime (as of 2007-03-06). */
11545 static const struct exception_support_info default_exception_support_info
=
11547 "__gnat_debug_raise_exception", /* catch_exception_sym */
11548 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11549 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11550 ada_unhandled_exception_name_addr
11553 /* The following exception support info structure describes how to
11554 implement exception catchpoints with a slightly older version
11555 of the Ada runtime. */
11557 static const struct exception_support_info exception_support_info_fallback
=
11559 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11560 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11561 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11562 ada_unhandled_exception_name_addr_from_raise
11565 /* Return nonzero if we can detect the exception support routines
11566 described in EINFO.
11568 This function errors out if an abnormal situation is detected
11569 (for instance, if we find the exception support routines, but
11570 that support is found to be incomplete). */
11573 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11575 struct symbol
*sym
;
11577 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11578 that should be compiled with debugging information. As a result, we
11579 expect to find that symbol in the symtabs. */
11581 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11584 /* Perhaps we did not find our symbol because the Ada runtime was
11585 compiled without debugging info, or simply stripped of it.
11586 It happens on some GNU/Linux distributions for instance, where
11587 users have to install a separate debug package in order to get
11588 the runtime's debugging info. In that situation, let the user
11589 know why we cannot insert an Ada exception catchpoint.
11591 Note: Just for the purpose of inserting our Ada exception
11592 catchpoint, we could rely purely on the associated minimal symbol.
11593 But we would be operating in degraded mode anyway, since we are
11594 still lacking the debugging info needed later on to extract
11595 the name of the exception being raised (this name is printed in
11596 the catchpoint message, and is also used when trying to catch
11597 a specific exception). We do not handle this case for now. */
11598 struct bound_minimal_symbol msym
11599 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11601 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11602 error (_("Your Ada runtime appears to be missing some debugging "
11603 "information.\nCannot insert Ada exception catchpoint "
11604 "in this configuration."));
11609 /* Make sure that the symbol we found corresponds to a function. */
11611 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11612 error (_("Symbol \"%s\" is not a function (class = %d)"),
11613 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11618 /* Inspect the Ada runtime and determine which exception info structure
11619 should be used to provide support for exception catchpoints.
11621 This function will always set the per-inferior exception_info,
11622 or raise an error. */
11625 ada_exception_support_info_sniffer (void)
11627 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11629 /* If the exception info is already known, then no need to recompute it. */
11630 if (data
->exception_info
!= NULL
)
11633 /* Check the latest (default) exception support info. */
11634 if (ada_has_this_exception_support (&default_exception_support_info
))
11636 data
->exception_info
= &default_exception_support_info
;
11640 /* Try our fallback exception suport info. */
11641 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11643 data
->exception_info
= &exception_support_info_fallback
;
11647 /* Sometimes, it is normal for us to not be able to find the routine
11648 we are looking for. This happens when the program is linked with
11649 the shared version of the GNAT runtime, and the program has not been
11650 started yet. Inform the user of these two possible causes if
11653 if (ada_update_initial_language (language_unknown
) != language_ada
)
11654 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11656 /* If the symbol does not exist, then check that the program is
11657 already started, to make sure that shared libraries have been
11658 loaded. If it is not started, this may mean that the symbol is
11659 in a shared library. */
11661 if (ptid_get_pid (inferior_ptid
) == 0)
11662 error (_("Unable to insert catchpoint. Try to start the program first."));
11664 /* At this point, we know that we are debugging an Ada program and
11665 that the inferior has been started, but we still are not able to
11666 find the run-time symbols. That can mean that we are in
11667 configurable run time mode, or that a-except as been optimized
11668 out by the linker... In any case, at this point it is not worth
11669 supporting this feature. */
11671 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11674 /* True iff FRAME is very likely to be that of a function that is
11675 part of the runtime system. This is all very heuristic, but is
11676 intended to be used as advice as to what frames are uninteresting
11680 is_known_support_routine (struct frame_info
*frame
)
11682 struct symtab_and_line sal
;
11684 enum language func_lang
;
11686 const char *fullname
;
11688 /* If this code does not have any debugging information (no symtab),
11689 This cannot be any user code. */
11691 find_frame_sal (frame
, &sal
);
11692 if (sal
.symtab
== NULL
)
11695 /* If there is a symtab, but the associated source file cannot be
11696 located, then assume this is not user code: Selecting a frame
11697 for which we cannot display the code would not be very helpful
11698 for the user. This should also take care of case such as VxWorks
11699 where the kernel has some debugging info provided for a few units. */
11701 fullname
= symtab_to_fullname (sal
.symtab
);
11702 if (access (fullname
, R_OK
) != 0)
11705 /* Check the unit filename againt the Ada runtime file naming.
11706 We also check the name of the objfile against the name of some
11707 known system libraries that sometimes come with debugging info
11710 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11712 re_comp (known_runtime_file_name_patterns
[i
]);
11713 if (re_exec (lbasename (sal
.symtab
->filename
)))
11715 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11716 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11720 /* Check whether the function is a GNAT-generated entity. */
11722 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
11723 if (func_name
== NULL
)
11726 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11728 re_comp (known_auxiliary_function_name_patterns
[i
]);
11729 if (re_exec (func_name
))
11740 /* Find the first frame that contains debugging information and that is not
11741 part of the Ada run-time, starting from FI and moving upward. */
11744 ada_find_printable_frame (struct frame_info
*fi
)
11746 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11748 if (!is_known_support_routine (fi
))
11757 /* Assuming that the inferior just triggered an unhandled exception
11758 catchpoint, return the address in inferior memory where the name
11759 of the exception is stored.
11761 Return zero if the address could not be computed. */
11764 ada_unhandled_exception_name_addr (void)
11766 return parse_and_eval_address ("e.full_name");
11769 /* Same as ada_unhandled_exception_name_addr, except that this function
11770 should be used when the inferior uses an older version of the runtime,
11771 where the exception name needs to be extracted from a specific frame
11772 several frames up in the callstack. */
11775 ada_unhandled_exception_name_addr_from_raise (void)
11778 struct frame_info
*fi
;
11779 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11780 struct cleanup
*old_chain
;
11782 /* To determine the name of this exception, we need to select
11783 the frame corresponding to RAISE_SYM_NAME. This frame is
11784 at least 3 levels up, so we simply skip the first 3 frames
11785 without checking the name of their associated function. */
11786 fi
= get_current_frame ();
11787 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11789 fi
= get_prev_frame (fi
);
11791 old_chain
= make_cleanup (null_cleanup
, NULL
);
11795 enum language func_lang
;
11797 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
11798 if (func_name
!= NULL
)
11800 make_cleanup (xfree
, func_name
);
11802 if (strcmp (func_name
,
11803 data
->exception_info
->catch_exception_sym
) == 0)
11804 break; /* We found the frame we were looking for... */
11805 fi
= get_prev_frame (fi
);
11808 do_cleanups (old_chain
);
11814 return parse_and_eval_address ("id.full_name");
11817 /* Assuming the inferior just triggered an Ada exception catchpoint
11818 (of any type), return the address in inferior memory where the name
11819 of the exception is stored, if applicable.
11821 Return zero if the address could not be computed, or if not relevant. */
11824 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11825 struct breakpoint
*b
)
11827 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11831 case ada_catch_exception
:
11832 return (parse_and_eval_address ("e.full_name"));
11835 case ada_catch_exception_unhandled
:
11836 return data
->exception_info
->unhandled_exception_name_addr ();
11839 case ada_catch_assert
:
11840 return 0; /* Exception name is not relevant in this case. */
11844 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11848 return 0; /* Should never be reached. */
11851 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11852 any error that ada_exception_name_addr_1 might cause to be thrown.
11853 When an error is intercepted, a warning with the error message is printed,
11854 and zero is returned. */
11857 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11858 struct breakpoint
*b
)
11860 CORE_ADDR result
= 0;
11864 result
= ada_exception_name_addr_1 (ex
, b
);
11867 CATCH (e
, RETURN_MASK_ERROR
)
11869 warning (_("failed to get exception name: %s"), e
.message
);
11877 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11879 /* Ada catchpoints.
11881 In the case of catchpoints on Ada exceptions, the catchpoint will
11882 stop the target on every exception the program throws. When a user
11883 specifies the name of a specific exception, we translate this
11884 request into a condition expression (in text form), and then parse
11885 it into an expression stored in each of the catchpoint's locations.
11886 We then use this condition to check whether the exception that was
11887 raised is the one the user is interested in. If not, then the
11888 target is resumed again. We store the name of the requested
11889 exception, in order to be able to re-set the condition expression
11890 when symbols change. */
11892 /* An instance of this type is used to represent an Ada catchpoint
11893 breakpoint location. It includes a "struct bp_location" as a kind
11894 of base class; users downcast to "struct bp_location *" when
11897 struct ada_catchpoint_location
11899 /* The base class. */
11900 struct bp_location base
;
11902 /* The condition that checks whether the exception that was raised
11903 is the specific exception the user specified on catchpoint
11905 struct expression
*excep_cond_expr
;
11908 /* Implement the DTOR method in the bp_location_ops structure for all
11909 Ada exception catchpoint kinds. */
11912 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11914 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11916 xfree (al
->excep_cond_expr
);
11919 /* The vtable to be used in Ada catchpoint locations. */
11921 static const struct bp_location_ops ada_catchpoint_location_ops
=
11923 ada_catchpoint_location_dtor
11926 /* An instance of this type is used to represent an Ada catchpoint.
11927 It includes a "struct breakpoint" as a kind of base class; users
11928 downcast to "struct breakpoint *" when needed. */
11930 struct ada_catchpoint
11932 /* The base class. */
11933 struct breakpoint base
;
11935 /* The name of the specific exception the user specified. */
11936 char *excep_string
;
11939 /* Parse the exception condition string in the context of each of the
11940 catchpoint's locations, and store them for later evaluation. */
11943 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11945 struct cleanup
*old_chain
;
11946 struct bp_location
*bl
;
11949 /* Nothing to do if there's no specific exception to catch. */
11950 if (c
->excep_string
== NULL
)
11953 /* Same if there are no locations... */
11954 if (c
->base
.loc
== NULL
)
11957 /* Compute the condition expression in text form, from the specific
11958 expection we want to catch. */
11959 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11960 old_chain
= make_cleanup (xfree
, cond_string
);
11962 /* Iterate over all the catchpoint's locations, and parse an
11963 expression for each. */
11964 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11966 struct ada_catchpoint_location
*ada_loc
11967 = (struct ada_catchpoint_location
*) bl
;
11968 struct expression
*exp
= NULL
;
11970 if (!bl
->shlib_disabled
)
11977 exp
= parse_exp_1 (&s
, bl
->address
,
11978 block_for_pc (bl
->address
), 0);
11980 CATCH (e
, RETURN_MASK_ERROR
)
11982 warning (_("failed to reevaluate internal exception condition "
11983 "for catchpoint %d: %s"),
11984 c
->base
.number
, e
.message
);
11985 /* There is a bug in GCC on sparc-solaris when building with
11986 optimization which causes EXP to change unexpectedly
11987 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
11988 The problem should be fixed starting with GCC 4.9.
11989 In the meantime, work around it by forcing EXP back
11996 ada_loc
->excep_cond_expr
= exp
;
11999 do_cleanups (old_chain
);
12002 /* Implement the DTOR method in the breakpoint_ops structure for all
12003 exception catchpoint kinds. */
12006 dtor_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
12008 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12010 xfree (c
->excep_string
);
12012 bkpt_breakpoint_ops
.dtor (b
);
12015 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12016 structure for all exception catchpoint kinds. */
12018 static struct bp_location
*
12019 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
12020 struct breakpoint
*self
)
12022 struct ada_catchpoint_location
*loc
;
12024 loc
= XNEW (struct ada_catchpoint_location
);
12025 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
12026 loc
->excep_cond_expr
= NULL
;
12030 /* Implement the RE_SET method in the breakpoint_ops structure for all
12031 exception catchpoint kinds. */
12034 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
12036 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12038 /* Call the base class's method. This updates the catchpoint's
12040 bkpt_breakpoint_ops
.re_set (b
);
12042 /* Reparse the exception conditional expressions. One for each
12044 create_excep_cond_exprs (c
);
12047 /* Returns true if we should stop for this breakpoint hit. If the
12048 user specified a specific exception, we only want to cause a stop
12049 if the program thrown that exception. */
12052 should_stop_exception (const struct bp_location
*bl
)
12054 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12055 const struct ada_catchpoint_location
*ada_loc
12056 = (const struct ada_catchpoint_location
*) bl
;
12059 /* With no specific exception, should always stop. */
12060 if (c
->excep_string
== NULL
)
12063 if (ada_loc
->excep_cond_expr
== NULL
)
12065 /* We will have a NULL expression if back when we were creating
12066 the expressions, this location's had failed to parse. */
12073 struct value
*mark
;
12075 mark
= value_mark ();
12076 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
12077 value_free_to_mark (mark
);
12079 CATCH (ex
, RETURN_MASK_ALL
)
12081 exception_fprintf (gdb_stderr
, ex
,
12082 _("Error in testing exception condition:\n"));
12089 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12090 for all exception catchpoint kinds. */
12093 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12095 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12098 /* Implement the PRINT_IT method in the breakpoint_ops structure
12099 for all exception catchpoint kinds. */
12101 static enum print_stop_action
12102 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12104 struct ui_out
*uiout
= current_uiout
;
12105 struct breakpoint
*b
= bs
->breakpoint_at
;
12107 annotate_catchpoint (b
->number
);
12109 if (ui_out_is_mi_like_p (uiout
))
12111 ui_out_field_string (uiout
, "reason",
12112 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12113 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
12116 ui_out_text (uiout
,
12117 b
->disposition
== disp_del
? "\nTemporary catchpoint "
12118 : "\nCatchpoint ");
12119 ui_out_field_int (uiout
, "bkptno", b
->number
);
12120 ui_out_text (uiout
, ", ");
12124 case ada_catch_exception
:
12125 case ada_catch_exception_unhandled
:
12127 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
12128 char exception_name
[256];
12132 read_memory (addr
, (gdb_byte
*) exception_name
,
12133 sizeof (exception_name
) - 1);
12134 exception_name
[sizeof (exception_name
) - 1] = '\0';
12138 /* For some reason, we were unable to read the exception
12139 name. This could happen if the Runtime was compiled
12140 without debugging info, for instance. In that case,
12141 just replace the exception name by the generic string
12142 "exception" - it will read as "an exception" in the
12143 notification we are about to print. */
12144 memcpy (exception_name
, "exception", sizeof ("exception"));
12146 /* In the case of unhandled exception breakpoints, we print
12147 the exception name as "unhandled EXCEPTION_NAME", to make
12148 it clearer to the user which kind of catchpoint just got
12149 hit. We used ui_out_text to make sure that this extra
12150 info does not pollute the exception name in the MI case. */
12151 if (ex
== ada_catch_exception_unhandled
)
12152 ui_out_text (uiout
, "unhandled ");
12153 ui_out_field_string (uiout
, "exception-name", exception_name
);
12156 case ada_catch_assert
:
12157 /* In this case, the name of the exception is not really
12158 important. Just print "failed assertion" to make it clearer
12159 that his program just hit an assertion-failure catchpoint.
12160 We used ui_out_text because this info does not belong in
12162 ui_out_text (uiout
, "failed assertion");
12165 ui_out_text (uiout
, " at ");
12166 ada_find_printable_frame (get_current_frame ());
12168 return PRINT_SRC_AND_LOC
;
12171 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12172 for all exception catchpoint kinds. */
12175 print_one_exception (enum ada_exception_catchpoint_kind ex
,
12176 struct breakpoint
*b
, struct bp_location
**last_loc
)
12178 struct ui_out
*uiout
= current_uiout
;
12179 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12180 struct value_print_options opts
;
12182 get_user_print_options (&opts
);
12183 if (opts
.addressprint
)
12185 annotate_field (4);
12186 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
12189 annotate_field (5);
12190 *last_loc
= b
->loc
;
12193 case ada_catch_exception
:
12194 if (c
->excep_string
!= NULL
)
12196 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12198 ui_out_field_string (uiout
, "what", msg
);
12202 ui_out_field_string (uiout
, "what", "all Ada exceptions");
12206 case ada_catch_exception_unhandled
:
12207 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
12210 case ada_catch_assert
:
12211 ui_out_field_string (uiout
, "what", "failed Ada assertions");
12215 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12220 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12221 for all exception catchpoint kinds. */
12224 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12225 struct breakpoint
*b
)
12227 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12228 struct ui_out
*uiout
= current_uiout
;
12230 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
12231 : _("Catchpoint "));
12232 ui_out_field_int (uiout
, "bkptno", b
->number
);
12233 ui_out_text (uiout
, ": ");
12237 case ada_catch_exception
:
12238 if (c
->excep_string
!= NULL
)
12240 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12241 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12243 ui_out_text (uiout
, info
);
12244 do_cleanups (old_chain
);
12247 ui_out_text (uiout
, _("all Ada exceptions"));
12250 case ada_catch_exception_unhandled
:
12251 ui_out_text (uiout
, _("unhandled Ada exceptions"));
12254 case ada_catch_assert
:
12255 ui_out_text (uiout
, _("failed Ada assertions"));
12259 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12264 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12265 for all exception catchpoint kinds. */
12268 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12269 struct breakpoint
*b
, struct ui_file
*fp
)
12271 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12275 case ada_catch_exception
:
12276 fprintf_filtered (fp
, "catch exception");
12277 if (c
->excep_string
!= NULL
)
12278 fprintf_filtered (fp
, " %s", c
->excep_string
);
12281 case ada_catch_exception_unhandled
:
12282 fprintf_filtered (fp
, "catch exception unhandled");
12285 case ada_catch_assert
:
12286 fprintf_filtered (fp
, "catch assert");
12290 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12292 print_recreate_thread (b
, fp
);
12295 /* Virtual table for "catch exception" breakpoints. */
12298 dtor_catch_exception (struct breakpoint
*b
)
12300 dtor_exception (ada_catch_exception
, b
);
12303 static struct bp_location
*
12304 allocate_location_catch_exception (struct breakpoint
*self
)
12306 return allocate_location_exception (ada_catch_exception
, self
);
12310 re_set_catch_exception (struct breakpoint
*b
)
12312 re_set_exception (ada_catch_exception
, b
);
12316 check_status_catch_exception (bpstat bs
)
12318 check_status_exception (ada_catch_exception
, bs
);
12321 static enum print_stop_action
12322 print_it_catch_exception (bpstat bs
)
12324 return print_it_exception (ada_catch_exception
, bs
);
12328 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12330 print_one_exception (ada_catch_exception
, b
, last_loc
);
12334 print_mention_catch_exception (struct breakpoint
*b
)
12336 print_mention_exception (ada_catch_exception
, b
);
12340 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12342 print_recreate_exception (ada_catch_exception
, b
, fp
);
12345 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12347 /* Virtual table for "catch exception unhandled" breakpoints. */
12350 dtor_catch_exception_unhandled (struct breakpoint
*b
)
12352 dtor_exception (ada_catch_exception_unhandled
, b
);
12355 static struct bp_location
*
12356 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12358 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12362 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12364 re_set_exception (ada_catch_exception_unhandled
, b
);
12368 check_status_catch_exception_unhandled (bpstat bs
)
12370 check_status_exception (ada_catch_exception_unhandled
, bs
);
12373 static enum print_stop_action
12374 print_it_catch_exception_unhandled (bpstat bs
)
12376 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12380 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12381 struct bp_location
**last_loc
)
12383 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12387 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12389 print_mention_exception (ada_catch_exception_unhandled
, b
);
12393 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12394 struct ui_file
*fp
)
12396 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12399 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12401 /* Virtual table for "catch assert" breakpoints. */
12404 dtor_catch_assert (struct breakpoint
*b
)
12406 dtor_exception (ada_catch_assert
, b
);
12409 static struct bp_location
*
12410 allocate_location_catch_assert (struct breakpoint
*self
)
12412 return allocate_location_exception (ada_catch_assert
, self
);
12416 re_set_catch_assert (struct breakpoint
*b
)
12418 re_set_exception (ada_catch_assert
, b
);
12422 check_status_catch_assert (bpstat bs
)
12424 check_status_exception (ada_catch_assert
, bs
);
12427 static enum print_stop_action
12428 print_it_catch_assert (bpstat bs
)
12430 return print_it_exception (ada_catch_assert
, bs
);
12434 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12436 print_one_exception (ada_catch_assert
, b
, last_loc
);
12440 print_mention_catch_assert (struct breakpoint
*b
)
12442 print_mention_exception (ada_catch_assert
, b
);
12446 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12448 print_recreate_exception (ada_catch_assert
, b
, fp
);
12451 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12453 /* Return a newly allocated copy of the first space-separated token
12454 in ARGSP, and then adjust ARGSP to point immediately after that
12457 Return NULL if ARGPS does not contain any more tokens. */
12460 ada_get_next_arg (char **argsp
)
12462 char *args
= *argsp
;
12466 args
= skip_spaces (args
);
12467 if (args
[0] == '\0')
12468 return NULL
; /* No more arguments. */
12470 /* Find the end of the current argument. */
12472 end
= skip_to_space (args
);
12474 /* Adjust ARGSP to point to the start of the next argument. */
12478 /* Make a copy of the current argument and return it. */
12480 result
= xmalloc (end
- args
+ 1);
12481 strncpy (result
, args
, end
- args
);
12482 result
[end
- args
] = '\0';
12487 /* Split the arguments specified in a "catch exception" command.
12488 Set EX to the appropriate catchpoint type.
12489 Set EXCEP_STRING to the name of the specific exception if
12490 specified by the user.
12491 If a condition is found at the end of the arguments, the condition
12492 expression is stored in COND_STRING (memory must be deallocated
12493 after use). Otherwise COND_STRING is set to NULL. */
12496 catch_ada_exception_command_split (char *args
,
12497 enum ada_exception_catchpoint_kind
*ex
,
12498 char **excep_string
,
12499 char **cond_string
)
12501 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12502 char *exception_name
;
12505 exception_name
= ada_get_next_arg (&args
);
12506 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12508 /* This is not an exception name; this is the start of a condition
12509 expression for a catchpoint on all exceptions. So, "un-get"
12510 this token, and set exception_name to NULL. */
12511 xfree (exception_name
);
12512 exception_name
= NULL
;
12515 make_cleanup (xfree
, exception_name
);
12517 /* Check to see if we have a condition. */
12519 args
= skip_spaces (args
);
12520 if (startswith (args
, "if")
12521 && (isspace (args
[2]) || args
[2] == '\0'))
12524 args
= skip_spaces (args
);
12526 if (args
[0] == '\0')
12527 error (_("Condition missing after `if' keyword"));
12528 cond
= xstrdup (args
);
12529 make_cleanup (xfree
, cond
);
12531 args
+= strlen (args
);
12534 /* Check that we do not have any more arguments. Anything else
12537 if (args
[0] != '\0')
12538 error (_("Junk at end of expression"));
12540 discard_cleanups (old_chain
);
12542 if (exception_name
== NULL
)
12544 /* Catch all exceptions. */
12545 *ex
= ada_catch_exception
;
12546 *excep_string
= NULL
;
12548 else if (strcmp (exception_name
, "unhandled") == 0)
12550 /* Catch unhandled exceptions. */
12551 *ex
= ada_catch_exception_unhandled
;
12552 *excep_string
= NULL
;
12556 /* Catch a specific exception. */
12557 *ex
= ada_catch_exception
;
12558 *excep_string
= exception_name
;
12560 *cond_string
= cond
;
12563 /* Return the name of the symbol on which we should break in order to
12564 implement a catchpoint of the EX kind. */
12566 static const char *
12567 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12569 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12571 gdb_assert (data
->exception_info
!= NULL
);
12575 case ada_catch_exception
:
12576 return (data
->exception_info
->catch_exception_sym
);
12578 case ada_catch_exception_unhandled
:
12579 return (data
->exception_info
->catch_exception_unhandled_sym
);
12581 case ada_catch_assert
:
12582 return (data
->exception_info
->catch_assert_sym
);
12585 internal_error (__FILE__
, __LINE__
,
12586 _("unexpected catchpoint kind (%d)"), ex
);
12590 /* Return the breakpoint ops "virtual table" used for catchpoints
12593 static const struct breakpoint_ops
*
12594 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12598 case ada_catch_exception
:
12599 return (&catch_exception_breakpoint_ops
);
12601 case ada_catch_exception_unhandled
:
12602 return (&catch_exception_unhandled_breakpoint_ops
);
12604 case ada_catch_assert
:
12605 return (&catch_assert_breakpoint_ops
);
12608 internal_error (__FILE__
, __LINE__
,
12609 _("unexpected catchpoint kind (%d)"), ex
);
12613 /* Return the condition that will be used to match the current exception
12614 being raised with the exception that the user wants to catch. This
12615 assumes that this condition is used when the inferior just triggered
12616 an exception catchpoint.
12618 The string returned is a newly allocated string that needs to be
12619 deallocated later. */
12622 ada_exception_catchpoint_cond_string (const char *excep_string
)
12626 /* The standard exceptions are a special case. They are defined in
12627 runtime units that have been compiled without debugging info; if
12628 EXCEP_STRING is the not-fully-qualified name of a standard
12629 exception (e.g. "constraint_error") then, during the evaluation
12630 of the condition expression, the symbol lookup on this name would
12631 *not* return this standard exception. The catchpoint condition
12632 may then be set only on user-defined exceptions which have the
12633 same not-fully-qualified name (e.g. my_package.constraint_error).
12635 To avoid this unexcepted behavior, these standard exceptions are
12636 systematically prefixed by "standard". This means that "catch
12637 exception constraint_error" is rewritten into "catch exception
12638 standard.constraint_error".
12640 If an exception named contraint_error is defined in another package of
12641 the inferior program, then the only way to specify this exception as a
12642 breakpoint condition is to use its fully-qualified named:
12643 e.g. my_package.constraint_error. */
12645 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12647 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12649 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12653 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12656 /* Return the symtab_and_line that should be used to insert an exception
12657 catchpoint of the TYPE kind.
12659 EXCEP_STRING should contain the name of a specific exception that
12660 the catchpoint should catch, or NULL otherwise.
12662 ADDR_STRING returns the name of the function where the real
12663 breakpoint that implements the catchpoints is set, depending on the
12664 type of catchpoint we need to create. */
12666 static struct symtab_and_line
12667 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12668 char **addr_string
, const struct breakpoint_ops
**ops
)
12670 const char *sym_name
;
12671 struct symbol
*sym
;
12673 /* First, find out which exception support info to use. */
12674 ada_exception_support_info_sniffer ();
12676 /* Then lookup the function on which we will break in order to catch
12677 the Ada exceptions requested by the user. */
12678 sym_name
= ada_exception_sym_name (ex
);
12679 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12681 /* We can assume that SYM is not NULL at this stage. If the symbol
12682 did not exist, ada_exception_support_info_sniffer would have
12683 raised an exception.
12685 Also, ada_exception_support_info_sniffer should have already
12686 verified that SYM is a function symbol. */
12687 gdb_assert (sym
!= NULL
);
12688 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12690 /* Set ADDR_STRING. */
12691 *addr_string
= xstrdup (sym_name
);
12694 *ops
= ada_exception_breakpoint_ops (ex
);
12696 return find_function_start_sal (sym
, 1);
12699 /* Create an Ada exception catchpoint.
12701 EX_KIND is the kind of exception catchpoint to be created.
12703 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12704 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12705 of the exception to which this catchpoint applies. When not NULL,
12706 the string must be allocated on the heap, and its deallocation
12707 is no longer the responsibility of the caller.
12709 COND_STRING, if not NULL, is the catchpoint condition. This string
12710 must be allocated on the heap, and its deallocation is no longer
12711 the responsibility of the caller.
12713 TEMPFLAG, if nonzero, means that the underlying breakpoint
12714 should be temporary.
12716 FROM_TTY is the usual argument passed to all commands implementations. */
12719 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12720 enum ada_exception_catchpoint_kind ex_kind
,
12721 char *excep_string
,
12727 struct ada_catchpoint
*c
;
12728 char *addr_string
= NULL
;
12729 const struct breakpoint_ops
*ops
= NULL
;
12730 struct symtab_and_line sal
12731 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12733 c
= XNEW (struct ada_catchpoint
);
12734 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
12735 ops
, tempflag
, disabled
, from_tty
);
12736 c
->excep_string
= excep_string
;
12737 create_excep_cond_exprs (c
);
12738 if (cond_string
!= NULL
)
12739 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
12740 install_breakpoint (0, &c
->base
, 1);
12743 /* Implement the "catch exception" command. */
12746 catch_ada_exception_command (char *arg
, int from_tty
,
12747 struct cmd_list_element
*command
)
12749 struct gdbarch
*gdbarch
= get_current_arch ();
12751 enum ada_exception_catchpoint_kind ex_kind
;
12752 char *excep_string
= NULL
;
12753 char *cond_string
= NULL
;
12755 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12759 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12761 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12762 excep_string
, cond_string
,
12763 tempflag
, 1 /* enabled */,
12767 /* Split the arguments specified in a "catch assert" command.
12769 ARGS contains the command's arguments (or the empty string if
12770 no arguments were passed).
12772 If ARGS contains a condition, set COND_STRING to that condition
12773 (the memory needs to be deallocated after use). */
12776 catch_ada_assert_command_split (char *args
, char **cond_string
)
12778 args
= skip_spaces (args
);
12780 /* Check whether a condition was provided. */
12781 if (startswith (args
, "if")
12782 && (isspace (args
[2]) || args
[2] == '\0'))
12785 args
= skip_spaces (args
);
12786 if (args
[0] == '\0')
12787 error (_("condition missing after `if' keyword"));
12788 *cond_string
= xstrdup (args
);
12791 /* Otherwise, there should be no other argument at the end of
12793 else if (args
[0] != '\0')
12794 error (_("Junk at end of arguments."));
12797 /* Implement the "catch assert" command. */
12800 catch_assert_command (char *arg
, int from_tty
,
12801 struct cmd_list_element
*command
)
12803 struct gdbarch
*gdbarch
= get_current_arch ();
12805 char *cond_string
= NULL
;
12807 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12811 catch_ada_assert_command_split (arg
, &cond_string
);
12812 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12814 tempflag
, 1 /* enabled */,
12818 /* Return non-zero if the symbol SYM is an Ada exception object. */
12821 ada_is_exception_sym (struct symbol
*sym
)
12823 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
12825 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12826 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12827 && SYMBOL_CLASS (sym
) != LOC_CONST
12828 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12829 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12832 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12833 Ada exception object. This matches all exceptions except the ones
12834 defined by the Ada language. */
12837 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12841 if (!ada_is_exception_sym (sym
))
12844 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12845 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
12846 return 0; /* A standard exception. */
12848 /* Numeric_Error is also a standard exception, so exclude it.
12849 See the STANDARD_EXC description for more details as to why
12850 this exception is not listed in that array. */
12851 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
12857 /* A helper function for qsort, comparing two struct ada_exc_info
12860 The comparison is determined first by exception name, and then
12861 by exception address. */
12864 compare_ada_exception_info (const void *a
, const void *b
)
12866 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
12867 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
12870 result
= strcmp (exc_a
->name
, exc_b
->name
);
12874 if (exc_a
->addr
< exc_b
->addr
)
12876 if (exc_a
->addr
> exc_b
->addr
)
12882 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12883 routine, but keeping the first SKIP elements untouched.
12885 All duplicates are also removed. */
12888 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
12891 struct ada_exc_info
*to_sort
12892 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
12894 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
12897 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
12898 compare_ada_exception_info
);
12900 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
12901 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
12902 to_sort
[j
++] = to_sort
[i
];
12904 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
12907 /* A function intended as the "name_matcher" callback in the struct
12908 quick_symbol_functions' expand_symtabs_matching method.
12910 SEARCH_NAME is the symbol's search name.
12912 If USER_DATA is not NULL, it is a pointer to a regext_t object
12913 used to match the symbol (by natural name). Otherwise, when USER_DATA
12914 is null, no filtering is performed, and all symbols are a positive
12918 ada_exc_search_name_matches (const char *search_name
, void *user_data
)
12920 regex_t
*preg
= user_data
;
12925 /* In Ada, the symbol "search name" is a linkage name, whereas
12926 the regular expression used to do the matching refers to
12927 the natural name. So match against the decoded name. */
12928 return (regexec (preg
, ada_decode (search_name
), 0, NULL
, 0) == 0);
12931 /* Add all exceptions defined by the Ada standard whose name match
12932 a regular expression.
12934 If PREG is not NULL, then this regexp_t object is used to
12935 perform the symbol name matching. Otherwise, no name-based
12936 filtering is performed.
12938 EXCEPTIONS is a vector of exceptions to which matching exceptions
12942 ada_add_standard_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12946 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12949 || regexec (preg
, standard_exc
[i
], 0, NULL
, 0) == 0)
12951 struct bound_minimal_symbol msymbol
12952 = ada_lookup_simple_minsym (standard_exc
[i
]);
12954 if (msymbol
.minsym
!= NULL
)
12956 struct ada_exc_info info
12957 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12959 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12965 /* Add all Ada exceptions defined locally and accessible from the given
12968 If PREG is not NULL, then this regexp_t object is used to
12969 perform the symbol name matching. Otherwise, no name-based
12970 filtering is performed.
12972 EXCEPTIONS is a vector of exceptions to which matching exceptions
12976 ada_add_exceptions_from_frame (regex_t
*preg
, struct frame_info
*frame
,
12977 VEC(ada_exc_info
) **exceptions
)
12979 const struct block
*block
= get_frame_block (frame
, 0);
12983 struct block_iterator iter
;
12984 struct symbol
*sym
;
12986 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12988 switch (SYMBOL_CLASS (sym
))
12995 if (ada_is_exception_sym (sym
))
12997 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
12998 SYMBOL_VALUE_ADDRESS (sym
)};
13000 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13004 if (BLOCK_FUNCTION (block
) != NULL
)
13006 block
= BLOCK_SUPERBLOCK (block
);
13010 /* Add all exceptions defined globally whose name name match
13011 a regular expression, excluding standard exceptions.
13013 The reason we exclude standard exceptions is that they need
13014 to be handled separately: Standard exceptions are defined inside
13015 a runtime unit which is normally not compiled with debugging info,
13016 and thus usually do not show up in our symbol search. However,
13017 if the unit was in fact built with debugging info, we need to
13018 exclude them because they would duplicate the entry we found
13019 during the special loop that specifically searches for those
13020 standard exceptions.
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_global_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
13032 struct objfile
*objfile
;
13033 struct compunit_symtab
*s
;
13035 expand_symtabs_matching (NULL
, ada_exc_search_name_matches
, NULL
,
13036 VARIABLES_DOMAIN
, preg
);
13038 ALL_COMPUNITS (objfile
, s
)
13040 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13043 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13045 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13046 struct block_iterator iter
;
13047 struct symbol
*sym
;
13049 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13050 if (ada_is_non_standard_exception_sym (sym
)
13052 || regexec (preg
, SYMBOL_NATURAL_NAME (sym
),
13055 struct ada_exc_info info
13056 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
13058 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13064 /* Implements ada_exceptions_list with the regular expression passed
13065 as a regex_t, rather than a string.
13067 If not NULL, PREG is used to filter out exceptions whose names
13068 do not match. Otherwise, all exceptions are listed. */
13070 static VEC(ada_exc_info
) *
13071 ada_exceptions_list_1 (regex_t
*preg
)
13073 VEC(ada_exc_info
) *result
= NULL
;
13074 struct cleanup
*old_chain
13075 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
13078 /* First, list the known standard exceptions. These exceptions
13079 need to be handled separately, as they are usually defined in
13080 runtime units that have been compiled without debugging info. */
13082 ada_add_standard_exceptions (preg
, &result
);
13084 /* Next, find all exceptions whose scope is local and accessible
13085 from the currently selected frame. */
13087 if (has_stack_frames ())
13089 prev_len
= VEC_length (ada_exc_info
, result
);
13090 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13092 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13093 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13096 /* Add all exceptions whose scope is global. */
13098 prev_len
= VEC_length (ada_exc_info
, result
);
13099 ada_add_global_exceptions (preg
, &result
);
13100 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13101 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13103 discard_cleanups (old_chain
);
13107 /* Return a vector of ada_exc_info.
13109 If REGEXP is NULL, all exceptions are included in the result.
13110 Otherwise, it should contain a valid regular expression,
13111 and only the exceptions whose names match that regular expression
13112 are included in the result.
13114 The exceptions are sorted in the following order:
13115 - Standard exceptions (defined by the Ada language), in
13116 alphabetical order;
13117 - Exceptions only visible from the current frame, in
13118 alphabetical order;
13119 - Exceptions whose scope is global, in alphabetical order. */
13121 VEC(ada_exc_info
) *
13122 ada_exceptions_list (const char *regexp
)
13124 VEC(ada_exc_info
) *result
= NULL
;
13125 struct cleanup
*old_chain
= NULL
;
13128 if (regexp
!= NULL
)
13129 old_chain
= compile_rx_or_error (®
, regexp
,
13130 _("invalid regular expression"));
13132 result
= ada_exceptions_list_1 (regexp
!= NULL
? ®
: NULL
);
13134 if (old_chain
!= NULL
)
13135 do_cleanups (old_chain
);
13139 /* Implement the "info exceptions" command. */
13142 info_exceptions_command (char *regexp
, int from_tty
)
13144 VEC(ada_exc_info
) *exceptions
;
13145 struct cleanup
*cleanup
;
13146 struct gdbarch
*gdbarch
= get_current_arch ();
13148 struct ada_exc_info
*info
;
13150 exceptions
= ada_exceptions_list (regexp
);
13151 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
13153 if (regexp
!= NULL
)
13155 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13157 printf_filtered (_("All defined Ada exceptions:\n"));
13159 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
13160 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
13162 do_cleanups (cleanup
);
13166 /* Information about operators given special treatment in functions
13168 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13170 #define ADA_OPERATORS \
13171 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13172 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13173 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13174 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13175 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13176 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13177 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13178 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13179 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13180 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13181 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13182 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13183 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13184 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13185 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13186 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13187 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13188 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13189 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13192 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13195 switch (exp
->elts
[pc
- 1].opcode
)
13198 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13201 #define OP_DEFN(op, len, args, binop) \
13202 case op: *oplenp = len; *argsp = args; break;
13208 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13213 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13218 /* Implementation of the exp_descriptor method operator_check. */
13221 ada_operator_check (struct expression
*exp
, int pos
,
13222 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13225 const union exp_element
*const elts
= exp
->elts
;
13226 struct type
*type
= NULL
;
13228 switch (elts
[pos
].opcode
)
13230 case UNOP_IN_RANGE
:
13232 type
= elts
[pos
+ 1].type
;
13236 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13239 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13241 if (type
&& TYPE_OBJFILE (type
)
13242 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13249 ada_op_name (enum exp_opcode opcode
)
13254 return op_name_standard (opcode
);
13256 #define OP_DEFN(op, len, args, binop) case op: return #op;
13261 return "OP_AGGREGATE";
13263 return "OP_CHOICES";
13269 /* As for operator_length, but assumes PC is pointing at the first
13270 element of the operator, and gives meaningful results only for the
13271 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13274 ada_forward_operator_length (struct expression
*exp
, int pc
,
13275 int *oplenp
, int *argsp
)
13277 switch (exp
->elts
[pc
].opcode
)
13280 *oplenp
= *argsp
= 0;
13283 #define OP_DEFN(op, len, args, binop) \
13284 case op: *oplenp = len; *argsp = args; break;
13290 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13295 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13301 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13303 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13311 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13313 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13318 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13322 /* Ada attributes ('Foo). */
13325 case OP_ATR_LENGTH
:
13329 case OP_ATR_MODULUS
:
13336 case UNOP_IN_RANGE
:
13338 /* XXX: gdb_sprint_host_address, type_sprint */
13339 fprintf_filtered (stream
, _("Type @"));
13340 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13341 fprintf_filtered (stream
, " (");
13342 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13343 fprintf_filtered (stream
, ")");
13345 case BINOP_IN_BOUNDS
:
13346 fprintf_filtered (stream
, " (%d)",
13347 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13349 case TERNOP_IN_RANGE
:
13354 case OP_DISCRETE_RANGE
:
13355 case OP_POSITIONAL
:
13362 char *name
= &exp
->elts
[elt
+ 2].string
;
13363 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13365 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13370 return dump_subexp_body_standard (exp
, stream
, elt
);
13374 for (i
= 0; i
< nargs
; i
+= 1)
13375 elt
= dump_subexp (exp
, stream
, elt
);
13380 /* The Ada extension of print_subexp (q.v.). */
13383 ada_print_subexp (struct expression
*exp
, int *pos
,
13384 struct ui_file
*stream
, enum precedence prec
)
13386 int oplen
, nargs
, i
;
13388 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13390 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13397 print_subexp_standard (exp
, pos
, stream
, prec
);
13401 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13404 case BINOP_IN_BOUNDS
:
13405 /* XXX: sprint_subexp */
13406 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13407 fputs_filtered (" in ", stream
);
13408 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13409 fputs_filtered ("'range", stream
);
13410 if (exp
->elts
[pc
+ 1].longconst
> 1)
13411 fprintf_filtered (stream
, "(%ld)",
13412 (long) exp
->elts
[pc
+ 1].longconst
);
13415 case TERNOP_IN_RANGE
:
13416 if (prec
>= PREC_EQUAL
)
13417 fputs_filtered ("(", stream
);
13418 /* XXX: sprint_subexp */
13419 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13420 fputs_filtered (" in ", stream
);
13421 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13422 fputs_filtered (" .. ", stream
);
13423 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13424 if (prec
>= PREC_EQUAL
)
13425 fputs_filtered (")", stream
);
13430 case OP_ATR_LENGTH
:
13434 case OP_ATR_MODULUS
:
13439 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13441 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13442 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13443 &type_print_raw_options
);
13447 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13448 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13453 for (tem
= 1; tem
< nargs
; tem
+= 1)
13455 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13456 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13458 fputs_filtered (")", stream
);
13463 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13464 fputs_filtered ("'(", stream
);
13465 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13466 fputs_filtered (")", stream
);
13469 case UNOP_IN_RANGE
:
13470 /* XXX: sprint_subexp */
13471 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13472 fputs_filtered (" in ", stream
);
13473 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13474 &type_print_raw_options
);
13477 case OP_DISCRETE_RANGE
:
13478 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13479 fputs_filtered ("..", stream
);
13480 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13484 fputs_filtered ("others => ", stream
);
13485 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13489 for (i
= 0; i
< nargs
-1; i
+= 1)
13492 fputs_filtered ("|", stream
);
13493 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13495 fputs_filtered (" => ", stream
);
13496 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13499 case OP_POSITIONAL
:
13500 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13504 fputs_filtered ("(", stream
);
13505 for (i
= 0; i
< nargs
; i
+= 1)
13508 fputs_filtered (", ", stream
);
13509 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13511 fputs_filtered (")", stream
);
13516 /* Table mapping opcodes into strings for printing operators
13517 and precedences of the operators. */
13519 static const struct op_print ada_op_print_tab
[] = {
13520 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13521 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13522 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13523 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13524 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13525 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13526 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13527 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13528 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13529 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13530 {">", BINOP_GTR
, PREC_ORDER
, 0},
13531 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13532 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13533 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13534 {"+", BINOP_ADD
, PREC_ADD
, 0},
13535 {"-", BINOP_SUB
, PREC_ADD
, 0},
13536 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13537 {"*", BINOP_MUL
, PREC_MUL
, 0},
13538 {"/", BINOP_DIV
, PREC_MUL
, 0},
13539 {"rem", BINOP_REM
, PREC_MUL
, 0},
13540 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13541 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13542 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13543 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13544 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13545 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13546 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13547 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13548 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13549 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13550 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13554 enum ada_primitive_types
{
13555 ada_primitive_type_int
,
13556 ada_primitive_type_long
,
13557 ada_primitive_type_short
,
13558 ada_primitive_type_char
,
13559 ada_primitive_type_float
,
13560 ada_primitive_type_double
,
13561 ada_primitive_type_void
,
13562 ada_primitive_type_long_long
,
13563 ada_primitive_type_long_double
,
13564 ada_primitive_type_natural
,
13565 ada_primitive_type_positive
,
13566 ada_primitive_type_system_address
,
13567 nr_ada_primitive_types
13571 ada_language_arch_info (struct gdbarch
*gdbarch
,
13572 struct language_arch_info
*lai
)
13574 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13576 lai
->primitive_type_vector
13577 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13580 lai
->primitive_type_vector
[ada_primitive_type_int
]
13581 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13583 lai
->primitive_type_vector
[ada_primitive_type_long
]
13584 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13585 0, "long_integer");
13586 lai
->primitive_type_vector
[ada_primitive_type_short
]
13587 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13588 0, "short_integer");
13589 lai
->string_char_type
13590 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13591 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13592 lai
->primitive_type_vector
[ada_primitive_type_float
]
13593 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13595 lai
->primitive_type_vector
[ada_primitive_type_double
]
13596 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13597 "long_float", NULL
);
13598 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13599 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13600 0, "long_long_integer");
13601 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13602 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13603 "long_long_float", NULL
);
13604 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13605 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13607 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13608 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13610 lai
->primitive_type_vector
[ada_primitive_type_void
]
13611 = builtin
->builtin_void
;
13613 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13614 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13615 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13616 = "system__address";
13618 lai
->bool_type_symbol
= NULL
;
13619 lai
->bool_type_default
= builtin
->builtin_bool
;
13622 /* Language vector */
13624 /* Not really used, but needed in the ada_language_defn. */
13627 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13629 ada_emit_char (c
, type
, stream
, quoter
, 1);
13633 parse (struct parser_state
*ps
)
13635 warnings_issued
= 0;
13636 return ada_parse (ps
);
13639 static const struct exp_descriptor ada_exp_descriptor
= {
13641 ada_operator_length
,
13642 ada_operator_check
,
13644 ada_dump_subexp_body
,
13645 ada_evaluate_subexp
13648 /* Implement the "la_get_symbol_name_cmp" language_defn method
13651 static symbol_name_cmp_ftype
13652 ada_get_symbol_name_cmp (const char *lookup_name
)
13654 if (should_use_wild_match (lookup_name
))
13657 return compare_names
;
13660 /* Implement the "la_read_var_value" language_defn method for Ada. */
13662 static struct value
*
13663 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
13665 const struct block
*frame_block
= NULL
;
13666 struct symbol
*renaming_sym
= NULL
;
13668 /* The only case where default_read_var_value is not sufficient
13669 is when VAR is a renaming... */
13671 frame_block
= get_frame_block (frame
, NULL
);
13673 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13674 if (renaming_sym
!= NULL
)
13675 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13677 /* This is a typical case where we expect the default_read_var_value
13678 function to work. */
13679 return default_read_var_value (var
, frame
);
13682 const struct language_defn ada_language_defn
= {
13683 "ada", /* Language name */
13687 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13688 that's not quite what this means. */
13690 macro_expansion_no
,
13691 &ada_exp_descriptor
,
13695 ada_printchar
, /* Print a character constant */
13696 ada_printstr
, /* Function to print string constant */
13697 emit_char
, /* Function to print single char (not used) */
13698 ada_print_type
, /* Print a type using appropriate syntax */
13699 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13700 ada_val_print
, /* Print a value using appropriate syntax */
13701 ada_value_print
, /* Print a top-level value */
13702 ada_read_var_value
, /* la_read_var_value */
13703 NULL
, /* Language specific skip_trampoline */
13704 NULL
, /* name_of_this */
13705 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13706 basic_lookup_transparent_type
, /* lookup_transparent_type */
13707 ada_la_decode
, /* Language specific symbol demangler */
13708 NULL
, /* Language specific
13709 class_name_from_physname */
13710 ada_op_print_tab
, /* expression operators for printing */
13711 0, /* c-style arrays */
13712 1, /* String lower bound */
13713 ada_get_gdb_completer_word_break_characters
,
13714 ada_make_symbol_completion_list
,
13715 ada_language_arch_info
,
13716 ada_print_array_index
,
13717 default_pass_by_reference
,
13719 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13720 ada_iterate_over_symbols
,
13727 /* Provide a prototype to silence -Wmissing-prototypes. */
13728 extern initialize_file_ftype _initialize_ada_language
;
13730 /* Command-list for the "set/show ada" prefix command. */
13731 static struct cmd_list_element
*set_ada_list
;
13732 static struct cmd_list_element
*show_ada_list
;
13734 /* Implement the "set ada" prefix command. */
13737 set_ada_command (char *arg
, int from_tty
)
13739 printf_unfiltered (_(\
13740 "\"set ada\" must be followed by the name of a setting.\n"));
13741 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
13744 /* Implement the "show ada" prefix command. */
13747 show_ada_command (char *args
, int from_tty
)
13749 cmd_show_list (show_ada_list
, from_tty
, "");
13753 initialize_ada_catchpoint_ops (void)
13755 struct breakpoint_ops
*ops
;
13757 initialize_breakpoint_ops ();
13759 ops
= &catch_exception_breakpoint_ops
;
13760 *ops
= bkpt_breakpoint_ops
;
13761 ops
->dtor
= dtor_catch_exception
;
13762 ops
->allocate_location
= allocate_location_catch_exception
;
13763 ops
->re_set
= re_set_catch_exception
;
13764 ops
->check_status
= check_status_catch_exception
;
13765 ops
->print_it
= print_it_catch_exception
;
13766 ops
->print_one
= print_one_catch_exception
;
13767 ops
->print_mention
= print_mention_catch_exception
;
13768 ops
->print_recreate
= print_recreate_catch_exception
;
13770 ops
= &catch_exception_unhandled_breakpoint_ops
;
13771 *ops
= bkpt_breakpoint_ops
;
13772 ops
->dtor
= dtor_catch_exception_unhandled
;
13773 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
13774 ops
->re_set
= re_set_catch_exception_unhandled
;
13775 ops
->check_status
= check_status_catch_exception_unhandled
;
13776 ops
->print_it
= print_it_catch_exception_unhandled
;
13777 ops
->print_one
= print_one_catch_exception_unhandled
;
13778 ops
->print_mention
= print_mention_catch_exception_unhandled
;
13779 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
13781 ops
= &catch_assert_breakpoint_ops
;
13782 *ops
= bkpt_breakpoint_ops
;
13783 ops
->dtor
= dtor_catch_assert
;
13784 ops
->allocate_location
= allocate_location_catch_assert
;
13785 ops
->re_set
= re_set_catch_assert
;
13786 ops
->check_status
= check_status_catch_assert
;
13787 ops
->print_it
= print_it_catch_assert
;
13788 ops
->print_one
= print_one_catch_assert
;
13789 ops
->print_mention
= print_mention_catch_assert
;
13790 ops
->print_recreate
= print_recreate_catch_assert
;
13793 /* This module's 'new_objfile' observer. */
13796 ada_new_objfile_observer (struct objfile
*objfile
)
13798 ada_clear_symbol_cache ();
13801 /* This module's 'free_objfile' observer. */
13804 ada_free_objfile_observer (struct objfile
*objfile
)
13806 ada_clear_symbol_cache ();
13810 _initialize_ada_language (void)
13812 add_language (&ada_language_defn
);
13814 initialize_ada_catchpoint_ops ();
13816 add_prefix_cmd ("ada", no_class
, set_ada_command
,
13817 _("Prefix command for changing Ada-specfic settings"),
13818 &set_ada_list
, "set ada ", 0, &setlist
);
13820 add_prefix_cmd ("ada", no_class
, show_ada_command
,
13821 _("Generic command for showing Ada-specific settings."),
13822 &show_ada_list
, "show ada ", 0, &showlist
);
13824 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
13825 &trust_pad_over_xvs
, _("\
13826 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13827 Show whether an optimization trusting PAD types over XVS types is activated"),
13829 This is related to the encoding used by the GNAT compiler. The debugger\n\
13830 should normally trust the contents of PAD types, but certain older versions\n\
13831 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13832 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13833 work around this bug. It is always safe to turn this option \"off\", but\n\
13834 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13835 this option to \"off\" unless necessary."),
13836 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13838 add_catch_command ("exception", _("\
13839 Catch Ada exceptions, when raised.\n\
13840 With an argument, catch only exceptions with the given name."),
13841 catch_ada_exception_command
,
13845 add_catch_command ("assert", _("\
13846 Catch failed Ada assertions, when raised.\n\
13847 With an argument, catch only exceptions with the given name."),
13848 catch_assert_command
,
13853 varsize_limit
= 65536;
13855 add_info ("exceptions", info_exceptions_command
,
13857 List all Ada exception names.\n\
13858 If a regular expression is passed as an argument, only those matching\n\
13859 the regular expression are listed."));
13861 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
13862 _("Set Ada maintenance-related variables."),
13863 &maint_set_ada_cmdlist
, "maintenance set ada ",
13864 0/*allow-unknown*/, &maintenance_set_cmdlist
);
13866 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
13867 _("Show Ada maintenance-related variables"),
13868 &maint_show_ada_cmdlist
, "maintenance show ada ",
13869 0/*allow-unknown*/, &maintenance_show_cmdlist
);
13871 add_setshow_boolean_cmd
13872 ("ignore-descriptive-types", class_maintenance
,
13873 &ada_ignore_descriptive_types_p
,
13874 _("Set whether descriptive types generated by GNAT should be ignored."),
13875 _("Show whether descriptive types generated by GNAT should be ignored."),
13877 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13878 DWARF attribute."),
13879 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
13881 obstack_init (&symbol_list_obstack
);
13883 decoded_names_store
= htab_create_alloc
13884 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
13885 NULL
, xcalloc
, xfree
);
13887 /* The ada-lang observers. */
13888 observer_attach_new_objfile (ada_new_objfile_observer
);
13889 observer_attach_free_objfile (ada_free_objfile_observer
);
13890 observer_attach_inferior_exit (ada_inferior_exit
);
13892 /* Setup various context-specific data. */
13894 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
13895 ada_pspace_data_handle
13896 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);