1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2014 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"
48 #include "exceptions.h"
56 #include "typeprint.h"
60 #include "mi/mi-common.h"
61 #include "arch-utils.h"
62 #include "cli/cli-utils.h"
64 /* Define whether or not the C operator '/' truncates towards zero for
65 differently signed operands (truncation direction is undefined in C).
66 Copied from valarith.c. */
68 #ifndef TRUNCATION_TOWARDS_ZERO
69 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
72 static struct type
*desc_base_type (struct type
*);
74 static struct type
*desc_bounds_type (struct type
*);
76 static struct value
*desc_bounds (struct value
*);
78 static int fat_pntr_bounds_bitpos (struct type
*);
80 static int fat_pntr_bounds_bitsize (struct type
*);
82 static struct type
*desc_data_target_type (struct type
*);
84 static struct value
*desc_data (struct value
*);
86 static int fat_pntr_data_bitpos (struct type
*);
88 static int fat_pntr_data_bitsize (struct type
*);
90 static struct value
*desc_one_bound (struct value
*, int, int);
92 static int desc_bound_bitpos (struct type
*, int, int);
94 static int desc_bound_bitsize (struct type
*, int, int);
96 static struct type
*desc_index_type (struct type
*, int);
98 static int desc_arity (struct type
*);
100 static int ada_type_match (struct type
*, struct type
*, int);
102 static int ada_args_match (struct symbol
*, struct value
**, int);
104 static int full_match (const char *, const char *);
106 static struct value
*make_array_descriptor (struct type
*, struct value
*);
108 static void ada_add_block_symbols (struct obstack
*,
109 const struct block
*, const char *,
110 domain_enum
, struct objfile
*, int);
112 static int is_nonfunction (struct ada_symbol_info
*, int);
114 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
115 const struct block
*);
117 static int num_defns_collected (struct obstack
*);
119 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
121 static struct value
*resolve_subexp (struct expression
**, int *, int,
124 static void replace_operator_with_call (struct expression
**, int, int, int,
125 struct symbol
*, const struct block
*);
127 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
129 static char *ada_op_name (enum exp_opcode
);
131 static const char *ada_decoded_op_name (enum exp_opcode
);
133 static int numeric_type_p (struct type
*);
135 static int integer_type_p (struct type
*);
137 static int scalar_type_p (struct type
*);
139 static int discrete_type_p (struct type
*);
141 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
146 static struct symbol
*find_old_style_renaming_symbol (const char *,
147 const struct block
*);
149 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
152 static struct value
*evaluate_subexp_type (struct expression
*, int *);
154 static struct type
*ada_find_parallel_type_with_name (struct type
*,
157 static int is_dynamic_field (struct type
*, int);
159 static struct type
*to_fixed_variant_branch_type (struct type
*,
161 CORE_ADDR
, struct value
*);
163 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
165 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
167 static struct type
*to_static_fixed_type (struct type
*);
168 static struct type
*static_unwrap_type (struct type
*type
);
170 static struct value
*unwrap_value (struct value
*);
172 static struct type
*constrained_packed_array_type (struct type
*, long *);
174 static struct type
*decode_constrained_packed_array_type (struct type
*);
176 static long decode_packed_array_bitsize (struct type
*);
178 static struct value
*decode_constrained_packed_array (struct value
*);
180 static int ada_is_packed_array_type (struct type
*);
182 static int ada_is_unconstrained_packed_array_type (struct type
*);
184 static struct value
*value_subscript_packed (struct value
*, int,
187 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
189 static struct value
*coerce_unspec_val_to_type (struct value
*,
192 static struct value
*get_var_value (char *, char *);
194 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
196 static int equiv_types (struct type
*, struct type
*);
198 static int is_name_suffix (const char *);
200 static int advance_wild_match (const char **, const char *, int);
202 static int wild_match (const char *, const char *);
204 static struct value
*ada_coerce_ref (struct value
*);
206 static LONGEST
pos_atr (struct value
*);
208 static struct value
*value_pos_atr (struct type
*, struct value
*);
210 static struct value
*value_val_atr (struct type
*, struct value
*);
212 static struct symbol
*standard_lookup (const char *, const struct block
*,
215 static struct value
*ada_search_struct_field (char *, struct value
*, int,
218 static struct value
*ada_value_primitive_field (struct value
*, int, int,
221 static int find_struct_field (const char *, struct type
*, int,
222 struct type
**, int *, int *, int *, int *);
224 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
227 static int ada_resolve_function (struct ada_symbol_info
*, int,
228 struct value
**, int, const char *,
231 static int ada_is_direct_array_type (struct type
*);
233 static void ada_language_arch_info (struct gdbarch
*,
234 struct language_arch_info
*);
236 static void check_size (const struct type
*);
238 static struct value
*ada_index_struct_field (int, struct value
*, int,
241 static struct value
*assign_aggregate (struct value
*, struct value
*,
245 static void aggregate_assign_from_choices (struct value
*, struct value
*,
247 int *, LONGEST
*, int *,
248 int, LONGEST
, LONGEST
);
250 static void aggregate_assign_positional (struct value
*, struct value
*,
252 int *, LONGEST
*, int *, int,
256 static void aggregate_assign_others (struct value
*, struct value
*,
258 int *, LONGEST
*, int, LONGEST
, LONGEST
);
261 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
264 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
267 static void ada_forward_operator_length (struct expression
*, int, int *,
270 static struct type
*ada_find_any_type (const char *name
);
273 /* The result of a symbol lookup to be stored in our symbol cache. */
277 /* The name used to perform the lookup. */
279 /* The namespace used during the lookup. */
280 domain_enum
namespace;
281 /* The symbol returned by the lookup, or NULL if no matching symbol
284 /* The block where the symbol was found, or NULL if no matching
286 const struct block
*block
;
287 /* A pointer to the next entry with the same hash. */
288 struct cache_entry
*next
;
291 /* The Ada symbol cache, used to store the result of Ada-mode symbol
292 lookups in the course of executing the user's commands.
294 The cache is implemented using a simple, fixed-sized hash.
295 The size is fixed on the grounds that there are not likely to be
296 all that many symbols looked up during any given session, regardless
297 of the size of the symbol table. If we decide to go to a resizable
298 table, let's just use the stuff from libiberty instead. */
300 #define HASH_SIZE 1009
302 struct ada_symbol_cache
304 /* An obstack used to store the entries in our cache. */
305 struct obstack cache_space
;
307 /* The root of the hash table used to implement our symbol cache. */
308 struct cache_entry
*root
[HASH_SIZE
];
311 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
313 /* Maximum-sized dynamic type. */
314 static unsigned int varsize_limit
;
316 /* FIXME: brobecker/2003-09-17: No longer a const because it is
317 returned by a function that does not return a const char *. */
318 static char *ada_completer_word_break_characters
=
320 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
322 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
325 /* The name of the symbol to use to get the name of the main subprogram. */
326 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
327 = "__gnat_ada_main_program_name";
329 /* Limit on the number of warnings to raise per expression evaluation. */
330 static int warning_limit
= 2;
332 /* Number of warning messages issued; reset to 0 by cleanups after
333 expression evaluation. */
334 static int warnings_issued
= 0;
336 static const char *known_runtime_file_name_patterns
[] = {
337 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
340 static const char *known_auxiliary_function_name_patterns
[] = {
341 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
344 /* Space for allocating results of ada_lookup_symbol_list. */
345 static struct obstack symbol_list_obstack
;
347 /* Maintenance-related settings for this module. */
349 static struct cmd_list_element
*maint_set_ada_cmdlist
;
350 static struct cmd_list_element
*maint_show_ada_cmdlist
;
352 /* Implement the "maintenance set ada" (prefix) command. */
355 maint_set_ada_cmd (char *args
, int from_tty
)
357 help_list (maint_set_ada_cmdlist
, "maintenance set ada ", all_commands
,
361 /* Implement the "maintenance show ada" (prefix) command. */
364 maint_show_ada_cmd (char *args
, int from_tty
)
366 cmd_show_list (maint_show_ada_cmdlist
, from_tty
, "");
369 /* The "maintenance ada set/show ignore-descriptive-type" value. */
371 static int ada_ignore_descriptive_types_p
= 0;
373 /* Inferior-specific data. */
375 /* Per-inferior data for this module. */
377 struct ada_inferior_data
379 /* The ada__tags__type_specific_data type, which is used when decoding
380 tagged types. With older versions of GNAT, this type was directly
381 accessible through a component ("tsd") in the object tag. But this
382 is no longer the case, so we cache it for each inferior. */
383 struct type
*tsd_type
;
385 /* The exception_support_info data. This data is used to determine
386 how to implement support for Ada exception catchpoints in a given
388 const struct exception_support_info
*exception_info
;
391 /* Our key to this module's inferior data. */
392 static const struct inferior_data
*ada_inferior_data
;
394 /* A cleanup routine for our inferior data. */
396 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
398 struct ada_inferior_data
*data
;
400 data
= inferior_data (inf
, ada_inferior_data
);
405 /* Return our inferior data for the given inferior (INF).
407 This function always returns a valid pointer to an allocated
408 ada_inferior_data structure. If INF's inferior data has not
409 been previously set, this functions creates a new one with all
410 fields set to zero, sets INF's inferior to it, and then returns
411 a pointer to that newly allocated ada_inferior_data. */
413 static struct ada_inferior_data
*
414 get_ada_inferior_data (struct inferior
*inf
)
416 struct ada_inferior_data
*data
;
418 data
= inferior_data (inf
, ada_inferior_data
);
421 data
= XCNEW (struct ada_inferior_data
);
422 set_inferior_data (inf
, ada_inferior_data
, data
);
428 /* Perform all necessary cleanups regarding our module's inferior data
429 that is required after the inferior INF just exited. */
432 ada_inferior_exit (struct inferior
*inf
)
434 ada_inferior_data_cleanup (inf
, NULL
);
435 set_inferior_data (inf
, ada_inferior_data
, NULL
);
439 /* program-space-specific data. */
441 /* This module's per-program-space data. */
442 struct ada_pspace_data
444 /* The Ada symbol cache. */
445 struct ada_symbol_cache
*sym_cache
;
448 /* Key to our per-program-space data. */
449 static const struct program_space_data
*ada_pspace_data_handle
;
451 /* Return this module's data for the given program space (PSPACE).
452 If not is found, add a zero'ed one now.
454 This function always returns a valid object. */
456 static struct ada_pspace_data
*
457 get_ada_pspace_data (struct program_space
*pspace
)
459 struct ada_pspace_data
*data
;
461 data
= program_space_data (pspace
, ada_pspace_data_handle
);
464 data
= XCNEW (struct ada_pspace_data
);
465 set_program_space_data (pspace
, ada_pspace_data_handle
, data
);
471 /* The cleanup callback for this module's per-program-space data. */
474 ada_pspace_data_cleanup (struct program_space
*pspace
, void *data
)
476 struct ada_pspace_data
*pspace_data
= data
;
478 if (pspace_data
->sym_cache
!= NULL
)
479 ada_free_symbol_cache (pspace_data
->sym_cache
);
485 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
486 all typedef layers have been peeled. Otherwise, return TYPE.
488 Normally, we really expect a typedef type to only have 1 typedef layer.
489 In other words, we really expect the target type of a typedef type to be
490 a non-typedef type. This is particularly true for Ada units, because
491 the language does not have a typedef vs not-typedef distinction.
492 In that respect, the Ada compiler has been trying to eliminate as many
493 typedef definitions in the debugging information, since they generally
494 do not bring any extra information (we still use typedef under certain
495 circumstances related mostly to the GNAT encoding).
497 Unfortunately, we have seen situations where the debugging information
498 generated by the compiler leads to such multiple typedef layers. For
499 instance, consider the following example with stabs:
501 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
502 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
504 This is an error in the debugging information which causes type
505 pck__float_array___XUP to be defined twice, and the second time,
506 it is defined as a typedef of a typedef.
508 This is on the fringe of legality as far as debugging information is
509 concerned, and certainly unexpected. But it is easy to handle these
510 situations correctly, so we can afford to be lenient in this case. */
513 ada_typedef_target_type (struct type
*type
)
515 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
516 type
= TYPE_TARGET_TYPE (type
);
520 /* Given DECODED_NAME a string holding a symbol name in its
521 decoded form (ie using the Ada dotted notation), returns
522 its unqualified name. */
525 ada_unqualified_name (const char *decoded_name
)
527 const char *result
= strrchr (decoded_name
, '.');
530 result
++; /* Skip the dot... */
532 result
= decoded_name
;
537 /* Return a string starting with '<', followed by STR, and '>'.
538 The result is good until the next call. */
541 add_angle_brackets (const char *str
)
543 static char *result
= NULL
;
546 result
= xstrprintf ("<%s>", str
);
551 ada_get_gdb_completer_word_break_characters (void)
553 return ada_completer_word_break_characters
;
556 /* Print an array element index using the Ada syntax. */
559 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
560 const struct value_print_options
*options
)
562 LA_VALUE_PRINT (index_value
, stream
, options
);
563 fprintf_filtered (stream
, " => ");
566 /* Assuming VECT points to an array of *SIZE objects of size
567 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
568 updating *SIZE as necessary and returning the (new) array. */
571 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
573 if (*size
< min_size
)
576 if (*size
< min_size
)
578 vect
= xrealloc (vect
, *size
* element_size
);
583 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
584 suffix of FIELD_NAME beginning "___". */
587 field_name_match (const char *field_name
, const char *target
)
589 int len
= strlen (target
);
592 (strncmp (field_name
, target
, len
) == 0
593 && (field_name
[len
] == '\0'
594 || (strncmp (field_name
+ len
, "___", 3) == 0
595 && strcmp (field_name
+ strlen (field_name
) - 6,
600 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
601 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
602 and return its index. This function also handles fields whose name
603 have ___ suffixes because the compiler sometimes alters their name
604 by adding such a suffix to represent fields with certain constraints.
605 If the field could not be found, return a negative number if
606 MAYBE_MISSING is set. Otherwise raise an error. */
609 ada_get_field_index (const struct type
*type
, const char *field_name
,
613 struct type
*struct_type
= check_typedef ((struct type
*) type
);
615 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
616 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
620 error (_("Unable to find field %s in struct %s. Aborting"),
621 field_name
, TYPE_NAME (struct_type
));
626 /* The length of the prefix of NAME prior to any "___" suffix. */
629 ada_name_prefix_len (const char *name
)
635 const char *p
= strstr (name
, "___");
638 return strlen (name
);
644 /* Return non-zero if SUFFIX is a suffix of STR.
645 Return zero if STR is null. */
648 is_suffix (const char *str
, const char *suffix
)
655 len2
= strlen (suffix
);
656 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
659 /* The contents of value VAL, treated as a value of type TYPE. The
660 result is an lval in memory if VAL is. */
662 static struct value
*
663 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
665 type
= ada_check_typedef (type
);
666 if (value_type (val
) == type
)
670 struct value
*result
;
672 /* Make sure that the object size is not unreasonable before
673 trying to allocate some memory for it. */
677 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
678 result
= allocate_value_lazy (type
);
681 result
= allocate_value (type
);
682 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
684 set_value_component_location (result
, val
);
685 set_value_bitsize (result
, value_bitsize (val
));
686 set_value_bitpos (result
, value_bitpos (val
));
687 set_value_address (result
, value_address (val
));
692 static const gdb_byte
*
693 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
698 return valaddr
+ offset
;
702 cond_offset_target (CORE_ADDR address
, long offset
)
707 return address
+ offset
;
710 /* Issue a warning (as for the definition of warning in utils.c, but
711 with exactly one argument rather than ...), unless the limit on the
712 number of warnings has passed during the evaluation of the current
715 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
716 provided by "complaint". */
717 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
720 lim_warning (const char *format
, ...)
724 va_start (args
, format
);
725 warnings_issued
+= 1;
726 if (warnings_issued
<= warning_limit
)
727 vwarning (format
, args
);
732 /* Issue an error if the size of an object of type T is unreasonable,
733 i.e. if it would be a bad idea to allocate a value of this type in
737 check_size (const struct type
*type
)
739 if (TYPE_LENGTH (type
) > varsize_limit
)
740 error (_("object size is larger than varsize-limit"));
743 /* Maximum value of a SIZE-byte signed integer type. */
745 max_of_size (int size
)
747 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
749 return top_bit
| (top_bit
- 1);
752 /* Minimum value of a SIZE-byte signed integer type. */
754 min_of_size (int size
)
756 return -max_of_size (size
) - 1;
759 /* Maximum value of a SIZE-byte unsigned integer type. */
761 umax_of_size (int size
)
763 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
765 return top_bit
| (top_bit
- 1);
768 /* Maximum value of integral type T, as a signed quantity. */
770 max_of_type (struct type
*t
)
772 if (TYPE_UNSIGNED (t
))
773 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
775 return max_of_size (TYPE_LENGTH (t
));
778 /* Minimum value of integral type T, as a signed quantity. */
780 min_of_type (struct type
*t
)
782 if (TYPE_UNSIGNED (t
))
785 return min_of_size (TYPE_LENGTH (t
));
788 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
790 ada_discrete_type_high_bound (struct type
*type
)
792 type
= resolve_dynamic_type (type
, 0);
793 switch (TYPE_CODE (type
))
795 case TYPE_CODE_RANGE
:
796 return TYPE_HIGH_BOUND (type
);
798 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
803 return max_of_type (type
);
805 error (_("Unexpected type in ada_discrete_type_high_bound."));
809 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
811 ada_discrete_type_low_bound (struct type
*type
)
813 type
= resolve_dynamic_type (type
, 0);
814 switch (TYPE_CODE (type
))
816 case TYPE_CODE_RANGE
:
817 return TYPE_LOW_BOUND (type
);
819 return TYPE_FIELD_ENUMVAL (type
, 0);
824 return min_of_type (type
);
826 error (_("Unexpected type in ada_discrete_type_low_bound."));
830 /* The identity on non-range types. For range types, the underlying
831 non-range scalar type. */
834 get_base_type (struct type
*type
)
836 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
838 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
840 type
= TYPE_TARGET_TYPE (type
);
845 /* Return a decoded version of the given VALUE. This means returning
846 a value whose type is obtained by applying all the GNAT-specific
847 encondings, making the resulting type a static but standard description
848 of the initial type. */
851 ada_get_decoded_value (struct value
*value
)
853 struct type
*type
= ada_check_typedef (value_type (value
));
855 if (ada_is_array_descriptor_type (type
)
856 || (ada_is_constrained_packed_array_type (type
)
857 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
859 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
860 value
= ada_coerce_to_simple_array_ptr (value
);
862 value
= ada_coerce_to_simple_array (value
);
865 value
= ada_to_fixed_value (value
);
870 /* Same as ada_get_decoded_value, but with the given TYPE.
871 Because there is no associated actual value for this type,
872 the resulting type might be a best-effort approximation in
873 the case of dynamic types. */
876 ada_get_decoded_type (struct type
*type
)
878 type
= to_static_fixed_type (type
);
879 if (ada_is_constrained_packed_array_type (type
))
880 type
= ada_coerce_to_simple_array_type (type
);
886 /* Language Selection */
888 /* If the main program is in Ada, return language_ada, otherwise return LANG
889 (the main program is in Ada iif the adainit symbol is found). */
892 ada_update_initial_language (enum language lang
)
894 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
895 (struct objfile
*) NULL
).minsym
!= NULL
)
901 /* If the main procedure is written in Ada, then return its name.
902 The result is good until the next call. Return NULL if the main
903 procedure doesn't appear to be in Ada. */
908 struct bound_minimal_symbol msym
;
909 static char *main_program_name
= NULL
;
911 /* For Ada, the name of the main procedure is stored in a specific
912 string constant, generated by the binder. Look for that symbol,
913 extract its address, and then read that string. If we didn't find
914 that string, then most probably the main procedure is not written
916 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
918 if (msym
.minsym
!= NULL
)
920 CORE_ADDR main_program_name_addr
;
923 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
924 if (main_program_name_addr
== 0)
925 error (_("Invalid address for Ada main program name."));
927 xfree (main_program_name
);
928 target_read_string (main_program_name_addr
, &main_program_name
,
933 return main_program_name
;
936 /* The main procedure doesn't seem to be in Ada. */
942 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
945 const struct ada_opname_map ada_opname_table
[] = {
946 {"Oadd", "\"+\"", BINOP_ADD
},
947 {"Osubtract", "\"-\"", BINOP_SUB
},
948 {"Omultiply", "\"*\"", BINOP_MUL
},
949 {"Odivide", "\"/\"", BINOP_DIV
},
950 {"Omod", "\"mod\"", BINOP_MOD
},
951 {"Orem", "\"rem\"", BINOP_REM
},
952 {"Oexpon", "\"**\"", BINOP_EXP
},
953 {"Olt", "\"<\"", BINOP_LESS
},
954 {"Ole", "\"<=\"", BINOP_LEQ
},
955 {"Ogt", "\">\"", BINOP_GTR
},
956 {"Oge", "\">=\"", BINOP_GEQ
},
957 {"Oeq", "\"=\"", BINOP_EQUAL
},
958 {"One", "\"/=\"", BINOP_NOTEQUAL
},
959 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
960 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
961 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
962 {"Oconcat", "\"&\"", BINOP_CONCAT
},
963 {"Oabs", "\"abs\"", UNOP_ABS
},
964 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
965 {"Oadd", "\"+\"", UNOP_PLUS
},
966 {"Osubtract", "\"-\"", UNOP_NEG
},
970 /* The "encoded" form of DECODED, according to GNAT conventions.
971 The result is valid until the next call to ada_encode. */
974 ada_encode (const char *decoded
)
976 static char *encoding_buffer
= NULL
;
977 static size_t encoding_buffer_size
= 0;
984 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
985 2 * strlen (decoded
) + 10);
988 for (p
= decoded
; *p
!= '\0'; p
+= 1)
992 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
997 const struct ada_opname_map
*mapping
;
999 for (mapping
= ada_opname_table
;
1000 mapping
->encoded
!= NULL
1001 && strncmp (mapping
->decoded
, p
,
1002 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
1004 if (mapping
->encoded
== NULL
)
1005 error (_("invalid Ada operator name: %s"), p
);
1006 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
1007 k
+= strlen (mapping
->encoded
);
1012 encoding_buffer
[k
] = *p
;
1017 encoding_buffer
[k
] = '\0';
1018 return encoding_buffer
;
1021 /* Return NAME folded to lower case, or, if surrounded by single
1022 quotes, unfolded, but with the quotes stripped away. Result good
1026 ada_fold_name (const char *name
)
1028 static char *fold_buffer
= NULL
;
1029 static size_t fold_buffer_size
= 0;
1031 int len
= strlen (name
);
1032 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1034 if (name
[0] == '\'')
1036 strncpy (fold_buffer
, name
+ 1, len
- 2);
1037 fold_buffer
[len
- 2] = '\000';
1043 for (i
= 0; i
<= len
; i
+= 1)
1044 fold_buffer
[i
] = tolower (name
[i
]);
1050 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1053 is_lower_alphanum (const char c
)
1055 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1058 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1059 This function saves in LEN the length of that same symbol name but
1060 without either of these suffixes:
1066 These are suffixes introduced by the compiler for entities such as
1067 nested subprogram for instance, in order to avoid name clashes.
1068 They do not serve any purpose for the debugger. */
1071 ada_remove_trailing_digits (const char *encoded
, int *len
)
1073 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1077 while (i
> 0 && isdigit (encoded
[i
]))
1079 if (i
>= 0 && encoded
[i
] == '.')
1081 else if (i
>= 0 && encoded
[i
] == '$')
1083 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
1085 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
1090 /* Remove the suffix introduced by the compiler for protected object
1094 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1096 /* Remove trailing N. */
1098 /* Protected entry subprograms are broken into two
1099 separate subprograms: The first one is unprotected, and has
1100 a 'N' suffix; the second is the protected version, and has
1101 the 'P' suffix. The second calls the first one after handling
1102 the protection. Since the P subprograms are internally generated,
1103 we leave these names undecoded, giving the user a clue that this
1104 entity is internal. */
1107 && encoded
[*len
- 1] == 'N'
1108 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1112 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1115 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
1119 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
1122 if (encoded
[i
] != 'X')
1128 if (isalnum (encoded
[i
-1]))
1132 /* If ENCODED follows the GNAT entity encoding conventions, then return
1133 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1134 replaced by ENCODED.
1136 The resulting string is valid until the next call of ada_decode.
1137 If the string is unchanged by decoding, the original string pointer
1141 ada_decode (const char *encoded
)
1148 static char *decoding_buffer
= NULL
;
1149 static size_t decoding_buffer_size
= 0;
1151 /* The name of the Ada main procedure starts with "_ada_".
1152 This prefix is not part of the decoded name, so skip this part
1153 if we see this prefix. */
1154 if (strncmp (encoded
, "_ada_", 5) == 0)
1157 /* If the name starts with '_', then it is not a properly encoded
1158 name, so do not attempt to decode it. Similarly, if the name
1159 starts with '<', the name should not be decoded. */
1160 if (encoded
[0] == '_' || encoded
[0] == '<')
1163 len0
= strlen (encoded
);
1165 ada_remove_trailing_digits (encoded
, &len0
);
1166 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1168 /* Remove the ___X.* suffix if present. Do not forget to verify that
1169 the suffix is located before the current "end" of ENCODED. We want
1170 to avoid re-matching parts of ENCODED that have previously been
1171 marked as discarded (by decrementing LEN0). */
1172 p
= strstr (encoded
, "___");
1173 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1181 /* Remove any trailing TKB suffix. It tells us that this symbol
1182 is for the body of a task, but that information does not actually
1183 appear in the decoded name. */
1185 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
1188 /* Remove any trailing TB suffix. The TB suffix is slightly different
1189 from the TKB suffix because it is used for non-anonymous task
1192 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
1195 /* Remove trailing "B" suffixes. */
1196 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1198 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
1201 /* Make decoded big enough for possible expansion by operator name. */
1203 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1204 decoded
= decoding_buffer
;
1206 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1208 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1211 while ((i
>= 0 && isdigit (encoded
[i
]))
1212 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1214 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1216 else if (encoded
[i
] == '$')
1220 /* The first few characters that are not alphabetic are not part
1221 of any encoding we use, so we can copy them over verbatim. */
1223 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1224 decoded
[j
] = encoded
[i
];
1229 /* Is this a symbol function? */
1230 if (at_start_name
&& encoded
[i
] == 'O')
1234 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1236 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1237 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1239 && !isalnum (encoded
[i
+ op_len
]))
1241 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1244 j
+= strlen (ada_opname_table
[k
].decoded
);
1248 if (ada_opname_table
[k
].encoded
!= NULL
)
1253 /* Replace "TK__" with "__", which will eventually be translated
1254 into "." (just below). */
1256 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1259 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1260 be translated into "." (just below). These are internal names
1261 generated for anonymous blocks inside which our symbol is nested. */
1263 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1264 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1265 && isdigit (encoded
[i
+4]))
1269 while (k
< len0
&& isdigit (encoded
[k
]))
1270 k
++; /* Skip any extra digit. */
1272 /* Double-check that the "__B_{DIGITS}+" sequence we found
1273 is indeed followed by "__". */
1274 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1278 /* Remove _E{DIGITS}+[sb] */
1280 /* Just as for protected object subprograms, there are 2 categories
1281 of subprograms created by the compiler for each entry. The first
1282 one implements the actual entry code, and has a suffix following
1283 the convention above; the second one implements the barrier and
1284 uses the same convention as above, except that the 'E' is replaced
1287 Just as above, we do not decode the name of barrier functions
1288 to give the user a clue that the code he is debugging has been
1289 internally generated. */
1291 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1292 && isdigit (encoded
[i
+2]))
1296 while (k
< len0
&& isdigit (encoded
[k
]))
1300 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1303 /* Just as an extra precaution, make sure that if this
1304 suffix is followed by anything else, it is a '_'.
1305 Otherwise, we matched this sequence by accident. */
1307 || (k
< len0
&& encoded
[k
] == '_'))
1312 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1313 the GNAT front-end in protected object subprograms. */
1316 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1318 /* Backtrack a bit up until we reach either the begining of
1319 the encoded name, or "__". Make sure that we only find
1320 digits or lowercase characters. */
1321 const char *ptr
= encoded
+ i
- 1;
1323 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1326 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1330 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1332 /* This is a X[bn]* sequence not separated from the previous
1333 part of the name with a non-alpha-numeric character (in other
1334 words, immediately following an alpha-numeric character), then
1335 verify that it is placed at the end of the encoded name. If
1336 not, then the encoding is not valid and we should abort the
1337 decoding. Otherwise, just skip it, it is used in body-nested
1341 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1345 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1347 /* Replace '__' by '.'. */
1355 /* It's a character part of the decoded name, so just copy it
1357 decoded
[j
] = encoded
[i
];
1362 decoded
[j
] = '\000';
1364 /* Decoded names should never contain any uppercase character.
1365 Double-check this, and abort the decoding if we find one. */
1367 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1368 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1371 if (strcmp (decoded
, encoded
) == 0)
1377 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1378 decoded
= decoding_buffer
;
1379 if (encoded
[0] == '<')
1380 strcpy (decoded
, encoded
);
1382 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1387 /* Table for keeping permanent unique copies of decoded names. Once
1388 allocated, names in this table are never released. While this is a
1389 storage leak, it should not be significant unless there are massive
1390 changes in the set of decoded names in successive versions of a
1391 symbol table loaded during a single session. */
1392 static struct htab
*decoded_names_store
;
1394 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1395 in the language-specific part of GSYMBOL, if it has not been
1396 previously computed. Tries to save the decoded name in the same
1397 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1398 in any case, the decoded symbol has a lifetime at least that of
1400 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1401 const, but nevertheless modified to a semantically equivalent form
1402 when a decoded name is cached in it. */
1405 ada_decode_symbol (const struct general_symbol_info
*arg
)
1407 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1408 const char **resultp
=
1409 &gsymbol
->language_specific
.mangled_lang
.demangled_name
;
1411 if (!gsymbol
->ada_mangled
)
1413 const char *decoded
= ada_decode (gsymbol
->name
);
1414 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1416 gsymbol
->ada_mangled
= 1;
1418 if (obstack
!= NULL
)
1419 *resultp
= obstack_copy0 (obstack
, decoded
, strlen (decoded
));
1422 /* Sometimes, we can't find a corresponding objfile, in
1423 which case, we put the result on the heap. Since we only
1424 decode when needed, we hope this usually does not cause a
1425 significant memory leak (FIXME). */
1427 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1431 *slot
= xstrdup (decoded
);
1440 ada_la_decode (const char *encoded
, int options
)
1442 return xstrdup (ada_decode (encoded
));
1445 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1446 suffixes that encode debugging information or leading _ada_ on
1447 SYM_NAME (see is_name_suffix commentary for the debugging
1448 information that is ignored). If WILD, then NAME need only match a
1449 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1450 either argument is NULL. */
1453 match_name (const char *sym_name
, const char *name
, int wild
)
1455 if (sym_name
== NULL
|| name
== NULL
)
1458 return wild_match (sym_name
, name
) == 0;
1461 int len_name
= strlen (name
);
1463 return (strncmp (sym_name
, name
, len_name
) == 0
1464 && is_name_suffix (sym_name
+ len_name
))
1465 || (strncmp (sym_name
, "_ada_", 5) == 0
1466 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1467 && is_name_suffix (sym_name
+ len_name
+ 5));
1474 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1475 generated by the GNAT compiler to describe the index type used
1476 for each dimension of an array, check whether it follows the latest
1477 known encoding. If not, fix it up to conform to the latest encoding.
1478 Otherwise, do nothing. This function also does nothing if
1479 INDEX_DESC_TYPE is NULL.
1481 The GNAT encoding used to describle the array index type evolved a bit.
1482 Initially, the information would be provided through the name of each
1483 field of the structure type only, while the type of these fields was
1484 described as unspecified and irrelevant. The debugger was then expected
1485 to perform a global type lookup using the name of that field in order
1486 to get access to the full index type description. Because these global
1487 lookups can be very expensive, the encoding was later enhanced to make
1488 the global lookup unnecessary by defining the field type as being
1489 the full index type description.
1491 The purpose of this routine is to allow us to support older versions
1492 of the compiler by detecting the use of the older encoding, and by
1493 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1494 we essentially replace each field's meaningless type by the associated
1498 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1502 if (index_desc_type
== NULL
)
1504 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1506 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1507 to check one field only, no need to check them all). If not, return
1510 If our INDEX_DESC_TYPE was generated using the older encoding,
1511 the field type should be a meaningless integer type whose name
1512 is not equal to the field name. */
1513 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1514 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1515 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1518 /* Fixup each field of INDEX_DESC_TYPE. */
1519 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1521 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1522 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1525 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1529 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1531 static char *bound_name
[] = {
1532 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1533 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1536 /* Maximum number of array dimensions we are prepared to handle. */
1538 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1541 /* The desc_* routines return primitive portions of array descriptors
1544 /* The descriptor or array type, if any, indicated by TYPE; removes
1545 level of indirection, if needed. */
1547 static struct type
*
1548 desc_base_type (struct type
*type
)
1552 type
= ada_check_typedef (type
);
1553 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1554 type
= ada_typedef_target_type (type
);
1557 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1558 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1559 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1564 /* True iff TYPE indicates a "thin" array pointer type. */
1567 is_thin_pntr (struct type
*type
)
1570 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1571 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1574 /* The descriptor type for thin pointer type TYPE. */
1576 static struct type
*
1577 thin_descriptor_type (struct type
*type
)
1579 struct type
*base_type
= desc_base_type (type
);
1581 if (base_type
== NULL
)
1583 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1587 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1589 if (alt_type
== NULL
)
1596 /* A pointer to the array data for thin-pointer value VAL. */
1598 static struct value
*
1599 thin_data_pntr (struct value
*val
)
1601 struct type
*type
= ada_check_typedef (value_type (val
));
1602 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1604 data_type
= lookup_pointer_type (data_type
);
1606 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1607 return value_cast (data_type
, value_copy (val
));
1609 return value_from_longest (data_type
, value_address (val
));
1612 /* True iff TYPE indicates a "thick" array pointer type. */
1615 is_thick_pntr (struct type
*type
)
1617 type
= desc_base_type (type
);
1618 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1619 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1622 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1623 pointer to one, the type of its bounds data; otherwise, NULL. */
1625 static struct type
*
1626 desc_bounds_type (struct type
*type
)
1630 type
= desc_base_type (type
);
1634 else if (is_thin_pntr (type
))
1636 type
= thin_descriptor_type (type
);
1639 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1641 return ada_check_typedef (r
);
1643 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1645 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1647 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1652 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1653 one, a pointer to its bounds data. Otherwise NULL. */
1655 static struct value
*
1656 desc_bounds (struct value
*arr
)
1658 struct type
*type
= ada_check_typedef (value_type (arr
));
1660 if (is_thin_pntr (type
))
1662 struct type
*bounds_type
=
1663 desc_bounds_type (thin_descriptor_type (type
));
1666 if (bounds_type
== NULL
)
1667 error (_("Bad GNAT array descriptor"));
1669 /* NOTE: The following calculation is not really kosher, but
1670 since desc_type is an XVE-encoded type (and shouldn't be),
1671 the correct calculation is a real pain. FIXME (and fix GCC). */
1672 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1673 addr
= value_as_long (arr
);
1675 addr
= value_address (arr
);
1678 value_from_longest (lookup_pointer_type (bounds_type
),
1679 addr
- TYPE_LENGTH (bounds_type
));
1682 else if (is_thick_pntr (type
))
1684 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1685 _("Bad GNAT array descriptor"));
1686 struct type
*p_bounds_type
= value_type (p_bounds
);
1689 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1691 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1693 if (TYPE_STUB (target_type
))
1694 p_bounds
= value_cast (lookup_pointer_type
1695 (ada_check_typedef (target_type
)),
1699 error (_("Bad GNAT array descriptor"));
1707 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1708 position of the field containing the address of the bounds data. */
1711 fat_pntr_bounds_bitpos (struct type
*type
)
1713 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1716 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1717 size of the field containing the address of the bounds data. */
1720 fat_pntr_bounds_bitsize (struct type
*type
)
1722 type
= desc_base_type (type
);
1724 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1725 return TYPE_FIELD_BITSIZE (type
, 1);
1727 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1730 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1731 pointer to one, the type of its array data (a array-with-no-bounds type);
1732 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1735 static struct type
*
1736 desc_data_target_type (struct type
*type
)
1738 type
= desc_base_type (type
);
1740 /* NOTE: The following is bogus; see comment in desc_bounds. */
1741 if (is_thin_pntr (type
))
1742 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1743 else if (is_thick_pntr (type
))
1745 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1748 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1749 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1755 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1758 static struct value
*
1759 desc_data (struct value
*arr
)
1761 struct type
*type
= value_type (arr
);
1763 if (is_thin_pntr (type
))
1764 return thin_data_pntr (arr
);
1765 else if (is_thick_pntr (type
))
1766 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1767 _("Bad GNAT array descriptor"));
1773 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1774 position of the field containing the address of the data. */
1777 fat_pntr_data_bitpos (struct type
*type
)
1779 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1782 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1783 size of the field containing the address of the data. */
1786 fat_pntr_data_bitsize (struct type
*type
)
1788 type
= desc_base_type (type
);
1790 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1791 return TYPE_FIELD_BITSIZE (type
, 0);
1793 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1796 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1797 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1798 bound, if WHICH is 1. The first bound is I=1. */
1800 static struct value
*
1801 desc_one_bound (struct value
*bounds
, int i
, int which
)
1803 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1804 _("Bad GNAT array descriptor bounds"));
1807 /* If BOUNDS is an array-bounds structure type, return the bit position
1808 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1809 bound, if WHICH is 1. The first bound is I=1. */
1812 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1814 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1817 /* If BOUNDS is an array-bounds structure type, return the bit field size
1818 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1819 bound, if WHICH is 1. The first bound is I=1. */
1822 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1824 type
= desc_base_type (type
);
1826 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1827 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1829 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1832 /* If TYPE is the type of an array-bounds structure, the type of its
1833 Ith bound (numbering from 1). Otherwise, NULL. */
1835 static struct type
*
1836 desc_index_type (struct type
*type
, int i
)
1838 type
= desc_base_type (type
);
1840 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1841 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1846 /* The number of index positions in the array-bounds type TYPE.
1847 Return 0 if TYPE is NULL. */
1850 desc_arity (struct type
*type
)
1852 type
= desc_base_type (type
);
1855 return TYPE_NFIELDS (type
) / 2;
1859 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1860 an array descriptor type (representing an unconstrained array
1864 ada_is_direct_array_type (struct type
*type
)
1868 type
= ada_check_typedef (type
);
1869 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1870 || ada_is_array_descriptor_type (type
));
1873 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1877 ada_is_array_type (struct type
*type
)
1880 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1881 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1882 type
= TYPE_TARGET_TYPE (type
);
1883 return ada_is_direct_array_type (type
);
1886 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1889 ada_is_simple_array_type (struct type
*type
)
1893 type
= ada_check_typedef (type
);
1894 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1895 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1896 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1897 == TYPE_CODE_ARRAY
));
1900 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1903 ada_is_array_descriptor_type (struct type
*type
)
1905 struct type
*data_type
= desc_data_target_type (type
);
1909 type
= ada_check_typedef (type
);
1910 return (data_type
!= NULL
1911 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1912 && desc_arity (desc_bounds_type (type
)) > 0);
1915 /* Non-zero iff type is a partially mal-formed GNAT array
1916 descriptor. FIXME: This is to compensate for some problems with
1917 debugging output from GNAT. Re-examine periodically to see if it
1921 ada_is_bogus_array_descriptor (struct type
*type
)
1925 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1926 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1927 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1928 && !ada_is_array_descriptor_type (type
);
1932 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1933 (fat pointer) returns the type of the array data described---specifically,
1934 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1935 in from the descriptor; otherwise, they are left unspecified. If
1936 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1937 returns NULL. The result is simply the type of ARR if ARR is not
1940 ada_type_of_array (struct value
*arr
, int bounds
)
1942 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1943 return decode_constrained_packed_array_type (value_type (arr
));
1945 if (!ada_is_array_descriptor_type (value_type (arr
)))
1946 return value_type (arr
);
1950 struct type
*array_type
=
1951 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1953 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1954 TYPE_FIELD_BITSIZE (array_type
, 0) =
1955 decode_packed_array_bitsize (value_type (arr
));
1961 struct type
*elt_type
;
1963 struct value
*descriptor
;
1965 elt_type
= ada_array_element_type (value_type (arr
), -1);
1966 arity
= ada_array_arity (value_type (arr
));
1968 if (elt_type
== NULL
|| arity
== 0)
1969 return ada_check_typedef (value_type (arr
));
1971 descriptor
= desc_bounds (arr
);
1972 if (value_as_long (descriptor
) == 0)
1976 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1977 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1978 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1979 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1982 create_static_range_type (range_type
, value_type (low
),
1983 longest_to_int (value_as_long (low
)),
1984 longest_to_int (value_as_long (high
)));
1985 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1987 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1989 /* We need to store the element packed bitsize, as well as
1990 recompute the array size, because it was previously
1991 computed based on the unpacked element size. */
1992 LONGEST lo
= value_as_long (low
);
1993 LONGEST hi
= value_as_long (high
);
1995 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1996 decode_packed_array_bitsize (value_type (arr
));
1997 /* If the array has no element, then the size is already
1998 zero, and does not need to be recomputed. */
2002 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
2004 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
2009 return lookup_pointer_type (elt_type
);
2013 /* If ARR does not represent an array, returns ARR unchanged.
2014 Otherwise, returns either a standard GDB array with bounds set
2015 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2016 GDB array. Returns NULL if ARR is a null fat pointer. */
2019 ada_coerce_to_simple_array_ptr (struct value
*arr
)
2021 if (ada_is_array_descriptor_type (value_type (arr
)))
2023 struct type
*arrType
= ada_type_of_array (arr
, 1);
2025 if (arrType
== NULL
)
2027 return value_cast (arrType
, value_copy (desc_data (arr
)));
2029 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2030 return decode_constrained_packed_array (arr
);
2035 /* If ARR does not represent an array, returns ARR unchanged.
2036 Otherwise, returns a standard GDB array describing ARR (which may
2037 be ARR itself if it already is in the proper form). */
2040 ada_coerce_to_simple_array (struct value
*arr
)
2042 if (ada_is_array_descriptor_type (value_type (arr
)))
2044 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2047 error (_("Bounds unavailable for null array pointer."));
2048 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
2049 return value_ind (arrVal
);
2051 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2052 return decode_constrained_packed_array (arr
);
2057 /* If TYPE represents a GNAT array type, return it translated to an
2058 ordinary GDB array type (possibly with BITSIZE fields indicating
2059 packing). For other types, is the identity. */
2062 ada_coerce_to_simple_array_type (struct type
*type
)
2064 if (ada_is_constrained_packed_array_type (type
))
2065 return decode_constrained_packed_array_type (type
);
2067 if (ada_is_array_descriptor_type (type
))
2068 return ada_check_typedef (desc_data_target_type (type
));
2073 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2076 ada_is_packed_array_type (struct type
*type
)
2080 type
= desc_base_type (type
);
2081 type
= ada_check_typedef (type
);
2083 ada_type_name (type
) != NULL
2084 && strstr (ada_type_name (type
), "___XP") != NULL
;
2087 /* Non-zero iff TYPE represents a standard GNAT constrained
2088 packed-array type. */
2091 ada_is_constrained_packed_array_type (struct type
*type
)
2093 return ada_is_packed_array_type (type
)
2094 && !ada_is_array_descriptor_type (type
);
2097 /* Non-zero iff TYPE represents an array descriptor for a
2098 unconstrained packed-array type. */
2101 ada_is_unconstrained_packed_array_type (struct type
*type
)
2103 return ada_is_packed_array_type (type
)
2104 && ada_is_array_descriptor_type (type
);
2107 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2108 return the size of its elements in bits. */
2111 decode_packed_array_bitsize (struct type
*type
)
2113 const char *raw_name
;
2117 /* Access to arrays implemented as fat pointers are encoded as a typedef
2118 of the fat pointer type. We need the name of the fat pointer type
2119 to do the decoding, so strip the typedef layer. */
2120 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2121 type
= ada_typedef_target_type (type
);
2123 raw_name
= ada_type_name (ada_check_typedef (type
));
2125 raw_name
= ada_type_name (desc_base_type (type
));
2130 tail
= strstr (raw_name
, "___XP");
2131 gdb_assert (tail
!= NULL
);
2133 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2136 (_("could not understand bit size information on packed array"));
2143 /* Given that TYPE is a standard GDB array type with all bounds filled
2144 in, and that the element size of its ultimate scalar constituents
2145 (that is, either its elements, or, if it is an array of arrays, its
2146 elements' elements, etc.) is *ELT_BITS, return an identical type,
2147 but with the bit sizes of its elements (and those of any
2148 constituent arrays) recorded in the BITSIZE components of its
2149 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2152 static struct type
*
2153 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2155 struct type
*new_elt_type
;
2156 struct type
*new_type
;
2157 struct type
*index_type_desc
;
2158 struct type
*index_type
;
2159 LONGEST low_bound
, high_bound
;
2161 type
= ada_check_typedef (type
);
2162 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2165 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2166 if (index_type_desc
)
2167 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2170 index_type
= TYPE_INDEX_TYPE (type
);
2172 new_type
= alloc_type_copy (type
);
2174 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2176 create_array_type (new_type
, new_elt_type
, index_type
);
2177 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2178 TYPE_NAME (new_type
) = ada_type_name (type
);
2180 if (get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2181 low_bound
= high_bound
= 0;
2182 if (high_bound
< low_bound
)
2183 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2186 *elt_bits
*= (high_bound
- low_bound
+ 1);
2187 TYPE_LENGTH (new_type
) =
2188 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2191 TYPE_FIXED_INSTANCE (new_type
) = 1;
2195 /* The array type encoded by TYPE, where
2196 ada_is_constrained_packed_array_type (TYPE). */
2198 static struct type
*
2199 decode_constrained_packed_array_type (struct type
*type
)
2201 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2204 struct type
*shadow_type
;
2208 raw_name
= ada_type_name (desc_base_type (type
));
2213 name
= (char *) alloca (strlen (raw_name
) + 1);
2214 tail
= strstr (raw_name
, "___XP");
2215 type
= desc_base_type (type
);
2217 memcpy (name
, raw_name
, tail
- raw_name
);
2218 name
[tail
- raw_name
] = '\000';
2220 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2222 if (shadow_type
== NULL
)
2224 lim_warning (_("could not find bounds information on packed array"));
2227 CHECK_TYPEDEF (shadow_type
);
2229 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2231 lim_warning (_("could not understand bounds "
2232 "information on packed array"));
2236 bits
= decode_packed_array_bitsize (type
);
2237 return constrained_packed_array_type (shadow_type
, &bits
);
2240 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2241 array, returns a simple array that denotes that array. Its type is a
2242 standard GDB array type except that the BITSIZEs of the array
2243 target types are set to the number of bits in each element, and the
2244 type length is set appropriately. */
2246 static struct value
*
2247 decode_constrained_packed_array (struct value
*arr
)
2251 /* If our value is a pointer, then dereference it. Likewise if
2252 the value is a reference. Make sure that this operation does not
2253 cause the target type to be fixed, as this would indirectly cause
2254 this array to be decoded. The rest of the routine assumes that
2255 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2256 and "value_ind" routines to perform the dereferencing, as opposed
2257 to using "ada_coerce_ref" or "ada_value_ind". */
2258 arr
= coerce_ref (arr
);
2259 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2260 arr
= value_ind (arr
);
2262 type
= decode_constrained_packed_array_type (value_type (arr
));
2265 error (_("can't unpack array"));
2269 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2270 && ada_is_modular_type (value_type (arr
)))
2272 /* This is a (right-justified) modular type representing a packed
2273 array with no wrapper. In order to interpret the value through
2274 the (left-justified) packed array type we just built, we must
2275 first left-justify it. */
2276 int bit_size
, bit_pos
;
2279 mod
= ada_modulus (value_type (arr
)) - 1;
2286 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2287 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2288 bit_pos
/ HOST_CHAR_BIT
,
2289 bit_pos
% HOST_CHAR_BIT
,
2294 return coerce_unspec_val_to_type (arr
, type
);
2298 /* The value of the element of packed array ARR at the ARITY indices
2299 given in IND. ARR must be a simple array. */
2301 static struct value
*
2302 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2305 int bits
, elt_off
, bit_off
;
2306 long elt_total_bit_offset
;
2307 struct type
*elt_type
;
2311 elt_total_bit_offset
= 0;
2312 elt_type
= ada_check_typedef (value_type (arr
));
2313 for (i
= 0; i
< arity
; i
+= 1)
2315 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2316 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2318 (_("attempt to do packed indexing of "
2319 "something other than a packed array"));
2322 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2323 LONGEST lowerbound
, upperbound
;
2326 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2328 lim_warning (_("don't know bounds of array"));
2329 lowerbound
= upperbound
= 0;
2332 idx
= pos_atr (ind
[i
]);
2333 if (idx
< lowerbound
|| idx
> upperbound
)
2334 lim_warning (_("packed array index %ld out of bounds"),
2336 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2337 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2338 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2341 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2342 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2344 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2349 /* Non-zero iff TYPE includes negative integer values. */
2352 has_negatives (struct type
*type
)
2354 switch (TYPE_CODE (type
))
2359 return !TYPE_UNSIGNED (type
);
2360 case TYPE_CODE_RANGE
:
2361 return TYPE_LOW_BOUND (type
) < 0;
2366 /* Create a new value of type TYPE from the contents of OBJ starting
2367 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2368 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2369 assigning through the result will set the field fetched from.
2370 VALADDR is ignored unless OBJ is NULL, in which case,
2371 VALADDR+OFFSET must address the start of storage containing the
2372 packed value. The value returned in this case is never an lval.
2373 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2376 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2377 long offset
, int bit_offset
, int bit_size
,
2381 int src
, /* Index into the source area */
2382 targ
, /* Index into the target area */
2383 srcBitsLeft
, /* Number of source bits left to move */
2384 nsrc
, ntarg
, /* Number of source and target bytes */
2385 unusedLS
, /* Number of bits in next significant
2386 byte of source that are unused */
2387 accumSize
; /* Number of meaningful bits in accum */
2388 unsigned char *bytes
; /* First byte containing data to unpack */
2389 unsigned char *unpacked
;
2390 unsigned long accum
; /* Staging area for bits being transferred */
2392 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2393 /* Transmit bytes from least to most significant; delta is the direction
2394 the indices move. */
2395 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2397 type
= ada_check_typedef (type
);
2401 v
= allocate_value (type
);
2402 bytes
= (unsigned char *) (valaddr
+ offset
);
2404 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2406 v
= value_at (type
, value_address (obj
));
2407 type
= value_type (v
);
2408 bytes
= (unsigned char *) alloca (len
);
2409 read_memory (value_address (v
) + offset
, bytes
, len
);
2413 v
= allocate_value (type
);
2414 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2419 long new_offset
= offset
;
2421 set_value_component_location (v
, obj
);
2422 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2423 set_value_bitsize (v
, bit_size
);
2424 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2427 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2429 set_value_offset (v
, new_offset
);
2431 /* Also set the parent value. This is needed when trying to
2432 assign a new value (in inferior memory). */
2433 set_value_parent (v
, obj
);
2436 set_value_bitsize (v
, bit_size
);
2437 unpacked
= (unsigned char *) value_contents (v
);
2439 srcBitsLeft
= bit_size
;
2441 ntarg
= TYPE_LENGTH (type
);
2445 memset (unpacked
, 0, TYPE_LENGTH (type
));
2448 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2451 if (has_negatives (type
)
2452 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2456 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2459 switch (TYPE_CODE (type
))
2461 case TYPE_CODE_ARRAY
:
2462 case TYPE_CODE_UNION
:
2463 case TYPE_CODE_STRUCT
:
2464 /* Non-scalar values must be aligned at a byte boundary... */
2466 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2467 /* ... And are placed at the beginning (most-significant) bytes
2469 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2474 targ
= TYPE_LENGTH (type
) - 1;
2480 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2483 unusedLS
= bit_offset
;
2486 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2493 /* Mask for removing bits of the next source byte that are not
2494 part of the value. */
2495 unsigned int unusedMSMask
=
2496 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2498 /* Sign-extend bits for this byte. */
2499 unsigned int signMask
= sign
& ~unusedMSMask
;
2502 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2503 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2504 if (accumSize
>= HOST_CHAR_BIT
)
2506 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2507 accumSize
-= HOST_CHAR_BIT
;
2508 accum
>>= HOST_CHAR_BIT
;
2512 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2519 accum
|= sign
<< accumSize
;
2520 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2521 accumSize
-= HOST_CHAR_BIT
;
2522 accum
>>= HOST_CHAR_BIT
;
2530 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2531 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2534 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2535 int src_offset
, int n
, int bits_big_endian_p
)
2537 unsigned int accum
, mask
;
2538 int accum_bits
, chunk_size
;
2540 target
+= targ_offset
/ HOST_CHAR_BIT
;
2541 targ_offset
%= HOST_CHAR_BIT
;
2542 source
+= src_offset
/ HOST_CHAR_BIT
;
2543 src_offset
%= HOST_CHAR_BIT
;
2544 if (bits_big_endian_p
)
2546 accum
= (unsigned char) *source
;
2548 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2554 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2555 accum_bits
+= HOST_CHAR_BIT
;
2557 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2560 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2561 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2564 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2566 accum_bits
-= chunk_size
;
2573 accum
= (unsigned char) *source
>> src_offset
;
2575 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2579 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2580 accum_bits
+= HOST_CHAR_BIT
;
2582 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2585 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2586 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2588 accum_bits
-= chunk_size
;
2589 accum
>>= chunk_size
;
2596 /* Store the contents of FROMVAL into the location of TOVAL.
2597 Return a new value with the location of TOVAL and contents of
2598 FROMVAL. Handles assignment into packed fields that have
2599 floating-point or non-scalar types. */
2601 static struct value
*
2602 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2604 struct type
*type
= value_type (toval
);
2605 int bits
= value_bitsize (toval
);
2607 toval
= ada_coerce_ref (toval
);
2608 fromval
= ada_coerce_ref (fromval
);
2610 if (ada_is_direct_array_type (value_type (toval
)))
2611 toval
= ada_coerce_to_simple_array (toval
);
2612 if (ada_is_direct_array_type (value_type (fromval
)))
2613 fromval
= ada_coerce_to_simple_array (fromval
);
2615 if (!deprecated_value_modifiable (toval
))
2616 error (_("Left operand of assignment is not a modifiable lvalue."));
2618 if (VALUE_LVAL (toval
) == lval_memory
2620 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2621 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2623 int len
= (value_bitpos (toval
)
2624 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2626 gdb_byte
*buffer
= alloca (len
);
2628 CORE_ADDR to_addr
= value_address (toval
);
2630 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2631 fromval
= value_cast (type
, fromval
);
2633 read_memory (to_addr
, buffer
, len
);
2634 from_size
= value_bitsize (fromval
);
2636 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2637 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2638 move_bits (buffer
, value_bitpos (toval
),
2639 value_contents (fromval
), from_size
- bits
, bits
, 1);
2641 move_bits (buffer
, value_bitpos (toval
),
2642 value_contents (fromval
), 0, bits
, 0);
2643 write_memory_with_notification (to_addr
, buffer
, len
);
2645 val
= value_copy (toval
);
2646 memcpy (value_contents_raw (val
), value_contents (fromval
),
2647 TYPE_LENGTH (type
));
2648 deprecated_set_value_type (val
, type
);
2653 return value_assign (toval
, fromval
);
2657 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2658 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2659 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2660 * COMPONENT, and not the inferior's memory. The current contents
2661 * of COMPONENT are ignored. */
2663 value_assign_to_component (struct value
*container
, struct value
*component
,
2666 LONGEST offset_in_container
=
2667 (LONGEST
) (value_address (component
) - value_address (container
));
2668 int bit_offset_in_container
=
2669 value_bitpos (component
) - value_bitpos (container
);
2672 val
= value_cast (value_type (component
), val
);
2674 if (value_bitsize (component
) == 0)
2675 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2677 bits
= value_bitsize (component
);
2679 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2680 move_bits (value_contents_writeable (container
) + offset_in_container
,
2681 value_bitpos (container
) + bit_offset_in_container
,
2682 value_contents (val
),
2683 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2686 move_bits (value_contents_writeable (container
) + offset_in_container
,
2687 value_bitpos (container
) + bit_offset_in_container
,
2688 value_contents (val
), 0, bits
, 0);
2691 /* The value of the element of array ARR at the ARITY indices given in IND.
2692 ARR may be either a simple array, GNAT array descriptor, or pointer
2696 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2700 struct type
*elt_type
;
2702 elt
= ada_coerce_to_simple_array (arr
);
2704 elt_type
= ada_check_typedef (value_type (elt
));
2705 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2706 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2707 return value_subscript_packed (elt
, arity
, ind
);
2709 for (k
= 0; k
< arity
; k
+= 1)
2711 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2712 error (_("too many subscripts (%d expected)"), k
);
2713 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2718 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2719 value of the element of *ARR at the ARITY indices given in
2720 IND. Does not read the entire array into memory. */
2722 static struct value
*
2723 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2728 for (k
= 0; k
< arity
; k
+= 1)
2732 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2733 error (_("too many subscripts (%d expected)"), k
);
2734 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2736 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2737 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2738 type
= TYPE_TARGET_TYPE (type
);
2741 return value_ind (arr
);
2744 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2745 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2746 elements starting at index LOW. The lower bound of this array is LOW, as
2748 static struct value
*
2749 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2752 struct type
*type0
= ada_check_typedef (type
);
2753 CORE_ADDR base
= value_as_address (array_ptr
)
2754 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
)))
2755 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2756 struct type
*index_type
2757 = create_static_range_type (NULL
,
2758 TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
)),
2760 struct type
*slice_type
=
2761 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2763 return value_at_lazy (slice_type
, base
);
2767 static struct value
*
2768 ada_value_slice (struct value
*array
, int low
, int high
)
2770 struct type
*type
= ada_check_typedef (value_type (array
));
2771 struct type
*index_type
2772 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2773 struct type
*slice_type
=
2774 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2776 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2779 /* If type is a record type in the form of a standard GNAT array
2780 descriptor, returns the number of dimensions for type. If arr is a
2781 simple array, returns the number of "array of"s that prefix its
2782 type designation. Otherwise, returns 0. */
2785 ada_array_arity (struct type
*type
)
2792 type
= desc_base_type (type
);
2795 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2796 return desc_arity (desc_bounds_type (type
));
2798 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2801 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2807 /* If TYPE is a record type in the form of a standard GNAT array
2808 descriptor or a simple array type, returns the element type for
2809 TYPE after indexing by NINDICES indices, or by all indices if
2810 NINDICES is -1. Otherwise, returns NULL. */
2813 ada_array_element_type (struct type
*type
, int nindices
)
2815 type
= desc_base_type (type
);
2817 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2820 struct type
*p_array_type
;
2822 p_array_type
= desc_data_target_type (type
);
2824 k
= ada_array_arity (type
);
2828 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2829 if (nindices
>= 0 && k
> nindices
)
2831 while (k
> 0 && p_array_type
!= NULL
)
2833 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2836 return p_array_type
;
2838 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2840 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2842 type
= TYPE_TARGET_TYPE (type
);
2851 /* The type of nth index in arrays of given type (n numbering from 1).
2852 Does not examine memory. Throws an error if N is invalid or TYPE
2853 is not an array type. NAME is the name of the Ada attribute being
2854 evaluated ('range, 'first, 'last, or 'length); it is used in building
2855 the error message. */
2857 static struct type
*
2858 ada_index_type (struct type
*type
, int n
, const char *name
)
2860 struct type
*result_type
;
2862 type
= desc_base_type (type
);
2864 if (n
< 0 || n
> ada_array_arity (type
))
2865 error (_("invalid dimension number to '%s"), name
);
2867 if (ada_is_simple_array_type (type
))
2871 for (i
= 1; i
< n
; i
+= 1)
2872 type
= TYPE_TARGET_TYPE (type
);
2873 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2874 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2875 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2876 perhaps stabsread.c would make more sense. */
2877 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2882 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2883 if (result_type
== NULL
)
2884 error (_("attempt to take bound of something that is not an array"));
2890 /* Given that arr is an array type, returns the lower bound of the
2891 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2892 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2893 array-descriptor type. It works for other arrays with bounds supplied
2894 by run-time quantities other than discriminants. */
2897 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2899 struct type
*type
, *index_type_desc
, *index_type
;
2902 gdb_assert (which
== 0 || which
== 1);
2904 if (ada_is_constrained_packed_array_type (arr_type
))
2905 arr_type
= decode_constrained_packed_array_type (arr_type
);
2907 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2908 return (LONGEST
) - which
;
2910 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2911 type
= TYPE_TARGET_TYPE (arr_type
);
2915 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2916 ada_fixup_array_indexes_type (index_type_desc
);
2917 if (index_type_desc
!= NULL
)
2918 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2922 struct type
*elt_type
= check_typedef (type
);
2924 for (i
= 1; i
< n
; i
++)
2925 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
2927 index_type
= TYPE_INDEX_TYPE (elt_type
);
2931 (LONGEST
) (which
== 0
2932 ? ada_discrete_type_low_bound (index_type
)
2933 : ada_discrete_type_high_bound (index_type
));
2936 /* Given that arr is an array value, returns the lower bound of the
2937 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2938 WHICH is 1. This routine will also work for arrays with bounds
2939 supplied by run-time quantities other than discriminants. */
2942 ada_array_bound (struct value
*arr
, int n
, int which
)
2944 struct type
*arr_type
= value_type (arr
);
2946 if (ada_is_constrained_packed_array_type (arr_type
))
2947 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2948 else if (ada_is_simple_array_type (arr_type
))
2949 return ada_array_bound_from_type (arr_type
, n
, which
);
2951 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2954 /* Given that arr is an array value, returns the length of the
2955 nth index. This routine will also work for arrays with bounds
2956 supplied by run-time quantities other than discriminants.
2957 Does not work for arrays indexed by enumeration types with representation
2958 clauses at the moment. */
2961 ada_array_length (struct value
*arr
, int n
)
2963 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2965 if (ada_is_constrained_packed_array_type (arr_type
))
2966 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2968 if (ada_is_simple_array_type (arr_type
))
2969 return (ada_array_bound_from_type (arr_type
, n
, 1)
2970 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2972 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2973 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2976 /* An empty array whose type is that of ARR_TYPE (an array type),
2977 with bounds LOW to LOW-1. */
2979 static struct value
*
2980 empty_array (struct type
*arr_type
, int low
)
2982 struct type
*arr_type0
= ada_check_typedef (arr_type
);
2983 struct type
*index_type
2984 = create_static_range_type
2985 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
, low
- 1);
2986 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
2988 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2992 /* Name resolution */
2994 /* The "decoded" name for the user-definable Ada operator corresponding
2998 ada_decoded_op_name (enum exp_opcode op
)
3002 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3004 if (ada_opname_table
[i
].op
== op
)
3005 return ada_opname_table
[i
].decoded
;
3007 error (_("Could not find operator name for opcode"));
3011 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3012 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3013 undefined namespace) and converts operators that are
3014 user-defined into appropriate function calls. If CONTEXT_TYPE is
3015 non-null, it provides a preferred result type [at the moment, only
3016 type void has any effect---causing procedures to be preferred over
3017 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3018 return type is preferred. May change (expand) *EXP. */
3021 resolve (struct expression
**expp
, int void_context_p
)
3023 struct type
*context_type
= NULL
;
3027 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3029 resolve_subexp (expp
, &pc
, 1, context_type
);
3032 /* Resolve the operator of the subexpression beginning at
3033 position *POS of *EXPP. "Resolving" consists of replacing
3034 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3035 with their resolutions, replacing built-in operators with
3036 function calls to user-defined operators, where appropriate, and,
3037 when DEPROCEDURE_P is non-zero, converting function-valued variables
3038 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3039 are as in ada_resolve, above. */
3041 static struct value
*
3042 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
3043 struct type
*context_type
)
3047 struct expression
*exp
; /* Convenience: == *expp. */
3048 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3049 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3050 int nargs
; /* Number of operands. */
3057 /* Pass one: resolve operands, saving their types and updating *pos,
3062 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3063 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3068 resolve_subexp (expp
, pos
, 0, NULL
);
3070 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3075 resolve_subexp (expp
, pos
, 0, NULL
);
3080 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
3083 case OP_ATR_MODULUS
:
3093 case TERNOP_IN_RANGE
:
3094 case BINOP_IN_BOUNDS
:
3100 case OP_DISCRETE_RANGE
:
3102 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3111 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3113 resolve_subexp (expp
, pos
, 1, NULL
);
3115 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3132 case BINOP_LOGICAL_AND
:
3133 case BINOP_LOGICAL_OR
:
3134 case BINOP_BITWISE_AND
:
3135 case BINOP_BITWISE_IOR
:
3136 case BINOP_BITWISE_XOR
:
3139 case BINOP_NOTEQUAL
:
3146 case BINOP_SUBSCRIPT
:
3154 case UNOP_LOGICAL_NOT
:
3170 case OP_INTERNALVAR
:
3180 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3183 case STRUCTOP_STRUCT
:
3184 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3197 error (_("Unexpected operator during name resolution"));
3200 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3201 for (i
= 0; i
< nargs
; i
+= 1)
3202 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3206 /* Pass two: perform any resolution on principal operator. */
3213 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3215 struct ada_symbol_info
*candidates
;
3219 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3220 (exp
->elts
[pc
+ 2].symbol
),
3221 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3224 if (n_candidates
> 1)
3226 /* Types tend to get re-introduced locally, so if there
3227 are any local symbols that are not types, first filter
3230 for (j
= 0; j
< n_candidates
; j
+= 1)
3231 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3236 case LOC_REGPARM_ADDR
:
3244 if (j
< n_candidates
)
3247 while (j
< n_candidates
)
3249 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3251 candidates
[j
] = candidates
[n_candidates
- 1];
3260 if (n_candidates
== 0)
3261 error (_("No definition found for %s"),
3262 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3263 else if (n_candidates
== 1)
3265 else if (deprocedure_p
3266 && !is_nonfunction (candidates
, n_candidates
))
3268 i
= ada_resolve_function
3269 (candidates
, n_candidates
, NULL
, 0,
3270 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3273 error (_("Could not find a match for %s"),
3274 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3278 printf_filtered (_("Multiple matches for %s\n"),
3279 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3280 user_select_syms (candidates
, n_candidates
, 1);
3284 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3285 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3286 if (innermost_block
== NULL
3287 || contained_in (candidates
[i
].block
, innermost_block
))
3288 innermost_block
= candidates
[i
].block
;
3292 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3295 replace_operator_with_call (expp
, pc
, 0, 0,
3296 exp
->elts
[pc
+ 2].symbol
,
3297 exp
->elts
[pc
+ 1].block
);
3304 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3305 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3307 struct ada_symbol_info
*candidates
;
3311 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3312 (exp
->elts
[pc
+ 5].symbol
),
3313 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3315 if (n_candidates
== 1)
3319 i
= ada_resolve_function
3320 (candidates
, n_candidates
,
3322 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3325 error (_("Could not find a match for %s"),
3326 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3329 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3330 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3331 if (innermost_block
== NULL
3332 || contained_in (candidates
[i
].block
, innermost_block
))
3333 innermost_block
= candidates
[i
].block
;
3344 case BINOP_BITWISE_AND
:
3345 case BINOP_BITWISE_IOR
:
3346 case BINOP_BITWISE_XOR
:
3348 case BINOP_NOTEQUAL
:
3356 case UNOP_LOGICAL_NOT
:
3358 if (possible_user_operator_p (op
, argvec
))
3360 struct ada_symbol_info
*candidates
;
3364 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3365 (struct block
*) NULL
, VAR_DOMAIN
,
3367 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3368 ada_decoded_op_name (op
), NULL
);
3372 replace_operator_with_call (expp
, pc
, nargs
, 1,
3373 candidates
[i
].sym
, candidates
[i
].block
);
3384 return evaluate_subexp_type (exp
, pos
);
3387 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3388 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3390 /* The term "match" here is rather loose. The match is heuristic and
3394 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3396 ftype
= ada_check_typedef (ftype
);
3397 atype
= ada_check_typedef (atype
);
3399 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3400 ftype
= TYPE_TARGET_TYPE (ftype
);
3401 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3402 atype
= TYPE_TARGET_TYPE (atype
);
3404 switch (TYPE_CODE (ftype
))
3407 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3409 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3410 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3411 TYPE_TARGET_TYPE (atype
), 0);
3414 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3416 case TYPE_CODE_ENUM
:
3417 case TYPE_CODE_RANGE
:
3418 switch (TYPE_CODE (atype
))
3421 case TYPE_CODE_ENUM
:
3422 case TYPE_CODE_RANGE
:
3428 case TYPE_CODE_ARRAY
:
3429 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3430 || ada_is_array_descriptor_type (atype
));
3432 case TYPE_CODE_STRUCT
:
3433 if (ada_is_array_descriptor_type (ftype
))
3434 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3435 || ada_is_array_descriptor_type (atype
));
3437 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3438 && !ada_is_array_descriptor_type (atype
));
3440 case TYPE_CODE_UNION
:
3442 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3446 /* Return non-zero if the formals of FUNC "sufficiently match" the
3447 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3448 may also be an enumeral, in which case it is treated as a 0-
3449 argument function. */
3452 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3455 struct type
*func_type
= SYMBOL_TYPE (func
);
3457 if (SYMBOL_CLASS (func
) == LOC_CONST
3458 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3459 return (n_actuals
== 0);
3460 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3463 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3466 for (i
= 0; i
< n_actuals
; i
+= 1)
3468 if (actuals
[i
] == NULL
)
3472 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3474 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3476 if (!ada_type_match (ftype
, atype
, 1))
3483 /* False iff function type FUNC_TYPE definitely does not produce a value
3484 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3485 FUNC_TYPE is not a valid function type with a non-null return type
3486 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3489 return_match (struct type
*func_type
, struct type
*context_type
)
3491 struct type
*return_type
;
3493 if (func_type
== NULL
)
3496 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3497 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3499 return_type
= get_base_type (func_type
);
3500 if (return_type
== NULL
)
3503 context_type
= get_base_type (context_type
);
3505 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3506 return context_type
== NULL
|| return_type
== context_type
;
3507 else if (context_type
== NULL
)
3508 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3510 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3514 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3515 function (if any) that matches the types of the NARGS arguments in
3516 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3517 that returns that type, then eliminate matches that don't. If
3518 CONTEXT_TYPE is void and there is at least one match that does not
3519 return void, eliminate all matches that do.
3521 Asks the user if there is more than one match remaining. Returns -1
3522 if there is no such symbol or none is selected. NAME is used
3523 solely for messages. May re-arrange and modify SYMS in
3524 the process; the index returned is for the modified vector. */
3527 ada_resolve_function (struct ada_symbol_info syms
[],
3528 int nsyms
, struct value
**args
, int nargs
,
3529 const char *name
, struct type
*context_type
)
3533 int m
; /* Number of hits */
3536 /* In the first pass of the loop, we only accept functions matching
3537 context_type. If none are found, we add a second pass of the loop
3538 where every function is accepted. */
3539 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3541 for (k
= 0; k
< nsyms
; k
+= 1)
3543 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3545 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3546 && (fallback
|| return_match (type
, context_type
)))
3558 printf_filtered (_("Multiple matches for %s\n"), name
);
3559 user_select_syms (syms
, m
, 1);
3565 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3566 in a listing of choices during disambiguation (see sort_choices, below).
3567 The idea is that overloadings of a subprogram name from the
3568 same package should sort in their source order. We settle for ordering
3569 such symbols by their trailing number (__N or $N). */
3572 encoded_ordered_before (const char *N0
, const char *N1
)
3576 else if (N0
== NULL
)
3582 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3584 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3586 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3587 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3592 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3595 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3597 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3598 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3600 return (strcmp (N0
, N1
) < 0);
3604 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3608 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3612 for (i
= 1; i
< nsyms
; i
+= 1)
3614 struct ada_symbol_info sym
= syms
[i
];
3617 for (j
= i
- 1; j
>= 0; j
-= 1)
3619 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3620 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3622 syms
[j
+ 1] = syms
[j
];
3628 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3629 by asking the user (if necessary), returning the number selected,
3630 and setting the first elements of SYMS items. Error if no symbols
3633 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3634 to be re-integrated one of these days. */
3637 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3640 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3642 int first_choice
= (max_results
== 1) ? 1 : 2;
3643 const char *select_mode
= multiple_symbols_select_mode ();
3645 if (max_results
< 1)
3646 error (_("Request to select 0 symbols!"));
3650 if (select_mode
== multiple_symbols_cancel
)
3652 canceled because the command is ambiguous\n\
3653 See set/show multiple-symbol."));
3655 /* If select_mode is "all", then return all possible symbols.
3656 Only do that if more than one symbol can be selected, of course.
3657 Otherwise, display the menu as usual. */
3658 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3661 printf_unfiltered (_("[0] cancel\n"));
3662 if (max_results
> 1)
3663 printf_unfiltered (_("[1] all\n"));
3665 sort_choices (syms
, nsyms
);
3667 for (i
= 0; i
< nsyms
; i
+= 1)
3669 if (syms
[i
].sym
== NULL
)
3672 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3674 struct symtab_and_line sal
=
3675 find_function_start_sal (syms
[i
].sym
, 1);
3677 if (sal
.symtab
== NULL
)
3678 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3680 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3683 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3684 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3685 symtab_to_filename_for_display (sal
.symtab
),
3692 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3693 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3694 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3695 struct symtab
*symtab
= SYMBOL_SYMTAB (syms
[i
].sym
);
3697 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3698 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3700 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3701 symtab_to_filename_for_display (symtab
),
3702 SYMBOL_LINE (syms
[i
].sym
));
3703 else if (is_enumeral
3704 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3706 printf_unfiltered (("[%d] "), i
+ first_choice
);
3707 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3708 gdb_stdout
, -1, 0, &type_print_raw_options
);
3709 printf_unfiltered (_("'(%s) (enumeral)\n"),
3710 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3712 else if (symtab
!= NULL
)
3713 printf_unfiltered (is_enumeral
3714 ? _("[%d] %s in %s (enumeral)\n")
3715 : _("[%d] %s at %s:?\n"),
3717 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3718 symtab_to_filename_for_display (symtab
));
3720 printf_unfiltered (is_enumeral
3721 ? _("[%d] %s (enumeral)\n")
3722 : _("[%d] %s at ?\n"),
3724 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3728 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3731 for (i
= 0; i
< n_chosen
; i
+= 1)
3732 syms
[i
] = syms
[chosen
[i
]];
3737 /* Read and validate a set of numeric choices from the user in the
3738 range 0 .. N_CHOICES-1. Place the results in increasing
3739 order in CHOICES[0 .. N-1], and return N.
3741 The user types choices as a sequence of numbers on one line
3742 separated by blanks, encoding them as follows:
3744 + A choice of 0 means to cancel the selection, throwing an error.
3745 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3746 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3748 The user is not allowed to choose more than MAX_RESULTS values.
3750 ANNOTATION_SUFFIX, if present, is used to annotate the input
3751 prompts (for use with the -f switch). */
3754 get_selections (int *choices
, int n_choices
, int max_results
,
3755 int is_all_choice
, char *annotation_suffix
)
3760 int first_choice
= is_all_choice
? 2 : 1;
3762 prompt
= getenv ("PS2");
3766 args
= command_line_input (prompt
, 0, annotation_suffix
);
3769 error_no_arg (_("one or more choice numbers"));
3773 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3774 order, as given in args. Choices are validated. */
3780 args
= skip_spaces (args
);
3781 if (*args
== '\0' && n_chosen
== 0)
3782 error_no_arg (_("one or more choice numbers"));
3783 else if (*args
== '\0')
3786 choice
= strtol (args
, &args2
, 10);
3787 if (args
== args2
|| choice
< 0
3788 || choice
> n_choices
+ first_choice
- 1)
3789 error (_("Argument must be choice number"));
3793 error (_("cancelled"));
3795 if (choice
< first_choice
)
3797 n_chosen
= n_choices
;
3798 for (j
= 0; j
< n_choices
; j
+= 1)
3802 choice
-= first_choice
;
3804 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3808 if (j
< 0 || choice
!= choices
[j
])
3812 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3813 choices
[k
+ 1] = choices
[k
];
3814 choices
[j
+ 1] = choice
;
3819 if (n_chosen
> max_results
)
3820 error (_("Select no more than %d of the above"), max_results
);
3825 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3826 on the function identified by SYM and BLOCK, and taking NARGS
3827 arguments. Update *EXPP as needed to hold more space. */
3830 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3831 int oplen
, struct symbol
*sym
,
3832 const struct block
*block
)
3834 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3835 symbol, -oplen for operator being replaced). */
3836 struct expression
*newexp
= (struct expression
*)
3837 xzalloc (sizeof (struct expression
)
3838 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3839 struct expression
*exp
= *expp
;
3841 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3842 newexp
->language_defn
= exp
->language_defn
;
3843 newexp
->gdbarch
= exp
->gdbarch
;
3844 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3845 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3846 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3848 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3849 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3851 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3852 newexp
->elts
[pc
+ 4].block
= block
;
3853 newexp
->elts
[pc
+ 5].symbol
= sym
;
3859 /* Type-class predicates */
3861 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3865 numeric_type_p (struct type
*type
)
3871 switch (TYPE_CODE (type
))
3876 case TYPE_CODE_RANGE
:
3877 return (type
== TYPE_TARGET_TYPE (type
)
3878 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3885 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3888 integer_type_p (struct type
*type
)
3894 switch (TYPE_CODE (type
))
3898 case TYPE_CODE_RANGE
:
3899 return (type
== TYPE_TARGET_TYPE (type
)
3900 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3907 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3910 scalar_type_p (struct type
*type
)
3916 switch (TYPE_CODE (type
))
3919 case TYPE_CODE_RANGE
:
3920 case TYPE_CODE_ENUM
:
3929 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3932 discrete_type_p (struct type
*type
)
3938 switch (TYPE_CODE (type
))
3941 case TYPE_CODE_RANGE
:
3942 case TYPE_CODE_ENUM
:
3943 case TYPE_CODE_BOOL
:
3951 /* Returns non-zero if OP with operands in the vector ARGS could be
3952 a user-defined function. Errs on the side of pre-defined operators
3953 (i.e., result 0). */
3956 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3958 struct type
*type0
=
3959 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3960 struct type
*type1
=
3961 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3975 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3979 case BINOP_BITWISE_AND
:
3980 case BINOP_BITWISE_IOR
:
3981 case BINOP_BITWISE_XOR
:
3982 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3985 case BINOP_NOTEQUAL
:
3990 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3993 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3996 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4000 case UNOP_LOGICAL_NOT
:
4002 return (!numeric_type_p (type0
));
4011 1. In the following, we assume that a renaming type's name may
4012 have an ___XD suffix. It would be nice if this went away at some
4014 2. We handle both the (old) purely type-based representation of
4015 renamings and the (new) variable-based encoding. At some point,
4016 it is devoutly to be hoped that the former goes away
4017 (FIXME: hilfinger-2007-07-09).
4018 3. Subprogram renamings are not implemented, although the XRS
4019 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4021 /* If SYM encodes a renaming,
4023 <renaming> renames <renamed entity>,
4025 sets *LEN to the length of the renamed entity's name,
4026 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4027 the string describing the subcomponent selected from the renamed
4028 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4029 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4030 are undefined). Otherwise, returns a value indicating the category
4031 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4032 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4033 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4034 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4035 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4036 may be NULL, in which case they are not assigned.
4038 [Currently, however, GCC does not generate subprogram renamings.] */
4040 enum ada_renaming_category
4041 ada_parse_renaming (struct symbol
*sym
,
4042 const char **renamed_entity
, int *len
,
4043 const char **renaming_expr
)
4045 enum ada_renaming_category kind
;
4050 return ADA_NOT_RENAMING
;
4051 switch (SYMBOL_CLASS (sym
))
4054 return ADA_NOT_RENAMING
;
4056 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
4057 renamed_entity
, len
, renaming_expr
);
4061 case LOC_OPTIMIZED_OUT
:
4062 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4064 return ADA_NOT_RENAMING
;
4068 kind
= ADA_OBJECT_RENAMING
;
4072 kind
= ADA_EXCEPTION_RENAMING
;
4076 kind
= ADA_PACKAGE_RENAMING
;
4080 kind
= ADA_SUBPROGRAM_RENAMING
;
4084 return ADA_NOT_RENAMING
;
4088 if (renamed_entity
!= NULL
)
4089 *renamed_entity
= info
;
4090 suffix
= strstr (info
, "___XE");
4091 if (suffix
== NULL
|| suffix
== info
)
4092 return ADA_NOT_RENAMING
;
4094 *len
= strlen (info
) - strlen (suffix
);
4096 if (renaming_expr
!= NULL
)
4097 *renaming_expr
= suffix
;
4101 /* Assuming TYPE encodes a renaming according to the old encoding in
4102 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4103 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4104 ADA_NOT_RENAMING otherwise. */
4105 static enum ada_renaming_category
4106 parse_old_style_renaming (struct type
*type
,
4107 const char **renamed_entity
, int *len
,
4108 const char **renaming_expr
)
4110 enum ada_renaming_category kind
;
4115 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4116 || TYPE_NFIELDS (type
) != 1)
4117 return ADA_NOT_RENAMING
;
4119 name
= type_name_no_tag (type
);
4121 return ADA_NOT_RENAMING
;
4123 name
= strstr (name
, "___XR");
4125 return ADA_NOT_RENAMING
;
4130 kind
= ADA_OBJECT_RENAMING
;
4133 kind
= ADA_EXCEPTION_RENAMING
;
4136 kind
= ADA_PACKAGE_RENAMING
;
4139 kind
= ADA_SUBPROGRAM_RENAMING
;
4142 return ADA_NOT_RENAMING
;
4145 info
= TYPE_FIELD_NAME (type
, 0);
4147 return ADA_NOT_RENAMING
;
4148 if (renamed_entity
!= NULL
)
4149 *renamed_entity
= info
;
4150 suffix
= strstr (info
, "___XE");
4151 if (renaming_expr
!= NULL
)
4152 *renaming_expr
= suffix
+ 5;
4153 if (suffix
== NULL
|| suffix
== info
)
4154 return ADA_NOT_RENAMING
;
4156 *len
= suffix
- info
;
4160 /* Compute the value of the given RENAMING_SYM, which is expected to
4161 be a symbol encoding a renaming expression. BLOCK is the block
4162 used to evaluate the renaming. */
4164 static struct value
*
4165 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4166 const struct block
*block
)
4168 const char *sym_name
;
4169 struct expression
*expr
;
4170 struct value
*value
;
4171 struct cleanup
*old_chain
= NULL
;
4173 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4174 expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4175 old_chain
= make_cleanup (free_current_contents
, &expr
);
4176 value
= evaluate_expression (expr
);
4178 do_cleanups (old_chain
);
4183 /* Evaluation: Function Calls */
4185 /* Return an lvalue containing the value VAL. This is the identity on
4186 lvalues, and otherwise has the side-effect of allocating memory
4187 in the inferior where a copy of the value contents is copied. */
4189 static struct value
*
4190 ensure_lval (struct value
*val
)
4192 if (VALUE_LVAL (val
) == not_lval
4193 || VALUE_LVAL (val
) == lval_internalvar
)
4195 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4196 const CORE_ADDR addr
=
4197 value_as_long (value_allocate_space_in_inferior (len
));
4199 set_value_address (val
, addr
);
4200 VALUE_LVAL (val
) = lval_memory
;
4201 write_memory (addr
, value_contents (val
), len
);
4207 /* Return the value ACTUAL, converted to be an appropriate value for a
4208 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4209 allocating any necessary descriptors (fat pointers), or copies of
4210 values not residing in memory, updating it as needed. */
4213 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4215 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4216 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4217 struct type
*formal_target
=
4218 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4219 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4220 struct type
*actual_target
=
4221 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4222 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4224 if (ada_is_array_descriptor_type (formal_target
)
4225 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4226 return make_array_descriptor (formal_type
, actual
);
4227 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4228 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4230 struct value
*result
;
4232 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4233 && ada_is_array_descriptor_type (actual_target
))
4234 result
= desc_data (actual
);
4235 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4237 if (VALUE_LVAL (actual
) != lval_memory
)
4241 actual_type
= ada_check_typedef (value_type (actual
));
4242 val
= allocate_value (actual_type
);
4243 memcpy ((char *) value_contents_raw (val
),
4244 (char *) value_contents (actual
),
4245 TYPE_LENGTH (actual_type
));
4246 actual
= ensure_lval (val
);
4248 result
= value_addr (actual
);
4252 return value_cast_pointers (formal_type
, result
, 0);
4254 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4255 return ada_value_ind (actual
);
4260 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4261 type TYPE. This is usually an inefficient no-op except on some targets
4262 (such as AVR) where the representation of a pointer and an address
4266 value_pointer (struct value
*value
, struct type
*type
)
4268 struct gdbarch
*gdbarch
= get_type_arch (type
);
4269 unsigned len
= TYPE_LENGTH (type
);
4270 gdb_byte
*buf
= alloca (len
);
4273 addr
= value_address (value
);
4274 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4275 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4280 /* Push a descriptor of type TYPE for array value ARR on the stack at
4281 *SP, updating *SP to reflect the new descriptor. Return either
4282 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4283 to-descriptor type rather than a descriptor type), a struct value *
4284 representing a pointer to this descriptor. */
4286 static struct value
*
4287 make_array_descriptor (struct type
*type
, struct value
*arr
)
4289 struct type
*bounds_type
= desc_bounds_type (type
);
4290 struct type
*desc_type
= desc_base_type (type
);
4291 struct value
*descriptor
= allocate_value (desc_type
);
4292 struct value
*bounds
= allocate_value (bounds_type
);
4295 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4298 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4299 ada_array_bound (arr
, i
, 0),
4300 desc_bound_bitpos (bounds_type
, i
, 0),
4301 desc_bound_bitsize (bounds_type
, i
, 0));
4302 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4303 ada_array_bound (arr
, i
, 1),
4304 desc_bound_bitpos (bounds_type
, i
, 1),
4305 desc_bound_bitsize (bounds_type
, i
, 1));
4308 bounds
= ensure_lval (bounds
);
4310 modify_field (value_type (descriptor
),
4311 value_contents_writeable (descriptor
),
4312 value_pointer (ensure_lval (arr
),
4313 TYPE_FIELD_TYPE (desc_type
, 0)),
4314 fat_pntr_data_bitpos (desc_type
),
4315 fat_pntr_data_bitsize (desc_type
));
4317 modify_field (value_type (descriptor
),
4318 value_contents_writeable (descriptor
),
4319 value_pointer (bounds
,
4320 TYPE_FIELD_TYPE (desc_type
, 1)),
4321 fat_pntr_bounds_bitpos (desc_type
),
4322 fat_pntr_bounds_bitsize (desc_type
));
4324 descriptor
= ensure_lval (descriptor
);
4326 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4327 return value_addr (descriptor
);
4332 /* Symbol Cache Module */
4334 /* Performance measurements made as of 2010-01-15 indicate that
4335 this cache does bring some noticeable improvements. Depending
4336 on the type of entity being printed, the cache can make it as much
4337 as an order of magnitude faster than without it.
4339 The descriptive type DWARF extension has significantly reduced
4340 the need for this cache, at least when DWARF is being used. However,
4341 even in this case, some expensive name-based symbol searches are still
4342 sometimes necessary - to find an XVZ variable, mostly. */
4344 /* Initialize the contents of SYM_CACHE. */
4347 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4349 obstack_init (&sym_cache
->cache_space
);
4350 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4353 /* Free the memory used by SYM_CACHE. */
4356 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4358 obstack_free (&sym_cache
->cache_space
, NULL
);
4362 /* Return the symbol cache associated to the given program space PSPACE.
4363 If not allocated for this PSPACE yet, allocate and initialize one. */
4365 static struct ada_symbol_cache
*
4366 ada_get_symbol_cache (struct program_space
*pspace
)
4368 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4369 struct ada_symbol_cache
*sym_cache
= pspace_data
->sym_cache
;
4371 if (sym_cache
== NULL
)
4373 sym_cache
= XCNEW (struct ada_symbol_cache
);
4374 ada_init_symbol_cache (sym_cache
);
4380 /* Clear all entries from the symbol cache. */
4383 ada_clear_symbol_cache (void)
4385 struct ada_symbol_cache
*sym_cache
4386 = ada_get_symbol_cache (current_program_space
);
4388 obstack_free (&sym_cache
->cache_space
, NULL
);
4389 ada_init_symbol_cache (sym_cache
);
4392 /* Search our cache for an entry matching NAME and NAMESPACE.
4393 Return it if found, or NULL otherwise. */
4395 static struct cache_entry
**
4396 find_entry (const char *name
, domain_enum
namespace)
4398 struct ada_symbol_cache
*sym_cache
4399 = ada_get_symbol_cache (current_program_space
);
4400 int h
= msymbol_hash (name
) % HASH_SIZE
;
4401 struct cache_entry
**e
;
4403 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4405 if (namespace == (*e
)->namespace && strcmp (name
, (*e
)->name
) == 0)
4411 /* Search the symbol cache for an entry matching NAME and NAMESPACE.
4412 Return 1 if found, 0 otherwise.
4414 If an entry was found and SYM is not NULL, set *SYM to the entry's
4415 SYM. Same principle for BLOCK if not NULL. */
4418 lookup_cached_symbol (const char *name
, domain_enum
namespace,
4419 struct symbol
**sym
, const struct block
**block
)
4421 struct cache_entry
**e
= find_entry (name
, namespace);
4428 *block
= (*e
)->block
;
4432 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4433 in domain NAMESPACE, save this result in our symbol cache. */
4436 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
4437 const struct block
*block
)
4439 struct ada_symbol_cache
*sym_cache
4440 = ada_get_symbol_cache (current_program_space
);
4443 struct cache_entry
*e
;
4445 /* If the symbol is a local symbol, then do not cache it, as a search
4446 for that symbol depends on the context. To determine whether
4447 the symbol is local or not, we check the block where we found it
4448 against the global and static blocks of its associated symtab. */
4450 && BLOCKVECTOR_BLOCK (BLOCKVECTOR (sym
->symtab
), GLOBAL_BLOCK
) != block
4451 && BLOCKVECTOR_BLOCK (BLOCKVECTOR (sym
->symtab
), STATIC_BLOCK
) != block
)
4454 h
= msymbol_hash (name
) % HASH_SIZE
;
4455 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4457 e
->next
= sym_cache
->root
[h
];
4458 sym_cache
->root
[h
] = e
;
4459 e
->name
= copy
= obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4460 strcpy (copy
, name
);
4462 e
->namespace = namespace;
4468 /* Return nonzero if wild matching should be used when searching for
4469 all symbols matching LOOKUP_NAME.
4471 LOOKUP_NAME is expected to be a symbol name after transformation
4472 for Ada lookups (see ada_name_for_lookup). */
4475 should_use_wild_match (const char *lookup_name
)
4477 return (strstr (lookup_name
, "__") == NULL
);
4480 /* Return the result of a standard (literal, C-like) lookup of NAME in
4481 given DOMAIN, visible from lexical block BLOCK. */
4483 static struct symbol
*
4484 standard_lookup (const char *name
, const struct block
*block
,
4487 /* Initialize it just to avoid a GCC false warning. */
4488 struct symbol
*sym
= NULL
;
4490 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4492 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4493 cache_symbol (name
, domain
, sym
, block_found
);
4498 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4499 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4500 since they contend in overloading in the same way. */
4502 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4506 for (i
= 0; i
< n
; i
+= 1)
4507 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4508 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4509 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4515 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4516 struct types. Otherwise, they may not. */
4519 equiv_types (struct type
*type0
, struct type
*type1
)
4523 if (type0
== NULL
|| type1
== NULL
4524 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4526 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4527 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4528 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4529 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4535 /* True iff SYM0 represents the same entity as SYM1, or one that is
4536 no more defined than that of SYM1. */
4539 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4543 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4544 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4547 switch (SYMBOL_CLASS (sym0
))
4553 struct type
*type0
= SYMBOL_TYPE (sym0
);
4554 struct type
*type1
= SYMBOL_TYPE (sym1
);
4555 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4556 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4557 int len0
= strlen (name0
);
4560 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4561 && (equiv_types (type0
, type1
)
4562 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4563 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4566 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4567 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4573 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4574 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4577 add_defn_to_vec (struct obstack
*obstackp
,
4579 const struct block
*block
)
4582 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4584 /* Do not try to complete stub types, as the debugger is probably
4585 already scanning all symbols matching a certain name at the
4586 time when this function is called. Trying to replace the stub
4587 type by its associated full type will cause us to restart a scan
4588 which may lead to an infinite recursion. Instead, the client
4589 collecting the matching symbols will end up collecting several
4590 matches, with at least one of them complete. It can then filter
4591 out the stub ones if needed. */
4593 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4595 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4597 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4599 prevDefns
[i
].sym
= sym
;
4600 prevDefns
[i
].block
= block
;
4606 struct ada_symbol_info info
;
4610 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4614 /* Number of ada_symbol_info structures currently collected in
4615 current vector in *OBSTACKP. */
4618 num_defns_collected (struct obstack
*obstackp
)
4620 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4623 /* Vector of ada_symbol_info structures currently collected in current
4624 vector in *OBSTACKP. If FINISH, close off the vector and return
4625 its final address. */
4627 static struct ada_symbol_info
*
4628 defns_collected (struct obstack
*obstackp
, int finish
)
4631 return obstack_finish (obstackp
);
4633 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4636 /* Return a bound minimal symbol matching NAME according to Ada
4637 decoding rules. Returns an invalid symbol if there is no such
4638 minimal symbol. Names prefixed with "standard__" are handled
4639 specially: "standard__" is first stripped off, and only static and
4640 global symbols are searched. */
4642 struct bound_minimal_symbol
4643 ada_lookup_simple_minsym (const char *name
)
4645 struct bound_minimal_symbol result
;
4646 struct objfile
*objfile
;
4647 struct minimal_symbol
*msymbol
;
4648 const int wild_match_p
= should_use_wild_match (name
);
4650 memset (&result
, 0, sizeof (result
));
4652 /* Special case: If the user specifies a symbol name inside package
4653 Standard, do a non-wild matching of the symbol name without
4654 the "standard__" prefix. This was primarily introduced in order
4655 to allow the user to specifically access the standard exceptions
4656 using, for instance, Standard.Constraint_Error when Constraint_Error
4657 is ambiguous (due to the user defining its own Constraint_Error
4658 entity inside its program). */
4659 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4660 name
+= sizeof ("standard__") - 1;
4662 ALL_MSYMBOLS (objfile
, msymbol
)
4664 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match_p
)
4665 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4667 result
.minsym
= msymbol
;
4668 result
.objfile
= objfile
;
4676 /* For all subprograms that statically enclose the subprogram of the
4677 selected frame, add symbols matching identifier NAME in DOMAIN
4678 and their blocks to the list of data in OBSTACKP, as for
4679 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4680 with a wildcard prefix. */
4683 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4684 const char *name
, domain_enum
namespace,
4689 /* True if TYPE is definitely an artificial type supplied to a symbol
4690 for which no debugging information was given in the symbol file. */
4693 is_nondebugging_type (struct type
*type
)
4695 const char *name
= ada_type_name (type
);
4697 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4700 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4701 that are deemed "identical" for practical purposes.
4703 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4704 types and that their number of enumerals is identical (in other
4705 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4708 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4712 /* The heuristic we use here is fairly conservative. We consider
4713 that 2 enumerate types are identical if they have the same
4714 number of enumerals and that all enumerals have the same
4715 underlying value and name. */
4717 /* All enums in the type should have an identical underlying value. */
4718 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4719 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4722 /* All enumerals should also have the same name (modulo any numerical
4724 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4726 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4727 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4728 int len_1
= strlen (name_1
);
4729 int len_2
= strlen (name_2
);
4731 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4732 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4734 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4735 TYPE_FIELD_NAME (type2
, i
),
4743 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4744 that are deemed "identical" for practical purposes. Sometimes,
4745 enumerals are not strictly identical, but their types are so similar
4746 that they can be considered identical.
4748 For instance, consider the following code:
4750 type Color is (Black, Red, Green, Blue, White);
4751 type RGB_Color is new Color range Red .. Blue;
4753 Type RGB_Color is a subrange of an implicit type which is a copy
4754 of type Color. If we call that implicit type RGB_ColorB ("B" is
4755 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4756 As a result, when an expression references any of the enumeral
4757 by name (Eg. "print green"), the expression is technically
4758 ambiguous and the user should be asked to disambiguate. But
4759 doing so would only hinder the user, since it wouldn't matter
4760 what choice he makes, the outcome would always be the same.
4761 So, for practical purposes, we consider them as the same. */
4764 symbols_are_identical_enums (struct ada_symbol_info
*syms
, int nsyms
)
4768 /* Before performing a thorough comparison check of each type,
4769 we perform a series of inexpensive checks. We expect that these
4770 checks will quickly fail in the vast majority of cases, and thus
4771 help prevent the unnecessary use of a more expensive comparison.
4772 Said comparison also expects us to make some of these checks
4773 (see ada_identical_enum_types_p). */
4775 /* Quick check: All symbols should have an enum type. */
4776 for (i
= 0; i
< nsyms
; i
++)
4777 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
)
4780 /* Quick check: They should all have the same value. */
4781 for (i
= 1; i
< nsyms
; i
++)
4782 if (SYMBOL_VALUE (syms
[i
].sym
) != SYMBOL_VALUE (syms
[0].sym
))
4785 /* Quick check: They should all have the same number of enumerals. */
4786 for (i
= 1; i
< nsyms
; i
++)
4787 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].sym
))
4788 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].sym
)))
4791 /* All the sanity checks passed, so we might have a set of
4792 identical enumeration types. Perform a more complete
4793 comparison of the type of each symbol. */
4794 for (i
= 1; i
< nsyms
; i
++)
4795 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].sym
),
4796 SYMBOL_TYPE (syms
[0].sym
)))
4802 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4803 duplicate other symbols in the list (The only case I know of where
4804 this happens is when object files containing stabs-in-ecoff are
4805 linked with files containing ordinary ecoff debugging symbols (or no
4806 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4807 Returns the number of items in the modified list. */
4810 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4814 /* We should never be called with less than 2 symbols, as there
4815 cannot be any extra symbol in that case. But it's easy to
4816 handle, since we have nothing to do in that case. */
4825 /* If two symbols have the same name and one of them is a stub type,
4826 the get rid of the stub. */
4828 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4829 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4831 for (j
= 0; j
< nsyms
; j
++)
4834 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4835 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4836 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4837 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4842 /* Two symbols with the same name, same class and same address
4843 should be identical. */
4845 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4846 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4847 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4849 for (j
= 0; j
< nsyms
; j
+= 1)
4852 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4853 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4854 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4855 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4856 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4857 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4864 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4865 syms
[j
- 1] = syms
[j
];
4872 /* If all the remaining symbols are identical enumerals, then
4873 just keep the first one and discard the rest.
4875 Unlike what we did previously, we do not discard any entry
4876 unless they are ALL identical. This is because the symbol
4877 comparison is not a strict comparison, but rather a practical
4878 comparison. If all symbols are considered identical, then
4879 we can just go ahead and use the first one and discard the rest.
4880 But if we cannot reduce the list to a single element, we have
4881 to ask the user to disambiguate anyways. And if we have to
4882 present a multiple-choice menu, it's less confusing if the list
4883 isn't missing some choices that were identical and yet distinct. */
4884 if (symbols_are_identical_enums (syms
, nsyms
))
4890 /* Given a type that corresponds to a renaming entity, use the type name
4891 to extract the scope (package name or function name, fully qualified,
4892 and following the GNAT encoding convention) where this renaming has been
4893 defined. The string returned needs to be deallocated after use. */
4896 xget_renaming_scope (struct type
*renaming_type
)
4898 /* The renaming types adhere to the following convention:
4899 <scope>__<rename>___<XR extension>.
4900 So, to extract the scope, we search for the "___XR" extension,
4901 and then backtrack until we find the first "__". */
4903 const char *name
= type_name_no_tag (renaming_type
);
4904 char *suffix
= strstr (name
, "___XR");
4909 /* Now, backtrack a bit until we find the first "__". Start looking
4910 at suffix - 3, as the <rename> part is at least one character long. */
4912 for (last
= suffix
- 3; last
> name
; last
--)
4913 if (last
[0] == '_' && last
[1] == '_')
4916 /* Make a copy of scope and return it. */
4918 scope_len
= last
- name
;
4919 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4921 strncpy (scope
, name
, scope_len
);
4922 scope
[scope_len
] = '\0';
4927 /* Return nonzero if NAME corresponds to a package name. */
4930 is_package_name (const char *name
)
4932 /* Here, We take advantage of the fact that no symbols are generated
4933 for packages, while symbols are generated for each function.
4934 So the condition for NAME represent a package becomes equivalent
4935 to NAME not existing in our list of symbols. There is only one
4936 small complication with library-level functions (see below). */
4940 /* If it is a function that has not been defined at library level,
4941 then we should be able to look it up in the symbols. */
4942 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4945 /* Library-level function names start with "_ada_". See if function
4946 "_ada_" followed by NAME can be found. */
4948 /* Do a quick check that NAME does not contain "__", since library-level
4949 functions names cannot contain "__" in them. */
4950 if (strstr (name
, "__") != NULL
)
4953 fun_name
= xstrprintf ("_ada_%s", name
);
4955 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4958 /* Return nonzero if SYM corresponds to a renaming entity that is
4959 not visible from FUNCTION_NAME. */
4962 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
4965 struct cleanup
*old_chain
;
4967 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4970 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4971 old_chain
= make_cleanup (xfree
, scope
);
4973 /* If the rename has been defined in a package, then it is visible. */
4974 if (is_package_name (scope
))
4976 do_cleanups (old_chain
);
4980 /* Check that the rename is in the current function scope by checking
4981 that its name starts with SCOPE. */
4983 /* If the function name starts with "_ada_", it means that it is
4984 a library-level function. Strip this prefix before doing the
4985 comparison, as the encoding for the renaming does not contain
4987 if (strncmp (function_name
, "_ada_", 5) == 0)
4991 int is_invisible
= strncmp (function_name
, scope
, strlen (scope
)) != 0;
4993 do_cleanups (old_chain
);
4994 return is_invisible
;
4998 /* Remove entries from SYMS that corresponds to a renaming entity that
4999 is not visible from the function associated with CURRENT_BLOCK or
5000 that is superfluous due to the presence of more specific renaming
5001 information. Places surviving symbols in the initial entries of
5002 SYMS and returns the number of surviving symbols.
5005 First, in cases where an object renaming is implemented as a
5006 reference variable, GNAT may produce both the actual reference
5007 variable and the renaming encoding. In this case, we discard the
5010 Second, GNAT emits a type following a specified encoding for each renaming
5011 entity. Unfortunately, STABS currently does not support the definition
5012 of types that are local to a given lexical block, so all renamings types
5013 are emitted at library level. As a consequence, if an application
5014 contains two renaming entities using the same name, and a user tries to
5015 print the value of one of these entities, the result of the ada symbol
5016 lookup will also contain the wrong renaming type.
5018 This function partially covers for this limitation by attempting to
5019 remove from the SYMS list renaming symbols that should be visible
5020 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5021 method with the current information available. The implementation
5022 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5024 - When the user tries to print a rename in a function while there
5025 is another rename entity defined in a package: Normally, the
5026 rename in the function has precedence over the rename in the
5027 package, so the latter should be removed from the list. This is
5028 currently not the case.
5030 - This function will incorrectly remove valid renames if
5031 the CURRENT_BLOCK corresponds to a function which symbol name
5032 has been changed by an "Export" pragma. As a consequence,
5033 the user will be unable to print such rename entities. */
5036 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
5037 int nsyms
, const struct block
*current_block
)
5039 struct symbol
*current_function
;
5040 const char *current_function_name
;
5042 int is_new_style_renaming
;
5044 /* If there is both a renaming foo___XR... encoded as a variable and
5045 a simple variable foo in the same block, discard the latter.
5046 First, zero out such symbols, then compress. */
5047 is_new_style_renaming
= 0;
5048 for (i
= 0; i
< nsyms
; i
+= 1)
5050 struct symbol
*sym
= syms
[i
].sym
;
5051 const struct block
*block
= syms
[i
].block
;
5055 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5057 name
= SYMBOL_LINKAGE_NAME (sym
);
5058 suffix
= strstr (name
, "___XR");
5062 int name_len
= suffix
- name
;
5065 is_new_style_renaming
= 1;
5066 for (j
= 0; j
< nsyms
; j
+= 1)
5067 if (i
!= j
&& syms
[j
].sym
!= NULL
5068 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
5070 && block
== syms
[j
].block
)
5074 if (is_new_style_renaming
)
5078 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5079 if (syms
[j
].sym
!= NULL
)
5087 /* Extract the function name associated to CURRENT_BLOCK.
5088 Abort if unable to do so. */
5090 if (current_block
== NULL
)
5093 current_function
= block_linkage_function (current_block
);
5094 if (current_function
== NULL
)
5097 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5098 if (current_function_name
== NULL
)
5101 /* Check each of the symbols, and remove it from the list if it is
5102 a type corresponding to a renaming that is out of the scope of
5103 the current block. */
5108 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
5109 == ADA_OBJECT_RENAMING
5110 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
5114 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5115 syms
[j
- 1] = syms
[j
];
5125 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5126 whose name and domain match NAME and DOMAIN respectively.
5127 If no match was found, then extend the search to "enclosing"
5128 routines (in other words, if we're inside a nested function,
5129 search the symbols defined inside the enclosing functions).
5130 If WILD_MATCH_P is nonzero, perform the naming matching in
5131 "wild" mode (see function "wild_match" for more info).
5133 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5136 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
5137 const struct block
*block
, domain_enum domain
,
5140 int block_depth
= 0;
5142 while (block
!= NULL
)
5145 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5148 /* If we found a non-function match, assume that's the one. */
5149 if (is_nonfunction (defns_collected (obstackp
, 0),
5150 num_defns_collected (obstackp
)))
5153 block
= BLOCK_SUPERBLOCK (block
);
5156 /* If no luck so far, try to find NAME as a local symbol in some lexically
5157 enclosing subprogram. */
5158 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5159 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match_p
);
5162 /* An object of this type is used as the user_data argument when
5163 calling the map_matching_symbols method. */
5167 struct objfile
*objfile
;
5168 struct obstack
*obstackp
;
5169 struct symbol
*arg_sym
;
5173 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
5174 to a list of symbols. DATA0 is a pointer to a struct match_data *
5175 containing the obstack that collects the symbol list, the file that SYM
5176 must come from, a flag indicating whether a non-argument symbol has
5177 been found in the current block, and the last argument symbol
5178 passed in SYM within the current block (if any). When SYM is null,
5179 marking the end of a block, the argument symbol is added if no
5180 other has been found. */
5183 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5185 struct match_data
*data
= (struct match_data
*) data0
;
5189 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5190 add_defn_to_vec (data
->obstackp
,
5191 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5193 data
->found_sym
= 0;
5194 data
->arg_sym
= NULL
;
5198 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5200 else if (SYMBOL_IS_ARGUMENT (sym
))
5201 data
->arg_sym
= sym
;
5204 data
->found_sym
= 1;
5205 add_defn_to_vec (data
->obstackp
,
5206 fixup_symbol_section (sym
, data
->objfile
),
5213 /* Implements compare_names, but only applying the comparision using
5214 the given CASING. */
5217 compare_names_with_case (const char *string1
, const char *string2
,
5218 enum case_sensitivity casing
)
5220 while (*string1
!= '\0' && *string2
!= '\0')
5224 if (isspace (*string1
) || isspace (*string2
))
5225 return strcmp_iw_ordered (string1
, string2
);
5227 if (casing
== case_sensitive_off
)
5229 c1
= tolower (*string1
);
5230 c2
= tolower (*string2
);
5247 return strcmp_iw_ordered (string1
, string2
);
5249 if (*string2
== '\0')
5251 if (is_name_suffix (string1
))
5258 if (*string2
== '(')
5259 return strcmp_iw_ordered (string1
, string2
);
5262 if (casing
== case_sensitive_off
)
5263 return tolower (*string1
) - tolower (*string2
);
5265 return *string1
- *string2
;
5270 /* Compare STRING1 to STRING2, with results as for strcmp.
5271 Compatible with strcmp_iw_ordered in that...
5273 strcmp_iw_ordered (STRING1, STRING2) <= 0
5277 compare_names (STRING1, STRING2) <= 0
5279 (they may differ as to what symbols compare equal). */
5282 compare_names (const char *string1
, const char *string2
)
5286 /* Similar to what strcmp_iw_ordered does, we need to perform
5287 a case-insensitive comparison first, and only resort to
5288 a second, case-sensitive, comparison if the first one was
5289 not sufficient to differentiate the two strings. */
5291 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5293 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5298 /* Add to OBSTACKP all non-local symbols whose name and domain match
5299 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5300 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5303 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5304 domain_enum domain
, int global
,
5307 struct objfile
*objfile
;
5308 struct match_data data
;
5310 memset (&data
, 0, sizeof data
);
5311 data
.obstackp
= obstackp
;
5313 ALL_OBJFILES (objfile
)
5315 data
.objfile
= objfile
;
5318 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5319 aux_add_nonlocal_symbols
, &data
,
5322 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5323 aux_add_nonlocal_symbols
, &data
,
5324 full_match
, compare_names
);
5327 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5329 ALL_OBJFILES (objfile
)
5331 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
5332 strcpy (name1
, "_ada_");
5333 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5334 data
.objfile
= objfile
;
5335 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
, domain
,
5337 aux_add_nonlocal_symbols
,
5339 full_match
, compare_names
);
5344 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and, if full_search is
5345 non-zero, enclosing scope and in global scopes, returning the number of
5347 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5348 indicating the symbols found and the blocks and symbol tables (if
5349 any) in which they were found. This vector is transient---good only to
5350 the next call of ada_lookup_symbol_list.
5352 When full_search is non-zero, any non-function/non-enumeral
5353 symbol match within the nest of blocks whose innermost member is BLOCK0,
5354 is the one match returned (no other matches in that or
5355 enclosing blocks is returned). If there are any matches in or
5356 surrounding BLOCK0, then these alone are returned.
5358 Names prefixed with "standard__" are handled specially: "standard__"
5359 is first stripped off, and only static and global symbols are searched. */
5362 ada_lookup_symbol_list_worker (const char *name0
, const struct block
*block0
,
5363 domain_enum
namespace,
5364 struct ada_symbol_info
**results
,
5368 const struct block
*block
;
5370 const int wild_match_p
= should_use_wild_match (name0
);
5374 obstack_free (&symbol_list_obstack
, NULL
);
5375 obstack_init (&symbol_list_obstack
);
5379 /* Search specified block and its superiors. */
5384 /* Special case: If the user specifies a symbol name inside package
5385 Standard, do a non-wild matching of the symbol name without
5386 the "standard__" prefix. This was primarily introduced in order
5387 to allow the user to specifically access the standard exceptions
5388 using, for instance, Standard.Constraint_Error when Constraint_Error
5389 is ambiguous (due to the user defining its own Constraint_Error
5390 entity inside its program). */
5391 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
5394 name
= name0
+ sizeof ("standard__") - 1;
5397 /* Check the non-global symbols. If we have ANY match, then we're done. */
5403 ada_add_local_symbols (&symbol_list_obstack
, name
, block
,
5404 namespace, wild_match_p
);
5408 /* In the !full_search case we're are being called by
5409 ada_iterate_over_symbols, and we don't want to search
5411 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
5412 namespace, NULL
, wild_match_p
);
5414 if (num_defns_collected (&symbol_list_obstack
) > 0 || !full_search
)
5418 /* No non-global symbols found. Check our cache to see if we have
5419 already performed this search before. If we have, then return
5423 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
5426 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5430 /* Search symbols from all global blocks. */
5432 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 1,
5435 /* Now add symbols from all per-file blocks if we've gotten no hits
5436 (not strictly correct, but perhaps better than an error). */
5438 if (num_defns_collected (&symbol_list_obstack
) == 0)
5439 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 0,
5443 ndefns
= num_defns_collected (&symbol_list_obstack
);
5444 *results
= defns_collected (&symbol_list_obstack
, 1);
5446 ndefns
= remove_extra_symbols (*results
, ndefns
);
5448 if (ndefns
== 0 && full_search
)
5449 cache_symbol (name0
, namespace, NULL
, NULL
);
5451 if (ndefns
== 1 && full_search
&& cacheIfUnique
)
5452 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
5454 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5459 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5460 in global scopes, returning the number of matches, and setting *RESULTS
5461 to a vector of (SYM,BLOCK) tuples.
5462 See ada_lookup_symbol_list_worker for further details. */
5465 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5466 domain_enum domain
, struct ada_symbol_info
**results
)
5468 return ada_lookup_symbol_list_worker (name0
, block0
, domain
, results
, 1);
5471 /* Implementation of the la_iterate_over_symbols method. */
5474 ada_iterate_over_symbols (const struct block
*block
,
5475 const char *name
, domain_enum domain
,
5476 symbol_found_callback_ftype
*callback
,
5480 struct ada_symbol_info
*results
;
5482 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5483 for (i
= 0; i
< ndefs
; ++i
)
5485 if (! (*callback
) (results
[i
].sym
, data
))
5490 /* If NAME is the name of an entity, return a string that should
5491 be used to look that entity up in Ada units. This string should
5492 be deallocated after use using xfree.
5494 NAME can have any form that the "break" or "print" commands might
5495 recognize. In other words, it does not have to be the "natural"
5496 name, or the "encoded" name. */
5499 ada_name_for_lookup (const char *name
)
5502 int nlen
= strlen (name
);
5504 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5506 canon
= xmalloc (nlen
- 1);
5507 memcpy (canon
, name
+ 1, nlen
- 2);
5508 canon
[nlen
- 2] = '\0';
5511 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5515 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5516 to 1, but choosing the first symbol found if there are multiple
5519 The result is stored in *INFO, which must be non-NULL.
5520 If no match is found, INFO->SYM is set to NULL. */
5523 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5524 domain_enum
namespace,
5525 struct ada_symbol_info
*info
)
5527 struct ada_symbol_info
*candidates
;
5530 gdb_assert (info
!= NULL
);
5531 memset (info
, 0, sizeof (struct ada_symbol_info
));
5533 n_candidates
= ada_lookup_symbol_list (name
, block
, namespace, &candidates
);
5534 if (n_candidates
== 0)
5537 *info
= candidates
[0];
5538 info
->sym
= fixup_symbol_section (info
->sym
, NULL
);
5541 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5542 scope and in global scopes, or NULL if none. NAME is folded and
5543 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5544 choosing the first symbol if there are multiple choices.
5545 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5548 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5549 domain_enum
namespace, int *is_a_field_of_this
)
5551 struct ada_symbol_info info
;
5553 if (is_a_field_of_this
!= NULL
)
5554 *is_a_field_of_this
= 0;
5556 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5557 block0
, namespace, &info
);
5561 static struct symbol
*
5562 ada_lookup_symbol_nonlocal (const char *name
,
5563 const struct block
*block
,
5564 const domain_enum domain
)
5566 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5570 /* True iff STR is a possible encoded suffix of a normal Ada name
5571 that is to be ignored for matching purposes. Suffixes of parallel
5572 names (e.g., XVE) are not included here. Currently, the possible suffixes
5573 are given by any of the regular expressions:
5575 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5576 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5577 TKB [subprogram suffix for task bodies]
5578 _E[0-9]+[bs]$ [protected object entry suffixes]
5579 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5581 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5582 match is performed. This sequence is used to differentiate homonyms,
5583 is an optional part of a valid name suffix. */
5586 is_name_suffix (const char *str
)
5589 const char *matching
;
5590 const int len
= strlen (str
);
5592 /* Skip optional leading __[0-9]+. */
5594 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5597 while (isdigit (str
[0]))
5603 if (str
[0] == '.' || str
[0] == '$')
5606 while (isdigit (matching
[0]))
5608 if (matching
[0] == '\0')
5614 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5617 while (isdigit (matching
[0]))
5619 if (matching
[0] == '\0')
5623 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5625 if (strcmp (str
, "TKB") == 0)
5629 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5630 with a N at the end. Unfortunately, the compiler uses the same
5631 convention for other internal types it creates. So treating
5632 all entity names that end with an "N" as a name suffix causes
5633 some regressions. For instance, consider the case of an enumerated
5634 type. To support the 'Image attribute, it creates an array whose
5636 Having a single character like this as a suffix carrying some
5637 information is a bit risky. Perhaps we should change the encoding
5638 to be something like "_N" instead. In the meantime, do not do
5639 the following check. */
5640 /* Protected Object Subprograms */
5641 if (len
== 1 && str
[0] == 'N')
5646 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5649 while (isdigit (matching
[0]))
5651 if ((matching
[0] == 'b' || matching
[0] == 's')
5652 && matching
[1] == '\0')
5656 /* ??? We should not modify STR directly, as we are doing below. This
5657 is fine in this case, but may become problematic later if we find
5658 that this alternative did not work, and want to try matching
5659 another one from the begining of STR. Since we modified it, we
5660 won't be able to find the begining of the string anymore! */
5664 while (str
[0] != '_' && str
[0] != '\0')
5666 if (str
[0] != 'n' && str
[0] != 'b')
5672 if (str
[0] == '\000')
5677 if (str
[1] != '_' || str
[2] == '\000')
5681 if (strcmp (str
+ 3, "JM") == 0)
5683 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5684 the LJM suffix in favor of the JM one. But we will
5685 still accept LJM as a valid suffix for a reasonable
5686 amount of time, just to allow ourselves to debug programs
5687 compiled using an older version of GNAT. */
5688 if (strcmp (str
+ 3, "LJM") == 0)
5692 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5693 || str
[4] == 'U' || str
[4] == 'P')
5695 if (str
[4] == 'R' && str
[5] != 'T')
5699 if (!isdigit (str
[2]))
5701 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5702 if (!isdigit (str
[k
]) && str
[k
] != '_')
5706 if (str
[0] == '$' && isdigit (str
[1]))
5708 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5709 if (!isdigit (str
[k
]) && str
[k
] != '_')
5716 /* Return non-zero if the string starting at NAME and ending before
5717 NAME_END contains no capital letters. */
5720 is_valid_name_for_wild_match (const char *name0
)
5722 const char *decoded_name
= ada_decode (name0
);
5725 /* If the decoded name starts with an angle bracket, it means that
5726 NAME0 does not follow the GNAT encoding format. It should then
5727 not be allowed as a possible wild match. */
5728 if (decoded_name
[0] == '<')
5731 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5732 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5738 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5739 that could start a simple name. Assumes that *NAMEP points into
5740 the string beginning at NAME0. */
5743 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5745 const char *name
= *namep
;
5755 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5758 if (name
== name0
+ 5 && strncmp (name0
, "_ada", 4) == 0)
5763 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5764 || name
[2] == target0
))
5772 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5782 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5783 informational suffixes of NAME (i.e., for which is_name_suffix is
5784 true). Assumes that PATN is a lower-cased Ada simple name. */
5787 wild_match (const char *name
, const char *patn
)
5790 const char *name0
= name
;
5794 const char *match
= name
;
5798 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5801 if (*p
== '\0' && is_name_suffix (name
))
5802 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5804 if (name
[-1] == '_')
5807 if (!advance_wild_match (&name
, name0
, *patn
))
5812 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5813 informational suffix. */
5816 full_match (const char *sym_name
, const char *search_name
)
5818 return !match_name (sym_name
, search_name
, 0);
5822 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5823 vector *defn_symbols, updating the list of symbols in OBSTACKP
5824 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5825 OBJFILE is the section containing BLOCK. */
5828 ada_add_block_symbols (struct obstack
*obstackp
,
5829 const struct block
*block
, const char *name
,
5830 domain_enum domain
, struct objfile
*objfile
,
5833 struct block_iterator iter
;
5834 int name_len
= strlen (name
);
5835 /* A matching argument symbol, if any. */
5836 struct symbol
*arg_sym
;
5837 /* Set true when we find a matching non-argument symbol. */
5845 for (sym
= block_iter_match_first (block
, name
, wild_match
, &iter
);
5846 sym
!= NULL
; sym
= block_iter_match_next (name
, wild_match
, &iter
))
5848 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5849 SYMBOL_DOMAIN (sym
), domain
)
5850 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5852 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5854 else if (SYMBOL_IS_ARGUMENT (sym
))
5859 add_defn_to_vec (obstackp
,
5860 fixup_symbol_section (sym
, objfile
),
5868 for (sym
= block_iter_match_first (block
, name
, full_match
, &iter
);
5869 sym
!= NULL
; sym
= block_iter_match_next (name
, full_match
, &iter
))
5871 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5872 SYMBOL_DOMAIN (sym
), domain
))
5874 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5876 if (SYMBOL_IS_ARGUMENT (sym
))
5881 add_defn_to_vec (obstackp
,
5882 fixup_symbol_section (sym
, objfile
),
5890 if (!found_sym
&& arg_sym
!= NULL
)
5892 add_defn_to_vec (obstackp
,
5893 fixup_symbol_section (arg_sym
, objfile
),
5902 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5904 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5905 SYMBOL_DOMAIN (sym
), domain
))
5909 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5912 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5914 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5919 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5921 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5923 if (SYMBOL_IS_ARGUMENT (sym
))
5928 add_defn_to_vec (obstackp
,
5929 fixup_symbol_section (sym
, objfile
),
5937 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5938 They aren't parameters, right? */
5939 if (!found_sym
&& arg_sym
!= NULL
)
5941 add_defn_to_vec (obstackp
,
5942 fixup_symbol_section (arg_sym
, objfile
),
5949 /* Symbol Completion */
5951 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5952 name in a form that's appropriate for the completion. The result
5953 does not need to be deallocated, but is only good until the next call.
5955 TEXT_LEN is equal to the length of TEXT.
5956 Perform a wild match if WILD_MATCH_P is set.
5957 ENCODED_P should be set if TEXT represents the start of a symbol name
5958 in its encoded form. */
5961 symbol_completion_match (const char *sym_name
,
5962 const char *text
, int text_len
,
5963 int wild_match_p
, int encoded_p
)
5965 const int verbatim_match
= (text
[0] == '<');
5970 /* Strip the leading angle bracket. */
5975 /* First, test against the fully qualified name of the symbol. */
5977 if (strncmp (sym_name
, text
, text_len
) == 0)
5980 if (match
&& !encoded_p
)
5982 /* One needed check before declaring a positive match is to verify
5983 that iff we are doing a verbatim match, the decoded version
5984 of the symbol name starts with '<'. Otherwise, this symbol name
5985 is not a suitable completion. */
5986 const char *sym_name_copy
= sym_name
;
5987 int has_angle_bracket
;
5989 sym_name
= ada_decode (sym_name
);
5990 has_angle_bracket
= (sym_name
[0] == '<');
5991 match
= (has_angle_bracket
== verbatim_match
);
5992 sym_name
= sym_name_copy
;
5995 if (match
&& !verbatim_match
)
5997 /* When doing non-verbatim match, another check that needs to
5998 be done is to verify that the potentially matching symbol name
5999 does not include capital letters, because the ada-mode would
6000 not be able to understand these symbol names without the
6001 angle bracket notation. */
6004 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6009 /* Second: Try wild matching... */
6011 if (!match
&& wild_match_p
)
6013 /* Since we are doing wild matching, this means that TEXT
6014 may represent an unqualified symbol name. We therefore must
6015 also compare TEXT against the unqualified name of the symbol. */
6016 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6018 if (strncmp (sym_name
, text
, text_len
) == 0)
6022 /* Finally: If we found a mach, prepare the result to return. */
6028 sym_name
= add_angle_brackets (sym_name
);
6031 sym_name
= ada_decode (sym_name
);
6036 /* A companion function to ada_make_symbol_completion_list().
6037 Check if SYM_NAME represents a symbol which name would be suitable
6038 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
6039 it is appended at the end of the given string vector SV.
6041 ORIG_TEXT is the string original string from the user command
6042 that needs to be completed. WORD is the entire command on which
6043 completion should be performed. These two parameters are used to
6044 determine which part of the symbol name should be added to the
6046 if WILD_MATCH_P is set, then wild matching is performed.
6047 ENCODED_P should be set if TEXT represents a symbol name in its
6048 encoded formed (in which case the completion should also be
6052 symbol_completion_add (VEC(char_ptr
) **sv
,
6053 const char *sym_name
,
6054 const char *text
, int text_len
,
6055 const char *orig_text
, const char *word
,
6056 int wild_match_p
, int encoded_p
)
6058 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
6059 wild_match_p
, encoded_p
);
6065 /* We found a match, so add the appropriate completion to the given
6068 if (word
== orig_text
)
6070 completion
= xmalloc (strlen (match
) + 5);
6071 strcpy (completion
, match
);
6073 else if (word
> orig_text
)
6075 /* Return some portion of sym_name. */
6076 completion
= xmalloc (strlen (match
) + 5);
6077 strcpy (completion
, match
+ (word
- orig_text
));
6081 /* Return some of ORIG_TEXT plus sym_name. */
6082 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
6083 strncpy (completion
, word
, orig_text
- word
);
6084 completion
[orig_text
- word
] = '\0';
6085 strcat (completion
, match
);
6088 VEC_safe_push (char_ptr
, *sv
, completion
);
6091 /* An object of this type is passed as the user_data argument to the
6092 expand_symtabs_matching method. */
6093 struct add_partial_datum
6095 VEC(char_ptr
) **completions
;
6104 /* A callback for expand_symtabs_matching. */
6107 ada_complete_symbol_matcher (const char *name
, void *user_data
)
6109 struct add_partial_datum
*data
= user_data
;
6111 return symbol_completion_match (name
, data
->text
, data
->text_len
,
6112 data
->wild_match
, data
->encoded
) != NULL
;
6115 /* Return a list of possible symbol names completing TEXT0. WORD is
6116 the entire command on which completion is made. */
6118 static VEC (char_ptr
) *
6119 ada_make_symbol_completion_list (const char *text0
, const char *word
,
6120 enum type_code code
)
6126 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
6129 struct minimal_symbol
*msymbol
;
6130 struct objfile
*objfile
;
6131 const struct block
*b
, *surrounding_static_block
= 0;
6133 struct block_iterator iter
;
6134 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6136 gdb_assert (code
== TYPE_CODE_UNDEF
);
6138 if (text0
[0] == '<')
6140 text
= xstrdup (text0
);
6141 make_cleanup (xfree
, text
);
6142 text_len
= strlen (text
);
6148 text
= xstrdup (ada_encode (text0
));
6149 make_cleanup (xfree
, text
);
6150 text_len
= strlen (text
);
6151 for (i
= 0; i
< text_len
; i
++)
6152 text
[i
] = tolower (text
[i
]);
6154 encoded_p
= (strstr (text0
, "__") != NULL
);
6155 /* If the name contains a ".", then the user is entering a fully
6156 qualified entity name, and the match must not be done in wild
6157 mode. Similarly, if the user wants to complete what looks like
6158 an encoded name, the match must not be done in wild mode. */
6159 wild_match_p
= (strchr (text0
, '.') == NULL
&& !encoded_p
);
6162 /* First, look at the partial symtab symbols. */
6164 struct add_partial_datum data
;
6166 data
.completions
= &completions
;
6168 data
.text_len
= text_len
;
6171 data
.wild_match
= wild_match_p
;
6172 data
.encoded
= encoded_p
;
6173 expand_symtabs_matching (NULL
, ada_complete_symbol_matcher
, ALL_DOMAIN
,
6177 /* At this point scan through the misc symbol vectors and add each
6178 symbol you find to the list. Eventually we want to ignore
6179 anything that isn't a text symbol (everything else will be
6180 handled by the psymtab code above). */
6182 ALL_MSYMBOLS (objfile
, msymbol
)
6185 symbol_completion_add (&completions
, MSYMBOL_LINKAGE_NAME (msymbol
),
6186 text
, text_len
, text0
, word
, wild_match_p
,
6190 /* Search upwards from currently selected frame (so that we can
6191 complete on local vars. */
6193 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6195 if (!BLOCK_SUPERBLOCK (b
))
6196 surrounding_static_block
= b
; /* For elmin of dups */
6198 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6200 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6201 text
, text_len
, text0
, word
,
6202 wild_match_p
, encoded_p
);
6206 /* Go through the symtabs and check the externs and statics for
6207 symbols which match. */
6209 ALL_SYMTABS (objfile
, s
)
6212 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6213 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6215 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6216 text
, text_len
, text0
, word
,
6217 wild_match_p
, encoded_p
);
6221 ALL_SYMTABS (objfile
, s
)
6224 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
6225 /* Don't do this block twice. */
6226 if (b
== surrounding_static_block
)
6228 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6230 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6231 text
, text_len
, text0
, word
,
6232 wild_match_p
, encoded_p
);
6236 do_cleanups (old_chain
);
6242 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6243 for tagged types. */
6246 ada_is_dispatch_table_ptr_type (struct type
*type
)
6250 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6253 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6257 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6260 /* Return non-zero if TYPE is an interface tag. */
6263 ada_is_interface_tag (struct type
*type
)
6265 const char *name
= TYPE_NAME (type
);
6270 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6273 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6274 to be invisible to users. */
6277 ada_is_ignored_field (struct type
*type
, int field_num
)
6279 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6282 /* Check the name of that field. */
6284 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6286 /* Anonymous field names should not be printed.
6287 brobecker/2007-02-20: I don't think this can actually happen
6288 but we don't want to print the value of annonymous fields anyway. */
6292 /* Normally, fields whose name start with an underscore ("_")
6293 are fields that have been internally generated by the compiler,
6294 and thus should not be printed. The "_parent" field is special,
6295 however: This is a field internally generated by the compiler
6296 for tagged types, and it contains the components inherited from
6297 the parent type. This field should not be printed as is, but
6298 should not be ignored either. */
6299 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
6303 /* If this is the dispatch table of a tagged type or an interface tag,
6305 if (ada_is_tagged_type (type
, 1)
6306 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6307 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6310 /* Not a special field, so it should not be ignored. */
6314 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6315 pointer or reference type whose ultimate target has a tag field. */
6318 ada_is_tagged_type (struct type
*type
, int refok
)
6320 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
6323 /* True iff TYPE represents the type of X'Tag */
6326 ada_is_tag_type (struct type
*type
)
6328 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6332 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6334 return (name
!= NULL
6335 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6339 /* The type of the tag on VAL. */
6342 ada_tag_type (struct value
*val
)
6344 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6347 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6348 retired at Ada 05). */
6351 is_ada95_tag (struct value
*tag
)
6353 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6356 /* The value of the tag on VAL. */
6359 ada_value_tag (struct value
*val
)
6361 return ada_value_struct_elt (val
, "_tag", 0);
6364 /* The value of the tag on the object of type TYPE whose contents are
6365 saved at VALADDR, if it is non-null, or is at memory address
6368 static struct value
*
6369 value_tag_from_contents_and_address (struct type
*type
,
6370 const gdb_byte
*valaddr
,
6373 int tag_byte_offset
;
6374 struct type
*tag_type
;
6376 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6379 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6381 : valaddr
+ tag_byte_offset
);
6382 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6384 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6389 static struct type
*
6390 type_from_tag (struct value
*tag
)
6392 const char *type_name
= ada_tag_name (tag
);
6394 if (type_name
!= NULL
)
6395 return ada_find_any_type (ada_encode (type_name
));
6399 /* Given a value OBJ of a tagged type, return a value of this
6400 type at the base address of the object. The base address, as
6401 defined in Ada.Tags, it is the address of the primary tag of
6402 the object, and therefore where the field values of its full
6403 view can be fetched. */
6406 ada_tag_value_at_base_address (struct value
*obj
)
6408 volatile struct gdb_exception e
;
6410 LONGEST offset_to_top
= 0;
6411 struct type
*ptr_type
, *obj_type
;
6413 CORE_ADDR base_address
;
6415 obj_type
= value_type (obj
);
6417 /* It is the responsability of the caller to deref pointers. */
6419 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6420 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6423 tag
= ada_value_tag (obj
);
6427 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6429 if (is_ada95_tag (tag
))
6432 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6433 ptr_type
= lookup_pointer_type (ptr_type
);
6434 val
= value_cast (ptr_type
, tag
);
6438 /* It is perfectly possible that an exception be raised while
6439 trying to determine the base address, just like for the tag;
6440 see ada_tag_name for more details. We do not print the error
6441 message for the same reason. */
6443 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6445 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6451 /* If offset is null, nothing to do. */
6453 if (offset_to_top
== 0)
6456 /* -1 is a special case in Ada.Tags; however, what should be done
6457 is not quite clear from the documentation. So do nothing for
6460 if (offset_to_top
== -1)
6463 base_address
= value_address (obj
) - offset_to_top
;
6464 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6466 /* Make sure that we have a proper tag at the new address.
6467 Otherwise, offset_to_top is bogus (which can happen when
6468 the object is not initialized yet). */
6473 obj_type
= type_from_tag (tag
);
6478 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6481 /* Return the "ada__tags__type_specific_data" type. */
6483 static struct type
*
6484 ada_get_tsd_type (struct inferior
*inf
)
6486 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6488 if (data
->tsd_type
== 0)
6489 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6490 return data
->tsd_type
;
6493 /* Return the TSD (type-specific data) associated to the given TAG.
6494 TAG is assumed to be the tag of a tagged-type entity.
6496 May return NULL if we are unable to get the TSD. */
6498 static struct value
*
6499 ada_get_tsd_from_tag (struct value
*tag
)
6504 /* First option: The TSD is simply stored as a field of our TAG.
6505 Only older versions of GNAT would use this format, but we have
6506 to test it first, because there are no visible markers for
6507 the current approach except the absence of that field. */
6509 val
= ada_value_struct_elt (tag
, "tsd", 1);
6513 /* Try the second representation for the dispatch table (in which
6514 there is no explicit 'tsd' field in the referent of the tag pointer,
6515 and instead the tsd pointer is stored just before the dispatch
6518 type
= ada_get_tsd_type (current_inferior());
6521 type
= lookup_pointer_type (lookup_pointer_type (type
));
6522 val
= value_cast (type
, tag
);
6525 return value_ind (value_ptradd (val
, -1));
6528 /* Given the TSD of a tag (type-specific data), return a string
6529 containing the name of the associated type.
6531 The returned value is good until the next call. May return NULL
6532 if we are unable to determine the tag name. */
6535 ada_tag_name_from_tsd (struct value
*tsd
)
6537 static char name
[1024];
6541 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6544 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6545 for (p
= name
; *p
!= '\0'; p
+= 1)
6551 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6554 Return NULL if the TAG is not an Ada tag, or if we were unable to
6555 determine the name of that tag. The result is good until the next
6559 ada_tag_name (struct value
*tag
)
6561 volatile struct gdb_exception e
;
6564 if (!ada_is_tag_type (value_type (tag
)))
6567 /* It is perfectly possible that an exception be raised while trying
6568 to determine the TAG's name, even under normal circumstances:
6569 The associated variable may be uninitialized or corrupted, for
6570 instance. We do not let any exception propagate past this point.
6571 instead we return NULL.
6573 We also do not print the error message either (which often is very
6574 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6575 the caller print a more meaningful message if necessary. */
6576 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6578 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6581 name
= ada_tag_name_from_tsd (tsd
);
6587 /* The parent type of TYPE, or NULL if none. */
6590 ada_parent_type (struct type
*type
)
6594 type
= ada_check_typedef (type
);
6596 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6599 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6600 if (ada_is_parent_field (type
, i
))
6602 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6604 /* If the _parent field is a pointer, then dereference it. */
6605 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6606 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6607 /* If there is a parallel XVS type, get the actual base type. */
6608 parent_type
= ada_get_base_type (parent_type
);
6610 return ada_check_typedef (parent_type
);
6616 /* True iff field number FIELD_NUM of structure type TYPE contains the
6617 parent-type (inherited) fields of a derived type. Assumes TYPE is
6618 a structure type with at least FIELD_NUM+1 fields. */
6621 ada_is_parent_field (struct type
*type
, int field_num
)
6623 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6625 return (name
!= NULL
6626 && (strncmp (name
, "PARENT", 6) == 0
6627 || strncmp (name
, "_parent", 7) == 0));
6630 /* True iff field number FIELD_NUM of structure type TYPE is a
6631 transparent wrapper field (which should be silently traversed when doing
6632 field selection and flattened when printing). Assumes TYPE is a
6633 structure type with at least FIELD_NUM+1 fields. Such fields are always
6637 ada_is_wrapper_field (struct type
*type
, int field_num
)
6639 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6641 return (name
!= NULL
6642 && (strncmp (name
, "PARENT", 6) == 0
6643 || strcmp (name
, "REP") == 0
6644 || strncmp (name
, "_parent", 7) == 0
6645 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6648 /* True iff field number FIELD_NUM of structure or union type TYPE
6649 is a variant wrapper. Assumes TYPE is a structure type with at least
6650 FIELD_NUM+1 fields. */
6653 ada_is_variant_part (struct type
*type
, int field_num
)
6655 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6657 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6658 || (is_dynamic_field (type
, field_num
)
6659 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6660 == TYPE_CODE_UNION
)));
6663 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6664 whose discriminants are contained in the record type OUTER_TYPE,
6665 returns the type of the controlling discriminant for the variant.
6666 May return NULL if the type could not be found. */
6669 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6671 char *name
= ada_variant_discrim_name (var_type
);
6673 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6676 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6677 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6678 represents a 'when others' clause; otherwise 0. */
6681 ada_is_others_clause (struct type
*type
, int field_num
)
6683 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6685 return (name
!= NULL
&& name
[0] == 'O');
6688 /* Assuming that TYPE0 is the type of the variant part of a record,
6689 returns the name of the discriminant controlling the variant.
6690 The value is valid until the next call to ada_variant_discrim_name. */
6693 ada_variant_discrim_name (struct type
*type0
)
6695 static char *result
= NULL
;
6696 static size_t result_len
= 0;
6699 const char *discrim_end
;
6700 const char *discrim_start
;
6702 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6703 type
= TYPE_TARGET_TYPE (type0
);
6707 name
= ada_type_name (type
);
6709 if (name
== NULL
|| name
[0] == '\000')
6712 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6715 if (strncmp (discrim_end
, "___XVN", 6) == 0)
6718 if (discrim_end
== name
)
6721 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6724 if (discrim_start
== name
+ 1)
6726 if ((discrim_start
> name
+ 3
6727 && strncmp (discrim_start
- 3, "___", 3) == 0)
6728 || discrim_start
[-1] == '.')
6732 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6733 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6734 result
[discrim_end
- discrim_start
] = '\0';
6738 /* Scan STR for a subtype-encoded number, beginning at position K.
6739 Put the position of the character just past the number scanned in
6740 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6741 Return 1 if there was a valid number at the given position, and 0
6742 otherwise. A "subtype-encoded" number consists of the absolute value
6743 in decimal, followed by the letter 'm' to indicate a negative number.
6744 Assumes 0m does not occur. */
6747 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6751 if (!isdigit (str
[k
]))
6754 /* Do it the hard way so as not to make any assumption about
6755 the relationship of unsigned long (%lu scan format code) and
6758 while (isdigit (str
[k
]))
6760 RU
= RU
* 10 + (str
[k
] - '0');
6767 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6773 /* NOTE on the above: Technically, C does not say what the results of
6774 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6775 number representable as a LONGEST (although either would probably work
6776 in most implementations). When RU>0, the locution in the then branch
6777 above is always equivalent to the negative of RU. */
6784 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6785 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6786 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6789 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6791 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6805 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6815 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6816 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6818 if (val
>= L
&& val
<= U
)
6830 /* FIXME: Lots of redundancy below. Try to consolidate. */
6832 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6833 ARG_TYPE, extract and return the value of one of its (non-static)
6834 fields. FIELDNO says which field. Differs from value_primitive_field
6835 only in that it can handle packed values of arbitrary type. */
6837 static struct value
*
6838 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6839 struct type
*arg_type
)
6843 arg_type
= ada_check_typedef (arg_type
);
6844 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6846 /* Handle packed fields. */
6848 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6850 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6851 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6853 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6854 offset
+ bit_pos
/ 8,
6855 bit_pos
% 8, bit_size
, type
);
6858 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6861 /* Find field with name NAME in object of type TYPE. If found,
6862 set the following for each argument that is non-null:
6863 - *FIELD_TYPE_P to the field's type;
6864 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6865 an object of that type;
6866 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6867 - *BIT_SIZE_P to its size in bits if the field is packed, and
6869 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6870 fields up to but not including the desired field, or by the total
6871 number of fields if not found. A NULL value of NAME never
6872 matches; the function just counts visible fields in this case.
6874 Returns 1 if found, 0 otherwise. */
6877 find_struct_field (const char *name
, struct type
*type
, int offset
,
6878 struct type
**field_type_p
,
6879 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6884 type
= ada_check_typedef (type
);
6886 if (field_type_p
!= NULL
)
6887 *field_type_p
= NULL
;
6888 if (byte_offset_p
!= NULL
)
6890 if (bit_offset_p
!= NULL
)
6892 if (bit_size_p
!= NULL
)
6895 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6897 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6898 int fld_offset
= offset
+ bit_pos
/ 8;
6899 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6901 if (t_field_name
== NULL
)
6904 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6906 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6908 if (field_type_p
!= NULL
)
6909 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6910 if (byte_offset_p
!= NULL
)
6911 *byte_offset_p
= fld_offset
;
6912 if (bit_offset_p
!= NULL
)
6913 *bit_offset_p
= bit_pos
% 8;
6914 if (bit_size_p
!= NULL
)
6915 *bit_size_p
= bit_size
;
6918 else if (ada_is_wrapper_field (type
, i
))
6920 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6921 field_type_p
, byte_offset_p
, bit_offset_p
,
6922 bit_size_p
, index_p
))
6925 else if (ada_is_variant_part (type
, i
))
6927 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6930 struct type
*field_type
6931 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6933 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6935 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6937 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6938 field_type_p
, byte_offset_p
,
6939 bit_offset_p
, bit_size_p
, index_p
))
6943 else if (index_p
!= NULL
)
6949 /* Number of user-visible fields in record type TYPE. */
6952 num_visible_fields (struct type
*type
)
6957 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6961 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6962 and search in it assuming it has (class) type TYPE.
6963 If found, return value, else return NULL.
6965 Searches recursively through wrapper fields (e.g., '_parent'). */
6967 static struct value
*
6968 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6973 type
= ada_check_typedef (type
);
6974 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6976 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6978 if (t_field_name
== NULL
)
6981 else if (field_name_match (t_field_name
, name
))
6982 return ada_value_primitive_field (arg
, offset
, i
, type
);
6984 else if (ada_is_wrapper_field (type
, i
))
6986 struct value
*v
= /* Do not let indent join lines here. */
6987 ada_search_struct_field (name
, arg
,
6988 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6989 TYPE_FIELD_TYPE (type
, i
));
6995 else if (ada_is_variant_part (type
, i
))
6997 /* PNH: Do we ever get here? See find_struct_field. */
6999 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7001 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7003 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7005 struct value
*v
= ada_search_struct_field
/* Force line
7008 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7009 TYPE_FIELD_TYPE (field_type
, j
));
7019 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7020 int, struct type
*);
7023 /* Return field #INDEX in ARG, where the index is that returned by
7024 * find_struct_field through its INDEX_P argument. Adjust the address
7025 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7026 * If found, return value, else return NULL. */
7028 static struct value
*
7029 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7032 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7036 /* Auxiliary function for ada_index_struct_field. Like
7037 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7040 static struct value
*
7041 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7045 type
= ada_check_typedef (type
);
7047 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7049 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7051 else if (ada_is_wrapper_field (type
, i
))
7053 struct value
*v
= /* Do not let indent join lines here. */
7054 ada_index_struct_field_1 (index_p
, arg
,
7055 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7056 TYPE_FIELD_TYPE (type
, i
));
7062 else if (ada_is_variant_part (type
, i
))
7064 /* PNH: Do we ever get here? See ada_search_struct_field,
7065 find_struct_field. */
7066 error (_("Cannot assign this kind of variant record"));
7068 else if (*index_p
== 0)
7069 return ada_value_primitive_field (arg
, offset
, i
, type
);
7076 /* Given ARG, a value of type (pointer or reference to a)*
7077 structure/union, extract the component named NAME from the ultimate
7078 target structure/union and return it as a value with its
7081 The routine searches for NAME among all members of the structure itself
7082 and (recursively) among all members of any wrapper members
7085 If NO_ERR, then simply return NULL in case of error, rather than
7089 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
7091 struct type
*t
, *t1
;
7095 t1
= t
= ada_check_typedef (value_type (arg
));
7096 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7098 t1
= TYPE_TARGET_TYPE (t
);
7101 t1
= ada_check_typedef (t1
);
7102 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7104 arg
= coerce_ref (arg
);
7109 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7111 t1
= TYPE_TARGET_TYPE (t
);
7114 t1
= ada_check_typedef (t1
);
7115 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7117 arg
= value_ind (arg
);
7124 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7128 v
= ada_search_struct_field (name
, arg
, 0, t
);
7131 int bit_offset
, bit_size
, byte_offset
;
7132 struct type
*field_type
;
7135 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7136 address
= value_address (ada_value_ind (arg
));
7138 address
= value_address (ada_coerce_ref (arg
));
7140 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7141 if (find_struct_field (name
, t1
, 0,
7142 &field_type
, &byte_offset
, &bit_offset
,
7147 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7148 arg
= ada_coerce_ref (arg
);
7150 arg
= ada_value_ind (arg
);
7151 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7152 bit_offset
, bit_size
,
7156 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7160 if (v
!= NULL
|| no_err
)
7163 error (_("There is no member named %s."), name
);
7169 error (_("Attempt to extract a component of "
7170 "a value that is not a record."));
7173 /* Given a type TYPE, look up the type of the component of type named NAME.
7174 If DISPP is non-null, add its byte displacement from the beginning of a
7175 structure (pointed to by a value) of type TYPE to *DISPP (does not
7176 work for packed fields).
7178 Matches any field whose name has NAME as a prefix, possibly
7181 TYPE can be either a struct or union. If REFOK, TYPE may also
7182 be a (pointer or reference)+ to a struct or union, and the
7183 ultimate target type will be searched.
7185 Looks recursively into variant clauses and parent types.
7187 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7188 TYPE is not a type of the right kind. */
7190 static struct type
*
7191 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7192 int noerr
, int *dispp
)
7199 if (refok
&& type
!= NULL
)
7202 type
= ada_check_typedef (type
);
7203 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7204 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7206 type
= TYPE_TARGET_TYPE (type
);
7210 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7211 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7217 target_terminal_ours ();
7218 gdb_flush (gdb_stdout
);
7220 error (_("Type (null) is not a structure or union type"));
7223 /* XXX: type_sprint */
7224 fprintf_unfiltered (gdb_stderr
, _("Type "));
7225 type_print (type
, "", gdb_stderr
, -1);
7226 error (_(" is not a structure or union type"));
7231 type
= to_static_fixed_type (type
);
7233 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7235 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7239 if (t_field_name
== NULL
)
7242 else if (field_name_match (t_field_name
, name
))
7245 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7246 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7249 else if (ada_is_wrapper_field (type
, i
))
7252 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7257 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7262 else if (ada_is_variant_part (type
, i
))
7265 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7268 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7270 /* FIXME pnh 2008/01/26: We check for a field that is
7271 NOT wrapped in a struct, since the compiler sometimes
7272 generates these for unchecked variant types. Revisit
7273 if the compiler changes this practice. */
7274 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7276 if (v_field_name
!= NULL
7277 && field_name_match (v_field_name
, name
))
7278 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
7280 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7287 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7298 target_terminal_ours ();
7299 gdb_flush (gdb_stdout
);
7302 /* XXX: type_sprint */
7303 fprintf_unfiltered (gdb_stderr
, _("Type "));
7304 type_print (type
, "", gdb_stderr
, -1);
7305 error (_(" has no component named <null>"));
7309 /* XXX: type_sprint */
7310 fprintf_unfiltered (gdb_stderr
, _("Type "));
7311 type_print (type
, "", gdb_stderr
, -1);
7312 error (_(" has no component named %s"), name
);
7319 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7320 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7321 represents an unchecked union (that is, the variant part of a
7322 record that is named in an Unchecked_Union pragma). */
7325 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7327 char *discrim_name
= ada_variant_discrim_name (var_type
);
7329 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
7334 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7335 within a value of type OUTER_TYPE that is stored in GDB at
7336 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7337 numbering from 0) is applicable. Returns -1 if none are. */
7340 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7341 const gdb_byte
*outer_valaddr
)
7345 char *discrim_name
= ada_variant_discrim_name (var_type
);
7346 struct value
*outer
;
7347 struct value
*discrim
;
7348 LONGEST discrim_val
;
7350 /* Using plain value_from_contents_and_address here causes problems
7351 because we will end up trying to resolve a type that is currently
7352 being constructed. */
7353 outer
= value_from_contents_and_address_unresolved (outer_type
,
7355 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7356 if (discrim
== NULL
)
7358 discrim_val
= value_as_long (discrim
);
7361 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7363 if (ada_is_others_clause (var_type
, i
))
7365 else if (ada_in_variant (discrim_val
, var_type
, i
))
7369 return others_clause
;
7374 /* Dynamic-Sized Records */
7376 /* Strategy: The type ostensibly attached to a value with dynamic size
7377 (i.e., a size that is not statically recorded in the debugging
7378 data) does not accurately reflect the size or layout of the value.
7379 Our strategy is to convert these values to values with accurate,
7380 conventional types that are constructed on the fly. */
7382 /* There is a subtle and tricky problem here. In general, we cannot
7383 determine the size of dynamic records without its data. However,
7384 the 'struct value' data structure, which GDB uses to represent
7385 quantities in the inferior process (the target), requires the size
7386 of the type at the time of its allocation in order to reserve space
7387 for GDB's internal copy of the data. That's why the
7388 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7389 rather than struct value*s.
7391 However, GDB's internal history variables ($1, $2, etc.) are
7392 struct value*s containing internal copies of the data that are not, in
7393 general, the same as the data at their corresponding addresses in
7394 the target. Fortunately, the types we give to these values are all
7395 conventional, fixed-size types (as per the strategy described
7396 above), so that we don't usually have to perform the
7397 'to_fixed_xxx_type' conversions to look at their values.
7398 Unfortunately, there is one exception: if one of the internal
7399 history variables is an array whose elements are unconstrained
7400 records, then we will need to create distinct fixed types for each
7401 element selected. */
7403 /* The upshot of all of this is that many routines take a (type, host
7404 address, target address) triple as arguments to represent a value.
7405 The host address, if non-null, is supposed to contain an internal
7406 copy of the relevant data; otherwise, the program is to consult the
7407 target at the target address. */
7409 /* Assuming that VAL0 represents a pointer value, the result of
7410 dereferencing it. Differs from value_ind in its treatment of
7411 dynamic-sized types. */
7414 ada_value_ind (struct value
*val0
)
7416 struct value
*val
= value_ind (val0
);
7418 if (ada_is_tagged_type (value_type (val
), 0))
7419 val
= ada_tag_value_at_base_address (val
);
7421 return ada_to_fixed_value (val
);
7424 /* The value resulting from dereferencing any "reference to"
7425 qualifiers on VAL0. */
7427 static struct value
*
7428 ada_coerce_ref (struct value
*val0
)
7430 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7432 struct value
*val
= val0
;
7434 val
= coerce_ref (val
);
7436 if (ada_is_tagged_type (value_type (val
), 0))
7437 val
= ada_tag_value_at_base_address (val
);
7439 return ada_to_fixed_value (val
);
7445 /* Return OFF rounded upward if necessary to a multiple of
7446 ALIGNMENT (a power of 2). */
7449 align_value (unsigned int off
, unsigned int alignment
)
7451 return (off
+ alignment
- 1) & ~(alignment
- 1);
7454 /* Return the bit alignment required for field #F of template type TYPE. */
7457 field_alignment (struct type
*type
, int f
)
7459 const char *name
= TYPE_FIELD_NAME (type
, f
);
7463 /* The field name should never be null, unless the debugging information
7464 is somehow malformed. In this case, we assume the field does not
7465 require any alignment. */
7469 len
= strlen (name
);
7471 if (!isdigit (name
[len
- 1]))
7474 if (isdigit (name
[len
- 2]))
7475 align_offset
= len
- 2;
7477 align_offset
= len
- 1;
7479 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
7480 return TARGET_CHAR_BIT
;
7482 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7485 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7487 static struct symbol
*
7488 ada_find_any_type_symbol (const char *name
)
7492 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7493 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7496 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7500 /* Find a type named NAME. Ignores ambiguity. This routine will look
7501 solely for types defined by debug info, it will not search the GDB
7504 static struct type
*
7505 ada_find_any_type (const char *name
)
7507 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7510 return SYMBOL_TYPE (sym
);
7515 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7516 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7517 symbol, in which case it is returned. Otherwise, this looks for
7518 symbols whose name is that of NAME_SYM suffixed with "___XR".
7519 Return symbol if found, and NULL otherwise. */
7522 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7524 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7527 if (strstr (name
, "___XR") != NULL
)
7530 sym
= find_old_style_renaming_symbol (name
, block
);
7535 /* Not right yet. FIXME pnh 7/20/2007. */
7536 sym
= ada_find_any_type_symbol (name
);
7537 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7543 static struct symbol
*
7544 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7546 const struct symbol
*function_sym
= block_linkage_function (block
);
7549 if (function_sym
!= NULL
)
7551 /* If the symbol is defined inside a function, NAME is not fully
7552 qualified. This means we need to prepend the function name
7553 as well as adding the ``___XR'' suffix to build the name of
7554 the associated renaming symbol. */
7555 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7556 /* Function names sometimes contain suffixes used
7557 for instance to qualify nested subprograms. When building
7558 the XR type name, we need to make sure that this suffix is
7559 not included. So do not include any suffix in the function
7560 name length below. */
7561 int function_name_len
= ada_name_prefix_len (function_name
);
7562 const int rename_len
= function_name_len
+ 2 /* "__" */
7563 + strlen (name
) + 6 /* "___XR\0" */ ;
7565 /* Strip the suffix if necessary. */
7566 ada_remove_trailing_digits (function_name
, &function_name_len
);
7567 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7568 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7570 /* Library-level functions are a special case, as GNAT adds
7571 a ``_ada_'' prefix to the function name to avoid namespace
7572 pollution. However, the renaming symbols themselves do not
7573 have this prefix, so we need to skip this prefix if present. */
7574 if (function_name_len
> 5 /* "_ada_" */
7575 && strstr (function_name
, "_ada_") == function_name
)
7578 function_name_len
-= 5;
7581 rename
= (char *) alloca (rename_len
* sizeof (char));
7582 strncpy (rename
, function_name
, function_name_len
);
7583 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7588 const int rename_len
= strlen (name
) + 6;
7590 rename
= (char *) alloca (rename_len
* sizeof (char));
7591 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7594 return ada_find_any_type_symbol (rename
);
7597 /* Because of GNAT encoding conventions, several GDB symbols may match a
7598 given type name. If the type denoted by TYPE0 is to be preferred to
7599 that of TYPE1 for purposes of type printing, return non-zero;
7600 otherwise return 0. */
7603 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7607 else if (type0
== NULL
)
7609 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7611 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7613 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7615 else if (ada_is_constrained_packed_array_type (type0
))
7617 else if (ada_is_array_descriptor_type (type0
)
7618 && !ada_is_array_descriptor_type (type1
))
7622 const char *type0_name
= type_name_no_tag (type0
);
7623 const char *type1_name
= type_name_no_tag (type1
);
7625 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7626 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7632 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7633 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7636 ada_type_name (struct type
*type
)
7640 else if (TYPE_NAME (type
) != NULL
)
7641 return TYPE_NAME (type
);
7643 return TYPE_TAG_NAME (type
);
7646 /* Search the list of "descriptive" types associated to TYPE for a type
7647 whose name is NAME. */
7649 static struct type
*
7650 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7652 struct type
*result
;
7654 if (ada_ignore_descriptive_types_p
)
7657 /* If there no descriptive-type info, then there is no parallel type
7659 if (!HAVE_GNAT_AUX_INFO (type
))
7662 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7663 while (result
!= NULL
)
7665 const char *result_name
= ada_type_name (result
);
7667 if (result_name
== NULL
)
7669 warning (_("unexpected null name on descriptive type"));
7673 /* If the names match, stop. */
7674 if (strcmp (result_name
, name
) == 0)
7677 /* Otherwise, look at the next item on the list, if any. */
7678 if (HAVE_GNAT_AUX_INFO (result
))
7679 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7684 /* If we didn't find a match, see whether this is a packed array. With
7685 older compilers, the descriptive type information is either absent or
7686 irrelevant when it comes to packed arrays so the above lookup fails.
7687 Fall back to using a parallel lookup by name in this case. */
7688 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7689 return ada_find_any_type (name
);
7694 /* Find a parallel type to TYPE with the specified NAME, using the
7695 descriptive type taken from the debugging information, if available,
7696 and otherwise using the (slower) name-based method. */
7698 static struct type
*
7699 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7701 struct type
*result
= NULL
;
7703 if (HAVE_GNAT_AUX_INFO (type
))
7704 result
= find_parallel_type_by_descriptive_type (type
, name
);
7706 result
= ada_find_any_type (name
);
7711 /* Same as above, but specify the name of the parallel type by appending
7712 SUFFIX to the name of TYPE. */
7715 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7718 const char *typename
= ada_type_name (type
);
7721 if (typename
== NULL
)
7724 len
= strlen (typename
);
7726 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7728 strcpy (name
, typename
);
7729 strcpy (name
+ len
, suffix
);
7731 return ada_find_parallel_type_with_name (type
, name
);
7734 /* If TYPE is a variable-size record type, return the corresponding template
7735 type describing its fields. Otherwise, return NULL. */
7737 static struct type
*
7738 dynamic_template_type (struct type
*type
)
7740 type
= ada_check_typedef (type
);
7742 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7743 || ada_type_name (type
) == NULL
)
7747 int len
= strlen (ada_type_name (type
));
7749 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7752 return ada_find_parallel_type (type
, "___XVE");
7756 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7757 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7760 is_dynamic_field (struct type
*templ_type
, int field_num
)
7762 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7765 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7766 && strstr (name
, "___XVL") != NULL
;
7769 /* The index of the variant field of TYPE, or -1 if TYPE does not
7770 represent a variant record type. */
7773 variant_field_index (struct type
*type
)
7777 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7780 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7782 if (ada_is_variant_part (type
, f
))
7788 /* A record type with no fields. */
7790 static struct type
*
7791 empty_record (struct type
*template)
7793 struct type
*type
= alloc_type_copy (template);
7795 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7796 TYPE_NFIELDS (type
) = 0;
7797 TYPE_FIELDS (type
) = NULL
;
7798 INIT_CPLUS_SPECIFIC (type
);
7799 TYPE_NAME (type
) = "<empty>";
7800 TYPE_TAG_NAME (type
) = NULL
;
7801 TYPE_LENGTH (type
) = 0;
7805 /* An ordinary record type (with fixed-length fields) that describes
7806 the value of type TYPE at VALADDR or ADDRESS (see comments at
7807 the beginning of this section) VAL according to GNAT conventions.
7808 DVAL0 should describe the (portion of a) record that contains any
7809 necessary discriminants. It should be NULL if value_type (VAL) is
7810 an outer-level type (i.e., as opposed to a branch of a variant.) A
7811 variant field (unless unchecked) is replaced by a particular branch
7814 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7815 length are not statically known are discarded. As a consequence,
7816 VALADDR, ADDRESS and DVAL0 are ignored.
7818 NOTE: Limitations: For now, we assume that dynamic fields and
7819 variants occupy whole numbers of bytes. However, they need not be
7823 ada_template_to_fixed_record_type_1 (struct type
*type
,
7824 const gdb_byte
*valaddr
,
7825 CORE_ADDR address
, struct value
*dval0
,
7826 int keep_dynamic_fields
)
7828 struct value
*mark
= value_mark ();
7831 int nfields
, bit_len
;
7837 /* Compute the number of fields in this record type that are going
7838 to be processed: unless keep_dynamic_fields, this includes only
7839 fields whose position and length are static will be processed. */
7840 if (keep_dynamic_fields
)
7841 nfields
= TYPE_NFIELDS (type
);
7845 while (nfields
< TYPE_NFIELDS (type
)
7846 && !ada_is_variant_part (type
, nfields
)
7847 && !is_dynamic_field (type
, nfields
))
7851 rtype
= alloc_type_copy (type
);
7852 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7853 INIT_CPLUS_SPECIFIC (rtype
);
7854 TYPE_NFIELDS (rtype
) = nfields
;
7855 TYPE_FIELDS (rtype
) = (struct field
*)
7856 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7857 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7858 TYPE_NAME (rtype
) = ada_type_name (type
);
7859 TYPE_TAG_NAME (rtype
) = NULL
;
7860 TYPE_FIXED_INSTANCE (rtype
) = 1;
7866 for (f
= 0; f
< nfields
; f
+= 1)
7868 off
= align_value (off
, field_alignment (type
, f
))
7869 + TYPE_FIELD_BITPOS (type
, f
);
7870 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
7871 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7873 if (ada_is_variant_part (type
, f
))
7878 else if (is_dynamic_field (type
, f
))
7880 const gdb_byte
*field_valaddr
= valaddr
;
7881 CORE_ADDR field_address
= address
;
7882 struct type
*field_type
=
7883 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7887 /* rtype's length is computed based on the run-time
7888 value of discriminants. If the discriminants are not
7889 initialized, the type size may be completely bogus and
7890 GDB may fail to allocate a value for it. So check the
7891 size first before creating the value. */
7893 /* Using plain value_from_contents_and_address here
7894 causes problems because we will end up trying to
7895 resolve a type that is currently being
7897 dval
= value_from_contents_and_address_unresolved (rtype
,
7900 rtype
= value_type (dval
);
7905 /* If the type referenced by this field is an aligner type, we need
7906 to unwrap that aligner type, because its size might not be set.
7907 Keeping the aligner type would cause us to compute the wrong
7908 size for this field, impacting the offset of the all the fields
7909 that follow this one. */
7910 if (ada_is_aligner_type (field_type
))
7912 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7914 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7915 field_address
= cond_offset_target (field_address
, field_offset
);
7916 field_type
= ada_aligned_type (field_type
);
7919 field_valaddr
= cond_offset_host (field_valaddr
,
7920 off
/ TARGET_CHAR_BIT
);
7921 field_address
= cond_offset_target (field_address
,
7922 off
/ TARGET_CHAR_BIT
);
7924 /* Get the fixed type of the field. Note that, in this case,
7925 we do not want to get the real type out of the tag: if
7926 the current field is the parent part of a tagged record,
7927 we will get the tag of the object. Clearly wrong: the real
7928 type of the parent is not the real type of the child. We
7929 would end up in an infinite loop. */
7930 field_type
= ada_get_base_type (field_type
);
7931 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7932 field_address
, dval
, 0);
7933 /* If the field size is already larger than the maximum
7934 object size, then the record itself will necessarily
7935 be larger than the maximum object size. We need to make
7936 this check now, because the size might be so ridiculously
7937 large (due to an uninitialized variable in the inferior)
7938 that it would cause an overflow when adding it to the
7940 check_size (field_type
);
7942 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7943 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7944 /* The multiplication can potentially overflow. But because
7945 the field length has been size-checked just above, and
7946 assuming that the maximum size is a reasonable value,
7947 an overflow should not happen in practice. So rather than
7948 adding overflow recovery code to this already complex code,
7949 we just assume that it's not going to happen. */
7951 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7955 /* Note: If this field's type is a typedef, it is important
7956 to preserve the typedef layer.
7958 Otherwise, we might be transforming a typedef to a fat
7959 pointer (encoding a pointer to an unconstrained array),
7960 into a basic fat pointer (encoding an unconstrained
7961 array). As both types are implemented using the same
7962 structure, the typedef is the only clue which allows us
7963 to distinguish between the two options. Stripping it
7964 would prevent us from printing this field appropriately. */
7965 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
7966 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7967 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7969 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7972 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
7974 /* We need to be careful of typedefs when computing
7975 the length of our field. If this is a typedef,
7976 get the length of the target type, not the length
7978 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
7979 field_type
= ada_typedef_target_type (field_type
);
7982 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7985 if (off
+ fld_bit_len
> bit_len
)
7986 bit_len
= off
+ fld_bit_len
;
7988 TYPE_LENGTH (rtype
) =
7989 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7992 /* We handle the variant part, if any, at the end because of certain
7993 odd cases in which it is re-ordered so as NOT to be the last field of
7994 the record. This can happen in the presence of representation
7996 if (variant_field
>= 0)
7998 struct type
*branch_type
;
8000 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8004 /* Using plain value_from_contents_and_address here causes
8005 problems because we will end up trying to resolve a type
8006 that is currently being constructed. */
8007 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8009 rtype
= value_type (dval
);
8015 to_fixed_variant_branch_type
8016 (TYPE_FIELD_TYPE (type
, variant_field
),
8017 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8018 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8019 if (branch_type
== NULL
)
8021 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8022 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8023 TYPE_NFIELDS (rtype
) -= 1;
8027 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8028 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8030 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8032 if (off
+ fld_bit_len
> bit_len
)
8033 bit_len
= off
+ fld_bit_len
;
8034 TYPE_LENGTH (rtype
) =
8035 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8039 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8040 should contain the alignment of that record, which should be a strictly
8041 positive value. If null or negative, then something is wrong, most
8042 probably in the debug info. In that case, we don't round up the size
8043 of the resulting type. If this record is not part of another structure,
8044 the current RTYPE length might be good enough for our purposes. */
8045 if (TYPE_LENGTH (type
) <= 0)
8047 if (TYPE_NAME (rtype
))
8048 warning (_("Invalid type size for `%s' detected: %d."),
8049 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8051 warning (_("Invalid type size for <unnamed> detected: %d."),
8052 TYPE_LENGTH (type
));
8056 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8057 TYPE_LENGTH (type
));
8060 value_free_to_mark (mark
);
8061 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8062 error (_("record type with dynamic size is larger than varsize-limit"));
8066 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8069 static struct type
*
8070 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8071 CORE_ADDR address
, struct value
*dval0
)
8073 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8077 /* An ordinary record type in which ___XVL-convention fields and
8078 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8079 static approximations, containing all possible fields. Uses
8080 no runtime values. Useless for use in values, but that's OK,
8081 since the results are used only for type determinations. Works on both
8082 structs and unions. Representation note: to save space, we memorize
8083 the result of this function in the TYPE_TARGET_TYPE of the
8086 static struct type
*
8087 template_to_static_fixed_type (struct type
*type0
)
8093 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8094 return TYPE_TARGET_TYPE (type0
);
8096 nfields
= TYPE_NFIELDS (type0
);
8099 for (f
= 0; f
< nfields
; f
+= 1)
8101 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
8102 struct type
*new_type
;
8104 if (is_dynamic_field (type0
, f
))
8105 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8107 new_type
= static_unwrap_type (field_type
);
8108 if (type
== type0
&& new_type
!= field_type
)
8110 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8111 TYPE_CODE (type
) = TYPE_CODE (type0
);
8112 INIT_CPLUS_SPECIFIC (type
);
8113 TYPE_NFIELDS (type
) = nfields
;
8114 TYPE_FIELDS (type
) = (struct field
*)
8115 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8116 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8117 sizeof (struct field
) * nfields
);
8118 TYPE_NAME (type
) = ada_type_name (type0
);
8119 TYPE_TAG_NAME (type
) = NULL
;
8120 TYPE_FIXED_INSTANCE (type
) = 1;
8121 TYPE_LENGTH (type
) = 0;
8123 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8124 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8129 /* Given an object of type TYPE whose contents are at VALADDR and
8130 whose address in memory is ADDRESS, returns a revision of TYPE,
8131 which should be a non-dynamic-sized record, in which the variant
8132 part, if any, is replaced with the appropriate branch. Looks
8133 for discriminant values in DVAL0, which can be NULL if the record
8134 contains the necessary discriminant values. */
8136 static struct type
*
8137 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8138 CORE_ADDR address
, struct value
*dval0
)
8140 struct value
*mark
= value_mark ();
8143 struct type
*branch_type
;
8144 int nfields
= TYPE_NFIELDS (type
);
8145 int variant_field
= variant_field_index (type
);
8147 if (variant_field
== -1)
8152 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8153 type
= value_type (dval
);
8158 rtype
= alloc_type_copy (type
);
8159 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8160 INIT_CPLUS_SPECIFIC (rtype
);
8161 TYPE_NFIELDS (rtype
) = nfields
;
8162 TYPE_FIELDS (rtype
) =
8163 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8164 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8165 sizeof (struct field
) * nfields
);
8166 TYPE_NAME (rtype
) = ada_type_name (type
);
8167 TYPE_TAG_NAME (rtype
) = NULL
;
8168 TYPE_FIXED_INSTANCE (rtype
) = 1;
8169 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8171 branch_type
= to_fixed_variant_branch_type
8172 (TYPE_FIELD_TYPE (type
, variant_field
),
8173 cond_offset_host (valaddr
,
8174 TYPE_FIELD_BITPOS (type
, variant_field
)
8176 cond_offset_target (address
,
8177 TYPE_FIELD_BITPOS (type
, variant_field
)
8178 / TARGET_CHAR_BIT
), dval
);
8179 if (branch_type
== NULL
)
8183 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8184 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8185 TYPE_NFIELDS (rtype
) -= 1;
8189 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8190 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8191 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8192 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8194 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8196 value_free_to_mark (mark
);
8200 /* An ordinary record type (with fixed-length fields) that describes
8201 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8202 beginning of this section]. Any necessary discriminants' values
8203 should be in DVAL, a record value; it may be NULL if the object
8204 at ADDR itself contains any necessary discriminant values.
8205 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8206 values from the record are needed. Except in the case that DVAL,
8207 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8208 unchecked) is replaced by a particular branch of the variant.
8210 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8211 is questionable and may be removed. It can arise during the
8212 processing of an unconstrained-array-of-record type where all the
8213 variant branches have exactly the same size. This is because in
8214 such cases, the compiler does not bother to use the XVS convention
8215 when encoding the record. I am currently dubious of this
8216 shortcut and suspect the compiler should be altered. FIXME. */
8218 static struct type
*
8219 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8220 CORE_ADDR address
, struct value
*dval
)
8222 struct type
*templ_type
;
8224 if (TYPE_FIXED_INSTANCE (type0
))
8227 templ_type
= dynamic_template_type (type0
);
8229 if (templ_type
!= NULL
)
8230 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8231 else if (variant_field_index (type0
) >= 0)
8233 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8235 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8240 TYPE_FIXED_INSTANCE (type0
) = 1;
8246 /* An ordinary record type (with fixed-length fields) that describes
8247 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8248 union type. Any necessary discriminants' values should be in DVAL,
8249 a record value. That is, this routine selects the appropriate
8250 branch of the union at ADDR according to the discriminant value
8251 indicated in the union's type name. Returns VAR_TYPE0 itself if
8252 it represents a variant subject to a pragma Unchecked_Union. */
8254 static struct type
*
8255 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8256 CORE_ADDR address
, struct value
*dval
)
8259 struct type
*templ_type
;
8260 struct type
*var_type
;
8262 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8263 var_type
= TYPE_TARGET_TYPE (var_type0
);
8265 var_type
= var_type0
;
8267 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8269 if (templ_type
!= NULL
)
8270 var_type
= templ_type
;
8272 if (is_unchecked_variant (var_type
, value_type (dval
)))
8275 ada_which_variant_applies (var_type
,
8276 value_type (dval
), value_contents (dval
));
8279 return empty_record (var_type
);
8280 else if (is_dynamic_field (var_type
, which
))
8281 return to_fixed_record_type
8282 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8283 valaddr
, address
, dval
);
8284 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8286 to_fixed_record_type
8287 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8289 return TYPE_FIELD_TYPE (var_type
, which
);
8292 /* Assuming that TYPE0 is an array type describing the type of a value
8293 at ADDR, and that DVAL describes a record containing any
8294 discriminants used in TYPE0, returns a type for the value that
8295 contains no dynamic components (that is, no components whose sizes
8296 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8297 true, gives an error message if the resulting type's size is over
8300 static struct type
*
8301 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8304 struct type
*index_type_desc
;
8305 struct type
*result
;
8306 int constrained_packed_array_p
;
8308 type0
= ada_check_typedef (type0
);
8309 if (TYPE_FIXED_INSTANCE (type0
))
8312 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8313 if (constrained_packed_array_p
)
8314 type0
= decode_constrained_packed_array_type (type0
);
8316 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
8317 ada_fixup_array_indexes_type (index_type_desc
);
8318 if (index_type_desc
== NULL
)
8320 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8322 /* NOTE: elt_type---the fixed version of elt_type0---should never
8323 depend on the contents of the array in properly constructed
8325 /* Create a fixed version of the array element type.
8326 We're not providing the address of an element here,
8327 and thus the actual object value cannot be inspected to do
8328 the conversion. This should not be a problem, since arrays of
8329 unconstrained objects are not allowed. In particular, all
8330 the elements of an array of a tagged type should all be of
8331 the same type specified in the debugging info. No need to
8332 consult the object tag. */
8333 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8335 /* Make sure we always create a new array type when dealing with
8336 packed array types, since we're going to fix-up the array
8337 type length and element bitsize a little further down. */
8338 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8341 result
= create_array_type (alloc_type_copy (type0
),
8342 elt_type
, TYPE_INDEX_TYPE (type0
));
8347 struct type
*elt_type0
;
8350 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8351 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8353 /* NOTE: result---the fixed version of elt_type0---should never
8354 depend on the contents of the array in properly constructed
8356 /* Create a fixed version of the array element type.
8357 We're not providing the address of an element here,
8358 and thus the actual object value cannot be inspected to do
8359 the conversion. This should not be a problem, since arrays of
8360 unconstrained objects are not allowed. In particular, all
8361 the elements of an array of a tagged type should all be of
8362 the same type specified in the debugging info. No need to
8363 consult the object tag. */
8365 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8368 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8370 struct type
*range_type
=
8371 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8373 result
= create_array_type (alloc_type_copy (elt_type0
),
8374 result
, range_type
);
8375 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8377 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8378 error (_("array type with dynamic size is larger than varsize-limit"));
8381 /* We want to preserve the type name. This can be useful when
8382 trying to get the type name of a value that has already been
8383 printed (for instance, if the user did "print VAR; whatis $". */
8384 TYPE_NAME (result
) = TYPE_NAME (type0
);
8386 if (constrained_packed_array_p
)
8388 /* So far, the resulting type has been created as if the original
8389 type was a regular (non-packed) array type. As a result, the
8390 bitsize of the array elements needs to be set again, and the array
8391 length needs to be recomputed based on that bitsize. */
8392 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8393 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8395 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8396 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8397 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8398 TYPE_LENGTH (result
)++;
8401 TYPE_FIXED_INSTANCE (result
) = 1;
8406 /* A standard type (containing no dynamically sized components)
8407 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8408 DVAL describes a record containing any discriminants used in TYPE0,
8409 and may be NULL if there are none, or if the object of type TYPE at
8410 ADDRESS or in VALADDR contains these discriminants.
8412 If CHECK_TAG is not null, in the case of tagged types, this function
8413 attempts to locate the object's tag and use it to compute the actual
8414 type. However, when ADDRESS is null, we cannot use it to determine the
8415 location of the tag, and therefore compute the tagged type's actual type.
8416 So we return the tagged type without consulting the tag. */
8418 static struct type
*
8419 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8420 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8422 type
= ada_check_typedef (type
);
8423 switch (TYPE_CODE (type
))
8427 case TYPE_CODE_STRUCT
:
8429 struct type
*static_type
= to_static_fixed_type (type
);
8430 struct type
*fixed_record_type
=
8431 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8433 /* If STATIC_TYPE is a tagged type and we know the object's address,
8434 then we can determine its tag, and compute the object's actual
8435 type from there. Note that we have to use the fixed record
8436 type (the parent part of the record may have dynamic fields
8437 and the way the location of _tag is expressed may depend on
8440 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8443 value_tag_from_contents_and_address
8447 struct type
*real_type
= type_from_tag (tag
);
8449 value_from_contents_and_address (fixed_record_type
,
8452 fixed_record_type
= value_type (obj
);
8453 if (real_type
!= NULL
)
8454 return to_fixed_record_type
8456 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8459 /* Check to see if there is a parallel ___XVZ variable.
8460 If there is, then it provides the actual size of our type. */
8461 else if (ada_type_name (fixed_record_type
) != NULL
)
8463 const char *name
= ada_type_name (fixed_record_type
);
8464 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8468 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8469 size
= get_int_var_value (xvz_name
, &xvz_found
);
8470 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8472 fixed_record_type
= copy_type (fixed_record_type
);
8473 TYPE_LENGTH (fixed_record_type
) = size
;
8475 /* The FIXED_RECORD_TYPE may have be a stub. We have
8476 observed this when the debugging info is STABS, and
8477 apparently it is something that is hard to fix.
8479 In practice, we don't need the actual type definition
8480 at all, because the presence of the XVZ variable allows us
8481 to assume that there must be a XVS type as well, which we
8482 should be able to use later, when we need the actual type
8485 In the meantime, pretend that the "fixed" type we are
8486 returning is NOT a stub, because this can cause trouble
8487 when using this type to create new types targeting it.
8488 Indeed, the associated creation routines often check
8489 whether the target type is a stub and will try to replace
8490 it, thus using a type with the wrong size. This, in turn,
8491 might cause the new type to have the wrong size too.
8492 Consider the case of an array, for instance, where the size
8493 of the array is computed from the number of elements in
8494 our array multiplied by the size of its element. */
8495 TYPE_STUB (fixed_record_type
) = 0;
8498 return fixed_record_type
;
8500 case TYPE_CODE_ARRAY
:
8501 return to_fixed_array_type (type
, dval
, 1);
8502 case TYPE_CODE_UNION
:
8506 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8510 /* The same as ada_to_fixed_type_1, except that it preserves the type
8511 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8513 The typedef layer needs be preserved in order to differentiate between
8514 arrays and array pointers when both types are implemented using the same
8515 fat pointer. In the array pointer case, the pointer is encoded as
8516 a typedef of the pointer type. For instance, considering:
8518 type String_Access is access String;
8519 S1 : String_Access := null;
8521 To the debugger, S1 is defined as a typedef of type String. But
8522 to the user, it is a pointer. So if the user tries to print S1,
8523 we should not dereference the array, but print the array address
8526 If we didn't preserve the typedef layer, we would lose the fact that
8527 the type is to be presented as a pointer (needs de-reference before
8528 being printed). And we would also use the source-level type name. */
8531 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8532 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8535 struct type
*fixed_type
=
8536 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8538 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8539 then preserve the typedef layer.
8541 Implementation note: We can only check the main-type portion of
8542 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8543 from TYPE now returns a type that has the same instance flags
8544 as TYPE. For instance, if TYPE is a "typedef const", and its
8545 target type is a "struct", then the typedef elimination will return
8546 a "const" version of the target type. See check_typedef for more
8547 details about how the typedef layer elimination is done.
8549 brobecker/2010-11-19: It seems to me that the only case where it is
8550 useful to preserve the typedef layer is when dealing with fat pointers.
8551 Perhaps, we could add a check for that and preserve the typedef layer
8552 only in that situation. But this seems unecessary so far, probably
8553 because we call check_typedef/ada_check_typedef pretty much everywhere.
8555 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8556 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8557 == TYPE_MAIN_TYPE (fixed_type
)))
8563 /* A standard (static-sized) type corresponding as well as possible to
8564 TYPE0, but based on no runtime data. */
8566 static struct type
*
8567 to_static_fixed_type (struct type
*type0
)
8574 if (TYPE_FIXED_INSTANCE (type0
))
8577 type0
= ada_check_typedef (type0
);
8579 switch (TYPE_CODE (type0
))
8583 case TYPE_CODE_STRUCT
:
8584 type
= dynamic_template_type (type0
);
8586 return template_to_static_fixed_type (type
);
8588 return template_to_static_fixed_type (type0
);
8589 case TYPE_CODE_UNION
:
8590 type
= ada_find_parallel_type (type0
, "___XVU");
8592 return template_to_static_fixed_type (type
);
8594 return template_to_static_fixed_type (type0
);
8598 /* A static approximation of TYPE with all type wrappers removed. */
8600 static struct type
*
8601 static_unwrap_type (struct type
*type
)
8603 if (ada_is_aligner_type (type
))
8605 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8606 if (ada_type_name (type1
) == NULL
)
8607 TYPE_NAME (type1
) = ada_type_name (type
);
8609 return static_unwrap_type (type1
);
8613 struct type
*raw_real_type
= ada_get_base_type (type
);
8615 if (raw_real_type
== type
)
8618 return to_static_fixed_type (raw_real_type
);
8622 /* In some cases, incomplete and private types require
8623 cross-references that are not resolved as records (for example,
8625 type FooP is access Foo;
8627 type Foo is array ...;
8628 ). In these cases, since there is no mechanism for producing
8629 cross-references to such types, we instead substitute for FooP a
8630 stub enumeration type that is nowhere resolved, and whose tag is
8631 the name of the actual type. Call these types "non-record stubs". */
8633 /* A type equivalent to TYPE that is not a non-record stub, if one
8634 exists, otherwise TYPE. */
8637 ada_check_typedef (struct type
*type
)
8642 /* If our type is a typedef type of a fat pointer, then we're done.
8643 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8644 what allows us to distinguish between fat pointers that represent
8645 array types, and fat pointers that represent array access types
8646 (in both cases, the compiler implements them as fat pointers). */
8647 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8648 && is_thick_pntr (ada_typedef_target_type (type
)))
8651 CHECK_TYPEDEF (type
);
8652 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8653 || !TYPE_STUB (type
)
8654 || TYPE_TAG_NAME (type
) == NULL
)
8658 const char *name
= TYPE_TAG_NAME (type
);
8659 struct type
*type1
= ada_find_any_type (name
);
8664 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8665 stubs pointing to arrays, as we don't create symbols for array
8666 types, only for the typedef-to-array types). If that's the case,
8667 strip the typedef layer. */
8668 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8669 type1
= ada_check_typedef (type1
);
8675 /* A value representing the data at VALADDR/ADDRESS as described by
8676 type TYPE0, but with a standard (static-sized) type that correctly
8677 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8678 type, then return VAL0 [this feature is simply to avoid redundant
8679 creation of struct values]. */
8681 static struct value
*
8682 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8685 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8687 if (type
== type0
&& val0
!= NULL
)
8690 return value_from_contents_and_address (type
, 0, address
);
8693 /* A value representing VAL, but with a standard (static-sized) type
8694 that correctly describes it. Does not necessarily create a new
8698 ada_to_fixed_value (struct value
*val
)
8700 val
= unwrap_value (val
);
8701 val
= ada_to_fixed_value_create (value_type (val
),
8702 value_address (val
),
8710 /* Table mapping attribute numbers to names.
8711 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8713 static const char *attribute_names
[] = {
8731 ada_attribute_name (enum exp_opcode n
)
8733 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8734 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8736 return attribute_names
[0];
8739 /* Evaluate the 'POS attribute applied to ARG. */
8742 pos_atr (struct value
*arg
)
8744 struct value
*val
= coerce_ref (arg
);
8745 struct type
*type
= value_type (val
);
8747 if (!discrete_type_p (type
))
8748 error (_("'POS only defined on discrete types"));
8750 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8753 LONGEST v
= value_as_long (val
);
8755 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8757 if (v
== TYPE_FIELD_ENUMVAL (type
, i
))
8760 error (_("enumeration value is invalid: can't find 'POS"));
8763 return value_as_long (val
);
8766 static struct value
*
8767 value_pos_atr (struct type
*type
, struct value
*arg
)
8769 return value_from_longest (type
, pos_atr (arg
));
8772 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8774 static struct value
*
8775 value_val_atr (struct type
*type
, struct value
*arg
)
8777 if (!discrete_type_p (type
))
8778 error (_("'VAL only defined on discrete types"));
8779 if (!integer_type_p (value_type (arg
)))
8780 error (_("'VAL requires integral argument"));
8782 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8784 long pos
= value_as_long (arg
);
8786 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8787 error (_("argument to 'VAL out of range"));
8788 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
8791 return value_from_longest (type
, value_as_long (arg
));
8797 /* True if TYPE appears to be an Ada character type.
8798 [At the moment, this is true only for Character and Wide_Character;
8799 It is a heuristic test that could stand improvement]. */
8802 ada_is_character_type (struct type
*type
)
8806 /* If the type code says it's a character, then assume it really is,
8807 and don't check any further. */
8808 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8811 /* Otherwise, assume it's a character type iff it is a discrete type
8812 with a known character type name. */
8813 name
= ada_type_name (type
);
8814 return (name
!= NULL
8815 && (TYPE_CODE (type
) == TYPE_CODE_INT
8816 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8817 && (strcmp (name
, "character") == 0
8818 || strcmp (name
, "wide_character") == 0
8819 || strcmp (name
, "wide_wide_character") == 0
8820 || strcmp (name
, "unsigned char") == 0));
8823 /* True if TYPE appears to be an Ada string type. */
8826 ada_is_string_type (struct type
*type
)
8828 type
= ada_check_typedef (type
);
8830 && TYPE_CODE (type
) != TYPE_CODE_PTR
8831 && (ada_is_simple_array_type (type
)
8832 || ada_is_array_descriptor_type (type
))
8833 && ada_array_arity (type
) == 1)
8835 struct type
*elttype
= ada_array_element_type (type
, 1);
8837 return ada_is_character_type (elttype
);
8843 /* The compiler sometimes provides a parallel XVS type for a given
8844 PAD type. Normally, it is safe to follow the PAD type directly,
8845 but older versions of the compiler have a bug that causes the offset
8846 of its "F" field to be wrong. Following that field in that case
8847 would lead to incorrect results, but this can be worked around
8848 by ignoring the PAD type and using the associated XVS type instead.
8850 Set to True if the debugger should trust the contents of PAD types.
8851 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8852 static int trust_pad_over_xvs
= 1;
8854 /* True if TYPE is a struct type introduced by the compiler to force the
8855 alignment of a value. Such types have a single field with a
8856 distinctive name. */
8859 ada_is_aligner_type (struct type
*type
)
8861 type
= ada_check_typedef (type
);
8863 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8866 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8867 && TYPE_NFIELDS (type
) == 1
8868 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8871 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8872 the parallel type. */
8875 ada_get_base_type (struct type
*raw_type
)
8877 struct type
*real_type_namer
;
8878 struct type
*raw_real_type
;
8880 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8883 if (ada_is_aligner_type (raw_type
))
8884 /* The encoding specifies that we should always use the aligner type.
8885 So, even if this aligner type has an associated XVS type, we should
8888 According to the compiler gurus, an XVS type parallel to an aligner
8889 type may exist because of a stabs limitation. In stabs, aligner
8890 types are empty because the field has a variable-sized type, and
8891 thus cannot actually be used as an aligner type. As a result,
8892 we need the associated parallel XVS type to decode the type.
8893 Since the policy in the compiler is to not change the internal
8894 representation based on the debugging info format, we sometimes
8895 end up having a redundant XVS type parallel to the aligner type. */
8898 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8899 if (real_type_namer
== NULL
8900 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8901 || TYPE_NFIELDS (real_type_namer
) != 1)
8904 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
8906 /* This is an older encoding form where the base type needs to be
8907 looked up by name. We prefer the newer enconding because it is
8909 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8910 if (raw_real_type
== NULL
)
8913 return raw_real_type
;
8916 /* The field in our XVS type is a reference to the base type. */
8917 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
8920 /* The type of value designated by TYPE, with all aligners removed. */
8923 ada_aligned_type (struct type
*type
)
8925 if (ada_is_aligner_type (type
))
8926 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8928 return ada_get_base_type (type
);
8932 /* The address of the aligned value in an object at address VALADDR
8933 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8936 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8938 if (ada_is_aligner_type (type
))
8939 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8941 TYPE_FIELD_BITPOS (type
,
8942 0) / TARGET_CHAR_BIT
);
8949 /* The printed representation of an enumeration literal with encoded
8950 name NAME. The value is good to the next call of ada_enum_name. */
8952 ada_enum_name (const char *name
)
8954 static char *result
;
8955 static size_t result_len
= 0;
8958 /* First, unqualify the enumeration name:
8959 1. Search for the last '.' character. If we find one, then skip
8960 all the preceding characters, the unqualified name starts
8961 right after that dot.
8962 2. Otherwise, we may be debugging on a target where the compiler
8963 translates dots into "__". Search forward for double underscores,
8964 but stop searching when we hit an overloading suffix, which is
8965 of the form "__" followed by digits. */
8967 tmp
= strrchr (name
, '.');
8972 while ((tmp
= strstr (name
, "__")) != NULL
)
8974 if (isdigit (tmp
[2]))
8985 if (name
[1] == 'U' || name
[1] == 'W')
8987 if (sscanf (name
+ 2, "%x", &v
) != 1)
8993 GROW_VECT (result
, result_len
, 16);
8994 if (isascii (v
) && isprint (v
))
8995 xsnprintf (result
, result_len
, "'%c'", v
);
8996 else if (name
[1] == 'U')
8997 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
8999 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9005 tmp
= strstr (name
, "__");
9007 tmp
= strstr (name
, "$");
9010 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9011 strncpy (result
, name
, tmp
- name
);
9012 result
[tmp
- name
] = '\0';
9020 /* Evaluate the subexpression of EXP starting at *POS as for
9021 evaluate_type, updating *POS to point just past the evaluated
9024 static struct value
*
9025 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9027 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9030 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9033 static struct value
*
9034 unwrap_value (struct value
*val
)
9036 struct type
*type
= ada_check_typedef (value_type (val
));
9038 if (ada_is_aligner_type (type
))
9040 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9041 struct type
*val_type
= ada_check_typedef (value_type (v
));
9043 if (ada_type_name (val_type
) == NULL
)
9044 TYPE_NAME (val_type
) = ada_type_name (type
);
9046 return unwrap_value (v
);
9050 struct type
*raw_real_type
=
9051 ada_check_typedef (ada_get_base_type (type
));
9053 /* If there is no parallel XVS or XVE type, then the value is
9054 already unwrapped. Return it without further modification. */
9055 if ((type
== raw_real_type
)
9056 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9060 coerce_unspec_val_to_type
9061 (val
, ada_to_fixed_type (raw_real_type
, 0,
9062 value_address (val
),
9067 static struct value
*
9068 cast_to_fixed (struct type
*type
, struct value
*arg
)
9072 if (type
== value_type (arg
))
9074 else if (ada_is_fixed_point_type (value_type (arg
)))
9075 val
= ada_float_to_fixed (type
,
9076 ada_fixed_to_float (value_type (arg
),
9077 value_as_long (arg
)));
9080 DOUBLEST argd
= value_as_double (arg
);
9082 val
= ada_float_to_fixed (type
, argd
);
9085 return value_from_longest (type
, val
);
9088 static struct value
*
9089 cast_from_fixed (struct type
*type
, struct value
*arg
)
9091 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9092 value_as_long (arg
));
9094 return value_from_double (type
, val
);
9097 /* Given two array types T1 and T2, return nonzero iff both arrays
9098 contain the same number of elements. */
9101 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9103 LONGEST lo1
, hi1
, lo2
, hi2
;
9105 /* Get the array bounds in order to verify that the size of
9106 the two arrays match. */
9107 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9108 || !get_array_bounds (t2
, &lo2
, &hi2
))
9109 error (_("unable to determine array bounds"));
9111 /* To make things easier for size comparison, normalize a bit
9112 the case of empty arrays by making sure that the difference
9113 between upper bound and lower bound is always -1. */
9119 return (hi1
- lo1
== hi2
- lo2
);
9122 /* Assuming that VAL is an array of integrals, and TYPE represents
9123 an array with the same number of elements, but with wider integral
9124 elements, return an array "casted" to TYPE. In practice, this
9125 means that the returned array is built by casting each element
9126 of the original array into TYPE's (wider) element type. */
9128 static struct value
*
9129 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9131 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9136 /* Verify that both val and type are arrays of scalars, and
9137 that the size of val's elements is smaller than the size
9138 of type's element. */
9139 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9140 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9141 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9142 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9143 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9144 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9146 if (!get_array_bounds (type
, &lo
, &hi
))
9147 error (_("unable to determine array bounds"));
9149 res
= allocate_value (type
);
9151 /* Promote each array element. */
9152 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9154 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9156 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9157 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9163 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9164 return the converted value. */
9166 static struct value
*
9167 coerce_for_assign (struct type
*type
, struct value
*val
)
9169 struct type
*type2
= value_type (val
);
9174 type2
= ada_check_typedef (type2
);
9175 type
= ada_check_typedef (type
);
9177 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9178 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9180 val
= ada_value_ind (val
);
9181 type2
= value_type (val
);
9184 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9185 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9187 if (!ada_same_array_size_p (type
, type2
))
9188 error (_("cannot assign arrays of different length"));
9190 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9191 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9192 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9193 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9195 /* Allow implicit promotion of the array elements to
9197 return ada_promote_array_of_integrals (type
, val
);
9200 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9201 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9202 error (_("Incompatible types in assignment"));
9203 deprecated_set_value_type (val
, type
);
9208 static struct value
*
9209 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9212 struct type
*type1
, *type2
;
9215 arg1
= coerce_ref (arg1
);
9216 arg2
= coerce_ref (arg2
);
9217 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9218 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9220 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9221 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9222 return value_binop (arg1
, arg2
, op
);
9231 return value_binop (arg1
, arg2
, op
);
9234 v2
= value_as_long (arg2
);
9236 error (_("second operand of %s must not be zero."), op_string (op
));
9238 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9239 return value_binop (arg1
, arg2
, op
);
9241 v1
= value_as_long (arg1
);
9246 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9247 v
+= v
> 0 ? -1 : 1;
9255 /* Should not reach this point. */
9259 val
= allocate_value (type1
);
9260 store_unsigned_integer (value_contents_raw (val
),
9261 TYPE_LENGTH (value_type (val
)),
9262 gdbarch_byte_order (get_type_arch (type1
)), v
);
9267 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9269 if (ada_is_direct_array_type (value_type (arg1
))
9270 || ada_is_direct_array_type (value_type (arg2
)))
9272 /* Automatically dereference any array reference before
9273 we attempt to perform the comparison. */
9274 arg1
= ada_coerce_ref (arg1
);
9275 arg2
= ada_coerce_ref (arg2
);
9277 arg1
= ada_coerce_to_simple_array (arg1
);
9278 arg2
= ada_coerce_to_simple_array (arg2
);
9279 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9280 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9281 error (_("Attempt to compare array with non-array"));
9282 /* FIXME: The following works only for types whose
9283 representations use all bits (no padding or undefined bits)
9284 and do not have user-defined equality. */
9286 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9287 && memcmp (value_contents (arg1
), value_contents (arg2
),
9288 TYPE_LENGTH (value_type (arg1
))) == 0;
9290 return value_equal (arg1
, arg2
);
9293 /* Total number of component associations in the aggregate starting at
9294 index PC in EXP. Assumes that index PC is the start of an
9298 num_component_specs (struct expression
*exp
, int pc
)
9302 m
= exp
->elts
[pc
+ 1].longconst
;
9305 for (i
= 0; i
< m
; i
+= 1)
9307 switch (exp
->elts
[pc
].opcode
)
9313 n
+= exp
->elts
[pc
+ 1].longconst
;
9316 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9321 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9322 component of LHS (a simple array or a record), updating *POS past
9323 the expression, assuming that LHS is contained in CONTAINER. Does
9324 not modify the inferior's memory, nor does it modify LHS (unless
9325 LHS == CONTAINER). */
9328 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9329 struct expression
*exp
, int *pos
)
9331 struct value
*mark
= value_mark ();
9334 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9336 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9337 struct value
*index_val
= value_from_longest (index_type
, index
);
9339 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9343 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9344 elt
= ada_to_fixed_value (elt
);
9347 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9348 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9350 value_assign_to_component (container
, elt
,
9351 ada_evaluate_subexp (NULL
, exp
, pos
,
9354 value_free_to_mark (mark
);
9357 /* Assuming that LHS represents an lvalue having a record or array
9358 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9359 of that aggregate's value to LHS, advancing *POS past the
9360 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9361 lvalue containing LHS (possibly LHS itself). Does not modify
9362 the inferior's memory, nor does it modify the contents of
9363 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9365 static struct value
*
9366 assign_aggregate (struct value
*container
,
9367 struct value
*lhs
, struct expression
*exp
,
9368 int *pos
, enum noside noside
)
9370 struct type
*lhs_type
;
9371 int n
= exp
->elts
[*pos
+1].longconst
;
9372 LONGEST low_index
, high_index
;
9375 int max_indices
, num_indices
;
9379 if (noside
!= EVAL_NORMAL
)
9381 for (i
= 0; i
< n
; i
+= 1)
9382 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9386 container
= ada_coerce_ref (container
);
9387 if (ada_is_direct_array_type (value_type (container
)))
9388 container
= ada_coerce_to_simple_array (container
);
9389 lhs
= ada_coerce_ref (lhs
);
9390 if (!deprecated_value_modifiable (lhs
))
9391 error (_("Left operand of assignment is not a modifiable lvalue."));
9393 lhs_type
= value_type (lhs
);
9394 if (ada_is_direct_array_type (lhs_type
))
9396 lhs
= ada_coerce_to_simple_array (lhs
);
9397 lhs_type
= value_type (lhs
);
9398 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9399 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9401 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9404 high_index
= num_visible_fields (lhs_type
) - 1;
9407 error (_("Left-hand side must be array or record."));
9409 num_specs
= num_component_specs (exp
, *pos
- 3);
9410 max_indices
= 4 * num_specs
+ 4;
9411 indices
= alloca (max_indices
* sizeof (indices
[0]));
9412 indices
[0] = indices
[1] = low_index
- 1;
9413 indices
[2] = indices
[3] = high_index
+ 1;
9416 for (i
= 0; i
< n
; i
+= 1)
9418 switch (exp
->elts
[*pos
].opcode
)
9421 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9422 &num_indices
, max_indices
,
9423 low_index
, high_index
);
9426 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9427 &num_indices
, max_indices
,
9428 low_index
, high_index
);
9432 error (_("Misplaced 'others' clause"));
9433 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9434 num_indices
, low_index
, high_index
);
9437 error (_("Internal error: bad aggregate clause"));
9444 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9445 construct at *POS, updating *POS past the construct, given that
9446 the positions are relative to lower bound LOW, where HIGH is the
9447 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9448 updating *NUM_INDICES as needed. CONTAINER is as for
9449 assign_aggregate. */
9451 aggregate_assign_positional (struct value
*container
,
9452 struct value
*lhs
, struct expression
*exp
,
9453 int *pos
, LONGEST
*indices
, int *num_indices
,
9454 int max_indices
, LONGEST low
, LONGEST high
)
9456 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9458 if (ind
- 1 == high
)
9459 warning (_("Extra components in aggregate ignored."));
9462 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9464 assign_component (container
, lhs
, ind
, exp
, pos
);
9467 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9470 /* Assign into the components of LHS indexed by the OP_CHOICES
9471 construct at *POS, updating *POS past the construct, given that
9472 the allowable indices are LOW..HIGH. Record the indices assigned
9473 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9474 needed. CONTAINER is as for assign_aggregate. */
9476 aggregate_assign_from_choices (struct value
*container
,
9477 struct value
*lhs
, struct expression
*exp
,
9478 int *pos
, LONGEST
*indices
, int *num_indices
,
9479 int max_indices
, LONGEST low
, LONGEST high
)
9482 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9483 int choice_pos
, expr_pc
;
9484 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9486 choice_pos
= *pos
+= 3;
9488 for (j
= 0; j
< n_choices
; j
+= 1)
9489 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9491 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9493 for (j
= 0; j
< n_choices
; j
+= 1)
9495 LONGEST lower
, upper
;
9496 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9498 if (op
== OP_DISCRETE_RANGE
)
9501 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9503 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9508 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9520 name
= &exp
->elts
[choice_pos
+ 2].string
;
9523 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9526 error (_("Invalid record component association."));
9528 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9530 if (! find_struct_field (name
, value_type (lhs
), 0,
9531 NULL
, NULL
, NULL
, NULL
, &ind
))
9532 error (_("Unknown component name: %s."), name
);
9533 lower
= upper
= ind
;
9536 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9537 error (_("Index in component association out of bounds."));
9539 add_component_interval (lower
, upper
, indices
, num_indices
,
9541 while (lower
<= upper
)
9546 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9552 /* Assign the value of the expression in the OP_OTHERS construct in
9553 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9554 have not been previously assigned. The index intervals already assigned
9555 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9556 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9558 aggregate_assign_others (struct value
*container
,
9559 struct value
*lhs
, struct expression
*exp
,
9560 int *pos
, LONGEST
*indices
, int num_indices
,
9561 LONGEST low
, LONGEST high
)
9564 int expr_pc
= *pos
+ 1;
9566 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9570 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9575 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9578 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9581 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9582 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9583 modifying *SIZE as needed. It is an error if *SIZE exceeds
9584 MAX_SIZE. The resulting intervals do not overlap. */
9586 add_component_interval (LONGEST low
, LONGEST high
,
9587 LONGEST
* indices
, int *size
, int max_size
)
9591 for (i
= 0; i
< *size
; i
+= 2) {
9592 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9596 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9597 if (high
< indices
[kh
])
9599 if (low
< indices
[i
])
9601 indices
[i
+ 1] = indices
[kh
- 1];
9602 if (high
> indices
[i
+ 1])
9603 indices
[i
+ 1] = high
;
9604 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9605 *size
-= kh
- i
- 2;
9608 else if (high
< indices
[i
])
9612 if (*size
== max_size
)
9613 error (_("Internal error: miscounted aggregate components."));
9615 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9616 indices
[j
] = indices
[j
- 2];
9618 indices
[i
+ 1] = high
;
9621 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9624 static struct value
*
9625 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9627 if (type
== ada_check_typedef (value_type (arg2
)))
9630 if (ada_is_fixed_point_type (type
))
9631 return (cast_to_fixed (type
, arg2
));
9633 if (ada_is_fixed_point_type (value_type (arg2
)))
9634 return cast_from_fixed (type
, arg2
);
9636 return value_cast (type
, arg2
);
9639 /* Evaluating Ada expressions, and printing their result.
9640 ------------------------------------------------------
9645 We usually evaluate an Ada expression in order to print its value.
9646 We also evaluate an expression in order to print its type, which
9647 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9648 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9649 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9650 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9653 Evaluating expressions is a little more complicated for Ada entities
9654 than it is for entities in languages such as C. The main reason for
9655 this is that Ada provides types whose definition might be dynamic.
9656 One example of such types is variant records. Or another example
9657 would be an array whose bounds can only be known at run time.
9659 The following description is a general guide as to what should be
9660 done (and what should NOT be done) in order to evaluate an expression
9661 involving such types, and when. This does not cover how the semantic
9662 information is encoded by GNAT as this is covered separatly. For the
9663 document used as the reference for the GNAT encoding, see exp_dbug.ads
9664 in the GNAT sources.
9666 Ideally, we should embed each part of this description next to its
9667 associated code. Unfortunately, the amount of code is so vast right
9668 now that it's hard to see whether the code handling a particular
9669 situation might be duplicated or not. One day, when the code is
9670 cleaned up, this guide might become redundant with the comments
9671 inserted in the code, and we might want to remove it.
9673 2. ``Fixing'' an Entity, the Simple Case:
9674 -----------------------------------------
9676 When evaluating Ada expressions, the tricky issue is that they may
9677 reference entities whose type contents and size are not statically
9678 known. Consider for instance a variant record:
9680 type Rec (Empty : Boolean := True) is record
9683 when False => Value : Integer;
9686 Yes : Rec := (Empty => False, Value => 1);
9687 No : Rec := (empty => True);
9689 The size and contents of that record depends on the value of the
9690 descriminant (Rec.Empty). At this point, neither the debugging
9691 information nor the associated type structure in GDB are able to
9692 express such dynamic types. So what the debugger does is to create
9693 "fixed" versions of the type that applies to the specific object.
9694 We also informally refer to this opperation as "fixing" an object,
9695 which means creating its associated fixed type.
9697 Example: when printing the value of variable "Yes" above, its fixed
9698 type would look like this:
9705 On the other hand, if we printed the value of "No", its fixed type
9712 Things become a little more complicated when trying to fix an entity
9713 with a dynamic type that directly contains another dynamic type,
9714 such as an array of variant records, for instance. There are
9715 two possible cases: Arrays, and records.
9717 3. ``Fixing'' Arrays:
9718 ---------------------
9720 The type structure in GDB describes an array in terms of its bounds,
9721 and the type of its elements. By design, all elements in the array
9722 have the same type and we cannot represent an array of variant elements
9723 using the current type structure in GDB. When fixing an array,
9724 we cannot fix the array element, as we would potentially need one
9725 fixed type per element of the array. As a result, the best we can do
9726 when fixing an array is to produce an array whose bounds and size
9727 are correct (allowing us to read it from memory), but without having
9728 touched its element type. Fixing each element will be done later,
9729 when (if) necessary.
9731 Arrays are a little simpler to handle than records, because the same
9732 amount of memory is allocated for each element of the array, even if
9733 the amount of space actually used by each element differs from element
9734 to element. Consider for instance the following array of type Rec:
9736 type Rec_Array is array (1 .. 2) of Rec;
9738 The actual amount of memory occupied by each element might be different
9739 from element to element, depending on the value of their discriminant.
9740 But the amount of space reserved for each element in the array remains
9741 fixed regardless. So we simply need to compute that size using
9742 the debugging information available, from which we can then determine
9743 the array size (we multiply the number of elements of the array by
9744 the size of each element).
9746 The simplest case is when we have an array of a constrained element
9747 type. For instance, consider the following type declarations:
9749 type Bounded_String (Max_Size : Integer) is
9751 Buffer : String (1 .. Max_Size);
9753 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9755 In this case, the compiler describes the array as an array of
9756 variable-size elements (identified by its XVS suffix) for which
9757 the size can be read in the parallel XVZ variable.
9759 In the case of an array of an unconstrained element type, the compiler
9760 wraps the array element inside a private PAD type. This type should not
9761 be shown to the user, and must be "unwrap"'ed before printing. Note
9762 that we also use the adjective "aligner" in our code to designate
9763 these wrapper types.
9765 In some cases, the size allocated for each element is statically
9766 known. In that case, the PAD type already has the correct size,
9767 and the array element should remain unfixed.
9769 But there are cases when this size is not statically known.
9770 For instance, assuming that "Five" is an integer variable:
9772 type Dynamic is array (1 .. Five) of Integer;
9773 type Wrapper (Has_Length : Boolean := False) is record
9776 when True => Length : Integer;
9780 type Wrapper_Array is array (1 .. 2) of Wrapper;
9782 Hello : Wrapper_Array := (others => (Has_Length => True,
9783 Data => (others => 17),
9787 The debugging info would describe variable Hello as being an
9788 array of a PAD type. The size of that PAD type is not statically
9789 known, but can be determined using a parallel XVZ variable.
9790 In that case, a copy of the PAD type with the correct size should
9791 be used for the fixed array.
9793 3. ``Fixing'' record type objects:
9794 ----------------------------------
9796 Things are slightly different from arrays in the case of dynamic
9797 record types. In this case, in order to compute the associated
9798 fixed type, we need to determine the size and offset of each of
9799 its components. This, in turn, requires us to compute the fixed
9800 type of each of these components.
9802 Consider for instance the example:
9804 type Bounded_String (Max_Size : Natural) is record
9805 Str : String (1 .. Max_Size);
9808 My_String : Bounded_String (Max_Size => 10);
9810 In that case, the position of field "Length" depends on the size
9811 of field Str, which itself depends on the value of the Max_Size
9812 discriminant. In order to fix the type of variable My_String,
9813 we need to fix the type of field Str. Therefore, fixing a variant
9814 record requires us to fix each of its components.
9816 However, if a component does not have a dynamic size, the component
9817 should not be fixed. In particular, fields that use a PAD type
9818 should not fixed. Here is an example where this might happen
9819 (assuming type Rec above):
9821 type Container (Big : Boolean) is record
9825 when True => Another : Integer;
9829 My_Container : Container := (Big => False,
9830 First => (Empty => True),
9833 In that example, the compiler creates a PAD type for component First,
9834 whose size is constant, and then positions the component After just
9835 right after it. The offset of component After is therefore constant
9838 The debugger computes the position of each field based on an algorithm
9839 that uses, among other things, the actual position and size of the field
9840 preceding it. Let's now imagine that the user is trying to print
9841 the value of My_Container. If the type fixing was recursive, we would
9842 end up computing the offset of field After based on the size of the
9843 fixed version of field First. And since in our example First has
9844 only one actual field, the size of the fixed type is actually smaller
9845 than the amount of space allocated to that field, and thus we would
9846 compute the wrong offset of field After.
9848 To make things more complicated, we need to watch out for dynamic
9849 components of variant records (identified by the ___XVL suffix in
9850 the component name). Even if the target type is a PAD type, the size
9851 of that type might not be statically known. So the PAD type needs
9852 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9853 we might end up with the wrong size for our component. This can be
9854 observed with the following type declarations:
9856 type Octal is new Integer range 0 .. 7;
9857 type Octal_Array is array (Positive range <>) of Octal;
9858 pragma Pack (Octal_Array);
9860 type Octal_Buffer (Size : Positive) is record
9861 Buffer : Octal_Array (1 .. Size);
9865 In that case, Buffer is a PAD type whose size is unset and needs
9866 to be computed by fixing the unwrapped type.
9868 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9869 ----------------------------------------------------------
9871 Lastly, when should the sub-elements of an entity that remained unfixed
9872 thus far, be actually fixed?
9874 The answer is: Only when referencing that element. For instance
9875 when selecting one component of a record, this specific component
9876 should be fixed at that point in time. Or when printing the value
9877 of a record, each component should be fixed before its value gets
9878 printed. Similarly for arrays, the element of the array should be
9879 fixed when printing each element of the array, or when extracting
9880 one element out of that array. On the other hand, fixing should
9881 not be performed on the elements when taking a slice of an array!
9883 Note that one of the side-effects of miscomputing the offset and
9884 size of each field is that we end up also miscomputing the size
9885 of the containing type. This can have adverse results when computing
9886 the value of an entity. GDB fetches the value of an entity based
9887 on the size of its type, and thus a wrong size causes GDB to fetch
9888 the wrong amount of memory. In the case where the computed size is
9889 too small, GDB fetches too little data to print the value of our
9890 entiry. Results in this case as unpredicatble, as we usually read
9891 past the buffer containing the data =:-o. */
9893 /* Implement the evaluate_exp routine in the exp_descriptor structure
9894 for the Ada language. */
9896 static struct value
*
9897 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
9898 int *pos
, enum noside noside
)
9904 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
9907 struct value
**argvec
;
9911 op
= exp
->elts
[pc
].opcode
;
9917 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9919 if (noside
== EVAL_NORMAL
)
9920 arg1
= unwrap_value (arg1
);
9922 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9923 then we need to perform the conversion manually, because
9924 evaluate_subexp_standard doesn't do it. This conversion is
9925 necessary in Ada because the different kinds of float/fixed
9926 types in Ada have different representations.
9928 Similarly, we need to perform the conversion from OP_LONG
9930 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
9931 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
9937 struct value
*result
;
9940 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9941 /* The result type will have code OP_STRING, bashed there from
9942 OP_ARRAY. Bash it back. */
9943 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
9944 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
9950 type
= exp
->elts
[pc
+ 1].type
;
9951 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
9952 if (noside
== EVAL_SKIP
)
9954 arg1
= ada_value_cast (type
, arg1
, noside
);
9959 type
= exp
->elts
[pc
+ 1].type
;
9960 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
9963 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9964 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9966 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
9967 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9969 return ada_value_assign (arg1
, arg1
);
9971 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9972 except if the lhs of our assignment is a convenience variable.
9973 In the case of assigning to a convenience variable, the lhs
9974 should be exactly the result of the evaluation of the rhs. */
9975 type
= value_type (arg1
);
9976 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9978 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
9979 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9981 if (ada_is_fixed_point_type (value_type (arg1
)))
9982 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
9983 else if (ada_is_fixed_point_type (value_type (arg2
)))
9985 (_("Fixed-point values must be assigned to fixed-point variables"));
9987 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
9988 return ada_value_assign (arg1
, arg2
);
9991 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9992 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9993 if (noside
== EVAL_SKIP
)
9995 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9996 return (value_from_longest
9998 value_as_long (arg1
) + value_as_long (arg2
)));
9999 if ((ada_is_fixed_point_type (value_type (arg1
))
10000 || ada_is_fixed_point_type (value_type (arg2
)))
10001 && value_type (arg1
) != value_type (arg2
))
10002 error (_("Operands of fixed-point addition must have the same type"));
10003 /* Do the addition, and cast the result to the type of the first
10004 argument. We cannot cast the result to a reference type, so if
10005 ARG1 is a reference type, find its underlying type. */
10006 type
= value_type (arg1
);
10007 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10008 type
= TYPE_TARGET_TYPE (type
);
10009 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10010 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10013 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10014 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10015 if (noside
== EVAL_SKIP
)
10017 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10018 return (value_from_longest
10019 (value_type (arg1
),
10020 value_as_long (arg1
) - value_as_long (arg2
)));
10021 if ((ada_is_fixed_point_type (value_type (arg1
))
10022 || ada_is_fixed_point_type (value_type (arg2
)))
10023 && value_type (arg1
) != value_type (arg2
))
10024 error (_("Operands of fixed-point subtraction "
10025 "must have the same type"));
10026 /* Do the substraction, and cast the result to the type of the first
10027 argument. We cannot cast the result to a reference type, so if
10028 ARG1 is a reference type, find its underlying type. */
10029 type
= value_type (arg1
);
10030 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10031 type
= TYPE_TARGET_TYPE (type
);
10032 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10033 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10039 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10040 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10041 if (noside
== EVAL_SKIP
)
10043 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10045 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10046 return value_zero (value_type (arg1
), not_lval
);
10050 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10051 if (ada_is_fixed_point_type (value_type (arg1
)))
10052 arg1
= cast_from_fixed (type
, arg1
);
10053 if (ada_is_fixed_point_type (value_type (arg2
)))
10054 arg2
= cast_from_fixed (type
, arg2
);
10055 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10056 return ada_value_binop (arg1
, arg2
, op
);
10060 case BINOP_NOTEQUAL
:
10061 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10062 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10063 if (noside
== EVAL_SKIP
)
10065 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10069 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10070 tem
= ada_value_equal (arg1
, arg2
);
10072 if (op
== BINOP_NOTEQUAL
)
10074 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10075 return value_from_longest (type
, (LONGEST
) tem
);
10078 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10079 if (noside
== EVAL_SKIP
)
10081 else if (ada_is_fixed_point_type (value_type (arg1
)))
10082 return value_cast (value_type (arg1
), value_neg (arg1
));
10085 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10086 return value_neg (arg1
);
10089 case BINOP_LOGICAL_AND
:
10090 case BINOP_LOGICAL_OR
:
10091 case UNOP_LOGICAL_NOT
:
10096 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10097 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10098 return value_cast (type
, val
);
10101 case BINOP_BITWISE_AND
:
10102 case BINOP_BITWISE_IOR
:
10103 case BINOP_BITWISE_XOR
:
10107 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10109 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10111 return value_cast (value_type (arg1
), val
);
10117 if (noside
== EVAL_SKIP
)
10123 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10124 /* Only encountered when an unresolved symbol occurs in a
10125 context other than a function call, in which case, it is
10127 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10128 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10130 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10132 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10133 /* Check to see if this is a tagged type. We also need to handle
10134 the case where the type is a reference to a tagged type, but
10135 we have to be careful to exclude pointers to tagged types.
10136 The latter should be shown as usual (as a pointer), whereas
10137 a reference should mostly be transparent to the user. */
10138 if (ada_is_tagged_type (type
, 0)
10139 || (TYPE_CODE (type
) == TYPE_CODE_REF
10140 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10142 /* Tagged types are a little special in the fact that the real
10143 type is dynamic and can only be determined by inspecting the
10144 object's tag. This means that we need to get the object's
10145 value first (EVAL_NORMAL) and then extract the actual object
10148 Note that we cannot skip the final step where we extract
10149 the object type from its tag, because the EVAL_NORMAL phase
10150 results in dynamic components being resolved into fixed ones.
10151 This can cause problems when trying to print the type
10152 description of tagged types whose parent has a dynamic size:
10153 We use the type name of the "_parent" component in order
10154 to print the name of the ancestor type in the type description.
10155 If that component had a dynamic size, the resolution into
10156 a fixed type would result in the loss of that type name,
10157 thus preventing us from printing the name of the ancestor
10158 type in the type description. */
10159 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10161 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10163 struct type
*actual_type
;
10165 actual_type
= type_from_tag (ada_value_tag (arg1
));
10166 if (actual_type
== NULL
)
10167 /* If, for some reason, we were unable to determine
10168 the actual type from the tag, then use the static
10169 approximation that we just computed as a fallback.
10170 This can happen if the debugging information is
10171 incomplete, for instance. */
10172 actual_type
= type
;
10173 return value_zero (actual_type
, not_lval
);
10177 /* In the case of a ref, ada_coerce_ref takes care
10178 of determining the actual type. But the evaluation
10179 should return a ref as it should be valid to ask
10180 for its address; so rebuild a ref after coerce. */
10181 arg1
= ada_coerce_ref (arg1
);
10182 return value_ref (arg1
);
10186 /* Records and unions for which GNAT encodings have been
10187 generated need to be statically fixed as well.
10188 Otherwise, non-static fixing produces a type where
10189 all dynamic properties are removed, which prevents "ptype"
10190 from being able to completely describe the type.
10191 For instance, a case statement in a variant record would be
10192 replaced by the relevant components based on the actual
10193 value of the discriminants. */
10194 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10195 && dynamic_template_type (type
) != NULL
)
10196 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10197 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10200 return value_zero (to_static_fixed_type (type
), not_lval
);
10204 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10205 return ada_to_fixed_value (arg1
);
10210 /* Allocate arg vector, including space for the function to be
10211 called in argvec[0] and a terminating NULL. */
10212 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10214 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
10216 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10217 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10218 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10219 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10222 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10223 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10226 if (noside
== EVAL_SKIP
)
10230 if (ada_is_constrained_packed_array_type
10231 (desc_base_type (value_type (argvec
[0]))))
10232 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10233 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10234 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10235 /* This is a packed array that has already been fixed, and
10236 therefore already coerced to a simple array. Nothing further
10239 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
10240 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10241 && VALUE_LVAL (argvec
[0]) == lval_memory
))
10242 argvec
[0] = value_addr (argvec
[0]);
10244 type
= ada_check_typedef (value_type (argvec
[0]));
10246 /* Ada allows us to implicitly dereference arrays when subscripting
10247 them. So, if this is an array typedef (encoding use for array
10248 access types encoded as fat pointers), strip it now. */
10249 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10250 type
= ada_typedef_target_type (type
);
10252 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10254 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10256 case TYPE_CODE_FUNC
:
10257 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10259 case TYPE_CODE_ARRAY
:
10261 case TYPE_CODE_STRUCT
:
10262 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10263 argvec
[0] = ada_value_ind (argvec
[0]);
10264 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10267 error (_("cannot subscript or call something of type `%s'"),
10268 ada_type_name (value_type (argvec
[0])));
10273 switch (TYPE_CODE (type
))
10275 case TYPE_CODE_FUNC
:
10276 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10278 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10280 if (TYPE_GNU_IFUNC (type
))
10281 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10282 return allocate_value (rtype
);
10284 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10285 case TYPE_CODE_INTERNAL_FUNCTION
:
10286 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10287 /* We don't know anything about what the internal
10288 function might return, but we have to return
10290 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10293 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10294 argvec
[0], nargs
, argvec
+ 1);
10296 case TYPE_CODE_STRUCT
:
10300 arity
= ada_array_arity (type
);
10301 type
= ada_array_element_type (type
, nargs
);
10303 error (_("cannot subscript or call a record"));
10304 if (arity
!= nargs
)
10305 error (_("wrong number of subscripts; expecting %d"), arity
);
10306 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10307 return value_zero (ada_aligned_type (type
), lval_memory
);
10309 unwrap_value (ada_value_subscript
10310 (argvec
[0], nargs
, argvec
+ 1));
10312 case TYPE_CODE_ARRAY
:
10313 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10315 type
= ada_array_element_type (type
, nargs
);
10317 error (_("element type of array unknown"));
10319 return value_zero (ada_aligned_type (type
), lval_memory
);
10322 unwrap_value (ada_value_subscript
10323 (ada_coerce_to_simple_array (argvec
[0]),
10324 nargs
, argvec
+ 1));
10325 case TYPE_CODE_PTR
: /* Pointer to array */
10326 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10327 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10329 type
= ada_array_element_type (type
, nargs
);
10331 error (_("element type of array unknown"));
10333 return value_zero (ada_aligned_type (type
), lval_memory
);
10336 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
10337 nargs
, argvec
+ 1));
10340 error (_("Attempt to index or call something other than an "
10341 "array or function"));
10346 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10347 struct value
*low_bound_val
=
10348 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10349 struct value
*high_bound_val
=
10350 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10352 LONGEST high_bound
;
10354 low_bound_val
= coerce_ref (low_bound_val
);
10355 high_bound_val
= coerce_ref (high_bound_val
);
10356 low_bound
= pos_atr (low_bound_val
);
10357 high_bound
= pos_atr (high_bound_val
);
10359 if (noside
== EVAL_SKIP
)
10362 /* If this is a reference to an aligner type, then remove all
10364 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10365 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10366 TYPE_TARGET_TYPE (value_type (array
)) =
10367 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10369 if (ada_is_constrained_packed_array_type (value_type (array
)))
10370 error (_("cannot slice a packed array"));
10372 /* If this is a reference to an array or an array lvalue,
10373 convert to a pointer. */
10374 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10375 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10376 && VALUE_LVAL (array
) == lval_memory
))
10377 array
= value_addr (array
);
10379 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10380 && ada_is_array_descriptor_type (ada_check_typedef
10381 (value_type (array
))))
10382 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10384 array
= ada_coerce_to_simple_array_ptr (array
);
10386 /* If we have more than one level of pointer indirection,
10387 dereference the value until we get only one level. */
10388 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10389 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10391 array
= value_ind (array
);
10393 /* Make sure we really do have an array type before going further,
10394 to avoid a SEGV when trying to get the index type or the target
10395 type later down the road if the debug info generated by
10396 the compiler is incorrect or incomplete. */
10397 if (!ada_is_simple_array_type (value_type (array
)))
10398 error (_("cannot take slice of non-array"));
10400 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10403 struct type
*type0
= ada_check_typedef (value_type (array
));
10405 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10406 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10409 struct type
*arr_type0
=
10410 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10412 return ada_value_slice_from_ptr (array
, arr_type0
,
10413 longest_to_int (low_bound
),
10414 longest_to_int (high_bound
));
10417 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10419 else if (high_bound
< low_bound
)
10420 return empty_array (value_type (array
), low_bound
);
10422 return ada_value_slice (array
, longest_to_int (low_bound
),
10423 longest_to_int (high_bound
));
10426 case UNOP_IN_RANGE
:
10428 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10429 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10431 if (noside
== EVAL_SKIP
)
10434 switch (TYPE_CODE (type
))
10437 lim_warning (_("Membership test incompletely implemented; "
10438 "always returns true"));
10439 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10440 return value_from_longest (type
, (LONGEST
) 1);
10442 case TYPE_CODE_RANGE
:
10443 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10444 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10445 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10446 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10447 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10449 value_from_longest (type
,
10450 (value_less (arg1
, arg3
)
10451 || value_equal (arg1
, arg3
))
10452 && (value_less (arg2
, arg1
)
10453 || value_equal (arg2
, arg1
)));
10456 case BINOP_IN_BOUNDS
:
10458 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10459 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10461 if (noside
== EVAL_SKIP
)
10464 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10466 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10467 return value_zero (type
, not_lval
);
10470 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10472 type
= ada_index_type (value_type (arg2
), tem
, "range");
10474 type
= value_type (arg1
);
10476 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10477 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10479 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10480 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10481 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10483 value_from_longest (type
,
10484 (value_less (arg1
, arg3
)
10485 || value_equal (arg1
, arg3
))
10486 && (value_less (arg2
, arg1
)
10487 || value_equal (arg2
, arg1
)));
10489 case TERNOP_IN_RANGE
:
10490 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10491 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10492 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10494 if (noside
== EVAL_SKIP
)
10497 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10498 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10499 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10501 value_from_longest (type
,
10502 (value_less (arg1
, arg3
)
10503 || value_equal (arg1
, arg3
))
10504 && (value_less (arg2
, arg1
)
10505 || value_equal (arg2
, arg1
)));
10509 case OP_ATR_LENGTH
:
10511 struct type
*type_arg
;
10513 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10515 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10517 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10521 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10525 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10526 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10527 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10530 if (noside
== EVAL_SKIP
)
10533 if (type_arg
== NULL
)
10535 arg1
= ada_coerce_ref (arg1
);
10537 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10538 arg1
= ada_coerce_to_simple_array (arg1
);
10540 if (op
== OP_ATR_LENGTH
)
10541 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10544 type
= ada_index_type (value_type (arg1
), tem
,
10545 ada_attribute_name (op
));
10547 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10550 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10551 return allocate_value (type
);
10555 default: /* Should never happen. */
10556 error (_("unexpected attribute encountered"));
10558 return value_from_longest
10559 (type
, ada_array_bound (arg1
, tem
, 0));
10561 return value_from_longest
10562 (type
, ada_array_bound (arg1
, tem
, 1));
10563 case OP_ATR_LENGTH
:
10564 return value_from_longest
10565 (type
, ada_array_length (arg1
, tem
));
10568 else if (discrete_type_p (type_arg
))
10570 struct type
*range_type
;
10571 const char *name
= ada_type_name (type_arg
);
10574 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10575 range_type
= to_fixed_range_type (type_arg
, NULL
);
10576 if (range_type
== NULL
)
10577 range_type
= type_arg
;
10581 error (_("unexpected attribute encountered"));
10583 return value_from_longest
10584 (range_type
, ada_discrete_type_low_bound (range_type
));
10586 return value_from_longest
10587 (range_type
, ada_discrete_type_high_bound (range_type
));
10588 case OP_ATR_LENGTH
:
10589 error (_("the 'length attribute applies only to array types"));
10592 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10593 error (_("unimplemented type attribute"));
10598 if (ada_is_constrained_packed_array_type (type_arg
))
10599 type_arg
= decode_constrained_packed_array_type (type_arg
);
10601 if (op
== OP_ATR_LENGTH
)
10602 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10605 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10607 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10610 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10611 return allocate_value (type
);
10616 error (_("unexpected attribute encountered"));
10618 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10619 return value_from_longest (type
, low
);
10621 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10622 return value_from_longest (type
, high
);
10623 case OP_ATR_LENGTH
:
10624 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10625 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10626 return value_from_longest (type
, high
- low
+ 1);
10632 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10633 if (noside
== EVAL_SKIP
)
10636 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10637 return value_zero (ada_tag_type (arg1
), not_lval
);
10639 return ada_value_tag (arg1
);
10643 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10644 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10645 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10646 if (noside
== EVAL_SKIP
)
10648 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10649 return value_zero (value_type (arg1
), not_lval
);
10652 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10653 return value_binop (arg1
, arg2
,
10654 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10657 case OP_ATR_MODULUS
:
10659 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10661 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10662 if (noside
== EVAL_SKIP
)
10665 if (!ada_is_modular_type (type_arg
))
10666 error (_("'modulus must be applied to modular type"));
10668 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10669 ada_modulus (type_arg
));
10674 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10675 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10676 if (noside
== EVAL_SKIP
)
10678 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10679 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10680 return value_zero (type
, not_lval
);
10682 return value_pos_atr (type
, arg1
);
10685 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10686 type
= value_type (arg1
);
10688 /* If the argument is a reference, then dereference its type, since
10689 the user is really asking for the size of the actual object,
10690 not the size of the pointer. */
10691 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10692 type
= TYPE_TARGET_TYPE (type
);
10694 if (noside
== EVAL_SKIP
)
10696 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10697 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10699 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10700 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10703 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10704 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10705 type
= exp
->elts
[pc
+ 2].type
;
10706 if (noside
== EVAL_SKIP
)
10708 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10709 return value_zero (type
, not_lval
);
10711 return value_val_atr (type
, arg1
);
10714 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10715 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10716 if (noside
== EVAL_SKIP
)
10718 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10719 return value_zero (value_type (arg1
), not_lval
);
10722 /* For integer exponentiation operations,
10723 only promote the first argument. */
10724 if (is_integral_type (value_type (arg2
)))
10725 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10727 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10729 return value_binop (arg1
, arg2
, op
);
10733 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10734 if (noside
== EVAL_SKIP
)
10740 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10741 if (noside
== EVAL_SKIP
)
10743 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10744 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10745 return value_neg (arg1
);
10750 preeval_pos
= *pos
;
10751 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10752 if (noside
== EVAL_SKIP
)
10754 type
= ada_check_typedef (value_type (arg1
));
10755 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10757 if (ada_is_array_descriptor_type (type
))
10758 /* GDB allows dereferencing GNAT array descriptors. */
10760 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10762 if (arrType
== NULL
)
10763 error (_("Attempt to dereference null array pointer."));
10764 return value_at_lazy (arrType
, 0);
10766 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10767 || TYPE_CODE (type
) == TYPE_CODE_REF
10768 /* In C you can dereference an array to get the 1st elt. */
10769 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10771 /* As mentioned in the OP_VAR_VALUE case, tagged types can
10772 only be determined by inspecting the object's tag.
10773 This means that we need to evaluate completely the
10774 expression in order to get its type. */
10776 if ((TYPE_CODE (type
) == TYPE_CODE_REF
10777 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
10778 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
10780 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10782 type
= value_type (ada_value_ind (arg1
));
10786 type
= to_static_fixed_type
10788 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10791 return value_zero (type
, lval_memory
);
10793 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10795 /* GDB allows dereferencing an int. */
10796 if (expect_type
== NULL
)
10797 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10802 to_static_fixed_type (ada_aligned_type (expect_type
));
10803 return value_zero (expect_type
, lval_memory
);
10807 error (_("Attempt to take contents of a non-pointer value."));
10809 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10810 type
= ada_check_typedef (value_type (arg1
));
10812 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10813 /* GDB allows dereferencing an int. If we were given
10814 the expect_type, then use that as the target type.
10815 Otherwise, assume that the target type is an int. */
10817 if (expect_type
!= NULL
)
10818 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10821 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10822 (CORE_ADDR
) value_as_address (arg1
));
10825 if (ada_is_array_descriptor_type (type
))
10826 /* GDB allows dereferencing GNAT array descriptors. */
10827 return ada_coerce_to_simple_array (arg1
);
10829 return ada_value_ind (arg1
);
10831 case STRUCTOP_STRUCT
:
10832 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10833 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
10834 preeval_pos
= *pos
;
10835 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10836 if (noside
== EVAL_SKIP
)
10838 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10840 struct type
*type1
= value_type (arg1
);
10842 if (ada_is_tagged_type (type1
, 1))
10844 type
= ada_lookup_struct_elt_type (type1
,
10845 &exp
->elts
[pc
+ 2].string
,
10848 /* If the field is not found, check if it exists in the
10849 extension of this object's type. This means that we
10850 need to evaluate completely the expression. */
10854 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10856 arg1
= ada_value_struct_elt (arg1
,
10857 &exp
->elts
[pc
+ 2].string
,
10859 arg1
= unwrap_value (arg1
);
10860 type
= value_type (ada_to_fixed_value (arg1
));
10865 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
10868 return value_zero (ada_aligned_type (type
), lval_memory
);
10871 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
10872 arg1
= unwrap_value (arg1
);
10873 return ada_to_fixed_value (arg1
);
10876 /* The value is not supposed to be used. This is here to make it
10877 easier to accommodate expressions that contain types. */
10879 if (noside
== EVAL_SKIP
)
10881 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10882 return allocate_value (exp
->elts
[pc
+ 1].type
);
10884 error (_("Attempt to use a type name as an expression"));
10889 case OP_DISCRETE_RANGE
:
10890 case OP_POSITIONAL
:
10892 if (noside
== EVAL_NORMAL
)
10896 error (_("Undefined name, ambiguous name, or renaming used in "
10897 "component association: %s."), &exp
->elts
[pc
+2].string
);
10899 error (_("Aggregates only allowed on the right of an assignment"));
10901 internal_error (__FILE__
, __LINE__
,
10902 _("aggregate apparently mangled"));
10905 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10907 for (tem
= 0; tem
< nargs
; tem
+= 1)
10908 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
10913 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
10919 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10920 type name that encodes the 'small and 'delta information.
10921 Otherwise, return NULL. */
10923 static const char *
10924 fixed_type_info (struct type
*type
)
10926 const char *name
= ada_type_name (type
);
10927 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
10929 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
10931 const char *tail
= strstr (name
, "___XF_");
10938 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
10939 return fixed_type_info (TYPE_TARGET_TYPE (type
));
10944 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10947 ada_is_fixed_point_type (struct type
*type
)
10949 return fixed_type_info (type
) != NULL
;
10952 /* Return non-zero iff TYPE represents a System.Address type. */
10955 ada_is_system_address_type (struct type
*type
)
10957 return (TYPE_NAME (type
)
10958 && strcmp (TYPE_NAME (type
), "system__address") == 0);
10961 /* Assuming that TYPE is the representation of an Ada fixed-point
10962 type, return its delta, or -1 if the type is malformed and the
10963 delta cannot be determined. */
10966 ada_delta (struct type
*type
)
10968 const char *encoding
= fixed_type_info (type
);
10971 /* Strictly speaking, num and den are encoded as integer. However,
10972 they may not fit into a long, and they will have to be converted
10973 to DOUBLEST anyway. So scan them as DOUBLEST. */
10974 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10981 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10982 factor ('SMALL value) associated with the type. */
10985 scaling_factor (struct type
*type
)
10987 const char *encoding
= fixed_type_info (type
);
10988 DOUBLEST num0
, den0
, num1
, den1
;
10991 /* Strictly speaking, num's and den's are encoded as integer. However,
10992 they may not fit into a long, and they will have to be converted
10993 to DOUBLEST anyway. So scan them as DOUBLEST. */
10994 n
= sscanf (encoding
,
10995 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
10996 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10997 &num0
, &den0
, &num1
, &den1
);
11002 return num1
/ den1
;
11004 return num0
/ den0
;
11008 /* Assuming that X is the representation of a value of fixed-point
11009 type TYPE, return its floating-point equivalent. */
11012 ada_fixed_to_float (struct type
*type
, LONGEST x
)
11014 return (DOUBLEST
) x
*scaling_factor (type
);
11017 /* The representation of a fixed-point value of type TYPE
11018 corresponding to the value X. */
11021 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
11023 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
11030 /* Scan STR beginning at position K for a discriminant name, and
11031 return the value of that discriminant field of DVAL in *PX. If
11032 PNEW_K is not null, put the position of the character beyond the
11033 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11034 not alter *PX and *PNEW_K if unsuccessful. */
11037 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11040 static char *bound_buffer
= NULL
;
11041 static size_t bound_buffer_len
= 0;
11044 struct value
*bound_val
;
11046 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11049 pend
= strstr (str
+ k
, "__");
11053 k
+= strlen (bound
);
11057 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
11058 bound
= bound_buffer
;
11059 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
11060 bound
[pend
- (str
+ k
)] = '\0';
11064 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11065 if (bound_val
== NULL
)
11068 *px
= value_as_long (bound_val
);
11069 if (pnew_k
!= NULL
)
11074 /* Value of variable named NAME in the current environment. If
11075 no such variable found, then if ERR_MSG is null, returns 0, and
11076 otherwise causes an error with message ERR_MSG. */
11078 static struct value
*
11079 get_var_value (char *name
, char *err_msg
)
11081 struct ada_symbol_info
*syms
;
11084 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11089 if (err_msg
== NULL
)
11092 error (("%s"), err_msg
);
11095 return value_of_variable (syms
[0].sym
, syms
[0].block
);
11098 /* Value of integer variable named NAME in the current environment. If
11099 no such variable found, returns 0, and sets *FLAG to 0. If
11100 successful, sets *FLAG to 1. */
11103 get_int_var_value (char *name
, int *flag
)
11105 struct value
*var_val
= get_var_value (name
, 0);
11117 return value_as_long (var_val
);
11122 /* Return a range type whose base type is that of the range type named
11123 NAME in the current environment, and whose bounds are calculated
11124 from NAME according to the GNAT range encoding conventions.
11125 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11126 corresponding range type from debug information; fall back to using it
11127 if symbol lookup fails. If a new type must be created, allocate it
11128 like ORIG_TYPE was. The bounds information, in general, is encoded
11129 in NAME, the base type given in the named range type. */
11131 static struct type
*
11132 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11135 struct type
*base_type
;
11136 char *subtype_info
;
11138 gdb_assert (raw_type
!= NULL
);
11139 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11141 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11142 base_type
= TYPE_TARGET_TYPE (raw_type
);
11144 base_type
= raw_type
;
11146 name
= TYPE_NAME (raw_type
);
11147 subtype_info
= strstr (name
, "___XD");
11148 if (subtype_info
== NULL
)
11150 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11151 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11153 if (L
< INT_MIN
|| U
> INT_MAX
)
11156 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11161 static char *name_buf
= NULL
;
11162 static size_t name_len
= 0;
11163 int prefix_len
= subtype_info
- name
;
11169 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11170 strncpy (name_buf
, name
, prefix_len
);
11171 name_buf
[prefix_len
] = '\0';
11174 bounds_str
= strchr (subtype_info
, '_');
11177 if (*subtype_info
== 'L')
11179 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11180 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11182 if (bounds_str
[n
] == '_')
11184 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11192 strcpy (name_buf
+ prefix_len
, "___L");
11193 L
= get_int_var_value (name_buf
, &ok
);
11196 lim_warning (_("Unknown lower bound, using 1."));
11201 if (*subtype_info
== 'U')
11203 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11204 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11211 strcpy (name_buf
+ prefix_len
, "___U");
11212 U
= get_int_var_value (name_buf
, &ok
);
11215 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11220 type
= create_static_range_type (alloc_type_copy (raw_type
),
11222 TYPE_NAME (type
) = name
;
11227 /* True iff NAME is the name of a range type. */
11230 ada_is_range_type_name (const char *name
)
11232 return (name
!= NULL
&& strstr (name
, "___XD"));
11236 /* Modular types */
11238 /* True iff TYPE is an Ada modular type. */
11241 ada_is_modular_type (struct type
*type
)
11243 struct type
*subranged_type
= get_base_type (type
);
11245 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11246 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11247 && TYPE_UNSIGNED (subranged_type
));
11250 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11253 ada_modulus (struct type
*type
)
11255 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11259 /* Ada exception catchpoint support:
11260 ---------------------------------
11262 We support 3 kinds of exception catchpoints:
11263 . catchpoints on Ada exceptions
11264 . catchpoints on unhandled Ada exceptions
11265 . catchpoints on failed assertions
11267 Exceptions raised during failed assertions, or unhandled exceptions
11268 could perfectly be caught with the general catchpoint on Ada exceptions.
11269 However, we can easily differentiate these two special cases, and having
11270 the option to distinguish these two cases from the rest can be useful
11271 to zero-in on certain situations.
11273 Exception catchpoints are a specialized form of breakpoint,
11274 since they rely on inserting breakpoints inside known routines
11275 of the GNAT runtime. The implementation therefore uses a standard
11276 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11279 Support in the runtime for exception catchpoints have been changed
11280 a few times already, and these changes affect the implementation
11281 of these catchpoints. In order to be able to support several
11282 variants of the runtime, we use a sniffer that will determine
11283 the runtime variant used by the program being debugged. */
11285 /* Ada's standard exceptions.
11287 The Ada 83 standard also defined Numeric_Error. But there so many
11288 situations where it was unclear from the Ada 83 Reference Manual
11289 (RM) whether Constraint_Error or Numeric_Error should be raised,
11290 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11291 Interpretation saying that anytime the RM says that Numeric_Error
11292 should be raised, the implementation may raise Constraint_Error.
11293 Ada 95 went one step further and pretty much removed Numeric_Error
11294 from the list of standard exceptions (it made it a renaming of
11295 Constraint_Error, to help preserve compatibility when compiling
11296 an Ada83 compiler). As such, we do not include Numeric_Error from
11297 this list of standard exceptions. */
11299 static char *standard_exc
[] = {
11300 "constraint_error",
11306 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11308 /* A structure that describes how to support exception catchpoints
11309 for a given executable. */
11311 struct exception_support_info
11313 /* The name of the symbol to break on in order to insert
11314 a catchpoint on exceptions. */
11315 const char *catch_exception_sym
;
11317 /* The name of the symbol to break on in order to insert
11318 a catchpoint on unhandled exceptions. */
11319 const char *catch_exception_unhandled_sym
;
11321 /* The name of the symbol to break on in order to insert
11322 a catchpoint on failed assertions. */
11323 const char *catch_assert_sym
;
11325 /* Assuming that the inferior just triggered an unhandled exception
11326 catchpoint, this function is responsible for returning the address
11327 in inferior memory where the name of that exception is stored.
11328 Return zero if the address could not be computed. */
11329 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11332 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11333 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11335 /* The following exception support info structure describes how to
11336 implement exception catchpoints with the latest version of the
11337 Ada runtime (as of 2007-03-06). */
11339 static const struct exception_support_info default_exception_support_info
=
11341 "__gnat_debug_raise_exception", /* catch_exception_sym */
11342 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11343 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11344 ada_unhandled_exception_name_addr
11347 /* The following exception support info structure describes how to
11348 implement exception catchpoints with a slightly older version
11349 of the Ada runtime. */
11351 static const struct exception_support_info exception_support_info_fallback
=
11353 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11354 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11355 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11356 ada_unhandled_exception_name_addr_from_raise
11359 /* Return nonzero if we can detect the exception support routines
11360 described in EINFO.
11362 This function errors out if an abnormal situation is detected
11363 (for instance, if we find the exception support routines, but
11364 that support is found to be incomplete). */
11367 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11369 struct symbol
*sym
;
11371 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11372 that should be compiled with debugging information. As a result, we
11373 expect to find that symbol in the symtabs. */
11375 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11378 /* Perhaps we did not find our symbol because the Ada runtime was
11379 compiled without debugging info, or simply stripped of it.
11380 It happens on some GNU/Linux distributions for instance, where
11381 users have to install a separate debug package in order to get
11382 the runtime's debugging info. In that situation, let the user
11383 know why we cannot insert an Ada exception catchpoint.
11385 Note: Just for the purpose of inserting our Ada exception
11386 catchpoint, we could rely purely on the associated minimal symbol.
11387 But we would be operating in degraded mode anyway, since we are
11388 still lacking the debugging info needed later on to extract
11389 the name of the exception being raised (this name is printed in
11390 the catchpoint message, and is also used when trying to catch
11391 a specific exception). We do not handle this case for now. */
11392 struct bound_minimal_symbol msym
11393 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11395 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11396 error (_("Your Ada runtime appears to be missing some debugging "
11397 "information.\nCannot insert Ada exception catchpoint "
11398 "in this configuration."));
11403 /* Make sure that the symbol we found corresponds to a function. */
11405 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11406 error (_("Symbol \"%s\" is not a function (class = %d)"),
11407 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11412 /* Inspect the Ada runtime and determine which exception info structure
11413 should be used to provide support for exception catchpoints.
11415 This function will always set the per-inferior exception_info,
11416 or raise an error. */
11419 ada_exception_support_info_sniffer (void)
11421 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11423 /* If the exception info is already known, then no need to recompute it. */
11424 if (data
->exception_info
!= NULL
)
11427 /* Check the latest (default) exception support info. */
11428 if (ada_has_this_exception_support (&default_exception_support_info
))
11430 data
->exception_info
= &default_exception_support_info
;
11434 /* Try our fallback exception suport info. */
11435 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11437 data
->exception_info
= &exception_support_info_fallback
;
11441 /* Sometimes, it is normal for us to not be able to find the routine
11442 we are looking for. This happens when the program is linked with
11443 the shared version of the GNAT runtime, and the program has not been
11444 started yet. Inform the user of these two possible causes if
11447 if (ada_update_initial_language (language_unknown
) != language_ada
)
11448 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11450 /* If the symbol does not exist, then check that the program is
11451 already started, to make sure that shared libraries have been
11452 loaded. If it is not started, this may mean that the symbol is
11453 in a shared library. */
11455 if (ptid_get_pid (inferior_ptid
) == 0)
11456 error (_("Unable to insert catchpoint. Try to start the program first."));
11458 /* At this point, we know that we are debugging an Ada program and
11459 that the inferior has been started, but we still are not able to
11460 find the run-time symbols. That can mean that we are in
11461 configurable run time mode, or that a-except as been optimized
11462 out by the linker... In any case, at this point it is not worth
11463 supporting this feature. */
11465 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11468 /* True iff FRAME is very likely to be that of a function that is
11469 part of the runtime system. This is all very heuristic, but is
11470 intended to be used as advice as to what frames are uninteresting
11474 is_known_support_routine (struct frame_info
*frame
)
11476 struct symtab_and_line sal
;
11478 enum language func_lang
;
11480 const char *fullname
;
11482 /* If this code does not have any debugging information (no symtab),
11483 This cannot be any user code. */
11485 find_frame_sal (frame
, &sal
);
11486 if (sal
.symtab
== NULL
)
11489 /* If there is a symtab, but the associated source file cannot be
11490 located, then assume this is not user code: Selecting a frame
11491 for which we cannot display the code would not be very helpful
11492 for the user. This should also take care of case such as VxWorks
11493 where the kernel has some debugging info provided for a few units. */
11495 fullname
= symtab_to_fullname (sal
.symtab
);
11496 if (access (fullname
, R_OK
) != 0)
11499 /* Check the unit filename againt the Ada runtime file naming.
11500 We also check the name of the objfile against the name of some
11501 known system libraries that sometimes come with debugging info
11504 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11506 re_comp (known_runtime_file_name_patterns
[i
]);
11507 if (re_exec (lbasename (sal
.symtab
->filename
)))
11509 if (sal
.symtab
->objfile
!= NULL
11510 && re_exec (objfile_name (sal
.symtab
->objfile
)))
11514 /* Check whether the function is a GNAT-generated entity. */
11516 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
11517 if (func_name
== NULL
)
11520 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11522 re_comp (known_auxiliary_function_name_patterns
[i
]);
11523 if (re_exec (func_name
))
11534 /* Find the first frame that contains debugging information and that is not
11535 part of the Ada run-time, starting from FI and moving upward. */
11538 ada_find_printable_frame (struct frame_info
*fi
)
11540 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11542 if (!is_known_support_routine (fi
))
11551 /* Assuming that the inferior just triggered an unhandled exception
11552 catchpoint, return the address in inferior memory where the name
11553 of the exception is stored.
11555 Return zero if the address could not be computed. */
11558 ada_unhandled_exception_name_addr (void)
11560 return parse_and_eval_address ("e.full_name");
11563 /* Same as ada_unhandled_exception_name_addr, except that this function
11564 should be used when the inferior uses an older version of the runtime,
11565 where the exception name needs to be extracted from a specific frame
11566 several frames up in the callstack. */
11569 ada_unhandled_exception_name_addr_from_raise (void)
11572 struct frame_info
*fi
;
11573 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11574 struct cleanup
*old_chain
;
11576 /* To determine the name of this exception, we need to select
11577 the frame corresponding to RAISE_SYM_NAME. This frame is
11578 at least 3 levels up, so we simply skip the first 3 frames
11579 without checking the name of their associated function. */
11580 fi
= get_current_frame ();
11581 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11583 fi
= get_prev_frame (fi
);
11585 old_chain
= make_cleanup (null_cleanup
, NULL
);
11589 enum language func_lang
;
11591 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
11592 if (func_name
!= NULL
)
11594 make_cleanup (xfree
, func_name
);
11596 if (strcmp (func_name
,
11597 data
->exception_info
->catch_exception_sym
) == 0)
11598 break; /* We found the frame we were looking for... */
11599 fi
= get_prev_frame (fi
);
11602 do_cleanups (old_chain
);
11608 return parse_and_eval_address ("id.full_name");
11611 /* Assuming the inferior just triggered an Ada exception catchpoint
11612 (of any type), return the address in inferior memory where the name
11613 of the exception is stored, if applicable.
11615 Return zero if the address could not be computed, or if not relevant. */
11618 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11619 struct breakpoint
*b
)
11621 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11625 case ada_catch_exception
:
11626 return (parse_and_eval_address ("e.full_name"));
11629 case ada_catch_exception_unhandled
:
11630 return data
->exception_info
->unhandled_exception_name_addr ();
11633 case ada_catch_assert
:
11634 return 0; /* Exception name is not relevant in this case. */
11638 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11642 return 0; /* Should never be reached. */
11645 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11646 any error that ada_exception_name_addr_1 might cause to be thrown.
11647 When an error is intercepted, a warning with the error message is printed,
11648 and zero is returned. */
11651 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11652 struct breakpoint
*b
)
11654 volatile struct gdb_exception e
;
11655 CORE_ADDR result
= 0;
11657 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11659 result
= ada_exception_name_addr_1 (ex
, b
);
11664 warning (_("failed to get exception name: %s"), e
.message
);
11671 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11673 /* Ada catchpoints.
11675 In the case of catchpoints on Ada exceptions, the catchpoint will
11676 stop the target on every exception the program throws. When a user
11677 specifies the name of a specific exception, we translate this
11678 request into a condition expression (in text form), and then parse
11679 it into an expression stored in each of the catchpoint's locations.
11680 We then use this condition to check whether the exception that was
11681 raised is the one the user is interested in. If not, then the
11682 target is resumed again. We store the name of the requested
11683 exception, in order to be able to re-set the condition expression
11684 when symbols change. */
11686 /* An instance of this type is used to represent an Ada catchpoint
11687 breakpoint location. It includes a "struct bp_location" as a kind
11688 of base class; users downcast to "struct bp_location *" when
11691 struct ada_catchpoint_location
11693 /* The base class. */
11694 struct bp_location base
;
11696 /* The condition that checks whether the exception that was raised
11697 is the specific exception the user specified on catchpoint
11699 struct expression
*excep_cond_expr
;
11702 /* Implement the DTOR method in the bp_location_ops structure for all
11703 Ada exception catchpoint kinds. */
11706 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11708 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11710 xfree (al
->excep_cond_expr
);
11713 /* The vtable to be used in Ada catchpoint locations. */
11715 static const struct bp_location_ops ada_catchpoint_location_ops
=
11717 ada_catchpoint_location_dtor
11720 /* An instance of this type is used to represent an Ada catchpoint.
11721 It includes a "struct breakpoint" as a kind of base class; users
11722 downcast to "struct breakpoint *" when needed. */
11724 struct ada_catchpoint
11726 /* The base class. */
11727 struct breakpoint base
;
11729 /* The name of the specific exception the user specified. */
11730 char *excep_string
;
11733 /* Parse the exception condition string in the context of each of the
11734 catchpoint's locations, and store them for later evaluation. */
11737 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11739 struct cleanup
*old_chain
;
11740 struct bp_location
*bl
;
11743 /* Nothing to do if there's no specific exception to catch. */
11744 if (c
->excep_string
== NULL
)
11747 /* Same if there are no locations... */
11748 if (c
->base
.loc
== NULL
)
11751 /* Compute the condition expression in text form, from the specific
11752 expection we want to catch. */
11753 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11754 old_chain
= make_cleanup (xfree
, cond_string
);
11756 /* Iterate over all the catchpoint's locations, and parse an
11757 expression for each. */
11758 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11760 struct ada_catchpoint_location
*ada_loc
11761 = (struct ada_catchpoint_location
*) bl
;
11762 struct expression
*exp
= NULL
;
11764 if (!bl
->shlib_disabled
)
11766 volatile struct gdb_exception e
;
11770 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11772 exp
= parse_exp_1 (&s
, bl
->address
,
11773 block_for_pc (bl
->address
), 0);
11777 warning (_("failed to reevaluate internal exception condition "
11778 "for catchpoint %d: %s"),
11779 c
->base
.number
, e
.message
);
11780 /* There is a bug in GCC on sparc-solaris when building with
11781 optimization which causes EXP to change unexpectedly
11782 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
11783 The problem should be fixed starting with GCC 4.9.
11784 In the meantime, work around it by forcing EXP back
11790 ada_loc
->excep_cond_expr
= exp
;
11793 do_cleanups (old_chain
);
11796 /* Implement the DTOR method in the breakpoint_ops structure for all
11797 exception catchpoint kinds. */
11800 dtor_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11802 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11804 xfree (c
->excep_string
);
11806 bkpt_breakpoint_ops
.dtor (b
);
11809 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11810 structure for all exception catchpoint kinds. */
11812 static struct bp_location
*
11813 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
11814 struct breakpoint
*self
)
11816 struct ada_catchpoint_location
*loc
;
11818 loc
= XNEW (struct ada_catchpoint_location
);
11819 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
11820 loc
->excep_cond_expr
= NULL
;
11824 /* Implement the RE_SET method in the breakpoint_ops structure for all
11825 exception catchpoint kinds. */
11828 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11830 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11832 /* Call the base class's method. This updates the catchpoint's
11834 bkpt_breakpoint_ops
.re_set (b
);
11836 /* Reparse the exception conditional expressions. One for each
11838 create_excep_cond_exprs (c
);
11841 /* Returns true if we should stop for this breakpoint hit. If the
11842 user specified a specific exception, we only want to cause a stop
11843 if the program thrown that exception. */
11846 should_stop_exception (const struct bp_location
*bl
)
11848 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
11849 const struct ada_catchpoint_location
*ada_loc
11850 = (const struct ada_catchpoint_location
*) bl
;
11851 volatile struct gdb_exception ex
;
11854 /* With no specific exception, should always stop. */
11855 if (c
->excep_string
== NULL
)
11858 if (ada_loc
->excep_cond_expr
== NULL
)
11860 /* We will have a NULL expression if back when we were creating
11861 the expressions, this location's had failed to parse. */
11866 TRY_CATCH (ex
, RETURN_MASK_ALL
)
11868 struct value
*mark
;
11870 mark
= value_mark ();
11871 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
11872 value_free_to_mark (mark
);
11875 exception_fprintf (gdb_stderr
, ex
,
11876 _("Error in testing exception condition:\n"));
11880 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11881 for all exception catchpoint kinds. */
11884 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
11886 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
11889 /* Implement the PRINT_IT method in the breakpoint_ops structure
11890 for all exception catchpoint kinds. */
11892 static enum print_stop_action
11893 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
11895 struct ui_out
*uiout
= current_uiout
;
11896 struct breakpoint
*b
= bs
->breakpoint_at
;
11898 annotate_catchpoint (b
->number
);
11900 if (ui_out_is_mi_like_p (uiout
))
11902 ui_out_field_string (uiout
, "reason",
11903 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
11904 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
11907 ui_out_text (uiout
,
11908 b
->disposition
== disp_del
? "\nTemporary catchpoint "
11909 : "\nCatchpoint ");
11910 ui_out_field_int (uiout
, "bkptno", b
->number
);
11911 ui_out_text (uiout
, ", ");
11915 case ada_catch_exception
:
11916 case ada_catch_exception_unhandled
:
11918 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
11919 char exception_name
[256];
11923 read_memory (addr
, (gdb_byte
*) exception_name
,
11924 sizeof (exception_name
) - 1);
11925 exception_name
[sizeof (exception_name
) - 1] = '\0';
11929 /* For some reason, we were unable to read the exception
11930 name. This could happen if the Runtime was compiled
11931 without debugging info, for instance. In that case,
11932 just replace the exception name by the generic string
11933 "exception" - it will read as "an exception" in the
11934 notification we are about to print. */
11935 memcpy (exception_name
, "exception", sizeof ("exception"));
11937 /* In the case of unhandled exception breakpoints, we print
11938 the exception name as "unhandled EXCEPTION_NAME", to make
11939 it clearer to the user which kind of catchpoint just got
11940 hit. We used ui_out_text to make sure that this extra
11941 info does not pollute the exception name in the MI case. */
11942 if (ex
== ada_catch_exception_unhandled
)
11943 ui_out_text (uiout
, "unhandled ");
11944 ui_out_field_string (uiout
, "exception-name", exception_name
);
11947 case ada_catch_assert
:
11948 /* In this case, the name of the exception is not really
11949 important. Just print "failed assertion" to make it clearer
11950 that his program just hit an assertion-failure catchpoint.
11951 We used ui_out_text because this info does not belong in
11953 ui_out_text (uiout
, "failed assertion");
11956 ui_out_text (uiout
, " at ");
11957 ada_find_printable_frame (get_current_frame ());
11959 return PRINT_SRC_AND_LOC
;
11962 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11963 for all exception catchpoint kinds. */
11966 print_one_exception (enum ada_exception_catchpoint_kind ex
,
11967 struct breakpoint
*b
, struct bp_location
**last_loc
)
11969 struct ui_out
*uiout
= current_uiout
;
11970 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11971 struct value_print_options opts
;
11973 get_user_print_options (&opts
);
11974 if (opts
.addressprint
)
11976 annotate_field (4);
11977 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
11980 annotate_field (5);
11981 *last_loc
= b
->loc
;
11984 case ada_catch_exception
:
11985 if (c
->excep_string
!= NULL
)
11987 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11989 ui_out_field_string (uiout
, "what", msg
);
11993 ui_out_field_string (uiout
, "what", "all Ada exceptions");
11997 case ada_catch_exception_unhandled
:
11998 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
12001 case ada_catch_assert
:
12002 ui_out_field_string (uiout
, "what", "failed Ada assertions");
12006 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12011 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12012 for all exception catchpoint kinds. */
12015 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12016 struct breakpoint
*b
)
12018 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12019 struct ui_out
*uiout
= current_uiout
;
12021 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
12022 : _("Catchpoint "));
12023 ui_out_field_int (uiout
, "bkptno", b
->number
);
12024 ui_out_text (uiout
, ": ");
12028 case ada_catch_exception
:
12029 if (c
->excep_string
!= NULL
)
12031 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12032 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12034 ui_out_text (uiout
, info
);
12035 do_cleanups (old_chain
);
12038 ui_out_text (uiout
, _("all Ada exceptions"));
12041 case ada_catch_exception_unhandled
:
12042 ui_out_text (uiout
, _("unhandled Ada exceptions"));
12045 case ada_catch_assert
:
12046 ui_out_text (uiout
, _("failed Ada assertions"));
12050 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12055 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12056 for all exception catchpoint kinds. */
12059 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12060 struct breakpoint
*b
, struct ui_file
*fp
)
12062 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12066 case ada_catch_exception
:
12067 fprintf_filtered (fp
, "catch exception");
12068 if (c
->excep_string
!= NULL
)
12069 fprintf_filtered (fp
, " %s", c
->excep_string
);
12072 case ada_catch_exception_unhandled
:
12073 fprintf_filtered (fp
, "catch exception unhandled");
12076 case ada_catch_assert
:
12077 fprintf_filtered (fp
, "catch assert");
12081 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12083 print_recreate_thread (b
, fp
);
12086 /* Virtual table for "catch exception" breakpoints. */
12089 dtor_catch_exception (struct breakpoint
*b
)
12091 dtor_exception (ada_catch_exception
, b
);
12094 static struct bp_location
*
12095 allocate_location_catch_exception (struct breakpoint
*self
)
12097 return allocate_location_exception (ada_catch_exception
, self
);
12101 re_set_catch_exception (struct breakpoint
*b
)
12103 re_set_exception (ada_catch_exception
, b
);
12107 check_status_catch_exception (bpstat bs
)
12109 check_status_exception (ada_catch_exception
, bs
);
12112 static enum print_stop_action
12113 print_it_catch_exception (bpstat bs
)
12115 return print_it_exception (ada_catch_exception
, bs
);
12119 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12121 print_one_exception (ada_catch_exception
, b
, last_loc
);
12125 print_mention_catch_exception (struct breakpoint
*b
)
12127 print_mention_exception (ada_catch_exception
, b
);
12131 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12133 print_recreate_exception (ada_catch_exception
, b
, fp
);
12136 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12138 /* Virtual table for "catch exception unhandled" breakpoints. */
12141 dtor_catch_exception_unhandled (struct breakpoint
*b
)
12143 dtor_exception (ada_catch_exception_unhandled
, b
);
12146 static struct bp_location
*
12147 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12149 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12153 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12155 re_set_exception (ada_catch_exception_unhandled
, b
);
12159 check_status_catch_exception_unhandled (bpstat bs
)
12161 check_status_exception (ada_catch_exception_unhandled
, bs
);
12164 static enum print_stop_action
12165 print_it_catch_exception_unhandled (bpstat bs
)
12167 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12171 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12172 struct bp_location
**last_loc
)
12174 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12178 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12180 print_mention_exception (ada_catch_exception_unhandled
, b
);
12184 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12185 struct ui_file
*fp
)
12187 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12190 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12192 /* Virtual table for "catch assert" breakpoints. */
12195 dtor_catch_assert (struct breakpoint
*b
)
12197 dtor_exception (ada_catch_assert
, b
);
12200 static struct bp_location
*
12201 allocate_location_catch_assert (struct breakpoint
*self
)
12203 return allocate_location_exception (ada_catch_assert
, self
);
12207 re_set_catch_assert (struct breakpoint
*b
)
12209 re_set_exception (ada_catch_assert
, b
);
12213 check_status_catch_assert (bpstat bs
)
12215 check_status_exception (ada_catch_assert
, bs
);
12218 static enum print_stop_action
12219 print_it_catch_assert (bpstat bs
)
12221 return print_it_exception (ada_catch_assert
, bs
);
12225 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12227 print_one_exception (ada_catch_assert
, b
, last_loc
);
12231 print_mention_catch_assert (struct breakpoint
*b
)
12233 print_mention_exception (ada_catch_assert
, b
);
12237 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12239 print_recreate_exception (ada_catch_assert
, b
, fp
);
12242 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12244 /* Return a newly allocated copy of the first space-separated token
12245 in ARGSP, and then adjust ARGSP to point immediately after that
12248 Return NULL if ARGPS does not contain any more tokens. */
12251 ada_get_next_arg (char **argsp
)
12253 char *args
= *argsp
;
12257 args
= skip_spaces (args
);
12258 if (args
[0] == '\0')
12259 return NULL
; /* No more arguments. */
12261 /* Find the end of the current argument. */
12263 end
= skip_to_space (args
);
12265 /* Adjust ARGSP to point to the start of the next argument. */
12269 /* Make a copy of the current argument and return it. */
12271 result
= xmalloc (end
- args
+ 1);
12272 strncpy (result
, args
, end
- args
);
12273 result
[end
- args
] = '\0';
12278 /* Split the arguments specified in a "catch exception" command.
12279 Set EX to the appropriate catchpoint type.
12280 Set EXCEP_STRING to the name of the specific exception if
12281 specified by the user.
12282 If a condition is found at the end of the arguments, the condition
12283 expression is stored in COND_STRING (memory must be deallocated
12284 after use). Otherwise COND_STRING is set to NULL. */
12287 catch_ada_exception_command_split (char *args
,
12288 enum ada_exception_catchpoint_kind
*ex
,
12289 char **excep_string
,
12290 char **cond_string
)
12292 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12293 char *exception_name
;
12296 exception_name
= ada_get_next_arg (&args
);
12297 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12299 /* This is not an exception name; this is the start of a condition
12300 expression for a catchpoint on all exceptions. So, "un-get"
12301 this token, and set exception_name to NULL. */
12302 xfree (exception_name
);
12303 exception_name
= NULL
;
12306 make_cleanup (xfree
, exception_name
);
12308 /* Check to see if we have a condition. */
12310 args
= skip_spaces (args
);
12311 if (strncmp (args
, "if", 2) == 0
12312 && (isspace (args
[2]) || args
[2] == '\0'))
12315 args
= skip_spaces (args
);
12317 if (args
[0] == '\0')
12318 error (_("Condition missing after `if' keyword"));
12319 cond
= xstrdup (args
);
12320 make_cleanup (xfree
, cond
);
12322 args
+= strlen (args
);
12325 /* Check that we do not have any more arguments. Anything else
12328 if (args
[0] != '\0')
12329 error (_("Junk at end of expression"));
12331 discard_cleanups (old_chain
);
12333 if (exception_name
== NULL
)
12335 /* Catch all exceptions. */
12336 *ex
= ada_catch_exception
;
12337 *excep_string
= NULL
;
12339 else if (strcmp (exception_name
, "unhandled") == 0)
12341 /* Catch unhandled exceptions. */
12342 *ex
= ada_catch_exception_unhandled
;
12343 *excep_string
= NULL
;
12347 /* Catch a specific exception. */
12348 *ex
= ada_catch_exception
;
12349 *excep_string
= exception_name
;
12351 *cond_string
= cond
;
12354 /* Return the name of the symbol on which we should break in order to
12355 implement a catchpoint of the EX kind. */
12357 static const char *
12358 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12360 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12362 gdb_assert (data
->exception_info
!= NULL
);
12366 case ada_catch_exception
:
12367 return (data
->exception_info
->catch_exception_sym
);
12369 case ada_catch_exception_unhandled
:
12370 return (data
->exception_info
->catch_exception_unhandled_sym
);
12372 case ada_catch_assert
:
12373 return (data
->exception_info
->catch_assert_sym
);
12376 internal_error (__FILE__
, __LINE__
,
12377 _("unexpected catchpoint kind (%d)"), ex
);
12381 /* Return the breakpoint ops "virtual table" used for catchpoints
12384 static const struct breakpoint_ops
*
12385 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12389 case ada_catch_exception
:
12390 return (&catch_exception_breakpoint_ops
);
12392 case ada_catch_exception_unhandled
:
12393 return (&catch_exception_unhandled_breakpoint_ops
);
12395 case ada_catch_assert
:
12396 return (&catch_assert_breakpoint_ops
);
12399 internal_error (__FILE__
, __LINE__
,
12400 _("unexpected catchpoint kind (%d)"), ex
);
12404 /* Return the condition that will be used to match the current exception
12405 being raised with the exception that the user wants to catch. This
12406 assumes that this condition is used when the inferior just triggered
12407 an exception catchpoint.
12409 The string returned is a newly allocated string that needs to be
12410 deallocated later. */
12413 ada_exception_catchpoint_cond_string (const char *excep_string
)
12417 /* The standard exceptions are a special case. They are defined in
12418 runtime units that have been compiled without debugging info; if
12419 EXCEP_STRING is the not-fully-qualified name of a standard
12420 exception (e.g. "constraint_error") then, during the evaluation
12421 of the condition expression, the symbol lookup on this name would
12422 *not* return this standard exception. The catchpoint condition
12423 may then be set only on user-defined exceptions which have the
12424 same not-fully-qualified name (e.g. my_package.constraint_error).
12426 To avoid this unexcepted behavior, these standard exceptions are
12427 systematically prefixed by "standard". This means that "catch
12428 exception constraint_error" is rewritten into "catch exception
12429 standard.constraint_error".
12431 If an exception named contraint_error is defined in another package of
12432 the inferior program, then the only way to specify this exception as a
12433 breakpoint condition is to use its fully-qualified named:
12434 e.g. my_package.constraint_error. */
12436 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12438 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12440 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12444 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12447 /* Return the symtab_and_line that should be used to insert an exception
12448 catchpoint of the TYPE kind.
12450 EXCEP_STRING should contain the name of a specific exception that
12451 the catchpoint should catch, or NULL otherwise.
12453 ADDR_STRING returns the name of the function where the real
12454 breakpoint that implements the catchpoints is set, depending on the
12455 type of catchpoint we need to create. */
12457 static struct symtab_and_line
12458 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12459 char **addr_string
, const struct breakpoint_ops
**ops
)
12461 const char *sym_name
;
12462 struct symbol
*sym
;
12464 /* First, find out which exception support info to use. */
12465 ada_exception_support_info_sniffer ();
12467 /* Then lookup the function on which we will break in order to catch
12468 the Ada exceptions requested by the user. */
12469 sym_name
= ada_exception_sym_name (ex
);
12470 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12472 /* We can assume that SYM is not NULL at this stage. If the symbol
12473 did not exist, ada_exception_support_info_sniffer would have
12474 raised an exception.
12476 Also, ada_exception_support_info_sniffer should have already
12477 verified that SYM is a function symbol. */
12478 gdb_assert (sym
!= NULL
);
12479 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12481 /* Set ADDR_STRING. */
12482 *addr_string
= xstrdup (sym_name
);
12485 *ops
= ada_exception_breakpoint_ops (ex
);
12487 return find_function_start_sal (sym
, 1);
12490 /* Create an Ada exception catchpoint.
12492 EX_KIND is the kind of exception catchpoint to be created.
12494 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12495 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12496 of the exception to which this catchpoint applies. When not NULL,
12497 the string must be allocated on the heap, and its deallocation
12498 is no longer the responsibility of the caller.
12500 COND_STRING, if not NULL, is the catchpoint condition. This string
12501 must be allocated on the heap, and its deallocation is no longer
12502 the responsibility of the caller.
12504 TEMPFLAG, if nonzero, means that the underlying breakpoint
12505 should be temporary.
12507 FROM_TTY is the usual argument passed to all commands implementations. */
12510 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12511 enum ada_exception_catchpoint_kind ex_kind
,
12512 char *excep_string
,
12518 struct ada_catchpoint
*c
;
12519 char *addr_string
= NULL
;
12520 const struct breakpoint_ops
*ops
= NULL
;
12521 struct symtab_and_line sal
12522 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12524 c
= XNEW (struct ada_catchpoint
);
12525 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
12526 ops
, tempflag
, disabled
, from_tty
);
12527 c
->excep_string
= excep_string
;
12528 create_excep_cond_exprs (c
);
12529 if (cond_string
!= NULL
)
12530 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
12531 install_breakpoint (0, &c
->base
, 1);
12534 /* Implement the "catch exception" command. */
12537 catch_ada_exception_command (char *arg
, int from_tty
,
12538 struct cmd_list_element
*command
)
12540 struct gdbarch
*gdbarch
= get_current_arch ();
12542 enum ada_exception_catchpoint_kind ex_kind
;
12543 char *excep_string
= NULL
;
12544 char *cond_string
= NULL
;
12546 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12550 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12552 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12553 excep_string
, cond_string
,
12554 tempflag
, 1 /* enabled */,
12558 /* Split the arguments specified in a "catch assert" command.
12560 ARGS contains the command's arguments (or the empty string if
12561 no arguments were passed).
12563 If ARGS contains a condition, set COND_STRING to that condition
12564 (the memory needs to be deallocated after use). */
12567 catch_ada_assert_command_split (char *args
, char **cond_string
)
12569 args
= skip_spaces (args
);
12571 /* Check whether a condition was provided. */
12572 if (strncmp (args
, "if", 2) == 0
12573 && (isspace (args
[2]) || args
[2] == '\0'))
12576 args
= skip_spaces (args
);
12577 if (args
[0] == '\0')
12578 error (_("condition missing after `if' keyword"));
12579 *cond_string
= xstrdup (args
);
12582 /* Otherwise, there should be no other argument at the end of
12584 else if (args
[0] != '\0')
12585 error (_("Junk at end of arguments."));
12588 /* Implement the "catch assert" command. */
12591 catch_assert_command (char *arg
, int from_tty
,
12592 struct cmd_list_element
*command
)
12594 struct gdbarch
*gdbarch
= get_current_arch ();
12596 char *cond_string
= NULL
;
12598 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12602 catch_ada_assert_command_split (arg
, &cond_string
);
12603 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12605 tempflag
, 1 /* enabled */,
12609 /* Return non-zero if the symbol SYM is an Ada exception object. */
12612 ada_is_exception_sym (struct symbol
*sym
)
12614 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
12616 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12617 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12618 && SYMBOL_CLASS (sym
) != LOC_CONST
12619 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12620 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12623 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12624 Ada exception object. This matches all exceptions except the ones
12625 defined by the Ada language. */
12628 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12632 if (!ada_is_exception_sym (sym
))
12635 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12636 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
12637 return 0; /* A standard exception. */
12639 /* Numeric_Error is also a standard exception, so exclude it.
12640 See the STANDARD_EXC description for more details as to why
12641 this exception is not listed in that array. */
12642 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
12648 /* A helper function for qsort, comparing two struct ada_exc_info
12651 The comparison is determined first by exception name, and then
12652 by exception address. */
12655 compare_ada_exception_info (const void *a
, const void *b
)
12657 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
12658 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
12661 result
= strcmp (exc_a
->name
, exc_b
->name
);
12665 if (exc_a
->addr
< exc_b
->addr
)
12667 if (exc_a
->addr
> exc_b
->addr
)
12673 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12674 routine, but keeping the first SKIP elements untouched.
12676 All duplicates are also removed. */
12679 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
12682 struct ada_exc_info
*to_sort
12683 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
12685 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
12688 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
12689 compare_ada_exception_info
);
12691 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
12692 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
12693 to_sort
[j
++] = to_sort
[i
];
12695 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
12698 /* A function intended as the "name_matcher" callback in the struct
12699 quick_symbol_functions' expand_symtabs_matching method.
12701 SEARCH_NAME is the symbol's search name.
12703 If USER_DATA is not NULL, it is a pointer to a regext_t object
12704 used to match the symbol (by natural name). Otherwise, when USER_DATA
12705 is null, no filtering is performed, and all symbols are a positive
12709 ada_exc_search_name_matches (const char *search_name
, void *user_data
)
12711 regex_t
*preg
= user_data
;
12716 /* In Ada, the symbol "search name" is a linkage name, whereas
12717 the regular expression used to do the matching refers to
12718 the natural name. So match against the decoded name. */
12719 return (regexec (preg
, ada_decode (search_name
), 0, NULL
, 0) == 0);
12722 /* Add all exceptions defined by the Ada standard whose name match
12723 a regular expression.
12725 If PREG is not NULL, then this regexp_t object is used to
12726 perform the symbol name matching. Otherwise, no name-based
12727 filtering is performed.
12729 EXCEPTIONS is a vector of exceptions to which matching exceptions
12733 ada_add_standard_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12737 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12740 || regexec (preg
, standard_exc
[i
], 0, NULL
, 0) == 0)
12742 struct bound_minimal_symbol msymbol
12743 = ada_lookup_simple_minsym (standard_exc
[i
]);
12745 if (msymbol
.minsym
!= NULL
)
12747 struct ada_exc_info info
12748 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12750 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12756 /* Add all Ada exceptions defined locally and accessible from the given
12759 If PREG is not NULL, then this regexp_t object is used to
12760 perform the symbol name matching. Otherwise, no name-based
12761 filtering is performed.
12763 EXCEPTIONS is a vector of exceptions to which matching exceptions
12767 ada_add_exceptions_from_frame (regex_t
*preg
, struct frame_info
*frame
,
12768 VEC(ada_exc_info
) **exceptions
)
12770 const struct block
*block
= get_frame_block (frame
, 0);
12774 struct block_iterator iter
;
12775 struct symbol
*sym
;
12777 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12779 switch (SYMBOL_CLASS (sym
))
12786 if (ada_is_exception_sym (sym
))
12788 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
12789 SYMBOL_VALUE_ADDRESS (sym
)};
12791 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12795 if (BLOCK_FUNCTION (block
) != NULL
)
12797 block
= BLOCK_SUPERBLOCK (block
);
12801 /* Add all exceptions defined globally whose name name match
12802 a regular expression, excluding standard exceptions.
12804 The reason we exclude standard exceptions is that they need
12805 to be handled separately: Standard exceptions are defined inside
12806 a runtime unit which is normally not compiled with debugging info,
12807 and thus usually do not show up in our symbol search. However,
12808 if the unit was in fact built with debugging info, we need to
12809 exclude them because they would duplicate the entry we found
12810 during the special loop that specifically searches for those
12811 standard exceptions.
12813 If PREG is not NULL, then this regexp_t object is used to
12814 perform the symbol name matching. Otherwise, no name-based
12815 filtering is performed.
12817 EXCEPTIONS is a vector of exceptions to which matching exceptions
12821 ada_add_global_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12823 struct objfile
*objfile
;
12826 expand_symtabs_matching (NULL
, ada_exc_search_name_matches
,
12827 VARIABLES_DOMAIN
, preg
);
12829 ALL_PRIMARY_SYMTABS (objfile
, s
)
12831 const struct blockvector
*bv
= BLOCKVECTOR (s
);
12834 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
12836 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
12837 struct block_iterator iter
;
12838 struct symbol
*sym
;
12840 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
12841 if (ada_is_non_standard_exception_sym (sym
)
12843 || regexec (preg
, SYMBOL_NATURAL_NAME (sym
),
12846 struct ada_exc_info info
12847 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
12849 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12855 /* Implements ada_exceptions_list with the regular expression passed
12856 as a regex_t, rather than a string.
12858 If not NULL, PREG is used to filter out exceptions whose names
12859 do not match. Otherwise, all exceptions are listed. */
12861 static VEC(ada_exc_info
) *
12862 ada_exceptions_list_1 (regex_t
*preg
)
12864 VEC(ada_exc_info
) *result
= NULL
;
12865 struct cleanup
*old_chain
12866 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
12869 /* First, list the known standard exceptions. These exceptions
12870 need to be handled separately, as they are usually defined in
12871 runtime units that have been compiled without debugging info. */
12873 ada_add_standard_exceptions (preg
, &result
);
12875 /* Next, find all exceptions whose scope is local and accessible
12876 from the currently selected frame. */
12878 if (has_stack_frames ())
12880 prev_len
= VEC_length (ada_exc_info
, result
);
12881 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
12883 if (VEC_length (ada_exc_info
, result
) > prev_len
)
12884 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12887 /* Add all exceptions whose scope is global. */
12889 prev_len
= VEC_length (ada_exc_info
, result
);
12890 ada_add_global_exceptions (preg
, &result
);
12891 if (VEC_length (ada_exc_info
, result
) > prev_len
)
12892 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12894 discard_cleanups (old_chain
);
12898 /* Return a vector of ada_exc_info.
12900 If REGEXP is NULL, all exceptions are included in the result.
12901 Otherwise, it should contain a valid regular expression,
12902 and only the exceptions whose names match that regular expression
12903 are included in the result.
12905 The exceptions are sorted in the following order:
12906 - Standard exceptions (defined by the Ada language), in
12907 alphabetical order;
12908 - Exceptions only visible from the current frame, in
12909 alphabetical order;
12910 - Exceptions whose scope is global, in alphabetical order. */
12912 VEC(ada_exc_info
) *
12913 ada_exceptions_list (const char *regexp
)
12915 VEC(ada_exc_info
) *result
= NULL
;
12916 struct cleanup
*old_chain
= NULL
;
12919 if (regexp
!= NULL
)
12920 old_chain
= compile_rx_or_error (®
, regexp
,
12921 _("invalid regular expression"));
12923 result
= ada_exceptions_list_1 (regexp
!= NULL
? ®
: NULL
);
12925 if (old_chain
!= NULL
)
12926 do_cleanups (old_chain
);
12930 /* Implement the "info exceptions" command. */
12933 info_exceptions_command (char *regexp
, int from_tty
)
12935 VEC(ada_exc_info
) *exceptions
;
12936 struct cleanup
*cleanup
;
12937 struct gdbarch
*gdbarch
= get_current_arch ();
12939 struct ada_exc_info
*info
;
12941 exceptions
= ada_exceptions_list (regexp
);
12942 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
12944 if (regexp
!= NULL
)
12946 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
12948 printf_filtered (_("All defined Ada exceptions:\n"));
12950 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
12951 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
12953 do_cleanups (cleanup
);
12957 /* Information about operators given special treatment in functions
12959 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
12961 #define ADA_OPERATORS \
12962 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
12963 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
12964 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
12965 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
12966 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
12967 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
12968 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
12969 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
12970 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
12971 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
12972 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
12973 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
12974 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
12975 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
12976 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
12977 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
12978 OP_DEFN (OP_OTHERS, 1, 1, 0) \
12979 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
12980 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
12983 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
12986 switch (exp
->elts
[pc
- 1].opcode
)
12989 operator_length_standard (exp
, pc
, oplenp
, argsp
);
12992 #define OP_DEFN(op, len, args, binop) \
12993 case op: *oplenp = len; *argsp = args; break;
12999 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13004 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13009 /* Implementation of the exp_descriptor method operator_check. */
13012 ada_operator_check (struct expression
*exp
, int pos
,
13013 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13016 const union exp_element
*const elts
= exp
->elts
;
13017 struct type
*type
= NULL
;
13019 switch (elts
[pos
].opcode
)
13021 case UNOP_IN_RANGE
:
13023 type
= elts
[pos
+ 1].type
;
13027 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13030 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13032 if (type
&& TYPE_OBJFILE (type
)
13033 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13040 ada_op_name (enum exp_opcode opcode
)
13045 return op_name_standard (opcode
);
13047 #define OP_DEFN(op, len, args, binop) case op: return #op;
13052 return "OP_AGGREGATE";
13054 return "OP_CHOICES";
13060 /* As for operator_length, but assumes PC is pointing at the first
13061 element of the operator, and gives meaningful results only for the
13062 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13065 ada_forward_operator_length (struct expression
*exp
, int pc
,
13066 int *oplenp
, int *argsp
)
13068 switch (exp
->elts
[pc
].opcode
)
13071 *oplenp
= *argsp
= 0;
13074 #define OP_DEFN(op, len, args, binop) \
13075 case op: *oplenp = len; *argsp = args; break;
13081 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13086 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13092 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13094 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13102 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13104 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13109 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13113 /* Ada attributes ('Foo). */
13116 case OP_ATR_LENGTH
:
13120 case OP_ATR_MODULUS
:
13127 case UNOP_IN_RANGE
:
13129 /* XXX: gdb_sprint_host_address, type_sprint */
13130 fprintf_filtered (stream
, _("Type @"));
13131 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13132 fprintf_filtered (stream
, " (");
13133 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13134 fprintf_filtered (stream
, ")");
13136 case BINOP_IN_BOUNDS
:
13137 fprintf_filtered (stream
, " (%d)",
13138 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13140 case TERNOP_IN_RANGE
:
13145 case OP_DISCRETE_RANGE
:
13146 case OP_POSITIONAL
:
13153 char *name
= &exp
->elts
[elt
+ 2].string
;
13154 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13156 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13161 return dump_subexp_body_standard (exp
, stream
, elt
);
13165 for (i
= 0; i
< nargs
; i
+= 1)
13166 elt
= dump_subexp (exp
, stream
, elt
);
13171 /* The Ada extension of print_subexp (q.v.). */
13174 ada_print_subexp (struct expression
*exp
, int *pos
,
13175 struct ui_file
*stream
, enum precedence prec
)
13177 int oplen
, nargs
, i
;
13179 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13181 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13188 print_subexp_standard (exp
, pos
, stream
, prec
);
13192 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13195 case BINOP_IN_BOUNDS
:
13196 /* XXX: sprint_subexp */
13197 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13198 fputs_filtered (" in ", stream
);
13199 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13200 fputs_filtered ("'range", stream
);
13201 if (exp
->elts
[pc
+ 1].longconst
> 1)
13202 fprintf_filtered (stream
, "(%ld)",
13203 (long) exp
->elts
[pc
+ 1].longconst
);
13206 case TERNOP_IN_RANGE
:
13207 if (prec
>= PREC_EQUAL
)
13208 fputs_filtered ("(", stream
);
13209 /* XXX: sprint_subexp */
13210 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13211 fputs_filtered (" in ", stream
);
13212 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13213 fputs_filtered (" .. ", stream
);
13214 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13215 if (prec
>= PREC_EQUAL
)
13216 fputs_filtered (")", stream
);
13221 case OP_ATR_LENGTH
:
13225 case OP_ATR_MODULUS
:
13230 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13232 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13233 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13234 &type_print_raw_options
);
13238 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13239 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13244 for (tem
= 1; tem
< nargs
; tem
+= 1)
13246 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13247 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13249 fputs_filtered (")", stream
);
13254 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13255 fputs_filtered ("'(", stream
);
13256 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13257 fputs_filtered (")", stream
);
13260 case UNOP_IN_RANGE
:
13261 /* XXX: sprint_subexp */
13262 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13263 fputs_filtered (" in ", stream
);
13264 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13265 &type_print_raw_options
);
13268 case OP_DISCRETE_RANGE
:
13269 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13270 fputs_filtered ("..", stream
);
13271 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13275 fputs_filtered ("others => ", stream
);
13276 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13280 for (i
= 0; i
< nargs
-1; i
+= 1)
13283 fputs_filtered ("|", stream
);
13284 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13286 fputs_filtered (" => ", stream
);
13287 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13290 case OP_POSITIONAL
:
13291 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13295 fputs_filtered ("(", stream
);
13296 for (i
= 0; i
< nargs
; i
+= 1)
13299 fputs_filtered (", ", stream
);
13300 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13302 fputs_filtered (")", stream
);
13307 /* Table mapping opcodes into strings for printing operators
13308 and precedences of the operators. */
13310 static const struct op_print ada_op_print_tab
[] = {
13311 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13312 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13313 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13314 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13315 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13316 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13317 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13318 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13319 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13320 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13321 {">", BINOP_GTR
, PREC_ORDER
, 0},
13322 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13323 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13324 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13325 {"+", BINOP_ADD
, PREC_ADD
, 0},
13326 {"-", BINOP_SUB
, PREC_ADD
, 0},
13327 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13328 {"*", BINOP_MUL
, PREC_MUL
, 0},
13329 {"/", BINOP_DIV
, PREC_MUL
, 0},
13330 {"rem", BINOP_REM
, PREC_MUL
, 0},
13331 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13332 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13333 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13334 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13335 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13336 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13337 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13338 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13339 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13340 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13341 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13345 enum ada_primitive_types
{
13346 ada_primitive_type_int
,
13347 ada_primitive_type_long
,
13348 ada_primitive_type_short
,
13349 ada_primitive_type_char
,
13350 ada_primitive_type_float
,
13351 ada_primitive_type_double
,
13352 ada_primitive_type_void
,
13353 ada_primitive_type_long_long
,
13354 ada_primitive_type_long_double
,
13355 ada_primitive_type_natural
,
13356 ada_primitive_type_positive
,
13357 ada_primitive_type_system_address
,
13358 nr_ada_primitive_types
13362 ada_language_arch_info (struct gdbarch
*gdbarch
,
13363 struct language_arch_info
*lai
)
13365 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13367 lai
->primitive_type_vector
13368 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13371 lai
->primitive_type_vector
[ada_primitive_type_int
]
13372 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13374 lai
->primitive_type_vector
[ada_primitive_type_long
]
13375 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13376 0, "long_integer");
13377 lai
->primitive_type_vector
[ada_primitive_type_short
]
13378 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13379 0, "short_integer");
13380 lai
->string_char_type
13381 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13382 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13383 lai
->primitive_type_vector
[ada_primitive_type_float
]
13384 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13386 lai
->primitive_type_vector
[ada_primitive_type_double
]
13387 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13388 "long_float", NULL
);
13389 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13390 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13391 0, "long_long_integer");
13392 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13393 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13394 "long_long_float", NULL
);
13395 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13396 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13398 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13399 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13401 lai
->primitive_type_vector
[ada_primitive_type_void
]
13402 = builtin
->builtin_void
;
13404 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13405 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13406 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13407 = "system__address";
13409 lai
->bool_type_symbol
= NULL
;
13410 lai
->bool_type_default
= builtin
->builtin_bool
;
13413 /* Language vector */
13415 /* Not really used, but needed in the ada_language_defn. */
13418 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13420 ada_emit_char (c
, type
, stream
, quoter
, 1);
13424 parse (struct parser_state
*ps
)
13426 warnings_issued
= 0;
13427 return ada_parse (ps
);
13430 static const struct exp_descriptor ada_exp_descriptor
= {
13432 ada_operator_length
,
13433 ada_operator_check
,
13435 ada_dump_subexp_body
,
13436 ada_evaluate_subexp
13439 /* Implement the "la_get_symbol_name_cmp" language_defn method
13442 static symbol_name_cmp_ftype
13443 ada_get_symbol_name_cmp (const char *lookup_name
)
13445 if (should_use_wild_match (lookup_name
))
13448 return compare_names
;
13451 /* Implement the "la_read_var_value" language_defn method for Ada. */
13453 static struct value
*
13454 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
13456 const struct block
*frame_block
= NULL
;
13457 struct symbol
*renaming_sym
= NULL
;
13459 /* The only case where default_read_var_value is not sufficient
13460 is when VAR is a renaming... */
13462 frame_block
= get_frame_block (frame
, NULL
);
13464 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13465 if (renaming_sym
!= NULL
)
13466 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13468 /* This is a typical case where we expect the default_read_var_value
13469 function to work. */
13470 return default_read_var_value (var
, frame
);
13473 const struct language_defn ada_language_defn
= {
13474 "ada", /* Language name */
13478 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13479 that's not quite what this means. */
13481 macro_expansion_no
,
13482 &ada_exp_descriptor
,
13486 ada_printchar
, /* Print a character constant */
13487 ada_printstr
, /* Function to print string constant */
13488 emit_char
, /* Function to print single char (not used) */
13489 ada_print_type
, /* Print a type using appropriate syntax */
13490 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13491 ada_val_print
, /* Print a value using appropriate syntax */
13492 ada_value_print
, /* Print a top-level value */
13493 ada_read_var_value
, /* la_read_var_value */
13494 NULL
, /* Language specific skip_trampoline */
13495 NULL
, /* name_of_this */
13496 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13497 basic_lookup_transparent_type
, /* lookup_transparent_type */
13498 ada_la_decode
, /* Language specific symbol demangler */
13499 NULL
, /* Language specific
13500 class_name_from_physname */
13501 ada_op_print_tab
, /* expression operators for printing */
13502 0, /* c-style arrays */
13503 1, /* String lower bound */
13504 ada_get_gdb_completer_word_break_characters
,
13505 ada_make_symbol_completion_list
,
13506 ada_language_arch_info
,
13507 ada_print_array_index
,
13508 default_pass_by_reference
,
13510 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13511 ada_iterate_over_symbols
,
13516 /* Provide a prototype to silence -Wmissing-prototypes. */
13517 extern initialize_file_ftype _initialize_ada_language
;
13519 /* Command-list for the "set/show ada" prefix command. */
13520 static struct cmd_list_element
*set_ada_list
;
13521 static struct cmd_list_element
*show_ada_list
;
13523 /* Implement the "set ada" prefix command. */
13526 set_ada_command (char *arg
, int from_tty
)
13528 printf_unfiltered (_(\
13529 "\"set ada\" must be followed by the name of a setting.\n"));
13530 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
13533 /* Implement the "show ada" prefix command. */
13536 show_ada_command (char *args
, int from_tty
)
13538 cmd_show_list (show_ada_list
, from_tty
, "");
13542 initialize_ada_catchpoint_ops (void)
13544 struct breakpoint_ops
*ops
;
13546 initialize_breakpoint_ops ();
13548 ops
= &catch_exception_breakpoint_ops
;
13549 *ops
= bkpt_breakpoint_ops
;
13550 ops
->dtor
= dtor_catch_exception
;
13551 ops
->allocate_location
= allocate_location_catch_exception
;
13552 ops
->re_set
= re_set_catch_exception
;
13553 ops
->check_status
= check_status_catch_exception
;
13554 ops
->print_it
= print_it_catch_exception
;
13555 ops
->print_one
= print_one_catch_exception
;
13556 ops
->print_mention
= print_mention_catch_exception
;
13557 ops
->print_recreate
= print_recreate_catch_exception
;
13559 ops
= &catch_exception_unhandled_breakpoint_ops
;
13560 *ops
= bkpt_breakpoint_ops
;
13561 ops
->dtor
= dtor_catch_exception_unhandled
;
13562 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
13563 ops
->re_set
= re_set_catch_exception_unhandled
;
13564 ops
->check_status
= check_status_catch_exception_unhandled
;
13565 ops
->print_it
= print_it_catch_exception_unhandled
;
13566 ops
->print_one
= print_one_catch_exception_unhandled
;
13567 ops
->print_mention
= print_mention_catch_exception_unhandled
;
13568 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
13570 ops
= &catch_assert_breakpoint_ops
;
13571 *ops
= bkpt_breakpoint_ops
;
13572 ops
->dtor
= dtor_catch_assert
;
13573 ops
->allocate_location
= allocate_location_catch_assert
;
13574 ops
->re_set
= re_set_catch_assert
;
13575 ops
->check_status
= check_status_catch_assert
;
13576 ops
->print_it
= print_it_catch_assert
;
13577 ops
->print_one
= print_one_catch_assert
;
13578 ops
->print_mention
= print_mention_catch_assert
;
13579 ops
->print_recreate
= print_recreate_catch_assert
;
13582 /* This module's 'new_objfile' observer. */
13585 ada_new_objfile_observer (struct objfile
*objfile
)
13587 ada_clear_symbol_cache ();
13590 /* This module's 'free_objfile' observer. */
13593 ada_free_objfile_observer (struct objfile
*objfile
)
13595 ada_clear_symbol_cache ();
13599 _initialize_ada_language (void)
13601 add_language (&ada_language_defn
);
13603 initialize_ada_catchpoint_ops ();
13605 add_prefix_cmd ("ada", no_class
, set_ada_command
,
13606 _("Prefix command for changing Ada-specfic settings"),
13607 &set_ada_list
, "set ada ", 0, &setlist
);
13609 add_prefix_cmd ("ada", no_class
, show_ada_command
,
13610 _("Generic command for showing Ada-specific settings."),
13611 &show_ada_list
, "show ada ", 0, &showlist
);
13613 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
13614 &trust_pad_over_xvs
, _("\
13615 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13616 Show whether an optimization trusting PAD types over XVS types is activated"),
13618 This is related to the encoding used by the GNAT compiler. The debugger\n\
13619 should normally trust the contents of PAD types, but certain older versions\n\
13620 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13621 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13622 work around this bug. It is always safe to turn this option \"off\", but\n\
13623 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13624 this option to \"off\" unless necessary."),
13625 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13627 add_catch_command ("exception", _("\
13628 Catch Ada exceptions, when raised.\n\
13629 With an argument, catch only exceptions with the given name."),
13630 catch_ada_exception_command
,
13634 add_catch_command ("assert", _("\
13635 Catch failed Ada assertions, when raised.\n\
13636 With an argument, catch only exceptions with the given name."),
13637 catch_assert_command
,
13642 varsize_limit
= 65536;
13644 add_info ("exceptions", info_exceptions_command
,
13646 List all Ada exception names.\n\
13647 If a regular expression is passed as an argument, only those matching\n\
13648 the regular expression are listed."));
13650 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
13651 _("Set Ada maintenance-related variables."),
13652 &maint_set_ada_cmdlist
, "maintenance set ada ",
13653 0/*allow-unknown*/, &maintenance_set_cmdlist
);
13655 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
13656 _("Show Ada maintenance-related variables"),
13657 &maint_show_ada_cmdlist
, "maintenance show ada ",
13658 0/*allow-unknown*/, &maintenance_show_cmdlist
);
13660 add_setshow_boolean_cmd
13661 ("ignore-descriptive-types", class_maintenance
,
13662 &ada_ignore_descriptive_types_p
,
13663 _("Set whether descriptive types generated by GNAT should be ignored."),
13664 _("Show whether descriptive types generated by GNAT should be ignored."),
13666 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13667 DWARF attribute."),
13668 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
13670 obstack_init (&symbol_list_obstack
);
13672 decoded_names_store
= htab_create_alloc
13673 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
13674 NULL
, xcalloc
, xfree
);
13676 /* The ada-lang observers. */
13677 observer_attach_new_objfile (ada_new_objfile_observer
);
13678 observer_attach_free_objfile (ada_free_objfile_observer
);
13679 observer_attach_inferior_exit (ada_inferior_exit
);
13681 /* Setup various context-specific data. */
13683 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
13684 ada_pspace_data_handle
13685 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);