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 memcpy (value_contents_raw (result
), value_contents (val
),
685 set_value_component_location (result
, val
);
686 set_value_bitsize (result
, value_bitsize (val
));
687 set_value_bitpos (result
, value_bitpos (val
));
688 set_value_address (result
, value_address (val
));
689 set_value_optimized_out (result
, value_optimized_out_const (val
));
694 static const gdb_byte
*
695 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
700 return valaddr
+ offset
;
704 cond_offset_target (CORE_ADDR address
, long offset
)
709 return address
+ offset
;
712 /* Issue a warning (as for the definition of warning in utils.c, but
713 with exactly one argument rather than ...), unless the limit on the
714 number of warnings has passed during the evaluation of the current
717 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
718 provided by "complaint". */
719 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
722 lim_warning (const char *format
, ...)
726 va_start (args
, format
);
727 warnings_issued
+= 1;
728 if (warnings_issued
<= warning_limit
)
729 vwarning (format
, args
);
734 /* Issue an error if the size of an object of type T is unreasonable,
735 i.e. if it would be a bad idea to allocate a value of this type in
739 check_size (const struct type
*type
)
741 if (TYPE_LENGTH (type
) > varsize_limit
)
742 error (_("object size is larger than varsize-limit"));
745 /* Maximum value of a SIZE-byte signed integer type. */
747 max_of_size (int size
)
749 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
751 return top_bit
| (top_bit
- 1);
754 /* Minimum value of a SIZE-byte signed integer type. */
756 min_of_size (int size
)
758 return -max_of_size (size
) - 1;
761 /* Maximum value of a SIZE-byte unsigned integer type. */
763 umax_of_size (int size
)
765 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
767 return top_bit
| (top_bit
- 1);
770 /* Maximum value of integral type T, as a signed quantity. */
772 max_of_type (struct type
*t
)
774 if (TYPE_UNSIGNED (t
))
775 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
777 return max_of_size (TYPE_LENGTH (t
));
780 /* Minimum value of integral type T, as a signed quantity. */
782 min_of_type (struct type
*t
)
784 if (TYPE_UNSIGNED (t
))
787 return min_of_size (TYPE_LENGTH (t
));
790 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
792 ada_discrete_type_high_bound (struct type
*type
)
794 type
= resolve_dynamic_type (type
, 0);
795 switch (TYPE_CODE (type
))
797 case TYPE_CODE_RANGE
:
798 return TYPE_HIGH_BOUND (type
);
800 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
805 return max_of_type (type
);
807 error (_("Unexpected type in ada_discrete_type_high_bound."));
811 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
813 ada_discrete_type_low_bound (struct type
*type
)
815 type
= resolve_dynamic_type (type
, 0);
816 switch (TYPE_CODE (type
))
818 case TYPE_CODE_RANGE
:
819 return TYPE_LOW_BOUND (type
);
821 return TYPE_FIELD_ENUMVAL (type
, 0);
826 return min_of_type (type
);
828 error (_("Unexpected type in ada_discrete_type_low_bound."));
832 /* The identity on non-range types. For range types, the underlying
833 non-range scalar type. */
836 get_base_type (struct type
*type
)
838 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
840 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
842 type
= TYPE_TARGET_TYPE (type
);
847 /* Return a decoded version of the given VALUE. This means returning
848 a value whose type is obtained by applying all the GNAT-specific
849 encondings, making the resulting type a static but standard description
850 of the initial type. */
853 ada_get_decoded_value (struct value
*value
)
855 struct type
*type
= ada_check_typedef (value_type (value
));
857 if (ada_is_array_descriptor_type (type
)
858 || (ada_is_constrained_packed_array_type (type
)
859 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
861 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
862 value
= ada_coerce_to_simple_array_ptr (value
);
864 value
= ada_coerce_to_simple_array (value
);
867 value
= ada_to_fixed_value (value
);
872 /* Same as ada_get_decoded_value, but with the given TYPE.
873 Because there is no associated actual value for this type,
874 the resulting type might be a best-effort approximation in
875 the case of dynamic types. */
878 ada_get_decoded_type (struct type
*type
)
880 type
= to_static_fixed_type (type
);
881 if (ada_is_constrained_packed_array_type (type
))
882 type
= ada_coerce_to_simple_array_type (type
);
888 /* Language Selection */
890 /* If the main program is in Ada, return language_ada, otherwise return LANG
891 (the main program is in Ada iif the adainit symbol is found). */
894 ada_update_initial_language (enum language lang
)
896 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
897 (struct objfile
*) NULL
).minsym
!= NULL
)
903 /* If the main procedure is written in Ada, then return its name.
904 The result is good until the next call. Return NULL if the main
905 procedure doesn't appear to be in Ada. */
910 struct bound_minimal_symbol msym
;
911 static char *main_program_name
= NULL
;
913 /* For Ada, the name of the main procedure is stored in a specific
914 string constant, generated by the binder. Look for that symbol,
915 extract its address, and then read that string. If we didn't find
916 that string, then most probably the main procedure is not written
918 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
920 if (msym
.minsym
!= NULL
)
922 CORE_ADDR main_program_name_addr
;
925 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
926 if (main_program_name_addr
== 0)
927 error (_("Invalid address for Ada main program name."));
929 xfree (main_program_name
);
930 target_read_string (main_program_name_addr
, &main_program_name
,
935 return main_program_name
;
938 /* The main procedure doesn't seem to be in Ada. */
944 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
947 const struct ada_opname_map ada_opname_table
[] = {
948 {"Oadd", "\"+\"", BINOP_ADD
},
949 {"Osubtract", "\"-\"", BINOP_SUB
},
950 {"Omultiply", "\"*\"", BINOP_MUL
},
951 {"Odivide", "\"/\"", BINOP_DIV
},
952 {"Omod", "\"mod\"", BINOP_MOD
},
953 {"Orem", "\"rem\"", BINOP_REM
},
954 {"Oexpon", "\"**\"", BINOP_EXP
},
955 {"Olt", "\"<\"", BINOP_LESS
},
956 {"Ole", "\"<=\"", BINOP_LEQ
},
957 {"Ogt", "\">\"", BINOP_GTR
},
958 {"Oge", "\">=\"", BINOP_GEQ
},
959 {"Oeq", "\"=\"", BINOP_EQUAL
},
960 {"One", "\"/=\"", BINOP_NOTEQUAL
},
961 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
962 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
963 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
964 {"Oconcat", "\"&\"", BINOP_CONCAT
},
965 {"Oabs", "\"abs\"", UNOP_ABS
},
966 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
967 {"Oadd", "\"+\"", UNOP_PLUS
},
968 {"Osubtract", "\"-\"", UNOP_NEG
},
972 /* The "encoded" form of DECODED, according to GNAT conventions.
973 The result is valid until the next call to ada_encode. */
976 ada_encode (const char *decoded
)
978 static char *encoding_buffer
= NULL
;
979 static size_t encoding_buffer_size
= 0;
986 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
987 2 * strlen (decoded
) + 10);
990 for (p
= decoded
; *p
!= '\0'; p
+= 1)
994 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
999 const struct ada_opname_map
*mapping
;
1001 for (mapping
= ada_opname_table
;
1002 mapping
->encoded
!= NULL
1003 && strncmp (mapping
->decoded
, p
,
1004 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
1006 if (mapping
->encoded
== NULL
)
1007 error (_("invalid Ada operator name: %s"), p
);
1008 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
1009 k
+= strlen (mapping
->encoded
);
1014 encoding_buffer
[k
] = *p
;
1019 encoding_buffer
[k
] = '\0';
1020 return encoding_buffer
;
1023 /* Return NAME folded to lower case, or, if surrounded by single
1024 quotes, unfolded, but with the quotes stripped away. Result good
1028 ada_fold_name (const char *name
)
1030 static char *fold_buffer
= NULL
;
1031 static size_t fold_buffer_size
= 0;
1033 int len
= strlen (name
);
1034 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1036 if (name
[0] == '\'')
1038 strncpy (fold_buffer
, name
+ 1, len
- 2);
1039 fold_buffer
[len
- 2] = '\000';
1045 for (i
= 0; i
<= len
; i
+= 1)
1046 fold_buffer
[i
] = tolower (name
[i
]);
1052 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1055 is_lower_alphanum (const char c
)
1057 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1060 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1061 This function saves in LEN the length of that same symbol name but
1062 without either of these suffixes:
1068 These are suffixes introduced by the compiler for entities such as
1069 nested subprogram for instance, in order to avoid name clashes.
1070 They do not serve any purpose for the debugger. */
1073 ada_remove_trailing_digits (const char *encoded
, int *len
)
1075 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1079 while (i
> 0 && isdigit (encoded
[i
]))
1081 if (i
>= 0 && encoded
[i
] == '.')
1083 else if (i
>= 0 && encoded
[i
] == '$')
1085 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
1087 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
1092 /* Remove the suffix introduced by the compiler for protected object
1096 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1098 /* Remove trailing N. */
1100 /* Protected entry subprograms are broken into two
1101 separate subprograms: The first one is unprotected, and has
1102 a 'N' suffix; the second is the protected version, and has
1103 the 'P' suffix. The second calls the first one after handling
1104 the protection. Since the P subprograms are internally generated,
1105 we leave these names undecoded, giving the user a clue that this
1106 entity is internal. */
1109 && encoded
[*len
- 1] == 'N'
1110 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1114 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1117 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
1121 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
1124 if (encoded
[i
] != 'X')
1130 if (isalnum (encoded
[i
-1]))
1134 /* If ENCODED follows the GNAT entity encoding conventions, then return
1135 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1136 replaced by ENCODED.
1138 The resulting string is valid until the next call of ada_decode.
1139 If the string is unchanged by decoding, the original string pointer
1143 ada_decode (const char *encoded
)
1150 static char *decoding_buffer
= NULL
;
1151 static size_t decoding_buffer_size
= 0;
1153 /* The name of the Ada main procedure starts with "_ada_".
1154 This prefix is not part of the decoded name, so skip this part
1155 if we see this prefix. */
1156 if (strncmp (encoded
, "_ada_", 5) == 0)
1159 /* If the name starts with '_', then it is not a properly encoded
1160 name, so do not attempt to decode it. Similarly, if the name
1161 starts with '<', the name should not be decoded. */
1162 if (encoded
[0] == '_' || encoded
[0] == '<')
1165 len0
= strlen (encoded
);
1167 ada_remove_trailing_digits (encoded
, &len0
);
1168 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1170 /* Remove the ___X.* suffix if present. Do not forget to verify that
1171 the suffix is located before the current "end" of ENCODED. We want
1172 to avoid re-matching parts of ENCODED that have previously been
1173 marked as discarded (by decrementing LEN0). */
1174 p
= strstr (encoded
, "___");
1175 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1183 /* Remove any trailing TKB suffix. It tells us that this symbol
1184 is for the body of a task, but that information does not actually
1185 appear in the decoded name. */
1187 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
1190 /* Remove any trailing TB suffix. The TB suffix is slightly different
1191 from the TKB suffix because it is used for non-anonymous task
1194 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
1197 /* Remove trailing "B" suffixes. */
1198 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1200 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
1203 /* Make decoded big enough for possible expansion by operator name. */
1205 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1206 decoded
= decoding_buffer
;
1208 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1210 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1213 while ((i
>= 0 && isdigit (encoded
[i
]))
1214 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1216 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1218 else if (encoded
[i
] == '$')
1222 /* The first few characters that are not alphabetic are not part
1223 of any encoding we use, so we can copy them over verbatim. */
1225 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1226 decoded
[j
] = encoded
[i
];
1231 /* Is this a symbol function? */
1232 if (at_start_name
&& encoded
[i
] == 'O')
1236 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1238 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1239 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1241 && !isalnum (encoded
[i
+ op_len
]))
1243 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1246 j
+= strlen (ada_opname_table
[k
].decoded
);
1250 if (ada_opname_table
[k
].encoded
!= NULL
)
1255 /* Replace "TK__" with "__", which will eventually be translated
1256 into "." (just below). */
1258 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1261 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1262 be translated into "." (just below). These are internal names
1263 generated for anonymous blocks inside which our symbol is nested. */
1265 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1266 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1267 && isdigit (encoded
[i
+4]))
1271 while (k
< len0
&& isdigit (encoded
[k
]))
1272 k
++; /* Skip any extra digit. */
1274 /* Double-check that the "__B_{DIGITS}+" sequence we found
1275 is indeed followed by "__". */
1276 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1280 /* Remove _E{DIGITS}+[sb] */
1282 /* Just as for protected object subprograms, there are 2 categories
1283 of subprograms created by the compiler for each entry. The first
1284 one implements the actual entry code, and has a suffix following
1285 the convention above; the second one implements the barrier and
1286 uses the same convention as above, except that the 'E' is replaced
1289 Just as above, we do not decode the name of barrier functions
1290 to give the user a clue that the code he is debugging has been
1291 internally generated. */
1293 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1294 && isdigit (encoded
[i
+2]))
1298 while (k
< len0
&& isdigit (encoded
[k
]))
1302 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1305 /* Just as an extra precaution, make sure that if this
1306 suffix is followed by anything else, it is a '_'.
1307 Otherwise, we matched this sequence by accident. */
1309 || (k
< len0
&& encoded
[k
] == '_'))
1314 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1315 the GNAT front-end in protected object subprograms. */
1318 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1320 /* Backtrack a bit up until we reach either the begining of
1321 the encoded name, or "__". Make sure that we only find
1322 digits or lowercase characters. */
1323 const char *ptr
= encoded
+ i
- 1;
1325 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1328 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1332 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1334 /* This is a X[bn]* sequence not separated from the previous
1335 part of the name with a non-alpha-numeric character (in other
1336 words, immediately following an alpha-numeric character), then
1337 verify that it is placed at the end of the encoded name. If
1338 not, then the encoding is not valid and we should abort the
1339 decoding. Otherwise, just skip it, it is used in body-nested
1343 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1347 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1349 /* Replace '__' by '.'. */
1357 /* It's a character part of the decoded name, so just copy it
1359 decoded
[j
] = encoded
[i
];
1364 decoded
[j
] = '\000';
1366 /* Decoded names should never contain any uppercase character.
1367 Double-check this, and abort the decoding if we find one. */
1369 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1370 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1373 if (strcmp (decoded
, encoded
) == 0)
1379 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1380 decoded
= decoding_buffer
;
1381 if (encoded
[0] == '<')
1382 strcpy (decoded
, encoded
);
1384 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1389 /* Table for keeping permanent unique copies of decoded names. Once
1390 allocated, names in this table are never released. While this is a
1391 storage leak, it should not be significant unless there are massive
1392 changes in the set of decoded names in successive versions of a
1393 symbol table loaded during a single session. */
1394 static struct htab
*decoded_names_store
;
1396 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1397 in the language-specific part of GSYMBOL, if it has not been
1398 previously computed. Tries to save the decoded name in the same
1399 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1400 in any case, the decoded symbol has a lifetime at least that of
1402 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1403 const, but nevertheless modified to a semantically equivalent form
1404 when a decoded name is cached in it. */
1407 ada_decode_symbol (const struct general_symbol_info
*arg
)
1409 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1410 const char **resultp
=
1411 &gsymbol
->language_specific
.mangled_lang
.demangled_name
;
1413 if (!gsymbol
->ada_mangled
)
1415 const char *decoded
= ada_decode (gsymbol
->name
);
1416 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1418 gsymbol
->ada_mangled
= 1;
1420 if (obstack
!= NULL
)
1421 *resultp
= obstack_copy0 (obstack
, decoded
, strlen (decoded
));
1424 /* Sometimes, we can't find a corresponding objfile, in
1425 which case, we put the result on the heap. Since we only
1426 decode when needed, we hope this usually does not cause a
1427 significant memory leak (FIXME). */
1429 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1433 *slot
= xstrdup (decoded
);
1442 ada_la_decode (const char *encoded
, int options
)
1444 return xstrdup (ada_decode (encoded
));
1447 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1448 suffixes that encode debugging information or leading _ada_ on
1449 SYM_NAME (see is_name_suffix commentary for the debugging
1450 information that is ignored). If WILD, then NAME need only match a
1451 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1452 either argument is NULL. */
1455 match_name (const char *sym_name
, const char *name
, int wild
)
1457 if (sym_name
== NULL
|| name
== NULL
)
1460 return wild_match (sym_name
, name
) == 0;
1463 int len_name
= strlen (name
);
1465 return (strncmp (sym_name
, name
, len_name
) == 0
1466 && is_name_suffix (sym_name
+ len_name
))
1467 || (strncmp (sym_name
, "_ada_", 5) == 0
1468 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1469 && is_name_suffix (sym_name
+ len_name
+ 5));
1476 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1477 generated by the GNAT compiler to describe the index type used
1478 for each dimension of an array, check whether it follows the latest
1479 known encoding. If not, fix it up to conform to the latest encoding.
1480 Otherwise, do nothing. This function also does nothing if
1481 INDEX_DESC_TYPE is NULL.
1483 The GNAT encoding used to describle the array index type evolved a bit.
1484 Initially, the information would be provided through the name of each
1485 field of the structure type only, while the type of these fields was
1486 described as unspecified and irrelevant. The debugger was then expected
1487 to perform a global type lookup using the name of that field in order
1488 to get access to the full index type description. Because these global
1489 lookups can be very expensive, the encoding was later enhanced to make
1490 the global lookup unnecessary by defining the field type as being
1491 the full index type description.
1493 The purpose of this routine is to allow us to support older versions
1494 of the compiler by detecting the use of the older encoding, and by
1495 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1496 we essentially replace each field's meaningless type by the associated
1500 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1504 if (index_desc_type
== NULL
)
1506 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1508 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1509 to check one field only, no need to check them all). If not, return
1512 If our INDEX_DESC_TYPE was generated using the older encoding,
1513 the field type should be a meaningless integer type whose name
1514 is not equal to the field name. */
1515 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1516 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1517 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1520 /* Fixup each field of INDEX_DESC_TYPE. */
1521 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1523 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1524 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1527 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1531 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1533 static char *bound_name
[] = {
1534 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1535 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1538 /* Maximum number of array dimensions we are prepared to handle. */
1540 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1543 /* The desc_* routines return primitive portions of array descriptors
1546 /* The descriptor or array type, if any, indicated by TYPE; removes
1547 level of indirection, if needed. */
1549 static struct type
*
1550 desc_base_type (struct type
*type
)
1554 type
= ada_check_typedef (type
);
1555 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1556 type
= ada_typedef_target_type (type
);
1559 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1560 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1561 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1566 /* True iff TYPE indicates a "thin" array pointer type. */
1569 is_thin_pntr (struct type
*type
)
1572 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1573 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1576 /* The descriptor type for thin pointer type TYPE. */
1578 static struct type
*
1579 thin_descriptor_type (struct type
*type
)
1581 struct type
*base_type
= desc_base_type (type
);
1583 if (base_type
== NULL
)
1585 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1589 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1591 if (alt_type
== NULL
)
1598 /* A pointer to the array data for thin-pointer value VAL. */
1600 static struct value
*
1601 thin_data_pntr (struct value
*val
)
1603 struct type
*type
= ada_check_typedef (value_type (val
));
1604 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1606 data_type
= lookup_pointer_type (data_type
);
1608 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1609 return value_cast (data_type
, value_copy (val
));
1611 return value_from_longest (data_type
, value_address (val
));
1614 /* True iff TYPE indicates a "thick" array pointer type. */
1617 is_thick_pntr (struct type
*type
)
1619 type
= desc_base_type (type
);
1620 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1621 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1624 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1625 pointer to one, the type of its bounds data; otherwise, NULL. */
1627 static struct type
*
1628 desc_bounds_type (struct type
*type
)
1632 type
= desc_base_type (type
);
1636 else if (is_thin_pntr (type
))
1638 type
= thin_descriptor_type (type
);
1641 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1643 return ada_check_typedef (r
);
1645 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1647 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1649 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1654 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1655 one, a pointer to its bounds data. Otherwise NULL. */
1657 static struct value
*
1658 desc_bounds (struct value
*arr
)
1660 struct type
*type
= ada_check_typedef (value_type (arr
));
1662 if (is_thin_pntr (type
))
1664 struct type
*bounds_type
=
1665 desc_bounds_type (thin_descriptor_type (type
));
1668 if (bounds_type
== NULL
)
1669 error (_("Bad GNAT array descriptor"));
1671 /* NOTE: The following calculation is not really kosher, but
1672 since desc_type is an XVE-encoded type (and shouldn't be),
1673 the correct calculation is a real pain. FIXME (and fix GCC). */
1674 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1675 addr
= value_as_long (arr
);
1677 addr
= value_address (arr
);
1680 value_from_longest (lookup_pointer_type (bounds_type
),
1681 addr
- TYPE_LENGTH (bounds_type
));
1684 else if (is_thick_pntr (type
))
1686 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1687 _("Bad GNAT array descriptor"));
1688 struct type
*p_bounds_type
= value_type (p_bounds
);
1691 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1693 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1695 if (TYPE_STUB (target_type
))
1696 p_bounds
= value_cast (lookup_pointer_type
1697 (ada_check_typedef (target_type
)),
1701 error (_("Bad GNAT array descriptor"));
1709 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1710 position of the field containing the address of the bounds data. */
1713 fat_pntr_bounds_bitpos (struct type
*type
)
1715 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1718 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1719 size of the field containing the address of the bounds data. */
1722 fat_pntr_bounds_bitsize (struct type
*type
)
1724 type
= desc_base_type (type
);
1726 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1727 return TYPE_FIELD_BITSIZE (type
, 1);
1729 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1732 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1733 pointer to one, the type of its array data (a array-with-no-bounds type);
1734 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1737 static struct type
*
1738 desc_data_target_type (struct type
*type
)
1740 type
= desc_base_type (type
);
1742 /* NOTE: The following is bogus; see comment in desc_bounds. */
1743 if (is_thin_pntr (type
))
1744 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1745 else if (is_thick_pntr (type
))
1747 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1750 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1751 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1757 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1760 static struct value
*
1761 desc_data (struct value
*arr
)
1763 struct type
*type
= value_type (arr
);
1765 if (is_thin_pntr (type
))
1766 return thin_data_pntr (arr
);
1767 else if (is_thick_pntr (type
))
1768 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1769 _("Bad GNAT array descriptor"));
1775 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1776 position of the field containing the address of the data. */
1779 fat_pntr_data_bitpos (struct type
*type
)
1781 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1784 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1785 size of the field containing the address of the data. */
1788 fat_pntr_data_bitsize (struct type
*type
)
1790 type
= desc_base_type (type
);
1792 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1793 return TYPE_FIELD_BITSIZE (type
, 0);
1795 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1798 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1799 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1800 bound, if WHICH is 1. The first bound is I=1. */
1802 static struct value
*
1803 desc_one_bound (struct value
*bounds
, int i
, int which
)
1805 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1806 _("Bad GNAT array descriptor bounds"));
1809 /* If BOUNDS is an array-bounds structure type, return the bit position
1810 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1811 bound, if WHICH is 1. The first bound is I=1. */
1814 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1816 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1819 /* If BOUNDS is an array-bounds structure type, return the bit field size
1820 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1821 bound, if WHICH is 1. The first bound is I=1. */
1824 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1826 type
= desc_base_type (type
);
1828 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1829 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1831 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1834 /* If TYPE is the type of an array-bounds structure, the type of its
1835 Ith bound (numbering from 1). Otherwise, NULL. */
1837 static struct type
*
1838 desc_index_type (struct type
*type
, int i
)
1840 type
= desc_base_type (type
);
1842 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1843 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1848 /* The number of index positions in the array-bounds type TYPE.
1849 Return 0 if TYPE is NULL. */
1852 desc_arity (struct type
*type
)
1854 type
= desc_base_type (type
);
1857 return TYPE_NFIELDS (type
) / 2;
1861 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1862 an array descriptor type (representing an unconstrained array
1866 ada_is_direct_array_type (struct type
*type
)
1870 type
= ada_check_typedef (type
);
1871 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1872 || ada_is_array_descriptor_type (type
));
1875 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1879 ada_is_array_type (struct type
*type
)
1882 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1883 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1884 type
= TYPE_TARGET_TYPE (type
);
1885 return ada_is_direct_array_type (type
);
1888 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1891 ada_is_simple_array_type (struct type
*type
)
1895 type
= ada_check_typedef (type
);
1896 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1897 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1898 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1899 == TYPE_CODE_ARRAY
));
1902 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1905 ada_is_array_descriptor_type (struct type
*type
)
1907 struct type
*data_type
= desc_data_target_type (type
);
1911 type
= ada_check_typedef (type
);
1912 return (data_type
!= NULL
1913 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1914 && desc_arity (desc_bounds_type (type
)) > 0);
1917 /* Non-zero iff type is a partially mal-formed GNAT array
1918 descriptor. FIXME: This is to compensate for some problems with
1919 debugging output from GNAT. Re-examine periodically to see if it
1923 ada_is_bogus_array_descriptor (struct type
*type
)
1927 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1928 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1929 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1930 && !ada_is_array_descriptor_type (type
);
1934 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1935 (fat pointer) returns the type of the array data described---specifically,
1936 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1937 in from the descriptor; otherwise, they are left unspecified. If
1938 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1939 returns NULL. The result is simply the type of ARR if ARR is not
1942 ada_type_of_array (struct value
*arr
, int bounds
)
1944 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1945 return decode_constrained_packed_array_type (value_type (arr
));
1947 if (!ada_is_array_descriptor_type (value_type (arr
)))
1948 return value_type (arr
);
1952 struct type
*array_type
=
1953 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1955 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1956 TYPE_FIELD_BITSIZE (array_type
, 0) =
1957 decode_packed_array_bitsize (value_type (arr
));
1963 struct type
*elt_type
;
1965 struct value
*descriptor
;
1967 elt_type
= ada_array_element_type (value_type (arr
), -1);
1968 arity
= ada_array_arity (value_type (arr
));
1970 if (elt_type
== NULL
|| arity
== 0)
1971 return ada_check_typedef (value_type (arr
));
1973 descriptor
= desc_bounds (arr
);
1974 if (value_as_long (descriptor
) == 0)
1978 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1979 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1980 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1981 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1984 create_static_range_type (range_type
, value_type (low
),
1985 longest_to_int (value_as_long (low
)),
1986 longest_to_int (value_as_long (high
)));
1987 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1989 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1991 /* We need to store the element packed bitsize, as well as
1992 recompute the array size, because it was previously
1993 computed based on the unpacked element size. */
1994 LONGEST lo
= value_as_long (low
);
1995 LONGEST hi
= value_as_long (high
);
1997 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1998 decode_packed_array_bitsize (value_type (arr
));
1999 /* If the array has no element, then the size is already
2000 zero, and does not need to be recomputed. */
2004 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
2006 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
2011 return lookup_pointer_type (elt_type
);
2015 /* If ARR does not represent an array, returns ARR unchanged.
2016 Otherwise, returns either a standard GDB array with bounds set
2017 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2018 GDB array. Returns NULL if ARR is a null fat pointer. */
2021 ada_coerce_to_simple_array_ptr (struct value
*arr
)
2023 if (ada_is_array_descriptor_type (value_type (arr
)))
2025 struct type
*arrType
= ada_type_of_array (arr
, 1);
2027 if (arrType
== NULL
)
2029 return value_cast (arrType
, value_copy (desc_data (arr
)));
2031 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2032 return decode_constrained_packed_array (arr
);
2037 /* If ARR does not represent an array, returns ARR unchanged.
2038 Otherwise, returns a standard GDB array describing ARR (which may
2039 be ARR itself if it already is in the proper form). */
2042 ada_coerce_to_simple_array (struct value
*arr
)
2044 if (ada_is_array_descriptor_type (value_type (arr
)))
2046 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2049 error (_("Bounds unavailable for null array pointer."));
2050 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
2051 return value_ind (arrVal
);
2053 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2054 return decode_constrained_packed_array (arr
);
2059 /* If TYPE represents a GNAT array type, return it translated to an
2060 ordinary GDB array type (possibly with BITSIZE fields indicating
2061 packing). For other types, is the identity. */
2064 ada_coerce_to_simple_array_type (struct type
*type
)
2066 if (ada_is_constrained_packed_array_type (type
))
2067 return decode_constrained_packed_array_type (type
);
2069 if (ada_is_array_descriptor_type (type
))
2070 return ada_check_typedef (desc_data_target_type (type
));
2075 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2078 ada_is_packed_array_type (struct type
*type
)
2082 type
= desc_base_type (type
);
2083 type
= ada_check_typedef (type
);
2085 ada_type_name (type
) != NULL
2086 && strstr (ada_type_name (type
), "___XP") != NULL
;
2089 /* Non-zero iff TYPE represents a standard GNAT constrained
2090 packed-array type. */
2093 ada_is_constrained_packed_array_type (struct type
*type
)
2095 return ada_is_packed_array_type (type
)
2096 && !ada_is_array_descriptor_type (type
);
2099 /* Non-zero iff TYPE represents an array descriptor for a
2100 unconstrained packed-array type. */
2103 ada_is_unconstrained_packed_array_type (struct type
*type
)
2105 return ada_is_packed_array_type (type
)
2106 && ada_is_array_descriptor_type (type
);
2109 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2110 return the size of its elements in bits. */
2113 decode_packed_array_bitsize (struct type
*type
)
2115 const char *raw_name
;
2119 /* Access to arrays implemented as fat pointers are encoded as a typedef
2120 of the fat pointer type. We need the name of the fat pointer type
2121 to do the decoding, so strip the typedef layer. */
2122 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2123 type
= ada_typedef_target_type (type
);
2125 raw_name
= ada_type_name (ada_check_typedef (type
));
2127 raw_name
= ada_type_name (desc_base_type (type
));
2132 tail
= strstr (raw_name
, "___XP");
2133 gdb_assert (tail
!= NULL
);
2135 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2138 (_("could not understand bit size information on packed array"));
2145 /* Given that TYPE is a standard GDB array type with all bounds filled
2146 in, and that the element size of its ultimate scalar constituents
2147 (that is, either its elements, or, if it is an array of arrays, its
2148 elements' elements, etc.) is *ELT_BITS, return an identical type,
2149 but with the bit sizes of its elements (and those of any
2150 constituent arrays) recorded in the BITSIZE components of its
2151 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2154 static struct type
*
2155 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2157 struct type
*new_elt_type
;
2158 struct type
*new_type
;
2159 struct type
*index_type_desc
;
2160 struct type
*index_type
;
2161 LONGEST low_bound
, high_bound
;
2163 type
= ada_check_typedef (type
);
2164 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2167 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2168 if (index_type_desc
)
2169 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2172 index_type
= TYPE_INDEX_TYPE (type
);
2174 new_type
= alloc_type_copy (type
);
2176 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2178 create_array_type (new_type
, new_elt_type
, index_type
);
2179 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2180 TYPE_NAME (new_type
) = ada_type_name (type
);
2182 if (get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2183 low_bound
= high_bound
= 0;
2184 if (high_bound
< low_bound
)
2185 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2188 *elt_bits
*= (high_bound
- low_bound
+ 1);
2189 TYPE_LENGTH (new_type
) =
2190 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2193 TYPE_FIXED_INSTANCE (new_type
) = 1;
2197 /* The array type encoded by TYPE, where
2198 ada_is_constrained_packed_array_type (TYPE). */
2200 static struct type
*
2201 decode_constrained_packed_array_type (struct type
*type
)
2203 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2206 struct type
*shadow_type
;
2210 raw_name
= ada_type_name (desc_base_type (type
));
2215 name
= (char *) alloca (strlen (raw_name
) + 1);
2216 tail
= strstr (raw_name
, "___XP");
2217 type
= desc_base_type (type
);
2219 memcpy (name
, raw_name
, tail
- raw_name
);
2220 name
[tail
- raw_name
] = '\000';
2222 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2224 if (shadow_type
== NULL
)
2226 lim_warning (_("could not find bounds information on packed array"));
2229 CHECK_TYPEDEF (shadow_type
);
2231 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2233 lim_warning (_("could not understand bounds "
2234 "information on packed array"));
2238 bits
= decode_packed_array_bitsize (type
);
2239 return constrained_packed_array_type (shadow_type
, &bits
);
2242 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2243 array, returns a simple array that denotes that array. Its type is a
2244 standard GDB array type except that the BITSIZEs of the array
2245 target types are set to the number of bits in each element, and the
2246 type length is set appropriately. */
2248 static struct value
*
2249 decode_constrained_packed_array (struct value
*arr
)
2253 /* If our value is a pointer, then dereference it. Likewise if
2254 the value is a reference. Make sure that this operation does not
2255 cause the target type to be fixed, as this would indirectly cause
2256 this array to be decoded. The rest of the routine assumes that
2257 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2258 and "value_ind" routines to perform the dereferencing, as opposed
2259 to using "ada_coerce_ref" or "ada_value_ind". */
2260 arr
= coerce_ref (arr
);
2261 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2262 arr
= value_ind (arr
);
2264 type
= decode_constrained_packed_array_type (value_type (arr
));
2267 error (_("can't unpack array"));
2271 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2272 && ada_is_modular_type (value_type (arr
)))
2274 /* This is a (right-justified) modular type representing a packed
2275 array with no wrapper. In order to interpret the value through
2276 the (left-justified) packed array type we just built, we must
2277 first left-justify it. */
2278 int bit_size
, bit_pos
;
2281 mod
= ada_modulus (value_type (arr
)) - 1;
2288 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2289 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2290 bit_pos
/ HOST_CHAR_BIT
,
2291 bit_pos
% HOST_CHAR_BIT
,
2296 return coerce_unspec_val_to_type (arr
, type
);
2300 /* The value of the element of packed array ARR at the ARITY indices
2301 given in IND. ARR must be a simple array. */
2303 static struct value
*
2304 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2307 int bits
, elt_off
, bit_off
;
2308 long elt_total_bit_offset
;
2309 struct type
*elt_type
;
2313 elt_total_bit_offset
= 0;
2314 elt_type
= ada_check_typedef (value_type (arr
));
2315 for (i
= 0; i
< arity
; i
+= 1)
2317 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2318 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2320 (_("attempt to do packed indexing of "
2321 "something other than a packed array"));
2324 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2325 LONGEST lowerbound
, upperbound
;
2328 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2330 lim_warning (_("don't know bounds of array"));
2331 lowerbound
= upperbound
= 0;
2334 idx
= pos_atr (ind
[i
]);
2335 if (idx
< lowerbound
|| idx
> upperbound
)
2336 lim_warning (_("packed array index %ld out of bounds"),
2338 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2339 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2340 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2343 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2344 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2346 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2351 /* Non-zero iff TYPE includes negative integer values. */
2354 has_negatives (struct type
*type
)
2356 switch (TYPE_CODE (type
))
2361 return !TYPE_UNSIGNED (type
);
2362 case TYPE_CODE_RANGE
:
2363 return TYPE_LOW_BOUND (type
) < 0;
2368 /* Create a new value of type TYPE from the contents of OBJ starting
2369 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2370 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2371 assigning through the result will set the field fetched from.
2372 VALADDR is ignored unless OBJ is NULL, in which case,
2373 VALADDR+OFFSET must address the start of storage containing the
2374 packed value. The value returned in this case is never an lval.
2375 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2378 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2379 long offset
, int bit_offset
, int bit_size
,
2383 int src
, /* Index into the source area */
2384 targ
, /* Index into the target area */
2385 srcBitsLeft
, /* Number of source bits left to move */
2386 nsrc
, ntarg
, /* Number of source and target bytes */
2387 unusedLS
, /* Number of bits in next significant
2388 byte of source that are unused */
2389 accumSize
; /* Number of meaningful bits in accum */
2390 unsigned char *bytes
; /* First byte containing data to unpack */
2391 unsigned char *unpacked
;
2392 unsigned long accum
; /* Staging area for bits being transferred */
2394 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2395 /* Transmit bytes from least to most significant; delta is the direction
2396 the indices move. */
2397 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2399 type
= ada_check_typedef (type
);
2403 v
= allocate_value (type
);
2404 bytes
= (unsigned char *) (valaddr
+ offset
);
2406 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2408 v
= value_at (type
, value_address (obj
));
2409 type
= value_type (v
);
2410 bytes
= (unsigned char *) alloca (len
);
2411 read_memory (value_address (v
) + offset
, bytes
, len
);
2415 v
= allocate_value (type
);
2416 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2421 long new_offset
= offset
;
2423 set_value_component_location (v
, obj
);
2424 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2425 set_value_bitsize (v
, bit_size
);
2426 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2429 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2431 set_value_offset (v
, new_offset
);
2433 /* Also set the parent value. This is needed when trying to
2434 assign a new value (in inferior memory). */
2435 set_value_parent (v
, obj
);
2438 set_value_bitsize (v
, bit_size
);
2439 unpacked
= (unsigned char *) value_contents (v
);
2441 srcBitsLeft
= bit_size
;
2443 ntarg
= TYPE_LENGTH (type
);
2447 memset (unpacked
, 0, TYPE_LENGTH (type
));
2450 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2453 if (has_negatives (type
)
2454 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2458 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2461 switch (TYPE_CODE (type
))
2463 case TYPE_CODE_ARRAY
:
2464 case TYPE_CODE_UNION
:
2465 case TYPE_CODE_STRUCT
:
2466 /* Non-scalar values must be aligned at a byte boundary... */
2468 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2469 /* ... And are placed at the beginning (most-significant) bytes
2471 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2476 targ
= TYPE_LENGTH (type
) - 1;
2482 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2485 unusedLS
= bit_offset
;
2488 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2495 /* Mask for removing bits of the next source byte that are not
2496 part of the value. */
2497 unsigned int unusedMSMask
=
2498 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2500 /* Sign-extend bits for this byte. */
2501 unsigned int signMask
= sign
& ~unusedMSMask
;
2504 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2505 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2506 if (accumSize
>= HOST_CHAR_BIT
)
2508 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2509 accumSize
-= HOST_CHAR_BIT
;
2510 accum
>>= HOST_CHAR_BIT
;
2514 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2521 accum
|= sign
<< accumSize
;
2522 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2523 accumSize
-= HOST_CHAR_BIT
;
2524 accum
>>= HOST_CHAR_BIT
;
2532 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2533 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2536 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2537 int src_offset
, int n
, int bits_big_endian_p
)
2539 unsigned int accum
, mask
;
2540 int accum_bits
, chunk_size
;
2542 target
+= targ_offset
/ HOST_CHAR_BIT
;
2543 targ_offset
%= HOST_CHAR_BIT
;
2544 source
+= src_offset
/ HOST_CHAR_BIT
;
2545 src_offset
%= HOST_CHAR_BIT
;
2546 if (bits_big_endian_p
)
2548 accum
= (unsigned char) *source
;
2550 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2556 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2557 accum_bits
+= HOST_CHAR_BIT
;
2559 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2562 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2563 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2566 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2568 accum_bits
-= chunk_size
;
2575 accum
= (unsigned char) *source
>> src_offset
;
2577 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2581 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2582 accum_bits
+= HOST_CHAR_BIT
;
2584 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2587 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2588 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2590 accum_bits
-= chunk_size
;
2591 accum
>>= chunk_size
;
2598 /* Store the contents of FROMVAL into the location of TOVAL.
2599 Return a new value with the location of TOVAL and contents of
2600 FROMVAL. Handles assignment into packed fields that have
2601 floating-point or non-scalar types. */
2603 static struct value
*
2604 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2606 struct type
*type
= value_type (toval
);
2607 int bits
= value_bitsize (toval
);
2609 toval
= ada_coerce_ref (toval
);
2610 fromval
= ada_coerce_ref (fromval
);
2612 if (ada_is_direct_array_type (value_type (toval
)))
2613 toval
= ada_coerce_to_simple_array (toval
);
2614 if (ada_is_direct_array_type (value_type (fromval
)))
2615 fromval
= ada_coerce_to_simple_array (fromval
);
2617 if (!deprecated_value_modifiable (toval
))
2618 error (_("Left operand of assignment is not a modifiable lvalue."));
2620 if (VALUE_LVAL (toval
) == lval_memory
2622 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2623 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2625 int len
= (value_bitpos (toval
)
2626 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2628 gdb_byte
*buffer
= alloca (len
);
2630 CORE_ADDR to_addr
= value_address (toval
);
2632 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2633 fromval
= value_cast (type
, fromval
);
2635 read_memory (to_addr
, buffer
, len
);
2636 from_size
= value_bitsize (fromval
);
2638 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2639 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2640 move_bits (buffer
, value_bitpos (toval
),
2641 value_contents (fromval
), from_size
- bits
, bits
, 1);
2643 move_bits (buffer
, value_bitpos (toval
),
2644 value_contents (fromval
), 0, bits
, 0);
2645 write_memory_with_notification (to_addr
, buffer
, len
);
2647 val
= value_copy (toval
);
2648 memcpy (value_contents_raw (val
), value_contents (fromval
),
2649 TYPE_LENGTH (type
));
2650 deprecated_set_value_type (val
, type
);
2655 return value_assign (toval
, fromval
);
2659 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2660 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2661 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2662 * COMPONENT, and not the inferior's memory. The current contents
2663 * of COMPONENT are ignored. */
2665 value_assign_to_component (struct value
*container
, struct value
*component
,
2668 LONGEST offset_in_container
=
2669 (LONGEST
) (value_address (component
) - value_address (container
));
2670 int bit_offset_in_container
=
2671 value_bitpos (component
) - value_bitpos (container
);
2674 val
= value_cast (value_type (component
), val
);
2676 if (value_bitsize (component
) == 0)
2677 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2679 bits
= value_bitsize (component
);
2681 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2682 move_bits (value_contents_writeable (container
) + offset_in_container
,
2683 value_bitpos (container
) + bit_offset_in_container
,
2684 value_contents (val
),
2685 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2688 move_bits (value_contents_writeable (container
) + offset_in_container
,
2689 value_bitpos (container
) + bit_offset_in_container
,
2690 value_contents (val
), 0, bits
, 0);
2693 /* The value of the element of array ARR at the ARITY indices given in IND.
2694 ARR may be either a simple array, GNAT array descriptor, or pointer
2698 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2702 struct type
*elt_type
;
2704 elt
= ada_coerce_to_simple_array (arr
);
2706 elt_type
= ada_check_typedef (value_type (elt
));
2707 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2708 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2709 return value_subscript_packed (elt
, arity
, ind
);
2711 for (k
= 0; k
< arity
; k
+= 1)
2713 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2714 error (_("too many subscripts (%d expected)"), k
);
2715 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2720 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2721 value of the element of *ARR at the ARITY indices given in
2722 IND. Does not read the entire array into memory. */
2724 static struct value
*
2725 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2730 for (k
= 0; k
< arity
; k
+= 1)
2734 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2735 error (_("too many subscripts (%d expected)"), k
);
2736 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2738 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2739 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2740 type
= TYPE_TARGET_TYPE (type
);
2743 return value_ind (arr
);
2746 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2747 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2748 elements starting at index LOW. The lower bound of this array is LOW, as
2750 static struct value
*
2751 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2754 struct type
*type0
= ada_check_typedef (type
);
2755 CORE_ADDR base
= value_as_address (array_ptr
)
2756 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
)))
2757 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2758 struct type
*index_type
2759 = create_static_range_type (NULL
,
2760 TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
)),
2762 struct type
*slice_type
=
2763 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2765 return value_at_lazy (slice_type
, base
);
2769 static struct value
*
2770 ada_value_slice (struct value
*array
, int low
, int high
)
2772 struct type
*type
= ada_check_typedef (value_type (array
));
2773 struct type
*index_type
2774 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2775 struct type
*slice_type
=
2776 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2778 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2781 /* If type is a record type in the form of a standard GNAT array
2782 descriptor, returns the number of dimensions for type. If arr is a
2783 simple array, returns the number of "array of"s that prefix its
2784 type designation. Otherwise, returns 0. */
2787 ada_array_arity (struct type
*type
)
2794 type
= desc_base_type (type
);
2797 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2798 return desc_arity (desc_bounds_type (type
));
2800 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2803 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2809 /* If TYPE is a record type in the form of a standard GNAT array
2810 descriptor or a simple array type, returns the element type for
2811 TYPE after indexing by NINDICES indices, or by all indices if
2812 NINDICES is -1. Otherwise, returns NULL. */
2815 ada_array_element_type (struct type
*type
, int nindices
)
2817 type
= desc_base_type (type
);
2819 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2822 struct type
*p_array_type
;
2824 p_array_type
= desc_data_target_type (type
);
2826 k
= ada_array_arity (type
);
2830 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2831 if (nindices
>= 0 && k
> nindices
)
2833 while (k
> 0 && p_array_type
!= NULL
)
2835 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2838 return p_array_type
;
2840 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2842 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2844 type
= TYPE_TARGET_TYPE (type
);
2853 /* The type of nth index in arrays of given type (n numbering from 1).
2854 Does not examine memory. Throws an error if N is invalid or TYPE
2855 is not an array type. NAME is the name of the Ada attribute being
2856 evaluated ('range, 'first, 'last, or 'length); it is used in building
2857 the error message. */
2859 static struct type
*
2860 ada_index_type (struct type
*type
, int n
, const char *name
)
2862 struct type
*result_type
;
2864 type
= desc_base_type (type
);
2866 if (n
< 0 || n
> ada_array_arity (type
))
2867 error (_("invalid dimension number to '%s"), name
);
2869 if (ada_is_simple_array_type (type
))
2873 for (i
= 1; i
< n
; i
+= 1)
2874 type
= TYPE_TARGET_TYPE (type
);
2875 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2876 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2877 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2878 perhaps stabsread.c would make more sense. */
2879 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2884 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2885 if (result_type
== NULL
)
2886 error (_("attempt to take bound of something that is not an array"));
2892 /* Given that arr is an array type, returns the lower bound of the
2893 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2894 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2895 array-descriptor type. It works for other arrays with bounds supplied
2896 by run-time quantities other than discriminants. */
2899 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2901 struct type
*type
, *index_type_desc
, *index_type
;
2904 gdb_assert (which
== 0 || which
== 1);
2906 if (ada_is_constrained_packed_array_type (arr_type
))
2907 arr_type
= decode_constrained_packed_array_type (arr_type
);
2909 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2910 return (LONGEST
) - which
;
2912 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2913 type
= TYPE_TARGET_TYPE (arr_type
);
2917 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2918 ada_fixup_array_indexes_type (index_type_desc
);
2919 if (index_type_desc
!= NULL
)
2920 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2924 struct type
*elt_type
= check_typedef (type
);
2926 for (i
= 1; i
< n
; i
++)
2927 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
2929 index_type
= TYPE_INDEX_TYPE (elt_type
);
2933 (LONGEST
) (which
== 0
2934 ? ada_discrete_type_low_bound (index_type
)
2935 : ada_discrete_type_high_bound (index_type
));
2938 /* Given that arr is an array value, returns the lower bound of the
2939 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2940 WHICH is 1. This routine will also work for arrays with bounds
2941 supplied by run-time quantities other than discriminants. */
2944 ada_array_bound (struct value
*arr
, int n
, int which
)
2946 struct type
*arr_type
= value_type (arr
);
2948 if (ada_is_constrained_packed_array_type (arr_type
))
2949 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2950 else if (ada_is_simple_array_type (arr_type
))
2951 return ada_array_bound_from_type (arr_type
, n
, which
);
2953 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2956 /* Given that arr is an array value, returns the length of the
2957 nth index. This routine will also work for arrays with bounds
2958 supplied by run-time quantities other than discriminants.
2959 Does not work for arrays indexed by enumeration types with representation
2960 clauses at the moment. */
2963 ada_array_length (struct value
*arr
, int n
)
2965 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2967 if (ada_is_constrained_packed_array_type (arr_type
))
2968 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2970 if (ada_is_simple_array_type (arr_type
))
2971 return (ada_array_bound_from_type (arr_type
, n
, 1)
2972 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2974 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2975 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2978 /* An empty array whose type is that of ARR_TYPE (an array type),
2979 with bounds LOW to LOW-1. */
2981 static struct value
*
2982 empty_array (struct type
*arr_type
, int low
)
2984 struct type
*arr_type0
= ada_check_typedef (arr_type
);
2985 struct type
*index_type
2986 = create_static_range_type
2987 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
, low
- 1);
2988 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
2990 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2994 /* Name resolution */
2996 /* The "decoded" name for the user-definable Ada operator corresponding
3000 ada_decoded_op_name (enum exp_opcode op
)
3004 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3006 if (ada_opname_table
[i
].op
== op
)
3007 return ada_opname_table
[i
].decoded
;
3009 error (_("Could not find operator name for opcode"));
3013 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3014 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3015 undefined namespace) and converts operators that are
3016 user-defined into appropriate function calls. If CONTEXT_TYPE is
3017 non-null, it provides a preferred result type [at the moment, only
3018 type void has any effect---causing procedures to be preferred over
3019 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3020 return type is preferred. May change (expand) *EXP. */
3023 resolve (struct expression
**expp
, int void_context_p
)
3025 struct type
*context_type
= NULL
;
3029 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3031 resolve_subexp (expp
, &pc
, 1, context_type
);
3034 /* Resolve the operator of the subexpression beginning at
3035 position *POS of *EXPP. "Resolving" consists of replacing
3036 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3037 with their resolutions, replacing built-in operators with
3038 function calls to user-defined operators, where appropriate, and,
3039 when DEPROCEDURE_P is non-zero, converting function-valued variables
3040 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3041 are as in ada_resolve, above. */
3043 static struct value
*
3044 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
3045 struct type
*context_type
)
3049 struct expression
*exp
; /* Convenience: == *expp. */
3050 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3051 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3052 int nargs
; /* Number of operands. */
3059 /* Pass one: resolve operands, saving their types and updating *pos,
3064 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3065 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3070 resolve_subexp (expp
, pos
, 0, NULL
);
3072 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3077 resolve_subexp (expp
, pos
, 0, NULL
);
3082 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
3085 case OP_ATR_MODULUS
:
3095 case TERNOP_IN_RANGE
:
3096 case BINOP_IN_BOUNDS
:
3102 case OP_DISCRETE_RANGE
:
3104 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3113 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3115 resolve_subexp (expp
, pos
, 1, NULL
);
3117 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3134 case BINOP_LOGICAL_AND
:
3135 case BINOP_LOGICAL_OR
:
3136 case BINOP_BITWISE_AND
:
3137 case BINOP_BITWISE_IOR
:
3138 case BINOP_BITWISE_XOR
:
3141 case BINOP_NOTEQUAL
:
3148 case BINOP_SUBSCRIPT
:
3156 case UNOP_LOGICAL_NOT
:
3172 case OP_INTERNALVAR
:
3182 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3185 case STRUCTOP_STRUCT
:
3186 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3199 error (_("Unexpected operator during name resolution"));
3202 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3203 for (i
= 0; i
< nargs
; i
+= 1)
3204 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3208 /* Pass two: perform any resolution on principal operator. */
3215 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3217 struct ada_symbol_info
*candidates
;
3221 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3222 (exp
->elts
[pc
+ 2].symbol
),
3223 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3226 if (n_candidates
> 1)
3228 /* Types tend to get re-introduced locally, so if there
3229 are any local symbols that are not types, first filter
3232 for (j
= 0; j
< n_candidates
; j
+= 1)
3233 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3238 case LOC_REGPARM_ADDR
:
3246 if (j
< n_candidates
)
3249 while (j
< n_candidates
)
3251 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3253 candidates
[j
] = candidates
[n_candidates
- 1];
3262 if (n_candidates
== 0)
3263 error (_("No definition found for %s"),
3264 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3265 else if (n_candidates
== 1)
3267 else if (deprocedure_p
3268 && !is_nonfunction (candidates
, n_candidates
))
3270 i
= ada_resolve_function
3271 (candidates
, n_candidates
, NULL
, 0,
3272 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3275 error (_("Could not find a match for %s"),
3276 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3280 printf_filtered (_("Multiple matches for %s\n"),
3281 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3282 user_select_syms (candidates
, n_candidates
, 1);
3286 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3287 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3288 if (innermost_block
== NULL
3289 || contained_in (candidates
[i
].block
, innermost_block
))
3290 innermost_block
= candidates
[i
].block
;
3294 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3297 replace_operator_with_call (expp
, pc
, 0, 0,
3298 exp
->elts
[pc
+ 2].symbol
,
3299 exp
->elts
[pc
+ 1].block
);
3306 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3307 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3309 struct ada_symbol_info
*candidates
;
3313 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3314 (exp
->elts
[pc
+ 5].symbol
),
3315 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3317 if (n_candidates
== 1)
3321 i
= ada_resolve_function
3322 (candidates
, n_candidates
,
3324 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3327 error (_("Could not find a match for %s"),
3328 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3331 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3332 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3333 if (innermost_block
== NULL
3334 || contained_in (candidates
[i
].block
, innermost_block
))
3335 innermost_block
= candidates
[i
].block
;
3346 case BINOP_BITWISE_AND
:
3347 case BINOP_BITWISE_IOR
:
3348 case BINOP_BITWISE_XOR
:
3350 case BINOP_NOTEQUAL
:
3358 case UNOP_LOGICAL_NOT
:
3360 if (possible_user_operator_p (op
, argvec
))
3362 struct ada_symbol_info
*candidates
;
3366 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3367 (struct block
*) NULL
, VAR_DOMAIN
,
3369 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3370 ada_decoded_op_name (op
), NULL
);
3374 replace_operator_with_call (expp
, pc
, nargs
, 1,
3375 candidates
[i
].sym
, candidates
[i
].block
);
3386 return evaluate_subexp_type (exp
, pos
);
3389 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3390 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3392 /* The term "match" here is rather loose. The match is heuristic and
3396 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3398 ftype
= ada_check_typedef (ftype
);
3399 atype
= ada_check_typedef (atype
);
3401 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3402 ftype
= TYPE_TARGET_TYPE (ftype
);
3403 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3404 atype
= TYPE_TARGET_TYPE (atype
);
3406 switch (TYPE_CODE (ftype
))
3409 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3411 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3412 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3413 TYPE_TARGET_TYPE (atype
), 0);
3416 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3418 case TYPE_CODE_ENUM
:
3419 case TYPE_CODE_RANGE
:
3420 switch (TYPE_CODE (atype
))
3423 case TYPE_CODE_ENUM
:
3424 case TYPE_CODE_RANGE
:
3430 case TYPE_CODE_ARRAY
:
3431 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3432 || ada_is_array_descriptor_type (atype
));
3434 case TYPE_CODE_STRUCT
:
3435 if (ada_is_array_descriptor_type (ftype
))
3436 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3437 || ada_is_array_descriptor_type (atype
));
3439 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3440 && !ada_is_array_descriptor_type (atype
));
3442 case TYPE_CODE_UNION
:
3444 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3448 /* Return non-zero if the formals of FUNC "sufficiently match" the
3449 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3450 may also be an enumeral, in which case it is treated as a 0-
3451 argument function. */
3454 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3457 struct type
*func_type
= SYMBOL_TYPE (func
);
3459 if (SYMBOL_CLASS (func
) == LOC_CONST
3460 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3461 return (n_actuals
== 0);
3462 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3465 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3468 for (i
= 0; i
< n_actuals
; i
+= 1)
3470 if (actuals
[i
] == NULL
)
3474 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3476 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3478 if (!ada_type_match (ftype
, atype
, 1))
3485 /* False iff function type FUNC_TYPE definitely does not produce a value
3486 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3487 FUNC_TYPE is not a valid function type with a non-null return type
3488 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3491 return_match (struct type
*func_type
, struct type
*context_type
)
3493 struct type
*return_type
;
3495 if (func_type
== NULL
)
3498 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3499 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3501 return_type
= get_base_type (func_type
);
3502 if (return_type
== NULL
)
3505 context_type
= get_base_type (context_type
);
3507 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3508 return context_type
== NULL
|| return_type
== context_type
;
3509 else if (context_type
== NULL
)
3510 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3512 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3516 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3517 function (if any) that matches the types of the NARGS arguments in
3518 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3519 that returns that type, then eliminate matches that don't. If
3520 CONTEXT_TYPE is void and there is at least one match that does not
3521 return void, eliminate all matches that do.
3523 Asks the user if there is more than one match remaining. Returns -1
3524 if there is no such symbol or none is selected. NAME is used
3525 solely for messages. May re-arrange and modify SYMS in
3526 the process; the index returned is for the modified vector. */
3529 ada_resolve_function (struct ada_symbol_info syms
[],
3530 int nsyms
, struct value
**args
, int nargs
,
3531 const char *name
, struct type
*context_type
)
3535 int m
; /* Number of hits */
3538 /* In the first pass of the loop, we only accept functions matching
3539 context_type. If none are found, we add a second pass of the loop
3540 where every function is accepted. */
3541 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3543 for (k
= 0; k
< nsyms
; k
+= 1)
3545 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3547 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3548 && (fallback
|| return_match (type
, context_type
)))
3560 printf_filtered (_("Multiple matches for %s\n"), name
);
3561 user_select_syms (syms
, m
, 1);
3567 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3568 in a listing of choices during disambiguation (see sort_choices, below).
3569 The idea is that overloadings of a subprogram name from the
3570 same package should sort in their source order. We settle for ordering
3571 such symbols by their trailing number (__N or $N). */
3574 encoded_ordered_before (const char *N0
, const char *N1
)
3578 else if (N0
== NULL
)
3584 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3586 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3588 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3589 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3594 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3597 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3599 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3600 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3602 return (strcmp (N0
, N1
) < 0);
3606 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3610 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3614 for (i
= 1; i
< nsyms
; i
+= 1)
3616 struct ada_symbol_info sym
= syms
[i
];
3619 for (j
= i
- 1; j
>= 0; j
-= 1)
3621 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3622 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3624 syms
[j
+ 1] = syms
[j
];
3630 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3631 by asking the user (if necessary), returning the number selected,
3632 and setting the first elements of SYMS items. Error if no symbols
3635 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3636 to be re-integrated one of these days. */
3639 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3642 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3644 int first_choice
= (max_results
== 1) ? 1 : 2;
3645 const char *select_mode
= multiple_symbols_select_mode ();
3647 if (max_results
< 1)
3648 error (_("Request to select 0 symbols!"));
3652 if (select_mode
== multiple_symbols_cancel
)
3654 canceled because the command is ambiguous\n\
3655 See set/show multiple-symbol."));
3657 /* If select_mode is "all", then return all possible symbols.
3658 Only do that if more than one symbol can be selected, of course.
3659 Otherwise, display the menu as usual. */
3660 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3663 printf_unfiltered (_("[0] cancel\n"));
3664 if (max_results
> 1)
3665 printf_unfiltered (_("[1] all\n"));
3667 sort_choices (syms
, nsyms
);
3669 for (i
= 0; i
< nsyms
; i
+= 1)
3671 if (syms
[i
].sym
== NULL
)
3674 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3676 struct symtab_and_line sal
=
3677 find_function_start_sal (syms
[i
].sym
, 1);
3679 if (sal
.symtab
== NULL
)
3680 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3682 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3685 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3686 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3687 symtab_to_filename_for_display (sal
.symtab
),
3694 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3695 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3696 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3697 struct symtab
*symtab
= SYMBOL_SYMTAB (syms
[i
].sym
);
3699 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3700 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3702 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3703 symtab_to_filename_for_display (symtab
),
3704 SYMBOL_LINE (syms
[i
].sym
));
3705 else if (is_enumeral
3706 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3708 printf_unfiltered (("[%d] "), i
+ first_choice
);
3709 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3710 gdb_stdout
, -1, 0, &type_print_raw_options
);
3711 printf_unfiltered (_("'(%s) (enumeral)\n"),
3712 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3714 else if (symtab
!= NULL
)
3715 printf_unfiltered (is_enumeral
3716 ? _("[%d] %s in %s (enumeral)\n")
3717 : _("[%d] %s at %s:?\n"),
3719 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3720 symtab_to_filename_for_display (symtab
));
3722 printf_unfiltered (is_enumeral
3723 ? _("[%d] %s (enumeral)\n")
3724 : _("[%d] %s at ?\n"),
3726 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3730 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3733 for (i
= 0; i
< n_chosen
; i
+= 1)
3734 syms
[i
] = syms
[chosen
[i
]];
3739 /* Read and validate a set of numeric choices from the user in the
3740 range 0 .. N_CHOICES-1. Place the results in increasing
3741 order in CHOICES[0 .. N-1], and return N.
3743 The user types choices as a sequence of numbers on one line
3744 separated by blanks, encoding them as follows:
3746 + A choice of 0 means to cancel the selection, throwing an error.
3747 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3748 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3750 The user is not allowed to choose more than MAX_RESULTS values.
3752 ANNOTATION_SUFFIX, if present, is used to annotate the input
3753 prompts (for use with the -f switch). */
3756 get_selections (int *choices
, int n_choices
, int max_results
,
3757 int is_all_choice
, char *annotation_suffix
)
3762 int first_choice
= is_all_choice
? 2 : 1;
3764 prompt
= getenv ("PS2");
3768 args
= command_line_input (prompt
, 0, annotation_suffix
);
3771 error_no_arg (_("one or more choice numbers"));
3775 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3776 order, as given in args. Choices are validated. */
3782 args
= skip_spaces (args
);
3783 if (*args
== '\0' && n_chosen
== 0)
3784 error_no_arg (_("one or more choice numbers"));
3785 else if (*args
== '\0')
3788 choice
= strtol (args
, &args2
, 10);
3789 if (args
== args2
|| choice
< 0
3790 || choice
> n_choices
+ first_choice
- 1)
3791 error (_("Argument must be choice number"));
3795 error (_("cancelled"));
3797 if (choice
< first_choice
)
3799 n_chosen
= n_choices
;
3800 for (j
= 0; j
< n_choices
; j
+= 1)
3804 choice
-= first_choice
;
3806 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3810 if (j
< 0 || choice
!= choices
[j
])
3814 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3815 choices
[k
+ 1] = choices
[k
];
3816 choices
[j
+ 1] = choice
;
3821 if (n_chosen
> max_results
)
3822 error (_("Select no more than %d of the above"), max_results
);
3827 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3828 on the function identified by SYM and BLOCK, and taking NARGS
3829 arguments. Update *EXPP as needed to hold more space. */
3832 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3833 int oplen
, struct symbol
*sym
,
3834 const struct block
*block
)
3836 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3837 symbol, -oplen for operator being replaced). */
3838 struct expression
*newexp
= (struct expression
*)
3839 xzalloc (sizeof (struct expression
)
3840 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3841 struct expression
*exp
= *expp
;
3843 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3844 newexp
->language_defn
= exp
->language_defn
;
3845 newexp
->gdbarch
= exp
->gdbarch
;
3846 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3847 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3848 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3850 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3851 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3853 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3854 newexp
->elts
[pc
+ 4].block
= block
;
3855 newexp
->elts
[pc
+ 5].symbol
= sym
;
3861 /* Type-class predicates */
3863 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3867 numeric_type_p (struct type
*type
)
3873 switch (TYPE_CODE (type
))
3878 case TYPE_CODE_RANGE
:
3879 return (type
== TYPE_TARGET_TYPE (type
)
3880 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3887 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3890 integer_type_p (struct type
*type
)
3896 switch (TYPE_CODE (type
))
3900 case TYPE_CODE_RANGE
:
3901 return (type
== TYPE_TARGET_TYPE (type
)
3902 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3909 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3912 scalar_type_p (struct type
*type
)
3918 switch (TYPE_CODE (type
))
3921 case TYPE_CODE_RANGE
:
3922 case TYPE_CODE_ENUM
:
3931 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3934 discrete_type_p (struct type
*type
)
3940 switch (TYPE_CODE (type
))
3943 case TYPE_CODE_RANGE
:
3944 case TYPE_CODE_ENUM
:
3945 case TYPE_CODE_BOOL
:
3953 /* Returns non-zero if OP with operands in the vector ARGS could be
3954 a user-defined function. Errs on the side of pre-defined operators
3955 (i.e., result 0). */
3958 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3960 struct type
*type0
=
3961 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3962 struct type
*type1
=
3963 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3977 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3981 case BINOP_BITWISE_AND
:
3982 case BINOP_BITWISE_IOR
:
3983 case BINOP_BITWISE_XOR
:
3984 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3987 case BINOP_NOTEQUAL
:
3992 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3995 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3998 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4002 case UNOP_LOGICAL_NOT
:
4004 return (!numeric_type_p (type0
));
4013 1. In the following, we assume that a renaming type's name may
4014 have an ___XD suffix. It would be nice if this went away at some
4016 2. We handle both the (old) purely type-based representation of
4017 renamings and the (new) variable-based encoding. At some point,
4018 it is devoutly to be hoped that the former goes away
4019 (FIXME: hilfinger-2007-07-09).
4020 3. Subprogram renamings are not implemented, although the XRS
4021 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4023 /* If SYM encodes a renaming,
4025 <renaming> renames <renamed entity>,
4027 sets *LEN to the length of the renamed entity's name,
4028 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4029 the string describing the subcomponent selected from the renamed
4030 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4031 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4032 are undefined). Otherwise, returns a value indicating the category
4033 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4034 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4035 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4036 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4037 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4038 may be NULL, in which case they are not assigned.
4040 [Currently, however, GCC does not generate subprogram renamings.] */
4042 enum ada_renaming_category
4043 ada_parse_renaming (struct symbol
*sym
,
4044 const char **renamed_entity
, int *len
,
4045 const char **renaming_expr
)
4047 enum ada_renaming_category kind
;
4052 return ADA_NOT_RENAMING
;
4053 switch (SYMBOL_CLASS (sym
))
4056 return ADA_NOT_RENAMING
;
4058 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
4059 renamed_entity
, len
, renaming_expr
);
4063 case LOC_OPTIMIZED_OUT
:
4064 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4066 return ADA_NOT_RENAMING
;
4070 kind
= ADA_OBJECT_RENAMING
;
4074 kind
= ADA_EXCEPTION_RENAMING
;
4078 kind
= ADA_PACKAGE_RENAMING
;
4082 kind
= ADA_SUBPROGRAM_RENAMING
;
4086 return ADA_NOT_RENAMING
;
4090 if (renamed_entity
!= NULL
)
4091 *renamed_entity
= info
;
4092 suffix
= strstr (info
, "___XE");
4093 if (suffix
== NULL
|| suffix
== info
)
4094 return ADA_NOT_RENAMING
;
4096 *len
= strlen (info
) - strlen (suffix
);
4098 if (renaming_expr
!= NULL
)
4099 *renaming_expr
= suffix
;
4103 /* Assuming TYPE encodes a renaming according to the old encoding in
4104 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4105 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4106 ADA_NOT_RENAMING otherwise. */
4107 static enum ada_renaming_category
4108 parse_old_style_renaming (struct type
*type
,
4109 const char **renamed_entity
, int *len
,
4110 const char **renaming_expr
)
4112 enum ada_renaming_category kind
;
4117 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4118 || TYPE_NFIELDS (type
) != 1)
4119 return ADA_NOT_RENAMING
;
4121 name
= type_name_no_tag (type
);
4123 return ADA_NOT_RENAMING
;
4125 name
= strstr (name
, "___XR");
4127 return ADA_NOT_RENAMING
;
4132 kind
= ADA_OBJECT_RENAMING
;
4135 kind
= ADA_EXCEPTION_RENAMING
;
4138 kind
= ADA_PACKAGE_RENAMING
;
4141 kind
= ADA_SUBPROGRAM_RENAMING
;
4144 return ADA_NOT_RENAMING
;
4147 info
= TYPE_FIELD_NAME (type
, 0);
4149 return ADA_NOT_RENAMING
;
4150 if (renamed_entity
!= NULL
)
4151 *renamed_entity
= info
;
4152 suffix
= strstr (info
, "___XE");
4153 if (renaming_expr
!= NULL
)
4154 *renaming_expr
= suffix
+ 5;
4155 if (suffix
== NULL
|| suffix
== info
)
4156 return ADA_NOT_RENAMING
;
4158 *len
= suffix
- info
;
4162 /* Compute the value of the given RENAMING_SYM, which is expected to
4163 be a symbol encoding a renaming expression. BLOCK is the block
4164 used to evaluate the renaming. */
4166 static struct value
*
4167 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4168 const struct block
*block
)
4170 const char *sym_name
;
4171 struct expression
*expr
;
4172 struct value
*value
;
4173 struct cleanup
*old_chain
= NULL
;
4175 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4176 expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4177 old_chain
= make_cleanup (free_current_contents
, &expr
);
4178 value
= evaluate_expression (expr
);
4180 do_cleanups (old_chain
);
4185 /* Evaluation: Function Calls */
4187 /* Return an lvalue containing the value VAL. This is the identity on
4188 lvalues, and otherwise has the side-effect of allocating memory
4189 in the inferior where a copy of the value contents is copied. */
4191 static struct value
*
4192 ensure_lval (struct value
*val
)
4194 if (VALUE_LVAL (val
) == not_lval
4195 || VALUE_LVAL (val
) == lval_internalvar
)
4197 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4198 const CORE_ADDR addr
=
4199 value_as_long (value_allocate_space_in_inferior (len
));
4201 set_value_address (val
, addr
);
4202 VALUE_LVAL (val
) = lval_memory
;
4203 write_memory (addr
, value_contents (val
), len
);
4209 /* Return the value ACTUAL, converted to be an appropriate value for a
4210 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4211 allocating any necessary descriptors (fat pointers), or copies of
4212 values not residing in memory, updating it as needed. */
4215 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4217 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4218 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4219 struct type
*formal_target
=
4220 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4221 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4222 struct type
*actual_target
=
4223 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4224 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4226 if (ada_is_array_descriptor_type (formal_target
)
4227 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4228 return make_array_descriptor (formal_type
, actual
);
4229 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4230 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4232 struct value
*result
;
4234 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4235 && ada_is_array_descriptor_type (actual_target
))
4236 result
= desc_data (actual
);
4237 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4239 if (VALUE_LVAL (actual
) != lval_memory
)
4243 actual_type
= ada_check_typedef (value_type (actual
));
4244 val
= allocate_value (actual_type
);
4245 memcpy ((char *) value_contents_raw (val
),
4246 (char *) value_contents (actual
),
4247 TYPE_LENGTH (actual_type
));
4248 actual
= ensure_lval (val
);
4250 result
= value_addr (actual
);
4254 return value_cast_pointers (formal_type
, result
, 0);
4256 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4257 return ada_value_ind (actual
);
4262 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4263 type TYPE. This is usually an inefficient no-op except on some targets
4264 (such as AVR) where the representation of a pointer and an address
4268 value_pointer (struct value
*value
, struct type
*type
)
4270 struct gdbarch
*gdbarch
= get_type_arch (type
);
4271 unsigned len
= TYPE_LENGTH (type
);
4272 gdb_byte
*buf
= alloca (len
);
4275 addr
= value_address (value
);
4276 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4277 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4282 /* Push a descriptor of type TYPE for array value ARR on the stack at
4283 *SP, updating *SP to reflect the new descriptor. Return either
4284 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4285 to-descriptor type rather than a descriptor type), a struct value *
4286 representing a pointer to this descriptor. */
4288 static struct value
*
4289 make_array_descriptor (struct type
*type
, struct value
*arr
)
4291 struct type
*bounds_type
= desc_bounds_type (type
);
4292 struct type
*desc_type
= desc_base_type (type
);
4293 struct value
*descriptor
= allocate_value (desc_type
);
4294 struct value
*bounds
= allocate_value (bounds_type
);
4297 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4300 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4301 ada_array_bound (arr
, i
, 0),
4302 desc_bound_bitpos (bounds_type
, i
, 0),
4303 desc_bound_bitsize (bounds_type
, i
, 0));
4304 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4305 ada_array_bound (arr
, i
, 1),
4306 desc_bound_bitpos (bounds_type
, i
, 1),
4307 desc_bound_bitsize (bounds_type
, i
, 1));
4310 bounds
= ensure_lval (bounds
);
4312 modify_field (value_type (descriptor
),
4313 value_contents_writeable (descriptor
),
4314 value_pointer (ensure_lval (arr
),
4315 TYPE_FIELD_TYPE (desc_type
, 0)),
4316 fat_pntr_data_bitpos (desc_type
),
4317 fat_pntr_data_bitsize (desc_type
));
4319 modify_field (value_type (descriptor
),
4320 value_contents_writeable (descriptor
),
4321 value_pointer (bounds
,
4322 TYPE_FIELD_TYPE (desc_type
, 1)),
4323 fat_pntr_bounds_bitpos (desc_type
),
4324 fat_pntr_bounds_bitsize (desc_type
));
4326 descriptor
= ensure_lval (descriptor
);
4328 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4329 return value_addr (descriptor
);
4334 /* Symbol Cache Module */
4336 /* Performance measurements made as of 2010-01-15 indicate that
4337 this cache does bring some noticeable improvements. Depending
4338 on the type of entity being printed, the cache can make it as much
4339 as an order of magnitude faster than without it.
4341 The descriptive type DWARF extension has significantly reduced
4342 the need for this cache, at least when DWARF is being used. However,
4343 even in this case, some expensive name-based symbol searches are still
4344 sometimes necessary - to find an XVZ variable, mostly. */
4346 /* Initialize the contents of SYM_CACHE. */
4349 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4351 obstack_init (&sym_cache
->cache_space
);
4352 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4355 /* Free the memory used by SYM_CACHE. */
4358 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4360 obstack_free (&sym_cache
->cache_space
, NULL
);
4364 /* Return the symbol cache associated to the given program space PSPACE.
4365 If not allocated for this PSPACE yet, allocate and initialize one. */
4367 static struct ada_symbol_cache
*
4368 ada_get_symbol_cache (struct program_space
*pspace
)
4370 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4371 struct ada_symbol_cache
*sym_cache
= pspace_data
->sym_cache
;
4373 if (sym_cache
== NULL
)
4375 sym_cache
= XCNEW (struct ada_symbol_cache
);
4376 ada_init_symbol_cache (sym_cache
);
4382 /* Clear all entries from the symbol cache. */
4385 ada_clear_symbol_cache (void)
4387 struct ada_symbol_cache
*sym_cache
4388 = ada_get_symbol_cache (current_program_space
);
4390 obstack_free (&sym_cache
->cache_space
, NULL
);
4391 ada_init_symbol_cache (sym_cache
);
4394 /* Search our cache for an entry matching NAME and NAMESPACE.
4395 Return it if found, or NULL otherwise. */
4397 static struct cache_entry
**
4398 find_entry (const char *name
, domain_enum
namespace)
4400 struct ada_symbol_cache
*sym_cache
4401 = ada_get_symbol_cache (current_program_space
);
4402 int h
= msymbol_hash (name
) % HASH_SIZE
;
4403 struct cache_entry
**e
;
4405 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4407 if (namespace == (*e
)->namespace && strcmp (name
, (*e
)->name
) == 0)
4413 /* Search the symbol cache for an entry matching NAME and NAMESPACE.
4414 Return 1 if found, 0 otherwise.
4416 If an entry was found and SYM is not NULL, set *SYM to the entry's
4417 SYM. Same principle for BLOCK if not NULL. */
4420 lookup_cached_symbol (const char *name
, domain_enum
namespace,
4421 struct symbol
**sym
, const struct block
**block
)
4423 struct cache_entry
**e
= find_entry (name
, namespace);
4430 *block
= (*e
)->block
;
4434 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4435 in domain NAMESPACE, save this result in our symbol cache. */
4438 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
4439 const struct block
*block
)
4441 struct ada_symbol_cache
*sym_cache
4442 = ada_get_symbol_cache (current_program_space
);
4445 struct cache_entry
*e
;
4447 /* If the symbol is a local symbol, then do not cache it, as a search
4448 for that symbol depends on the context. To determine whether
4449 the symbol is local or not, we check the block where we found it
4450 against the global and static blocks of its associated symtab. */
4452 && BLOCKVECTOR_BLOCK (BLOCKVECTOR (sym
->symtab
), GLOBAL_BLOCK
) != block
4453 && BLOCKVECTOR_BLOCK (BLOCKVECTOR (sym
->symtab
), STATIC_BLOCK
) != block
)
4456 h
= msymbol_hash (name
) % HASH_SIZE
;
4457 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4459 e
->next
= sym_cache
->root
[h
];
4460 sym_cache
->root
[h
] = e
;
4461 e
->name
= copy
= obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4462 strcpy (copy
, name
);
4464 e
->namespace = namespace;
4470 /* Return nonzero if wild matching should be used when searching for
4471 all symbols matching LOOKUP_NAME.
4473 LOOKUP_NAME is expected to be a symbol name after transformation
4474 for Ada lookups (see ada_name_for_lookup). */
4477 should_use_wild_match (const char *lookup_name
)
4479 return (strstr (lookup_name
, "__") == NULL
);
4482 /* Return the result of a standard (literal, C-like) lookup of NAME in
4483 given DOMAIN, visible from lexical block BLOCK. */
4485 static struct symbol
*
4486 standard_lookup (const char *name
, const struct block
*block
,
4489 /* Initialize it just to avoid a GCC false warning. */
4490 struct symbol
*sym
= NULL
;
4492 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4494 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4495 cache_symbol (name
, domain
, sym
, block_found
);
4500 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4501 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4502 since they contend in overloading in the same way. */
4504 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4508 for (i
= 0; i
< n
; i
+= 1)
4509 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4510 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4511 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4517 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4518 struct types. Otherwise, they may not. */
4521 equiv_types (struct type
*type0
, struct type
*type1
)
4525 if (type0
== NULL
|| type1
== NULL
4526 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4528 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4529 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4530 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4531 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4537 /* True iff SYM0 represents the same entity as SYM1, or one that is
4538 no more defined than that of SYM1. */
4541 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4545 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4546 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4549 switch (SYMBOL_CLASS (sym0
))
4555 struct type
*type0
= SYMBOL_TYPE (sym0
);
4556 struct type
*type1
= SYMBOL_TYPE (sym1
);
4557 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4558 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4559 int len0
= strlen (name0
);
4562 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4563 && (equiv_types (type0
, type1
)
4564 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4565 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4568 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4569 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4575 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4576 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4579 add_defn_to_vec (struct obstack
*obstackp
,
4581 const struct block
*block
)
4584 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4586 /* Do not try to complete stub types, as the debugger is probably
4587 already scanning all symbols matching a certain name at the
4588 time when this function is called. Trying to replace the stub
4589 type by its associated full type will cause us to restart a scan
4590 which may lead to an infinite recursion. Instead, the client
4591 collecting the matching symbols will end up collecting several
4592 matches, with at least one of them complete. It can then filter
4593 out the stub ones if needed. */
4595 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4597 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4599 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4601 prevDefns
[i
].sym
= sym
;
4602 prevDefns
[i
].block
= block
;
4608 struct ada_symbol_info info
;
4612 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4616 /* Number of ada_symbol_info structures currently collected in
4617 current vector in *OBSTACKP. */
4620 num_defns_collected (struct obstack
*obstackp
)
4622 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4625 /* Vector of ada_symbol_info structures currently collected in current
4626 vector in *OBSTACKP. If FINISH, close off the vector and return
4627 its final address. */
4629 static struct ada_symbol_info
*
4630 defns_collected (struct obstack
*obstackp
, int finish
)
4633 return obstack_finish (obstackp
);
4635 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4638 /* Return a bound minimal symbol matching NAME according to Ada
4639 decoding rules. Returns an invalid symbol if there is no such
4640 minimal symbol. Names prefixed with "standard__" are handled
4641 specially: "standard__" is first stripped off, and only static and
4642 global symbols are searched. */
4644 struct bound_minimal_symbol
4645 ada_lookup_simple_minsym (const char *name
)
4647 struct bound_minimal_symbol result
;
4648 struct objfile
*objfile
;
4649 struct minimal_symbol
*msymbol
;
4650 const int wild_match_p
= should_use_wild_match (name
);
4652 memset (&result
, 0, sizeof (result
));
4654 /* Special case: If the user specifies a symbol name inside package
4655 Standard, do a non-wild matching of the symbol name without
4656 the "standard__" prefix. This was primarily introduced in order
4657 to allow the user to specifically access the standard exceptions
4658 using, for instance, Standard.Constraint_Error when Constraint_Error
4659 is ambiguous (due to the user defining its own Constraint_Error
4660 entity inside its program). */
4661 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4662 name
+= sizeof ("standard__") - 1;
4664 ALL_MSYMBOLS (objfile
, msymbol
)
4666 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match_p
)
4667 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4669 result
.minsym
= msymbol
;
4670 result
.objfile
= objfile
;
4678 /* For all subprograms that statically enclose the subprogram of the
4679 selected frame, add symbols matching identifier NAME in DOMAIN
4680 and their blocks to the list of data in OBSTACKP, as for
4681 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4682 with a wildcard prefix. */
4685 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4686 const char *name
, domain_enum
namespace,
4691 /* True if TYPE is definitely an artificial type supplied to a symbol
4692 for which no debugging information was given in the symbol file. */
4695 is_nondebugging_type (struct type
*type
)
4697 const char *name
= ada_type_name (type
);
4699 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4702 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4703 that are deemed "identical" for practical purposes.
4705 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4706 types and that their number of enumerals is identical (in other
4707 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4710 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4714 /* The heuristic we use here is fairly conservative. We consider
4715 that 2 enumerate types are identical if they have the same
4716 number of enumerals and that all enumerals have the same
4717 underlying value and name. */
4719 /* All enums in the type should have an identical underlying value. */
4720 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4721 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4724 /* All enumerals should also have the same name (modulo any numerical
4726 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4728 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4729 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4730 int len_1
= strlen (name_1
);
4731 int len_2
= strlen (name_2
);
4733 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4734 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4736 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4737 TYPE_FIELD_NAME (type2
, i
),
4745 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4746 that are deemed "identical" for practical purposes. Sometimes,
4747 enumerals are not strictly identical, but their types are so similar
4748 that they can be considered identical.
4750 For instance, consider the following code:
4752 type Color is (Black, Red, Green, Blue, White);
4753 type RGB_Color is new Color range Red .. Blue;
4755 Type RGB_Color is a subrange of an implicit type which is a copy
4756 of type Color. If we call that implicit type RGB_ColorB ("B" is
4757 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4758 As a result, when an expression references any of the enumeral
4759 by name (Eg. "print green"), the expression is technically
4760 ambiguous and the user should be asked to disambiguate. But
4761 doing so would only hinder the user, since it wouldn't matter
4762 what choice he makes, the outcome would always be the same.
4763 So, for practical purposes, we consider them as the same. */
4766 symbols_are_identical_enums (struct ada_symbol_info
*syms
, int nsyms
)
4770 /* Before performing a thorough comparison check of each type,
4771 we perform a series of inexpensive checks. We expect that these
4772 checks will quickly fail in the vast majority of cases, and thus
4773 help prevent the unnecessary use of a more expensive comparison.
4774 Said comparison also expects us to make some of these checks
4775 (see ada_identical_enum_types_p). */
4777 /* Quick check: All symbols should have an enum type. */
4778 for (i
= 0; i
< nsyms
; i
++)
4779 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
)
4782 /* Quick check: They should all have the same value. */
4783 for (i
= 1; i
< nsyms
; i
++)
4784 if (SYMBOL_VALUE (syms
[i
].sym
) != SYMBOL_VALUE (syms
[0].sym
))
4787 /* Quick check: They should all have the same number of enumerals. */
4788 for (i
= 1; i
< nsyms
; i
++)
4789 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].sym
))
4790 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].sym
)))
4793 /* All the sanity checks passed, so we might have a set of
4794 identical enumeration types. Perform a more complete
4795 comparison of the type of each symbol. */
4796 for (i
= 1; i
< nsyms
; i
++)
4797 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].sym
),
4798 SYMBOL_TYPE (syms
[0].sym
)))
4804 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4805 duplicate other symbols in the list (The only case I know of where
4806 this happens is when object files containing stabs-in-ecoff are
4807 linked with files containing ordinary ecoff debugging symbols (or no
4808 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4809 Returns the number of items in the modified list. */
4812 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4816 /* We should never be called with less than 2 symbols, as there
4817 cannot be any extra symbol in that case. But it's easy to
4818 handle, since we have nothing to do in that case. */
4827 /* If two symbols have the same name and one of them is a stub type,
4828 the get rid of the stub. */
4830 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4831 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4833 for (j
= 0; j
< nsyms
; j
++)
4836 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4837 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4838 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4839 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4844 /* Two symbols with the same name, same class and same address
4845 should be identical. */
4847 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4848 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4849 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4851 for (j
= 0; j
< nsyms
; j
+= 1)
4854 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4855 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4856 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4857 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4858 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4859 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4866 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4867 syms
[j
- 1] = syms
[j
];
4874 /* If all the remaining symbols are identical enumerals, then
4875 just keep the first one and discard the rest.
4877 Unlike what we did previously, we do not discard any entry
4878 unless they are ALL identical. This is because the symbol
4879 comparison is not a strict comparison, but rather a practical
4880 comparison. If all symbols are considered identical, then
4881 we can just go ahead and use the first one and discard the rest.
4882 But if we cannot reduce the list to a single element, we have
4883 to ask the user to disambiguate anyways. And if we have to
4884 present a multiple-choice menu, it's less confusing if the list
4885 isn't missing some choices that were identical and yet distinct. */
4886 if (symbols_are_identical_enums (syms
, nsyms
))
4892 /* Given a type that corresponds to a renaming entity, use the type name
4893 to extract the scope (package name or function name, fully qualified,
4894 and following the GNAT encoding convention) where this renaming has been
4895 defined. The string returned needs to be deallocated after use. */
4898 xget_renaming_scope (struct type
*renaming_type
)
4900 /* The renaming types adhere to the following convention:
4901 <scope>__<rename>___<XR extension>.
4902 So, to extract the scope, we search for the "___XR" extension,
4903 and then backtrack until we find the first "__". */
4905 const char *name
= type_name_no_tag (renaming_type
);
4906 char *suffix
= strstr (name
, "___XR");
4911 /* Now, backtrack a bit until we find the first "__". Start looking
4912 at suffix - 3, as the <rename> part is at least one character long. */
4914 for (last
= suffix
- 3; last
> name
; last
--)
4915 if (last
[0] == '_' && last
[1] == '_')
4918 /* Make a copy of scope and return it. */
4920 scope_len
= last
- name
;
4921 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4923 strncpy (scope
, name
, scope_len
);
4924 scope
[scope_len
] = '\0';
4929 /* Return nonzero if NAME corresponds to a package name. */
4932 is_package_name (const char *name
)
4934 /* Here, We take advantage of the fact that no symbols are generated
4935 for packages, while symbols are generated for each function.
4936 So the condition for NAME represent a package becomes equivalent
4937 to NAME not existing in our list of symbols. There is only one
4938 small complication with library-level functions (see below). */
4942 /* If it is a function that has not been defined at library level,
4943 then we should be able to look it up in the symbols. */
4944 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4947 /* Library-level function names start with "_ada_". See if function
4948 "_ada_" followed by NAME can be found. */
4950 /* Do a quick check that NAME does not contain "__", since library-level
4951 functions names cannot contain "__" in them. */
4952 if (strstr (name
, "__") != NULL
)
4955 fun_name
= xstrprintf ("_ada_%s", name
);
4957 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4960 /* Return nonzero if SYM corresponds to a renaming entity that is
4961 not visible from FUNCTION_NAME. */
4964 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
4967 struct cleanup
*old_chain
;
4969 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4972 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4973 old_chain
= make_cleanup (xfree
, scope
);
4975 /* If the rename has been defined in a package, then it is visible. */
4976 if (is_package_name (scope
))
4978 do_cleanups (old_chain
);
4982 /* Check that the rename is in the current function scope by checking
4983 that its name starts with SCOPE. */
4985 /* If the function name starts with "_ada_", it means that it is
4986 a library-level function. Strip this prefix before doing the
4987 comparison, as the encoding for the renaming does not contain
4989 if (strncmp (function_name
, "_ada_", 5) == 0)
4993 int is_invisible
= strncmp (function_name
, scope
, strlen (scope
)) != 0;
4995 do_cleanups (old_chain
);
4996 return is_invisible
;
5000 /* Remove entries from SYMS that corresponds to a renaming entity that
5001 is not visible from the function associated with CURRENT_BLOCK or
5002 that is superfluous due to the presence of more specific renaming
5003 information. Places surviving symbols in the initial entries of
5004 SYMS and returns the number of surviving symbols.
5007 First, in cases where an object renaming is implemented as a
5008 reference variable, GNAT may produce both the actual reference
5009 variable and the renaming encoding. In this case, we discard the
5012 Second, GNAT emits a type following a specified encoding for each renaming
5013 entity. Unfortunately, STABS currently does not support the definition
5014 of types that are local to a given lexical block, so all renamings types
5015 are emitted at library level. As a consequence, if an application
5016 contains two renaming entities using the same name, and a user tries to
5017 print the value of one of these entities, the result of the ada symbol
5018 lookup will also contain the wrong renaming type.
5020 This function partially covers for this limitation by attempting to
5021 remove from the SYMS list renaming symbols that should be visible
5022 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5023 method with the current information available. The implementation
5024 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5026 - When the user tries to print a rename in a function while there
5027 is another rename entity defined in a package: Normally, the
5028 rename in the function has precedence over the rename in the
5029 package, so the latter should be removed from the list. This is
5030 currently not the case.
5032 - This function will incorrectly remove valid renames if
5033 the CURRENT_BLOCK corresponds to a function which symbol name
5034 has been changed by an "Export" pragma. As a consequence,
5035 the user will be unable to print such rename entities. */
5038 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
5039 int nsyms
, const struct block
*current_block
)
5041 struct symbol
*current_function
;
5042 const char *current_function_name
;
5044 int is_new_style_renaming
;
5046 /* If there is both a renaming foo___XR... encoded as a variable and
5047 a simple variable foo in the same block, discard the latter.
5048 First, zero out such symbols, then compress. */
5049 is_new_style_renaming
= 0;
5050 for (i
= 0; i
< nsyms
; i
+= 1)
5052 struct symbol
*sym
= syms
[i
].sym
;
5053 const struct block
*block
= syms
[i
].block
;
5057 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5059 name
= SYMBOL_LINKAGE_NAME (sym
);
5060 suffix
= strstr (name
, "___XR");
5064 int name_len
= suffix
- name
;
5067 is_new_style_renaming
= 1;
5068 for (j
= 0; j
< nsyms
; j
+= 1)
5069 if (i
!= j
&& syms
[j
].sym
!= NULL
5070 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
5072 && block
== syms
[j
].block
)
5076 if (is_new_style_renaming
)
5080 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5081 if (syms
[j
].sym
!= NULL
)
5089 /* Extract the function name associated to CURRENT_BLOCK.
5090 Abort if unable to do so. */
5092 if (current_block
== NULL
)
5095 current_function
= block_linkage_function (current_block
);
5096 if (current_function
== NULL
)
5099 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5100 if (current_function_name
== NULL
)
5103 /* Check each of the symbols, and remove it from the list if it is
5104 a type corresponding to a renaming that is out of the scope of
5105 the current block. */
5110 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
5111 == ADA_OBJECT_RENAMING
5112 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
5116 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5117 syms
[j
- 1] = syms
[j
];
5127 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5128 whose name and domain match NAME and DOMAIN respectively.
5129 If no match was found, then extend the search to "enclosing"
5130 routines (in other words, if we're inside a nested function,
5131 search the symbols defined inside the enclosing functions).
5132 If WILD_MATCH_P is nonzero, perform the naming matching in
5133 "wild" mode (see function "wild_match" for more info).
5135 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5138 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
5139 const struct block
*block
, domain_enum domain
,
5142 int block_depth
= 0;
5144 while (block
!= NULL
)
5147 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5150 /* If we found a non-function match, assume that's the one. */
5151 if (is_nonfunction (defns_collected (obstackp
, 0),
5152 num_defns_collected (obstackp
)))
5155 block
= BLOCK_SUPERBLOCK (block
);
5158 /* If no luck so far, try to find NAME as a local symbol in some lexically
5159 enclosing subprogram. */
5160 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5161 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match_p
);
5164 /* An object of this type is used as the user_data argument when
5165 calling the map_matching_symbols method. */
5169 struct objfile
*objfile
;
5170 struct obstack
*obstackp
;
5171 struct symbol
*arg_sym
;
5175 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
5176 to a list of symbols. DATA0 is a pointer to a struct match_data *
5177 containing the obstack that collects the symbol list, the file that SYM
5178 must come from, a flag indicating whether a non-argument symbol has
5179 been found in the current block, and the last argument symbol
5180 passed in SYM within the current block (if any). When SYM is null,
5181 marking the end of a block, the argument symbol is added if no
5182 other has been found. */
5185 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5187 struct match_data
*data
= (struct match_data
*) data0
;
5191 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5192 add_defn_to_vec (data
->obstackp
,
5193 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5195 data
->found_sym
= 0;
5196 data
->arg_sym
= NULL
;
5200 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5202 else if (SYMBOL_IS_ARGUMENT (sym
))
5203 data
->arg_sym
= sym
;
5206 data
->found_sym
= 1;
5207 add_defn_to_vec (data
->obstackp
,
5208 fixup_symbol_section (sym
, data
->objfile
),
5215 /* Implements compare_names, but only applying the comparision using
5216 the given CASING. */
5219 compare_names_with_case (const char *string1
, const char *string2
,
5220 enum case_sensitivity casing
)
5222 while (*string1
!= '\0' && *string2
!= '\0')
5226 if (isspace (*string1
) || isspace (*string2
))
5227 return strcmp_iw_ordered (string1
, string2
);
5229 if (casing
== case_sensitive_off
)
5231 c1
= tolower (*string1
);
5232 c2
= tolower (*string2
);
5249 return strcmp_iw_ordered (string1
, string2
);
5251 if (*string2
== '\0')
5253 if (is_name_suffix (string1
))
5260 if (*string2
== '(')
5261 return strcmp_iw_ordered (string1
, string2
);
5264 if (casing
== case_sensitive_off
)
5265 return tolower (*string1
) - tolower (*string2
);
5267 return *string1
- *string2
;
5272 /* Compare STRING1 to STRING2, with results as for strcmp.
5273 Compatible with strcmp_iw_ordered in that...
5275 strcmp_iw_ordered (STRING1, STRING2) <= 0
5279 compare_names (STRING1, STRING2) <= 0
5281 (they may differ as to what symbols compare equal). */
5284 compare_names (const char *string1
, const char *string2
)
5288 /* Similar to what strcmp_iw_ordered does, we need to perform
5289 a case-insensitive comparison first, and only resort to
5290 a second, case-sensitive, comparison if the first one was
5291 not sufficient to differentiate the two strings. */
5293 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5295 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5300 /* Add to OBSTACKP all non-local symbols whose name and domain match
5301 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5302 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5305 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5306 domain_enum domain
, int global
,
5309 struct objfile
*objfile
;
5310 struct match_data data
;
5312 memset (&data
, 0, sizeof data
);
5313 data
.obstackp
= obstackp
;
5315 ALL_OBJFILES (objfile
)
5317 data
.objfile
= objfile
;
5320 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5321 aux_add_nonlocal_symbols
, &data
,
5324 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5325 aux_add_nonlocal_symbols
, &data
,
5326 full_match
, compare_names
);
5329 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5331 ALL_OBJFILES (objfile
)
5333 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
5334 strcpy (name1
, "_ada_");
5335 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5336 data
.objfile
= objfile
;
5337 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
, domain
,
5339 aux_add_nonlocal_symbols
,
5341 full_match
, compare_names
);
5346 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and, if full_search is
5347 non-zero, enclosing scope and in global scopes, returning the number of
5349 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5350 indicating the symbols found and the blocks and symbol tables (if
5351 any) in which they were found. This vector is transient---good only to
5352 the next call of ada_lookup_symbol_list.
5354 When full_search is non-zero, any non-function/non-enumeral
5355 symbol match within the nest of blocks whose innermost member is BLOCK0,
5356 is the one match returned (no other matches in that or
5357 enclosing blocks is returned). If there are any matches in or
5358 surrounding BLOCK0, then these alone are returned.
5360 Names prefixed with "standard__" are handled specially: "standard__"
5361 is first stripped off, and only static and global symbols are searched. */
5364 ada_lookup_symbol_list_worker (const char *name0
, const struct block
*block0
,
5365 domain_enum
namespace,
5366 struct ada_symbol_info
**results
,
5370 const struct block
*block
;
5372 const int wild_match_p
= should_use_wild_match (name0
);
5376 obstack_free (&symbol_list_obstack
, NULL
);
5377 obstack_init (&symbol_list_obstack
);
5381 /* Search specified block and its superiors. */
5386 /* Special case: If the user specifies a symbol name inside package
5387 Standard, do a non-wild matching of the symbol name without
5388 the "standard__" prefix. This was primarily introduced in order
5389 to allow the user to specifically access the standard exceptions
5390 using, for instance, Standard.Constraint_Error when Constraint_Error
5391 is ambiguous (due to the user defining its own Constraint_Error
5392 entity inside its program). */
5393 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
5396 name
= name0
+ sizeof ("standard__") - 1;
5399 /* Check the non-global symbols. If we have ANY match, then we're done. */
5405 ada_add_local_symbols (&symbol_list_obstack
, name
, block
,
5406 namespace, wild_match_p
);
5410 /* In the !full_search case we're are being called by
5411 ada_iterate_over_symbols, and we don't want to search
5413 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
5414 namespace, NULL
, wild_match_p
);
5416 if (num_defns_collected (&symbol_list_obstack
) > 0 || !full_search
)
5420 /* No non-global symbols found. Check our cache to see if we have
5421 already performed this search before. If we have, then return
5425 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
5428 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5432 /* Search symbols from all global blocks. */
5434 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 1,
5437 /* Now add symbols from all per-file blocks if we've gotten no hits
5438 (not strictly correct, but perhaps better than an error). */
5440 if (num_defns_collected (&symbol_list_obstack
) == 0)
5441 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 0,
5445 ndefns
= num_defns_collected (&symbol_list_obstack
);
5446 *results
= defns_collected (&symbol_list_obstack
, 1);
5448 ndefns
= remove_extra_symbols (*results
, ndefns
);
5450 if (ndefns
== 0 && full_search
)
5451 cache_symbol (name0
, namespace, NULL
, NULL
);
5453 if (ndefns
== 1 && full_search
&& cacheIfUnique
)
5454 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
5456 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5461 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5462 in global scopes, returning the number of matches, and setting *RESULTS
5463 to a vector of (SYM,BLOCK) tuples.
5464 See ada_lookup_symbol_list_worker for further details. */
5467 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5468 domain_enum domain
, struct ada_symbol_info
**results
)
5470 return ada_lookup_symbol_list_worker (name0
, block0
, domain
, results
, 1);
5473 /* Implementation of the la_iterate_over_symbols method. */
5476 ada_iterate_over_symbols (const struct block
*block
,
5477 const char *name
, domain_enum domain
,
5478 symbol_found_callback_ftype
*callback
,
5482 struct ada_symbol_info
*results
;
5484 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5485 for (i
= 0; i
< ndefs
; ++i
)
5487 if (! (*callback
) (results
[i
].sym
, data
))
5492 /* If NAME is the name of an entity, return a string that should
5493 be used to look that entity up in Ada units. This string should
5494 be deallocated after use using xfree.
5496 NAME can have any form that the "break" or "print" commands might
5497 recognize. In other words, it does not have to be the "natural"
5498 name, or the "encoded" name. */
5501 ada_name_for_lookup (const char *name
)
5504 int nlen
= strlen (name
);
5506 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5508 canon
= xmalloc (nlen
- 1);
5509 memcpy (canon
, name
+ 1, nlen
- 2);
5510 canon
[nlen
- 2] = '\0';
5513 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5517 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5518 to 1, but choosing the first symbol found if there are multiple
5521 The result is stored in *INFO, which must be non-NULL.
5522 If no match is found, INFO->SYM is set to NULL. */
5525 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5526 domain_enum
namespace,
5527 struct ada_symbol_info
*info
)
5529 struct ada_symbol_info
*candidates
;
5532 gdb_assert (info
!= NULL
);
5533 memset (info
, 0, sizeof (struct ada_symbol_info
));
5535 n_candidates
= ada_lookup_symbol_list (name
, block
, namespace, &candidates
);
5536 if (n_candidates
== 0)
5539 *info
= candidates
[0];
5540 info
->sym
= fixup_symbol_section (info
->sym
, NULL
);
5543 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5544 scope and in global scopes, or NULL if none. NAME is folded and
5545 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5546 choosing the first symbol if there are multiple choices.
5547 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5550 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5551 domain_enum
namespace, int *is_a_field_of_this
)
5553 struct ada_symbol_info info
;
5555 if (is_a_field_of_this
!= NULL
)
5556 *is_a_field_of_this
= 0;
5558 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5559 block0
, namespace, &info
);
5563 static struct symbol
*
5564 ada_lookup_symbol_nonlocal (const char *name
,
5565 const struct block
*block
,
5566 const domain_enum domain
)
5568 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5572 /* True iff STR is a possible encoded suffix of a normal Ada name
5573 that is to be ignored for matching purposes. Suffixes of parallel
5574 names (e.g., XVE) are not included here. Currently, the possible suffixes
5575 are given by any of the regular expressions:
5577 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5578 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5579 TKB [subprogram suffix for task bodies]
5580 _E[0-9]+[bs]$ [protected object entry suffixes]
5581 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5583 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5584 match is performed. This sequence is used to differentiate homonyms,
5585 is an optional part of a valid name suffix. */
5588 is_name_suffix (const char *str
)
5591 const char *matching
;
5592 const int len
= strlen (str
);
5594 /* Skip optional leading __[0-9]+. */
5596 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5599 while (isdigit (str
[0]))
5605 if (str
[0] == '.' || str
[0] == '$')
5608 while (isdigit (matching
[0]))
5610 if (matching
[0] == '\0')
5616 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5619 while (isdigit (matching
[0]))
5621 if (matching
[0] == '\0')
5625 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5627 if (strcmp (str
, "TKB") == 0)
5631 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5632 with a N at the end. Unfortunately, the compiler uses the same
5633 convention for other internal types it creates. So treating
5634 all entity names that end with an "N" as a name suffix causes
5635 some regressions. For instance, consider the case of an enumerated
5636 type. To support the 'Image attribute, it creates an array whose
5638 Having a single character like this as a suffix carrying some
5639 information is a bit risky. Perhaps we should change the encoding
5640 to be something like "_N" instead. In the meantime, do not do
5641 the following check. */
5642 /* Protected Object Subprograms */
5643 if (len
== 1 && str
[0] == 'N')
5648 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5651 while (isdigit (matching
[0]))
5653 if ((matching
[0] == 'b' || matching
[0] == 's')
5654 && matching
[1] == '\0')
5658 /* ??? We should not modify STR directly, as we are doing below. This
5659 is fine in this case, but may become problematic later if we find
5660 that this alternative did not work, and want to try matching
5661 another one from the begining of STR. Since we modified it, we
5662 won't be able to find the begining of the string anymore! */
5666 while (str
[0] != '_' && str
[0] != '\0')
5668 if (str
[0] != 'n' && str
[0] != 'b')
5674 if (str
[0] == '\000')
5679 if (str
[1] != '_' || str
[2] == '\000')
5683 if (strcmp (str
+ 3, "JM") == 0)
5685 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5686 the LJM suffix in favor of the JM one. But we will
5687 still accept LJM as a valid suffix for a reasonable
5688 amount of time, just to allow ourselves to debug programs
5689 compiled using an older version of GNAT. */
5690 if (strcmp (str
+ 3, "LJM") == 0)
5694 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5695 || str
[4] == 'U' || str
[4] == 'P')
5697 if (str
[4] == 'R' && str
[5] != 'T')
5701 if (!isdigit (str
[2]))
5703 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5704 if (!isdigit (str
[k
]) && str
[k
] != '_')
5708 if (str
[0] == '$' && isdigit (str
[1]))
5710 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5711 if (!isdigit (str
[k
]) && str
[k
] != '_')
5718 /* Return non-zero if the string starting at NAME and ending before
5719 NAME_END contains no capital letters. */
5722 is_valid_name_for_wild_match (const char *name0
)
5724 const char *decoded_name
= ada_decode (name0
);
5727 /* If the decoded name starts with an angle bracket, it means that
5728 NAME0 does not follow the GNAT encoding format. It should then
5729 not be allowed as a possible wild match. */
5730 if (decoded_name
[0] == '<')
5733 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5734 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5740 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5741 that could start a simple name. Assumes that *NAMEP points into
5742 the string beginning at NAME0. */
5745 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5747 const char *name
= *namep
;
5757 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5760 if (name
== name0
+ 5 && strncmp (name0
, "_ada", 4) == 0)
5765 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5766 || name
[2] == target0
))
5774 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5784 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5785 informational suffixes of NAME (i.e., for which is_name_suffix is
5786 true). Assumes that PATN is a lower-cased Ada simple name. */
5789 wild_match (const char *name
, const char *patn
)
5792 const char *name0
= name
;
5796 const char *match
= name
;
5800 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5803 if (*p
== '\0' && is_name_suffix (name
))
5804 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5806 if (name
[-1] == '_')
5809 if (!advance_wild_match (&name
, name0
, *patn
))
5814 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5815 informational suffix. */
5818 full_match (const char *sym_name
, const char *search_name
)
5820 return !match_name (sym_name
, search_name
, 0);
5824 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5825 vector *defn_symbols, updating the list of symbols in OBSTACKP
5826 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5827 OBJFILE is the section containing BLOCK. */
5830 ada_add_block_symbols (struct obstack
*obstackp
,
5831 const struct block
*block
, const char *name
,
5832 domain_enum domain
, struct objfile
*objfile
,
5835 struct block_iterator iter
;
5836 int name_len
= strlen (name
);
5837 /* A matching argument symbol, if any. */
5838 struct symbol
*arg_sym
;
5839 /* Set true when we find a matching non-argument symbol. */
5847 for (sym
= block_iter_match_first (block
, name
, wild_match
, &iter
);
5848 sym
!= NULL
; sym
= block_iter_match_next (name
, wild_match
, &iter
))
5850 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5851 SYMBOL_DOMAIN (sym
), domain
)
5852 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5854 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5856 else if (SYMBOL_IS_ARGUMENT (sym
))
5861 add_defn_to_vec (obstackp
,
5862 fixup_symbol_section (sym
, objfile
),
5870 for (sym
= block_iter_match_first (block
, name
, full_match
, &iter
);
5871 sym
!= NULL
; sym
= block_iter_match_next (name
, full_match
, &iter
))
5873 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5874 SYMBOL_DOMAIN (sym
), domain
))
5876 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5878 if (SYMBOL_IS_ARGUMENT (sym
))
5883 add_defn_to_vec (obstackp
,
5884 fixup_symbol_section (sym
, objfile
),
5892 if (!found_sym
&& arg_sym
!= NULL
)
5894 add_defn_to_vec (obstackp
,
5895 fixup_symbol_section (arg_sym
, objfile
),
5904 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5906 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5907 SYMBOL_DOMAIN (sym
), domain
))
5911 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5914 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5916 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5921 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5923 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5925 if (SYMBOL_IS_ARGUMENT (sym
))
5930 add_defn_to_vec (obstackp
,
5931 fixup_symbol_section (sym
, objfile
),
5939 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5940 They aren't parameters, right? */
5941 if (!found_sym
&& arg_sym
!= NULL
)
5943 add_defn_to_vec (obstackp
,
5944 fixup_symbol_section (arg_sym
, objfile
),
5951 /* Symbol Completion */
5953 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5954 name in a form that's appropriate for the completion. The result
5955 does not need to be deallocated, but is only good until the next call.
5957 TEXT_LEN is equal to the length of TEXT.
5958 Perform a wild match if WILD_MATCH_P is set.
5959 ENCODED_P should be set if TEXT represents the start of a symbol name
5960 in its encoded form. */
5963 symbol_completion_match (const char *sym_name
,
5964 const char *text
, int text_len
,
5965 int wild_match_p
, int encoded_p
)
5967 const int verbatim_match
= (text
[0] == '<');
5972 /* Strip the leading angle bracket. */
5977 /* First, test against the fully qualified name of the symbol. */
5979 if (strncmp (sym_name
, text
, text_len
) == 0)
5982 if (match
&& !encoded_p
)
5984 /* One needed check before declaring a positive match is to verify
5985 that iff we are doing a verbatim match, the decoded version
5986 of the symbol name starts with '<'. Otherwise, this symbol name
5987 is not a suitable completion. */
5988 const char *sym_name_copy
= sym_name
;
5989 int has_angle_bracket
;
5991 sym_name
= ada_decode (sym_name
);
5992 has_angle_bracket
= (sym_name
[0] == '<');
5993 match
= (has_angle_bracket
== verbatim_match
);
5994 sym_name
= sym_name_copy
;
5997 if (match
&& !verbatim_match
)
5999 /* When doing non-verbatim match, another check that needs to
6000 be done is to verify that the potentially matching symbol name
6001 does not include capital letters, because the ada-mode would
6002 not be able to understand these symbol names without the
6003 angle bracket notation. */
6006 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6011 /* Second: Try wild matching... */
6013 if (!match
&& wild_match_p
)
6015 /* Since we are doing wild matching, this means that TEXT
6016 may represent an unqualified symbol name. We therefore must
6017 also compare TEXT against the unqualified name of the symbol. */
6018 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6020 if (strncmp (sym_name
, text
, text_len
) == 0)
6024 /* Finally: If we found a mach, prepare the result to return. */
6030 sym_name
= add_angle_brackets (sym_name
);
6033 sym_name
= ada_decode (sym_name
);
6038 /* A companion function to ada_make_symbol_completion_list().
6039 Check if SYM_NAME represents a symbol which name would be suitable
6040 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
6041 it is appended at the end of the given string vector SV.
6043 ORIG_TEXT is the string original string from the user command
6044 that needs to be completed. WORD is the entire command on which
6045 completion should be performed. These two parameters are used to
6046 determine which part of the symbol name should be added to the
6048 if WILD_MATCH_P is set, then wild matching is performed.
6049 ENCODED_P should be set if TEXT represents a symbol name in its
6050 encoded formed (in which case the completion should also be
6054 symbol_completion_add (VEC(char_ptr
) **sv
,
6055 const char *sym_name
,
6056 const char *text
, int text_len
,
6057 const char *orig_text
, const char *word
,
6058 int wild_match_p
, int encoded_p
)
6060 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
6061 wild_match_p
, encoded_p
);
6067 /* We found a match, so add the appropriate completion to the given
6070 if (word
== orig_text
)
6072 completion
= xmalloc (strlen (match
) + 5);
6073 strcpy (completion
, match
);
6075 else if (word
> orig_text
)
6077 /* Return some portion of sym_name. */
6078 completion
= xmalloc (strlen (match
) + 5);
6079 strcpy (completion
, match
+ (word
- orig_text
));
6083 /* Return some of ORIG_TEXT plus sym_name. */
6084 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
6085 strncpy (completion
, word
, orig_text
- word
);
6086 completion
[orig_text
- word
] = '\0';
6087 strcat (completion
, match
);
6090 VEC_safe_push (char_ptr
, *sv
, completion
);
6093 /* An object of this type is passed as the user_data argument to the
6094 expand_symtabs_matching method. */
6095 struct add_partial_datum
6097 VEC(char_ptr
) **completions
;
6106 /* A callback for expand_symtabs_matching. */
6109 ada_complete_symbol_matcher (const char *name
, void *user_data
)
6111 struct add_partial_datum
*data
= user_data
;
6113 return symbol_completion_match (name
, data
->text
, data
->text_len
,
6114 data
->wild_match
, data
->encoded
) != NULL
;
6117 /* Return a list of possible symbol names completing TEXT0. WORD is
6118 the entire command on which completion is made. */
6120 static VEC (char_ptr
) *
6121 ada_make_symbol_completion_list (const char *text0
, const char *word
,
6122 enum type_code code
)
6128 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
6131 struct minimal_symbol
*msymbol
;
6132 struct objfile
*objfile
;
6133 const struct block
*b
, *surrounding_static_block
= 0;
6135 struct block_iterator iter
;
6136 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6138 gdb_assert (code
== TYPE_CODE_UNDEF
);
6140 if (text0
[0] == '<')
6142 text
= xstrdup (text0
);
6143 make_cleanup (xfree
, text
);
6144 text_len
= strlen (text
);
6150 text
= xstrdup (ada_encode (text0
));
6151 make_cleanup (xfree
, text
);
6152 text_len
= strlen (text
);
6153 for (i
= 0; i
< text_len
; i
++)
6154 text
[i
] = tolower (text
[i
]);
6156 encoded_p
= (strstr (text0
, "__") != NULL
);
6157 /* If the name contains a ".", then the user is entering a fully
6158 qualified entity name, and the match must not be done in wild
6159 mode. Similarly, if the user wants to complete what looks like
6160 an encoded name, the match must not be done in wild mode. */
6161 wild_match_p
= (strchr (text0
, '.') == NULL
&& !encoded_p
);
6164 /* First, look at the partial symtab symbols. */
6166 struct add_partial_datum data
;
6168 data
.completions
= &completions
;
6170 data
.text_len
= text_len
;
6173 data
.wild_match
= wild_match_p
;
6174 data
.encoded
= encoded_p
;
6175 expand_symtabs_matching (NULL
, ada_complete_symbol_matcher
, ALL_DOMAIN
,
6179 /* At this point scan through the misc symbol vectors and add each
6180 symbol you find to the list. Eventually we want to ignore
6181 anything that isn't a text symbol (everything else will be
6182 handled by the psymtab code above). */
6184 ALL_MSYMBOLS (objfile
, msymbol
)
6187 symbol_completion_add (&completions
, MSYMBOL_LINKAGE_NAME (msymbol
),
6188 text
, text_len
, text0
, word
, wild_match_p
,
6192 /* Search upwards from currently selected frame (so that we can
6193 complete on local vars. */
6195 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6197 if (!BLOCK_SUPERBLOCK (b
))
6198 surrounding_static_block
= b
; /* For elmin of dups */
6200 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6202 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6203 text
, text_len
, text0
, word
,
6204 wild_match_p
, encoded_p
);
6208 /* Go through the symtabs and check the externs and statics for
6209 symbols which match. */
6211 ALL_SYMTABS (objfile
, s
)
6214 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6215 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6217 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6218 text
, text_len
, text0
, word
,
6219 wild_match_p
, encoded_p
);
6223 ALL_SYMTABS (objfile
, s
)
6226 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
6227 /* Don't do this block twice. */
6228 if (b
== surrounding_static_block
)
6230 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6232 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6233 text
, text_len
, text0
, word
,
6234 wild_match_p
, encoded_p
);
6238 do_cleanups (old_chain
);
6244 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6245 for tagged types. */
6248 ada_is_dispatch_table_ptr_type (struct type
*type
)
6252 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6255 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6259 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6262 /* Return non-zero if TYPE is an interface tag. */
6265 ada_is_interface_tag (struct type
*type
)
6267 const char *name
= TYPE_NAME (type
);
6272 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6275 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6276 to be invisible to users. */
6279 ada_is_ignored_field (struct type
*type
, int field_num
)
6281 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6284 /* Check the name of that field. */
6286 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6288 /* Anonymous field names should not be printed.
6289 brobecker/2007-02-20: I don't think this can actually happen
6290 but we don't want to print the value of annonymous fields anyway. */
6294 /* Normally, fields whose name start with an underscore ("_")
6295 are fields that have been internally generated by the compiler,
6296 and thus should not be printed. The "_parent" field is special,
6297 however: This is a field internally generated by the compiler
6298 for tagged types, and it contains the components inherited from
6299 the parent type. This field should not be printed as is, but
6300 should not be ignored either. */
6301 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
6305 /* If this is the dispatch table of a tagged type or an interface tag,
6307 if (ada_is_tagged_type (type
, 1)
6308 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6309 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6312 /* Not a special field, so it should not be ignored. */
6316 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6317 pointer or reference type whose ultimate target has a tag field. */
6320 ada_is_tagged_type (struct type
*type
, int refok
)
6322 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
6325 /* True iff TYPE represents the type of X'Tag */
6328 ada_is_tag_type (struct type
*type
)
6330 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6334 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6336 return (name
!= NULL
6337 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6341 /* The type of the tag on VAL. */
6344 ada_tag_type (struct value
*val
)
6346 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6349 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6350 retired at Ada 05). */
6353 is_ada95_tag (struct value
*tag
)
6355 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6358 /* The value of the tag on VAL. */
6361 ada_value_tag (struct value
*val
)
6363 return ada_value_struct_elt (val
, "_tag", 0);
6366 /* The value of the tag on the object of type TYPE whose contents are
6367 saved at VALADDR, if it is non-null, or is at memory address
6370 static struct value
*
6371 value_tag_from_contents_and_address (struct type
*type
,
6372 const gdb_byte
*valaddr
,
6375 int tag_byte_offset
;
6376 struct type
*tag_type
;
6378 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6381 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6383 : valaddr
+ tag_byte_offset
);
6384 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6386 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6391 static struct type
*
6392 type_from_tag (struct value
*tag
)
6394 const char *type_name
= ada_tag_name (tag
);
6396 if (type_name
!= NULL
)
6397 return ada_find_any_type (ada_encode (type_name
));
6401 /* Given a value OBJ of a tagged type, return a value of this
6402 type at the base address of the object. The base address, as
6403 defined in Ada.Tags, it is the address of the primary tag of
6404 the object, and therefore where the field values of its full
6405 view can be fetched. */
6408 ada_tag_value_at_base_address (struct value
*obj
)
6410 volatile struct gdb_exception e
;
6412 LONGEST offset_to_top
= 0;
6413 struct type
*ptr_type
, *obj_type
;
6415 CORE_ADDR base_address
;
6417 obj_type
= value_type (obj
);
6419 /* It is the responsability of the caller to deref pointers. */
6421 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6422 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6425 tag
= ada_value_tag (obj
);
6429 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6431 if (is_ada95_tag (tag
))
6434 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6435 ptr_type
= lookup_pointer_type (ptr_type
);
6436 val
= value_cast (ptr_type
, tag
);
6440 /* It is perfectly possible that an exception be raised while
6441 trying to determine the base address, just like for the tag;
6442 see ada_tag_name for more details. We do not print the error
6443 message for the same reason. */
6445 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6447 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6453 /* If offset is null, nothing to do. */
6455 if (offset_to_top
== 0)
6458 /* -1 is a special case in Ada.Tags; however, what should be done
6459 is not quite clear from the documentation. So do nothing for
6462 if (offset_to_top
== -1)
6465 base_address
= value_address (obj
) - offset_to_top
;
6466 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6468 /* Make sure that we have a proper tag at the new address.
6469 Otherwise, offset_to_top is bogus (which can happen when
6470 the object is not initialized yet). */
6475 obj_type
= type_from_tag (tag
);
6480 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6483 /* Return the "ada__tags__type_specific_data" type. */
6485 static struct type
*
6486 ada_get_tsd_type (struct inferior
*inf
)
6488 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6490 if (data
->tsd_type
== 0)
6491 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6492 return data
->tsd_type
;
6495 /* Return the TSD (type-specific data) associated to the given TAG.
6496 TAG is assumed to be the tag of a tagged-type entity.
6498 May return NULL if we are unable to get the TSD. */
6500 static struct value
*
6501 ada_get_tsd_from_tag (struct value
*tag
)
6506 /* First option: The TSD is simply stored as a field of our TAG.
6507 Only older versions of GNAT would use this format, but we have
6508 to test it first, because there are no visible markers for
6509 the current approach except the absence of that field. */
6511 val
= ada_value_struct_elt (tag
, "tsd", 1);
6515 /* Try the second representation for the dispatch table (in which
6516 there is no explicit 'tsd' field in the referent of the tag pointer,
6517 and instead the tsd pointer is stored just before the dispatch
6520 type
= ada_get_tsd_type (current_inferior());
6523 type
= lookup_pointer_type (lookup_pointer_type (type
));
6524 val
= value_cast (type
, tag
);
6527 return value_ind (value_ptradd (val
, -1));
6530 /* Given the TSD of a tag (type-specific data), return a string
6531 containing the name of the associated type.
6533 The returned value is good until the next call. May return NULL
6534 if we are unable to determine the tag name. */
6537 ada_tag_name_from_tsd (struct value
*tsd
)
6539 static char name
[1024];
6543 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6546 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6547 for (p
= name
; *p
!= '\0'; p
+= 1)
6553 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6556 Return NULL if the TAG is not an Ada tag, or if we were unable to
6557 determine the name of that tag. The result is good until the next
6561 ada_tag_name (struct value
*tag
)
6563 volatile struct gdb_exception e
;
6566 if (!ada_is_tag_type (value_type (tag
)))
6569 /* It is perfectly possible that an exception be raised while trying
6570 to determine the TAG's name, even under normal circumstances:
6571 The associated variable may be uninitialized or corrupted, for
6572 instance. We do not let any exception propagate past this point.
6573 instead we return NULL.
6575 We also do not print the error message either (which often is very
6576 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6577 the caller print a more meaningful message if necessary. */
6578 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6580 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6583 name
= ada_tag_name_from_tsd (tsd
);
6589 /* The parent type of TYPE, or NULL if none. */
6592 ada_parent_type (struct type
*type
)
6596 type
= ada_check_typedef (type
);
6598 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6601 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6602 if (ada_is_parent_field (type
, i
))
6604 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6606 /* If the _parent field is a pointer, then dereference it. */
6607 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6608 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6609 /* If there is a parallel XVS type, get the actual base type. */
6610 parent_type
= ada_get_base_type (parent_type
);
6612 return ada_check_typedef (parent_type
);
6618 /* True iff field number FIELD_NUM of structure type TYPE contains the
6619 parent-type (inherited) fields of a derived type. Assumes TYPE is
6620 a structure type with at least FIELD_NUM+1 fields. */
6623 ada_is_parent_field (struct type
*type
, int field_num
)
6625 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6627 return (name
!= NULL
6628 && (strncmp (name
, "PARENT", 6) == 0
6629 || strncmp (name
, "_parent", 7) == 0));
6632 /* True iff field number FIELD_NUM of structure type TYPE is a
6633 transparent wrapper field (which should be silently traversed when doing
6634 field selection and flattened when printing). Assumes TYPE is a
6635 structure type with at least FIELD_NUM+1 fields. Such fields are always
6639 ada_is_wrapper_field (struct type
*type
, int field_num
)
6641 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6643 return (name
!= NULL
6644 && (strncmp (name
, "PARENT", 6) == 0
6645 || strcmp (name
, "REP") == 0
6646 || strncmp (name
, "_parent", 7) == 0
6647 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6650 /* True iff field number FIELD_NUM of structure or union type TYPE
6651 is a variant wrapper. Assumes TYPE is a structure type with at least
6652 FIELD_NUM+1 fields. */
6655 ada_is_variant_part (struct type
*type
, int field_num
)
6657 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6659 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6660 || (is_dynamic_field (type
, field_num
)
6661 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6662 == TYPE_CODE_UNION
)));
6665 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6666 whose discriminants are contained in the record type OUTER_TYPE,
6667 returns the type of the controlling discriminant for the variant.
6668 May return NULL if the type could not be found. */
6671 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6673 char *name
= ada_variant_discrim_name (var_type
);
6675 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6678 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6679 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6680 represents a 'when others' clause; otherwise 0. */
6683 ada_is_others_clause (struct type
*type
, int field_num
)
6685 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6687 return (name
!= NULL
&& name
[0] == 'O');
6690 /* Assuming that TYPE0 is the type of the variant part of a record,
6691 returns the name of the discriminant controlling the variant.
6692 The value is valid until the next call to ada_variant_discrim_name. */
6695 ada_variant_discrim_name (struct type
*type0
)
6697 static char *result
= NULL
;
6698 static size_t result_len
= 0;
6701 const char *discrim_end
;
6702 const char *discrim_start
;
6704 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6705 type
= TYPE_TARGET_TYPE (type0
);
6709 name
= ada_type_name (type
);
6711 if (name
== NULL
|| name
[0] == '\000')
6714 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6717 if (strncmp (discrim_end
, "___XVN", 6) == 0)
6720 if (discrim_end
== name
)
6723 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6726 if (discrim_start
== name
+ 1)
6728 if ((discrim_start
> name
+ 3
6729 && strncmp (discrim_start
- 3, "___", 3) == 0)
6730 || discrim_start
[-1] == '.')
6734 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6735 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6736 result
[discrim_end
- discrim_start
] = '\0';
6740 /* Scan STR for a subtype-encoded number, beginning at position K.
6741 Put the position of the character just past the number scanned in
6742 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6743 Return 1 if there was a valid number at the given position, and 0
6744 otherwise. A "subtype-encoded" number consists of the absolute value
6745 in decimal, followed by the letter 'm' to indicate a negative number.
6746 Assumes 0m does not occur. */
6749 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6753 if (!isdigit (str
[k
]))
6756 /* Do it the hard way so as not to make any assumption about
6757 the relationship of unsigned long (%lu scan format code) and
6760 while (isdigit (str
[k
]))
6762 RU
= RU
* 10 + (str
[k
] - '0');
6769 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6775 /* NOTE on the above: Technically, C does not say what the results of
6776 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6777 number representable as a LONGEST (although either would probably work
6778 in most implementations). When RU>0, the locution in the then branch
6779 above is always equivalent to the negative of RU. */
6786 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6787 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6788 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6791 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6793 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6807 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6817 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6818 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6820 if (val
>= L
&& val
<= U
)
6832 /* FIXME: Lots of redundancy below. Try to consolidate. */
6834 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6835 ARG_TYPE, extract and return the value of one of its (non-static)
6836 fields. FIELDNO says which field. Differs from value_primitive_field
6837 only in that it can handle packed values of arbitrary type. */
6839 static struct value
*
6840 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6841 struct type
*arg_type
)
6845 arg_type
= ada_check_typedef (arg_type
);
6846 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6848 /* Handle packed fields. */
6850 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6852 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6853 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6855 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6856 offset
+ bit_pos
/ 8,
6857 bit_pos
% 8, bit_size
, type
);
6860 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6863 /* Find field with name NAME in object of type TYPE. If found,
6864 set the following for each argument that is non-null:
6865 - *FIELD_TYPE_P to the field's type;
6866 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6867 an object of that type;
6868 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6869 - *BIT_SIZE_P to its size in bits if the field is packed, and
6871 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6872 fields up to but not including the desired field, or by the total
6873 number of fields if not found. A NULL value of NAME never
6874 matches; the function just counts visible fields in this case.
6876 Returns 1 if found, 0 otherwise. */
6879 find_struct_field (const char *name
, struct type
*type
, int offset
,
6880 struct type
**field_type_p
,
6881 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6886 type
= ada_check_typedef (type
);
6888 if (field_type_p
!= NULL
)
6889 *field_type_p
= NULL
;
6890 if (byte_offset_p
!= NULL
)
6892 if (bit_offset_p
!= NULL
)
6894 if (bit_size_p
!= NULL
)
6897 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6899 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6900 int fld_offset
= offset
+ bit_pos
/ 8;
6901 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6903 if (t_field_name
== NULL
)
6906 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6908 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6910 if (field_type_p
!= NULL
)
6911 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6912 if (byte_offset_p
!= NULL
)
6913 *byte_offset_p
= fld_offset
;
6914 if (bit_offset_p
!= NULL
)
6915 *bit_offset_p
= bit_pos
% 8;
6916 if (bit_size_p
!= NULL
)
6917 *bit_size_p
= bit_size
;
6920 else if (ada_is_wrapper_field (type
, i
))
6922 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6923 field_type_p
, byte_offset_p
, bit_offset_p
,
6924 bit_size_p
, index_p
))
6927 else if (ada_is_variant_part (type
, i
))
6929 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6932 struct type
*field_type
6933 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6935 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6937 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6939 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6940 field_type_p
, byte_offset_p
,
6941 bit_offset_p
, bit_size_p
, index_p
))
6945 else if (index_p
!= NULL
)
6951 /* Number of user-visible fields in record type TYPE. */
6954 num_visible_fields (struct type
*type
)
6959 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6963 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6964 and search in it assuming it has (class) type TYPE.
6965 If found, return value, else return NULL.
6967 Searches recursively through wrapper fields (e.g., '_parent'). */
6969 static struct value
*
6970 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6975 type
= ada_check_typedef (type
);
6976 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6978 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6980 if (t_field_name
== NULL
)
6983 else if (field_name_match (t_field_name
, name
))
6984 return ada_value_primitive_field (arg
, offset
, i
, type
);
6986 else if (ada_is_wrapper_field (type
, i
))
6988 struct value
*v
= /* Do not let indent join lines here. */
6989 ada_search_struct_field (name
, arg
,
6990 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6991 TYPE_FIELD_TYPE (type
, i
));
6997 else if (ada_is_variant_part (type
, i
))
6999 /* PNH: Do we ever get here? See find_struct_field. */
7001 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7003 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7005 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7007 struct value
*v
= ada_search_struct_field
/* Force line
7010 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7011 TYPE_FIELD_TYPE (field_type
, j
));
7021 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7022 int, struct type
*);
7025 /* Return field #INDEX in ARG, where the index is that returned by
7026 * find_struct_field through its INDEX_P argument. Adjust the address
7027 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7028 * If found, return value, else return NULL. */
7030 static struct value
*
7031 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7034 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7038 /* Auxiliary function for ada_index_struct_field. Like
7039 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7042 static struct value
*
7043 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7047 type
= ada_check_typedef (type
);
7049 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7051 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7053 else if (ada_is_wrapper_field (type
, i
))
7055 struct value
*v
= /* Do not let indent join lines here. */
7056 ada_index_struct_field_1 (index_p
, arg
,
7057 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7058 TYPE_FIELD_TYPE (type
, i
));
7064 else if (ada_is_variant_part (type
, i
))
7066 /* PNH: Do we ever get here? See ada_search_struct_field,
7067 find_struct_field. */
7068 error (_("Cannot assign this kind of variant record"));
7070 else if (*index_p
== 0)
7071 return ada_value_primitive_field (arg
, offset
, i
, type
);
7078 /* Given ARG, a value of type (pointer or reference to a)*
7079 structure/union, extract the component named NAME from the ultimate
7080 target structure/union and return it as a value with its
7083 The routine searches for NAME among all members of the structure itself
7084 and (recursively) among all members of any wrapper members
7087 If NO_ERR, then simply return NULL in case of error, rather than
7091 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
7093 struct type
*t
, *t1
;
7097 t1
= t
= ada_check_typedef (value_type (arg
));
7098 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7100 t1
= TYPE_TARGET_TYPE (t
);
7103 t1
= ada_check_typedef (t1
);
7104 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7106 arg
= coerce_ref (arg
);
7111 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7113 t1
= TYPE_TARGET_TYPE (t
);
7116 t1
= ada_check_typedef (t1
);
7117 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7119 arg
= value_ind (arg
);
7126 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7130 v
= ada_search_struct_field (name
, arg
, 0, t
);
7133 int bit_offset
, bit_size
, byte_offset
;
7134 struct type
*field_type
;
7137 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7138 address
= value_address (ada_value_ind (arg
));
7140 address
= value_address (ada_coerce_ref (arg
));
7142 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7143 if (find_struct_field (name
, t1
, 0,
7144 &field_type
, &byte_offset
, &bit_offset
,
7149 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7150 arg
= ada_coerce_ref (arg
);
7152 arg
= ada_value_ind (arg
);
7153 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7154 bit_offset
, bit_size
,
7158 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7162 if (v
!= NULL
|| no_err
)
7165 error (_("There is no member named %s."), name
);
7171 error (_("Attempt to extract a component of "
7172 "a value that is not a record."));
7175 /* Given a type TYPE, look up the type of the component of type named NAME.
7176 If DISPP is non-null, add its byte displacement from the beginning of a
7177 structure (pointed to by a value) of type TYPE to *DISPP (does not
7178 work for packed fields).
7180 Matches any field whose name has NAME as a prefix, possibly
7183 TYPE can be either a struct or union. If REFOK, TYPE may also
7184 be a (pointer or reference)+ to a struct or union, and the
7185 ultimate target type will be searched.
7187 Looks recursively into variant clauses and parent types.
7189 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7190 TYPE is not a type of the right kind. */
7192 static struct type
*
7193 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7194 int noerr
, int *dispp
)
7201 if (refok
&& type
!= NULL
)
7204 type
= ada_check_typedef (type
);
7205 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7206 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7208 type
= TYPE_TARGET_TYPE (type
);
7212 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7213 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7219 target_terminal_ours ();
7220 gdb_flush (gdb_stdout
);
7222 error (_("Type (null) is not a structure or union type"));
7225 /* XXX: type_sprint */
7226 fprintf_unfiltered (gdb_stderr
, _("Type "));
7227 type_print (type
, "", gdb_stderr
, -1);
7228 error (_(" is not a structure or union type"));
7233 type
= to_static_fixed_type (type
);
7235 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7237 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7241 if (t_field_name
== NULL
)
7244 else if (field_name_match (t_field_name
, name
))
7247 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7248 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7251 else if (ada_is_wrapper_field (type
, i
))
7254 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7259 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7264 else if (ada_is_variant_part (type
, i
))
7267 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7270 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7272 /* FIXME pnh 2008/01/26: We check for a field that is
7273 NOT wrapped in a struct, since the compiler sometimes
7274 generates these for unchecked variant types. Revisit
7275 if the compiler changes this practice. */
7276 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7278 if (v_field_name
!= NULL
7279 && field_name_match (v_field_name
, name
))
7280 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
7282 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7289 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7300 target_terminal_ours ();
7301 gdb_flush (gdb_stdout
);
7304 /* XXX: type_sprint */
7305 fprintf_unfiltered (gdb_stderr
, _("Type "));
7306 type_print (type
, "", gdb_stderr
, -1);
7307 error (_(" has no component named <null>"));
7311 /* XXX: type_sprint */
7312 fprintf_unfiltered (gdb_stderr
, _("Type "));
7313 type_print (type
, "", gdb_stderr
, -1);
7314 error (_(" has no component named %s"), name
);
7321 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7322 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7323 represents an unchecked union (that is, the variant part of a
7324 record that is named in an Unchecked_Union pragma). */
7327 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7329 char *discrim_name
= ada_variant_discrim_name (var_type
);
7331 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
7336 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7337 within a value of type OUTER_TYPE that is stored in GDB at
7338 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7339 numbering from 0) is applicable. Returns -1 if none are. */
7342 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7343 const gdb_byte
*outer_valaddr
)
7347 char *discrim_name
= ada_variant_discrim_name (var_type
);
7348 struct value
*outer
;
7349 struct value
*discrim
;
7350 LONGEST discrim_val
;
7352 /* Using plain value_from_contents_and_address here causes problems
7353 because we will end up trying to resolve a type that is currently
7354 being constructed. */
7355 outer
= value_from_contents_and_address_unresolved (outer_type
,
7357 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7358 if (discrim
== NULL
)
7360 discrim_val
= value_as_long (discrim
);
7363 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7365 if (ada_is_others_clause (var_type
, i
))
7367 else if (ada_in_variant (discrim_val
, var_type
, i
))
7371 return others_clause
;
7376 /* Dynamic-Sized Records */
7378 /* Strategy: The type ostensibly attached to a value with dynamic size
7379 (i.e., a size that is not statically recorded in the debugging
7380 data) does not accurately reflect the size or layout of the value.
7381 Our strategy is to convert these values to values with accurate,
7382 conventional types that are constructed on the fly. */
7384 /* There is a subtle and tricky problem here. In general, we cannot
7385 determine the size of dynamic records without its data. However,
7386 the 'struct value' data structure, which GDB uses to represent
7387 quantities in the inferior process (the target), requires the size
7388 of the type at the time of its allocation in order to reserve space
7389 for GDB's internal copy of the data. That's why the
7390 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7391 rather than struct value*s.
7393 However, GDB's internal history variables ($1, $2, etc.) are
7394 struct value*s containing internal copies of the data that are not, in
7395 general, the same as the data at their corresponding addresses in
7396 the target. Fortunately, the types we give to these values are all
7397 conventional, fixed-size types (as per the strategy described
7398 above), so that we don't usually have to perform the
7399 'to_fixed_xxx_type' conversions to look at their values.
7400 Unfortunately, there is one exception: if one of the internal
7401 history variables is an array whose elements are unconstrained
7402 records, then we will need to create distinct fixed types for each
7403 element selected. */
7405 /* The upshot of all of this is that many routines take a (type, host
7406 address, target address) triple as arguments to represent a value.
7407 The host address, if non-null, is supposed to contain an internal
7408 copy of the relevant data; otherwise, the program is to consult the
7409 target at the target address. */
7411 /* Assuming that VAL0 represents a pointer value, the result of
7412 dereferencing it. Differs from value_ind in its treatment of
7413 dynamic-sized types. */
7416 ada_value_ind (struct value
*val0
)
7418 struct value
*val
= value_ind (val0
);
7420 if (ada_is_tagged_type (value_type (val
), 0))
7421 val
= ada_tag_value_at_base_address (val
);
7423 return ada_to_fixed_value (val
);
7426 /* The value resulting from dereferencing any "reference to"
7427 qualifiers on VAL0. */
7429 static struct value
*
7430 ada_coerce_ref (struct value
*val0
)
7432 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7434 struct value
*val
= val0
;
7436 val
= coerce_ref (val
);
7438 if (ada_is_tagged_type (value_type (val
), 0))
7439 val
= ada_tag_value_at_base_address (val
);
7441 return ada_to_fixed_value (val
);
7447 /* Return OFF rounded upward if necessary to a multiple of
7448 ALIGNMENT (a power of 2). */
7451 align_value (unsigned int off
, unsigned int alignment
)
7453 return (off
+ alignment
- 1) & ~(alignment
- 1);
7456 /* Return the bit alignment required for field #F of template type TYPE. */
7459 field_alignment (struct type
*type
, int f
)
7461 const char *name
= TYPE_FIELD_NAME (type
, f
);
7465 /* The field name should never be null, unless the debugging information
7466 is somehow malformed. In this case, we assume the field does not
7467 require any alignment. */
7471 len
= strlen (name
);
7473 if (!isdigit (name
[len
- 1]))
7476 if (isdigit (name
[len
- 2]))
7477 align_offset
= len
- 2;
7479 align_offset
= len
- 1;
7481 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
7482 return TARGET_CHAR_BIT
;
7484 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7487 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7489 static struct symbol
*
7490 ada_find_any_type_symbol (const char *name
)
7494 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7495 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7498 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7502 /* Find a type named NAME. Ignores ambiguity. This routine will look
7503 solely for types defined by debug info, it will not search the GDB
7506 static struct type
*
7507 ada_find_any_type (const char *name
)
7509 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7512 return SYMBOL_TYPE (sym
);
7517 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7518 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7519 symbol, in which case it is returned. Otherwise, this looks for
7520 symbols whose name is that of NAME_SYM suffixed with "___XR".
7521 Return symbol if found, and NULL otherwise. */
7524 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7526 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7529 if (strstr (name
, "___XR") != NULL
)
7532 sym
= find_old_style_renaming_symbol (name
, block
);
7537 /* Not right yet. FIXME pnh 7/20/2007. */
7538 sym
= ada_find_any_type_symbol (name
);
7539 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7545 static struct symbol
*
7546 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7548 const struct symbol
*function_sym
= block_linkage_function (block
);
7551 if (function_sym
!= NULL
)
7553 /* If the symbol is defined inside a function, NAME is not fully
7554 qualified. This means we need to prepend the function name
7555 as well as adding the ``___XR'' suffix to build the name of
7556 the associated renaming symbol. */
7557 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7558 /* Function names sometimes contain suffixes used
7559 for instance to qualify nested subprograms. When building
7560 the XR type name, we need to make sure that this suffix is
7561 not included. So do not include any suffix in the function
7562 name length below. */
7563 int function_name_len
= ada_name_prefix_len (function_name
);
7564 const int rename_len
= function_name_len
+ 2 /* "__" */
7565 + strlen (name
) + 6 /* "___XR\0" */ ;
7567 /* Strip the suffix if necessary. */
7568 ada_remove_trailing_digits (function_name
, &function_name_len
);
7569 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7570 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7572 /* Library-level functions are a special case, as GNAT adds
7573 a ``_ada_'' prefix to the function name to avoid namespace
7574 pollution. However, the renaming symbols themselves do not
7575 have this prefix, so we need to skip this prefix if present. */
7576 if (function_name_len
> 5 /* "_ada_" */
7577 && strstr (function_name
, "_ada_") == function_name
)
7580 function_name_len
-= 5;
7583 rename
= (char *) alloca (rename_len
* sizeof (char));
7584 strncpy (rename
, function_name
, function_name_len
);
7585 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7590 const int rename_len
= strlen (name
) + 6;
7592 rename
= (char *) alloca (rename_len
* sizeof (char));
7593 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7596 return ada_find_any_type_symbol (rename
);
7599 /* Because of GNAT encoding conventions, several GDB symbols may match a
7600 given type name. If the type denoted by TYPE0 is to be preferred to
7601 that of TYPE1 for purposes of type printing, return non-zero;
7602 otherwise return 0. */
7605 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7609 else if (type0
== NULL
)
7611 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7613 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7615 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7617 else if (ada_is_constrained_packed_array_type (type0
))
7619 else if (ada_is_array_descriptor_type (type0
)
7620 && !ada_is_array_descriptor_type (type1
))
7624 const char *type0_name
= type_name_no_tag (type0
);
7625 const char *type1_name
= type_name_no_tag (type1
);
7627 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7628 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7634 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7635 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7638 ada_type_name (struct type
*type
)
7642 else if (TYPE_NAME (type
) != NULL
)
7643 return TYPE_NAME (type
);
7645 return TYPE_TAG_NAME (type
);
7648 /* Search the list of "descriptive" types associated to TYPE for a type
7649 whose name is NAME. */
7651 static struct type
*
7652 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7654 struct type
*result
;
7656 if (ada_ignore_descriptive_types_p
)
7659 /* If there no descriptive-type info, then there is no parallel type
7661 if (!HAVE_GNAT_AUX_INFO (type
))
7664 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7665 while (result
!= NULL
)
7667 const char *result_name
= ada_type_name (result
);
7669 if (result_name
== NULL
)
7671 warning (_("unexpected null name on descriptive type"));
7675 /* If the names match, stop. */
7676 if (strcmp (result_name
, name
) == 0)
7679 /* Otherwise, look at the next item on the list, if any. */
7680 if (HAVE_GNAT_AUX_INFO (result
))
7681 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7686 /* If we didn't find a match, see whether this is a packed array. With
7687 older compilers, the descriptive type information is either absent or
7688 irrelevant when it comes to packed arrays so the above lookup fails.
7689 Fall back to using a parallel lookup by name in this case. */
7690 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7691 return ada_find_any_type (name
);
7696 /* Find a parallel type to TYPE with the specified NAME, using the
7697 descriptive type taken from the debugging information, if available,
7698 and otherwise using the (slower) name-based method. */
7700 static struct type
*
7701 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7703 struct type
*result
= NULL
;
7705 if (HAVE_GNAT_AUX_INFO (type
))
7706 result
= find_parallel_type_by_descriptive_type (type
, name
);
7708 result
= ada_find_any_type (name
);
7713 /* Same as above, but specify the name of the parallel type by appending
7714 SUFFIX to the name of TYPE. */
7717 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7720 const char *typename
= ada_type_name (type
);
7723 if (typename
== NULL
)
7726 len
= strlen (typename
);
7728 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7730 strcpy (name
, typename
);
7731 strcpy (name
+ len
, suffix
);
7733 return ada_find_parallel_type_with_name (type
, name
);
7736 /* If TYPE is a variable-size record type, return the corresponding template
7737 type describing its fields. Otherwise, return NULL. */
7739 static struct type
*
7740 dynamic_template_type (struct type
*type
)
7742 type
= ada_check_typedef (type
);
7744 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7745 || ada_type_name (type
) == NULL
)
7749 int len
= strlen (ada_type_name (type
));
7751 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7754 return ada_find_parallel_type (type
, "___XVE");
7758 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7759 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7762 is_dynamic_field (struct type
*templ_type
, int field_num
)
7764 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7767 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7768 && strstr (name
, "___XVL") != NULL
;
7771 /* The index of the variant field of TYPE, or -1 if TYPE does not
7772 represent a variant record type. */
7775 variant_field_index (struct type
*type
)
7779 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7782 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7784 if (ada_is_variant_part (type
, f
))
7790 /* A record type with no fields. */
7792 static struct type
*
7793 empty_record (struct type
*template)
7795 struct type
*type
= alloc_type_copy (template);
7797 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7798 TYPE_NFIELDS (type
) = 0;
7799 TYPE_FIELDS (type
) = NULL
;
7800 INIT_CPLUS_SPECIFIC (type
);
7801 TYPE_NAME (type
) = "<empty>";
7802 TYPE_TAG_NAME (type
) = NULL
;
7803 TYPE_LENGTH (type
) = 0;
7807 /* An ordinary record type (with fixed-length fields) that describes
7808 the value of type TYPE at VALADDR or ADDRESS (see comments at
7809 the beginning of this section) VAL according to GNAT conventions.
7810 DVAL0 should describe the (portion of a) record that contains any
7811 necessary discriminants. It should be NULL if value_type (VAL) is
7812 an outer-level type (i.e., as opposed to a branch of a variant.) A
7813 variant field (unless unchecked) is replaced by a particular branch
7816 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7817 length are not statically known are discarded. As a consequence,
7818 VALADDR, ADDRESS and DVAL0 are ignored.
7820 NOTE: Limitations: For now, we assume that dynamic fields and
7821 variants occupy whole numbers of bytes. However, they need not be
7825 ada_template_to_fixed_record_type_1 (struct type
*type
,
7826 const gdb_byte
*valaddr
,
7827 CORE_ADDR address
, struct value
*dval0
,
7828 int keep_dynamic_fields
)
7830 struct value
*mark
= value_mark ();
7833 int nfields
, bit_len
;
7839 /* Compute the number of fields in this record type that are going
7840 to be processed: unless keep_dynamic_fields, this includes only
7841 fields whose position and length are static will be processed. */
7842 if (keep_dynamic_fields
)
7843 nfields
= TYPE_NFIELDS (type
);
7847 while (nfields
< TYPE_NFIELDS (type
)
7848 && !ada_is_variant_part (type
, nfields
)
7849 && !is_dynamic_field (type
, nfields
))
7853 rtype
= alloc_type_copy (type
);
7854 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7855 INIT_CPLUS_SPECIFIC (rtype
);
7856 TYPE_NFIELDS (rtype
) = nfields
;
7857 TYPE_FIELDS (rtype
) = (struct field
*)
7858 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7859 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7860 TYPE_NAME (rtype
) = ada_type_name (type
);
7861 TYPE_TAG_NAME (rtype
) = NULL
;
7862 TYPE_FIXED_INSTANCE (rtype
) = 1;
7868 for (f
= 0; f
< nfields
; f
+= 1)
7870 off
= align_value (off
, field_alignment (type
, f
))
7871 + TYPE_FIELD_BITPOS (type
, f
);
7872 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
7873 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7875 if (ada_is_variant_part (type
, f
))
7880 else if (is_dynamic_field (type
, f
))
7882 const gdb_byte
*field_valaddr
= valaddr
;
7883 CORE_ADDR field_address
= address
;
7884 struct type
*field_type
=
7885 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7889 /* rtype's length is computed based on the run-time
7890 value of discriminants. If the discriminants are not
7891 initialized, the type size may be completely bogus and
7892 GDB may fail to allocate a value for it. So check the
7893 size first before creating the value. */
7895 /* Using plain value_from_contents_and_address here
7896 causes problems because we will end up trying to
7897 resolve a type that is currently being
7899 dval
= value_from_contents_and_address_unresolved (rtype
,
7902 rtype
= value_type (dval
);
7907 /* If the type referenced by this field is an aligner type, we need
7908 to unwrap that aligner type, because its size might not be set.
7909 Keeping the aligner type would cause us to compute the wrong
7910 size for this field, impacting the offset of the all the fields
7911 that follow this one. */
7912 if (ada_is_aligner_type (field_type
))
7914 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7916 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7917 field_address
= cond_offset_target (field_address
, field_offset
);
7918 field_type
= ada_aligned_type (field_type
);
7921 field_valaddr
= cond_offset_host (field_valaddr
,
7922 off
/ TARGET_CHAR_BIT
);
7923 field_address
= cond_offset_target (field_address
,
7924 off
/ TARGET_CHAR_BIT
);
7926 /* Get the fixed type of the field. Note that, in this case,
7927 we do not want to get the real type out of the tag: if
7928 the current field is the parent part of a tagged record,
7929 we will get the tag of the object. Clearly wrong: the real
7930 type of the parent is not the real type of the child. We
7931 would end up in an infinite loop. */
7932 field_type
= ada_get_base_type (field_type
);
7933 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7934 field_address
, dval
, 0);
7935 /* If the field size is already larger than the maximum
7936 object size, then the record itself will necessarily
7937 be larger than the maximum object size. We need to make
7938 this check now, because the size might be so ridiculously
7939 large (due to an uninitialized variable in the inferior)
7940 that it would cause an overflow when adding it to the
7942 check_size (field_type
);
7944 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7945 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7946 /* The multiplication can potentially overflow. But because
7947 the field length has been size-checked just above, and
7948 assuming that the maximum size is a reasonable value,
7949 an overflow should not happen in practice. So rather than
7950 adding overflow recovery code to this already complex code,
7951 we just assume that it's not going to happen. */
7953 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7957 /* Note: If this field's type is a typedef, it is important
7958 to preserve the typedef layer.
7960 Otherwise, we might be transforming a typedef to a fat
7961 pointer (encoding a pointer to an unconstrained array),
7962 into a basic fat pointer (encoding an unconstrained
7963 array). As both types are implemented using the same
7964 structure, the typedef is the only clue which allows us
7965 to distinguish between the two options. Stripping it
7966 would prevent us from printing this field appropriately. */
7967 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
7968 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7969 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7971 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7974 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
7976 /* We need to be careful of typedefs when computing
7977 the length of our field. If this is a typedef,
7978 get the length of the target type, not the length
7980 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
7981 field_type
= ada_typedef_target_type (field_type
);
7984 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7987 if (off
+ fld_bit_len
> bit_len
)
7988 bit_len
= off
+ fld_bit_len
;
7990 TYPE_LENGTH (rtype
) =
7991 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7994 /* We handle the variant part, if any, at the end because of certain
7995 odd cases in which it is re-ordered so as NOT to be the last field of
7996 the record. This can happen in the presence of representation
7998 if (variant_field
>= 0)
8000 struct type
*branch_type
;
8002 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8006 /* Using plain value_from_contents_and_address here causes
8007 problems because we will end up trying to resolve a type
8008 that is currently being constructed. */
8009 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8011 rtype
= value_type (dval
);
8017 to_fixed_variant_branch_type
8018 (TYPE_FIELD_TYPE (type
, variant_field
),
8019 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8020 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8021 if (branch_type
== NULL
)
8023 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8024 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8025 TYPE_NFIELDS (rtype
) -= 1;
8029 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8030 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8032 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8034 if (off
+ fld_bit_len
> bit_len
)
8035 bit_len
= off
+ fld_bit_len
;
8036 TYPE_LENGTH (rtype
) =
8037 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8041 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8042 should contain the alignment of that record, which should be a strictly
8043 positive value. If null or negative, then something is wrong, most
8044 probably in the debug info. In that case, we don't round up the size
8045 of the resulting type. If this record is not part of another structure,
8046 the current RTYPE length might be good enough for our purposes. */
8047 if (TYPE_LENGTH (type
) <= 0)
8049 if (TYPE_NAME (rtype
))
8050 warning (_("Invalid type size for `%s' detected: %d."),
8051 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8053 warning (_("Invalid type size for <unnamed> detected: %d."),
8054 TYPE_LENGTH (type
));
8058 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8059 TYPE_LENGTH (type
));
8062 value_free_to_mark (mark
);
8063 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8064 error (_("record type with dynamic size is larger than varsize-limit"));
8068 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8071 static struct type
*
8072 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8073 CORE_ADDR address
, struct value
*dval0
)
8075 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8079 /* An ordinary record type in which ___XVL-convention fields and
8080 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8081 static approximations, containing all possible fields. Uses
8082 no runtime values. Useless for use in values, but that's OK,
8083 since the results are used only for type determinations. Works on both
8084 structs and unions. Representation note: to save space, we memorize
8085 the result of this function in the TYPE_TARGET_TYPE of the
8088 static struct type
*
8089 template_to_static_fixed_type (struct type
*type0
)
8095 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8096 return TYPE_TARGET_TYPE (type0
);
8098 nfields
= TYPE_NFIELDS (type0
);
8101 for (f
= 0; f
< nfields
; f
+= 1)
8103 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
8104 struct type
*new_type
;
8106 if (is_dynamic_field (type0
, f
))
8107 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8109 new_type
= static_unwrap_type (field_type
);
8110 if (type
== type0
&& new_type
!= field_type
)
8112 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8113 TYPE_CODE (type
) = TYPE_CODE (type0
);
8114 INIT_CPLUS_SPECIFIC (type
);
8115 TYPE_NFIELDS (type
) = nfields
;
8116 TYPE_FIELDS (type
) = (struct field
*)
8117 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8118 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8119 sizeof (struct field
) * nfields
);
8120 TYPE_NAME (type
) = ada_type_name (type0
);
8121 TYPE_TAG_NAME (type
) = NULL
;
8122 TYPE_FIXED_INSTANCE (type
) = 1;
8123 TYPE_LENGTH (type
) = 0;
8125 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8126 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8131 /* Given an object of type TYPE whose contents are at VALADDR and
8132 whose address in memory is ADDRESS, returns a revision of TYPE,
8133 which should be a non-dynamic-sized record, in which the variant
8134 part, if any, is replaced with the appropriate branch. Looks
8135 for discriminant values in DVAL0, which can be NULL if the record
8136 contains the necessary discriminant values. */
8138 static struct type
*
8139 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8140 CORE_ADDR address
, struct value
*dval0
)
8142 struct value
*mark
= value_mark ();
8145 struct type
*branch_type
;
8146 int nfields
= TYPE_NFIELDS (type
);
8147 int variant_field
= variant_field_index (type
);
8149 if (variant_field
== -1)
8154 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8155 type
= value_type (dval
);
8160 rtype
= alloc_type_copy (type
);
8161 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8162 INIT_CPLUS_SPECIFIC (rtype
);
8163 TYPE_NFIELDS (rtype
) = nfields
;
8164 TYPE_FIELDS (rtype
) =
8165 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8166 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8167 sizeof (struct field
) * nfields
);
8168 TYPE_NAME (rtype
) = ada_type_name (type
);
8169 TYPE_TAG_NAME (rtype
) = NULL
;
8170 TYPE_FIXED_INSTANCE (rtype
) = 1;
8171 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8173 branch_type
= to_fixed_variant_branch_type
8174 (TYPE_FIELD_TYPE (type
, variant_field
),
8175 cond_offset_host (valaddr
,
8176 TYPE_FIELD_BITPOS (type
, variant_field
)
8178 cond_offset_target (address
,
8179 TYPE_FIELD_BITPOS (type
, variant_field
)
8180 / TARGET_CHAR_BIT
), dval
);
8181 if (branch_type
== NULL
)
8185 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8186 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8187 TYPE_NFIELDS (rtype
) -= 1;
8191 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8192 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8193 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8194 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8196 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8198 value_free_to_mark (mark
);
8202 /* An ordinary record type (with fixed-length fields) that describes
8203 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8204 beginning of this section]. Any necessary discriminants' values
8205 should be in DVAL, a record value; it may be NULL if the object
8206 at ADDR itself contains any necessary discriminant values.
8207 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8208 values from the record are needed. Except in the case that DVAL,
8209 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8210 unchecked) is replaced by a particular branch of the variant.
8212 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8213 is questionable and may be removed. It can arise during the
8214 processing of an unconstrained-array-of-record type where all the
8215 variant branches have exactly the same size. This is because in
8216 such cases, the compiler does not bother to use the XVS convention
8217 when encoding the record. I am currently dubious of this
8218 shortcut and suspect the compiler should be altered. FIXME. */
8220 static struct type
*
8221 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8222 CORE_ADDR address
, struct value
*dval
)
8224 struct type
*templ_type
;
8226 if (TYPE_FIXED_INSTANCE (type0
))
8229 templ_type
= dynamic_template_type (type0
);
8231 if (templ_type
!= NULL
)
8232 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8233 else if (variant_field_index (type0
) >= 0)
8235 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8237 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8242 TYPE_FIXED_INSTANCE (type0
) = 1;
8248 /* An ordinary record type (with fixed-length fields) that describes
8249 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8250 union type. Any necessary discriminants' values should be in DVAL,
8251 a record value. That is, this routine selects the appropriate
8252 branch of the union at ADDR according to the discriminant value
8253 indicated in the union's type name. Returns VAR_TYPE0 itself if
8254 it represents a variant subject to a pragma Unchecked_Union. */
8256 static struct type
*
8257 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8258 CORE_ADDR address
, struct value
*dval
)
8261 struct type
*templ_type
;
8262 struct type
*var_type
;
8264 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8265 var_type
= TYPE_TARGET_TYPE (var_type0
);
8267 var_type
= var_type0
;
8269 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8271 if (templ_type
!= NULL
)
8272 var_type
= templ_type
;
8274 if (is_unchecked_variant (var_type
, value_type (dval
)))
8277 ada_which_variant_applies (var_type
,
8278 value_type (dval
), value_contents (dval
));
8281 return empty_record (var_type
);
8282 else if (is_dynamic_field (var_type
, which
))
8283 return to_fixed_record_type
8284 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8285 valaddr
, address
, dval
);
8286 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8288 to_fixed_record_type
8289 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8291 return TYPE_FIELD_TYPE (var_type
, which
);
8294 /* Assuming that TYPE0 is an array type describing the type of a value
8295 at ADDR, and that DVAL describes a record containing any
8296 discriminants used in TYPE0, returns a type for the value that
8297 contains no dynamic components (that is, no components whose sizes
8298 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8299 true, gives an error message if the resulting type's size is over
8302 static struct type
*
8303 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8306 struct type
*index_type_desc
;
8307 struct type
*result
;
8308 int constrained_packed_array_p
;
8310 type0
= ada_check_typedef (type0
);
8311 if (TYPE_FIXED_INSTANCE (type0
))
8314 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8315 if (constrained_packed_array_p
)
8316 type0
= decode_constrained_packed_array_type (type0
);
8318 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
8319 ada_fixup_array_indexes_type (index_type_desc
);
8320 if (index_type_desc
== NULL
)
8322 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8324 /* NOTE: elt_type---the fixed version of elt_type0---should never
8325 depend on the contents of the array in properly constructed
8327 /* Create a fixed version of the array element type.
8328 We're not providing the address of an element here,
8329 and thus the actual object value cannot be inspected to do
8330 the conversion. This should not be a problem, since arrays of
8331 unconstrained objects are not allowed. In particular, all
8332 the elements of an array of a tagged type should all be of
8333 the same type specified in the debugging info. No need to
8334 consult the object tag. */
8335 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8337 /* Make sure we always create a new array type when dealing with
8338 packed array types, since we're going to fix-up the array
8339 type length and element bitsize a little further down. */
8340 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8343 result
= create_array_type (alloc_type_copy (type0
),
8344 elt_type
, TYPE_INDEX_TYPE (type0
));
8349 struct type
*elt_type0
;
8352 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8353 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8355 /* NOTE: result---the fixed version of elt_type0---should never
8356 depend on the contents of the array in properly constructed
8358 /* Create a fixed version of the array element type.
8359 We're not providing the address of an element here,
8360 and thus the actual object value cannot be inspected to do
8361 the conversion. This should not be a problem, since arrays of
8362 unconstrained objects are not allowed. In particular, all
8363 the elements of an array of a tagged type should all be of
8364 the same type specified in the debugging info. No need to
8365 consult the object tag. */
8367 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8370 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8372 struct type
*range_type
=
8373 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8375 result
= create_array_type (alloc_type_copy (elt_type0
),
8376 result
, range_type
);
8377 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8379 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8380 error (_("array type with dynamic size is larger than varsize-limit"));
8383 /* We want to preserve the type name. This can be useful when
8384 trying to get the type name of a value that has already been
8385 printed (for instance, if the user did "print VAR; whatis $". */
8386 TYPE_NAME (result
) = TYPE_NAME (type0
);
8388 if (constrained_packed_array_p
)
8390 /* So far, the resulting type has been created as if the original
8391 type was a regular (non-packed) array type. As a result, the
8392 bitsize of the array elements needs to be set again, and the array
8393 length needs to be recomputed based on that bitsize. */
8394 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8395 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8397 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8398 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8399 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8400 TYPE_LENGTH (result
)++;
8403 TYPE_FIXED_INSTANCE (result
) = 1;
8408 /* A standard type (containing no dynamically sized components)
8409 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8410 DVAL describes a record containing any discriminants used in TYPE0,
8411 and may be NULL if there are none, or if the object of type TYPE at
8412 ADDRESS or in VALADDR contains these discriminants.
8414 If CHECK_TAG is not null, in the case of tagged types, this function
8415 attempts to locate the object's tag and use it to compute the actual
8416 type. However, when ADDRESS is null, we cannot use it to determine the
8417 location of the tag, and therefore compute the tagged type's actual type.
8418 So we return the tagged type without consulting the tag. */
8420 static struct type
*
8421 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8422 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8424 type
= ada_check_typedef (type
);
8425 switch (TYPE_CODE (type
))
8429 case TYPE_CODE_STRUCT
:
8431 struct type
*static_type
= to_static_fixed_type (type
);
8432 struct type
*fixed_record_type
=
8433 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8435 /* If STATIC_TYPE is a tagged type and we know the object's address,
8436 then we can determine its tag, and compute the object's actual
8437 type from there. Note that we have to use the fixed record
8438 type (the parent part of the record may have dynamic fields
8439 and the way the location of _tag is expressed may depend on
8442 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8445 value_tag_from_contents_and_address
8449 struct type
*real_type
= type_from_tag (tag
);
8451 value_from_contents_and_address (fixed_record_type
,
8454 fixed_record_type
= value_type (obj
);
8455 if (real_type
!= NULL
)
8456 return to_fixed_record_type
8458 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8461 /* Check to see if there is a parallel ___XVZ variable.
8462 If there is, then it provides the actual size of our type. */
8463 else if (ada_type_name (fixed_record_type
) != NULL
)
8465 const char *name
= ada_type_name (fixed_record_type
);
8466 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8470 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8471 size
= get_int_var_value (xvz_name
, &xvz_found
);
8472 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8474 fixed_record_type
= copy_type (fixed_record_type
);
8475 TYPE_LENGTH (fixed_record_type
) = size
;
8477 /* The FIXED_RECORD_TYPE may have be a stub. We have
8478 observed this when the debugging info is STABS, and
8479 apparently it is something that is hard to fix.
8481 In practice, we don't need the actual type definition
8482 at all, because the presence of the XVZ variable allows us
8483 to assume that there must be a XVS type as well, which we
8484 should be able to use later, when we need the actual type
8487 In the meantime, pretend that the "fixed" type we are
8488 returning is NOT a stub, because this can cause trouble
8489 when using this type to create new types targeting it.
8490 Indeed, the associated creation routines often check
8491 whether the target type is a stub and will try to replace
8492 it, thus using a type with the wrong size. This, in turn,
8493 might cause the new type to have the wrong size too.
8494 Consider the case of an array, for instance, where the size
8495 of the array is computed from the number of elements in
8496 our array multiplied by the size of its element. */
8497 TYPE_STUB (fixed_record_type
) = 0;
8500 return fixed_record_type
;
8502 case TYPE_CODE_ARRAY
:
8503 return to_fixed_array_type (type
, dval
, 1);
8504 case TYPE_CODE_UNION
:
8508 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8512 /* The same as ada_to_fixed_type_1, except that it preserves the type
8513 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8515 The typedef layer needs be preserved in order to differentiate between
8516 arrays and array pointers when both types are implemented using the same
8517 fat pointer. In the array pointer case, the pointer is encoded as
8518 a typedef of the pointer type. For instance, considering:
8520 type String_Access is access String;
8521 S1 : String_Access := null;
8523 To the debugger, S1 is defined as a typedef of type String. But
8524 to the user, it is a pointer. So if the user tries to print S1,
8525 we should not dereference the array, but print the array address
8528 If we didn't preserve the typedef layer, we would lose the fact that
8529 the type is to be presented as a pointer (needs de-reference before
8530 being printed). And we would also use the source-level type name. */
8533 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8534 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8537 struct type
*fixed_type
=
8538 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8540 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8541 then preserve the typedef layer.
8543 Implementation note: We can only check the main-type portion of
8544 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8545 from TYPE now returns a type that has the same instance flags
8546 as TYPE. For instance, if TYPE is a "typedef const", and its
8547 target type is a "struct", then the typedef elimination will return
8548 a "const" version of the target type. See check_typedef for more
8549 details about how the typedef layer elimination is done.
8551 brobecker/2010-11-19: It seems to me that the only case where it is
8552 useful to preserve the typedef layer is when dealing with fat pointers.
8553 Perhaps, we could add a check for that and preserve the typedef layer
8554 only in that situation. But this seems unecessary so far, probably
8555 because we call check_typedef/ada_check_typedef pretty much everywhere.
8557 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8558 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8559 == TYPE_MAIN_TYPE (fixed_type
)))
8565 /* A standard (static-sized) type corresponding as well as possible to
8566 TYPE0, but based on no runtime data. */
8568 static struct type
*
8569 to_static_fixed_type (struct type
*type0
)
8576 if (TYPE_FIXED_INSTANCE (type0
))
8579 type0
= ada_check_typedef (type0
);
8581 switch (TYPE_CODE (type0
))
8585 case TYPE_CODE_STRUCT
:
8586 type
= dynamic_template_type (type0
);
8588 return template_to_static_fixed_type (type
);
8590 return template_to_static_fixed_type (type0
);
8591 case TYPE_CODE_UNION
:
8592 type
= ada_find_parallel_type (type0
, "___XVU");
8594 return template_to_static_fixed_type (type
);
8596 return template_to_static_fixed_type (type0
);
8600 /* A static approximation of TYPE with all type wrappers removed. */
8602 static struct type
*
8603 static_unwrap_type (struct type
*type
)
8605 if (ada_is_aligner_type (type
))
8607 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8608 if (ada_type_name (type1
) == NULL
)
8609 TYPE_NAME (type1
) = ada_type_name (type
);
8611 return static_unwrap_type (type1
);
8615 struct type
*raw_real_type
= ada_get_base_type (type
);
8617 if (raw_real_type
== type
)
8620 return to_static_fixed_type (raw_real_type
);
8624 /* In some cases, incomplete and private types require
8625 cross-references that are not resolved as records (for example,
8627 type FooP is access Foo;
8629 type Foo is array ...;
8630 ). In these cases, since there is no mechanism for producing
8631 cross-references to such types, we instead substitute for FooP a
8632 stub enumeration type that is nowhere resolved, and whose tag is
8633 the name of the actual type. Call these types "non-record stubs". */
8635 /* A type equivalent to TYPE that is not a non-record stub, if one
8636 exists, otherwise TYPE. */
8639 ada_check_typedef (struct type
*type
)
8644 /* If our type is a typedef type of a fat pointer, then we're done.
8645 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8646 what allows us to distinguish between fat pointers that represent
8647 array types, and fat pointers that represent array access types
8648 (in both cases, the compiler implements them as fat pointers). */
8649 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8650 && is_thick_pntr (ada_typedef_target_type (type
)))
8653 CHECK_TYPEDEF (type
);
8654 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8655 || !TYPE_STUB (type
)
8656 || TYPE_TAG_NAME (type
) == NULL
)
8660 const char *name
= TYPE_TAG_NAME (type
);
8661 struct type
*type1
= ada_find_any_type (name
);
8666 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8667 stubs pointing to arrays, as we don't create symbols for array
8668 types, only for the typedef-to-array types). If that's the case,
8669 strip the typedef layer. */
8670 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8671 type1
= ada_check_typedef (type1
);
8677 /* A value representing the data at VALADDR/ADDRESS as described by
8678 type TYPE0, but with a standard (static-sized) type that correctly
8679 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8680 type, then return VAL0 [this feature is simply to avoid redundant
8681 creation of struct values]. */
8683 static struct value
*
8684 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8687 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8689 if (type
== type0
&& val0
!= NULL
)
8692 return value_from_contents_and_address (type
, 0, address
);
8695 /* A value representing VAL, but with a standard (static-sized) type
8696 that correctly describes it. Does not necessarily create a new
8700 ada_to_fixed_value (struct value
*val
)
8702 val
= unwrap_value (val
);
8703 val
= ada_to_fixed_value_create (value_type (val
),
8704 value_address (val
),
8712 /* Table mapping attribute numbers to names.
8713 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8715 static const char *attribute_names
[] = {
8733 ada_attribute_name (enum exp_opcode n
)
8735 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8736 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8738 return attribute_names
[0];
8741 /* Evaluate the 'POS attribute applied to ARG. */
8744 pos_atr (struct value
*arg
)
8746 struct value
*val
= coerce_ref (arg
);
8747 struct type
*type
= value_type (val
);
8749 if (!discrete_type_p (type
))
8750 error (_("'POS only defined on discrete types"));
8752 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8755 LONGEST v
= value_as_long (val
);
8757 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8759 if (v
== TYPE_FIELD_ENUMVAL (type
, i
))
8762 error (_("enumeration value is invalid: can't find 'POS"));
8765 return value_as_long (val
);
8768 static struct value
*
8769 value_pos_atr (struct type
*type
, struct value
*arg
)
8771 return value_from_longest (type
, pos_atr (arg
));
8774 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8776 static struct value
*
8777 value_val_atr (struct type
*type
, struct value
*arg
)
8779 if (!discrete_type_p (type
))
8780 error (_("'VAL only defined on discrete types"));
8781 if (!integer_type_p (value_type (arg
)))
8782 error (_("'VAL requires integral argument"));
8784 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8786 long pos
= value_as_long (arg
);
8788 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8789 error (_("argument to 'VAL out of range"));
8790 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
8793 return value_from_longest (type
, value_as_long (arg
));
8799 /* True if TYPE appears to be an Ada character type.
8800 [At the moment, this is true only for Character and Wide_Character;
8801 It is a heuristic test that could stand improvement]. */
8804 ada_is_character_type (struct type
*type
)
8808 /* If the type code says it's a character, then assume it really is,
8809 and don't check any further. */
8810 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8813 /* Otherwise, assume it's a character type iff it is a discrete type
8814 with a known character type name. */
8815 name
= ada_type_name (type
);
8816 return (name
!= NULL
8817 && (TYPE_CODE (type
) == TYPE_CODE_INT
8818 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8819 && (strcmp (name
, "character") == 0
8820 || strcmp (name
, "wide_character") == 0
8821 || strcmp (name
, "wide_wide_character") == 0
8822 || strcmp (name
, "unsigned char") == 0));
8825 /* True if TYPE appears to be an Ada string type. */
8828 ada_is_string_type (struct type
*type
)
8830 type
= ada_check_typedef (type
);
8832 && TYPE_CODE (type
) != TYPE_CODE_PTR
8833 && (ada_is_simple_array_type (type
)
8834 || ada_is_array_descriptor_type (type
))
8835 && ada_array_arity (type
) == 1)
8837 struct type
*elttype
= ada_array_element_type (type
, 1);
8839 return ada_is_character_type (elttype
);
8845 /* The compiler sometimes provides a parallel XVS type for a given
8846 PAD type. Normally, it is safe to follow the PAD type directly,
8847 but older versions of the compiler have a bug that causes the offset
8848 of its "F" field to be wrong. Following that field in that case
8849 would lead to incorrect results, but this can be worked around
8850 by ignoring the PAD type and using the associated XVS type instead.
8852 Set to True if the debugger should trust the contents of PAD types.
8853 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8854 static int trust_pad_over_xvs
= 1;
8856 /* True if TYPE is a struct type introduced by the compiler to force the
8857 alignment of a value. Such types have a single field with a
8858 distinctive name. */
8861 ada_is_aligner_type (struct type
*type
)
8863 type
= ada_check_typedef (type
);
8865 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8868 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8869 && TYPE_NFIELDS (type
) == 1
8870 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8873 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8874 the parallel type. */
8877 ada_get_base_type (struct type
*raw_type
)
8879 struct type
*real_type_namer
;
8880 struct type
*raw_real_type
;
8882 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8885 if (ada_is_aligner_type (raw_type
))
8886 /* The encoding specifies that we should always use the aligner type.
8887 So, even if this aligner type has an associated XVS type, we should
8890 According to the compiler gurus, an XVS type parallel to an aligner
8891 type may exist because of a stabs limitation. In stabs, aligner
8892 types are empty because the field has a variable-sized type, and
8893 thus cannot actually be used as an aligner type. As a result,
8894 we need the associated parallel XVS type to decode the type.
8895 Since the policy in the compiler is to not change the internal
8896 representation based on the debugging info format, we sometimes
8897 end up having a redundant XVS type parallel to the aligner type. */
8900 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8901 if (real_type_namer
== NULL
8902 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8903 || TYPE_NFIELDS (real_type_namer
) != 1)
8906 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
8908 /* This is an older encoding form where the base type needs to be
8909 looked up by name. We prefer the newer enconding because it is
8911 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8912 if (raw_real_type
== NULL
)
8915 return raw_real_type
;
8918 /* The field in our XVS type is a reference to the base type. */
8919 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
8922 /* The type of value designated by TYPE, with all aligners removed. */
8925 ada_aligned_type (struct type
*type
)
8927 if (ada_is_aligner_type (type
))
8928 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8930 return ada_get_base_type (type
);
8934 /* The address of the aligned value in an object at address VALADDR
8935 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8938 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8940 if (ada_is_aligner_type (type
))
8941 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8943 TYPE_FIELD_BITPOS (type
,
8944 0) / TARGET_CHAR_BIT
);
8951 /* The printed representation of an enumeration literal with encoded
8952 name NAME. The value is good to the next call of ada_enum_name. */
8954 ada_enum_name (const char *name
)
8956 static char *result
;
8957 static size_t result_len
= 0;
8960 /* First, unqualify the enumeration name:
8961 1. Search for the last '.' character. If we find one, then skip
8962 all the preceding characters, the unqualified name starts
8963 right after that dot.
8964 2. Otherwise, we may be debugging on a target where the compiler
8965 translates dots into "__". Search forward for double underscores,
8966 but stop searching when we hit an overloading suffix, which is
8967 of the form "__" followed by digits. */
8969 tmp
= strrchr (name
, '.');
8974 while ((tmp
= strstr (name
, "__")) != NULL
)
8976 if (isdigit (tmp
[2]))
8987 if (name
[1] == 'U' || name
[1] == 'W')
8989 if (sscanf (name
+ 2, "%x", &v
) != 1)
8995 GROW_VECT (result
, result_len
, 16);
8996 if (isascii (v
) && isprint (v
))
8997 xsnprintf (result
, result_len
, "'%c'", v
);
8998 else if (name
[1] == 'U')
8999 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9001 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9007 tmp
= strstr (name
, "__");
9009 tmp
= strstr (name
, "$");
9012 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9013 strncpy (result
, name
, tmp
- name
);
9014 result
[tmp
- name
] = '\0';
9022 /* Evaluate the subexpression of EXP starting at *POS as for
9023 evaluate_type, updating *POS to point just past the evaluated
9026 static struct value
*
9027 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9029 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9032 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9035 static struct value
*
9036 unwrap_value (struct value
*val
)
9038 struct type
*type
= ada_check_typedef (value_type (val
));
9040 if (ada_is_aligner_type (type
))
9042 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9043 struct type
*val_type
= ada_check_typedef (value_type (v
));
9045 if (ada_type_name (val_type
) == NULL
)
9046 TYPE_NAME (val_type
) = ada_type_name (type
);
9048 return unwrap_value (v
);
9052 struct type
*raw_real_type
=
9053 ada_check_typedef (ada_get_base_type (type
));
9055 /* If there is no parallel XVS or XVE type, then the value is
9056 already unwrapped. Return it without further modification. */
9057 if ((type
== raw_real_type
)
9058 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9062 coerce_unspec_val_to_type
9063 (val
, ada_to_fixed_type (raw_real_type
, 0,
9064 value_address (val
),
9069 static struct value
*
9070 cast_to_fixed (struct type
*type
, struct value
*arg
)
9074 if (type
== value_type (arg
))
9076 else if (ada_is_fixed_point_type (value_type (arg
)))
9077 val
= ada_float_to_fixed (type
,
9078 ada_fixed_to_float (value_type (arg
),
9079 value_as_long (arg
)));
9082 DOUBLEST argd
= value_as_double (arg
);
9084 val
= ada_float_to_fixed (type
, argd
);
9087 return value_from_longest (type
, val
);
9090 static struct value
*
9091 cast_from_fixed (struct type
*type
, struct value
*arg
)
9093 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9094 value_as_long (arg
));
9096 return value_from_double (type
, val
);
9099 /* Given two array types T1 and T2, return nonzero iff both arrays
9100 contain the same number of elements. */
9103 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9105 LONGEST lo1
, hi1
, lo2
, hi2
;
9107 /* Get the array bounds in order to verify that the size of
9108 the two arrays match. */
9109 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9110 || !get_array_bounds (t2
, &lo2
, &hi2
))
9111 error (_("unable to determine array bounds"));
9113 /* To make things easier for size comparison, normalize a bit
9114 the case of empty arrays by making sure that the difference
9115 between upper bound and lower bound is always -1. */
9121 return (hi1
- lo1
== hi2
- lo2
);
9124 /* Assuming that VAL is an array of integrals, and TYPE represents
9125 an array with the same number of elements, but with wider integral
9126 elements, return an array "casted" to TYPE. In practice, this
9127 means that the returned array is built by casting each element
9128 of the original array into TYPE's (wider) element type. */
9130 static struct value
*
9131 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9133 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9138 /* Verify that both val and type are arrays of scalars, and
9139 that the size of val's elements is smaller than the size
9140 of type's element. */
9141 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9142 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9143 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9144 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9145 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9146 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9148 if (!get_array_bounds (type
, &lo
, &hi
))
9149 error (_("unable to determine array bounds"));
9151 res
= allocate_value (type
);
9153 /* Promote each array element. */
9154 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9156 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9158 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9159 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9165 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9166 return the converted value. */
9168 static struct value
*
9169 coerce_for_assign (struct type
*type
, struct value
*val
)
9171 struct type
*type2
= value_type (val
);
9176 type2
= ada_check_typedef (type2
);
9177 type
= ada_check_typedef (type
);
9179 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9180 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9182 val
= ada_value_ind (val
);
9183 type2
= value_type (val
);
9186 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9187 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9189 if (!ada_same_array_size_p (type
, type2
))
9190 error (_("cannot assign arrays of different length"));
9192 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9193 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9194 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9195 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9197 /* Allow implicit promotion of the array elements to
9199 return ada_promote_array_of_integrals (type
, val
);
9202 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9203 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9204 error (_("Incompatible types in assignment"));
9205 deprecated_set_value_type (val
, type
);
9210 static struct value
*
9211 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9214 struct type
*type1
, *type2
;
9217 arg1
= coerce_ref (arg1
);
9218 arg2
= coerce_ref (arg2
);
9219 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9220 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9222 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9223 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9224 return value_binop (arg1
, arg2
, op
);
9233 return value_binop (arg1
, arg2
, op
);
9236 v2
= value_as_long (arg2
);
9238 error (_("second operand of %s must not be zero."), op_string (op
));
9240 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9241 return value_binop (arg1
, arg2
, op
);
9243 v1
= value_as_long (arg1
);
9248 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9249 v
+= v
> 0 ? -1 : 1;
9257 /* Should not reach this point. */
9261 val
= allocate_value (type1
);
9262 store_unsigned_integer (value_contents_raw (val
),
9263 TYPE_LENGTH (value_type (val
)),
9264 gdbarch_byte_order (get_type_arch (type1
)), v
);
9269 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9271 if (ada_is_direct_array_type (value_type (arg1
))
9272 || ada_is_direct_array_type (value_type (arg2
)))
9274 /* Automatically dereference any array reference before
9275 we attempt to perform the comparison. */
9276 arg1
= ada_coerce_ref (arg1
);
9277 arg2
= ada_coerce_ref (arg2
);
9279 arg1
= ada_coerce_to_simple_array (arg1
);
9280 arg2
= ada_coerce_to_simple_array (arg2
);
9281 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9282 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9283 error (_("Attempt to compare array with non-array"));
9284 /* FIXME: The following works only for types whose
9285 representations use all bits (no padding or undefined bits)
9286 and do not have user-defined equality. */
9288 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9289 && memcmp (value_contents (arg1
), value_contents (arg2
),
9290 TYPE_LENGTH (value_type (arg1
))) == 0;
9292 return value_equal (arg1
, arg2
);
9295 /* Total number of component associations in the aggregate starting at
9296 index PC in EXP. Assumes that index PC is the start of an
9300 num_component_specs (struct expression
*exp
, int pc
)
9304 m
= exp
->elts
[pc
+ 1].longconst
;
9307 for (i
= 0; i
< m
; i
+= 1)
9309 switch (exp
->elts
[pc
].opcode
)
9315 n
+= exp
->elts
[pc
+ 1].longconst
;
9318 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9323 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9324 component of LHS (a simple array or a record), updating *POS past
9325 the expression, assuming that LHS is contained in CONTAINER. Does
9326 not modify the inferior's memory, nor does it modify LHS (unless
9327 LHS == CONTAINER). */
9330 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9331 struct expression
*exp
, int *pos
)
9333 struct value
*mark
= value_mark ();
9336 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9338 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9339 struct value
*index_val
= value_from_longest (index_type
, index
);
9341 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9345 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9346 elt
= ada_to_fixed_value (elt
);
9349 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9350 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9352 value_assign_to_component (container
, elt
,
9353 ada_evaluate_subexp (NULL
, exp
, pos
,
9356 value_free_to_mark (mark
);
9359 /* Assuming that LHS represents an lvalue having a record or array
9360 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9361 of that aggregate's value to LHS, advancing *POS past the
9362 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9363 lvalue containing LHS (possibly LHS itself). Does not modify
9364 the inferior's memory, nor does it modify the contents of
9365 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9367 static struct value
*
9368 assign_aggregate (struct value
*container
,
9369 struct value
*lhs
, struct expression
*exp
,
9370 int *pos
, enum noside noside
)
9372 struct type
*lhs_type
;
9373 int n
= exp
->elts
[*pos
+1].longconst
;
9374 LONGEST low_index
, high_index
;
9377 int max_indices
, num_indices
;
9381 if (noside
!= EVAL_NORMAL
)
9383 for (i
= 0; i
< n
; i
+= 1)
9384 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9388 container
= ada_coerce_ref (container
);
9389 if (ada_is_direct_array_type (value_type (container
)))
9390 container
= ada_coerce_to_simple_array (container
);
9391 lhs
= ada_coerce_ref (lhs
);
9392 if (!deprecated_value_modifiable (lhs
))
9393 error (_("Left operand of assignment is not a modifiable lvalue."));
9395 lhs_type
= value_type (lhs
);
9396 if (ada_is_direct_array_type (lhs_type
))
9398 lhs
= ada_coerce_to_simple_array (lhs
);
9399 lhs_type
= value_type (lhs
);
9400 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9401 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9403 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9406 high_index
= num_visible_fields (lhs_type
) - 1;
9409 error (_("Left-hand side must be array or record."));
9411 num_specs
= num_component_specs (exp
, *pos
- 3);
9412 max_indices
= 4 * num_specs
+ 4;
9413 indices
= alloca (max_indices
* sizeof (indices
[0]));
9414 indices
[0] = indices
[1] = low_index
- 1;
9415 indices
[2] = indices
[3] = high_index
+ 1;
9418 for (i
= 0; i
< n
; i
+= 1)
9420 switch (exp
->elts
[*pos
].opcode
)
9423 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9424 &num_indices
, max_indices
,
9425 low_index
, high_index
);
9428 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9429 &num_indices
, max_indices
,
9430 low_index
, high_index
);
9434 error (_("Misplaced 'others' clause"));
9435 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9436 num_indices
, low_index
, high_index
);
9439 error (_("Internal error: bad aggregate clause"));
9446 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9447 construct at *POS, updating *POS past the construct, given that
9448 the positions are relative to lower bound LOW, where HIGH is the
9449 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9450 updating *NUM_INDICES as needed. CONTAINER is as for
9451 assign_aggregate. */
9453 aggregate_assign_positional (struct value
*container
,
9454 struct value
*lhs
, struct expression
*exp
,
9455 int *pos
, LONGEST
*indices
, int *num_indices
,
9456 int max_indices
, LONGEST low
, LONGEST high
)
9458 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9460 if (ind
- 1 == high
)
9461 warning (_("Extra components in aggregate ignored."));
9464 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9466 assign_component (container
, lhs
, ind
, exp
, pos
);
9469 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9472 /* Assign into the components of LHS indexed by the OP_CHOICES
9473 construct at *POS, updating *POS past the construct, given that
9474 the allowable indices are LOW..HIGH. Record the indices assigned
9475 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9476 needed. CONTAINER is as for assign_aggregate. */
9478 aggregate_assign_from_choices (struct value
*container
,
9479 struct value
*lhs
, struct expression
*exp
,
9480 int *pos
, LONGEST
*indices
, int *num_indices
,
9481 int max_indices
, LONGEST low
, LONGEST high
)
9484 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9485 int choice_pos
, expr_pc
;
9486 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9488 choice_pos
= *pos
+= 3;
9490 for (j
= 0; j
< n_choices
; j
+= 1)
9491 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9493 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9495 for (j
= 0; j
< n_choices
; j
+= 1)
9497 LONGEST lower
, upper
;
9498 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9500 if (op
== OP_DISCRETE_RANGE
)
9503 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9505 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9510 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9522 name
= &exp
->elts
[choice_pos
+ 2].string
;
9525 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9528 error (_("Invalid record component association."));
9530 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9532 if (! find_struct_field (name
, value_type (lhs
), 0,
9533 NULL
, NULL
, NULL
, NULL
, &ind
))
9534 error (_("Unknown component name: %s."), name
);
9535 lower
= upper
= ind
;
9538 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9539 error (_("Index in component association out of bounds."));
9541 add_component_interval (lower
, upper
, indices
, num_indices
,
9543 while (lower
<= upper
)
9548 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9554 /* Assign the value of the expression in the OP_OTHERS construct in
9555 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9556 have not been previously assigned. The index intervals already assigned
9557 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9558 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9560 aggregate_assign_others (struct value
*container
,
9561 struct value
*lhs
, struct expression
*exp
,
9562 int *pos
, LONGEST
*indices
, int num_indices
,
9563 LONGEST low
, LONGEST high
)
9566 int expr_pc
= *pos
+ 1;
9568 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9572 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9577 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9580 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9583 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9584 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9585 modifying *SIZE as needed. It is an error if *SIZE exceeds
9586 MAX_SIZE. The resulting intervals do not overlap. */
9588 add_component_interval (LONGEST low
, LONGEST high
,
9589 LONGEST
* indices
, int *size
, int max_size
)
9593 for (i
= 0; i
< *size
; i
+= 2) {
9594 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9598 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9599 if (high
< indices
[kh
])
9601 if (low
< indices
[i
])
9603 indices
[i
+ 1] = indices
[kh
- 1];
9604 if (high
> indices
[i
+ 1])
9605 indices
[i
+ 1] = high
;
9606 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9607 *size
-= kh
- i
- 2;
9610 else if (high
< indices
[i
])
9614 if (*size
== max_size
)
9615 error (_("Internal error: miscounted aggregate components."));
9617 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9618 indices
[j
] = indices
[j
- 2];
9620 indices
[i
+ 1] = high
;
9623 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9626 static struct value
*
9627 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9629 if (type
== ada_check_typedef (value_type (arg2
)))
9632 if (ada_is_fixed_point_type (type
))
9633 return (cast_to_fixed (type
, arg2
));
9635 if (ada_is_fixed_point_type (value_type (arg2
)))
9636 return cast_from_fixed (type
, arg2
);
9638 return value_cast (type
, arg2
);
9641 /* Evaluating Ada expressions, and printing their result.
9642 ------------------------------------------------------
9647 We usually evaluate an Ada expression in order to print its value.
9648 We also evaluate an expression in order to print its type, which
9649 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9650 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9651 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9652 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9655 Evaluating expressions is a little more complicated for Ada entities
9656 than it is for entities in languages such as C. The main reason for
9657 this is that Ada provides types whose definition might be dynamic.
9658 One example of such types is variant records. Or another example
9659 would be an array whose bounds can only be known at run time.
9661 The following description is a general guide as to what should be
9662 done (and what should NOT be done) in order to evaluate an expression
9663 involving such types, and when. This does not cover how the semantic
9664 information is encoded by GNAT as this is covered separatly. For the
9665 document used as the reference for the GNAT encoding, see exp_dbug.ads
9666 in the GNAT sources.
9668 Ideally, we should embed each part of this description next to its
9669 associated code. Unfortunately, the amount of code is so vast right
9670 now that it's hard to see whether the code handling a particular
9671 situation might be duplicated or not. One day, when the code is
9672 cleaned up, this guide might become redundant with the comments
9673 inserted in the code, and we might want to remove it.
9675 2. ``Fixing'' an Entity, the Simple Case:
9676 -----------------------------------------
9678 When evaluating Ada expressions, the tricky issue is that they may
9679 reference entities whose type contents and size are not statically
9680 known. Consider for instance a variant record:
9682 type Rec (Empty : Boolean := True) is record
9685 when False => Value : Integer;
9688 Yes : Rec := (Empty => False, Value => 1);
9689 No : Rec := (empty => True);
9691 The size and contents of that record depends on the value of the
9692 descriminant (Rec.Empty). At this point, neither the debugging
9693 information nor the associated type structure in GDB are able to
9694 express such dynamic types. So what the debugger does is to create
9695 "fixed" versions of the type that applies to the specific object.
9696 We also informally refer to this opperation as "fixing" an object,
9697 which means creating its associated fixed type.
9699 Example: when printing the value of variable "Yes" above, its fixed
9700 type would look like this:
9707 On the other hand, if we printed the value of "No", its fixed type
9714 Things become a little more complicated when trying to fix an entity
9715 with a dynamic type that directly contains another dynamic type,
9716 such as an array of variant records, for instance. There are
9717 two possible cases: Arrays, and records.
9719 3. ``Fixing'' Arrays:
9720 ---------------------
9722 The type structure in GDB describes an array in terms of its bounds,
9723 and the type of its elements. By design, all elements in the array
9724 have the same type and we cannot represent an array of variant elements
9725 using the current type structure in GDB. When fixing an array,
9726 we cannot fix the array element, as we would potentially need one
9727 fixed type per element of the array. As a result, the best we can do
9728 when fixing an array is to produce an array whose bounds and size
9729 are correct (allowing us to read it from memory), but without having
9730 touched its element type. Fixing each element will be done later,
9731 when (if) necessary.
9733 Arrays are a little simpler to handle than records, because the same
9734 amount of memory is allocated for each element of the array, even if
9735 the amount of space actually used by each element differs from element
9736 to element. Consider for instance the following array of type Rec:
9738 type Rec_Array is array (1 .. 2) of Rec;
9740 The actual amount of memory occupied by each element might be different
9741 from element to element, depending on the value of their discriminant.
9742 But the amount of space reserved for each element in the array remains
9743 fixed regardless. So we simply need to compute that size using
9744 the debugging information available, from which we can then determine
9745 the array size (we multiply the number of elements of the array by
9746 the size of each element).
9748 The simplest case is when we have an array of a constrained element
9749 type. For instance, consider the following type declarations:
9751 type Bounded_String (Max_Size : Integer) is
9753 Buffer : String (1 .. Max_Size);
9755 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9757 In this case, the compiler describes the array as an array of
9758 variable-size elements (identified by its XVS suffix) for which
9759 the size can be read in the parallel XVZ variable.
9761 In the case of an array of an unconstrained element type, the compiler
9762 wraps the array element inside a private PAD type. This type should not
9763 be shown to the user, and must be "unwrap"'ed before printing. Note
9764 that we also use the adjective "aligner" in our code to designate
9765 these wrapper types.
9767 In some cases, the size allocated for each element is statically
9768 known. In that case, the PAD type already has the correct size,
9769 and the array element should remain unfixed.
9771 But there are cases when this size is not statically known.
9772 For instance, assuming that "Five" is an integer variable:
9774 type Dynamic is array (1 .. Five) of Integer;
9775 type Wrapper (Has_Length : Boolean := False) is record
9778 when True => Length : Integer;
9782 type Wrapper_Array is array (1 .. 2) of Wrapper;
9784 Hello : Wrapper_Array := (others => (Has_Length => True,
9785 Data => (others => 17),
9789 The debugging info would describe variable Hello as being an
9790 array of a PAD type. The size of that PAD type is not statically
9791 known, but can be determined using a parallel XVZ variable.
9792 In that case, a copy of the PAD type with the correct size should
9793 be used for the fixed array.
9795 3. ``Fixing'' record type objects:
9796 ----------------------------------
9798 Things are slightly different from arrays in the case of dynamic
9799 record types. In this case, in order to compute the associated
9800 fixed type, we need to determine the size and offset of each of
9801 its components. This, in turn, requires us to compute the fixed
9802 type of each of these components.
9804 Consider for instance the example:
9806 type Bounded_String (Max_Size : Natural) is record
9807 Str : String (1 .. Max_Size);
9810 My_String : Bounded_String (Max_Size => 10);
9812 In that case, the position of field "Length" depends on the size
9813 of field Str, which itself depends on the value of the Max_Size
9814 discriminant. In order to fix the type of variable My_String,
9815 we need to fix the type of field Str. Therefore, fixing a variant
9816 record requires us to fix each of its components.
9818 However, if a component does not have a dynamic size, the component
9819 should not be fixed. In particular, fields that use a PAD type
9820 should not fixed. Here is an example where this might happen
9821 (assuming type Rec above):
9823 type Container (Big : Boolean) is record
9827 when True => Another : Integer;
9831 My_Container : Container := (Big => False,
9832 First => (Empty => True),
9835 In that example, the compiler creates a PAD type for component First,
9836 whose size is constant, and then positions the component After just
9837 right after it. The offset of component After is therefore constant
9840 The debugger computes the position of each field based on an algorithm
9841 that uses, among other things, the actual position and size of the field
9842 preceding it. Let's now imagine that the user is trying to print
9843 the value of My_Container. If the type fixing was recursive, we would
9844 end up computing the offset of field After based on the size of the
9845 fixed version of field First. And since in our example First has
9846 only one actual field, the size of the fixed type is actually smaller
9847 than the amount of space allocated to that field, and thus we would
9848 compute the wrong offset of field After.
9850 To make things more complicated, we need to watch out for dynamic
9851 components of variant records (identified by the ___XVL suffix in
9852 the component name). Even if the target type is a PAD type, the size
9853 of that type might not be statically known. So the PAD type needs
9854 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9855 we might end up with the wrong size for our component. This can be
9856 observed with the following type declarations:
9858 type Octal is new Integer range 0 .. 7;
9859 type Octal_Array is array (Positive range <>) of Octal;
9860 pragma Pack (Octal_Array);
9862 type Octal_Buffer (Size : Positive) is record
9863 Buffer : Octal_Array (1 .. Size);
9867 In that case, Buffer is a PAD type whose size is unset and needs
9868 to be computed by fixing the unwrapped type.
9870 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9871 ----------------------------------------------------------
9873 Lastly, when should the sub-elements of an entity that remained unfixed
9874 thus far, be actually fixed?
9876 The answer is: Only when referencing that element. For instance
9877 when selecting one component of a record, this specific component
9878 should be fixed at that point in time. Or when printing the value
9879 of a record, each component should be fixed before its value gets
9880 printed. Similarly for arrays, the element of the array should be
9881 fixed when printing each element of the array, or when extracting
9882 one element out of that array. On the other hand, fixing should
9883 not be performed on the elements when taking a slice of an array!
9885 Note that one of the side-effects of miscomputing the offset and
9886 size of each field is that we end up also miscomputing the size
9887 of the containing type. This can have adverse results when computing
9888 the value of an entity. GDB fetches the value of an entity based
9889 on the size of its type, and thus a wrong size causes GDB to fetch
9890 the wrong amount of memory. In the case where the computed size is
9891 too small, GDB fetches too little data to print the value of our
9892 entiry. Results in this case as unpredicatble, as we usually read
9893 past the buffer containing the data =:-o. */
9895 /* Implement the evaluate_exp routine in the exp_descriptor structure
9896 for the Ada language. */
9898 static struct value
*
9899 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
9900 int *pos
, enum noside noside
)
9906 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
9909 struct value
**argvec
;
9913 op
= exp
->elts
[pc
].opcode
;
9919 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9921 if (noside
== EVAL_NORMAL
)
9922 arg1
= unwrap_value (arg1
);
9924 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9925 then we need to perform the conversion manually, because
9926 evaluate_subexp_standard doesn't do it. This conversion is
9927 necessary in Ada because the different kinds of float/fixed
9928 types in Ada have different representations.
9930 Similarly, we need to perform the conversion from OP_LONG
9932 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
9933 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
9939 struct value
*result
;
9942 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9943 /* The result type will have code OP_STRING, bashed there from
9944 OP_ARRAY. Bash it back. */
9945 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
9946 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
9952 type
= exp
->elts
[pc
+ 1].type
;
9953 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
9954 if (noside
== EVAL_SKIP
)
9956 arg1
= ada_value_cast (type
, arg1
, noside
);
9961 type
= exp
->elts
[pc
+ 1].type
;
9962 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
9965 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9966 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9968 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
9969 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9971 return ada_value_assign (arg1
, arg1
);
9973 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9974 except if the lhs of our assignment is a convenience variable.
9975 In the case of assigning to a convenience variable, the lhs
9976 should be exactly the result of the evaluation of the rhs. */
9977 type
= value_type (arg1
);
9978 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9980 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
9981 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9983 if (ada_is_fixed_point_type (value_type (arg1
)))
9984 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
9985 else if (ada_is_fixed_point_type (value_type (arg2
)))
9987 (_("Fixed-point values must be assigned to fixed-point variables"));
9989 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
9990 return ada_value_assign (arg1
, arg2
);
9993 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9994 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9995 if (noside
== EVAL_SKIP
)
9997 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9998 return (value_from_longest
10000 value_as_long (arg1
) + value_as_long (arg2
)));
10001 if ((ada_is_fixed_point_type (value_type (arg1
))
10002 || ada_is_fixed_point_type (value_type (arg2
)))
10003 && value_type (arg1
) != value_type (arg2
))
10004 error (_("Operands of fixed-point addition must have the same type"));
10005 /* Do the addition, and cast the result to the type of the first
10006 argument. We cannot cast the result to a reference type, so if
10007 ARG1 is a reference type, find its underlying type. */
10008 type
= value_type (arg1
);
10009 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10010 type
= TYPE_TARGET_TYPE (type
);
10011 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10012 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10015 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10016 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10017 if (noside
== EVAL_SKIP
)
10019 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10020 return (value_from_longest
10021 (value_type (arg1
),
10022 value_as_long (arg1
) - value_as_long (arg2
)));
10023 if ((ada_is_fixed_point_type (value_type (arg1
))
10024 || ada_is_fixed_point_type (value_type (arg2
)))
10025 && value_type (arg1
) != value_type (arg2
))
10026 error (_("Operands of fixed-point subtraction "
10027 "must have the same type"));
10028 /* Do the substraction, and cast the result to the type of the first
10029 argument. We cannot cast the result to a reference type, so if
10030 ARG1 is a reference type, find its underlying type. */
10031 type
= value_type (arg1
);
10032 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10033 type
= TYPE_TARGET_TYPE (type
);
10034 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10035 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10041 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10042 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10043 if (noside
== EVAL_SKIP
)
10045 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10047 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10048 return value_zero (value_type (arg1
), not_lval
);
10052 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10053 if (ada_is_fixed_point_type (value_type (arg1
)))
10054 arg1
= cast_from_fixed (type
, arg1
);
10055 if (ada_is_fixed_point_type (value_type (arg2
)))
10056 arg2
= cast_from_fixed (type
, arg2
);
10057 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10058 return ada_value_binop (arg1
, arg2
, op
);
10062 case BINOP_NOTEQUAL
:
10063 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10064 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10065 if (noside
== EVAL_SKIP
)
10067 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10071 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10072 tem
= ada_value_equal (arg1
, arg2
);
10074 if (op
== BINOP_NOTEQUAL
)
10076 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10077 return value_from_longest (type
, (LONGEST
) tem
);
10080 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10081 if (noside
== EVAL_SKIP
)
10083 else if (ada_is_fixed_point_type (value_type (arg1
)))
10084 return value_cast (value_type (arg1
), value_neg (arg1
));
10087 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10088 return value_neg (arg1
);
10091 case BINOP_LOGICAL_AND
:
10092 case BINOP_LOGICAL_OR
:
10093 case UNOP_LOGICAL_NOT
:
10098 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10099 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10100 return value_cast (type
, val
);
10103 case BINOP_BITWISE_AND
:
10104 case BINOP_BITWISE_IOR
:
10105 case BINOP_BITWISE_XOR
:
10109 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10111 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10113 return value_cast (value_type (arg1
), val
);
10119 if (noside
== EVAL_SKIP
)
10125 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10126 /* Only encountered when an unresolved symbol occurs in a
10127 context other than a function call, in which case, it is
10129 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10130 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10132 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10134 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10135 /* Check to see if this is a tagged type. We also need to handle
10136 the case where the type is a reference to a tagged type, but
10137 we have to be careful to exclude pointers to tagged types.
10138 The latter should be shown as usual (as a pointer), whereas
10139 a reference should mostly be transparent to the user. */
10140 if (ada_is_tagged_type (type
, 0)
10141 || (TYPE_CODE (type
) == TYPE_CODE_REF
10142 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10144 /* Tagged types are a little special in the fact that the real
10145 type is dynamic and can only be determined by inspecting the
10146 object's tag. This means that we need to get the object's
10147 value first (EVAL_NORMAL) and then extract the actual object
10150 Note that we cannot skip the final step where we extract
10151 the object type from its tag, because the EVAL_NORMAL phase
10152 results in dynamic components being resolved into fixed ones.
10153 This can cause problems when trying to print the type
10154 description of tagged types whose parent has a dynamic size:
10155 We use the type name of the "_parent" component in order
10156 to print the name of the ancestor type in the type description.
10157 If that component had a dynamic size, the resolution into
10158 a fixed type would result in the loss of that type name,
10159 thus preventing us from printing the name of the ancestor
10160 type in the type description. */
10161 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10163 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10165 struct type
*actual_type
;
10167 actual_type
= type_from_tag (ada_value_tag (arg1
));
10168 if (actual_type
== NULL
)
10169 /* If, for some reason, we were unable to determine
10170 the actual type from the tag, then use the static
10171 approximation that we just computed as a fallback.
10172 This can happen if the debugging information is
10173 incomplete, for instance. */
10174 actual_type
= type
;
10175 return value_zero (actual_type
, not_lval
);
10179 /* In the case of a ref, ada_coerce_ref takes care
10180 of determining the actual type. But the evaluation
10181 should return a ref as it should be valid to ask
10182 for its address; so rebuild a ref after coerce. */
10183 arg1
= ada_coerce_ref (arg1
);
10184 return value_ref (arg1
);
10188 /* Records and unions for which GNAT encodings have been
10189 generated need to be statically fixed as well.
10190 Otherwise, non-static fixing produces a type where
10191 all dynamic properties are removed, which prevents "ptype"
10192 from being able to completely describe the type.
10193 For instance, a case statement in a variant record would be
10194 replaced by the relevant components based on the actual
10195 value of the discriminants. */
10196 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10197 && dynamic_template_type (type
) != NULL
)
10198 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10199 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10202 return value_zero (to_static_fixed_type (type
), not_lval
);
10206 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10207 return ada_to_fixed_value (arg1
);
10212 /* Allocate arg vector, including space for the function to be
10213 called in argvec[0] and a terminating NULL. */
10214 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10216 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
10218 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10219 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10220 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10221 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10224 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10225 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10228 if (noside
== EVAL_SKIP
)
10232 if (ada_is_constrained_packed_array_type
10233 (desc_base_type (value_type (argvec
[0]))))
10234 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10235 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10236 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10237 /* This is a packed array that has already been fixed, and
10238 therefore already coerced to a simple array. Nothing further
10241 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
10242 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10243 && VALUE_LVAL (argvec
[0]) == lval_memory
))
10244 argvec
[0] = value_addr (argvec
[0]);
10246 type
= ada_check_typedef (value_type (argvec
[0]));
10248 /* Ada allows us to implicitly dereference arrays when subscripting
10249 them. So, if this is an array typedef (encoding use for array
10250 access types encoded as fat pointers), strip it now. */
10251 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10252 type
= ada_typedef_target_type (type
);
10254 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10256 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10258 case TYPE_CODE_FUNC
:
10259 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10261 case TYPE_CODE_ARRAY
:
10263 case TYPE_CODE_STRUCT
:
10264 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10265 argvec
[0] = ada_value_ind (argvec
[0]);
10266 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10269 error (_("cannot subscript or call something of type `%s'"),
10270 ada_type_name (value_type (argvec
[0])));
10275 switch (TYPE_CODE (type
))
10277 case TYPE_CODE_FUNC
:
10278 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10280 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10282 if (TYPE_GNU_IFUNC (type
))
10283 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10284 return allocate_value (rtype
);
10286 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10287 case TYPE_CODE_INTERNAL_FUNCTION
:
10288 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10289 /* We don't know anything about what the internal
10290 function might return, but we have to return
10292 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10295 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10296 argvec
[0], nargs
, argvec
+ 1);
10298 case TYPE_CODE_STRUCT
:
10302 arity
= ada_array_arity (type
);
10303 type
= ada_array_element_type (type
, nargs
);
10305 error (_("cannot subscript or call a record"));
10306 if (arity
!= nargs
)
10307 error (_("wrong number of subscripts; expecting %d"), arity
);
10308 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10309 return value_zero (ada_aligned_type (type
), lval_memory
);
10311 unwrap_value (ada_value_subscript
10312 (argvec
[0], nargs
, argvec
+ 1));
10314 case TYPE_CODE_ARRAY
:
10315 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10317 type
= ada_array_element_type (type
, nargs
);
10319 error (_("element type of array unknown"));
10321 return value_zero (ada_aligned_type (type
), lval_memory
);
10324 unwrap_value (ada_value_subscript
10325 (ada_coerce_to_simple_array (argvec
[0]),
10326 nargs
, argvec
+ 1));
10327 case TYPE_CODE_PTR
: /* Pointer to array */
10328 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10329 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10331 type
= ada_array_element_type (type
, nargs
);
10333 error (_("element type of array unknown"));
10335 return value_zero (ada_aligned_type (type
), lval_memory
);
10338 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
10339 nargs
, argvec
+ 1));
10342 error (_("Attempt to index or call something other than an "
10343 "array or function"));
10348 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10349 struct value
*low_bound_val
=
10350 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10351 struct value
*high_bound_val
=
10352 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10354 LONGEST high_bound
;
10356 low_bound_val
= coerce_ref (low_bound_val
);
10357 high_bound_val
= coerce_ref (high_bound_val
);
10358 low_bound
= pos_atr (low_bound_val
);
10359 high_bound
= pos_atr (high_bound_val
);
10361 if (noside
== EVAL_SKIP
)
10364 /* If this is a reference to an aligner type, then remove all
10366 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10367 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10368 TYPE_TARGET_TYPE (value_type (array
)) =
10369 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10371 if (ada_is_constrained_packed_array_type (value_type (array
)))
10372 error (_("cannot slice a packed array"));
10374 /* If this is a reference to an array or an array lvalue,
10375 convert to a pointer. */
10376 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10377 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10378 && VALUE_LVAL (array
) == lval_memory
))
10379 array
= value_addr (array
);
10381 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10382 && ada_is_array_descriptor_type (ada_check_typedef
10383 (value_type (array
))))
10384 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10386 array
= ada_coerce_to_simple_array_ptr (array
);
10388 /* If we have more than one level of pointer indirection,
10389 dereference the value until we get only one level. */
10390 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10391 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10393 array
= value_ind (array
);
10395 /* Make sure we really do have an array type before going further,
10396 to avoid a SEGV when trying to get the index type or the target
10397 type later down the road if the debug info generated by
10398 the compiler is incorrect or incomplete. */
10399 if (!ada_is_simple_array_type (value_type (array
)))
10400 error (_("cannot take slice of non-array"));
10402 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10405 struct type
*type0
= ada_check_typedef (value_type (array
));
10407 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10408 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10411 struct type
*arr_type0
=
10412 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10414 return ada_value_slice_from_ptr (array
, arr_type0
,
10415 longest_to_int (low_bound
),
10416 longest_to_int (high_bound
));
10419 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10421 else if (high_bound
< low_bound
)
10422 return empty_array (value_type (array
), low_bound
);
10424 return ada_value_slice (array
, longest_to_int (low_bound
),
10425 longest_to_int (high_bound
));
10428 case UNOP_IN_RANGE
:
10430 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10431 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10433 if (noside
== EVAL_SKIP
)
10436 switch (TYPE_CODE (type
))
10439 lim_warning (_("Membership test incompletely implemented; "
10440 "always returns true"));
10441 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10442 return value_from_longest (type
, (LONGEST
) 1);
10444 case TYPE_CODE_RANGE
:
10445 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10446 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10447 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10448 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10449 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10451 value_from_longest (type
,
10452 (value_less (arg1
, arg3
)
10453 || value_equal (arg1
, arg3
))
10454 && (value_less (arg2
, arg1
)
10455 || value_equal (arg2
, arg1
)));
10458 case BINOP_IN_BOUNDS
:
10460 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10461 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10463 if (noside
== EVAL_SKIP
)
10466 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10468 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10469 return value_zero (type
, not_lval
);
10472 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10474 type
= ada_index_type (value_type (arg2
), tem
, "range");
10476 type
= value_type (arg1
);
10478 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10479 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10481 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10482 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10483 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10485 value_from_longest (type
,
10486 (value_less (arg1
, arg3
)
10487 || value_equal (arg1
, arg3
))
10488 && (value_less (arg2
, arg1
)
10489 || value_equal (arg2
, arg1
)));
10491 case TERNOP_IN_RANGE
:
10492 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10493 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10494 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10496 if (noside
== EVAL_SKIP
)
10499 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10500 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10501 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10503 value_from_longest (type
,
10504 (value_less (arg1
, arg3
)
10505 || value_equal (arg1
, arg3
))
10506 && (value_less (arg2
, arg1
)
10507 || value_equal (arg2
, arg1
)));
10511 case OP_ATR_LENGTH
:
10513 struct type
*type_arg
;
10515 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10517 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10519 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10523 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10527 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10528 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10529 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10532 if (noside
== EVAL_SKIP
)
10535 if (type_arg
== NULL
)
10537 arg1
= ada_coerce_ref (arg1
);
10539 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10540 arg1
= ada_coerce_to_simple_array (arg1
);
10542 if (op
== OP_ATR_LENGTH
)
10543 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10546 type
= ada_index_type (value_type (arg1
), tem
,
10547 ada_attribute_name (op
));
10549 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10552 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10553 return allocate_value (type
);
10557 default: /* Should never happen. */
10558 error (_("unexpected attribute encountered"));
10560 return value_from_longest
10561 (type
, ada_array_bound (arg1
, tem
, 0));
10563 return value_from_longest
10564 (type
, ada_array_bound (arg1
, tem
, 1));
10565 case OP_ATR_LENGTH
:
10566 return value_from_longest
10567 (type
, ada_array_length (arg1
, tem
));
10570 else if (discrete_type_p (type_arg
))
10572 struct type
*range_type
;
10573 const char *name
= ada_type_name (type_arg
);
10576 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10577 range_type
= to_fixed_range_type (type_arg
, NULL
);
10578 if (range_type
== NULL
)
10579 range_type
= type_arg
;
10583 error (_("unexpected attribute encountered"));
10585 return value_from_longest
10586 (range_type
, ada_discrete_type_low_bound (range_type
));
10588 return value_from_longest
10589 (range_type
, ada_discrete_type_high_bound (range_type
));
10590 case OP_ATR_LENGTH
:
10591 error (_("the 'length attribute applies only to array types"));
10594 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10595 error (_("unimplemented type attribute"));
10600 if (ada_is_constrained_packed_array_type (type_arg
))
10601 type_arg
= decode_constrained_packed_array_type (type_arg
);
10603 if (op
== OP_ATR_LENGTH
)
10604 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10607 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10609 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10612 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10613 return allocate_value (type
);
10618 error (_("unexpected attribute encountered"));
10620 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10621 return value_from_longest (type
, low
);
10623 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10624 return value_from_longest (type
, high
);
10625 case OP_ATR_LENGTH
:
10626 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10627 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10628 return value_from_longest (type
, high
- low
+ 1);
10634 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10635 if (noside
== EVAL_SKIP
)
10638 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10639 return value_zero (ada_tag_type (arg1
), not_lval
);
10641 return ada_value_tag (arg1
);
10645 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10646 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10647 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10648 if (noside
== EVAL_SKIP
)
10650 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10651 return value_zero (value_type (arg1
), not_lval
);
10654 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10655 return value_binop (arg1
, arg2
,
10656 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10659 case OP_ATR_MODULUS
:
10661 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10663 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10664 if (noside
== EVAL_SKIP
)
10667 if (!ada_is_modular_type (type_arg
))
10668 error (_("'modulus must be applied to modular type"));
10670 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10671 ada_modulus (type_arg
));
10676 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10677 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10678 if (noside
== EVAL_SKIP
)
10680 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10681 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10682 return value_zero (type
, not_lval
);
10684 return value_pos_atr (type
, arg1
);
10687 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10688 type
= value_type (arg1
);
10690 /* If the argument is a reference, then dereference its type, since
10691 the user is really asking for the size of the actual object,
10692 not the size of the pointer. */
10693 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10694 type
= TYPE_TARGET_TYPE (type
);
10696 if (noside
== EVAL_SKIP
)
10698 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10699 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10701 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10702 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10705 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10706 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10707 type
= exp
->elts
[pc
+ 2].type
;
10708 if (noside
== EVAL_SKIP
)
10710 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10711 return value_zero (type
, not_lval
);
10713 return value_val_atr (type
, arg1
);
10716 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10717 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10718 if (noside
== EVAL_SKIP
)
10720 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10721 return value_zero (value_type (arg1
), not_lval
);
10724 /* For integer exponentiation operations,
10725 only promote the first argument. */
10726 if (is_integral_type (value_type (arg2
)))
10727 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10729 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10731 return value_binop (arg1
, arg2
, op
);
10735 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10736 if (noside
== EVAL_SKIP
)
10742 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10743 if (noside
== EVAL_SKIP
)
10745 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10746 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10747 return value_neg (arg1
);
10752 preeval_pos
= *pos
;
10753 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10754 if (noside
== EVAL_SKIP
)
10756 type
= ada_check_typedef (value_type (arg1
));
10757 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10759 if (ada_is_array_descriptor_type (type
))
10760 /* GDB allows dereferencing GNAT array descriptors. */
10762 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10764 if (arrType
== NULL
)
10765 error (_("Attempt to dereference null array pointer."));
10766 return value_at_lazy (arrType
, 0);
10768 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10769 || TYPE_CODE (type
) == TYPE_CODE_REF
10770 /* In C you can dereference an array to get the 1st elt. */
10771 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10773 /* As mentioned in the OP_VAR_VALUE case, tagged types can
10774 only be determined by inspecting the object's tag.
10775 This means that we need to evaluate completely the
10776 expression in order to get its type. */
10778 if ((TYPE_CODE (type
) == TYPE_CODE_REF
10779 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
10780 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
10782 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10784 type
= value_type (ada_value_ind (arg1
));
10788 type
= to_static_fixed_type
10790 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10793 return value_zero (type
, lval_memory
);
10795 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10797 /* GDB allows dereferencing an int. */
10798 if (expect_type
== NULL
)
10799 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10804 to_static_fixed_type (ada_aligned_type (expect_type
));
10805 return value_zero (expect_type
, lval_memory
);
10809 error (_("Attempt to take contents of a non-pointer value."));
10811 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10812 type
= ada_check_typedef (value_type (arg1
));
10814 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10815 /* GDB allows dereferencing an int. If we were given
10816 the expect_type, then use that as the target type.
10817 Otherwise, assume that the target type is an int. */
10819 if (expect_type
!= NULL
)
10820 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10823 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10824 (CORE_ADDR
) value_as_address (arg1
));
10827 if (ada_is_array_descriptor_type (type
))
10828 /* GDB allows dereferencing GNAT array descriptors. */
10829 return ada_coerce_to_simple_array (arg1
);
10831 return ada_value_ind (arg1
);
10833 case STRUCTOP_STRUCT
:
10834 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10835 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
10836 preeval_pos
= *pos
;
10837 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10838 if (noside
== EVAL_SKIP
)
10840 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10842 struct type
*type1
= value_type (arg1
);
10844 if (ada_is_tagged_type (type1
, 1))
10846 type
= ada_lookup_struct_elt_type (type1
,
10847 &exp
->elts
[pc
+ 2].string
,
10850 /* If the field is not found, check if it exists in the
10851 extension of this object's type. This means that we
10852 need to evaluate completely the expression. */
10856 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10858 arg1
= ada_value_struct_elt (arg1
,
10859 &exp
->elts
[pc
+ 2].string
,
10861 arg1
= unwrap_value (arg1
);
10862 type
= value_type (ada_to_fixed_value (arg1
));
10867 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
10870 return value_zero (ada_aligned_type (type
), lval_memory
);
10873 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
10874 arg1
= unwrap_value (arg1
);
10875 return ada_to_fixed_value (arg1
);
10878 /* The value is not supposed to be used. This is here to make it
10879 easier to accommodate expressions that contain types. */
10881 if (noside
== EVAL_SKIP
)
10883 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10884 return allocate_value (exp
->elts
[pc
+ 1].type
);
10886 error (_("Attempt to use a type name as an expression"));
10891 case OP_DISCRETE_RANGE
:
10892 case OP_POSITIONAL
:
10894 if (noside
== EVAL_NORMAL
)
10898 error (_("Undefined name, ambiguous name, or renaming used in "
10899 "component association: %s."), &exp
->elts
[pc
+2].string
);
10901 error (_("Aggregates only allowed on the right of an assignment"));
10903 internal_error (__FILE__
, __LINE__
,
10904 _("aggregate apparently mangled"));
10907 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10909 for (tem
= 0; tem
< nargs
; tem
+= 1)
10910 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
10915 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
10921 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10922 type name that encodes the 'small and 'delta information.
10923 Otherwise, return NULL. */
10925 static const char *
10926 fixed_type_info (struct type
*type
)
10928 const char *name
= ada_type_name (type
);
10929 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
10931 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
10933 const char *tail
= strstr (name
, "___XF_");
10940 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
10941 return fixed_type_info (TYPE_TARGET_TYPE (type
));
10946 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10949 ada_is_fixed_point_type (struct type
*type
)
10951 return fixed_type_info (type
) != NULL
;
10954 /* Return non-zero iff TYPE represents a System.Address type. */
10957 ada_is_system_address_type (struct type
*type
)
10959 return (TYPE_NAME (type
)
10960 && strcmp (TYPE_NAME (type
), "system__address") == 0);
10963 /* Assuming that TYPE is the representation of an Ada fixed-point
10964 type, return its delta, or -1 if the type is malformed and the
10965 delta cannot be determined. */
10968 ada_delta (struct type
*type
)
10970 const char *encoding
= fixed_type_info (type
);
10973 /* Strictly speaking, num and den are encoded as integer. However,
10974 they may not fit into a long, and they will have to be converted
10975 to DOUBLEST anyway. So scan them as DOUBLEST. */
10976 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10983 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10984 factor ('SMALL value) associated with the type. */
10987 scaling_factor (struct type
*type
)
10989 const char *encoding
= fixed_type_info (type
);
10990 DOUBLEST num0
, den0
, num1
, den1
;
10993 /* Strictly speaking, num's and den's are encoded as integer. However,
10994 they may not fit into a long, and they will have to be converted
10995 to DOUBLEST anyway. So scan them as DOUBLEST. */
10996 n
= sscanf (encoding
,
10997 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
10998 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10999 &num0
, &den0
, &num1
, &den1
);
11004 return num1
/ den1
;
11006 return num0
/ den0
;
11010 /* Assuming that X is the representation of a value of fixed-point
11011 type TYPE, return its floating-point equivalent. */
11014 ada_fixed_to_float (struct type
*type
, LONGEST x
)
11016 return (DOUBLEST
) x
*scaling_factor (type
);
11019 /* The representation of a fixed-point value of type TYPE
11020 corresponding to the value X. */
11023 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
11025 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
11032 /* Scan STR beginning at position K for a discriminant name, and
11033 return the value of that discriminant field of DVAL in *PX. If
11034 PNEW_K is not null, put the position of the character beyond the
11035 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11036 not alter *PX and *PNEW_K if unsuccessful. */
11039 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11042 static char *bound_buffer
= NULL
;
11043 static size_t bound_buffer_len
= 0;
11046 struct value
*bound_val
;
11048 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11051 pend
= strstr (str
+ k
, "__");
11055 k
+= strlen (bound
);
11059 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
11060 bound
= bound_buffer
;
11061 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
11062 bound
[pend
- (str
+ k
)] = '\0';
11066 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11067 if (bound_val
== NULL
)
11070 *px
= value_as_long (bound_val
);
11071 if (pnew_k
!= NULL
)
11076 /* Value of variable named NAME in the current environment. If
11077 no such variable found, then if ERR_MSG is null, returns 0, and
11078 otherwise causes an error with message ERR_MSG. */
11080 static struct value
*
11081 get_var_value (char *name
, char *err_msg
)
11083 struct ada_symbol_info
*syms
;
11086 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11091 if (err_msg
== NULL
)
11094 error (("%s"), err_msg
);
11097 return value_of_variable (syms
[0].sym
, syms
[0].block
);
11100 /* Value of integer variable named NAME in the current environment. If
11101 no such variable found, returns 0, and sets *FLAG to 0. If
11102 successful, sets *FLAG to 1. */
11105 get_int_var_value (char *name
, int *flag
)
11107 struct value
*var_val
= get_var_value (name
, 0);
11119 return value_as_long (var_val
);
11124 /* Return a range type whose base type is that of the range type named
11125 NAME in the current environment, and whose bounds are calculated
11126 from NAME according to the GNAT range encoding conventions.
11127 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11128 corresponding range type from debug information; fall back to using it
11129 if symbol lookup fails. If a new type must be created, allocate it
11130 like ORIG_TYPE was. The bounds information, in general, is encoded
11131 in NAME, the base type given in the named range type. */
11133 static struct type
*
11134 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11137 struct type
*base_type
;
11138 char *subtype_info
;
11140 gdb_assert (raw_type
!= NULL
);
11141 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11143 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11144 base_type
= TYPE_TARGET_TYPE (raw_type
);
11146 base_type
= raw_type
;
11148 name
= TYPE_NAME (raw_type
);
11149 subtype_info
= strstr (name
, "___XD");
11150 if (subtype_info
== NULL
)
11152 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11153 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11155 if (L
< INT_MIN
|| U
> INT_MAX
)
11158 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11163 static char *name_buf
= NULL
;
11164 static size_t name_len
= 0;
11165 int prefix_len
= subtype_info
- name
;
11171 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11172 strncpy (name_buf
, name
, prefix_len
);
11173 name_buf
[prefix_len
] = '\0';
11176 bounds_str
= strchr (subtype_info
, '_');
11179 if (*subtype_info
== 'L')
11181 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11182 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11184 if (bounds_str
[n
] == '_')
11186 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11194 strcpy (name_buf
+ prefix_len
, "___L");
11195 L
= get_int_var_value (name_buf
, &ok
);
11198 lim_warning (_("Unknown lower bound, using 1."));
11203 if (*subtype_info
== 'U')
11205 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11206 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11213 strcpy (name_buf
+ prefix_len
, "___U");
11214 U
= get_int_var_value (name_buf
, &ok
);
11217 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11222 type
= create_static_range_type (alloc_type_copy (raw_type
),
11224 TYPE_NAME (type
) = name
;
11229 /* True iff NAME is the name of a range type. */
11232 ada_is_range_type_name (const char *name
)
11234 return (name
!= NULL
&& strstr (name
, "___XD"));
11238 /* Modular types */
11240 /* True iff TYPE is an Ada modular type. */
11243 ada_is_modular_type (struct type
*type
)
11245 struct type
*subranged_type
= get_base_type (type
);
11247 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11248 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11249 && TYPE_UNSIGNED (subranged_type
));
11252 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11255 ada_modulus (struct type
*type
)
11257 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11261 /* Ada exception catchpoint support:
11262 ---------------------------------
11264 We support 3 kinds of exception catchpoints:
11265 . catchpoints on Ada exceptions
11266 . catchpoints on unhandled Ada exceptions
11267 . catchpoints on failed assertions
11269 Exceptions raised during failed assertions, or unhandled exceptions
11270 could perfectly be caught with the general catchpoint on Ada exceptions.
11271 However, we can easily differentiate these two special cases, and having
11272 the option to distinguish these two cases from the rest can be useful
11273 to zero-in on certain situations.
11275 Exception catchpoints are a specialized form of breakpoint,
11276 since they rely on inserting breakpoints inside known routines
11277 of the GNAT runtime. The implementation therefore uses a standard
11278 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11281 Support in the runtime for exception catchpoints have been changed
11282 a few times already, and these changes affect the implementation
11283 of these catchpoints. In order to be able to support several
11284 variants of the runtime, we use a sniffer that will determine
11285 the runtime variant used by the program being debugged. */
11287 /* Ada's standard exceptions.
11289 The Ada 83 standard also defined Numeric_Error. But there so many
11290 situations where it was unclear from the Ada 83 Reference Manual
11291 (RM) whether Constraint_Error or Numeric_Error should be raised,
11292 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11293 Interpretation saying that anytime the RM says that Numeric_Error
11294 should be raised, the implementation may raise Constraint_Error.
11295 Ada 95 went one step further and pretty much removed Numeric_Error
11296 from the list of standard exceptions (it made it a renaming of
11297 Constraint_Error, to help preserve compatibility when compiling
11298 an Ada83 compiler). As such, we do not include Numeric_Error from
11299 this list of standard exceptions. */
11301 static char *standard_exc
[] = {
11302 "constraint_error",
11308 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11310 /* A structure that describes how to support exception catchpoints
11311 for a given executable. */
11313 struct exception_support_info
11315 /* The name of the symbol to break on in order to insert
11316 a catchpoint on exceptions. */
11317 const char *catch_exception_sym
;
11319 /* The name of the symbol to break on in order to insert
11320 a catchpoint on unhandled exceptions. */
11321 const char *catch_exception_unhandled_sym
;
11323 /* The name of the symbol to break on in order to insert
11324 a catchpoint on failed assertions. */
11325 const char *catch_assert_sym
;
11327 /* Assuming that the inferior just triggered an unhandled exception
11328 catchpoint, this function is responsible for returning the address
11329 in inferior memory where the name of that exception is stored.
11330 Return zero if the address could not be computed. */
11331 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11334 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11335 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11337 /* The following exception support info structure describes how to
11338 implement exception catchpoints with the latest version of the
11339 Ada runtime (as of 2007-03-06). */
11341 static const struct exception_support_info default_exception_support_info
=
11343 "__gnat_debug_raise_exception", /* catch_exception_sym */
11344 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11345 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11346 ada_unhandled_exception_name_addr
11349 /* The following exception support info structure describes how to
11350 implement exception catchpoints with a slightly older version
11351 of the Ada runtime. */
11353 static const struct exception_support_info exception_support_info_fallback
=
11355 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11356 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11357 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11358 ada_unhandled_exception_name_addr_from_raise
11361 /* Return nonzero if we can detect the exception support routines
11362 described in EINFO.
11364 This function errors out if an abnormal situation is detected
11365 (for instance, if we find the exception support routines, but
11366 that support is found to be incomplete). */
11369 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11371 struct symbol
*sym
;
11373 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11374 that should be compiled with debugging information. As a result, we
11375 expect to find that symbol in the symtabs. */
11377 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11380 /* Perhaps we did not find our symbol because the Ada runtime was
11381 compiled without debugging info, or simply stripped of it.
11382 It happens on some GNU/Linux distributions for instance, where
11383 users have to install a separate debug package in order to get
11384 the runtime's debugging info. In that situation, let the user
11385 know why we cannot insert an Ada exception catchpoint.
11387 Note: Just for the purpose of inserting our Ada exception
11388 catchpoint, we could rely purely on the associated minimal symbol.
11389 But we would be operating in degraded mode anyway, since we are
11390 still lacking the debugging info needed later on to extract
11391 the name of the exception being raised (this name is printed in
11392 the catchpoint message, and is also used when trying to catch
11393 a specific exception). We do not handle this case for now. */
11394 struct bound_minimal_symbol msym
11395 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11397 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11398 error (_("Your Ada runtime appears to be missing some debugging "
11399 "information.\nCannot insert Ada exception catchpoint "
11400 "in this configuration."));
11405 /* Make sure that the symbol we found corresponds to a function. */
11407 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11408 error (_("Symbol \"%s\" is not a function (class = %d)"),
11409 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11414 /* Inspect the Ada runtime and determine which exception info structure
11415 should be used to provide support for exception catchpoints.
11417 This function will always set the per-inferior exception_info,
11418 or raise an error. */
11421 ada_exception_support_info_sniffer (void)
11423 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11425 /* If the exception info is already known, then no need to recompute it. */
11426 if (data
->exception_info
!= NULL
)
11429 /* Check the latest (default) exception support info. */
11430 if (ada_has_this_exception_support (&default_exception_support_info
))
11432 data
->exception_info
= &default_exception_support_info
;
11436 /* Try our fallback exception suport info. */
11437 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11439 data
->exception_info
= &exception_support_info_fallback
;
11443 /* Sometimes, it is normal for us to not be able to find the routine
11444 we are looking for. This happens when the program is linked with
11445 the shared version of the GNAT runtime, and the program has not been
11446 started yet. Inform the user of these two possible causes if
11449 if (ada_update_initial_language (language_unknown
) != language_ada
)
11450 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11452 /* If the symbol does not exist, then check that the program is
11453 already started, to make sure that shared libraries have been
11454 loaded. If it is not started, this may mean that the symbol is
11455 in a shared library. */
11457 if (ptid_get_pid (inferior_ptid
) == 0)
11458 error (_("Unable to insert catchpoint. Try to start the program first."));
11460 /* At this point, we know that we are debugging an Ada program and
11461 that the inferior has been started, but we still are not able to
11462 find the run-time symbols. That can mean that we are in
11463 configurable run time mode, or that a-except as been optimized
11464 out by the linker... In any case, at this point it is not worth
11465 supporting this feature. */
11467 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11470 /* True iff FRAME is very likely to be that of a function that is
11471 part of the runtime system. This is all very heuristic, but is
11472 intended to be used as advice as to what frames are uninteresting
11476 is_known_support_routine (struct frame_info
*frame
)
11478 struct symtab_and_line sal
;
11480 enum language func_lang
;
11482 const char *fullname
;
11484 /* If this code does not have any debugging information (no symtab),
11485 This cannot be any user code. */
11487 find_frame_sal (frame
, &sal
);
11488 if (sal
.symtab
== NULL
)
11491 /* If there is a symtab, but the associated source file cannot be
11492 located, then assume this is not user code: Selecting a frame
11493 for which we cannot display the code would not be very helpful
11494 for the user. This should also take care of case such as VxWorks
11495 where the kernel has some debugging info provided for a few units. */
11497 fullname
= symtab_to_fullname (sal
.symtab
);
11498 if (access (fullname
, R_OK
) != 0)
11501 /* Check the unit filename againt the Ada runtime file naming.
11502 We also check the name of the objfile against the name of some
11503 known system libraries that sometimes come with debugging info
11506 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11508 re_comp (known_runtime_file_name_patterns
[i
]);
11509 if (re_exec (lbasename (sal
.symtab
->filename
)))
11511 if (sal
.symtab
->objfile
!= NULL
11512 && re_exec (objfile_name (sal
.symtab
->objfile
)))
11516 /* Check whether the function is a GNAT-generated entity. */
11518 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
11519 if (func_name
== NULL
)
11522 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11524 re_comp (known_auxiliary_function_name_patterns
[i
]);
11525 if (re_exec (func_name
))
11536 /* Find the first frame that contains debugging information and that is not
11537 part of the Ada run-time, starting from FI and moving upward. */
11540 ada_find_printable_frame (struct frame_info
*fi
)
11542 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11544 if (!is_known_support_routine (fi
))
11553 /* Assuming that the inferior just triggered an unhandled exception
11554 catchpoint, return the address in inferior memory where the name
11555 of the exception is stored.
11557 Return zero if the address could not be computed. */
11560 ada_unhandled_exception_name_addr (void)
11562 return parse_and_eval_address ("e.full_name");
11565 /* Same as ada_unhandled_exception_name_addr, except that this function
11566 should be used when the inferior uses an older version of the runtime,
11567 where the exception name needs to be extracted from a specific frame
11568 several frames up in the callstack. */
11571 ada_unhandled_exception_name_addr_from_raise (void)
11574 struct frame_info
*fi
;
11575 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11576 struct cleanup
*old_chain
;
11578 /* To determine the name of this exception, we need to select
11579 the frame corresponding to RAISE_SYM_NAME. This frame is
11580 at least 3 levels up, so we simply skip the first 3 frames
11581 without checking the name of their associated function. */
11582 fi
= get_current_frame ();
11583 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11585 fi
= get_prev_frame (fi
);
11587 old_chain
= make_cleanup (null_cleanup
, NULL
);
11591 enum language func_lang
;
11593 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
11594 if (func_name
!= NULL
)
11596 make_cleanup (xfree
, func_name
);
11598 if (strcmp (func_name
,
11599 data
->exception_info
->catch_exception_sym
) == 0)
11600 break; /* We found the frame we were looking for... */
11601 fi
= get_prev_frame (fi
);
11604 do_cleanups (old_chain
);
11610 return parse_and_eval_address ("id.full_name");
11613 /* Assuming the inferior just triggered an Ada exception catchpoint
11614 (of any type), return the address in inferior memory where the name
11615 of the exception is stored, if applicable.
11617 Return zero if the address could not be computed, or if not relevant. */
11620 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11621 struct breakpoint
*b
)
11623 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11627 case ada_catch_exception
:
11628 return (parse_and_eval_address ("e.full_name"));
11631 case ada_catch_exception_unhandled
:
11632 return data
->exception_info
->unhandled_exception_name_addr ();
11635 case ada_catch_assert
:
11636 return 0; /* Exception name is not relevant in this case. */
11640 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11644 return 0; /* Should never be reached. */
11647 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11648 any error that ada_exception_name_addr_1 might cause to be thrown.
11649 When an error is intercepted, a warning with the error message is printed,
11650 and zero is returned. */
11653 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11654 struct breakpoint
*b
)
11656 volatile struct gdb_exception e
;
11657 CORE_ADDR result
= 0;
11659 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11661 result
= ada_exception_name_addr_1 (ex
, b
);
11666 warning (_("failed to get exception name: %s"), e
.message
);
11673 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11675 /* Ada catchpoints.
11677 In the case of catchpoints on Ada exceptions, the catchpoint will
11678 stop the target on every exception the program throws. When a user
11679 specifies the name of a specific exception, we translate this
11680 request into a condition expression (in text form), and then parse
11681 it into an expression stored in each of the catchpoint's locations.
11682 We then use this condition to check whether the exception that was
11683 raised is the one the user is interested in. If not, then the
11684 target is resumed again. We store the name of the requested
11685 exception, in order to be able to re-set the condition expression
11686 when symbols change. */
11688 /* An instance of this type is used to represent an Ada catchpoint
11689 breakpoint location. It includes a "struct bp_location" as a kind
11690 of base class; users downcast to "struct bp_location *" when
11693 struct ada_catchpoint_location
11695 /* The base class. */
11696 struct bp_location base
;
11698 /* The condition that checks whether the exception that was raised
11699 is the specific exception the user specified on catchpoint
11701 struct expression
*excep_cond_expr
;
11704 /* Implement the DTOR method in the bp_location_ops structure for all
11705 Ada exception catchpoint kinds. */
11708 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11710 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11712 xfree (al
->excep_cond_expr
);
11715 /* The vtable to be used in Ada catchpoint locations. */
11717 static const struct bp_location_ops ada_catchpoint_location_ops
=
11719 ada_catchpoint_location_dtor
11722 /* An instance of this type is used to represent an Ada catchpoint.
11723 It includes a "struct breakpoint" as a kind of base class; users
11724 downcast to "struct breakpoint *" when needed. */
11726 struct ada_catchpoint
11728 /* The base class. */
11729 struct breakpoint base
;
11731 /* The name of the specific exception the user specified. */
11732 char *excep_string
;
11735 /* Parse the exception condition string in the context of each of the
11736 catchpoint's locations, and store them for later evaluation. */
11739 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11741 struct cleanup
*old_chain
;
11742 struct bp_location
*bl
;
11745 /* Nothing to do if there's no specific exception to catch. */
11746 if (c
->excep_string
== NULL
)
11749 /* Same if there are no locations... */
11750 if (c
->base
.loc
== NULL
)
11753 /* Compute the condition expression in text form, from the specific
11754 expection we want to catch. */
11755 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11756 old_chain
= make_cleanup (xfree
, cond_string
);
11758 /* Iterate over all the catchpoint's locations, and parse an
11759 expression for each. */
11760 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11762 struct ada_catchpoint_location
*ada_loc
11763 = (struct ada_catchpoint_location
*) bl
;
11764 struct expression
*exp
= NULL
;
11766 if (!bl
->shlib_disabled
)
11768 volatile struct gdb_exception e
;
11772 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11774 exp
= parse_exp_1 (&s
, bl
->address
,
11775 block_for_pc (bl
->address
), 0);
11779 warning (_("failed to reevaluate internal exception condition "
11780 "for catchpoint %d: %s"),
11781 c
->base
.number
, e
.message
);
11782 /* There is a bug in GCC on sparc-solaris when building with
11783 optimization which causes EXP to change unexpectedly
11784 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
11785 The problem should be fixed starting with GCC 4.9.
11786 In the meantime, work around it by forcing EXP back
11792 ada_loc
->excep_cond_expr
= exp
;
11795 do_cleanups (old_chain
);
11798 /* Implement the DTOR method in the breakpoint_ops structure for all
11799 exception catchpoint kinds. */
11802 dtor_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11804 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11806 xfree (c
->excep_string
);
11808 bkpt_breakpoint_ops
.dtor (b
);
11811 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11812 structure for all exception catchpoint kinds. */
11814 static struct bp_location
*
11815 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
11816 struct breakpoint
*self
)
11818 struct ada_catchpoint_location
*loc
;
11820 loc
= XNEW (struct ada_catchpoint_location
);
11821 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
11822 loc
->excep_cond_expr
= NULL
;
11826 /* Implement the RE_SET method in the breakpoint_ops structure for all
11827 exception catchpoint kinds. */
11830 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11832 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11834 /* Call the base class's method. This updates the catchpoint's
11836 bkpt_breakpoint_ops
.re_set (b
);
11838 /* Reparse the exception conditional expressions. One for each
11840 create_excep_cond_exprs (c
);
11843 /* Returns true if we should stop for this breakpoint hit. If the
11844 user specified a specific exception, we only want to cause a stop
11845 if the program thrown that exception. */
11848 should_stop_exception (const struct bp_location
*bl
)
11850 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
11851 const struct ada_catchpoint_location
*ada_loc
11852 = (const struct ada_catchpoint_location
*) bl
;
11853 volatile struct gdb_exception ex
;
11856 /* With no specific exception, should always stop. */
11857 if (c
->excep_string
== NULL
)
11860 if (ada_loc
->excep_cond_expr
== NULL
)
11862 /* We will have a NULL expression if back when we were creating
11863 the expressions, this location's had failed to parse. */
11868 TRY_CATCH (ex
, RETURN_MASK_ALL
)
11870 struct value
*mark
;
11872 mark
= value_mark ();
11873 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
11874 value_free_to_mark (mark
);
11877 exception_fprintf (gdb_stderr
, ex
,
11878 _("Error in testing exception condition:\n"));
11882 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11883 for all exception catchpoint kinds. */
11886 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
11888 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
11891 /* Implement the PRINT_IT method in the breakpoint_ops structure
11892 for all exception catchpoint kinds. */
11894 static enum print_stop_action
11895 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
11897 struct ui_out
*uiout
= current_uiout
;
11898 struct breakpoint
*b
= bs
->breakpoint_at
;
11900 annotate_catchpoint (b
->number
);
11902 if (ui_out_is_mi_like_p (uiout
))
11904 ui_out_field_string (uiout
, "reason",
11905 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
11906 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
11909 ui_out_text (uiout
,
11910 b
->disposition
== disp_del
? "\nTemporary catchpoint "
11911 : "\nCatchpoint ");
11912 ui_out_field_int (uiout
, "bkptno", b
->number
);
11913 ui_out_text (uiout
, ", ");
11917 case ada_catch_exception
:
11918 case ada_catch_exception_unhandled
:
11920 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
11921 char exception_name
[256];
11925 read_memory (addr
, (gdb_byte
*) exception_name
,
11926 sizeof (exception_name
) - 1);
11927 exception_name
[sizeof (exception_name
) - 1] = '\0';
11931 /* For some reason, we were unable to read the exception
11932 name. This could happen if the Runtime was compiled
11933 without debugging info, for instance. In that case,
11934 just replace the exception name by the generic string
11935 "exception" - it will read as "an exception" in the
11936 notification we are about to print. */
11937 memcpy (exception_name
, "exception", sizeof ("exception"));
11939 /* In the case of unhandled exception breakpoints, we print
11940 the exception name as "unhandled EXCEPTION_NAME", to make
11941 it clearer to the user which kind of catchpoint just got
11942 hit. We used ui_out_text to make sure that this extra
11943 info does not pollute the exception name in the MI case. */
11944 if (ex
== ada_catch_exception_unhandled
)
11945 ui_out_text (uiout
, "unhandled ");
11946 ui_out_field_string (uiout
, "exception-name", exception_name
);
11949 case ada_catch_assert
:
11950 /* In this case, the name of the exception is not really
11951 important. Just print "failed assertion" to make it clearer
11952 that his program just hit an assertion-failure catchpoint.
11953 We used ui_out_text because this info does not belong in
11955 ui_out_text (uiout
, "failed assertion");
11958 ui_out_text (uiout
, " at ");
11959 ada_find_printable_frame (get_current_frame ());
11961 return PRINT_SRC_AND_LOC
;
11964 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11965 for all exception catchpoint kinds. */
11968 print_one_exception (enum ada_exception_catchpoint_kind ex
,
11969 struct breakpoint
*b
, struct bp_location
**last_loc
)
11971 struct ui_out
*uiout
= current_uiout
;
11972 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11973 struct value_print_options opts
;
11975 get_user_print_options (&opts
);
11976 if (opts
.addressprint
)
11978 annotate_field (4);
11979 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
11982 annotate_field (5);
11983 *last_loc
= b
->loc
;
11986 case ada_catch_exception
:
11987 if (c
->excep_string
!= NULL
)
11989 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11991 ui_out_field_string (uiout
, "what", msg
);
11995 ui_out_field_string (uiout
, "what", "all Ada exceptions");
11999 case ada_catch_exception_unhandled
:
12000 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
12003 case ada_catch_assert
:
12004 ui_out_field_string (uiout
, "what", "failed Ada assertions");
12008 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12013 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12014 for all exception catchpoint kinds. */
12017 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12018 struct breakpoint
*b
)
12020 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12021 struct ui_out
*uiout
= current_uiout
;
12023 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
12024 : _("Catchpoint "));
12025 ui_out_field_int (uiout
, "bkptno", b
->number
);
12026 ui_out_text (uiout
, ": ");
12030 case ada_catch_exception
:
12031 if (c
->excep_string
!= NULL
)
12033 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12034 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12036 ui_out_text (uiout
, info
);
12037 do_cleanups (old_chain
);
12040 ui_out_text (uiout
, _("all Ada exceptions"));
12043 case ada_catch_exception_unhandled
:
12044 ui_out_text (uiout
, _("unhandled Ada exceptions"));
12047 case ada_catch_assert
:
12048 ui_out_text (uiout
, _("failed Ada assertions"));
12052 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12057 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12058 for all exception catchpoint kinds. */
12061 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12062 struct breakpoint
*b
, struct ui_file
*fp
)
12064 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12068 case ada_catch_exception
:
12069 fprintf_filtered (fp
, "catch exception");
12070 if (c
->excep_string
!= NULL
)
12071 fprintf_filtered (fp
, " %s", c
->excep_string
);
12074 case ada_catch_exception_unhandled
:
12075 fprintf_filtered (fp
, "catch exception unhandled");
12078 case ada_catch_assert
:
12079 fprintf_filtered (fp
, "catch assert");
12083 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12085 print_recreate_thread (b
, fp
);
12088 /* Virtual table for "catch exception" breakpoints. */
12091 dtor_catch_exception (struct breakpoint
*b
)
12093 dtor_exception (ada_catch_exception
, b
);
12096 static struct bp_location
*
12097 allocate_location_catch_exception (struct breakpoint
*self
)
12099 return allocate_location_exception (ada_catch_exception
, self
);
12103 re_set_catch_exception (struct breakpoint
*b
)
12105 re_set_exception (ada_catch_exception
, b
);
12109 check_status_catch_exception (bpstat bs
)
12111 check_status_exception (ada_catch_exception
, bs
);
12114 static enum print_stop_action
12115 print_it_catch_exception (bpstat bs
)
12117 return print_it_exception (ada_catch_exception
, bs
);
12121 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12123 print_one_exception (ada_catch_exception
, b
, last_loc
);
12127 print_mention_catch_exception (struct breakpoint
*b
)
12129 print_mention_exception (ada_catch_exception
, b
);
12133 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12135 print_recreate_exception (ada_catch_exception
, b
, fp
);
12138 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12140 /* Virtual table for "catch exception unhandled" breakpoints. */
12143 dtor_catch_exception_unhandled (struct breakpoint
*b
)
12145 dtor_exception (ada_catch_exception_unhandled
, b
);
12148 static struct bp_location
*
12149 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12151 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12155 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12157 re_set_exception (ada_catch_exception_unhandled
, b
);
12161 check_status_catch_exception_unhandled (bpstat bs
)
12163 check_status_exception (ada_catch_exception_unhandled
, bs
);
12166 static enum print_stop_action
12167 print_it_catch_exception_unhandled (bpstat bs
)
12169 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12173 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12174 struct bp_location
**last_loc
)
12176 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12180 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12182 print_mention_exception (ada_catch_exception_unhandled
, b
);
12186 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12187 struct ui_file
*fp
)
12189 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12192 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12194 /* Virtual table for "catch assert" breakpoints. */
12197 dtor_catch_assert (struct breakpoint
*b
)
12199 dtor_exception (ada_catch_assert
, b
);
12202 static struct bp_location
*
12203 allocate_location_catch_assert (struct breakpoint
*self
)
12205 return allocate_location_exception (ada_catch_assert
, self
);
12209 re_set_catch_assert (struct breakpoint
*b
)
12211 re_set_exception (ada_catch_assert
, b
);
12215 check_status_catch_assert (bpstat bs
)
12217 check_status_exception (ada_catch_assert
, bs
);
12220 static enum print_stop_action
12221 print_it_catch_assert (bpstat bs
)
12223 return print_it_exception (ada_catch_assert
, bs
);
12227 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12229 print_one_exception (ada_catch_assert
, b
, last_loc
);
12233 print_mention_catch_assert (struct breakpoint
*b
)
12235 print_mention_exception (ada_catch_assert
, b
);
12239 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12241 print_recreate_exception (ada_catch_assert
, b
, fp
);
12244 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12246 /* Return a newly allocated copy of the first space-separated token
12247 in ARGSP, and then adjust ARGSP to point immediately after that
12250 Return NULL if ARGPS does not contain any more tokens. */
12253 ada_get_next_arg (char **argsp
)
12255 char *args
= *argsp
;
12259 args
= skip_spaces (args
);
12260 if (args
[0] == '\0')
12261 return NULL
; /* No more arguments. */
12263 /* Find the end of the current argument. */
12265 end
= skip_to_space (args
);
12267 /* Adjust ARGSP to point to the start of the next argument. */
12271 /* Make a copy of the current argument and return it. */
12273 result
= xmalloc (end
- args
+ 1);
12274 strncpy (result
, args
, end
- args
);
12275 result
[end
- args
] = '\0';
12280 /* Split the arguments specified in a "catch exception" command.
12281 Set EX to the appropriate catchpoint type.
12282 Set EXCEP_STRING to the name of the specific exception if
12283 specified by the user.
12284 If a condition is found at the end of the arguments, the condition
12285 expression is stored in COND_STRING (memory must be deallocated
12286 after use). Otherwise COND_STRING is set to NULL. */
12289 catch_ada_exception_command_split (char *args
,
12290 enum ada_exception_catchpoint_kind
*ex
,
12291 char **excep_string
,
12292 char **cond_string
)
12294 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12295 char *exception_name
;
12298 exception_name
= ada_get_next_arg (&args
);
12299 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12301 /* This is not an exception name; this is the start of a condition
12302 expression for a catchpoint on all exceptions. So, "un-get"
12303 this token, and set exception_name to NULL. */
12304 xfree (exception_name
);
12305 exception_name
= NULL
;
12308 make_cleanup (xfree
, exception_name
);
12310 /* Check to see if we have a condition. */
12312 args
= skip_spaces (args
);
12313 if (strncmp (args
, "if", 2) == 0
12314 && (isspace (args
[2]) || args
[2] == '\0'))
12317 args
= skip_spaces (args
);
12319 if (args
[0] == '\0')
12320 error (_("Condition missing after `if' keyword"));
12321 cond
= xstrdup (args
);
12322 make_cleanup (xfree
, cond
);
12324 args
+= strlen (args
);
12327 /* Check that we do not have any more arguments. Anything else
12330 if (args
[0] != '\0')
12331 error (_("Junk at end of expression"));
12333 discard_cleanups (old_chain
);
12335 if (exception_name
== NULL
)
12337 /* Catch all exceptions. */
12338 *ex
= ada_catch_exception
;
12339 *excep_string
= NULL
;
12341 else if (strcmp (exception_name
, "unhandled") == 0)
12343 /* Catch unhandled exceptions. */
12344 *ex
= ada_catch_exception_unhandled
;
12345 *excep_string
= NULL
;
12349 /* Catch a specific exception. */
12350 *ex
= ada_catch_exception
;
12351 *excep_string
= exception_name
;
12353 *cond_string
= cond
;
12356 /* Return the name of the symbol on which we should break in order to
12357 implement a catchpoint of the EX kind. */
12359 static const char *
12360 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12362 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12364 gdb_assert (data
->exception_info
!= NULL
);
12368 case ada_catch_exception
:
12369 return (data
->exception_info
->catch_exception_sym
);
12371 case ada_catch_exception_unhandled
:
12372 return (data
->exception_info
->catch_exception_unhandled_sym
);
12374 case ada_catch_assert
:
12375 return (data
->exception_info
->catch_assert_sym
);
12378 internal_error (__FILE__
, __LINE__
,
12379 _("unexpected catchpoint kind (%d)"), ex
);
12383 /* Return the breakpoint ops "virtual table" used for catchpoints
12386 static const struct breakpoint_ops
*
12387 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12391 case ada_catch_exception
:
12392 return (&catch_exception_breakpoint_ops
);
12394 case ada_catch_exception_unhandled
:
12395 return (&catch_exception_unhandled_breakpoint_ops
);
12397 case ada_catch_assert
:
12398 return (&catch_assert_breakpoint_ops
);
12401 internal_error (__FILE__
, __LINE__
,
12402 _("unexpected catchpoint kind (%d)"), ex
);
12406 /* Return the condition that will be used to match the current exception
12407 being raised with the exception that the user wants to catch. This
12408 assumes that this condition is used when the inferior just triggered
12409 an exception catchpoint.
12411 The string returned is a newly allocated string that needs to be
12412 deallocated later. */
12415 ada_exception_catchpoint_cond_string (const char *excep_string
)
12419 /* The standard exceptions are a special case. They are defined in
12420 runtime units that have been compiled without debugging info; if
12421 EXCEP_STRING is the not-fully-qualified name of a standard
12422 exception (e.g. "constraint_error") then, during the evaluation
12423 of the condition expression, the symbol lookup on this name would
12424 *not* return this standard exception. The catchpoint condition
12425 may then be set only on user-defined exceptions which have the
12426 same not-fully-qualified name (e.g. my_package.constraint_error).
12428 To avoid this unexcepted behavior, these standard exceptions are
12429 systematically prefixed by "standard". This means that "catch
12430 exception constraint_error" is rewritten into "catch exception
12431 standard.constraint_error".
12433 If an exception named contraint_error is defined in another package of
12434 the inferior program, then the only way to specify this exception as a
12435 breakpoint condition is to use its fully-qualified named:
12436 e.g. my_package.constraint_error. */
12438 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12440 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12442 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12446 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12449 /* Return the symtab_and_line that should be used to insert an exception
12450 catchpoint of the TYPE kind.
12452 EXCEP_STRING should contain the name of a specific exception that
12453 the catchpoint should catch, or NULL otherwise.
12455 ADDR_STRING returns the name of the function where the real
12456 breakpoint that implements the catchpoints is set, depending on the
12457 type of catchpoint we need to create. */
12459 static struct symtab_and_line
12460 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12461 char **addr_string
, const struct breakpoint_ops
**ops
)
12463 const char *sym_name
;
12464 struct symbol
*sym
;
12466 /* First, find out which exception support info to use. */
12467 ada_exception_support_info_sniffer ();
12469 /* Then lookup the function on which we will break in order to catch
12470 the Ada exceptions requested by the user. */
12471 sym_name
= ada_exception_sym_name (ex
);
12472 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12474 /* We can assume that SYM is not NULL at this stage. If the symbol
12475 did not exist, ada_exception_support_info_sniffer would have
12476 raised an exception.
12478 Also, ada_exception_support_info_sniffer should have already
12479 verified that SYM is a function symbol. */
12480 gdb_assert (sym
!= NULL
);
12481 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12483 /* Set ADDR_STRING. */
12484 *addr_string
= xstrdup (sym_name
);
12487 *ops
= ada_exception_breakpoint_ops (ex
);
12489 return find_function_start_sal (sym
, 1);
12492 /* Create an Ada exception catchpoint.
12494 EX_KIND is the kind of exception catchpoint to be created.
12496 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12497 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12498 of the exception to which this catchpoint applies. When not NULL,
12499 the string must be allocated on the heap, and its deallocation
12500 is no longer the responsibility of the caller.
12502 COND_STRING, if not NULL, is the catchpoint condition. This string
12503 must be allocated on the heap, and its deallocation is no longer
12504 the responsibility of the caller.
12506 TEMPFLAG, if nonzero, means that the underlying breakpoint
12507 should be temporary.
12509 FROM_TTY is the usual argument passed to all commands implementations. */
12512 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12513 enum ada_exception_catchpoint_kind ex_kind
,
12514 char *excep_string
,
12520 struct ada_catchpoint
*c
;
12521 char *addr_string
= NULL
;
12522 const struct breakpoint_ops
*ops
= NULL
;
12523 struct symtab_and_line sal
12524 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12526 c
= XNEW (struct ada_catchpoint
);
12527 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
12528 ops
, tempflag
, disabled
, from_tty
);
12529 c
->excep_string
= excep_string
;
12530 create_excep_cond_exprs (c
);
12531 if (cond_string
!= NULL
)
12532 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
12533 install_breakpoint (0, &c
->base
, 1);
12536 /* Implement the "catch exception" command. */
12539 catch_ada_exception_command (char *arg
, int from_tty
,
12540 struct cmd_list_element
*command
)
12542 struct gdbarch
*gdbarch
= get_current_arch ();
12544 enum ada_exception_catchpoint_kind ex_kind
;
12545 char *excep_string
= NULL
;
12546 char *cond_string
= NULL
;
12548 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12552 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12554 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12555 excep_string
, cond_string
,
12556 tempflag
, 1 /* enabled */,
12560 /* Split the arguments specified in a "catch assert" command.
12562 ARGS contains the command's arguments (or the empty string if
12563 no arguments were passed).
12565 If ARGS contains a condition, set COND_STRING to that condition
12566 (the memory needs to be deallocated after use). */
12569 catch_ada_assert_command_split (char *args
, char **cond_string
)
12571 args
= skip_spaces (args
);
12573 /* Check whether a condition was provided. */
12574 if (strncmp (args
, "if", 2) == 0
12575 && (isspace (args
[2]) || args
[2] == '\0'))
12578 args
= skip_spaces (args
);
12579 if (args
[0] == '\0')
12580 error (_("condition missing after `if' keyword"));
12581 *cond_string
= xstrdup (args
);
12584 /* Otherwise, there should be no other argument at the end of
12586 else if (args
[0] != '\0')
12587 error (_("Junk at end of arguments."));
12590 /* Implement the "catch assert" command. */
12593 catch_assert_command (char *arg
, int from_tty
,
12594 struct cmd_list_element
*command
)
12596 struct gdbarch
*gdbarch
= get_current_arch ();
12598 char *cond_string
= NULL
;
12600 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12604 catch_ada_assert_command_split (arg
, &cond_string
);
12605 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12607 tempflag
, 1 /* enabled */,
12611 /* Return non-zero if the symbol SYM is an Ada exception object. */
12614 ada_is_exception_sym (struct symbol
*sym
)
12616 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
12618 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12619 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12620 && SYMBOL_CLASS (sym
) != LOC_CONST
12621 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12622 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12625 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12626 Ada exception object. This matches all exceptions except the ones
12627 defined by the Ada language. */
12630 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12634 if (!ada_is_exception_sym (sym
))
12637 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12638 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
12639 return 0; /* A standard exception. */
12641 /* Numeric_Error is also a standard exception, so exclude it.
12642 See the STANDARD_EXC description for more details as to why
12643 this exception is not listed in that array. */
12644 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
12650 /* A helper function for qsort, comparing two struct ada_exc_info
12653 The comparison is determined first by exception name, and then
12654 by exception address. */
12657 compare_ada_exception_info (const void *a
, const void *b
)
12659 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
12660 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
12663 result
= strcmp (exc_a
->name
, exc_b
->name
);
12667 if (exc_a
->addr
< exc_b
->addr
)
12669 if (exc_a
->addr
> exc_b
->addr
)
12675 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12676 routine, but keeping the first SKIP elements untouched.
12678 All duplicates are also removed. */
12681 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
12684 struct ada_exc_info
*to_sort
12685 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
12687 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
12690 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
12691 compare_ada_exception_info
);
12693 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
12694 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
12695 to_sort
[j
++] = to_sort
[i
];
12697 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
12700 /* A function intended as the "name_matcher" callback in the struct
12701 quick_symbol_functions' expand_symtabs_matching method.
12703 SEARCH_NAME is the symbol's search name.
12705 If USER_DATA is not NULL, it is a pointer to a regext_t object
12706 used to match the symbol (by natural name). Otherwise, when USER_DATA
12707 is null, no filtering is performed, and all symbols are a positive
12711 ada_exc_search_name_matches (const char *search_name
, void *user_data
)
12713 regex_t
*preg
= user_data
;
12718 /* In Ada, the symbol "search name" is a linkage name, whereas
12719 the regular expression used to do the matching refers to
12720 the natural name. So match against the decoded name. */
12721 return (regexec (preg
, ada_decode (search_name
), 0, NULL
, 0) == 0);
12724 /* Add all exceptions defined by the Ada standard whose name match
12725 a regular expression.
12727 If PREG is not NULL, then this regexp_t object is used to
12728 perform the symbol name matching. Otherwise, no name-based
12729 filtering is performed.
12731 EXCEPTIONS is a vector of exceptions to which matching exceptions
12735 ada_add_standard_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12739 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12742 || regexec (preg
, standard_exc
[i
], 0, NULL
, 0) == 0)
12744 struct bound_minimal_symbol msymbol
12745 = ada_lookup_simple_minsym (standard_exc
[i
]);
12747 if (msymbol
.minsym
!= NULL
)
12749 struct ada_exc_info info
12750 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12752 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12758 /* Add all Ada exceptions defined locally and accessible from the given
12761 If PREG is not NULL, then this regexp_t object is used to
12762 perform the symbol name matching. Otherwise, no name-based
12763 filtering is performed.
12765 EXCEPTIONS is a vector of exceptions to which matching exceptions
12769 ada_add_exceptions_from_frame (regex_t
*preg
, struct frame_info
*frame
,
12770 VEC(ada_exc_info
) **exceptions
)
12772 const struct block
*block
= get_frame_block (frame
, 0);
12776 struct block_iterator iter
;
12777 struct symbol
*sym
;
12779 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12781 switch (SYMBOL_CLASS (sym
))
12788 if (ada_is_exception_sym (sym
))
12790 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
12791 SYMBOL_VALUE_ADDRESS (sym
)};
12793 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12797 if (BLOCK_FUNCTION (block
) != NULL
)
12799 block
= BLOCK_SUPERBLOCK (block
);
12803 /* Add all exceptions defined globally whose name name match
12804 a regular expression, excluding standard exceptions.
12806 The reason we exclude standard exceptions is that they need
12807 to be handled separately: Standard exceptions are defined inside
12808 a runtime unit which is normally not compiled with debugging info,
12809 and thus usually do not show up in our symbol search. However,
12810 if the unit was in fact built with debugging info, we need to
12811 exclude them because they would duplicate the entry we found
12812 during the special loop that specifically searches for those
12813 standard exceptions.
12815 If PREG is not NULL, then this regexp_t object is used to
12816 perform the symbol name matching. Otherwise, no name-based
12817 filtering is performed.
12819 EXCEPTIONS is a vector of exceptions to which matching exceptions
12823 ada_add_global_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12825 struct objfile
*objfile
;
12828 expand_symtabs_matching (NULL
, ada_exc_search_name_matches
,
12829 VARIABLES_DOMAIN
, preg
);
12831 ALL_PRIMARY_SYMTABS (objfile
, s
)
12833 const struct blockvector
*bv
= BLOCKVECTOR (s
);
12836 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
12838 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
12839 struct block_iterator iter
;
12840 struct symbol
*sym
;
12842 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
12843 if (ada_is_non_standard_exception_sym (sym
)
12845 || regexec (preg
, SYMBOL_NATURAL_NAME (sym
),
12848 struct ada_exc_info info
12849 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
12851 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12857 /* Implements ada_exceptions_list with the regular expression passed
12858 as a regex_t, rather than a string.
12860 If not NULL, PREG is used to filter out exceptions whose names
12861 do not match. Otherwise, all exceptions are listed. */
12863 static VEC(ada_exc_info
) *
12864 ada_exceptions_list_1 (regex_t
*preg
)
12866 VEC(ada_exc_info
) *result
= NULL
;
12867 struct cleanup
*old_chain
12868 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
12871 /* First, list the known standard exceptions. These exceptions
12872 need to be handled separately, as they are usually defined in
12873 runtime units that have been compiled without debugging info. */
12875 ada_add_standard_exceptions (preg
, &result
);
12877 /* Next, find all exceptions whose scope is local and accessible
12878 from the currently selected frame. */
12880 if (has_stack_frames ())
12882 prev_len
= VEC_length (ada_exc_info
, result
);
12883 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
12885 if (VEC_length (ada_exc_info
, result
) > prev_len
)
12886 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12889 /* Add all exceptions whose scope is global. */
12891 prev_len
= VEC_length (ada_exc_info
, result
);
12892 ada_add_global_exceptions (preg
, &result
);
12893 if (VEC_length (ada_exc_info
, result
) > prev_len
)
12894 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12896 discard_cleanups (old_chain
);
12900 /* Return a vector of ada_exc_info.
12902 If REGEXP is NULL, all exceptions are included in the result.
12903 Otherwise, it should contain a valid regular expression,
12904 and only the exceptions whose names match that regular expression
12905 are included in the result.
12907 The exceptions are sorted in the following order:
12908 - Standard exceptions (defined by the Ada language), in
12909 alphabetical order;
12910 - Exceptions only visible from the current frame, in
12911 alphabetical order;
12912 - Exceptions whose scope is global, in alphabetical order. */
12914 VEC(ada_exc_info
) *
12915 ada_exceptions_list (const char *regexp
)
12917 VEC(ada_exc_info
) *result
= NULL
;
12918 struct cleanup
*old_chain
= NULL
;
12921 if (regexp
!= NULL
)
12922 old_chain
= compile_rx_or_error (®
, regexp
,
12923 _("invalid regular expression"));
12925 result
= ada_exceptions_list_1 (regexp
!= NULL
? ®
: NULL
);
12927 if (old_chain
!= NULL
)
12928 do_cleanups (old_chain
);
12932 /* Implement the "info exceptions" command. */
12935 info_exceptions_command (char *regexp
, int from_tty
)
12937 VEC(ada_exc_info
) *exceptions
;
12938 struct cleanup
*cleanup
;
12939 struct gdbarch
*gdbarch
= get_current_arch ();
12941 struct ada_exc_info
*info
;
12943 exceptions
= ada_exceptions_list (regexp
);
12944 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
12946 if (regexp
!= NULL
)
12948 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
12950 printf_filtered (_("All defined Ada exceptions:\n"));
12952 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
12953 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
12955 do_cleanups (cleanup
);
12959 /* Information about operators given special treatment in functions
12961 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
12963 #define ADA_OPERATORS \
12964 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
12965 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
12966 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
12967 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
12968 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
12969 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
12970 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
12971 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
12972 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
12973 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
12974 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
12975 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
12976 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
12977 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
12978 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
12979 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
12980 OP_DEFN (OP_OTHERS, 1, 1, 0) \
12981 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
12982 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
12985 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
12988 switch (exp
->elts
[pc
- 1].opcode
)
12991 operator_length_standard (exp
, pc
, oplenp
, argsp
);
12994 #define OP_DEFN(op, len, args, binop) \
12995 case op: *oplenp = len; *argsp = args; break;
13001 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13006 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13011 /* Implementation of the exp_descriptor method operator_check. */
13014 ada_operator_check (struct expression
*exp
, int pos
,
13015 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13018 const union exp_element
*const elts
= exp
->elts
;
13019 struct type
*type
= NULL
;
13021 switch (elts
[pos
].opcode
)
13023 case UNOP_IN_RANGE
:
13025 type
= elts
[pos
+ 1].type
;
13029 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13032 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13034 if (type
&& TYPE_OBJFILE (type
)
13035 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13042 ada_op_name (enum exp_opcode opcode
)
13047 return op_name_standard (opcode
);
13049 #define OP_DEFN(op, len, args, binop) case op: return #op;
13054 return "OP_AGGREGATE";
13056 return "OP_CHOICES";
13062 /* As for operator_length, but assumes PC is pointing at the first
13063 element of the operator, and gives meaningful results only for the
13064 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13067 ada_forward_operator_length (struct expression
*exp
, int pc
,
13068 int *oplenp
, int *argsp
)
13070 switch (exp
->elts
[pc
].opcode
)
13073 *oplenp
= *argsp
= 0;
13076 #define OP_DEFN(op, len, args, binop) \
13077 case op: *oplenp = len; *argsp = args; break;
13083 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13088 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13094 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13096 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13104 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13106 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13111 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13115 /* Ada attributes ('Foo). */
13118 case OP_ATR_LENGTH
:
13122 case OP_ATR_MODULUS
:
13129 case UNOP_IN_RANGE
:
13131 /* XXX: gdb_sprint_host_address, type_sprint */
13132 fprintf_filtered (stream
, _("Type @"));
13133 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13134 fprintf_filtered (stream
, " (");
13135 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13136 fprintf_filtered (stream
, ")");
13138 case BINOP_IN_BOUNDS
:
13139 fprintf_filtered (stream
, " (%d)",
13140 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13142 case TERNOP_IN_RANGE
:
13147 case OP_DISCRETE_RANGE
:
13148 case OP_POSITIONAL
:
13155 char *name
= &exp
->elts
[elt
+ 2].string
;
13156 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13158 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13163 return dump_subexp_body_standard (exp
, stream
, elt
);
13167 for (i
= 0; i
< nargs
; i
+= 1)
13168 elt
= dump_subexp (exp
, stream
, elt
);
13173 /* The Ada extension of print_subexp (q.v.). */
13176 ada_print_subexp (struct expression
*exp
, int *pos
,
13177 struct ui_file
*stream
, enum precedence prec
)
13179 int oplen
, nargs
, i
;
13181 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13183 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13190 print_subexp_standard (exp
, pos
, stream
, prec
);
13194 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13197 case BINOP_IN_BOUNDS
:
13198 /* XXX: sprint_subexp */
13199 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13200 fputs_filtered (" in ", stream
);
13201 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13202 fputs_filtered ("'range", stream
);
13203 if (exp
->elts
[pc
+ 1].longconst
> 1)
13204 fprintf_filtered (stream
, "(%ld)",
13205 (long) exp
->elts
[pc
+ 1].longconst
);
13208 case TERNOP_IN_RANGE
:
13209 if (prec
>= PREC_EQUAL
)
13210 fputs_filtered ("(", stream
);
13211 /* XXX: sprint_subexp */
13212 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13213 fputs_filtered (" in ", stream
);
13214 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13215 fputs_filtered (" .. ", stream
);
13216 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13217 if (prec
>= PREC_EQUAL
)
13218 fputs_filtered (")", stream
);
13223 case OP_ATR_LENGTH
:
13227 case OP_ATR_MODULUS
:
13232 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13234 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13235 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13236 &type_print_raw_options
);
13240 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13241 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13246 for (tem
= 1; tem
< nargs
; tem
+= 1)
13248 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13249 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13251 fputs_filtered (")", stream
);
13256 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13257 fputs_filtered ("'(", stream
);
13258 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13259 fputs_filtered (")", stream
);
13262 case UNOP_IN_RANGE
:
13263 /* XXX: sprint_subexp */
13264 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13265 fputs_filtered (" in ", stream
);
13266 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13267 &type_print_raw_options
);
13270 case OP_DISCRETE_RANGE
:
13271 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13272 fputs_filtered ("..", stream
);
13273 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13277 fputs_filtered ("others => ", stream
);
13278 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13282 for (i
= 0; i
< nargs
-1; i
+= 1)
13285 fputs_filtered ("|", stream
);
13286 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13288 fputs_filtered (" => ", stream
);
13289 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13292 case OP_POSITIONAL
:
13293 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13297 fputs_filtered ("(", stream
);
13298 for (i
= 0; i
< nargs
; i
+= 1)
13301 fputs_filtered (", ", stream
);
13302 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13304 fputs_filtered (")", stream
);
13309 /* Table mapping opcodes into strings for printing operators
13310 and precedences of the operators. */
13312 static const struct op_print ada_op_print_tab
[] = {
13313 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13314 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13315 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13316 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13317 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13318 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13319 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13320 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13321 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13322 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13323 {">", BINOP_GTR
, PREC_ORDER
, 0},
13324 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13325 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13326 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13327 {"+", BINOP_ADD
, PREC_ADD
, 0},
13328 {"-", BINOP_SUB
, PREC_ADD
, 0},
13329 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13330 {"*", BINOP_MUL
, PREC_MUL
, 0},
13331 {"/", BINOP_DIV
, PREC_MUL
, 0},
13332 {"rem", BINOP_REM
, PREC_MUL
, 0},
13333 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13334 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13335 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13336 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13337 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13338 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13339 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13340 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13341 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13342 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13343 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13347 enum ada_primitive_types
{
13348 ada_primitive_type_int
,
13349 ada_primitive_type_long
,
13350 ada_primitive_type_short
,
13351 ada_primitive_type_char
,
13352 ada_primitive_type_float
,
13353 ada_primitive_type_double
,
13354 ada_primitive_type_void
,
13355 ada_primitive_type_long_long
,
13356 ada_primitive_type_long_double
,
13357 ada_primitive_type_natural
,
13358 ada_primitive_type_positive
,
13359 ada_primitive_type_system_address
,
13360 nr_ada_primitive_types
13364 ada_language_arch_info (struct gdbarch
*gdbarch
,
13365 struct language_arch_info
*lai
)
13367 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13369 lai
->primitive_type_vector
13370 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13373 lai
->primitive_type_vector
[ada_primitive_type_int
]
13374 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13376 lai
->primitive_type_vector
[ada_primitive_type_long
]
13377 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13378 0, "long_integer");
13379 lai
->primitive_type_vector
[ada_primitive_type_short
]
13380 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13381 0, "short_integer");
13382 lai
->string_char_type
13383 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13384 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13385 lai
->primitive_type_vector
[ada_primitive_type_float
]
13386 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13388 lai
->primitive_type_vector
[ada_primitive_type_double
]
13389 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13390 "long_float", NULL
);
13391 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13392 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13393 0, "long_long_integer");
13394 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13395 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13396 "long_long_float", NULL
);
13397 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13398 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13400 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13401 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13403 lai
->primitive_type_vector
[ada_primitive_type_void
]
13404 = builtin
->builtin_void
;
13406 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13407 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13408 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13409 = "system__address";
13411 lai
->bool_type_symbol
= NULL
;
13412 lai
->bool_type_default
= builtin
->builtin_bool
;
13415 /* Language vector */
13417 /* Not really used, but needed in the ada_language_defn. */
13420 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13422 ada_emit_char (c
, type
, stream
, quoter
, 1);
13426 parse (struct parser_state
*ps
)
13428 warnings_issued
= 0;
13429 return ada_parse (ps
);
13432 static const struct exp_descriptor ada_exp_descriptor
= {
13434 ada_operator_length
,
13435 ada_operator_check
,
13437 ada_dump_subexp_body
,
13438 ada_evaluate_subexp
13441 /* Implement the "la_get_symbol_name_cmp" language_defn method
13444 static symbol_name_cmp_ftype
13445 ada_get_symbol_name_cmp (const char *lookup_name
)
13447 if (should_use_wild_match (lookup_name
))
13450 return compare_names
;
13453 /* Implement the "la_read_var_value" language_defn method for Ada. */
13455 static struct value
*
13456 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
13458 const struct block
*frame_block
= NULL
;
13459 struct symbol
*renaming_sym
= NULL
;
13461 /* The only case where default_read_var_value is not sufficient
13462 is when VAR is a renaming... */
13464 frame_block
= get_frame_block (frame
, NULL
);
13466 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13467 if (renaming_sym
!= NULL
)
13468 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13470 /* This is a typical case where we expect the default_read_var_value
13471 function to work. */
13472 return default_read_var_value (var
, frame
);
13475 const struct language_defn ada_language_defn
= {
13476 "ada", /* Language name */
13480 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13481 that's not quite what this means. */
13483 macro_expansion_no
,
13484 &ada_exp_descriptor
,
13488 ada_printchar
, /* Print a character constant */
13489 ada_printstr
, /* Function to print string constant */
13490 emit_char
, /* Function to print single char (not used) */
13491 ada_print_type
, /* Print a type using appropriate syntax */
13492 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13493 ada_val_print
, /* Print a value using appropriate syntax */
13494 ada_value_print
, /* Print a top-level value */
13495 ada_read_var_value
, /* la_read_var_value */
13496 NULL
, /* Language specific skip_trampoline */
13497 NULL
, /* name_of_this */
13498 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13499 basic_lookup_transparent_type
, /* lookup_transparent_type */
13500 ada_la_decode
, /* Language specific symbol demangler */
13501 NULL
, /* Language specific
13502 class_name_from_physname */
13503 ada_op_print_tab
, /* expression operators for printing */
13504 0, /* c-style arrays */
13505 1, /* String lower bound */
13506 ada_get_gdb_completer_word_break_characters
,
13507 ada_make_symbol_completion_list
,
13508 ada_language_arch_info
,
13509 ada_print_array_index
,
13510 default_pass_by_reference
,
13512 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13513 ada_iterate_over_symbols
,
13518 /* Provide a prototype to silence -Wmissing-prototypes. */
13519 extern initialize_file_ftype _initialize_ada_language
;
13521 /* Command-list for the "set/show ada" prefix command. */
13522 static struct cmd_list_element
*set_ada_list
;
13523 static struct cmd_list_element
*show_ada_list
;
13525 /* Implement the "set ada" prefix command. */
13528 set_ada_command (char *arg
, int from_tty
)
13530 printf_unfiltered (_(\
13531 "\"set ada\" must be followed by the name of a setting.\n"));
13532 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
13535 /* Implement the "show ada" prefix command. */
13538 show_ada_command (char *args
, int from_tty
)
13540 cmd_show_list (show_ada_list
, from_tty
, "");
13544 initialize_ada_catchpoint_ops (void)
13546 struct breakpoint_ops
*ops
;
13548 initialize_breakpoint_ops ();
13550 ops
= &catch_exception_breakpoint_ops
;
13551 *ops
= bkpt_breakpoint_ops
;
13552 ops
->dtor
= dtor_catch_exception
;
13553 ops
->allocate_location
= allocate_location_catch_exception
;
13554 ops
->re_set
= re_set_catch_exception
;
13555 ops
->check_status
= check_status_catch_exception
;
13556 ops
->print_it
= print_it_catch_exception
;
13557 ops
->print_one
= print_one_catch_exception
;
13558 ops
->print_mention
= print_mention_catch_exception
;
13559 ops
->print_recreate
= print_recreate_catch_exception
;
13561 ops
= &catch_exception_unhandled_breakpoint_ops
;
13562 *ops
= bkpt_breakpoint_ops
;
13563 ops
->dtor
= dtor_catch_exception_unhandled
;
13564 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
13565 ops
->re_set
= re_set_catch_exception_unhandled
;
13566 ops
->check_status
= check_status_catch_exception_unhandled
;
13567 ops
->print_it
= print_it_catch_exception_unhandled
;
13568 ops
->print_one
= print_one_catch_exception_unhandled
;
13569 ops
->print_mention
= print_mention_catch_exception_unhandled
;
13570 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
13572 ops
= &catch_assert_breakpoint_ops
;
13573 *ops
= bkpt_breakpoint_ops
;
13574 ops
->dtor
= dtor_catch_assert
;
13575 ops
->allocate_location
= allocate_location_catch_assert
;
13576 ops
->re_set
= re_set_catch_assert
;
13577 ops
->check_status
= check_status_catch_assert
;
13578 ops
->print_it
= print_it_catch_assert
;
13579 ops
->print_one
= print_one_catch_assert
;
13580 ops
->print_mention
= print_mention_catch_assert
;
13581 ops
->print_recreate
= print_recreate_catch_assert
;
13584 /* This module's 'new_objfile' observer. */
13587 ada_new_objfile_observer (struct objfile
*objfile
)
13589 ada_clear_symbol_cache ();
13592 /* This module's 'free_objfile' observer. */
13595 ada_free_objfile_observer (struct objfile
*objfile
)
13597 ada_clear_symbol_cache ();
13601 _initialize_ada_language (void)
13603 add_language (&ada_language_defn
);
13605 initialize_ada_catchpoint_ops ();
13607 add_prefix_cmd ("ada", no_class
, set_ada_command
,
13608 _("Prefix command for changing Ada-specfic settings"),
13609 &set_ada_list
, "set ada ", 0, &setlist
);
13611 add_prefix_cmd ("ada", no_class
, show_ada_command
,
13612 _("Generic command for showing Ada-specific settings."),
13613 &show_ada_list
, "show ada ", 0, &showlist
);
13615 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
13616 &trust_pad_over_xvs
, _("\
13617 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13618 Show whether an optimization trusting PAD types over XVS types is activated"),
13620 This is related to the encoding used by the GNAT compiler. The debugger\n\
13621 should normally trust the contents of PAD types, but certain older versions\n\
13622 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13623 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13624 work around this bug. It is always safe to turn this option \"off\", but\n\
13625 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13626 this option to \"off\" unless necessary."),
13627 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13629 add_catch_command ("exception", _("\
13630 Catch Ada exceptions, when raised.\n\
13631 With an argument, catch only exceptions with the given name."),
13632 catch_ada_exception_command
,
13636 add_catch_command ("assert", _("\
13637 Catch failed Ada assertions, when raised.\n\
13638 With an argument, catch only exceptions with the given name."),
13639 catch_assert_command
,
13644 varsize_limit
= 65536;
13646 add_info ("exceptions", info_exceptions_command
,
13648 List all Ada exception names.\n\
13649 If a regular expression is passed as an argument, only those matching\n\
13650 the regular expression are listed."));
13652 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
13653 _("Set Ada maintenance-related variables."),
13654 &maint_set_ada_cmdlist
, "maintenance set ada ",
13655 0/*allow-unknown*/, &maintenance_set_cmdlist
);
13657 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
13658 _("Show Ada maintenance-related variables"),
13659 &maint_show_ada_cmdlist
, "maintenance show ada ",
13660 0/*allow-unknown*/, &maintenance_show_cmdlist
);
13662 add_setshow_boolean_cmd
13663 ("ignore-descriptive-types", class_maintenance
,
13664 &ada_ignore_descriptive_types_p
,
13665 _("Set whether descriptive types generated by GNAT should be ignored."),
13666 _("Show whether descriptive types generated by GNAT should be ignored."),
13668 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13669 DWARF attribute."),
13670 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
13672 obstack_init (&symbol_list_obstack
);
13674 decoded_names_store
= htab_create_alloc
13675 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
13676 NULL
, xcalloc
, xfree
);
13678 /* The ada-lang observers. */
13679 observer_attach_new_objfile (ada_new_objfile_observer
);
13680 observer_attach_free_objfile (ada_free_objfile_observer
);
13681 observer_attach_inferior_exit (ada_inferior_exit
);
13683 /* Setup various context-specific data. */
13685 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
13686 ada_pspace_data_handle
13687 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);